Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Support routines for manipulating internal types for GDB. |
4f2aea11 | 2 | |
42a4f53d | 3 | Copyright (C) 1992-2019 Free Software Foundation, Inc. |
4f2aea11 | 4 | |
c906108c SS |
5 | Contributed by Cygnus Support, using pieces from other GDB modules. |
6 | ||
c5aa993b | 7 | This file is part of GDB. |
c906108c | 8 | |
c5aa993b JM |
9 | This program is free software; you can redistribute it and/or modify |
10 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 11 | the Free Software Foundation; either version 3 of the License, or |
c5aa993b | 12 | (at your option) any later version. |
c906108c | 13 | |
c5aa993b JM |
14 | This program is distributed in the hope that it will be useful, |
15 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | GNU General Public License for more details. | |
c906108c | 18 | |
c5aa993b | 19 | You should have received a copy of the GNU General Public License |
a9762ec7 | 20 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
c906108c SS |
21 | |
22 | #include "defs.h" | |
c906108c SS |
23 | #include "bfd.h" |
24 | #include "symtab.h" | |
25 | #include "symfile.h" | |
26 | #include "objfiles.h" | |
27 | #include "gdbtypes.h" | |
28 | #include "expression.h" | |
29 | #include "language.h" | |
30 | #include "target.h" | |
31 | #include "value.h" | |
32 | #include "demangle.h" | |
33 | #include "complaints.h" | |
34 | #include "gdbcmd.h" | |
015a42b4 | 35 | #include "cp-abi.h" |
ae5a43e0 | 36 | #include "hashtab.h" |
8de20a37 | 37 | #include "cp-support.h" |
ca092b61 DE |
38 | #include "bcache.h" |
39 | #include "dwarf2loc.h" | |
80180f79 | 40 | #include "gdbcore.h" |
1841ee5d | 41 | #include "floatformat.h" |
ac3aafc7 | 42 | |
6403aeea SW |
43 | /* Initialize BADNESS constants. */ |
44 | ||
a9d5ef47 | 45 | const struct rank LENGTH_MISMATCH_BADNESS = {100,0}; |
6403aeea | 46 | |
a9d5ef47 SW |
47 | const struct rank TOO_FEW_PARAMS_BADNESS = {100,0}; |
48 | const struct rank INCOMPATIBLE_TYPE_BADNESS = {100,0}; | |
6403aeea | 49 | |
a9d5ef47 | 50 | const struct rank EXACT_MATCH_BADNESS = {0,0}; |
6403aeea | 51 | |
a9d5ef47 SW |
52 | const struct rank INTEGER_PROMOTION_BADNESS = {1,0}; |
53 | const struct rank FLOAT_PROMOTION_BADNESS = {1,0}; | |
54 | const struct rank BASE_PTR_CONVERSION_BADNESS = {1,0}; | |
e15c3eb4 | 55 | const struct rank CV_CONVERSION_BADNESS = {1, 0}; |
a9d5ef47 SW |
56 | const struct rank INTEGER_CONVERSION_BADNESS = {2,0}; |
57 | const struct rank FLOAT_CONVERSION_BADNESS = {2,0}; | |
58 | const struct rank INT_FLOAT_CONVERSION_BADNESS = {2,0}; | |
59 | const struct rank VOID_PTR_CONVERSION_BADNESS = {2,0}; | |
5b4f6e25 | 60 | const struct rank BOOL_CONVERSION_BADNESS = {3,0}; |
a9d5ef47 SW |
61 | const struct rank BASE_CONVERSION_BADNESS = {2,0}; |
62 | const struct rank REFERENCE_CONVERSION_BADNESS = {2,0}; | |
da096638 | 63 | const struct rank NULL_POINTER_CONVERSION_BADNESS = {2,0}; |
a9d5ef47 | 64 | const struct rank NS_POINTER_CONVERSION_BADNESS = {10,0}; |
a451cb65 | 65 | const struct rank NS_INTEGER_POINTER_CONVERSION_BADNESS = {3,0}; |
6403aeea | 66 | |
8da61cc4 | 67 | /* Floatformat pairs. */ |
f9e9243a UW |
68 | const struct floatformat *floatformats_ieee_half[BFD_ENDIAN_UNKNOWN] = { |
69 | &floatformat_ieee_half_big, | |
70 | &floatformat_ieee_half_little | |
71 | }; | |
8da61cc4 DJ |
72 | const struct floatformat *floatformats_ieee_single[BFD_ENDIAN_UNKNOWN] = { |
73 | &floatformat_ieee_single_big, | |
74 | &floatformat_ieee_single_little | |
75 | }; | |
76 | const struct floatformat *floatformats_ieee_double[BFD_ENDIAN_UNKNOWN] = { | |
77 | &floatformat_ieee_double_big, | |
78 | &floatformat_ieee_double_little | |
79 | }; | |
80 | const struct floatformat *floatformats_ieee_double_littlebyte_bigword[BFD_ENDIAN_UNKNOWN] = { | |
81 | &floatformat_ieee_double_big, | |
82 | &floatformat_ieee_double_littlebyte_bigword | |
83 | }; | |
84 | const struct floatformat *floatformats_i387_ext[BFD_ENDIAN_UNKNOWN] = { | |
85 | &floatformat_i387_ext, | |
86 | &floatformat_i387_ext | |
87 | }; | |
88 | const struct floatformat *floatformats_m68881_ext[BFD_ENDIAN_UNKNOWN] = { | |
89 | &floatformat_m68881_ext, | |
90 | &floatformat_m68881_ext | |
91 | }; | |
92 | const struct floatformat *floatformats_arm_ext[BFD_ENDIAN_UNKNOWN] = { | |
93 | &floatformat_arm_ext_big, | |
94 | &floatformat_arm_ext_littlebyte_bigword | |
95 | }; | |
96 | const struct floatformat *floatformats_ia64_spill[BFD_ENDIAN_UNKNOWN] = { | |
97 | &floatformat_ia64_spill_big, | |
98 | &floatformat_ia64_spill_little | |
99 | }; | |
100 | const struct floatformat *floatformats_ia64_quad[BFD_ENDIAN_UNKNOWN] = { | |
101 | &floatformat_ia64_quad_big, | |
102 | &floatformat_ia64_quad_little | |
103 | }; | |
104 | const struct floatformat *floatformats_vax_f[BFD_ENDIAN_UNKNOWN] = { | |
105 | &floatformat_vax_f, | |
106 | &floatformat_vax_f | |
107 | }; | |
108 | const struct floatformat *floatformats_vax_d[BFD_ENDIAN_UNKNOWN] = { | |
109 | &floatformat_vax_d, | |
110 | &floatformat_vax_d | |
111 | }; | |
b14d30e1 | 112 | const struct floatformat *floatformats_ibm_long_double[BFD_ENDIAN_UNKNOWN] = { |
f5aee5ee AM |
113 | &floatformat_ibm_long_double_big, |
114 | &floatformat_ibm_long_double_little | |
b14d30e1 | 115 | }; |
8da61cc4 | 116 | |
2873700e KS |
117 | /* Should opaque types be resolved? */ |
118 | ||
491144b5 | 119 | static bool opaque_type_resolution = true; |
2873700e | 120 | |
79bb1944 | 121 | /* See gdbtypes.h. */ |
2873700e KS |
122 | |
123 | unsigned int overload_debug = 0; | |
124 | ||
a451cb65 KS |
125 | /* A flag to enable strict type checking. */ |
126 | ||
491144b5 | 127 | static bool strict_type_checking = true; |
a451cb65 | 128 | |
2873700e | 129 | /* A function to show whether opaque types are resolved. */ |
5212577a | 130 | |
920d2a44 AC |
131 | static void |
132 | show_opaque_type_resolution (struct ui_file *file, int from_tty, | |
7ba81444 MS |
133 | struct cmd_list_element *c, |
134 | const char *value) | |
920d2a44 | 135 | { |
3e43a32a MS |
136 | fprintf_filtered (file, _("Resolution of opaque struct/class/union types " |
137 | "(if set before loading symbols) is %s.\n"), | |
920d2a44 AC |
138 | value); |
139 | } | |
140 | ||
2873700e | 141 | /* A function to show whether C++ overload debugging is enabled. */ |
5212577a | 142 | |
920d2a44 AC |
143 | static void |
144 | show_overload_debug (struct ui_file *file, int from_tty, | |
145 | struct cmd_list_element *c, const char *value) | |
146 | { | |
7ba81444 MS |
147 | fprintf_filtered (file, _("Debugging of C++ overloading is %s.\n"), |
148 | value); | |
920d2a44 | 149 | } |
c906108c | 150 | |
a451cb65 KS |
151 | /* A function to show the status of strict type checking. */ |
152 | ||
153 | static void | |
154 | show_strict_type_checking (struct ui_file *file, int from_tty, | |
155 | struct cmd_list_element *c, const char *value) | |
156 | { | |
157 | fprintf_filtered (file, _("Strict type checking is %s.\n"), value); | |
158 | } | |
159 | ||
5212577a | 160 | \f |
e9bb382b UW |
161 | /* Allocate a new OBJFILE-associated type structure and fill it |
162 | with some defaults. Space for the type structure is allocated | |
163 | on the objfile's objfile_obstack. */ | |
c906108c SS |
164 | |
165 | struct type * | |
fba45db2 | 166 | alloc_type (struct objfile *objfile) |
c906108c | 167 | { |
52f0bd74 | 168 | struct type *type; |
c906108c | 169 | |
e9bb382b UW |
170 | gdb_assert (objfile != NULL); |
171 | ||
7ba81444 | 172 | /* Alloc the structure and start off with all fields zeroed. */ |
e9bb382b UW |
173 | type = OBSTACK_ZALLOC (&objfile->objfile_obstack, struct type); |
174 | TYPE_MAIN_TYPE (type) = OBSTACK_ZALLOC (&objfile->objfile_obstack, | |
175 | struct main_type); | |
176 | OBJSTAT (objfile, n_types++); | |
c906108c | 177 | |
e9bb382b UW |
178 | TYPE_OBJFILE_OWNED (type) = 1; |
179 | TYPE_OWNER (type).objfile = objfile; | |
c906108c | 180 | |
7ba81444 | 181 | /* Initialize the fields that might not be zero. */ |
c906108c SS |
182 | |
183 | TYPE_CODE (type) = TYPE_CODE_UNDEF; | |
2fdde8f8 | 184 | TYPE_CHAIN (type) = type; /* Chain back to itself. */ |
c906108c | 185 | |
c16abbde | 186 | return type; |
c906108c SS |
187 | } |
188 | ||
e9bb382b UW |
189 | /* Allocate a new GDBARCH-associated type structure and fill it |
190 | with some defaults. Space for the type structure is allocated | |
8f57eec2 | 191 | on the obstack associated with GDBARCH. */ |
e9bb382b UW |
192 | |
193 | struct type * | |
194 | alloc_type_arch (struct gdbarch *gdbarch) | |
195 | { | |
196 | struct type *type; | |
197 | ||
198 | gdb_assert (gdbarch != NULL); | |
199 | ||
200 | /* Alloc the structure and start off with all fields zeroed. */ | |
201 | ||
8f57eec2 PP |
202 | type = GDBARCH_OBSTACK_ZALLOC (gdbarch, struct type); |
203 | TYPE_MAIN_TYPE (type) = GDBARCH_OBSTACK_ZALLOC (gdbarch, struct main_type); | |
e9bb382b UW |
204 | |
205 | TYPE_OBJFILE_OWNED (type) = 0; | |
206 | TYPE_OWNER (type).gdbarch = gdbarch; | |
207 | ||
208 | /* Initialize the fields that might not be zero. */ | |
209 | ||
210 | TYPE_CODE (type) = TYPE_CODE_UNDEF; | |
e9bb382b UW |
211 | TYPE_CHAIN (type) = type; /* Chain back to itself. */ |
212 | ||
213 | return type; | |
214 | } | |
215 | ||
216 | /* If TYPE is objfile-associated, allocate a new type structure | |
217 | associated with the same objfile. If TYPE is gdbarch-associated, | |
218 | allocate a new type structure associated with the same gdbarch. */ | |
219 | ||
220 | struct type * | |
221 | alloc_type_copy (const struct type *type) | |
222 | { | |
223 | if (TYPE_OBJFILE_OWNED (type)) | |
224 | return alloc_type (TYPE_OWNER (type).objfile); | |
225 | else | |
226 | return alloc_type_arch (TYPE_OWNER (type).gdbarch); | |
227 | } | |
228 | ||
229 | /* If TYPE is gdbarch-associated, return that architecture. | |
230 | If TYPE is objfile-associated, return that objfile's architecture. */ | |
231 | ||
232 | struct gdbarch * | |
233 | get_type_arch (const struct type *type) | |
234 | { | |
2fabdf33 AB |
235 | struct gdbarch *arch; |
236 | ||
e9bb382b | 237 | if (TYPE_OBJFILE_OWNED (type)) |
2fabdf33 | 238 | arch = get_objfile_arch (TYPE_OWNER (type).objfile); |
e9bb382b | 239 | else |
2fabdf33 AB |
240 | arch = TYPE_OWNER (type).gdbarch; |
241 | ||
242 | /* The ARCH can be NULL if TYPE is associated with neither an objfile nor | |
243 | a gdbarch, however, this is very rare, and even then, in most cases | |
244 | that get_type_arch is called, we assume that a non-NULL value is | |
245 | returned. */ | |
246 | gdb_assert (arch != NULL); | |
247 | return arch; | |
e9bb382b UW |
248 | } |
249 | ||
99ad9427 YQ |
250 | /* See gdbtypes.h. */ |
251 | ||
252 | struct type * | |
253 | get_target_type (struct type *type) | |
254 | { | |
255 | if (type != NULL) | |
256 | { | |
257 | type = TYPE_TARGET_TYPE (type); | |
258 | if (type != NULL) | |
259 | type = check_typedef (type); | |
260 | } | |
261 | ||
262 | return type; | |
263 | } | |
264 | ||
2e056931 SM |
265 | /* See gdbtypes.h. */ |
266 | ||
267 | unsigned int | |
268 | type_length_units (struct type *type) | |
269 | { | |
270 | struct gdbarch *arch = get_type_arch (type); | |
271 | int unit_size = gdbarch_addressable_memory_unit_size (arch); | |
272 | ||
273 | return TYPE_LENGTH (type) / unit_size; | |
274 | } | |
275 | ||
2fdde8f8 DJ |
276 | /* Alloc a new type instance structure, fill it with some defaults, |
277 | and point it at OLDTYPE. Allocate the new type instance from the | |
278 | same place as OLDTYPE. */ | |
279 | ||
280 | static struct type * | |
281 | alloc_type_instance (struct type *oldtype) | |
282 | { | |
283 | struct type *type; | |
284 | ||
285 | /* Allocate the structure. */ | |
286 | ||
e9bb382b | 287 | if (! TYPE_OBJFILE_OWNED (oldtype)) |
2fabdf33 | 288 | type = GDBARCH_OBSTACK_ZALLOC (get_type_arch (oldtype), struct type); |
2fdde8f8 | 289 | else |
1deafd4e PA |
290 | type = OBSTACK_ZALLOC (&TYPE_OBJFILE (oldtype)->objfile_obstack, |
291 | struct type); | |
292 | ||
2fdde8f8 DJ |
293 | TYPE_MAIN_TYPE (type) = TYPE_MAIN_TYPE (oldtype); |
294 | ||
295 | TYPE_CHAIN (type) = type; /* Chain back to itself for now. */ | |
296 | ||
c16abbde | 297 | return type; |
2fdde8f8 DJ |
298 | } |
299 | ||
300 | /* Clear all remnants of the previous type at TYPE, in preparation for | |
e9bb382b | 301 | replacing it with something else. Preserve owner information. */ |
5212577a | 302 | |
2fdde8f8 DJ |
303 | static void |
304 | smash_type (struct type *type) | |
305 | { | |
e9bb382b UW |
306 | int objfile_owned = TYPE_OBJFILE_OWNED (type); |
307 | union type_owner owner = TYPE_OWNER (type); | |
308 | ||
2fdde8f8 DJ |
309 | memset (TYPE_MAIN_TYPE (type), 0, sizeof (struct main_type)); |
310 | ||
e9bb382b UW |
311 | /* Restore owner information. */ |
312 | TYPE_OBJFILE_OWNED (type) = objfile_owned; | |
313 | TYPE_OWNER (type) = owner; | |
314 | ||
2fdde8f8 DJ |
315 | /* For now, delete the rings. */ |
316 | TYPE_CHAIN (type) = type; | |
317 | ||
318 | /* For now, leave the pointer/reference types alone. */ | |
319 | } | |
320 | ||
c906108c SS |
321 | /* Lookup a pointer to a type TYPE. TYPEPTR, if nonzero, points |
322 | to a pointer to memory where the pointer type should be stored. | |
323 | If *TYPEPTR is zero, update it to point to the pointer type we return. | |
324 | We allocate new memory if needed. */ | |
325 | ||
326 | struct type * | |
fba45db2 | 327 | make_pointer_type (struct type *type, struct type **typeptr) |
c906108c | 328 | { |
52f0bd74 | 329 | struct type *ntype; /* New type */ |
053cb41b | 330 | struct type *chain; |
c906108c SS |
331 | |
332 | ntype = TYPE_POINTER_TYPE (type); | |
333 | ||
c5aa993b | 334 | if (ntype) |
c906108c | 335 | { |
c5aa993b | 336 | if (typeptr == 0) |
7ba81444 MS |
337 | return ntype; /* Don't care about alloc, |
338 | and have new type. */ | |
c906108c | 339 | else if (*typeptr == 0) |
c5aa993b | 340 | { |
7ba81444 | 341 | *typeptr = ntype; /* Tracking alloc, and have new type. */ |
c906108c | 342 | return ntype; |
c5aa993b | 343 | } |
c906108c SS |
344 | } |
345 | ||
346 | if (typeptr == 0 || *typeptr == 0) /* We'll need to allocate one. */ | |
347 | { | |
e9bb382b | 348 | ntype = alloc_type_copy (type); |
c906108c SS |
349 | if (typeptr) |
350 | *typeptr = ntype; | |
351 | } | |
7ba81444 | 352 | else /* We have storage, but need to reset it. */ |
c906108c SS |
353 | { |
354 | ntype = *typeptr; | |
053cb41b | 355 | chain = TYPE_CHAIN (ntype); |
2fdde8f8 | 356 | smash_type (ntype); |
053cb41b | 357 | TYPE_CHAIN (ntype) = chain; |
c906108c SS |
358 | } |
359 | ||
360 | TYPE_TARGET_TYPE (ntype) = type; | |
361 | TYPE_POINTER_TYPE (type) = ntype; | |
362 | ||
5212577a | 363 | /* FIXME! Assumes the machine has only one representation for pointers! */ |
c906108c | 364 | |
50810684 UW |
365 | TYPE_LENGTH (ntype) |
366 | = gdbarch_ptr_bit (get_type_arch (type)) / TARGET_CHAR_BIT; | |
c906108c SS |
367 | TYPE_CODE (ntype) = TYPE_CODE_PTR; |
368 | ||
67b2adb2 | 369 | /* Mark pointers as unsigned. The target converts between pointers |
76e71323 | 370 | and addresses (CORE_ADDRs) using gdbarch_pointer_to_address and |
7ba81444 | 371 | gdbarch_address_to_pointer. */ |
876cecd0 | 372 | TYPE_UNSIGNED (ntype) = 1; |
c5aa993b | 373 | |
053cb41b JB |
374 | /* Update the length of all the other variants of this type. */ |
375 | chain = TYPE_CHAIN (ntype); | |
376 | while (chain != ntype) | |
377 | { | |
378 | TYPE_LENGTH (chain) = TYPE_LENGTH (ntype); | |
379 | chain = TYPE_CHAIN (chain); | |
380 | } | |
381 | ||
c906108c SS |
382 | return ntype; |
383 | } | |
384 | ||
385 | /* Given a type TYPE, return a type of pointers to that type. | |
386 | May need to construct such a type if this is the first use. */ | |
387 | ||
388 | struct type * | |
fba45db2 | 389 | lookup_pointer_type (struct type *type) |
c906108c | 390 | { |
c5aa993b | 391 | return make_pointer_type (type, (struct type **) 0); |
c906108c SS |
392 | } |
393 | ||
7ba81444 MS |
394 | /* Lookup a C++ `reference' to a type TYPE. TYPEPTR, if nonzero, |
395 | points to a pointer to memory where the reference type should be | |
396 | stored. If *TYPEPTR is zero, update it to point to the reference | |
3b224330 AV |
397 | type we return. We allocate new memory if needed. REFCODE denotes |
398 | the kind of reference type to lookup (lvalue or rvalue reference). */ | |
c906108c SS |
399 | |
400 | struct type * | |
3b224330 AV |
401 | make_reference_type (struct type *type, struct type **typeptr, |
402 | enum type_code refcode) | |
c906108c | 403 | { |
52f0bd74 | 404 | struct type *ntype; /* New type */ |
3b224330 | 405 | struct type **reftype; |
1e98b326 | 406 | struct type *chain; |
c906108c | 407 | |
3b224330 AV |
408 | gdb_assert (refcode == TYPE_CODE_REF || refcode == TYPE_CODE_RVALUE_REF); |
409 | ||
410 | ntype = (refcode == TYPE_CODE_REF ? TYPE_REFERENCE_TYPE (type) | |
411 | : TYPE_RVALUE_REFERENCE_TYPE (type)); | |
c906108c | 412 | |
c5aa993b | 413 | if (ntype) |
c906108c | 414 | { |
c5aa993b | 415 | if (typeptr == 0) |
7ba81444 MS |
416 | return ntype; /* Don't care about alloc, |
417 | and have new type. */ | |
c906108c | 418 | else if (*typeptr == 0) |
c5aa993b | 419 | { |
7ba81444 | 420 | *typeptr = ntype; /* Tracking alloc, and have new type. */ |
c906108c | 421 | return ntype; |
c5aa993b | 422 | } |
c906108c SS |
423 | } |
424 | ||
425 | if (typeptr == 0 || *typeptr == 0) /* We'll need to allocate one. */ | |
426 | { | |
e9bb382b | 427 | ntype = alloc_type_copy (type); |
c906108c SS |
428 | if (typeptr) |
429 | *typeptr = ntype; | |
430 | } | |
7ba81444 | 431 | else /* We have storage, but need to reset it. */ |
c906108c SS |
432 | { |
433 | ntype = *typeptr; | |
1e98b326 | 434 | chain = TYPE_CHAIN (ntype); |
2fdde8f8 | 435 | smash_type (ntype); |
1e98b326 | 436 | TYPE_CHAIN (ntype) = chain; |
c906108c SS |
437 | } |
438 | ||
439 | TYPE_TARGET_TYPE (ntype) = type; | |
3b224330 AV |
440 | reftype = (refcode == TYPE_CODE_REF ? &TYPE_REFERENCE_TYPE (type) |
441 | : &TYPE_RVALUE_REFERENCE_TYPE (type)); | |
442 | ||
443 | *reftype = ntype; | |
c906108c | 444 | |
7ba81444 MS |
445 | /* FIXME! Assume the machine has only one representation for |
446 | references, and that it matches the (only) representation for | |
447 | pointers! */ | |
c906108c | 448 | |
50810684 UW |
449 | TYPE_LENGTH (ntype) = |
450 | gdbarch_ptr_bit (get_type_arch (type)) / TARGET_CHAR_BIT; | |
3b224330 | 451 | TYPE_CODE (ntype) = refcode; |
c5aa993b | 452 | |
3b224330 | 453 | *reftype = ntype; |
c906108c | 454 | |
1e98b326 JB |
455 | /* Update the length of all the other variants of this type. */ |
456 | chain = TYPE_CHAIN (ntype); | |
457 | while (chain != ntype) | |
458 | { | |
459 | TYPE_LENGTH (chain) = TYPE_LENGTH (ntype); | |
460 | chain = TYPE_CHAIN (chain); | |
461 | } | |
462 | ||
c906108c SS |
463 | return ntype; |
464 | } | |
465 | ||
7ba81444 MS |
466 | /* Same as above, but caller doesn't care about memory allocation |
467 | details. */ | |
c906108c SS |
468 | |
469 | struct type * | |
3b224330 AV |
470 | lookup_reference_type (struct type *type, enum type_code refcode) |
471 | { | |
472 | return make_reference_type (type, (struct type **) 0, refcode); | |
473 | } | |
474 | ||
475 | /* Lookup the lvalue reference type for the type TYPE. */ | |
476 | ||
477 | struct type * | |
478 | lookup_lvalue_reference_type (struct type *type) | |
479 | { | |
480 | return lookup_reference_type (type, TYPE_CODE_REF); | |
481 | } | |
482 | ||
483 | /* Lookup the rvalue reference type for the type TYPE. */ | |
484 | ||
485 | struct type * | |
486 | lookup_rvalue_reference_type (struct type *type) | |
c906108c | 487 | { |
3b224330 | 488 | return lookup_reference_type (type, TYPE_CODE_RVALUE_REF); |
c906108c SS |
489 | } |
490 | ||
7ba81444 MS |
491 | /* Lookup a function type that returns type TYPE. TYPEPTR, if |
492 | nonzero, points to a pointer to memory where the function type | |
493 | should be stored. If *TYPEPTR is zero, update it to point to the | |
0c8b41f1 | 494 | function type we return. We allocate new memory if needed. */ |
c906108c SS |
495 | |
496 | struct type * | |
0c8b41f1 | 497 | make_function_type (struct type *type, struct type **typeptr) |
c906108c | 498 | { |
52f0bd74 | 499 | struct type *ntype; /* New type */ |
c906108c SS |
500 | |
501 | if (typeptr == 0 || *typeptr == 0) /* We'll need to allocate one. */ | |
502 | { | |
e9bb382b | 503 | ntype = alloc_type_copy (type); |
c906108c SS |
504 | if (typeptr) |
505 | *typeptr = ntype; | |
506 | } | |
7ba81444 | 507 | else /* We have storage, but need to reset it. */ |
c906108c SS |
508 | { |
509 | ntype = *typeptr; | |
2fdde8f8 | 510 | smash_type (ntype); |
c906108c SS |
511 | } |
512 | ||
513 | TYPE_TARGET_TYPE (ntype) = type; | |
514 | ||
515 | TYPE_LENGTH (ntype) = 1; | |
516 | TYPE_CODE (ntype) = TYPE_CODE_FUNC; | |
c5aa993b | 517 | |
b6cdc2c1 JK |
518 | INIT_FUNC_SPECIFIC (ntype); |
519 | ||
c906108c SS |
520 | return ntype; |
521 | } | |
522 | ||
c906108c SS |
523 | /* Given a type TYPE, return a type of functions that return that type. |
524 | May need to construct such a type if this is the first use. */ | |
525 | ||
526 | struct type * | |
fba45db2 | 527 | lookup_function_type (struct type *type) |
c906108c | 528 | { |
0c8b41f1 | 529 | return make_function_type (type, (struct type **) 0); |
c906108c SS |
530 | } |
531 | ||
71918a86 | 532 | /* Given a type TYPE and argument types, return the appropriate |
a6fb9c08 TT |
533 | function type. If the final type in PARAM_TYPES is NULL, make a |
534 | varargs function. */ | |
71918a86 TT |
535 | |
536 | struct type * | |
537 | lookup_function_type_with_arguments (struct type *type, | |
538 | int nparams, | |
539 | struct type **param_types) | |
540 | { | |
541 | struct type *fn = make_function_type (type, (struct type **) 0); | |
542 | int i; | |
543 | ||
e314d629 | 544 | if (nparams > 0) |
a6fb9c08 | 545 | { |
e314d629 TT |
546 | if (param_types[nparams - 1] == NULL) |
547 | { | |
548 | --nparams; | |
549 | TYPE_VARARGS (fn) = 1; | |
550 | } | |
551 | else if (TYPE_CODE (check_typedef (param_types[nparams - 1])) | |
552 | == TYPE_CODE_VOID) | |
553 | { | |
554 | --nparams; | |
555 | /* Caller should have ensured this. */ | |
556 | gdb_assert (nparams == 0); | |
557 | TYPE_PROTOTYPED (fn) = 1; | |
558 | } | |
54990598 PA |
559 | else |
560 | TYPE_PROTOTYPED (fn) = 1; | |
a6fb9c08 TT |
561 | } |
562 | ||
71918a86 | 563 | TYPE_NFIELDS (fn) = nparams; |
224c3ddb SM |
564 | TYPE_FIELDS (fn) |
565 | = (struct field *) TYPE_ZALLOC (fn, nparams * sizeof (struct field)); | |
71918a86 TT |
566 | for (i = 0; i < nparams; ++i) |
567 | TYPE_FIELD_TYPE (fn, i) = param_types[i]; | |
568 | ||
569 | return fn; | |
570 | } | |
571 | ||
47663de5 MS |
572 | /* Identify address space identifier by name -- |
573 | return the integer flag defined in gdbtypes.h. */ | |
5212577a DE |
574 | |
575 | int | |
61f4b350 TT |
576 | address_space_name_to_int (struct gdbarch *gdbarch, |
577 | const char *space_identifier) | |
47663de5 | 578 | { |
8b2dbe47 | 579 | int type_flags; |
d8734c88 | 580 | |
7ba81444 | 581 | /* Check for known address space delimiters. */ |
47663de5 | 582 | if (!strcmp (space_identifier, "code")) |
876cecd0 | 583 | return TYPE_INSTANCE_FLAG_CODE_SPACE; |
47663de5 | 584 | else if (!strcmp (space_identifier, "data")) |
876cecd0 | 585 | return TYPE_INSTANCE_FLAG_DATA_SPACE; |
5f11f355 AC |
586 | else if (gdbarch_address_class_name_to_type_flags_p (gdbarch) |
587 | && gdbarch_address_class_name_to_type_flags (gdbarch, | |
588 | space_identifier, | |
589 | &type_flags)) | |
8b2dbe47 | 590 | return type_flags; |
47663de5 | 591 | else |
8a3fe4f8 | 592 | error (_("Unknown address space specifier: \"%s\""), space_identifier); |
47663de5 MS |
593 | } |
594 | ||
595 | /* Identify address space identifier by integer flag as defined in | |
7ba81444 | 596 | gdbtypes.h -- return the string version of the adress space name. */ |
47663de5 | 597 | |
321432c0 | 598 | const char * |
50810684 | 599 | address_space_int_to_name (struct gdbarch *gdbarch, int space_flag) |
47663de5 | 600 | { |
876cecd0 | 601 | if (space_flag & TYPE_INSTANCE_FLAG_CODE_SPACE) |
47663de5 | 602 | return "code"; |
876cecd0 | 603 | else if (space_flag & TYPE_INSTANCE_FLAG_DATA_SPACE) |
47663de5 | 604 | return "data"; |
876cecd0 | 605 | else if ((space_flag & TYPE_INSTANCE_FLAG_ADDRESS_CLASS_ALL) |
5f11f355 AC |
606 | && gdbarch_address_class_type_flags_to_name_p (gdbarch)) |
607 | return gdbarch_address_class_type_flags_to_name (gdbarch, space_flag); | |
47663de5 MS |
608 | else |
609 | return NULL; | |
610 | } | |
611 | ||
2fdde8f8 | 612 | /* Create a new type with instance flags NEW_FLAGS, based on TYPE. |
ad766c0a JB |
613 | |
614 | If STORAGE is non-NULL, create the new type instance there. | |
615 | STORAGE must be in the same obstack as TYPE. */ | |
47663de5 | 616 | |
b9362cc7 | 617 | static struct type * |
2fdde8f8 DJ |
618 | make_qualified_type (struct type *type, int new_flags, |
619 | struct type *storage) | |
47663de5 MS |
620 | { |
621 | struct type *ntype; | |
622 | ||
623 | ntype = type; | |
5f61c20e JK |
624 | do |
625 | { | |
626 | if (TYPE_INSTANCE_FLAGS (ntype) == new_flags) | |
627 | return ntype; | |
628 | ntype = TYPE_CHAIN (ntype); | |
629 | } | |
630 | while (ntype != type); | |
47663de5 | 631 | |
2fdde8f8 DJ |
632 | /* Create a new type instance. */ |
633 | if (storage == NULL) | |
634 | ntype = alloc_type_instance (type); | |
635 | else | |
636 | { | |
7ba81444 MS |
637 | /* If STORAGE was provided, it had better be in the same objfile |
638 | as TYPE. Otherwise, we can't link it into TYPE's cv chain: | |
639 | if one objfile is freed and the other kept, we'd have | |
640 | dangling pointers. */ | |
ad766c0a JB |
641 | gdb_assert (TYPE_OBJFILE (type) == TYPE_OBJFILE (storage)); |
642 | ||
2fdde8f8 DJ |
643 | ntype = storage; |
644 | TYPE_MAIN_TYPE (ntype) = TYPE_MAIN_TYPE (type); | |
645 | TYPE_CHAIN (ntype) = ntype; | |
646 | } | |
47663de5 MS |
647 | |
648 | /* Pointers or references to the original type are not relevant to | |
2fdde8f8 | 649 | the new type. */ |
47663de5 MS |
650 | TYPE_POINTER_TYPE (ntype) = (struct type *) 0; |
651 | TYPE_REFERENCE_TYPE (ntype) = (struct type *) 0; | |
47663de5 | 652 | |
2fdde8f8 DJ |
653 | /* Chain the new qualified type to the old type. */ |
654 | TYPE_CHAIN (ntype) = TYPE_CHAIN (type); | |
655 | TYPE_CHAIN (type) = ntype; | |
656 | ||
657 | /* Now set the instance flags and return the new type. */ | |
658 | TYPE_INSTANCE_FLAGS (ntype) = new_flags; | |
47663de5 | 659 | |
ab5d3da6 KB |
660 | /* Set length of new type to that of the original type. */ |
661 | TYPE_LENGTH (ntype) = TYPE_LENGTH (type); | |
662 | ||
47663de5 MS |
663 | return ntype; |
664 | } | |
665 | ||
2fdde8f8 DJ |
666 | /* Make an address-space-delimited variant of a type -- a type that |
667 | is identical to the one supplied except that it has an address | |
668 | space attribute attached to it (such as "code" or "data"). | |
669 | ||
7ba81444 MS |
670 | The space attributes "code" and "data" are for Harvard |
671 | architectures. The address space attributes are for architectures | |
672 | which have alternately sized pointers or pointers with alternate | |
673 | representations. */ | |
2fdde8f8 DJ |
674 | |
675 | struct type * | |
676 | make_type_with_address_space (struct type *type, int space_flag) | |
677 | { | |
2fdde8f8 | 678 | int new_flags = ((TYPE_INSTANCE_FLAGS (type) |
876cecd0 TT |
679 | & ~(TYPE_INSTANCE_FLAG_CODE_SPACE |
680 | | TYPE_INSTANCE_FLAG_DATA_SPACE | |
681 | | TYPE_INSTANCE_FLAG_ADDRESS_CLASS_ALL)) | |
2fdde8f8 DJ |
682 | | space_flag); |
683 | ||
684 | return make_qualified_type (type, new_flags, NULL); | |
685 | } | |
c906108c SS |
686 | |
687 | /* Make a "c-v" variant of a type -- a type that is identical to the | |
688 | one supplied except that it may have const or volatile attributes | |
689 | CNST is a flag for setting the const attribute | |
690 | VOLTL is a flag for setting the volatile attribute | |
691 | TYPE is the base type whose variant we are creating. | |
c906108c | 692 | |
ad766c0a JB |
693 | If TYPEPTR and *TYPEPTR are non-zero, then *TYPEPTR points to |
694 | storage to hold the new qualified type; *TYPEPTR and TYPE must be | |
695 | in the same objfile. Otherwise, allocate fresh memory for the new | |
696 | type whereever TYPE lives. If TYPEPTR is non-zero, set it to the | |
697 | new type we construct. */ | |
5212577a | 698 | |
c906108c | 699 | struct type * |
7ba81444 MS |
700 | make_cv_type (int cnst, int voltl, |
701 | struct type *type, | |
702 | struct type **typeptr) | |
c906108c | 703 | { |
52f0bd74 | 704 | struct type *ntype; /* New type */ |
c906108c | 705 | |
2fdde8f8 | 706 | int new_flags = (TYPE_INSTANCE_FLAGS (type) |
308d96ed MS |
707 | & ~(TYPE_INSTANCE_FLAG_CONST |
708 | | TYPE_INSTANCE_FLAG_VOLATILE)); | |
c906108c | 709 | |
c906108c | 710 | if (cnst) |
876cecd0 | 711 | new_flags |= TYPE_INSTANCE_FLAG_CONST; |
c906108c SS |
712 | |
713 | if (voltl) | |
876cecd0 | 714 | new_flags |= TYPE_INSTANCE_FLAG_VOLATILE; |
a02fd225 | 715 | |
2fdde8f8 | 716 | if (typeptr && *typeptr != NULL) |
a02fd225 | 717 | { |
ad766c0a JB |
718 | /* TYPE and *TYPEPTR must be in the same objfile. We can't have |
719 | a C-V variant chain that threads across objfiles: if one | |
720 | objfile gets freed, then the other has a broken C-V chain. | |
721 | ||
722 | This code used to try to copy over the main type from TYPE to | |
723 | *TYPEPTR if they were in different objfiles, but that's | |
724 | wrong, too: TYPE may have a field list or member function | |
725 | lists, which refer to types of their own, etc. etc. The | |
726 | whole shebang would need to be copied over recursively; you | |
727 | can't have inter-objfile pointers. The only thing to do is | |
728 | to leave stub types as stub types, and look them up afresh by | |
729 | name each time you encounter them. */ | |
730 | gdb_assert (TYPE_OBJFILE (*typeptr) == TYPE_OBJFILE (type)); | |
2fdde8f8 DJ |
731 | } |
732 | ||
7ba81444 MS |
733 | ntype = make_qualified_type (type, new_flags, |
734 | typeptr ? *typeptr : NULL); | |
c906108c | 735 | |
2fdde8f8 DJ |
736 | if (typeptr != NULL) |
737 | *typeptr = ntype; | |
a02fd225 | 738 | |
2fdde8f8 | 739 | return ntype; |
a02fd225 | 740 | } |
c906108c | 741 | |
06d66ee9 TT |
742 | /* Make a 'restrict'-qualified version of TYPE. */ |
743 | ||
744 | struct type * | |
745 | make_restrict_type (struct type *type) | |
746 | { | |
747 | return make_qualified_type (type, | |
748 | (TYPE_INSTANCE_FLAGS (type) | |
749 | | TYPE_INSTANCE_FLAG_RESTRICT), | |
750 | NULL); | |
751 | } | |
752 | ||
f1660027 TT |
753 | /* Make a type without const, volatile, or restrict. */ |
754 | ||
755 | struct type * | |
756 | make_unqualified_type (struct type *type) | |
757 | { | |
758 | return make_qualified_type (type, | |
759 | (TYPE_INSTANCE_FLAGS (type) | |
760 | & ~(TYPE_INSTANCE_FLAG_CONST | |
761 | | TYPE_INSTANCE_FLAG_VOLATILE | |
762 | | TYPE_INSTANCE_FLAG_RESTRICT)), | |
763 | NULL); | |
764 | } | |
765 | ||
a2c2acaf MW |
766 | /* Make a '_Atomic'-qualified version of TYPE. */ |
767 | ||
768 | struct type * | |
769 | make_atomic_type (struct type *type) | |
770 | { | |
771 | return make_qualified_type (type, | |
772 | (TYPE_INSTANCE_FLAGS (type) | |
773 | | TYPE_INSTANCE_FLAG_ATOMIC), | |
774 | NULL); | |
775 | } | |
776 | ||
2fdde8f8 DJ |
777 | /* Replace the contents of ntype with the type *type. This changes the |
778 | contents, rather than the pointer for TYPE_MAIN_TYPE (ntype); thus | |
779 | the changes are propogated to all types in the TYPE_CHAIN. | |
dd6bda65 | 780 | |
cda6c68a JB |
781 | In order to build recursive types, it's inevitable that we'll need |
782 | to update types in place --- but this sort of indiscriminate | |
783 | smashing is ugly, and needs to be replaced with something more | |
2fdde8f8 DJ |
784 | controlled. TYPE_MAIN_TYPE is a step in this direction; it's not |
785 | clear if more steps are needed. */ | |
5212577a | 786 | |
dd6bda65 DJ |
787 | void |
788 | replace_type (struct type *ntype, struct type *type) | |
789 | { | |
ab5d3da6 | 790 | struct type *chain; |
dd6bda65 | 791 | |
ad766c0a JB |
792 | /* These two types had better be in the same objfile. Otherwise, |
793 | the assignment of one type's main type structure to the other | |
794 | will produce a type with references to objects (names; field | |
795 | lists; etc.) allocated on an objfile other than its own. */ | |
e46dd0f4 | 796 | gdb_assert (TYPE_OBJFILE (ntype) == TYPE_OBJFILE (type)); |
ad766c0a | 797 | |
2fdde8f8 | 798 | *TYPE_MAIN_TYPE (ntype) = *TYPE_MAIN_TYPE (type); |
dd6bda65 | 799 | |
7ba81444 MS |
800 | /* The type length is not a part of the main type. Update it for |
801 | each type on the variant chain. */ | |
ab5d3da6 | 802 | chain = ntype; |
5f61c20e JK |
803 | do |
804 | { | |
805 | /* Assert that this element of the chain has no address-class bits | |
806 | set in its flags. Such type variants might have type lengths | |
807 | which are supposed to be different from the non-address-class | |
808 | variants. This assertion shouldn't ever be triggered because | |
809 | symbol readers which do construct address-class variants don't | |
810 | call replace_type(). */ | |
811 | gdb_assert (TYPE_ADDRESS_CLASS_ALL (chain) == 0); | |
812 | ||
813 | TYPE_LENGTH (chain) = TYPE_LENGTH (type); | |
814 | chain = TYPE_CHAIN (chain); | |
815 | } | |
816 | while (ntype != chain); | |
ab5d3da6 | 817 | |
2fdde8f8 DJ |
818 | /* Assert that the two types have equivalent instance qualifiers. |
819 | This should be true for at least all of our debug readers. */ | |
820 | gdb_assert (TYPE_INSTANCE_FLAGS (ntype) == TYPE_INSTANCE_FLAGS (type)); | |
dd6bda65 DJ |
821 | } |
822 | ||
c906108c SS |
823 | /* Implement direct support for MEMBER_TYPE in GNU C++. |
824 | May need to construct such a type if this is the first use. | |
825 | The TYPE is the type of the member. The DOMAIN is the type | |
826 | of the aggregate that the member belongs to. */ | |
827 | ||
828 | struct type * | |
0d5de010 | 829 | lookup_memberptr_type (struct type *type, struct type *domain) |
c906108c | 830 | { |
52f0bd74 | 831 | struct type *mtype; |
c906108c | 832 | |
e9bb382b | 833 | mtype = alloc_type_copy (type); |
0d5de010 | 834 | smash_to_memberptr_type (mtype, domain, type); |
c16abbde | 835 | return mtype; |
c906108c SS |
836 | } |
837 | ||
0d5de010 DJ |
838 | /* Return a pointer-to-method type, for a method of type TO_TYPE. */ |
839 | ||
840 | struct type * | |
841 | lookup_methodptr_type (struct type *to_type) | |
842 | { | |
843 | struct type *mtype; | |
844 | ||
e9bb382b | 845 | mtype = alloc_type_copy (to_type); |
0b92b5bb | 846 | smash_to_methodptr_type (mtype, to_type); |
0d5de010 DJ |
847 | return mtype; |
848 | } | |
849 | ||
7ba81444 MS |
850 | /* Allocate a stub method whose return type is TYPE. This apparently |
851 | happens for speed of symbol reading, since parsing out the | |
852 | arguments to the method is cpu-intensive, the way we are doing it. | |
853 | So, we will fill in arguments later. This always returns a fresh | |
854 | type. */ | |
c906108c SS |
855 | |
856 | struct type * | |
fba45db2 | 857 | allocate_stub_method (struct type *type) |
c906108c SS |
858 | { |
859 | struct type *mtype; | |
860 | ||
e9bb382b UW |
861 | mtype = alloc_type_copy (type); |
862 | TYPE_CODE (mtype) = TYPE_CODE_METHOD; | |
863 | TYPE_LENGTH (mtype) = 1; | |
864 | TYPE_STUB (mtype) = 1; | |
c906108c | 865 | TYPE_TARGET_TYPE (mtype) = type; |
4bfb94b8 | 866 | /* TYPE_SELF_TYPE (mtype) = unknown yet */ |
c16abbde | 867 | return mtype; |
c906108c SS |
868 | } |
869 | ||
0f59d5fc PA |
870 | /* See gdbtypes.h. */ |
871 | ||
872 | bool | |
873 | operator== (const dynamic_prop &l, const dynamic_prop &r) | |
874 | { | |
875 | if (l.kind != r.kind) | |
876 | return false; | |
877 | ||
878 | switch (l.kind) | |
879 | { | |
880 | case PROP_UNDEFINED: | |
881 | return true; | |
882 | case PROP_CONST: | |
883 | return l.data.const_val == r.data.const_val; | |
884 | case PROP_ADDR_OFFSET: | |
885 | case PROP_LOCEXPR: | |
886 | case PROP_LOCLIST: | |
887 | return l.data.baton == r.data.baton; | |
888 | } | |
889 | ||
890 | gdb_assert_not_reached ("unhandled dynamic_prop kind"); | |
891 | } | |
892 | ||
893 | /* See gdbtypes.h. */ | |
894 | ||
895 | bool | |
896 | operator== (const range_bounds &l, const range_bounds &r) | |
897 | { | |
898 | #define FIELD_EQ(FIELD) (l.FIELD == r.FIELD) | |
899 | ||
900 | return (FIELD_EQ (low) | |
901 | && FIELD_EQ (high) | |
902 | && FIELD_EQ (flag_upper_bound_is_count) | |
4e962e74 TT |
903 | && FIELD_EQ (flag_bound_evaluated) |
904 | && FIELD_EQ (bias)); | |
0f59d5fc PA |
905 | |
906 | #undef FIELD_EQ | |
907 | } | |
908 | ||
729efb13 SA |
909 | /* Create a range type with a dynamic range from LOW_BOUND to |
910 | HIGH_BOUND, inclusive. See create_range_type for further details. */ | |
c906108c SS |
911 | |
912 | struct type * | |
729efb13 SA |
913 | create_range_type (struct type *result_type, struct type *index_type, |
914 | const struct dynamic_prop *low_bound, | |
4e962e74 TT |
915 | const struct dynamic_prop *high_bound, |
916 | LONGEST bias) | |
c906108c | 917 | { |
b86352cf AB |
918 | /* The INDEX_TYPE should be a type capable of holding the upper and lower |
919 | bounds, as such a zero sized, or void type makes no sense. */ | |
920 | gdb_assert (TYPE_CODE (index_type) != TYPE_CODE_VOID); | |
921 | gdb_assert (TYPE_LENGTH (index_type) > 0); | |
922 | ||
c906108c | 923 | if (result_type == NULL) |
e9bb382b | 924 | result_type = alloc_type_copy (index_type); |
c906108c SS |
925 | TYPE_CODE (result_type) = TYPE_CODE_RANGE; |
926 | TYPE_TARGET_TYPE (result_type) = index_type; | |
74a9bb82 | 927 | if (TYPE_STUB (index_type)) |
876cecd0 | 928 | TYPE_TARGET_STUB (result_type) = 1; |
c906108c SS |
929 | else |
930 | TYPE_LENGTH (result_type) = TYPE_LENGTH (check_typedef (index_type)); | |
729efb13 | 931 | |
43bbcdc2 PH |
932 | TYPE_RANGE_DATA (result_type) = (struct range_bounds *) |
933 | TYPE_ZALLOC (result_type, sizeof (struct range_bounds)); | |
729efb13 SA |
934 | TYPE_RANGE_DATA (result_type)->low = *low_bound; |
935 | TYPE_RANGE_DATA (result_type)->high = *high_bound; | |
4e962e74 | 936 | TYPE_RANGE_DATA (result_type)->bias = bias; |
c906108c | 937 | |
729efb13 | 938 | if (low_bound->kind == PROP_CONST && low_bound->data.const_val >= 0) |
876cecd0 | 939 | TYPE_UNSIGNED (result_type) = 1; |
c906108c | 940 | |
45e44d27 JB |
941 | /* Ada allows the declaration of range types whose upper bound is |
942 | less than the lower bound, so checking the lower bound is not | |
943 | enough. Make sure we do not mark a range type whose upper bound | |
944 | is negative as unsigned. */ | |
945 | if (high_bound->kind == PROP_CONST && high_bound->data.const_val < 0) | |
946 | TYPE_UNSIGNED (result_type) = 0; | |
947 | ||
262452ec | 948 | return result_type; |
c906108c SS |
949 | } |
950 | ||
729efb13 SA |
951 | /* Create a range type using either a blank type supplied in |
952 | RESULT_TYPE, or creating a new type, inheriting the objfile from | |
953 | INDEX_TYPE. | |
954 | ||
955 | Indices will be of type INDEX_TYPE, and will range from LOW_BOUND | |
956 | to HIGH_BOUND, inclusive. | |
957 | ||
958 | FIXME: Maybe we should check the TYPE_CODE of RESULT_TYPE to make | |
959 | sure it is TYPE_CODE_UNDEF before we bash it into a range type? */ | |
960 | ||
961 | struct type * | |
962 | create_static_range_type (struct type *result_type, struct type *index_type, | |
963 | LONGEST low_bound, LONGEST high_bound) | |
964 | { | |
965 | struct dynamic_prop low, high; | |
966 | ||
967 | low.kind = PROP_CONST; | |
968 | low.data.const_val = low_bound; | |
969 | ||
970 | high.kind = PROP_CONST; | |
971 | high.data.const_val = high_bound; | |
972 | ||
4e962e74 | 973 | result_type = create_range_type (result_type, index_type, &low, &high, 0); |
729efb13 SA |
974 | |
975 | return result_type; | |
976 | } | |
977 | ||
80180f79 SA |
978 | /* Predicate tests whether BOUNDS are static. Returns 1 if all bounds values |
979 | are static, otherwise returns 0. */ | |
980 | ||
981 | static int | |
982 | has_static_range (const struct range_bounds *bounds) | |
983 | { | |
984 | return (bounds->low.kind == PROP_CONST | |
985 | && bounds->high.kind == PROP_CONST); | |
986 | } | |
987 | ||
988 | ||
7ba81444 MS |
989 | /* Set *LOWP and *HIGHP to the lower and upper bounds of discrete type |
990 | TYPE. Return 1 if type is a range type, 0 if it is discrete (and | |
991 | bounds will fit in LONGEST), or -1 otherwise. */ | |
c906108c SS |
992 | |
993 | int | |
fba45db2 | 994 | get_discrete_bounds (struct type *type, LONGEST *lowp, LONGEST *highp) |
c906108c | 995 | { |
f168693b | 996 | type = check_typedef (type); |
c906108c SS |
997 | switch (TYPE_CODE (type)) |
998 | { | |
999 | case TYPE_CODE_RANGE: | |
1000 | *lowp = TYPE_LOW_BOUND (type); | |
1001 | *highp = TYPE_HIGH_BOUND (type); | |
1002 | return 1; | |
1003 | case TYPE_CODE_ENUM: | |
1004 | if (TYPE_NFIELDS (type) > 0) | |
1005 | { | |
1006 | /* The enums may not be sorted by value, so search all | |
0963b4bd | 1007 | entries. */ |
c906108c SS |
1008 | int i; |
1009 | ||
14e75d8e | 1010 | *lowp = *highp = TYPE_FIELD_ENUMVAL (type, 0); |
c906108c SS |
1011 | for (i = 0; i < TYPE_NFIELDS (type); i++) |
1012 | { | |
14e75d8e JK |
1013 | if (TYPE_FIELD_ENUMVAL (type, i) < *lowp) |
1014 | *lowp = TYPE_FIELD_ENUMVAL (type, i); | |
1015 | if (TYPE_FIELD_ENUMVAL (type, i) > *highp) | |
1016 | *highp = TYPE_FIELD_ENUMVAL (type, i); | |
c906108c SS |
1017 | } |
1018 | ||
7ba81444 | 1019 | /* Set unsigned indicator if warranted. */ |
c5aa993b | 1020 | if (*lowp >= 0) |
c906108c | 1021 | { |
876cecd0 | 1022 | TYPE_UNSIGNED (type) = 1; |
c906108c SS |
1023 | } |
1024 | } | |
1025 | else | |
1026 | { | |
1027 | *lowp = 0; | |
1028 | *highp = -1; | |
1029 | } | |
1030 | return 0; | |
1031 | case TYPE_CODE_BOOL: | |
1032 | *lowp = 0; | |
1033 | *highp = 1; | |
1034 | return 0; | |
1035 | case TYPE_CODE_INT: | |
c5aa993b | 1036 | if (TYPE_LENGTH (type) > sizeof (LONGEST)) /* Too big */ |
c906108c SS |
1037 | return -1; |
1038 | if (!TYPE_UNSIGNED (type)) | |
1039 | { | |
c5aa993b | 1040 | *lowp = -(1 << (TYPE_LENGTH (type) * TARGET_CHAR_BIT - 1)); |
c906108c SS |
1041 | *highp = -*lowp - 1; |
1042 | return 0; | |
1043 | } | |
86a73007 | 1044 | /* fall through */ |
c906108c SS |
1045 | case TYPE_CODE_CHAR: |
1046 | *lowp = 0; | |
1047 | /* This round-about calculation is to avoid shifting by | |
7b83ea04 | 1048 | TYPE_LENGTH (type) * TARGET_CHAR_BIT, which will not work |
7ba81444 | 1049 | if TYPE_LENGTH (type) == sizeof (LONGEST). */ |
c906108c SS |
1050 | *highp = 1 << (TYPE_LENGTH (type) * TARGET_CHAR_BIT - 1); |
1051 | *highp = (*highp - 1) | *highp; | |
1052 | return 0; | |
1053 | default: | |
1054 | return -1; | |
1055 | } | |
1056 | } | |
1057 | ||
dbc98a8b KW |
1058 | /* Assuming TYPE is a simple, non-empty array type, compute its upper |
1059 | and lower bound. Save the low bound into LOW_BOUND if not NULL. | |
1060 | Save the high bound into HIGH_BOUND if not NULL. | |
1061 | ||
0963b4bd | 1062 | Return 1 if the operation was successful. Return zero otherwise, |
dbc98a8b KW |
1063 | in which case the values of LOW_BOUND and HIGH_BOUNDS are unmodified. |
1064 | ||
1065 | We now simply use get_discrete_bounds call to get the values | |
1066 | of the low and high bounds. | |
1067 | get_discrete_bounds can return three values: | |
1068 | 1, meaning that index is a range, | |
1069 | 0, meaning that index is a discrete type, | |
1070 | or -1 for failure. */ | |
1071 | ||
1072 | int | |
1073 | get_array_bounds (struct type *type, LONGEST *low_bound, LONGEST *high_bound) | |
1074 | { | |
1075 | struct type *index = TYPE_INDEX_TYPE (type); | |
1076 | LONGEST low = 0; | |
1077 | LONGEST high = 0; | |
1078 | int res; | |
1079 | ||
1080 | if (index == NULL) | |
1081 | return 0; | |
1082 | ||
1083 | res = get_discrete_bounds (index, &low, &high); | |
1084 | if (res == -1) | |
1085 | return 0; | |
1086 | ||
1087 | /* Check if the array bounds are undefined. */ | |
1088 | if (res == 1 | |
1089 | && ((low_bound && TYPE_ARRAY_LOWER_BOUND_IS_UNDEFINED (type)) | |
1090 | || (high_bound && TYPE_ARRAY_UPPER_BOUND_IS_UNDEFINED (type)))) | |
1091 | return 0; | |
1092 | ||
1093 | if (low_bound) | |
1094 | *low_bound = low; | |
1095 | ||
1096 | if (high_bound) | |
1097 | *high_bound = high; | |
1098 | ||
1099 | return 1; | |
1100 | } | |
1101 | ||
aa715135 JG |
1102 | /* Assuming that TYPE is a discrete type and VAL is a valid integer |
1103 | representation of a value of this type, save the corresponding | |
1104 | position number in POS. | |
1105 | ||
1106 | Its differs from VAL only in the case of enumeration types. In | |
1107 | this case, the position number of the value of the first listed | |
1108 | enumeration literal is zero; the position number of the value of | |
1109 | each subsequent enumeration literal is one more than that of its | |
1110 | predecessor in the list. | |
1111 | ||
1112 | Return 1 if the operation was successful. Return zero otherwise, | |
1113 | in which case the value of POS is unmodified. | |
1114 | */ | |
1115 | ||
1116 | int | |
1117 | discrete_position (struct type *type, LONGEST val, LONGEST *pos) | |
1118 | { | |
1119 | if (TYPE_CODE (type) == TYPE_CODE_ENUM) | |
1120 | { | |
1121 | int i; | |
1122 | ||
1123 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) | |
1124 | { | |
1125 | if (val == TYPE_FIELD_ENUMVAL (type, i)) | |
1126 | { | |
1127 | *pos = i; | |
1128 | return 1; | |
1129 | } | |
1130 | } | |
1131 | /* Invalid enumeration value. */ | |
1132 | return 0; | |
1133 | } | |
1134 | else | |
1135 | { | |
1136 | *pos = val; | |
1137 | return 1; | |
1138 | } | |
1139 | } | |
1140 | ||
7ba81444 MS |
1141 | /* Create an array type using either a blank type supplied in |
1142 | RESULT_TYPE, or creating a new type, inheriting the objfile from | |
1143 | RANGE_TYPE. | |
c906108c SS |
1144 | |
1145 | Elements will be of type ELEMENT_TYPE, the indices will be of type | |
1146 | RANGE_TYPE. | |
1147 | ||
a405673c JB |
1148 | BYTE_STRIDE_PROP, when not NULL, provides the array's byte stride. |
1149 | This byte stride property is added to the resulting array type | |
1150 | as a DYN_PROP_BYTE_STRIDE. As a consequence, the BYTE_STRIDE_PROP | |
1151 | argument can only be used to create types that are objfile-owned | |
1152 | (see add_dyn_prop), meaning that either this function must be called | |
1153 | with an objfile-owned RESULT_TYPE, or an objfile-owned RANGE_TYPE. | |
1154 | ||
1155 | BIT_STRIDE is taken into account only when BYTE_STRIDE_PROP is NULL. | |
dc53a7ad JB |
1156 | If BIT_STRIDE is not zero, build a packed array type whose element |
1157 | size is BIT_STRIDE. Otherwise, ignore this parameter. | |
1158 | ||
7ba81444 MS |
1159 | FIXME: Maybe we should check the TYPE_CODE of RESULT_TYPE to make |
1160 | sure it is TYPE_CODE_UNDEF before we bash it into an array | |
1161 | type? */ | |
c906108c SS |
1162 | |
1163 | struct type * | |
dc53a7ad JB |
1164 | create_array_type_with_stride (struct type *result_type, |
1165 | struct type *element_type, | |
1166 | struct type *range_type, | |
a405673c | 1167 | struct dynamic_prop *byte_stride_prop, |
dc53a7ad | 1168 | unsigned int bit_stride) |
c906108c | 1169 | { |
a405673c JB |
1170 | if (byte_stride_prop != NULL |
1171 | && byte_stride_prop->kind == PROP_CONST) | |
1172 | { | |
1173 | /* The byte stride is actually not dynamic. Pretend we were | |
1174 | called with bit_stride set instead of byte_stride_prop. | |
1175 | This will give us the same result type, while avoiding | |
1176 | the need to handle this as a special case. */ | |
1177 | bit_stride = byte_stride_prop->data.const_val * 8; | |
1178 | byte_stride_prop = NULL; | |
1179 | } | |
1180 | ||
c906108c | 1181 | if (result_type == NULL) |
e9bb382b UW |
1182 | result_type = alloc_type_copy (range_type); |
1183 | ||
c906108c SS |
1184 | TYPE_CODE (result_type) = TYPE_CODE_ARRAY; |
1185 | TYPE_TARGET_TYPE (result_type) = element_type; | |
a405673c JB |
1186 | if (byte_stride_prop == NULL |
1187 | && has_static_range (TYPE_RANGE_DATA (range_type)) | |
b4a7fcab JB |
1188 | && (!type_not_associated (result_type) |
1189 | && !type_not_allocated (result_type))) | |
80180f79 SA |
1190 | { |
1191 | LONGEST low_bound, high_bound; | |
1192 | ||
1193 | if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0) | |
1194 | low_bound = high_bound = 0; | |
f168693b | 1195 | element_type = check_typedef (element_type); |
80180f79 SA |
1196 | /* Be careful when setting the array length. Ada arrays can be |
1197 | empty arrays with the high_bound being smaller than the low_bound. | |
1198 | In such cases, the array length should be zero. */ | |
1199 | if (high_bound < low_bound) | |
1200 | TYPE_LENGTH (result_type) = 0; | |
1201 | else if (bit_stride > 0) | |
1202 | TYPE_LENGTH (result_type) = | |
1203 | (bit_stride * (high_bound - low_bound + 1) + 7) / 8; | |
1204 | else | |
1205 | TYPE_LENGTH (result_type) = | |
1206 | TYPE_LENGTH (element_type) * (high_bound - low_bound + 1); | |
1207 | } | |
ab0d6e0d | 1208 | else |
80180f79 SA |
1209 | { |
1210 | /* This type is dynamic and its length needs to be computed | |
1211 | on demand. In the meantime, avoid leaving the TYPE_LENGTH | |
1212 | undefined by setting it to zero. Although we are not expected | |
1213 | to trust TYPE_LENGTH in this case, setting the size to zero | |
1214 | allows us to avoid allocating objects of random sizes in case | |
1215 | we accidently do. */ | |
1216 | TYPE_LENGTH (result_type) = 0; | |
1217 | } | |
1218 | ||
c906108c SS |
1219 | TYPE_NFIELDS (result_type) = 1; |
1220 | TYPE_FIELDS (result_type) = | |
1deafd4e | 1221 | (struct field *) TYPE_ZALLOC (result_type, sizeof (struct field)); |
262452ec | 1222 | TYPE_INDEX_TYPE (result_type) = range_type; |
a405673c | 1223 | if (byte_stride_prop != NULL) |
50a82047 | 1224 | add_dyn_prop (DYN_PROP_BYTE_STRIDE, *byte_stride_prop, result_type); |
a405673c | 1225 | else if (bit_stride > 0) |
dc53a7ad | 1226 | TYPE_FIELD_BITSIZE (result_type, 0) = bit_stride; |
c906108c | 1227 | |
a9ff5f12 | 1228 | /* TYPE_TARGET_STUB will take care of zero length arrays. */ |
c906108c | 1229 | if (TYPE_LENGTH (result_type) == 0) |
876cecd0 | 1230 | TYPE_TARGET_STUB (result_type) = 1; |
c906108c | 1231 | |
c16abbde | 1232 | return result_type; |
c906108c SS |
1233 | } |
1234 | ||
dc53a7ad JB |
1235 | /* Same as create_array_type_with_stride but with no bit_stride |
1236 | (BIT_STRIDE = 0), thus building an unpacked array. */ | |
1237 | ||
1238 | struct type * | |
1239 | create_array_type (struct type *result_type, | |
1240 | struct type *element_type, | |
1241 | struct type *range_type) | |
1242 | { | |
1243 | return create_array_type_with_stride (result_type, element_type, | |
a405673c | 1244 | range_type, NULL, 0); |
dc53a7ad JB |
1245 | } |
1246 | ||
e3506a9f UW |
1247 | struct type * |
1248 | lookup_array_range_type (struct type *element_type, | |
63375b74 | 1249 | LONGEST low_bound, LONGEST high_bound) |
e3506a9f | 1250 | { |
929b5ad4 JB |
1251 | struct type *index_type; |
1252 | struct type *range_type; | |
1253 | ||
1254 | if (TYPE_OBJFILE_OWNED (element_type)) | |
1255 | index_type = objfile_type (TYPE_OWNER (element_type).objfile)->builtin_int; | |
1256 | else | |
1257 | index_type = builtin_type (get_type_arch (element_type))->builtin_int; | |
1258 | range_type = create_static_range_type (NULL, index_type, | |
1259 | low_bound, high_bound); | |
d8734c88 | 1260 | |
e3506a9f UW |
1261 | return create_array_type (NULL, element_type, range_type); |
1262 | } | |
1263 | ||
7ba81444 MS |
1264 | /* Create a string type using either a blank type supplied in |
1265 | RESULT_TYPE, or creating a new type. String types are similar | |
1266 | enough to array of char types that we can use create_array_type to | |
1267 | build the basic type and then bash it into a string type. | |
c906108c SS |
1268 | |
1269 | For fixed length strings, the range type contains 0 as the lower | |
1270 | bound and the length of the string minus one as the upper bound. | |
1271 | ||
7ba81444 MS |
1272 | FIXME: Maybe we should check the TYPE_CODE of RESULT_TYPE to make |
1273 | sure it is TYPE_CODE_UNDEF before we bash it into a string | |
1274 | type? */ | |
c906108c SS |
1275 | |
1276 | struct type * | |
3b7538c0 UW |
1277 | create_string_type (struct type *result_type, |
1278 | struct type *string_char_type, | |
7ba81444 | 1279 | struct type *range_type) |
c906108c SS |
1280 | { |
1281 | result_type = create_array_type (result_type, | |
f290d38e | 1282 | string_char_type, |
c906108c SS |
1283 | range_type); |
1284 | TYPE_CODE (result_type) = TYPE_CODE_STRING; | |
c16abbde | 1285 | return result_type; |
c906108c SS |
1286 | } |
1287 | ||
e3506a9f UW |
1288 | struct type * |
1289 | lookup_string_range_type (struct type *string_char_type, | |
63375b74 | 1290 | LONGEST low_bound, LONGEST high_bound) |
e3506a9f UW |
1291 | { |
1292 | struct type *result_type; | |
d8734c88 | 1293 | |
e3506a9f UW |
1294 | result_type = lookup_array_range_type (string_char_type, |
1295 | low_bound, high_bound); | |
1296 | TYPE_CODE (result_type) = TYPE_CODE_STRING; | |
1297 | return result_type; | |
1298 | } | |
1299 | ||
c906108c | 1300 | struct type * |
fba45db2 | 1301 | create_set_type (struct type *result_type, struct type *domain_type) |
c906108c | 1302 | { |
c906108c | 1303 | if (result_type == NULL) |
e9bb382b UW |
1304 | result_type = alloc_type_copy (domain_type); |
1305 | ||
c906108c SS |
1306 | TYPE_CODE (result_type) = TYPE_CODE_SET; |
1307 | TYPE_NFIELDS (result_type) = 1; | |
224c3ddb SM |
1308 | TYPE_FIELDS (result_type) |
1309 | = (struct field *) TYPE_ZALLOC (result_type, sizeof (struct field)); | |
c906108c | 1310 | |
74a9bb82 | 1311 | if (!TYPE_STUB (domain_type)) |
c906108c | 1312 | { |
f9780d5b | 1313 | LONGEST low_bound, high_bound, bit_length; |
d8734c88 | 1314 | |
c906108c SS |
1315 | if (get_discrete_bounds (domain_type, &low_bound, &high_bound) < 0) |
1316 | low_bound = high_bound = 0; | |
1317 | bit_length = high_bound - low_bound + 1; | |
1318 | TYPE_LENGTH (result_type) | |
1319 | = (bit_length + TARGET_CHAR_BIT - 1) / TARGET_CHAR_BIT; | |
f9780d5b | 1320 | if (low_bound >= 0) |
876cecd0 | 1321 | TYPE_UNSIGNED (result_type) = 1; |
c906108c SS |
1322 | } |
1323 | TYPE_FIELD_TYPE (result_type, 0) = domain_type; | |
1324 | ||
c16abbde | 1325 | return result_type; |
c906108c SS |
1326 | } |
1327 | ||
ea37ba09 DJ |
1328 | /* Convert ARRAY_TYPE to a vector type. This may modify ARRAY_TYPE |
1329 | and any array types nested inside it. */ | |
1330 | ||
1331 | void | |
1332 | make_vector_type (struct type *array_type) | |
1333 | { | |
1334 | struct type *inner_array, *elt_type; | |
1335 | int flags; | |
1336 | ||
1337 | /* Find the innermost array type, in case the array is | |
1338 | multi-dimensional. */ | |
1339 | inner_array = array_type; | |
1340 | while (TYPE_CODE (TYPE_TARGET_TYPE (inner_array)) == TYPE_CODE_ARRAY) | |
1341 | inner_array = TYPE_TARGET_TYPE (inner_array); | |
1342 | ||
1343 | elt_type = TYPE_TARGET_TYPE (inner_array); | |
1344 | if (TYPE_CODE (elt_type) == TYPE_CODE_INT) | |
1345 | { | |
2844d6b5 | 1346 | flags = TYPE_INSTANCE_FLAGS (elt_type) | TYPE_INSTANCE_FLAG_NOTTEXT; |
ea37ba09 DJ |
1347 | elt_type = make_qualified_type (elt_type, flags, NULL); |
1348 | TYPE_TARGET_TYPE (inner_array) = elt_type; | |
1349 | } | |
1350 | ||
876cecd0 | 1351 | TYPE_VECTOR (array_type) = 1; |
ea37ba09 DJ |
1352 | } |
1353 | ||
794ac428 | 1354 | struct type * |
ac3aafc7 EZ |
1355 | init_vector_type (struct type *elt_type, int n) |
1356 | { | |
1357 | struct type *array_type; | |
d8734c88 | 1358 | |
e3506a9f | 1359 | array_type = lookup_array_range_type (elt_type, 0, n - 1); |
ea37ba09 | 1360 | make_vector_type (array_type); |
ac3aafc7 EZ |
1361 | return array_type; |
1362 | } | |
1363 | ||
09e2d7c7 DE |
1364 | /* Internal routine called by TYPE_SELF_TYPE to return the type that TYPE |
1365 | belongs to. In c++ this is the class of "this", but TYPE_THIS_TYPE is too | |
1366 | confusing. "self" is a common enough replacement for "this". | |
1367 | TYPE must be one of TYPE_CODE_METHODPTR, TYPE_CODE_MEMBERPTR, or | |
1368 | TYPE_CODE_METHOD. */ | |
1369 | ||
1370 | struct type * | |
1371 | internal_type_self_type (struct type *type) | |
1372 | { | |
1373 | switch (TYPE_CODE (type)) | |
1374 | { | |
1375 | case TYPE_CODE_METHODPTR: | |
1376 | case TYPE_CODE_MEMBERPTR: | |
eaaf76ab DE |
1377 | if (TYPE_SPECIFIC_FIELD (type) == TYPE_SPECIFIC_NONE) |
1378 | return NULL; | |
09e2d7c7 DE |
1379 | gdb_assert (TYPE_SPECIFIC_FIELD (type) == TYPE_SPECIFIC_SELF_TYPE); |
1380 | return TYPE_MAIN_TYPE (type)->type_specific.self_type; | |
1381 | case TYPE_CODE_METHOD: | |
eaaf76ab DE |
1382 | if (TYPE_SPECIFIC_FIELD (type) == TYPE_SPECIFIC_NONE) |
1383 | return NULL; | |
09e2d7c7 DE |
1384 | gdb_assert (TYPE_SPECIFIC_FIELD (type) == TYPE_SPECIFIC_FUNC); |
1385 | return TYPE_MAIN_TYPE (type)->type_specific.func_stuff->self_type; | |
1386 | default: | |
1387 | gdb_assert_not_reached ("bad type"); | |
1388 | } | |
1389 | } | |
1390 | ||
1391 | /* Set the type of the class that TYPE belongs to. | |
1392 | In c++ this is the class of "this". | |
1393 | TYPE must be one of TYPE_CODE_METHODPTR, TYPE_CODE_MEMBERPTR, or | |
1394 | TYPE_CODE_METHOD. */ | |
1395 | ||
1396 | void | |
1397 | set_type_self_type (struct type *type, struct type *self_type) | |
1398 | { | |
1399 | switch (TYPE_CODE (type)) | |
1400 | { | |
1401 | case TYPE_CODE_METHODPTR: | |
1402 | case TYPE_CODE_MEMBERPTR: | |
1403 | if (TYPE_SPECIFIC_FIELD (type) == TYPE_SPECIFIC_NONE) | |
1404 | TYPE_SPECIFIC_FIELD (type) = TYPE_SPECIFIC_SELF_TYPE; | |
1405 | gdb_assert (TYPE_SPECIFIC_FIELD (type) == TYPE_SPECIFIC_SELF_TYPE); | |
1406 | TYPE_MAIN_TYPE (type)->type_specific.self_type = self_type; | |
1407 | break; | |
1408 | case TYPE_CODE_METHOD: | |
1409 | if (TYPE_SPECIFIC_FIELD (type) == TYPE_SPECIFIC_NONE) | |
1410 | INIT_FUNC_SPECIFIC (type); | |
1411 | gdb_assert (TYPE_SPECIFIC_FIELD (type) == TYPE_SPECIFIC_FUNC); | |
1412 | TYPE_MAIN_TYPE (type)->type_specific.func_stuff->self_type = self_type; | |
1413 | break; | |
1414 | default: | |
1415 | gdb_assert_not_reached ("bad type"); | |
1416 | } | |
1417 | } | |
1418 | ||
1419 | /* Smash TYPE to be a type of pointers to members of SELF_TYPE with type | |
0d5de010 DJ |
1420 | TO_TYPE. A member pointer is a wierd thing -- it amounts to a |
1421 | typed offset into a struct, e.g. "an int at offset 8". A MEMBER | |
1422 | TYPE doesn't include the offset (that's the value of the MEMBER | |
1423 | itself), but does include the structure type into which it points | |
1424 | (for some reason). | |
c906108c | 1425 | |
7ba81444 MS |
1426 | When "smashing" the type, we preserve the objfile that the old type |
1427 | pointed to, since we aren't changing where the type is actually | |
c906108c SS |
1428 | allocated. */ |
1429 | ||
1430 | void | |
09e2d7c7 | 1431 | smash_to_memberptr_type (struct type *type, struct type *self_type, |
0d5de010 | 1432 | struct type *to_type) |
c906108c | 1433 | { |
2fdde8f8 | 1434 | smash_type (type); |
09e2d7c7 | 1435 | TYPE_CODE (type) = TYPE_CODE_MEMBERPTR; |
c906108c | 1436 | TYPE_TARGET_TYPE (type) = to_type; |
09e2d7c7 | 1437 | set_type_self_type (type, self_type); |
0d5de010 DJ |
1438 | /* Assume that a data member pointer is the same size as a normal |
1439 | pointer. */ | |
50810684 UW |
1440 | TYPE_LENGTH (type) |
1441 | = gdbarch_ptr_bit (get_type_arch (to_type)) / TARGET_CHAR_BIT; | |
c906108c SS |
1442 | } |
1443 | ||
0b92b5bb TT |
1444 | /* Smash TYPE to be a type of pointer to methods type TO_TYPE. |
1445 | ||
1446 | When "smashing" the type, we preserve the objfile that the old type | |
1447 | pointed to, since we aren't changing where the type is actually | |
1448 | allocated. */ | |
1449 | ||
1450 | void | |
1451 | smash_to_methodptr_type (struct type *type, struct type *to_type) | |
1452 | { | |
1453 | smash_type (type); | |
09e2d7c7 | 1454 | TYPE_CODE (type) = TYPE_CODE_METHODPTR; |
0b92b5bb | 1455 | TYPE_TARGET_TYPE (type) = to_type; |
09e2d7c7 | 1456 | set_type_self_type (type, TYPE_SELF_TYPE (to_type)); |
0b92b5bb | 1457 | TYPE_LENGTH (type) = cplus_method_ptr_size (to_type); |
0b92b5bb TT |
1458 | } |
1459 | ||
09e2d7c7 | 1460 | /* Smash TYPE to be a type of method of SELF_TYPE with type TO_TYPE. |
c906108c SS |
1461 | METHOD just means `function that gets an extra "this" argument'. |
1462 | ||
7ba81444 MS |
1463 | When "smashing" the type, we preserve the objfile that the old type |
1464 | pointed to, since we aren't changing where the type is actually | |
c906108c SS |
1465 | allocated. */ |
1466 | ||
1467 | void | |
09e2d7c7 | 1468 | smash_to_method_type (struct type *type, struct type *self_type, |
ad2f7632 DJ |
1469 | struct type *to_type, struct field *args, |
1470 | int nargs, int varargs) | |
c906108c | 1471 | { |
2fdde8f8 | 1472 | smash_type (type); |
09e2d7c7 | 1473 | TYPE_CODE (type) = TYPE_CODE_METHOD; |
c906108c | 1474 | TYPE_TARGET_TYPE (type) = to_type; |
09e2d7c7 | 1475 | set_type_self_type (type, self_type); |
ad2f7632 DJ |
1476 | TYPE_FIELDS (type) = args; |
1477 | TYPE_NFIELDS (type) = nargs; | |
1478 | if (varargs) | |
876cecd0 | 1479 | TYPE_VARARGS (type) = 1; |
c906108c | 1480 | TYPE_LENGTH (type) = 1; /* In practice, this is never needed. */ |
c906108c SS |
1481 | } |
1482 | ||
a737d952 | 1483 | /* A wrapper of TYPE_NAME which calls error if the type is anonymous. |
d8228535 JK |
1484 | Since GCC PR debug/47510 DWARF provides associated information to detect the |
1485 | anonymous class linkage name from its typedef. | |
1486 | ||
1487 | Parameter TYPE should not yet have CHECK_TYPEDEF applied, this function will | |
1488 | apply it itself. */ | |
1489 | ||
1490 | const char * | |
a737d952 | 1491 | type_name_or_error (struct type *type) |
d8228535 JK |
1492 | { |
1493 | struct type *saved_type = type; | |
1494 | const char *name; | |
1495 | struct objfile *objfile; | |
1496 | ||
f168693b | 1497 | type = check_typedef (type); |
d8228535 | 1498 | |
a737d952 | 1499 | name = TYPE_NAME (type); |
d8228535 JK |
1500 | if (name != NULL) |
1501 | return name; | |
1502 | ||
a737d952 | 1503 | name = TYPE_NAME (saved_type); |
d8228535 JK |
1504 | objfile = TYPE_OBJFILE (saved_type); |
1505 | error (_("Invalid anonymous type %s [in module %s], GCC PR debug/47510 bug?"), | |
4262abfb JK |
1506 | name ? name : "<anonymous>", |
1507 | objfile ? objfile_name (objfile) : "<arch>"); | |
d8228535 JK |
1508 | } |
1509 | ||
7ba81444 MS |
1510 | /* Lookup a typedef or primitive type named NAME, visible in lexical |
1511 | block BLOCK. If NOERR is nonzero, return zero if NAME is not | |
1512 | suitably defined. */ | |
c906108c SS |
1513 | |
1514 | struct type * | |
e6c014f2 | 1515 | lookup_typename (const struct language_defn *language, |
ddd49eee | 1516 | struct gdbarch *gdbarch, const char *name, |
34eaf542 | 1517 | const struct block *block, int noerr) |
c906108c | 1518 | { |
52f0bd74 | 1519 | struct symbol *sym; |
c906108c | 1520 | |
1994afbf | 1521 | sym = lookup_symbol_in_language (name, block, VAR_DOMAIN, |
d12307c1 | 1522 | language->la_language, NULL).symbol; |
c51fe631 DE |
1523 | if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF) |
1524 | return SYMBOL_TYPE (sym); | |
1525 | ||
c51fe631 DE |
1526 | if (noerr) |
1527 | return NULL; | |
1528 | error (_("No type named %s."), name); | |
c906108c SS |
1529 | } |
1530 | ||
1531 | struct type * | |
e6c014f2 | 1532 | lookup_unsigned_typename (const struct language_defn *language, |
0d5cff50 | 1533 | struct gdbarch *gdbarch, const char *name) |
c906108c | 1534 | { |
224c3ddb | 1535 | char *uns = (char *) alloca (strlen (name) + 10); |
c906108c SS |
1536 | |
1537 | strcpy (uns, "unsigned "); | |
1538 | strcpy (uns + 9, name); | |
582942f4 | 1539 | return lookup_typename (language, gdbarch, uns, NULL, 0); |
c906108c SS |
1540 | } |
1541 | ||
1542 | struct type * | |
e6c014f2 | 1543 | lookup_signed_typename (const struct language_defn *language, |
0d5cff50 | 1544 | struct gdbarch *gdbarch, const char *name) |
c906108c SS |
1545 | { |
1546 | struct type *t; | |
224c3ddb | 1547 | char *uns = (char *) alloca (strlen (name) + 8); |
c906108c SS |
1548 | |
1549 | strcpy (uns, "signed "); | |
1550 | strcpy (uns + 7, name); | |
582942f4 | 1551 | t = lookup_typename (language, gdbarch, uns, NULL, 1); |
7ba81444 | 1552 | /* If we don't find "signed FOO" just try again with plain "FOO". */ |
c906108c SS |
1553 | if (t != NULL) |
1554 | return t; | |
582942f4 | 1555 | return lookup_typename (language, gdbarch, name, NULL, 0); |
c906108c SS |
1556 | } |
1557 | ||
1558 | /* Lookup a structure type named "struct NAME", | |
1559 | visible in lexical block BLOCK. */ | |
1560 | ||
1561 | struct type * | |
270140bd | 1562 | lookup_struct (const char *name, const struct block *block) |
c906108c | 1563 | { |
52f0bd74 | 1564 | struct symbol *sym; |
c906108c | 1565 | |
d12307c1 | 1566 | sym = lookup_symbol (name, block, STRUCT_DOMAIN, 0).symbol; |
c906108c SS |
1567 | |
1568 | if (sym == NULL) | |
1569 | { | |
8a3fe4f8 | 1570 | error (_("No struct type named %s."), name); |
c906108c SS |
1571 | } |
1572 | if (TYPE_CODE (SYMBOL_TYPE (sym)) != TYPE_CODE_STRUCT) | |
1573 | { | |
7ba81444 MS |
1574 | error (_("This context has class, union or enum %s, not a struct."), |
1575 | name); | |
c906108c SS |
1576 | } |
1577 | return (SYMBOL_TYPE (sym)); | |
1578 | } | |
1579 | ||
1580 | /* Lookup a union type named "union NAME", | |
1581 | visible in lexical block BLOCK. */ | |
1582 | ||
1583 | struct type * | |
270140bd | 1584 | lookup_union (const char *name, const struct block *block) |
c906108c | 1585 | { |
52f0bd74 | 1586 | struct symbol *sym; |
c5aa993b | 1587 | struct type *t; |
c906108c | 1588 | |
d12307c1 | 1589 | sym = lookup_symbol (name, block, STRUCT_DOMAIN, 0).symbol; |
c906108c SS |
1590 | |
1591 | if (sym == NULL) | |
8a3fe4f8 | 1592 | error (_("No union type named %s."), name); |
c906108c | 1593 | |
c5aa993b | 1594 | t = SYMBOL_TYPE (sym); |
c906108c SS |
1595 | |
1596 | if (TYPE_CODE (t) == TYPE_CODE_UNION) | |
c16abbde | 1597 | return t; |
c906108c | 1598 | |
7ba81444 MS |
1599 | /* If we get here, it's not a union. */ |
1600 | error (_("This context has class, struct or enum %s, not a union."), | |
1601 | name); | |
c906108c SS |
1602 | } |
1603 | ||
c906108c SS |
1604 | /* Lookup an enum type named "enum NAME", |
1605 | visible in lexical block BLOCK. */ | |
1606 | ||
1607 | struct type * | |
270140bd | 1608 | lookup_enum (const char *name, const struct block *block) |
c906108c | 1609 | { |
52f0bd74 | 1610 | struct symbol *sym; |
c906108c | 1611 | |
d12307c1 | 1612 | sym = lookup_symbol (name, block, STRUCT_DOMAIN, 0).symbol; |
c906108c SS |
1613 | if (sym == NULL) |
1614 | { | |
8a3fe4f8 | 1615 | error (_("No enum type named %s."), name); |
c906108c SS |
1616 | } |
1617 | if (TYPE_CODE (SYMBOL_TYPE (sym)) != TYPE_CODE_ENUM) | |
1618 | { | |
7ba81444 MS |
1619 | error (_("This context has class, struct or union %s, not an enum."), |
1620 | name); | |
c906108c SS |
1621 | } |
1622 | return (SYMBOL_TYPE (sym)); | |
1623 | } | |
1624 | ||
1625 | /* Lookup a template type named "template NAME<TYPE>", | |
1626 | visible in lexical block BLOCK. */ | |
1627 | ||
1628 | struct type * | |
61f4b350 | 1629 | lookup_template_type (const char *name, struct type *type, |
270140bd | 1630 | const struct block *block) |
c906108c SS |
1631 | { |
1632 | struct symbol *sym; | |
7ba81444 MS |
1633 | char *nam = (char *) |
1634 | alloca (strlen (name) + strlen (TYPE_NAME (type)) + 4); | |
d8734c88 | 1635 | |
c906108c SS |
1636 | strcpy (nam, name); |
1637 | strcat (nam, "<"); | |
0004e5a2 | 1638 | strcat (nam, TYPE_NAME (type)); |
0963b4bd | 1639 | strcat (nam, " >"); /* FIXME, extra space still introduced in gcc? */ |
c906108c | 1640 | |
d12307c1 | 1641 | sym = lookup_symbol (nam, block, VAR_DOMAIN, 0).symbol; |
c906108c SS |
1642 | |
1643 | if (sym == NULL) | |
1644 | { | |
8a3fe4f8 | 1645 | error (_("No template type named %s."), name); |
c906108c SS |
1646 | } |
1647 | if (TYPE_CODE (SYMBOL_TYPE (sym)) != TYPE_CODE_STRUCT) | |
1648 | { | |
7ba81444 MS |
1649 | error (_("This context has class, union or enum %s, not a struct."), |
1650 | name); | |
c906108c SS |
1651 | } |
1652 | return (SYMBOL_TYPE (sym)); | |
1653 | } | |
1654 | ||
ef0bd204 | 1655 | /* See gdbtypes.h. */ |
c906108c | 1656 | |
ef0bd204 JB |
1657 | struct_elt |
1658 | lookup_struct_elt (struct type *type, const char *name, int noerr) | |
c906108c SS |
1659 | { |
1660 | int i; | |
1661 | ||
1662 | for (;;) | |
1663 | { | |
f168693b | 1664 | type = check_typedef (type); |
c906108c SS |
1665 | if (TYPE_CODE (type) != TYPE_CODE_PTR |
1666 | && TYPE_CODE (type) != TYPE_CODE_REF) | |
1667 | break; | |
1668 | type = TYPE_TARGET_TYPE (type); | |
1669 | } | |
1670 | ||
687d6395 MS |
1671 | if (TYPE_CODE (type) != TYPE_CODE_STRUCT |
1672 | && TYPE_CODE (type) != TYPE_CODE_UNION) | |
c906108c | 1673 | { |
2f408ecb PA |
1674 | std::string type_name = type_to_string (type); |
1675 | error (_("Type %s is not a structure or union type."), | |
1676 | type_name.c_str ()); | |
c906108c SS |
1677 | } |
1678 | ||
c906108c SS |
1679 | for (i = TYPE_NFIELDS (type) - 1; i >= TYPE_N_BASECLASSES (type); i--) |
1680 | { | |
0d5cff50 | 1681 | const char *t_field_name = TYPE_FIELD_NAME (type, i); |
c906108c | 1682 | |
db577aea | 1683 | if (t_field_name && (strcmp_iw (t_field_name, name) == 0)) |
c906108c | 1684 | { |
ef0bd204 | 1685 | return {&TYPE_FIELD (type, i), TYPE_FIELD_BITPOS (type, i)}; |
c906108c | 1686 | } |
f5a010c0 PM |
1687 | else if (!t_field_name || *t_field_name == '\0') |
1688 | { | |
ef0bd204 JB |
1689 | struct_elt elt |
1690 | = lookup_struct_elt (TYPE_FIELD_TYPE (type, i), name, 1); | |
1691 | if (elt.field != NULL) | |
1692 | { | |
1693 | elt.offset += TYPE_FIELD_BITPOS (type, i); | |
1694 | return elt; | |
1695 | } | |
f5a010c0 | 1696 | } |
c906108c SS |
1697 | } |
1698 | ||
1699 | /* OK, it's not in this class. Recursively check the baseclasses. */ | |
1700 | for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--) | |
1701 | { | |
ef0bd204 JB |
1702 | struct_elt elt = lookup_struct_elt (TYPE_BASECLASS (type, i), name, 1); |
1703 | if (elt.field != NULL) | |
1704 | return elt; | |
c906108c SS |
1705 | } |
1706 | ||
1707 | if (noerr) | |
ef0bd204 | 1708 | return {nullptr, 0}; |
c5aa993b | 1709 | |
2f408ecb PA |
1710 | std::string type_name = type_to_string (type); |
1711 | error (_("Type %s has no component named %s."), type_name.c_str (), name); | |
c906108c SS |
1712 | } |
1713 | ||
ef0bd204 JB |
1714 | /* See gdbtypes.h. */ |
1715 | ||
1716 | struct type * | |
1717 | lookup_struct_elt_type (struct type *type, const char *name, int noerr) | |
1718 | { | |
1719 | struct_elt elt = lookup_struct_elt (type, name, noerr); | |
1720 | if (elt.field != NULL) | |
1721 | return FIELD_TYPE (*elt.field); | |
1722 | else | |
1723 | return NULL; | |
1724 | } | |
1725 | ||
ed3ef339 DE |
1726 | /* Store in *MAX the largest number representable by unsigned integer type |
1727 | TYPE. */ | |
1728 | ||
1729 | void | |
1730 | get_unsigned_type_max (struct type *type, ULONGEST *max) | |
1731 | { | |
1732 | unsigned int n; | |
1733 | ||
f168693b | 1734 | type = check_typedef (type); |
ed3ef339 DE |
1735 | gdb_assert (TYPE_CODE (type) == TYPE_CODE_INT && TYPE_UNSIGNED (type)); |
1736 | gdb_assert (TYPE_LENGTH (type) <= sizeof (ULONGEST)); | |
1737 | ||
1738 | /* Written this way to avoid overflow. */ | |
1739 | n = TYPE_LENGTH (type) * TARGET_CHAR_BIT; | |
1740 | *max = ((((ULONGEST) 1 << (n - 1)) - 1) << 1) | 1; | |
1741 | } | |
1742 | ||
1743 | /* Store in *MIN, *MAX the smallest and largest numbers representable by | |
1744 | signed integer type TYPE. */ | |
1745 | ||
1746 | void | |
1747 | get_signed_type_minmax (struct type *type, LONGEST *min, LONGEST *max) | |
1748 | { | |
1749 | unsigned int n; | |
1750 | ||
f168693b | 1751 | type = check_typedef (type); |
ed3ef339 DE |
1752 | gdb_assert (TYPE_CODE (type) == TYPE_CODE_INT && !TYPE_UNSIGNED (type)); |
1753 | gdb_assert (TYPE_LENGTH (type) <= sizeof (LONGEST)); | |
1754 | ||
1755 | n = TYPE_LENGTH (type) * TARGET_CHAR_BIT; | |
1756 | *min = -((ULONGEST) 1 << (n - 1)); | |
1757 | *max = ((ULONGEST) 1 << (n - 1)) - 1; | |
1758 | } | |
1759 | ||
ae6ae975 DE |
1760 | /* Internal routine called by TYPE_VPTR_FIELDNO to return the value of |
1761 | cplus_stuff.vptr_fieldno. | |
1762 | ||
1763 | cplus_stuff is initialized to cplus_struct_default which does not | |
1764 | set vptr_fieldno to -1 for portability reasons (IWBN to use C99 | |
1765 | designated initializers). We cope with that here. */ | |
1766 | ||
1767 | int | |
1768 | internal_type_vptr_fieldno (struct type *type) | |
1769 | { | |
f168693b | 1770 | type = check_typedef (type); |
ae6ae975 DE |
1771 | gdb_assert (TYPE_CODE (type) == TYPE_CODE_STRUCT |
1772 | || TYPE_CODE (type) == TYPE_CODE_UNION); | |
1773 | if (!HAVE_CPLUS_STRUCT (type)) | |
1774 | return -1; | |
1775 | return TYPE_RAW_CPLUS_SPECIFIC (type)->vptr_fieldno; | |
1776 | } | |
1777 | ||
1778 | /* Set the value of cplus_stuff.vptr_fieldno. */ | |
1779 | ||
1780 | void | |
1781 | set_type_vptr_fieldno (struct type *type, int fieldno) | |
1782 | { | |
f168693b | 1783 | type = check_typedef (type); |
ae6ae975 DE |
1784 | gdb_assert (TYPE_CODE (type) == TYPE_CODE_STRUCT |
1785 | || TYPE_CODE (type) == TYPE_CODE_UNION); | |
1786 | if (!HAVE_CPLUS_STRUCT (type)) | |
1787 | ALLOCATE_CPLUS_STRUCT_TYPE (type); | |
1788 | TYPE_RAW_CPLUS_SPECIFIC (type)->vptr_fieldno = fieldno; | |
1789 | } | |
1790 | ||
1791 | /* Internal routine called by TYPE_VPTR_BASETYPE to return the value of | |
1792 | cplus_stuff.vptr_basetype. */ | |
1793 | ||
1794 | struct type * | |
1795 | internal_type_vptr_basetype (struct type *type) | |
1796 | { | |
f168693b | 1797 | type = check_typedef (type); |
ae6ae975 DE |
1798 | gdb_assert (TYPE_CODE (type) == TYPE_CODE_STRUCT |
1799 | || TYPE_CODE (type) == TYPE_CODE_UNION); | |
1800 | gdb_assert (TYPE_SPECIFIC_FIELD (type) == TYPE_SPECIFIC_CPLUS_STUFF); | |
1801 | return TYPE_RAW_CPLUS_SPECIFIC (type)->vptr_basetype; | |
1802 | } | |
1803 | ||
1804 | /* Set the value of cplus_stuff.vptr_basetype. */ | |
1805 | ||
1806 | void | |
1807 | set_type_vptr_basetype (struct type *type, struct type *basetype) | |
1808 | { | |
f168693b | 1809 | type = check_typedef (type); |
ae6ae975 DE |
1810 | gdb_assert (TYPE_CODE (type) == TYPE_CODE_STRUCT |
1811 | || TYPE_CODE (type) == TYPE_CODE_UNION); | |
1812 | if (!HAVE_CPLUS_STRUCT (type)) | |
1813 | ALLOCATE_CPLUS_STRUCT_TYPE (type); | |
1814 | TYPE_RAW_CPLUS_SPECIFIC (type)->vptr_basetype = basetype; | |
1815 | } | |
1816 | ||
81fe8080 DE |
1817 | /* Lookup the vptr basetype/fieldno values for TYPE. |
1818 | If found store vptr_basetype in *BASETYPEP if non-NULL, and return | |
1819 | vptr_fieldno. Also, if found and basetype is from the same objfile, | |
1820 | cache the results. | |
1821 | If not found, return -1 and ignore BASETYPEP. | |
1822 | Callers should be aware that in some cases (for example, | |
c906108c | 1823 | the type or one of its baseclasses is a stub type and we are |
d48cc9dd DJ |
1824 | debugging a .o file, or the compiler uses DWARF-2 and is not GCC), |
1825 | this function will not be able to find the | |
7ba81444 | 1826 | virtual function table pointer, and vptr_fieldno will remain -1 and |
81fe8080 | 1827 | vptr_basetype will remain NULL or incomplete. */ |
c906108c | 1828 | |
81fe8080 DE |
1829 | int |
1830 | get_vptr_fieldno (struct type *type, struct type **basetypep) | |
c906108c | 1831 | { |
f168693b | 1832 | type = check_typedef (type); |
c906108c SS |
1833 | |
1834 | if (TYPE_VPTR_FIELDNO (type) < 0) | |
1835 | { | |
1836 | int i; | |
1837 | ||
7ba81444 MS |
1838 | /* We must start at zero in case the first (and only) baseclass |
1839 | is virtual (and hence we cannot share the table pointer). */ | |
c906108c SS |
1840 | for (i = 0; i < TYPE_N_BASECLASSES (type); i++) |
1841 | { | |
81fe8080 DE |
1842 | struct type *baseclass = check_typedef (TYPE_BASECLASS (type, i)); |
1843 | int fieldno; | |
1844 | struct type *basetype; | |
1845 | ||
1846 | fieldno = get_vptr_fieldno (baseclass, &basetype); | |
1847 | if (fieldno >= 0) | |
c906108c | 1848 | { |
81fe8080 | 1849 | /* If the type comes from a different objfile we can't cache |
0963b4bd | 1850 | it, it may have a different lifetime. PR 2384 */ |
5ef73790 | 1851 | if (TYPE_OBJFILE (type) == TYPE_OBJFILE (basetype)) |
81fe8080 | 1852 | { |
ae6ae975 DE |
1853 | set_type_vptr_fieldno (type, fieldno); |
1854 | set_type_vptr_basetype (type, basetype); | |
81fe8080 DE |
1855 | } |
1856 | if (basetypep) | |
1857 | *basetypep = basetype; | |
1858 | return fieldno; | |
c906108c SS |
1859 | } |
1860 | } | |
81fe8080 DE |
1861 | |
1862 | /* Not found. */ | |
1863 | return -1; | |
1864 | } | |
1865 | else | |
1866 | { | |
1867 | if (basetypep) | |
1868 | *basetypep = TYPE_VPTR_BASETYPE (type); | |
1869 | return TYPE_VPTR_FIELDNO (type); | |
c906108c SS |
1870 | } |
1871 | } | |
1872 | ||
44e1a9eb DJ |
1873 | static void |
1874 | stub_noname_complaint (void) | |
1875 | { | |
b98664d3 | 1876 | complaint (_("stub type has NULL name")); |
44e1a9eb DJ |
1877 | } |
1878 | ||
a405673c JB |
1879 | /* Return nonzero if TYPE has a DYN_PROP_BYTE_STRIDE dynamic property |
1880 | attached to it, and that property has a non-constant value. */ | |
1881 | ||
1882 | static int | |
1883 | array_type_has_dynamic_stride (struct type *type) | |
1884 | { | |
1885 | struct dynamic_prop *prop = get_dyn_prop (DYN_PROP_BYTE_STRIDE, type); | |
1886 | ||
1887 | return (prop != NULL && prop->kind != PROP_CONST); | |
1888 | } | |
1889 | ||
d98b7a16 | 1890 | /* Worker for is_dynamic_type. */ |
80180f79 | 1891 | |
d98b7a16 | 1892 | static int |
ee715b5a | 1893 | is_dynamic_type_internal (struct type *type, int top_level) |
80180f79 SA |
1894 | { |
1895 | type = check_typedef (type); | |
1896 | ||
e771e4be PMR |
1897 | /* We only want to recognize references at the outermost level. */ |
1898 | if (top_level && TYPE_CODE (type) == TYPE_CODE_REF) | |
1899 | type = check_typedef (TYPE_TARGET_TYPE (type)); | |
1900 | ||
3cdcd0ce JB |
1901 | /* Types that have a dynamic TYPE_DATA_LOCATION are considered |
1902 | dynamic, even if the type itself is statically defined. | |
1903 | From a user's point of view, this may appear counter-intuitive; | |
1904 | but it makes sense in this context, because the point is to determine | |
1905 | whether any part of the type needs to be resolved before it can | |
1906 | be exploited. */ | |
1907 | if (TYPE_DATA_LOCATION (type) != NULL | |
1908 | && (TYPE_DATA_LOCATION_KIND (type) == PROP_LOCEXPR | |
1909 | || TYPE_DATA_LOCATION_KIND (type) == PROP_LOCLIST)) | |
1910 | return 1; | |
1911 | ||
3f2f83dd KB |
1912 | if (TYPE_ASSOCIATED_PROP (type)) |
1913 | return 1; | |
1914 | ||
1915 | if (TYPE_ALLOCATED_PROP (type)) | |
1916 | return 1; | |
1917 | ||
80180f79 SA |
1918 | switch (TYPE_CODE (type)) |
1919 | { | |
6f8a3220 | 1920 | case TYPE_CODE_RANGE: |
ddb87a81 JB |
1921 | { |
1922 | /* A range type is obviously dynamic if it has at least one | |
1923 | dynamic bound. But also consider the range type to be | |
1924 | dynamic when its subtype is dynamic, even if the bounds | |
1925 | of the range type are static. It allows us to assume that | |
1926 | the subtype of a static range type is also static. */ | |
1927 | return (!has_static_range (TYPE_RANGE_DATA (type)) | |
ee715b5a | 1928 | || is_dynamic_type_internal (TYPE_TARGET_TYPE (type), 0)); |
ddb87a81 | 1929 | } |
6f8a3220 | 1930 | |
80180f79 SA |
1931 | case TYPE_CODE_ARRAY: |
1932 | { | |
80180f79 | 1933 | gdb_assert (TYPE_NFIELDS (type) == 1); |
6f8a3220 | 1934 | |
a405673c | 1935 | /* The array is dynamic if either the bounds are dynamic... */ |
ee715b5a | 1936 | if (is_dynamic_type_internal (TYPE_INDEX_TYPE (type), 0)) |
80180f79 | 1937 | return 1; |
a405673c JB |
1938 | /* ... or the elements it contains have a dynamic contents... */ |
1939 | if (is_dynamic_type_internal (TYPE_TARGET_TYPE (type), 0)) | |
1940 | return 1; | |
1941 | /* ... or if it has a dynamic stride... */ | |
1942 | if (array_type_has_dynamic_stride (type)) | |
1943 | return 1; | |
1944 | return 0; | |
80180f79 | 1945 | } |
012370f6 TT |
1946 | |
1947 | case TYPE_CODE_STRUCT: | |
1948 | case TYPE_CODE_UNION: | |
1949 | { | |
1950 | int i; | |
1951 | ||
1952 | for (i = 0; i < TYPE_NFIELDS (type); ++i) | |
1953 | if (!field_is_static (&TYPE_FIELD (type, i)) | |
ee715b5a | 1954 | && is_dynamic_type_internal (TYPE_FIELD_TYPE (type, i), 0)) |
012370f6 TT |
1955 | return 1; |
1956 | } | |
1957 | break; | |
80180f79 | 1958 | } |
92e2a17f TT |
1959 | |
1960 | return 0; | |
80180f79 SA |
1961 | } |
1962 | ||
d98b7a16 TT |
1963 | /* See gdbtypes.h. */ |
1964 | ||
1965 | int | |
1966 | is_dynamic_type (struct type *type) | |
1967 | { | |
ee715b5a | 1968 | return is_dynamic_type_internal (type, 1); |
d98b7a16 TT |
1969 | } |
1970 | ||
df25ebbd | 1971 | static struct type *resolve_dynamic_type_internal |
ee715b5a | 1972 | (struct type *type, struct property_addr_info *addr_stack, int top_level); |
d98b7a16 | 1973 | |
df25ebbd JB |
1974 | /* Given a dynamic range type (dyn_range_type) and a stack of |
1975 | struct property_addr_info elements, return a static version | |
1976 | of that type. */ | |
d190df30 | 1977 | |
80180f79 | 1978 | static struct type * |
df25ebbd JB |
1979 | resolve_dynamic_range (struct type *dyn_range_type, |
1980 | struct property_addr_info *addr_stack) | |
80180f79 SA |
1981 | { |
1982 | CORE_ADDR value; | |
ddb87a81 | 1983 | struct type *static_range_type, *static_target_type; |
80180f79 | 1984 | const struct dynamic_prop *prop; |
80180f79 SA |
1985 | struct dynamic_prop low_bound, high_bound; |
1986 | ||
6f8a3220 | 1987 | gdb_assert (TYPE_CODE (dyn_range_type) == TYPE_CODE_RANGE); |
80180f79 | 1988 | |
6f8a3220 | 1989 | prop = &TYPE_RANGE_DATA (dyn_range_type)->low; |
63e43d3a | 1990 | if (dwarf2_evaluate_property (prop, NULL, addr_stack, &value)) |
80180f79 SA |
1991 | { |
1992 | low_bound.kind = PROP_CONST; | |
1993 | low_bound.data.const_val = value; | |
1994 | } | |
1995 | else | |
1996 | { | |
1997 | low_bound.kind = PROP_UNDEFINED; | |
1998 | low_bound.data.const_val = 0; | |
1999 | } | |
2000 | ||
6f8a3220 | 2001 | prop = &TYPE_RANGE_DATA (dyn_range_type)->high; |
63e43d3a | 2002 | if (dwarf2_evaluate_property (prop, NULL, addr_stack, &value)) |
80180f79 SA |
2003 | { |
2004 | high_bound.kind = PROP_CONST; | |
2005 | high_bound.data.const_val = value; | |
c451ebe5 | 2006 | |
6f8a3220 | 2007 | if (TYPE_RANGE_DATA (dyn_range_type)->flag_upper_bound_is_count) |
c451ebe5 SA |
2008 | high_bound.data.const_val |
2009 | = low_bound.data.const_val + high_bound.data.const_val - 1; | |
80180f79 SA |
2010 | } |
2011 | else | |
2012 | { | |
2013 | high_bound.kind = PROP_UNDEFINED; | |
2014 | high_bound.data.const_val = 0; | |
2015 | } | |
2016 | ||
ddb87a81 JB |
2017 | static_target_type |
2018 | = resolve_dynamic_type_internal (TYPE_TARGET_TYPE (dyn_range_type), | |
ee715b5a | 2019 | addr_stack, 0); |
4e962e74 | 2020 | LONGEST bias = TYPE_RANGE_DATA (dyn_range_type)->bias; |
6f8a3220 | 2021 | static_range_type = create_range_type (copy_type (dyn_range_type), |
ddb87a81 | 2022 | static_target_type, |
4e962e74 | 2023 | &low_bound, &high_bound, bias); |
6f8a3220 JB |
2024 | TYPE_RANGE_DATA (static_range_type)->flag_bound_evaluated = 1; |
2025 | return static_range_type; | |
2026 | } | |
2027 | ||
2028 | /* Resolves dynamic bound values of an array type TYPE to static ones. | |
df25ebbd JB |
2029 | ADDR_STACK is a stack of struct property_addr_info to be used |
2030 | if needed during the dynamic resolution. */ | |
6f8a3220 JB |
2031 | |
2032 | static struct type * | |
df25ebbd JB |
2033 | resolve_dynamic_array (struct type *type, |
2034 | struct property_addr_info *addr_stack) | |
6f8a3220 JB |
2035 | { |
2036 | CORE_ADDR value; | |
2037 | struct type *elt_type; | |
2038 | struct type *range_type; | |
2039 | struct type *ary_dim; | |
3f2f83dd | 2040 | struct dynamic_prop *prop; |
a405673c | 2041 | unsigned int bit_stride = 0; |
6f8a3220 JB |
2042 | |
2043 | gdb_assert (TYPE_CODE (type) == TYPE_CODE_ARRAY); | |
2044 | ||
3f2f83dd KB |
2045 | type = copy_type (type); |
2046 | ||
6f8a3220 JB |
2047 | elt_type = type; |
2048 | range_type = check_typedef (TYPE_INDEX_TYPE (elt_type)); | |
df25ebbd | 2049 | range_type = resolve_dynamic_range (range_type, addr_stack); |
6f8a3220 | 2050 | |
3f2f83dd KB |
2051 | /* Resolve allocated/associated here before creating a new array type, which |
2052 | will update the length of the array accordingly. */ | |
2053 | prop = TYPE_ALLOCATED_PROP (type); | |
2054 | if (prop != NULL && dwarf2_evaluate_property (prop, NULL, addr_stack, &value)) | |
2055 | { | |
2056 | TYPE_DYN_PROP_ADDR (prop) = value; | |
2057 | TYPE_DYN_PROP_KIND (prop) = PROP_CONST; | |
2058 | } | |
2059 | prop = TYPE_ASSOCIATED_PROP (type); | |
2060 | if (prop != NULL && dwarf2_evaluate_property (prop, NULL, addr_stack, &value)) | |
2061 | { | |
2062 | TYPE_DYN_PROP_ADDR (prop) = value; | |
2063 | TYPE_DYN_PROP_KIND (prop) = PROP_CONST; | |
2064 | } | |
2065 | ||
80180f79 SA |
2066 | ary_dim = check_typedef (TYPE_TARGET_TYPE (elt_type)); |
2067 | ||
2068 | if (ary_dim != NULL && TYPE_CODE (ary_dim) == TYPE_CODE_ARRAY) | |
d0d84780 | 2069 | elt_type = resolve_dynamic_array (ary_dim, addr_stack); |
80180f79 SA |
2070 | else |
2071 | elt_type = TYPE_TARGET_TYPE (type); | |
2072 | ||
a405673c JB |
2073 | prop = get_dyn_prop (DYN_PROP_BYTE_STRIDE, type); |
2074 | if (prop != NULL) | |
2075 | { | |
603490bf | 2076 | if (dwarf2_evaluate_property (prop, NULL, addr_stack, &value)) |
a405673c JB |
2077 | { |
2078 | remove_dyn_prop (DYN_PROP_BYTE_STRIDE, type); | |
2079 | bit_stride = (unsigned int) (value * 8); | |
2080 | } | |
2081 | else | |
2082 | { | |
2083 | /* Could be a bug in our code, but it could also happen | |
2084 | if the DWARF info is not correct. Issue a warning, | |
2085 | and assume no byte/bit stride (leave bit_stride = 0). */ | |
2086 | warning (_("cannot determine array stride for type %s"), | |
2087 | TYPE_NAME (type) ? TYPE_NAME (type) : "<no name>"); | |
2088 | } | |
2089 | } | |
2090 | else | |
2091 | bit_stride = TYPE_FIELD_BITSIZE (type, 0); | |
2092 | ||
2093 | return create_array_type_with_stride (type, elt_type, range_type, NULL, | |
2094 | bit_stride); | |
80180f79 SA |
2095 | } |
2096 | ||
012370f6 | 2097 | /* Resolve dynamic bounds of members of the union TYPE to static |
df25ebbd JB |
2098 | bounds. ADDR_STACK is a stack of struct property_addr_info |
2099 | to be used if needed during the dynamic resolution. */ | |
012370f6 TT |
2100 | |
2101 | static struct type * | |
df25ebbd JB |
2102 | resolve_dynamic_union (struct type *type, |
2103 | struct property_addr_info *addr_stack) | |
012370f6 TT |
2104 | { |
2105 | struct type *resolved_type; | |
2106 | int i; | |
2107 | unsigned int max_len = 0; | |
2108 | ||
2109 | gdb_assert (TYPE_CODE (type) == TYPE_CODE_UNION); | |
2110 | ||
2111 | resolved_type = copy_type (type); | |
2112 | TYPE_FIELDS (resolved_type) | |
224c3ddb SM |
2113 | = (struct field *) TYPE_ALLOC (resolved_type, |
2114 | TYPE_NFIELDS (resolved_type) | |
2115 | * sizeof (struct field)); | |
012370f6 TT |
2116 | memcpy (TYPE_FIELDS (resolved_type), |
2117 | TYPE_FIELDS (type), | |
2118 | TYPE_NFIELDS (resolved_type) * sizeof (struct field)); | |
2119 | for (i = 0; i < TYPE_NFIELDS (resolved_type); ++i) | |
2120 | { | |
2121 | struct type *t; | |
2122 | ||
2123 | if (field_is_static (&TYPE_FIELD (type, i))) | |
2124 | continue; | |
2125 | ||
d98b7a16 | 2126 | t = resolve_dynamic_type_internal (TYPE_FIELD_TYPE (resolved_type, i), |
ee715b5a | 2127 | addr_stack, 0); |
012370f6 TT |
2128 | TYPE_FIELD_TYPE (resolved_type, i) = t; |
2129 | if (TYPE_LENGTH (t) > max_len) | |
2130 | max_len = TYPE_LENGTH (t); | |
2131 | } | |
2132 | ||
2133 | TYPE_LENGTH (resolved_type) = max_len; | |
2134 | return resolved_type; | |
2135 | } | |
2136 | ||
2137 | /* Resolve dynamic bounds of members of the struct TYPE to static | |
df25ebbd JB |
2138 | bounds. ADDR_STACK is a stack of struct property_addr_info to |
2139 | be used if needed during the dynamic resolution. */ | |
012370f6 TT |
2140 | |
2141 | static struct type * | |
df25ebbd JB |
2142 | resolve_dynamic_struct (struct type *type, |
2143 | struct property_addr_info *addr_stack) | |
012370f6 TT |
2144 | { |
2145 | struct type *resolved_type; | |
2146 | int i; | |
6908c509 | 2147 | unsigned resolved_type_bit_length = 0; |
012370f6 TT |
2148 | |
2149 | gdb_assert (TYPE_CODE (type) == TYPE_CODE_STRUCT); | |
2150 | gdb_assert (TYPE_NFIELDS (type) > 0); | |
2151 | ||
2152 | resolved_type = copy_type (type); | |
2153 | TYPE_FIELDS (resolved_type) | |
224c3ddb SM |
2154 | = (struct field *) TYPE_ALLOC (resolved_type, |
2155 | TYPE_NFIELDS (resolved_type) | |
2156 | * sizeof (struct field)); | |
012370f6 TT |
2157 | memcpy (TYPE_FIELDS (resolved_type), |
2158 | TYPE_FIELDS (type), | |
2159 | TYPE_NFIELDS (resolved_type) * sizeof (struct field)); | |
2160 | for (i = 0; i < TYPE_NFIELDS (resolved_type); ++i) | |
2161 | { | |
6908c509 | 2162 | unsigned new_bit_length; |
df25ebbd | 2163 | struct property_addr_info pinfo; |
012370f6 TT |
2164 | |
2165 | if (field_is_static (&TYPE_FIELD (type, i))) | |
2166 | continue; | |
2167 | ||
6908c509 JB |
2168 | /* As we know this field is not a static field, the field's |
2169 | field_loc_kind should be FIELD_LOC_KIND_BITPOS. Verify | |
2170 | this is the case, but only trigger a simple error rather | |
2171 | than an internal error if that fails. While failing | |
2172 | that verification indicates a bug in our code, the error | |
2173 | is not severe enough to suggest to the user he stops | |
2174 | his debugging session because of it. */ | |
df25ebbd | 2175 | if (TYPE_FIELD_LOC_KIND (type, i) != FIELD_LOC_KIND_BITPOS) |
6908c509 JB |
2176 | error (_("Cannot determine struct field location" |
2177 | " (invalid location kind)")); | |
df25ebbd JB |
2178 | |
2179 | pinfo.type = check_typedef (TYPE_FIELD_TYPE (type, i)); | |
c3345124 | 2180 | pinfo.valaddr = addr_stack->valaddr; |
9920b434 BH |
2181 | pinfo.addr |
2182 | = (addr_stack->addr | |
2183 | + (TYPE_FIELD_BITPOS (resolved_type, i) / TARGET_CHAR_BIT)); | |
df25ebbd JB |
2184 | pinfo.next = addr_stack; |
2185 | ||
2186 | TYPE_FIELD_TYPE (resolved_type, i) | |
2187 | = resolve_dynamic_type_internal (TYPE_FIELD_TYPE (resolved_type, i), | |
ee715b5a | 2188 | &pinfo, 0); |
df25ebbd JB |
2189 | gdb_assert (TYPE_FIELD_LOC_KIND (resolved_type, i) |
2190 | == FIELD_LOC_KIND_BITPOS); | |
2191 | ||
6908c509 JB |
2192 | new_bit_length = TYPE_FIELD_BITPOS (resolved_type, i); |
2193 | if (TYPE_FIELD_BITSIZE (resolved_type, i) != 0) | |
2194 | new_bit_length += TYPE_FIELD_BITSIZE (resolved_type, i); | |
2195 | else | |
2196 | new_bit_length += (TYPE_LENGTH (TYPE_FIELD_TYPE (resolved_type, i)) | |
2197 | * TARGET_CHAR_BIT); | |
2198 | ||
2199 | /* Normally, we would use the position and size of the last field | |
2200 | to determine the size of the enclosing structure. But GCC seems | |
2201 | to be encoding the position of some fields incorrectly when | |
2202 | the struct contains a dynamic field that is not placed last. | |
2203 | So we compute the struct size based on the field that has | |
2204 | the highest position + size - probably the best we can do. */ | |
2205 | if (new_bit_length > resolved_type_bit_length) | |
2206 | resolved_type_bit_length = new_bit_length; | |
012370f6 TT |
2207 | } |
2208 | ||
9920b434 BH |
2209 | /* The length of a type won't change for fortran, but it does for C and Ada. |
2210 | For fortran the size of dynamic fields might change over time but not the | |
2211 | type length of the structure. If we adapt it, we run into problems | |
2212 | when calculating the element offset for arrays of structs. */ | |
2213 | if (current_language->la_language != language_fortran) | |
2214 | TYPE_LENGTH (resolved_type) | |
2215 | = (resolved_type_bit_length + TARGET_CHAR_BIT - 1) / TARGET_CHAR_BIT; | |
6908c509 | 2216 | |
9e195661 PMR |
2217 | /* The Ada language uses this field as a cache for static fixed types: reset |
2218 | it as RESOLVED_TYPE must have its own static fixed type. */ | |
2219 | TYPE_TARGET_TYPE (resolved_type) = NULL; | |
2220 | ||
012370f6 TT |
2221 | return resolved_type; |
2222 | } | |
2223 | ||
d98b7a16 | 2224 | /* Worker for resolved_dynamic_type. */ |
80180f79 | 2225 | |
d98b7a16 | 2226 | static struct type * |
df25ebbd | 2227 | resolve_dynamic_type_internal (struct type *type, |
ee715b5a PMR |
2228 | struct property_addr_info *addr_stack, |
2229 | int top_level) | |
80180f79 SA |
2230 | { |
2231 | struct type *real_type = check_typedef (type); | |
6f8a3220 | 2232 | struct type *resolved_type = type; |
d9823cbb | 2233 | struct dynamic_prop *prop; |
3cdcd0ce | 2234 | CORE_ADDR value; |
80180f79 | 2235 | |
ee715b5a | 2236 | if (!is_dynamic_type_internal (real_type, top_level)) |
80180f79 SA |
2237 | return type; |
2238 | ||
5537b577 | 2239 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) |
6f8a3220 | 2240 | { |
cac9b138 JK |
2241 | resolved_type = copy_type (type); |
2242 | TYPE_TARGET_TYPE (resolved_type) | |
ee715b5a PMR |
2243 | = resolve_dynamic_type_internal (TYPE_TARGET_TYPE (type), addr_stack, |
2244 | top_level); | |
5537b577 JK |
2245 | } |
2246 | else | |
2247 | { | |
2248 | /* Before trying to resolve TYPE, make sure it is not a stub. */ | |
2249 | type = real_type; | |
012370f6 | 2250 | |
5537b577 JK |
2251 | switch (TYPE_CODE (type)) |
2252 | { | |
e771e4be PMR |
2253 | case TYPE_CODE_REF: |
2254 | { | |
2255 | struct property_addr_info pinfo; | |
2256 | ||
2257 | pinfo.type = check_typedef (TYPE_TARGET_TYPE (type)); | |
c3345124 JB |
2258 | pinfo.valaddr = NULL; |
2259 | if (addr_stack->valaddr != NULL) | |
2260 | pinfo.addr = extract_typed_address (addr_stack->valaddr, type); | |
2261 | else | |
2262 | pinfo.addr = read_memory_typed_address (addr_stack->addr, type); | |
e771e4be PMR |
2263 | pinfo.next = addr_stack; |
2264 | ||
2265 | resolved_type = copy_type (type); | |
2266 | TYPE_TARGET_TYPE (resolved_type) | |
2267 | = resolve_dynamic_type_internal (TYPE_TARGET_TYPE (type), | |
2268 | &pinfo, top_level); | |
2269 | break; | |
2270 | } | |
2271 | ||
5537b577 | 2272 | case TYPE_CODE_ARRAY: |
df25ebbd | 2273 | resolved_type = resolve_dynamic_array (type, addr_stack); |
5537b577 JK |
2274 | break; |
2275 | ||
2276 | case TYPE_CODE_RANGE: | |
df25ebbd | 2277 | resolved_type = resolve_dynamic_range (type, addr_stack); |
5537b577 JK |
2278 | break; |
2279 | ||
2280 | case TYPE_CODE_UNION: | |
df25ebbd | 2281 | resolved_type = resolve_dynamic_union (type, addr_stack); |
5537b577 JK |
2282 | break; |
2283 | ||
2284 | case TYPE_CODE_STRUCT: | |
df25ebbd | 2285 | resolved_type = resolve_dynamic_struct (type, addr_stack); |
5537b577 JK |
2286 | break; |
2287 | } | |
6f8a3220 | 2288 | } |
80180f79 | 2289 | |
3cdcd0ce JB |
2290 | /* Resolve data_location attribute. */ |
2291 | prop = TYPE_DATA_LOCATION (resolved_type); | |
63e43d3a PMR |
2292 | if (prop != NULL |
2293 | && dwarf2_evaluate_property (prop, NULL, addr_stack, &value)) | |
3cdcd0ce | 2294 | { |
d9823cbb KB |
2295 | TYPE_DYN_PROP_ADDR (prop) = value; |
2296 | TYPE_DYN_PROP_KIND (prop) = PROP_CONST; | |
3cdcd0ce | 2297 | } |
3cdcd0ce | 2298 | |
80180f79 SA |
2299 | return resolved_type; |
2300 | } | |
2301 | ||
d98b7a16 TT |
2302 | /* See gdbtypes.h */ |
2303 | ||
2304 | struct type * | |
c3345124 JB |
2305 | resolve_dynamic_type (struct type *type, const gdb_byte *valaddr, |
2306 | CORE_ADDR addr) | |
d98b7a16 | 2307 | { |
c3345124 JB |
2308 | struct property_addr_info pinfo |
2309 | = {check_typedef (type), valaddr, addr, NULL}; | |
df25ebbd | 2310 | |
ee715b5a | 2311 | return resolve_dynamic_type_internal (type, &pinfo, 1); |
d98b7a16 TT |
2312 | } |
2313 | ||
d9823cbb KB |
2314 | /* See gdbtypes.h */ |
2315 | ||
2316 | struct dynamic_prop * | |
2317 | get_dyn_prop (enum dynamic_prop_node_kind prop_kind, const struct type *type) | |
2318 | { | |
2319 | struct dynamic_prop_list *node = TYPE_DYN_PROP_LIST (type); | |
2320 | ||
2321 | while (node != NULL) | |
2322 | { | |
2323 | if (node->prop_kind == prop_kind) | |
283a9958 | 2324 | return &node->prop; |
d9823cbb KB |
2325 | node = node->next; |
2326 | } | |
2327 | return NULL; | |
2328 | } | |
2329 | ||
2330 | /* See gdbtypes.h */ | |
2331 | ||
2332 | void | |
2333 | add_dyn_prop (enum dynamic_prop_node_kind prop_kind, struct dynamic_prop prop, | |
50a82047 | 2334 | struct type *type) |
d9823cbb KB |
2335 | { |
2336 | struct dynamic_prop_list *temp; | |
2337 | ||
2338 | gdb_assert (TYPE_OBJFILE_OWNED (type)); | |
2339 | ||
50a82047 TT |
2340 | temp = XOBNEW (&TYPE_OBJFILE (type)->objfile_obstack, |
2341 | struct dynamic_prop_list); | |
d9823cbb | 2342 | temp->prop_kind = prop_kind; |
283a9958 | 2343 | temp->prop = prop; |
d9823cbb KB |
2344 | temp->next = TYPE_DYN_PROP_LIST (type); |
2345 | ||
2346 | TYPE_DYN_PROP_LIST (type) = temp; | |
2347 | } | |
2348 | ||
9920b434 BH |
2349 | /* Remove dynamic property from TYPE in case it exists. */ |
2350 | ||
2351 | void | |
2352 | remove_dyn_prop (enum dynamic_prop_node_kind prop_kind, | |
2353 | struct type *type) | |
2354 | { | |
2355 | struct dynamic_prop_list *prev_node, *curr_node; | |
2356 | ||
2357 | curr_node = TYPE_DYN_PROP_LIST (type); | |
2358 | prev_node = NULL; | |
2359 | ||
2360 | while (NULL != curr_node) | |
2361 | { | |
2362 | if (curr_node->prop_kind == prop_kind) | |
2363 | { | |
2364 | /* Update the linked list but don't free anything. | |
2365 | The property was allocated on objstack and it is not known | |
2366 | if we are on top of it. Nevertheless, everything is released | |
2367 | when the complete objstack is freed. */ | |
2368 | if (NULL == prev_node) | |
2369 | TYPE_DYN_PROP_LIST (type) = curr_node->next; | |
2370 | else | |
2371 | prev_node->next = curr_node->next; | |
2372 | ||
2373 | return; | |
2374 | } | |
2375 | ||
2376 | prev_node = curr_node; | |
2377 | curr_node = curr_node->next; | |
2378 | } | |
2379 | } | |
d9823cbb | 2380 | |
92163a10 JK |
2381 | /* Find the real type of TYPE. This function returns the real type, |
2382 | after removing all layers of typedefs, and completing opaque or stub | |
2383 | types. Completion changes the TYPE argument, but stripping of | |
2384 | typedefs does not. | |
2385 | ||
2386 | Instance flags (e.g. const/volatile) are preserved as typedefs are | |
2387 | stripped. If necessary a new qualified form of the underlying type | |
2388 | is created. | |
2389 | ||
2390 | NOTE: This will return a typedef if TYPE_TARGET_TYPE for the typedef has | |
2391 | not been computed and we're either in the middle of reading symbols, or | |
2392 | there was no name for the typedef in the debug info. | |
2393 | ||
9bc118a5 DE |
2394 | NOTE: Lookup of opaque types can throw errors for invalid symbol files. |
2395 | QUITs in the symbol reading code can also throw. | |
2396 | Thus this function can throw an exception. | |
2397 | ||
92163a10 JK |
2398 | If TYPE is a TYPE_CODE_TYPEDEF, its length is updated to the length of |
2399 | the target type. | |
c906108c SS |
2400 | |
2401 | If this is a stubbed struct (i.e. declared as struct foo *), see if | |
0963b4bd | 2402 | we can find a full definition in some other file. If so, copy this |
7ba81444 MS |
2403 | definition, so we can use it in future. There used to be a comment |
2404 | (but not any code) that if we don't find a full definition, we'd | |
2405 | set a flag so we don't spend time in the future checking the same | |
2406 | type. That would be a mistake, though--we might load in more | |
92163a10 | 2407 | symbols which contain a full definition for the type. */ |
c906108c SS |
2408 | |
2409 | struct type * | |
a02fd225 | 2410 | check_typedef (struct type *type) |
c906108c SS |
2411 | { |
2412 | struct type *orig_type = type; | |
92163a10 JK |
2413 | /* While we're removing typedefs, we don't want to lose qualifiers. |
2414 | E.g., const/volatile. */ | |
2415 | int instance_flags = TYPE_INSTANCE_FLAGS (type); | |
a02fd225 | 2416 | |
423c0af8 MS |
2417 | gdb_assert (type); |
2418 | ||
c906108c SS |
2419 | while (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) |
2420 | { | |
2421 | if (!TYPE_TARGET_TYPE (type)) | |
2422 | { | |
0d5cff50 | 2423 | const char *name; |
c906108c SS |
2424 | struct symbol *sym; |
2425 | ||
2426 | /* It is dangerous to call lookup_symbol if we are currently | |
7ba81444 | 2427 | reading a symtab. Infinite recursion is one danger. */ |
c906108c | 2428 | if (currently_reading_symtab) |
92163a10 | 2429 | return make_qualified_type (type, instance_flags, NULL); |
c906108c | 2430 | |
a737d952 | 2431 | name = TYPE_NAME (type); |
e86ca25f TT |
2432 | /* FIXME: shouldn't we look in STRUCT_DOMAIN and/or |
2433 | VAR_DOMAIN as appropriate? */ | |
c906108c SS |
2434 | if (name == NULL) |
2435 | { | |
23136709 | 2436 | stub_noname_complaint (); |
92163a10 | 2437 | return make_qualified_type (type, instance_flags, NULL); |
c906108c | 2438 | } |
d12307c1 | 2439 | sym = lookup_symbol (name, 0, STRUCT_DOMAIN, 0).symbol; |
c906108c SS |
2440 | if (sym) |
2441 | TYPE_TARGET_TYPE (type) = SYMBOL_TYPE (sym); | |
7ba81444 | 2442 | else /* TYPE_CODE_UNDEF */ |
e9bb382b | 2443 | TYPE_TARGET_TYPE (type) = alloc_type_arch (get_type_arch (type)); |
c906108c SS |
2444 | } |
2445 | type = TYPE_TARGET_TYPE (type); | |
c906108c | 2446 | |
92163a10 JK |
2447 | /* Preserve the instance flags as we traverse down the typedef chain. |
2448 | ||
2449 | Handling address spaces/classes is nasty, what do we do if there's a | |
2450 | conflict? | |
2451 | E.g., what if an outer typedef marks the type as class_1 and an inner | |
2452 | typedef marks the type as class_2? | |
2453 | This is the wrong place to do such error checking. We leave it to | |
2454 | the code that created the typedef in the first place to flag the | |
2455 | error. We just pick the outer address space (akin to letting the | |
2456 | outer cast in a chain of casting win), instead of assuming | |
2457 | "it can't happen". */ | |
2458 | { | |
2459 | const int ALL_SPACES = (TYPE_INSTANCE_FLAG_CODE_SPACE | |
2460 | | TYPE_INSTANCE_FLAG_DATA_SPACE); | |
2461 | const int ALL_CLASSES = TYPE_INSTANCE_FLAG_ADDRESS_CLASS_ALL; | |
2462 | int new_instance_flags = TYPE_INSTANCE_FLAGS (type); | |
2463 | ||
2464 | /* Treat code vs data spaces and address classes separately. */ | |
2465 | if ((instance_flags & ALL_SPACES) != 0) | |
2466 | new_instance_flags &= ~ALL_SPACES; | |
2467 | if ((instance_flags & ALL_CLASSES) != 0) | |
2468 | new_instance_flags &= ~ALL_CLASSES; | |
2469 | ||
2470 | instance_flags |= new_instance_flags; | |
2471 | } | |
2472 | } | |
a02fd225 | 2473 | |
7ba81444 MS |
2474 | /* If this is a struct/class/union with no fields, then check |
2475 | whether a full definition exists somewhere else. This is for | |
2476 | systems where a type definition with no fields is issued for such | |
2477 | types, instead of identifying them as stub types in the first | |
2478 | place. */ | |
c5aa993b | 2479 | |
7ba81444 MS |
2480 | if (TYPE_IS_OPAQUE (type) |
2481 | && opaque_type_resolution | |
2482 | && !currently_reading_symtab) | |
c906108c | 2483 | { |
a737d952 | 2484 | const char *name = TYPE_NAME (type); |
c5aa993b | 2485 | struct type *newtype; |
d8734c88 | 2486 | |
c906108c SS |
2487 | if (name == NULL) |
2488 | { | |
23136709 | 2489 | stub_noname_complaint (); |
92163a10 | 2490 | return make_qualified_type (type, instance_flags, NULL); |
c906108c SS |
2491 | } |
2492 | newtype = lookup_transparent_type (name); | |
ad766c0a | 2493 | |
c906108c | 2494 | if (newtype) |
ad766c0a | 2495 | { |
7ba81444 MS |
2496 | /* If the resolved type and the stub are in the same |
2497 | objfile, then replace the stub type with the real deal. | |
2498 | But if they're in separate objfiles, leave the stub | |
2499 | alone; we'll just look up the transparent type every time | |
2500 | we call check_typedef. We can't create pointers between | |
2501 | types allocated to different objfiles, since they may | |
2502 | have different lifetimes. Trying to copy NEWTYPE over to | |
2503 | TYPE's objfile is pointless, too, since you'll have to | |
2504 | move over any other types NEWTYPE refers to, which could | |
2505 | be an unbounded amount of stuff. */ | |
ad766c0a | 2506 | if (TYPE_OBJFILE (newtype) == TYPE_OBJFILE (type)) |
92163a10 JK |
2507 | type = make_qualified_type (newtype, |
2508 | TYPE_INSTANCE_FLAGS (type), | |
2509 | type); | |
ad766c0a JB |
2510 | else |
2511 | type = newtype; | |
2512 | } | |
c906108c | 2513 | } |
7ba81444 MS |
2514 | /* Otherwise, rely on the stub flag being set for opaque/stubbed |
2515 | types. */ | |
74a9bb82 | 2516 | else if (TYPE_STUB (type) && !currently_reading_symtab) |
c906108c | 2517 | { |
a737d952 | 2518 | const char *name = TYPE_NAME (type); |
e86ca25f TT |
2519 | /* FIXME: shouldn't we look in STRUCT_DOMAIN and/or VAR_DOMAIN |
2520 | as appropriate? */ | |
c906108c | 2521 | struct symbol *sym; |
d8734c88 | 2522 | |
c906108c SS |
2523 | if (name == NULL) |
2524 | { | |
23136709 | 2525 | stub_noname_complaint (); |
92163a10 | 2526 | return make_qualified_type (type, instance_flags, NULL); |
c906108c | 2527 | } |
d12307c1 | 2528 | sym = lookup_symbol (name, 0, STRUCT_DOMAIN, 0).symbol; |
c906108c | 2529 | if (sym) |
c26f2453 JB |
2530 | { |
2531 | /* Same as above for opaque types, we can replace the stub | |
92163a10 | 2532 | with the complete type only if they are in the same |
c26f2453 JB |
2533 | objfile. */ |
2534 | if (TYPE_OBJFILE (SYMBOL_TYPE(sym)) == TYPE_OBJFILE (type)) | |
92163a10 JK |
2535 | type = make_qualified_type (SYMBOL_TYPE (sym), |
2536 | TYPE_INSTANCE_FLAGS (type), | |
2537 | type); | |
c26f2453 JB |
2538 | else |
2539 | type = SYMBOL_TYPE (sym); | |
2540 | } | |
c906108c SS |
2541 | } |
2542 | ||
74a9bb82 | 2543 | if (TYPE_TARGET_STUB (type)) |
c906108c | 2544 | { |
c906108c SS |
2545 | struct type *target_type = check_typedef (TYPE_TARGET_TYPE (type)); |
2546 | ||
74a9bb82 | 2547 | if (TYPE_STUB (target_type) || TYPE_TARGET_STUB (target_type)) |
c5aa993b | 2548 | { |
73e2eb35 | 2549 | /* Nothing we can do. */ |
c5aa993b | 2550 | } |
c906108c SS |
2551 | else if (TYPE_CODE (type) == TYPE_CODE_RANGE) |
2552 | { | |
2553 | TYPE_LENGTH (type) = TYPE_LENGTH (target_type); | |
876cecd0 | 2554 | TYPE_TARGET_STUB (type) = 0; |
c906108c SS |
2555 | } |
2556 | } | |
92163a10 JK |
2557 | |
2558 | type = make_qualified_type (type, instance_flags, NULL); | |
2559 | ||
7ba81444 | 2560 | /* Cache TYPE_LENGTH for future use. */ |
c906108c | 2561 | TYPE_LENGTH (orig_type) = TYPE_LENGTH (type); |
92163a10 | 2562 | |
c906108c SS |
2563 | return type; |
2564 | } | |
2565 | ||
7ba81444 | 2566 | /* Parse a type expression in the string [P..P+LENGTH). If an error |
48319d1f | 2567 | occurs, silently return a void type. */ |
c91ecb25 | 2568 | |
b9362cc7 | 2569 | static struct type * |
48319d1f | 2570 | safe_parse_type (struct gdbarch *gdbarch, char *p, int length) |
c91ecb25 ND |
2571 | { |
2572 | struct ui_file *saved_gdb_stderr; | |
34365054 | 2573 | struct type *type = NULL; /* Initialize to keep gcc happy. */ |
c91ecb25 | 2574 | |
7ba81444 | 2575 | /* Suppress error messages. */ |
c91ecb25 | 2576 | saved_gdb_stderr = gdb_stderr; |
d7e74731 | 2577 | gdb_stderr = &null_stream; |
c91ecb25 | 2578 | |
7ba81444 | 2579 | /* Call parse_and_eval_type() without fear of longjmp()s. */ |
a70b8144 | 2580 | try |
8e7b59a5 KS |
2581 | { |
2582 | type = parse_and_eval_type (p, length); | |
2583 | } | |
230d2906 | 2584 | catch (const gdb_exception_error &except) |
492d29ea PA |
2585 | { |
2586 | type = builtin_type (gdbarch)->builtin_void; | |
2587 | } | |
c91ecb25 | 2588 | |
7ba81444 | 2589 | /* Stop suppressing error messages. */ |
c91ecb25 ND |
2590 | gdb_stderr = saved_gdb_stderr; |
2591 | ||
2592 | return type; | |
2593 | } | |
2594 | ||
c906108c SS |
2595 | /* Ugly hack to convert method stubs into method types. |
2596 | ||
7ba81444 MS |
2597 | He ain't kiddin'. This demangles the name of the method into a |
2598 | string including argument types, parses out each argument type, | |
2599 | generates a string casting a zero to that type, evaluates the | |
2600 | string, and stuffs the resulting type into an argtype vector!!! | |
2601 | Then it knows the type of the whole function (including argument | |
2602 | types for overloading), which info used to be in the stab's but was | |
2603 | removed to hack back the space required for them. */ | |
c906108c | 2604 | |
de17c821 | 2605 | static void |
fba45db2 | 2606 | check_stub_method (struct type *type, int method_id, int signature_id) |
c906108c | 2607 | { |
50810684 | 2608 | struct gdbarch *gdbarch = get_type_arch (type); |
c906108c SS |
2609 | struct fn_field *f; |
2610 | char *mangled_name = gdb_mangle_name (type, method_id, signature_id); | |
8de20a37 TT |
2611 | char *demangled_name = gdb_demangle (mangled_name, |
2612 | DMGL_PARAMS | DMGL_ANSI); | |
c906108c SS |
2613 | char *argtypetext, *p; |
2614 | int depth = 0, argcount = 1; | |
ad2f7632 | 2615 | struct field *argtypes; |
c906108c SS |
2616 | struct type *mtype; |
2617 | ||
2618 | /* Make sure we got back a function string that we can use. */ | |
2619 | if (demangled_name) | |
2620 | p = strchr (demangled_name, '('); | |
502dcf4e AC |
2621 | else |
2622 | p = NULL; | |
c906108c SS |
2623 | |
2624 | if (demangled_name == NULL || p == NULL) | |
7ba81444 MS |
2625 | error (_("Internal: Cannot demangle mangled name `%s'."), |
2626 | mangled_name); | |
c906108c SS |
2627 | |
2628 | /* Now, read in the parameters that define this type. */ | |
2629 | p += 1; | |
2630 | argtypetext = p; | |
2631 | while (*p) | |
2632 | { | |
070ad9f0 | 2633 | if (*p == '(' || *p == '<') |
c906108c SS |
2634 | { |
2635 | depth += 1; | |
2636 | } | |
070ad9f0 | 2637 | else if (*p == ')' || *p == '>') |
c906108c SS |
2638 | { |
2639 | depth -= 1; | |
2640 | } | |
2641 | else if (*p == ',' && depth == 0) | |
2642 | { | |
2643 | argcount += 1; | |
2644 | } | |
2645 | ||
2646 | p += 1; | |
2647 | } | |
2648 | ||
ad2f7632 | 2649 | /* If we read one argument and it was ``void'', don't count it. */ |
61012eef | 2650 | if (startswith (argtypetext, "(void)")) |
ad2f7632 | 2651 | argcount -= 1; |
c906108c | 2652 | |
ad2f7632 DJ |
2653 | /* We need one extra slot, for the THIS pointer. */ |
2654 | ||
2655 | argtypes = (struct field *) | |
2656 | TYPE_ALLOC (type, (argcount + 1) * sizeof (struct field)); | |
c906108c | 2657 | p = argtypetext; |
4a1970e4 DJ |
2658 | |
2659 | /* Add THIS pointer for non-static methods. */ | |
2660 | f = TYPE_FN_FIELDLIST1 (type, method_id); | |
2661 | if (TYPE_FN_FIELD_STATIC_P (f, signature_id)) | |
2662 | argcount = 0; | |
2663 | else | |
2664 | { | |
ad2f7632 | 2665 | argtypes[0].type = lookup_pointer_type (type); |
4a1970e4 DJ |
2666 | argcount = 1; |
2667 | } | |
c906108c | 2668 | |
0963b4bd | 2669 | if (*p != ')') /* () means no args, skip while. */ |
c906108c SS |
2670 | { |
2671 | depth = 0; | |
2672 | while (*p) | |
2673 | { | |
2674 | if (depth <= 0 && (*p == ',' || *p == ')')) | |
2675 | { | |
ad2f7632 DJ |
2676 | /* Avoid parsing of ellipsis, they will be handled below. |
2677 | Also avoid ``void'' as above. */ | |
2678 | if (strncmp (argtypetext, "...", p - argtypetext) != 0 | |
2679 | && strncmp (argtypetext, "void", p - argtypetext) != 0) | |
c906108c | 2680 | { |
ad2f7632 | 2681 | argtypes[argcount].type = |
48319d1f | 2682 | safe_parse_type (gdbarch, argtypetext, p - argtypetext); |
c906108c SS |
2683 | argcount += 1; |
2684 | } | |
2685 | argtypetext = p + 1; | |
2686 | } | |
2687 | ||
070ad9f0 | 2688 | if (*p == '(' || *p == '<') |
c906108c SS |
2689 | { |
2690 | depth += 1; | |
2691 | } | |
070ad9f0 | 2692 | else if (*p == ')' || *p == '>') |
c906108c SS |
2693 | { |
2694 | depth -= 1; | |
2695 | } | |
2696 | ||
2697 | p += 1; | |
2698 | } | |
2699 | } | |
2700 | ||
c906108c SS |
2701 | TYPE_FN_FIELD_PHYSNAME (f, signature_id) = mangled_name; |
2702 | ||
2703 | /* Now update the old "stub" type into a real type. */ | |
2704 | mtype = TYPE_FN_FIELD_TYPE (f, signature_id); | |
09e2d7c7 DE |
2705 | /* MTYPE may currently be a function (TYPE_CODE_FUNC). |
2706 | We want a method (TYPE_CODE_METHOD). */ | |
2707 | smash_to_method_type (mtype, type, TYPE_TARGET_TYPE (mtype), | |
2708 | argtypes, argcount, p[-2] == '.'); | |
876cecd0 | 2709 | TYPE_STUB (mtype) = 0; |
c906108c | 2710 | TYPE_FN_FIELD_STUB (f, signature_id) = 0; |
ad2f7632 DJ |
2711 | |
2712 | xfree (demangled_name); | |
c906108c SS |
2713 | } |
2714 | ||
7ba81444 MS |
2715 | /* This is the external interface to check_stub_method, above. This |
2716 | function unstubs all of the signatures for TYPE's METHOD_ID method | |
2717 | name. After calling this function TYPE_FN_FIELD_STUB will be | |
2718 | cleared for each signature and TYPE_FN_FIELDLIST_NAME will be | |
2719 | correct. | |
de17c821 DJ |
2720 | |
2721 | This function unfortunately can not die until stabs do. */ | |
2722 | ||
2723 | void | |
2724 | check_stub_method_group (struct type *type, int method_id) | |
2725 | { | |
2726 | int len = TYPE_FN_FIELDLIST_LENGTH (type, method_id); | |
2727 | struct fn_field *f = TYPE_FN_FIELDLIST1 (type, method_id); | |
de17c821 | 2728 | |
041be526 SM |
2729 | for (int j = 0; j < len; j++) |
2730 | { | |
2731 | if (TYPE_FN_FIELD_STUB (f, j)) | |
de17c821 | 2732 | check_stub_method (type, method_id, j); |
de17c821 DJ |
2733 | } |
2734 | } | |
2735 | ||
405feb71 | 2736 | /* Ensure it is in .rodata (if available) by working around GCC PR 44690. */ |
9655fd1a | 2737 | const struct cplus_struct_type cplus_struct_default = { }; |
c906108c SS |
2738 | |
2739 | void | |
fba45db2 | 2740 | allocate_cplus_struct_type (struct type *type) |
c906108c | 2741 | { |
b4ba55a1 JB |
2742 | if (HAVE_CPLUS_STRUCT (type)) |
2743 | /* Structure was already allocated. Nothing more to do. */ | |
2744 | return; | |
2745 | ||
2746 | TYPE_SPECIFIC_FIELD (type) = TYPE_SPECIFIC_CPLUS_STUFF; | |
2747 | TYPE_RAW_CPLUS_SPECIFIC (type) = (struct cplus_struct_type *) | |
2748 | TYPE_ALLOC (type, sizeof (struct cplus_struct_type)); | |
2749 | *(TYPE_RAW_CPLUS_SPECIFIC (type)) = cplus_struct_default; | |
ae6ae975 | 2750 | set_type_vptr_fieldno (type, -1); |
c906108c SS |
2751 | } |
2752 | ||
b4ba55a1 JB |
2753 | const struct gnat_aux_type gnat_aux_default = |
2754 | { NULL }; | |
2755 | ||
2756 | /* Set the TYPE's type-specific kind to TYPE_SPECIFIC_GNAT_STUFF, | |
2757 | and allocate the associated gnat-specific data. The gnat-specific | |
2758 | data is also initialized to gnat_aux_default. */ | |
5212577a | 2759 | |
b4ba55a1 JB |
2760 | void |
2761 | allocate_gnat_aux_type (struct type *type) | |
2762 | { | |
2763 | TYPE_SPECIFIC_FIELD (type) = TYPE_SPECIFIC_GNAT_STUFF; | |
2764 | TYPE_GNAT_SPECIFIC (type) = (struct gnat_aux_type *) | |
2765 | TYPE_ALLOC (type, sizeof (struct gnat_aux_type)); | |
2766 | *(TYPE_GNAT_SPECIFIC (type)) = gnat_aux_default; | |
2767 | } | |
2768 | ||
ae438bc5 UW |
2769 | /* Helper function to initialize a newly allocated type. Set type code |
2770 | to CODE and initialize the type-specific fields accordingly. */ | |
2771 | ||
2772 | static void | |
2773 | set_type_code (struct type *type, enum type_code code) | |
2774 | { | |
2775 | TYPE_CODE (type) = code; | |
2776 | ||
2777 | switch (code) | |
2778 | { | |
2779 | case TYPE_CODE_STRUCT: | |
2780 | case TYPE_CODE_UNION: | |
2781 | case TYPE_CODE_NAMESPACE: | |
2782 | INIT_CPLUS_SPECIFIC (type); | |
2783 | break; | |
2784 | case TYPE_CODE_FLT: | |
2785 | TYPE_SPECIFIC_FIELD (type) = TYPE_SPECIFIC_FLOATFORMAT; | |
2786 | break; | |
2787 | case TYPE_CODE_FUNC: | |
2788 | INIT_FUNC_SPECIFIC (type); | |
2789 | break; | |
2790 | } | |
2791 | } | |
2792 | ||
19f392bc UW |
2793 | /* Helper function to verify floating-point format and size. |
2794 | BIT is the type size in bits; if BIT equals -1, the size is | |
2795 | determined by the floatformat. Returns size to be used. */ | |
2796 | ||
2797 | static int | |
0db7851f | 2798 | verify_floatformat (int bit, const struct floatformat *floatformat) |
19f392bc | 2799 | { |
0db7851f | 2800 | gdb_assert (floatformat != NULL); |
9b790ce7 | 2801 | |
19f392bc | 2802 | if (bit == -1) |
0db7851f | 2803 | bit = floatformat->totalsize; |
19f392bc | 2804 | |
0db7851f UW |
2805 | gdb_assert (bit >= 0); |
2806 | gdb_assert (bit >= floatformat->totalsize); | |
19f392bc UW |
2807 | |
2808 | return bit; | |
2809 | } | |
2810 | ||
0db7851f UW |
2811 | /* Return the floating-point format for a floating-point variable of |
2812 | type TYPE. */ | |
2813 | ||
2814 | const struct floatformat * | |
2815 | floatformat_from_type (const struct type *type) | |
2816 | { | |
2817 | gdb_assert (TYPE_CODE (type) == TYPE_CODE_FLT); | |
2818 | gdb_assert (TYPE_FLOATFORMAT (type)); | |
2819 | return TYPE_FLOATFORMAT (type); | |
2820 | } | |
2821 | ||
c906108c SS |
2822 | /* Helper function to initialize the standard scalar types. |
2823 | ||
86f62fd7 TT |
2824 | If NAME is non-NULL, then it is used to initialize the type name. |
2825 | Note that NAME is not copied; it is required to have a lifetime at | |
2826 | least as long as OBJFILE. */ | |
c906108c SS |
2827 | |
2828 | struct type * | |
77b7c781 | 2829 | init_type (struct objfile *objfile, enum type_code code, int bit, |
19f392bc | 2830 | const char *name) |
c906108c | 2831 | { |
52f0bd74 | 2832 | struct type *type; |
c906108c SS |
2833 | |
2834 | type = alloc_type (objfile); | |
ae438bc5 | 2835 | set_type_code (type, code); |
77b7c781 UW |
2836 | gdb_assert ((bit % TARGET_CHAR_BIT) == 0); |
2837 | TYPE_LENGTH (type) = bit / TARGET_CHAR_BIT; | |
86f62fd7 | 2838 | TYPE_NAME (type) = name; |
c906108c | 2839 | |
c16abbde | 2840 | return type; |
c906108c | 2841 | } |
19f392bc | 2842 | |
46a4882b PA |
2843 | /* Allocate a TYPE_CODE_ERROR type structure associated with OBJFILE, |
2844 | to use with variables that have no debug info. NAME is the type | |
2845 | name. */ | |
2846 | ||
2847 | static struct type * | |
2848 | init_nodebug_var_type (struct objfile *objfile, const char *name) | |
2849 | { | |
2850 | return init_type (objfile, TYPE_CODE_ERROR, 0, name); | |
2851 | } | |
2852 | ||
19f392bc UW |
2853 | /* Allocate a TYPE_CODE_INT type structure associated with OBJFILE. |
2854 | BIT is the type size in bits. If UNSIGNED_P is non-zero, set | |
2855 | the type's TYPE_UNSIGNED flag. NAME is the type name. */ | |
2856 | ||
2857 | struct type * | |
2858 | init_integer_type (struct objfile *objfile, | |
2859 | int bit, int unsigned_p, const char *name) | |
2860 | { | |
2861 | struct type *t; | |
2862 | ||
77b7c781 | 2863 | t = init_type (objfile, TYPE_CODE_INT, bit, name); |
19f392bc UW |
2864 | if (unsigned_p) |
2865 | TYPE_UNSIGNED (t) = 1; | |
2866 | ||
2867 | return t; | |
2868 | } | |
2869 | ||
2870 | /* Allocate a TYPE_CODE_CHAR type structure associated with OBJFILE. | |
2871 | BIT is the type size in bits. If UNSIGNED_P is non-zero, set | |
2872 | the type's TYPE_UNSIGNED flag. NAME is the type name. */ | |
2873 | ||
2874 | struct type * | |
2875 | init_character_type (struct objfile *objfile, | |
2876 | int bit, int unsigned_p, const char *name) | |
2877 | { | |
2878 | struct type *t; | |
2879 | ||
77b7c781 | 2880 | t = init_type (objfile, TYPE_CODE_CHAR, bit, name); |
19f392bc UW |
2881 | if (unsigned_p) |
2882 | TYPE_UNSIGNED (t) = 1; | |
2883 | ||
2884 | return t; | |
2885 | } | |
2886 | ||
2887 | /* Allocate a TYPE_CODE_BOOL type structure associated with OBJFILE. | |
2888 | BIT is the type size in bits. If UNSIGNED_P is non-zero, set | |
2889 | the type's TYPE_UNSIGNED flag. NAME is the type name. */ | |
2890 | ||
2891 | struct type * | |
2892 | init_boolean_type (struct objfile *objfile, | |
2893 | int bit, int unsigned_p, const char *name) | |
2894 | { | |
2895 | struct type *t; | |
2896 | ||
77b7c781 | 2897 | t = init_type (objfile, TYPE_CODE_BOOL, bit, name); |
19f392bc UW |
2898 | if (unsigned_p) |
2899 | TYPE_UNSIGNED (t) = 1; | |
2900 | ||
2901 | return t; | |
2902 | } | |
2903 | ||
2904 | /* Allocate a TYPE_CODE_FLT type structure associated with OBJFILE. | |
2905 | BIT is the type size in bits; if BIT equals -1, the size is | |
2906 | determined by the floatformat. NAME is the type name. Set the | |
2907 | TYPE_FLOATFORMAT from FLOATFORMATS. */ | |
2908 | ||
2909 | struct type * | |
2910 | init_float_type (struct objfile *objfile, | |
2911 | int bit, const char *name, | |
2912 | const struct floatformat **floatformats) | |
2913 | { | |
0db7851f UW |
2914 | struct gdbarch *gdbarch = get_objfile_arch (objfile); |
2915 | const struct floatformat *fmt = floatformats[gdbarch_byte_order (gdbarch)]; | |
19f392bc UW |
2916 | struct type *t; |
2917 | ||
0db7851f | 2918 | bit = verify_floatformat (bit, fmt); |
77b7c781 | 2919 | t = init_type (objfile, TYPE_CODE_FLT, bit, name); |
0db7851f | 2920 | TYPE_FLOATFORMAT (t) = fmt; |
19f392bc UW |
2921 | |
2922 | return t; | |
2923 | } | |
2924 | ||
2925 | /* Allocate a TYPE_CODE_DECFLOAT type structure associated with OBJFILE. | |
2926 | BIT is the type size in bits. NAME is the type name. */ | |
2927 | ||
2928 | struct type * | |
2929 | init_decfloat_type (struct objfile *objfile, int bit, const char *name) | |
2930 | { | |
2931 | struct type *t; | |
2932 | ||
77b7c781 | 2933 | t = init_type (objfile, TYPE_CODE_DECFLOAT, bit, name); |
19f392bc UW |
2934 | return t; |
2935 | } | |
2936 | ||
2937 | /* Allocate a TYPE_CODE_COMPLEX type structure associated with OBJFILE. | |
2938 | NAME is the type name. TARGET_TYPE is the component float type. */ | |
2939 | ||
2940 | struct type * | |
2941 | init_complex_type (struct objfile *objfile, | |
2942 | const char *name, struct type *target_type) | |
2943 | { | |
2944 | struct type *t; | |
2945 | ||
2946 | t = init_type (objfile, TYPE_CODE_COMPLEX, | |
77b7c781 | 2947 | 2 * TYPE_LENGTH (target_type) * TARGET_CHAR_BIT, name); |
19f392bc UW |
2948 | TYPE_TARGET_TYPE (t) = target_type; |
2949 | return t; | |
2950 | } | |
2951 | ||
2952 | /* Allocate a TYPE_CODE_PTR type structure associated with OBJFILE. | |
2953 | BIT is the pointer type size in bits. NAME is the type name. | |
2954 | TARGET_TYPE is the pointer target type. Always sets the pointer type's | |
2955 | TYPE_UNSIGNED flag. */ | |
2956 | ||
2957 | struct type * | |
2958 | init_pointer_type (struct objfile *objfile, | |
2959 | int bit, const char *name, struct type *target_type) | |
2960 | { | |
2961 | struct type *t; | |
2962 | ||
77b7c781 | 2963 | t = init_type (objfile, TYPE_CODE_PTR, bit, name); |
19f392bc UW |
2964 | TYPE_TARGET_TYPE (t) = target_type; |
2965 | TYPE_UNSIGNED (t) = 1; | |
2966 | return t; | |
2967 | } | |
2968 | ||
2b4424c3 TT |
2969 | /* See gdbtypes.h. */ |
2970 | ||
2971 | unsigned | |
2972 | type_raw_align (struct type *type) | |
2973 | { | |
2974 | if (type->align_log2 != 0) | |
2975 | return 1 << (type->align_log2 - 1); | |
2976 | return 0; | |
2977 | } | |
2978 | ||
2979 | /* See gdbtypes.h. */ | |
2980 | ||
2981 | unsigned | |
2982 | type_align (struct type *type) | |
2983 | { | |
5561fc30 | 2984 | /* Check alignment provided in the debug information. */ |
2b4424c3 TT |
2985 | unsigned raw_align = type_raw_align (type); |
2986 | if (raw_align != 0) | |
2987 | return raw_align; | |
2988 | ||
5561fc30 AB |
2989 | /* Allow the architecture to provide an alignment. */ |
2990 | struct gdbarch *arch = get_type_arch (type); | |
2991 | ULONGEST align = gdbarch_type_align (arch, type); | |
2992 | if (align != 0) | |
2993 | return align; | |
2994 | ||
2b4424c3 TT |
2995 | switch (TYPE_CODE (type)) |
2996 | { | |
2997 | case TYPE_CODE_PTR: | |
2998 | case TYPE_CODE_FUNC: | |
2999 | case TYPE_CODE_FLAGS: | |
3000 | case TYPE_CODE_INT: | |
75ba10dc | 3001 | case TYPE_CODE_RANGE: |
2b4424c3 TT |
3002 | case TYPE_CODE_FLT: |
3003 | case TYPE_CODE_ENUM: | |
3004 | case TYPE_CODE_REF: | |
3005 | case TYPE_CODE_RVALUE_REF: | |
3006 | case TYPE_CODE_CHAR: | |
3007 | case TYPE_CODE_BOOL: | |
3008 | case TYPE_CODE_DECFLOAT: | |
70cd633e AB |
3009 | case TYPE_CODE_METHODPTR: |
3010 | case TYPE_CODE_MEMBERPTR: | |
5561fc30 | 3011 | align = type_length_units (check_typedef (type)); |
2b4424c3 TT |
3012 | break; |
3013 | ||
3014 | case TYPE_CODE_ARRAY: | |
3015 | case TYPE_CODE_COMPLEX: | |
3016 | case TYPE_CODE_TYPEDEF: | |
3017 | align = type_align (TYPE_TARGET_TYPE (type)); | |
3018 | break; | |
3019 | ||
3020 | case TYPE_CODE_STRUCT: | |
3021 | case TYPE_CODE_UNION: | |
3022 | { | |
41077b66 | 3023 | int number_of_non_static_fields = 0; |
2b4424c3 TT |
3024 | for (unsigned i = 0; i < TYPE_NFIELDS (type); ++i) |
3025 | { | |
bf9a735e | 3026 | if (!field_is_static (&TYPE_FIELD (type, i))) |
2b4424c3 | 3027 | { |
41077b66 | 3028 | number_of_non_static_fields++; |
bf9a735e AB |
3029 | ULONGEST f_align = type_align (TYPE_FIELD_TYPE (type, i)); |
3030 | if (f_align == 0) | |
3031 | { | |
3032 | /* Don't pretend we know something we don't. */ | |
3033 | align = 0; | |
3034 | break; | |
3035 | } | |
3036 | if (f_align > align) | |
3037 | align = f_align; | |
2b4424c3 | 3038 | } |
2b4424c3 | 3039 | } |
41077b66 AB |
3040 | /* A struct with no fields, or with only static fields has an |
3041 | alignment of 1. */ | |
3042 | if (number_of_non_static_fields == 0) | |
3043 | align = 1; | |
2b4424c3 TT |
3044 | } |
3045 | break; | |
3046 | ||
3047 | case TYPE_CODE_SET: | |
2b4424c3 TT |
3048 | case TYPE_CODE_STRING: |
3049 | /* Not sure what to do here, and these can't appear in C or C++ | |
3050 | anyway. */ | |
3051 | break; | |
3052 | ||
2b4424c3 TT |
3053 | case TYPE_CODE_VOID: |
3054 | align = 1; | |
3055 | break; | |
3056 | ||
3057 | case TYPE_CODE_ERROR: | |
3058 | case TYPE_CODE_METHOD: | |
3059 | default: | |
3060 | break; | |
3061 | } | |
3062 | ||
3063 | if ((align & (align - 1)) != 0) | |
3064 | { | |
3065 | /* Not a power of 2, so pass. */ | |
3066 | align = 0; | |
3067 | } | |
3068 | ||
3069 | return align; | |
3070 | } | |
3071 | ||
3072 | /* See gdbtypes.h. */ | |
3073 | ||
3074 | bool | |
3075 | set_type_align (struct type *type, ULONGEST align) | |
3076 | { | |
3077 | /* Must be a power of 2. Zero is ok. */ | |
3078 | gdb_assert ((align & (align - 1)) == 0); | |
3079 | ||
3080 | unsigned result = 0; | |
3081 | while (align != 0) | |
3082 | { | |
3083 | ++result; | |
3084 | align >>= 1; | |
3085 | } | |
3086 | ||
3087 | if (result >= (1 << TYPE_ALIGN_BITS)) | |
3088 | return false; | |
3089 | ||
3090 | type->align_log2 = result; | |
3091 | return true; | |
3092 | } | |
3093 | ||
5212577a DE |
3094 | \f |
3095 | /* Queries on types. */ | |
c906108c | 3096 | |
c906108c | 3097 | int |
fba45db2 | 3098 | can_dereference (struct type *t) |
c906108c | 3099 | { |
7ba81444 MS |
3100 | /* FIXME: Should we return true for references as well as |
3101 | pointers? */ | |
f168693b | 3102 | t = check_typedef (t); |
c906108c SS |
3103 | return |
3104 | (t != NULL | |
3105 | && TYPE_CODE (t) == TYPE_CODE_PTR | |
3106 | && TYPE_CODE (TYPE_TARGET_TYPE (t)) != TYPE_CODE_VOID); | |
3107 | } | |
3108 | ||
adf40b2e | 3109 | int |
fba45db2 | 3110 | is_integral_type (struct type *t) |
adf40b2e | 3111 | { |
f168693b | 3112 | t = check_typedef (t); |
adf40b2e JM |
3113 | return |
3114 | ((t != NULL) | |
d4f3574e SS |
3115 | && ((TYPE_CODE (t) == TYPE_CODE_INT) |
3116 | || (TYPE_CODE (t) == TYPE_CODE_ENUM) | |
4f2aea11 | 3117 | || (TYPE_CODE (t) == TYPE_CODE_FLAGS) |
d4f3574e SS |
3118 | || (TYPE_CODE (t) == TYPE_CODE_CHAR) |
3119 | || (TYPE_CODE (t) == TYPE_CODE_RANGE) | |
3120 | || (TYPE_CODE (t) == TYPE_CODE_BOOL))); | |
adf40b2e JM |
3121 | } |
3122 | ||
70100014 UW |
3123 | int |
3124 | is_floating_type (struct type *t) | |
3125 | { | |
3126 | t = check_typedef (t); | |
3127 | return | |
3128 | ((t != NULL) | |
3129 | && ((TYPE_CODE (t) == TYPE_CODE_FLT) | |
3130 | || (TYPE_CODE (t) == TYPE_CODE_DECFLOAT))); | |
3131 | } | |
3132 | ||
e09342b5 TJB |
3133 | /* Return true if TYPE is scalar. */ |
3134 | ||
220475ed | 3135 | int |
e09342b5 TJB |
3136 | is_scalar_type (struct type *type) |
3137 | { | |
f168693b | 3138 | type = check_typedef (type); |
e09342b5 TJB |
3139 | |
3140 | switch (TYPE_CODE (type)) | |
3141 | { | |
3142 | case TYPE_CODE_ARRAY: | |
3143 | case TYPE_CODE_STRUCT: | |
3144 | case TYPE_CODE_UNION: | |
3145 | case TYPE_CODE_SET: | |
3146 | case TYPE_CODE_STRING: | |
e09342b5 TJB |
3147 | return 0; |
3148 | default: | |
3149 | return 1; | |
3150 | } | |
3151 | } | |
3152 | ||
3153 | /* Return true if T is scalar, or a composite type which in practice has | |
90e4670f TJB |
3154 | the memory layout of a scalar type. E.g., an array or struct with only |
3155 | one scalar element inside it, or a union with only scalar elements. */ | |
e09342b5 TJB |
3156 | |
3157 | int | |
3158 | is_scalar_type_recursive (struct type *t) | |
3159 | { | |
f168693b | 3160 | t = check_typedef (t); |
e09342b5 TJB |
3161 | |
3162 | if (is_scalar_type (t)) | |
3163 | return 1; | |
3164 | /* Are we dealing with an array or string of known dimensions? */ | |
3165 | else if ((TYPE_CODE (t) == TYPE_CODE_ARRAY | |
3166 | || TYPE_CODE (t) == TYPE_CODE_STRING) && TYPE_NFIELDS (t) == 1 | |
3167 | && TYPE_CODE (TYPE_INDEX_TYPE (t)) == TYPE_CODE_RANGE) | |
3168 | { | |
3169 | LONGEST low_bound, high_bound; | |
3170 | struct type *elt_type = check_typedef (TYPE_TARGET_TYPE (t)); | |
3171 | ||
3172 | get_discrete_bounds (TYPE_INDEX_TYPE (t), &low_bound, &high_bound); | |
3173 | ||
3174 | return high_bound == low_bound && is_scalar_type_recursive (elt_type); | |
3175 | } | |
3176 | /* Are we dealing with a struct with one element? */ | |
3177 | else if (TYPE_CODE (t) == TYPE_CODE_STRUCT && TYPE_NFIELDS (t) == 1) | |
3178 | return is_scalar_type_recursive (TYPE_FIELD_TYPE (t, 0)); | |
3179 | else if (TYPE_CODE (t) == TYPE_CODE_UNION) | |
3180 | { | |
3181 | int i, n = TYPE_NFIELDS (t); | |
3182 | ||
3183 | /* If all elements of the union are scalar, then the union is scalar. */ | |
3184 | for (i = 0; i < n; i++) | |
3185 | if (!is_scalar_type_recursive (TYPE_FIELD_TYPE (t, i))) | |
3186 | return 0; | |
3187 | ||
3188 | return 1; | |
3189 | } | |
3190 | ||
3191 | return 0; | |
3192 | } | |
3193 | ||
6c659fc2 SC |
3194 | /* Return true is T is a class or a union. False otherwise. */ |
3195 | ||
3196 | int | |
3197 | class_or_union_p (const struct type *t) | |
3198 | { | |
3199 | return (TYPE_CODE (t) == TYPE_CODE_STRUCT | |
3200 | || TYPE_CODE (t) == TYPE_CODE_UNION); | |
3201 | } | |
3202 | ||
4e8f195d TT |
3203 | /* A helper function which returns true if types A and B represent the |
3204 | "same" class type. This is true if the types have the same main | |
3205 | type, or the same name. */ | |
3206 | ||
3207 | int | |
3208 | class_types_same_p (const struct type *a, const struct type *b) | |
3209 | { | |
3210 | return (TYPE_MAIN_TYPE (a) == TYPE_MAIN_TYPE (b) | |
3211 | || (TYPE_NAME (a) && TYPE_NAME (b) | |
3212 | && !strcmp (TYPE_NAME (a), TYPE_NAME (b)))); | |
3213 | } | |
3214 | ||
a9d5ef47 SW |
3215 | /* If BASE is an ancestor of DCLASS return the distance between them. |
3216 | otherwise return -1; | |
3217 | eg: | |
3218 | ||
3219 | class A {}; | |
3220 | class B: public A {}; | |
3221 | class C: public B {}; | |
3222 | class D: C {}; | |
3223 | ||
3224 | distance_to_ancestor (A, A, 0) = 0 | |
3225 | distance_to_ancestor (A, B, 0) = 1 | |
3226 | distance_to_ancestor (A, C, 0) = 2 | |
3227 | distance_to_ancestor (A, D, 0) = 3 | |
3228 | ||
3229 | If PUBLIC is 1 then only public ancestors are considered, | |
3230 | and the function returns the distance only if BASE is a public ancestor | |
3231 | of DCLASS. | |
3232 | Eg: | |
3233 | ||
0963b4bd | 3234 | distance_to_ancestor (A, D, 1) = -1. */ |
c906108c | 3235 | |
0526b37a | 3236 | static int |
fe978cb0 | 3237 | distance_to_ancestor (struct type *base, struct type *dclass, int is_public) |
c906108c SS |
3238 | { |
3239 | int i; | |
a9d5ef47 | 3240 | int d; |
c5aa993b | 3241 | |
f168693b SM |
3242 | base = check_typedef (base); |
3243 | dclass = check_typedef (dclass); | |
c906108c | 3244 | |
4e8f195d | 3245 | if (class_types_same_p (base, dclass)) |
a9d5ef47 | 3246 | return 0; |
c906108c SS |
3247 | |
3248 | for (i = 0; i < TYPE_N_BASECLASSES (dclass); i++) | |
4e8f195d | 3249 | { |
fe978cb0 | 3250 | if (is_public && ! BASETYPE_VIA_PUBLIC (dclass, i)) |
0526b37a SW |
3251 | continue; |
3252 | ||
fe978cb0 | 3253 | d = distance_to_ancestor (base, TYPE_BASECLASS (dclass, i), is_public); |
a9d5ef47 SW |
3254 | if (d >= 0) |
3255 | return 1 + d; | |
4e8f195d | 3256 | } |
c906108c | 3257 | |
a9d5ef47 | 3258 | return -1; |
c906108c | 3259 | } |
4e8f195d | 3260 | |
0526b37a SW |
3261 | /* Check whether BASE is an ancestor or base class or DCLASS |
3262 | Return 1 if so, and 0 if not. | |
3263 | Note: If BASE and DCLASS are of the same type, this function | |
3264 | will return 1. So for some class A, is_ancestor (A, A) will | |
3265 | return 1. */ | |
3266 | ||
3267 | int | |
3268 | is_ancestor (struct type *base, struct type *dclass) | |
3269 | { | |
a9d5ef47 | 3270 | return distance_to_ancestor (base, dclass, 0) >= 0; |
0526b37a SW |
3271 | } |
3272 | ||
4e8f195d TT |
3273 | /* Like is_ancestor, but only returns true when BASE is a public |
3274 | ancestor of DCLASS. */ | |
3275 | ||
3276 | int | |
3277 | is_public_ancestor (struct type *base, struct type *dclass) | |
3278 | { | |
a9d5ef47 | 3279 | return distance_to_ancestor (base, dclass, 1) >= 0; |
4e8f195d TT |
3280 | } |
3281 | ||
3282 | /* A helper function for is_unique_ancestor. */ | |
3283 | ||
3284 | static int | |
3285 | is_unique_ancestor_worker (struct type *base, struct type *dclass, | |
3286 | int *offset, | |
8af8e3bc PA |
3287 | const gdb_byte *valaddr, int embedded_offset, |
3288 | CORE_ADDR address, struct value *val) | |
4e8f195d TT |
3289 | { |
3290 | int i, count = 0; | |
3291 | ||
f168693b SM |
3292 | base = check_typedef (base); |
3293 | dclass = check_typedef (dclass); | |
4e8f195d TT |
3294 | |
3295 | for (i = 0; i < TYPE_N_BASECLASSES (dclass) && count < 2; ++i) | |
3296 | { | |
8af8e3bc PA |
3297 | struct type *iter; |
3298 | int this_offset; | |
4e8f195d | 3299 | |
8af8e3bc PA |
3300 | iter = check_typedef (TYPE_BASECLASS (dclass, i)); |
3301 | ||
3302 | this_offset = baseclass_offset (dclass, i, valaddr, embedded_offset, | |
3303 | address, val); | |
4e8f195d TT |
3304 | |
3305 | if (class_types_same_p (base, iter)) | |
3306 | { | |
3307 | /* If this is the first subclass, set *OFFSET and set count | |
3308 | to 1. Otherwise, if this is at the same offset as | |
3309 | previous instances, do nothing. Otherwise, increment | |
3310 | count. */ | |
3311 | if (*offset == -1) | |
3312 | { | |
3313 | *offset = this_offset; | |
3314 | count = 1; | |
3315 | } | |
3316 | else if (this_offset == *offset) | |
3317 | { | |
3318 | /* Nothing. */ | |
3319 | } | |
3320 | else | |
3321 | ++count; | |
3322 | } | |
3323 | else | |
3324 | count += is_unique_ancestor_worker (base, iter, offset, | |
8af8e3bc PA |
3325 | valaddr, |
3326 | embedded_offset + this_offset, | |
3327 | address, val); | |
4e8f195d TT |
3328 | } |
3329 | ||
3330 | return count; | |
3331 | } | |
3332 | ||
3333 | /* Like is_ancestor, but only returns true if BASE is a unique base | |
3334 | class of the type of VAL. */ | |
3335 | ||
3336 | int | |
3337 | is_unique_ancestor (struct type *base, struct value *val) | |
3338 | { | |
3339 | int offset = -1; | |
3340 | ||
3341 | return is_unique_ancestor_worker (base, value_type (val), &offset, | |
8af8e3bc PA |
3342 | value_contents_for_printing (val), |
3343 | value_embedded_offset (val), | |
3344 | value_address (val), val) == 1; | |
4e8f195d TT |
3345 | } |
3346 | ||
c906108c | 3347 | \f |
5212577a | 3348 | /* Overload resolution. */ |
c906108c | 3349 | |
6403aeea SW |
3350 | /* Return the sum of the rank of A with the rank of B. */ |
3351 | ||
3352 | struct rank | |
3353 | sum_ranks (struct rank a, struct rank b) | |
3354 | { | |
3355 | struct rank c; | |
3356 | c.rank = a.rank + b.rank; | |
a9d5ef47 | 3357 | c.subrank = a.subrank + b.subrank; |
6403aeea SW |
3358 | return c; |
3359 | } | |
3360 | ||
3361 | /* Compare rank A and B and return: | |
3362 | 0 if a = b | |
3363 | 1 if a is better than b | |
3364 | -1 if b is better than a. */ | |
3365 | ||
3366 | int | |
3367 | compare_ranks (struct rank a, struct rank b) | |
3368 | { | |
3369 | if (a.rank == b.rank) | |
a9d5ef47 SW |
3370 | { |
3371 | if (a.subrank == b.subrank) | |
3372 | return 0; | |
3373 | if (a.subrank < b.subrank) | |
3374 | return 1; | |
3375 | if (a.subrank > b.subrank) | |
3376 | return -1; | |
3377 | } | |
6403aeea SW |
3378 | |
3379 | if (a.rank < b.rank) | |
3380 | return 1; | |
3381 | ||
0963b4bd | 3382 | /* a.rank > b.rank */ |
6403aeea SW |
3383 | return -1; |
3384 | } | |
c5aa993b | 3385 | |
0963b4bd | 3386 | /* Functions for overload resolution begin here. */ |
c906108c SS |
3387 | |
3388 | /* Compare two badness vectors A and B and return the result. | |
7ba81444 MS |
3389 | 0 => A and B are identical |
3390 | 1 => A and B are incomparable | |
3391 | 2 => A is better than B | |
3392 | 3 => A is worse than B */ | |
c906108c SS |
3393 | |
3394 | int | |
82ceee50 | 3395 | compare_badness (const badness_vector &a, const badness_vector &b) |
c906108c SS |
3396 | { |
3397 | int i; | |
3398 | int tmp; | |
c5aa993b JM |
3399 | short found_pos = 0; /* any positives in c? */ |
3400 | short found_neg = 0; /* any negatives in c? */ | |
3401 | ||
82ceee50 PA |
3402 | /* differing sizes => incomparable */ |
3403 | if (a.size () != b.size ()) | |
c906108c SS |
3404 | return 1; |
3405 | ||
c5aa993b | 3406 | /* Subtract b from a */ |
82ceee50 | 3407 | for (i = 0; i < a.size (); i++) |
c906108c | 3408 | { |
82ceee50 | 3409 | tmp = compare_ranks (b[i], a[i]); |
c906108c | 3410 | if (tmp > 0) |
c5aa993b | 3411 | found_pos = 1; |
c906108c | 3412 | else if (tmp < 0) |
c5aa993b | 3413 | found_neg = 1; |
c906108c SS |
3414 | } |
3415 | ||
3416 | if (found_pos) | |
3417 | { | |
3418 | if (found_neg) | |
c5aa993b | 3419 | return 1; /* incomparable */ |
c906108c | 3420 | else |
c5aa993b | 3421 | return 3; /* A > B */ |
c906108c | 3422 | } |
c5aa993b JM |
3423 | else |
3424 | /* no positives */ | |
c906108c SS |
3425 | { |
3426 | if (found_neg) | |
c5aa993b | 3427 | return 2; /* A < B */ |
c906108c | 3428 | else |
c5aa993b | 3429 | return 0; /* A == B */ |
c906108c SS |
3430 | } |
3431 | } | |
3432 | ||
6b1747cd | 3433 | /* Rank a function by comparing its parameter types (PARMS), to the |
82ceee50 PA |
3434 | types of an argument list (ARGS). Return the badness vector. This |
3435 | has ARGS.size() + 1 entries. */ | |
c906108c | 3436 | |
82ceee50 | 3437 | badness_vector |
6b1747cd PA |
3438 | rank_function (gdb::array_view<type *> parms, |
3439 | gdb::array_view<value *> args) | |
c906108c | 3440 | { |
82ceee50 PA |
3441 | /* add 1 for the length-match rank. */ |
3442 | badness_vector bv; | |
3443 | bv.reserve (1 + args.size ()); | |
c906108c SS |
3444 | |
3445 | /* First compare the lengths of the supplied lists. | |
7ba81444 | 3446 | If there is a mismatch, set it to a high value. */ |
c5aa993b | 3447 | |
c906108c | 3448 | /* pai/1997-06-03 FIXME: when we have debug info about default |
7ba81444 MS |
3449 | arguments and ellipsis parameter lists, we should consider those |
3450 | and rank the length-match more finely. */ | |
c906108c | 3451 | |
82ceee50 PA |
3452 | bv.push_back ((args.size () != parms.size ()) |
3453 | ? LENGTH_MISMATCH_BADNESS | |
3454 | : EXACT_MATCH_BADNESS); | |
c906108c | 3455 | |
0963b4bd | 3456 | /* Now rank all the parameters of the candidate function. */ |
82ceee50 PA |
3457 | size_t min_len = std::min (parms.size (), args.size ()); |
3458 | ||
3459 | for (size_t i = 0; i < min_len; i++) | |
3460 | bv.push_back (rank_one_type (parms[i], value_type (args[i]), | |
3461 | args[i])); | |
c906108c | 3462 | |
0963b4bd | 3463 | /* If more arguments than parameters, add dummy entries. */ |
82ceee50 PA |
3464 | for (size_t i = min_len; i < args.size (); i++) |
3465 | bv.push_back (TOO_FEW_PARAMS_BADNESS); | |
c906108c SS |
3466 | |
3467 | return bv; | |
3468 | } | |
3469 | ||
973ccf8b DJ |
3470 | /* Compare the names of two integer types, assuming that any sign |
3471 | qualifiers have been checked already. We do it this way because | |
3472 | there may be an "int" in the name of one of the types. */ | |
3473 | ||
3474 | static int | |
3475 | integer_types_same_name_p (const char *first, const char *second) | |
3476 | { | |
3477 | int first_p, second_p; | |
3478 | ||
7ba81444 MS |
3479 | /* If both are shorts, return 1; if neither is a short, keep |
3480 | checking. */ | |
973ccf8b DJ |
3481 | first_p = (strstr (first, "short") != NULL); |
3482 | second_p = (strstr (second, "short") != NULL); | |
3483 | if (first_p && second_p) | |
3484 | return 1; | |
3485 | if (first_p || second_p) | |
3486 | return 0; | |
3487 | ||
3488 | /* Likewise for long. */ | |
3489 | first_p = (strstr (first, "long") != NULL); | |
3490 | second_p = (strstr (second, "long") != NULL); | |
3491 | if (first_p && second_p) | |
3492 | return 1; | |
3493 | if (first_p || second_p) | |
3494 | return 0; | |
3495 | ||
3496 | /* Likewise for char. */ | |
3497 | first_p = (strstr (first, "char") != NULL); | |
3498 | second_p = (strstr (second, "char") != NULL); | |
3499 | if (first_p && second_p) | |
3500 | return 1; | |
3501 | if (first_p || second_p) | |
3502 | return 0; | |
3503 | ||
3504 | /* They must both be ints. */ | |
3505 | return 1; | |
3506 | } | |
3507 | ||
894882e3 TT |
3508 | /* Compares type A to type B. Returns true if they represent the same |
3509 | type, false otherwise. */ | |
7062b0a0 | 3510 | |
894882e3 | 3511 | bool |
7062b0a0 SW |
3512 | types_equal (struct type *a, struct type *b) |
3513 | { | |
3514 | /* Identical type pointers. */ | |
3515 | /* However, this still doesn't catch all cases of same type for b | |
3516 | and a. The reason is that builtin types are different from | |
3517 | the same ones constructed from the object. */ | |
3518 | if (a == b) | |
894882e3 | 3519 | return true; |
7062b0a0 SW |
3520 | |
3521 | /* Resolve typedefs */ | |
3522 | if (TYPE_CODE (a) == TYPE_CODE_TYPEDEF) | |
3523 | a = check_typedef (a); | |
3524 | if (TYPE_CODE (b) == TYPE_CODE_TYPEDEF) | |
3525 | b = check_typedef (b); | |
3526 | ||
3527 | /* If after resolving typedefs a and b are not of the same type | |
3528 | code then they are not equal. */ | |
3529 | if (TYPE_CODE (a) != TYPE_CODE (b)) | |
894882e3 | 3530 | return false; |
7062b0a0 SW |
3531 | |
3532 | /* If a and b are both pointers types or both reference types then | |
3533 | they are equal of the same type iff the objects they refer to are | |
3534 | of the same type. */ | |
3535 | if (TYPE_CODE (a) == TYPE_CODE_PTR | |
3536 | || TYPE_CODE (a) == TYPE_CODE_REF) | |
3537 | return types_equal (TYPE_TARGET_TYPE (a), | |
3538 | TYPE_TARGET_TYPE (b)); | |
3539 | ||
0963b4bd | 3540 | /* Well, damnit, if the names are exactly the same, I'll say they |
7062b0a0 SW |
3541 | are exactly the same. This happens when we generate method |
3542 | stubs. The types won't point to the same address, but they | |
0963b4bd | 3543 | really are the same. */ |
7062b0a0 SW |
3544 | |
3545 | if (TYPE_NAME (a) && TYPE_NAME (b) | |
3546 | && strcmp (TYPE_NAME (a), TYPE_NAME (b)) == 0) | |
894882e3 | 3547 | return true; |
7062b0a0 SW |
3548 | |
3549 | /* Check if identical after resolving typedefs. */ | |
3550 | if (a == b) | |
894882e3 | 3551 | return true; |
7062b0a0 | 3552 | |
9ce98649 TT |
3553 | /* Two function types are equal if their argument and return types |
3554 | are equal. */ | |
3555 | if (TYPE_CODE (a) == TYPE_CODE_FUNC) | |
3556 | { | |
3557 | int i; | |
3558 | ||
3559 | if (TYPE_NFIELDS (a) != TYPE_NFIELDS (b)) | |
894882e3 | 3560 | return false; |
9ce98649 TT |
3561 | |
3562 | if (!types_equal (TYPE_TARGET_TYPE (a), TYPE_TARGET_TYPE (b))) | |
894882e3 | 3563 | return false; |
9ce98649 TT |
3564 | |
3565 | for (i = 0; i < TYPE_NFIELDS (a); ++i) | |
3566 | if (!types_equal (TYPE_FIELD_TYPE (a, i), TYPE_FIELD_TYPE (b, i))) | |
894882e3 | 3567 | return false; |
9ce98649 | 3568 | |
894882e3 | 3569 | return true; |
9ce98649 TT |
3570 | } |
3571 | ||
894882e3 | 3572 | return false; |
7062b0a0 | 3573 | } |
ca092b61 DE |
3574 | \f |
3575 | /* Deep comparison of types. */ | |
3576 | ||
3577 | /* An entry in the type-equality bcache. */ | |
3578 | ||
894882e3 | 3579 | struct type_equality_entry |
ca092b61 | 3580 | { |
894882e3 TT |
3581 | type_equality_entry (struct type *t1, struct type *t2) |
3582 | : type1 (t1), | |
3583 | type2 (t2) | |
3584 | { | |
3585 | } | |
ca092b61 | 3586 | |
894882e3 TT |
3587 | struct type *type1, *type2; |
3588 | }; | |
ca092b61 | 3589 | |
894882e3 TT |
3590 | /* A helper function to compare two strings. Returns true if they are |
3591 | the same, false otherwise. Handles NULLs properly. */ | |
ca092b61 | 3592 | |
894882e3 | 3593 | static bool |
ca092b61 DE |
3594 | compare_maybe_null_strings (const char *s, const char *t) |
3595 | { | |
894882e3 TT |
3596 | if (s == NULL || t == NULL) |
3597 | return s == t; | |
ca092b61 DE |
3598 | return strcmp (s, t) == 0; |
3599 | } | |
3600 | ||
3601 | /* A helper function for check_types_worklist that checks two types for | |
894882e3 TT |
3602 | "deep" equality. Returns true if the types are considered the |
3603 | same, false otherwise. */ | |
ca092b61 | 3604 | |
894882e3 | 3605 | static bool |
ca092b61 | 3606 | check_types_equal (struct type *type1, struct type *type2, |
894882e3 | 3607 | std::vector<type_equality_entry> *worklist) |
ca092b61 | 3608 | { |
f168693b SM |
3609 | type1 = check_typedef (type1); |
3610 | type2 = check_typedef (type2); | |
ca092b61 DE |
3611 | |
3612 | if (type1 == type2) | |
894882e3 | 3613 | return true; |
ca092b61 DE |
3614 | |
3615 | if (TYPE_CODE (type1) != TYPE_CODE (type2) | |
3616 | || TYPE_LENGTH (type1) != TYPE_LENGTH (type2) | |
3617 | || TYPE_UNSIGNED (type1) != TYPE_UNSIGNED (type2) | |
3618 | || TYPE_NOSIGN (type1) != TYPE_NOSIGN (type2) | |
34877895 | 3619 | || TYPE_ENDIANITY_NOT_DEFAULT (type1) != TYPE_ENDIANITY_NOT_DEFAULT (type2) |
ca092b61 DE |
3620 | || TYPE_VARARGS (type1) != TYPE_VARARGS (type2) |
3621 | || TYPE_VECTOR (type1) != TYPE_VECTOR (type2) | |
3622 | || TYPE_NOTTEXT (type1) != TYPE_NOTTEXT (type2) | |
3623 | || TYPE_INSTANCE_FLAGS (type1) != TYPE_INSTANCE_FLAGS (type2) | |
3624 | || TYPE_NFIELDS (type1) != TYPE_NFIELDS (type2)) | |
894882e3 | 3625 | return false; |
ca092b61 | 3626 | |
e86ca25f | 3627 | if (!compare_maybe_null_strings (TYPE_NAME (type1), TYPE_NAME (type2))) |
894882e3 | 3628 | return false; |
ca092b61 | 3629 | if (!compare_maybe_null_strings (TYPE_NAME (type1), TYPE_NAME (type2))) |
894882e3 | 3630 | return false; |
ca092b61 DE |
3631 | |
3632 | if (TYPE_CODE (type1) == TYPE_CODE_RANGE) | |
3633 | { | |
0f59d5fc | 3634 | if (*TYPE_RANGE_DATA (type1) != *TYPE_RANGE_DATA (type2)) |
894882e3 | 3635 | return false; |
ca092b61 DE |
3636 | } |
3637 | else | |
3638 | { | |
3639 | int i; | |
3640 | ||
3641 | for (i = 0; i < TYPE_NFIELDS (type1); ++i) | |
3642 | { | |
3643 | const struct field *field1 = &TYPE_FIELD (type1, i); | |
3644 | const struct field *field2 = &TYPE_FIELD (type2, i); | |
ca092b61 DE |
3645 | |
3646 | if (FIELD_ARTIFICIAL (*field1) != FIELD_ARTIFICIAL (*field2) | |
3647 | || FIELD_BITSIZE (*field1) != FIELD_BITSIZE (*field2) | |
3648 | || FIELD_LOC_KIND (*field1) != FIELD_LOC_KIND (*field2)) | |
894882e3 | 3649 | return false; |
ca092b61 DE |
3650 | if (!compare_maybe_null_strings (FIELD_NAME (*field1), |
3651 | FIELD_NAME (*field2))) | |
894882e3 | 3652 | return false; |
ca092b61 DE |
3653 | switch (FIELD_LOC_KIND (*field1)) |
3654 | { | |
3655 | case FIELD_LOC_KIND_BITPOS: | |
3656 | if (FIELD_BITPOS (*field1) != FIELD_BITPOS (*field2)) | |
894882e3 | 3657 | return false; |
ca092b61 DE |
3658 | break; |
3659 | case FIELD_LOC_KIND_ENUMVAL: | |
3660 | if (FIELD_ENUMVAL (*field1) != FIELD_ENUMVAL (*field2)) | |
894882e3 | 3661 | return false; |
ca092b61 DE |
3662 | break; |
3663 | case FIELD_LOC_KIND_PHYSADDR: | |
3664 | if (FIELD_STATIC_PHYSADDR (*field1) | |
3665 | != FIELD_STATIC_PHYSADDR (*field2)) | |
894882e3 | 3666 | return false; |
ca092b61 DE |
3667 | break; |
3668 | case FIELD_LOC_KIND_PHYSNAME: | |
3669 | if (!compare_maybe_null_strings (FIELD_STATIC_PHYSNAME (*field1), | |
3670 | FIELD_STATIC_PHYSNAME (*field2))) | |
894882e3 | 3671 | return false; |
ca092b61 DE |
3672 | break; |
3673 | case FIELD_LOC_KIND_DWARF_BLOCK: | |
3674 | { | |
3675 | struct dwarf2_locexpr_baton *block1, *block2; | |
3676 | ||
3677 | block1 = FIELD_DWARF_BLOCK (*field1); | |
3678 | block2 = FIELD_DWARF_BLOCK (*field2); | |
3679 | if (block1->per_cu != block2->per_cu | |
3680 | || block1->size != block2->size | |
3681 | || memcmp (block1->data, block2->data, block1->size) != 0) | |
894882e3 | 3682 | return false; |
ca092b61 DE |
3683 | } |
3684 | break; | |
3685 | default: | |
3686 | internal_error (__FILE__, __LINE__, _("Unsupported field kind " | |
3687 | "%d by check_types_equal"), | |
3688 | FIELD_LOC_KIND (*field1)); | |
3689 | } | |
3690 | ||
894882e3 | 3691 | worklist->emplace_back (FIELD_TYPE (*field1), FIELD_TYPE (*field2)); |
ca092b61 DE |
3692 | } |
3693 | } | |
3694 | ||
3695 | if (TYPE_TARGET_TYPE (type1) != NULL) | |
3696 | { | |
ca092b61 | 3697 | if (TYPE_TARGET_TYPE (type2) == NULL) |
894882e3 | 3698 | return false; |
ca092b61 | 3699 | |
894882e3 TT |
3700 | worklist->emplace_back (TYPE_TARGET_TYPE (type1), |
3701 | TYPE_TARGET_TYPE (type2)); | |
ca092b61 DE |
3702 | } |
3703 | else if (TYPE_TARGET_TYPE (type2) != NULL) | |
894882e3 | 3704 | return false; |
ca092b61 | 3705 | |
894882e3 | 3706 | return true; |
ca092b61 DE |
3707 | } |
3708 | ||
894882e3 TT |
3709 | /* Check types on a worklist for equality. Returns false if any pair |
3710 | is not equal, true if they are all considered equal. */ | |
ca092b61 | 3711 | |
894882e3 TT |
3712 | static bool |
3713 | check_types_worklist (std::vector<type_equality_entry> *worklist, | |
ca092b61 DE |
3714 | struct bcache *cache) |
3715 | { | |
894882e3 | 3716 | while (!worklist->empty ()) |
ca092b61 | 3717 | { |
ca092b61 DE |
3718 | int added; |
3719 | ||
894882e3 TT |
3720 | struct type_equality_entry entry = std::move (worklist->back ()); |
3721 | worklist->pop_back (); | |
ca092b61 DE |
3722 | |
3723 | /* If the type pair has already been visited, we know it is | |
3724 | ok. */ | |
25629dfd | 3725 | cache->insert (&entry, sizeof (entry), &added); |
ca092b61 DE |
3726 | if (!added) |
3727 | continue; | |
3728 | ||
894882e3 TT |
3729 | if (!check_types_equal (entry.type1, entry.type2, worklist)) |
3730 | return false; | |
ca092b61 | 3731 | } |
7062b0a0 | 3732 | |
894882e3 | 3733 | return true; |
ca092b61 DE |
3734 | } |
3735 | ||
894882e3 TT |
3736 | /* Return true if types TYPE1 and TYPE2 are equal, as determined by a |
3737 | "deep comparison". Otherwise return false. */ | |
ca092b61 | 3738 | |
894882e3 | 3739 | bool |
ca092b61 DE |
3740 | types_deeply_equal (struct type *type1, struct type *type2) |
3741 | { | |
894882e3 | 3742 | std::vector<type_equality_entry> worklist; |
ca092b61 DE |
3743 | |
3744 | gdb_assert (type1 != NULL && type2 != NULL); | |
3745 | ||
3746 | /* Early exit for the simple case. */ | |
3747 | if (type1 == type2) | |
894882e3 | 3748 | return true; |
ca092b61 | 3749 | |
25629dfd | 3750 | struct bcache cache (nullptr, nullptr); |
894882e3 | 3751 | worklist.emplace_back (type1, type2); |
25629dfd | 3752 | return check_types_worklist (&worklist, &cache); |
ca092b61 | 3753 | } |
3f2f83dd KB |
3754 | |
3755 | /* Allocated status of type TYPE. Return zero if type TYPE is allocated. | |
3756 | Otherwise return one. */ | |
3757 | ||
3758 | int | |
3759 | type_not_allocated (const struct type *type) | |
3760 | { | |
3761 | struct dynamic_prop *prop = TYPE_ALLOCATED_PROP (type); | |
3762 | ||
3763 | return (prop && TYPE_DYN_PROP_KIND (prop) == PROP_CONST | |
3764 | && !TYPE_DYN_PROP_ADDR (prop)); | |
3765 | } | |
3766 | ||
3767 | /* Associated status of type TYPE. Return zero if type TYPE is associated. | |
3768 | Otherwise return one. */ | |
3769 | ||
3770 | int | |
3771 | type_not_associated (const struct type *type) | |
3772 | { | |
3773 | struct dynamic_prop *prop = TYPE_ASSOCIATED_PROP (type); | |
3774 | ||
3775 | return (prop && TYPE_DYN_PROP_KIND (prop) == PROP_CONST | |
3776 | && !TYPE_DYN_PROP_ADDR (prop)); | |
3777 | } | |
9293fc63 SM |
3778 | |
3779 | /* rank_one_type helper for when PARM's type code is TYPE_CODE_PTR. */ | |
3780 | ||
3781 | static struct rank | |
3782 | rank_one_type_parm_ptr (struct type *parm, struct type *arg, struct value *value) | |
3783 | { | |
3784 | struct rank rank = {0,0}; | |
3785 | ||
3786 | switch (TYPE_CODE (arg)) | |
3787 | { | |
3788 | case TYPE_CODE_PTR: | |
3789 | ||
3790 | /* Allowed pointer conversions are: | |
3791 | (a) pointer to void-pointer conversion. */ | |
3792 | if (TYPE_CODE (TYPE_TARGET_TYPE (parm)) == TYPE_CODE_VOID) | |
3793 | return VOID_PTR_CONVERSION_BADNESS; | |
3794 | ||
3795 | /* (b) pointer to ancestor-pointer conversion. */ | |
3796 | rank.subrank = distance_to_ancestor (TYPE_TARGET_TYPE (parm), | |
3797 | TYPE_TARGET_TYPE (arg), | |
3798 | 0); | |
3799 | if (rank.subrank >= 0) | |
3800 | return sum_ranks (BASE_PTR_CONVERSION_BADNESS, rank); | |
3801 | ||
3802 | return INCOMPATIBLE_TYPE_BADNESS; | |
3803 | case TYPE_CODE_ARRAY: | |
3804 | { | |
3805 | struct type *t1 = TYPE_TARGET_TYPE (parm); | |
3806 | struct type *t2 = TYPE_TARGET_TYPE (arg); | |
3807 | ||
3808 | if (types_equal (t1, t2)) | |
3809 | { | |
3810 | /* Make sure they are CV equal. */ | |
3811 | if (TYPE_CONST (t1) != TYPE_CONST (t2)) | |
3812 | rank.subrank |= CV_CONVERSION_CONST; | |
3813 | if (TYPE_VOLATILE (t1) != TYPE_VOLATILE (t2)) | |
3814 | rank.subrank |= CV_CONVERSION_VOLATILE; | |
3815 | if (rank.subrank != 0) | |
3816 | return sum_ranks (CV_CONVERSION_BADNESS, rank); | |
3817 | return EXACT_MATCH_BADNESS; | |
3818 | } | |
3819 | return INCOMPATIBLE_TYPE_BADNESS; | |
3820 | } | |
3821 | case TYPE_CODE_FUNC: | |
3822 | return rank_one_type (TYPE_TARGET_TYPE (parm), arg, NULL); | |
3823 | case TYPE_CODE_INT: | |
3824 | if (value != NULL && TYPE_CODE (value_type (value)) == TYPE_CODE_INT) | |
3825 | { | |
3826 | if (value_as_long (value) == 0) | |
3827 | { | |
3828 | /* Null pointer conversion: allow it to be cast to a pointer. | |
3829 | [4.10.1 of C++ standard draft n3290] */ | |
3830 | return NULL_POINTER_CONVERSION_BADNESS; | |
3831 | } | |
3832 | else | |
3833 | { | |
3834 | /* If type checking is disabled, allow the conversion. */ | |
3835 | if (!strict_type_checking) | |
3836 | return NS_INTEGER_POINTER_CONVERSION_BADNESS; | |
3837 | } | |
3838 | } | |
3839 | /* fall through */ | |
3840 | case TYPE_CODE_ENUM: | |
3841 | case TYPE_CODE_FLAGS: | |
3842 | case TYPE_CODE_CHAR: | |
3843 | case TYPE_CODE_RANGE: | |
3844 | case TYPE_CODE_BOOL: | |
3845 | default: | |
3846 | return INCOMPATIBLE_TYPE_BADNESS; | |
3847 | } | |
3848 | } | |
3849 | ||
b9f4512f SM |
3850 | /* rank_one_type helper for when PARM's type code is TYPE_CODE_ARRAY. */ |
3851 | ||
3852 | static struct rank | |
3853 | rank_one_type_parm_array (struct type *parm, struct type *arg, struct value *value) | |
3854 | { | |
3855 | switch (TYPE_CODE (arg)) | |
3856 | { | |
3857 | case TYPE_CODE_PTR: | |
3858 | case TYPE_CODE_ARRAY: | |
3859 | return rank_one_type (TYPE_TARGET_TYPE (parm), | |
3860 | TYPE_TARGET_TYPE (arg), NULL); | |
3861 | default: | |
3862 | return INCOMPATIBLE_TYPE_BADNESS; | |
3863 | } | |
3864 | } | |
3865 | ||
f1f832d6 SM |
3866 | /* rank_one_type helper for when PARM's type code is TYPE_CODE_FUNC. */ |
3867 | ||
3868 | static struct rank | |
3869 | rank_one_type_parm_func (struct type *parm, struct type *arg, struct value *value) | |
3870 | { | |
3871 | switch (TYPE_CODE (arg)) | |
3872 | { | |
3873 | case TYPE_CODE_PTR: /* funcptr -> func */ | |
3874 | return rank_one_type (parm, TYPE_TARGET_TYPE (arg), NULL); | |
3875 | default: | |
3876 | return INCOMPATIBLE_TYPE_BADNESS; | |
3877 | } | |
3878 | } | |
3879 | ||
34910087 SM |
3880 | /* rank_one_type helper for when PARM's type code is TYPE_CODE_INT. */ |
3881 | ||
3882 | static struct rank | |
3883 | rank_one_type_parm_int (struct type *parm, struct type *arg, struct value *value) | |
3884 | { | |
3885 | switch (TYPE_CODE (arg)) | |
3886 | { | |
3887 | case TYPE_CODE_INT: | |
3888 | if (TYPE_LENGTH (arg) == TYPE_LENGTH (parm)) | |
3889 | { | |
3890 | /* Deal with signed, unsigned, and plain chars and | |
3891 | signed and unsigned ints. */ | |
3892 | if (TYPE_NOSIGN (parm)) | |
3893 | { | |
3894 | /* This case only for character types. */ | |
3895 | if (TYPE_NOSIGN (arg)) | |
3896 | return EXACT_MATCH_BADNESS; /* plain char -> plain char */ | |
3897 | else /* signed/unsigned char -> plain char */ | |
3898 | return INTEGER_CONVERSION_BADNESS; | |
3899 | } | |
3900 | else if (TYPE_UNSIGNED (parm)) | |
3901 | { | |
3902 | if (TYPE_UNSIGNED (arg)) | |
3903 | { | |
3904 | /* unsigned int -> unsigned int, or | |
3905 | unsigned long -> unsigned long */ | |
3906 | if (integer_types_same_name_p (TYPE_NAME (parm), | |
3907 | TYPE_NAME (arg))) | |
3908 | return EXACT_MATCH_BADNESS; | |
3909 | else if (integer_types_same_name_p (TYPE_NAME (arg), | |
3910 | "int") | |
3911 | && integer_types_same_name_p (TYPE_NAME (parm), | |
3912 | "long")) | |
3913 | /* unsigned int -> unsigned long */ | |
3914 | return INTEGER_PROMOTION_BADNESS; | |
3915 | else | |
3916 | /* unsigned long -> unsigned int */ | |
3917 | return INTEGER_CONVERSION_BADNESS; | |
3918 | } | |
3919 | else | |
3920 | { | |
3921 | if (integer_types_same_name_p (TYPE_NAME (arg), | |
3922 | "long") | |
3923 | && integer_types_same_name_p (TYPE_NAME (parm), | |
3924 | "int")) | |
3925 | /* signed long -> unsigned int */ | |
3926 | return INTEGER_CONVERSION_BADNESS; | |
3927 | else | |
3928 | /* signed int/long -> unsigned int/long */ | |
3929 | return INTEGER_CONVERSION_BADNESS; | |
3930 | } | |
3931 | } | |
3932 | else if (!TYPE_NOSIGN (arg) && !TYPE_UNSIGNED (arg)) | |
3933 | { | |
3934 | if (integer_types_same_name_p (TYPE_NAME (parm), | |
3935 | TYPE_NAME (arg))) | |
3936 | return EXACT_MATCH_BADNESS; | |
3937 | else if (integer_types_same_name_p (TYPE_NAME (arg), | |
3938 | "int") | |
3939 | && integer_types_same_name_p (TYPE_NAME (parm), | |
3940 | "long")) | |
3941 | return INTEGER_PROMOTION_BADNESS; | |
3942 | else | |
3943 | return INTEGER_CONVERSION_BADNESS; | |
3944 | } | |
3945 | else | |
3946 | return INTEGER_CONVERSION_BADNESS; | |
3947 | } | |
3948 | else if (TYPE_LENGTH (arg) < TYPE_LENGTH (parm)) | |
3949 | return INTEGER_PROMOTION_BADNESS; | |
3950 | else | |
3951 | return INTEGER_CONVERSION_BADNESS; | |
3952 | case TYPE_CODE_ENUM: | |
3953 | case TYPE_CODE_FLAGS: | |
3954 | case TYPE_CODE_CHAR: | |
3955 | case TYPE_CODE_RANGE: | |
3956 | case TYPE_CODE_BOOL: | |
3957 | if (TYPE_DECLARED_CLASS (arg)) | |
3958 | return INCOMPATIBLE_TYPE_BADNESS; | |
3959 | return INTEGER_PROMOTION_BADNESS; | |
3960 | case TYPE_CODE_FLT: | |
3961 | return INT_FLOAT_CONVERSION_BADNESS; | |
3962 | case TYPE_CODE_PTR: | |
3963 | return NS_POINTER_CONVERSION_BADNESS; | |
3964 | default: | |
3965 | return INCOMPATIBLE_TYPE_BADNESS; | |
3966 | } | |
3967 | } | |
3968 | ||
793cd1d2 SM |
3969 | /* rank_one_type helper for when PARM's type code is TYPE_CODE_ENUM. */ |
3970 | ||
3971 | static struct rank | |
3972 | rank_one_type_parm_enum (struct type *parm, struct type *arg, struct value *value) | |
3973 | { | |
3974 | switch (TYPE_CODE (arg)) | |
3975 | { | |
3976 | case TYPE_CODE_INT: | |
3977 | case TYPE_CODE_CHAR: | |
3978 | case TYPE_CODE_RANGE: | |
3979 | case TYPE_CODE_BOOL: | |
3980 | case TYPE_CODE_ENUM: | |
3981 | if (TYPE_DECLARED_CLASS (parm) || TYPE_DECLARED_CLASS (arg)) | |
3982 | return INCOMPATIBLE_TYPE_BADNESS; | |
3983 | return INTEGER_CONVERSION_BADNESS; | |
3984 | case TYPE_CODE_FLT: | |
3985 | return INT_FLOAT_CONVERSION_BADNESS; | |
3986 | default: | |
3987 | return INCOMPATIBLE_TYPE_BADNESS; | |
3988 | } | |
3989 | } | |
3990 | ||
41ea4728 SM |
3991 | /* rank_one_type helper for when PARM's type code is TYPE_CODE_CHAR. */ |
3992 | ||
3993 | static struct rank | |
3994 | rank_one_type_parm_char (struct type *parm, struct type *arg, struct value *value) | |
3995 | { | |
3996 | switch (TYPE_CODE (arg)) | |
3997 | { | |
3998 | case TYPE_CODE_RANGE: | |
3999 | case TYPE_CODE_BOOL: | |
4000 | case TYPE_CODE_ENUM: | |
4001 | if (TYPE_DECLARED_CLASS (arg)) | |
4002 | return INCOMPATIBLE_TYPE_BADNESS; | |
4003 | return INTEGER_CONVERSION_BADNESS; | |
4004 | case TYPE_CODE_FLT: | |
4005 | return INT_FLOAT_CONVERSION_BADNESS; | |
4006 | case TYPE_CODE_INT: | |
4007 | if (TYPE_LENGTH (arg) > TYPE_LENGTH (parm)) | |
4008 | return INTEGER_CONVERSION_BADNESS; | |
4009 | else if (TYPE_LENGTH (arg) < TYPE_LENGTH (parm)) | |
4010 | return INTEGER_PROMOTION_BADNESS; | |
4011 | /* fall through */ | |
4012 | case TYPE_CODE_CHAR: | |
4013 | /* Deal with signed, unsigned, and plain chars for C++ and | |
4014 | with int cases falling through from previous case. */ | |
4015 | if (TYPE_NOSIGN (parm)) | |
4016 | { | |
4017 | if (TYPE_NOSIGN (arg)) | |
4018 | return EXACT_MATCH_BADNESS; | |
4019 | else | |
4020 | return INTEGER_CONVERSION_BADNESS; | |
4021 | } | |
4022 | else if (TYPE_UNSIGNED (parm)) | |
4023 | { | |
4024 | if (TYPE_UNSIGNED (arg)) | |
4025 | return EXACT_MATCH_BADNESS; | |
4026 | else | |
4027 | return INTEGER_PROMOTION_BADNESS; | |
4028 | } | |
4029 | else if (!TYPE_NOSIGN (arg) && !TYPE_UNSIGNED (arg)) | |
4030 | return EXACT_MATCH_BADNESS; | |
4031 | else | |
4032 | return INTEGER_CONVERSION_BADNESS; | |
4033 | default: | |
4034 | return INCOMPATIBLE_TYPE_BADNESS; | |
4035 | } | |
4036 | } | |
4037 | ||
0dd322dc SM |
4038 | /* rank_one_type helper for when PARM's type code is TYPE_CODE_RANGE. */ |
4039 | ||
4040 | static struct rank | |
4041 | rank_one_type_parm_range (struct type *parm, struct type *arg, struct value *value) | |
4042 | { | |
4043 | switch (TYPE_CODE (arg)) | |
4044 | { | |
4045 | case TYPE_CODE_INT: | |
4046 | case TYPE_CODE_CHAR: | |
4047 | case TYPE_CODE_RANGE: | |
4048 | case TYPE_CODE_BOOL: | |
4049 | case TYPE_CODE_ENUM: | |
4050 | return INTEGER_CONVERSION_BADNESS; | |
4051 | case TYPE_CODE_FLT: | |
4052 | return INT_FLOAT_CONVERSION_BADNESS; | |
4053 | default: | |
4054 | return INCOMPATIBLE_TYPE_BADNESS; | |
4055 | } | |
4056 | } | |
4057 | ||
2c509035 SM |
4058 | /* rank_one_type helper for when PARM's type code is TYPE_CODE_BOOL. */ |
4059 | ||
4060 | static struct rank | |
4061 | rank_one_type_parm_bool (struct type *parm, struct type *arg, struct value *value) | |
4062 | { | |
4063 | switch (TYPE_CODE (arg)) | |
4064 | { | |
4065 | /* n3290 draft, section 4.12.1 (conv.bool): | |
4066 | ||
4067 | "A prvalue of arithmetic, unscoped enumeration, pointer, or | |
4068 | pointer to member type can be converted to a prvalue of type | |
4069 | bool. A zero value, null pointer value, or null member pointer | |
4070 | value is converted to false; any other value is converted to | |
4071 | true. A prvalue of type std::nullptr_t can be converted to a | |
4072 | prvalue of type bool; the resulting value is false." */ | |
4073 | case TYPE_CODE_INT: | |
4074 | case TYPE_CODE_CHAR: | |
4075 | case TYPE_CODE_ENUM: | |
4076 | case TYPE_CODE_FLT: | |
4077 | case TYPE_CODE_MEMBERPTR: | |
4078 | case TYPE_CODE_PTR: | |
4079 | return BOOL_CONVERSION_BADNESS; | |
4080 | case TYPE_CODE_RANGE: | |
4081 | return INCOMPATIBLE_TYPE_BADNESS; | |
4082 | case TYPE_CODE_BOOL: | |
4083 | return EXACT_MATCH_BADNESS; | |
4084 | default: | |
4085 | return INCOMPATIBLE_TYPE_BADNESS; | |
4086 | } | |
4087 | } | |
4088 | ||
7f17b20d SM |
4089 | /* rank_one_type helper for when PARM's type code is TYPE_CODE_FLOAT. */ |
4090 | ||
4091 | static struct rank | |
4092 | rank_one_type_parm_float (struct type *parm, struct type *arg, struct value *value) | |
4093 | { | |
4094 | switch (TYPE_CODE (arg)) | |
4095 | { | |
4096 | case TYPE_CODE_FLT: | |
4097 | if (TYPE_LENGTH (arg) < TYPE_LENGTH (parm)) | |
4098 | return FLOAT_PROMOTION_BADNESS; | |
4099 | else if (TYPE_LENGTH (arg) == TYPE_LENGTH (parm)) | |
4100 | return EXACT_MATCH_BADNESS; | |
4101 | else | |
4102 | return FLOAT_CONVERSION_BADNESS; | |
4103 | case TYPE_CODE_INT: | |
4104 | case TYPE_CODE_BOOL: | |
4105 | case TYPE_CODE_ENUM: | |
4106 | case TYPE_CODE_RANGE: | |
4107 | case TYPE_CODE_CHAR: | |
4108 | return INT_FLOAT_CONVERSION_BADNESS; | |
4109 | default: | |
4110 | return INCOMPATIBLE_TYPE_BADNESS; | |
4111 | } | |
4112 | } | |
4113 | ||
2598a94b SM |
4114 | /* rank_one_type helper for when PARM's type code is TYPE_CODE_COMPLEX. */ |
4115 | ||
4116 | static struct rank | |
4117 | rank_one_type_parm_complex (struct type *parm, struct type *arg, struct value *value) | |
4118 | { | |
4119 | switch (TYPE_CODE (arg)) | |
4120 | { /* Strictly not needed for C++, but... */ | |
4121 | case TYPE_CODE_FLT: | |
4122 | return FLOAT_PROMOTION_BADNESS; | |
4123 | case TYPE_CODE_COMPLEX: | |
4124 | return EXACT_MATCH_BADNESS; | |
4125 | default: | |
4126 | return INCOMPATIBLE_TYPE_BADNESS; | |
4127 | } | |
4128 | } | |
4129 | ||
595f96a9 SM |
4130 | /* rank_one_type helper for when PARM's type code is TYPE_CODE_STRUCT. */ |
4131 | ||
4132 | static struct rank | |
4133 | rank_one_type_parm_struct (struct type *parm, struct type *arg, struct value *value) | |
4134 | { | |
4135 | struct rank rank = {0, 0}; | |
4136 | ||
4137 | switch (TYPE_CODE (arg)) | |
4138 | { | |
4139 | case TYPE_CODE_STRUCT: | |
4140 | /* Check for derivation */ | |
4141 | rank.subrank = distance_to_ancestor (parm, arg, 0); | |
4142 | if (rank.subrank >= 0) | |
4143 | return sum_ranks (BASE_CONVERSION_BADNESS, rank); | |
4144 | /* fall through */ | |
4145 | default: | |
4146 | return INCOMPATIBLE_TYPE_BADNESS; | |
4147 | } | |
4148 | } | |
4149 | ||
f09ce22d SM |
4150 | /* rank_one_type helper for when PARM's type code is TYPE_CODE_SET. */ |
4151 | ||
4152 | static struct rank | |
4153 | rank_one_type_parm_set (struct type *parm, struct type *arg, struct value *value) | |
4154 | { | |
4155 | switch (TYPE_CODE (arg)) | |
4156 | { | |
4157 | /* Not in C++ */ | |
4158 | case TYPE_CODE_SET: | |
4159 | return rank_one_type (TYPE_FIELD_TYPE (parm, 0), | |
4160 | TYPE_FIELD_TYPE (arg, 0), NULL); | |
4161 | default: | |
4162 | return INCOMPATIBLE_TYPE_BADNESS; | |
4163 | } | |
4164 | } | |
4165 | ||
c906108c SS |
4166 | /* Compare one type (PARM) for compatibility with another (ARG). |
4167 | * PARM is intended to be the parameter type of a function; and | |
4168 | * ARG is the supplied argument's type. This function tests if | |
4169 | * the latter can be converted to the former. | |
da096638 | 4170 | * VALUE is the argument's value or NULL if none (or called recursively) |
c906108c SS |
4171 | * |
4172 | * Return 0 if they are identical types; | |
4173 | * Otherwise, return an integer which corresponds to how compatible | |
7ba81444 MS |
4174 | * PARM is to ARG. The higher the return value, the worse the match. |
4175 | * Generally the "bad" conversions are all uniformly assigned a 100. */ | |
c906108c | 4176 | |
6403aeea | 4177 | struct rank |
da096638 | 4178 | rank_one_type (struct type *parm, struct type *arg, struct value *value) |
c906108c | 4179 | { |
a9d5ef47 | 4180 | struct rank rank = {0,0}; |
7062b0a0 | 4181 | |
c906108c SS |
4182 | /* Resolve typedefs */ |
4183 | if (TYPE_CODE (parm) == TYPE_CODE_TYPEDEF) | |
4184 | parm = check_typedef (parm); | |
4185 | if (TYPE_CODE (arg) == TYPE_CODE_TYPEDEF) | |
4186 | arg = check_typedef (arg); | |
4187 | ||
e15c3eb4 | 4188 | if (TYPE_IS_REFERENCE (parm) && value != NULL) |
15c0a2a9 | 4189 | { |
e15c3eb4 KS |
4190 | if (VALUE_LVAL (value) == not_lval) |
4191 | { | |
4192 | /* Rvalues should preferably bind to rvalue references or const | |
4193 | lvalue references. */ | |
4194 | if (TYPE_CODE (parm) == TYPE_CODE_RVALUE_REF) | |
4195 | rank.subrank = REFERENCE_CONVERSION_RVALUE; | |
4196 | else if (TYPE_CONST (TYPE_TARGET_TYPE (parm))) | |
4197 | rank.subrank = REFERENCE_CONVERSION_CONST_LVALUE; | |
4198 | else | |
4199 | return INCOMPATIBLE_TYPE_BADNESS; | |
4200 | return sum_ranks (rank, REFERENCE_CONVERSION_BADNESS); | |
4201 | } | |
4202 | else | |
4203 | { | |
4204 | /* Lvalues should prefer lvalue overloads. */ | |
4205 | if (TYPE_CODE (parm) == TYPE_CODE_RVALUE_REF) | |
4206 | { | |
4207 | rank.subrank = REFERENCE_CONVERSION_RVALUE; | |
4208 | return sum_ranks (rank, REFERENCE_CONVERSION_BADNESS); | |
4209 | } | |
4210 | } | |
15c0a2a9 AV |
4211 | } |
4212 | ||
4213 | if (types_equal (parm, arg)) | |
15c0a2a9 | 4214 | { |
e15c3eb4 KS |
4215 | struct type *t1 = parm; |
4216 | struct type *t2 = arg; | |
15c0a2a9 | 4217 | |
e15c3eb4 KS |
4218 | /* For pointers and references, compare target type. */ |
4219 | if (TYPE_CODE (parm) == TYPE_CODE_PTR || TYPE_IS_REFERENCE (parm)) | |
4220 | { | |
4221 | t1 = TYPE_TARGET_TYPE (parm); | |
4222 | t2 = TYPE_TARGET_TYPE (arg); | |
4223 | } | |
15c0a2a9 | 4224 | |
e15c3eb4 KS |
4225 | /* Make sure they are CV equal, too. */ |
4226 | if (TYPE_CONST (t1) != TYPE_CONST (t2)) | |
4227 | rank.subrank |= CV_CONVERSION_CONST; | |
4228 | if (TYPE_VOLATILE (t1) != TYPE_VOLATILE (t2)) | |
4229 | rank.subrank |= CV_CONVERSION_VOLATILE; | |
4230 | if (rank.subrank != 0) | |
4231 | return sum_ranks (CV_CONVERSION_BADNESS, rank); | |
4232 | return EXACT_MATCH_BADNESS; | |
15c0a2a9 AV |
4233 | } |
4234 | ||
db577aea | 4235 | /* See through references, since we can almost make non-references |
7ba81444 | 4236 | references. */ |
aa006118 AV |
4237 | |
4238 | if (TYPE_IS_REFERENCE (arg)) | |
da096638 | 4239 | return (sum_ranks (rank_one_type (parm, TYPE_TARGET_TYPE (arg), NULL), |
6403aeea | 4240 | REFERENCE_CONVERSION_BADNESS)); |
aa006118 | 4241 | if (TYPE_IS_REFERENCE (parm)) |
da096638 | 4242 | return (sum_ranks (rank_one_type (TYPE_TARGET_TYPE (parm), arg, NULL), |
6403aeea | 4243 | REFERENCE_CONVERSION_BADNESS)); |
5d161b24 | 4244 | if (overload_debug) |
7ba81444 MS |
4245 | /* Debugging only. */ |
4246 | fprintf_filtered (gdb_stderr, | |
4247 | "------ Arg is %s [%d], parm is %s [%d]\n", | |
4248 | TYPE_NAME (arg), TYPE_CODE (arg), | |
4249 | TYPE_NAME (parm), TYPE_CODE (parm)); | |
c906108c | 4250 | |
0963b4bd | 4251 | /* x -> y means arg of type x being supplied for parameter of type y. */ |
c906108c SS |
4252 | |
4253 | switch (TYPE_CODE (parm)) | |
4254 | { | |
c5aa993b | 4255 | case TYPE_CODE_PTR: |
9293fc63 | 4256 | return rank_one_type_parm_ptr (parm, arg, value); |
c5aa993b | 4257 | case TYPE_CODE_ARRAY: |
b9f4512f | 4258 | return rank_one_type_parm_array (parm, arg, value); |
c5aa993b | 4259 | case TYPE_CODE_FUNC: |
f1f832d6 | 4260 | return rank_one_type_parm_func (parm, arg, value); |
c5aa993b | 4261 | case TYPE_CODE_INT: |
34910087 | 4262 | return rank_one_type_parm_int (parm, arg, value); |
c5aa993b | 4263 | case TYPE_CODE_ENUM: |
793cd1d2 | 4264 | return rank_one_type_parm_enum (parm, arg, value); |
c5aa993b | 4265 | case TYPE_CODE_CHAR: |
41ea4728 | 4266 | return rank_one_type_parm_char (parm, arg, value); |
c5aa993b | 4267 | case TYPE_CODE_RANGE: |
0dd322dc | 4268 | return rank_one_type_parm_range (parm, arg, value); |
c5aa993b | 4269 | case TYPE_CODE_BOOL: |
2c509035 | 4270 | return rank_one_type_parm_bool (parm, arg, value); |
c5aa993b | 4271 | case TYPE_CODE_FLT: |
7f17b20d | 4272 | return rank_one_type_parm_float (parm, arg, value); |
c5aa993b | 4273 | case TYPE_CODE_COMPLEX: |
2598a94b | 4274 | return rank_one_type_parm_complex (parm, arg, value); |
c5aa993b | 4275 | case TYPE_CODE_STRUCT: |
595f96a9 | 4276 | return rank_one_type_parm_struct (parm, arg, value); |
c5aa993b | 4277 | case TYPE_CODE_SET: |
f09ce22d | 4278 | return rank_one_type_parm_set (parm, arg, value); |
c5aa993b JM |
4279 | default: |
4280 | return INCOMPATIBLE_TYPE_BADNESS; | |
4281 | } /* switch (TYPE_CODE (arg)) */ | |
c906108c SS |
4282 | } |
4283 | ||
0963b4bd | 4284 | /* End of functions for overload resolution. */ |
5212577a DE |
4285 | \f |
4286 | /* Routines to pretty-print types. */ | |
c906108c | 4287 | |
c906108c | 4288 | static void |
fba45db2 | 4289 | print_bit_vector (B_TYPE *bits, int nbits) |
c906108c SS |
4290 | { |
4291 | int bitno; | |
4292 | ||
4293 | for (bitno = 0; bitno < nbits; bitno++) | |
4294 | { | |
4295 | if ((bitno % 8) == 0) | |
4296 | { | |
4297 | puts_filtered (" "); | |
4298 | } | |
4299 | if (B_TST (bits, bitno)) | |
a3f17187 | 4300 | printf_filtered (("1")); |
c906108c | 4301 | else |
a3f17187 | 4302 | printf_filtered (("0")); |
c906108c SS |
4303 | } |
4304 | } | |
4305 | ||
ad2f7632 | 4306 | /* Note the first arg should be the "this" pointer, we may not want to |
7ba81444 MS |
4307 | include it since we may get into a infinitely recursive |
4308 | situation. */ | |
c906108c SS |
4309 | |
4310 | static void | |
4c9e8482 | 4311 | print_args (struct field *args, int nargs, int spaces) |
c906108c SS |
4312 | { |
4313 | if (args != NULL) | |
4314 | { | |
ad2f7632 DJ |
4315 | int i; |
4316 | ||
4317 | for (i = 0; i < nargs; i++) | |
4c9e8482 DE |
4318 | { |
4319 | printfi_filtered (spaces, "[%d] name '%s'\n", i, | |
4320 | args[i].name != NULL ? args[i].name : "<NULL>"); | |
4321 | recursive_dump_type (args[i].type, spaces + 2); | |
4322 | } | |
c906108c SS |
4323 | } |
4324 | } | |
4325 | ||
d6a843b5 JK |
4326 | int |
4327 | field_is_static (struct field *f) | |
4328 | { | |
4329 | /* "static" fields are the fields whose location is not relative | |
4330 | to the address of the enclosing struct. It would be nice to | |
4331 | have a dedicated flag that would be set for static fields when | |
4332 | the type is being created. But in practice, checking the field | |
254e6b9e | 4333 | loc_kind should give us an accurate answer. */ |
d6a843b5 JK |
4334 | return (FIELD_LOC_KIND (*f) == FIELD_LOC_KIND_PHYSNAME |
4335 | || FIELD_LOC_KIND (*f) == FIELD_LOC_KIND_PHYSADDR); | |
4336 | } | |
4337 | ||
c906108c | 4338 | static void |
fba45db2 | 4339 | dump_fn_fieldlists (struct type *type, int spaces) |
c906108c SS |
4340 | { |
4341 | int method_idx; | |
4342 | int overload_idx; | |
4343 | struct fn_field *f; | |
4344 | ||
4345 | printfi_filtered (spaces, "fn_fieldlists "); | |
d4f3574e | 4346 | gdb_print_host_address (TYPE_FN_FIELDLISTS (type), gdb_stdout); |
c906108c SS |
4347 | printf_filtered ("\n"); |
4348 | for (method_idx = 0; method_idx < TYPE_NFN_FIELDS (type); method_idx++) | |
4349 | { | |
4350 | f = TYPE_FN_FIELDLIST1 (type, method_idx); | |
4351 | printfi_filtered (spaces + 2, "[%d] name '%s' (", | |
4352 | method_idx, | |
4353 | TYPE_FN_FIELDLIST_NAME (type, method_idx)); | |
d4f3574e SS |
4354 | gdb_print_host_address (TYPE_FN_FIELDLIST_NAME (type, method_idx), |
4355 | gdb_stdout); | |
a3f17187 | 4356 | printf_filtered (_(") length %d\n"), |
c906108c SS |
4357 | TYPE_FN_FIELDLIST_LENGTH (type, method_idx)); |
4358 | for (overload_idx = 0; | |
4359 | overload_idx < TYPE_FN_FIELDLIST_LENGTH (type, method_idx); | |
4360 | overload_idx++) | |
4361 | { | |
4362 | printfi_filtered (spaces + 4, "[%d] physname '%s' (", | |
4363 | overload_idx, | |
4364 | TYPE_FN_FIELD_PHYSNAME (f, overload_idx)); | |
d4f3574e SS |
4365 | gdb_print_host_address (TYPE_FN_FIELD_PHYSNAME (f, overload_idx), |
4366 | gdb_stdout); | |
c906108c SS |
4367 | printf_filtered (")\n"); |
4368 | printfi_filtered (spaces + 8, "type "); | |
7ba81444 MS |
4369 | gdb_print_host_address (TYPE_FN_FIELD_TYPE (f, overload_idx), |
4370 | gdb_stdout); | |
c906108c SS |
4371 | printf_filtered ("\n"); |
4372 | ||
4373 | recursive_dump_type (TYPE_FN_FIELD_TYPE (f, overload_idx), | |
4374 | spaces + 8 + 2); | |
4375 | ||
4376 | printfi_filtered (spaces + 8, "args "); | |
7ba81444 MS |
4377 | gdb_print_host_address (TYPE_FN_FIELD_ARGS (f, overload_idx), |
4378 | gdb_stdout); | |
c906108c | 4379 | printf_filtered ("\n"); |
4c9e8482 DE |
4380 | print_args (TYPE_FN_FIELD_ARGS (f, overload_idx), |
4381 | TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f, overload_idx)), | |
4382 | spaces + 8 + 2); | |
c906108c | 4383 | printfi_filtered (spaces + 8, "fcontext "); |
d4f3574e SS |
4384 | gdb_print_host_address (TYPE_FN_FIELD_FCONTEXT (f, overload_idx), |
4385 | gdb_stdout); | |
c906108c SS |
4386 | printf_filtered ("\n"); |
4387 | ||
4388 | printfi_filtered (spaces + 8, "is_const %d\n", | |
4389 | TYPE_FN_FIELD_CONST (f, overload_idx)); | |
4390 | printfi_filtered (spaces + 8, "is_volatile %d\n", | |
4391 | TYPE_FN_FIELD_VOLATILE (f, overload_idx)); | |
4392 | printfi_filtered (spaces + 8, "is_private %d\n", | |
4393 | TYPE_FN_FIELD_PRIVATE (f, overload_idx)); | |
4394 | printfi_filtered (spaces + 8, "is_protected %d\n", | |
4395 | TYPE_FN_FIELD_PROTECTED (f, overload_idx)); | |
4396 | printfi_filtered (spaces + 8, "is_stub %d\n", | |
4397 | TYPE_FN_FIELD_STUB (f, overload_idx)); | |
4398 | printfi_filtered (spaces + 8, "voffset %u\n", | |
4399 | TYPE_FN_FIELD_VOFFSET (f, overload_idx)); | |
4400 | } | |
4401 | } | |
4402 | } | |
4403 | ||
4404 | static void | |
fba45db2 | 4405 | print_cplus_stuff (struct type *type, int spaces) |
c906108c | 4406 | { |
ae6ae975 DE |
4407 | printfi_filtered (spaces, "vptr_fieldno %d\n", TYPE_VPTR_FIELDNO (type)); |
4408 | printfi_filtered (spaces, "vptr_basetype "); | |
4409 | gdb_print_host_address (TYPE_VPTR_BASETYPE (type), gdb_stdout); | |
4410 | puts_filtered ("\n"); | |
4411 | if (TYPE_VPTR_BASETYPE (type) != NULL) | |
4412 | recursive_dump_type (TYPE_VPTR_BASETYPE (type), spaces + 2); | |
4413 | ||
c906108c SS |
4414 | printfi_filtered (spaces, "n_baseclasses %d\n", |
4415 | TYPE_N_BASECLASSES (type)); | |
4416 | printfi_filtered (spaces, "nfn_fields %d\n", | |
4417 | TYPE_NFN_FIELDS (type)); | |
c906108c SS |
4418 | if (TYPE_N_BASECLASSES (type) > 0) |
4419 | { | |
4420 | printfi_filtered (spaces, "virtual_field_bits (%d bits at *", | |
4421 | TYPE_N_BASECLASSES (type)); | |
7ba81444 MS |
4422 | gdb_print_host_address (TYPE_FIELD_VIRTUAL_BITS (type), |
4423 | gdb_stdout); | |
c906108c SS |
4424 | printf_filtered (")"); |
4425 | ||
4426 | print_bit_vector (TYPE_FIELD_VIRTUAL_BITS (type), | |
4427 | TYPE_N_BASECLASSES (type)); | |
4428 | puts_filtered ("\n"); | |
4429 | } | |
4430 | if (TYPE_NFIELDS (type) > 0) | |
4431 | { | |
4432 | if (TYPE_FIELD_PRIVATE_BITS (type) != NULL) | |
4433 | { | |
7ba81444 MS |
4434 | printfi_filtered (spaces, |
4435 | "private_field_bits (%d bits at *", | |
c906108c | 4436 | TYPE_NFIELDS (type)); |
7ba81444 MS |
4437 | gdb_print_host_address (TYPE_FIELD_PRIVATE_BITS (type), |
4438 | gdb_stdout); | |
c906108c SS |
4439 | printf_filtered (")"); |
4440 | print_bit_vector (TYPE_FIELD_PRIVATE_BITS (type), | |
4441 | TYPE_NFIELDS (type)); | |
4442 | puts_filtered ("\n"); | |
4443 | } | |
4444 | if (TYPE_FIELD_PROTECTED_BITS (type) != NULL) | |
4445 | { | |
7ba81444 MS |
4446 | printfi_filtered (spaces, |
4447 | "protected_field_bits (%d bits at *", | |
c906108c | 4448 | TYPE_NFIELDS (type)); |
7ba81444 MS |
4449 | gdb_print_host_address (TYPE_FIELD_PROTECTED_BITS (type), |
4450 | gdb_stdout); | |
c906108c SS |
4451 | printf_filtered (")"); |
4452 | print_bit_vector (TYPE_FIELD_PROTECTED_BITS (type), | |
4453 | TYPE_NFIELDS (type)); | |
4454 | puts_filtered ("\n"); | |
4455 | } | |
4456 | } | |
4457 | if (TYPE_NFN_FIELDS (type) > 0) | |
4458 | { | |
4459 | dump_fn_fieldlists (type, spaces); | |
4460 | } | |
4461 | } | |
4462 | ||
b4ba55a1 JB |
4463 | /* Print the contents of the TYPE's type_specific union, assuming that |
4464 | its type-specific kind is TYPE_SPECIFIC_GNAT_STUFF. */ | |
4465 | ||
4466 | static void | |
4467 | print_gnat_stuff (struct type *type, int spaces) | |
4468 | { | |
4469 | struct type *descriptive_type = TYPE_DESCRIPTIVE_TYPE (type); | |
4470 | ||
8cd00c59 PMR |
4471 | if (descriptive_type == NULL) |
4472 | printfi_filtered (spaces + 2, "no descriptive type\n"); | |
4473 | else | |
4474 | { | |
4475 | printfi_filtered (spaces + 2, "descriptive type\n"); | |
4476 | recursive_dump_type (descriptive_type, spaces + 4); | |
4477 | } | |
b4ba55a1 JB |
4478 | } |
4479 | ||
c906108c SS |
4480 | static struct obstack dont_print_type_obstack; |
4481 | ||
4482 | void | |
fba45db2 | 4483 | recursive_dump_type (struct type *type, int spaces) |
c906108c SS |
4484 | { |
4485 | int idx; | |
4486 | ||
4487 | if (spaces == 0) | |
4488 | obstack_begin (&dont_print_type_obstack, 0); | |
4489 | ||
4490 | if (TYPE_NFIELDS (type) > 0 | |
b4ba55a1 | 4491 | || (HAVE_CPLUS_STRUCT (type) && TYPE_NFN_FIELDS (type) > 0)) |
c906108c SS |
4492 | { |
4493 | struct type **first_dont_print | |
7ba81444 | 4494 | = (struct type **) obstack_base (&dont_print_type_obstack); |
c906108c | 4495 | |
7ba81444 MS |
4496 | int i = (struct type **) |
4497 | obstack_next_free (&dont_print_type_obstack) - first_dont_print; | |
c906108c SS |
4498 | |
4499 | while (--i >= 0) | |
4500 | { | |
4501 | if (type == first_dont_print[i]) | |
4502 | { | |
4503 | printfi_filtered (spaces, "type node "); | |
d4f3574e | 4504 | gdb_print_host_address (type, gdb_stdout); |
a3f17187 | 4505 | printf_filtered (_(" <same as already seen type>\n")); |
c906108c SS |
4506 | return; |
4507 | } | |
4508 | } | |
4509 | ||
4510 | obstack_ptr_grow (&dont_print_type_obstack, type); | |
4511 | } | |
4512 | ||
4513 | printfi_filtered (spaces, "type node "); | |
d4f3574e | 4514 | gdb_print_host_address (type, gdb_stdout); |
c906108c SS |
4515 | printf_filtered ("\n"); |
4516 | printfi_filtered (spaces, "name '%s' (", | |
4517 | TYPE_NAME (type) ? TYPE_NAME (type) : "<NULL>"); | |
d4f3574e | 4518 | gdb_print_host_address (TYPE_NAME (type), gdb_stdout); |
c906108c | 4519 | printf_filtered (")\n"); |
c906108c SS |
4520 | printfi_filtered (spaces, "code 0x%x ", TYPE_CODE (type)); |
4521 | switch (TYPE_CODE (type)) | |
4522 | { | |
c5aa993b JM |
4523 | case TYPE_CODE_UNDEF: |
4524 | printf_filtered ("(TYPE_CODE_UNDEF)"); | |
4525 | break; | |
4526 | case TYPE_CODE_PTR: | |
4527 | printf_filtered ("(TYPE_CODE_PTR)"); | |
4528 | break; | |
4529 | case TYPE_CODE_ARRAY: | |
4530 | printf_filtered ("(TYPE_CODE_ARRAY)"); | |
4531 | break; | |
4532 | case TYPE_CODE_STRUCT: | |
4533 | printf_filtered ("(TYPE_CODE_STRUCT)"); | |
4534 | break; | |
4535 | case TYPE_CODE_UNION: | |
4536 | printf_filtered ("(TYPE_CODE_UNION)"); | |
4537 | break; | |
4538 | case TYPE_CODE_ENUM: | |
4539 | printf_filtered ("(TYPE_CODE_ENUM)"); | |
4540 | break; | |
4f2aea11 MK |
4541 | case TYPE_CODE_FLAGS: |
4542 | printf_filtered ("(TYPE_CODE_FLAGS)"); | |
4543 | break; | |
c5aa993b JM |
4544 | case TYPE_CODE_FUNC: |
4545 | printf_filtered ("(TYPE_CODE_FUNC)"); | |
4546 | break; | |
4547 | case TYPE_CODE_INT: | |
4548 | printf_filtered ("(TYPE_CODE_INT)"); | |
4549 | break; | |
4550 | case TYPE_CODE_FLT: | |
4551 | printf_filtered ("(TYPE_CODE_FLT)"); | |
4552 | break; | |
4553 | case TYPE_CODE_VOID: | |
4554 | printf_filtered ("(TYPE_CODE_VOID)"); | |
4555 | break; | |
4556 | case TYPE_CODE_SET: | |
4557 | printf_filtered ("(TYPE_CODE_SET)"); | |
4558 | break; | |
4559 | case TYPE_CODE_RANGE: | |
4560 | printf_filtered ("(TYPE_CODE_RANGE)"); | |
4561 | break; | |
4562 | case TYPE_CODE_STRING: | |
4563 | printf_filtered ("(TYPE_CODE_STRING)"); | |
4564 | break; | |
4565 | case TYPE_CODE_ERROR: | |
4566 | printf_filtered ("(TYPE_CODE_ERROR)"); | |
4567 | break; | |
0d5de010 DJ |
4568 | case TYPE_CODE_MEMBERPTR: |
4569 | printf_filtered ("(TYPE_CODE_MEMBERPTR)"); | |
4570 | break; | |
4571 | case TYPE_CODE_METHODPTR: | |
4572 | printf_filtered ("(TYPE_CODE_METHODPTR)"); | |
c5aa993b JM |
4573 | break; |
4574 | case TYPE_CODE_METHOD: | |
4575 | printf_filtered ("(TYPE_CODE_METHOD)"); | |
4576 | break; | |
4577 | case TYPE_CODE_REF: | |
4578 | printf_filtered ("(TYPE_CODE_REF)"); | |
4579 | break; | |
4580 | case TYPE_CODE_CHAR: | |
4581 | printf_filtered ("(TYPE_CODE_CHAR)"); | |
4582 | break; | |
4583 | case TYPE_CODE_BOOL: | |
4584 | printf_filtered ("(TYPE_CODE_BOOL)"); | |
4585 | break; | |
e9e79dd9 FF |
4586 | case TYPE_CODE_COMPLEX: |
4587 | printf_filtered ("(TYPE_CODE_COMPLEX)"); | |
4588 | break; | |
c5aa993b JM |
4589 | case TYPE_CODE_TYPEDEF: |
4590 | printf_filtered ("(TYPE_CODE_TYPEDEF)"); | |
4591 | break; | |
5c4e30ca DC |
4592 | case TYPE_CODE_NAMESPACE: |
4593 | printf_filtered ("(TYPE_CODE_NAMESPACE)"); | |
4594 | break; | |
c5aa993b JM |
4595 | default: |
4596 | printf_filtered ("(UNKNOWN TYPE CODE)"); | |
4597 | break; | |
c906108c SS |
4598 | } |
4599 | puts_filtered ("\n"); | |
cc1defb1 | 4600 | printfi_filtered (spaces, "length %s\n", pulongest (TYPE_LENGTH (type))); |
e9bb382b UW |
4601 | if (TYPE_OBJFILE_OWNED (type)) |
4602 | { | |
4603 | printfi_filtered (spaces, "objfile "); | |
4604 | gdb_print_host_address (TYPE_OWNER (type).objfile, gdb_stdout); | |
4605 | } | |
4606 | else | |
4607 | { | |
4608 | printfi_filtered (spaces, "gdbarch "); | |
4609 | gdb_print_host_address (TYPE_OWNER (type).gdbarch, gdb_stdout); | |
4610 | } | |
c906108c SS |
4611 | printf_filtered ("\n"); |
4612 | printfi_filtered (spaces, "target_type "); | |
d4f3574e | 4613 | gdb_print_host_address (TYPE_TARGET_TYPE (type), gdb_stdout); |
c906108c SS |
4614 | printf_filtered ("\n"); |
4615 | if (TYPE_TARGET_TYPE (type) != NULL) | |
4616 | { | |
4617 | recursive_dump_type (TYPE_TARGET_TYPE (type), spaces + 2); | |
4618 | } | |
4619 | printfi_filtered (spaces, "pointer_type "); | |
d4f3574e | 4620 | gdb_print_host_address (TYPE_POINTER_TYPE (type), gdb_stdout); |
c906108c SS |
4621 | printf_filtered ("\n"); |
4622 | printfi_filtered (spaces, "reference_type "); | |
d4f3574e | 4623 | gdb_print_host_address (TYPE_REFERENCE_TYPE (type), gdb_stdout); |
c906108c | 4624 | printf_filtered ("\n"); |
2fdde8f8 DJ |
4625 | printfi_filtered (spaces, "type_chain "); |
4626 | gdb_print_host_address (TYPE_CHAIN (type), gdb_stdout); | |
e9e79dd9 | 4627 | printf_filtered ("\n"); |
7ba81444 MS |
4628 | printfi_filtered (spaces, "instance_flags 0x%x", |
4629 | TYPE_INSTANCE_FLAGS (type)); | |
2fdde8f8 DJ |
4630 | if (TYPE_CONST (type)) |
4631 | { | |
a9ff5f12 | 4632 | puts_filtered (" TYPE_CONST"); |
2fdde8f8 DJ |
4633 | } |
4634 | if (TYPE_VOLATILE (type)) | |
4635 | { | |
a9ff5f12 | 4636 | puts_filtered (" TYPE_VOLATILE"); |
2fdde8f8 DJ |
4637 | } |
4638 | if (TYPE_CODE_SPACE (type)) | |
4639 | { | |
a9ff5f12 | 4640 | puts_filtered (" TYPE_CODE_SPACE"); |
2fdde8f8 DJ |
4641 | } |
4642 | if (TYPE_DATA_SPACE (type)) | |
4643 | { | |
a9ff5f12 | 4644 | puts_filtered (" TYPE_DATA_SPACE"); |
2fdde8f8 | 4645 | } |
8b2dbe47 KB |
4646 | if (TYPE_ADDRESS_CLASS_1 (type)) |
4647 | { | |
a9ff5f12 | 4648 | puts_filtered (" TYPE_ADDRESS_CLASS_1"); |
8b2dbe47 KB |
4649 | } |
4650 | if (TYPE_ADDRESS_CLASS_2 (type)) | |
4651 | { | |
a9ff5f12 | 4652 | puts_filtered (" TYPE_ADDRESS_CLASS_2"); |
8b2dbe47 | 4653 | } |
06d66ee9 TT |
4654 | if (TYPE_RESTRICT (type)) |
4655 | { | |
a9ff5f12 | 4656 | puts_filtered (" TYPE_RESTRICT"); |
06d66ee9 | 4657 | } |
a2c2acaf MW |
4658 | if (TYPE_ATOMIC (type)) |
4659 | { | |
a9ff5f12 | 4660 | puts_filtered (" TYPE_ATOMIC"); |
a2c2acaf | 4661 | } |
2fdde8f8 | 4662 | puts_filtered ("\n"); |
876cecd0 TT |
4663 | |
4664 | printfi_filtered (spaces, "flags"); | |
762a036f | 4665 | if (TYPE_UNSIGNED (type)) |
c906108c | 4666 | { |
a9ff5f12 | 4667 | puts_filtered (" TYPE_UNSIGNED"); |
c906108c | 4668 | } |
762a036f FF |
4669 | if (TYPE_NOSIGN (type)) |
4670 | { | |
a9ff5f12 | 4671 | puts_filtered (" TYPE_NOSIGN"); |
762a036f | 4672 | } |
34877895 PJ |
4673 | if (TYPE_ENDIANITY_NOT_DEFAULT (type)) |
4674 | { | |
4675 | puts_filtered (" TYPE_ENDIANITY_NOT_DEFAULT"); | |
4676 | } | |
762a036f | 4677 | if (TYPE_STUB (type)) |
c906108c | 4678 | { |
a9ff5f12 | 4679 | puts_filtered (" TYPE_STUB"); |
c906108c | 4680 | } |
762a036f FF |
4681 | if (TYPE_TARGET_STUB (type)) |
4682 | { | |
a9ff5f12 | 4683 | puts_filtered (" TYPE_TARGET_STUB"); |
762a036f | 4684 | } |
762a036f FF |
4685 | if (TYPE_PROTOTYPED (type)) |
4686 | { | |
a9ff5f12 | 4687 | puts_filtered (" TYPE_PROTOTYPED"); |
762a036f FF |
4688 | } |
4689 | if (TYPE_INCOMPLETE (type)) | |
4690 | { | |
a9ff5f12 | 4691 | puts_filtered (" TYPE_INCOMPLETE"); |
762a036f | 4692 | } |
762a036f FF |
4693 | if (TYPE_VARARGS (type)) |
4694 | { | |
a9ff5f12 | 4695 | puts_filtered (" TYPE_VARARGS"); |
762a036f | 4696 | } |
f5f8a009 EZ |
4697 | /* This is used for things like AltiVec registers on ppc. Gcc emits |
4698 | an attribute for the array type, which tells whether or not we | |
4699 | have a vector, instead of a regular array. */ | |
4700 | if (TYPE_VECTOR (type)) | |
4701 | { | |
a9ff5f12 | 4702 | puts_filtered (" TYPE_VECTOR"); |
f5f8a009 | 4703 | } |
876cecd0 TT |
4704 | if (TYPE_FIXED_INSTANCE (type)) |
4705 | { | |
4706 | puts_filtered (" TYPE_FIXED_INSTANCE"); | |
4707 | } | |
4708 | if (TYPE_STUB_SUPPORTED (type)) | |
4709 | { | |
4710 | puts_filtered (" TYPE_STUB_SUPPORTED"); | |
4711 | } | |
4712 | if (TYPE_NOTTEXT (type)) | |
4713 | { | |
4714 | puts_filtered (" TYPE_NOTTEXT"); | |
4715 | } | |
c906108c SS |
4716 | puts_filtered ("\n"); |
4717 | printfi_filtered (spaces, "nfields %d ", TYPE_NFIELDS (type)); | |
d4f3574e | 4718 | gdb_print_host_address (TYPE_FIELDS (type), gdb_stdout); |
c906108c SS |
4719 | puts_filtered ("\n"); |
4720 | for (idx = 0; idx < TYPE_NFIELDS (type); idx++) | |
4721 | { | |
14e75d8e JK |
4722 | if (TYPE_CODE (type) == TYPE_CODE_ENUM) |
4723 | printfi_filtered (spaces + 2, | |
4724 | "[%d] enumval %s type ", | |
4725 | idx, plongest (TYPE_FIELD_ENUMVAL (type, idx))); | |
4726 | else | |
4727 | printfi_filtered (spaces + 2, | |
6b850546 DT |
4728 | "[%d] bitpos %s bitsize %d type ", |
4729 | idx, plongest (TYPE_FIELD_BITPOS (type, idx)), | |
14e75d8e | 4730 | TYPE_FIELD_BITSIZE (type, idx)); |
d4f3574e | 4731 | gdb_print_host_address (TYPE_FIELD_TYPE (type, idx), gdb_stdout); |
c906108c SS |
4732 | printf_filtered (" name '%s' (", |
4733 | TYPE_FIELD_NAME (type, idx) != NULL | |
4734 | ? TYPE_FIELD_NAME (type, idx) | |
4735 | : "<NULL>"); | |
d4f3574e | 4736 | gdb_print_host_address (TYPE_FIELD_NAME (type, idx), gdb_stdout); |
c906108c SS |
4737 | printf_filtered (")\n"); |
4738 | if (TYPE_FIELD_TYPE (type, idx) != NULL) | |
4739 | { | |
4740 | recursive_dump_type (TYPE_FIELD_TYPE (type, idx), spaces + 4); | |
4741 | } | |
4742 | } | |
43bbcdc2 PH |
4743 | if (TYPE_CODE (type) == TYPE_CODE_RANGE) |
4744 | { | |
4745 | printfi_filtered (spaces, "low %s%s high %s%s\n", | |
4746 | plongest (TYPE_LOW_BOUND (type)), | |
4747 | TYPE_LOW_BOUND_UNDEFINED (type) ? " (undefined)" : "", | |
4748 | plongest (TYPE_HIGH_BOUND (type)), | |
3e43a32a MS |
4749 | TYPE_HIGH_BOUND_UNDEFINED (type) |
4750 | ? " (undefined)" : ""); | |
43bbcdc2 | 4751 | } |
c906108c | 4752 | |
b4ba55a1 JB |
4753 | switch (TYPE_SPECIFIC_FIELD (type)) |
4754 | { | |
4755 | case TYPE_SPECIFIC_CPLUS_STUFF: | |
4756 | printfi_filtered (spaces, "cplus_stuff "); | |
4757 | gdb_print_host_address (TYPE_CPLUS_SPECIFIC (type), | |
4758 | gdb_stdout); | |
4759 | puts_filtered ("\n"); | |
4760 | print_cplus_stuff (type, spaces); | |
4761 | break; | |
8da61cc4 | 4762 | |
b4ba55a1 JB |
4763 | case TYPE_SPECIFIC_GNAT_STUFF: |
4764 | printfi_filtered (spaces, "gnat_stuff "); | |
4765 | gdb_print_host_address (TYPE_GNAT_SPECIFIC (type), gdb_stdout); | |
4766 | puts_filtered ("\n"); | |
4767 | print_gnat_stuff (type, spaces); | |
4768 | break; | |
701c159d | 4769 | |
b4ba55a1 JB |
4770 | case TYPE_SPECIFIC_FLOATFORMAT: |
4771 | printfi_filtered (spaces, "floatformat "); | |
0db7851f UW |
4772 | if (TYPE_FLOATFORMAT (type) == NULL |
4773 | || TYPE_FLOATFORMAT (type)->name == NULL) | |
b4ba55a1 JB |
4774 | puts_filtered ("(null)"); |
4775 | else | |
0db7851f | 4776 | puts_filtered (TYPE_FLOATFORMAT (type)->name); |
b4ba55a1 JB |
4777 | puts_filtered ("\n"); |
4778 | break; | |
c906108c | 4779 | |
b6cdc2c1 | 4780 | case TYPE_SPECIFIC_FUNC: |
b4ba55a1 JB |
4781 | printfi_filtered (spaces, "calling_convention %d\n", |
4782 | TYPE_CALLING_CONVENTION (type)); | |
b6cdc2c1 | 4783 | /* tail_call_list is not printed. */ |
b4ba55a1 | 4784 | break; |
09e2d7c7 DE |
4785 | |
4786 | case TYPE_SPECIFIC_SELF_TYPE: | |
4787 | printfi_filtered (spaces, "self_type "); | |
4788 | gdb_print_host_address (TYPE_SELF_TYPE (type), gdb_stdout); | |
4789 | puts_filtered ("\n"); | |
4790 | break; | |
c906108c | 4791 | } |
b4ba55a1 | 4792 | |
c906108c SS |
4793 | if (spaces == 0) |
4794 | obstack_free (&dont_print_type_obstack, NULL); | |
4795 | } | |
5212577a | 4796 | \f |
ae5a43e0 DJ |
4797 | /* Trivial helpers for the libiberty hash table, for mapping one |
4798 | type to another. */ | |
4799 | ||
fd90ace4 | 4800 | struct type_pair : public allocate_on_obstack |
ae5a43e0 | 4801 | { |
fd90ace4 YQ |
4802 | type_pair (struct type *old_, struct type *newobj_) |
4803 | : old (old_), newobj (newobj_) | |
4804 | {} | |
4805 | ||
4806 | struct type * const old, * const newobj; | |
ae5a43e0 DJ |
4807 | }; |
4808 | ||
4809 | static hashval_t | |
4810 | type_pair_hash (const void *item) | |
4811 | { | |
9a3c8263 | 4812 | const struct type_pair *pair = (const struct type_pair *) item; |
d8734c88 | 4813 | |
ae5a43e0 DJ |
4814 | return htab_hash_pointer (pair->old); |
4815 | } | |
4816 | ||
4817 | static int | |
4818 | type_pair_eq (const void *item_lhs, const void *item_rhs) | |
4819 | { | |
9a3c8263 SM |
4820 | const struct type_pair *lhs = (const struct type_pair *) item_lhs; |
4821 | const struct type_pair *rhs = (const struct type_pair *) item_rhs; | |
d8734c88 | 4822 | |
ae5a43e0 DJ |
4823 | return lhs->old == rhs->old; |
4824 | } | |
4825 | ||
4826 | /* Allocate the hash table used by copy_type_recursive to walk | |
4827 | types without duplicates. We use OBJFILE's obstack, because | |
4828 | OBJFILE is about to be deleted. */ | |
4829 | ||
4830 | htab_t | |
4831 | create_copied_types_hash (struct objfile *objfile) | |
4832 | { | |
4833 | return htab_create_alloc_ex (1, type_pair_hash, type_pair_eq, | |
4834 | NULL, &objfile->objfile_obstack, | |
4835 | hashtab_obstack_allocate, | |
4836 | dummy_obstack_deallocate); | |
4837 | } | |
4838 | ||
d9823cbb KB |
4839 | /* Recursively copy (deep copy) a dynamic attribute list of a type. */ |
4840 | ||
4841 | static struct dynamic_prop_list * | |
4842 | copy_dynamic_prop_list (struct obstack *objfile_obstack, | |
4843 | struct dynamic_prop_list *list) | |
4844 | { | |
4845 | struct dynamic_prop_list *copy = list; | |
4846 | struct dynamic_prop_list **node_ptr = © | |
4847 | ||
4848 | while (*node_ptr != NULL) | |
4849 | { | |
4850 | struct dynamic_prop_list *node_copy; | |
4851 | ||
224c3ddb SM |
4852 | node_copy = ((struct dynamic_prop_list *) |
4853 | obstack_copy (objfile_obstack, *node_ptr, | |
4854 | sizeof (struct dynamic_prop_list))); | |
283a9958 | 4855 | node_copy->prop = (*node_ptr)->prop; |
d9823cbb KB |
4856 | *node_ptr = node_copy; |
4857 | ||
4858 | node_ptr = &node_copy->next; | |
4859 | } | |
4860 | ||
4861 | return copy; | |
4862 | } | |
4863 | ||
7ba81444 | 4864 | /* Recursively copy (deep copy) TYPE, if it is associated with |
eed8b28a PP |
4865 | OBJFILE. Return a new type owned by the gdbarch associated with the type, a |
4866 | saved type if we have already visited TYPE (using COPIED_TYPES), or TYPE if | |
4867 | it is not associated with OBJFILE. */ | |
ae5a43e0 DJ |
4868 | |
4869 | struct type * | |
7ba81444 MS |
4870 | copy_type_recursive (struct objfile *objfile, |
4871 | struct type *type, | |
ae5a43e0 DJ |
4872 | htab_t copied_types) |
4873 | { | |
ae5a43e0 DJ |
4874 | void **slot; |
4875 | struct type *new_type; | |
4876 | ||
e9bb382b | 4877 | if (! TYPE_OBJFILE_OWNED (type)) |
ae5a43e0 DJ |
4878 | return type; |
4879 | ||
7ba81444 MS |
4880 | /* This type shouldn't be pointing to any types in other objfiles; |
4881 | if it did, the type might disappear unexpectedly. */ | |
ae5a43e0 DJ |
4882 | gdb_assert (TYPE_OBJFILE (type) == objfile); |
4883 | ||
fd90ace4 YQ |
4884 | struct type_pair pair (type, nullptr); |
4885 | ||
ae5a43e0 DJ |
4886 | slot = htab_find_slot (copied_types, &pair, INSERT); |
4887 | if (*slot != NULL) | |
fe978cb0 | 4888 | return ((struct type_pair *) *slot)->newobj; |
ae5a43e0 | 4889 | |
e9bb382b | 4890 | new_type = alloc_type_arch (get_type_arch (type)); |
ae5a43e0 DJ |
4891 | |
4892 | /* We must add the new type to the hash table immediately, in case | |
4893 | we encounter this type again during a recursive call below. */ | |
fd90ace4 YQ |
4894 | struct type_pair *stored |
4895 | = new (&objfile->objfile_obstack) struct type_pair (type, new_type); | |
4896 | ||
ae5a43e0 DJ |
4897 | *slot = stored; |
4898 | ||
876cecd0 TT |
4899 | /* Copy the common fields of types. For the main type, we simply |
4900 | copy the entire thing and then update specific fields as needed. */ | |
4901 | *TYPE_MAIN_TYPE (new_type) = *TYPE_MAIN_TYPE (type); | |
e9bb382b UW |
4902 | TYPE_OBJFILE_OWNED (new_type) = 0; |
4903 | TYPE_OWNER (new_type).gdbarch = get_type_arch (type); | |
876cecd0 | 4904 | |
ae5a43e0 DJ |
4905 | if (TYPE_NAME (type)) |
4906 | TYPE_NAME (new_type) = xstrdup (TYPE_NAME (type)); | |
ae5a43e0 DJ |
4907 | |
4908 | TYPE_INSTANCE_FLAGS (new_type) = TYPE_INSTANCE_FLAGS (type); | |
4909 | TYPE_LENGTH (new_type) = TYPE_LENGTH (type); | |
4910 | ||
4911 | /* Copy the fields. */ | |
ae5a43e0 DJ |
4912 | if (TYPE_NFIELDS (type)) |
4913 | { | |
4914 | int i, nfields; | |
4915 | ||
4916 | nfields = TYPE_NFIELDS (type); | |
2fabdf33 AB |
4917 | TYPE_FIELDS (new_type) = (struct field *) |
4918 | TYPE_ZALLOC (new_type, nfields * sizeof (struct field)); | |
ae5a43e0 DJ |
4919 | for (i = 0; i < nfields; i++) |
4920 | { | |
7ba81444 MS |
4921 | TYPE_FIELD_ARTIFICIAL (new_type, i) = |
4922 | TYPE_FIELD_ARTIFICIAL (type, i); | |
ae5a43e0 DJ |
4923 | TYPE_FIELD_BITSIZE (new_type, i) = TYPE_FIELD_BITSIZE (type, i); |
4924 | if (TYPE_FIELD_TYPE (type, i)) | |
4925 | TYPE_FIELD_TYPE (new_type, i) | |
4926 | = copy_type_recursive (objfile, TYPE_FIELD_TYPE (type, i), | |
4927 | copied_types); | |
4928 | if (TYPE_FIELD_NAME (type, i)) | |
7ba81444 MS |
4929 | TYPE_FIELD_NAME (new_type, i) = |
4930 | xstrdup (TYPE_FIELD_NAME (type, i)); | |
d6a843b5 | 4931 | switch (TYPE_FIELD_LOC_KIND (type, i)) |
ae5a43e0 | 4932 | { |
d6a843b5 JK |
4933 | case FIELD_LOC_KIND_BITPOS: |
4934 | SET_FIELD_BITPOS (TYPE_FIELD (new_type, i), | |
4935 | TYPE_FIELD_BITPOS (type, i)); | |
4936 | break; | |
14e75d8e JK |
4937 | case FIELD_LOC_KIND_ENUMVAL: |
4938 | SET_FIELD_ENUMVAL (TYPE_FIELD (new_type, i), | |
4939 | TYPE_FIELD_ENUMVAL (type, i)); | |
4940 | break; | |
d6a843b5 JK |
4941 | case FIELD_LOC_KIND_PHYSADDR: |
4942 | SET_FIELD_PHYSADDR (TYPE_FIELD (new_type, i), | |
4943 | TYPE_FIELD_STATIC_PHYSADDR (type, i)); | |
4944 | break; | |
4945 | case FIELD_LOC_KIND_PHYSNAME: | |
4946 | SET_FIELD_PHYSNAME (TYPE_FIELD (new_type, i), | |
4947 | xstrdup (TYPE_FIELD_STATIC_PHYSNAME (type, | |
4948 | i))); | |
4949 | break; | |
4950 | default: | |
4951 | internal_error (__FILE__, __LINE__, | |
4952 | _("Unexpected type field location kind: %d"), | |
4953 | TYPE_FIELD_LOC_KIND (type, i)); | |
ae5a43e0 DJ |
4954 | } |
4955 | } | |
4956 | } | |
4957 | ||
0963b4bd | 4958 | /* For range types, copy the bounds information. */ |
43bbcdc2 PH |
4959 | if (TYPE_CODE (type) == TYPE_CODE_RANGE) |
4960 | { | |
2fabdf33 AB |
4961 | TYPE_RANGE_DATA (new_type) = (struct range_bounds *) |
4962 | TYPE_ALLOC (new_type, sizeof (struct range_bounds)); | |
43bbcdc2 PH |
4963 | *TYPE_RANGE_DATA (new_type) = *TYPE_RANGE_DATA (type); |
4964 | } | |
4965 | ||
d9823cbb KB |
4966 | if (TYPE_DYN_PROP_LIST (type) != NULL) |
4967 | TYPE_DYN_PROP_LIST (new_type) | |
4968 | = copy_dynamic_prop_list (&objfile->objfile_obstack, | |
4969 | TYPE_DYN_PROP_LIST (type)); | |
4970 | ||
3cdcd0ce | 4971 | |
ae5a43e0 DJ |
4972 | /* Copy pointers to other types. */ |
4973 | if (TYPE_TARGET_TYPE (type)) | |
7ba81444 MS |
4974 | TYPE_TARGET_TYPE (new_type) = |
4975 | copy_type_recursive (objfile, | |
4976 | TYPE_TARGET_TYPE (type), | |
4977 | copied_types); | |
f6b3afbf | 4978 | |
ae5a43e0 DJ |
4979 | /* Maybe copy the type_specific bits. |
4980 | ||
4981 | NOTE drow/2005-12-09: We do not copy the C++-specific bits like | |
4982 | base classes and methods. There's no fundamental reason why we | |
4983 | can't, but at the moment it is not needed. */ | |
4984 | ||
f6b3afbf DE |
4985 | switch (TYPE_SPECIFIC_FIELD (type)) |
4986 | { | |
4987 | case TYPE_SPECIFIC_NONE: | |
4988 | break; | |
4989 | case TYPE_SPECIFIC_FUNC: | |
4990 | INIT_FUNC_SPECIFIC (new_type); | |
4991 | TYPE_CALLING_CONVENTION (new_type) = TYPE_CALLING_CONVENTION (type); | |
4992 | TYPE_NO_RETURN (new_type) = TYPE_NO_RETURN (type); | |
4993 | TYPE_TAIL_CALL_LIST (new_type) = NULL; | |
4994 | break; | |
4995 | case TYPE_SPECIFIC_FLOATFORMAT: | |
4996 | TYPE_FLOATFORMAT (new_type) = TYPE_FLOATFORMAT (type); | |
4997 | break; | |
4998 | case TYPE_SPECIFIC_CPLUS_STUFF: | |
4999 | INIT_CPLUS_SPECIFIC (new_type); | |
5000 | break; | |
5001 | case TYPE_SPECIFIC_GNAT_STUFF: | |
5002 | INIT_GNAT_SPECIFIC (new_type); | |
5003 | break; | |
09e2d7c7 DE |
5004 | case TYPE_SPECIFIC_SELF_TYPE: |
5005 | set_type_self_type (new_type, | |
5006 | copy_type_recursive (objfile, TYPE_SELF_TYPE (type), | |
5007 | copied_types)); | |
5008 | break; | |
f6b3afbf DE |
5009 | default: |
5010 | gdb_assert_not_reached ("bad type_specific_kind"); | |
5011 | } | |
ae5a43e0 DJ |
5012 | |
5013 | return new_type; | |
5014 | } | |
5015 | ||
4af88198 JB |
5016 | /* Make a copy of the given TYPE, except that the pointer & reference |
5017 | types are not preserved. | |
5018 | ||
5019 | This function assumes that the given type has an associated objfile. | |
5020 | This objfile is used to allocate the new type. */ | |
5021 | ||
5022 | struct type * | |
5023 | copy_type (const struct type *type) | |
5024 | { | |
5025 | struct type *new_type; | |
5026 | ||
e9bb382b | 5027 | gdb_assert (TYPE_OBJFILE_OWNED (type)); |
4af88198 | 5028 | |
e9bb382b | 5029 | new_type = alloc_type_copy (type); |
4af88198 JB |
5030 | TYPE_INSTANCE_FLAGS (new_type) = TYPE_INSTANCE_FLAGS (type); |
5031 | TYPE_LENGTH (new_type) = TYPE_LENGTH (type); | |
5032 | memcpy (TYPE_MAIN_TYPE (new_type), TYPE_MAIN_TYPE (type), | |
5033 | sizeof (struct main_type)); | |
d9823cbb KB |
5034 | if (TYPE_DYN_PROP_LIST (type) != NULL) |
5035 | TYPE_DYN_PROP_LIST (new_type) | |
5036 | = copy_dynamic_prop_list (&TYPE_OBJFILE (type) -> objfile_obstack, | |
5037 | TYPE_DYN_PROP_LIST (type)); | |
4af88198 JB |
5038 | |
5039 | return new_type; | |
5040 | } | |
5212577a | 5041 | \f |
e9bb382b UW |
5042 | /* Helper functions to initialize architecture-specific types. */ |
5043 | ||
5044 | /* Allocate a type structure associated with GDBARCH and set its | |
5045 | CODE, LENGTH, and NAME fields. */ | |
5212577a | 5046 | |
e9bb382b UW |
5047 | struct type * |
5048 | arch_type (struct gdbarch *gdbarch, | |
77b7c781 | 5049 | enum type_code code, int bit, const char *name) |
e9bb382b UW |
5050 | { |
5051 | struct type *type; | |
5052 | ||
5053 | type = alloc_type_arch (gdbarch); | |
ae438bc5 | 5054 | set_type_code (type, code); |
77b7c781 UW |
5055 | gdb_assert ((bit % TARGET_CHAR_BIT) == 0); |
5056 | TYPE_LENGTH (type) = bit / TARGET_CHAR_BIT; | |
e9bb382b UW |
5057 | |
5058 | if (name) | |
6c214e7c | 5059 | TYPE_NAME (type) = gdbarch_obstack_strdup (gdbarch, name); |
e9bb382b UW |
5060 | |
5061 | return type; | |
5062 | } | |
5063 | ||
5064 | /* Allocate a TYPE_CODE_INT type structure associated with GDBARCH. | |
5065 | BIT is the type size in bits. If UNSIGNED_P is non-zero, set | |
5066 | the type's TYPE_UNSIGNED flag. NAME is the type name. */ | |
5212577a | 5067 | |
e9bb382b UW |
5068 | struct type * |
5069 | arch_integer_type (struct gdbarch *gdbarch, | |
695bfa52 | 5070 | int bit, int unsigned_p, const char *name) |
e9bb382b UW |
5071 | { |
5072 | struct type *t; | |
5073 | ||
77b7c781 | 5074 | t = arch_type (gdbarch, TYPE_CODE_INT, bit, name); |
e9bb382b UW |
5075 | if (unsigned_p) |
5076 | TYPE_UNSIGNED (t) = 1; | |
e9bb382b UW |
5077 | |
5078 | return t; | |
5079 | } | |
5080 | ||
5081 | /* Allocate a TYPE_CODE_CHAR type structure associated with GDBARCH. | |
5082 | BIT is the type size in bits. If UNSIGNED_P is non-zero, set | |
5083 | the type's TYPE_UNSIGNED flag. NAME is the type name. */ | |
5212577a | 5084 | |
e9bb382b UW |
5085 | struct type * |
5086 | arch_character_type (struct gdbarch *gdbarch, | |
695bfa52 | 5087 | int bit, int unsigned_p, const char *name) |
e9bb382b UW |
5088 | { |
5089 | struct type *t; | |
5090 | ||
77b7c781 | 5091 | t = arch_type (gdbarch, TYPE_CODE_CHAR, bit, name); |
e9bb382b UW |
5092 | if (unsigned_p) |
5093 | TYPE_UNSIGNED (t) = 1; | |
5094 | ||
5095 | return t; | |
5096 | } | |
5097 | ||
5098 | /* Allocate a TYPE_CODE_BOOL type structure associated with GDBARCH. | |
5099 | BIT is the type size in bits. If UNSIGNED_P is non-zero, set | |
5100 | the type's TYPE_UNSIGNED flag. NAME is the type name. */ | |
5212577a | 5101 | |
e9bb382b UW |
5102 | struct type * |
5103 | arch_boolean_type (struct gdbarch *gdbarch, | |
695bfa52 | 5104 | int bit, int unsigned_p, const char *name) |
e9bb382b UW |
5105 | { |
5106 | struct type *t; | |
5107 | ||
77b7c781 | 5108 | t = arch_type (gdbarch, TYPE_CODE_BOOL, bit, name); |
e9bb382b UW |
5109 | if (unsigned_p) |
5110 | TYPE_UNSIGNED (t) = 1; | |
5111 | ||
5112 | return t; | |
5113 | } | |
5114 | ||
5115 | /* Allocate a TYPE_CODE_FLT type structure associated with GDBARCH. | |
5116 | BIT is the type size in bits; if BIT equals -1, the size is | |
5117 | determined by the floatformat. NAME is the type name. Set the | |
5118 | TYPE_FLOATFORMAT from FLOATFORMATS. */ | |
5212577a | 5119 | |
27067745 | 5120 | struct type * |
e9bb382b | 5121 | arch_float_type (struct gdbarch *gdbarch, |
695bfa52 TT |
5122 | int bit, const char *name, |
5123 | const struct floatformat **floatformats) | |
8da61cc4 | 5124 | { |
0db7851f | 5125 | const struct floatformat *fmt = floatformats[gdbarch_byte_order (gdbarch)]; |
8da61cc4 DJ |
5126 | struct type *t; |
5127 | ||
0db7851f | 5128 | bit = verify_floatformat (bit, fmt); |
77b7c781 | 5129 | t = arch_type (gdbarch, TYPE_CODE_FLT, bit, name); |
0db7851f | 5130 | TYPE_FLOATFORMAT (t) = fmt; |
b79497cb | 5131 | |
8da61cc4 DJ |
5132 | return t; |
5133 | } | |
5134 | ||
88dfca6c UW |
5135 | /* Allocate a TYPE_CODE_DECFLOAT type structure associated with GDBARCH. |
5136 | BIT is the type size in bits. NAME is the type name. */ | |
5137 | ||
5138 | struct type * | |
5139 | arch_decfloat_type (struct gdbarch *gdbarch, int bit, const char *name) | |
5140 | { | |
5141 | struct type *t; | |
5142 | ||
77b7c781 | 5143 | t = arch_type (gdbarch, TYPE_CODE_DECFLOAT, bit, name); |
88dfca6c UW |
5144 | return t; |
5145 | } | |
5146 | ||
e9bb382b UW |
5147 | /* Allocate a TYPE_CODE_COMPLEX type structure associated with GDBARCH. |
5148 | NAME is the type name. TARGET_TYPE is the component float type. */ | |
5212577a | 5149 | |
27067745 | 5150 | struct type * |
e9bb382b | 5151 | arch_complex_type (struct gdbarch *gdbarch, |
695bfa52 | 5152 | const char *name, struct type *target_type) |
27067745 UW |
5153 | { |
5154 | struct type *t; | |
d8734c88 | 5155 | |
e9bb382b | 5156 | t = arch_type (gdbarch, TYPE_CODE_COMPLEX, |
77b7c781 | 5157 | 2 * TYPE_LENGTH (target_type) * TARGET_CHAR_BIT, name); |
27067745 UW |
5158 | TYPE_TARGET_TYPE (t) = target_type; |
5159 | return t; | |
5160 | } | |
5161 | ||
88dfca6c UW |
5162 | /* Allocate a TYPE_CODE_PTR type structure associated with GDBARCH. |
5163 | BIT is the pointer type size in bits. NAME is the type name. | |
5164 | TARGET_TYPE is the pointer target type. Always sets the pointer type's | |
5165 | TYPE_UNSIGNED flag. */ | |
5166 | ||
5167 | struct type * | |
5168 | arch_pointer_type (struct gdbarch *gdbarch, | |
5169 | int bit, const char *name, struct type *target_type) | |
5170 | { | |
5171 | struct type *t; | |
5172 | ||
77b7c781 | 5173 | t = arch_type (gdbarch, TYPE_CODE_PTR, bit, name); |
88dfca6c UW |
5174 | TYPE_TARGET_TYPE (t) = target_type; |
5175 | TYPE_UNSIGNED (t) = 1; | |
5176 | return t; | |
5177 | } | |
5178 | ||
e9bb382b | 5179 | /* Allocate a TYPE_CODE_FLAGS type structure associated with GDBARCH. |
77b7c781 | 5180 | NAME is the type name. BIT is the size of the flag word in bits. */ |
5212577a | 5181 | |
e9bb382b | 5182 | struct type * |
77b7c781 | 5183 | arch_flags_type (struct gdbarch *gdbarch, const char *name, int bit) |
e9bb382b | 5184 | { |
e9bb382b UW |
5185 | struct type *type; |
5186 | ||
77b7c781 | 5187 | type = arch_type (gdbarch, TYPE_CODE_FLAGS, bit, name); |
e9bb382b | 5188 | TYPE_UNSIGNED (type) = 1; |
81516450 DE |
5189 | TYPE_NFIELDS (type) = 0; |
5190 | /* Pre-allocate enough space assuming every field is one bit. */ | |
224c3ddb | 5191 | TYPE_FIELDS (type) |
77b7c781 | 5192 | = (struct field *) TYPE_ZALLOC (type, bit * sizeof (struct field)); |
e9bb382b UW |
5193 | |
5194 | return type; | |
5195 | } | |
5196 | ||
5197 | /* Add field to TYPE_CODE_FLAGS type TYPE to indicate the bit at | |
81516450 DE |
5198 | position BITPOS is called NAME. Pass NAME as "" for fields that |
5199 | should not be printed. */ | |
5200 | ||
5201 | void | |
5202 | append_flags_type_field (struct type *type, int start_bitpos, int nr_bits, | |
695bfa52 | 5203 | struct type *field_type, const char *name) |
81516450 DE |
5204 | { |
5205 | int type_bitsize = TYPE_LENGTH (type) * TARGET_CHAR_BIT; | |
5206 | int field_nr = TYPE_NFIELDS (type); | |
5207 | ||
5208 | gdb_assert (TYPE_CODE (type) == TYPE_CODE_FLAGS); | |
5209 | gdb_assert (TYPE_NFIELDS (type) + 1 <= type_bitsize); | |
5210 | gdb_assert (start_bitpos >= 0 && start_bitpos < type_bitsize); | |
5211 | gdb_assert (nr_bits >= 1 && nr_bits <= type_bitsize); | |
5212 | gdb_assert (name != NULL); | |
5213 | ||
5214 | TYPE_FIELD_NAME (type, field_nr) = xstrdup (name); | |
5215 | TYPE_FIELD_TYPE (type, field_nr) = field_type; | |
5216 | SET_FIELD_BITPOS (TYPE_FIELD (type, field_nr), start_bitpos); | |
5217 | TYPE_FIELD_BITSIZE (type, field_nr) = nr_bits; | |
5218 | ++TYPE_NFIELDS (type); | |
5219 | } | |
5220 | ||
5221 | /* Special version of append_flags_type_field to add a flag field. | |
5222 | Add field to TYPE_CODE_FLAGS type TYPE to indicate the bit at | |
e9bb382b | 5223 | position BITPOS is called NAME. */ |
5212577a | 5224 | |
e9bb382b | 5225 | void |
695bfa52 | 5226 | append_flags_type_flag (struct type *type, int bitpos, const char *name) |
e9bb382b | 5227 | { |
81516450 | 5228 | struct gdbarch *gdbarch = get_type_arch (type); |
e9bb382b | 5229 | |
81516450 DE |
5230 | append_flags_type_field (type, bitpos, 1, |
5231 | builtin_type (gdbarch)->builtin_bool, | |
5232 | name); | |
e9bb382b UW |
5233 | } |
5234 | ||
5235 | /* Allocate a TYPE_CODE_STRUCT or TYPE_CODE_UNION type structure (as | |
5236 | specified by CODE) associated with GDBARCH. NAME is the type name. */ | |
5212577a | 5237 | |
e9bb382b | 5238 | struct type * |
695bfa52 TT |
5239 | arch_composite_type (struct gdbarch *gdbarch, const char *name, |
5240 | enum type_code code) | |
e9bb382b UW |
5241 | { |
5242 | struct type *t; | |
d8734c88 | 5243 | |
e9bb382b UW |
5244 | gdb_assert (code == TYPE_CODE_STRUCT || code == TYPE_CODE_UNION); |
5245 | t = arch_type (gdbarch, code, 0, NULL); | |
e86ca25f | 5246 | TYPE_NAME (t) = name; |
e9bb382b UW |
5247 | INIT_CPLUS_SPECIFIC (t); |
5248 | return t; | |
5249 | } | |
5250 | ||
5251 | /* Add new field with name NAME and type FIELD to composite type T. | |
f5dff777 DJ |
5252 | Do not set the field's position or adjust the type's length; |
5253 | the caller should do so. Return the new field. */ | |
5212577a | 5254 | |
f5dff777 | 5255 | struct field * |
695bfa52 | 5256 | append_composite_type_field_raw (struct type *t, const char *name, |
f5dff777 | 5257 | struct type *field) |
e9bb382b UW |
5258 | { |
5259 | struct field *f; | |
d8734c88 | 5260 | |
e9bb382b | 5261 | TYPE_NFIELDS (t) = TYPE_NFIELDS (t) + 1; |
224c3ddb SM |
5262 | TYPE_FIELDS (t) = XRESIZEVEC (struct field, TYPE_FIELDS (t), |
5263 | TYPE_NFIELDS (t)); | |
e9bb382b UW |
5264 | f = &(TYPE_FIELDS (t)[TYPE_NFIELDS (t) - 1]); |
5265 | memset (f, 0, sizeof f[0]); | |
5266 | FIELD_TYPE (f[0]) = field; | |
5267 | FIELD_NAME (f[0]) = name; | |
f5dff777 DJ |
5268 | return f; |
5269 | } | |
5270 | ||
5271 | /* Add new field with name NAME and type FIELD to composite type T. | |
5272 | ALIGNMENT (if non-zero) specifies the minimum field alignment. */ | |
5212577a | 5273 | |
f5dff777 | 5274 | void |
695bfa52 | 5275 | append_composite_type_field_aligned (struct type *t, const char *name, |
f5dff777 DJ |
5276 | struct type *field, int alignment) |
5277 | { | |
5278 | struct field *f = append_composite_type_field_raw (t, name, field); | |
d8734c88 | 5279 | |
e9bb382b UW |
5280 | if (TYPE_CODE (t) == TYPE_CODE_UNION) |
5281 | { | |
5282 | if (TYPE_LENGTH (t) < TYPE_LENGTH (field)) | |
5283 | TYPE_LENGTH (t) = TYPE_LENGTH (field); | |
5284 | } | |
5285 | else if (TYPE_CODE (t) == TYPE_CODE_STRUCT) | |
5286 | { | |
5287 | TYPE_LENGTH (t) = TYPE_LENGTH (t) + TYPE_LENGTH (field); | |
5288 | if (TYPE_NFIELDS (t) > 1) | |
5289 | { | |
f41f5e61 PA |
5290 | SET_FIELD_BITPOS (f[0], |
5291 | (FIELD_BITPOS (f[-1]) | |
5292 | + (TYPE_LENGTH (FIELD_TYPE (f[-1])) | |
5293 | * TARGET_CHAR_BIT))); | |
e9bb382b UW |
5294 | |
5295 | if (alignment) | |
5296 | { | |
86c3c1fc AB |
5297 | int left; |
5298 | ||
5299 | alignment *= TARGET_CHAR_BIT; | |
5300 | left = FIELD_BITPOS (f[0]) % alignment; | |
d8734c88 | 5301 | |
e9bb382b UW |
5302 | if (left) |
5303 | { | |
f41f5e61 | 5304 | SET_FIELD_BITPOS (f[0], FIELD_BITPOS (f[0]) + (alignment - left)); |
86c3c1fc | 5305 | TYPE_LENGTH (t) += (alignment - left) / TARGET_CHAR_BIT; |
e9bb382b UW |
5306 | } |
5307 | } | |
5308 | } | |
5309 | } | |
5310 | } | |
5311 | ||
5312 | /* Add new field with name NAME and type FIELD to composite type T. */ | |
5212577a | 5313 | |
e9bb382b | 5314 | void |
695bfa52 | 5315 | append_composite_type_field (struct type *t, const char *name, |
e9bb382b UW |
5316 | struct type *field) |
5317 | { | |
5318 | append_composite_type_field_aligned (t, name, field, 0); | |
5319 | } | |
5320 | ||
000177f0 AC |
5321 | static struct gdbarch_data *gdbtypes_data; |
5322 | ||
5323 | const struct builtin_type * | |
5324 | builtin_type (struct gdbarch *gdbarch) | |
5325 | { | |
9a3c8263 | 5326 | return (const struct builtin_type *) gdbarch_data (gdbarch, gdbtypes_data); |
000177f0 AC |
5327 | } |
5328 | ||
5329 | static void * | |
5330 | gdbtypes_post_init (struct gdbarch *gdbarch) | |
5331 | { | |
5332 | struct builtin_type *builtin_type | |
5333 | = GDBARCH_OBSTACK_ZALLOC (gdbarch, struct builtin_type); | |
5334 | ||
46bf5051 | 5335 | /* Basic types. */ |
e9bb382b | 5336 | builtin_type->builtin_void |
77b7c781 | 5337 | = arch_type (gdbarch, TYPE_CODE_VOID, TARGET_CHAR_BIT, "void"); |
e9bb382b UW |
5338 | builtin_type->builtin_char |
5339 | = arch_integer_type (gdbarch, TARGET_CHAR_BIT, | |
5340 | !gdbarch_char_signed (gdbarch), "char"); | |
c413c448 | 5341 | TYPE_NOSIGN (builtin_type->builtin_char) = 1; |
e9bb382b UW |
5342 | builtin_type->builtin_signed_char |
5343 | = arch_integer_type (gdbarch, TARGET_CHAR_BIT, | |
5344 | 0, "signed char"); | |
5345 | builtin_type->builtin_unsigned_char | |
5346 | = arch_integer_type (gdbarch, TARGET_CHAR_BIT, | |
5347 | 1, "unsigned char"); | |
5348 | builtin_type->builtin_short | |
5349 | = arch_integer_type (gdbarch, gdbarch_short_bit (gdbarch), | |
5350 | 0, "short"); | |
5351 | builtin_type->builtin_unsigned_short | |
5352 | = arch_integer_type (gdbarch, gdbarch_short_bit (gdbarch), | |
5353 | 1, "unsigned short"); | |
5354 | builtin_type->builtin_int | |
5355 | = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), | |
5356 | 0, "int"); | |
5357 | builtin_type->builtin_unsigned_int | |
5358 | = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), | |
5359 | 1, "unsigned int"); | |
5360 | builtin_type->builtin_long | |
5361 | = arch_integer_type (gdbarch, gdbarch_long_bit (gdbarch), | |
5362 | 0, "long"); | |
5363 | builtin_type->builtin_unsigned_long | |
5364 | = arch_integer_type (gdbarch, gdbarch_long_bit (gdbarch), | |
5365 | 1, "unsigned long"); | |
5366 | builtin_type->builtin_long_long | |
5367 | = arch_integer_type (gdbarch, gdbarch_long_long_bit (gdbarch), | |
5368 | 0, "long long"); | |
5369 | builtin_type->builtin_unsigned_long_long | |
5370 | = arch_integer_type (gdbarch, gdbarch_long_long_bit (gdbarch), | |
5371 | 1, "unsigned long long"); | |
a6d0f249 AH |
5372 | builtin_type->builtin_half |
5373 | = arch_float_type (gdbarch, gdbarch_half_bit (gdbarch), | |
5374 | "half", gdbarch_half_format (gdbarch)); | |
70bd8e24 | 5375 | builtin_type->builtin_float |
e9bb382b | 5376 | = arch_float_type (gdbarch, gdbarch_float_bit (gdbarch), |
27067745 | 5377 | "float", gdbarch_float_format (gdbarch)); |
70bd8e24 | 5378 | builtin_type->builtin_double |
e9bb382b | 5379 | = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch), |
27067745 | 5380 | "double", gdbarch_double_format (gdbarch)); |
70bd8e24 | 5381 | builtin_type->builtin_long_double |
e9bb382b | 5382 | = arch_float_type (gdbarch, gdbarch_long_double_bit (gdbarch), |
27067745 | 5383 | "long double", gdbarch_long_double_format (gdbarch)); |
70bd8e24 | 5384 | builtin_type->builtin_complex |
e9bb382b UW |
5385 | = arch_complex_type (gdbarch, "complex", |
5386 | builtin_type->builtin_float); | |
70bd8e24 | 5387 | builtin_type->builtin_double_complex |
e9bb382b UW |
5388 | = arch_complex_type (gdbarch, "double complex", |
5389 | builtin_type->builtin_double); | |
5390 | builtin_type->builtin_string | |
77b7c781 | 5391 | = arch_type (gdbarch, TYPE_CODE_STRING, TARGET_CHAR_BIT, "string"); |
e9bb382b | 5392 | builtin_type->builtin_bool |
77b7c781 | 5393 | = arch_type (gdbarch, TYPE_CODE_BOOL, TARGET_CHAR_BIT, "bool"); |
000177f0 | 5394 | |
7678ef8f TJB |
5395 | /* The following three are about decimal floating point types, which |
5396 | are 32-bits, 64-bits and 128-bits respectively. */ | |
5397 | builtin_type->builtin_decfloat | |
88dfca6c | 5398 | = arch_decfloat_type (gdbarch, 32, "_Decimal32"); |
7678ef8f | 5399 | builtin_type->builtin_decdouble |
88dfca6c | 5400 | = arch_decfloat_type (gdbarch, 64, "_Decimal64"); |
7678ef8f | 5401 | builtin_type->builtin_declong |
88dfca6c | 5402 | = arch_decfloat_type (gdbarch, 128, "_Decimal128"); |
7678ef8f | 5403 | |
69feb676 | 5404 | /* "True" character types. */ |
e9bb382b UW |
5405 | builtin_type->builtin_true_char |
5406 | = arch_character_type (gdbarch, TARGET_CHAR_BIT, 0, "true character"); | |
5407 | builtin_type->builtin_true_unsigned_char | |
5408 | = arch_character_type (gdbarch, TARGET_CHAR_BIT, 1, "true character"); | |
69feb676 | 5409 | |
df4df182 | 5410 | /* Fixed-size integer types. */ |
e9bb382b UW |
5411 | builtin_type->builtin_int0 |
5412 | = arch_integer_type (gdbarch, 0, 0, "int0_t"); | |
5413 | builtin_type->builtin_int8 | |
5414 | = arch_integer_type (gdbarch, 8, 0, "int8_t"); | |
5415 | builtin_type->builtin_uint8 | |
5416 | = arch_integer_type (gdbarch, 8, 1, "uint8_t"); | |
5417 | builtin_type->builtin_int16 | |
5418 | = arch_integer_type (gdbarch, 16, 0, "int16_t"); | |
5419 | builtin_type->builtin_uint16 | |
5420 | = arch_integer_type (gdbarch, 16, 1, "uint16_t"); | |
d1908f2d JD |
5421 | builtin_type->builtin_int24 |
5422 | = arch_integer_type (gdbarch, 24, 0, "int24_t"); | |
5423 | builtin_type->builtin_uint24 | |
5424 | = arch_integer_type (gdbarch, 24, 1, "uint24_t"); | |
e9bb382b UW |
5425 | builtin_type->builtin_int32 |
5426 | = arch_integer_type (gdbarch, 32, 0, "int32_t"); | |
5427 | builtin_type->builtin_uint32 | |
5428 | = arch_integer_type (gdbarch, 32, 1, "uint32_t"); | |
5429 | builtin_type->builtin_int64 | |
5430 | = arch_integer_type (gdbarch, 64, 0, "int64_t"); | |
5431 | builtin_type->builtin_uint64 | |
5432 | = arch_integer_type (gdbarch, 64, 1, "uint64_t"); | |
5433 | builtin_type->builtin_int128 | |
5434 | = arch_integer_type (gdbarch, 128, 0, "int128_t"); | |
5435 | builtin_type->builtin_uint128 | |
5436 | = arch_integer_type (gdbarch, 128, 1, "uint128_t"); | |
2844d6b5 KW |
5437 | TYPE_INSTANCE_FLAGS (builtin_type->builtin_int8) |= |
5438 | TYPE_INSTANCE_FLAG_NOTTEXT; | |
5439 | TYPE_INSTANCE_FLAGS (builtin_type->builtin_uint8) |= | |
5440 | TYPE_INSTANCE_FLAG_NOTTEXT; | |
df4df182 | 5441 | |
9a22f0d0 PM |
5442 | /* Wide character types. */ |
5443 | builtin_type->builtin_char16 | |
53e710ac | 5444 | = arch_integer_type (gdbarch, 16, 1, "char16_t"); |
9a22f0d0 | 5445 | builtin_type->builtin_char32 |
53e710ac | 5446 | = arch_integer_type (gdbarch, 32, 1, "char32_t"); |
53375380 PA |
5447 | builtin_type->builtin_wchar |
5448 | = arch_integer_type (gdbarch, gdbarch_wchar_bit (gdbarch), | |
5449 | !gdbarch_wchar_signed (gdbarch), "wchar_t"); | |
9a22f0d0 | 5450 | |
46bf5051 | 5451 | /* Default data/code pointer types. */ |
e9bb382b UW |
5452 | builtin_type->builtin_data_ptr |
5453 | = lookup_pointer_type (builtin_type->builtin_void); | |
5454 | builtin_type->builtin_func_ptr | |
5455 | = lookup_pointer_type (lookup_function_type (builtin_type->builtin_void)); | |
0875794a JK |
5456 | builtin_type->builtin_func_func |
5457 | = lookup_function_type (builtin_type->builtin_func_ptr); | |
46bf5051 | 5458 | |
78267919 | 5459 | /* This type represents a GDB internal function. */ |
e9bb382b UW |
5460 | builtin_type->internal_fn |
5461 | = arch_type (gdbarch, TYPE_CODE_INTERNAL_FUNCTION, 0, | |
5462 | "<internal function>"); | |
78267919 | 5463 | |
e81e7f5e SC |
5464 | /* This type represents an xmethod. */ |
5465 | builtin_type->xmethod | |
5466 | = arch_type (gdbarch, TYPE_CODE_XMETHOD, 0, "<xmethod>"); | |
5467 | ||
46bf5051 UW |
5468 | return builtin_type; |
5469 | } | |
5470 | ||
46bf5051 UW |
5471 | /* This set of objfile-based types is intended to be used by symbol |
5472 | readers as basic types. */ | |
5473 | ||
7a102139 TT |
5474 | static const struct objfile_key<struct objfile_type, |
5475 | gdb::noop_deleter<struct objfile_type>> | |
5476 | objfile_type_data; | |
46bf5051 UW |
5477 | |
5478 | const struct objfile_type * | |
5479 | objfile_type (struct objfile *objfile) | |
5480 | { | |
5481 | struct gdbarch *gdbarch; | |
7a102139 | 5482 | struct objfile_type *objfile_type = objfile_type_data.get (objfile); |
46bf5051 UW |
5483 | |
5484 | if (objfile_type) | |
5485 | return objfile_type; | |
5486 | ||
5487 | objfile_type = OBSTACK_CALLOC (&objfile->objfile_obstack, | |
5488 | 1, struct objfile_type); | |
5489 | ||
5490 | /* Use the objfile architecture to determine basic type properties. */ | |
5491 | gdbarch = get_objfile_arch (objfile); | |
5492 | ||
5493 | /* Basic types. */ | |
5494 | objfile_type->builtin_void | |
77b7c781 | 5495 | = init_type (objfile, TYPE_CODE_VOID, TARGET_CHAR_BIT, "void"); |
46bf5051 | 5496 | objfile_type->builtin_char |
19f392bc UW |
5497 | = init_integer_type (objfile, TARGET_CHAR_BIT, |
5498 | !gdbarch_char_signed (gdbarch), "char"); | |
c413c448 | 5499 | TYPE_NOSIGN (objfile_type->builtin_char) = 1; |
46bf5051 | 5500 | objfile_type->builtin_signed_char |
19f392bc UW |
5501 | = init_integer_type (objfile, TARGET_CHAR_BIT, |
5502 | 0, "signed char"); | |
46bf5051 | 5503 | objfile_type->builtin_unsigned_char |
19f392bc UW |
5504 | = init_integer_type (objfile, TARGET_CHAR_BIT, |
5505 | 1, "unsigned char"); | |
46bf5051 | 5506 | objfile_type->builtin_short |
19f392bc UW |
5507 | = init_integer_type (objfile, gdbarch_short_bit (gdbarch), |
5508 | 0, "short"); | |
46bf5051 | 5509 | objfile_type->builtin_unsigned_short |
19f392bc UW |
5510 | = init_integer_type (objfile, gdbarch_short_bit (gdbarch), |
5511 | 1, "unsigned short"); | |
46bf5051 | 5512 | objfile_type->builtin_int |
19f392bc UW |
5513 | = init_integer_type (objfile, gdbarch_int_bit (gdbarch), |
5514 | 0, "int"); | |
46bf5051 | 5515 | objfile_type->builtin_unsigned_int |
19f392bc UW |
5516 | = init_integer_type (objfile, gdbarch_int_bit (gdbarch), |
5517 | 1, "unsigned int"); | |
46bf5051 | 5518 | objfile_type->builtin_long |
19f392bc UW |
5519 | = init_integer_type (objfile, gdbarch_long_bit (gdbarch), |
5520 | 0, "long"); | |
46bf5051 | 5521 | objfile_type->builtin_unsigned_long |
19f392bc UW |
5522 | = init_integer_type (objfile, gdbarch_long_bit (gdbarch), |
5523 | 1, "unsigned long"); | |
46bf5051 | 5524 | objfile_type->builtin_long_long |
19f392bc UW |
5525 | = init_integer_type (objfile, gdbarch_long_long_bit (gdbarch), |
5526 | 0, "long long"); | |
46bf5051 | 5527 | objfile_type->builtin_unsigned_long_long |
19f392bc UW |
5528 | = init_integer_type (objfile, gdbarch_long_long_bit (gdbarch), |
5529 | 1, "unsigned long long"); | |
46bf5051 | 5530 | objfile_type->builtin_float |
19f392bc UW |
5531 | = init_float_type (objfile, gdbarch_float_bit (gdbarch), |
5532 | "float", gdbarch_float_format (gdbarch)); | |
46bf5051 | 5533 | objfile_type->builtin_double |
19f392bc UW |
5534 | = init_float_type (objfile, gdbarch_double_bit (gdbarch), |
5535 | "double", gdbarch_double_format (gdbarch)); | |
46bf5051 | 5536 | objfile_type->builtin_long_double |
19f392bc UW |
5537 | = init_float_type (objfile, gdbarch_long_double_bit (gdbarch), |
5538 | "long double", gdbarch_long_double_format (gdbarch)); | |
46bf5051 UW |
5539 | |
5540 | /* This type represents a type that was unrecognized in symbol read-in. */ | |
5541 | objfile_type->builtin_error | |
19f392bc | 5542 | = init_type (objfile, TYPE_CODE_ERROR, 0, "<unknown type>"); |
46bf5051 UW |
5543 | |
5544 | /* The following set of types is used for symbols with no | |
5545 | debug information. */ | |
5546 | objfile_type->nodebug_text_symbol | |
77b7c781 | 5547 | = init_type (objfile, TYPE_CODE_FUNC, TARGET_CHAR_BIT, |
19f392bc | 5548 | "<text variable, no debug info>"); |
0875794a | 5549 | objfile_type->nodebug_text_gnu_ifunc_symbol |
77b7c781 | 5550 | = init_type (objfile, TYPE_CODE_FUNC, TARGET_CHAR_BIT, |
19f392bc | 5551 | "<text gnu-indirect-function variable, no debug info>"); |
19f392bc | 5552 | TYPE_GNU_IFUNC (objfile_type->nodebug_text_gnu_ifunc_symbol) = 1; |
0875794a | 5553 | objfile_type->nodebug_got_plt_symbol |
19f392bc UW |
5554 | = init_pointer_type (objfile, gdbarch_addr_bit (gdbarch), |
5555 | "<text from jump slot in .got.plt, no debug info>", | |
5556 | objfile_type->nodebug_text_symbol); | |
46bf5051 | 5557 | objfile_type->nodebug_data_symbol |
46a4882b | 5558 | = init_nodebug_var_type (objfile, "<data variable, no debug info>"); |
46bf5051 | 5559 | objfile_type->nodebug_unknown_symbol |
46a4882b | 5560 | = init_nodebug_var_type (objfile, "<variable (not text or data), no debug info>"); |
46bf5051 | 5561 | objfile_type->nodebug_tls_symbol |
46a4882b | 5562 | = init_nodebug_var_type (objfile, "<thread local variable, no debug info>"); |
000177f0 AC |
5563 | |
5564 | /* NOTE: on some targets, addresses and pointers are not necessarily | |
0a7cfe2c | 5565 | the same. |
000177f0 AC |
5566 | |
5567 | The upshot is: | |
5568 | - gdb's `struct type' always describes the target's | |
5569 | representation. | |
5570 | - gdb's `struct value' objects should always hold values in | |
5571 | target form. | |
5572 | - gdb's CORE_ADDR values are addresses in the unified virtual | |
5573 | address space that the assembler and linker work with. Thus, | |
5574 | since target_read_memory takes a CORE_ADDR as an argument, it | |
5575 | can access any memory on the target, even if the processor has | |
5576 | separate code and data address spaces. | |
5577 | ||
46bf5051 UW |
5578 | In this context, objfile_type->builtin_core_addr is a bit odd: |
5579 | it's a target type for a value the target will never see. It's | |
5580 | only used to hold the values of (typeless) linker symbols, which | |
5581 | are indeed in the unified virtual address space. */ | |
000177f0 | 5582 | |
46bf5051 | 5583 | objfile_type->builtin_core_addr |
19f392bc UW |
5584 | = init_integer_type (objfile, gdbarch_addr_bit (gdbarch), 1, |
5585 | "__CORE_ADDR"); | |
64c50499 | 5586 | |
7a102139 | 5587 | objfile_type_data.set (objfile, objfile_type); |
46bf5051 | 5588 | return objfile_type; |
000177f0 AC |
5589 | } |
5590 | ||
c906108c | 5591 | void |
fba45db2 | 5592 | _initialize_gdbtypes (void) |
c906108c | 5593 | { |
5674de60 UW |
5594 | gdbtypes_data = gdbarch_data_register_post_init (gdbtypes_post_init); |
5595 | ||
ccce17b0 YQ |
5596 | add_setshow_zuinteger_cmd ("overload", no_class, &overload_debug, |
5597 | _("Set debugging of C++ overloading."), | |
5598 | _("Show debugging of C++ overloading."), | |
5599 | _("When enabled, ranking of the " | |
5600 | "functions is displayed."), | |
5601 | NULL, | |
5602 | show_overload_debug, | |
5603 | &setdebuglist, &showdebuglist); | |
5674de60 | 5604 | |
7ba81444 | 5605 | /* Add user knob for controlling resolution of opaque types. */ |
5674de60 | 5606 | add_setshow_boolean_cmd ("opaque-type-resolution", class_support, |
3e43a32a MS |
5607 | &opaque_type_resolution, |
5608 | _("Set resolution of opaque struct/class/union" | |
5609 | " types (if set before loading symbols)."), | |
5610 | _("Show resolution of opaque struct/class/union" | |
5611 | " types (if set before loading symbols)."), | |
5612 | NULL, NULL, | |
5674de60 UW |
5613 | show_opaque_type_resolution, |
5614 | &setlist, &showlist); | |
a451cb65 KS |
5615 | |
5616 | /* Add an option to permit non-strict type checking. */ | |
5617 | add_setshow_boolean_cmd ("type", class_support, | |
5618 | &strict_type_checking, | |
5619 | _("Set strict type checking."), | |
5620 | _("Show strict type checking."), | |
5621 | NULL, NULL, | |
5622 | show_strict_type_checking, | |
5623 | &setchecklist, &showchecklist); | |
c906108c | 5624 | } |
34877895 PJ |
5625 | |
5626 | /* See gdbtypes.h. */ | |
5627 | enum bfd_endian | |
5628 | type_byte_order (const struct type *type) | |
5629 | { | |
5630 | bfd_endian byteorder = gdbarch_byte_order (get_type_arch (type)); | |
5631 | if (TYPE_ENDIANITY_NOT_DEFAULT (type)) | |
5632 | { | |
5633 | if (byteorder == BFD_ENDIAN_BIG) | |
5634 | return BFD_ENDIAN_LITTLE; | |
5635 | else if (byteorder == BFD_ENDIAN_LITTLE) | |
5636 | return BFD_ENDIAN_BIG; | |
5637 | else | |
5638 | return BFD_ENDIAN_UNKNOWN; | |
5639 | } | |
5640 | ||
5641 | return byteorder; | |
5642 | } |