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