1 /* Perform non-arithmetic operations on values, for GDB.
3 Copyright (C) 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995,
4 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
5 2008, 2009, 2010 Free Software Foundation, Inc.
7 This file is part of GDB.
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3 of the License, or
12 (at your option) any later version.
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with this program. If not, see <http://www.gnu.org/licenses/>. */
37 #include "dictionary.h"
38 #include "cp-support.h"
40 #include "user-regs.h"
43 #include "gdb_string.h"
44 #include "gdb_assert.h"
45 #include "cp-support.h"
49 #include "exceptions.h"
51 extern int overload_debug
;
52 /* Local functions. */
54 static int typecmp (int staticp
, int varargs
, int nargs
,
55 struct field t1
[], struct value
*t2
[]);
57 static struct value
*search_struct_field (const char *, struct value
*,
58 int, struct type
*, int);
60 static struct value
*search_struct_method (const char *, struct value
**,
62 int, int *, struct type
*);
64 static int find_oload_champ_namespace (struct type
**, int,
65 const char *, const char *,
67 struct badness_vector
**,
71 int find_oload_champ_namespace_loop (struct type
**, int,
72 const char *, const char *,
73 int, struct symbol
***,
74 struct badness_vector
**, int *,
77 static int find_oload_champ (struct type
**, int, int, int,
78 struct fn_field
*, struct symbol
**,
79 struct badness_vector
**);
81 static int oload_method_static (int, struct fn_field
*, int);
83 enum oload_classification
{ STANDARD
, NON_STANDARD
, INCOMPATIBLE
};
86 oload_classification
classify_oload_match (struct badness_vector
*,
89 static struct value
*value_struct_elt_for_reference (struct type
*,
95 static struct value
*value_namespace_elt (const struct type
*,
96 char *, int , enum noside
);
98 static struct value
*value_maybe_namespace_elt (const struct type
*,
102 static CORE_ADDR
allocate_space_in_inferior (int);
104 static struct value
*cast_into_complex (struct type
*, struct value
*);
106 static struct fn_field
*find_method_list (struct value
**, const char *,
107 int, struct type
*, int *,
108 struct type
**, int *);
110 void _initialize_valops (void);
113 /* Flag for whether we want to abandon failed expression evals by
116 static int auto_abandon
= 0;
119 int overload_resolution
= 0;
121 show_overload_resolution (struct ui_file
*file
, int from_tty
,
122 struct cmd_list_element
*c
,
125 fprintf_filtered (file
, _("\
126 Overload resolution in evaluating C++ functions is %s.\n"),
130 /* Find the address of function name NAME in the inferior. If OBJF_P
131 is non-NULL, *OBJF_P will be set to the OBJFILE where the function
135 find_function_in_inferior (const char *name
, struct objfile
**objf_p
)
139 sym
= lookup_symbol (name
, 0, VAR_DOMAIN
, 0);
142 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
144 error (_("\"%s\" exists in this program but is not a function."),
149 *objf_p
= SYMBOL_SYMTAB (sym
)->objfile
;
151 return value_of_variable (sym
, NULL
);
155 struct minimal_symbol
*msymbol
=
156 lookup_minimal_symbol (name
, NULL
, NULL
);
160 struct objfile
*objfile
= msymbol_objfile (msymbol
);
161 struct gdbarch
*gdbarch
= get_objfile_arch (objfile
);
165 type
= lookup_pointer_type (builtin_type (gdbarch
)->builtin_char
);
166 type
= lookup_function_type (type
);
167 type
= lookup_pointer_type (type
);
168 maddr
= SYMBOL_VALUE_ADDRESS (msymbol
);
173 return value_from_pointer (type
, maddr
);
177 if (!target_has_execution
)
178 error (_("evaluation of this expression requires the target program to be active"));
180 error (_("evaluation of this expression requires the program to have a function \"%s\"."), name
);
185 /* Allocate NBYTES of space in the inferior using the inferior's
186 malloc and return a value that is a pointer to the allocated
190 value_allocate_space_in_inferior (int len
)
192 struct objfile
*objf
;
193 struct value
*val
= find_function_in_inferior ("malloc", &objf
);
194 struct gdbarch
*gdbarch
= get_objfile_arch (objf
);
195 struct value
*blocklen
;
197 blocklen
= value_from_longest (builtin_type (gdbarch
)->builtin_int
, len
);
198 val
= call_function_by_hand (val
, 1, &blocklen
);
199 if (value_logical_not (val
))
201 if (!target_has_execution
)
202 error (_("No memory available to program now: you need to start the target first"));
204 error (_("No memory available to program: call to malloc failed"));
210 allocate_space_in_inferior (int len
)
212 return value_as_long (value_allocate_space_in_inferior (len
));
215 /* Cast struct value VAL to type TYPE and return as a value.
216 Both type and val must be of TYPE_CODE_STRUCT or TYPE_CODE_UNION
217 for this to work. Typedef to one of the codes is permitted.
218 Returns NULL if the cast is neither an upcast nor a downcast. */
220 static struct value
*
221 value_cast_structs (struct type
*type
, struct value
*v2
)
227 gdb_assert (type
!= NULL
&& v2
!= NULL
);
229 t1
= check_typedef (type
);
230 t2
= check_typedef (value_type (v2
));
232 /* Check preconditions. */
233 gdb_assert ((TYPE_CODE (t1
) == TYPE_CODE_STRUCT
234 || TYPE_CODE (t1
) == TYPE_CODE_UNION
)
235 && !!"Precondition is that type is of STRUCT or UNION kind.");
236 gdb_assert ((TYPE_CODE (t2
) == TYPE_CODE_STRUCT
237 || TYPE_CODE (t2
) == TYPE_CODE_UNION
)
238 && !!"Precondition is that value is of STRUCT or UNION kind");
240 if (TYPE_NAME (t1
) != NULL
241 && TYPE_NAME (t2
) != NULL
242 && !strcmp (TYPE_NAME (t1
), TYPE_NAME (t2
)))
245 /* Upcasting: look in the type of the source to see if it contains the
246 type of the target as a superclass. If so, we'll need to
247 offset the pointer rather than just change its type. */
248 if (TYPE_NAME (t1
) != NULL
)
250 v
= search_struct_field (type_name_no_tag (t1
),
256 /* Downcasting: look in the type of the target to see if it contains the
257 type of the source as a superclass. If so, we'll need to
258 offset the pointer rather than just change its type. */
259 if (TYPE_NAME (t2
) != NULL
)
261 /* Try downcasting using the run-time type of the value. */
262 int full
, top
, using_enc
;
263 struct type
*real_type
;
265 real_type
= value_rtti_type (v2
, &full
, &top
, &using_enc
);
268 v
= value_full_object (v2
, real_type
, full
, top
, using_enc
);
269 v
= value_at_lazy (real_type
, value_address (v
));
271 /* We might be trying to cast to the outermost enclosing
272 type, in which case search_struct_field won't work. */
273 if (TYPE_NAME (real_type
) != NULL
274 && !strcmp (TYPE_NAME (real_type
), TYPE_NAME (t1
)))
277 v
= search_struct_field (type_name_no_tag (t2
), v
, 0, real_type
, 1);
282 /* Try downcasting using information from the destination type
283 T2. This wouldn't work properly for classes with virtual
284 bases, but those were handled above. */
285 v
= search_struct_field (type_name_no_tag (t2
),
286 value_zero (t1
, not_lval
), 0, t1
, 1);
289 /* Downcasting is possible (t1 is superclass of v2). */
290 CORE_ADDR addr2
= value_address (v2
);
292 addr2
-= value_address (v
) + value_embedded_offset (v
);
293 return value_at (type
, addr2
);
300 /* Cast one pointer or reference type to another. Both TYPE and
301 the type of ARG2 should be pointer types, or else both should be
302 reference types. Returns the new pointer or reference. */
305 value_cast_pointers (struct type
*type
, struct value
*arg2
)
307 struct type
*type1
= check_typedef (type
);
308 struct type
*type2
= check_typedef (value_type (arg2
));
309 struct type
*t1
= check_typedef (TYPE_TARGET_TYPE (type1
));
310 struct type
*t2
= check_typedef (TYPE_TARGET_TYPE (type2
));
312 if (TYPE_CODE (t1
) == TYPE_CODE_STRUCT
313 && TYPE_CODE (t2
) == TYPE_CODE_STRUCT
314 && !value_logical_not (arg2
))
318 if (TYPE_CODE (type2
) == TYPE_CODE_REF
)
319 v2
= coerce_ref (arg2
);
321 v2
= value_ind (arg2
);
322 gdb_assert (TYPE_CODE (check_typedef (value_type (v2
))) == TYPE_CODE_STRUCT
323 && !!"Why did coercion fail?");
324 v2
= value_cast_structs (t1
, v2
);
325 /* At this point we have what we can have, un-dereference if needed. */
328 struct value
*v
= value_addr (v2
);
330 deprecated_set_value_type (v
, type
);
335 /* No superclass found, just change the pointer type. */
336 arg2
= value_copy (arg2
);
337 deprecated_set_value_type (arg2
, type
);
338 set_value_enclosing_type (arg2
, type
);
339 set_value_pointed_to_offset (arg2
, 0); /* pai: chk_val */
343 /* Cast value ARG2 to type TYPE and return as a value.
344 More general than a C cast: accepts any two types of the same length,
345 and if ARG2 is an lvalue it can be cast into anything at all. */
346 /* In C++, casts may change pointer or object representations. */
349 value_cast (struct type
*type
, struct value
*arg2
)
351 enum type_code code1
;
352 enum type_code code2
;
356 int convert_to_boolean
= 0;
358 if (value_type (arg2
) == type
)
361 code1
= TYPE_CODE (check_typedef (type
));
363 /* Check if we are casting struct reference to struct reference. */
364 if (code1
== TYPE_CODE_REF
)
366 /* We dereference type; then we recurse and finally
367 we generate value of the given reference. Nothing wrong with
369 struct type
*t1
= check_typedef (type
);
370 struct type
*dereftype
= check_typedef (TYPE_TARGET_TYPE (t1
));
371 struct value
*val
= value_cast (dereftype
, arg2
);
373 return value_ref (val
);
376 code2
= TYPE_CODE (check_typedef (value_type (arg2
)));
378 if (code2
== TYPE_CODE_REF
)
379 /* We deref the value and then do the cast. */
380 return value_cast (type
, coerce_ref (arg2
));
382 CHECK_TYPEDEF (type
);
383 code1
= TYPE_CODE (type
);
384 arg2
= coerce_ref (arg2
);
385 type2
= check_typedef (value_type (arg2
));
387 /* You can't cast to a reference type. See value_cast_pointers
389 gdb_assert (code1
!= TYPE_CODE_REF
);
391 /* A cast to an undetermined-length array_type, such as
392 (TYPE [])OBJECT, is treated like a cast to (TYPE [N])OBJECT,
393 where N is sizeof(OBJECT)/sizeof(TYPE). */
394 if (code1
== TYPE_CODE_ARRAY
)
396 struct type
*element_type
= TYPE_TARGET_TYPE (type
);
397 unsigned element_length
= TYPE_LENGTH (check_typedef (element_type
));
399 if (element_length
> 0 && TYPE_ARRAY_UPPER_BOUND_IS_UNDEFINED (type
))
401 struct type
*range_type
= TYPE_INDEX_TYPE (type
);
402 int val_length
= TYPE_LENGTH (type2
);
403 LONGEST low_bound
, high_bound
, new_length
;
405 if (get_discrete_bounds (range_type
, &low_bound
, &high_bound
) < 0)
406 low_bound
= 0, high_bound
= 0;
407 new_length
= val_length
/ element_length
;
408 if (val_length
% element_length
!= 0)
409 warning (_("array element type size does not divide object size in cast"));
410 /* FIXME-type-allocation: need a way to free this type when
411 we are done with it. */
412 range_type
= create_range_type ((struct type
*) NULL
,
413 TYPE_TARGET_TYPE (range_type
),
415 new_length
+ low_bound
- 1);
416 deprecated_set_value_type (arg2
,
417 create_array_type ((struct type
*) NULL
,
424 if (current_language
->c_style_arrays
425 && TYPE_CODE (type2
) == TYPE_CODE_ARRAY
426 && !TYPE_VECTOR (type2
))
427 arg2
= value_coerce_array (arg2
);
429 if (TYPE_CODE (type2
) == TYPE_CODE_FUNC
)
430 arg2
= value_coerce_function (arg2
);
432 type2
= check_typedef (value_type (arg2
));
433 code2
= TYPE_CODE (type2
);
435 if (code1
== TYPE_CODE_COMPLEX
)
436 return cast_into_complex (type
, arg2
);
437 if (code1
== TYPE_CODE_BOOL
)
439 code1
= TYPE_CODE_INT
;
440 convert_to_boolean
= 1;
442 if (code1
== TYPE_CODE_CHAR
)
443 code1
= TYPE_CODE_INT
;
444 if (code2
== TYPE_CODE_BOOL
|| code2
== TYPE_CODE_CHAR
)
445 code2
= TYPE_CODE_INT
;
447 scalar
= (code2
== TYPE_CODE_INT
|| code2
== TYPE_CODE_FLT
448 || code2
== TYPE_CODE_DECFLOAT
|| code2
== TYPE_CODE_ENUM
449 || code2
== TYPE_CODE_RANGE
);
451 if ((code1
== TYPE_CODE_STRUCT
|| code1
== TYPE_CODE_UNION
)
452 && (code2
== TYPE_CODE_STRUCT
|| code2
== TYPE_CODE_UNION
)
453 && TYPE_NAME (type
) != 0)
455 struct value
*v
= value_cast_structs (type
, arg2
);
461 if (code1
== TYPE_CODE_FLT
&& scalar
)
462 return value_from_double (type
, value_as_double (arg2
));
463 else if (code1
== TYPE_CODE_DECFLOAT
&& scalar
)
465 enum bfd_endian byte_order
= gdbarch_byte_order (get_type_arch (type
));
466 int dec_len
= TYPE_LENGTH (type
);
469 if (code2
== TYPE_CODE_FLT
)
470 decimal_from_floating (arg2
, dec
, dec_len
, byte_order
);
471 else if (code2
== TYPE_CODE_DECFLOAT
)
472 decimal_convert (value_contents (arg2
), TYPE_LENGTH (type2
),
473 byte_order
, dec
, dec_len
, byte_order
);
475 /* The only option left is an integral type. */
476 decimal_from_integral (arg2
, dec
, dec_len
, byte_order
);
478 return value_from_decfloat (type
, dec
);
480 else if ((code1
== TYPE_CODE_INT
|| code1
== TYPE_CODE_ENUM
481 || code1
== TYPE_CODE_RANGE
)
482 && (scalar
|| code2
== TYPE_CODE_PTR
483 || code2
== TYPE_CODE_MEMBERPTR
))
487 /* When we cast pointers to integers, we mustn't use
488 gdbarch_pointer_to_address to find the address the pointer
489 represents, as value_as_long would. GDB should evaluate
490 expressions just as the compiler would --- and the compiler
491 sees a cast as a simple reinterpretation of the pointer's
493 if (code2
== TYPE_CODE_PTR
)
494 longest
= extract_unsigned_integer
495 (value_contents (arg2
), TYPE_LENGTH (type2
),
496 gdbarch_byte_order (get_type_arch (type2
)));
498 longest
= value_as_long (arg2
);
499 return value_from_longest (type
, convert_to_boolean
?
500 (LONGEST
) (longest
? 1 : 0) : longest
);
502 else if (code1
== TYPE_CODE_PTR
&& (code2
== TYPE_CODE_INT
503 || code2
== TYPE_CODE_ENUM
504 || code2
== TYPE_CODE_RANGE
))
506 /* TYPE_LENGTH (type) is the length of a pointer, but we really
507 want the length of an address! -- we are really dealing with
508 addresses (i.e., gdb representations) not pointers (i.e.,
509 target representations) here.
511 This allows things like "print *(int *)0x01000234" to work
512 without printing a misleading message -- which would
513 otherwise occur when dealing with a target having two byte
514 pointers and four byte addresses. */
516 int addr_bit
= gdbarch_addr_bit (get_type_arch (type2
));
517 LONGEST longest
= value_as_long (arg2
);
519 if (addr_bit
< sizeof (LONGEST
) * HOST_CHAR_BIT
)
521 if (longest
>= ((LONGEST
) 1 << addr_bit
)
522 || longest
<= -((LONGEST
) 1 << addr_bit
))
523 warning (_("value truncated"));
525 return value_from_longest (type
, longest
);
527 else if (code1
== TYPE_CODE_METHODPTR
&& code2
== TYPE_CODE_INT
528 && value_as_long (arg2
) == 0)
530 struct value
*result
= allocate_value (type
);
532 cplus_make_method_ptr (type
, value_contents_writeable (result
), 0, 0);
535 else if (code1
== TYPE_CODE_MEMBERPTR
&& code2
== TYPE_CODE_INT
536 && value_as_long (arg2
) == 0)
538 /* The Itanium C++ ABI represents NULL pointers to members as
539 minus one, instead of biasing the normal case. */
540 return value_from_longest (type
, -1);
542 else if (code1
== TYPE_CODE_ARRAY
&& TYPE_VECTOR (type
) && scalar
)
544 /* Widen the scalar to a vector. */
547 LONGEST low_bound
, high_bound
;
550 if (!get_array_bounds (type
, &low_bound
, &high_bound
))
551 error (_("Could not determine the vector bounds"));
553 eltype
= check_typedef (TYPE_TARGET_TYPE (type
));
554 arg2
= value_cast (eltype
, arg2
);
555 val
= allocate_value (type
);
557 for (i
= 0; i
< high_bound
- low_bound
+ 1; i
++)
559 /* Duplicate the contents of arg2 into the destination vector. */
560 memcpy (value_contents_writeable (val
) + (i
* TYPE_LENGTH (eltype
)),
561 value_contents_all (arg2
), TYPE_LENGTH (eltype
));
565 else if (TYPE_LENGTH (type
) == TYPE_LENGTH (type2
))
567 if (code1
== TYPE_CODE_PTR
&& code2
== TYPE_CODE_PTR
)
568 return value_cast_pointers (type
, arg2
);
570 arg2
= value_copy (arg2
);
571 deprecated_set_value_type (arg2
, type
);
572 set_value_enclosing_type (arg2
, type
);
573 set_value_pointed_to_offset (arg2
, 0); /* pai: chk_val */
576 else if (VALUE_LVAL (arg2
) == lval_memory
)
577 return value_at_lazy (type
, value_address (arg2
));
578 else if (code1
== TYPE_CODE_VOID
)
580 return value_zero (type
, not_lval
);
584 error (_("Invalid cast."));
589 /* The C++ reinterpret_cast operator. */
592 value_reinterpret_cast (struct type
*type
, struct value
*arg
)
594 struct value
*result
;
595 struct type
*real_type
= check_typedef (type
);
596 struct type
*arg_type
, *dest_type
;
598 enum type_code dest_code
, arg_code
;
600 /* Do reference, function, and array conversion. */
601 arg
= coerce_array (arg
);
603 /* Attempt to preserve the type the user asked for. */
606 /* If we are casting to a reference type, transform
607 reinterpret_cast<T&>(V) to *reinterpret_cast<T*>(&V). */
608 if (TYPE_CODE (real_type
) == TYPE_CODE_REF
)
611 arg
= value_addr (arg
);
612 dest_type
= lookup_pointer_type (TYPE_TARGET_TYPE (dest_type
));
613 real_type
= lookup_pointer_type (real_type
);
616 arg_type
= value_type (arg
);
618 dest_code
= TYPE_CODE (real_type
);
619 arg_code
= TYPE_CODE (arg_type
);
621 /* We can convert pointer types, or any pointer type to int, or int
623 if ((dest_code
== TYPE_CODE_PTR
&& arg_code
== TYPE_CODE_INT
)
624 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_PTR
)
625 || (dest_code
== TYPE_CODE_METHODPTR
&& arg_code
== TYPE_CODE_INT
)
626 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_METHODPTR
)
627 || (dest_code
== TYPE_CODE_MEMBERPTR
&& arg_code
== TYPE_CODE_INT
)
628 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_MEMBERPTR
)
629 || (dest_code
== arg_code
630 && (dest_code
== TYPE_CODE_PTR
631 || dest_code
== TYPE_CODE_METHODPTR
632 || dest_code
== TYPE_CODE_MEMBERPTR
)))
633 result
= value_cast (dest_type
, arg
);
635 error (_("Invalid reinterpret_cast"));
638 result
= value_cast (type
, value_ref (value_ind (result
)));
643 /* A helper for value_dynamic_cast. This implements the first of two
644 runtime checks: we iterate over all the base classes of the value's
645 class which are equal to the desired class; if only one of these
646 holds the value, then it is the answer. */
649 dynamic_cast_check_1 (struct type
*desired_type
,
650 const bfd_byte
*contents
,
652 struct type
*search_type
,
654 struct type
*arg_type
,
655 struct value
**result
)
657 int i
, result_count
= 0;
659 for (i
= 0; i
< TYPE_N_BASECLASSES (search_type
) && result_count
< 2; ++i
)
661 int offset
= baseclass_offset (search_type
, i
, contents
, address
);
664 error (_("virtual baseclass botch"));
665 if (class_types_same_p (desired_type
, TYPE_BASECLASS (search_type
, i
)))
667 if (address
+ offset
>= arg_addr
668 && address
+ offset
< arg_addr
+ TYPE_LENGTH (arg_type
))
672 *result
= value_at_lazy (TYPE_BASECLASS (search_type
, i
),
677 result_count
+= dynamic_cast_check_1 (desired_type
,
680 TYPE_BASECLASS (search_type
, i
),
689 /* A helper for value_dynamic_cast. This implements the second of two
690 runtime checks: we look for a unique public sibling class of the
691 argument's declared class. */
694 dynamic_cast_check_2 (struct type
*desired_type
,
695 const bfd_byte
*contents
,
697 struct type
*search_type
,
698 struct value
**result
)
700 int i
, result_count
= 0;
702 for (i
= 0; i
< TYPE_N_BASECLASSES (search_type
) && result_count
< 2; ++i
)
706 if (! BASETYPE_VIA_PUBLIC (search_type
, i
))
709 offset
= baseclass_offset (search_type
, i
, contents
, address
);
711 error (_("virtual baseclass botch"));
712 if (class_types_same_p (desired_type
, TYPE_BASECLASS (search_type
, i
)))
716 *result
= value_at_lazy (TYPE_BASECLASS (search_type
, i
),
720 result_count
+= dynamic_cast_check_2 (desired_type
,
723 TYPE_BASECLASS (search_type
, i
),
730 /* The C++ dynamic_cast operator. */
733 value_dynamic_cast (struct type
*type
, struct value
*arg
)
735 int full
, top
, using_enc
;
736 struct type
*resolved_type
= check_typedef (type
);
737 struct type
*arg_type
= check_typedef (value_type (arg
));
738 struct type
*class_type
, *rtti_type
;
739 struct value
*result
, *tem
, *original_arg
= arg
;
741 int is_ref
= TYPE_CODE (resolved_type
) == TYPE_CODE_REF
;
743 if (TYPE_CODE (resolved_type
) != TYPE_CODE_PTR
744 && TYPE_CODE (resolved_type
) != TYPE_CODE_REF
)
745 error (_("Argument to dynamic_cast must be a pointer or reference type"));
746 if (TYPE_CODE (TYPE_TARGET_TYPE (resolved_type
)) != TYPE_CODE_VOID
747 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type
)) != TYPE_CODE_CLASS
)
748 error (_("Argument to dynamic_cast must be pointer to class or `void *'"));
750 class_type
= check_typedef (TYPE_TARGET_TYPE (resolved_type
));
751 if (TYPE_CODE (resolved_type
) == TYPE_CODE_PTR
)
753 if (TYPE_CODE (arg_type
) != TYPE_CODE_PTR
754 && ! (TYPE_CODE (arg_type
) == TYPE_CODE_INT
755 && value_as_long (arg
) == 0))
756 error (_("Argument to dynamic_cast does not have pointer type"));
757 if (TYPE_CODE (arg_type
) == TYPE_CODE_PTR
)
759 arg_type
= check_typedef (TYPE_TARGET_TYPE (arg_type
));
760 if (TYPE_CODE (arg_type
) != TYPE_CODE_CLASS
)
761 error (_("Argument to dynamic_cast does not have pointer to class type"));
764 /* Handle NULL pointers. */
765 if (value_as_long (arg
) == 0)
766 return value_zero (type
, not_lval
);
768 arg
= value_ind (arg
);
772 if (TYPE_CODE (arg_type
) != TYPE_CODE_CLASS
)
773 error (_("Argument to dynamic_cast does not have class type"));
776 /* If the classes are the same, just return the argument. */
777 if (class_types_same_p (class_type
, arg_type
))
778 return value_cast (type
, arg
);
780 /* If the target type is a unique base class of the argument's
781 declared type, just cast it. */
782 if (is_ancestor (class_type
, arg_type
))
784 if (is_unique_ancestor (class_type
, arg
))
785 return value_cast (type
, original_arg
);
786 error (_("Ambiguous dynamic_cast"));
789 rtti_type
= value_rtti_type (arg
, &full
, &top
, &using_enc
);
791 error (_("Couldn't determine value's most derived type for dynamic_cast"));
793 /* Compute the most derived object's address. */
794 addr
= value_address (arg
);
802 addr
+= top
+ value_embedded_offset (arg
);
804 /* dynamic_cast<void *> means to return a pointer to the
805 most-derived object. */
806 if (TYPE_CODE (resolved_type
) == TYPE_CODE_PTR
807 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type
)) == TYPE_CODE_VOID
)
808 return value_at_lazy (type
, addr
);
810 tem
= value_at (type
, addr
);
812 /* The first dynamic check specified in 5.2.7. */
813 if (is_public_ancestor (arg_type
, TYPE_TARGET_TYPE (resolved_type
)))
815 if (class_types_same_p (rtti_type
, TYPE_TARGET_TYPE (resolved_type
)))
818 if (dynamic_cast_check_1 (TYPE_TARGET_TYPE (resolved_type
),
819 value_contents (tem
), value_address (tem
),
823 return value_cast (type
,
824 is_ref
? value_ref (result
) : value_addr (result
));
827 /* The second dynamic check specified in 5.2.7. */
829 if (is_public_ancestor (arg_type
, rtti_type
)
830 && dynamic_cast_check_2 (TYPE_TARGET_TYPE (resolved_type
),
831 value_contents (tem
), value_address (tem
),
832 rtti_type
, &result
) == 1)
833 return value_cast (type
,
834 is_ref
? value_ref (result
) : value_addr (result
));
836 if (TYPE_CODE (resolved_type
) == TYPE_CODE_PTR
)
837 return value_zero (type
, not_lval
);
839 error (_("dynamic_cast failed"));
842 /* Create a value of type TYPE that is zero, and return it. */
845 value_zero (struct type
*type
, enum lval_type lv
)
847 struct value
*val
= allocate_value (type
);
849 VALUE_LVAL (val
) = lv
;
853 /* Create a value of numeric type TYPE that is one, and return it. */
856 value_one (struct type
*type
, enum lval_type lv
)
858 struct type
*type1
= check_typedef (type
);
861 if (TYPE_CODE (type1
) == TYPE_CODE_DECFLOAT
)
863 enum bfd_endian byte_order
= gdbarch_byte_order (get_type_arch (type
));
866 decimal_from_string (v
, TYPE_LENGTH (type
), byte_order
, "1");
867 val
= value_from_decfloat (type
, v
);
869 else if (TYPE_CODE (type1
) == TYPE_CODE_FLT
)
871 val
= value_from_double (type
, (DOUBLEST
) 1);
873 else if (is_integral_type (type1
))
875 val
= value_from_longest (type
, (LONGEST
) 1);
877 else if (TYPE_CODE (type1
) == TYPE_CODE_ARRAY
&& TYPE_VECTOR (type1
))
879 struct type
*eltype
= check_typedef (TYPE_TARGET_TYPE (type1
));
881 LONGEST low_bound
, high_bound
;
884 if (!get_array_bounds (type1
, &low_bound
, &high_bound
))
885 error (_("Could not determine the vector bounds"));
887 val
= allocate_value (type
);
888 for (i
= 0; i
< high_bound
- low_bound
+ 1; i
++)
890 tmp
= value_one (eltype
, lv
);
891 memcpy (value_contents_writeable (val
) + i
* TYPE_LENGTH (eltype
),
892 value_contents_all (tmp
), TYPE_LENGTH (eltype
));
897 error (_("Not a numeric type."));
900 VALUE_LVAL (val
) = lv
;
904 /* Helper function for value_at, value_at_lazy, and value_at_lazy_stack. */
906 static struct value
*
907 get_value_at (struct type
*type
, CORE_ADDR addr
, int lazy
)
911 if (TYPE_CODE (check_typedef (type
)) == TYPE_CODE_VOID
)
912 error (_("Attempt to dereference a generic pointer."));
916 val
= allocate_value_lazy (type
);
920 val
= allocate_value (type
);
921 read_memory (addr
, value_contents_all_raw (val
), TYPE_LENGTH (type
));
924 VALUE_LVAL (val
) = lval_memory
;
925 set_value_address (val
, addr
);
930 /* Return a value with type TYPE located at ADDR.
932 Call value_at only if the data needs to be fetched immediately;
933 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
934 value_at_lazy instead. value_at_lazy simply records the address of
935 the data and sets the lazy-evaluation-required flag. The lazy flag
936 is tested in the value_contents macro, which is used if and when
937 the contents are actually required.
939 Note: value_at does *NOT* handle embedded offsets; perform such
940 adjustments before or after calling it. */
943 value_at (struct type
*type
, CORE_ADDR addr
)
945 return get_value_at (type
, addr
, 0);
948 /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
951 value_at_lazy (struct type
*type
, CORE_ADDR addr
)
953 return get_value_at (type
, addr
, 1);
956 /* Called only from the value_contents and value_contents_all()
957 macros, if the current data for a variable needs to be loaded into
958 value_contents(VAL). Fetches the data from the user's process, and
959 clears the lazy flag to indicate that the data in the buffer is
962 If the value is zero-length, we avoid calling read_memory, which
963 would abort. We mark the value as fetched anyway -- all 0 bytes of
966 This function returns a value because it is used in the
967 value_contents macro as part of an expression, where a void would
968 not work. The value is ignored. */
971 value_fetch_lazy (struct value
*val
)
973 gdb_assert (value_lazy (val
));
974 allocate_value_contents (val
);
975 if (value_bitsize (val
))
977 /* To read a lazy bitfield, read the entire enclosing value. This
978 prevents reading the same block of (possibly volatile) memory once
979 per bitfield. It would be even better to read only the containing
980 word, but we have no way to record that just specific bits of a
981 value have been fetched. */
982 struct type
*type
= check_typedef (value_type (val
));
983 enum bfd_endian byte_order
= gdbarch_byte_order (get_type_arch (type
));
984 struct value
*parent
= value_parent (val
);
985 LONGEST offset
= value_offset (val
);
986 LONGEST num
= unpack_bits_as_long (value_type (val
),
987 (value_contents_for_printing (parent
)
990 value_bitsize (val
));
991 int length
= TYPE_LENGTH (type
);
993 if (!value_bits_valid (val
,
994 TARGET_CHAR_BIT
* offset
+ value_bitpos (val
),
995 value_bitsize (val
)))
996 error (_("value has been optimized out"));
998 store_signed_integer (value_contents_raw (val
), length
, byte_order
, num
);
1000 else if (VALUE_LVAL (val
) == lval_memory
)
1002 CORE_ADDR addr
= value_address (val
);
1003 int length
= TYPE_LENGTH (check_typedef (value_enclosing_type (val
)));
1007 if (value_stack (val
))
1008 read_stack (addr
, value_contents_all_raw (val
), length
);
1010 read_memory (addr
, value_contents_all_raw (val
), length
);
1013 else if (VALUE_LVAL (val
) == lval_register
)
1015 struct frame_info
*frame
;
1017 struct type
*type
= check_typedef (value_type (val
));
1018 struct value
*new_val
= val
, *mark
= value_mark ();
1020 /* Offsets are not supported here; lazy register values must
1021 refer to the entire register. */
1022 gdb_assert (value_offset (val
) == 0);
1024 while (VALUE_LVAL (new_val
) == lval_register
&& value_lazy (new_val
))
1026 frame
= frame_find_by_id (VALUE_FRAME_ID (new_val
));
1027 regnum
= VALUE_REGNUM (new_val
);
1029 gdb_assert (frame
!= NULL
);
1031 /* Convertible register routines are used for multi-register
1032 values and for interpretation in different types
1033 (e.g. float or int from a double register). Lazy
1034 register values should have the register's natural type,
1035 so they do not apply. */
1036 gdb_assert (!gdbarch_convert_register_p (get_frame_arch (frame
),
1039 new_val
= get_frame_register_value (frame
, regnum
);
1042 /* If it's still lazy (for instance, a saved register on the
1043 stack), fetch it. */
1044 if (value_lazy (new_val
))
1045 value_fetch_lazy (new_val
);
1047 /* If the register was not saved, mark it unavailable. */
1048 if (value_optimized_out (new_val
))
1049 set_value_optimized_out (val
, 1);
1051 memcpy (value_contents_raw (val
), value_contents (new_val
),
1052 TYPE_LENGTH (type
));
1056 struct gdbarch
*gdbarch
;
1057 frame
= frame_find_by_id (VALUE_FRAME_ID (val
));
1058 regnum
= VALUE_REGNUM (val
);
1059 gdbarch
= get_frame_arch (frame
);
1061 fprintf_unfiltered (gdb_stdlog
, "\
1062 { value_fetch_lazy (frame=%d,regnum=%d(%s),...) ",
1063 frame_relative_level (frame
), regnum
,
1064 user_reg_map_regnum_to_name (gdbarch
, regnum
));
1066 fprintf_unfiltered (gdb_stdlog
, "->");
1067 if (value_optimized_out (new_val
))
1068 fprintf_unfiltered (gdb_stdlog
, " optimized out");
1072 const gdb_byte
*buf
= value_contents (new_val
);
1074 if (VALUE_LVAL (new_val
) == lval_register
)
1075 fprintf_unfiltered (gdb_stdlog
, " register=%d",
1076 VALUE_REGNUM (new_val
));
1077 else if (VALUE_LVAL (new_val
) == lval_memory
)
1078 fprintf_unfiltered (gdb_stdlog
, " address=%s",
1080 value_address (new_val
)));
1082 fprintf_unfiltered (gdb_stdlog
, " computed");
1084 fprintf_unfiltered (gdb_stdlog
, " bytes=");
1085 fprintf_unfiltered (gdb_stdlog
, "[");
1086 for (i
= 0; i
< register_size (gdbarch
, regnum
); i
++)
1087 fprintf_unfiltered (gdb_stdlog
, "%02x", buf
[i
]);
1088 fprintf_unfiltered (gdb_stdlog
, "]");
1091 fprintf_unfiltered (gdb_stdlog
, " }\n");
1094 /* Dispose of the intermediate values. This prevents
1095 watchpoints from trying to watch the saved frame pointer. */
1096 value_free_to_mark (mark
);
1098 else if (VALUE_LVAL (val
) == lval_computed
)
1099 value_computed_funcs (val
)->read (val
);
1101 internal_error (__FILE__
, __LINE__
, "Unexpected lazy value type.");
1103 set_value_lazy (val
, 0);
1108 /* Store the contents of FROMVAL into the location of TOVAL.
1109 Return a new value with the location of TOVAL and contents of FROMVAL. */
1112 value_assign (struct value
*toval
, struct value
*fromval
)
1116 struct frame_id old_frame
;
1118 if (!deprecated_value_modifiable (toval
))
1119 error (_("Left operand of assignment is not a modifiable lvalue."));
1121 toval
= coerce_ref (toval
);
1123 type
= value_type (toval
);
1124 if (VALUE_LVAL (toval
) != lval_internalvar
)
1125 fromval
= value_cast (type
, fromval
);
1128 /* Coerce arrays and functions to pointers, except for arrays
1129 which only live in GDB's storage. */
1130 if (!value_must_coerce_to_target (fromval
))
1131 fromval
= coerce_array (fromval
);
1134 CHECK_TYPEDEF (type
);
1136 /* Since modifying a register can trash the frame chain, and
1137 modifying memory can trash the frame cache, we save the old frame
1138 and then restore the new frame afterwards. */
1139 old_frame
= get_frame_id (deprecated_safe_get_selected_frame ());
1141 switch (VALUE_LVAL (toval
))
1143 case lval_internalvar
:
1144 set_internalvar (VALUE_INTERNALVAR (toval
), fromval
);
1145 return value_of_internalvar (get_type_arch (type
),
1146 VALUE_INTERNALVAR (toval
));
1148 case lval_internalvar_component
:
1149 set_internalvar_component (VALUE_INTERNALVAR (toval
),
1150 value_offset (toval
),
1151 value_bitpos (toval
),
1152 value_bitsize (toval
),
1158 const gdb_byte
*dest_buffer
;
1159 CORE_ADDR changed_addr
;
1161 gdb_byte buffer
[sizeof (LONGEST
)];
1163 if (value_bitsize (toval
))
1165 struct value
*parent
= value_parent (toval
);
1167 changed_addr
= value_address (parent
) + value_offset (toval
);
1168 changed_len
= (value_bitpos (toval
)
1169 + value_bitsize (toval
)
1170 + HOST_CHAR_BIT
- 1)
1173 /* If we can read-modify-write exactly the size of the
1174 containing type (e.g. short or int) then do so. This
1175 is safer for volatile bitfields mapped to hardware
1177 if (changed_len
< TYPE_LENGTH (type
)
1178 && TYPE_LENGTH (type
) <= (int) sizeof (LONGEST
)
1179 && ((LONGEST
) changed_addr
% TYPE_LENGTH (type
)) == 0)
1180 changed_len
= TYPE_LENGTH (type
);
1182 if (changed_len
> (int) sizeof (LONGEST
))
1183 error (_("Can't handle bitfields which don't fit in a %d bit word."),
1184 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
1186 read_memory (changed_addr
, buffer
, changed_len
);
1187 modify_field (type
, buffer
, value_as_long (fromval
),
1188 value_bitpos (toval
), value_bitsize (toval
));
1189 dest_buffer
= buffer
;
1193 changed_addr
= value_address (toval
);
1194 changed_len
= TYPE_LENGTH (type
);
1195 dest_buffer
= value_contents (fromval
);
1198 write_memory (changed_addr
, dest_buffer
, changed_len
);
1199 observer_notify_memory_changed (changed_addr
, changed_len
,
1206 struct frame_info
*frame
;
1207 struct gdbarch
*gdbarch
;
1210 /* Figure out which frame this is in currently. */
1211 frame
= frame_find_by_id (VALUE_FRAME_ID (toval
));
1212 value_reg
= VALUE_REGNUM (toval
);
1215 error (_("Value being assigned to is no longer active."));
1217 gdbarch
= get_frame_arch (frame
);
1218 if (gdbarch_convert_register_p (gdbarch
, VALUE_REGNUM (toval
), type
))
1220 /* If TOVAL is a special machine register requiring
1221 conversion of program values to a special raw
1223 gdbarch_value_to_register (gdbarch
, frame
,
1224 VALUE_REGNUM (toval
), type
,
1225 value_contents (fromval
));
1229 if (value_bitsize (toval
))
1231 struct value
*parent
= value_parent (toval
);
1232 int offset
= value_offset (parent
) + value_offset (toval
);
1234 gdb_byte buffer
[sizeof (LONGEST
)];
1236 changed_len
= (value_bitpos (toval
)
1237 + value_bitsize (toval
)
1238 + HOST_CHAR_BIT
- 1)
1241 if (changed_len
> (int) sizeof (LONGEST
))
1242 error (_("Can't handle bitfields which don't fit in a %d bit word."),
1243 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
1245 get_frame_register_bytes (frame
, value_reg
, offset
,
1246 changed_len
, buffer
);
1248 modify_field (type
, buffer
, value_as_long (fromval
),
1249 value_bitpos (toval
), value_bitsize (toval
));
1251 put_frame_register_bytes (frame
, value_reg
, offset
,
1252 changed_len
, buffer
);
1256 put_frame_register_bytes (frame
, value_reg
,
1257 value_offset (toval
),
1259 value_contents (fromval
));
1263 if (deprecated_register_changed_hook
)
1264 deprecated_register_changed_hook (-1);
1265 observer_notify_target_changed (¤t_target
);
1271 struct lval_funcs
*funcs
= value_computed_funcs (toval
);
1273 funcs
->write (toval
, fromval
);
1278 error (_("Left operand of assignment is not an lvalue."));
1281 /* Assigning to the stack pointer, frame pointer, and other
1282 (architecture and calling convention specific) registers may
1283 cause the frame cache to be out of date. Assigning to memory
1284 also can. We just do this on all assignments to registers or
1285 memory, for simplicity's sake; I doubt the slowdown matters. */
1286 switch (VALUE_LVAL (toval
))
1292 reinit_frame_cache ();
1294 /* Having destroyed the frame cache, restore the selected
1297 /* FIXME: cagney/2002-11-02: There has to be a better way of
1298 doing this. Instead of constantly saving/restoring the
1299 frame. Why not create a get_selected_frame() function that,
1300 having saved the selected frame's ID can automatically
1301 re-find the previously selected frame automatically. */
1304 struct frame_info
*fi
= frame_find_by_id (old_frame
);
1315 /* If the field does not entirely fill a LONGEST, then zero the sign
1316 bits. If the field is signed, and is negative, then sign
1318 if ((value_bitsize (toval
) > 0)
1319 && (value_bitsize (toval
) < 8 * (int) sizeof (LONGEST
)))
1321 LONGEST fieldval
= value_as_long (fromval
);
1322 LONGEST valmask
= (((ULONGEST
) 1) << value_bitsize (toval
)) - 1;
1324 fieldval
&= valmask
;
1325 if (!TYPE_UNSIGNED (type
)
1326 && (fieldval
& (valmask
^ (valmask
>> 1))))
1327 fieldval
|= ~valmask
;
1329 fromval
= value_from_longest (type
, fieldval
);
1332 /* The return value is a copy of TOVAL so it shares its location
1333 information, but its contents are updated from FROMVAL. This
1334 implies the returned value is not lazy, even if TOVAL was. */
1335 val
= value_copy (toval
);
1336 set_value_lazy (val
, 0);
1337 memcpy (value_contents_raw (val
), value_contents (fromval
),
1338 TYPE_LENGTH (type
));
1340 /* We copy over the enclosing type and pointed-to offset from FROMVAL
1341 in the case of pointer types. For object types, the enclosing type
1342 and embedded offset must *not* be copied: the target object refered
1343 to by TOVAL retains its original dynamic type after assignment. */
1344 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1346 set_value_enclosing_type (val
, value_enclosing_type (fromval
));
1347 set_value_pointed_to_offset (val
, value_pointed_to_offset (fromval
));
1353 /* Extend a value VAL to COUNT repetitions of its type. */
1356 value_repeat (struct value
*arg1
, int count
)
1360 if (VALUE_LVAL (arg1
) != lval_memory
)
1361 error (_("Only values in memory can be extended with '@'."));
1363 error (_("Invalid number %d of repetitions."), count
);
1365 val
= allocate_repeat_value (value_enclosing_type (arg1
), count
);
1367 read_memory (value_address (arg1
),
1368 value_contents_all_raw (val
),
1369 TYPE_LENGTH (value_enclosing_type (val
)));
1370 VALUE_LVAL (val
) = lval_memory
;
1371 set_value_address (val
, value_address (arg1
));
1377 value_of_variable (struct symbol
*var
, struct block
*b
)
1380 struct frame_info
*frame
;
1382 if (!symbol_read_needs_frame (var
))
1385 frame
= get_selected_frame (_("No frame selected."));
1388 frame
= block_innermost_frame (b
);
1391 if (BLOCK_FUNCTION (b
) && !block_inlined_p (b
)
1392 && SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b
)))
1393 error (_("No frame is currently executing in block %s."),
1394 SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b
)));
1396 error (_("No frame is currently executing in specified block"));
1400 val
= read_var_value (var
, frame
);
1402 error (_("Address of symbol \"%s\" is unknown."), SYMBOL_PRINT_NAME (var
));
1408 address_of_variable (struct symbol
*var
, struct block
*b
)
1410 struct type
*type
= SYMBOL_TYPE (var
);
1413 /* Evaluate it first; if the result is a memory address, we're fine.
1414 Lazy evaluation pays off here. */
1416 val
= value_of_variable (var
, b
);
1418 if ((VALUE_LVAL (val
) == lval_memory
&& value_lazy (val
))
1419 || TYPE_CODE (type
) == TYPE_CODE_FUNC
)
1421 CORE_ADDR addr
= value_address (val
);
1423 return value_from_pointer (lookup_pointer_type (type
), addr
);
1426 /* Not a memory address; check what the problem was. */
1427 switch (VALUE_LVAL (val
))
1431 struct frame_info
*frame
;
1432 const char *regname
;
1434 frame
= frame_find_by_id (VALUE_FRAME_ID (val
));
1437 regname
= gdbarch_register_name (get_frame_arch (frame
),
1438 VALUE_REGNUM (val
));
1439 gdb_assert (regname
&& *regname
);
1441 error (_("Address requested for identifier "
1442 "\"%s\" which is in register $%s"),
1443 SYMBOL_PRINT_NAME (var
), regname
);
1448 error (_("Can't take address of \"%s\" which isn't an lvalue."),
1449 SYMBOL_PRINT_NAME (var
));
1456 /* Return one if VAL does not live in target memory, but should in order
1457 to operate on it. Otherwise return zero. */
1460 value_must_coerce_to_target (struct value
*val
)
1462 struct type
*valtype
;
1464 /* The only lval kinds which do not live in target memory. */
1465 if (VALUE_LVAL (val
) != not_lval
1466 && VALUE_LVAL (val
) != lval_internalvar
)
1469 valtype
= check_typedef (value_type (val
));
1471 switch (TYPE_CODE (valtype
))
1473 case TYPE_CODE_ARRAY
:
1474 return TYPE_VECTOR (valtype
) ? 0 : 1;
1475 case TYPE_CODE_STRING
:
1482 /* Make sure that VAL lives in target memory if it's supposed to. For instance,
1483 strings are constructed as character arrays in GDB's storage, and this
1484 function copies them to the target. */
1487 value_coerce_to_target (struct value
*val
)
1492 if (!value_must_coerce_to_target (val
))
1495 length
= TYPE_LENGTH (check_typedef (value_type (val
)));
1496 addr
= allocate_space_in_inferior (length
);
1497 write_memory (addr
, value_contents (val
), length
);
1498 return value_at_lazy (value_type (val
), addr
);
1501 /* Given a value which is an array, return a value which is a pointer
1502 to its first element, regardless of whether or not the array has a
1503 nonzero lower bound.
1505 FIXME: A previous comment here indicated that this routine should
1506 be substracting the array's lower bound. It's not clear to me that
1507 this is correct. Given an array subscripting operation, it would
1508 certainly work to do the adjustment here, essentially computing:
1510 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
1512 However I believe a more appropriate and logical place to account
1513 for the lower bound is to do so in value_subscript, essentially
1516 (&array[0] + ((index - lowerbound) * sizeof array[0]))
1518 As further evidence consider what would happen with operations
1519 other than array subscripting, where the caller would get back a
1520 value that had an address somewhere before the actual first element
1521 of the array, and the information about the lower bound would be
1522 lost because of the coercion to pointer type.
1526 value_coerce_array (struct value
*arg1
)
1528 struct type
*type
= check_typedef (value_type (arg1
));
1530 /* If the user tries to do something requiring a pointer with an
1531 array that has not yet been pushed to the target, then this would
1532 be a good time to do so. */
1533 arg1
= value_coerce_to_target (arg1
);
1535 if (VALUE_LVAL (arg1
) != lval_memory
)
1536 error (_("Attempt to take address of value not located in memory."));
1538 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
1539 value_address (arg1
));
1542 /* Given a value which is a function, return a value which is a pointer
1546 value_coerce_function (struct value
*arg1
)
1548 struct value
*retval
;
1550 if (VALUE_LVAL (arg1
) != lval_memory
)
1551 error (_("Attempt to take address of value not located in memory."));
1553 retval
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1554 value_address (arg1
));
1558 /* Return a pointer value for the object for which ARG1 is the
1562 value_addr (struct value
*arg1
)
1565 struct type
*type
= check_typedef (value_type (arg1
));
1567 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
1569 /* Copy the value, but change the type from (T&) to (T*). We
1570 keep the same location information, which is efficient, and
1571 allows &(&X) to get the location containing the reference. */
1572 arg2
= value_copy (arg1
);
1573 deprecated_set_value_type (arg2
,
1574 lookup_pointer_type (TYPE_TARGET_TYPE (type
)));
1577 if (TYPE_CODE (type
) == TYPE_CODE_FUNC
)
1578 return value_coerce_function (arg1
);
1580 /* If this is an array that has not yet been pushed to the target,
1581 then this would be a good time to force it to memory. */
1582 arg1
= value_coerce_to_target (arg1
);
1584 if (VALUE_LVAL (arg1
) != lval_memory
)
1585 error (_("Attempt to take address of value not located in memory."));
1587 /* Get target memory address */
1588 arg2
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1589 (value_address (arg1
)
1590 + value_embedded_offset (arg1
)));
1592 /* This may be a pointer to a base subobject; so remember the
1593 full derived object's type ... */
1594 set_value_enclosing_type (arg2
,
1595 lookup_pointer_type (value_enclosing_type (arg1
)));
1596 /* ... and also the relative position of the subobject in the full
1598 set_value_pointed_to_offset (arg2
, value_embedded_offset (arg1
));
1602 /* Return a reference value for the object for which ARG1 is the
1606 value_ref (struct value
*arg1
)
1609 struct type
*type
= check_typedef (value_type (arg1
));
1611 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
1614 arg2
= value_addr (arg1
);
1615 deprecated_set_value_type (arg2
, lookup_reference_type (type
));
1619 /* Given a value of a pointer type, apply the C unary * operator to
1623 value_ind (struct value
*arg1
)
1625 struct type
*base_type
;
1628 arg1
= coerce_array (arg1
);
1630 base_type
= check_typedef (value_type (arg1
));
1632 if (VALUE_LVAL (arg1
) == lval_computed
)
1634 struct lval_funcs
*funcs
= value_computed_funcs (arg1
);
1636 if (funcs
->indirect
)
1638 struct value
*result
= funcs
->indirect (arg1
);
1645 if (TYPE_CODE (base_type
) == TYPE_CODE_PTR
)
1647 struct type
*enc_type
;
1649 /* We may be pointing to something embedded in a larger object.
1650 Get the real type of the enclosing object. */
1651 enc_type
= check_typedef (value_enclosing_type (arg1
));
1652 enc_type
= TYPE_TARGET_TYPE (enc_type
);
1654 if (TYPE_CODE (check_typedef (enc_type
)) == TYPE_CODE_FUNC
1655 || TYPE_CODE (check_typedef (enc_type
)) == TYPE_CODE_METHOD
)
1656 /* For functions, go through find_function_addr, which knows
1657 how to handle function descriptors. */
1658 arg2
= value_at_lazy (enc_type
,
1659 find_function_addr (arg1
, NULL
));
1661 /* Retrieve the enclosing object pointed to */
1662 arg2
= value_at_lazy (enc_type
,
1663 (value_as_address (arg1
)
1664 - value_pointed_to_offset (arg1
)));
1666 /* Re-adjust type. */
1667 deprecated_set_value_type (arg2
, TYPE_TARGET_TYPE (base_type
));
1668 /* Add embedding info. */
1669 set_value_enclosing_type (arg2
, enc_type
);
1670 set_value_embedded_offset (arg2
, value_pointed_to_offset (arg1
));
1672 /* We may be pointing to an object of some derived type. */
1673 arg2
= value_full_object (arg2
, NULL
, 0, 0, 0);
1677 error (_("Attempt to take contents of a non-pointer value."));
1678 return 0; /* For lint -- never reached. */
1681 /* Create a value for an array by allocating space in GDB, copying
1682 copying the data into that space, and then setting up an array
1685 The array bounds are set from LOWBOUND and HIGHBOUND, and the array
1686 is populated from the values passed in ELEMVEC.
1688 The element type of the array is inherited from the type of the
1689 first element, and all elements must have the same size (though we
1690 don't currently enforce any restriction on their types). */
1693 value_array (int lowbound
, int highbound
, struct value
**elemvec
)
1697 unsigned int typelength
;
1699 struct type
*arraytype
;
1701 /* Validate that the bounds are reasonable and that each of the
1702 elements have the same size. */
1704 nelem
= highbound
- lowbound
+ 1;
1707 error (_("bad array bounds (%d, %d)"), lowbound
, highbound
);
1709 typelength
= TYPE_LENGTH (value_enclosing_type (elemvec
[0]));
1710 for (idx
= 1; idx
< nelem
; idx
++)
1712 if (TYPE_LENGTH (value_enclosing_type (elemvec
[idx
])) != typelength
)
1714 error (_("array elements must all be the same size"));
1718 arraytype
= lookup_array_range_type (value_enclosing_type (elemvec
[0]),
1719 lowbound
, highbound
);
1721 if (!current_language
->c_style_arrays
)
1723 val
= allocate_value (arraytype
);
1724 for (idx
= 0; idx
< nelem
; idx
++)
1726 memcpy (value_contents_all_raw (val
) + (idx
* typelength
),
1727 value_contents_all (elemvec
[idx
]),
1733 /* Allocate space to store the array, and then initialize it by
1734 copying in each element. */
1736 val
= allocate_value (arraytype
);
1737 for (idx
= 0; idx
< nelem
; idx
++)
1738 memcpy (value_contents_writeable (val
) + (idx
* typelength
),
1739 value_contents_all (elemvec
[idx
]),
1745 value_cstring (char *ptr
, int len
, struct type
*char_type
)
1748 int lowbound
= current_language
->string_lower_bound
;
1749 int highbound
= len
/ TYPE_LENGTH (char_type
);
1750 struct type
*stringtype
1751 = lookup_array_range_type (char_type
, lowbound
, highbound
+ lowbound
- 1);
1753 val
= allocate_value (stringtype
);
1754 memcpy (value_contents_raw (val
), ptr
, len
);
1758 /* Create a value for a string constant by allocating space in the
1759 inferior, copying the data into that space, and returning the
1760 address with type TYPE_CODE_STRING. PTR points to the string
1761 constant data; LEN is number of characters.
1763 Note that string types are like array of char types with a lower
1764 bound of zero and an upper bound of LEN - 1. Also note that the
1765 string may contain embedded null bytes. */
1768 value_string (char *ptr
, int len
, struct type
*char_type
)
1771 int lowbound
= current_language
->string_lower_bound
;
1772 int highbound
= len
/ TYPE_LENGTH (char_type
);
1773 struct type
*stringtype
1774 = lookup_string_range_type (char_type
, lowbound
, highbound
+ lowbound
- 1);
1776 val
= allocate_value (stringtype
);
1777 memcpy (value_contents_raw (val
), ptr
, len
);
1782 value_bitstring (char *ptr
, int len
, struct type
*index_type
)
1785 struct type
*domain_type
1786 = create_range_type (NULL
, index_type
, 0, len
- 1);
1787 struct type
*type
= create_set_type (NULL
, domain_type
);
1789 TYPE_CODE (type
) = TYPE_CODE_BITSTRING
;
1790 val
= allocate_value (type
);
1791 memcpy (value_contents_raw (val
), ptr
, TYPE_LENGTH (type
));
1795 /* See if we can pass arguments in T2 to a function which takes
1796 arguments of types T1. T1 is a list of NARGS arguments, and T2 is
1797 a NULL-terminated vector. If some arguments need coercion of some
1798 sort, then the coerced values are written into T2. Return value is
1799 0 if the arguments could be matched, or the position at which they
1802 STATICP is nonzero if the T1 argument list came from a static
1803 member function. T2 will still include the ``this'' pointer, but
1806 For non-static member functions, we ignore the first argument,
1807 which is the type of the instance variable. This is because we
1808 want to handle calls with objects from derived classes. This is
1809 not entirely correct: we should actually check to make sure that a
1810 requested operation is type secure, shouldn't we? FIXME. */
1813 typecmp (int staticp
, int varargs
, int nargs
,
1814 struct field t1
[], struct value
*t2
[])
1819 internal_error (__FILE__
, __LINE__
,
1820 _("typecmp: no argument list"));
1822 /* Skip ``this'' argument if applicable. T2 will always include
1828 (i
< nargs
) && TYPE_CODE (t1
[i
].type
) != TYPE_CODE_VOID
;
1831 struct type
*tt1
, *tt2
;
1836 tt1
= check_typedef (t1
[i
].type
);
1837 tt2
= check_typedef (value_type (t2
[i
]));
1839 if (TYPE_CODE (tt1
) == TYPE_CODE_REF
1840 /* We should be doing hairy argument matching, as below. */
1841 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1
))) == TYPE_CODE (tt2
)))
1843 if (TYPE_CODE (tt2
) == TYPE_CODE_ARRAY
)
1844 t2
[i
] = value_coerce_array (t2
[i
]);
1846 t2
[i
] = value_ref (t2
[i
]);
1850 /* djb - 20000715 - Until the new type structure is in the
1851 place, and we can attempt things like implicit conversions,
1852 we need to do this so you can take something like a map<const
1853 char *>, and properly access map["hello"], because the
1854 argument to [] will be a reference to a pointer to a char,
1855 and the argument will be a pointer to a char. */
1856 while (TYPE_CODE(tt1
) == TYPE_CODE_REF
1857 || TYPE_CODE (tt1
) == TYPE_CODE_PTR
)
1859 tt1
= check_typedef( TYPE_TARGET_TYPE(tt1
) );
1861 while (TYPE_CODE(tt2
) == TYPE_CODE_ARRAY
1862 || TYPE_CODE(tt2
) == TYPE_CODE_PTR
1863 || TYPE_CODE(tt2
) == TYPE_CODE_REF
)
1865 tt2
= check_typedef (TYPE_TARGET_TYPE(tt2
));
1867 if (TYPE_CODE (tt1
) == TYPE_CODE (tt2
))
1869 /* Array to pointer is a `trivial conversion' according to the
1872 /* We should be doing much hairier argument matching (see
1873 section 13.2 of the ARM), but as a quick kludge, just check
1874 for the same type code. */
1875 if (TYPE_CODE (t1
[i
].type
) != TYPE_CODE (value_type (t2
[i
])))
1878 if (varargs
|| t2
[i
] == NULL
)
1883 /* Helper function used by value_struct_elt to recurse through
1884 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1885 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1886 TYPE. If found, return value, else return NULL.
1888 If LOOKING_FOR_BASECLASS, then instead of looking for struct
1889 fields, look for a baseclass named NAME. */
1891 static struct value
*
1892 search_struct_field (const char *name
, struct value
*arg1
, int offset
,
1893 struct type
*type
, int looking_for_baseclass
)
1898 CHECK_TYPEDEF (type
);
1899 nbases
= TYPE_N_BASECLASSES (type
);
1901 if (!looking_for_baseclass
)
1902 for (i
= TYPE_NFIELDS (type
) - 1; i
>= nbases
; i
--)
1904 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
1906 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1910 if (field_is_static (&TYPE_FIELD (type
, i
)))
1912 v
= value_static_field (type
, i
);
1914 error (_("field %s is nonexistent or has been optimized out"),
1919 v
= value_primitive_field (arg1
, offset
, i
, type
);
1921 error (_("there is no field named %s"), name
);
1927 && (t_field_name
[0] == '\0'
1928 || (TYPE_CODE (type
) == TYPE_CODE_UNION
1929 && (strcmp_iw (t_field_name
, "else") == 0))))
1931 struct type
*field_type
= TYPE_FIELD_TYPE (type
, i
);
1933 if (TYPE_CODE (field_type
) == TYPE_CODE_UNION
1934 || TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
)
1936 /* Look for a match through the fields of an anonymous
1937 union, or anonymous struct. C++ provides anonymous
1940 In the GNU Chill (now deleted from GDB)
1941 implementation of variant record types, each
1942 <alternative field> has an (anonymous) union type,
1943 each member of the union represents a <variant
1944 alternative>. Each <variant alternative> is
1945 represented as a struct, with a member for each
1949 int new_offset
= offset
;
1951 /* This is pretty gross. In G++, the offset in an
1952 anonymous union is relative to the beginning of the
1953 enclosing struct. In the GNU Chill (now deleted
1954 from GDB) implementation of variant records, the
1955 bitpos is zero in an anonymous union field, so we
1956 have to add the offset of the union here. */
1957 if (TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
1958 || (TYPE_NFIELDS (field_type
) > 0
1959 && TYPE_FIELD_BITPOS (field_type
, 0) == 0))
1960 new_offset
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
1962 v
= search_struct_field (name
, arg1
, new_offset
,
1964 looking_for_baseclass
);
1971 for (i
= 0; i
< nbases
; i
++)
1974 struct type
*basetype
= check_typedef (TYPE_BASECLASS (type
, i
));
1975 /* If we are looking for baseclasses, this is what we get when
1976 we hit them. But it could happen that the base part's member
1977 name is not yet filled in. */
1978 int found_baseclass
= (looking_for_baseclass
1979 && TYPE_BASECLASS_NAME (type
, i
) != NULL
1980 && (strcmp_iw (name
,
1981 TYPE_BASECLASS_NAME (type
,
1984 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1989 boffset
= baseclass_offset (type
, i
,
1990 value_contents (arg1
) + offset
,
1991 value_address (arg1
)
1992 + value_embedded_offset (arg1
)
1995 error (_("virtual baseclass botch"));
1997 /* The virtual base class pointer might have been clobbered
1998 by the user program. Make sure that it still points to a
1999 valid memory location. */
2001 boffset
+= value_embedded_offset (arg1
) + offset
;
2003 || boffset
>= TYPE_LENGTH (value_enclosing_type (arg1
)))
2005 CORE_ADDR base_addr
;
2007 v2
= allocate_value (basetype
);
2008 base_addr
= value_address (arg1
) + boffset
;
2009 if (target_read_memory (base_addr
,
2010 value_contents_raw (v2
),
2011 TYPE_LENGTH (basetype
)) != 0)
2012 error (_("virtual baseclass botch"));
2013 VALUE_LVAL (v2
) = lval_memory
;
2014 set_value_address (v2
, base_addr
);
2018 v2
= value_copy (arg1
);
2019 deprecated_set_value_type (v2
, basetype
);
2020 set_value_embedded_offset (v2
, boffset
);
2023 if (found_baseclass
)
2025 v
= search_struct_field (name
, v2
, 0,
2026 TYPE_BASECLASS (type
, i
),
2027 looking_for_baseclass
);
2029 else if (found_baseclass
)
2030 v
= value_primitive_field (arg1
, offset
, i
, type
);
2032 v
= search_struct_field (name
, arg1
,
2033 offset
+ TYPE_BASECLASS_BITPOS (type
,
2035 basetype
, looking_for_baseclass
);
2042 /* Helper function used by value_struct_elt to recurse through
2043 baseclasses. Look for a field NAME in ARG1. Adjust the address of
2044 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
2047 If found, return value, else if name matched and args not return
2048 (value) -1, else return NULL. */
2050 static struct value
*
2051 search_struct_method (const char *name
, struct value
**arg1p
,
2052 struct value
**args
, int offset
,
2053 int *static_memfuncp
, struct type
*type
)
2057 int name_matched
= 0;
2058 char dem_opname
[64];
2060 CHECK_TYPEDEF (type
);
2061 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
2063 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
2065 /* FIXME! May need to check for ARM demangling here */
2066 if (strncmp (t_field_name
, "__", 2) == 0 ||
2067 strncmp (t_field_name
, "op", 2) == 0 ||
2068 strncmp (t_field_name
, "type", 4) == 0)
2070 if (cplus_demangle_opname (t_field_name
, dem_opname
, DMGL_ANSI
))
2071 t_field_name
= dem_opname
;
2072 else if (cplus_demangle_opname (t_field_name
, dem_opname
, 0))
2073 t_field_name
= dem_opname
;
2075 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
2077 int j
= TYPE_FN_FIELDLIST_LENGTH (type
, i
) - 1;
2078 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
2081 check_stub_method_group (type
, i
);
2082 if (j
> 0 && args
== 0)
2083 error (_("cannot resolve overloaded method `%s': no arguments supplied"), name
);
2084 else if (j
== 0 && args
== 0)
2086 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
2093 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f
, j
),
2094 TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f
, j
)),
2095 TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f
, j
)),
2096 TYPE_FN_FIELD_ARGS (f
, j
), args
))
2098 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
2099 return value_virtual_fn_field (arg1p
, f
, j
,
2101 if (TYPE_FN_FIELD_STATIC_P (f
, j
)
2103 *static_memfuncp
= 1;
2104 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
2113 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2117 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2119 struct type
*baseclass
= check_typedef (TYPE_BASECLASS (type
, i
));
2120 const gdb_byte
*base_valaddr
;
2122 /* The virtual base class pointer might have been
2123 clobbered by the user program. Make sure that it
2124 still points to a valid memory location. */
2126 if (offset
< 0 || offset
>= TYPE_LENGTH (type
))
2128 gdb_byte
*tmp
= alloca (TYPE_LENGTH (baseclass
));
2130 if (target_read_memory (value_address (*arg1p
) + offset
,
2131 tmp
, TYPE_LENGTH (baseclass
)) != 0)
2132 error (_("virtual baseclass botch"));
2136 base_valaddr
= value_contents (*arg1p
) + offset
;
2138 base_offset
= baseclass_offset (type
, i
, base_valaddr
,
2139 value_address (*arg1p
) + offset
);
2140 if (base_offset
== -1)
2141 error (_("virtual baseclass botch"));
2145 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2147 v
= search_struct_method (name
, arg1p
, args
, base_offset
+ offset
,
2148 static_memfuncp
, TYPE_BASECLASS (type
, i
));
2149 if (v
== (struct value
*) - 1)
2155 /* FIXME-bothner: Why is this commented out? Why is it here? */
2156 /* *arg1p = arg1_tmp; */
2161 return (struct value
*) - 1;
2166 /* Given *ARGP, a value of type (pointer to a)* structure/union,
2167 extract the component named NAME from the ultimate target
2168 structure/union and return it as a value with its appropriate type.
2169 ERR is used in the error message if *ARGP's type is wrong.
2171 C++: ARGS is a list of argument types to aid in the selection of
2172 an appropriate method. Also, handle derived types.
2174 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
2175 where the truthvalue of whether the function that was resolved was
2176 a static member function or not is stored.
2178 ERR is an error message to be printed in case the field is not
2182 value_struct_elt (struct value
**argp
, struct value
**args
,
2183 const char *name
, int *static_memfuncp
, const char *err
)
2188 *argp
= coerce_array (*argp
);
2190 t
= check_typedef (value_type (*argp
));
2192 /* Follow pointers until we get to a non-pointer. */
2194 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
2196 *argp
= value_ind (*argp
);
2197 /* Don't coerce fn pointer to fn and then back again! */
2198 if (TYPE_CODE (value_type (*argp
)) != TYPE_CODE_FUNC
)
2199 *argp
= coerce_array (*argp
);
2200 t
= check_typedef (value_type (*argp
));
2203 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2204 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2205 error (_("Attempt to extract a component of a value that is not a %s."), err
);
2207 /* Assume it's not, unless we see that it is. */
2208 if (static_memfuncp
)
2209 *static_memfuncp
= 0;
2213 /* if there are no arguments ...do this... */
2215 /* Try as a field first, because if we succeed, there is less
2217 v
= search_struct_field (name
, *argp
, 0, t
, 0);
2221 /* C++: If it was not found as a data field, then try to
2222 return it as a pointer to a method. */
2223 v
= search_struct_method (name
, argp
, args
, 0,
2224 static_memfuncp
, t
);
2226 if (v
== (struct value
*) - 1)
2227 error (_("Cannot take address of method %s."), name
);
2230 if (TYPE_NFN_FIELDS (t
))
2231 error (_("There is no member or method named %s."), name
);
2233 error (_("There is no member named %s."), name
);
2238 v
= search_struct_method (name
, argp
, args
, 0,
2239 static_memfuncp
, t
);
2241 if (v
== (struct value
*) - 1)
2243 error (_("One of the arguments you tried to pass to %s could not be converted to what the function wants."), name
);
2247 /* See if user tried to invoke data as function. If so, hand it
2248 back. If it's not callable (i.e., a pointer to function),
2249 gdb should give an error. */
2250 v
= search_struct_field (name
, *argp
, 0, t
, 0);
2251 /* If we found an ordinary field, then it is not a method call.
2252 So, treat it as if it were a static member function. */
2253 if (v
&& static_memfuncp
)
2254 *static_memfuncp
= 1;
2258 throw_error (NOT_FOUND_ERROR
,
2259 _("Structure has no component named %s."), name
);
2263 /* Search through the methods of an object (and its bases) to find a
2264 specified method. Return the pointer to the fn_field list of
2265 overloaded instances.
2267 Helper function for value_find_oload_list.
2268 ARGP is a pointer to a pointer to a value (the object).
2269 METHOD is a string containing the method name.
2270 OFFSET is the offset within the value.
2271 TYPE is the assumed type of the object.
2272 NUM_FNS is the number of overloaded instances.
2273 BASETYPE is set to the actual type of the subobject where the
2275 BOFFSET is the offset of the base subobject where the method is found.
2278 static struct fn_field
*
2279 find_method_list (struct value
**argp
, const char *method
,
2280 int offset
, struct type
*type
, int *num_fns
,
2281 struct type
**basetype
, int *boffset
)
2285 CHECK_TYPEDEF (type
);
2289 /* First check in object itself. */
2290 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
2292 /* pai: FIXME What about operators and type conversions? */
2293 char *fn_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
2295 if (fn_field_name
&& (strcmp_iw (fn_field_name
, method
) == 0))
2297 int len
= TYPE_FN_FIELDLIST_LENGTH (type
, i
);
2298 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
2304 /* Resolve any stub methods. */
2305 check_stub_method_group (type
, i
);
2311 /* Not found in object, check in base subobjects. */
2312 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2316 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2318 base_offset
= value_offset (*argp
) + offset
;
2319 base_offset
= baseclass_offset (type
, i
,
2320 value_contents (*argp
) + base_offset
,
2321 value_address (*argp
) + base_offset
);
2322 if (base_offset
== -1)
2323 error (_("virtual baseclass botch"));
2325 else /* Non-virtual base, simply use bit position from debug
2328 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2330 f
= find_method_list (argp
, method
, base_offset
+ offset
,
2331 TYPE_BASECLASS (type
, i
), num_fns
,
2339 /* Return the list of overloaded methods of a specified name.
2341 ARGP is a pointer to a pointer to a value (the object).
2342 METHOD is the method name.
2343 OFFSET is the offset within the value contents.
2344 NUM_FNS is the number of overloaded instances.
2345 BASETYPE is set to the type of the base subobject that defines the
2347 BOFFSET is the offset of the base subobject which defines the method.
2351 value_find_oload_method_list (struct value
**argp
, const char *method
,
2352 int offset
, int *num_fns
,
2353 struct type
**basetype
, int *boffset
)
2357 t
= check_typedef (value_type (*argp
));
2359 /* Code snarfed from value_struct_elt. */
2360 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
2362 *argp
= value_ind (*argp
);
2363 /* Don't coerce fn pointer to fn and then back again! */
2364 if (TYPE_CODE (value_type (*argp
)) != TYPE_CODE_FUNC
)
2365 *argp
= coerce_array (*argp
);
2366 t
= check_typedef (value_type (*argp
));
2369 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2370 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2371 error (_("Attempt to extract a component of a value that is not a struct or union"));
2373 return find_method_list (argp
, method
, 0, t
, num_fns
,
2377 /* Given an array of argument types (ARGTYPES) (which includes an
2378 entry for "this" in the case of C++ methods), the number of
2379 arguments NARGS, the NAME of a function whether it's a method or
2380 not (METHOD), and the degree of laxness (LAX) in conforming to
2381 overload resolution rules in ANSI C++, find the best function that
2382 matches on the argument types according to the overload resolution
2385 METHOD can be one of three values:
2386 NON_METHOD for non-member functions.
2387 METHOD: for member functions.
2388 BOTH: used for overload resolution of operators where the
2389 candidates are expected to be either member or non member
2390 functions. In this case the first argument ARGTYPES
2391 (representing 'this') is expected to be a reference to the
2392 target object, and will be dereferenced when attempting the
2395 In the case of class methods, the parameter OBJ is an object value
2396 in which to search for overloaded methods.
2398 In the case of non-method functions, the parameter FSYM is a symbol
2399 corresponding to one of the overloaded functions.
2401 Return value is an integer: 0 -> good match, 10 -> debugger applied
2402 non-standard coercions, 100 -> incompatible.
2404 If a method is being searched for, VALP will hold the value.
2405 If a non-method is being searched for, SYMP will hold the symbol
2408 If a method is being searched for, and it is a static method,
2409 then STATICP will point to a non-zero value.
2411 If NO_ADL argument dependent lookup is disabled. This is used to prevent
2412 ADL overload candidates when performing overload resolution for a fully
2415 Note: This function does *not* check the value of
2416 overload_resolution. Caller must check it to see whether overload
2417 resolution is permitted.
2421 find_overload_match (struct type
**arg_types
, int nargs
,
2422 const char *name
, enum oload_search_type method
,
2423 int lax
, struct value
**objp
, struct symbol
*fsym
,
2424 struct value
**valp
, struct symbol
**symp
,
2425 int *staticp
, const int no_adl
)
2427 struct value
*obj
= (objp
? *objp
: NULL
);
2428 /* Index of best overloaded function. */
2429 int func_oload_champ
= -1;
2430 int method_oload_champ
= -1;
2432 /* The measure for the current best match. */
2433 struct badness_vector
*method_badness
= NULL
;
2434 struct badness_vector
*func_badness
= NULL
;
2436 struct value
*temp
= obj
;
2437 /* For methods, the list of overloaded methods. */
2438 struct fn_field
*fns_ptr
= NULL
;
2439 /* For non-methods, the list of overloaded function symbols. */
2440 struct symbol
**oload_syms
= NULL
;
2441 /* Number of overloaded instances being considered. */
2443 struct type
*basetype
= NULL
;
2446 struct cleanup
*all_cleanups
= make_cleanup (null_cleanup
, NULL
);
2448 const char *obj_type_name
= NULL
;
2449 const char *func_name
= NULL
;
2450 enum oload_classification match_quality
;
2451 enum oload_classification method_match_quality
= INCOMPATIBLE
;
2452 enum oload_classification func_match_quality
= INCOMPATIBLE
;
2454 /* Get the list of overloaded methods or functions. */
2455 if (method
== METHOD
|| method
== BOTH
)
2459 /* OBJ may be a pointer value rather than the object itself. */
2460 obj
= coerce_ref (obj
);
2461 while (TYPE_CODE (check_typedef (value_type (obj
))) == TYPE_CODE_PTR
)
2462 obj
= coerce_ref (value_ind (obj
));
2463 obj_type_name
= TYPE_NAME (value_type (obj
));
2465 /* First check whether this is a data member, e.g. a pointer to
2467 if (TYPE_CODE (check_typedef (value_type (obj
))) == TYPE_CODE_STRUCT
)
2469 *valp
= search_struct_field (name
, obj
, 0,
2470 check_typedef (value_type (obj
)), 0);
2478 /* Retrieve the list of methods with the name NAME. */
2479 fns_ptr
= value_find_oload_method_list (&temp
, name
,
2481 &basetype
, &boffset
);
2482 /* If this is a method only search, and no methods were found
2483 the search has faild. */
2484 if (method
== METHOD
&& (!fns_ptr
|| !num_fns
))
2485 error (_("Couldn't find method %s%s%s"),
2487 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2489 /* If we are dealing with stub method types, they should have
2490 been resolved by find_method_list via
2491 value_find_oload_method_list above. */
2494 gdb_assert (TYPE_DOMAIN_TYPE (fns_ptr
[0].type
) != NULL
);
2495 method_oload_champ
= find_oload_champ (arg_types
, nargs
, method
,
2497 oload_syms
, &method_badness
);
2499 method_match_quality
=
2500 classify_oload_match (method_badness
, nargs
,
2501 oload_method_static (method
, fns_ptr
,
2502 method_oload_champ
));
2504 make_cleanup (xfree
, method_badness
);
2509 if (method
== NON_METHOD
|| method
== BOTH
)
2511 const char *qualified_name
= NULL
;
2513 /* If the the overload match is being search for both
2514 as a method and non member function, the first argument
2515 must now be dereferenced. */
2517 arg_types
[0] = TYPE_TARGET_TYPE (arg_types
[0]);
2521 qualified_name
= SYMBOL_NATURAL_NAME (fsym
);
2523 /* If we have a function with a C++ name, try to extract just
2524 the function part. Do not try this for non-functions (e.g.
2525 function pointers). */
2527 && TYPE_CODE (check_typedef (SYMBOL_TYPE (fsym
))) == TYPE_CODE_FUNC
)
2531 temp
= cp_func_name (qualified_name
);
2533 /* If cp_func_name did not remove anything, the name of the
2534 symbol did not include scope or argument types - it was
2535 probably a C-style function. */
2538 make_cleanup (xfree
, temp
);
2539 if (strcmp (temp
, qualified_name
) == 0)
2549 qualified_name
= name
;
2552 /* If there was no C++ name, this must be a C-style function or
2553 not a function at all. Just return the same symbol. Do the
2554 same if cp_func_name fails for some reason. */
2555 if (func_name
== NULL
)
2561 func_oload_champ
= find_oload_champ_namespace (arg_types
, nargs
,
2568 if (func_oload_champ
>= 0)
2569 func_match_quality
= classify_oload_match (func_badness
, nargs
, 0);
2571 make_cleanup (xfree
, oload_syms
);
2572 make_cleanup (xfree
, func_badness
);
2575 /* Did we find a match ? */
2576 if (method_oload_champ
== -1 && func_oload_champ
== -1)
2577 throw_error (NOT_FOUND_ERROR
,
2578 _("No symbol \"%s\" in current context."),
2581 /* If we have found both a method match and a function
2582 match, find out which one is better, and calculate match
2584 if (method_oload_champ
>= 0 && func_oload_champ
>= 0)
2586 switch (compare_badness (func_badness
, method_badness
))
2588 case 0: /* Top two contenders are equally good. */
2589 /* FIXME: GDB does not support the general ambiguous
2590 case. All candidates should be collected and presented
2592 error (_("Ambiguous overload resolution"));
2594 case 1: /* Incomparable top contenders. */
2595 /* This is an error incompatible candidates
2596 should not have been proposed. */
2597 error (_("Internal error: incompatible overload candidates proposed"));
2599 case 2: /* Function champion. */
2600 method_oload_champ
= -1;
2601 match_quality
= func_match_quality
;
2603 case 3: /* Method champion. */
2604 func_oload_champ
= -1;
2605 match_quality
= method_match_quality
;
2608 error (_("Internal error: unexpected overload comparison result"));
2614 /* We have either a method match or a function match. */
2615 if (method_oload_champ
>= 0)
2616 match_quality
= method_match_quality
;
2618 match_quality
= func_match_quality
;
2621 if (match_quality
== INCOMPATIBLE
)
2623 if (method
== METHOD
)
2624 error (_("Cannot resolve method %s%s%s to any overloaded instance"),
2626 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2629 error (_("Cannot resolve function %s to any overloaded instance"),
2632 else if (match_quality
== NON_STANDARD
)
2634 if (method
== METHOD
)
2635 warning (_("Using non-standard conversion to match method %s%s%s to supplied arguments"),
2637 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2640 warning (_("Using non-standard conversion to match function %s to supplied arguments"),
2644 if (staticp
!= NULL
)
2645 *staticp
= oload_method_static (method
, fns_ptr
, method_oload_champ
);
2647 if (method_oload_champ
>= 0)
2649 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr
, method_oload_champ
))
2650 *valp
= value_virtual_fn_field (&temp
, fns_ptr
, method_oload_champ
,
2653 *valp
= value_fn_field (&temp
, fns_ptr
, method_oload_champ
,
2657 *symp
= oload_syms
[func_oload_champ
];
2661 struct type
*temp_type
= check_typedef (value_type (temp
));
2662 struct type
*obj_type
= check_typedef (value_type (*objp
));
2664 if (TYPE_CODE (temp_type
) != TYPE_CODE_PTR
2665 && (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
2666 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
))
2668 temp
= value_addr (temp
);
2673 do_cleanups (all_cleanups
);
2675 switch (match_quality
)
2681 default: /* STANDARD */
2686 /* Find the best overload match, searching for FUNC_NAME in namespaces
2687 contained in QUALIFIED_NAME until it either finds a good match or
2688 runs out of namespaces. It stores the overloaded functions in
2689 *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. The
2690 calling function is responsible for freeing *OLOAD_SYMS and
2691 *OLOAD_CHAMP_BV. If NO_ADL, argument dependent lookup is not
2695 find_oload_champ_namespace (struct type
**arg_types
, int nargs
,
2696 const char *func_name
,
2697 const char *qualified_name
,
2698 struct symbol
***oload_syms
,
2699 struct badness_vector
**oload_champ_bv
,
2704 find_oload_champ_namespace_loop (arg_types
, nargs
,
2707 oload_syms
, oload_champ_bv
,
2714 /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is
2715 how deep we've looked for namespaces, and the champ is stored in
2716 OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0
2717 if it isn't. Other arguments are the same as in
2718 find_oload_champ_namespace
2720 It is the caller's responsibility to free *OLOAD_SYMS and
2724 find_oload_champ_namespace_loop (struct type
**arg_types
, int nargs
,
2725 const char *func_name
,
2726 const char *qualified_name
,
2728 struct symbol
***oload_syms
,
2729 struct badness_vector
**oload_champ_bv
,
2733 int next_namespace_len
= namespace_len
;
2734 int searched_deeper
= 0;
2736 struct cleanup
*old_cleanups
;
2737 int new_oload_champ
;
2738 struct symbol
**new_oload_syms
;
2739 struct badness_vector
*new_oload_champ_bv
;
2740 char *new_namespace
;
2742 if (next_namespace_len
!= 0)
2744 gdb_assert (qualified_name
[next_namespace_len
] == ':');
2745 next_namespace_len
+= 2;
2747 next_namespace_len
+=
2748 cp_find_first_component (qualified_name
+ next_namespace_len
);
2750 /* Initialize these to values that can safely be xfree'd. */
2752 *oload_champ_bv
= NULL
;
2754 /* First, see if we have a deeper namespace we can search in.
2755 If we get a good match there, use it. */
2757 if (qualified_name
[next_namespace_len
] == ':')
2759 searched_deeper
= 1;
2761 if (find_oload_champ_namespace_loop (arg_types
, nargs
,
2762 func_name
, qualified_name
,
2764 oload_syms
, oload_champ_bv
,
2765 oload_champ
, no_adl
))
2771 /* If we reach here, either we're in the deepest namespace or we
2772 didn't find a good match in a deeper namespace. But, in the
2773 latter case, we still have a bad match in a deeper namespace;
2774 note that we might not find any match at all in the current
2775 namespace. (There's always a match in the deepest namespace,
2776 because this overload mechanism only gets called if there's a
2777 function symbol to start off with.) */
2779 old_cleanups
= make_cleanup (xfree
, *oload_syms
);
2780 make_cleanup (xfree
, *oload_champ_bv
);
2781 new_namespace
= alloca (namespace_len
+ 1);
2782 strncpy (new_namespace
, qualified_name
, namespace_len
);
2783 new_namespace
[namespace_len
] = '\0';
2784 new_oload_syms
= make_symbol_overload_list (func_name
,
2787 /* If we have reached the deepest level perform argument
2788 determined lookup. */
2789 if (!searched_deeper
&& !no_adl
)
2790 make_symbol_overload_list_adl (arg_types
, nargs
, func_name
);
2792 while (new_oload_syms
[num_fns
])
2795 new_oload_champ
= find_oload_champ (arg_types
, nargs
, 0, num_fns
,
2796 NULL
, new_oload_syms
,
2797 &new_oload_champ_bv
);
2799 /* Case 1: We found a good match. Free earlier matches (if any),
2800 and return it. Case 2: We didn't find a good match, but we're
2801 not the deepest function. Then go with the bad match that the
2802 deeper function found. Case 3: We found a bad match, and we're
2803 the deepest function. Then return what we found, even though
2804 it's a bad match. */
2806 if (new_oload_champ
!= -1
2807 && classify_oload_match (new_oload_champ_bv
, nargs
, 0) == STANDARD
)
2809 *oload_syms
= new_oload_syms
;
2810 *oload_champ
= new_oload_champ
;
2811 *oload_champ_bv
= new_oload_champ_bv
;
2812 do_cleanups (old_cleanups
);
2815 else if (searched_deeper
)
2817 xfree (new_oload_syms
);
2818 xfree (new_oload_champ_bv
);
2819 discard_cleanups (old_cleanups
);
2824 *oload_syms
= new_oload_syms
;
2825 *oload_champ
= new_oload_champ
;
2826 *oload_champ_bv
= new_oload_champ_bv
;
2827 do_cleanups (old_cleanups
);
2832 /* Look for a function to take NARGS args of types ARG_TYPES. Find
2833 the best match from among the overloaded methods or functions
2834 (depending on METHOD) given by FNS_PTR or OLOAD_SYMS, respectively.
2835 The number of methods/functions in the list is given by NUM_FNS.
2836 Return the index of the best match; store an indication of the
2837 quality of the match in OLOAD_CHAMP_BV.
2839 It is the caller's responsibility to free *OLOAD_CHAMP_BV. */
2842 find_oload_champ (struct type
**arg_types
, int nargs
, int method
,
2843 int num_fns
, struct fn_field
*fns_ptr
,
2844 struct symbol
**oload_syms
,
2845 struct badness_vector
**oload_champ_bv
)
2848 /* A measure of how good an overloaded instance is. */
2849 struct badness_vector
*bv
;
2850 /* Index of best overloaded function. */
2851 int oload_champ
= -1;
2852 /* Current ambiguity state for overload resolution. */
2853 int oload_ambiguous
= 0;
2854 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */
2856 *oload_champ_bv
= NULL
;
2858 /* Consider each candidate in turn. */
2859 for (ix
= 0; ix
< num_fns
; ix
++)
2862 int static_offset
= oload_method_static (method
, fns_ptr
, ix
);
2864 struct type
**parm_types
;
2868 nparms
= TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (fns_ptr
, ix
));
2872 /* If it's not a method, this is the proper place. */
2873 nparms
= TYPE_NFIELDS (SYMBOL_TYPE (oload_syms
[ix
]));
2876 /* Prepare array of parameter types. */
2877 parm_types
= (struct type
**)
2878 xmalloc (nparms
* (sizeof (struct type
*)));
2879 for (jj
= 0; jj
< nparms
; jj
++)
2880 parm_types
[jj
] = (method
2881 ? (TYPE_FN_FIELD_ARGS (fns_ptr
, ix
)[jj
].type
)
2882 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms
[ix
]),
2885 /* Compare parameter types to supplied argument types. Skip
2886 THIS for static methods. */
2887 bv
= rank_function (parm_types
, nparms
,
2888 arg_types
+ static_offset
,
2889 nargs
- static_offset
);
2891 if (!*oload_champ_bv
)
2893 *oload_champ_bv
= bv
;
2896 else /* See whether current candidate is better or worse than
2898 switch (compare_badness (bv
, *oload_champ_bv
))
2900 case 0: /* Top two contenders are equally good. */
2901 oload_ambiguous
= 1;
2903 case 1: /* Incomparable top contenders. */
2904 oload_ambiguous
= 2;
2906 case 2: /* New champion, record details. */
2907 *oload_champ_bv
= bv
;
2908 oload_ambiguous
= 0;
2919 fprintf_filtered (gdb_stderr
,
2920 "Overloaded method instance %s, # of parms %d\n",
2921 fns_ptr
[ix
].physname
, nparms
);
2923 fprintf_filtered (gdb_stderr
,
2924 "Overloaded function instance %s # of parms %d\n",
2925 SYMBOL_DEMANGLED_NAME (oload_syms
[ix
]),
2927 for (jj
= 0; jj
< nargs
- static_offset
; jj
++)
2928 fprintf_filtered (gdb_stderr
,
2929 "...Badness @ %d : %d\n",
2930 jj
, bv
->rank
[jj
].rank
);
2931 fprintf_filtered (gdb_stderr
,
2932 "Overload resolution champion is %d, ambiguous? %d\n",
2933 oload_champ
, oload_ambiguous
);
2940 /* Return 1 if we're looking at a static method, 0 if we're looking at
2941 a non-static method or a function that isn't a method. */
2944 oload_method_static (int method
, struct fn_field
*fns_ptr
, int index
)
2946 if (method
&& fns_ptr
&& index
>= 0
2947 && TYPE_FN_FIELD_STATIC_P (fns_ptr
, index
))
2953 /* Check how good an overload match OLOAD_CHAMP_BV represents. */
2955 static enum oload_classification
2956 classify_oload_match (struct badness_vector
*oload_champ_bv
,
2962 for (ix
= 1; ix
<= nargs
- static_offset
; ix
++)
2964 /* If this conversion is as bad as INCOMPATIBLE_TYPE_BADNESS
2965 or worse return INCOMPATIBLE. */
2966 if (compare_ranks (oload_champ_bv
->rank
[ix
],
2967 INCOMPATIBLE_TYPE_BADNESS
) <= 0)
2968 return INCOMPATIBLE
; /* Truly mismatched types. */
2969 /* Otherwise If this conversion is as bad as
2970 NS_POINTER_CONVERSION_BADNESS or worse return NON_STANDARD. */
2971 else if (compare_ranks (oload_champ_bv
->rank
[ix
],
2972 NS_POINTER_CONVERSION_BADNESS
) <= 0)
2973 return NON_STANDARD
; /* Non-standard type conversions
2977 return STANDARD
; /* Only standard conversions needed. */
2980 /* C++: return 1 is NAME is a legitimate name for the destructor of
2981 type TYPE. If TYPE does not have a destructor, or if NAME is
2982 inappropriate for TYPE, an error is signaled. */
2984 destructor_name_p (const char *name
, const struct type
*type
)
2988 char *dname
= type_name_no_tag (type
);
2989 char *cp
= strchr (dname
, '<');
2992 /* Do not compare the template part for template classes. */
2994 len
= strlen (dname
);
2997 if (strlen (name
+ 1) != len
|| strncmp (dname
, name
+ 1, len
) != 0)
2998 error (_("name of destructor must equal name of class"));
3005 /* Given TYPE, a structure/union,
3006 return 1 if the component named NAME from the ultimate target
3007 structure/union is defined, otherwise, return 0. */
3010 check_field (struct type
*type
, const char *name
)
3014 /* The type may be a stub. */
3015 CHECK_TYPEDEF (type
);
3017 for (i
= TYPE_NFIELDS (type
) - 1; i
>= TYPE_N_BASECLASSES (type
); i
--)
3019 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
3021 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
3025 /* C++: If it was not found as a data field, then try to return it
3026 as a pointer to a method. */
3028 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; --i
)
3030 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type
, i
), name
) == 0)
3034 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
3035 if (check_field (TYPE_BASECLASS (type
, i
), name
))
3041 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3042 return the appropriate member (or the address of the member, if
3043 WANT_ADDRESS). This function is used to resolve user expressions
3044 of the form "DOMAIN::NAME". For more details on what happens, see
3045 the comment before value_struct_elt_for_reference. */
3048 value_aggregate_elt (struct type
*curtype
, char *name
,
3049 struct type
*expect_type
, int want_address
,
3052 switch (TYPE_CODE (curtype
))
3054 case TYPE_CODE_STRUCT
:
3055 case TYPE_CODE_UNION
:
3056 return value_struct_elt_for_reference (curtype
, 0, curtype
,
3058 want_address
, noside
);
3059 case TYPE_CODE_NAMESPACE
:
3060 return value_namespace_elt (curtype
, name
,
3061 want_address
, noside
);
3063 internal_error (__FILE__
, __LINE__
,
3064 _("non-aggregate type in value_aggregate_elt"));
3068 /* Compares the two method/function types T1 and T2 for "equality"
3069 with respect to the the methods' parameters. If the types of the
3070 two parameter lists are the same, returns 1; 0 otherwise. This
3071 comparison may ignore any artificial parameters in T1 if
3072 SKIP_ARTIFICIAL is non-zero. This function will ALWAYS skip
3073 the first artificial parameter in T1, assumed to be a 'this' pointer.
3075 The type T2 is expected to have come from make_params (in eval.c). */
3078 compare_parameters (struct type
*t1
, struct type
*t2
, int skip_artificial
)
3082 if (TYPE_FIELD_ARTIFICIAL (t1
, 0))
3085 /* If skipping artificial fields, find the first real field
3087 if (skip_artificial
)
3089 while (start
< TYPE_NFIELDS (t1
)
3090 && TYPE_FIELD_ARTIFICIAL (t1
, start
))
3094 /* Now compare parameters */
3096 /* Special case: a method taking void. T1 will contain no
3097 non-artificial fields, and T2 will contain TYPE_CODE_VOID. */
3098 if ((TYPE_NFIELDS (t1
) - start
) == 0 && TYPE_NFIELDS (t2
) == 1
3099 && TYPE_CODE (TYPE_FIELD_TYPE (t2
, 0)) == TYPE_CODE_VOID
)
3102 if ((TYPE_NFIELDS (t1
) - start
) == TYPE_NFIELDS (t2
))
3106 for (i
= 0; i
< TYPE_NFIELDS (t2
); ++i
)
3108 if (compare_ranks (rank_one_type (TYPE_FIELD_TYPE (t1
, start
+ i
),
3109 TYPE_FIELD_TYPE (t2
, i
)),
3110 EXACT_MATCH_BADNESS
) != 0)
3120 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3121 return the address of this member as a "pointer to member" type.
3122 If INTYPE is non-null, then it will be the type of the member we
3123 are looking for. This will help us resolve "pointers to member
3124 functions". This function is used to resolve user expressions of
3125 the form "DOMAIN::NAME". */
3127 static struct value
*
3128 value_struct_elt_for_reference (struct type
*domain
, int offset
,
3129 struct type
*curtype
, char *name
,
3130 struct type
*intype
,
3134 struct type
*t
= curtype
;
3136 struct value
*v
, *result
;
3138 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
3139 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
3140 error (_("Internal error: non-aggregate type to value_struct_elt_for_reference"));
3142 for (i
= TYPE_NFIELDS (t
) - 1; i
>= TYPE_N_BASECLASSES (t
); i
--)
3144 char *t_field_name
= TYPE_FIELD_NAME (t
, i
);
3146 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
3148 if (field_is_static (&TYPE_FIELD (t
, i
)))
3150 v
= value_static_field (t
, i
);
3152 error (_("static field %s has been optimized out"),
3158 if (TYPE_FIELD_PACKED (t
, i
))
3159 error (_("pointers to bitfield members not allowed"));
3162 return value_from_longest
3163 (lookup_memberptr_type (TYPE_FIELD_TYPE (t
, i
), domain
),
3164 offset
+ (LONGEST
) (TYPE_FIELD_BITPOS (t
, i
) >> 3));
3165 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
3166 return allocate_value (TYPE_FIELD_TYPE (t
, i
));
3168 error (_("Cannot reference non-static field \"%s\""), name
);
3172 /* C++: If it was not found as a data field, then try to return it
3173 as a pointer to a method. */
3175 /* Perform all necessary dereferencing. */
3176 while (intype
&& TYPE_CODE (intype
) == TYPE_CODE_PTR
)
3177 intype
= TYPE_TARGET_TYPE (intype
);
3179 for (i
= TYPE_NFN_FIELDS (t
) - 1; i
>= 0; --i
)
3181 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (t
, i
);
3182 char dem_opname
[64];
3184 if (strncmp (t_field_name
, "__", 2) == 0
3185 || strncmp (t_field_name
, "op", 2) == 0
3186 || strncmp (t_field_name
, "type", 4) == 0)
3188 if (cplus_demangle_opname (t_field_name
,
3189 dem_opname
, DMGL_ANSI
))
3190 t_field_name
= dem_opname
;
3191 else if (cplus_demangle_opname (t_field_name
,
3193 t_field_name
= dem_opname
;
3195 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
3198 int len
= TYPE_FN_FIELDLIST_LENGTH (t
, i
);
3199 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (t
, i
);
3201 check_stub_method_group (t
, i
);
3205 for (j
= 0; j
< len
; ++j
)
3207 if (compare_parameters (TYPE_FN_FIELD_TYPE (f
, j
), intype
, 0)
3208 || compare_parameters (TYPE_FN_FIELD_TYPE (f
, j
), intype
, 1))
3213 error (_("no member function matches that type instantiation"));
3220 for (ii
= 0; ii
< TYPE_FN_FIELDLIST_LENGTH (t
, i
);
3223 /* Skip artificial methods. This is necessary if,
3224 for example, the user wants to "print
3225 subclass::subclass" with only one user-defined
3226 constructor. There is no ambiguity in this
3228 if (TYPE_FN_FIELD_ARTIFICIAL (f
, ii
))
3231 /* Desired method is ambiguous if more than one
3232 method is defined. */
3234 error (_("non-unique member `%s' requires type instantiation"), name
);
3240 if (TYPE_FN_FIELD_STATIC_P (f
, j
))
3243 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
3250 return value_addr (read_var_value (s
, 0));
3252 return read_var_value (s
, 0);
3255 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
3259 result
= allocate_value
3260 (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
3261 cplus_make_method_ptr (value_type (result
),
3262 value_contents_writeable (result
),
3263 TYPE_FN_FIELD_VOFFSET (f
, j
), 1);
3265 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
3266 return allocate_value (TYPE_FN_FIELD_TYPE (f
, j
));
3268 error (_("Cannot reference virtual member function \"%s\""),
3274 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
3280 v
= read_var_value (s
, 0);
3285 result
= allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
3286 cplus_make_method_ptr (value_type (result
),
3287 value_contents_writeable (result
),
3288 value_address (v
), 0);
3294 for (i
= TYPE_N_BASECLASSES (t
) - 1; i
>= 0; i
--)
3299 if (BASETYPE_VIA_VIRTUAL (t
, i
))
3302 base_offset
= TYPE_BASECLASS_BITPOS (t
, i
) / 8;
3303 v
= value_struct_elt_for_reference (domain
,
3304 offset
+ base_offset
,
3305 TYPE_BASECLASS (t
, i
),
3307 want_address
, noside
);
3312 /* As a last chance, pretend that CURTYPE is a namespace, and look
3313 it up that way; this (frequently) works for types nested inside
3316 return value_maybe_namespace_elt (curtype
, name
,
3317 want_address
, noside
);
3320 /* C++: Return the member NAME of the namespace given by the type
3323 static struct value
*
3324 value_namespace_elt (const struct type
*curtype
,
3325 char *name
, int want_address
,
3328 struct value
*retval
= value_maybe_namespace_elt (curtype
, name
,
3333 error (_("No symbol \"%s\" in namespace \"%s\"."),
3334 name
, TYPE_TAG_NAME (curtype
));
3339 /* A helper function used by value_namespace_elt and
3340 value_struct_elt_for_reference. It looks up NAME inside the
3341 context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE
3342 is a class and NAME refers to a type in CURTYPE itself (as opposed
3343 to, say, some base class of CURTYPE). */
3345 static struct value
*
3346 value_maybe_namespace_elt (const struct type
*curtype
,
3347 char *name
, int want_address
,
3350 const char *namespace_name
= TYPE_TAG_NAME (curtype
);
3352 struct value
*result
;
3354 sym
= cp_lookup_symbol_namespace (namespace_name
, name
,
3355 get_selected_block (0), VAR_DOMAIN
);
3359 char *concatenated_name
= alloca (strlen (namespace_name
) + 2
3360 + strlen (name
) + 1);
3362 sprintf (concatenated_name
, "%s::%s", namespace_name
, name
);
3363 sym
= lookup_static_symbol_aux (concatenated_name
, VAR_DOMAIN
);
3368 else if ((noside
== EVAL_AVOID_SIDE_EFFECTS
)
3369 && (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
))
3370 result
= allocate_value (SYMBOL_TYPE (sym
));
3372 result
= value_of_variable (sym
, get_selected_block (0));
3374 if (result
&& want_address
)
3375 result
= value_addr (result
);
3380 /* Given a pointer value V, find the real (RTTI) type of the object it
3383 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
3384 and refer to the values computed for the object pointed to. */
3387 value_rtti_target_type (struct value
*v
, int *full
,
3388 int *top
, int *using_enc
)
3390 struct value
*target
;
3392 target
= value_ind (v
);
3394 return value_rtti_type (target
, full
, top
, using_enc
);
3397 /* Given a value pointed to by ARGP, check its real run-time type, and
3398 if that is different from the enclosing type, create a new value
3399 using the real run-time type as the enclosing type (and of the same
3400 type as ARGP) and return it, with the embedded offset adjusted to
3401 be the correct offset to the enclosed object. RTYPE is the type,
3402 and XFULL, XTOP, and XUSING_ENC are the other parameters, computed
3403 by value_rtti_type(). If these are available, they can be supplied
3404 and a second call to value_rtti_type() is avoided. (Pass RTYPE ==
3405 NULL if they're not available. */
3408 value_full_object (struct value
*argp
,
3410 int xfull
, int xtop
,
3413 struct type
*real_type
;
3417 struct value
*new_val
;
3424 using_enc
= xusing_enc
;
3427 real_type
= value_rtti_type (argp
, &full
, &top
, &using_enc
);
3429 /* If no RTTI data, or if object is already complete, do nothing. */
3430 if (!real_type
|| real_type
== value_enclosing_type (argp
))
3433 /* If we have the full object, but for some reason the enclosing
3434 type is wrong, set it. */
3435 /* pai: FIXME -- sounds iffy */
3438 argp
= value_copy (argp
);
3439 set_value_enclosing_type (argp
, real_type
);
3443 /* Check if object is in memory */
3444 if (VALUE_LVAL (argp
) != lval_memory
)
3446 warning (_("Couldn't retrieve complete object of RTTI type %s; object may be in register(s)."),
3447 TYPE_NAME (real_type
));
3452 /* All other cases -- retrieve the complete object. */
3453 /* Go back by the computed top_offset from the beginning of the
3454 object, adjusting for the embedded offset of argp if that's what
3455 value_rtti_type used for its computation. */
3456 new_val
= value_at_lazy (real_type
, value_address (argp
) - top
+
3457 (using_enc
? 0 : value_embedded_offset (argp
)));
3458 deprecated_set_value_type (new_val
, value_type (argp
));
3459 set_value_embedded_offset (new_val
, (using_enc
3460 ? top
+ value_embedded_offset (argp
)
3466 /* Return the value of the local variable, if one exists.
3467 Flag COMPLAIN signals an error if the request is made in an
3468 inappropriate context. */
3471 value_of_local (const char *name
, int complain
)
3473 struct symbol
*func
, *sym
;
3476 struct frame_info
*frame
;
3479 frame
= get_selected_frame (_("no frame selected"));
3482 frame
= deprecated_safe_get_selected_frame ();
3487 func
= get_frame_function (frame
);
3491 error (_("no `%s' in nameless context"), name
);
3496 b
= SYMBOL_BLOCK_VALUE (func
);
3497 if (dict_empty (BLOCK_DICT (b
)))
3500 error (_("no args, no `%s'"), name
);
3505 /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER
3506 symbol instead of the LOC_ARG one (if both exist). */
3507 sym
= lookup_block_symbol (b
, name
, VAR_DOMAIN
);
3511 error (_("current stack frame does not contain a variable named `%s'"),
3517 ret
= read_var_value (sym
, frame
);
3518 if (ret
== 0 && complain
)
3519 error (_("`%s' argument unreadable"), name
);
3523 /* C++/Objective-C: return the value of the class instance variable,
3524 if one exists. Flag COMPLAIN signals an error if the request is
3525 made in an inappropriate context. */
3528 value_of_this (int complain
)
3530 if (!current_language
->la_name_of_this
)
3532 return value_of_local (current_language
->la_name_of_this
, complain
);
3535 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH
3536 elements long, starting at LOWBOUND. The result has the same lower
3537 bound as the original ARRAY. */
3540 value_slice (struct value
*array
, int lowbound
, int length
)
3542 struct type
*slice_range_type
, *slice_type
, *range_type
;
3543 LONGEST lowerbound
, upperbound
;
3544 struct value
*slice
;
3545 struct type
*array_type
;
3547 array_type
= check_typedef (value_type (array
));
3548 if (TYPE_CODE (array_type
) != TYPE_CODE_ARRAY
3549 && TYPE_CODE (array_type
) != TYPE_CODE_STRING
3550 && TYPE_CODE (array_type
) != TYPE_CODE_BITSTRING
)
3551 error (_("cannot take slice of non-array"));
3553 range_type
= TYPE_INDEX_TYPE (array_type
);
3554 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
3555 error (_("slice from bad array or bitstring"));
3557 if (lowbound
< lowerbound
|| length
< 0
3558 || lowbound
+ length
- 1 > upperbound
)
3559 error (_("slice out of range"));
3561 /* FIXME-type-allocation: need a way to free this type when we are
3563 slice_range_type
= create_range_type ((struct type
*) NULL
,
3564 TYPE_TARGET_TYPE (range_type
),
3566 lowbound
+ length
- 1);
3567 if (TYPE_CODE (array_type
) == TYPE_CODE_BITSTRING
)
3571 slice_type
= create_set_type ((struct type
*) NULL
,
3573 TYPE_CODE (slice_type
) = TYPE_CODE_BITSTRING
;
3574 slice
= value_zero (slice_type
, not_lval
);
3576 for (i
= 0; i
< length
; i
++)
3578 int element
= value_bit_index (array_type
,
3579 value_contents (array
),
3583 error (_("internal error accessing bitstring"));
3584 else if (element
> 0)
3586 int j
= i
% TARGET_CHAR_BIT
;
3588 if (gdbarch_bits_big_endian (get_type_arch (array_type
)))
3589 j
= TARGET_CHAR_BIT
- 1 - j
;
3590 value_contents_raw (slice
)[i
/ TARGET_CHAR_BIT
] |= (1 << j
);
3593 /* We should set the address, bitssize, and bitspos, so the
3594 slice can be used on the LHS, but that may require extensions
3595 to value_assign. For now, just leave as a non_lval.
3600 struct type
*element_type
= TYPE_TARGET_TYPE (array_type
);
3602 (lowbound
- lowerbound
) * TYPE_LENGTH (check_typedef (element_type
));
3604 slice_type
= create_array_type ((struct type
*) NULL
,
3607 TYPE_CODE (slice_type
) = TYPE_CODE (array_type
);
3609 if (VALUE_LVAL (array
) == lval_memory
&& value_lazy (array
))
3610 slice
= allocate_value_lazy (slice_type
);
3613 slice
= allocate_value (slice_type
);
3614 memcpy (value_contents_writeable (slice
),
3615 value_contents (array
) + offset
,
3616 TYPE_LENGTH (slice_type
));
3619 set_value_component_location (slice
, array
);
3620 VALUE_FRAME_ID (slice
) = VALUE_FRAME_ID (array
);
3621 set_value_offset (slice
, value_offset (array
) + offset
);
3626 /* Create a value for a FORTRAN complex number. Currently most of the
3627 time values are coerced to COMPLEX*16 (i.e. a complex number
3628 composed of 2 doubles. This really should be a smarter routine
3629 that figures out precision inteligently as opposed to assuming
3630 doubles. FIXME: fmb */
3633 value_literal_complex (struct value
*arg1
,
3638 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3640 val
= allocate_value (type
);
3641 arg1
= value_cast (real_type
, arg1
);
3642 arg2
= value_cast (real_type
, arg2
);
3644 memcpy (value_contents_raw (val
),
3645 value_contents (arg1
), TYPE_LENGTH (real_type
));
3646 memcpy (value_contents_raw (val
) + TYPE_LENGTH (real_type
),
3647 value_contents (arg2
), TYPE_LENGTH (real_type
));
3651 /* Cast a value into the appropriate complex data type. */
3653 static struct value
*
3654 cast_into_complex (struct type
*type
, struct value
*val
)
3656 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3658 if (TYPE_CODE (value_type (val
)) == TYPE_CODE_COMPLEX
)
3660 struct type
*val_real_type
= TYPE_TARGET_TYPE (value_type (val
));
3661 struct value
*re_val
= allocate_value (val_real_type
);
3662 struct value
*im_val
= allocate_value (val_real_type
);
3664 memcpy (value_contents_raw (re_val
),
3665 value_contents (val
), TYPE_LENGTH (val_real_type
));
3666 memcpy (value_contents_raw (im_val
),
3667 value_contents (val
) + TYPE_LENGTH (val_real_type
),
3668 TYPE_LENGTH (val_real_type
));
3670 return value_literal_complex (re_val
, im_val
, type
);
3672 else if (TYPE_CODE (value_type (val
)) == TYPE_CODE_FLT
3673 || TYPE_CODE (value_type (val
)) == TYPE_CODE_INT
)
3674 return value_literal_complex (val
,
3675 value_zero (real_type
, not_lval
),
3678 error (_("cannot cast non-number to complex"));
3682 _initialize_valops (void)
3684 add_setshow_boolean_cmd ("overload-resolution", class_support
,
3685 &overload_resolution
, _("\
3686 Set overload resolution in evaluating C++ functions."), _("\
3687 Show overload resolution in evaluating C++ functions."),
3689 show_overload_resolution
,
3690 &setlist
, &showlist
);
3691 overload_resolution
= 1;