Switch the license of all .c files to GPLv3.
[binutils-gdb.git] / gdb / gdbtypes.c
1 /* Support routines for manipulating internal types for GDB.
2
3 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001,
4 2002, 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
5
6 Contributed by Cygnus Support, using pieces from other GDB modules.
7
8 This file is part of GDB.
9
10 This program is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 3 of the License, or
13 (at your option) any later version.
14
15 This program is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
19
20 You should have received a copy of the GNU General Public License
21 along with this program. If not, see <http://www.gnu.org/licenses/>. */
22
23 #include "defs.h"
24 #include "gdb_string.h"
25 #include "bfd.h"
26 #include "symtab.h"
27 #include "symfile.h"
28 #include "objfiles.h"
29 #include "gdbtypes.h"
30 #include "expression.h"
31 #include "language.h"
32 #include "target.h"
33 #include "value.h"
34 #include "demangle.h"
35 #include "complaints.h"
36 #include "gdbcmd.h"
37 #include "wrapper.h"
38 #include "cp-abi.h"
39 #include "gdb_assert.h"
40 #include "hashtab.h"
41
42 /* These variables point to the objects
43 representing the predefined C data types. */
44
45 struct type *builtin_type_int0;
46 struct type *builtin_type_int8;
47 struct type *builtin_type_uint8;
48 struct type *builtin_type_int16;
49 struct type *builtin_type_uint16;
50 struct type *builtin_type_int32;
51 struct type *builtin_type_uint32;
52 struct type *builtin_type_int64;
53 struct type *builtin_type_uint64;
54 struct type *builtin_type_int128;
55 struct type *builtin_type_uint128;
56
57 /* Floatformat pairs. */
58 const struct floatformat *floatformats_ieee_single[BFD_ENDIAN_UNKNOWN] = {
59 &floatformat_ieee_single_big,
60 &floatformat_ieee_single_little
61 };
62 const struct floatformat *floatformats_ieee_double[BFD_ENDIAN_UNKNOWN] = {
63 &floatformat_ieee_double_big,
64 &floatformat_ieee_double_little
65 };
66 const struct floatformat *floatformats_ieee_double_littlebyte_bigword[BFD_ENDIAN_UNKNOWN] = {
67 &floatformat_ieee_double_big,
68 &floatformat_ieee_double_littlebyte_bigword
69 };
70 const struct floatformat *floatformats_i387_ext[BFD_ENDIAN_UNKNOWN] = {
71 &floatformat_i387_ext,
72 &floatformat_i387_ext
73 };
74 const struct floatformat *floatformats_m68881_ext[BFD_ENDIAN_UNKNOWN] = {
75 &floatformat_m68881_ext,
76 &floatformat_m68881_ext
77 };
78 const struct floatformat *floatformats_arm_ext[BFD_ENDIAN_UNKNOWN] = {
79 &floatformat_arm_ext_big,
80 &floatformat_arm_ext_littlebyte_bigword
81 };
82 const struct floatformat *floatformats_ia64_spill[BFD_ENDIAN_UNKNOWN] = {
83 &floatformat_ia64_spill_big,
84 &floatformat_ia64_spill_little
85 };
86 const struct floatformat *floatformats_ia64_quad[BFD_ENDIAN_UNKNOWN] = {
87 &floatformat_ia64_quad_big,
88 &floatformat_ia64_quad_little
89 };
90 const struct floatformat *floatformats_vax_f[BFD_ENDIAN_UNKNOWN] = {
91 &floatformat_vax_f,
92 &floatformat_vax_f
93 };
94 const struct floatformat *floatformats_vax_d[BFD_ENDIAN_UNKNOWN] = {
95 &floatformat_vax_d,
96 &floatformat_vax_d
97 };
98
99 struct type *builtin_type_ieee_single;
100 struct type *builtin_type_ieee_double;
101 struct type *builtin_type_i387_ext;
102 struct type *builtin_type_m68881_ext;
103 struct type *builtin_type_arm_ext;
104 struct type *builtin_type_ia64_spill;
105 struct type *builtin_type_ia64_quad;
106
107
108 int opaque_type_resolution = 1;
109 static void
110 show_opaque_type_resolution (struct ui_file *file, int from_tty,
111 struct cmd_list_element *c,
112 const char *value)
113 {
114 fprintf_filtered (file, _("\
115 Resolution of opaque struct/class/union types (if set before loading symbols) is %s.\n"),
116 value);
117 }
118
119 int overload_debug = 0;
120 static void
121 show_overload_debug (struct ui_file *file, int from_tty,
122 struct cmd_list_element *c, const char *value)
123 {
124 fprintf_filtered (file, _("Debugging of C++ overloading is %s.\n"),
125 value);
126 }
127
128 struct extra
129 {
130 char str[128];
131 int len;
132 }; /* Maximum extension is 128! FIXME */
133
134 static void print_bit_vector (B_TYPE *, int);
135 static void print_arg_types (struct field *, int, int);
136 static void dump_fn_fieldlists (struct type *, int);
137 static void print_cplus_stuff (struct type *, int);
138 static void virtual_base_list_aux (struct type *dclass);
139
140
141 /* Alloc a new type structure and fill it with some defaults. If
142 OBJFILE is non-NULL, then allocate the space for the type structure
143 in that objfile's objfile_obstack. Otherwise allocate the new type
144 structure by xmalloc () (for permanent types). */
145
146 struct type *
147 alloc_type (struct objfile *objfile)
148 {
149 struct type *type;
150
151 /* Alloc the structure and start off with all fields zeroed. */
152
153 if (objfile == NULL)
154 {
155 type = xmalloc (sizeof (struct type));
156 memset (type, 0, sizeof (struct type));
157 TYPE_MAIN_TYPE (type) = xmalloc (sizeof (struct main_type));
158 }
159 else
160 {
161 type = obstack_alloc (&objfile->objfile_obstack,
162 sizeof (struct type));
163 memset (type, 0, sizeof (struct type));
164 TYPE_MAIN_TYPE (type) = obstack_alloc (&objfile->objfile_obstack,
165 sizeof (struct main_type));
166 OBJSTAT (objfile, n_types++);
167 }
168 memset (TYPE_MAIN_TYPE (type), 0, sizeof (struct main_type));
169
170 /* Initialize the fields that might not be zero. */
171
172 TYPE_CODE (type) = TYPE_CODE_UNDEF;
173 TYPE_OBJFILE (type) = objfile;
174 TYPE_VPTR_FIELDNO (type) = -1;
175 TYPE_CHAIN (type) = type; /* Chain back to itself. */
176
177 return (type);
178 }
179
180 /* Alloc a new type instance structure, fill it with some defaults,
181 and point it at OLDTYPE. Allocate the new type instance from the
182 same place as OLDTYPE. */
183
184 static struct type *
185 alloc_type_instance (struct type *oldtype)
186 {
187 struct type *type;
188
189 /* Allocate the structure. */
190
191 if (TYPE_OBJFILE (oldtype) == NULL)
192 {
193 type = xmalloc (sizeof (struct type));
194 memset (type, 0, sizeof (struct type));
195 }
196 else
197 {
198 type = obstack_alloc (&TYPE_OBJFILE (oldtype)->objfile_obstack,
199 sizeof (struct type));
200 memset (type, 0, sizeof (struct type));
201 }
202 TYPE_MAIN_TYPE (type) = TYPE_MAIN_TYPE (oldtype);
203
204 TYPE_CHAIN (type) = type; /* Chain back to itself for now. */
205
206 return (type);
207 }
208
209 /* Clear all remnants of the previous type at TYPE, in preparation for
210 replacing it with something else. */
211 static void
212 smash_type (struct type *type)
213 {
214 memset (TYPE_MAIN_TYPE (type), 0, sizeof (struct main_type));
215
216 /* For now, delete the rings. */
217 TYPE_CHAIN (type) = type;
218
219 /* For now, leave the pointer/reference types alone. */
220 }
221
222 /* Lookup a pointer to a type TYPE. TYPEPTR, if nonzero, points
223 to a pointer to memory where the pointer type should be stored.
224 If *TYPEPTR is zero, update it to point to the pointer type we return.
225 We allocate new memory if needed. */
226
227 struct type *
228 make_pointer_type (struct type *type, struct type **typeptr)
229 {
230 struct type *ntype; /* New type */
231 struct objfile *objfile;
232 struct type *chain;
233
234 ntype = TYPE_POINTER_TYPE (type);
235
236 if (ntype)
237 {
238 if (typeptr == 0)
239 return ntype; /* Don't care about alloc,
240 and have new type. */
241 else if (*typeptr == 0)
242 {
243 *typeptr = ntype; /* Tracking alloc, and have new type. */
244 return ntype;
245 }
246 }
247
248 if (typeptr == 0 || *typeptr == 0) /* We'll need to allocate one. */
249 {
250 ntype = alloc_type (TYPE_OBJFILE (type));
251 if (typeptr)
252 *typeptr = ntype;
253 }
254 else /* We have storage, but need to reset it. */
255 {
256 ntype = *typeptr;
257 objfile = TYPE_OBJFILE (ntype);
258 chain = TYPE_CHAIN (ntype);
259 smash_type (ntype);
260 TYPE_CHAIN (ntype) = chain;
261 TYPE_OBJFILE (ntype) = objfile;
262 }
263
264 TYPE_TARGET_TYPE (ntype) = type;
265 TYPE_POINTER_TYPE (type) = ntype;
266
267 /* FIXME! Assume the machine has only one representation for
268 pointers! */
269
270 TYPE_LENGTH (ntype) =
271 gdbarch_ptr_bit (current_gdbarch) / TARGET_CHAR_BIT;
272 TYPE_CODE (ntype) = TYPE_CODE_PTR;
273
274 /* Mark pointers as unsigned. The target converts between pointers
275 and addresses (CORE_ADDRs) using gdbarch_pointer_to_address and
276 gdbarch_address_to_pointer. */
277 TYPE_FLAGS (ntype) |= TYPE_FLAG_UNSIGNED;
278
279 if (!TYPE_POINTER_TYPE (type)) /* Remember it, if don't have one. */
280 TYPE_POINTER_TYPE (type) = ntype;
281
282 /* Update the length of all the other variants of this type. */
283 chain = TYPE_CHAIN (ntype);
284 while (chain != ntype)
285 {
286 TYPE_LENGTH (chain) = TYPE_LENGTH (ntype);
287 chain = TYPE_CHAIN (chain);
288 }
289
290 return ntype;
291 }
292
293 /* Given a type TYPE, return a type of pointers to that type.
294 May need to construct such a type if this is the first use. */
295
296 struct type *
297 lookup_pointer_type (struct type *type)
298 {
299 return make_pointer_type (type, (struct type **) 0);
300 }
301
302 /* Lookup a C++ `reference' to a type TYPE. TYPEPTR, if nonzero,
303 points to a pointer to memory where the reference type should be
304 stored. If *TYPEPTR is zero, update it to point to the reference
305 type we return. We allocate new memory if needed. */
306
307 struct type *
308 make_reference_type (struct type *type, struct type **typeptr)
309 {
310 struct type *ntype; /* New type */
311 struct objfile *objfile;
312 struct type *chain;
313
314 ntype = TYPE_REFERENCE_TYPE (type);
315
316 if (ntype)
317 {
318 if (typeptr == 0)
319 return ntype; /* Don't care about alloc,
320 and have new type. */
321 else if (*typeptr == 0)
322 {
323 *typeptr = ntype; /* Tracking alloc, and have new type. */
324 return ntype;
325 }
326 }
327
328 if (typeptr == 0 || *typeptr == 0) /* We'll need to allocate one. */
329 {
330 ntype = alloc_type (TYPE_OBJFILE (type));
331 if (typeptr)
332 *typeptr = ntype;
333 }
334 else /* We have storage, but need to reset it. */
335 {
336 ntype = *typeptr;
337 objfile = TYPE_OBJFILE (ntype);
338 chain = TYPE_CHAIN (ntype);
339 smash_type (ntype);
340 TYPE_CHAIN (ntype) = chain;
341 TYPE_OBJFILE (ntype) = objfile;
342 }
343
344 TYPE_TARGET_TYPE (ntype) = type;
345 TYPE_REFERENCE_TYPE (type) = ntype;
346
347 /* FIXME! Assume the machine has only one representation for
348 references, and that it matches the (only) representation for
349 pointers! */
350
351 TYPE_LENGTH (ntype) = gdbarch_ptr_bit (current_gdbarch) / TARGET_CHAR_BIT;
352 TYPE_CODE (ntype) = TYPE_CODE_REF;
353
354 if (!TYPE_REFERENCE_TYPE (type)) /* Remember it, if don't have one. */
355 TYPE_REFERENCE_TYPE (type) = ntype;
356
357 /* Update the length of all the other variants of this type. */
358 chain = TYPE_CHAIN (ntype);
359 while (chain != ntype)
360 {
361 TYPE_LENGTH (chain) = TYPE_LENGTH (ntype);
362 chain = TYPE_CHAIN (chain);
363 }
364
365 return ntype;
366 }
367
368 /* Same as above, but caller doesn't care about memory allocation
369 details. */
370
371 struct type *
372 lookup_reference_type (struct type *type)
373 {
374 return make_reference_type (type, (struct type **) 0);
375 }
376
377 /* Lookup a function type that returns type TYPE. TYPEPTR, if
378 nonzero, points to a pointer to memory where the function type
379 should be stored. If *TYPEPTR is zero, update it to point to the
380 function type we return. We allocate new memory if needed. */
381
382 struct type *
383 make_function_type (struct type *type, struct type **typeptr)
384 {
385 struct type *ntype; /* New type */
386 struct objfile *objfile;
387
388 if (typeptr == 0 || *typeptr == 0) /* We'll need to allocate one. */
389 {
390 ntype = alloc_type (TYPE_OBJFILE (type));
391 if (typeptr)
392 *typeptr = ntype;
393 }
394 else /* We have storage, but need to reset it. */
395 {
396 ntype = *typeptr;
397 objfile = TYPE_OBJFILE (ntype);
398 smash_type (ntype);
399 TYPE_OBJFILE (ntype) = objfile;
400 }
401
402 TYPE_TARGET_TYPE (ntype) = type;
403
404 TYPE_LENGTH (ntype) = 1;
405 TYPE_CODE (ntype) = TYPE_CODE_FUNC;
406
407 return ntype;
408 }
409
410
411 /* Given a type TYPE, return a type of functions that return that type.
412 May need to construct such a type if this is the first use. */
413
414 struct type *
415 lookup_function_type (struct type *type)
416 {
417 return make_function_type (type, (struct type **) 0);
418 }
419
420 /* Identify address space identifier by name --
421 return the integer flag defined in gdbtypes.h. */
422 extern int
423 address_space_name_to_int (char *space_identifier)
424 {
425 struct gdbarch *gdbarch = current_gdbarch;
426 int type_flags;
427 /* Check for known address space delimiters. */
428 if (!strcmp (space_identifier, "code"))
429 return TYPE_FLAG_CODE_SPACE;
430 else if (!strcmp (space_identifier, "data"))
431 return TYPE_FLAG_DATA_SPACE;
432 else if (gdbarch_address_class_name_to_type_flags_p (gdbarch)
433 && gdbarch_address_class_name_to_type_flags (gdbarch,
434 space_identifier,
435 &type_flags))
436 return type_flags;
437 else
438 error (_("Unknown address space specifier: \"%s\""), space_identifier);
439 }
440
441 /* Identify address space identifier by integer flag as defined in
442 gdbtypes.h -- return the string version of the adress space name. */
443
444 const char *
445 address_space_int_to_name (int space_flag)
446 {
447 struct gdbarch *gdbarch = current_gdbarch;
448 if (space_flag & TYPE_FLAG_CODE_SPACE)
449 return "code";
450 else if (space_flag & TYPE_FLAG_DATA_SPACE)
451 return "data";
452 else if ((space_flag & TYPE_FLAG_ADDRESS_CLASS_ALL)
453 && gdbarch_address_class_type_flags_to_name_p (gdbarch))
454 return gdbarch_address_class_type_flags_to_name (gdbarch, space_flag);
455 else
456 return NULL;
457 }
458
459 /* Create a new type with instance flags NEW_FLAGS, based on TYPE.
460
461 If STORAGE is non-NULL, create the new type instance there.
462 STORAGE must be in the same obstack as TYPE. */
463
464 static struct type *
465 make_qualified_type (struct type *type, int new_flags,
466 struct type *storage)
467 {
468 struct type *ntype;
469
470 ntype = type;
471 do {
472 if (TYPE_INSTANCE_FLAGS (ntype) == new_flags)
473 return ntype;
474 ntype = TYPE_CHAIN (ntype);
475 } while (ntype != type);
476
477 /* Create a new type instance. */
478 if (storage == NULL)
479 ntype = alloc_type_instance (type);
480 else
481 {
482 /* If STORAGE was provided, it had better be in the same objfile
483 as TYPE. Otherwise, we can't link it into TYPE's cv chain:
484 if one objfile is freed and the other kept, we'd have
485 dangling pointers. */
486 gdb_assert (TYPE_OBJFILE (type) == TYPE_OBJFILE (storage));
487
488 ntype = storage;
489 TYPE_MAIN_TYPE (ntype) = TYPE_MAIN_TYPE (type);
490 TYPE_CHAIN (ntype) = ntype;
491 }
492
493 /* Pointers or references to the original type are not relevant to
494 the new type. */
495 TYPE_POINTER_TYPE (ntype) = (struct type *) 0;
496 TYPE_REFERENCE_TYPE (ntype) = (struct type *) 0;
497
498 /* Chain the new qualified type to the old type. */
499 TYPE_CHAIN (ntype) = TYPE_CHAIN (type);
500 TYPE_CHAIN (type) = ntype;
501
502 /* Now set the instance flags and return the new type. */
503 TYPE_INSTANCE_FLAGS (ntype) = new_flags;
504
505 /* Set length of new type to that of the original type. */
506 TYPE_LENGTH (ntype) = TYPE_LENGTH (type);
507
508 return ntype;
509 }
510
511 /* Make an address-space-delimited variant of a type -- a type that
512 is identical to the one supplied except that it has an address
513 space attribute attached to it (such as "code" or "data").
514
515 The space attributes "code" and "data" are for Harvard
516 architectures. The address space attributes are for architectures
517 which have alternately sized pointers or pointers with alternate
518 representations. */
519
520 struct type *
521 make_type_with_address_space (struct type *type, int space_flag)
522 {
523 struct type *ntype;
524 int new_flags = ((TYPE_INSTANCE_FLAGS (type)
525 & ~(TYPE_FLAG_CODE_SPACE | TYPE_FLAG_DATA_SPACE
526 | TYPE_FLAG_ADDRESS_CLASS_ALL))
527 | space_flag);
528
529 return make_qualified_type (type, new_flags, NULL);
530 }
531
532 /* Make a "c-v" variant of a type -- a type that is identical to the
533 one supplied except that it may have const or volatile attributes
534 CNST is a flag for setting the const attribute
535 VOLTL is a flag for setting the volatile attribute
536 TYPE is the base type whose variant we are creating.
537
538 If TYPEPTR and *TYPEPTR are non-zero, then *TYPEPTR points to
539 storage to hold the new qualified type; *TYPEPTR and TYPE must be
540 in the same objfile. Otherwise, allocate fresh memory for the new
541 type whereever TYPE lives. If TYPEPTR is non-zero, set it to the
542 new type we construct. */
543 struct type *
544 make_cv_type (int cnst, int voltl,
545 struct type *type,
546 struct type **typeptr)
547 {
548 struct type *ntype; /* New type */
549 struct type *tmp_type = type; /* tmp type */
550 struct objfile *objfile;
551
552 int new_flags = (TYPE_INSTANCE_FLAGS (type)
553 & ~(TYPE_FLAG_CONST | TYPE_FLAG_VOLATILE));
554
555 if (cnst)
556 new_flags |= TYPE_FLAG_CONST;
557
558 if (voltl)
559 new_flags |= TYPE_FLAG_VOLATILE;
560
561 if (typeptr && *typeptr != NULL)
562 {
563 /* TYPE and *TYPEPTR must be in the same objfile. We can't have
564 a C-V variant chain that threads across objfiles: if one
565 objfile gets freed, then the other has a broken C-V chain.
566
567 This code used to try to copy over the main type from TYPE to
568 *TYPEPTR if they were in different objfiles, but that's
569 wrong, too: TYPE may have a field list or member function
570 lists, which refer to types of their own, etc. etc. The
571 whole shebang would need to be copied over recursively; you
572 can't have inter-objfile pointers. The only thing to do is
573 to leave stub types as stub types, and look them up afresh by
574 name each time you encounter them. */
575 gdb_assert (TYPE_OBJFILE (*typeptr) == TYPE_OBJFILE (type));
576 }
577
578 ntype = make_qualified_type (type, new_flags,
579 typeptr ? *typeptr : NULL);
580
581 if (typeptr != NULL)
582 *typeptr = ntype;
583
584 return ntype;
585 }
586
587 /* Replace the contents of ntype with the type *type. This changes the
588 contents, rather than the pointer for TYPE_MAIN_TYPE (ntype); thus
589 the changes are propogated to all types in the TYPE_CHAIN.
590
591 In order to build recursive types, it's inevitable that we'll need
592 to update types in place --- but this sort of indiscriminate
593 smashing is ugly, and needs to be replaced with something more
594 controlled. TYPE_MAIN_TYPE is a step in this direction; it's not
595 clear if more steps are needed. */
596 void
597 replace_type (struct type *ntype, struct type *type)
598 {
599 struct type *chain;
600
601 /* These two types had better be in the same objfile. Otherwise,
602 the assignment of one type's main type structure to the other
603 will produce a type with references to objects (names; field
604 lists; etc.) allocated on an objfile other than its own. */
605 gdb_assert (TYPE_OBJFILE (ntype) == TYPE_OBJFILE (ntype));
606
607 *TYPE_MAIN_TYPE (ntype) = *TYPE_MAIN_TYPE (type);
608
609 /* The type length is not a part of the main type. Update it for
610 each type on the variant chain. */
611 chain = ntype;
612 do {
613 /* Assert that this element of the chain has no address-class bits
614 set in its flags. Such type variants might have type lengths
615 which are supposed to be different from the non-address-class
616 variants. This assertion shouldn't ever be triggered because
617 symbol readers which do construct address-class variants don't
618 call replace_type(). */
619 gdb_assert (TYPE_ADDRESS_CLASS_ALL (chain) == 0);
620
621 TYPE_LENGTH (chain) = TYPE_LENGTH (type);
622 chain = TYPE_CHAIN (chain);
623 } while (ntype != chain);
624
625 /* Assert that the two types have equivalent instance qualifiers.
626 This should be true for at least all of our debug readers. */
627 gdb_assert (TYPE_INSTANCE_FLAGS (ntype) == TYPE_INSTANCE_FLAGS (type));
628 }
629
630 /* Implement direct support for MEMBER_TYPE in GNU C++.
631 May need to construct such a type if this is the first use.
632 The TYPE is the type of the member. The DOMAIN is the type
633 of the aggregate that the member belongs to. */
634
635 struct type *
636 lookup_memberptr_type (struct type *type, struct type *domain)
637 {
638 struct type *mtype;
639
640 mtype = alloc_type (TYPE_OBJFILE (type));
641 smash_to_memberptr_type (mtype, domain, type);
642 return (mtype);
643 }
644
645 /* Return a pointer-to-method type, for a method of type TO_TYPE. */
646
647 struct type *
648 lookup_methodptr_type (struct type *to_type)
649 {
650 struct type *mtype;
651
652 mtype = alloc_type (TYPE_OBJFILE (to_type));
653 TYPE_TARGET_TYPE (mtype) = to_type;
654 TYPE_DOMAIN_TYPE (mtype) = TYPE_DOMAIN_TYPE (to_type);
655 TYPE_LENGTH (mtype) = cplus_method_ptr_size ();
656 TYPE_CODE (mtype) = TYPE_CODE_METHODPTR;
657 return mtype;
658 }
659
660 /* Allocate a stub method whose return type is TYPE. This apparently
661 happens for speed of symbol reading, since parsing out the
662 arguments to the method is cpu-intensive, the way we are doing it.
663 So, we will fill in arguments later. This always returns a fresh
664 type. */
665
666 struct type *
667 allocate_stub_method (struct type *type)
668 {
669 struct type *mtype;
670
671 mtype = init_type (TYPE_CODE_METHOD, 1, TYPE_FLAG_STUB, NULL,
672 TYPE_OBJFILE (type));
673 TYPE_TARGET_TYPE (mtype) = type;
674 /* _DOMAIN_TYPE (mtype) = unknown yet */
675 return (mtype);
676 }
677
678 /* Create a range type using either a blank type supplied in
679 RESULT_TYPE, or creating a new type, inheriting the objfile from
680 INDEX_TYPE.
681
682 Indices will be of type INDEX_TYPE, and will range from LOW_BOUND
683 to HIGH_BOUND, inclusive.
684
685 FIXME: Maybe we should check the TYPE_CODE of RESULT_TYPE to make
686 sure it is TYPE_CODE_UNDEF before we bash it into a range type? */
687
688 struct type *
689 create_range_type (struct type *result_type, struct type *index_type,
690 int low_bound, int high_bound)
691 {
692 if (result_type == NULL)
693 {
694 result_type = alloc_type (TYPE_OBJFILE (index_type));
695 }
696 TYPE_CODE (result_type) = TYPE_CODE_RANGE;
697 TYPE_TARGET_TYPE (result_type) = index_type;
698 if (TYPE_STUB (index_type))
699 TYPE_FLAGS (result_type) |= TYPE_FLAG_TARGET_STUB;
700 else
701 TYPE_LENGTH (result_type) = TYPE_LENGTH (check_typedef (index_type));
702 TYPE_NFIELDS (result_type) = 2;
703 TYPE_FIELDS (result_type) = (struct field *)
704 TYPE_ALLOC (result_type, 2 * sizeof (struct field));
705 memset (TYPE_FIELDS (result_type), 0, 2 * sizeof (struct field));
706 TYPE_FIELD_BITPOS (result_type, 0) = low_bound;
707 TYPE_FIELD_BITPOS (result_type, 1) = high_bound;
708 TYPE_FIELD_TYPE (result_type, 0) = builtin_type_int; /* FIXME */
709 TYPE_FIELD_TYPE (result_type, 1) = builtin_type_int; /* FIXME */
710
711 if (low_bound >= 0)
712 TYPE_FLAGS (result_type) |= TYPE_FLAG_UNSIGNED;
713
714 return (result_type);
715 }
716
717 /* Set *LOWP and *HIGHP to the lower and upper bounds of discrete type
718 TYPE. Return 1 if type is a range type, 0 if it is discrete (and
719 bounds will fit in LONGEST), or -1 otherwise. */
720
721 int
722 get_discrete_bounds (struct type *type, LONGEST *lowp, LONGEST *highp)
723 {
724 CHECK_TYPEDEF (type);
725 switch (TYPE_CODE (type))
726 {
727 case TYPE_CODE_RANGE:
728 *lowp = TYPE_LOW_BOUND (type);
729 *highp = TYPE_HIGH_BOUND (type);
730 return 1;
731 case TYPE_CODE_ENUM:
732 if (TYPE_NFIELDS (type) > 0)
733 {
734 /* The enums may not be sorted by value, so search all
735 entries */
736 int i;
737
738 *lowp = *highp = TYPE_FIELD_BITPOS (type, 0);
739 for (i = 0; i < TYPE_NFIELDS (type); i++)
740 {
741 if (TYPE_FIELD_BITPOS (type, i) < *lowp)
742 *lowp = TYPE_FIELD_BITPOS (type, i);
743 if (TYPE_FIELD_BITPOS (type, i) > *highp)
744 *highp = TYPE_FIELD_BITPOS (type, i);
745 }
746
747 /* Set unsigned indicator if warranted. */
748 if (*lowp >= 0)
749 {
750 TYPE_FLAGS (type) |= TYPE_FLAG_UNSIGNED;
751 }
752 }
753 else
754 {
755 *lowp = 0;
756 *highp = -1;
757 }
758 return 0;
759 case TYPE_CODE_BOOL:
760 *lowp = 0;
761 *highp = 1;
762 return 0;
763 case TYPE_CODE_INT:
764 if (TYPE_LENGTH (type) > sizeof (LONGEST)) /* Too big */
765 return -1;
766 if (!TYPE_UNSIGNED (type))
767 {
768 *lowp = -(1 << (TYPE_LENGTH (type) * TARGET_CHAR_BIT - 1));
769 *highp = -*lowp - 1;
770 return 0;
771 }
772 /* ... fall through for unsigned ints ... */
773 case TYPE_CODE_CHAR:
774 *lowp = 0;
775 /* This round-about calculation is to avoid shifting by
776 TYPE_LENGTH (type) * TARGET_CHAR_BIT, which will not work
777 if TYPE_LENGTH (type) == sizeof (LONGEST). */
778 *highp = 1 << (TYPE_LENGTH (type) * TARGET_CHAR_BIT - 1);
779 *highp = (*highp - 1) | *highp;
780 return 0;
781 default:
782 return -1;
783 }
784 }
785
786 /* Create an array type using either a blank type supplied in
787 RESULT_TYPE, or creating a new type, inheriting the objfile from
788 RANGE_TYPE.
789
790 Elements will be of type ELEMENT_TYPE, the indices will be of type
791 RANGE_TYPE.
792
793 FIXME: Maybe we should check the TYPE_CODE of RESULT_TYPE to make
794 sure it is TYPE_CODE_UNDEF before we bash it into an array
795 type? */
796
797 struct type *
798 create_array_type (struct type *result_type,
799 struct type *element_type,
800 struct type *range_type)
801 {
802 LONGEST low_bound, high_bound;
803
804 if (result_type == NULL)
805 {
806 result_type = alloc_type (TYPE_OBJFILE (range_type));
807 }
808 TYPE_CODE (result_type) = TYPE_CODE_ARRAY;
809 TYPE_TARGET_TYPE (result_type) = element_type;
810 if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0)
811 low_bound = high_bound = 0;
812 CHECK_TYPEDEF (element_type);
813 TYPE_LENGTH (result_type) =
814 TYPE_LENGTH (element_type) * (high_bound - low_bound + 1);
815 TYPE_NFIELDS (result_type) = 1;
816 TYPE_FIELDS (result_type) =
817 (struct field *) TYPE_ALLOC (result_type, sizeof (struct field));
818 memset (TYPE_FIELDS (result_type), 0, sizeof (struct field));
819 TYPE_FIELD_TYPE (result_type, 0) = range_type;
820 TYPE_VPTR_FIELDNO (result_type) = -1;
821
822 /* TYPE_FLAG_TARGET_STUB will take care of zero length arrays */
823 if (TYPE_LENGTH (result_type) == 0)
824 TYPE_FLAGS (result_type) |= TYPE_FLAG_TARGET_STUB;
825
826 return (result_type);
827 }
828
829 /* Create a string type using either a blank type supplied in
830 RESULT_TYPE, or creating a new type. String types are similar
831 enough to array of char types that we can use create_array_type to
832 build the basic type and then bash it into a string type.
833
834 For fixed length strings, the range type contains 0 as the lower
835 bound and the length of the string minus one as the upper bound.
836
837 FIXME: Maybe we should check the TYPE_CODE of RESULT_TYPE to make
838 sure it is TYPE_CODE_UNDEF before we bash it into a string
839 type? */
840
841 struct type *
842 create_string_type (struct type *result_type,
843 struct type *range_type)
844 {
845 struct type *string_char_type;
846
847 string_char_type = language_string_char_type (current_language,
848 current_gdbarch);
849 result_type = create_array_type (result_type,
850 string_char_type,
851 range_type);
852 TYPE_CODE (result_type) = TYPE_CODE_STRING;
853 return (result_type);
854 }
855
856 struct type *
857 create_set_type (struct type *result_type, struct type *domain_type)
858 {
859 if (result_type == NULL)
860 {
861 result_type = alloc_type (TYPE_OBJFILE (domain_type));
862 }
863 TYPE_CODE (result_type) = TYPE_CODE_SET;
864 TYPE_NFIELDS (result_type) = 1;
865 TYPE_FIELDS (result_type) = (struct field *)
866 TYPE_ALLOC (result_type, 1 * sizeof (struct field));
867 memset (TYPE_FIELDS (result_type), 0, sizeof (struct field));
868
869 if (!TYPE_STUB (domain_type))
870 {
871 LONGEST low_bound, high_bound, bit_length;
872 if (get_discrete_bounds (domain_type, &low_bound, &high_bound) < 0)
873 low_bound = high_bound = 0;
874 bit_length = high_bound - low_bound + 1;
875 TYPE_LENGTH (result_type)
876 = (bit_length + TARGET_CHAR_BIT - 1) / TARGET_CHAR_BIT;
877 if (low_bound >= 0)
878 TYPE_FLAGS (result_type) |= TYPE_FLAG_UNSIGNED;
879 }
880 TYPE_FIELD_TYPE (result_type, 0) = domain_type;
881
882 return (result_type);
883 }
884
885 void
886 append_flags_type_flag (struct type *type, int bitpos, char *name)
887 {
888 gdb_assert (TYPE_CODE (type) == TYPE_CODE_FLAGS);
889 gdb_assert (bitpos < TYPE_NFIELDS (type));
890 gdb_assert (bitpos >= 0);
891
892 if (name)
893 {
894 TYPE_FIELD_NAME (type, bitpos) = xstrdup (name);
895 TYPE_FIELD_BITPOS (type, bitpos) = bitpos;
896 }
897 else
898 {
899 /* Don't show this field to the user. */
900 TYPE_FIELD_BITPOS (type, bitpos) = -1;
901 }
902 }
903
904 struct type *
905 init_flags_type (char *name, int length)
906 {
907 int nfields = length * TARGET_CHAR_BIT;
908 struct type *type;
909
910 type = init_type (TYPE_CODE_FLAGS, length,
911 TYPE_FLAG_UNSIGNED, name, NULL);
912 TYPE_NFIELDS (type) = nfields;
913 TYPE_FIELDS (type) = TYPE_ALLOC (type,
914 nfields * sizeof (struct field));
915 memset (TYPE_FIELDS (type), 0, nfields * sizeof (struct field));
916
917 return type;
918 }
919
920 struct type *
921 init_vector_type (struct type *elt_type, int n)
922 {
923 struct type *array_type;
924
925 array_type = create_array_type (0, elt_type,
926 create_range_type (0,
927 builtin_type_int,
928 0, n-1));
929 TYPE_FLAGS (array_type) |= TYPE_FLAG_VECTOR;
930 return array_type;
931 }
932
933 /* Smash TYPE to be a type of pointers to members of DOMAIN with type
934 TO_TYPE. A member pointer is a wierd thing -- it amounts to a
935 typed offset into a struct, e.g. "an int at offset 8". A MEMBER
936 TYPE doesn't include the offset (that's the value of the MEMBER
937 itself), but does include the structure type into which it points
938 (for some reason).
939
940 When "smashing" the type, we preserve the objfile that the old type
941 pointed to, since we aren't changing where the type is actually
942 allocated. */
943
944 void
945 smash_to_memberptr_type (struct type *type, struct type *domain,
946 struct type *to_type)
947 {
948 struct objfile *objfile;
949
950 objfile = TYPE_OBJFILE (type);
951
952 smash_type (type);
953 TYPE_OBJFILE (type) = objfile;
954 TYPE_TARGET_TYPE (type) = to_type;
955 TYPE_DOMAIN_TYPE (type) = domain;
956 /* Assume that a data member pointer is the same size as a normal
957 pointer. */
958 TYPE_LENGTH (type) = gdbarch_ptr_bit (current_gdbarch) / TARGET_CHAR_BIT;
959 TYPE_CODE (type) = TYPE_CODE_MEMBERPTR;
960 }
961
962 /* Smash TYPE to be a type of method of DOMAIN with type TO_TYPE.
963 METHOD just means `function that gets an extra "this" argument'.
964
965 When "smashing" the type, we preserve the objfile that the old type
966 pointed to, since we aren't changing where the type is actually
967 allocated. */
968
969 void
970 smash_to_method_type (struct type *type, struct type *domain,
971 struct type *to_type, struct field *args,
972 int nargs, int varargs)
973 {
974 struct objfile *objfile;
975
976 objfile = TYPE_OBJFILE (type);
977
978 smash_type (type);
979 TYPE_OBJFILE (type) = objfile;
980 TYPE_TARGET_TYPE (type) = to_type;
981 TYPE_DOMAIN_TYPE (type) = domain;
982 TYPE_FIELDS (type) = args;
983 TYPE_NFIELDS (type) = nargs;
984 if (varargs)
985 TYPE_FLAGS (type) |= TYPE_FLAG_VARARGS;
986 TYPE_LENGTH (type) = 1; /* In practice, this is never needed. */
987 TYPE_CODE (type) = TYPE_CODE_METHOD;
988 }
989
990 /* Return a typename for a struct/union/enum type without "struct ",
991 "union ", or "enum ". If the type has a NULL name, return NULL. */
992
993 char *
994 type_name_no_tag (const struct type *type)
995 {
996 if (TYPE_TAG_NAME (type) != NULL)
997 return TYPE_TAG_NAME (type);
998
999 /* Is there code which expects this to return the name if there is
1000 no tag name? My guess is that this is mainly used for C++ in
1001 cases where the two will always be the same. */
1002 return TYPE_NAME (type);
1003 }
1004
1005 /* Lookup a typedef or primitive type named NAME, visible in lexical
1006 block BLOCK. If NOERR is nonzero, return zero if NAME is not
1007 suitably defined. */
1008
1009 struct type *
1010 lookup_typename (char *name, struct block *block, int noerr)
1011 {
1012 struct symbol *sym;
1013 struct type *tmp;
1014
1015 sym = lookup_symbol (name, block, VAR_DOMAIN, 0,
1016 (struct symtab **) NULL);
1017 if (sym == NULL || SYMBOL_CLASS (sym) != LOC_TYPEDEF)
1018 {
1019 tmp = language_lookup_primitive_type_by_name (current_language,
1020 current_gdbarch,
1021 name);
1022 if (tmp)
1023 {
1024 return (tmp);
1025 }
1026 else if (!tmp && noerr)
1027 {
1028 return (NULL);
1029 }
1030 else
1031 {
1032 error (_("No type named %s."), name);
1033 }
1034 }
1035 return (SYMBOL_TYPE (sym));
1036 }
1037
1038 struct type *
1039 lookup_unsigned_typename (char *name)
1040 {
1041 char *uns = alloca (strlen (name) + 10);
1042
1043 strcpy (uns, "unsigned ");
1044 strcpy (uns + 9, name);
1045 return (lookup_typename (uns, (struct block *) NULL, 0));
1046 }
1047
1048 struct type *
1049 lookup_signed_typename (char *name)
1050 {
1051 struct type *t;
1052 char *uns = alloca (strlen (name) + 8);
1053
1054 strcpy (uns, "signed ");
1055 strcpy (uns + 7, name);
1056 t = lookup_typename (uns, (struct block *) NULL, 1);
1057 /* If we don't find "signed FOO" just try again with plain "FOO". */
1058 if (t != NULL)
1059 return t;
1060 return lookup_typename (name, (struct block *) NULL, 0);
1061 }
1062
1063 /* Lookup a structure type named "struct NAME",
1064 visible in lexical block BLOCK. */
1065
1066 struct type *
1067 lookup_struct (char *name, struct block *block)
1068 {
1069 struct symbol *sym;
1070
1071 sym = lookup_symbol (name, block, STRUCT_DOMAIN, 0,
1072 (struct symtab **) NULL);
1073
1074 if (sym == NULL)
1075 {
1076 error (_("No struct type named %s."), name);
1077 }
1078 if (TYPE_CODE (SYMBOL_TYPE (sym)) != TYPE_CODE_STRUCT)
1079 {
1080 error (_("This context has class, union or enum %s, not a struct."),
1081 name);
1082 }
1083 return (SYMBOL_TYPE (sym));
1084 }
1085
1086 /* Lookup a union type named "union NAME",
1087 visible in lexical block BLOCK. */
1088
1089 struct type *
1090 lookup_union (char *name, struct block *block)
1091 {
1092 struct symbol *sym;
1093 struct type *t;
1094
1095 sym = lookup_symbol (name, block, STRUCT_DOMAIN, 0,
1096 (struct symtab **) NULL);
1097
1098 if (sym == NULL)
1099 error (_("No union type named %s."), name);
1100
1101 t = SYMBOL_TYPE (sym);
1102
1103 if (TYPE_CODE (t) == TYPE_CODE_UNION)
1104 return (t);
1105
1106 /* C++ unions may come out with TYPE_CODE_CLASS, but we look at
1107 * a further "declared_type" field to discover it is really a union.
1108 */
1109 if (HAVE_CPLUS_STRUCT (t))
1110 if (TYPE_DECLARED_TYPE (t) == DECLARED_TYPE_UNION)
1111 return (t);
1112
1113 /* If we get here, it's not a union. */
1114 error (_("This context has class, struct or enum %s, not a union."),
1115 name);
1116 }
1117
1118
1119 /* Lookup an enum type named "enum NAME",
1120 visible in lexical block BLOCK. */
1121
1122 struct type *
1123 lookup_enum (char *name, struct block *block)
1124 {
1125 struct symbol *sym;
1126
1127 sym = lookup_symbol (name, block, STRUCT_DOMAIN, 0,
1128 (struct symtab **) NULL);
1129 if (sym == NULL)
1130 {
1131 error (_("No enum type named %s."), name);
1132 }
1133 if (TYPE_CODE (SYMBOL_TYPE (sym)) != TYPE_CODE_ENUM)
1134 {
1135 error (_("This context has class, struct or union %s, not an enum."),
1136 name);
1137 }
1138 return (SYMBOL_TYPE (sym));
1139 }
1140
1141 /* Lookup a template type named "template NAME<TYPE>",
1142 visible in lexical block BLOCK. */
1143
1144 struct type *
1145 lookup_template_type (char *name, struct type *type,
1146 struct block *block)
1147 {
1148 struct symbol *sym;
1149 char *nam = (char *)
1150 alloca (strlen (name) + strlen (TYPE_NAME (type)) + 4);
1151 strcpy (nam, name);
1152 strcat (nam, "<");
1153 strcat (nam, TYPE_NAME (type));
1154 strcat (nam, " >"); /* FIXME, extra space still introduced in gcc? */
1155
1156 sym = lookup_symbol (nam, block, VAR_DOMAIN, 0,
1157 (struct symtab **) NULL);
1158
1159 if (sym == NULL)
1160 {
1161 error (_("No template type named %s."), name);
1162 }
1163 if (TYPE_CODE (SYMBOL_TYPE (sym)) != TYPE_CODE_STRUCT)
1164 {
1165 error (_("This context has class, union or enum %s, not a struct."),
1166 name);
1167 }
1168 return (SYMBOL_TYPE (sym));
1169 }
1170
1171 /* Given a type TYPE, lookup the type of the component of type named
1172 NAME.
1173
1174 TYPE can be either a struct or union, or a pointer or reference to
1175 a struct or union. If it is a pointer or reference, its target
1176 type is automatically used. Thus '.' and '->' are interchangable,
1177 as specified for the definitions of the expression element types
1178 STRUCTOP_STRUCT and STRUCTOP_PTR.
1179
1180 If NOERR is nonzero, return zero if NAME is not suitably defined.
1181 If NAME is the name of a baseclass type, return that type. */
1182
1183 struct type *
1184 lookup_struct_elt_type (struct type *type, char *name, int noerr)
1185 {
1186 int i;
1187
1188 for (;;)
1189 {
1190 CHECK_TYPEDEF (type);
1191 if (TYPE_CODE (type) != TYPE_CODE_PTR
1192 && TYPE_CODE (type) != TYPE_CODE_REF)
1193 break;
1194 type = TYPE_TARGET_TYPE (type);
1195 }
1196
1197 if (TYPE_CODE (type) != TYPE_CODE_STRUCT
1198 && TYPE_CODE (type) != TYPE_CODE_UNION)
1199 {
1200 target_terminal_ours ();
1201 gdb_flush (gdb_stdout);
1202 fprintf_unfiltered (gdb_stderr, "Type ");
1203 type_print (type, "", gdb_stderr, -1);
1204 error (_(" is not a structure or union type."));
1205 }
1206
1207 #if 0
1208 /* FIXME: This change put in by Michael seems incorrect for the case
1209 where the structure tag name is the same as the member name.
1210 I.E. when doing "ptype bell->bar" for "struct foo { int bar; int
1211 foo; } bell;" Disabled by fnf. */
1212 {
1213 char *typename;
1214
1215 typename = type_name_no_tag (type);
1216 if (typename != NULL && strcmp (typename, name) == 0)
1217 return type;
1218 }
1219 #endif
1220
1221 for (i = TYPE_NFIELDS (type) - 1; i >= TYPE_N_BASECLASSES (type); i--)
1222 {
1223 char *t_field_name = TYPE_FIELD_NAME (type, i);
1224
1225 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
1226 {
1227 return TYPE_FIELD_TYPE (type, i);
1228 }
1229 }
1230
1231 /* OK, it's not in this class. Recursively check the baseclasses. */
1232 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
1233 {
1234 struct type *t;
1235
1236 t = lookup_struct_elt_type (TYPE_BASECLASS (type, i), name, 1);
1237 if (t != NULL)
1238 {
1239 return t;
1240 }
1241 }
1242
1243 if (noerr)
1244 {
1245 return NULL;
1246 }
1247
1248 target_terminal_ours ();
1249 gdb_flush (gdb_stdout);
1250 fprintf_unfiltered (gdb_stderr, "Type ");
1251 type_print (type, "", gdb_stderr, -1);
1252 fprintf_unfiltered (gdb_stderr, " has no component named ");
1253 fputs_filtered (name, gdb_stderr);
1254 error (("."));
1255 return (struct type *) -1; /* For lint */
1256 }
1257
1258 /* If possible, make the vptr_fieldno and vptr_basetype fields of TYPE
1259 valid. Callers should be aware that in some cases (for example,
1260 the type or one of its baseclasses is a stub type and we are
1261 debugging a .o file), this function will not be able to find the
1262 virtual function table pointer, and vptr_fieldno will remain -1 and
1263 vptr_basetype will remain NULL. */
1264
1265 void
1266 fill_in_vptr_fieldno (struct type *type)
1267 {
1268 CHECK_TYPEDEF (type);
1269
1270 if (TYPE_VPTR_FIELDNO (type) < 0)
1271 {
1272 int i;
1273
1274 /* We must start at zero in case the first (and only) baseclass
1275 is virtual (and hence we cannot share the table pointer). */
1276 for (i = 0; i < TYPE_N_BASECLASSES (type); i++)
1277 {
1278 struct type *baseclass = check_typedef (TYPE_BASECLASS (type,
1279 i));
1280 fill_in_vptr_fieldno (baseclass);
1281 if (TYPE_VPTR_FIELDNO (baseclass) >= 0)
1282 {
1283 TYPE_VPTR_FIELDNO (type) = TYPE_VPTR_FIELDNO (baseclass);
1284 TYPE_VPTR_BASETYPE (type) = TYPE_VPTR_BASETYPE (baseclass);
1285 break;
1286 }
1287 }
1288 }
1289 }
1290
1291 /* Find the method and field indices for the destructor in class type T.
1292 Return 1 if the destructor was found, otherwise, return 0. */
1293
1294 int
1295 get_destructor_fn_field (struct type *t,
1296 int *method_indexp,
1297 int *field_indexp)
1298 {
1299 int i;
1300
1301 for (i = 0; i < TYPE_NFN_FIELDS (t); i++)
1302 {
1303 int j;
1304 struct fn_field *f = TYPE_FN_FIELDLIST1 (t, i);
1305
1306 for (j = 0; j < TYPE_FN_FIELDLIST_LENGTH (t, i); j++)
1307 {
1308 if (is_destructor_name (TYPE_FN_FIELD_PHYSNAME (f, j)) != 0)
1309 {
1310 *method_indexp = i;
1311 *field_indexp = j;
1312 return 1;
1313 }
1314 }
1315 }
1316 return 0;
1317 }
1318
1319 static void
1320 stub_noname_complaint (void)
1321 {
1322 complaint (&symfile_complaints, _("stub type has NULL name"));
1323 }
1324
1325 /* Added by Bryan Boreham, Kewill, Sun Sep 17 18:07:17 1989.
1326
1327 If this is a stubbed struct (i.e. declared as struct foo *), see if
1328 we can find a full definition in some other file. If so, copy this
1329 definition, so we can use it in future. There used to be a comment
1330 (but not any code) that if we don't find a full definition, we'd
1331 set a flag so we don't spend time in the future checking the same
1332 type. That would be a mistake, though--we might load in more
1333 symbols which contain a full definition for the type.
1334
1335 This used to be coded as a macro, but I don't think it is called
1336 often enough to merit such treatment. */
1337
1338 /* Find the real type of TYPE. This function returns the real type,
1339 after removing all layers of typedefs and completing opaque or stub
1340 types. Completion changes the TYPE argument, but stripping of
1341 typedefs does not. */
1342
1343 struct type *
1344 check_typedef (struct type *type)
1345 {
1346 struct type *orig_type = type;
1347 int is_const, is_volatile;
1348
1349 gdb_assert (type);
1350
1351 while (TYPE_CODE (type) == TYPE_CODE_TYPEDEF)
1352 {
1353 if (!TYPE_TARGET_TYPE (type))
1354 {
1355 char *name;
1356 struct symbol *sym;
1357
1358 /* It is dangerous to call lookup_symbol if we are currently
1359 reading a symtab. Infinite recursion is one danger. */
1360 if (currently_reading_symtab)
1361 return type;
1362
1363 name = type_name_no_tag (type);
1364 /* FIXME: shouldn't we separately check the TYPE_NAME and
1365 the TYPE_TAG_NAME, and look in STRUCT_DOMAIN and/or
1366 VAR_DOMAIN as appropriate? (this code was written before
1367 TYPE_NAME and TYPE_TAG_NAME were separate). */
1368 if (name == NULL)
1369 {
1370 stub_noname_complaint ();
1371 return type;
1372 }
1373 sym = lookup_symbol (name, 0, STRUCT_DOMAIN, 0,
1374 (struct symtab **) NULL);
1375 if (sym)
1376 TYPE_TARGET_TYPE (type) = SYMBOL_TYPE (sym);
1377 else /* TYPE_CODE_UNDEF */
1378 TYPE_TARGET_TYPE (type) = alloc_type (NULL);
1379 }
1380 type = TYPE_TARGET_TYPE (type);
1381 }
1382
1383 is_const = TYPE_CONST (type);
1384 is_volatile = TYPE_VOLATILE (type);
1385
1386 /* If this is a struct/class/union with no fields, then check
1387 whether a full definition exists somewhere else. This is for
1388 systems where a type definition with no fields is issued for such
1389 types, instead of identifying them as stub types in the first
1390 place. */
1391
1392 if (TYPE_IS_OPAQUE (type)
1393 && opaque_type_resolution
1394 && !currently_reading_symtab)
1395 {
1396 char *name = type_name_no_tag (type);
1397 struct type *newtype;
1398 if (name == NULL)
1399 {
1400 stub_noname_complaint ();
1401 return type;
1402 }
1403 newtype = lookup_transparent_type (name);
1404
1405 if (newtype)
1406 {
1407 /* If the resolved type and the stub are in the same
1408 objfile, then replace the stub type with the real deal.
1409 But if they're in separate objfiles, leave the stub
1410 alone; we'll just look up the transparent type every time
1411 we call check_typedef. We can't create pointers between
1412 types allocated to different objfiles, since they may
1413 have different lifetimes. Trying to copy NEWTYPE over to
1414 TYPE's objfile is pointless, too, since you'll have to
1415 move over any other types NEWTYPE refers to, which could
1416 be an unbounded amount of stuff. */
1417 if (TYPE_OBJFILE (newtype) == TYPE_OBJFILE (type))
1418 make_cv_type (is_const, is_volatile, newtype, &type);
1419 else
1420 type = newtype;
1421 }
1422 }
1423 /* Otherwise, rely on the stub flag being set for opaque/stubbed
1424 types. */
1425 else if (TYPE_STUB (type) && !currently_reading_symtab)
1426 {
1427 char *name = type_name_no_tag (type);
1428 /* FIXME: shouldn't we separately check the TYPE_NAME and the
1429 TYPE_TAG_NAME, and look in STRUCT_DOMAIN and/or VAR_DOMAIN
1430 as appropriate? (this code was written before TYPE_NAME and
1431 TYPE_TAG_NAME were separate). */
1432 struct symbol *sym;
1433 if (name == NULL)
1434 {
1435 stub_noname_complaint ();
1436 return type;
1437 }
1438 sym = lookup_symbol (name, 0, STRUCT_DOMAIN,
1439 0, (struct symtab **) NULL);
1440 if (sym)
1441 {
1442 /* Same as above for opaque types, we can replace the stub
1443 with the complete type only if they are int the same
1444 objfile. */
1445 if (TYPE_OBJFILE (SYMBOL_TYPE(sym)) == TYPE_OBJFILE (type))
1446 make_cv_type (is_const, is_volatile,
1447 SYMBOL_TYPE (sym), &type);
1448 else
1449 type = SYMBOL_TYPE (sym);
1450 }
1451 }
1452
1453 if (TYPE_TARGET_STUB (type))
1454 {
1455 struct type *range_type;
1456 struct type *target_type = check_typedef (TYPE_TARGET_TYPE (type));
1457
1458 if (TYPE_STUB (target_type) || TYPE_TARGET_STUB (target_type))
1459 {
1460 /* Empty. */
1461 }
1462 else if (TYPE_CODE (type) == TYPE_CODE_ARRAY
1463 && TYPE_NFIELDS (type) == 1
1464 && (TYPE_CODE (range_type = TYPE_FIELD_TYPE (type, 0))
1465 == TYPE_CODE_RANGE))
1466 {
1467 /* Now recompute the length of the array type, based on its
1468 number of elements and the target type's length. */
1469 TYPE_LENGTH (type) =
1470 ((TYPE_FIELD_BITPOS (range_type, 1)
1471 - TYPE_FIELD_BITPOS (range_type, 0) + 1)
1472 * TYPE_LENGTH (target_type));
1473 TYPE_FLAGS (type) &= ~TYPE_FLAG_TARGET_STUB;
1474 }
1475 else if (TYPE_CODE (type) == TYPE_CODE_RANGE)
1476 {
1477 TYPE_LENGTH (type) = TYPE_LENGTH (target_type);
1478 TYPE_FLAGS (type) &= ~TYPE_FLAG_TARGET_STUB;
1479 }
1480 }
1481 /* Cache TYPE_LENGTH for future use. */
1482 TYPE_LENGTH (orig_type) = TYPE_LENGTH (type);
1483 return type;
1484 }
1485
1486 /* Parse a type expression in the string [P..P+LENGTH). If an error
1487 occurs, silently return builtin_type_void. */
1488
1489 static struct type *
1490 safe_parse_type (char *p, int length)
1491 {
1492 struct ui_file *saved_gdb_stderr;
1493 struct type *type;
1494
1495 /* Suppress error messages. */
1496 saved_gdb_stderr = gdb_stderr;
1497 gdb_stderr = ui_file_new ();
1498
1499 /* Call parse_and_eval_type() without fear of longjmp()s. */
1500 if (!gdb_parse_and_eval_type (p, length, &type))
1501 type = builtin_type_void;
1502
1503 /* Stop suppressing error messages. */
1504 ui_file_delete (gdb_stderr);
1505 gdb_stderr = saved_gdb_stderr;
1506
1507 return type;
1508 }
1509
1510 /* Ugly hack to convert method stubs into method types.
1511
1512 He ain't kiddin'. This demangles the name of the method into a
1513 string including argument types, parses out each argument type,
1514 generates a string casting a zero to that type, evaluates the
1515 string, and stuffs the resulting type into an argtype vector!!!
1516 Then it knows the type of the whole function (including argument
1517 types for overloading), which info used to be in the stab's but was
1518 removed to hack back the space required for them. */
1519
1520 static void
1521 check_stub_method (struct type *type, int method_id, int signature_id)
1522 {
1523 struct fn_field *f;
1524 char *mangled_name = gdb_mangle_name (type, method_id, signature_id);
1525 char *demangled_name = cplus_demangle (mangled_name,
1526 DMGL_PARAMS | DMGL_ANSI);
1527 char *argtypetext, *p;
1528 int depth = 0, argcount = 1;
1529 struct field *argtypes;
1530 struct type *mtype;
1531
1532 /* Make sure we got back a function string that we can use. */
1533 if (demangled_name)
1534 p = strchr (demangled_name, '(');
1535 else
1536 p = NULL;
1537
1538 if (demangled_name == NULL || p == NULL)
1539 error (_("Internal: Cannot demangle mangled name `%s'."),
1540 mangled_name);
1541
1542 /* Now, read in the parameters that define this type. */
1543 p += 1;
1544 argtypetext = p;
1545 while (*p)
1546 {
1547 if (*p == '(' || *p == '<')
1548 {
1549 depth += 1;
1550 }
1551 else if (*p == ')' || *p == '>')
1552 {
1553 depth -= 1;
1554 }
1555 else if (*p == ',' && depth == 0)
1556 {
1557 argcount += 1;
1558 }
1559
1560 p += 1;
1561 }
1562
1563 /* If we read one argument and it was ``void'', don't count it. */
1564 if (strncmp (argtypetext, "(void)", 6) == 0)
1565 argcount -= 1;
1566
1567 /* We need one extra slot, for the THIS pointer. */
1568
1569 argtypes = (struct field *)
1570 TYPE_ALLOC (type, (argcount + 1) * sizeof (struct field));
1571 p = argtypetext;
1572
1573 /* Add THIS pointer for non-static methods. */
1574 f = TYPE_FN_FIELDLIST1 (type, method_id);
1575 if (TYPE_FN_FIELD_STATIC_P (f, signature_id))
1576 argcount = 0;
1577 else
1578 {
1579 argtypes[0].type = lookup_pointer_type (type);
1580 argcount = 1;
1581 }
1582
1583 if (*p != ')') /* () means no args, skip while */
1584 {
1585 depth = 0;
1586 while (*p)
1587 {
1588 if (depth <= 0 && (*p == ',' || *p == ')'))
1589 {
1590 /* Avoid parsing of ellipsis, they will be handled below.
1591 Also avoid ``void'' as above. */
1592 if (strncmp (argtypetext, "...", p - argtypetext) != 0
1593 && strncmp (argtypetext, "void", p - argtypetext) != 0)
1594 {
1595 argtypes[argcount].type =
1596 safe_parse_type (argtypetext, p - argtypetext);
1597 argcount += 1;
1598 }
1599 argtypetext = p + 1;
1600 }
1601
1602 if (*p == '(' || *p == '<')
1603 {
1604 depth += 1;
1605 }
1606 else if (*p == ')' || *p == '>')
1607 {
1608 depth -= 1;
1609 }
1610
1611 p += 1;
1612 }
1613 }
1614
1615 TYPE_FN_FIELD_PHYSNAME (f, signature_id) = mangled_name;
1616
1617 /* Now update the old "stub" type into a real type. */
1618 mtype = TYPE_FN_FIELD_TYPE (f, signature_id);
1619 TYPE_DOMAIN_TYPE (mtype) = type;
1620 TYPE_FIELDS (mtype) = argtypes;
1621 TYPE_NFIELDS (mtype) = argcount;
1622 TYPE_FLAGS (mtype) &= ~TYPE_FLAG_STUB;
1623 TYPE_FN_FIELD_STUB (f, signature_id) = 0;
1624 if (p[-2] == '.')
1625 TYPE_FLAGS (mtype) |= TYPE_FLAG_VARARGS;
1626
1627 xfree (demangled_name);
1628 }
1629
1630 /* This is the external interface to check_stub_method, above. This
1631 function unstubs all of the signatures for TYPE's METHOD_ID method
1632 name. After calling this function TYPE_FN_FIELD_STUB will be
1633 cleared for each signature and TYPE_FN_FIELDLIST_NAME will be
1634 correct.
1635
1636 This function unfortunately can not die until stabs do. */
1637
1638 void
1639 check_stub_method_group (struct type *type, int method_id)
1640 {
1641 int len = TYPE_FN_FIELDLIST_LENGTH (type, method_id);
1642 struct fn_field *f = TYPE_FN_FIELDLIST1 (type, method_id);
1643 int j, found_stub = 0;
1644
1645 for (j = 0; j < len; j++)
1646 if (TYPE_FN_FIELD_STUB (f, j))
1647 {
1648 found_stub = 1;
1649 check_stub_method (type, method_id, j);
1650 }
1651
1652 /* GNU v3 methods with incorrect names were corrected when we read
1653 in type information, because it was cheaper to do it then. The
1654 only GNU v2 methods with incorrect method names are operators and
1655 destructors; destructors were also corrected when we read in type
1656 information.
1657
1658 Therefore the only thing we need to handle here are v2 operator
1659 names. */
1660 if (found_stub && strncmp (TYPE_FN_FIELD_PHYSNAME (f, 0), "_Z", 2) != 0)
1661 {
1662 int ret;
1663 char dem_opname[256];
1664
1665 ret = cplus_demangle_opname (TYPE_FN_FIELDLIST_NAME (type,
1666 method_id),
1667 dem_opname, DMGL_ANSI);
1668 if (!ret)
1669 ret = cplus_demangle_opname (TYPE_FN_FIELDLIST_NAME (type,
1670 method_id),
1671 dem_opname, 0);
1672 if (ret)
1673 TYPE_FN_FIELDLIST_NAME (type, method_id) = xstrdup (dem_opname);
1674 }
1675 }
1676
1677 const struct cplus_struct_type cplus_struct_default;
1678
1679 void
1680 allocate_cplus_struct_type (struct type *type)
1681 {
1682 if (!HAVE_CPLUS_STRUCT (type))
1683 {
1684 TYPE_CPLUS_SPECIFIC (type) = (struct cplus_struct_type *)
1685 TYPE_ALLOC (type, sizeof (struct cplus_struct_type));
1686 *(TYPE_CPLUS_SPECIFIC (type)) = cplus_struct_default;
1687 }
1688 }
1689
1690 /* Helper function to initialize the standard scalar types.
1691
1692 If NAME is non-NULL and OBJFILE is non-NULL, then we make a copy of
1693 the string pointed to by name in the objfile_obstack for that
1694 objfile, and initialize the type name to that copy. There are
1695 places (mipsread.c in particular, where init_type is called with a
1696 NULL value for NAME). */
1697
1698 struct type *
1699 init_type (enum type_code code, int length, int flags,
1700 char *name, struct objfile *objfile)
1701 {
1702 struct type *type;
1703
1704 type = alloc_type (objfile);
1705 TYPE_CODE (type) = code;
1706 TYPE_LENGTH (type) = length;
1707 TYPE_FLAGS (type) |= flags;
1708 if ((name != NULL) && (objfile != NULL))
1709 {
1710 TYPE_NAME (type) = obsavestring (name, strlen (name),
1711 &objfile->objfile_obstack);
1712 }
1713 else
1714 {
1715 TYPE_NAME (type) = name;
1716 }
1717
1718 /* C++ fancies. */
1719
1720 if (name && strcmp (name, "char") == 0)
1721 TYPE_FLAGS (type) |= TYPE_FLAG_NOSIGN;
1722
1723 if (code == TYPE_CODE_STRUCT || code == TYPE_CODE_UNION
1724 || code == TYPE_CODE_NAMESPACE)
1725 {
1726 INIT_CPLUS_SPECIFIC (type);
1727 }
1728 return (type);
1729 }
1730
1731 /* Helper function. Create an empty composite type. */
1732
1733 struct type *
1734 init_composite_type (char *name, enum type_code code)
1735 {
1736 struct type *t;
1737 gdb_assert (code == TYPE_CODE_STRUCT
1738 || code == TYPE_CODE_UNION);
1739 t = init_type (code, 0, 0, NULL, NULL);
1740 TYPE_TAG_NAME (t) = name;
1741 return t;
1742 }
1743
1744 /* Helper function. Append a field to a composite type. */
1745
1746 void
1747 append_composite_type_field (struct type *t, char *name,
1748 struct type *field)
1749 {
1750 struct field *f;
1751 TYPE_NFIELDS (t) = TYPE_NFIELDS (t) + 1;
1752 TYPE_FIELDS (t) = xrealloc (TYPE_FIELDS (t),
1753 sizeof (struct field) * TYPE_NFIELDS (t));
1754 f = &(TYPE_FIELDS (t)[TYPE_NFIELDS (t) - 1]);
1755 memset (f, 0, sizeof f[0]);
1756 FIELD_TYPE (f[0]) = field;
1757 FIELD_NAME (f[0]) = name;
1758 if (TYPE_CODE (t) == TYPE_CODE_UNION)
1759 {
1760 if (TYPE_LENGTH (t) < TYPE_LENGTH (field))
1761 TYPE_LENGTH (t) = TYPE_LENGTH (field);
1762 }
1763 else if (TYPE_CODE (t) == TYPE_CODE_STRUCT)
1764 {
1765 TYPE_LENGTH (t) = TYPE_LENGTH (t) + TYPE_LENGTH (field);
1766 if (TYPE_NFIELDS (t) > 1)
1767 {
1768 FIELD_BITPOS (f[0]) = (FIELD_BITPOS (f[-1])
1769 + TYPE_LENGTH (field) * TARGET_CHAR_BIT);
1770 }
1771 }
1772 }
1773
1774 /* Look up a fundamental type for the specified objfile.
1775 May need to construct such a type if this is the first use.
1776
1777 Some object file formats (ELF, COFF, etc) do not define fundamental
1778 types such as "int" or "double". Others (stabs for example), do
1779 define fundamental types.
1780
1781 For the formats which don't provide fundamental types, gdb can
1782 create such types, using defaults reasonable for the current
1783 language and the current target machine.
1784
1785 NOTE: This routine is obsolescent. Each debugging format reader
1786 should manage it's own fundamental types, either creating them from
1787 suitable defaults or reading them from the debugging information,
1788 whichever is appropriate. The DWARF reader has already been fixed
1789 to do this. Once the other readers are fixed, this routine will go
1790 away. Also note that fundamental types should be managed on a
1791 compilation unit basis in a multi-language environment, not on a
1792 linkage unit basis as is done here. */
1793
1794
1795 struct type *
1796 lookup_fundamental_type (struct objfile *objfile, int typeid)
1797 {
1798 struct type **typep;
1799 int nbytes;
1800
1801 if (typeid < 0 || typeid >= FT_NUM_MEMBERS)
1802 {
1803 error (_("internal error - invalid fundamental type id %d"),
1804 typeid);
1805 }
1806
1807 /* If this is the first time we need a fundamental type for this
1808 objfile then we need to initialize the vector of type
1809 pointers. */
1810
1811 if (objfile->fundamental_types == NULL)
1812 {
1813 nbytes = FT_NUM_MEMBERS * sizeof (struct type *);
1814 objfile->fundamental_types = (struct type **)
1815 obstack_alloc (&objfile->objfile_obstack, nbytes);
1816 memset ((char *) objfile->fundamental_types, 0, nbytes);
1817 OBJSTAT (objfile, n_types += FT_NUM_MEMBERS);
1818 }
1819
1820 /* Look for this particular type in the fundamental type vector. If
1821 one is not found, create and install one appropriate for the
1822 current language. */
1823
1824 typep = objfile->fundamental_types + typeid;
1825 if (*typep == NULL)
1826 {
1827 *typep = create_fundamental_type (objfile, typeid);
1828 }
1829
1830 return (*typep);
1831 }
1832
1833 int
1834 can_dereference (struct type *t)
1835 {
1836 /* FIXME: Should we return true for references as well as
1837 pointers? */
1838 CHECK_TYPEDEF (t);
1839 return
1840 (t != NULL
1841 && TYPE_CODE (t) == TYPE_CODE_PTR
1842 && TYPE_CODE (TYPE_TARGET_TYPE (t)) != TYPE_CODE_VOID);
1843 }
1844
1845 int
1846 is_integral_type (struct type *t)
1847 {
1848 CHECK_TYPEDEF (t);
1849 return
1850 ((t != NULL)
1851 && ((TYPE_CODE (t) == TYPE_CODE_INT)
1852 || (TYPE_CODE (t) == TYPE_CODE_ENUM)
1853 || (TYPE_CODE (t) == TYPE_CODE_FLAGS)
1854 || (TYPE_CODE (t) == TYPE_CODE_CHAR)
1855 || (TYPE_CODE (t) == TYPE_CODE_RANGE)
1856 || (TYPE_CODE (t) == TYPE_CODE_BOOL)));
1857 }
1858
1859 /* Check whether BASE is an ancestor or base class or DCLASS
1860 Return 1 if so, and 0 if not.
1861 Note: callers may want to check for identity of the types before
1862 calling this function -- identical types are considered to satisfy
1863 the ancestor relationship even if they're identical. */
1864
1865 int
1866 is_ancestor (struct type *base, struct type *dclass)
1867 {
1868 int i;
1869
1870 CHECK_TYPEDEF (base);
1871 CHECK_TYPEDEF (dclass);
1872
1873 if (base == dclass)
1874 return 1;
1875 if (TYPE_NAME (base) && TYPE_NAME (dclass)
1876 && !strcmp (TYPE_NAME (base), TYPE_NAME (dclass)))
1877 return 1;
1878
1879 for (i = 0; i < TYPE_N_BASECLASSES (dclass); i++)
1880 if (is_ancestor (base, TYPE_BASECLASS (dclass, i)))
1881 return 1;
1882
1883 return 0;
1884 }
1885
1886
1887
1888 /* See whether DCLASS has a virtual table. This routine is aimed at
1889 the HP/Taligent ANSI C++ runtime model, and may not work with other
1890 runtime models. Return 1 => Yes, 0 => No. */
1891
1892 int
1893 has_vtable (struct type *dclass)
1894 {
1895 /* In the HP ANSI C++ runtime model, a class has a vtable only if it
1896 has virtual functions or virtual bases. */
1897
1898 int i;
1899
1900 if (TYPE_CODE (dclass) != TYPE_CODE_CLASS)
1901 return 0;
1902
1903 /* First check for the presence of virtual bases. */
1904 if (TYPE_FIELD_VIRTUAL_BITS (dclass))
1905 for (i = 0; i < TYPE_N_BASECLASSES (dclass); i++)
1906 if (B_TST (TYPE_FIELD_VIRTUAL_BITS (dclass), i))
1907 return 1;
1908
1909 /* Next check for virtual functions. */
1910 if (TYPE_FN_FIELDLISTS (dclass))
1911 for (i = 0; i < TYPE_NFN_FIELDS (dclass); i++)
1912 if (TYPE_FN_FIELD_VIRTUAL_P (TYPE_FN_FIELDLIST1 (dclass, i), 0))
1913 return 1;
1914
1915 /* Recurse on non-virtual bases to see if any of them needs a
1916 vtable. */
1917 if (TYPE_FIELD_VIRTUAL_BITS (dclass))
1918 for (i = 0; i < TYPE_N_BASECLASSES (dclass); i++)
1919 if ((!B_TST (TYPE_FIELD_VIRTUAL_BITS (dclass), i))
1920 && (has_vtable (TYPE_FIELD_TYPE (dclass, i))))
1921 return 1;
1922
1923 /* Well, maybe we don't need a virtual table. */
1924 return 0;
1925 }
1926
1927 /* Return a pointer to the "primary base class" of DCLASS.
1928
1929 A NULL return indicates that DCLASS has no primary base, or that it
1930 couldn't be found (insufficient information).
1931
1932 This routine is aimed at the HP/Taligent ANSI C++ runtime model,
1933 and may not work with other runtime models. */
1934
1935 struct type *
1936 primary_base_class (struct type *dclass)
1937 {
1938 /* In HP ANSI C++'s runtime model, a "primary base class" of a class
1939 is the first directly inherited, non-virtual base class that
1940 requires a virtual table. */
1941
1942 int i;
1943
1944 if (TYPE_CODE (dclass) != TYPE_CODE_CLASS)
1945 return NULL;
1946
1947 for (i = 0; i < TYPE_N_BASECLASSES (dclass); i++)
1948 if (!TYPE_FIELD_VIRTUAL (dclass, i)
1949 && has_vtable (TYPE_FIELD_TYPE (dclass, i)))
1950 return TYPE_FIELD_TYPE (dclass, i);
1951
1952 return NULL;
1953 }
1954
1955 /* Global manipulated by virtual_base_list[_aux](). */
1956
1957 static struct vbase *current_vbase_list = NULL;
1958
1959 /* Return a pointer to a null-terminated list of struct vbase items.
1960 The vbasetype pointer of each item in the list points to the type
1961 information for a virtual base of the argument DCLASS.
1962
1963 Helper function for virtual_base_list().
1964 Note: the list goes backward, right-to-left.
1965 virtual_base_list() copies the items out in reverse order. */
1966
1967 static void
1968 virtual_base_list_aux (struct type *dclass)
1969 {
1970 struct vbase *tmp_vbase;
1971 int i;
1972
1973 if (TYPE_CODE (dclass) != TYPE_CODE_CLASS)
1974 return;
1975
1976 for (i = 0; i < TYPE_N_BASECLASSES (dclass); i++)
1977 {
1978 /* Recurse on this ancestor, first */
1979 virtual_base_list_aux (TYPE_FIELD_TYPE (dclass, i));
1980
1981 /* If this current base is itself virtual, add it to the list */
1982 if (BASETYPE_VIA_VIRTUAL (dclass, i))
1983 {
1984 struct type *basetype = TYPE_FIELD_TYPE (dclass, i);
1985
1986 /* Check if base already recorded */
1987 tmp_vbase = current_vbase_list;
1988 while (tmp_vbase)
1989 {
1990 if (tmp_vbase->vbasetype == basetype)
1991 break; /* found it */
1992 tmp_vbase = tmp_vbase->next;
1993 }
1994
1995 if (!tmp_vbase) /* normal exit from loop */
1996 {
1997 /* Allocate new item for this virtual base */
1998 tmp_vbase = (struct vbase *) xmalloc (sizeof (struct vbase));
1999
2000 /* Stick it on at the end of the list */
2001 tmp_vbase->vbasetype = basetype;
2002 tmp_vbase->next = current_vbase_list;
2003 current_vbase_list = tmp_vbase;
2004 }
2005 } /* if virtual */
2006 } /* for loop over bases */
2007 }
2008
2009
2010 /* Compute the list of virtual bases in the right order. Virtual
2011 bases are laid out in the object's memory area in order of their
2012 occurrence in a depth-first, left-to-right search through the
2013 ancestors.
2014
2015 Argument DCLASS is the type whose virtual bases are required.
2016 Return value is the address of a null-terminated array of pointers
2017 to struct type items.
2018
2019 This routine is aimed at the HP/Taligent ANSI C++ runtime model,
2020 and may not work with other runtime models.
2021
2022 This routine merely hands off the argument to virtual_base_list_aux()
2023 and then copies the result into an array to save space. */
2024
2025 static struct type **
2026 virtual_base_list (struct type *dclass)
2027 {
2028 struct vbase *tmp_vbase;
2029 struct vbase *tmp_vbase_2;
2030 int i;
2031 int count;
2032 struct type **vbase_array;
2033
2034 current_vbase_list = NULL;
2035 virtual_base_list_aux (dclass);
2036
2037 for (i = 0, tmp_vbase = current_vbase_list;
2038 tmp_vbase != NULL;
2039 i++, tmp_vbase = tmp_vbase->next)
2040 /* no body */ ;
2041
2042 count = i;
2043
2044 vbase_array = (struct type **)
2045 xmalloc ((count + 1) * sizeof (struct type *));
2046
2047 for (i = count - 1, tmp_vbase = current_vbase_list;
2048 i >= 0; i--,
2049 tmp_vbase = tmp_vbase->next)
2050 vbase_array[i] = tmp_vbase->vbasetype;
2051
2052 /* Get rid of constructed chain. */
2053 tmp_vbase_2 = tmp_vbase = current_vbase_list;
2054 while (tmp_vbase)
2055 {
2056 tmp_vbase = tmp_vbase->next;
2057 xfree (tmp_vbase_2);
2058 tmp_vbase_2 = tmp_vbase;
2059 }
2060
2061 vbase_array[count] = NULL;
2062 return vbase_array;
2063 }
2064
2065 /* Return the length of the virtual base list of the type DCLASS. */
2066
2067 int
2068 virtual_base_list_length (struct type *dclass)
2069 {
2070 int i;
2071 struct vbase *tmp_vbase;
2072
2073 current_vbase_list = NULL;
2074 virtual_base_list_aux (dclass);
2075
2076 for (i = 0, tmp_vbase = current_vbase_list;
2077 tmp_vbase != NULL;
2078 i++, tmp_vbase = tmp_vbase->next)
2079 /* no body */ ;
2080 return i;
2081 }
2082
2083 /* Return the number of elements of the virtual base list of the type
2084 DCLASS, ignoring those appearing in the primary base (and its
2085 primary base, recursively). */
2086
2087 int
2088 virtual_base_list_length_skip_primaries (struct type *dclass)
2089 {
2090 int i;
2091 struct vbase *tmp_vbase;
2092 struct type *primary;
2093
2094 primary = TYPE_RUNTIME_PTR (dclass) ? TYPE_PRIMARY_BASE (dclass) : NULL;
2095
2096 if (!primary)
2097 return virtual_base_list_length (dclass);
2098
2099 current_vbase_list = NULL;
2100 virtual_base_list_aux (dclass);
2101
2102 for (i = 0, tmp_vbase = current_vbase_list;
2103 tmp_vbase != NULL;
2104 tmp_vbase = tmp_vbase->next)
2105 {
2106 if (virtual_base_index (tmp_vbase->vbasetype, primary) >= 0)
2107 continue;
2108 i++;
2109 }
2110 return i;
2111 }
2112
2113 /* Return the index (position) of type BASE, which is a virtual base
2114 class of DCLASS, in the latter's virtual base list. A return of -1
2115 indicates "not found" or a problem. */
2116
2117 int
2118 virtual_base_index (struct type *base, struct type *dclass)
2119 {
2120 struct type *vbase, **vbase_list;
2121 int i;
2122
2123 if ((TYPE_CODE (dclass) != TYPE_CODE_CLASS)
2124 || (TYPE_CODE (base) != TYPE_CODE_CLASS))
2125 return -1;
2126
2127 vbase_list = virtual_base_list (dclass);
2128 for (i = 0, vbase = vbase_list[0];
2129 vbase != NULL;
2130 vbase = vbase_list[++i])
2131 if (vbase == base)
2132 break;
2133
2134 xfree (vbase_list);
2135 return vbase ? i : -1;
2136 }
2137
2138 /* Return the index (position) of type BASE, which is a virtual base
2139 class of DCLASS, in the latter's virtual base list. Skip over all
2140 bases that may appear in the virtual base list of the primary base
2141 class of DCLASS (recursively). A return of -1 indicates "not
2142 found" or a problem. */
2143
2144 int
2145 virtual_base_index_skip_primaries (struct type *base,
2146 struct type *dclass)
2147 {
2148 struct type *vbase, **vbase_list;
2149 int i, j;
2150 struct type *primary;
2151
2152 if ((TYPE_CODE (dclass) != TYPE_CODE_CLASS)
2153 || (TYPE_CODE (base) != TYPE_CODE_CLASS))
2154 return -1;
2155
2156 primary = TYPE_RUNTIME_PTR (dclass) ? TYPE_PRIMARY_BASE (dclass) : NULL;
2157
2158 vbase_list = virtual_base_list (dclass);
2159 for (i = 0, j = -1, vbase = vbase_list[0];
2160 vbase != NULL;
2161 vbase = vbase_list[++i])
2162 {
2163 if (!primary
2164 || (virtual_base_index_skip_primaries (vbase, primary) < 0))
2165 j++;
2166 if (vbase == base)
2167 break;
2168 }
2169 xfree (vbase_list);
2170 return vbase ? j : -1;
2171 }
2172
2173 /* Return position of a derived class DCLASS in the list of primary
2174 bases starting with the remotest ancestor. Position returned is
2175 0-based. */
2176
2177 int
2178 class_index_in_primary_list (struct type *dclass)
2179 {
2180 struct type *pbc; /* primary base class */
2181
2182 /* Simply recurse on primary base */
2183 pbc = TYPE_PRIMARY_BASE (dclass);
2184 if (pbc)
2185 return 1 + class_index_in_primary_list (pbc);
2186 else
2187 return 0;
2188 }
2189
2190 /* Return a count of the number of virtual functions a type has. This
2191 includes all the virtual functions it inherits from its base
2192 classes too. */
2193
2194 /* pai: FIXME This doesn't do the right thing: count redefined virtual
2195 functions only once (latest redefinition). */
2196
2197 int
2198 count_virtual_fns (struct type *dclass)
2199 {
2200 int fn, oi; /* function and overloaded instance indices */
2201 int vfuncs; /* count to return */
2202
2203 /* recurse on bases that can share virtual table */
2204 struct type *pbc = primary_base_class (dclass);
2205 if (pbc)
2206 vfuncs = count_virtual_fns (pbc);
2207 else
2208 vfuncs = 0;
2209
2210 for (fn = 0; fn < TYPE_NFN_FIELDS (dclass); fn++)
2211 for (oi = 0; oi < TYPE_FN_FIELDLIST_LENGTH (dclass, fn); oi++)
2212 if (TYPE_FN_FIELD_VIRTUAL_P (TYPE_FN_FIELDLIST1 (dclass, fn), oi))
2213 vfuncs++;
2214
2215 return vfuncs;
2216 }
2217 \f
2218
2219
2220 /* Functions for overload resolution begin here */
2221
2222 /* Compare two badness vectors A and B and return the result.
2223 0 => A and B are identical
2224 1 => A and B are incomparable
2225 2 => A is better than B
2226 3 => A is worse than B */
2227
2228 int
2229 compare_badness (struct badness_vector *a, struct badness_vector *b)
2230 {
2231 int i;
2232 int tmp;
2233 short found_pos = 0; /* any positives in c? */
2234 short found_neg = 0; /* any negatives in c? */
2235
2236 /* differing lengths => incomparable */
2237 if (a->length != b->length)
2238 return 1;
2239
2240 /* Subtract b from a */
2241 for (i = 0; i < a->length; i++)
2242 {
2243 tmp = a->rank[i] - b->rank[i];
2244 if (tmp > 0)
2245 found_pos = 1;
2246 else if (tmp < 0)
2247 found_neg = 1;
2248 }
2249
2250 if (found_pos)
2251 {
2252 if (found_neg)
2253 return 1; /* incomparable */
2254 else
2255 return 3; /* A > B */
2256 }
2257 else
2258 /* no positives */
2259 {
2260 if (found_neg)
2261 return 2; /* A < B */
2262 else
2263 return 0; /* A == B */
2264 }
2265 }
2266
2267 /* Rank a function by comparing its parameter types (PARMS, length
2268 NPARMS), to the types of an argument list (ARGS, length NARGS).
2269 Return a pointer to a badness vector. This has NARGS + 1
2270 entries. */
2271
2272 struct badness_vector *
2273 rank_function (struct type **parms, int nparms,
2274 struct type **args, int nargs)
2275 {
2276 int i;
2277 struct badness_vector *bv;
2278 int min_len = nparms < nargs ? nparms : nargs;
2279
2280 bv = xmalloc (sizeof (struct badness_vector));
2281 bv->length = nargs + 1; /* add 1 for the length-match rank */
2282 bv->rank = xmalloc ((nargs + 1) * sizeof (int));
2283
2284 /* First compare the lengths of the supplied lists.
2285 If there is a mismatch, set it to a high value. */
2286
2287 /* pai/1997-06-03 FIXME: when we have debug info about default
2288 arguments and ellipsis parameter lists, we should consider those
2289 and rank the length-match more finely. */
2290
2291 LENGTH_MATCH (bv) = (nargs != nparms) ? LENGTH_MISMATCH_BADNESS : 0;
2292
2293 /* Now rank all the parameters of the candidate function */
2294 for (i = 1; i <= min_len; i++)
2295 bv->rank[i] = rank_one_type (parms[i-1], args[i-1]);
2296
2297 /* If more arguments than parameters, add dummy entries */
2298 for (i = min_len + 1; i <= nargs; i++)
2299 bv->rank[i] = TOO_FEW_PARAMS_BADNESS;
2300
2301 return bv;
2302 }
2303
2304 /* Compare the names of two integer types, assuming that any sign
2305 qualifiers have been checked already. We do it this way because
2306 there may be an "int" in the name of one of the types. */
2307
2308 static int
2309 integer_types_same_name_p (const char *first, const char *second)
2310 {
2311 int first_p, second_p;
2312
2313 /* If both are shorts, return 1; if neither is a short, keep
2314 checking. */
2315 first_p = (strstr (first, "short") != NULL);
2316 second_p = (strstr (second, "short") != NULL);
2317 if (first_p && second_p)
2318 return 1;
2319 if (first_p || second_p)
2320 return 0;
2321
2322 /* Likewise for long. */
2323 first_p = (strstr (first, "long") != NULL);
2324 second_p = (strstr (second, "long") != NULL);
2325 if (first_p && second_p)
2326 return 1;
2327 if (first_p || second_p)
2328 return 0;
2329
2330 /* Likewise for char. */
2331 first_p = (strstr (first, "char") != NULL);
2332 second_p = (strstr (second, "char") != NULL);
2333 if (first_p && second_p)
2334 return 1;
2335 if (first_p || second_p)
2336 return 0;
2337
2338 /* They must both be ints. */
2339 return 1;
2340 }
2341
2342 /* Compare one type (PARM) for compatibility with another (ARG).
2343 * PARM is intended to be the parameter type of a function; and
2344 * ARG is the supplied argument's type. This function tests if
2345 * the latter can be converted to the former.
2346 *
2347 * Return 0 if they are identical types;
2348 * Otherwise, return an integer which corresponds to how compatible
2349 * PARM is to ARG. The higher the return value, the worse the match.
2350 * Generally the "bad" conversions are all uniformly assigned a 100. */
2351
2352 int
2353 rank_one_type (struct type *parm, struct type *arg)
2354 {
2355 /* Identical type pointers. */
2356 /* However, this still doesn't catch all cases of same type for arg
2357 and param. The reason is that builtin types are different from
2358 the same ones constructed from the object. */
2359 if (parm == arg)
2360 return 0;
2361
2362 /* Resolve typedefs */
2363 if (TYPE_CODE (parm) == TYPE_CODE_TYPEDEF)
2364 parm = check_typedef (parm);
2365 if (TYPE_CODE (arg) == TYPE_CODE_TYPEDEF)
2366 arg = check_typedef (arg);
2367
2368 /*
2369 Well, damnit, if the names are exactly the same, I'll say they
2370 are exactly the same. This happens when we generate method
2371 stubs. The types won't point to the same address, but they
2372 really are the same.
2373 */
2374
2375 if (TYPE_NAME (parm) && TYPE_NAME (arg)
2376 && !strcmp (TYPE_NAME (parm), TYPE_NAME (arg)))
2377 return 0;
2378
2379 /* Check if identical after resolving typedefs. */
2380 if (parm == arg)
2381 return 0;
2382
2383 /* See through references, since we can almost make non-references
2384 references. */
2385 if (TYPE_CODE (arg) == TYPE_CODE_REF)
2386 return (rank_one_type (parm, TYPE_TARGET_TYPE (arg))
2387 + REFERENCE_CONVERSION_BADNESS);
2388 if (TYPE_CODE (parm) == TYPE_CODE_REF)
2389 return (rank_one_type (TYPE_TARGET_TYPE (parm), arg)
2390 + REFERENCE_CONVERSION_BADNESS);
2391 if (overload_debug)
2392 /* Debugging only. */
2393 fprintf_filtered (gdb_stderr,
2394 "------ Arg is %s [%d], parm is %s [%d]\n",
2395 TYPE_NAME (arg), TYPE_CODE (arg),
2396 TYPE_NAME (parm), TYPE_CODE (parm));
2397
2398 /* x -> y means arg of type x being supplied for parameter of type y */
2399
2400 switch (TYPE_CODE (parm))
2401 {
2402 case TYPE_CODE_PTR:
2403 switch (TYPE_CODE (arg))
2404 {
2405 case TYPE_CODE_PTR:
2406 if (TYPE_CODE (TYPE_TARGET_TYPE (parm)) == TYPE_CODE_VOID)
2407 return VOID_PTR_CONVERSION_BADNESS;
2408 else
2409 return rank_one_type (TYPE_TARGET_TYPE (parm),
2410 TYPE_TARGET_TYPE (arg));
2411 case TYPE_CODE_ARRAY:
2412 return rank_one_type (TYPE_TARGET_TYPE (parm),
2413 TYPE_TARGET_TYPE (arg));
2414 case TYPE_CODE_FUNC:
2415 return rank_one_type (TYPE_TARGET_TYPE (parm), arg);
2416 case TYPE_CODE_INT:
2417 case TYPE_CODE_ENUM:
2418 case TYPE_CODE_FLAGS:
2419 case TYPE_CODE_CHAR:
2420 case TYPE_CODE_RANGE:
2421 case TYPE_CODE_BOOL:
2422 return POINTER_CONVERSION_BADNESS;
2423 default:
2424 return INCOMPATIBLE_TYPE_BADNESS;
2425 }
2426 case TYPE_CODE_ARRAY:
2427 switch (TYPE_CODE (arg))
2428 {
2429 case TYPE_CODE_PTR:
2430 case TYPE_CODE_ARRAY:
2431 return rank_one_type (TYPE_TARGET_TYPE (parm),
2432 TYPE_TARGET_TYPE (arg));
2433 default:
2434 return INCOMPATIBLE_TYPE_BADNESS;
2435 }
2436 case TYPE_CODE_FUNC:
2437 switch (TYPE_CODE (arg))
2438 {
2439 case TYPE_CODE_PTR: /* funcptr -> func */
2440 return rank_one_type (parm, TYPE_TARGET_TYPE (arg));
2441 default:
2442 return INCOMPATIBLE_TYPE_BADNESS;
2443 }
2444 case TYPE_CODE_INT:
2445 switch (TYPE_CODE (arg))
2446 {
2447 case TYPE_CODE_INT:
2448 if (TYPE_LENGTH (arg) == TYPE_LENGTH (parm))
2449 {
2450 /* Deal with signed, unsigned, and plain chars and
2451 signed and unsigned ints. */
2452 if (TYPE_NOSIGN (parm))
2453 {
2454 /* This case only for character types */
2455 if (TYPE_NOSIGN (arg))
2456 return 0; /* plain char -> plain char */
2457 else /* signed/unsigned char -> plain char */
2458 return INTEGER_CONVERSION_BADNESS;
2459 }
2460 else if (TYPE_UNSIGNED (parm))
2461 {
2462 if (TYPE_UNSIGNED (arg))
2463 {
2464 /* unsigned int -> unsigned int, or
2465 unsigned long -> unsigned long */
2466 if (integer_types_same_name_p (TYPE_NAME (parm),
2467 TYPE_NAME (arg)))
2468 return 0;
2469 else if (integer_types_same_name_p (TYPE_NAME (arg),
2470 "int")
2471 && integer_types_same_name_p (TYPE_NAME (parm),
2472 "long"))
2473 return INTEGER_PROMOTION_BADNESS; /* unsigned int -> unsigned long */
2474 else
2475 return INTEGER_CONVERSION_BADNESS; /* unsigned long -> unsigned int */
2476 }
2477 else
2478 {
2479 if (integer_types_same_name_p (TYPE_NAME (arg),
2480 "long")
2481 && integer_types_same_name_p (TYPE_NAME (parm),
2482 "int"))
2483 return INTEGER_CONVERSION_BADNESS; /* signed long -> unsigned int */
2484 else
2485 return INTEGER_CONVERSION_BADNESS; /* signed int/long -> unsigned int/long */
2486 }
2487 }
2488 else if (!TYPE_NOSIGN (arg) && !TYPE_UNSIGNED (arg))
2489 {
2490 if (integer_types_same_name_p (TYPE_NAME (parm),
2491 TYPE_NAME (arg)))
2492 return 0;
2493 else if (integer_types_same_name_p (TYPE_NAME (arg),
2494 "int")
2495 && integer_types_same_name_p (TYPE_NAME (parm),
2496 "long"))
2497 return INTEGER_PROMOTION_BADNESS;
2498 else
2499 return INTEGER_CONVERSION_BADNESS;
2500 }
2501 else
2502 return INTEGER_CONVERSION_BADNESS;
2503 }
2504 else if (TYPE_LENGTH (arg) < TYPE_LENGTH (parm))
2505 return INTEGER_PROMOTION_BADNESS;
2506 else
2507 return INTEGER_CONVERSION_BADNESS;
2508 case TYPE_CODE_ENUM:
2509 case TYPE_CODE_FLAGS:
2510 case TYPE_CODE_CHAR:
2511 case TYPE_CODE_RANGE:
2512 case TYPE_CODE_BOOL:
2513 return INTEGER_PROMOTION_BADNESS;
2514 case TYPE_CODE_FLT:
2515 return INT_FLOAT_CONVERSION_BADNESS;
2516 case TYPE_CODE_PTR:
2517 return NS_POINTER_CONVERSION_BADNESS;
2518 default:
2519 return INCOMPATIBLE_TYPE_BADNESS;
2520 }
2521 break;
2522 case TYPE_CODE_ENUM:
2523 switch (TYPE_CODE (arg))
2524 {
2525 case TYPE_CODE_INT:
2526 case TYPE_CODE_CHAR:
2527 case TYPE_CODE_RANGE:
2528 case TYPE_CODE_BOOL:
2529 case TYPE_CODE_ENUM:
2530 return INTEGER_CONVERSION_BADNESS;
2531 case TYPE_CODE_FLT:
2532 return INT_FLOAT_CONVERSION_BADNESS;
2533 default:
2534 return INCOMPATIBLE_TYPE_BADNESS;
2535 }
2536 break;
2537 case TYPE_CODE_CHAR:
2538 switch (TYPE_CODE (arg))
2539 {
2540 case TYPE_CODE_RANGE:
2541 case TYPE_CODE_BOOL:
2542 case TYPE_CODE_ENUM:
2543 return INTEGER_CONVERSION_BADNESS;
2544 case TYPE_CODE_FLT:
2545 return INT_FLOAT_CONVERSION_BADNESS;
2546 case TYPE_CODE_INT:
2547 if (TYPE_LENGTH (arg) > TYPE_LENGTH (parm))
2548 return INTEGER_CONVERSION_BADNESS;
2549 else if (TYPE_LENGTH (arg) < TYPE_LENGTH (parm))
2550 return INTEGER_PROMOTION_BADNESS;
2551 /* >>> !! else fall through !! <<< */
2552 case TYPE_CODE_CHAR:
2553 /* Deal with signed, unsigned, and plain chars for C++ and
2554 with int cases falling through from previous case. */
2555 if (TYPE_NOSIGN (parm))
2556 {
2557 if (TYPE_NOSIGN (arg))
2558 return 0;
2559 else
2560 return INTEGER_CONVERSION_BADNESS;
2561 }
2562 else if (TYPE_UNSIGNED (parm))
2563 {
2564 if (TYPE_UNSIGNED (arg))
2565 return 0;
2566 else
2567 return INTEGER_PROMOTION_BADNESS;
2568 }
2569 else if (!TYPE_NOSIGN (arg) && !TYPE_UNSIGNED (arg))
2570 return 0;
2571 else
2572 return INTEGER_CONVERSION_BADNESS;
2573 default:
2574 return INCOMPATIBLE_TYPE_BADNESS;
2575 }
2576 break;
2577 case TYPE_CODE_RANGE:
2578 switch (TYPE_CODE (arg))
2579 {
2580 case TYPE_CODE_INT:
2581 case TYPE_CODE_CHAR:
2582 case TYPE_CODE_RANGE:
2583 case TYPE_CODE_BOOL:
2584 case TYPE_CODE_ENUM:
2585 return INTEGER_CONVERSION_BADNESS;
2586 case TYPE_CODE_FLT:
2587 return INT_FLOAT_CONVERSION_BADNESS;
2588 default:
2589 return INCOMPATIBLE_TYPE_BADNESS;
2590 }
2591 break;
2592 case TYPE_CODE_BOOL:
2593 switch (TYPE_CODE (arg))
2594 {
2595 case TYPE_CODE_INT:
2596 case TYPE_CODE_CHAR:
2597 case TYPE_CODE_RANGE:
2598 case TYPE_CODE_ENUM:
2599 case TYPE_CODE_FLT:
2600 case TYPE_CODE_PTR:
2601 return BOOLEAN_CONVERSION_BADNESS;
2602 case TYPE_CODE_BOOL:
2603 return 0;
2604 default:
2605 return INCOMPATIBLE_TYPE_BADNESS;
2606 }
2607 break;
2608 case TYPE_CODE_FLT:
2609 switch (TYPE_CODE (arg))
2610 {
2611 case TYPE_CODE_FLT:
2612 if (TYPE_LENGTH (arg) < TYPE_LENGTH (parm))
2613 return FLOAT_PROMOTION_BADNESS;
2614 else if (TYPE_LENGTH (arg) == TYPE_LENGTH (parm))
2615 return 0;
2616 else
2617 return FLOAT_CONVERSION_BADNESS;
2618 case TYPE_CODE_INT:
2619 case TYPE_CODE_BOOL:
2620 case TYPE_CODE_ENUM:
2621 case TYPE_CODE_RANGE:
2622 case TYPE_CODE_CHAR:
2623 return INT_FLOAT_CONVERSION_BADNESS;
2624 default:
2625 return INCOMPATIBLE_TYPE_BADNESS;
2626 }
2627 break;
2628 case TYPE_CODE_COMPLEX:
2629 switch (TYPE_CODE (arg))
2630 { /* Strictly not needed for C++, but... */
2631 case TYPE_CODE_FLT:
2632 return FLOAT_PROMOTION_BADNESS;
2633 case TYPE_CODE_COMPLEX:
2634 return 0;
2635 default:
2636 return INCOMPATIBLE_TYPE_BADNESS;
2637 }
2638 break;
2639 case TYPE_CODE_STRUCT:
2640 /* currently same as TYPE_CODE_CLASS */
2641 switch (TYPE_CODE (arg))
2642 {
2643 case TYPE_CODE_STRUCT:
2644 /* Check for derivation */
2645 if (is_ancestor (parm, arg))
2646 return BASE_CONVERSION_BADNESS;
2647 /* else fall through */
2648 default:
2649 return INCOMPATIBLE_TYPE_BADNESS;
2650 }
2651 break;
2652 case TYPE_CODE_UNION:
2653 switch (TYPE_CODE (arg))
2654 {
2655 case TYPE_CODE_UNION:
2656 default:
2657 return INCOMPATIBLE_TYPE_BADNESS;
2658 }
2659 break;
2660 case TYPE_CODE_MEMBERPTR:
2661 switch (TYPE_CODE (arg))
2662 {
2663 default:
2664 return INCOMPATIBLE_TYPE_BADNESS;
2665 }
2666 break;
2667 case TYPE_CODE_METHOD:
2668 switch (TYPE_CODE (arg))
2669 {
2670
2671 default:
2672 return INCOMPATIBLE_TYPE_BADNESS;
2673 }
2674 break;
2675 case TYPE_CODE_REF:
2676 switch (TYPE_CODE (arg))
2677 {
2678
2679 default:
2680 return INCOMPATIBLE_TYPE_BADNESS;
2681 }
2682
2683 break;
2684 case TYPE_CODE_SET:
2685 switch (TYPE_CODE (arg))
2686 {
2687 /* Not in C++ */
2688 case TYPE_CODE_SET:
2689 return rank_one_type (TYPE_FIELD_TYPE (parm, 0),
2690 TYPE_FIELD_TYPE (arg, 0));
2691 default:
2692 return INCOMPATIBLE_TYPE_BADNESS;
2693 }
2694 break;
2695 case TYPE_CODE_VOID:
2696 default:
2697 return INCOMPATIBLE_TYPE_BADNESS;
2698 } /* switch (TYPE_CODE (arg)) */
2699 }
2700
2701
2702 /* End of functions for overload resolution */
2703
2704 static void
2705 print_bit_vector (B_TYPE *bits, int nbits)
2706 {
2707 int bitno;
2708
2709 for (bitno = 0; bitno < nbits; bitno++)
2710 {
2711 if ((bitno % 8) == 0)
2712 {
2713 puts_filtered (" ");
2714 }
2715 if (B_TST (bits, bitno))
2716 printf_filtered (("1"));
2717 else
2718 printf_filtered (("0"));
2719 }
2720 }
2721
2722 /* Note the first arg should be the "this" pointer, we may not want to
2723 include it since we may get into a infinitely recursive
2724 situation. */
2725
2726 static void
2727 print_arg_types (struct field *args, int nargs, int spaces)
2728 {
2729 if (args != NULL)
2730 {
2731 int i;
2732
2733 for (i = 0; i < nargs; i++)
2734 recursive_dump_type (args[i].type, spaces + 2);
2735 }
2736 }
2737
2738 static void
2739 dump_fn_fieldlists (struct type *type, int spaces)
2740 {
2741 int method_idx;
2742 int overload_idx;
2743 struct fn_field *f;
2744
2745 printfi_filtered (spaces, "fn_fieldlists ");
2746 gdb_print_host_address (TYPE_FN_FIELDLISTS (type), gdb_stdout);
2747 printf_filtered ("\n");
2748 for (method_idx = 0; method_idx < TYPE_NFN_FIELDS (type); method_idx++)
2749 {
2750 f = TYPE_FN_FIELDLIST1 (type, method_idx);
2751 printfi_filtered (spaces + 2, "[%d] name '%s' (",
2752 method_idx,
2753 TYPE_FN_FIELDLIST_NAME (type, method_idx));
2754 gdb_print_host_address (TYPE_FN_FIELDLIST_NAME (type, method_idx),
2755 gdb_stdout);
2756 printf_filtered (_(") length %d\n"),
2757 TYPE_FN_FIELDLIST_LENGTH (type, method_idx));
2758 for (overload_idx = 0;
2759 overload_idx < TYPE_FN_FIELDLIST_LENGTH (type, method_idx);
2760 overload_idx++)
2761 {
2762 printfi_filtered (spaces + 4, "[%d] physname '%s' (",
2763 overload_idx,
2764 TYPE_FN_FIELD_PHYSNAME (f, overload_idx));
2765 gdb_print_host_address (TYPE_FN_FIELD_PHYSNAME (f, overload_idx),
2766 gdb_stdout);
2767 printf_filtered (")\n");
2768 printfi_filtered (spaces + 8, "type ");
2769 gdb_print_host_address (TYPE_FN_FIELD_TYPE (f, overload_idx),
2770 gdb_stdout);
2771 printf_filtered ("\n");
2772
2773 recursive_dump_type (TYPE_FN_FIELD_TYPE (f, overload_idx),
2774 spaces + 8 + 2);
2775
2776 printfi_filtered (spaces + 8, "args ");
2777 gdb_print_host_address (TYPE_FN_FIELD_ARGS (f, overload_idx),
2778 gdb_stdout);
2779 printf_filtered ("\n");
2780
2781 print_arg_types (TYPE_FN_FIELD_ARGS (f, overload_idx),
2782 TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f,
2783 overload_idx)),
2784 spaces);
2785 printfi_filtered (spaces + 8, "fcontext ");
2786 gdb_print_host_address (TYPE_FN_FIELD_FCONTEXT (f, overload_idx),
2787 gdb_stdout);
2788 printf_filtered ("\n");
2789
2790 printfi_filtered (spaces + 8, "is_const %d\n",
2791 TYPE_FN_FIELD_CONST (f, overload_idx));
2792 printfi_filtered (spaces + 8, "is_volatile %d\n",
2793 TYPE_FN_FIELD_VOLATILE (f, overload_idx));
2794 printfi_filtered (spaces + 8, "is_private %d\n",
2795 TYPE_FN_FIELD_PRIVATE (f, overload_idx));
2796 printfi_filtered (spaces + 8, "is_protected %d\n",
2797 TYPE_FN_FIELD_PROTECTED (f, overload_idx));
2798 printfi_filtered (spaces + 8, "is_stub %d\n",
2799 TYPE_FN_FIELD_STUB (f, overload_idx));
2800 printfi_filtered (spaces + 8, "voffset %u\n",
2801 TYPE_FN_FIELD_VOFFSET (f, overload_idx));
2802 }
2803 }
2804 }
2805
2806 static void
2807 print_cplus_stuff (struct type *type, int spaces)
2808 {
2809 printfi_filtered (spaces, "n_baseclasses %d\n",
2810 TYPE_N_BASECLASSES (type));
2811 printfi_filtered (spaces, "nfn_fields %d\n",
2812 TYPE_NFN_FIELDS (type));
2813 printfi_filtered (spaces, "nfn_fields_total %d\n",
2814 TYPE_NFN_FIELDS_TOTAL (type));
2815 if (TYPE_N_BASECLASSES (type) > 0)
2816 {
2817 printfi_filtered (spaces, "virtual_field_bits (%d bits at *",
2818 TYPE_N_BASECLASSES (type));
2819 gdb_print_host_address (TYPE_FIELD_VIRTUAL_BITS (type),
2820 gdb_stdout);
2821 printf_filtered (")");
2822
2823 print_bit_vector (TYPE_FIELD_VIRTUAL_BITS (type),
2824 TYPE_N_BASECLASSES (type));
2825 puts_filtered ("\n");
2826 }
2827 if (TYPE_NFIELDS (type) > 0)
2828 {
2829 if (TYPE_FIELD_PRIVATE_BITS (type) != NULL)
2830 {
2831 printfi_filtered (spaces,
2832 "private_field_bits (%d bits at *",
2833 TYPE_NFIELDS (type));
2834 gdb_print_host_address (TYPE_FIELD_PRIVATE_BITS (type),
2835 gdb_stdout);
2836 printf_filtered (")");
2837 print_bit_vector (TYPE_FIELD_PRIVATE_BITS (type),
2838 TYPE_NFIELDS (type));
2839 puts_filtered ("\n");
2840 }
2841 if (TYPE_FIELD_PROTECTED_BITS (type) != NULL)
2842 {
2843 printfi_filtered (spaces,
2844 "protected_field_bits (%d bits at *",
2845 TYPE_NFIELDS (type));
2846 gdb_print_host_address (TYPE_FIELD_PROTECTED_BITS (type),
2847 gdb_stdout);
2848 printf_filtered (")");
2849 print_bit_vector (TYPE_FIELD_PROTECTED_BITS (type),
2850 TYPE_NFIELDS (type));
2851 puts_filtered ("\n");
2852 }
2853 }
2854 if (TYPE_NFN_FIELDS (type) > 0)
2855 {
2856 dump_fn_fieldlists (type, spaces);
2857 }
2858 }
2859
2860 static void
2861 print_bound_type (int bt)
2862 {
2863 switch (bt)
2864 {
2865 case BOUND_CANNOT_BE_DETERMINED:
2866 printf_filtered ("(BOUND_CANNOT_BE_DETERMINED)");
2867 break;
2868 case BOUND_BY_REF_ON_STACK:
2869 printf_filtered ("(BOUND_BY_REF_ON_STACK)");
2870 break;
2871 case BOUND_BY_VALUE_ON_STACK:
2872 printf_filtered ("(BOUND_BY_VALUE_ON_STACK)");
2873 break;
2874 case BOUND_BY_REF_IN_REG:
2875 printf_filtered ("(BOUND_BY_REF_IN_REG)");
2876 break;
2877 case BOUND_BY_VALUE_IN_REG:
2878 printf_filtered ("(BOUND_BY_VALUE_IN_REG)");
2879 break;
2880 case BOUND_SIMPLE:
2881 printf_filtered ("(BOUND_SIMPLE)");
2882 break;
2883 default:
2884 printf_filtered (_("(unknown bound type)"));
2885 break;
2886 }
2887 }
2888
2889 static struct obstack dont_print_type_obstack;
2890
2891 void
2892 recursive_dump_type (struct type *type, int spaces)
2893 {
2894 int idx;
2895
2896 if (spaces == 0)
2897 obstack_begin (&dont_print_type_obstack, 0);
2898
2899 if (TYPE_NFIELDS (type) > 0
2900 || (TYPE_CPLUS_SPECIFIC (type) && TYPE_NFN_FIELDS (type) > 0))
2901 {
2902 struct type **first_dont_print
2903 = (struct type **) obstack_base (&dont_print_type_obstack);
2904
2905 int i = (struct type **)
2906 obstack_next_free (&dont_print_type_obstack) - first_dont_print;
2907
2908 while (--i >= 0)
2909 {
2910 if (type == first_dont_print[i])
2911 {
2912 printfi_filtered (spaces, "type node ");
2913 gdb_print_host_address (type, gdb_stdout);
2914 printf_filtered (_(" <same as already seen type>\n"));
2915 return;
2916 }
2917 }
2918
2919 obstack_ptr_grow (&dont_print_type_obstack, type);
2920 }
2921
2922 printfi_filtered (spaces, "type node ");
2923 gdb_print_host_address (type, gdb_stdout);
2924 printf_filtered ("\n");
2925 printfi_filtered (spaces, "name '%s' (",
2926 TYPE_NAME (type) ? TYPE_NAME (type) : "<NULL>");
2927 gdb_print_host_address (TYPE_NAME (type), gdb_stdout);
2928 printf_filtered (")\n");
2929 printfi_filtered (spaces, "tagname '%s' (",
2930 TYPE_TAG_NAME (type) ? TYPE_TAG_NAME (type) : "<NULL>");
2931 gdb_print_host_address (TYPE_TAG_NAME (type), gdb_stdout);
2932 printf_filtered (")\n");
2933 printfi_filtered (spaces, "code 0x%x ", TYPE_CODE (type));
2934 switch (TYPE_CODE (type))
2935 {
2936 case TYPE_CODE_UNDEF:
2937 printf_filtered ("(TYPE_CODE_UNDEF)");
2938 break;
2939 case TYPE_CODE_PTR:
2940 printf_filtered ("(TYPE_CODE_PTR)");
2941 break;
2942 case TYPE_CODE_ARRAY:
2943 printf_filtered ("(TYPE_CODE_ARRAY)");
2944 break;
2945 case TYPE_CODE_STRUCT:
2946 printf_filtered ("(TYPE_CODE_STRUCT)");
2947 break;
2948 case TYPE_CODE_UNION:
2949 printf_filtered ("(TYPE_CODE_UNION)");
2950 break;
2951 case TYPE_CODE_ENUM:
2952 printf_filtered ("(TYPE_CODE_ENUM)");
2953 break;
2954 case TYPE_CODE_FLAGS:
2955 printf_filtered ("(TYPE_CODE_FLAGS)");
2956 break;
2957 case TYPE_CODE_FUNC:
2958 printf_filtered ("(TYPE_CODE_FUNC)");
2959 break;
2960 case TYPE_CODE_INT:
2961 printf_filtered ("(TYPE_CODE_INT)");
2962 break;
2963 case TYPE_CODE_FLT:
2964 printf_filtered ("(TYPE_CODE_FLT)");
2965 break;
2966 case TYPE_CODE_VOID:
2967 printf_filtered ("(TYPE_CODE_VOID)");
2968 break;
2969 case TYPE_CODE_SET:
2970 printf_filtered ("(TYPE_CODE_SET)");
2971 break;
2972 case TYPE_CODE_RANGE:
2973 printf_filtered ("(TYPE_CODE_RANGE)");
2974 break;
2975 case TYPE_CODE_STRING:
2976 printf_filtered ("(TYPE_CODE_STRING)");
2977 break;
2978 case TYPE_CODE_BITSTRING:
2979 printf_filtered ("(TYPE_CODE_BITSTRING)");
2980 break;
2981 case TYPE_CODE_ERROR:
2982 printf_filtered ("(TYPE_CODE_ERROR)");
2983 break;
2984 case TYPE_CODE_MEMBERPTR:
2985 printf_filtered ("(TYPE_CODE_MEMBERPTR)");
2986 break;
2987 case TYPE_CODE_METHODPTR:
2988 printf_filtered ("(TYPE_CODE_METHODPTR)");
2989 break;
2990 case TYPE_CODE_METHOD:
2991 printf_filtered ("(TYPE_CODE_METHOD)");
2992 break;
2993 case TYPE_CODE_REF:
2994 printf_filtered ("(TYPE_CODE_REF)");
2995 break;
2996 case TYPE_CODE_CHAR:
2997 printf_filtered ("(TYPE_CODE_CHAR)");
2998 break;
2999 case TYPE_CODE_BOOL:
3000 printf_filtered ("(TYPE_CODE_BOOL)");
3001 break;
3002 case TYPE_CODE_COMPLEX:
3003 printf_filtered ("(TYPE_CODE_COMPLEX)");
3004 break;
3005 case TYPE_CODE_TYPEDEF:
3006 printf_filtered ("(TYPE_CODE_TYPEDEF)");
3007 break;
3008 case TYPE_CODE_TEMPLATE:
3009 printf_filtered ("(TYPE_CODE_TEMPLATE)");
3010 break;
3011 case TYPE_CODE_TEMPLATE_ARG:
3012 printf_filtered ("(TYPE_CODE_TEMPLATE_ARG)");
3013 break;
3014 case TYPE_CODE_NAMESPACE:
3015 printf_filtered ("(TYPE_CODE_NAMESPACE)");
3016 break;
3017 default:
3018 printf_filtered ("(UNKNOWN TYPE CODE)");
3019 break;
3020 }
3021 puts_filtered ("\n");
3022 printfi_filtered (spaces, "length %d\n", TYPE_LENGTH (type));
3023 printfi_filtered (spaces, "upper_bound_type 0x%x ",
3024 TYPE_ARRAY_UPPER_BOUND_TYPE (type));
3025 print_bound_type (TYPE_ARRAY_UPPER_BOUND_TYPE (type));
3026 puts_filtered ("\n");
3027 printfi_filtered (spaces, "lower_bound_type 0x%x ",
3028 TYPE_ARRAY_LOWER_BOUND_TYPE (type));
3029 print_bound_type (TYPE_ARRAY_LOWER_BOUND_TYPE (type));
3030 puts_filtered ("\n");
3031 printfi_filtered (spaces, "objfile ");
3032 gdb_print_host_address (TYPE_OBJFILE (type), gdb_stdout);
3033 printf_filtered ("\n");
3034 printfi_filtered (spaces, "target_type ");
3035 gdb_print_host_address (TYPE_TARGET_TYPE (type), gdb_stdout);
3036 printf_filtered ("\n");
3037 if (TYPE_TARGET_TYPE (type) != NULL)
3038 {
3039 recursive_dump_type (TYPE_TARGET_TYPE (type), spaces + 2);
3040 }
3041 printfi_filtered (spaces, "pointer_type ");
3042 gdb_print_host_address (TYPE_POINTER_TYPE (type), gdb_stdout);
3043 printf_filtered ("\n");
3044 printfi_filtered (spaces, "reference_type ");
3045 gdb_print_host_address (TYPE_REFERENCE_TYPE (type), gdb_stdout);
3046 printf_filtered ("\n");
3047 printfi_filtered (spaces, "type_chain ");
3048 gdb_print_host_address (TYPE_CHAIN (type), gdb_stdout);
3049 printf_filtered ("\n");
3050 printfi_filtered (spaces, "instance_flags 0x%x",
3051 TYPE_INSTANCE_FLAGS (type));
3052 if (TYPE_CONST (type))
3053 {
3054 puts_filtered (" TYPE_FLAG_CONST");
3055 }
3056 if (TYPE_VOLATILE (type))
3057 {
3058 puts_filtered (" TYPE_FLAG_VOLATILE");
3059 }
3060 if (TYPE_CODE_SPACE (type))
3061 {
3062 puts_filtered (" TYPE_FLAG_CODE_SPACE");
3063 }
3064 if (TYPE_DATA_SPACE (type))
3065 {
3066 puts_filtered (" TYPE_FLAG_DATA_SPACE");
3067 }
3068 if (TYPE_ADDRESS_CLASS_1 (type))
3069 {
3070 puts_filtered (" TYPE_FLAG_ADDRESS_CLASS_1");
3071 }
3072 if (TYPE_ADDRESS_CLASS_2 (type))
3073 {
3074 puts_filtered (" TYPE_FLAG_ADDRESS_CLASS_2");
3075 }
3076 puts_filtered ("\n");
3077 printfi_filtered (spaces, "flags 0x%x", TYPE_FLAGS (type));
3078 if (TYPE_UNSIGNED (type))
3079 {
3080 puts_filtered (" TYPE_FLAG_UNSIGNED");
3081 }
3082 if (TYPE_NOSIGN (type))
3083 {
3084 puts_filtered (" TYPE_FLAG_NOSIGN");
3085 }
3086 if (TYPE_STUB (type))
3087 {
3088 puts_filtered (" TYPE_FLAG_STUB");
3089 }
3090 if (TYPE_TARGET_STUB (type))
3091 {
3092 puts_filtered (" TYPE_FLAG_TARGET_STUB");
3093 }
3094 if (TYPE_STATIC (type))
3095 {
3096 puts_filtered (" TYPE_FLAG_STATIC");
3097 }
3098 if (TYPE_PROTOTYPED (type))
3099 {
3100 puts_filtered (" TYPE_FLAG_PROTOTYPED");
3101 }
3102 if (TYPE_INCOMPLETE (type))
3103 {
3104 puts_filtered (" TYPE_FLAG_INCOMPLETE");
3105 }
3106 if (TYPE_VARARGS (type))
3107 {
3108 puts_filtered (" TYPE_FLAG_VARARGS");
3109 }
3110 /* This is used for things like AltiVec registers on ppc. Gcc emits
3111 an attribute for the array type, which tells whether or not we
3112 have a vector, instead of a regular array. */
3113 if (TYPE_VECTOR (type))
3114 {
3115 puts_filtered (" TYPE_FLAG_VECTOR");
3116 }
3117 puts_filtered ("\n");
3118 printfi_filtered (spaces, "nfields %d ", TYPE_NFIELDS (type));
3119 gdb_print_host_address (TYPE_FIELDS (type), gdb_stdout);
3120 puts_filtered ("\n");
3121 for (idx = 0; idx < TYPE_NFIELDS (type); idx++)
3122 {
3123 printfi_filtered (spaces + 2,
3124 "[%d] bitpos %d bitsize %d type ",
3125 idx, TYPE_FIELD_BITPOS (type, idx),
3126 TYPE_FIELD_BITSIZE (type, idx));
3127 gdb_print_host_address (TYPE_FIELD_TYPE (type, idx), gdb_stdout);
3128 printf_filtered (" name '%s' (",
3129 TYPE_FIELD_NAME (type, idx) != NULL
3130 ? TYPE_FIELD_NAME (type, idx)
3131 : "<NULL>");
3132 gdb_print_host_address (TYPE_FIELD_NAME (type, idx), gdb_stdout);
3133 printf_filtered (")\n");
3134 if (TYPE_FIELD_TYPE (type, idx) != NULL)
3135 {
3136 recursive_dump_type (TYPE_FIELD_TYPE (type, idx), spaces + 4);
3137 }
3138 }
3139 printfi_filtered (spaces, "vptr_basetype ");
3140 gdb_print_host_address (TYPE_VPTR_BASETYPE (type), gdb_stdout);
3141 puts_filtered ("\n");
3142 if (TYPE_VPTR_BASETYPE (type) != NULL)
3143 {
3144 recursive_dump_type (TYPE_VPTR_BASETYPE (type), spaces + 2);
3145 }
3146 printfi_filtered (spaces, "vptr_fieldno %d\n",
3147 TYPE_VPTR_FIELDNO (type));
3148 switch (TYPE_CODE (type))
3149 {
3150 case TYPE_CODE_STRUCT:
3151 printfi_filtered (spaces, "cplus_stuff ");
3152 gdb_print_host_address (TYPE_CPLUS_SPECIFIC (type),
3153 gdb_stdout);
3154 puts_filtered ("\n");
3155 print_cplus_stuff (type, spaces);
3156 break;
3157
3158 case TYPE_CODE_FLT:
3159 printfi_filtered (spaces, "floatformat ");
3160 if (TYPE_FLOATFORMAT (type) == NULL)
3161 puts_filtered ("(null)");
3162 else
3163 {
3164 puts_filtered ("{ ");
3165 if (TYPE_FLOATFORMAT (type)[0] == NULL
3166 || TYPE_FLOATFORMAT (type)[0]->name == NULL)
3167 puts_filtered ("(null)");
3168 else
3169 puts_filtered (TYPE_FLOATFORMAT (type)[0]->name);
3170
3171 puts_filtered (", ");
3172 if (TYPE_FLOATFORMAT (type)[1] == NULL
3173 || TYPE_FLOATFORMAT (type)[1]->name == NULL)
3174 puts_filtered ("(null)");
3175 else
3176 puts_filtered (TYPE_FLOATFORMAT (type)[1]->name);
3177
3178 puts_filtered (" }");
3179 }
3180 puts_filtered ("\n");
3181 break;
3182
3183 default:
3184 /* We have to pick one of the union types to be able print and
3185 test the value. Pick cplus_struct_type, even though we know
3186 it isn't any particular one. */
3187 printfi_filtered (spaces, "type_specific ");
3188 gdb_print_host_address (TYPE_CPLUS_SPECIFIC (type), gdb_stdout);
3189 if (TYPE_CPLUS_SPECIFIC (type) != NULL)
3190 {
3191 printf_filtered (_(" (unknown data form)"));
3192 }
3193 printf_filtered ("\n");
3194 break;
3195
3196 }
3197 if (spaces == 0)
3198 obstack_free (&dont_print_type_obstack, NULL);
3199 }
3200
3201 /* Trivial helpers for the libiberty hash table, for mapping one
3202 type to another. */
3203
3204 struct type_pair
3205 {
3206 struct type *old, *new;
3207 };
3208
3209 static hashval_t
3210 type_pair_hash (const void *item)
3211 {
3212 const struct type_pair *pair = item;
3213 return htab_hash_pointer (pair->old);
3214 }
3215
3216 static int
3217 type_pair_eq (const void *item_lhs, const void *item_rhs)
3218 {
3219 const struct type_pair *lhs = item_lhs, *rhs = item_rhs;
3220 return lhs->old == rhs->old;
3221 }
3222
3223 /* Allocate the hash table used by copy_type_recursive to walk
3224 types without duplicates. We use OBJFILE's obstack, because
3225 OBJFILE is about to be deleted. */
3226
3227 htab_t
3228 create_copied_types_hash (struct objfile *objfile)
3229 {
3230 return htab_create_alloc_ex (1, type_pair_hash, type_pair_eq,
3231 NULL, &objfile->objfile_obstack,
3232 hashtab_obstack_allocate,
3233 dummy_obstack_deallocate);
3234 }
3235
3236 /* Recursively copy (deep copy) TYPE, if it is associated with
3237 OBJFILE. Return a new type allocated using malloc, a saved type if
3238 we have already visited TYPE (using COPIED_TYPES), or TYPE if it is
3239 not associated with OBJFILE. */
3240
3241 struct type *
3242 copy_type_recursive (struct objfile *objfile,
3243 struct type *type,
3244 htab_t copied_types)
3245 {
3246 struct type_pair *stored, pair;
3247 void **slot;
3248 struct type *new_type;
3249
3250 if (TYPE_OBJFILE (type) == NULL)
3251 return type;
3252
3253 /* This type shouldn't be pointing to any types in other objfiles;
3254 if it did, the type might disappear unexpectedly. */
3255 gdb_assert (TYPE_OBJFILE (type) == objfile);
3256
3257 pair.old = type;
3258 slot = htab_find_slot (copied_types, &pair, INSERT);
3259 if (*slot != NULL)
3260 return ((struct type_pair *) *slot)->new;
3261
3262 new_type = alloc_type (NULL);
3263
3264 /* We must add the new type to the hash table immediately, in case
3265 we encounter this type again during a recursive call below. */
3266 stored = xmalloc (sizeof (struct type_pair));
3267 stored->old = type;
3268 stored->new = new_type;
3269 *slot = stored;
3270
3271 /* Copy the common fields of types. */
3272 TYPE_CODE (new_type) = TYPE_CODE (type);
3273 TYPE_ARRAY_UPPER_BOUND_TYPE (new_type) =
3274 TYPE_ARRAY_UPPER_BOUND_TYPE (type);
3275 TYPE_ARRAY_LOWER_BOUND_TYPE (new_type) =
3276 TYPE_ARRAY_LOWER_BOUND_TYPE (type);
3277 if (TYPE_NAME (type))
3278 TYPE_NAME (new_type) = xstrdup (TYPE_NAME (type));
3279 if (TYPE_TAG_NAME (type))
3280 TYPE_TAG_NAME (new_type) = xstrdup (TYPE_TAG_NAME (type));
3281 TYPE_FLAGS (new_type) = TYPE_FLAGS (type);
3282 TYPE_VPTR_FIELDNO (new_type) = TYPE_VPTR_FIELDNO (type);
3283
3284 TYPE_INSTANCE_FLAGS (new_type) = TYPE_INSTANCE_FLAGS (type);
3285 TYPE_LENGTH (new_type) = TYPE_LENGTH (type);
3286
3287 /* Copy the fields. */
3288 TYPE_NFIELDS (new_type) = TYPE_NFIELDS (type);
3289 if (TYPE_NFIELDS (type))
3290 {
3291 int i, nfields;
3292
3293 nfields = TYPE_NFIELDS (type);
3294 TYPE_FIELDS (new_type) = xmalloc (sizeof (struct field) * nfields);
3295 for (i = 0; i < nfields; i++)
3296 {
3297 TYPE_FIELD_ARTIFICIAL (new_type, i) =
3298 TYPE_FIELD_ARTIFICIAL (type, i);
3299 TYPE_FIELD_BITSIZE (new_type, i) = TYPE_FIELD_BITSIZE (type, i);
3300 if (TYPE_FIELD_TYPE (type, i))
3301 TYPE_FIELD_TYPE (new_type, i)
3302 = copy_type_recursive (objfile, TYPE_FIELD_TYPE (type, i),
3303 copied_types);
3304 if (TYPE_FIELD_NAME (type, i))
3305 TYPE_FIELD_NAME (new_type, i) =
3306 xstrdup (TYPE_FIELD_NAME (type, i));
3307 if (TYPE_FIELD_STATIC_HAS_ADDR (type, i))
3308 SET_FIELD_PHYSADDR (TYPE_FIELD (new_type, i),
3309 TYPE_FIELD_STATIC_PHYSADDR (type, i));
3310 else if (TYPE_FIELD_STATIC (type, i))
3311 SET_FIELD_PHYSNAME (TYPE_FIELD (new_type, i),
3312 xstrdup (TYPE_FIELD_STATIC_PHYSNAME (type,
3313 i)));
3314 else
3315 {
3316 TYPE_FIELD_BITPOS (new_type, i) =
3317 TYPE_FIELD_BITPOS (type, i);
3318 TYPE_FIELD_STATIC_KIND (new_type, i) = 0;
3319 }
3320 }
3321 }
3322
3323 /* Copy pointers to other types. */
3324 if (TYPE_TARGET_TYPE (type))
3325 TYPE_TARGET_TYPE (new_type) =
3326 copy_type_recursive (objfile,
3327 TYPE_TARGET_TYPE (type),
3328 copied_types);
3329 if (TYPE_VPTR_BASETYPE (type))
3330 TYPE_VPTR_BASETYPE (new_type) =
3331 copy_type_recursive (objfile,
3332 TYPE_VPTR_BASETYPE (type),
3333 copied_types);
3334 /* Maybe copy the type_specific bits.
3335
3336 NOTE drow/2005-12-09: We do not copy the C++-specific bits like
3337 base classes and methods. There's no fundamental reason why we
3338 can't, but at the moment it is not needed. */
3339
3340 if (TYPE_CODE (type) == TYPE_CODE_FLT)
3341 TYPE_FLOATFORMAT (new_type) = TYPE_FLOATFORMAT (type);
3342 else if (TYPE_CODE (type) == TYPE_CODE_STRUCT
3343 || TYPE_CODE (type) == TYPE_CODE_UNION
3344 || TYPE_CODE (type) == TYPE_CODE_TEMPLATE
3345 || TYPE_CODE (type) == TYPE_CODE_NAMESPACE)
3346 INIT_CPLUS_SPECIFIC (new_type);
3347
3348 return new_type;
3349 }
3350
3351 static struct type *
3352 build_flt (int bit, char *name, const struct floatformat **floatformats)
3353 {
3354 struct type *t;
3355
3356 if (bit == -1)
3357 {
3358 gdb_assert (floatformats != NULL);
3359 gdb_assert (floatformats[0] != NULL && floatformats[1] != NULL);
3360 bit = floatformats[0]->totalsize;
3361 }
3362 gdb_assert (bit >= 0);
3363
3364 t = init_type (TYPE_CODE_FLT, bit / TARGET_CHAR_BIT, 0, name, NULL);
3365 TYPE_FLOATFORMAT (t) = floatformats;
3366 return t;
3367 }
3368
3369 static struct gdbarch_data *gdbtypes_data;
3370
3371 const struct builtin_type *
3372 builtin_type (struct gdbarch *gdbarch)
3373 {
3374 return gdbarch_data (gdbarch, gdbtypes_data);
3375 }
3376
3377
3378 static struct type *
3379 build_complex (int bit, char *name, struct type *target_type)
3380 {
3381 struct type *t;
3382 if (bit <= 0 || target_type == builtin_type_error)
3383 {
3384 gdb_assert (builtin_type_error != NULL);
3385 return builtin_type_error;
3386 }
3387 t = init_type (TYPE_CODE_COMPLEX, 2 * bit / TARGET_CHAR_BIT,
3388 0, name, (struct objfile *) NULL);
3389 TYPE_TARGET_TYPE (t) = target_type;
3390 return t;
3391 }
3392
3393 static void *
3394 gdbtypes_post_init (struct gdbarch *gdbarch)
3395 {
3396 struct builtin_type *builtin_type
3397 = GDBARCH_OBSTACK_ZALLOC (gdbarch, struct builtin_type);
3398
3399 builtin_type->builtin_void =
3400 init_type (TYPE_CODE_VOID, 1,
3401 0,
3402 "void", (struct objfile *) NULL);
3403 builtin_type->builtin_char =
3404 init_type (TYPE_CODE_INT, TARGET_CHAR_BIT / TARGET_CHAR_BIT,
3405 (TYPE_FLAG_NOSIGN
3406 | (gdbarch_char_signed (current_gdbarch) ?
3407 0 : TYPE_FLAG_UNSIGNED)),
3408 "char", (struct objfile *) NULL);
3409 builtin_type->builtin_true_char =
3410 init_type (TYPE_CODE_CHAR, TARGET_CHAR_BIT / TARGET_CHAR_BIT,
3411 0,
3412 "true character", (struct objfile *) NULL);
3413 builtin_type->builtin_signed_char =
3414 init_type (TYPE_CODE_INT, TARGET_CHAR_BIT / TARGET_CHAR_BIT,
3415 0,
3416 "signed char", (struct objfile *) NULL);
3417 builtin_type->builtin_unsigned_char =
3418 init_type (TYPE_CODE_INT, TARGET_CHAR_BIT / TARGET_CHAR_BIT,
3419 TYPE_FLAG_UNSIGNED,
3420 "unsigned char", (struct objfile *) NULL);
3421 builtin_type->builtin_short =
3422 init_type (TYPE_CODE_INT,
3423 gdbarch_short_bit (current_gdbarch) / TARGET_CHAR_BIT,
3424 0, "short", (struct objfile *) NULL);
3425 builtin_type->builtin_unsigned_short =
3426 init_type (TYPE_CODE_INT,
3427 gdbarch_short_bit (current_gdbarch) / TARGET_CHAR_BIT,
3428 TYPE_FLAG_UNSIGNED, "unsigned short",
3429 (struct objfile *) NULL);
3430 builtin_type->builtin_int =
3431 init_type (TYPE_CODE_INT,
3432 gdbarch_int_bit (current_gdbarch) / TARGET_CHAR_BIT,
3433 0, "int", (struct objfile *) NULL);
3434 builtin_type->builtin_unsigned_int =
3435 init_type (TYPE_CODE_INT,
3436 gdbarch_int_bit (current_gdbarch) / TARGET_CHAR_BIT,
3437 TYPE_FLAG_UNSIGNED, "unsigned int",
3438 (struct objfile *) NULL);
3439 builtin_type->builtin_long =
3440 init_type (TYPE_CODE_INT,
3441 gdbarch_long_bit (current_gdbarch) / TARGET_CHAR_BIT,
3442 0, "long", (struct objfile *) NULL);
3443 builtin_type->builtin_unsigned_long =
3444 init_type (TYPE_CODE_INT,
3445 gdbarch_long_bit (current_gdbarch) / TARGET_CHAR_BIT,
3446 TYPE_FLAG_UNSIGNED, "unsigned long",
3447 (struct objfile *) NULL);
3448 builtin_type->builtin_long_long =
3449 init_type (TYPE_CODE_INT,
3450 gdbarch_long_long_bit (current_gdbarch) / TARGET_CHAR_BIT,
3451 0, "long long", (struct objfile *) NULL);
3452 builtin_type->builtin_unsigned_long_long =
3453 init_type (TYPE_CODE_INT,
3454 gdbarch_long_long_bit (current_gdbarch) / TARGET_CHAR_BIT,
3455 TYPE_FLAG_UNSIGNED, "unsigned long long",
3456 (struct objfile *) NULL);
3457 builtin_type->builtin_float
3458 = build_flt (gdbarch_float_bit (gdbarch), "float",
3459 gdbarch_float_format (gdbarch));
3460 builtin_type->builtin_double
3461 = build_flt (gdbarch_double_bit (gdbarch), "double",
3462 gdbarch_double_format (gdbarch));
3463 builtin_type->builtin_long_double
3464 = build_flt (gdbarch_long_double_bit (gdbarch), "long double",
3465 gdbarch_long_double_format (gdbarch));
3466 builtin_type->builtin_complex
3467 = build_complex (gdbarch_float_bit (gdbarch), "complex",
3468 builtin_type->builtin_float);
3469 builtin_type->builtin_double_complex
3470 = build_complex (gdbarch_double_bit (gdbarch), "double complex",
3471 builtin_type->builtin_double);
3472 builtin_type->builtin_string =
3473 init_type (TYPE_CODE_STRING, TARGET_CHAR_BIT / TARGET_CHAR_BIT,
3474 0,
3475 "string", (struct objfile *) NULL);
3476 builtin_type->builtin_bool =
3477 init_type (TYPE_CODE_BOOL, TARGET_CHAR_BIT / TARGET_CHAR_BIT,
3478 0,
3479 "bool", (struct objfile *) NULL);
3480
3481 /* Pointer/Address types. */
3482
3483 /* NOTE: on some targets, addresses and pointers are not necessarily
3484 the same --- for example, on the D10V, pointers are 16 bits long,
3485 but addresses are 32 bits long. See doc/gdbint.texinfo,
3486 ``Pointers Are Not Always Addresses''.
3487
3488 The upshot is:
3489 - gdb's `struct type' always describes the target's
3490 representation.
3491 - gdb's `struct value' objects should always hold values in
3492 target form.
3493 - gdb's CORE_ADDR values are addresses in the unified virtual
3494 address space that the assembler and linker work with. Thus,
3495 since target_read_memory takes a CORE_ADDR as an argument, it
3496 can access any memory on the target, even if the processor has
3497 separate code and data address spaces.
3498
3499 So, for example:
3500 - If v is a value holding a D10V code pointer, its contents are
3501 in target form: a big-endian address left-shifted two bits.
3502 - If p is a D10V pointer type, TYPE_LENGTH (p) == 2, just as
3503 sizeof (void *) == 2 on the target.
3504
3505 In this context, builtin_type->CORE_ADDR is a bit odd: it's a
3506 target type for a value the target will never see. It's only
3507 used to hold the values of (typeless) linker symbols, which are
3508 indeed in the unified virtual address space. */
3509
3510 builtin_type->builtin_data_ptr =
3511 make_pointer_type (builtin_type->builtin_void, NULL);
3512 builtin_type->builtin_func_ptr =
3513 lookup_pointer_type (lookup_function_type (builtin_type->builtin_void));
3514 builtin_type->builtin_core_addr =
3515 init_type (TYPE_CODE_INT,
3516 gdbarch_addr_bit (current_gdbarch) / 8,
3517 TYPE_FLAG_UNSIGNED,
3518 "__CORE_ADDR", (struct objfile *) NULL);
3519
3520
3521 /* The following set of types is used for symbols with no
3522 debug information. */
3523 builtin_type->nodebug_text_symbol =
3524 init_type (TYPE_CODE_FUNC, 1, 0,
3525 "<text variable, no debug info>", NULL);
3526 TYPE_TARGET_TYPE (builtin_type->nodebug_text_symbol) =
3527 builtin_type->builtin_int;
3528 builtin_type->nodebug_data_symbol =
3529 init_type (TYPE_CODE_INT,
3530 gdbarch_int_bit (gdbarch) / HOST_CHAR_BIT, 0,
3531 "<data variable, no debug info>", NULL);
3532 builtin_type->nodebug_unknown_symbol =
3533 init_type (TYPE_CODE_INT, 1, 0,
3534 "<variable (not text or data), no debug info>", NULL);
3535 builtin_type->nodebug_tls_symbol =
3536 init_type (TYPE_CODE_INT,
3537 gdbarch_int_bit (gdbarch) / HOST_CHAR_BIT, 0,
3538 "<thread local variable, no debug info>", NULL);
3539
3540 return builtin_type;
3541 }
3542
3543 extern void _initialize_gdbtypes (void);
3544 void
3545 _initialize_gdbtypes (void)
3546 {
3547 gdbtypes_data = gdbarch_data_register_post_init (gdbtypes_post_init);
3548
3549 /* FIXME: The following types are architecture-neutral. However,
3550 they contain pointer_type and reference_type fields potentially
3551 caching pointer or reference types that *are* architecture
3552 dependent. */
3553
3554 builtin_type_int0 =
3555 init_type (TYPE_CODE_INT, 0 / 8,
3556 0,
3557 "int0_t", (struct objfile *) NULL);
3558 builtin_type_int8 =
3559 init_type (TYPE_CODE_INT, 8 / 8,
3560 0,
3561 "int8_t", (struct objfile *) NULL);
3562 builtin_type_uint8 =
3563 init_type (TYPE_CODE_INT, 8 / 8,
3564 TYPE_FLAG_UNSIGNED,
3565 "uint8_t", (struct objfile *) NULL);
3566 builtin_type_int16 =
3567 init_type (TYPE_CODE_INT, 16 / 8,
3568 0,
3569 "int16_t", (struct objfile *) NULL);
3570 builtin_type_uint16 =
3571 init_type (TYPE_CODE_INT, 16 / 8,
3572 TYPE_FLAG_UNSIGNED,
3573 "uint16_t", (struct objfile *) NULL);
3574 builtin_type_int32 =
3575 init_type (TYPE_CODE_INT, 32 / 8,
3576 0,
3577 "int32_t", (struct objfile *) NULL);
3578 builtin_type_uint32 =
3579 init_type (TYPE_CODE_INT, 32 / 8,
3580 TYPE_FLAG_UNSIGNED,
3581 "uint32_t", (struct objfile *) NULL);
3582 builtin_type_int64 =
3583 init_type (TYPE_CODE_INT, 64 / 8,
3584 0,
3585 "int64_t", (struct objfile *) NULL);
3586 builtin_type_uint64 =
3587 init_type (TYPE_CODE_INT, 64 / 8,
3588 TYPE_FLAG_UNSIGNED,
3589 "uint64_t", (struct objfile *) NULL);
3590 builtin_type_int128 =
3591 init_type (TYPE_CODE_INT, 128 / 8,
3592 0,
3593 "int128_t", (struct objfile *) NULL);
3594 builtin_type_uint128 =
3595 init_type (TYPE_CODE_INT, 128 / 8,
3596 TYPE_FLAG_UNSIGNED,
3597 "uint128_t", (struct objfile *) NULL);
3598
3599 builtin_type_ieee_single =
3600 build_flt (-1, "builtin_type_ieee_single", floatformats_ieee_single);
3601 builtin_type_ieee_double =
3602 build_flt (-1, "builtin_type_ieee_double", floatformats_ieee_double);
3603 builtin_type_i387_ext =
3604 build_flt (-1, "builtin_type_i387_ext", floatformats_i387_ext);
3605 builtin_type_m68881_ext =
3606 build_flt (-1, "builtin_type_m68881_ext", floatformats_m68881_ext);
3607 builtin_type_arm_ext =
3608 build_flt (-1, "builtin_type_arm_ext", floatformats_arm_ext);
3609 builtin_type_ia64_spill =
3610 build_flt (-1, "builtin_type_ia64_spill", floatformats_ia64_spill);
3611 builtin_type_ia64_quad =
3612 build_flt (-1, "builtin_type_ia64_quad", floatformats_ia64_quad);
3613
3614 add_setshow_zinteger_cmd ("overload", no_class, &overload_debug, _("\
3615 Set debugging of C++ overloading."), _("\
3616 Show debugging of C++ overloading."), _("\
3617 When enabled, ranking of the functions is displayed."),
3618 NULL,
3619 show_overload_debug,
3620 &setdebuglist, &showdebuglist);
3621
3622 /* Add user knob for controlling resolution of opaque types. */
3623 add_setshow_boolean_cmd ("opaque-type-resolution", class_support,
3624 &opaque_type_resolution, _("\
3625 Set resolution of opaque struct/class/union types (if set before loading symbols)."), _("\
3626 Show resolution of opaque struct/class/union types (if set before loading symbols)."), NULL,
3627 NULL,
3628 show_opaque_type_resolution,
3629 &setlist, &showlist);
3630 }