1 /* Perform non-arithmetic operations on values, for GDB.
3 Copyright (C) 1986-2012 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
35 #include "dictionary.h"
36 #include "cp-support.h"
38 #include "user-regs.h"
39 #include "tracepoint.h"
41 #include "gdb_string.h"
42 #include "gdb_assert.h"
43 #include "cp-support.h"
47 #include "exceptions.h"
49 extern unsigned int overload_debug
;
50 /* Local functions. */
52 static int typecmp (int staticp
, int varargs
, int nargs
,
53 struct field t1
[], struct value
*t2
[]);
55 static struct value
*search_struct_field (const char *, struct value
*,
56 int, struct type
*, int);
58 static struct value
*search_struct_method (const char *, struct value
**,
60 int, int *, struct type
*);
62 static int find_oload_champ_namespace (struct value
**, int,
63 const char *, const char *,
65 struct badness_vector
**,
69 int find_oload_champ_namespace_loop (struct value
**, int,
70 const char *, const char *,
71 int, struct symbol
***,
72 struct badness_vector
**, int *,
75 static int find_oload_champ (struct value
**, int, int, int,
76 struct fn_field
*, struct symbol
**,
77 struct badness_vector
**);
79 static int oload_method_static (int, struct fn_field
*, int);
81 enum oload_classification
{ STANDARD
, NON_STANDARD
, INCOMPATIBLE
};
84 oload_classification
classify_oload_match (struct badness_vector
*,
87 static struct value
*value_struct_elt_for_reference (struct type
*,
93 static struct value
*value_namespace_elt (const struct type
*,
94 char *, int , enum noside
);
96 static struct value
*value_maybe_namespace_elt (const struct type
*,
100 static CORE_ADDR
allocate_space_in_inferior (int);
102 static struct value
*cast_into_complex (struct type
*, struct value
*);
104 static struct fn_field
*find_method_list (struct value
**, const char *,
105 int, struct type
*, int *,
106 struct type
**, int *);
108 void _initialize_valops (void);
111 /* Flag for whether we want to abandon failed expression evals by
114 static int auto_abandon
= 0;
117 int overload_resolution
= 0;
119 show_overload_resolution (struct ui_file
*file
, int from_tty
,
120 struct cmd_list_element
*c
,
123 fprintf_filtered (file
, _("Overload resolution in evaluating "
124 "C++ functions is %s.\n"),
128 /* Find the address of function name NAME in the inferior. If OBJF_P
129 is non-NULL, *OBJF_P will be set to the OBJFILE where the function
133 find_function_in_inferior (const char *name
, struct objfile
**objf_p
)
137 sym
= lookup_symbol (name
, 0, VAR_DOMAIN
, 0);
140 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
142 error (_("\"%s\" exists in this program but is not a function."),
147 *objf_p
= SYMBOL_SYMTAB (sym
)->objfile
;
149 return value_of_variable (sym
, NULL
);
153 struct minimal_symbol
*msymbol
=
154 lookup_minimal_symbol (name
, NULL
, NULL
);
158 struct objfile
*objfile
= msymbol_objfile (msymbol
);
159 struct gdbarch
*gdbarch
= get_objfile_arch (objfile
);
163 type
= lookup_pointer_type (builtin_type (gdbarch
)->builtin_char
);
164 type
= lookup_function_type (type
);
165 type
= lookup_pointer_type (type
);
166 maddr
= SYMBOL_VALUE_ADDRESS (msymbol
);
171 return value_from_pointer (type
, maddr
);
175 if (!target_has_execution
)
176 error (_("evaluation of this expression "
177 "requires the target program to be active"));
179 error (_("evaluation of this expression requires the "
180 "program to have a function \"%s\"."),
186 /* Allocate NBYTES of space in the inferior using the inferior's
187 malloc and return a value that is a pointer to the allocated
191 value_allocate_space_in_inferior (int len
)
193 struct objfile
*objf
;
194 struct value
*val
= find_function_in_inferior ("malloc", &objf
);
195 struct gdbarch
*gdbarch
= get_objfile_arch (objf
);
196 struct value
*blocklen
;
198 blocklen
= value_from_longest (builtin_type (gdbarch
)->builtin_int
, len
);
199 val
= call_function_by_hand (val
, 1, &blocklen
);
200 if (value_logical_not (val
))
202 if (!target_has_execution
)
203 error (_("No memory available to program now: "
204 "you need to start the target first"));
206 error (_("No memory available to program: call to malloc failed"));
212 allocate_space_in_inferior (int len
)
214 return value_as_long (value_allocate_space_in_inferior (len
));
217 /* Cast struct value VAL to type TYPE and return as a value.
218 Both type and val must be of TYPE_CODE_STRUCT or TYPE_CODE_UNION
219 for this to work. Typedef to one of the codes is permitted.
220 Returns NULL if the cast is neither an upcast nor a downcast. */
222 static struct value
*
223 value_cast_structs (struct type
*type
, struct value
*v2
)
229 gdb_assert (type
!= NULL
&& v2
!= NULL
);
231 t1
= check_typedef (type
);
232 t2
= check_typedef (value_type (v2
));
234 /* Check preconditions. */
235 gdb_assert ((TYPE_CODE (t1
) == TYPE_CODE_STRUCT
236 || TYPE_CODE (t1
) == TYPE_CODE_UNION
)
237 && !!"Precondition is that type is of STRUCT or UNION kind.");
238 gdb_assert ((TYPE_CODE (t2
) == TYPE_CODE_STRUCT
239 || TYPE_CODE (t2
) == TYPE_CODE_UNION
)
240 && !!"Precondition is that value is of STRUCT or UNION kind");
242 if (TYPE_NAME (t1
) != NULL
243 && TYPE_NAME (t2
) != NULL
244 && !strcmp (TYPE_NAME (t1
), TYPE_NAME (t2
)))
247 /* Upcasting: look in the type of the source to see if it contains the
248 type of the target as a superclass. If so, we'll need to
249 offset the pointer rather than just change its type. */
250 if (TYPE_NAME (t1
) != NULL
)
252 v
= search_struct_field (type_name_no_tag (t1
),
258 /* Downcasting: look in the type of the target to see if it contains the
259 type of the source as a superclass. If so, we'll need to
260 offset the pointer rather than just change its type. */
261 if (TYPE_NAME (t2
) != NULL
)
263 /* Try downcasting using the run-time type of the value. */
264 int full
, top
, using_enc
;
265 struct type
*real_type
;
267 real_type
= value_rtti_type (v2
, &full
, &top
, &using_enc
);
270 v
= value_full_object (v2
, real_type
, full
, top
, using_enc
);
271 v
= value_at_lazy (real_type
, value_address (v
));
273 /* We might be trying to cast to the outermost enclosing
274 type, in which case search_struct_field won't work. */
275 if (TYPE_NAME (real_type
) != NULL
276 && !strcmp (TYPE_NAME (real_type
), TYPE_NAME (t1
)))
279 v
= search_struct_field (type_name_no_tag (t2
), v
, 0, real_type
, 1);
284 /* Try downcasting using information from the destination type
285 T2. This wouldn't work properly for classes with virtual
286 bases, but those were handled above. */
287 v
= search_struct_field (type_name_no_tag (t2
),
288 value_zero (t1
, not_lval
), 0, t1
, 1);
291 /* Downcasting is possible (t1 is superclass of v2). */
292 CORE_ADDR addr2
= value_address (v2
);
294 addr2
-= value_address (v
) + value_embedded_offset (v
);
295 return value_at (type
, addr2
);
302 /* Cast one pointer or reference type to another. Both TYPE and
303 the type of ARG2 should be pointer types, or else both should be
304 reference types. If SUBCLASS_CHECK is non-zero, this will force a
305 check to see whether TYPE is a superclass of ARG2's type. If
306 SUBCLASS_CHECK is zero, then the subclass check is done only when
307 ARG2 is itself non-zero. Returns the new pointer or reference. */
310 value_cast_pointers (struct type
*type
, struct value
*arg2
,
313 struct type
*type1
= check_typedef (type
);
314 struct type
*type2
= check_typedef (value_type (arg2
));
315 struct type
*t1
= check_typedef (TYPE_TARGET_TYPE (type1
));
316 struct type
*t2
= check_typedef (TYPE_TARGET_TYPE (type2
));
318 if (TYPE_CODE (t1
) == TYPE_CODE_STRUCT
319 && TYPE_CODE (t2
) == TYPE_CODE_STRUCT
320 && (subclass_check
|| !value_logical_not (arg2
)))
324 if (TYPE_CODE (type2
) == TYPE_CODE_REF
)
325 v2
= coerce_ref (arg2
);
327 v2
= value_ind (arg2
);
328 gdb_assert (TYPE_CODE (check_typedef (value_type (v2
)))
329 == TYPE_CODE_STRUCT
&& !!"Why did coercion fail?");
330 v2
= value_cast_structs (t1
, v2
);
331 /* At this point we have what we can have, un-dereference if needed. */
334 struct value
*v
= value_addr (v2
);
336 deprecated_set_value_type (v
, type
);
341 /* No superclass found, just change the pointer type. */
342 arg2
= value_copy (arg2
);
343 deprecated_set_value_type (arg2
, type
);
344 set_value_enclosing_type (arg2
, type
);
345 set_value_pointed_to_offset (arg2
, 0); /* pai: chk_val */
349 /* Cast value ARG2 to type TYPE and return as a value.
350 More general than a C cast: accepts any two types of the same length,
351 and if ARG2 is an lvalue it can be cast into anything at all. */
352 /* In C++, casts may change pointer or object representations. */
355 value_cast (struct type
*type
, struct value
*arg2
)
357 enum type_code code1
;
358 enum type_code code2
;
362 int convert_to_boolean
= 0;
364 if (value_type (arg2
) == type
)
367 code1
= TYPE_CODE (check_typedef (type
));
369 /* Check if we are casting struct reference to struct reference. */
370 if (code1
== TYPE_CODE_REF
)
372 /* We dereference type; then we recurse and finally
373 we generate value of the given reference. Nothing wrong with
375 struct type
*t1
= check_typedef (type
);
376 struct type
*dereftype
= check_typedef (TYPE_TARGET_TYPE (t1
));
377 struct value
*val
= value_cast (dereftype
, arg2
);
379 return value_ref (val
);
382 code2
= TYPE_CODE (check_typedef (value_type (arg2
)));
384 if (code2
== TYPE_CODE_REF
)
385 /* We deref the value and then do the cast. */
386 return value_cast (type
, coerce_ref (arg2
));
388 CHECK_TYPEDEF (type
);
389 code1
= TYPE_CODE (type
);
390 arg2
= coerce_ref (arg2
);
391 type2
= check_typedef (value_type (arg2
));
393 /* You can't cast to a reference type. See value_cast_pointers
395 gdb_assert (code1
!= TYPE_CODE_REF
);
397 /* A cast to an undetermined-length array_type, such as
398 (TYPE [])OBJECT, is treated like a cast to (TYPE [N])OBJECT,
399 where N is sizeof(OBJECT)/sizeof(TYPE). */
400 if (code1
== TYPE_CODE_ARRAY
)
402 struct type
*element_type
= TYPE_TARGET_TYPE (type
);
403 unsigned element_length
= TYPE_LENGTH (check_typedef (element_type
));
405 if (element_length
> 0 && TYPE_ARRAY_UPPER_BOUND_IS_UNDEFINED (type
))
407 struct type
*range_type
= TYPE_INDEX_TYPE (type
);
408 int val_length
= TYPE_LENGTH (type2
);
409 LONGEST low_bound
, high_bound
, new_length
;
411 if (get_discrete_bounds (range_type
, &low_bound
, &high_bound
) < 0)
412 low_bound
= 0, high_bound
= 0;
413 new_length
= val_length
/ element_length
;
414 if (val_length
% element_length
!= 0)
415 warning (_("array element type size does not "
416 "divide object size in cast"));
417 /* FIXME-type-allocation: need a way to free this type when
418 we are done with it. */
419 range_type
= create_range_type ((struct type
*) NULL
,
420 TYPE_TARGET_TYPE (range_type
),
422 new_length
+ low_bound
- 1);
423 deprecated_set_value_type (arg2
,
424 create_array_type ((struct type
*) NULL
,
431 if (current_language
->c_style_arrays
432 && TYPE_CODE (type2
) == TYPE_CODE_ARRAY
433 && !TYPE_VECTOR (type2
))
434 arg2
= value_coerce_array (arg2
);
436 if (TYPE_CODE (type2
) == TYPE_CODE_FUNC
)
437 arg2
= value_coerce_function (arg2
);
439 type2
= check_typedef (value_type (arg2
));
440 code2
= TYPE_CODE (type2
);
442 if (code1
== TYPE_CODE_COMPLEX
)
443 return cast_into_complex (type
, arg2
);
444 if (code1
== TYPE_CODE_BOOL
)
446 code1
= TYPE_CODE_INT
;
447 convert_to_boolean
= 1;
449 if (code1
== TYPE_CODE_CHAR
)
450 code1
= TYPE_CODE_INT
;
451 if (code2
== TYPE_CODE_BOOL
|| code2
== TYPE_CODE_CHAR
)
452 code2
= TYPE_CODE_INT
;
454 scalar
= (code2
== TYPE_CODE_INT
|| code2
== TYPE_CODE_FLT
455 || code2
== TYPE_CODE_DECFLOAT
|| code2
== TYPE_CODE_ENUM
456 || code2
== TYPE_CODE_RANGE
);
458 if ((code1
== TYPE_CODE_STRUCT
|| code1
== TYPE_CODE_UNION
)
459 && (code2
== TYPE_CODE_STRUCT
|| code2
== TYPE_CODE_UNION
)
460 && TYPE_NAME (type
) != 0)
462 struct value
*v
= value_cast_structs (type
, arg2
);
468 if (code1
== TYPE_CODE_FLT
&& scalar
)
469 return value_from_double (type
, value_as_double (arg2
));
470 else if (code1
== TYPE_CODE_DECFLOAT
&& scalar
)
472 enum bfd_endian byte_order
= gdbarch_byte_order (get_type_arch (type
));
473 int dec_len
= TYPE_LENGTH (type
);
476 if (code2
== TYPE_CODE_FLT
)
477 decimal_from_floating (arg2
, dec
, dec_len
, byte_order
);
478 else if (code2
== TYPE_CODE_DECFLOAT
)
479 decimal_convert (value_contents (arg2
), TYPE_LENGTH (type2
),
480 byte_order
, dec
, dec_len
, byte_order
);
482 /* The only option left is an integral type. */
483 decimal_from_integral (arg2
, dec
, dec_len
, byte_order
);
485 return value_from_decfloat (type
, dec
);
487 else if ((code1
== TYPE_CODE_INT
|| code1
== TYPE_CODE_ENUM
488 || code1
== TYPE_CODE_RANGE
)
489 && (scalar
|| code2
== TYPE_CODE_PTR
490 || code2
== TYPE_CODE_MEMBERPTR
))
494 /* When we cast pointers to integers, we mustn't use
495 gdbarch_pointer_to_address to find the address the pointer
496 represents, as value_as_long would. GDB should evaluate
497 expressions just as the compiler would --- and the compiler
498 sees a cast as a simple reinterpretation of the pointer's
500 if (code2
== TYPE_CODE_PTR
)
501 longest
= extract_unsigned_integer
502 (value_contents (arg2
), TYPE_LENGTH (type2
),
503 gdbarch_byte_order (get_type_arch (type2
)));
505 longest
= value_as_long (arg2
);
506 return value_from_longest (type
, convert_to_boolean
?
507 (LONGEST
) (longest
? 1 : 0) : longest
);
509 else if (code1
== TYPE_CODE_PTR
&& (code2
== TYPE_CODE_INT
510 || code2
== TYPE_CODE_ENUM
511 || code2
== TYPE_CODE_RANGE
))
513 /* TYPE_LENGTH (type) is the length of a pointer, but we really
514 want the length of an address! -- we are really dealing with
515 addresses (i.e., gdb representations) not pointers (i.e.,
516 target representations) here.
518 This allows things like "print *(int *)0x01000234" to work
519 without printing a misleading message -- which would
520 otherwise occur when dealing with a target having two byte
521 pointers and four byte addresses. */
523 int addr_bit
= gdbarch_addr_bit (get_type_arch (type2
));
524 LONGEST longest
= value_as_long (arg2
);
526 if (addr_bit
< sizeof (LONGEST
) * HOST_CHAR_BIT
)
528 if (longest
>= ((LONGEST
) 1 << addr_bit
)
529 || longest
<= -((LONGEST
) 1 << addr_bit
))
530 warning (_("value truncated"));
532 return value_from_longest (type
, longest
);
534 else if (code1
== TYPE_CODE_METHODPTR
&& code2
== TYPE_CODE_INT
535 && value_as_long (arg2
) == 0)
537 struct value
*result
= allocate_value (type
);
539 cplus_make_method_ptr (type
, value_contents_writeable (result
), 0, 0);
542 else if (code1
== TYPE_CODE_MEMBERPTR
&& code2
== TYPE_CODE_INT
543 && value_as_long (arg2
) == 0)
545 /* The Itanium C++ ABI represents NULL pointers to members as
546 minus one, instead of biasing the normal case. */
547 return value_from_longest (type
, -1);
549 else if (code1
== TYPE_CODE_ARRAY
&& TYPE_VECTOR (type
) && scalar
)
551 /* Widen the scalar to a vector. */
554 LONGEST low_bound
, high_bound
;
557 if (!get_array_bounds (type
, &low_bound
, &high_bound
))
558 error (_("Could not determine the vector bounds"));
560 eltype
= check_typedef (TYPE_TARGET_TYPE (type
));
561 arg2
= value_cast (eltype
, arg2
);
562 val
= allocate_value (type
);
564 for (i
= 0; i
< high_bound
- low_bound
+ 1; i
++)
566 /* Duplicate the contents of arg2 into the destination vector. */
567 memcpy (value_contents_writeable (val
) + (i
* TYPE_LENGTH (eltype
)),
568 value_contents_all (arg2
), TYPE_LENGTH (eltype
));
572 else if (TYPE_LENGTH (type
) == TYPE_LENGTH (type2
))
574 if (code1
== TYPE_CODE_PTR
&& code2
== TYPE_CODE_PTR
)
575 return value_cast_pointers (type
, arg2
, 0);
577 arg2
= value_copy (arg2
);
578 deprecated_set_value_type (arg2
, type
);
579 set_value_enclosing_type (arg2
, type
);
580 set_value_pointed_to_offset (arg2
, 0); /* pai: chk_val */
583 else if (VALUE_LVAL (arg2
) == lval_memory
)
584 return value_at_lazy (type
, value_address (arg2
));
585 else if (code1
== TYPE_CODE_VOID
)
587 return value_zero (type
, not_lval
);
591 error (_("Invalid cast."));
596 /* The C++ reinterpret_cast operator. */
599 value_reinterpret_cast (struct type
*type
, struct value
*arg
)
601 struct value
*result
;
602 struct type
*real_type
= check_typedef (type
);
603 struct type
*arg_type
, *dest_type
;
605 enum type_code dest_code
, arg_code
;
607 /* Do reference, function, and array conversion. */
608 arg
= coerce_array (arg
);
610 /* Attempt to preserve the type the user asked for. */
613 /* If we are casting to a reference type, transform
614 reinterpret_cast<T&>(V) to *reinterpret_cast<T*>(&V). */
615 if (TYPE_CODE (real_type
) == TYPE_CODE_REF
)
618 arg
= value_addr (arg
);
619 dest_type
= lookup_pointer_type (TYPE_TARGET_TYPE (dest_type
));
620 real_type
= lookup_pointer_type (real_type
);
623 arg_type
= value_type (arg
);
625 dest_code
= TYPE_CODE (real_type
);
626 arg_code
= TYPE_CODE (arg_type
);
628 /* We can convert pointer types, or any pointer type to int, or int
630 if ((dest_code
== TYPE_CODE_PTR
&& arg_code
== TYPE_CODE_INT
)
631 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_PTR
)
632 || (dest_code
== TYPE_CODE_METHODPTR
&& arg_code
== TYPE_CODE_INT
)
633 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_METHODPTR
)
634 || (dest_code
== TYPE_CODE_MEMBERPTR
&& arg_code
== TYPE_CODE_INT
)
635 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_MEMBERPTR
)
636 || (dest_code
== arg_code
637 && (dest_code
== TYPE_CODE_PTR
638 || dest_code
== TYPE_CODE_METHODPTR
639 || dest_code
== TYPE_CODE_MEMBERPTR
)))
640 result
= value_cast (dest_type
, arg
);
642 error (_("Invalid reinterpret_cast"));
645 result
= value_cast (type
, value_ref (value_ind (result
)));
650 /* A helper for value_dynamic_cast. This implements the first of two
651 runtime checks: we iterate over all the base classes of the value's
652 class which are equal to the desired class; if only one of these
653 holds the value, then it is the answer. */
656 dynamic_cast_check_1 (struct type
*desired_type
,
657 const gdb_byte
*valaddr
,
661 struct type
*search_type
,
663 struct type
*arg_type
,
664 struct value
**result
)
666 int i
, result_count
= 0;
668 for (i
= 0; i
< TYPE_N_BASECLASSES (search_type
) && result_count
< 2; ++i
)
670 int offset
= baseclass_offset (search_type
, i
, valaddr
, embedded_offset
,
673 if (class_types_same_p (desired_type
, TYPE_BASECLASS (search_type
, i
)))
675 if (address
+ embedded_offset
+ offset
>= arg_addr
676 && address
+ embedded_offset
+ offset
< arg_addr
+ TYPE_LENGTH (arg_type
))
680 *result
= value_at_lazy (TYPE_BASECLASS (search_type
, i
),
681 address
+ embedded_offset
+ offset
);
685 result_count
+= dynamic_cast_check_1 (desired_type
,
687 embedded_offset
+ offset
,
689 TYPE_BASECLASS (search_type
, i
),
698 /* A helper for value_dynamic_cast. This implements the second of two
699 runtime checks: we look for a unique public sibling class of the
700 argument's declared class. */
703 dynamic_cast_check_2 (struct type
*desired_type
,
704 const gdb_byte
*valaddr
,
708 struct type
*search_type
,
709 struct value
**result
)
711 int i
, result_count
= 0;
713 for (i
= 0; i
< TYPE_N_BASECLASSES (search_type
) && result_count
< 2; ++i
)
717 if (! BASETYPE_VIA_PUBLIC (search_type
, i
))
720 offset
= baseclass_offset (search_type
, i
, valaddr
, embedded_offset
,
722 if (class_types_same_p (desired_type
, TYPE_BASECLASS (search_type
, i
)))
726 *result
= value_at_lazy (TYPE_BASECLASS (search_type
, i
),
727 address
+ embedded_offset
+ offset
);
730 result_count
+= dynamic_cast_check_2 (desired_type
,
732 embedded_offset
+ offset
,
734 TYPE_BASECLASS (search_type
, i
),
741 /* The C++ dynamic_cast operator. */
744 value_dynamic_cast (struct type
*type
, struct value
*arg
)
746 int full
, top
, using_enc
;
747 struct type
*resolved_type
= check_typedef (type
);
748 struct type
*arg_type
= check_typedef (value_type (arg
));
749 struct type
*class_type
, *rtti_type
;
750 struct value
*result
, *tem
, *original_arg
= arg
;
752 int is_ref
= TYPE_CODE (resolved_type
) == TYPE_CODE_REF
;
754 if (TYPE_CODE (resolved_type
) != TYPE_CODE_PTR
755 && TYPE_CODE (resolved_type
) != TYPE_CODE_REF
)
756 error (_("Argument to dynamic_cast must be a pointer or reference type"));
757 if (TYPE_CODE (TYPE_TARGET_TYPE (resolved_type
)) != TYPE_CODE_VOID
758 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type
)) != TYPE_CODE_CLASS
)
759 error (_("Argument to dynamic_cast must be pointer to class or `void *'"));
761 class_type
= check_typedef (TYPE_TARGET_TYPE (resolved_type
));
762 if (TYPE_CODE (resolved_type
) == TYPE_CODE_PTR
)
764 if (TYPE_CODE (arg_type
) != TYPE_CODE_PTR
765 && ! (TYPE_CODE (arg_type
) == TYPE_CODE_INT
766 && value_as_long (arg
) == 0))
767 error (_("Argument to dynamic_cast does not have pointer type"));
768 if (TYPE_CODE (arg_type
) == TYPE_CODE_PTR
)
770 arg_type
= check_typedef (TYPE_TARGET_TYPE (arg_type
));
771 if (TYPE_CODE (arg_type
) != TYPE_CODE_CLASS
)
772 error (_("Argument to dynamic_cast does "
773 "not have pointer to class type"));
776 /* Handle NULL pointers. */
777 if (value_as_long (arg
) == 0)
778 return value_zero (type
, not_lval
);
780 arg
= value_ind (arg
);
784 if (TYPE_CODE (arg_type
) != TYPE_CODE_CLASS
)
785 error (_("Argument to dynamic_cast does not have class type"));
788 /* If the classes are the same, just return the argument. */
789 if (class_types_same_p (class_type
, arg_type
))
790 return value_cast (type
, arg
);
792 /* If the target type is a unique base class of the argument's
793 declared type, just cast it. */
794 if (is_ancestor (class_type
, arg_type
))
796 if (is_unique_ancestor (class_type
, arg
))
797 return value_cast (type
, original_arg
);
798 error (_("Ambiguous dynamic_cast"));
801 rtti_type
= value_rtti_type (arg
, &full
, &top
, &using_enc
);
803 error (_("Couldn't determine value's most derived type for dynamic_cast"));
805 /* Compute the most derived object's address. */
806 addr
= value_address (arg
);
814 addr
+= top
+ value_embedded_offset (arg
);
816 /* dynamic_cast<void *> means to return a pointer to the
817 most-derived object. */
818 if (TYPE_CODE (resolved_type
) == TYPE_CODE_PTR
819 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type
)) == TYPE_CODE_VOID
)
820 return value_at_lazy (type
, addr
);
822 tem
= value_at (type
, addr
);
824 /* The first dynamic check specified in 5.2.7. */
825 if (is_public_ancestor (arg_type
, TYPE_TARGET_TYPE (resolved_type
)))
827 if (class_types_same_p (rtti_type
, TYPE_TARGET_TYPE (resolved_type
)))
830 if (dynamic_cast_check_1 (TYPE_TARGET_TYPE (resolved_type
),
831 value_contents_for_printing (tem
),
832 value_embedded_offset (tem
),
833 value_address (tem
), tem
,
837 return value_cast (type
,
838 is_ref
? value_ref (result
) : value_addr (result
));
841 /* The second dynamic check specified in 5.2.7. */
843 if (is_public_ancestor (arg_type
, rtti_type
)
844 && dynamic_cast_check_2 (TYPE_TARGET_TYPE (resolved_type
),
845 value_contents_for_printing (tem
),
846 value_embedded_offset (tem
),
847 value_address (tem
), tem
,
848 rtti_type
, &result
) == 1)
849 return value_cast (type
,
850 is_ref
? value_ref (result
) : value_addr (result
));
852 if (TYPE_CODE (resolved_type
) == TYPE_CODE_PTR
)
853 return value_zero (type
, not_lval
);
855 error (_("dynamic_cast failed"));
858 /* Create a value of type TYPE that is zero, and return it. */
861 value_zero (struct type
*type
, enum lval_type lv
)
863 struct value
*val
= allocate_value (type
);
865 VALUE_LVAL (val
) = (lv
== lval_computed
? not_lval
: lv
);
869 /* Create a not_lval value of numeric type TYPE that is one, and return it. */
872 value_one (struct type
*type
)
874 struct type
*type1
= check_typedef (type
);
877 if (TYPE_CODE (type1
) == TYPE_CODE_DECFLOAT
)
879 enum bfd_endian byte_order
= gdbarch_byte_order (get_type_arch (type
));
882 decimal_from_string (v
, TYPE_LENGTH (type
), byte_order
, "1");
883 val
= value_from_decfloat (type
, v
);
885 else if (TYPE_CODE (type1
) == TYPE_CODE_FLT
)
887 val
= value_from_double (type
, (DOUBLEST
) 1);
889 else if (is_integral_type (type1
))
891 val
= value_from_longest (type
, (LONGEST
) 1);
893 else if (TYPE_CODE (type1
) == TYPE_CODE_ARRAY
&& TYPE_VECTOR (type1
))
895 struct type
*eltype
= check_typedef (TYPE_TARGET_TYPE (type1
));
897 LONGEST low_bound
, high_bound
;
900 if (!get_array_bounds (type1
, &low_bound
, &high_bound
))
901 error (_("Could not determine the vector bounds"));
903 val
= allocate_value (type
);
904 for (i
= 0; i
< high_bound
- low_bound
+ 1; i
++)
906 tmp
= value_one (eltype
);
907 memcpy (value_contents_writeable (val
) + i
* TYPE_LENGTH (eltype
),
908 value_contents_all (tmp
), TYPE_LENGTH (eltype
));
913 error (_("Not a numeric type."));
916 /* value_one result is never used for assignments to. */
917 gdb_assert (VALUE_LVAL (val
) == not_lval
);
922 /* Helper function for value_at, value_at_lazy, and value_at_lazy_stack. */
924 static struct value
*
925 get_value_at (struct type
*type
, CORE_ADDR addr
, int lazy
)
929 if (TYPE_CODE (check_typedef (type
)) == TYPE_CODE_VOID
)
930 error (_("Attempt to dereference a generic pointer."));
932 val
= value_from_contents_and_address (type
, NULL
, addr
);
935 value_fetch_lazy (val
);
940 /* Return a value with type TYPE located at ADDR.
942 Call value_at only if the data needs to be fetched immediately;
943 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
944 value_at_lazy instead. value_at_lazy simply records the address of
945 the data and sets the lazy-evaluation-required flag. The lazy flag
946 is tested in the value_contents macro, which is used if and when
947 the contents are actually required.
949 Note: value_at does *NOT* handle embedded offsets; perform such
950 adjustments before or after calling it. */
953 value_at (struct type
*type
, CORE_ADDR addr
)
955 return get_value_at (type
, addr
, 0);
958 /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
961 value_at_lazy (struct type
*type
, CORE_ADDR addr
)
963 return get_value_at (type
, addr
, 1);
966 /* Called only from the value_contents and value_contents_all()
967 macros, if the current data for a variable needs to be loaded into
968 value_contents(VAL). Fetches the data from the user's process, and
969 clears the lazy flag to indicate that the data in the buffer is
972 If the value is zero-length, we avoid calling read_memory, which
973 would abort. We mark the value as fetched anyway -- all 0 bytes of
976 This function returns a value because it is used in the
977 value_contents macro as part of an expression, where a void would
978 not work. The value is ignored. */
981 value_fetch_lazy (struct value
*val
)
983 gdb_assert (value_lazy (val
));
984 allocate_value_contents (val
);
985 if (value_bitsize (val
))
987 /* To read a lazy bitfield, read the entire enclosing value. This
988 prevents reading the same block of (possibly volatile) memory once
989 per bitfield. It would be even better to read only the containing
990 word, but we have no way to record that just specific bits of a
991 value have been fetched. */
992 struct type
*type
= check_typedef (value_type (val
));
993 enum bfd_endian byte_order
= gdbarch_byte_order (get_type_arch (type
));
994 struct value
*parent
= value_parent (val
);
995 LONGEST offset
= value_offset (val
);
997 int length
= TYPE_LENGTH (type
);
999 if (!value_bits_valid (val
,
1000 TARGET_CHAR_BIT
* offset
+ value_bitpos (val
),
1001 value_bitsize (val
)))
1002 error (_("value has been optimized out"));
1004 if (!unpack_value_bits_as_long (value_type (val
),
1005 value_contents_for_printing (parent
),
1008 value_bitsize (val
), parent
, &num
))
1009 mark_value_bytes_unavailable (val
,
1010 value_embedded_offset (val
),
1013 store_signed_integer (value_contents_raw (val
), length
,
1016 else if (VALUE_LVAL (val
) == lval_memory
)
1018 CORE_ADDR addr
= value_address (val
);
1019 int length
= TYPE_LENGTH (check_typedef (value_enclosing_type (val
)));
1022 read_value_memory (val
, 0, value_stack (val
),
1023 addr
, value_contents_all_raw (val
), length
);
1025 else if (VALUE_LVAL (val
) == lval_register
)
1027 struct frame_info
*frame
;
1029 struct type
*type
= check_typedef (value_type (val
));
1030 struct value
*new_val
= val
, *mark
= value_mark ();
1032 /* Offsets are not supported here; lazy register values must
1033 refer to the entire register. */
1034 gdb_assert (value_offset (val
) == 0);
1036 while (VALUE_LVAL (new_val
) == lval_register
&& value_lazy (new_val
))
1038 frame
= frame_find_by_id (VALUE_FRAME_ID (new_val
));
1039 regnum
= VALUE_REGNUM (new_val
);
1041 gdb_assert (frame
!= NULL
);
1043 /* Convertible register routines are used for multi-register
1044 values and for interpretation in different types
1045 (e.g. float or int from a double register). Lazy
1046 register values should have the register's natural type,
1047 so they do not apply. */
1048 gdb_assert (!gdbarch_convert_register_p (get_frame_arch (frame
),
1051 new_val
= get_frame_register_value (frame
, regnum
);
1054 /* If it's still lazy (for instance, a saved register on the
1055 stack), fetch it. */
1056 if (value_lazy (new_val
))
1057 value_fetch_lazy (new_val
);
1059 /* If the register was not saved, mark it optimized out. */
1060 if (value_optimized_out (new_val
))
1061 set_value_optimized_out (val
, 1);
1064 set_value_lazy (val
, 0);
1065 value_contents_copy (val
, value_embedded_offset (val
),
1066 new_val
, value_embedded_offset (new_val
),
1067 TYPE_LENGTH (type
));
1072 struct gdbarch
*gdbarch
;
1073 frame
= frame_find_by_id (VALUE_FRAME_ID (val
));
1074 regnum
= VALUE_REGNUM (val
);
1075 gdbarch
= get_frame_arch (frame
);
1077 fprintf_unfiltered (gdb_stdlog
,
1078 "{ value_fetch_lazy "
1079 "(frame=%d,regnum=%d(%s),...) ",
1080 frame_relative_level (frame
), regnum
,
1081 user_reg_map_regnum_to_name (gdbarch
, regnum
));
1083 fprintf_unfiltered (gdb_stdlog
, "->");
1084 if (value_optimized_out (new_val
))
1085 fprintf_unfiltered (gdb_stdlog
, " optimized out");
1089 const gdb_byte
*buf
= value_contents (new_val
);
1091 if (VALUE_LVAL (new_val
) == lval_register
)
1092 fprintf_unfiltered (gdb_stdlog
, " register=%d",
1093 VALUE_REGNUM (new_val
));
1094 else if (VALUE_LVAL (new_val
) == lval_memory
)
1095 fprintf_unfiltered (gdb_stdlog
, " address=%s",
1097 value_address (new_val
)));
1099 fprintf_unfiltered (gdb_stdlog
, " computed");
1101 fprintf_unfiltered (gdb_stdlog
, " bytes=");
1102 fprintf_unfiltered (gdb_stdlog
, "[");
1103 for (i
= 0; i
< register_size (gdbarch
, regnum
); i
++)
1104 fprintf_unfiltered (gdb_stdlog
, "%02x", buf
[i
]);
1105 fprintf_unfiltered (gdb_stdlog
, "]");
1108 fprintf_unfiltered (gdb_stdlog
, " }\n");
1111 /* Dispose of the intermediate values. This prevents
1112 watchpoints from trying to watch the saved frame pointer. */
1113 value_free_to_mark (mark
);
1115 else if (VALUE_LVAL (val
) == lval_computed
1116 && value_computed_funcs (val
)->read
!= NULL
)
1117 value_computed_funcs (val
)->read (val
);
1118 else if (value_optimized_out (val
))
1119 /* Keep it optimized out. */;
1121 internal_error (__FILE__
, __LINE__
, _("Unexpected lazy value type."));
1123 set_value_lazy (val
, 0);
1128 read_value_memory (struct value
*val
, int embedded_offset
,
1129 int stack
, CORE_ADDR memaddr
,
1130 gdb_byte
*buffer
, size_t length
)
1134 VEC(mem_range_s
) *available_memory
;
1136 if (get_traceframe_number () < 0
1137 || !traceframe_available_memory (&available_memory
, memaddr
, length
))
1140 read_stack (memaddr
, buffer
, length
);
1142 read_memory (memaddr
, buffer
, length
);
1146 struct target_section_table
*table
;
1147 struct cleanup
*old_chain
;
1152 /* Fallback to reading from read-only sections. */
1153 table
= target_get_section_table (&exec_ops
);
1155 section_table_available_memory (available_memory
,
1158 table
->sections_end
);
1160 old_chain
= make_cleanup (VEC_cleanup(mem_range_s
),
1163 normalize_mem_ranges (available_memory
);
1165 /* Mark which bytes are unavailable, and read those which
1171 VEC_iterate (mem_range_s
, available_memory
, i
, r
);
1174 if (mem_ranges_overlap (r
->start
, r
->length
,
1177 CORE_ADDR lo1
, hi1
, lo2
, hi2
;
1178 CORE_ADDR start
, end
;
1180 /* Get the intersection window. */
1182 hi1
= memaddr
+ length
;
1184 hi2
= r
->start
+ r
->length
;
1185 start
= max (lo1
, lo2
);
1186 end
= min (hi1
, hi2
);
1188 gdb_assert (end
- memaddr
<= length
);
1190 if (start
> unavail
)
1191 mark_value_bytes_unavailable (val
,
1193 + unavail
- memaddr
),
1197 read_memory (start
, buffer
+ start
- memaddr
, end
- start
);
1201 if (unavail
!= memaddr
+ length
)
1202 mark_value_bytes_unavailable (val
,
1203 embedded_offset
+ unavail
- memaddr
,
1204 (memaddr
+ length
) - unavail
);
1206 do_cleanups (old_chain
);
1211 /* Store the contents of FROMVAL into the location of TOVAL.
1212 Return a new value with the location of TOVAL and contents of FROMVAL. */
1215 value_assign (struct value
*toval
, struct value
*fromval
)
1219 struct frame_id old_frame
;
1221 if (!deprecated_value_modifiable (toval
))
1222 error (_("Left operand of assignment is not a modifiable lvalue."));
1224 toval
= coerce_ref (toval
);
1226 type
= value_type (toval
);
1227 if (VALUE_LVAL (toval
) != lval_internalvar
)
1228 fromval
= value_cast (type
, fromval
);
1231 /* Coerce arrays and functions to pointers, except for arrays
1232 which only live in GDB's storage. */
1233 if (!value_must_coerce_to_target (fromval
))
1234 fromval
= coerce_array (fromval
);
1237 CHECK_TYPEDEF (type
);
1239 /* Since modifying a register can trash the frame chain, and
1240 modifying memory can trash the frame cache, we save the old frame
1241 and then restore the new frame afterwards. */
1242 old_frame
= get_frame_id (deprecated_safe_get_selected_frame ());
1244 switch (VALUE_LVAL (toval
))
1246 case lval_internalvar
:
1247 set_internalvar (VALUE_INTERNALVAR (toval
), fromval
);
1248 return value_of_internalvar (get_type_arch (type
),
1249 VALUE_INTERNALVAR (toval
));
1251 case lval_internalvar_component
:
1252 set_internalvar_component (VALUE_INTERNALVAR (toval
),
1253 value_offset (toval
),
1254 value_bitpos (toval
),
1255 value_bitsize (toval
),
1261 const gdb_byte
*dest_buffer
;
1262 CORE_ADDR changed_addr
;
1264 gdb_byte buffer
[sizeof (LONGEST
)];
1266 if (value_bitsize (toval
))
1268 struct value
*parent
= value_parent (toval
);
1270 changed_addr
= value_address (parent
) + value_offset (toval
);
1271 changed_len
= (value_bitpos (toval
)
1272 + value_bitsize (toval
)
1273 + HOST_CHAR_BIT
- 1)
1276 /* If we can read-modify-write exactly the size of the
1277 containing type (e.g. short or int) then do so. This
1278 is safer for volatile bitfields mapped to hardware
1280 if (changed_len
< TYPE_LENGTH (type
)
1281 && TYPE_LENGTH (type
) <= (int) sizeof (LONGEST
)
1282 && ((LONGEST
) changed_addr
% TYPE_LENGTH (type
)) == 0)
1283 changed_len
= TYPE_LENGTH (type
);
1285 if (changed_len
> (int) sizeof (LONGEST
))
1286 error (_("Can't handle bitfields which "
1287 "don't fit in a %d bit word."),
1288 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
1290 read_memory (changed_addr
, buffer
, changed_len
);
1291 modify_field (type
, buffer
, value_as_long (fromval
),
1292 value_bitpos (toval
), value_bitsize (toval
));
1293 dest_buffer
= buffer
;
1297 changed_addr
= value_address (toval
);
1298 changed_len
= TYPE_LENGTH (type
);
1299 dest_buffer
= value_contents (fromval
);
1302 write_memory_with_notification (changed_addr
, dest_buffer
, changed_len
);
1308 struct frame_info
*frame
;
1309 struct gdbarch
*gdbarch
;
1312 /* Figure out which frame this is in currently. */
1313 frame
= frame_find_by_id (VALUE_FRAME_ID (toval
));
1314 value_reg
= VALUE_REGNUM (toval
);
1317 error (_("Value being assigned to is no longer active."));
1319 gdbarch
= get_frame_arch (frame
);
1320 if (gdbarch_convert_register_p (gdbarch
, VALUE_REGNUM (toval
), type
))
1322 /* If TOVAL is a special machine register requiring
1323 conversion of program values to a special raw
1325 gdbarch_value_to_register (gdbarch
, frame
,
1326 VALUE_REGNUM (toval
), type
,
1327 value_contents (fromval
));
1331 if (value_bitsize (toval
))
1333 struct value
*parent
= value_parent (toval
);
1334 int offset
= value_offset (parent
) + value_offset (toval
);
1336 gdb_byte buffer
[sizeof (LONGEST
)];
1339 changed_len
= (value_bitpos (toval
)
1340 + value_bitsize (toval
)
1341 + HOST_CHAR_BIT
- 1)
1344 if (changed_len
> (int) sizeof (LONGEST
))
1345 error (_("Can't handle bitfields which "
1346 "don't fit in a %d bit word."),
1347 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
1349 if (!get_frame_register_bytes (frame
, value_reg
, offset
,
1350 changed_len
, buffer
,
1354 error (_("value has been optimized out"));
1356 throw_error (NOT_AVAILABLE_ERROR
,
1357 _("value is not available"));
1360 modify_field (type
, buffer
, value_as_long (fromval
),
1361 value_bitpos (toval
), value_bitsize (toval
));
1363 put_frame_register_bytes (frame
, value_reg
, offset
,
1364 changed_len
, buffer
);
1368 put_frame_register_bytes (frame
, value_reg
,
1369 value_offset (toval
),
1371 value_contents (fromval
));
1375 if (deprecated_register_changed_hook
)
1376 deprecated_register_changed_hook (-1);
1382 const struct lval_funcs
*funcs
= value_computed_funcs (toval
);
1384 if (funcs
->write
!= NULL
)
1386 funcs
->write (toval
, fromval
);
1393 error (_("Left operand of assignment is not an lvalue."));
1396 /* Assigning to the stack pointer, frame pointer, and other
1397 (architecture and calling convention specific) registers may
1398 cause the frame cache and regcache to be out of date. Assigning to memory
1399 also can. We just do this on all assignments to registers or
1400 memory, for simplicity's sake; I doubt the slowdown matters. */
1401 switch (VALUE_LVAL (toval
))
1407 observer_notify_target_changed (¤t_target
);
1409 /* Having destroyed the frame cache, restore the selected
1412 /* FIXME: cagney/2002-11-02: There has to be a better way of
1413 doing this. Instead of constantly saving/restoring the
1414 frame. Why not create a get_selected_frame() function that,
1415 having saved the selected frame's ID can automatically
1416 re-find the previously selected frame automatically. */
1419 struct frame_info
*fi
= frame_find_by_id (old_frame
);
1430 /* If the field does not entirely fill a LONGEST, then zero the sign
1431 bits. If the field is signed, and is negative, then sign
1433 if ((value_bitsize (toval
) > 0)
1434 && (value_bitsize (toval
) < 8 * (int) sizeof (LONGEST
)))
1436 LONGEST fieldval
= value_as_long (fromval
);
1437 LONGEST valmask
= (((ULONGEST
) 1) << value_bitsize (toval
)) - 1;
1439 fieldval
&= valmask
;
1440 if (!TYPE_UNSIGNED (type
)
1441 && (fieldval
& (valmask
^ (valmask
>> 1))))
1442 fieldval
|= ~valmask
;
1444 fromval
= value_from_longest (type
, fieldval
);
1447 /* The return value is a copy of TOVAL so it shares its location
1448 information, but its contents are updated from FROMVAL. This
1449 implies the returned value is not lazy, even if TOVAL was. */
1450 val
= value_copy (toval
);
1451 set_value_lazy (val
, 0);
1452 memcpy (value_contents_raw (val
), value_contents (fromval
),
1453 TYPE_LENGTH (type
));
1455 /* We copy over the enclosing type and pointed-to offset from FROMVAL
1456 in the case of pointer types. For object types, the enclosing type
1457 and embedded offset must *not* be copied: the target object refered
1458 to by TOVAL retains its original dynamic type after assignment. */
1459 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1461 set_value_enclosing_type (val
, value_enclosing_type (fromval
));
1462 set_value_pointed_to_offset (val
, value_pointed_to_offset (fromval
));
1468 /* Extend a value VAL to COUNT repetitions of its type. */
1471 value_repeat (struct value
*arg1
, int count
)
1475 if (VALUE_LVAL (arg1
) != lval_memory
)
1476 error (_("Only values in memory can be extended with '@'."));
1478 error (_("Invalid number %d of repetitions."), count
);
1480 val
= allocate_repeat_value (value_enclosing_type (arg1
), count
);
1482 VALUE_LVAL (val
) = lval_memory
;
1483 set_value_address (val
, value_address (arg1
));
1485 read_value_memory (val
, 0, value_stack (val
), value_address (val
),
1486 value_contents_all_raw (val
),
1487 TYPE_LENGTH (value_enclosing_type (val
)));
1493 value_of_variable (struct symbol
*var
, const struct block
*b
)
1495 struct frame_info
*frame
;
1497 if (!symbol_read_needs_frame (var
))
1500 frame
= get_selected_frame (_("No frame selected."));
1503 frame
= block_innermost_frame (b
);
1506 if (BLOCK_FUNCTION (b
) && !block_inlined_p (b
)
1507 && SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b
)))
1508 error (_("No frame is currently executing in block %s."),
1509 SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b
)));
1511 error (_("No frame is currently executing in specified block"));
1515 return read_var_value (var
, frame
);
1519 address_of_variable (struct symbol
*var
, struct block
*b
)
1521 struct type
*type
= SYMBOL_TYPE (var
);
1524 /* Evaluate it first; if the result is a memory address, we're fine.
1525 Lazy evaluation pays off here. */
1527 val
= value_of_variable (var
, b
);
1529 if ((VALUE_LVAL (val
) == lval_memory
&& value_lazy (val
))
1530 || TYPE_CODE (type
) == TYPE_CODE_FUNC
)
1532 CORE_ADDR addr
= value_address (val
);
1534 return value_from_pointer (lookup_pointer_type (type
), addr
);
1537 /* Not a memory address; check what the problem was. */
1538 switch (VALUE_LVAL (val
))
1542 struct frame_info
*frame
;
1543 const char *regname
;
1545 frame
= frame_find_by_id (VALUE_FRAME_ID (val
));
1548 regname
= gdbarch_register_name (get_frame_arch (frame
),
1549 VALUE_REGNUM (val
));
1550 gdb_assert (regname
&& *regname
);
1552 error (_("Address requested for identifier "
1553 "\"%s\" which is in register $%s"),
1554 SYMBOL_PRINT_NAME (var
), regname
);
1559 error (_("Can't take address of \"%s\" which isn't an lvalue."),
1560 SYMBOL_PRINT_NAME (var
));
1567 /* Return one if VAL does not live in target memory, but should in order
1568 to operate on it. Otherwise return zero. */
1571 value_must_coerce_to_target (struct value
*val
)
1573 struct type
*valtype
;
1575 /* The only lval kinds which do not live in target memory. */
1576 if (VALUE_LVAL (val
) != not_lval
1577 && VALUE_LVAL (val
) != lval_internalvar
)
1580 valtype
= check_typedef (value_type (val
));
1582 switch (TYPE_CODE (valtype
))
1584 case TYPE_CODE_ARRAY
:
1585 return TYPE_VECTOR (valtype
) ? 0 : 1;
1586 case TYPE_CODE_STRING
:
1593 /* Make sure that VAL lives in target memory if it's supposed to. For
1594 instance, strings are constructed as character arrays in GDB's
1595 storage, and this function copies them to the target. */
1598 value_coerce_to_target (struct value
*val
)
1603 if (!value_must_coerce_to_target (val
))
1606 length
= TYPE_LENGTH (check_typedef (value_type (val
)));
1607 addr
= allocate_space_in_inferior (length
);
1608 write_memory (addr
, value_contents (val
), length
);
1609 return value_at_lazy (value_type (val
), addr
);
1612 /* Given a value which is an array, return a value which is a pointer
1613 to its first element, regardless of whether or not the array has a
1614 nonzero lower bound.
1616 FIXME: A previous comment here indicated that this routine should
1617 be substracting the array's lower bound. It's not clear to me that
1618 this is correct. Given an array subscripting operation, it would
1619 certainly work to do the adjustment here, essentially computing:
1621 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
1623 However I believe a more appropriate and logical place to account
1624 for the lower bound is to do so in value_subscript, essentially
1627 (&array[0] + ((index - lowerbound) * sizeof array[0]))
1629 As further evidence consider what would happen with operations
1630 other than array subscripting, where the caller would get back a
1631 value that had an address somewhere before the actual first element
1632 of the array, and the information about the lower bound would be
1633 lost because of the coercion to pointer type. */
1636 value_coerce_array (struct value
*arg1
)
1638 struct type
*type
= check_typedef (value_type (arg1
));
1640 /* If the user tries to do something requiring a pointer with an
1641 array that has not yet been pushed to the target, then this would
1642 be a good time to do so. */
1643 arg1
= value_coerce_to_target (arg1
);
1645 if (VALUE_LVAL (arg1
) != lval_memory
)
1646 error (_("Attempt to take address of value not located in memory."));
1648 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
1649 value_address (arg1
));
1652 /* Given a value which is a function, return a value which is a pointer
1656 value_coerce_function (struct value
*arg1
)
1658 struct value
*retval
;
1660 if (VALUE_LVAL (arg1
) != lval_memory
)
1661 error (_("Attempt to take address of value not located in memory."));
1663 retval
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1664 value_address (arg1
));
1668 /* Return a pointer value for the object for which ARG1 is the
1672 value_addr (struct value
*arg1
)
1675 struct type
*type
= check_typedef (value_type (arg1
));
1677 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
1679 /* Copy the value, but change the type from (T&) to (T*). We
1680 keep the same location information, which is efficient, and
1681 allows &(&X) to get the location containing the reference. */
1682 arg2
= value_copy (arg1
);
1683 deprecated_set_value_type (arg2
,
1684 lookup_pointer_type (TYPE_TARGET_TYPE (type
)));
1687 if (TYPE_CODE (type
) == TYPE_CODE_FUNC
)
1688 return value_coerce_function (arg1
);
1690 /* If this is an array that has not yet been pushed to the target,
1691 then this would be a good time to force it to memory. */
1692 arg1
= value_coerce_to_target (arg1
);
1694 if (VALUE_LVAL (arg1
) != lval_memory
)
1695 error (_("Attempt to take address of value not located in memory."));
1697 /* Get target memory address. */
1698 arg2
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1699 (value_address (arg1
)
1700 + value_embedded_offset (arg1
)));
1702 /* This may be a pointer to a base subobject; so remember the
1703 full derived object's type ... */
1704 set_value_enclosing_type (arg2
,
1705 lookup_pointer_type (value_enclosing_type (arg1
)));
1706 /* ... and also the relative position of the subobject in the full
1708 set_value_pointed_to_offset (arg2
, value_embedded_offset (arg1
));
1712 /* Return a reference value for the object for which ARG1 is the
1716 value_ref (struct value
*arg1
)
1719 struct type
*type
= check_typedef (value_type (arg1
));
1721 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
1724 arg2
= value_addr (arg1
);
1725 deprecated_set_value_type (arg2
, lookup_reference_type (type
));
1729 /* Given a value of a pointer type, apply the C unary * operator to
1733 value_ind (struct value
*arg1
)
1735 struct type
*base_type
;
1738 arg1
= coerce_array (arg1
);
1740 base_type
= check_typedef (value_type (arg1
));
1742 if (VALUE_LVAL (arg1
) == lval_computed
)
1744 const struct lval_funcs
*funcs
= value_computed_funcs (arg1
);
1746 if (funcs
->indirect
)
1748 struct value
*result
= funcs
->indirect (arg1
);
1755 if (TYPE_CODE (base_type
) == TYPE_CODE_PTR
)
1757 struct type
*enc_type
;
1759 /* We may be pointing to something embedded in a larger object.
1760 Get the real type of the enclosing object. */
1761 enc_type
= check_typedef (value_enclosing_type (arg1
));
1762 enc_type
= TYPE_TARGET_TYPE (enc_type
);
1764 if (TYPE_CODE (check_typedef (enc_type
)) == TYPE_CODE_FUNC
1765 || TYPE_CODE (check_typedef (enc_type
)) == TYPE_CODE_METHOD
)
1766 /* For functions, go through find_function_addr, which knows
1767 how to handle function descriptors. */
1768 arg2
= value_at_lazy (enc_type
,
1769 find_function_addr (arg1
, NULL
));
1771 /* Retrieve the enclosing object pointed to. */
1772 arg2
= value_at_lazy (enc_type
,
1773 (value_as_address (arg1
)
1774 - value_pointed_to_offset (arg1
)));
1776 return readjust_indirect_value_type (arg2
, enc_type
, base_type
, arg1
);
1779 error (_("Attempt to take contents of a non-pointer value."));
1780 return 0; /* For lint -- never reached. */
1783 /* Create a value for an array by allocating space in GDB, copying the
1784 data into that space, and then setting up an array value.
1786 The array bounds are set from LOWBOUND and HIGHBOUND, and the array
1787 is populated from the values passed in ELEMVEC.
1789 The element type of the array is inherited from the type of the
1790 first element, and all elements must have the same size (though we
1791 don't currently enforce any restriction on their types). */
1794 value_array (int lowbound
, int highbound
, struct value
**elemvec
)
1798 unsigned int typelength
;
1800 struct type
*arraytype
;
1802 /* Validate that the bounds are reasonable and that each of the
1803 elements have the same size. */
1805 nelem
= highbound
- lowbound
+ 1;
1808 error (_("bad array bounds (%d, %d)"), lowbound
, highbound
);
1810 typelength
= TYPE_LENGTH (value_enclosing_type (elemvec
[0]));
1811 for (idx
= 1; idx
< nelem
; idx
++)
1813 if (TYPE_LENGTH (value_enclosing_type (elemvec
[idx
])) != typelength
)
1815 error (_("array elements must all be the same size"));
1819 arraytype
= lookup_array_range_type (value_enclosing_type (elemvec
[0]),
1820 lowbound
, highbound
);
1822 if (!current_language
->c_style_arrays
)
1824 val
= allocate_value (arraytype
);
1825 for (idx
= 0; idx
< nelem
; idx
++)
1826 value_contents_copy (val
, idx
* typelength
, elemvec
[idx
], 0,
1831 /* Allocate space to store the array, and then initialize it by
1832 copying in each element. */
1834 val
= allocate_value (arraytype
);
1835 for (idx
= 0; idx
< nelem
; idx
++)
1836 value_contents_copy (val
, idx
* typelength
, elemvec
[idx
], 0, typelength
);
1841 value_cstring (char *ptr
, int len
, struct type
*char_type
)
1844 int lowbound
= current_language
->string_lower_bound
;
1845 int highbound
= len
/ TYPE_LENGTH (char_type
);
1846 struct type
*stringtype
1847 = lookup_array_range_type (char_type
, lowbound
, highbound
+ lowbound
- 1);
1849 val
= allocate_value (stringtype
);
1850 memcpy (value_contents_raw (val
), ptr
, len
);
1854 /* Create a value for a string constant by allocating space in the
1855 inferior, copying the data into that space, and returning the
1856 address with type TYPE_CODE_STRING. PTR points to the string
1857 constant data; LEN is number of characters.
1859 Note that string types are like array of char types with a lower
1860 bound of zero and an upper bound of LEN - 1. Also note that the
1861 string may contain embedded null bytes. */
1864 value_string (char *ptr
, int len
, struct type
*char_type
)
1867 int lowbound
= current_language
->string_lower_bound
;
1868 int highbound
= len
/ TYPE_LENGTH (char_type
);
1869 struct type
*stringtype
1870 = lookup_string_range_type (char_type
, lowbound
, highbound
+ lowbound
- 1);
1872 val
= allocate_value (stringtype
);
1873 memcpy (value_contents_raw (val
), ptr
, len
);
1878 /* See if we can pass arguments in T2 to a function which takes
1879 arguments of types T1. T1 is a list of NARGS arguments, and T2 is
1880 a NULL-terminated vector. If some arguments need coercion of some
1881 sort, then the coerced values are written into T2. Return value is
1882 0 if the arguments could be matched, or the position at which they
1885 STATICP is nonzero if the T1 argument list came from a static
1886 member function. T2 will still include the ``this'' pointer, but
1889 For non-static member functions, we ignore the first argument,
1890 which is the type of the instance variable. This is because we
1891 want to handle calls with objects from derived classes. This is
1892 not entirely correct: we should actually check to make sure that a
1893 requested operation is type secure, shouldn't we? FIXME. */
1896 typecmp (int staticp
, int varargs
, int nargs
,
1897 struct field t1
[], struct value
*t2
[])
1902 internal_error (__FILE__
, __LINE__
,
1903 _("typecmp: no argument list"));
1905 /* Skip ``this'' argument if applicable. T2 will always include
1911 (i
< nargs
) && TYPE_CODE (t1
[i
].type
) != TYPE_CODE_VOID
;
1914 struct type
*tt1
, *tt2
;
1919 tt1
= check_typedef (t1
[i
].type
);
1920 tt2
= check_typedef (value_type (t2
[i
]));
1922 if (TYPE_CODE (tt1
) == TYPE_CODE_REF
1923 /* We should be doing hairy argument matching, as below. */
1924 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1
)))
1925 == TYPE_CODE (tt2
)))
1927 if (TYPE_CODE (tt2
) == TYPE_CODE_ARRAY
)
1928 t2
[i
] = value_coerce_array (t2
[i
]);
1930 t2
[i
] = value_ref (t2
[i
]);
1934 /* djb - 20000715 - Until the new type structure is in the
1935 place, and we can attempt things like implicit conversions,
1936 we need to do this so you can take something like a map<const
1937 char *>, and properly access map["hello"], because the
1938 argument to [] will be a reference to a pointer to a char,
1939 and the argument will be a pointer to a char. */
1940 while (TYPE_CODE(tt1
) == TYPE_CODE_REF
1941 || TYPE_CODE (tt1
) == TYPE_CODE_PTR
)
1943 tt1
= check_typedef( TYPE_TARGET_TYPE(tt1
) );
1945 while (TYPE_CODE(tt2
) == TYPE_CODE_ARRAY
1946 || TYPE_CODE(tt2
) == TYPE_CODE_PTR
1947 || TYPE_CODE(tt2
) == TYPE_CODE_REF
)
1949 tt2
= check_typedef (TYPE_TARGET_TYPE(tt2
));
1951 if (TYPE_CODE (tt1
) == TYPE_CODE (tt2
))
1953 /* Array to pointer is a `trivial conversion' according to the
1956 /* We should be doing much hairier argument matching (see
1957 section 13.2 of the ARM), but as a quick kludge, just check
1958 for the same type code. */
1959 if (TYPE_CODE (t1
[i
].type
) != TYPE_CODE (value_type (t2
[i
])))
1962 if (varargs
|| t2
[i
] == NULL
)
1967 /* Helper class for do_search_struct_field that updates *RESULT_PTR
1968 and *LAST_BOFFSET, and possibly throws an exception if the field
1969 search has yielded ambiguous results. */
1972 update_search_result (struct value
**result_ptr
, struct value
*v
,
1973 int *last_boffset
, int boffset
,
1974 const char *name
, struct type
*type
)
1978 if (*result_ptr
!= NULL
1979 /* The result is not ambiguous if all the classes that are
1980 found occupy the same space. */
1981 && *last_boffset
!= boffset
)
1982 error (_("base class '%s' is ambiguous in type '%s'"),
1983 name
, TYPE_SAFE_NAME (type
));
1985 *last_boffset
= boffset
;
1989 /* A helper for search_struct_field. This does all the work; most
1990 arguments are as passed to search_struct_field. The result is
1991 stored in *RESULT_PTR, which must be initialized to NULL.
1992 OUTERMOST_TYPE is the type of the initial type passed to
1993 search_struct_field; this is used for error reporting when the
1994 lookup is ambiguous. */
1997 do_search_struct_field (const char *name
, struct value
*arg1
, int offset
,
1998 struct type
*type
, int looking_for_baseclass
,
1999 struct value
**result_ptr
,
2001 struct type
*outermost_type
)
2006 CHECK_TYPEDEF (type
);
2007 nbases
= TYPE_N_BASECLASSES (type
);
2009 if (!looking_for_baseclass
)
2010 for (i
= TYPE_NFIELDS (type
) - 1; i
>= nbases
; i
--)
2012 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
2014 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
2018 if (field_is_static (&TYPE_FIELD (type
, i
)))
2020 v
= value_static_field (type
, i
);
2022 error (_("field %s is nonexistent or "
2023 "has been optimized out"),
2027 v
= value_primitive_field (arg1
, offset
, i
, type
);
2033 && (t_field_name
[0] == '\0'
2034 || (TYPE_CODE (type
) == TYPE_CODE_UNION
2035 && (strcmp_iw (t_field_name
, "else") == 0))))
2037 struct type
*field_type
= TYPE_FIELD_TYPE (type
, i
);
2039 if (TYPE_CODE (field_type
) == TYPE_CODE_UNION
2040 || TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
)
2042 /* Look for a match through the fields of an anonymous
2043 union, or anonymous struct. C++ provides anonymous
2046 In the GNU Chill (now deleted from GDB)
2047 implementation of variant record types, each
2048 <alternative field> has an (anonymous) union type,
2049 each member of the union represents a <variant
2050 alternative>. Each <variant alternative> is
2051 represented as a struct, with a member for each
2054 struct value
*v
= NULL
;
2055 int new_offset
= offset
;
2057 /* This is pretty gross. In G++, the offset in an
2058 anonymous union is relative to the beginning of the
2059 enclosing struct. In the GNU Chill (now deleted
2060 from GDB) implementation of variant records, the
2061 bitpos is zero in an anonymous union field, so we
2062 have to add the offset of the union here. */
2063 if (TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
2064 || (TYPE_NFIELDS (field_type
) > 0
2065 && TYPE_FIELD_BITPOS (field_type
, 0) == 0))
2066 new_offset
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
2068 do_search_struct_field (name
, arg1
, new_offset
,
2070 looking_for_baseclass
, &v
,
2082 for (i
= 0; i
< nbases
; i
++)
2084 struct value
*v
= NULL
;
2085 struct type
*basetype
= check_typedef (TYPE_BASECLASS (type
, i
));
2086 /* If we are looking for baseclasses, this is what we get when
2087 we hit them. But it could happen that the base part's member
2088 name is not yet filled in. */
2089 int found_baseclass
= (looking_for_baseclass
2090 && TYPE_BASECLASS_NAME (type
, i
) != NULL
2091 && (strcmp_iw (name
,
2092 TYPE_BASECLASS_NAME (type
,
2094 int boffset
= value_embedded_offset (arg1
) + offset
;
2096 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2100 boffset
= baseclass_offset (type
, i
,
2101 value_contents_for_printing (arg1
),
2102 value_embedded_offset (arg1
) + offset
,
2103 value_address (arg1
),
2106 /* The virtual base class pointer might have been clobbered
2107 by the user program. Make sure that it still points to a
2108 valid memory location. */
2110 boffset
+= value_embedded_offset (arg1
) + offset
;
2112 || boffset
>= TYPE_LENGTH (value_enclosing_type (arg1
)))
2114 CORE_ADDR base_addr
;
2116 v2
= allocate_value (basetype
);
2117 base_addr
= value_address (arg1
) + boffset
;
2118 if (target_read_memory (base_addr
,
2119 value_contents_raw (v2
),
2120 TYPE_LENGTH (basetype
)) != 0)
2121 error (_("virtual baseclass botch"));
2122 VALUE_LVAL (v2
) = lval_memory
;
2123 set_value_address (v2
, base_addr
);
2127 v2
= value_copy (arg1
);
2128 deprecated_set_value_type (v2
, basetype
);
2129 set_value_embedded_offset (v2
, boffset
);
2132 if (found_baseclass
)
2136 do_search_struct_field (name
, v2
, 0,
2137 TYPE_BASECLASS (type
, i
),
2138 looking_for_baseclass
,
2139 result_ptr
, last_boffset
,
2143 else if (found_baseclass
)
2144 v
= value_primitive_field (arg1
, offset
, i
, type
);
2147 do_search_struct_field (name
, arg1
,
2148 offset
+ TYPE_BASECLASS_BITPOS (type
,
2150 basetype
, looking_for_baseclass
,
2151 result_ptr
, last_boffset
,
2155 update_search_result (result_ptr
, v
, last_boffset
,
2156 boffset
, name
, outermost_type
);
2160 /* Helper function used by value_struct_elt to recurse through
2161 baseclasses. Look for a field NAME in ARG1. Adjust the address of
2162 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
2163 TYPE. If found, return value, else return NULL.
2165 If LOOKING_FOR_BASECLASS, then instead of looking for struct
2166 fields, look for a baseclass named NAME. */
2168 static struct value
*
2169 search_struct_field (const char *name
, struct value
*arg1
, int offset
,
2170 struct type
*type
, int looking_for_baseclass
)
2172 struct value
*result
= NULL
;
2175 do_search_struct_field (name
, arg1
, offset
, type
, looking_for_baseclass
,
2176 &result
, &boffset
, type
);
2180 /* Helper function used by value_struct_elt to recurse through
2181 baseclasses. Look for a field NAME in ARG1. Adjust the address of
2182 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
2185 If found, return value, else if name matched and args not return
2186 (value) -1, else return NULL. */
2188 static struct value
*
2189 search_struct_method (const char *name
, struct value
**arg1p
,
2190 struct value
**args
, int offset
,
2191 int *static_memfuncp
, struct type
*type
)
2195 int name_matched
= 0;
2196 char dem_opname
[64];
2198 CHECK_TYPEDEF (type
);
2199 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
2201 const char *t_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
2203 /* FIXME! May need to check for ARM demangling here. */
2204 if (strncmp (t_field_name
, "__", 2) == 0 ||
2205 strncmp (t_field_name
, "op", 2) == 0 ||
2206 strncmp (t_field_name
, "type", 4) == 0)
2208 if (cplus_demangle_opname (t_field_name
, dem_opname
, DMGL_ANSI
))
2209 t_field_name
= dem_opname
;
2210 else if (cplus_demangle_opname (t_field_name
, dem_opname
, 0))
2211 t_field_name
= dem_opname
;
2213 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
2215 int j
= TYPE_FN_FIELDLIST_LENGTH (type
, i
) - 1;
2216 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
2219 check_stub_method_group (type
, i
);
2220 if (j
> 0 && args
== 0)
2221 error (_("cannot resolve overloaded method "
2222 "`%s': no arguments supplied"), name
);
2223 else if (j
== 0 && args
== 0)
2225 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
2232 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f
, j
),
2233 TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f
, j
)),
2234 TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f
, j
)),
2235 TYPE_FN_FIELD_ARGS (f
, j
), args
))
2237 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
2238 return value_virtual_fn_field (arg1p
, f
, j
,
2240 if (TYPE_FN_FIELD_STATIC_P (f
, j
)
2242 *static_memfuncp
= 1;
2243 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
2252 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2258 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2260 struct type
*baseclass
= check_typedef (TYPE_BASECLASS (type
, i
));
2261 struct value
*base_val
;
2262 const gdb_byte
*base_valaddr
;
2264 /* The virtual base class pointer might have been
2265 clobbered by the user program. Make sure that it
2266 still points to a valid memory location. */
2268 if (offset
< 0 || offset
>= TYPE_LENGTH (type
))
2271 struct cleanup
*back_to
;
2274 tmp
= xmalloc (TYPE_LENGTH (baseclass
));
2275 back_to
= make_cleanup (xfree
, tmp
);
2276 address
= value_address (*arg1p
);
2278 if (target_read_memory (address
+ offset
,
2279 tmp
, TYPE_LENGTH (baseclass
)) != 0)
2280 error (_("virtual baseclass botch"));
2282 base_val
= value_from_contents_and_address (baseclass
,
2285 base_valaddr
= value_contents_for_printing (base_val
);
2287 do_cleanups (back_to
);
2292 base_valaddr
= value_contents_for_printing (*arg1p
);
2293 this_offset
= offset
;
2296 base_offset
= baseclass_offset (type
, i
, base_valaddr
,
2297 this_offset
, value_address (base_val
),
2302 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2304 v
= search_struct_method (name
, arg1p
, args
, base_offset
+ offset
,
2305 static_memfuncp
, TYPE_BASECLASS (type
, i
));
2306 if (v
== (struct value
*) - 1)
2312 /* FIXME-bothner: Why is this commented out? Why is it here? */
2313 /* *arg1p = arg1_tmp; */
2318 return (struct value
*) - 1;
2323 /* Given *ARGP, a value of type (pointer to a)* structure/union,
2324 extract the component named NAME from the ultimate target
2325 structure/union and return it as a value with its appropriate type.
2326 ERR is used in the error message if *ARGP's type is wrong.
2328 C++: ARGS is a list of argument types to aid in the selection of
2329 an appropriate method. Also, handle derived types.
2331 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
2332 where the truthvalue of whether the function that was resolved was
2333 a static member function or not is stored.
2335 ERR is an error message to be printed in case the field is not
2339 value_struct_elt (struct value
**argp
, struct value
**args
,
2340 const char *name
, int *static_memfuncp
, const char *err
)
2345 *argp
= coerce_array (*argp
);
2347 t
= check_typedef (value_type (*argp
));
2349 /* Follow pointers until we get to a non-pointer. */
2351 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
2353 *argp
= value_ind (*argp
);
2354 /* Don't coerce fn pointer to fn and then back again! */
2355 if (TYPE_CODE (value_type (*argp
)) != TYPE_CODE_FUNC
)
2356 *argp
= coerce_array (*argp
);
2357 t
= check_typedef (value_type (*argp
));
2360 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2361 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2362 error (_("Attempt to extract a component of a value that is not a %s."),
2365 /* Assume it's not, unless we see that it is. */
2366 if (static_memfuncp
)
2367 *static_memfuncp
= 0;
2371 /* if there are no arguments ...do this... */
2373 /* Try as a field first, because if we succeed, there is less
2375 v
= search_struct_field (name
, *argp
, 0, t
, 0);
2379 /* C++: If it was not found as a data field, then try to
2380 return it as a pointer to a method. */
2381 v
= search_struct_method (name
, argp
, args
, 0,
2382 static_memfuncp
, t
);
2384 if (v
== (struct value
*) - 1)
2385 error (_("Cannot take address of method %s."), name
);
2388 if (TYPE_NFN_FIELDS (t
))
2389 error (_("There is no member or method named %s."), name
);
2391 error (_("There is no member named %s."), name
);
2396 v
= search_struct_method (name
, argp
, args
, 0,
2397 static_memfuncp
, t
);
2399 if (v
== (struct value
*) - 1)
2401 error (_("One of the arguments you tried to pass to %s could not "
2402 "be converted to what the function wants."), name
);
2406 /* See if user tried to invoke data as function. If so, hand it
2407 back. If it's not callable (i.e., a pointer to function),
2408 gdb should give an error. */
2409 v
= search_struct_field (name
, *argp
, 0, t
, 0);
2410 /* If we found an ordinary field, then it is not a method call.
2411 So, treat it as if it were a static member function. */
2412 if (v
&& static_memfuncp
)
2413 *static_memfuncp
= 1;
2417 throw_error (NOT_FOUND_ERROR
,
2418 _("Structure has no component named %s."), name
);
2422 /* Search through the methods of an object (and its bases) to find a
2423 specified method. Return the pointer to the fn_field list of
2424 overloaded instances.
2426 Helper function for value_find_oload_list.
2427 ARGP is a pointer to a pointer to a value (the object).
2428 METHOD is a string containing the method name.
2429 OFFSET is the offset within the value.
2430 TYPE is the assumed type of the object.
2431 NUM_FNS is the number of overloaded instances.
2432 BASETYPE is set to the actual type of the subobject where the
2434 BOFFSET is the offset of the base subobject where the method is found. */
2436 static struct fn_field
*
2437 find_method_list (struct value
**argp
, const char *method
,
2438 int offset
, struct type
*type
, int *num_fns
,
2439 struct type
**basetype
, int *boffset
)
2443 CHECK_TYPEDEF (type
);
2447 /* First check in object itself. */
2448 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
2450 /* pai: FIXME What about operators and type conversions? */
2451 const char *fn_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
2453 if (fn_field_name
&& (strcmp_iw (fn_field_name
, method
) == 0))
2455 int len
= TYPE_FN_FIELDLIST_LENGTH (type
, i
);
2456 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
2462 /* Resolve any stub methods. */
2463 check_stub_method_group (type
, i
);
2469 /* Not found in object, check in base subobjects. */
2470 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2474 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2476 base_offset
= baseclass_offset (type
, i
,
2477 value_contents_for_printing (*argp
),
2478 value_offset (*argp
) + offset
,
2479 value_address (*argp
), *argp
);
2481 else /* Non-virtual base, simply use bit position from debug
2484 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2486 f
= find_method_list (argp
, method
, base_offset
+ offset
,
2487 TYPE_BASECLASS (type
, i
), num_fns
,
2495 /* Return the list of overloaded methods of a specified name.
2497 ARGP is a pointer to a pointer to a value (the object).
2498 METHOD is the method name.
2499 OFFSET is the offset within the value contents.
2500 NUM_FNS is the number of overloaded instances.
2501 BASETYPE is set to the type of the base subobject that defines the
2503 BOFFSET is the offset of the base subobject which defines the method. */
2505 static struct fn_field
*
2506 value_find_oload_method_list (struct value
**argp
, const char *method
,
2507 int offset
, int *num_fns
,
2508 struct type
**basetype
, int *boffset
)
2512 t
= check_typedef (value_type (*argp
));
2514 /* Code snarfed from value_struct_elt. */
2515 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
2517 *argp
= value_ind (*argp
);
2518 /* Don't coerce fn pointer to fn and then back again! */
2519 if (TYPE_CODE (value_type (*argp
)) != TYPE_CODE_FUNC
)
2520 *argp
= coerce_array (*argp
);
2521 t
= check_typedef (value_type (*argp
));
2524 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2525 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2526 error (_("Attempt to extract a component of a "
2527 "value that is not a struct or union"));
2529 return find_method_list (argp
, method
, 0, t
, num_fns
,
2533 /* Given an array of arguments (ARGS) (which includes an
2534 entry for "this" in the case of C++ methods), the number of
2535 arguments NARGS, the NAME of a function whether it's a method or
2536 not (METHOD), and the degree of laxness (LAX) in conforming to
2537 overload resolution rules in ANSI C++, find the best function that
2538 matches on the argument types according to the overload resolution
2541 METHOD can be one of three values:
2542 NON_METHOD for non-member functions.
2543 METHOD: for member functions.
2544 BOTH: used for overload resolution of operators where the
2545 candidates are expected to be either member or non member
2546 functions. In this case the first argument ARGTYPES
2547 (representing 'this') is expected to be a reference to the
2548 target object, and will be dereferenced when attempting the
2551 In the case of class methods, the parameter OBJ is an object value
2552 in which to search for overloaded methods.
2554 In the case of non-method functions, the parameter FSYM is a symbol
2555 corresponding to one of the overloaded functions.
2557 Return value is an integer: 0 -> good match, 10 -> debugger applied
2558 non-standard coercions, 100 -> incompatible.
2560 If a method is being searched for, VALP will hold the value.
2561 If a non-method is being searched for, SYMP will hold the symbol
2564 If a method is being searched for, and it is a static method,
2565 then STATICP will point to a non-zero value.
2567 If NO_ADL argument dependent lookup is disabled. This is used to prevent
2568 ADL overload candidates when performing overload resolution for a fully
2571 Note: This function does *not* check the value of
2572 overload_resolution. Caller must check it to see whether overload
2573 resolution is permitted. */
2576 find_overload_match (struct value
**args
, int nargs
,
2577 const char *name
, enum oload_search_type method
,
2578 int lax
, struct value
**objp
, struct symbol
*fsym
,
2579 struct value
**valp
, struct symbol
**symp
,
2580 int *staticp
, const int no_adl
)
2582 struct value
*obj
= (objp
? *objp
: NULL
);
2583 struct type
*obj_type
= obj
? value_type (obj
) : NULL
;
2584 /* Index of best overloaded function. */
2585 int func_oload_champ
= -1;
2586 int method_oload_champ
= -1;
2588 /* The measure for the current best match. */
2589 struct badness_vector
*method_badness
= NULL
;
2590 struct badness_vector
*func_badness
= NULL
;
2592 struct value
*temp
= obj
;
2593 /* For methods, the list of overloaded methods. */
2594 struct fn_field
*fns_ptr
= NULL
;
2595 /* For non-methods, the list of overloaded function symbols. */
2596 struct symbol
**oload_syms
= NULL
;
2597 /* Number of overloaded instances being considered. */
2599 struct type
*basetype
= NULL
;
2602 struct cleanup
*all_cleanups
= make_cleanup (null_cleanup
, NULL
);
2604 const char *obj_type_name
= NULL
;
2605 const char *func_name
= NULL
;
2606 enum oload_classification match_quality
;
2607 enum oload_classification method_match_quality
= INCOMPATIBLE
;
2608 enum oload_classification func_match_quality
= INCOMPATIBLE
;
2610 /* Get the list of overloaded methods or functions. */
2611 if (method
== METHOD
|| method
== BOTH
)
2615 /* OBJ may be a pointer value rather than the object itself. */
2616 obj
= coerce_ref (obj
);
2617 while (TYPE_CODE (check_typedef (value_type (obj
))) == TYPE_CODE_PTR
)
2618 obj
= coerce_ref (value_ind (obj
));
2619 obj_type_name
= TYPE_NAME (value_type (obj
));
2621 /* First check whether this is a data member, e.g. a pointer to
2623 if (TYPE_CODE (check_typedef (value_type (obj
))) == TYPE_CODE_STRUCT
)
2625 *valp
= search_struct_field (name
, obj
, 0,
2626 check_typedef (value_type (obj
)), 0);
2630 do_cleanups (all_cleanups
);
2635 /* Retrieve the list of methods with the name NAME. */
2636 fns_ptr
= value_find_oload_method_list (&temp
, name
,
2638 &basetype
, &boffset
);
2639 /* If this is a method only search, and no methods were found
2640 the search has faild. */
2641 if (method
== METHOD
&& (!fns_ptr
|| !num_fns
))
2642 error (_("Couldn't find method %s%s%s"),
2644 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2646 /* If we are dealing with stub method types, they should have
2647 been resolved by find_method_list via
2648 value_find_oload_method_list above. */
2651 gdb_assert (TYPE_DOMAIN_TYPE (fns_ptr
[0].type
) != NULL
);
2652 method_oload_champ
= find_oload_champ (args
, nargs
, method
,
2654 oload_syms
, &method_badness
);
2656 method_match_quality
=
2657 classify_oload_match (method_badness
, nargs
,
2658 oload_method_static (method
, fns_ptr
,
2659 method_oload_champ
));
2661 make_cleanup (xfree
, method_badness
);
2666 if (method
== NON_METHOD
|| method
== BOTH
)
2668 const char *qualified_name
= NULL
;
2670 /* If the overload match is being search for both as a method
2671 and non member function, the first argument must now be
2674 args
[0] = value_ind (args
[0]);
2678 qualified_name
= SYMBOL_NATURAL_NAME (fsym
);
2680 /* If we have a function with a C++ name, try to extract just
2681 the function part. Do not try this for non-functions (e.g.
2682 function pointers). */
2684 && TYPE_CODE (check_typedef (SYMBOL_TYPE (fsym
)))
2689 temp
= cp_func_name (qualified_name
);
2691 /* If cp_func_name did not remove anything, the name of the
2692 symbol did not include scope or argument types - it was
2693 probably a C-style function. */
2696 make_cleanup (xfree
, temp
);
2697 if (strcmp (temp
, qualified_name
) == 0)
2707 qualified_name
= name
;
2710 /* If there was no C++ name, this must be a C-style function or
2711 not a function at all. Just return the same symbol. Do the
2712 same if cp_func_name fails for some reason. */
2713 if (func_name
== NULL
)
2716 do_cleanups (all_cleanups
);
2720 func_oload_champ
= find_oload_champ_namespace (args
, nargs
,
2727 if (func_oload_champ
>= 0)
2728 func_match_quality
= classify_oload_match (func_badness
, nargs
, 0);
2730 make_cleanup (xfree
, oload_syms
);
2731 make_cleanup (xfree
, func_badness
);
2734 /* Did we find a match ? */
2735 if (method_oload_champ
== -1 && func_oload_champ
== -1)
2736 throw_error (NOT_FOUND_ERROR
,
2737 _("No symbol \"%s\" in current context."),
2740 /* If we have found both a method match and a function
2741 match, find out which one is better, and calculate match
2743 if (method_oload_champ
>= 0 && func_oload_champ
>= 0)
2745 switch (compare_badness (func_badness
, method_badness
))
2747 case 0: /* Top two contenders are equally good. */
2748 /* FIXME: GDB does not support the general ambiguous case.
2749 All candidates should be collected and presented the
2751 error (_("Ambiguous overload resolution"));
2753 case 1: /* Incomparable top contenders. */
2754 /* This is an error incompatible candidates
2755 should not have been proposed. */
2756 error (_("Internal error: incompatible "
2757 "overload candidates proposed"));
2759 case 2: /* Function champion. */
2760 method_oload_champ
= -1;
2761 match_quality
= func_match_quality
;
2763 case 3: /* Method champion. */
2764 func_oload_champ
= -1;
2765 match_quality
= method_match_quality
;
2768 error (_("Internal error: unexpected overload comparison result"));
2774 /* We have either a method match or a function match. */
2775 if (method_oload_champ
>= 0)
2776 match_quality
= method_match_quality
;
2778 match_quality
= func_match_quality
;
2781 if (match_quality
== INCOMPATIBLE
)
2783 if (method
== METHOD
)
2784 error (_("Cannot resolve method %s%s%s to any overloaded instance"),
2786 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2789 error (_("Cannot resolve function %s to any overloaded instance"),
2792 else if (match_quality
== NON_STANDARD
)
2794 if (method
== METHOD
)
2795 warning (_("Using non-standard conversion to match "
2796 "method %s%s%s to supplied arguments"),
2798 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2801 warning (_("Using non-standard conversion to match "
2802 "function %s to supplied arguments"),
2806 if (staticp
!= NULL
)
2807 *staticp
= oload_method_static (method
, fns_ptr
, method_oload_champ
);
2809 if (method_oload_champ
>= 0)
2811 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr
, method_oload_champ
))
2812 *valp
= value_virtual_fn_field (&temp
, fns_ptr
, method_oload_champ
,
2815 *valp
= value_fn_field (&temp
, fns_ptr
, method_oload_champ
,
2819 *symp
= oload_syms
[func_oload_champ
];
2823 struct type
*temp_type
= check_typedef (value_type (temp
));
2824 struct type
*objtype
= check_typedef (obj_type
);
2826 if (TYPE_CODE (temp_type
) != TYPE_CODE_PTR
2827 && (TYPE_CODE (objtype
) == TYPE_CODE_PTR
2828 || TYPE_CODE (objtype
) == TYPE_CODE_REF
))
2830 temp
= value_addr (temp
);
2835 do_cleanups (all_cleanups
);
2837 switch (match_quality
)
2843 default: /* STANDARD */
2848 /* Find the best overload match, searching for FUNC_NAME in namespaces
2849 contained in QUALIFIED_NAME until it either finds a good match or
2850 runs out of namespaces. It stores the overloaded functions in
2851 *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. The
2852 calling function is responsible for freeing *OLOAD_SYMS and
2853 *OLOAD_CHAMP_BV. If NO_ADL, argument dependent lookup is not
2857 find_oload_champ_namespace (struct value
**args
, int nargs
,
2858 const char *func_name
,
2859 const char *qualified_name
,
2860 struct symbol
***oload_syms
,
2861 struct badness_vector
**oload_champ_bv
,
2866 find_oload_champ_namespace_loop (args
, nargs
,
2869 oload_syms
, oload_champ_bv
,
2876 /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is
2877 how deep we've looked for namespaces, and the champ is stored in
2878 OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0
2879 if it isn't. Other arguments are the same as in
2880 find_oload_champ_namespace
2882 It is the caller's responsibility to free *OLOAD_SYMS and
2886 find_oload_champ_namespace_loop (struct value
**args
, int nargs
,
2887 const char *func_name
,
2888 const char *qualified_name
,
2890 struct symbol
***oload_syms
,
2891 struct badness_vector
**oload_champ_bv
,
2895 int next_namespace_len
= namespace_len
;
2896 int searched_deeper
= 0;
2898 struct cleanup
*old_cleanups
;
2899 int new_oload_champ
;
2900 struct symbol
**new_oload_syms
;
2901 struct badness_vector
*new_oload_champ_bv
;
2902 char *new_namespace
;
2904 if (next_namespace_len
!= 0)
2906 gdb_assert (qualified_name
[next_namespace_len
] == ':');
2907 next_namespace_len
+= 2;
2909 next_namespace_len
+=
2910 cp_find_first_component (qualified_name
+ next_namespace_len
);
2912 /* Initialize these to values that can safely be xfree'd. */
2914 *oload_champ_bv
= NULL
;
2916 /* First, see if we have a deeper namespace we can search in.
2917 If we get a good match there, use it. */
2919 if (qualified_name
[next_namespace_len
] == ':')
2921 searched_deeper
= 1;
2923 if (find_oload_champ_namespace_loop (args
, nargs
,
2924 func_name
, qualified_name
,
2926 oload_syms
, oload_champ_bv
,
2927 oload_champ
, no_adl
))
2933 /* If we reach here, either we're in the deepest namespace or we
2934 didn't find a good match in a deeper namespace. But, in the
2935 latter case, we still have a bad match in a deeper namespace;
2936 note that we might not find any match at all in the current
2937 namespace. (There's always a match in the deepest namespace,
2938 because this overload mechanism only gets called if there's a
2939 function symbol to start off with.) */
2941 old_cleanups
= make_cleanup (xfree
, *oload_syms
);
2942 make_cleanup (xfree
, *oload_champ_bv
);
2943 new_namespace
= alloca (namespace_len
+ 1);
2944 strncpy (new_namespace
, qualified_name
, namespace_len
);
2945 new_namespace
[namespace_len
] = '\0';
2946 new_oload_syms
= make_symbol_overload_list (func_name
,
2949 /* If we have reached the deepest level perform argument
2950 determined lookup. */
2951 if (!searched_deeper
&& !no_adl
)
2954 struct type
**arg_types
;
2956 /* Prepare list of argument types for overload resolution. */
2957 arg_types
= (struct type
**)
2958 alloca (nargs
* (sizeof (struct type
*)));
2959 for (ix
= 0; ix
< nargs
; ix
++)
2960 arg_types
[ix
] = value_type (args
[ix
]);
2961 make_symbol_overload_list_adl (arg_types
, nargs
, func_name
);
2964 while (new_oload_syms
[num_fns
])
2967 new_oload_champ
= find_oload_champ (args
, nargs
, 0, num_fns
,
2968 NULL
, new_oload_syms
,
2969 &new_oload_champ_bv
);
2971 /* Case 1: We found a good match. Free earlier matches (if any),
2972 and return it. Case 2: We didn't find a good match, but we're
2973 not the deepest function. Then go with the bad match that the
2974 deeper function found. Case 3: We found a bad match, and we're
2975 the deepest function. Then return what we found, even though
2976 it's a bad match. */
2978 if (new_oload_champ
!= -1
2979 && classify_oload_match (new_oload_champ_bv
, nargs
, 0) == STANDARD
)
2981 *oload_syms
= new_oload_syms
;
2982 *oload_champ
= new_oload_champ
;
2983 *oload_champ_bv
= new_oload_champ_bv
;
2984 do_cleanups (old_cleanups
);
2987 else if (searched_deeper
)
2989 xfree (new_oload_syms
);
2990 xfree (new_oload_champ_bv
);
2991 discard_cleanups (old_cleanups
);
2996 *oload_syms
= new_oload_syms
;
2997 *oload_champ
= new_oload_champ
;
2998 *oload_champ_bv
= new_oload_champ_bv
;
2999 do_cleanups (old_cleanups
);
3004 /* Look for a function to take NARGS args of ARGS. Find
3005 the best match from among the overloaded methods or functions
3006 (depending on METHOD) given by FNS_PTR or OLOAD_SYMS, respectively.
3007 The number of methods/functions in the list is given by NUM_FNS.
3008 Return the index of the best match; store an indication of the
3009 quality of the match in OLOAD_CHAMP_BV.
3011 It is the caller's responsibility to free *OLOAD_CHAMP_BV. */
3014 find_oload_champ (struct value
**args
, int nargs
, int method
,
3015 int num_fns
, struct fn_field
*fns_ptr
,
3016 struct symbol
**oload_syms
,
3017 struct badness_vector
**oload_champ_bv
)
3020 /* A measure of how good an overloaded instance is. */
3021 struct badness_vector
*bv
;
3022 /* Index of best overloaded function. */
3023 int oload_champ
= -1;
3024 /* Current ambiguity state for overload resolution. */
3025 int oload_ambiguous
= 0;
3026 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */
3028 *oload_champ_bv
= NULL
;
3030 /* Consider each candidate in turn. */
3031 for (ix
= 0; ix
< num_fns
; ix
++)
3034 int static_offset
= oload_method_static (method
, fns_ptr
, ix
);
3036 struct type
**parm_types
;
3040 nparms
= TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (fns_ptr
, ix
));
3044 /* If it's not a method, this is the proper place. */
3045 nparms
= TYPE_NFIELDS (SYMBOL_TYPE (oload_syms
[ix
]));
3048 /* Prepare array of parameter types. */
3049 parm_types
= (struct type
**)
3050 xmalloc (nparms
* (sizeof (struct type
*)));
3051 for (jj
= 0; jj
< nparms
; jj
++)
3052 parm_types
[jj
] = (method
3053 ? (TYPE_FN_FIELD_ARGS (fns_ptr
, ix
)[jj
].type
)
3054 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms
[ix
]),
3057 /* Compare parameter types to supplied argument types. Skip
3058 THIS for static methods. */
3059 bv
= rank_function (parm_types
, nparms
,
3060 args
+ static_offset
,
3061 nargs
- static_offset
);
3063 if (!*oload_champ_bv
)
3065 *oload_champ_bv
= bv
;
3068 else /* See whether current candidate is better or worse than
3070 switch (compare_badness (bv
, *oload_champ_bv
))
3072 case 0: /* Top two contenders are equally good. */
3073 oload_ambiguous
= 1;
3075 case 1: /* Incomparable top contenders. */
3076 oload_ambiguous
= 2;
3078 case 2: /* New champion, record details. */
3079 *oload_champ_bv
= bv
;
3080 oload_ambiguous
= 0;
3091 fprintf_filtered (gdb_stderr
,
3092 "Overloaded method instance %s, # of parms %d\n",
3093 fns_ptr
[ix
].physname
, nparms
);
3095 fprintf_filtered (gdb_stderr
,
3096 "Overloaded function instance "
3097 "%s # of parms %d\n",
3098 SYMBOL_DEMANGLED_NAME (oload_syms
[ix
]),
3100 for (jj
= 0; jj
< nargs
- static_offset
; jj
++)
3101 fprintf_filtered (gdb_stderr
,
3102 "...Badness @ %d : %d\n",
3103 jj
, bv
->rank
[jj
].rank
);
3104 fprintf_filtered (gdb_stderr
, "Overload resolution "
3105 "champion is %d, ambiguous? %d\n",
3106 oload_champ
, oload_ambiguous
);
3113 /* Return 1 if we're looking at a static method, 0 if we're looking at
3114 a non-static method or a function that isn't a method. */
3117 oload_method_static (int method
, struct fn_field
*fns_ptr
, int index
)
3119 if (method
&& fns_ptr
&& index
>= 0
3120 && TYPE_FN_FIELD_STATIC_P (fns_ptr
, index
))
3126 /* Check how good an overload match OLOAD_CHAMP_BV represents. */
3128 static enum oload_classification
3129 classify_oload_match (struct badness_vector
*oload_champ_bv
,
3134 enum oload_classification worst
= STANDARD
;
3136 for (ix
= 1; ix
<= nargs
- static_offset
; ix
++)
3138 /* If this conversion is as bad as INCOMPATIBLE_TYPE_BADNESS
3139 or worse return INCOMPATIBLE. */
3140 if (compare_ranks (oload_champ_bv
->rank
[ix
],
3141 INCOMPATIBLE_TYPE_BADNESS
) <= 0)
3142 return INCOMPATIBLE
; /* Truly mismatched types. */
3143 /* Otherwise If this conversion is as bad as
3144 NS_POINTER_CONVERSION_BADNESS or worse return NON_STANDARD. */
3145 else if (compare_ranks (oload_champ_bv
->rank
[ix
],
3146 NS_POINTER_CONVERSION_BADNESS
) <= 0)
3147 worst
= NON_STANDARD
; /* Non-standard type conversions
3151 /* If no INCOMPATIBLE classification was found, return the worst one
3152 that was found (if any). */
3156 /* C++: return 1 is NAME is a legitimate name for the destructor of
3157 type TYPE. If TYPE does not have a destructor, or if NAME is
3158 inappropriate for TYPE, an error is signaled. Parameter TYPE should not yet
3159 have CHECK_TYPEDEF applied, this function will apply it itself. */
3162 destructor_name_p (const char *name
, struct type
*type
)
3166 const char *dname
= type_name_no_tag_or_error (type
);
3167 const char *cp
= strchr (dname
, '<');
3170 /* Do not compare the template part for template classes. */
3172 len
= strlen (dname
);
3175 if (strlen (name
+ 1) != len
|| strncmp (dname
, name
+ 1, len
) != 0)
3176 error (_("name of destructor must equal name of class"));
3183 /* Given TYPE, a structure/union,
3184 return 1 if the component named NAME from the ultimate target
3185 structure/union is defined, otherwise, return 0. */
3188 check_field (struct type
*type
, const char *name
)
3192 /* The type may be a stub. */
3193 CHECK_TYPEDEF (type
);
3195 for (i
= TYPE_NFIELDS (type
) - 1; i
>= TYPE_N_BASECLASSES (type
); i
--)
3197 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
3199 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
3203 /* C++: If it was not found as a data field, then try to return it
3204 as a pointer to a method. */
3206 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; --i
)
3208 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type
, i
), name
) == 0)
3212 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
3213 if (check_field (TYPE_BASECLASS (type
, i
), name
))
3219 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3220 return the appropriate member (or the address of the member, if
3221 WANT_ADDRESS). This function is used to resolve user expressions
3222 of the form "DOMAIN::NAME". For more details on what happens, see
3223 the comment before value_struct_elt_for_reference. */
3226 value_aggregate_elt (struct type
*curtype
, char *name
,
3227 struct type
*expect_type
, int want_address
,
3230 switch (TYPE_CODE (curtype
))
3232 case TYPE_CODE_STRUCT
:
3233 case TYPE_CODE_UNION
:
3234 return value_struct_elt_for_reference (curtype
, 0, curtype
,
3236 want_address
, noside
);
3237 case TYPE_CODE_NAMESPACE
:
3238 return value_namespace_elt (curtype
, name
,
3239 want_address
, noside
);
3241 internal_error (__FILE__
, __LINE__
,
3242 _("non-aggregate type in value_aggregate_elt"));
3246 /* Compares the two method/function types T1 and T2 for "equality"
3247 with respect to the methods' parameters. If the types of the
3248 two parameter lists are the same, returns 1; 0 otherwise. This
3249 comparison may ignore any artificial parameters in T1 if
3250 SKIP_ARTIFICIAL is non-zero. This function will ALWAYS skip
3251 the first artificial parameter in T1, assumed to be a 'this' pointer.
3253 The type T2 is expected to have come from make_params (in eval.c). */
3256 compare_parameters (struct type
*t1
, struct type
*t2
, int skip_artificial
)
3260 if (TYPE_NFIELDS (t1
) > 0 && TYPE_FIELD_ARTIFICIAL (t1
, 0))
3263 /* If skipping artificial fields, find the first real field
3265 if (skip_artificial
)
3267 while (start
< TYPE_NFIELDS (t1
)
3268 && TYPE_FIELD_ARTIFICIAL (t1
, start
))
3272 /* Now compare parameters. */
3274 /* Special case: a method taking void. T1 will contain no
3275 non-artificial fields, and T2 will contain TYPE_CODE_VOID. */
3276 if ((TYPE_NFIELDS (t1
) - start
) == 0 && TYPE_NFIELDS (t2
) == 1
3277 && TYPE_CODE (TYPE_FIELD_TYPE (t2
, 0)) == TYPE_CODE_VOID
)
3280 if ((TYPE_NFIELDS (t1
) - start
) == TYPE_NFIELDS (t2
))
3284 for (i
= 0; i
< TYPE_NFIELDS (t2
); ++i
)
3286 if (compare_ranks (rank_one_type (TYPE_FIELD_TYPE (t1
, start
+ i
),
3287 TYPE_FIELD_TYPE (t2
, i
), NULL
),
3288 EXACT_MATCH_BADNESS
) != 0)
3298 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3299 return the address of this member as a "pointer to member" type.
3300 If INTYPE is non-null, then it will be the type of the member we
3301 are looking for. This will help us resolve "pointers to member
3302 functions". This function is used to resolve user expressions of
3303 the form "DOMAIN::NAME". */
3305 static struct value
*
3306 value_struct_elt_for_reference (struct type
*domain
, int offset
,
3307 struct type
*curtype
, char *name
,
3308 struct type
*intype
,
3312 struct type
*t
= curtype
;
3314 struct value
*v
, *result
;
3316 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
3317 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
3318 error (_("Internal error: non-aggregate type "
3319 "to value_struct_elt_for_reference"));
3321 for (i
= TYPE_NFIELDS (t
) - 1; i
>= TYPE_N_BASECLASSES (t
); i
--)
3323 const char *t_field_name
= TYPE_FIELD_NAME (t
, i
);
3325 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
3327 if (field_is_static (&TYPE_FIELD (t
, i
)))
3329 v
= value_static_field (t
, i
);
3331 error (_("static field %s has been optimized out"),
3337 if (TYPE_FIELD_PACKED (t
, i
))
3338 error (_("pointers to bitfield members not allowed"));
3341 return value_from_longest
3342 (lookup_memberptr_type (TYPE_FIELD_TYPE (t
, i
), domain
),
3343 offset
+ (LONGEST
) (TYPE_FIELD_BITPOS (t
, i
) >> 3));
3344 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
3345 return allocate_value (TYPE_FIELD_TYPE (t
, i
));
3347 error (_("Cannot reference non-static field \"%s\""), name
);
3351 /* C++: If it was not found as a data field, then try to return it
3352 as a pointer to a method. */
3354 /* Perform all necessary dereferencing. */
3355 while (intype
&& TYPE_CODE (intype
) == TYPE_CODE_PTR
)
3356 intype
= TYPE_TARGET_TYPE (intype
);
3358 for (i
= TYPE_NFN_FIELDS (t
) - 1; i
>= 0; --i
)
3360 const char *t_field_name
= TYPE_FN_FIELDLIST_NAME (t
, i
);
3361 char dem_opname
[64];
3363 if (strncmp (t_field_name
, "__", 2) == 0
3364 || strncmp (t_field_name
, "op", 2) == 0
3365 || strncmp (t_field_name
, "type", 4) == 0)
3367 if (cplus_demangle_opname (t_field_name
,
3368 dem_opname
, DMGL_ANSI
))
3369 t_field_name
= dem_opname
;
3370 else if (cplus_demangle_opname (t_field_name
,
3372 t_field_name
= dem_opname
;
3374 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
3377 int len
= TYPE_FN_FIELDLIST_LENGTH (t
, i
);
3378 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (t
, i
);
3380 check_stub_method_group (t
, i
);
3384 for (j
= 0; j
< len
; ++j
)
3386 if (compare_parameters (TYPE_FN_FIELD_TYPE (f
, j
), intype
, 0)
3387 || compare_parameters (TYPE_FN_FIELD_TYPE (f
, j
),
3393 error (_("no member function matches "
3394 "that type instantiation"));
3401 for (ii
= 0; ii
< len
; ++ii
)
3403 /* Skip artificial methods. This is necessary if,
3404 for example, the user wants to "print
3405 subclass::subclass" with only one user-defined
3406 constructor. There is no ambiguity in this case.
3407 We are careful here to allow artificial methods
3408 if they are the unique result. */
3409 if (TYPE_FN_FIELD_ARTIFICIAL (f
, ii
))
3416 /* Desired method is ambiguous if more than one
3417 method is defined. */
3418 if (j
!= -1 && !TYPE_FN_FIELD_ARTIFICIAL (f
, j
))
3419 error (_("non-unique member `%s' requires "
3420 "type instantiation"), name
);
3426 error (_("no matching member function"));
3429 if (TYPE_FN_FIELD_STATIC_P (f
, j
))
3432 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
3439 return value_addr (read_var_value (s
, 0));
3441 return read_var_value (s
, 0);
3444 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
3448 result
= allocate_value
3449 (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
3450 cplus_make_method_ptr (value_type (result
),
3451 value_contents_writeable (result
),
3452 TYPE_FN_FIELD_VOFFSET (f
, j
), 1);
3454 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
3455 return allocate_value (TYPE_FN_FIELD_TYPE (f
, j
));
3457 error (_("Cannot reference virtual member function \"%s\""),
3463 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
3469 v
= read_var_value (s
, 0);
3474 result
= allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
3475 cplus_make_method_ptr (value_type (result
),
3476 value_contents_writeable (result
),
3477 value_address (v
), 0);
3483 for (i
= TYPE_N_BASECLASSES (t
) - 1; i
>= 0; i
--)
3488 if (BASETYPE_VIA_VIRTUAL (t
, i
))
3491 base_offset
= TYPE_BASECLASS_BITPOS (t
, i
) / 8;
3492 v
= value_struct_elt_for_reference (domain
,
3493 offset
+ base_offset
,
3494 TYPE_BASECLASS (t
, i
),
3496 want_address
, noside
);
3501 /* As a last chance, pretend that CURTYPE is a namespace, and look
3502 it up that way; this (frequently) works for types nested inside
3505 return value_maybe_namespace_elt (curtype
, name
,
3506 want_address
, noside
);
3509 /* C++: Return the member NAME of the namespace given by the type
3512 static struct value
*
3513 value_namespace_elt (const struct type
*curtype
,
3514 char *name
, int want_address
,
3517 struct value
*retval
= value_maybe_namespace_elt (curtype
, name
,
3522 error (_("No symbol \"%s\" in namespace \"%s\"."),
3523 name
, TYPE_TAG_NAME (curtype
));
3528 /* A helper function used by value_namespace_elt and
3529 value_struct_elt_for_reference. It looks up NAME inside the
3530 context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE
3531 is a class and NAME refers to a type in CURTYPE itself (as opposed
3532 to, say, some base class of CURTYPE). */
3534 static struct value
*
3535 value_maybe_namespace_elt (const struct type
*curtype
,
3536 char *name
, int want_address
,
3539 const char *namespace_name
= TYPE_TAG_NAME (curtype
);
3541 struct value
*result
;
3543 sym
= cp_lookup_symbol_namespace (namespace_name
, name
,
3544 get_selected_block (0), VAR_DOMAIN
);
3548 char *concatenated_name
= alloca (strlen (namespace_name
) + 2
3549 + strlen (name
) + 1);
3551 sprintf (concatenated_name
, "%s::%s", namespace_name
, name
);
3552 sym
= lookup_static_symbol_aux (concatenated_name
, VAR_DOMAIN
);
3557 else if ((noside
== EVAL_AVOID_SIDE_EFFECTS
)
3558 && (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
))
3559 result
= allocate_value (SYMBOL_TYPE (sym
));
3561 result
= value_of_variable (sym
, get_selected_block (0));
3563 if (result
&& want_address
)
3564 result
= value_addr (result
);
3569 /* Given a pointer or a reference value V, find its real (RTTI) type.
3571 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
3572 and refer to the values computed for the object pointed to. */
3575 value_rtti_indirect_type (struct value
*v
, int *full
,
3576 int *top
, int *using_enc
)
3578 struct value
*target
;
3579 struct type
*type
, *real_type
, *target_type
;
3581 type
= value_type (v
);
3582 type
= check_typedef (type
);
3583 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
3584 target
= coerce_ref (v
);
3585 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3586 target
= value_ind (v
);
3590 real_type
= value_rtti_type (target
, full
, top
, using_enc
);
3594 /* Copy qualifiers to the referenced object. */
3595 target_type
= value_type (target
);
3596 real_type
= make_cv_type (TYPE_CONST (target_type
),
3597 TYPE_VOLATILE (target_type
), real_type
, NULL
);
3598 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
3599 real_type
= lookup_reference_type (real_type
);
3600 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3601 real_type
= lookup_pointer_type (real_type
);
3603 internal_error (__FILE__
, __LINE__
, _("Unexpected value type."));
3605 /* Copy qualifiers to the pointer/reference. */
3606 real_type
= make_cv_type (TYPE_CONST (type
), TYPE_VOLATILE (type
),
3613 /* Given a value pointed to by ARGP, check its real run-time type, and
3614 if that is different from the enclosing type, create a new value
3615 using the real run-time type as the enclosing type (and of the same
3616 type as ARGP) and return it, with the embedded offset adjusted to
3617 be the correct offset to the enclosed object. RTYPE is the type,
3618 and XFULL, XTOP, and XUSING_ENC are the other parameters, computed
3619 by value_rtti_type(). If these are available, they can be supplied
3620 and a second call to value_rtti_type() is avoided. (Pass RTYPE ==
3621 NULL if they're not available. */
3624 value_full_object (struct value
*argp
,
3626 int xfull
, int xtop
,
3629 struct type
*real_type
;
3633 struct value
*new_val
;
3640 using_enc
= xusing_enc
;
3643 real_type
= value_rtti_type (argp
, &full
, &top
, &using_enc
);
3645 /* If no RTTI data, or if object is already complete, do nothing. */
3646 if (!real_type
|| real_type
== value_enclosing_type (argp
))
3649 /* In a destructor we might see a real type that is a superclass of
3650 the object's type. In this case it is better to leave the object
3653 && TYPE_LENGTH (real_type
) < TYPE_LENGTH (value_enclosing_type (argp
)))
3656 /* If we have the full object, but for some reason the enclosing
3657 type is wrong, set it. */
3658 /* pai: FIXME -- sounds iffy */
3661 argp
= value_copy (argp
);
3662 set_value_enclosing_type (argp
, real_type
);
3666 /* Check if object is in memory. */
3667 if (VALUE_LVAL (argp
) != lval_memory
)
3669 warning (_("Couldn't retrieve complete object of RTTI "
3670 "type %s; object may be in register(s)."),
3671 TYPE_NAME (real_type
));
3676 /* All other cases -- retrieve the complete object. */
3677 /* Go back by the computed top_offset from the beginning of the
3678 object, adjusting for the embedded offset of argp if that's what
3679 value_rtti_type used for its computation. */
3680 new_val
= value_at_lazy (real_type
, value_address (argp
) - top
+
3681 (using_enc
? 0 : value_embedded_offset (argp
)));
3682 deprecated_set_value_type (new_val
, value_type (argp
));
3683 set_value_embedded_offset (new_val
, (using_enc
3684 ? top
+ value_embedded_offset (argp
)
3690 /* Return the value of the local variable, if one exists. Throw error
3691 otherwise, such as if the request is made in an inappropriate context. */
3694 value_of_this (const struct language_defn
*lang
)
3698 struct frame_info
*frame
;
3700 if (!lang
->la_name_of_this
)
3701 error (_("no `this' in current language"));
3703 frame
= get_selected_frame (_("no frame selected"));
3705 b
= get_frame_block (frame
, NULL
);
3707 sym
= lookup_language_this (lang
, b
);
3709 error (_("current stack frame does not contain a variable named `%s'"),
3710 lang
->la_name_of_this
);
3712 return read_var_value (sym
, frame
);
3715 /* Return the value of the local variable, if one exists. Return NULL
3716 otherwise. Never throw error. */
3719 value_of_this_silent (const struct language_defn
*lang
)
3721 struct value
*ret
= NULL
;
3722 volatile struct gdb_exception except
;
3724 TRY_CATCH (except
, RETURN_MASK_ERROR
)
3726 ret
= value_of_this (lang
);
3732 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH
3733 elements long, starting at LOWBOUND. The result has the same lower
3734 bound as the original ARRAY. */
3737 value_slice (struct value
*array
, int lowbound
, int length
)
3739 struct type
*slice_range_type
, *slice_type
, *range_type
;
3740 LONGEST lowerbound
, upperbound
;
3741 struct value
*slice
;
3742 struct type
*array_type
;
3744 array_type
= check_typedef (value_type (array
));
3745 if (TYPE_CODE (array_type
) != TYPE_CODE_ARRAY
3746 && TYPE_CODE (array_type
) != TYPE_CODE_STRING
)
3747 error (_("cannot take slice of non-array"));
3749 range_type
= TYPE_INDEX_TYPE (array_type
);
3750 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
3751 error (_("slice from bad array or bitstring"));
3753 if (lowbound
< lowerbound
|| length
< 0
3754 || lowbound
+ length
- 1 > upperbound
)
3755 error (_("slice out of range"));
3757 /* FIXME-type-allocation: need a way to free this type when we are
3759 slice_range_type
= create_range_type ((struct type
*) NULL
,
3760 TYPE_TARGET_TYPE (range_type
),
3762 lowbound
+ length
- 1);
3765 struct type
*element_type
= TYPE_TARGET_TYPE (array_type
);
3767 (lowbound
- lowerbound
) * TYPE_LENGTH (check_typedef (element_type
));
3769 slice_type
= create_array_type ((struct type
*) NULL
,
3772 TYPE_CODE (slice_type
) = TYPE_CODE (array_type
);
3774 if (VALUE_LVAL (array
) == lval_memory
&& value_lazy (array
))
3775 slice
= allocate_value_lazy (slice_type
);
3778 slice
= allocate_value (slice_type
);
3779 value_contents_copy (slice
, 0, array
, offset
,
3780 TYPE_LENGTH (slice_type
));
3783 set_value_component_location (slice
, array
);
3784 VALUE_FRAME_ID (slice
) = VALUE_FRAME_ID (array
);
3785 set_value_offset (slice
, value_offset (array
) + offset
);
3790 /* Create a value for a FORTRAN complex number. Currently most of the
3791 time values are coerced to COMPLEX*16 (i.e. a complex number
3792 composed of 2 doubles. This really should be a smarter routine
3793 that figures out precision inteligently as opposed to assuming
3794 doubles. FIXME: fmb */
3797 value_literal_complex (struct value
*arg1
,
3802 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3804 val
= allocate_value (type
);
3805 arg1
= value_cast (real_type
, arg1
);
3806 arg2
= value_cast (real_type
, arg2
);
3808 memcpy (value_contents_raw (val
),
3809 value_contents (arg1
), TYPE_LENGTH (real_type
));
3810 memcpy (value_contents_raw (val
) + TYPE_LENGTH (real_type
),
3811 value_contents (arg2
), TYPE_LENGTH (real_type
));
3815 /* Cast a value into the appropriate complex data type. */
3817 static struct value
*
3818 cast_into_complex (struct type
*type
, struct value
*val
)
3820 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3822 if (TYPE_CODE (value_type (val
)) == TYPE_CODE_COMPLEX
)
3824 struct type
*val_real_type
= TYPE_TARGET_TYPE (value_type (val
));
3825 struct value
*re_val
= allocate_value (val_real_type
);
3826 struct value
*im_val
= allocate_value (val_real_type
);
3828 memcpy (value_contents_raw (re_val
),
3829 value_contents (val
), TYPE_LENGTH (val_real_type
));
3830 memcpy (value_contents_raw (im_val
),
3831 value_contents (val
) + TYPE_LENGTH (val_real_type
),
3832 TYPE_LENGTH (val_real_type
));
3834 return value_literal_complex (re_val
, im_val
, type
);
3836 else if (TYPE_CODE (value_type (val
)) == TYPE_CODE_FLT
3837 || TYPE_CODE (value_type (val
)) == TYPE_CODE_INT
)
3838 return value_literal_complex (val
,
3839 value_zero (real_type
, not_lval
),
3842 error (_("cannot cast non-number to complex"));
3846 _initialize_valops (void)
3848 add_setshow_boolean_cmd ("overload-resolution", class_support
,
3849 &overload_resolution
, _("\
3850 Set overload resolution in evaluating C++ functions."), _("\
3851 Show overload resolution in evaluating C++ functions."),
3853 show_overload_resolution
,
3854 &setlist
, &showlist
);
3855 overload_resolution
= 1;