1 /* Perform non-arithmetic operations on values, for GDB.
3 Copyright (C) 1986-2020 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"
37 #include "target-float.h"
38 #include "tracepoint.h"
39 #include "observable.h"
41 #include "extension.h"
43 #include "gdbsupport/byte-vector.h"
45 /* Local functions. */
47 static int typecmp (int staticp
, int varargs
, int nargs
,
48 struct field t1
[], struct value
*t2
[]);
50 static struct value
*search_struct_field (const char *, struct value
*,
53 static struct value
*search_struct_method (const char *, struct value
**,
55 LONGEST
, int *, struct type
*);
57 static int find_oload_champ_namespace (gdb::array_view
<value
*> args
,
58 const char *, const char *,
59 std::vector
<symbol
*> *oload_syms
,
63 static int find_oload_champ_namespace_loop (gdb::array_view
<value
*> args
,
64 const char *, const char *,
65 int, std::vector
<symbol
*> *oload_syms
,
66 badness_vector
*, int *,
69 static int find_oload_champ (gdb::array_view
<value
*> args
,
72 xmethod_worker_up
*xmethods
,
74 badness_vector
*oload_champ_bv
);
76 static int oload_method_static_p (struct fn_field
*, int);
78 enum oload_classification
{ STANDARD
, NON_STANDARD
, INCOMPATIBLE
};
80 static enum oload_classification classify_oload_match
81 (const badness_vector
&, int, int);
83 static struct value
*value_struct_elt_for_reference (struct type
*,
89 static struct value
*value_namespace_elt (const struct type
*,
90 const char *, int , enum noside
);
92 static struct value
*value_maybe_namespace_elt (const struct type
*,
96 static CORE_ADDR
allocate_space_in_inferior (int);
98 static struct value
*cast_into_complex (struct type
*, struct value
*);
100 bool overload_resolution
= false;
102 show_overload_resolution (struct ui_file
*file
, int from_tty
,
103 struct cmd_list_element
*c
,
106 fprintf_filtered (file
, _("Overload resolution in evaluating "
107 "C++ functions is %s.\n"),
111 /* Find the address of function name NAME in the inferior. If OBJF_P
112 is non-NULL, *OBJF_P will be set to the OBJFILE where the function
116 find_function_in_inferior (const char *name
, struct objfile
**objf_p
)
118 struct block_symbol sym
;
120 sym
= lookup_symbol (name
, 0, VAR_DOMAIN
, 0);
121 if (sym
.symbol
!= NULL
)
123 if (SYMBOL_CLASS (sym
.symbol
) != LOC_BLOCK
)
125 error (_("\"%s\" exists in this program but is not a function."),
130 *objf_p
= symbol_objfile (sym
.symbol
);
132 return value_of_variable (sym
.symbol
, sym
.block
);
136 struct bound_minimal_symbol msymbol
=
137 lookup_bound_minimal_symbol (name
);
139 if (msymbol
.minsym
!= NULL
)
141 struct objfile
*objfile
= msymbol
.objfile
;
142 struct gdbarch
*gdbarch
= objfile
->arch ();
146 type
= lookup_pointer_type (builtin_type (gdbarch
)->builtin_char
);
147 type
= lookup_function_type (type
);
148 type
= lookup_pointer_type (type
);
149 maddr
= BMSYMBOL_VALUE_ADDRESS (msymbol
);
154 return value_from_pointer (type
, maddr
);
158 if (!target_has_execution
)
159 error (_("evaluation of this expression "
160 "requires the target program to be active"));
162 error (_("evaluation of this expression requires the "
163 "program to have a function \"%s\"."),
169 /* Allocate NBYTES of space in the inferior using the inferior's
170 malloc and return a value that is a pointer to the allocated
174 value_allocate_space_in_inferior (int len
)
176 struct objfile
*objf
;
177 struct value
*val
= find_function_in_inferior ("malloc", &objf
);
178 struct gdbarch
*gdbarch
= objf
->arch ();
179 struct value
*blocklen
;
181 blocklen
= value_from_longest (builtin_type (gdbarch
)->builtin_int
, len
);
182 val
= call_function_by_hand (val
, NULL
, blocklen
);
183 if (value_logical_not (val
))
185 if (!target_has_execution
)
186 error (_("No memory available to program now: "
187 "you need to start the target first"));
189 error (_("No memory available to program: call to malloc failed"));
195 allocate_space_in_inferior (int len
)
197 return value_as_long (value_allocate_space_in_inferior (len
));
200 /* Cast struct value VAL to type TYPE and return as a value.
201 Both type and val must be of TYPE_CODE_STRUCT or TYPE_CODE_UNION
202 for this to work. Typedef to one of the codes is permitted.
203 Returns NULL if the cast is neither an upcast nor a downcast. */
205 static struct value
*
206 value_cast_structs (struct type
*type
, struct value
*v2
)
212 gdb_assert (type
!= NULL
&& v2
!= NULL
);
214 t1
= check_typedef (type
);
215 t2
= check_typedef (value_type (v2
));
217 /* Check preconditions. */
218 gdb_assert ((t1
->code () == TYPE_CODE_STRUCT
219 || t1
->code () == TYPE_CODE_UNION
)
220 && !!"Precondition is that type is of STRUCT or UNION kind.");
221 gdb_assert ((t2
->code () == TYPE_CODE_STRUCT
222 || t2
->code () == TYPE_CODE_UNION
)
223 && !!"Precondition is that value is of STRUCT or UNION kind");
225 if (t1
->name () != NULL
226 && t2
->name () != NULL
227 && !strcmp (t1
->name (), t2
->name ()))
230 /* Upcasting: look in the type of the source to see if it contains the
231 type of the target as a superclass. If so, we'll need to
232 offset the pointer rather than just change its type. */
233 if (t1
->name () != NULL
)
235 v
= search_struct_field (t1
->name (),
241 /* Downcasting: look in the type of the target to see if it contains the
242 type of the source as a superclass. If so, we'll need to
243 offset the pointer rather than just change its type. */
244 if (t2
->name () != NULL
)
246 /* Try downcasting using the run-time type of the value. */
249 struct type
*real_type
;
251 real_type
= value_rtti_type (v2
, &full
, &top
, &using_enc
);
254 v
= value_full_object (v2
, real_type
, full
, top
, using_enc
);
255 v
= value_at_lazy (real_type
, value_address (v
));
256 real_type
= value_type (v
);
258 /* We might be trying to cast to the outermost enclosing
259 type, in which case search_struct_field won't work. */
260 if (real_type
->name () != NULL
261 && !strcmp (real_type
->name (), t1
->name ()))
264 v
= search_struct_field (t2
->name (), v
, real_type
, 1);
269 /* Try downcasting using information from the destination type
270 T2. This wouldn't work properly for classes with virtual
271 bases, but those were handled above. */
272 v
= search_struct_field (t2
->name (),
273 value_zero (t1
, not_lval
), t1
, 1);
276 /* Downcasting is possible (t1 is superclass of v2). */
277 CORE_ADDR addr2
= value_address (v2
);
279 addr2
-= value_address (v
) + value_embedded_offset (v
);
280 return value_at (type
, addr2
);
287 /* Cast one pointer or reference type to another. Both TYPE and
288 the type of ARG2 should be pointer types, or else both should be
289 reference types. If SUBCLASS_CHECK is non-zero, this will force a
290 check to see whether TYPE is a superclass of ARG2's type. If
291 SUBCLASS_CHECK is zero, then the subclass check is done only when
292 ARG2 is itself non-zero. Returns the new pointer or reference. */
295 value_cast_pointers (struct type
*type
, struct value
*arg2
,
298 struct type
*type1
= check_typedef (type
);
299 struct type
*type2
= check_typedef (value_type (arg2
));
300 struct type
*t1
= check_typedef (TYPE_TARGET_TYPE (type1
));
301 struct type
*t2
= check_typedef (TYPE_TARGET_TYPE (type2
));
303 if (t1
->code () == TYPE_CODE_STRUCT
304 && t2
->code () == TYPE_CODE_STRUCT
305 && (subclass_check
|| !value_logical_not (arg2
)))
309 if (TYPE_IS_REFERENCE (type2
))
310 v2
= coerce_ref (arg2
);
312 v2
= value_ind (arg2
);
313 gdb_assert (check_typedef (value_type (v2
))->code ()
314 == TYPE_CODE_STRUCT
&& !!"Why did coercion fail?");
315 v2
= value_cast_structs (t1
, v2
);
316 /* At this point we have what we can have, un-dereference if needed. */
319 struct value
*v
= value_addr (v2
);
321 deprecated_set_value_type (v
, type
);
326 /* No superclass found, just change the pointer type. */
327 arg2
= value_copy (arg2
);
328 deprecated_set_value_type (arg2
, type
);
329 set_value_enclosing_type (arg2
, type
);
330 set_value_pointed_to_offset (arg2
, 0); /* pai: chk_val */
334 /* Cast value ARG2 to type TYPE and return as a value.
335 More general than a C cast: accepts any two types of the same length,
336 and if ARG2 is an lvalue it can be cast into anything at all. */
337 /* In C++, casts may change pointer or object representations. */
340 value_cast (struct type
*type
, struct value
*arg2
)
342 enum type_code code1
;
343 enum type_code code2
;
347 int convert_to_boolean
= 0;
349 if (value_type (arg2
) == type
)
352 /* Check if we are casting struct reference to struct reference. */
353 if (TYPE_IS_REFERENCE (check_typedef (type
)))
355 /* We dereference type; then we recurse and finally
356 we generate value of the given reference. Nothing wrong with
358 struct type
*t1
= check_typedef (type
);
359 struct type
*dereftype
= check_typedef (TYPE_TARGET_TYPE (t1
));
360 struct value
*val
= value_cast (dereftype
, arg2
);
362 return value_ref (val
, t1
->code ());
365 if (TYPE_IS_REFERENCE (check_typedef (value_type (arg2
))))
366 /* We deref the value and then do the cast. */
367 return value_cast (type
, coerce_ref (arg2
));
369 /* Strip typedefs / resolve stubs in order to get at the type's
370 code/length, but remember the original type, to use as the
371 resulting type of the cast, in case it was a typedef. */
372 struct type
*to_type
= type
;
374 type
= check_typedef (type
);
375 code1
= type
->code ();
376 arg2
= coerce_ref (arg2
);
377 type2
= check_typedef (value_type (arg2
));
379 /* You can't cast to a reference type. See value_cast_pointers
381 gdb_assert (!TYPE_IS_REFERENCE (type
));
383 /* A cast to an undetermined-length array_type, such as
384 (TYPE [])OBJECT, is treated like a cast to (TYPE [N])OBJECT,
385 where N is sizeof(OBJECT)/sizeof(TYPE). */
386 if (code1
== TYPE_CODE_ARRAY
)
388 struct type
*element_type
= TYPE_TARGET_TYPE (type
);
389 unsigned element_length
= TYPE_LENGTH (check_typedef (element_type
));
391 if (element_length
> 0
392 && type
->index_type ()->bounds ()->high
.kind () == PROP_UNDEFINED
)
394 struct type
*range_type
= type
->index_type ();
395 int val_length
= TYPE_LENGTH (type2
);
396 LONGEST low_bound
, high_bound
, new_length
;
398 if (get_discrete_bounds (range_type
, &low_bound
, &high_bound
) < 0)
399 low_bound
= 0, high_bound
= 0;
400 new_length
= val_length
/ element_length
;
401 if (val_length
% element_length
!= 0)
402 warning (_("array element type size does not "
403 "divide object size in cast"));
404 /* FIXME-type-allocation: need a way to free this type when
405 we are done with it. */
406 range_type
= create_static_range_type (NULL
,
407 TYPE_TARGET_TYPE (range_type
),
409 new_length
+ low_bound
- 1);
410 deprecated_set_value_type (arg2
,
411 create_array_type (NULL
,
418 if (current_language
->c_style_arrays
419 && type2
->code () == TYPE_CODE_ARRAY
420 && !TYPE_VECTOR (type2
))
421 arg2
= value_coerce_array (arg2
);
423 if (type2
->code () == TYPE_CODE_FUNC
)
424 arg2
= value_coerce_function (arg2
);
426 type2
= check_typedef (value_type (arg2
));
427 code2
= type2
->code ();
429 if (code1
== TYPE_CODE_COMPLEX
)
430 return cast_into_complex (to_type
, arg2
);
431 if (code1
== TYPE_CODE_BOOL
)
433 code1
= TYPE_CODE_INT
;
434 convert_to_boolean
= 1;
436 if (code1
== TYPE_CODE_CHAR
)
437 code1
= TYPE_CODE_INT
;
438 if (code2
== TYPE_CODE_BOOL
|| code2
== TYPE_CODE_CHAR
)
439 code2
= TYPE_CODE_INT
;
441 scalar
= (code2
== TYPE_CODE_INT
|| code2
== TYPE_CODE_FLT
442 || code2
== TYPE_CODE_DECFLOAT
|| code2
== TYPE_CODE_ENUM
443 || code2
== TYPE_CODE_RANGE
);
445 if ((code1
== TYPE_CODE_STRUCT
|| code1
== TYPE_CODE_UNION
)
446 && (code2
== TYPE_CODE_STRUCT
|| code2
== TYPE_CODE_UNION
)
447 && type
->name () != 0)
449 struct value
*v
= value_cast_structs (to_type
, arg2
);
455 if (is_floating_type (type
) && scalar
)
457 if (is_floating_value (arg2
))
459 struct value
*v
= allocate_value (to_type
);
460 target_float_convert (value_contents (arg2
), type2
,
461 value_contents_raw (v
), type
);
465 /* The only option left is an integral type. */
466 if (TYPE_UNSIGNED (type2
))
467 return value_from_ulongest (to_type
, value_as_long (arg2
));
469 return value_from_longest (to_type
, value_as_long (arg2
));
471 else if ((code1
== TYPE_CODE_INT
|| code1
== TYPE_CODE_ENUM
472 || code1
== TYPE_CODE_RANGE
)
473 && (scalar
|| code2
== TYPE_CODE_PTR
474 || code2
== TYPE_CODE_MEMBERPTR
))
478 /* When we cast pointers to integers, we mustn't use
479 gdbarch_pointer_to_address to find the address the pointer
480 represents, as value_as_long would. GDB should evaluate
481 expressions just as the compiler would --- and the compiler
482 sees a cast as a simple reinterpretation of the pointer's
484 if (code2
== TYPE_CODE_PTR
)
485 longest
= extract_unsigned_integer
486 (value_contents (arg2
), TYPE_LENGTH (type2
),
487 type_byte_order (type2
));
489 longest
= value_as_long (arg2
);
490 return value_from_longest (to_type
, convert_to_boolean
?
491 (LONGEST
) (longest
? 1 : 0) : longest
);
493 else if (code1
== TYPE_CODE_PTR
&& (code2
== TYPE_CODE_INT
494 || code2
== TYPE_CODE_ENUM
495 || code2
== TYPE_CODE_RANGE
))
497 /* TYPE_LENGTH (type) is the length of a pointer, but we really
498 want the length of an address! -- we are really dealing with
499 addresses (i.e., gdb representations) not pointers (i.e.,
500 target representations) here.
502 This allows things like "print *(int *)0x01000234" to work
503 without printing a misleading message -- which would
504 otherwise occur when dealing with a target having two byte
505 pointers and four byte addresses. */
507 int addr_bit
= gdbarch_addr_bit (get_type_arch (type2
));
508 LONGEST longest
= value_as_long (arg2
);
510 if (addr_bit
< sizeof (LONGEST
) * HOST_CHAR_BIT
)
512 if (longest
>= ((LONGEST
) 1 << addr_bit
)
513 || longest
<= -((LONGEST
) 1 << addr_bit
))
514 warning (_("value truncated"));
516 return value_from_longest (to_type
, longest
);
518 else if (code1
== TYPE_CODE_METHODPTR
&& code2
== TYPE_CODE_INT
519 && value_as_long (arg2
) == 0)
521 struct value
*result
= allocate_value (to_type
);
523 cplus_make_method_ptr (to_type
, value_contents_writeable (result
), 0, 0);
526 else if (code1
== TYPE_CODE_MEMBERPTR
&& code2
== TYPE_CODE_INT
527 && value_as_long (arg2
) == 0)
529 /* The Itanium C++ ABI represents NULL pointers to members as
530 minus one, instead of biasing the normal case. */
531 return value_from_longest (to_type
, -1);
533 else if (code1
== TYPE_CODE_ARRAY
&& TYPE_VECTOR (type
)
534 && code2
== TYPE_CODE_ARRAY
&& TYPE_VECTOR (type2
)
535 && TYPE_LENGTH (type
) != TYPE_LENGTH (type2
))
536 error (_("Cannot convert between vector values of different sizes"));
537 else if (code1
== TYPE_CODE_ARRAY
&& TYPE_VECTOR (type
) && scalar
538 && TYPE_LENGTH (type
) != TYPE_LENGTH (type2
))
539 error (_("can only cast scalar to vector of same size"));
540 else if (code1
== TYPE_CODE_VOID
)
542 return value_zero (to_type
, not_lval
);
544 else if (TYPE_LENGTH (type
) == TYPE_LENGTH (type2
))
546 if (code1
== TYPE_CODE_PTR
&& code2
== TYPE_CODE_PTR
)
547 return value_cast_pointers (to_type
, arg2
, 0);
549 arg2
= value_copy (arg2
);
550 deprecated_set_value_type (arg2
, to_type
);
551 set_value_enclosing_type (arg2
, to_type
);
552 set_value_pointed_to_offset (arg2
, 0); /* pai: chk_val */
555 else if (VALUE_LVAL (arg2
) == lval_memory
)
556 return value_at_lazy (to_type
, value_address (arg2
));
559 if (current_language
->la_language
== language_ada
)
560 error (_("Invalid type conversion."));
561 error (_("Invalid cast."));
565 /* The C++ reinterpret_cast operator. */
568 value_reinterpret_cast (struct type
*type
, struct value
*arg
)
570 struct value
*result
;
571 struct type
*real_type
= check_typedef (type
);
572 struct type
*arg_type
, *dest_type
;
574 enum type_code dest_code
, arg_code
;
576 /* Do reference, function, and array conversion. */
577 arg
= coerce_array (arg
);
579 /* Attempt to preserve the type the user asked for. */
582 /* If we are casting to a reference type, transform
583 reinterpret_cast<T&[&]>(V) to *reinterpret_cast<T*>(&V). */
584 if (TYPE_IS_REFERENCE (real_type
))
587 arg
= value_addr (arg
);
588 dest_type
= lookup_pointer_type (TYPE_TARGET_TYPE (dest_type
));
589 real_type
= lookup_pointer_type (real_type
);
592 arg_type
= value_type (arg
);
594 dest_code
= real_type
->code ();
595 arg_code
= arg_type
->code ();
597 /* We can convert pointer types, or any pointer type to int, or int
599 if ((dest_code
== TYPE_CODE_PTR
&& arg_code
== TYPE_CODE_INT
)
600 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_PTR
)
601 || (dest_code
== TYPE_CODE_METHODPTR
&& arg_code
== TYPE_CODE_INT
)
602 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_METHODPTR
)
603 || (dest_code
== TYPE_CODE_MEMBERPTR
&& arg_code
== TYPE_CODE_INT
)
604 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_MEMBERPTR
)
605 || (dest_code
== arg_code
606 && (dest_code
== TYPE_CODE_PTR
607 || dest_code
== TYPE_CODE_METHODPTR
608 || dest_code
== TYPE_CODE_MEMBERPTR
)))
609 result
= value_cast (dest_type
, arg
);
611 error (_("Invalid reinterpret_cast"));
614 result
= value_cast (type
, value_ref (value_ind (result
),
620 /* A helper for value_dynamic_cast. This implements the first of two
621 runtime checks: we iterate over all the base classes of the value's
622 class which are equal to the desired class; if only one of these
623 holds the value, then it is the answer. */
626 dynamic_cast_check_1 (struct type
*desired_type
,
627 const gdb_byte
*valaddr
,
628 LONGEST embedded_offset
,
631 struct type
*search_type
,
633 struct type
*arg_type
,
634 struct value
**result
)
636 int i
, result_count
= 0;
638 for (i
= 0; i
< TYPE_N_BASECLASSES (search_type
) && result_count
< 2; ++i
)
640 LONGEST offset
= baseclass_offset (search_type
, i
, valaddr
,
644 if (class_types_same_p (desired_type
, TYPE_BASECLASS (search_type
, i
)))
646 if (address
+ embedded_offset
+ offset
>= arg_addr
647 && address
+ embedded_offset
+ offset
< arg_addr
+ TYPE_LENGTH (arg_type
))
651 *result
= value_at_lazy (TYPE_BASECLASS (search_type
, i
),
652 address
+ embedded_offset
+ offset
);
656 result_count
+= dynamic_cast_check_1 (desired_type
,
658 embedded_offset
+ offset
,
660 TYPE_BASECLASS (search_type
, i
),
669 /* A helper for value_dynamic_cast. This implements the second of two
670 runtime checks: we look for a unique public sibling class of the
671 argument's declared class. */
674 dynamic_cast_check_2 (struct type
*desired_type
,
675 const gdb_byte
*valaddr
,
676 LONGEST embedded_offset
,
679 struct type
*search_type
,
680 struct value
**result
)
682 int i
, result_count
= 0;
684 for (i
= 0; i
< TYPE_N_BASECLASSES (search_type
) && result_count
< 2; ++i
)
688 if (! BASETYPE_VIA_PUBLIC (search_type
, i
))
691 offset
= baseclass_offset (search_type
, i
, valaddr
, embedded_offset
,
693 if (class_types_same_p (desired_type
, TYPE_BASECLASS (search_type
, i
)))
697 *result
= value_at_lazy (TYPE_BASECLASS (search_type
, i
),
698 address
+ embedded_offset
+ offset
);
701 result_count
+= dynamic_cast_check_2 (desired_type
,
703 embedded_offset
+ offset
,
705 TYPE_BASECLASS (search_type
, i
),
712 /* The C++ dynamic_cast operator. */
715 value_dynamic_cast (struct type
*type
, struct value
*arg
)
719 struct type
*resolved_type
= check_typedef (type
);
720 struct type
*arg_type
= check_typedef (value_type (arg
));
721 struct type
*class_type
, *rtti_type
;
722 struct value
*result
, *tem
, *original_arg
= arg
;
724 int is_ref
= TYPE_IS_REFERENCE (resolved_type
);
726 if (resolved_type
->code () != TYPE_CODE_PTR
727 && !TYPE_IS_REFERENCE (resolved_type
))
728 error (_("Argument to dynamic_cast must be a pointer or reference type"));
729 if (TYPE_TARGET_TYPE (resolved_type
)->code () != TYPE_CODE_VOID
730 && TYPE_TARGET_TYPE (resolved_type
)->code () != TYPE_CODE_STRUCT
)
731 error (_("Argument to dynamic_cast must be pointer to class or `void *'"));
733 class_type
= check_typedef (TYPE_TARGET_TYPE (resolved_type
));
734 if (resolved_type
->code () == TYPE_CODE_PTR
)
736 if (arg_type
->code () != TYPE_CODE_PTR
737 && ! (arg_type
->code () == TYPE_CODE_INT
738 && value_as_long (arg
) == 0))
739 error (_("Argument to dynamic_cast does not have pointer type"));
740 if (arg_type
->code () == TYPE_CODE_PTR
)
742 arg_type
= check_typedef (TYPE_TARGET_TYPE (arg_type
));
743 if (arg_type
->code () != TYPE_CODE_STRUCT
)
744 error (_("Argument to dynamic_cast does "
745 "not have pointer to class type"));
748 /* Handle NULL pointers. */
749 if (value_as_long (arg
) == 0)
750 return value_zero (type
, not_lval
);
752 arg
= value_ind (arg
);
756 if (arg_type
->code () != TYPE_CODE_STRUCT
)
757 error (_("Argument to dynamic_cast does not have class type"));
760 /* If the classes are the same, just return the argument. */
761 if (class_types_same_p (class_type
, arg_type
))
762 return value_cast (type
, arg
);
764 /* If the target type is a unique base class of the argument's
765 declared type, just cast it. */
766 if (is_ancestor (class_type
, arg_type
))
768 if (is_unique_ancestor (class_type
, arg
))
769 return value_cast (type
, original_arg
);
770 error (_("Ambiguous dynamic_cast"));
773 rtti_type
= value_rtti_type (arg
, &full
, &top
, &using_enc
);
775 error (_("Couldn't determine value's most derived type for dynamic_cast"));
777 /* Compute the most derived object's address. */
778 addr
= value_address (arg
);
786 addr
+= top
+ value_embedded_offset (arg
);
788 /* dynamic_cast<void *> means to return a pointer to the
789 most-derived object. */
790 if (resolved_type
->code () == TYPE_CODE_PTR
791 && TYPE_TARGET_TYPE (resolved_type
)->code () == TYPE_CODE_VOID
)
792 return value_at_lazy (type
, addr
);
794 tem
= value_at (type
, addr
);
795 type
= value_type (tem
);
797 /* The first dynamic check specified in 5.2.7. */
798 if (is_public_ancestor (arg_type
, TYPE_TARGET_TYPE (resolved_type
)))
800 if (class_types_same_p (rtti_type
, TYPE_TARGET_TYPE (resolved_type
)))
803 if (dynamic_cast_check_1 (TYPE_TARGET_TYPE (resolved_type
),
804 value_contents_for_printing (tem
),
805 value_embedded_offset (tem
),
806 value_address (tem
), tem
,
810 return value_cast (type
,
812 ? value_ref (result
, resolved_type
->code ())
813 : value_addr (result
));
816 /* The second dynamic check specified in 5.2.7. */
818 if (is_public_ancestor (arg_type
, rtti_type
)
819 && dynamic_cast_check_2 (TYPE_TARGET_TYPE (resolved_type
),
820 value_contents_for_printing (tem
),
821 value_embedded_offset (tem
),
822 value_address (tem
), tem
,
823 rtti_type
, &result
) == 1)
824 return value_cast (type
,
826 ? value_ref (result
, resolved_type
->code ())
827 : value_addr (result
));
829 if (resolved_type
->code () == TYPE_CODE_PTR
)
830 return value_zero (type
, not_lval
);
832 error (_("dynamic_cast failed"));
835 /* Create a value of type TYPE that is zero, and return it. */
838 value_zero (struct type
*type
, enum lval_type lv
)
840 struct value
*val
= allocate_value (type
);
842 VALUE_LVAL (val
) = (lv
== lval_computed
? not_lval
: lv
);
846 /* Create a not_lval value of numeric type TYPE that is one, and return it. */
849 value_one (struct type
*type
)
851 struct type
*type1
= check_typedef (type
);
854 if (is_integral_type (type1
) || is_floating_type (type1
))
856 val
= value_from_longest (type
, (LONGEST
) 1);
858 else if (type1
->code () == TYPE_CODE_ARRAY
&& TYPE_VECTOR (type1
))
860 struct type
*eltype
= check_typedef (TYPE_TARGET_TYPE (type1
));
862 LONGEST low_bound
, high_bound
;
865 if (!get_array_bounds (type1
, &low_bound
, &high_bound
))
866 error (_("Could not determine the vector bounds"));
868 val
= allocate_value (type
);
869 for (i
= 0; i
< high_bound
- low_bound
+ 1; i
++)
871 tmp
= value_one (eltype
);
872 memcpy (value_contents_writeable (val
) + i
* TYPE_LENGTH (eltype
),
873 value_contents_all (tmp
), TYPE_LENGTH (eltype
));
878 error (_("Not a numeric type."));
881 /* value_one result is never used for assignments to. */
882 gdb_assert (VALUE_LVAL (val
) == not_lval
);
887 /* Helper function for value_at, value_at_lazy, and value_at_lazy_stack.
888 The type of the created value may differ from the passed type TYPE.
889 Make sure to retrieve the returned values's new type after this call
890 e.g. in case the type is a variable length array. */
892 static struct value
*
893 get_value_at (struct type
*type
, CORE_ADDR addr
, int lazy
)
897 if (check_typedef (type
)->code () == TYPE_CODE_VOID
)
898 error (_("Attempt to dereference a generic pointer."));
900 val
= value_from_contents_and_address (type
, NULL
, addr
);
903 value_fetch_lazy (val
);
908 /* Return a value with type TYPE located at ADDR.
910 Call value_at only if the data needs to be fetched immediately;
911 if we can be 'lazy' and defer the fetch, perhaps indefinitely, call
912 value_at_lazy instead. value_at_lazy simply records the address of
913 the data and sets the lazy-evaluation-required flag. The lazy flag
914 is tested in the value_contents macro, which is used if and when
915 the contents are actually required. The type of the created value
916 may differ from the passed type TYPE. Make sure to retrieve the
917 returned values's new type after this call e.g. in case the type
918 is a variable length array.
920 Note: value_at does *NOT* handle embedded offsets; perform such
921 adjustments before or after calling it. */
924 value_at (struct type
*type
, CORE_ADDR addr
)
926 return get_value_at (type
, addr
, 0);
929 /* Return a lazy value with type TYPE located at ADDR (cf. value_at).
930 The type of the created value may differ from the passed type TYPE.
931 Make sure to retrieve the returned values's new type after this call
932 e.g. in case the type is a variable length array. */
935 value_at_lazy (struct type
*type
, CORE_ADDR addr
)
937 return get_value_at (type
, addr
, 1);
941 read_value_memory (struct value
*val
, LONGEST bit_offset
,
942 int stack
, CORE_ADDR memaddr
,
943 gdb_byte
*buffer
, size_t length
)
945 ULONGEST xfered_total
= 0;
946 struct gdbarch
*arch
= get_value_arch (val
);
947 int unit_size
= gdbarch_addressable_memory_unit_size (arch
);
948 enum target_object object
;
950 object
= stack
? TARGET_OBJECT_STACK_MEMORY
: TARGET_OBJECT_MEMORY
;
952 while (xfered_total
< length
)
954 enum target_xfer_status status
;
955 ULONGEST xfered_partial
;
957 status
= target_xfer_partial (current_top_target (),
959 buffer
+ xfered_total
* unit_size
, NULL
,
960 memaddr
+ xfered_total
,
961 length
- xfered_total
,
964 if (status
== TARGET_XFER_OK
)
966 else if (status
== TARGET_XFER_UNAVAILABLE
)
967 mark_value_bits_unavailable (val
, (xfered_total
* HOST_CHAR_BIT
969 xfered_partial
* HOST_CHAR_BIT
);
970 else if (status
== TARGET_XFER_EOF
)
971 memory_error (TARGET_XFER_E_IO
, memaddr
+ xfered_total
);
973 memory_error (status
, memaddr
+ xfered_total
);
975 xfered_total
+= xfered_partial
;
980 /* Store the contents of FROMVAL into the location of TOVAL.
981 Return a new value with the location of TOVAL and contents of FROMVAL. */
984 value_assign (struct value
*toval
, struct value
*fromval
)
988 struct frame_id old_frame
;
990 if (!deprecated_value_modifiable (toval
))
991 error (_("Left operand of assignment is not a modifiable lvalue."));
993 toval
= coerce_ref (toval
);
995 type
= value_type (toval
);
996 if (VALUE_LVAL (toval
) != lval_internalvar
)
997 fromval
= value_cast (type
, fromval
);
1000 /* Coerce arrays and functions to pointers, except for arrays
1001 which only live in GDB's storage. */
1002 if (!value_must_coerce_to_target (fromval
))
1003 fromval
= coerce_array (fromval
);
1006 type
= check_typedef (type
);
1008 /* Since modifying a register can trash the frame chain, and
1009 modifying memory can trash the frame cache, we save the old frame
1010 and then restore the new frame afterwards. */
1011 old_frame
= get_frame_id (deprecated_safe_get_selected_frame ());
1013 switch (VALUE_LVAL (toval
))
1015 case lval_internalvar
:
1016 set_internalvar (VALUE_INTERNALVAR (toval
), fromval
);
1017 return value_of_internalvar (get_type_arch (type
),
1018 VALUE_INTERNALVAR (toval
));
1020 case lval_internalvar_component
:
1022 LONGEST offset
= value_offset (toval
);
1024 /* Are we dealing with a bitfield?
1026 It is important to mention that `value_parent (toval)' is
1027 non-NULL iff `value_bitsize (toval)' is non-zero. */
1028 if (value_bitsize (toval
))
1030 /* VALUE_INTERNALVAR below refers to the parent value, while
1031 the offset is relative to this parent value. */
1032 gdb_assert (value_parent (value_parent (toval
)) == NULL
);
1033 offset
+= value_offset (value_parent (toval
));
1036 set_internalvar_component (VALUE_INTERNALVAR (toval
),
1038 value_bitpos (toval
),
1039 value_bitsize (toval
),
1046 const gdb_byte
*dest_buffer
;
1047 CORE_ADDR changed_addr
;
1049 gdb_byte buffer
[sizeof (LONGEST
)];
1051 if (value_bitsize (toval
))
1053 struct value
*parent
= value_parent (toval
);
1055 changed_addr
= value_address (parent
) + value_offset (toval
);
1056 changed_len
= (value_bitpos (toval
)
1057 + value_bitsize (toval
)
1058 + HOST_CHAR_BIT
- 1)
1061 /* If we can read-modify-write exactly the size of the
1062 containing type (e.g. short or int) then do so. This
1063 is safer for volatile bitfields mapped to hardware
1065 if (changed_len
< TYPE_LENGTH (type
)
1066 && TYPE_LENGTH (type
) <= (int) sizeof (LONGEST
)
1067 && ((LONGEST
) changed_addr
% TYPE_LENGTH (type
)) == 0)
1068 changed_len
= TYPE_LENGTH (type
);
1070 if (changed_len
> (int) sizeof (LONGEST
))
1071 error (_("Can't handle bitfields which "
1072 "don't fit in a %d bit word."),
1073 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
1075 read_memory (changed_addr
, buffer
, changed_len
);
1076 modify_field (type
, buffer
, value_as_long (fromval
),
1077 value_bitpos (toval
), value_bitsize (toval
));
1078 dest_buffer
= buffer
;
1082 changed_addr
= value_address (toval
);
1083 changed_len
= type_length_units (type
);
1084 dest_buffer
= value_contents (fromval
);
1087 write_memory_with_notification (changed_addr
, dest_buffer
, changed_len
);
1093 struct frame_info
*frame
;
1094 struct gdbarch
*gdbarch
;
1097 /* Figure out which frame this is in currently.
1099 We use VALUE_FRAME_ID for obtaining the value's frame id instead of
1100 VALUE_NEXT_FRAME_ID due to requiring a frame which may be passed to
1101 put_frame_register_bytes() below. That function will (eventually)
1102 perform the necessary unwind operation by first obtaining the next
1104 frame
= frame_find_by_id (VALUE_FRAME_ID (toval
));
1106 value_reg
= VALUE_REGNUM (toval
);
1109 error (_("Value being assigned to is no longer active."));
1111 gdbarch
= get_frame_arch (frame
);
1113 if (value_bitsize (toval
))
1115 struct value
*parent
= value_parent (toval
);
1116 LONGEST offset
= value_offset (parent
) + value_offset (toval
);
1118 gdb_byte buffer
[sizeof (LONGEST
)];
1121 changed_len
= (value_bitpos (toval
)
1122 + value_bitsize (toval
)
1123 + HOST_CHAR_BIT
- 1)
1126 if (changed_len
> (int) sizeof (LONGEST
))
1127 error (_("Can't handle bitfields which "
1128 "don't fit in a %d bit word."),
1129 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
1131 if (!get_frame_register_bytes (frame
, value_reg
, offset
,
1132 changed_len
, buffer
,
1136 throw_error (OPTIMIZED_OUT_ERROR
,
1137 _("value has been optimized out"));
1139 throw_error (NOT_AVAILABLE_ERROR
,
1140 _("value is not available"));
1143 modify_field (type
, buffer
, value_as_long (fromval
),
1144 value_bitpos (toval
), value_bitsize (toval
));
1146 put_frame_register_bytes (frame
, value_reg
, offset
,
1147 changed_len
, buffer
);
1151 if (gdbarch_convert_register_p (gdbarch
, VALUE_REGNUM (toval
),
1154 /* If TOVAL is a special machine register requiring
1155 conversion of program values to a special raw
1157 gdbarch_value_to_register (gdbarch
, frame
,
1158 VALUE_REGNUM (toval
), type
,
1159 value_contents (fromval
));
1163 put_frame_register_bytes (frame
, value_reg
,
1164 value_offset (toval
),
1166 value_contents (fromval
));
1170 gdb::observers::register_changed
.notify (frame
, value_reg
);
1176 const struct lval_funcs
*funcs
= value_computed_funcs (toval
);
1178 if (funcs
->write
!= NULL
)
1180 funcs
->write (toval
, fromval
);
1187 error (_("Left operand of assignment is not an lvalue."));
1190 /* Assigning to the stack pointer, frame pointer, and other
1191 (architecture and calling convention specific) registers may
1192 cause the frame cache and regcache to be out of date. Assigning to memory
1193 also can. We just do this on all assignments to registers or
1194 memory, for simplicity's sake; I doubt the slowdown matters. */
1195 switch (VALUE_LVAL (toval
))
1201 gdb::observers::target_changed
.notify (current_top_target ());
1203 /* Having destroyed the frame cache, restore the selected
1206 /* FIXME: cagney/2002-11-02: There has to be a better way of
1207 doing this. Instead of constantly saving/restoring the
1208 frame. Why not create a get_selected_frame() function that,
1209 having saved the selected frame's ID can automatically
1210 re-find the previously selected frame automatically. */
1213 struct frame_info
*fi
= frame_find_by_id (old_frame
);
1224 /* If the field does not entirely fill a LONGEST, then zero the sign
1225 bits. If the field is signed, and is negative, then sign
1227 if ((value_bitsize (toval
) > 0)
1228 && (value_bitsize (toval
) < 8 * (int) sizeof (LONGEST
)))
1230 LONGEST fieldval
= value_as_long (fromval
);
1231 LONGEST valmask
= (((ULONGEST
) 1) << value_bitsize (toval
)) - 1;
1233 fieldval
&= valmask
;
1234 if (!TYPE_UNSIGNED (type
)
1235 && (fieldval
& (valmask
^ (valmask
>> 1))))
1236 fieldval
|= ~valmask
;
1238 fromval
= value_from_longest (type
, fieldval
);
1241 /* The return value is a copy of TOVAL so it shares its location
1242 information, but its contents are updated from FROMVAL. This
1243 implies the returned value is not lazy, even if TOVAL was. */
1244 val
= value_copy (toval
);
1245 set_value_lazy (val
, 0);
1246 memcpy (value_contents_raw (val
), value_contents (fromval
),
1247 TYPE_LENGTH (type
));
1249 /* We copy over the enclosing type and pointed-to offset from FROMVAL
1250 in the case of pointer types. For object types, the enclosing type
1251 and embedded offset must *not* be copied: the target object refered
1252 to by TOVAL retains its original dynamic type after assignment. */
1253 if (type
->code () == TYPE_CODE_PTR
)
1255 set_value_enclosing_type (val
, value_enclosing_type (fromval
));
1256 set_value_pointed_to_offset (val
, value_pointed_to_offset (fromval
));
1262 /* Extend a value VAL to COUNT repetitions of its type. */
1265 value_repeat (struct value
*arg1
, int count
)
1269 if (VALUE_LVAL (arg1
) != lval_memory
)
1270 error (_("Only values in memory can be extended with '@'."));
1272 error (_("Invalid number %d of repetitions."), count
);
1274 val
= allocate_repeat_value (value_enclosing_type (arg1
), count
);
1276 VALUE_LVAL (val
) = lval_memory
;
1277 set_value_address (val
, value_address (arg1
));
1279 read_value_memory (val
, 0, value_stack (val
), value_address (val
),
1280 value_contents_all_raw (val
),
1281 type_length_units (value_enclosing_type (val
)));
1287 value_of_variable (struct symbol
*var
, const struct block
*b
)
1289 struct frame_info
*frame
= NULL
;
1291 if (symbol_read_needs_frame (var
))
1292 frame
= get_selected_frame (_("No frame selected."));
1294 return read_var_value (var
, b
, frame
);
1298 address_of_variable (struct symbol
*var
, const struct block
*b
)
1300 struct type
*type
= SYMBOL_TYPE (var
);
1303 /* Evaluate it first; if the result is a memory address, we're fine.
1304 Lazy evaluation pays off here. */
1306 val
= value_of_variable (var
, b
);
1307 type
= value_type (val
);
1309 if ((VALUE_LVAL (val
) == lval_memory
&& value_lazy (val
))
1310 || type
->code () == TYPE_CODE_FUNC
)
1312 CORE_ADDR addr
= value_address (val
);
1314 return value_from_pointer (lookup_pointer_type (type
), addr
);
1317 /* Not a memory address; check what the problem was. */
1318 switch (VALUE_LVAL (val
))
1322 struct frame_info
*frame
;
1323 const char *regname
;
1325 frame
= frame_find_by_id (VALUE_NEXT_FRAME_ID (val
));
1328 regname
= gdbarch_register_name (get_frame_arch (frame
),
1329 VALUE_REGNUM (val
));
1330 gdb_assert (regname
&& *regname
);
1332 error (_("Address requested for identifier "
1333 "\"%s\" which is in register $%s"),
1334 var
->print_name (), regname
);
1339 error (_("Can't take address of \"%s\" which isn't an lvalue."),
1340 var
->print_name ());
1350 value_must_coerce_to_target (struct value
*val
)
1352 struct type
*valtype
;
1354 /* The only lval kinds which do not live in target memory. */
1355 if (VALUE_LVAL (val
) != not_lval
1356 && VALUE_LVAL (val
) != lval_internalvar
1357 && VALUE_LVAL (val
) != lval_xcallable
)
1360 valtype
= check_typedef (value_type (val
));
1362 switch (valtype
->code ())
1364 case TYPE_CODE_ARRAY
:
1365 return TYPE_VECTOR (valtype
) ? 0 : 1;
1366 case TYPE_CODE_STRING
:
1373 /* Make sure that VAL lives in target memory if it's supposed to. For
1374 instance, strings are constructed as character arrays in GDB's
1375 storage, and this function copies them to the target. */
1378 value_coerce_to_target (struct value
*val
)
1383 if (!value_must_coerce_to_target (val
))
1386 length
= TYPE_LENGTH (check_typedef (value_type (val
)));
1387 addr
= allocate_space_in_inferior (length
);
1388 write_memory (addr
, value_contents (val
), length
);
1389 return value_at_lazy (value_type (val
), addr
);
1392 /* Given a value which is an array, return a value which is a pointer
1393 to its first element, regardless of whether or not the array has a
1394 nonzero lower bound.
1396 FIXME: A previous comment here indicated that this routine should
1397 be substracting the array's lower bound. It's not clear to me that
1398 this is correct. Given an array subscripting operation, it would
1399 certainly work to do the adjustment here, essentially computing:
1401 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
1403 However I believe a more appropriate and logical place to account
1404 for the lower bound is to do so in value_subscript, essentially
1407 (&array[0] + ((index - lowerbound) * sizeof array[0]))
1409 As further evidence consider what would happen with operations
1410 other than array subscripting, where the caller would get back a
1411 value that had an address somewhere before the actual first element
1412 of the array, and the information about the lower bound would be
1413 lost because of the coercion to pointer type. */
1416 value_coerce_array (struct value
*arg1
)
1418 struct type
*type
= check_typedef (value_type (arg1
));
1420 /* If the user tries to do something requiring a pointer with an
1421 array that has not yet been pushed to the target, then this would
1422 be a good time to do so. */
1423 arg1
= value_coerce_to_target (arg1
);
1425 if (VALUE_LVAL (arg1
) != lval_memory
)
1426 error (_("Attempt to take address of value not located in memory."));
1428 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
1429 value_address (arg1
));
1432 /* Given a value which is a function, return a value which is a pointer
1436 value_coerce_function (struct value
*arg1
)
1438 struct value
*retval
;
1440 if (VALUE_LVAL (arg1
) != lval_memory
)
1441 error (_("Attempt to take address of value not located in memory."));
1443 retval
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1444 value_address (arg1
));
1448 /* Return a pointer value for the object for which ARG1 is the
1452 value_addr (struct value
*arg1
)
1455 struct type
*type
= check_typedef (value_type (arg1
));
1457 if (TYPE_IS_REFERENCE (type
))
1459 if (value_bits_synthetic_pointer (arg1
, value_embedded_offset (arg1
),
1460 TARGET_CHAR_BIT
* TYPE_LENGTH (type
)))
1461 arg1
= coerce_ref (arg1
);
1464 /* Copy the value, but change the type from (T&) to (T*). We
1465 keep the same location information, which is efficient, and
1466 allows &(&X) to get the location containing the reference.
1467 Do the same to its enclosing type for consistency. */
1468 struct type
*type_ptr
1469 = lookup_pointer_type (TYPE_TARGET_TYPE (type
));
1470 struct type
*enclosing_type
1471 = check_typedef (value_enclosing_type (arg1
));
1472 struct type
*enclosing_type_ptr
1473 = lookup_pointer_type (TYPE_TARGET_TYPE (enclosing_type
));
1475 arg2
= value_copy (arg1
);
1476 deprecated_set_value_type (arg2
, type_ptr
);
1477 set_value_enclosing_type (arg2
, enclosing_type_ptr
);
1482 if (type
->code () == TYPE_CODE_FUNC
)
1483 return value_coerce_function (arg1
);
1485 /* If this is an array that has not yet been pushed to the target,
1486 then this would be a good time to force it to memory. */
1487 arg1
= value_coerce_to_target (arg1
);
1489 if (VALUE_LVAL (arg1
) != lval_memory
)
1490 error (_("Attempt to take address of value not located in memory."));
1492 /* Get target memory address. */
1493 arg2
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1494 (value_address (arg1
)
1495 + value_embedded_offset (arg1
)));
1497 /* This may be a pointer to a base subobject; so remember the
1498 full derived object's type ... */
1499 set_value_enclosing_type (arg2
,
1500 lookup_pointer_type (value_enclosing_type (arg1
)));
1501 /* ... and also the relative position of the subobject in the full
1503 set_value_pointed_to_offset (arg2
, value_embedded_offset (arg1
));
1507 /* Return a reference value for the object for which ARG1 is the
1511 value_ref (struct value
*arg1
, enum type_code refcode
)
1514 struct type
*type
= check_typedef (value_type (arg1
));
1516 gdb_assert (refcode
== TYPE_CODE_REF
|| refcode
== TYPE_CODE_RVALUE_REF
);
1518 if ((type
->code () == TYPE_CODE_REF
1519 || type
->code () == TYPE_CODE_RVALUE_REF
)
1520 && type
->code () == refcode
)
1523 arg2
= value_addr (arg1
);
1524 deprecated_set_value_type (arg2
, lookup_reference_type (type
, refcode
));
1528 /* Given a value of a pointer type, apply the C unary * operator to
1532 value_ind (struct value
*arg1
)
1534 struct type
*base_type
;
1537 arg1
= coerce_array (arg1
);
1539 base_type
= check_typedef (value_type (arg1
));
1541 if (VALUE_LVAL (arg1
) == lval_computed
)
1543 const struct lval_funcs
*funcs
= value_computed_funcs (arg1
);
1545 if (funcs
->indirect
)
1547 struct value
*result
= funcs
->indirect (arg1
);
1554 if (base_type
->code () == TYPE_CODE_PTR
)
1556 struct type
*enc_type
;
1558 /* We may be pointing to something embedded in a larger object.
1559 Get the real type of the enclosing object. */
1560 enc_type
= check_typedef (value_enclosing_type (arg1
));
1561 enc_type
= TYPE_TARGET_TYPE (enc_type
);
1563 if (check_typedef (enc_type
)->code () == TYPE_CODE_FUNC
1564 || check_typedef (enc_type
)->code () == TYPE_CODE_METHOD
)
1565 /* For functions, go through find_function_addr, which knows
1566 how to handle function descriptors. */
1567 arg2
= value_at_lazy (enc_type
,
1568 find_function_addr (arg1
, NULL
));
1570 /* Retrieve the enclosing object pointed to. */
1571 arg2
= value_at_lazy (enc_type
,
1572 (value_as_address (arg1
)
1573 - value_pointed_to_offset (arg1
)));
1575 enc_type
= value_type (arg2
);
1576 return readjust_indirect_value_type (arg2
, enc_type
, base_type
, arg1
);
1579 error (_("Attempt to take contents of a non-pointer value."));
1582 /* Create a value for an array by allocating space in GDB, copying the
1583 data into that space, and then setting up an array value.
1585 The array bounds are set from LOWBOUND and HIGHBOUND, and the array
1586 is populated from the values passed in ELEMVEC.
1588 The element type of the array is inherited from the type of the
1589 first element, and all elements must have the same size (though we
1590 don't currently enforce any restriction on their types). */
1593 value_array (int lowbound
, int highbound
, struct value
**elemvec
)
1597 ULONGEST typelength
;
1599 struct type
*arraytype
;
1601 /* Validate that the bounds are reasonable and that each of the
1602 elements have the same size. */
1604 nelem
= highbound
- lowbound
+ 1;
1607 error (_("bad array bounds (%d, %d)"), lowbound
, highbound
);
1609 typelength
= type_length_units (value_enclosing_type (elemvec
[0]));
1610 for (idx
= 1; idx
< nelem
; idx
++)
1612 if (type_length_units (value_enclosing_type (elemvec
[idx
]))
1615 error (_("array elements must all be the same size"));
1619 arraytype
= lookup_array_range_type (value_enclosing_type (elemvec
[0]),
1620 lowbound
, highbound
);
1622 if (!current_language
->c_style_arrays
)
1624 val
= allocate_value (arraytype
);
1625 for (idx
= 0; idx
< nelem
; idx
++)
1626 value_contents_copy (val
, idx
* typelength
, elemvec
[idx
], 0,
1631 /* Allocate space to store the array, and then initialize it by
1632 copying in each element. */
1634 val
= allocate_value (arraytype
);
1635 for (idx
= 0; idx
< nelem
; idx
++)
1636 value_contents_copy (val
, idx
* typelength
, elemvec
[idx
], 0, typelength
);
1641 value_cstring (const char *ptr
, ssize_t len
, struct type
*char_type
)
1644 int lowbound
= current_language
->string_lower_bound
;
1645 ssize_t highbound
= len
/ TYPE_LENGTH (char_type
);
1646 struct type
*stringtype
1647 = lookup_array_range_type (char_type
, lowbound
, highbound
+ lowbound
- 1);
1649 val
= allocate_value (stringtype
);
1650 memcpy (value_contents_raw (val
), ptr
, len
);
1654 /* Create a value for a string constant by allocating space in the
1655 inferior, copying the data into that space, and returning the
1656 address with type TYPE_CODE_STRING. PTR points to the string
1657 constant data; LEN is number of characters.
1659 Note that string types are like array of char types with a lower
1660 bound of zero and an upper bound of LEN - 1. Also note that the
1661 string may contain embedded null bytes. */
1664 value_string (const char *ptr
, ssize_t len
, struct type
*char_type
)
1667 int lowbound
= current_language
->string_lower_bound
;
1668 ssize_t highbound
= len
/ TYPE_LENGTH (char_type
);
1669 struct type
*stringtype
1670 = lookup_string_range_type (char_type
, lowbound
, highbound
+ lowbound
- 1);
1672 val
= allocate_value (stringtype
);
1673 memcpy (value_contents_raw (val
), ptr
, len
);
1678 /* See if we can pass arguments in T2 to a function which takes
1679 arguments of types T1. T1 is a list of NARGS arguments, and T2 is
1680 a NULL-terminated vector. If some arguments need coercion of some
1681 sort, then the coerced values are written into T2. Return value is
1682 0 if the arguments could be matched, or the position at which they
1685 STATICP is nonzero if the T1 argument list came from a static
1686 member function. T2 will still include the ``this'' pointer, but
1689 For non-static member functions, we ignore the first argument,
1690 which is the type of the instance variable. This is because we
1691 want to handle calls with objects from derived classes. This is
1692 not entirely correct: we should actually check to make sure that a
1693 requested operation is type secure, shouldn't we? FIXME. */
1696 typecmp (int staticp
, int varargs
, int nargs
,
1697 struct field t1
[], struct value
*t2
[])
1702 internal_error (__FILE__
, __LINE__
,
1703 _("typecmp: no argument list"));
1705 /* Skip ``this'' argument if applicable. T2 will always include
1711 (i
< nargs
) && t1
[i
].type ()->code () != TYPE_CODE_VOID
;
1714 struct type
*tt1
, *tt2
;
1719 tt1
= check_typedef (t1
[i
].type ());
1720 tt2
= check_typedef (value_type (t2
[i
]));
1722 if (TYPE_IS_REFERENCE (tt1
)
1723 /* We should be doing hairy argument matching, as below. */
1724 && (check_typedef (TYPE_TARGET_TYPE (tt1
))->code ()
1727 if (tt2
->code () == TYPE_CODE_ARRAY
)
1728 t2
[i
] = value_coerce_array (t2
[i
]);
1730 t2
[i
] = value_ref (t2
[i
], tt1
->code ());
1734 /* djb - 20000715 - Until the new type structure is in the
1735 place, and we can attempt things like implicit conversions,
1736 we need to do this so you can take something like a map<const
1737 char *>, and properly access map["hello"], because the
1738 argument to [] will be a reference to a pointer to a char,
1739 and the argument will be a pointer to a char. */
1740 while (TYPE_IS_REFERENCE (tt1
) || tt1
->code () == TYPE_CODE_PTR
)
1742 tt1
= check_typedef ( TYPE_TARGET_TYPE (tt1
) );
1744 while (tt2
->code () == TYPE_CODE_ARRAY
1745 || tt2
->code () == TYPE_CODE_PTR
1746 || TYPE_IS_REFERENCE (tt2
))
1748 tt2
= check_typedef (TYPE_TARGET_TYPE (tt2
));
1750 if (tt1
->code () == tt2
->code ())
1752 /* Array to pointer is a `trivial conversion' according to the
1755 /* We should be doing much hairier argument matching (see
1756 section 13.2 of the ARM), but as a quick kludge, just check
1757 for the same type code. */
1758 if (t1
[i
].type ()->code () != value_type (t2
[i
])->code ())
1761 if (varargs
|| t2
[i
] == NULL
)
1766 /* Helper class for do_search_struct_field that updates *RESULT_PTR
1767 and *LAST_BOFFSET, and possibly throws an exception if the field
1768 search has yielded ambiguous results. */
1771 update_search_result (struct value
**result_ptr
, struct value
*v
,
1772 LONGEST
*last_boffset
, LONGEST boffset
,
1773 const char *name
, struct type
*type
)
1777 if (*result_ptr
!= NULL
1778 /* The result is not ambiguous if all the classes that are
1779 found occupy the same space. */
1780 && *last_boffset
!= boffset
)
1781 error (_("base class '%s' is ambiguous in type '%s'"),
1782 name
, TYPE_SAFE_NAME (type
));
1784 *last_boffset
= boffset
;
1788 /* A helper for search_struct_field. This does all the work; most
1789 arguments are as passed to search_struct_field. The result is
1790 stored in *RESULT_PTR, which must be initialized to NULL.
1791 OUTERMOST_TYPE is the type of the initial type passed to
1792 search_struct_field; this is used for error reporting when the
1793 lookup is ambiguous. */
1796 do_search_struct_field (const char *name
, struct value
*arg1
, LONGEST offset
,
1797 struct type
*type
, int looking_for_baseclass
,
1798 struct value
**result_ptr
,
1799 LONGEST
*last_boffset
,
1800 struct type
*outermost_type
)
1805 type
= check_typedef (type
);
1806 nbases
= TYPE_N_BASECLASSES (type
);
1808 if (!looking_for_baseclass
)
1809 for (i
= type
->num_fields () - 1; i
>= nbases
; i
--)
1811 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
1813 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1817 if (field_is_static (&type
->field (i
)))
1818 v
= value_static_field (type
, i
);
1820 v
= value_primitive_field (arg1
, offset
, i
, type
);
1826 && t_field_name
[0] == '\0')
1828 struct type
*field_type
= type
->field (i
).type ();
1830 if (field_type
->code () == TYPE_CODE_UNION
1831 || field_type
->code () == TYPE_CODE_STRUCT
)
1833 /* Look for a match through the fields of an anonymous
1834 union, or anonymous struct. C++ provides anonymous
1837 In the GNU Chill (now deleted from GDB)
1838 implementation of variant record types, each
1839 <alternative field> has an (anonymous) union type,
1840 each member of the union represents a <variant
1841 alternative>. Each <variant alternative> is
1842 represented as a struct, with a member for each
1845 struct value
*v
= NULL
;
1846 LONGEST new_offset
= offset
;
1848 /* This is pretty gross. In G++, the offset in an
1849 anonymous union is relative to the beginning of the
1850 enclosing struct. In the GNU Chill (now deleted
1851 from GDB) implementation of variant records, the
1852 bitpos is zero in an anonymous union field, so we
1853 have to add the offset of the union here. */
1854 if (field_type
->code () == TYPE_CODE_STRUCT
1855 || (field_type
->num_fields () > 0
1856 && TYPE_FIELD_BITPOS (field_type
, 0) == 0))
1857 new_offset
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
1859 do_search_struct_field (name
, arg1
, new_offset
,
1861 looking_for_baseclass
, &v
,
1873 for (i
= 0; i
< nbases
; i
++)
1875 struct value
*v
= NULL
;
1876 struct type
*basetype
= check_typedef (TYPE_BASECLASS (type
, i
));
1877 /* If we are looking for baseclasses, this is what we get when
1878 we hit them. But it could happen that the base part's member
1879 name is not yet filled in. */
1880 int found_baseclass
= (looking_for_baseclass
1881 && TYPE_BASECLASS_NAME (type
, i
) != NULL
1882 && (strcmp_iw (name
,
1883 TYPE_BASECLASS_NAME (type
,
1885 LONGEST boffset
= value_embedded_offset (arg1
) + offset
;
1887 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1891 boffset
= baseclass_offset (type
, i
,
1892 value_contents_for_printing (arg1
),
1893 value_embedded_offset (arg1
) + offset
,
1894 value_address (arg1
),
1897 /* The virtual base class pointer might have been clobbered
1898 by the user program. Make sure that it still points to a
1899 valid memory location. */
1901 boffset
+= value_embedded_offset (arg1
) + offset
;
1903 || boffset
>= TYPE_LENGTH (value_enclosing_type (arg1
)))
1905 CORE_ADDR base_addr
;
1907 base_addr
= value_address (arg1
) + boffset
;
1908 v2
= value_at_lazy (basetype
, base_addr
);
1909 if (target_read_memory (base_addr
,
1910 value_contents_raw (v2
),
1911 TYPE_LENGTH (value_type (v2
))) != 0)
1912 error (_("virtual baseclass botch"));
1916 v2
= value_copy (arg1
);
1917 deprecated_set_value_type (v2
, basetype
);
1918 set_value_embedded_offset (v2
, boffset
);
1921 if (found_baseclass
)
1925 do_search_struct_field (name
, v2
, 0,
1926 TYPE_BASECLASS (type
, i
),
1927 looking_for_baseclass
,
1928 result_ptr
, last_boffset
,
1932 else if (found_baseclass
)
1933 v
= value_primitive_field (arg1
, offset
, i
, type
);
1936 do_search_struct_field (name
, arg1
,
1937 offset
+ TYPE_BASECLASS_BITPOS (type
,
1939 basetype
, looking_for_baseclass
,
1940 result_ptr
, last_boffset
,
1944 update_search_result (result_ptr
, v
, last_boffset
,
1945 boffset
, name
, outermost_type
);
1949 /* Helper function used by value_struct_elt to recurse through
1950 baseclasses. Look for a field NAME in ARG1. Search in it assuming
1951 it has (class) type TYPE. If found, return value, else return NULL.
1953 If LOOKING_FOR_BASECLASS, then instead of looking for struct
1954 fields, look for a baseclass named NAME. */
1956 static struct value
*
1957 search_struct_field (const char *name
, struct value
*arg1
,
1958 struct type
*type
, int looking_for_baseclass
)
1960 struct value
*result
= NULL
;
1961 LONGEST boffset
= 0;
1963 do_search_struct_field (name
, arg1
, 0, type
, looking_for_baseclass
,
1964 &result
, &boffset
, type
);
1968 /* Helper function used by value_struct_elt to recurse through
1969 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1970 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1973 If found, return value, else if name matched and args not return
1974 (value) -1, else return NULL. */
1976 static struct value
*
1977 search_struct_method (const char *name
, struct value
**arg1p
,
1978 struct value
**args
, LONGEST offset
,
1979 int *static_memfuncp
, struct type
*type
)
1983 int name_matched
= 0;
1985 type
= check_typedef (type
);
1986 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
1988 const char *t_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
1990 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1992 int j
= TYPE_FN_FIELDLIST_LENGTH (type
, i
) - 1;
1993 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
1996 check_stub_method_group (type
, i
);
1997 if (j
> 0 && args
== 0)
1998 error (_("cannot resolve overloaded method "
1999 "`%s': no arguments supplied"), name
);
2000 else if (j
== 0 && args
== 0)
2002 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
2009 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f
, j
),
2010 TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f
, j
)),
2011 TYPE_FN_FIELD_TYPE (f
, j
)->num_fields (),
2012 TYPE_FN_FIELD_ARGS (f
, j
), args
))
2014 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
2015 return value_virtual_fn_field (arg1p
, f
, j
,
2017 if (TYPE_FN_FIELD_STATIC_P (f
, j
)
2019 *static_memfuncp
= 1;
2020 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
2029 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2031 LONGEST base_offset
;
2032 LONGEST this_offset
;
2034 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2036 struct type
*baseclass
= check_typedef (TYPE_BASECLASS (type
, i
));
2037 struct value
*base_val
;
2038 const gdb_byte
*base_valaddr
;
2040 /* The virtual base class pointer might have been
2041 clobbered by the user program. Make sure that it
2042 still points to a valid memory location. */
2044 if (offset
< 0 || offset
>= TYPE_LENGTH (type
))
2048 gdb::byte_vector
tmp (TYPE_LENGTH (baseclass
));
2049 address
= value_address (*arg1p
);
2051 if (target_read_memory (address
+ offset
,
2052 tmp
.data (), TYPE_LENGTH (baseclass
)) != 0)
2053 error (_("virtual baseclass botch"));
2055 base_val
= value_from_contents_and_address (baseclass
,
2058 base_valaddr
= value_contents_for_printing (base_val
);
2064 base_valaddr
= value_contents_for_printing (*arg1p
);
2065 this_offset
= offset
;
2068 base_offset
= baseclass_offset (type
, i
, base_valaddr
,
2069 this_offset
, value_address (base_val
),
2074 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2076 v
= search_struct_method (name
, arg1p
, args
, base_offset
+ offset
,
2077 static_memfuncp
, TYPE_BASECLASS (type
, i
));
2078 if (v
== (struct value
*) - 1)
2084 /* FIXME-bothner: Why is this commented out? Why is it here? */
2085 /* *arg1p = arg1_tmp; */
2090 return (struct value
*) - 1;
2095 /* Given *ARGP, a value of type (pointer to a)* structure/union,
2096 extract the component named NAME from the ultimate target
2097 structure/union and return it as a value with its appropriate type.
2098 ERR is used in the error message if *ARGP's type is wrong.
2100 C++: ARGS is a list of argument types to aid in the selection of
2101 an appropriate method. Also, handle derived types.
2103 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
2104 where the truthvalue of whether the function that was resolved was
2105 a static member function or not is stored.
2107 ERR is an error message to be printed in case the field is not
2111 value_struct_elt (struct value
**argp
, struct value
**args
,
2112 const char *name
, int *static_memfuncp
, const char *err
)
2117 *argp
= coerce_array (*argp
);
2119 t
= check_typedef (value_type (*argp
));
2121 /* Follow pointers until we get to a non-pointer. */
2123 while (t
->code () == TYPE_CODE_PTR
|| TYPE_IS_REFERENCE (t
))
2125 *argp
= value_ind (*argp
);
2126 /* Don't coerce fn pointer to fn and then back again! */
2127 if (check_typedef (value_type (*argp
))->code () != TYPE_CODE_FUNC
)
2128 *argp
= coerce_array (*argp
);
2129 t
= check_typedef (value_type (*argp
));
2132 if (t
->code () != TYPE_CODE_STRUCT
2133 && t
->code () != TYPE_CODE_UNION
)
2134 error (_("Attempt to extract a component of a value that is not a %s."),
2137 /* Assume it's not, unless we see that it is. */
2138 if (static_memfuncp
)
2139 *static_memfuncp
= 0;
2143 /* if there are no arguments ...do this... */
2145 /* Try as a field first, because if we succeed, there is less
2147 v
= search_struct_field (name
, *argp
, t
, 0);
2151 /* C++: If it was not found as a data field, then try to
2152 return it as a pointer to a method. */
2153 v
= search_struct_method (name
, argp
, args
, 0,
2154 static_memfuncp
, t
);
2156 if (v
== (struct value
*) - 1)
2157 error (_("Cannot take address of method %s."), name
);
2160 if (TYPE_NFN_FIELDS (t
))
2161 error (_("There is no member or method named %s."), name
);
2163 error (_("There is no member named %s."), name
);
2168 v
= search_struct_method (name
, argp
, args
, 0,
2169 static_memfuncp
, t
);
2171 if (v
== (struct value
*) - 1)
2173 error (_("One of the arguments you tried to pass to %s could not "
2174 "be converted to what the function wants."), name
);
2178 /* See if user tried to invoke data as function. If so, hand it
2179 back. If it's not callable (i.e., a pointer to function),
2180 gdb should give an error. */
2181 v
= search_struct_field (name
, *argp
, t
, 0);
2182 /* If we found an ordinary field, then it is not a method call.
2183 So, treat it as if it were a static member function. */
2184 if (v
&& static_memfuncp
)
2185 *static_memfuncp
= 1;
2189 throw_error (NOT_FOUND_ERROR
,
2190 _("Structure has no component named %s."), name
);
2194 /* Given *ARGP, a value of type structure or union, or a pointer/reference
2195 to a structure or union, extract and return its component (field) of
2196 type FTYPE at the specified BITPOS.
2197 Throw an exception on error. */
2200 value_struct_elt_bitpos (struct value
**argp
, int bitpos
, struct type
*ftype
,
2206 *argp
= coerce_array (*argp
);
2208 t
= check_typedef (value_type (*argp
));
2210 while (t
->code () == TYPE_CODE_PTR
|| TYPE_IS_REFERENCE (t
))
2212 *argp
= value_ind (*argp
);
2213 if (check_typedef (value_type (*argp
))->code () != TYPE_CODE_FUNC
)
2214 *argp
= coerce_array (*argp
);
2215 t
= check_typedef (value_type (*argp
));
2218 if (t
->code () != TYPE_CODE_STRUCT
2219 && t
->code () != TYPE_CODE_UNION
)
2220 error (_("Attempt to extract a component of a value that is not a %s."),
2223 for (i
= TYPE_N_BASECLASSES (t
); i
< t
->num_fields (); i
++)
2225 if (!field_is_static (&t
->field (i
))
2226 && bitpos
== TYPE_FIELD_BITPOS (t
, i
)
2227 && types_equal (ftype
, t
->field (i
).type ()))
2228 return value_primitive_field (*argp
, 0, i
, t
);
2231 error (_("No field with matching bitpos and type."));
2237 /* Search through the methods of an object (and its bases) to find a
2238 specified method. Return a reference to the fn_field list METHODS of
2239 overloaded instances defined in the source language. If available
2240 and matching, a vector of matching xmethods defined in extension
2241 languages are also returned in XMETHODS.
2243 Helper function for value_find_oload_list.
2244 ARGP is a pointer to a pointer to a value (the object).
2245 METHOD is a string containing the method name.
2246 OFFSET is the offset within the value.
2247 TYPE is the assumed type of the object.
2248 METHODS is a pointer to the matching overloaded instances defined
2249 in the source language. Since this is a recursive function,
2250 *METHODS should be set to NULL when calling this function.
2251 NUM_FNS is the number of overloaded instances. *NUM_FNS should be set to
2252 0 when calling this function.
2253 XMETHODS is the vector of matching xmethod workers. *XMETHODS
2254 should also be set to NULL when calling this function.
2255 BASETYPE is set to the actual type of the subobject where the
2257 BOFFSET is the offset of the base subobject where the method is found. */
2260 find_method_list (struct value
**argp
, const char *method
,
2261 LONGEST offset
, struct type
*type
,
2262 gdb::array_view
<fn_field
> *methods
,
2263 std::vector
<xmethod_worker_up
> *xmethods
,
2264 struct type
**basetype
, LONGEST
*boffset
)
2267 struct fn_field
*f
= NULL
;
2269 gdb_assert (methods
!= NULL
&& xmethods
!= NULL
);
2270 type
= check_typedef (type
);
2272 /* First check in object itself.
2273 This function is called recursively to search through base classes.
2274 If there is a source method match found at some stage, then we need not
2275 look for source methods in consequent recursive calls. */
2276 if (methods
->empty ())
2278 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
2280 /* pai: FIXME What about operators and type conversions? */
2281 const char *fn_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
2283 if (fn_field_name
&& (strcmp_iw (fn_field_name
, method
) == 0))
2285 int len
= TYPE_FN_FIELDLIST_LENGTH (type
, i
);
2286 f
= TYPE_FN_FIELDLIST1 (type
, i
);
2287 *methods
= gdb::make_array_view (f
, len
);
2292 /* Resolve any stub methods. */
2293 check_stub_method_group (type
, i
);
2300 /* Unlike source methods, xmethods can be accumulated over successive
2301 recursive calls. In other words, an xmethod named 'm' in a class
2302 will not hide an xmethod named 'm' in its base class(es). We want
2303 it to be this way because xmethods are after all convenience functions
2304 and hence there is no point restricting them with something like method
2305 hiding. Moreover, if hiding is done for xmethods as well, then we will
2306 have to provide a mechanism to un-hide (like the 'using' construct). */
2307 get_matching_xmethod_workers (type
, method
, xmethods
);
2309 /* If source methods are not found in current class, look for them in the
2310 base classes. We also have to go through the base classes to gather
2311 extension methods. */
2312 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2314 LONGEST base_offset
;
2316 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2318 base_offset
= baseclass_offset (type
, i
,
2319 value_contents_for_printing (*argp
),
2320 value_offset (*argp
) + offset
,
2321 value_address (*argp
), *argp
);
2323 else /* Non-virtual base, simply use bit position from debug
2326 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2329 find_method_list (argp
, method
, base_offset
+ offset
,
2330 TYPE_BASECLASS (type
, i
), methods
,
2331 xmethods
, basetype
, boffset
);
2335 /* Return the list of overloaded methods of a specified name. The methods
2336 could be those GDB finds in the binary, or xmethod. Methods found in
2337 the binary are returned in METHODS, and xmethods are returned in
2340 ARGP is a pointer to a pointer to a value (the object).
2341 METHOD is the method name.
2342 OFFSET is the offset within the value contents.
2343 METHODS is the list of matching overloaded instances defined in
2344 the source language.
2345 XMETHODS is the vector of matching xmethod workers defined in
2346 extension languages.
2347 BASETYPE is set to the type of the base subobject that defines the
2349 BOFFSET is the offset of the base subobject which defines the method. */
2352 value_find_oload_method_list (struct value
**argp
, const char *method
,
2354 gdb::array_view
<fn_field
> *methods
,
2355 std::vector
<xmethod_worker_up
> *xmethods
,
2356 struct type
**basetype
, LONGEST
*boffset
)
2360 t
= check_typedef (value_type (*argp
));
2362 /* Code snarfed from value_struct_elt. */
2363 while (t
->code () == TYPE_CODE_PTR
|| TYPE_IS_REFERENCE (t
))
2365 *argp
= value_ind (*argp
);
2366 /* Don't coerce fn pointer to fn and then back again! */
2367 if (check_typedef (value_type (*argp
))->code () != TYPE_CODE_FUNC
)
2368 *argp
= coerce_array (*argp
);
2369 t
= check_typedef (value_type (*argp
));
2372 if (t
->code () != TYPE_CODE_STRUCT
2373 && t
->code () != TYPE_CODE_UNION
)
2374 error (_("Attempt to extract a component of a "
2375 "value that is not a struct or union"));
2377 gdb_assert (methods
!= NULL
&& xmethods
!= NULL
);
2379 /* Clear the lists. */
2383 find_method_list (argp
, method
, 0, t
, methods
, xmethods
,
2387 /* Given an array of arguments (ARGS) (which includes an entry for
2388 "this" in the case of C++ methods), the NAME of a function, and
2389 whether it's a method or not (METHOD), find the best function that
2390 matches on the argument types according to the overload resolution
2393 METHOD can be one of three values:
2394 NON_METHOD for non-member functions.
2395 METHOD: for member functions.
2396 BOTH: used for overload resolution of operators where the
2397 candidates are expected to be either member or non member
2398 functions. In this case the first argument ARGTYPES
2399 (representing 'this') is expected to be a reference to the
2400 target object, and will be dereferenced when attempting the
2403 In the case of class methods, the parameter OBJ is an object value
2404 in which to search for overloaded methods.
2406 In the case of non-method functions, the parameter FSYM is a symbol
2407 corresponding to one of the overloaded functions.
2409 Return value is an integer: 0 -> good match, 10 -> debugger applied
2410 non-standard coercions, 100 -> incompatible.
2412 If a method is being searched for, VALP will hold the value.
2413 If a non-method is being searched for, SYMP will hold the symbol
2416 If a method is being searched for, and it is a static method,
2417 then STATICP will point to a non-zero value.
2419 If NO_ADL argument dependent lookup is disabled. This is used to prevent
2420 ADL overload candidates when performing overload resolution for a fully
2423 If NOSIDE is EVAL_AVOID_SIDE_EFFECTS, then OBJP's memory cannot be
2424 read while picking the best overload match (it may be all zeroes and thus
2425 not have a vtable pointer), in which case skip virtual function lookup.
2426 This is ok as typically EVAL_AVOID_SIDE_EFFECTS is only used to determine
2429 Note: This function does *not* check the value of
2430 overload_resolution. Caller must check it to see whether overload
2431 resolution is permitted. */
2434 find_overload_match (gdb::array_view
<value
*> args
,
2435 const char *name
, enum oload_search_type method
,
2436 struct value
**objp
, struct symbol
*fsym
,
2437 struct value
**valp
, struct symbol
**symp
,
2438 int *staticp
, const int no_adl
,
2439 const enum noside noside
)
2441 struct value
*obj
= (objp
? *objp
: NULL
);
2442 struct type
*obj_type
= obj
? value_type (obj
) : NULL
;
2443 /* Index of best overloaded function. */
2444 int func_oload_champ
= -1;
2445 int method_oload_champ
= -1;
2446 int src_method_oload_champ
= -1;
2447 int ext_method_oload_champ
= -1;
2449 /* The measure for the current best match. */
2450 badness_vector method_badness
;
2451 badness_vector func_badness
;
2452 badness_vector ext_method_badness
;
2453 badness_vector src_method_badness
;
2455 struct value
*temp
= obj
;
2456 /* For methods, the list of overloaded methods. */
2457 gdb::array_view
<fn_field
> methods
;
2458 /* For non-methods, the list of overloaded function symbols. */
2459 std::vector
<symbol
*> functions
;
2460 /* For xmethods, the vector of xmethod workers. */
2461 std::vector
<xmethod_worker_up
> xmethods
;
2462 struct type
*basetype
= NULL
;
2465 const char *obj_type_name
= NULL
;
2466 const char *func_name
= NULL
;
2467 gdb::unique_xmalloc_ptr
<char> temp_func
;
2468 enum oload_classification match_quality
;
2469 enum oload_classification method_match_quality
= INCOMPATIBLE
;
2470 enum oload_classification src_method_match_quality
= INCOMPATIBLE
;
2471 enum oload_classification ext_method_match_quality
= INCOMPATIBLE
;
2472 enum oload_classification func_match_quality
= INCOMPATIBLE
;
2474 /* Get the list of overloaded methods or functions. */
2475 if (method
== METHOD
|| method
== BOTH
)
2479 /* OBJ may be a pointer value rather than the object itself. */
2480 obj
= coerce_ref (obj
);
2481 while (check_typedef (value_type (obj
))->code () == TYPE_CODE_PTR
)
2482 obj
= coerce_ref (value_ind (obj
));
2483 obj_type_name
= value_type (obj
)->name ();
2485 /* First check whether this is a data member, e.g. a pointer to
2487 if (check_typedef (value_type (obj
))->code () == TYPE_CODE_STRUCT
)
2489 *valp
= search_struct_field (name
, obj
,
2490 check_typedef (value_type (obj
)), 0);
2498 /* Retrieve the list of methods with the name NAME. */
2499 value_find_oload_method_list (&temp
, name
, 0, &methods
,
2500 &xmethods
, &basetype
, &boffset
);
2501 /* If this is a method only search, and no methods were found
2502 the search has failed. */
2503 if (method
== METHOD
&& methods
.empty () && xmethods
.empty ())
2504 error (_("Couldn't find method %s%s%s"),
2506 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2508 /* If we are dealing with stub method types, they should have
2509 been resolved by find_method_list via
2510 value_find_oload_method_list above. */
2511 if (!methods
.empty ())
2513 gdb_assert (TYPE_SELF_TYPE (methods
[0].type
) != NULL
);
2515 src_method_oload_champ
2516 = find_oload_champ (args
,
2518 methods
.data (), NULL
, NULL
,
2519 &src_method_badness
);
2521 src_method_match_quality
= classify_oload_match
2522 (src_method_badness
, args
.size (),
2523 oload_method_static_p (methods
.data (), src_method_oload_champ
));
2526 if (!xmethods
.empty ())
2528 ext_method_oload_champ
2529 = find_oload_champ (args
,
2531 NULL
, xmethods
.data (), NULL
,
2532 &ext_method_badness
);
2533 ext_method_match_quality
= classify_oload_match (ext_method_badness
,
2537 if (src_method_oload_champ
>= 0 && ext_method_oload_champ
>= 0)
2539 switch (compare_badness (ext_method_badness
, src_method_badness
))
2541 case 0: /* Src method and xmethod are equally good. */
2542 /* If src method and xmethod are equally good, then
2543 xmethod should be the winner. Hence, fall through to the
2544 case where a xmethod is better than the source
2545 method, except when the xmethod match quality is
2548 case 1: /* Src method and ext method are incompatible. */
2549 /* If ext method match is not standard, then let source method
2550 win. Otherwise, fallthrough to let xmethod win. */
2551 if (ext_method_match_quality
!= STANDARD
)
2553 method_oload_champ
= src_method_oload_champ
;
2554 method_badness
= src_method_badness
;
2555 ext_method_oload_champ
= -1;
2556 method_match_quality
= src_method_match_quality
;
2560 case 2: /* Ext method is champion. */
2561 method_oload_champ
= ext_method_oload_champ
;
2562 method_badness
= ext_method_badness
;
2563 src_method_oload_champ
= -1;
2564 method_match_quality
= ext_method_match_quality
;
2566 case 3: /* Src method is champion. */
2567 method_oload_champ
= src_method_oload_champ
;
2568 method_badness
= src_method_badness
;
2569 ext_method_oload_champ
= -1;
2570 method_match_quality
= src_method_match_quality
;
2573 gdb_assert_not_reached ("Unexpected overload comparison "
2578 else if (src_method_oload_champ
>= 0)
2580 method_oload_champ
= src_method_oload_champ
;
2581 method_badness
= src_method_badness
;
2582 method_match_quality
= src_method_match_quality
;
2584 else if (ext_method_oload_champ
>= 0)
2586 method_oload_champ
= ext_method_oload_champ
;
2587 method_badness
= ext_method_badness
;
2588 method_match_quality
= ext_method_match_quality
;
2592 if (method
== NON_METHOD
|| method
== BOTH
)
2594 const char *qualified_name
= NULL
;
2596 /* If the overload match is being search for both as a method
2597 and non member function, the first argument must now be
2600 args
[0] = value_ind (args
[0]);
2604 qualified_name
= fsym
->natural_name ();
2606 /* If we have a function with a C++ name, try to extract just
2607 the function part. Do not try this for non-functions (e.g.
2608 function pointers). */
2610 && (check_typedef (SYMBOL_TYPE (fsym
))->code ()
2613 temp_func
= cp_func_name (qualified_name
);
2615 /* If cp_func_name did not remove anything, the name of the
2616 symbol did not include scope or argument types - it was
2617 probably a C-style function. */
2618 if (temp_func
!= nullptr)
2620 if (strcmp (temp_func
.get (), qualified_name
) == 0)
2623 func_name
= temp_func
.get ();
2630 qualified_name
= name
;
2633 /* If there was no C++ name, this must be a C-style function or
2634 not a function at all. Just return the same symbol. Do the
2635 same if cp_func_name fails for some reason. */
2636 if (func_name
== NULL
)
2642 func_oload_champ
= find_oload_champ_namespace (args
,
2649 if (func_oload_champ
>= 0)
2650 func_match_quality
= classify_oload_match (func_badness
,
2654 /* Did we find a match ? */
2655 if (method_oload_champ
== -1 && func_oload_champ
== -1)
2656 throw_error (NOT_FOUND_ERROR
,
2657 _("No symbol \"%s\" in current context."),
2660 /* If we have found both a method match and a function
2661 match, find out which one is better, and calculate match
2663 if (method_oload_champ
>= 0 && func_oload_champ
>= 0)
2665 switch (compare_badness (func_badness
, method_badness
))
2667 case 0: /* Top two contenders are equally good. */
2668 /* FIXME: GDB does not support the general ambiguous case.
2669 All candidates should be collected and presented the
2671 error (_("Ambiguous overload resolution"));
2673 case 1: /* Incomparable top contenders. */
2674 /* This is an error incompatible candidates
2675 should not have been proposed. */
2676 error (_("Internal error: incompatible "
2677 "overload candidates proposed"));
2679 case 2: /* Function champion. */
2680 method_oload_champ
= -1;
2681 match_quality
= func_match_quality
;
2683 case 3: /* Method champion. */
2684 func_oload_champ
= -1;
2685 match_quality
= method_match_quality
;
2688 error (_("Internal error: unexpected overload comparison result"));
2694 /* We have either a method match or a function match. */
2695 if (method_oload_champ
>= 0)
2696 match_quality
= method_match_quality
;
2698 match_quality
= func_match_quality
;
2701 if (match_quality
== INCOMPATIBLE
)
2703 if (method
== METHOD
)
2704 error (_("Cannot resolve method %s%s%s to any overloaded instance"),
2706 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2709 error (_("Cannot resolve function %s to any overloaded instance"),
2712 else if (match_quality
== NON_STANDARD
)
2714 if (method
== METHOD
)
2715 warning (_("Using non-standard conversion to match "
2716 "method %s%s%s to supplied arguments"),
2718 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2721 warning (_("Using non-standard conversion to match "
2722 "function %s to supplied arguments"),
2726 if (staticp
!= NULL
)
2727 *staticp
= oload_method_static_p (methods
.data (), method_oload_champ
);
2729 if (method_oload_champ
>= 0)
2731 if (src_method_oload_champ
>= 0)
2733 if (TYPE_FN_FIELD_VIRTUAL_P (methods
, method_oload_champ
)
2734 && noside
!= EVAL_AVOID_SIDE_EFFECTS
)
2736 *valp
= value_virtual_fn_field (&temp
, methods
.data (),
2737 method_oload_champ
, basetype
,
2741 *valp
= value_fn_field (&temp
, methods
.data (),
2742 method_oload_champ
, basetype
, boffset
);
2745 *valp
= value_from_xmethod
2746 (std::move (xmethods
[ext_method_oload_champ
]));
2749 *symp
= functions
[func_oload_champ
];
2753 struct type
*temp_type
= check_typedef (value_type (temp
));
2754 struct type
*objtype
= check_typedef (obj_type
);
2756 if (temp_type
->code () != TYPE_CODE_PTR
2757 && (objtype
->code () == TYPE_CODE_PTR
2758 || TYPE_IS_REFERENCE (objtype
)))
2760 temp
= value_addr (temp
);
2765 switch (match_quality
)
2771 default: /* STANDARD */
2776 /* Find the best overload match, searching for FUNC_NAME in namespaces
2777 contained in QUALIFIED_NAME until it either finds a good match or
2778 runs out of namespaces. It stores the overloaded functions in
2779 *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. If NO_ADL,
2780 argument dependent lookup is not performed. */
2783 find_oload_champ_namespace (gdb::array_view
<value
*> args
,
2784 const char *func_name
,
2785 const char *qualified_name
,
2786 std::vector
<symbol
*> *oload_syms
,
2787 badness_vector
*oload_champ_bv
,
2792 find_oload_champ_namespace_loop (args
,
2795 oload_syms
, oload_champ_bv
,
2802 /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is
2803 how deep we've looked for namespaces, and the champ is stored in
2804 OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0
2805 if it isn't. Other arguments are the same as in
2806 find_oload_champ_namespace. */
2809 find_oload_champ_namespace_loop (gdb::array_view
<value
*> args
,
2810 const char *func_name
,
2811 const char *qualified_name
,
2813 std::vector
<symbol
*> *oload_syms
,
2814 badness_vector
*oload_champ_bv
,
2818 int next_namespace_len
= namespace_len
;
2819 int searched_deeper
= 0;
2820 int new_oload_champ
;
2821 char *new_namespace
;
2823 if (next_namespace_len
!= 0)
2825 gdb_assert (qualified_name
[next_namespace_len
] == ':');
2826 next_namespace_len
+= 2;
2828 next_namespace_len
+=
2829 cp_find_first_component (qualified_name
+ next_namespace_len
);
2831 /* First, see if we have a deeper namespace we can search in.
2832 If we get a good match there, use it. */
2834 if (qualified_name
[next_namespace_len
] == ':')
2836 searched_deeper
= 1;
2838 if (find_oload_champ_namespace_loop (args
,
2839 func_name
, qualified_name
,
2841 oload_syms
, oload_champ_bv
,
2842 oload_champ
, no_adl
))
2848 /* If we reach here, either we're in the deepest namespace or we
2849 didn't find a good match in a deeper namespace. But, in the
2850 latter case, we still have a bad match in a deeper namespace;
2851 note that we might not find any match at all in the current
2852 namespace. (There's always a match in the deepest namespace,
2853 because this overload mechanism only gets called if there's a
2854 function symbol to start off with.) */
2856 new_namespace
= (char *) alloca (namespace_len
+ 1);
2857 strncpy (new_namespace
, qualified_name
, namespace_len
);
2858 new_namespace
[namespace_len
] = '\0';
2860 std::vector
<symbol
*> new_oload_syms
2861 = make_symbol_overload_list (func_name
, new_namespace
);
2863 /* If we have reached the deepest level perform argument
2864 determined lookup. */
2865 if (!searched_deeper
&& !no_adl
)
2868 struct type
**arg_types
;
2870 /* Prepare list of argument types for overload resolution. */
2871 arg_types
= (struct type
**)
2872 alloca (args
.size () * (sizeof (struct type
*)));
2873 for (ix
= 0; ix
< args
.size (); ix
++)
2874 arg_types
[ix
] = value_type (args
[ix
]);
2875 add_symbol_overload_list_adl ({arg_types
, args
.size ()}, func_name
,
2879 badness_vector new_oload_champ_bv
;
2880 new_oload_champ
= find_oload_champ (args
,
2881 new_oload_syms
.size (),
2882 NULL
, NULL
, new_oload_syms
.data (),
2883 &new_oload_champ_bv
);
2885 /* Case 1: We found a good match. Free earlier matches (if any),
2886 and return it. Case 2: We didn't find a good match, but we're
2887 not the deepest function. Then go with the bad match that the
2888 deeper function found. Case 3: We found a bad match, and we're
2889 the deepest function. Then return what we found, even though
2890 it's a bad match. */
2892 if (new_oload_champ
!= -1
2893 && classify_oload_match (new_oload_champ_bv
, args
.size (), 0) == STANDARD
)
2895 *oload_syms
= std::move (new_oload_syms
);
2896 *oload_champ
= new_oload_champ
;
2897 *oload_champ_bv
= std::move (new_oload_champ_bv
);
2900 else if (searched_deeper
)
2906 *oload_syms
= std::move (new_oload_syms
);
2907 *oload_champ
= new_oload_champ
;
2908 *oload_champ_bv
= std::move (new_oload_champ_bv
);
2913 /* Look for a function to take ARGS. Find the best match from among
2914 the overloaded methods or functions given by METHODS or FUNCTIONS
2915 or XMETHODS, respectively. One, and only one of METHODS, FUNCTIONS
2916 and XMETHODS can be non-NULL.
2918 NUM_FNS is the length of the array pointed at by METHODS, FUNCTIONS
2919 or XMETHODS, whichever is non-NULL.
2921 Return the index of the best match; store an indication of the
2922 quality of the match in OLOAD_CHAMP_BV. */
2925 find_oload_champ (gdb::array_view
<value
*> args
,
2928 xmethod_worker_up
*xmethods
,
2930 badness_vector
*oload_champ_bv
)
2932 /* A measure of how good an overloaded instance is. */
2934 /* Index of best overloaded function. */
2935 int oload_champ
= -1;
2936 /* Current ambiguity state for overload resolution. */
2937 int oload_ambiguous
= 0;
2938 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */
2940 /* A champion can be found among methods alone, or among functions
2941 alone, or in xmethods alone, but not in more than one of these
2943 gdb_assert ((methods
!= NULL
) + (functions
!= NULL
) + (xmethods
!= NULL
)
2946 /* Consider each candidate in turn. */
2947 for (size_t ix
= 0; ix
< num_fns
; ix
++)
2950 int static_offset
= 0;
2951 std::vector
<type
*> parm_types
;
2953 if (xmethods
!= NULL
)
2954 parm_types
= xmethods
[ix
]->get_arg_types ();
2959 if (methods
!= NULL
)
2961 nparms
= TYPE_FN_FIELD_TYPE (methods
, ix
)->num_fields ();
2962 static_offset
= oload_method_static_p (methods
, ix
);
2965 nparms
= SYMBOL_TYPE (functions
[ix
])->num_fields ();
2967 parm_types
.reserve (nparms
);
2968 for (jj
= 0; jj
< nparms
; jj
++)
2970 type
*t
= (methods
!= NULL
2971 ? (TYPE_FN_FIELD_ARGS (methods
, ix
)[jj
].type ())
2972 : SYMBOL_TYPE (functions
[ix
])->field (jj
).type ());
2973 parm_types
.push_back (t
);
2977 /* Compare parameter types to supplied argument types. Skip
2978 THIS for static methods. */
2979 bv
= rank_function (parm_types
,
2980 args
.slice (static_offset
));
2984 if (methods
!= NULL
)
2985 fprintf_filtered (gdb_stderr
,
2986 "Overloaded method instance %s, # of parms %d\n",
2987 methods
[ix
].physname
, (int) parm_types
.size ());
2988 else if (xmethods
!= NULL
)
2989 fprintf_filtered (gdb_stderr
,
2990 "Xmethod worker, # of parms %d\n",
2991 (int) parm_types
.size ());
2993 fprintf_filtered (gdb_stderr
,
2994 "Overloaded function instance "
2995 "%s # of parms %d\n",
2996 functions
[ix
]->demangled_name (),
2997 (int) parm_types
.size ());
2999 fprintf_filtered (gdb_stderr
,
3000 "...Badness of length : {%d, %d}\n",
3001 bv
[0].rank
, bv
[0].subrank
);
3003 for (jj
= 1; jj
< bv
.size (); jj
++)
3004 fprintf_filtered (gdb_stderr
,
3005 "...Badness of arg %d : {%d, %d}\n",
3006 jj
, bv
[jj
].rank
, bv
[jj
].subrank
);
3009 if (oload_champ_bv
->empty ())
3011 *oload_champ_bv
= std::move (bv
);
3014 else /* See whether current candidate is better or worse than
3016 switch (compare_badness (bv
, *oload_champ_bv
))
3018 case 0: /* Top two contenders are equally good. */
3019 oload_ambiguous
= 1;
3021 case 1: /* Incomparable top contenders. */
3022 oload_ambiguous
= 2;
3024 case 2: /* New champion, record details. */
3025 *oload_champ_bv
= std::move (bv
);
3026 oload_ambiguous
= 0;
3034 fprintf_filtered (gdb_stderr
, "Overload resolution "
3035 "champion is %d, ambiguous? %d\n",
3036 oload_champ
, oload_ambiguous
);
3042 /* Return 1 if we're looking at a static method, 0 if we're looking at
3043 a non-static method or a function that isn't a method. */
3046 oload_method_static_p (struct fn_field
*fns_ptr
, int index
)
3048 if (fns_ptr
&& index
>= 0 && TYPE_FN_FIELD_STATIC_P (fns_ptr
, index
))
3054 /* Check how good an overload match OLOAD_CHAMP_BV represents. */
3056 static enum oload_classification
3057 classify_oload_match (const badness_vector
&oload_champ_bv
,
3062 enum oload_classification worst
= STANDARD
;
3064 for (ix
= 1; ix
<= nargs
- static_offset
; ix
++)
3066 /* If this conversion is as bad as INCOMPATIBLE_TYPE_BADNESS
3067 or worse return INCOMPATIBLE. */
3068 if (compare_ranks (oload_champ_bv
[ix
],
3069 INCOMPATIBLE_TYPE_BADNESS
) <= 0)
3070 return INCOMPATIBLE
; /* Truly mismatched types. */
3071 /* Otherwise If this conversion is as bad as
3072 NS_POINTER_CONVERSION_BADNESS or worse return NON_STANDARD. */
3073 else if (compare_ranks (oload_champ_bv
[ix
],
3074 NS_POINTER_CONVERSION_BADNESS
) <= 0)
3075 worst
= NON_STANDARD
; /* Non-standard type conversions
3079 /* If no INCOMPATIBLE classification was found, return the worst one
3080 that was found (if any). */
3084 /* C++: return 1 is NAME is a legitimate name for the destructor of
3085 type TYPE. If TYPE does not have a destructor, or if NAME is
3086 inappropriate for TYPE, an error is signaled. Parameter TYPE should not yet
3087 have CHECK_TYPEDEF applied, this function will apply it itself. */
3090 destructor_name_p (const char *name
, struct type
*type
)
3094 const char *dname
= type_name_or_error (type
);
3095 const char *cp
= strchr (dname
, '<');
3098 /* Do not compare the template part for template classes. */
3100 len
= strlen (dname
);
3103 if (strlen (name
+ 1) != len
|| strncmp (dname
, name
+ 1, len
) != 0)
3104 error (_("name of destructor must equal name of class"));
3111 /* Find an enum constant named NAME in TYPE. TYPE must be an "enum
3112 class". If the name is found, return a value representing it;
3113 otherwise throw an exception. */
3115 static struct value
*
3116 enum_constant_from_type (struct type
*type
, const char *name
)
3119 int name_len
= strlen (name
);
3121 gdb_assert (type
->code () == TYPE_CODE_ENUM
3122 && TYPE_DECLARED_CLASS (type
));
3124 for (i
= TYPE_N_BASECLASSES (type
); i
< type
->num_fields (); ++i
)
3126 const char *fname
= TYPE_FIELD_NAME (type
, i
);
3129 if (TYPE_FIELD_LOC_KIND (type
, i
) != FIELD_LOC_KIND_ENUMVAL
3133 /* Look for the trailing "::NAME", since enum class constant
3134 names are qualified here. */
3135 len
= strlen (fname
);
3136 if (len
+ 2 >= name_len
3137 && fname
[len
- name_len
- 2] == ':'
3138 && fname
[len
- name_len
- 1] == ':'
3139 && strcmp (&fname
[len
- name_len
], name
) == 0)
3140 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, i
));
3143 error (_("no constant named \"%s\" in enum \"%s\""),
3144 name
, type
->name ());
3147 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3148 return the appropriate member (or the address of the member, if
3149 WANT_ADDRESS). This function is used to resolve user expressions
3150 of the form "DOMAIN::NAME". For more details on what happens, see
3151 the comment before value_struct_elt_for_reference. */
3154 value_aggregate_elt (struct type
*curtype
, const char *name
,
3155 struct type
*expect_type
, int want_address
,
3158 switch (curtype
->code ())
3160 case TYPE_CODE_STRUCT
:
3161 case TYPE_CODE_UNION
:
3162 return value_struct_elt_for_reference (curtype
, 0, curtype
,
3164 want_address
, noside
);
3165 case TYPE_CODE_NAMESPACE
:
3166 return value_namespace_elt (curtype
, name
,
3167 want_address
, noside
);
3169 case TYPE_CODE_ENUM
:
3170 return enum_constant_from_type (curtype
, name
);
3173 internal_error (__FILE__
, __LINE__
,
3174 _("non-aggregate type in value_aggregate_elt"));
3178 /* Compares the two method/function types T1 and T2 for "equality"
3179 with respect to the methods' parameters. If the types of the
3180 two parameter lists are the same, returns 1; 0 otherwise. This
3181 comparison may ignore any artificial parameters in T1 if
3182 SKIP_ARTIFICIAL is non-zero. This function will ALWAYS skip
3183 the first artificial parameter in T1, assumed to be a 'this' pointer.
3185 The type T2 is expected to have come from make_params (in eval.c). */
3188 compare_parameters (struct type
*t1
, struct type
*t2
, int skip_artificial
)
3192 if (t1
->num_fields () > 0 && TYPE_FIELD_ARTIFICIAL (t1
, 0))
3195 /* If skipping artificial fields, find the first real field
3197 if (skip_artificial
)
3199 while (start
< t1
->num_fields ()
3200 && TYPE_FIELD_ARTIFICIAL (t1
, start
))
3204 /* Now compare parameters. */
3206 /* Special case: a method taking void. T1 will contain no
3207 non-artificial fields, and T2 will contain TYPE_CODE_VOID. */
3208 if ((t1
->num_fields () - start
) == 0 && t2
->num_fields () == 1
3209 && t2
->field (0).type ()->code () == TYPE_CODE_VOID
)
3212 if ((t1
->num_fields () - start
) == t2
->num_fields ())
3216 for (i
= 0; i
< t2
->num_fields (); ++i
)
3218 if (compare_ranks (rank_one_type (t1
->field (start
+ i
).type (),
3219 t2
->field (i
).type (), NULL
),
3220 EXACT_MATCH_BADNESS
) != 0)
3230 /* C++: Given an aggregate type VT, and a class type CLS, search
3231 recursively for CLS using value V; If found, store the offset
3232 which is either fetched from the virtual base pointer if CLS
3233 is virtual or accumulated offset of its parent classes if
3234 CLS is non-virtual in *BOFFS, set ISVIRT to indicate if CLS
3235 is virtual, and return true. If not found, return false. */
3238 get_baseclass_offset (struct type
*vt
, struct type
*cls
,
3239 struct value
*v
, int *boffs
, bool *isvirt
)
3241 for (int i
= 0; i
< TYPE_N_BASECLASSES (vt
); i
++)
3243 struct type
*t
= vt
->field (i
).type ();
3244 if (types_equal (t
, cls
))
3246 if (BASETYPE_VIA_VIRTUAL (vt
, i
))
3248 const gdb_byte
*adr
= value_contents_for_printing (v
);
3249 *boffs
= baseclass_offset (vt
, i
, adr
, value_offset (v
),
3250 value_as_long (v
), v
);
3258 if (get_baseclass_offset (check_typedef (t
), cls
, v
, boffs
, isvirt
))
3260 if (*isvirt
== false) /* Add non-virtual base offset. */
3262 const gdb_byte
*adr
= value_contents_for_printing (v
);
3263 *boffs
+= baseclass_offset (vt
, i
, adr
, value_offset (v
),
3264 value_as_long (v
), v
);
3273 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3274 return the address of this member as a "pointer to member" type.
3275 If INTYPE is non-null, then it will be the type of the member we
3276 are looking for. This will help us resolve "pointers to member
3277 functions". This function is used to resolve user expressions of
3278 the form "DOMAIN::NAME". */
3280 static struct value
*
3281 value_struct_elt_for_reference (struct type
*domain
, int offset
,
3282 struct type
*curtype
, const char *name
,
3283 struct type
*intype
,
3287 struct type
*t
= check_typedef (curtype
);
3289 struct value
*result
;
3291 if (t
->code () != TYPE_CODE_STRUCT
3292 && t
->code () != TYPE_CODE_UNION
)
3293 error (_("Internal error: non-aggregate type "
3294 "to value_struct_elt_for_reference"));
3296 for (i
= t
->num_fields () - 1; i
>= TYPE_N_BASECLASSES (t
); i
--)
3298 const char *t_field_name
= TYPE_FIELD_NAME (t
, i
);
3300 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
3302 if (field_is_static (&t
->field (i
)))
3304 struct value
*v
= value_static_field (t
, i
);
3309 if (TYPE_FIELD_PACKED (t
, i
))
3310 error (_("pointers to bitfield members not allowed"));
3313 return value_from_longest
3314 (lookup_memberptr_type (t
->field (i
).type (), domain
),
3315 offset
+ (LONGEST
) (TYPE_FIELD_BITPOS (t
, i
) >> 3));
3316 else if (noside
!= EVAL_NORMAL
)
3317 return allocate_value (t
->field (i
).type ());
3320 /* Try to evaluate NAME as a qualified name with implicit
3321 this pointer. In this case, attempt to return the
3322 equivalent to `this->*(&TYPE::NAME)'. */
3323 struct value
*v
= value_of_this_silent (current_language
);
3326 struct value
*ptr
, *this_v
= v
;
3328 struct type
*type
, *tmp
;
3330 ptr
= value_aggregate_elt (domain
, name
, NULL
, 1, noside
);
3331 type
= check_typedef (value_type (ptr
));
3332 gdb_assert (type
!= NULL
3333 && type
->code () == TYPE_CODE_MEMBERPTR
);
3334 tmp
= lookup_pointer_type (TYPE_SELF_TYPE (type
));
3335 v
= value_cast_pointers (tmp
, v
, 1);
3336 mem_offset
= value_as_long (ptr
);
3337 if (domain
!= curtype
)
3339 /* Find class offset of type CURTYPE from either its
3340 parent type DOMAIN or the type of implied this. */
3342 bool isvirt
= false;
3343 if (get_baseclass_offset (domain
, curtype
, v
, &boff
,
3348 struct type
*p
= check_typedef (value_type (this_v
));
3349 p
= check_typedef (TYPE_TARGET_TYPE (p
));
3350 if (get_baseclass_offset (p
, curtype
, this_v
,
3355 tmp
= lookup_pointer_type (TYPE_TARGET_TYPE (type
));
3356 result
= value_from_pointer (tmp
,
3357 value_as_long (v
) + mem_offset
);
3358 return value_ind (result
);
3361 error (_("Cannot reference non-static field \"%s\""), name
);
3366 /* C++: If it was not found as a data field, then try to return it
3367 as a pointer to a method. */
3369 /* Perform all necessary dereferencing. */
3370 while (intype
&& intype
->code () == TYPE_CODE_PTR
)
3371 intype
= TYPE_TARGET_TYPE (intype
);
3373 for (i
= TYPE_NFN_FIELDS (t
) - 1; i
>= 0; --i
)
3375 const char *t_field_name
= TYPE_FN_FIELDLIST_NAME (t
, i
);
3377 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
3380 int len
= TYPE_FN_FIELDLIST_LENGTH (t
, i
);
3381 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (t
, i
);
3383 check_stub_method_group (t
, i
);
3387 for (j
= 0; j
< len
; ++j
)
3389 if (TYPE_CONST (intype
) != TYPE_FN_FIELD_CONST (f
, j
))
3391 if (TYPE_VOLATILE (intype
) != TYPE_FN_FIELD_VOLATILE (f
, j
))
3394 if (compare_parameters (TYPE_FN_FIELD_TYPE (f
, j
), intype
, 0)
3395 || compare_parameters (TYPE_FN_FIELD_TYPE (f
, j
),
3401 error (_("no member function matches "
3402 "that type instantiation"));
3409 for (ii
= 0; ii
< len
; ++ii
)
3411 /* Skip artificial methods. This is necessary if,
3412 for example, the user wants to "print
3413 subclass::subclass" with only one user-defined
3414 constructor. There is no ambiguity in this case.
3415 We are careful here to allow artificial methods
3416 if they are the unique result. */
3417 if (TYPE_FN_FIELD_ARTIFICIAL (f
, ii
))
3424 /* Desired method is ambiguous if more than one
3425 method is defined. */
3426 if (j
!= -1 && !TYPE_FN_FIELD_ARTIFICIAL (f
, j
))
3427 error (_("non-unique member `%s' requires "
3428 "type instantiation"), name
);
3434 error (_("no matching member function"));
3437 if (TYPE_FN_FIELD_STATIC_P (f
, j
))
3440 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
3441 0, VAR_DOMAIN
, 0).symbol
;
3447 return value_addr (read_var_value (s
, 0, 0));
3449 return read_var_value (s
, 0, 0);
3452 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
3456 result
= allocate_value
3457 (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
3458 cplus_make_method_ptr (value_type (result
),
3459 value_contents_writeable (result
),
3460 TYPE_FN_FIELD_VOFFSET (f
, j
), 1);
3462 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
3463 return allocate_value (TYPE_FN_FIELD_TYPE (f
, j
));
3465 error (_("Cannot reference virtual member function \"%s\""),
3471 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
3472 0, VAR_DOMAIN
, 0).symbol
;
3477 struct value
*v
= read_var_value (s
, 0, 0);
3482 result
= allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
3483 cplus_make_method_ptr (value_type (result
),
3484 value_contents_writeable (result
),
3485 value_address (v
), 0);
3491 for (i
= TYPE_N_BASECLASSES (t
) - 1; i
>= 0; i
--)
3496 if (BASETYPE_VIA_VIRTUAL (t
, i
))
3499 base_offset
= TYPE_BASECLASS_BITPOS (t
, i
) / 8;
3500 v
= value_struct_elt_for_reference (domain
,
3501 offset
+ base_offset
,
3502 TYPE_BASECLASS (t
, i
),
3504 want_address
, noside
);
3509 /* As a last chance, pretend that CURTYPE is a namespace, and look
3510 it up that way; this (frequently) works for types nested inside
3513 return value_maybe_namespace_elt (curtype
, name
,
3514 want_address
, noside
);
3517 /* C++: Return the member NAME of the namespace given by the type
3520 static struct value
*
3521 value_namespace_elt (const struct type
*curtype
,
3522 const char *name
, int want_address
,
3525 struct value
*retval
= value_maybe_namespace_elt (curtype
, name
,
3530 error (_("No symbol \"%s\" in namespace \"%s\"."),
3531 name
, curtype
->name ());
3536 /* A helper function used by value_namespace_elt and
3537 value_struct_elt_for_reference. It looks up NAME inside the
3538 context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE
3539 is a class and NAME refers to a type in CURTYPE itself (as opposed
3540 to, say, some base class of CURTYPE). */
3542 static struct value
*
3543 value_maybe_namespace_elt (const struct type
*curtype
,
3544 const char *name
, int want_address
,
3547 const char *namespace_name
= curtype
->name ();
3548 struct block_symbol sym
;
3549 struct value
*result
;
3551 sym
= cp_lookup_symbol_namespace (namespace_name
, name
,
3552 get_selected_block (0), VAR_DOMAIN
);
3554 if (sym
.symbol
== NULL
)
3556 else if ((noside
== EVAL_AVOID_SIDE_EFFECTS
)
3557 && (SYMBOL_CLASS (sym
.symbol
) == LOC_TYPEDEF
))
3558 result
= allocate_value (SYMBOL_TYPE (sym
.symbol
));
3560 result
= value_of_variable (sym
.symbol
, sym
.block
);
3563 result
= value_addr (result
);
3568 /* Given a pointer or a reference value V, find its real (RTTI) type.
3570 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
3571 and refer to the values computed for the object pointed to. */
3574 value_rtti_indirect_type (struct value
*v
, int *full
,
3575 LONGEST
*top
, int *using_enc
)
3577 struct value
*target
= NULL
;
3578 struct type
*type
, *real_type
, *target_type
;
3580 type
= value_type (v
);
3581 type
= check_typedef (type
);
3582 if (TYPE_IS_REFERENCE (type
))
3583 target
= coerce_ref (v
);
3584 else if (type
->code () == TYPE_CODE_PTR
)
3589 target
= value_ind (v
);
3591 catch (const gdb_exception_error
&except
)
3593 if (except
.error
== MEMORY_ERROR
)
3595 /* value_ind threw a memory error. The pointer is NULL or
3596 contains an uninitialized value: we can't determine any
3606 real_type
= value_rtti_type (target
, full
, top
, using_enc
);
3610 /* Copy qualifiers to the referenced object. */
3611 target_type
= value_type (target
);
3612 real_type
= make_cv_type (TYPE_CONST (target_type
),
3613 TYPE_VOLATILE (target_type
), real_type
, NULL
);
3614 if (TYPE_IS_REFERENCE (type
))
3615 real_type
= lookup_reference_type (real_type
, type
->code ());
3616 else if (type
->code () == TYPE_CODE_PTR
)
3617 real_type
= lookup_pointer_type (real_type
);
3619 internal_error (__FILE__
, __LINE__
, _("Unexpected value type."));
3621 /* Copy qualifiers to the pointer/reference. */
3622 real_type
= make_cv_type (TYPE_CONST (type
), TYPE_VOLATILE (type
),
3629 /* Given a value pointed to by ARGP, check its real run-time type, and
3630 if that is different from the enclosing type, create a new value
3631 using the real run-time type as the enclosing type (and of the same
3632 type as ARGP) and return it, with the embedded offset adjusted to
3633 be the correct offset to the enclosed object. RTYPE is the type,
3634 and XFULL, XTOP, and XUSING_ENC are the other parameters, computed
3635 by value_rtti_type(). If these are available, they can be supplied
3636 and a second call to value_rtti_type() is avoided. (Pass RTYPE ==
3637 NULL if they're not available. */
3640 value_full_object (struct value
*argp
,
3642 int xfull
, int xtop
,
3645 struct type
*real_type
;
3649 struct value
*new_val
;
3656 using_enc
= xusing_enc
;
3659 real_type
= value_rtti_type (argp
, &full
, &top
, &using_enc
);
3661 /* If no RTTI data, or if object is already complete, do nothing. */
3662 if (!real_type
|| real_type
== value_enclosing_type (argp
))
3665 /* In a destructor we might see a real type that is a superclass of
3666 the object's type. In this case it is better to leave the object
3669 && TYPE_LENGTH (real_type
) < TYPE_LENGTH (value_enclosing_type (argp
)))
3672 /* If we have the full object, but for some reason the enclosing
3673 type is wrong, set it. */
3674 /* pai: FIXME -- sounds iffy */
3677 argp
= value_copy (argp
);
3678 set_value_enclosing_type (argp
, real_type
);
3682 /* Check if object is in memory. */
3683 if (VALUE_LVAL (argp
) != lval_memory
)
3685 warning (_("Couldn't retrieve complete object of RTTI "
3686 "type %s; object may be in register(s)."),
3687 real_type
->name ());
3692 /* All other cases -- retrieve the complete object. */
3693 /* Go back by the computed top_offset from the beginning of the
3694 object, adjusting for the embedded offset of argp if that's what
3695 value_rtti_type used for its computation. */
3696 new_val
= value_at_lazy (real_type
, value_address (argp
) - top
+
3697 (using_enc
? 0 : value_embedded_offset (argp
)));
3698 deprecated_set_value_type (new_val
, value_type (argp
));
3699 set_value_embedded_offset (new_val
, (using_enc
3700 ? top
+ value_embedded_offset (argp
)
3706 /* Return the value of the local variable, if one exists. Throw error
3707 otherwise, such as if the request is made in an inappropriate context. */
3710 value_of_this (const struct language_defn
*lang
)
3712 struct block_symbol sym
;
3713 const struct block
*b
;
3714 struct frame_info
*frame
;
3716 if (!lang
->la_name_of_this
)
3717 error (_("no `this' in current language"));
3719 frame
= get_selected_frame (_("no frame selected"));
3721 b
= get_frame_block (frame
, NULL
);
3723 sym
= lookup_language_this (lang
, b
);
3724 if (sym
.symbol
== NULL
)
3725 error (_("current stack frame does not contain a variable named `%s'"),
3726 lang
->la_name_of_this
);
3728 return read_var_value (sym
.symbol
, sym
.block
, frame
);
3731 /* Return the value of the local variable, if one exists. Return NULL
3732 otherwise. Never throw error. */
3735 value_of_this_silent (const struct language_defn
*lang
)
3737 struct value
*ret
= NULL
;
3741 ret
= value_of_this (lang
);
3743 catch (const gdb_exception_error
&except
)
3750 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH
3751 elements long, starting at LOWBOUND. The result has the same lower
3752 bound as the original ARRAY. */
3755 value_slice (struct value
*array
, int lowbound
, int length
)
3757 struct type
*slice_range_type
, *slice_type
, *range_type
;
3758 LONGEST lowerbound
, upperbound
;
3759 struct value
*slice
;
3760 struct type
*array_type
;
3762 array_type
= check_typedef (value_type (array
));
3763 if (array_type
->code () != TYPE_CODE_ARRAY
3764 && array_type
->code () != TYPE_CODE_STRING
)
3765 error (_("cannot take slice of non-array"));
3767 if (type_not_allocated (array_type
))
3768 error (_("array not allocated"));
3769 if (type_not_associated (array_type
))
3770 error (_("array not associated"));
3772 range_type
= array_type
->index_type ();
3773 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
3774 error (_("slice from bad array or bitstring"));
3776 if (lowbound
< lowerbound
|| length
< 0
3777 || lowbound
+ length
- 1 > upperbound
)
3778 error (_("slice out of range"));
3780 /* FIXME-type-allocation: need a way to free this type when we are
3782 slice_range_type
= create_static_range_type (NULL
,
3783 TYPE_TARGET_TYPE (range_type
),
3785 lowbound
+ length
- 1);
3788 struct type
*element_type
= TYPE_TARGET_TYPE (array_type
);
3790 = (lowbound
- lowerbound
) * TYPE_LENGTH (check_typedef (element_type
));
3792 slice_type
= create_array_type (NULL
,
3795 slice_type
->set_code (array_type
->code ());
3797 if (VALUE_LVAL (array
) == lval_memory
&& value_lazy (array
))
3798 slice
= allocate_value_lazy (slice_type
);
3801 slice
= allocate_value (slice_type
);
3802 value_contents_copy (slice
, 0, array
, offset
,
3803 type_length_units (slice_type
));
3806 set_value_component_location (slice
, array
);
3807 set_value_offset (slice
, value_offset (array
) + offset
);
3816 value_literal_complex (struct value
*arg1
,
3821 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3823 val
= allocate_value (type
);
3824 arg1
= value_cast (real_type
, arg1
);
3825 arg2
= value_cast (real_type
, arg2
);
3827 memcpy (value_contents_raw (val
),
3828 value_contents (arg1
), TYPE_LENGTH (real_type
));
3829 memcpy (value_contents_raw (val
) + TYPE_LENGTH (real_type
),
3830 value_contents (arg2
), TYPE_LENGTH (real_type
));
3837 value_real_part (struct value
*value
)
3839 struct type
*type
= check_typedef (value_type (value
));
3840 struct type
*ttype
= TYPE_TARGET_TYPE (type
);
3842 gdb_assert (type
->code () == TYPE_CODE_COMPLEX
);
3843 return value_from_component (value
, ttype
, 0);
3849 value_imaginary_part (struct value
*value
)
3851 struct type
*type
= check_typedef (value_type (value
));
3852 struct type
*ttype
= TYPE_TARGET_TYPE (type
);
3854 gdb_assert (type
->code () == TYPE_CODE_COMPLEX
);
3855 return value_from_component (value
, ttype
,
3856 TYPE_LENGTH (check_typedef (ttype
)));
3859 /* Cast a value into the appropriate complex data type. */
3861 static struct value
*
3862 cast_into_complex (struct type
*type
, struct value
*val
)
3864 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3866 if (value_type (val
)->code () == TYPE_CODE_COMPLEX
)
3868 struct type
*val_real_type
= TYPE_TARGET_TYPE (value_type (val
));
3869 struct value
*re_val
= allocate_value (val_real_type
);
3870 struct value
*im_val
= allocate_value (val_real_type
);
3872 memcpy (value_contents_raw (re_val
),
3873 value_contents (val
), TYPE_LENGTH (val_real_type
));
3874 memcpy (value_contents_raw (im_val
),
3875 value_contents (val
) + TYPE_LENGTH (val_real_type
),
3876 TYPE_LENGTH (val_real_type
));
3878 return value_literal_complex (re_val
, im_val
, type
);
3880 else if (value_type (val
)->code () == TYPE_CODE_FLT
3881 || value_type (val
)->code () == TYPE_CODE_INT
)
3882 return value_literal_complex (val
,
3883 value_zero (real_type
, not_lval
),
3886 error (_("cannot cast non-number to complex"));
3889 void _initialize_valops ();
3891 _initialize_valops ()
3893 add_setshow_boolean_cmd ("overload-resolution", class_support
,
3894 &overload_resolution
, _("\
3895 Set overload resolution in evaluating C++ functions."), _("\
3896 Show overload resolution in evaluating C++ functions."),
3898 show_overload_resolution
,
3899 &setlist
, &showlist
);
3900 overload_resolution
= 1;