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