1 /* Perform non-arithmetic operations on values, for GDB.
3 Copyright (C) 1986-2021 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 (bool staticp
, bool varargs
, int nargs
,
48 struct field t1
[], const gdb::array_view
<value
*> t2
);
50 static struct value
*search_struct_field (const char *, struct value
*,
53 static struct value
*search_struct_method (const char *, struct value
**,
54 gdb::optional
<gdb::array_view
<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 */
337 value_to_gdb_mpq (struct value
*value
)
339 struct type
*type
= check_typedef (value_type (value
));
342 if (is_floating_type (type
))
344 double d
= target_float_to_host_double (value_contents (value
),
346 mpq_set_d (result
.val
, d
);
350 gdb_assert (is_integral_type (type
)
351 || is_fixed_point_type (type
));
354 vz
.read (gdb::make_array_view (value_contents (value
),
356 type_byte_order (type
), type
->is_unsigned ());
357 mpq_set_z (result
.val
, vz
.val
);
359 if (is_fixed_point_type (type
))
360 mpq_mul (result
.val
, result
.val
,
361 type
->fixed_point_scaling_factor ().val
);
367 /* Assuming that TO_TYPE is a fixed point type, return a value
368 corresponding to the cast of FROM_VAL to that type. */
370 static struct value
*
371 value_cast_to_fixed_point (struct type
*to_type
, struct value
*from_val
)
373 struct type
*from_type
= value_type (from_val
);
375 if (from_type
== to_type
)
378 if (!is_floating_type (from_type
)
379 && !is_integral_type (from_type
)
380 && !is_fixed_point_type (from_type
))
381 error (_("Invalid conversion from type %s to fixed point type %s"),
382 from_type
->name (), to_type
->name ());
384 gdb_mpq vq
= value_to_gdb_mpq (from_val
);
386 /* Divide that value by the scaling factor to obtain the unscaled
387 value, first in rational form, and then in integer form. */
389 mpq_div (vq
.val
, vq
.val
, to_type
->fixed_point_scaling_factor ().val
);
390 gdb_mpz unscaled
= vq
.get_rounded ();
392 /* Finally, create the result value, and pack the unscaled value
394 struct value
*result
= allocate_value (to_type
);
395 unscaled
.write (gdb::make_array_view (value_contents_raw (result
),
396 TYPE_LENGTH (to_type
)),
397 type_byte_order (to_type
),
398 to_type
->is_unsigned ());
403 /* Cast value ARG2 to type TYPE and return as a value.
404 More general than a C cast: accepts any two types of the same length,
405 and if ARG2 is an lvalue it can be cast into anything at all. */
406 /* In C++, casts may change pointer or object representations. */
409 value_cast (struct type
*type
, struct value
*arg2
)
411 enum type_code code1
;
412 enum type_code code2
;
416 int convert_to_boolean
= 0;
418 /* TYPE might be equal in meaning to the existing type of ARG2, but for
419 many reasons, might be a different type object (e.g. TYPE might be a
420 gdbarch owned type, while VALUE_TYPE (ARG2) could be an objfile owned
423 In this case we want to preserve the LVAL of ARG2 as this allows the
424 resulting value to be used in more places. We do this by calling
425 VALUE_COPY if appropriate. */
426 if (types_deeply_equal (value_type (arg2
), type
))
428 /* If the types are exactly equal then we can avoid creating a new
430 if (value_type (arg2
) != type
)
432 arg2
= value_copy (arg2
);
433 deprecated_set_value_type (arg2
, type
);
438 if (is_fixed_point_type (type
))
439 return value_cast_to_fixed_point (type
, arg2
);
441 /* Check if we are casting struct reference to struct reference. */
442 if (TYPE_IS_REFERENCE (check_typedef (type
)))
444 /* We dereference type; then we recurse and finally
445 we generate value of the given reference. Nothing wrong with
447 struct type
*t1
= check_typedef (type
);
448 struct type
*dereftype
= check_typedef (TYPE_TARGET_TYPE (t1
));
449 struct value
*val
= value_cast (dereftype
, arg2
);
451 return value_ref (val
, t1
->code ());
454 if (TYPE_IS_REFERENCE (check_typedef (value_type (arg2
))))
455 /* We deref the value and then do the cast. */
456 return value_cast (type
, coerce_ref (arg2
));
458 /* Strip typedefs / resolve stubs in order to get at the type's
459 code/length, but remember the original type, to use as the
460 resulting type of the cast, in case it was a typedef. */
461 struct type
*to_type
= type
;
463 type
= check_typedef (type
);
464 code1
= type
->code ();
465 arg2
= coerce_ref (arg2
);
466 type2
= check_typedef (value_type (arg2
));
468 /* You can't cast to a reference type. See value_cast_pointers
470 gdb_assert (!TYPE_IS_REFERENCE (type
));
472 /* A cast to an undetermined-length array_type, such as
473 (TYPE [])OBJECT, is treated like a cast to (TYPE [N])OBJECT,
474 where N is sizeof(OBJECT)/sizeof(TYPE). */
475 if (code1
== TYPE_CODE_ARRAY
)
477 struct type
*element_type
= TYPE_TARGET_TYPE (type
);
478 unsigned element_length
= TYPE_LENGTH (check_typedef (element_type
));
480 if (element_length
> 0 && type
->bounds ()->high
.kind () == PROP_UNDEFINED
)
482 struct type
*range_type
= type
->index_type ();
483 int val_length
= TYPE_LENGTH (type2
);
484 LONGEST low_bound
, high_bound
, new_length
;
486 if (!get_discrete_bounds (range_type
, &low_bound
, &high_bound
))
487 low_bound
= 0, high_bound
= 0;
488 new_length
= val_length
/ element_length
;
489 if (val_length
% element_length
!= 0)
490 warning (_("array element type size does not "
491 "divide object size in cast"));
492 /* FIXME-type-allocation: need a way to free this type when
493 we are done with it. */
494 range_type
= create_static_range_type (NULL
,
495 TYPE_TARGET_TYPE (range_type
),
497 new_length
+ low_bound
- 1);
498 deprecated_set_value_type (arg2
,
499 create_array_type (NULL
,
506 if (current_language
->c_style_arrays_p ()
507 && type2
->code () == TYPE_CODE_ARRAY
508 && !type2
->is_vector ())
509 arg2
= value_coerce_array (arg2
);
511 if (type2
->code () == TYPE_CODE_FUNC
)
512 arg2
= value_coerce_function (arg2
);
514 type2
= check_typedef (value_type (arg2
));
515 code2
= type2
->code ();
517 if (code1
== TYPE_CODE_COMPLEX
)
518 return cast_into_complex (to_type
, arg2
);
519 if (code1
== TYPE_CODE_BOOL
)
521 code1
= TYPE_CODE_INT
;
522 convert_to_boolean
= 1;
524 if (code1
== TYPE_CODE_CHAR
)
525 code1
= TYPE_CODE_INT
;
526 if (code2
== TYPE_CODE_BOOL
|| code2
== TYPE_CODE_CHAR
)
527 code2
= TYPE_CODE_INT
;
529 scalar
= (code2
== TYPE_CODE_INT
|| code2
== TYPE_CODE_FLT
530 || code2
== TYPE_CODE_DECFLOAT
|| code2
== TYPE_CODE_ENUM
531 || code2
== TYPE_CODE_RANGE
532 || is_fixed_point_type (type2
));
534 if ((code1
== TYPE_CODE_STRUCT
|| code1
== TYPE_CODE_UNION
)
535 && (code2
== TYPE_CODE_STRUCT
|| code2
== TYPE_CODE_UNION
)
536 && type
->name () != 0)
538 struct value
*v
= value_cast_structs (to_type
, arg2
);
544 if (is_floating_type (type
) && scalar
)
546 if (is_floating_value (arg2
))
548 struct value
*v
= allocate_value (to_type
);
549 target_float_convert (value_contents (arg2
), type2
,
550 value_contents_raw (v
), type
);
553 else if (is_fixed_point_type (type2
))
557 fp_val
.read_fixed_point
558 (gdb::make_array_view (value_contents (arg2
), TYPE_LENGTH (type2
)),
559 type_byte_order (type2
), type2
->is_unsigned (),
560 type2
->fixed_point_scaling_factor ());
562 struct value
*v
= allocate_value (to_type
);
563 target_float_from_host_double (value_contents_raw (v
),
564 to_type
, mpq_get_d (fp_val
.val
));
568 /* The only option left is an integral type. */
569 if (type2
->is_unsigned ())
570 return value_from_ulongest (to_type
, value_as_long (arg2
));
572 return value_from_longest (to_type
, value_as_long (arg2
));
574 else if ((code1
== TYPE_CODE_INT
|| code1
== TYPE_CODE_ENUM
575 || code1
== TYPE_CODE_RANGE
)
576 && (scalar
|| code2
== TYPE_CODE_PTR
577 || code2
== TYPE_CODE_MEMBERPTR
))
581 /* When we cast pointers to integers, we mustn't use
582 gdbarch_pointer_to_address to find the address the pointer
583 represents, as value_as_long would. GDB should evaluate
584 expressions just as the compiler would --- and the compiler
585 sees a cast as a simple reinterpretation of the pointer's
587 if (code2
== TYPE_CODE_PTR
)
588 longest
= extract_unsigned_integer
589 (value_contents (arg2
), TYPE_LENGTH (type2
),
590 type_byte_order (type2
));
592 longest
= value_as_long (arg2
);
593 return value_from_longest (to_type
, convert_to_boolean
?
594 (LONGEST
) (longest
? 1 : 0) : longest
);
596 else if (code1
== TYPE_CODE_PTR
&& (code2
== TYPE_CODE_INT
597 || code2
== TYPE_CODE_ENUM
598 || code2
== TYPE_CODE_RANGE
))
600 /* TYPE_LENGTH (type) is the length of a pointer, but we really
601 want the length of an address! -- we are really dealing with
602 addresses (i.e., gdb representations) not pointers (i.e.,
603 target representations) here.
605 This allows things like "print *(int *)0x01000234" to work
606 without printing a misleading message -- which would
607 otherwise occur when dealing with a target having two byte
608 pointers and four byte addresses. */
610 int addr_bit
= gdbarch_addr_bit (type2
->arch ());
611 LONGEST longest
= value_as_long (arg2
);
613 if (addr_bit
< sizeof (LONGEST
) * HOST_CHAR_BIT
)
615 if (longest
>= ((LONGEST
) 1 << addr_bit
)
616 || longest
<= -((LONGEST
) 1 << addr_bit
))
617 warning (_("value truncated"));
619 return value_from_longest (to_type
, longest
);
621 else if (code1
== TYPE_CODE_METHODPTR
&& code2
== TYPE_CODE_INT
622 && value_as_long (arg2
) == 0)
624 struct value
*result
= allocate_value (to_type
);
626 cplus_make_method_ptr (to_type
, value_contents_writeable (result
), 0, 0);
629 else if (code1
== TYPE_CODE_MEMBERPTR
&& code2
== TYPE_CODE_INT
630 && value_as_long (arg2
) == 0)
632 /* The Itanium C++ ABI represents NULL pointers to members as
633 minus one, instead of biasing the normal case. */
634 return value_from_longest (to_type
, -1);
636 else if (code1
== TYPE_CODE_ARRAY
&& type
->is_vector ()
637 && code2
== TYPE_CODE_ARRAY
&& type2
->is_vector ()
638 && TYPE_LENGTH (type
) != TYPE_LENGTH (type2
))
639 error (_("Cannot convert between vector values of different sizes"));
640 else if (code1
== TYPE_CODE_ARRAY
&& type
->is_vector () && scalar
641 && TYPE_LENGTH (type
) != TYPE_LENGTH (type2
))
642 error (_("can only cast scalar to vector of same size"));
643 else if (code1
== TYPE_CODE_VOID
)
645 return value_zero (to_type
, not_lval
);
647 else if (TYPE_LENGTH (type
) == TYPE_LENGTH (type2
))
649 if (code1
== TYPE_CODE_PTR
&& code2
== TYPE_CODE_PTR
)
650 return value_cast_pointers (to_type
, arg2
, 0);
652 arg2
= value_copy (arg2
);
653 deprecated_set_value_type (arg2
, to_type
);
654 set_value_enclosing_type (arg2
, to_type
);
655 set_value_pointed_to_offset (arg2
, 0); /* pai: chk_val */
658 else if (VALUE_LVAL (arg2
) == lval_memory
)
659 return value_at_lazy (to_type
, value_address (arg2
));
662 if (current_language
->la_language
== language_ada
)
663 error (_("Invalid type conversion."));
664 error (_("Invalid cast."));
668 /* The C++ reinterpret_cast operator. */
671 value_reinterpret_cast (struct type
*type
, struct value
*arg
)
673 struct value
*result
;
674 struct type
*real_type
= check_typedef (type
);
675 struct type
*arg_type
, *dest_type
;
677 enum type_code dest_code
, arg_code
;
679 /* Do reference, function, and array conversion. */
680 arg
= coerce_array (arg
);
682 /* Attempt to preserve the type the user asked for. */
685 /* If we are casting to a reference type, transform
686 reinterpret_cast<T&[&]>(V) to *reinterpret_cast<T*>(&V). */
687 if (TYPE_IS_REFERENCE (real_type
))
690 arg
= value_addr (arg
);
691 dest_type
= lookup_pointer_type (TYPE_TARGET_TYPE (dest_type
));
692 real_type
= lookup_pointer_type (real_type
);
695 arg_type
= value_type (arg
);
697 dest_code
= real_type
->code ();
698 arg_code
= arg_type
->code ();
700 /* We can convert pointer types, or any pointer type to int, or int
702 if ((dest_code
== TYPE_CODE_PTR
&& arg_code
== TYPE_CODE_INT
)
703 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_PTR
)
704 || (dest_code
== TYPE_CODE_METHODPTR
&& arg_code
== TYPE_CODE_INT
)
705 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_METHODPTR
)
706 || (dest_code
== TYPE_CODE_MEMBERPTR
&& arg_code
== TYPE_CODE_INT
)
707 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_MEMBERPTR
)
708 || (dest_code
== arg_code
709 && (dest_code
== TYPE_CODE_PTR
710 || dest_code
== TYPE_CODE_METHODPTR
711 || dest_code
== TYPE_CODE_MEMBERPTR
)))
712 result
= value_cast (dest_type
, arg
);
714 error (_("Invalid reinterpret_cast"));
717 result
= value_cast (type
, value_ref (value_ind (result
),
723 /* A helper for value_dynamic_cast. This implements the first of two
724 runtime checks: we iterate over all the base classes of the value's
725 class which are equal to the desired class; if only one of these
726 holds the value, then it is the answer. */
729 dynamic_cast_check_1 (struct type
*desired_type
,
730 const gdb_byte
*valaddr
,
731 LONGEST embedded_offset
,
734 struct type
*search_type
,
736 struct type
*arg_type
,
737 struct value
**result
)
739 int i
, result_count
= 0;
741 for (i
= 0; i
< TYPE_N_BASECLASSES (search_type
) && result_count
< 2; ++i
)
743 LONGEST offset
= baseclass_offset (search_type
, i
, valaddr
,
747 if (class_types_same_p (desired_type
, TYPE_BASECLASS (search_type
, i
)))
749 if (address
+ embedded_offset
+ offset
>= arg_addr
750 && address
+ embedded_offset
+ offset
< arg_addr
+ TYPE_LENGTH (arg_type
))
754 *result
= value_at_lazy (TYPE_BASECLASS (search_type
, i
),
755 address
+ embedded_offset
+ offset
);
759 result_count
+= dynamic_cast_check_1 (desired_type
,
761 embedded_offset
+ offset
,
763 TYPE_BASECLASS (search_type
, i
),
772 /* A helper for value_dynamic_cast. This implements the second of two
773 runtime checks: we look for a unique public sibling class of the
774 argument's declared class. */
777 dynamic_cast_check_2 (struct type
*desired_type
,
778 const gdb_byte
*valaddr
,
779 LONGEST embedded_offset
,
782 struct type
*search_type
,
783 struct value
**result
)
785 int i
, result_count
= 0;
787 for (i
= 0; i
< TYPE_N_BASECLASSES (search_type
) && result_count
< 2; ++i
)
791 if (! BASETYPE_VIA_PUBLIC (search_type
, i
))
794 offset
= baseclass_offset (search_type
, i
, valaddr
, embedded_offset
,
796 if (class_types_same_p (desired_type
, TYPE_BASECLASS (search_type
, i
)))
800 *result
= value_at_lazy (TYPE_BASECLASS (search_type
, i
),
801 address
+ embedded_offset
+ offset
);
804 result_count
+= dynamic_cast_check_2 (desired_type
,
806 embedded_offset
+ offset
,
808 TYPE_BASECLASS (search_type
, i
),
815 /* The C++ dynamic_cast operator. */
818 value_dynamic_cast (struct type
*type
, struct value
*arg
)
822 struct type
*resolved_type
= check_typedef (type
);
823 struct type
*arg_type
= check_typedef (value_type (arg
));
824 struct type
*class_type
, *rtti_type
;
825 struct value
*result
, *tem
, *original_arg
= arg
;
827 int is_ref
= TYPE_IS_REFERENCE (resolved_type
);
829 if (resolved_type
->code () != TYPE_CODE_PTR
830 && !TYPE_IS_REFERENCE (resolved_type
))
831 error (_("Argument to dynamic_cast must be a pointer or reference type"));
832 if (TYPE_TARGET_TYPE (resolved_type
)->code () != TYPE_CODE_VOID
833 && TYPE_TARGET_TYPE (resolved_type
)->code () != TYPE_CODE_STRUCT
)
834 error (_("Argument to dynamic_cast must be pointer to class or `void *'"));
836 class_type
= check_typedef (TYPE_TARGET_TYPE (resolved_type
));
837 if (resolved_type
->code () == TYPE_CODE_PTR
)
839 if (arg_type
->code () != TYPE_CODE_PTR
840 && ! (arg_type
->code () == TYPE_CODE_INT
841 && value_as_long (arg
) == 0))
842 error (_("Argument to dynamic_cast does not have pointer type"));
843 if (arg_type
->code () == TYPE_CODE_PTR
)
845 arg_type
= check_typedef (TYPE_TARGET_TYPE (arg_type
));
846 if (arg_type
->code () != TYPE_CODE_STRUCT
)
847 error (_("Argument to dynamic_cast does "
848 "not have pointer to class type"));
851 /* Handle NULL pointers. */
852 if (value_as_long (arg
) == 0)
853 return value_zero (type
, not_lval
);
855 arg
= value_ind (arg
);
859 if (arg_type
->code () != TYPE_CODE_STRUCT
)
860 error (_("Argument to dynamic_cast does not have class type"));
863 /* If the classes are the same, just return the argument. */
864 if (class_types_same_p (class_type
, arg_type
))
865 return value_cast (type
, arg
);
867 /* If the target type is a unique base class of the argument's
868 declared type, just cast it. */
869 if (is_ancestor (class_type
, arg_type
))
871 if (is_unique_ancestor (class_type
, arg
))
872 return value_cast (type
, original_arg
);
873 error (_("Ambiguous dynamic_cast"));
876 rtti_type
= value_rtti_type (arg
, &full
, &top
, &using_enc
);
878 error (_("Couldn't determine value's most derived type for dynamic_cast"));
880 /* Compute the most derived object's address. */
881 addr
= value_address (arg
);
889 addr
+= top
+ value_embedded_offset (arg
);
891 /* dynamic_cast<void *> means to return a pointer to the
892 most-derived object. */
893 if (resolved_type
->code () == TYPE_CODE_PTR
894 && TYPE_TARGET_TYPE (resolved_type
)->code () == TYPE_CODE_VOID
)
895 return value_at_lazy (type
, addr
);
897 tem
= value_at (type
, addr
);
898 type
= value_type (tem
);
900 /* The first dynamic check specified in 5.2.7. */
901 if (is_public_ancestor (arg_type
, TYPE_TARGET_TYPE (resolved_type
)))
903 if (class_types_same_p (rtti_type
, TYPE_TARGET_TYPE (resolved_type
)))
906 if (dynamic_cast_check_1 (TYPE_TARGET_TYPE (resolved_type
),
907 value_contents_for_printing (tem
),
908 value_embedded_offset (tem
),
909 value_address (tem
), tem
,
913 return value_cast (type
,
915 ? value_ref (result
, resolved_type
->code ())
916 : value_addr (result
));
919 /* The second dynamic check specified in 5.2.7. */
921 if (is_public_ancestor (arg_type
, rtti_type
)
922 && dynamic_cast_check_2 (TYPE_TARGET_TYPE (resolved_type
),
923 value_contents_for_printing (tem
),
924 value_embedded_offset (tem
),
925 value_address (tem
), tem
,
926 rtti_type
, &result
) == 1)
927 return value_cast (type
,
929 ? value_ref (result
, resolved_type
->code ())
930 : value_addr (result
));
932 if (resolved_type
->code () == TYPE_CODE_PTR
)
933 return value_zero (type
, not_lval
);
935 error (_("dynamic_cast failed"));
938 /* Create a value of type TYPE that is zero, and return it. */
941 value_zero (struct type
*type
, enum lval_type lv
)
943 struct value
*val
= allocate_value (type
);
945 VALUE_LVAL (val
) = (lv
== lval_computed
? not_lval
: lv
);
949 /* Create a not_lval value of numeric type TYPE that is one, and return it. */
952 value_one (struct type
*type
)
954 struct type
*type1
= check_typedef (type
);
957 if (is_integral_type (type1
) || is_floating_type (type1
))
959 val
= value_from_longest (type
, (LONGEST
) 1);
961 else if (type1
->code () == TYPE_CODE_ARRAY
&& type1
->is_vector ())
963 struct type
*eltype
= check_typedef (TYPE_TARGET_TYPE (type1
));
965 LONGEST low_bound
, high_bound
;
968 if (!get_array_bounds (type1
, &low_bound
, &high_bound
))
969 error (_("Could not determine the vector bounds"));
971 val
= allocate_value (type
);
972 for (i
= 0; i
< high_bound
- low_bound
+ 1; i
++)
974 tmp
= value_one (eltype
);
975 memcpy (value_contents_writeable (val
) + i
* TYPE_LENGTH (eltype
),
976 value_contents_all (tmp
), TYPE_LENGTH (eltype
));
981 error (_("Not a numeric type."));
984 /* value_one result is never used for assignments to. */
985 gdb_assert (VALUE_LVAL (val
) == not_lval
);
990 /* Helper function for value_at, value_at_lazy, and value_at_lazy_stack.
991 The type of the created value may differ from the passed type TYPE.
992 Make sure to retrieve the returned values's new type after this call
993 e.g. in case the type is a variable length array. */
995 static struct value
*
996 get_value_at (struct type
*type
, CORE_ADDR addr
, int lazy
)
1000 if (check_typedef (type
)->code () == TYPE_CODE_VOID
)
1001 error (_("Attempt to dereference a generic pointer."));
1003 val
= value_from_contents_and_address (type
, NULL
, addr
);
1006 value_fetch_lazy (val
);
1011 /* Return a value with type TYPE located at ADDR.
1013 Call value_at only if the data needs to be fetched immediately;
1014 if we can be 'lazy' and defer the fetch, perhaps indefinitely, call
1015 value_at_lazy instead. value_at_lazy simply records the address of
1016 the data and sets the lazy-evaluation-required flag. The lazy flag
1017 is tested in the value_contents macro, which is used if and when
1018 the contents are actually required. The type of the created value
1019 may differ from the passed type TYPE. Make sure to retrieve the
1020 returned values's new type after this call e.g. in case the type
1021 is a variable length array.
1023 Note: value_at does *NOT* handle embedded offsets; perform such
1024 adjustments before or after calling it. */
1027 value_at (struct type
*type
, CORE_ADDR addr
)
1029 return get_value_at (type
, addr
, 0);
1032 /* Return a lazy value with type TYPE located at ADDR (cf. value_at).
1033 The type of the created value may differ from the passed type TYPE.
1034 Make sure to retrieve the returned values's new type after this call
1035 e.g. in case the type is a variable length array. */
1038 value_at_lazy (struct type
*type
, CORE_ADDR addr
)
1040 return get_value_at (type
, addr
, 1);
1044 read_value_memory (struct value
*val
, LONGEST bit_offset
,
1045 int stack
, CORE_ADDR memaddr
,
1046 gdb_byte
*buffer
, size_t length
)
1048 ULONGEST xfered_total
= 0;
1049 struct gdbarch
*arch
= get_value_arch (val
);
1050 int unit_size
= gdbarch_addressable_memory_unit_size (arch
);
1051 enum target_object object
;
1053 object
= stack
? TARGET_OBJECT_STACK_MEMORY
: TARGET_OBJECT_MEMORY
;
1055 while (xfered_total
< length
)
1057 enum target_xfer_status status
;
1058 ULONGEST xfered_partial
;
1060 status
= target_xfer_partial (current_inferior ()->top_target (),
1062 buffer
+ xfered_total
* unit_size
, NULL
,
1063 memaddr
+ xfered_total
,
1064 length
- xfered_total
,
1067 if (status
== TARGET_XFER_OK
)
1069 else if (status
== TARGET_XFER_UNAVAILABLE
)
1070 mark_value_bits_unavailable (val
, (xfered_total
* HOST_CHAR_BIT
1072 xfered_partial
* HOST_CHAR_BIT
);
1073 else if (status
== TARGET_XFER_EOF
)
1074 memory_error (TARGET_XFER_E_IO
, memaddr
+ xfered_total
);
1076 memory_error (status
, memaddr
+ xfered_total
);
1078 xfered_total
+= xfered_partial
;
1083 /* Store the contents of FROMVAL into the location of TOVAL.
1084 Return a new value with the location of TOVAL and contents of FROMVAL. */
1087 value_assign (struct value
*toval
, struct value
*fromval
)
1091 struct frame_id old_frame
;
1093 if (!deprecated_value_modifiable (toval
))
1094 error (_("Left operand of assignment is not a modifiable lvalue."));
1096 toval
= coerce_ref (toval
);
1098 type
= value_type (toval
);
1099 if (VALUE_LVAL (toval
) != lval_internalvar
)
1100 fromval
= value_cast (type
, fromval
);
1103 /* Coerce arrays and functions to pointers, except for arrays
1104 which only live in GDB's storage. */
1105 if (!value_must_coerce_to_target (fromval
))
1106 fromval
= coerce_array (fromval
);
1109 type
= check_typedef (type
);
1111 /* Since modifying a register can trash the frame chain, and
1112 modifying memory can trash the frame cache, we save the old frame
1113 and then restore the new frame afterwards. */
1114 old_frame
= get_frame_id (deprecated_safe_get_selected_frame ());
1116 switch (VALUE_LVAL (toval
))
1118 case lval_internalvar
:
1119 set_internalvar (VALUE_INTERNALVAR (toval
), fromval
);
1120 return value_of_internalvar (type
->arch (),
1121 VALUE_INTERNALVAR (toval
));
1123 case lval_internalvar_component
:
1125 LONGEST offset
= value_offset (toval
);
1127 /* Are we dealing with a bitfield?
1129 It is important to mention that `value_parent (toval)' is
1130 non-NULL iff `value_bitsize (toval)' is non-zero. */
1131 if (value_bitsize (toval
))
1133 /* VALUE_INTERNALVAR below refers to the parent value, while
1134 the offset is relative to this parent value. */
1135 gdb_assert (value_parent (value_parent (toval
)) == NULL
);
1136 offset
+= value_offset (value_parent (toval
));
1139 set_internalvar_component (VALUE_INTERNALVAR (toval
),
1141 value_bitpos (toval
),
1142 value_bitsize (toval
),
1149 const gdb_byte
*dest_buffer
;
1150 CORE_ADDR changed_addr
;
1152 gdb_byte buffer
[sizeof (LONGEST
)];
1154 if (value_bitsize (toval
))
1156 struct value
*parent
= value_parent (toval
);
1158 changed_addr
= value_address (parent
) + value_offset (toval
);
1159 changed_len
= (value_bitpos (toval
)
1160 + value_bitsize (toval
)
1161 + HOST_CHAR_BIT
- 1)
1164 /* If we can read-modify-write exactly the size of the
1165 containing type (e.g. short or int) then do so. This
1166 is safer for volatile bitfields mapped to hardware
1168 if (changed_len
< TYPE_LENGTH (type
)
1169 && TYPE_LENGTH (type
) <= (int) sizeof (LONGEST
)
1170 && ((LONGEST
) changed_addr
% TYPE_LENGTH (type
)) == 0)
1171 changed_len
= TYPE_LENGTH (type
);
1173 if (changed_len
> (int) sizeof (LONGEST
))
1174 error (_("Can't handle bitfields which "
1175 "don't fit in a %d bit word."),
1176 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
1178 read_memory (changed_addr
, buffer
, changed_len
);
1179 modify_field (type
, buffer
, value_as_long (fromval
),
1180 value_bitpos (toval
), value_bitsize (toval
));
1181 dest_buffer
= buffer
;
1185 changed_addr
= value_address (toval
);
1186 changed_len
= type_length_units (type
);
1187 dest_buffer
= value_contents (fromval
);
1190 write_memory_with_notification (changed_addr
, dest_buffer
, changed_len
);
1196 struct frame_info
*frame
;
1197 struct gdbarch
*gdbarch
;
1200 /* Figure out which frame this register value is in. The value
1201 holds the frame_id for the next frame, that is the frame this
1202 register value was unwound from.
1204 Below we will call put_frame_register_bytes which requires that
1205 we pass it the actual frame in which the register value is
1206 valid, i.e. not the next frame. */
1207 frame
= frame_find_by_id (VALUE_NEXT_FRAME_ID (toval
));
1208 frame
= get_prev_frame_always (frame
);
1210 value_reg
= VALUE_REGNUM (toval
);
1213 error (_("Value being assigned to is no longer active."));
1215 gdbarch
= get_frame_arch (frame
);
1217 if (value_bitsize (toval
))
1219 struct value
*parent
= value_parent (toval
);
1220 LONGEST offset
= value_offset (parent
) + value_offset (toval
);
1222 gdb_byte buffer
[sizeof (LONGEST
)];
1225 changed_len
= (value_bitpos (toval
)
1226 + value_bitsize (toval
)
1227 + HOST_CHAR_BIT
- 1)
1230 if (changed_len
> sizeof (LONGEST
))
1231 error (_("Can't handle bitfields which "
1232 "don't fit in a %d bit word."),
1233 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
1235 if (!get_frame_register_bytes (frame
, value_reg
, offset
,
1236 {buffer
, changed_len
},
1240 throw_error (OPTIMIZED_OUT_ERROR
,
1241 _("value has been optimized out"));
1243 throw_error (NOT_AVAILABLE_ERROR
,
1244 _("value is not available"));
1247 modify_field (type
, buffer
, value_as_long (fromval
),
1248 value_bitpos (toval
), value_bitsize (toval
));
1250 put_frame_register_bytes (frame
, value_reg
, offset
,
1251 {buffer
, changed_len
});
1255 if (gdbarch_convert_register_p (gdbarch
, VALUE_REGNUM (toval
),
1258 /* If TOVAL is a special machine register requiring
1259 conversion of program values to a special raw
1261 gdbarch_value_to_register (gdbarch
, frame
,
1262 VALUE_REGNUM (toval
), type
,
1263 value_contents (fromval
));
1267 gdb::array_view
<const gdb_byte
> contents
1268 = gdb::make_array_view (value_contents (fromval
),
1269 TYPE_LENGTH (type
));
1270 put_frame_register_bytes (frame
, value_reg
,
1271 value_offset (toval
),
1276 gdb::observers::register_changed
.notify (frame
, value_reg
);
1282 const struct lval_funcs
*funcs
= value_computed_funcs (toval
);
1284 if (funcs
->write
!= NULL
)
1286 funcs
->write (toval
, fromval
);
1293 error (_("Left operand of assignment is not an lvalue."));
1296 /* Assigning to the stack pointer, frame pointer, and other
1297 (architecture and calling convention specific) registers may
1298 cause the frame cache and regcache to be out of date. Assigning to memory
1299 also can. We just do this on all assignments to registers or
1300 memory, for simplicity's sake; I doubt the slowdown matters. */
1301 switch (VALUE_LVAL (toval
))
1307 gdb::observers::target_changed
.notify
1308 (current_inferior ()->top_target ());
1310 /* Having destroyed the frame cache, restore the selected
1313 /* FIXME: cagney/2002-11-02: There has to be a better way of
1314 doing this. Instead of constantly saving/restoring the
1315 frame. Why not create a get_selected_frame() function that,
1316 having saved the selected frame's ID can automatically
1317 re-find the previously selected frame automatically. */
1320 struct frame_info
*fi
= frame_find_by_id (old_frame
);
1331 /* If the field does not entirely fill a LONGEST, then zero the sign
1332 bits. If the field is signed, and is negative, then sign
1334 if ((value_bitsize (toval
) > 0)
1335 && (value_bitsize (toval
) < 8 * (int) sizeof (LONGEST
)))
1337 LONGEST fieldval
= value_as_long (fromval
);
1338 LONGEST valmask
= (((ULONGEST
) 1) << value_bitsize (toval
)) - 1;
1340 fieldval
&= valmask
;
1341 if (!type
->is_unsigned ()
1342 && (fieldval
& (valmask
^ (valmask
>> 1))))
1343 fieldval
|= ~valmask
;
1345 fromval
= value_from_longest (type
, fieldval
);
1348 /* The return value is a copy of TOVAL so it shares its location
1349 information, but its contents are updated from FROMVAL. This
1350 implies the returned value is not lazy, even if TOVAL was. */
1351 val
= value_copy (toval
);
1352 set_value_lazy (val
, 0);
1353 memcpy (value_contents_raw (val
), value_contents (fromval
),
1354 TYPE_LENGTH (type
));
1356 /* We copy over the enclosing type and pointed-to offset from FROMVAL
1357 in the case of pointer types. For object types, the enclosing type
1358 and embedded offset must *not* be copied: the target object refered
1359 to by TOVAL retains its original dynamic type after assignment. */
1360 if (type
->code () == TYPE_CODE_PTR
)
1362 set_value_enclosing_type (val
, value_enclosing_type (fromval
));
1363 set_value_pointed_to_offset (val
, value_pointed_to_offset (fromval
));
1369 /* Extend a value ARG1 to COUNT repetitions of its type. */
1372 value_repeat (struct value
*arg1
, int count
)
1376 if (VALUE_LVAL (arg1
) != lval_memory
)
1377 error (_("Only values in memory can be extended with '@'."));
1379 error (_("Invalid number %d of repetitions."), count
);
1381 val
= allocate_repeat_value (value_enclosing_type (arg1
), count
);
1383 VALUE_LVAL (val
) = lval_memory
;
1384 set_value_address (val
, value_address (arg1
));
1386 read_value_memory (val
, 0, value_stack (val
), value_address (val
),
1387 value_contents_all_raw (val
),
1388 type_length_units (value_enclosing_type (val
)));
1394 value_of_variable (struct symbol
*var
, const struct block
*b
)
1396 struct frame_info
*frame
= NULL
;
1398 if (symbol_read_needs_frame (var
))
1399 frame
= get_selected_frame (_("No frame selected."));
1401 return read_var_value (var
, b
, frame
);
1405 address_of_variable (struct symbol
*var
, const struct block
*b
)
1407 struct type
*type
= SYMBOL_TYPE (var
);
1410 /* Evaluate it first; if the result is a memory address, we're fine.
1411 Lazy evaluation pays off here. */
1413 val
= value_of_variable (var
, b
);
1414 type
= value_type (val
);
1416 if ((VALUE_LVAL (val
) == lval_memory
&& value_lazy (val
))
1417 || type
->code () == TYPE_CODE_FUNC
)
1419 CORE_ADDR addr
= value_address (val
);
1421 return value_from_pointer (lookup_pointer_type (type
), addr
);
1424 /* Not a memory address; check what the problem was. */
1425 switch (VALUE_LVAL (val
))
1429 struct frame_info
*frame
;
1430 const char *regname
;
1432 frame
= frame_find_by_id (VALUE_NEXT_FRAME_ID (val
));
1435 regname
= gdbarch_register_name (get_frame_arch (frame
),
1436 VALUE_REGNUM (val
));
1437 gdb_assert (regname
&& *regname
);
1439 error (_("Address requested for identifier "
1440 "\"%s\" which is in register $%s"),
1441 var
->print_name (), regname
);
1446 error (_("Can't take address of \"%s\" which isn't an lvalue."),
1447 var
->print_name ());
1457 value_must_coerce_to_target (struct value
*val
)
1459 struct type
*valtype
;
1461 /* The only lval kinds which do not live in target memory. */
1462 if (VALUE_LVAL (val
) != not_lval
1463 && VALUE_LVAL (val
) != lval_internalvar
1464 && VALUE_LVAL (val
) != lval_xcallable
)
1467 valtype
= check_typedef (value_type (val
));
1469 switch (valtype
->code ())
1471 case TYPE_CODE_ARRAY
:
1472 return valtype
->is_vector () ? 0 : 1;
1473 case TYPE_CODE_STRING
:
1480 /* Make sure that VAL lives in target memory if it's supposed to. For
1481 instance, strings are constructed as character arrays in GDB's
1482 storage, and this function copies them to the target. */
1485 value_coerce_to_target (struct value
*val
)
1490 if (!value_must_coerce_to_target (val
))
1493 length
= TYPE_LENGTH (check_typedef (value_type (val
)));
1494 addr
= allocate_space_in_inferior (length
);
1495 write_memory (addr
, value_contents (val
), length
);
1496 return value_at_lazy (value_type (val
), addr
);
1499 /* Given a value which is an array, return a value which is a pointer
1500 to its first element, regardless of whether or not the array has a
1501 nonzero lower bound.
1503 FIXME: A previous comment here indicated that this routine should
1504 be substracting the array's lower bound. It's not clear to me that
1505 this is correct. Given an array subscripting operation, it would
1506 certainly work to do the adjustment here, essentially computing:
1508 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
1510 However I believe a more appropriate and logical place to account
1511 for the lower bound is to do so in value_subscript, essentially
1514 (&array[0] + ((index - lowerbound) * sizeof array[0]))
1516 As further evidence consider what would happen with operations
1517 other than array subscripting, where the caller would get back a
1518 value that had an address somewhere before the actual first element
1519 of the array, and the information about the lower bound would be
1520 lost because of the coercion to pointer type. */
1523 value_coerce_array (struct value
*arg1
)
1525 struct type
*type
= check_typedef (value_type (arg1
));
1527 /* If the user tries to do something requiring a pointer with an
1528 array that has not yet been pushed to the target, then this would
1529 be a good time to do so. */
1530 arg1
= value_coerce_to_target (arg1
);
1532 if (VALUE_LVAL (arg1
) != lval_memory
)
1533 error (_("Attempt to take address of value not located in memory."));
1535 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
1536 value_address (arg1
));
1539 /* Given a value which is a function, return a value which is a pointer
1543 value_coerce_function (struct value
*arg1
)
1545 struct value
*retval
;
1547 if (VALUE_LVAL (arg1
) != lval_memory
)
1548 error (_("Attempt to take address of value not located in memory."));
1550 retval
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1551 value_address (arg1
));
1555 /* Return a pointer value for the object for which ARG1 is the
1559 value_addr (struct value
*arg1
)
1562 struct type
*type
= check_typedef (value_type (arg1
));
1564 if (TYPE_IS_REFERENCE (type
))
1566 if (value_bits_synthetic_pointer (arg1
, value_embedded_offset (arg1
),
1567 TARGET_CHAR_BIT
* TYPE_LENGTH (type
)))
1568 arg1
= coerce_ref (arg1
);
1571 /* Copy the value, but change the type from (T&) to (T*). We
1572 keep the same location information, which is efficient, and
1573 allows &(&X) to get the location containing the reference.
1574 Do the same to its enclosing type for consistency. */
1575 struct type
*type_ptr
1576 = lookup_pointer_type (TYPE_TARGET_TYPE (type
));
1577 struct type
*enclosing_type
1578 = check_typedef (value_enclosing_type (arg1
));
1579 struct type
*enclosing_type_ptr
1580 = lookup_pointer_type (TYPE_TARGET_TYPE (enclosing_type
));
1582 arg2
= value_copy (arg1
);
1583 deprecated_set_value_type (arg2
, type_ptr
);
1584 set_value_enclosing_type (arg2
, enclosing_type_ptr
);
1589 if (type
->code () == TYPE_CODE_FUNC
)
1590 return value_coerce_function (arg1
);
1592 /* If this is an array that has not yet been pushed to the target,
1593 then this would be a good time to force it to memory. */
1594 arg1
= value_coerce_to_target (arg1
);
1596 if (VALUE_LVAL (arg1
) != lval_memory
)
1597 error (_("Attempt to take address of value not located in memory."));
1599 /* Get target memory address. */
1600 arg2
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1601 (value_address (arg1
)
1602 + value_embedded_offset (arg1
)));
1604 /* This may be a pointer to a base subobject; so remember the
1605 full derived object's type ... */
1606 set_value_enclosing_type (arg2
,
1607 lookup_pointer_type (value_enclosing_type (arg1
)));
1608 /* ... and also the relative position of the subobject in the full
1610 set_value_pointed_to_offset (arg2
, value_embedded_offset (arg1
));
1614 /* Return a reference value for the object for which ARG1 is the
1618 value_ref (struct value
*arg1
, enum type_code refcode
)
1621 struct type
*type
= check_typedef (value_type (arg1
));
1623 gdb_assert (refcode
== TYPE_CODE_REF
|| refcode
== TYPE_CODE_RVALUE_REF
);
1625 if ((type
->code () == TYPE_CODE_REF
1626 || type
->code () == TYPE_CODE_RVALUE_REF
)
1627 && type
->code () == refcode
)
1630 arg2
= value_addr (arg1
);
1631 deprecated_set_value_type (arg2
, lookup_reference_type (type
, refcode
));
1635 /* Given a value of a pointer type, apply the C unary * operator to
1639 value_ind (struct value
*arg1
)
1641 struct type
*base_type
;
1644 arg1
= coerce_array (arg1
);
1646 base_type
= check_typedef (value_type (arg1
));
1648 if (VALUE_LVAL (arg1
) == lval_computed
)
1650 const struct lval_funcs
*funcs
= value_computed_funcs (arg1
);
1652 if (funcs
->indirect
)
1654 struct value
*result
= funcs
->indirect (arg1
);
1661 if (base_type
->code () == TYPE_CODE_PTR
)
1663 struct type
*enc_type
;
1665 /* We may be pointing to something embedded in a larger object.
1666 Get the real type of the enclosing object. */
1667 enc_type
= check_typedef (value_enclosing_type (arg1
));
1668 enc_type
= TYPE_TARGET_TYPE (enc_type
);
1670 CORE_ADDR base_addr
;
1671 if (check_typedef (enc_type
)->code () == TYPE_CODE_FUNC
1672 || check_typedef (enc_type
)->code () == TYPE_CODE_METHOD
)
1674 /* For functions, go through find_function_addr, which knows
1675 how to handle function descriptors. */
1676 base_addr
= find_function_addr (arg1
, NULL
);
1680 /* Retrieve the enclosing object pointed to. */
1681 base_addr
= (value_as_address (arg1
)
1682 - value_pointed_to_offset (arg1
));
1684 arg2
= value_at_lazy (enc_type
, base_addr
);
1685 enc_type
= value_type (arg2
);
1686 return readjust_indirect_value_type (arg2
, enc_type
, base_type
,
1690 error (_("Attempt to take contents of a non-pointer value."));
1693 /* Create a value for an array by allocating space in GDB, copying the
1694 data into that space, and then setting up an array value.
1696 The array bounds are set from LOWBOUND and HIGHBOUND, and the array
1697 is populated from the values passed in ELEMVEC.
1699 The element type of the array is inherited from the type of the
1700 first element, and all elements must have the same size (though we
1701 don't currently enforce any restriction on their types). */
1704 value_array (int lowbound
, int highbound
, struct value
**elemvec
)
1708 ULONGEST typelength
;
1710 struct type
*arraytype
;
1712 /* Validate that the bounds are reasonable and that each of the
1713 elements have the same size. */
1715 nelem
= highbound
- lowbound
+ 1;
1718 error (_("bad array bounds (%d, %d)"), lowbound
, highbound
);
1720 typelength
= type_length_units (value_enclosing_type (elemvec
[0]));
1721 for (idx
= 1; idx
< nelem
; idx
++)
1723 if (type_length_units (value_enclosing_type (elemvec
[idx
]))
1726 error (_("array elements must all be the same size"));
1730 arraytype
= lookup_array_range_type (value_enclosing_type (elemvec
[0]),
1731 lowbound
, highbound
);
1733 if (!current_language
->c_style_arrays_p ())
1735 val
= allocate_value (arraytype
);
1736 for (idx
= 0; idx
< nelem
; idx
++)
1737 value_contents_copy (val
, idx
* typelength
, elemvec
[idx
], 0,
1742 /* Allocate space to store the array, and then initialize it by
1743 copying in each element. */
1745 val
= allocate_value (arraytype
);
1746 for (idx
= 0; idx
< nelem
; idx
++)
1747 value_contents_copy (val
, idx
* typelength
, elemvec
[idx
], 0, typelength
);
1752 value_cstring (const char *ptr
, ssize_t len
, struct type
*char_type
)
1755 int lowbound
= current_language
->string_lower_bound ();
1756 ssize_t highbound
= len
/ TYPE_LENGTH (char_type
);
1757 struct type
*stringtype
1758 = lookup_array_range_type (char_type
, lowbound
, highbound
+ lowbound
- 1);
1760 val
= allocate_value (stringtype
);
1761 memcpy (value_contents_raw (val
), ptr
, len
);
1765 /* Create a value for a string constant by allocating space in the
1766 inferior, copying the data into that space, and returning the
1767 address with type TYPE_CODE_STRING. PTR points to the string
1768 constant data; LEN is number of characters.
1770 Note that string types are like array of char types with a lower
1771 bound of zero and an upper bound of LEN - 1. Also note that the
1772 string may contain embedded null bytes. */
1775 value_string (const char *ptr
, ssize_t len
, struct type
*char_type
)
1778 int lowbound
= current_language
->string_lower_bound ();
1779 ssize_t highbound
= len
/ TYPE_LENGTH (char_type
);
1780 struct type
*stringtype
1781 = lookup_string_range_type (char_type
, lowbound
, highbound
+ lowbound
- 1);
1783 val
= allocate_value (stringtype
);
1784 memcpy (value_contents_raw (val
), ptr
, len
);
1789 /* See if we can pass arguments in T2 to a function which takes arguments
1790 of types T1. T1 is a list of NARGS arguments, and T2 is an array_view
1791 of the values we're trying to pass. If some arguments need coercion of
1792 some sort, then the coerced values are written into T2. Return value is
1793 0 if the arguments could be matched, or the position at which they
1796 STATICP is nonzero if the T1 argument list came from a static
1797 member function. T2 must still include the ``this'' pointer, but
1800 For non-static member functions, we ignore the first argument,
1801 which is the type of the instance variable. This is because we
1802 want to handle calls with objects from derived classes. This is
1803 not entirely correct: we should actually check to make sure that a
1804 requested operation is type secure, shouldn't we? FIXME. */
1807 typecmp (bool staticp
, bool varargs
, int nargs
,
1808 struct field t1
[], gdb::array_view
<value
*> t2
)
1812 /* Skip ``this'' argument if applicable. T2 will always include
1818 (i
< nargs
) && t1
[i
].type ()->code () != TYPE_CODE_VOID
;
1821 struct type
*tt1
, *tt2
;
1823 if (i
== t2
.size ())
1826 tt1
= check_typedef (t1
[i
].type ());
1827 tt2
= check_typedef (value_type (t2
[i
]));
1829 if (TYPE_IS_REFERENCE (tt1
)
1830 /* We should be doing hairy argument matching, as below. */
1831 && (check_typedef (TYPE_TARGET_TYPE (tt1
))->code ()
1834 if (tt2
->code () == TYPE_CODE_ARRAY
)
1835 t2
[i
] = value_coerce_array (t2
[i
]);
1837 t2
[i
] = value_ref (t2
[i
], tt1
->code ());
1841 /* djb - 20000715 - Until the new type structure is in the
1842 place, and we can attempt things like implicit conversions,
1843 we need to do this so you can take something like a map<const
1844 char *>, and properly access map["hello"], because the
1845 argument to [] will be a reference to a pointer to a char,
1846 and the argument will be a pointer to a char. */
1847 while (TYPE_IS_REFERENCE (tt1
) || tt1
->code () == TYPE_CODE_PTR
)
1849 tt1
= check_typedef ( TYPE_TARGET_TYPE (tt1
) );
1851 while (tt2
->code () == TYPE_CODE_ARRAY
1852 || tt2
->code () == TYPE_CODE_PTR
1853 || TYPE_IS_REFERENCE (tt2
))
1855 tt2
= check_typedef (TYPE_TARGET_TYPE (tt2
));
1857 if (tt1
->code () == tt2
->code ())
1859 /* Array to pointer is a `trivial conversion' according to the
1862 /* We should be doing much hairier argument matching (see
1863 section 13.2 of the ARM), but as a quick kludge, just check
1864 for the same type code. */
1865 if (t1
[i
].type ()->code () != value_type (t2
[i
])->code ())
1868 if (varargs
|| i
== t2
.size ())
1873 /* Helper class for search_struct_field that keeps track of found
1874 results and possibly throws an exception if the search yields
1875 ambiguous results. See search_struct_field for description of
1876 LOOKING_FOR_BASECLASS. */
1878 struct struct_field_searcher
1880 /* A found field. */
1883 /* Path to the structure where the field was found. */
1884 std::vector
<struct type
*> path
;
1886 /* The field found. */
1887 struct value
*field_value
;
1890 /* See corresponding fields for description of parameters. */
1891 struct_field_searcher (const char *name
,
1892 struct type
*outermost_type
,
1893 bool looking_for_baseclass
)
1895 m_looking_for_baseclass (looking_for_baseclass
),
1896 m_outermost_type (outermost_type
)
1900 /* The search entry point. If LOOKING_FOR_BASECLASS is true and the
1901 base class search yields ambiguous results, this throws an
1902 exception. If LOOKING_FOR_BASECLASS is false, the found fields
1903 are accumulated and the caller (search_struct_field) takes care
1904 of throwing an error if the field search yields ambiguous
1905 results. The latter is done that way so that the error message
1906 can include a list of all the found candidates. */
1907 void search (struct value
*arg
, LONGEST offset
, struct type
*type
);
1909 const std::vector
<found_field
> &fields ()
1914 struct value
*baseclass ()
1920 /* Update results to include V, a found field/baseclass. */
1921 void update_result (struct value
*v
, LONGEST boffset
);
1923 /* The name of the field/baseclass we're searching for. */
1926 /* Whether we're looking for a baseclass, or a field. */
1927 const bool m_looking_for_baseclass
;
1929 /* The offset of the baseclass containing the field/baseclass we
1931 LONGEST m_last_boffset
= 0;
1933 /* If looking for a baseclass, then the result is stored here. */
1934 struct value
*m_baseclass
= nullptr;
1936 /* When looking for fields, the found candidates are stored
1938 std::vector
<found_field
> m_fields
;
1940 /* The type of the initial type passed to search_struct_field; this
1941 is used for error reporting when the lookup is ambiguous. */
1942 struct type
*m_outermost_type
;
1944 /* The full path to the struct being inspected. E.g. for field 'x'
1945 defined in class B inherited by class A, we have A and B pushed
1947 std::vector
<struct type
*> m_struct_path
;
1951 struct_field_searcher::update_result (struct value
*v
, LONGEST boffset
)
1955 if (m_looking_for_baseclass
)
1957 if (m_baseclass
!= nullptr
1958 /* The result is not ambiguous if all the classes that are
1959 found occupy the same space. */
1960 && m_last_boffset
!= boffset
)
1961 error (_("base class '%s' is ambiguous in type '%s'"),
1962 m_name
, TYPE_SAFE_NAME (m_outermost_type
));
1965 m_last_boffset
= boffset
;
1969 /* The field is not ambiguous if it occupies the same
1971 if (m_fields
.empty () || m_last_boffset
!= boffset
)
1972 m_fields
.push_back ({m_struct_path
, v
});
1977 /* A helper for search_struct_field. This does all the work; most
1978 arguments are as passed to search_struct_field. */
1981 struct_field_searcher::search (struct value
*arg1
, LONGEST offset
,
1987 m_struct_path
.push_back (type
);
1988 SCOPE_EXIT
{ m_struct_path
.pop_back (); };
1990 type
= check_typedef (type
);
1991 nbases
= TYPE_N_BASECLASSES (type
);
1993 if (!m_looking_for_baseclass
)
1994 for (i
= type
->num_fields () - 1; i
>= nbases
; i
--)
1996 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
1998 if (t_field_name
&& (strcmp_iw (t_field_name
, m_name
) == 0))
2002 if (field_is_static (&type
->field (i
)))
2003 v
= value_static_field (type
, i
);
2005 v
= value_primitive_field (arg1
, offset
, i
, type
);
2007 update_result (v
, offset
);
2012 && t_field_name
[0] == '\0')
2014 struct type
*field_type
= type
->field (i
).type ();
2016 if (field_type
->code () == TYPE_CODE_UNION
2017 || field_type
->code () == TYPE_CODE_STRUCT
)
2019 /* Look for a match through the fields of an anonymous
2020 union, or anonymous struct. C++ provides anonymous
2023 In the GNU Chill (now deleted from GDB)
2024 implementation of variant record types, each
2025 <alternative field> has an (anonymous) union type,
2026 each member of the union represents a <variant
2027 alternative>. Each <variant alternative> is
2028 represented as a struct, with a member for each
2031 LONGEST new_offset
= offset
;
2033 /* This is pretty gross. In G++, the offset in an
2034 anonymous union is relative to the beginning of the
2035 enclosing struct. In the GNU Chill (now deleted
2036 from GDB) implementation of variant records, the
2037 bitpos is zero in an anonymous union field, so we
2038 have to add the offset of the union here. */
2039 if (field_type
->code () == TYPE_CODE_STRUCT
2040 || (field_type
->num_fields () > 0
2041 && TYPE_FIELD_BITPOS (field_type
, 0) == 0))
2042 new_offset
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
2044 search (arg1
, new_offset
, field_type
);
2049 for (i
= 0; i
< nbases
; i
++)
2051 struct value
*v
= NULL
;
2052 struct type
*basetype
= check_typedef (TYPE_BASECLASS (type
, i
));
2053 /* If we are looking for baseclasses, this is what we get when
2054 we hit them. But it could happen that the base part's member
2055 name is not yet filled in. */
2056 int found_baseclass
= (m_looking_for_baseclass
2057 && TYPE_BASECLASS_NAME (type
, i
) != NULL
2058 && (strcmp_iw (m_name
,
2059 TYPE_BASECLASS_NAME (type
,
2061 LONGEST boffset
= value_embedded_offset (arg1
) + offset
;
2063 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2067 boffset
= baseclass_offset (type
, i
,
2068 value_contents_for_printing (arg1
),
2069 value_embedded_offset (arg1
) + offset
,
2070 value_address (arg1
),
2073 /* The virtual base class pointer might have been clobbered
2074 by the user program. Make sure that it still points to a
2075 valid memory location. */
2077 boffset
+= value_embedded_offset (arg1
) + offset
;
2079 || boffset
>= TYPE_LENGTH (value_enclosing_type (arg1
)))
2081 CORE_ADDR base_addr
;
2083 base_addr
= value_address (arg1
) + boffset
;
2084 v2
= value_at_lazy (basetype
, base_addr
);
2085 if (target_read_memory (base_addr
,
2086 value_contents_raw (v2
),
2087 TYPE_LENGTH (value_type (v2
))) != 0)
2088 error (_("virtual baseclass botch"));
2092 v2
= value_copy (arg1
);
2093 deprecated_set_value_type (v2
, basetype
);
2094 set_value_embedded_offset (v2
, boffset
);
2097 if (found_baseclass
)
2100 search (v2
, 0, TYPE_BASECLASS (type
, i
));
2102 else if (found_baseclass
)
2103 v
= value_primitive_field (arg1
, offset
, i
, type
);
2106 search (arg1
, offset
+ TYPE_BASECLASS_BITPOS (type
, i
) / 8,
2110 update_result (v
, boffset
);
2114 /* Helper function used by value_struct_elt to recurse through
2115 baseclasses. Look for a field NAME in ARG1. Search in it assuming
2116 it has (class) type TYPE. If found, return value, else return NULL.
2118 If LOOKING_FOR_BASECLASS, then instead of looking for struct
2119 fields, look for a baseclass named NAME. */
2121 static struct value
*
2122 search_struct_field (const char *name
, struct value
*arg1
,
2123 struct type
*type
, int looking_for_baseclass
)
2125 struct_field_searcher
searcher (name
, type
, looking_for_baseclass
);
2127 searcher
.search (arg1
, 0, type
);
2129 if (!looking_for_baseclass
)
2131 const auto &fields
= searcher
.fields ();
2133 if (fields
.empty ())
2135 else if (fields
.size () == 1)
2136 return fields
[0].field_value
;
2139 std::string candidates
;
2141 for (auto &&candidate
: fields
)
2143 gdb_assert (!candidate
.path
.empty ());
2145 struct type
*field_type
= value_type (candidate
.field_value
);
2146 struct type
*struct_type
= candidate
.path
.back ();
2150 for (struct type
*t
: candidate
.path
)
2159 candidates
+= string_printf ("\n '%s %s::%s' (%s)",
2160 TYPE_SAFE_NAME (field_type
),
2161 TYPE_SAFE_NAME (struct_type
),
2166 error (_("Request for member '%s' is ambiguous in type '%s'."
2167 " Candidates are:%s"),
2168 name
, TYPE_SAFE_NAME (type
),
2169 candidates
.c_str ());
2173 return searcher
.baseclass ();
2176 /* Helper function used by value_struct_elt to recurse through
2177 baseclasses. Look for a field NAME in ARG1. Adjust the address of
2178 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
2181 ARGS is an optional array of argument values used to help finding NAME.
2182 The contents of ARGS can be adjusted if type coercion is required in
2183 order to find a matching NAME.
2185 If found, return value, else if name matched and args not return
2186 (value) -1, else return NULL. */
2188 static struct value
*
2189 search_struct_method (const char *name
, struct value
**arg1p
,
2190 gdb::optional
<gdb::array_view
<value
*>> args
,
2191 LONGEST offset
, int *static_memfuncp
,
2196 int name_matched
= 0;
2198 type
= check_typedef (type
);
2199 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
2201 const char *t_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
2203 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
2205 int j
= TYPE_FN_FIELDLIST_LENGTH (type
, i
) - 1;
2206 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
2209 check_stub_method_group (type
, i
);
2210 if (j
> 0 && !args
.has_value ())
2211 error (_("cannot resolve overloaded method "
2212 "`%s': no arguments supplied"), name
);
2213 else if (j
== 0 && !args
.has_value ())
2215 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
2222 gdb_assert (args
.has_value ());
2223 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f
, j
),
2224 TYPE_FN_FIELD_TYPE (f
, j
)->has_varargs (),
2225 TYPE_FN_FIELD_TYPE (f
, j
)->num_fields (),
2226 TYPE_FN_FIELD_ARGS (f
, j
), *args
))
2228 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
2229 return value_virtual_fn_field (arg1p
, f
, j
,
2231 if (TYPE_FN_FIELD_STATIC_P (f
, j
)
2233 *static_memfuncp
= 1;
2234 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
2243 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2245 LONGEST base_offset
;
2246 LONGEST this_offset
;
2248 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2250 struct type
*baseclass
= check_typedef (TYPE_BASECLASS (type
, i
));
2251 struct value
*base_val
;
2252 const gdb_byte
*base_valaddr
;
2254 /* The virtual base class pointer might have been
2255 clobbered by the user program. Make sure that it
2256 still points to a valid memory location. */
2258 if (offset
< 0 || offset
>= TYPE_LENGTH (type
))
2262 gdb::byte_vector
tmp (TYPE_LENGTH (baseclass
));
2263 address
= value_address (*arg1p
);
2265 if (target_read_memory (address
+ offset
,
2266 tmp
.data (), TYPE_LENGTH (baseclass
)) != 0)
2267 error (_("virtual baseclass botch"));
2269 base_val
= value_from_contents_and_address (baseclass
,
2272 base_valaddr
= value_contents_for_printing (base_val
);
2278 base_valaddr
= value_contents_for_printing (*arg1p
);
2279 this_offset
= offset
;
2282 base_offset
= baseclass_offset (type
, i
, base_valaddr
,
2283 this_offset
, value_address (base_val
),
2288 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2290 v
= search_struct_method (name
, arg1p
, args
, base_offset
+ offset
,
2291 static_memfuncp
, TYPE_BASECLASS (type
, i
));
2292 if (v
== (struct value
*) - 1)
2298 /* FIXME-bothner: Why is this commented out? Why is it here? */
2299 /* *arg1p = arg1_tmp; */
2304 return (struct value
*) - 1;
2309 /* Given *ARGP, a value of type (pointer to a)* structure/union,
2310 extract the component named NAME from the ultimate target
2311 structure/union and return it as a value with its appropriate type.
2312 ERR is used in the error message if *ARGP's type is wrong.
2314 C++: ARGS is a list of argument types to aid in the selection of
2315 an appropriate method. Also, handle derived types.
2317 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
2318 where the truthvalue of whether the function that was resolved was
2319 a static member function or not is stored.
2321 ERR is an error message to be printed in case the field is not
2325 value_struct_elt (struct value
**argp
,
2326 gdb::optional
<gdb::array_view
<value
*>> args
,
2327 const char *name
, int *static_memfuncp
, const char *err
)
2332 *argp
= coerce_array (*argp
);
2334 t
= check_typedef (value_type (*argp
));
2336 /* Follow pointers until we get to a non-pointer. */
2338 while (t
->code () == TYPE_CODE_PTR
|| TYPE_IS_REFERENCE (t
))
2340 *argp
= value_ind (*argp
);
2341 /* Don't coerce fn pointer to fn and then back again! */
2342 if (check_typedef (value_type (*argp
))->code () != TYPE_CODE_FUNC
)
2343 *argp
= coerce_array (*argp
);
2344 t
= check_typedef (value_type (*argp
));
2347 if (t
->code () != TYPE_CODE_STRUCT
2348 && t
->code () != TYPE_CODE_UNION
)
2349 error (_("Attempt to extract a component of a value that is not a %s."),
2352 /* Assume it's not, unless we see that it is. */
2353 if (static_memfuncp
)
2354 *static_memfuncp
= 0;
2356 if (!args
.has_value ())
2358 /* if there are no arguments ...do this... */
2360 /* Try as a field first, because if we succeed, there is less
2362 v
= search_struct_field (name
, *argp
, t
, 0);
2366 /* C++: If it was not found as a data field, then try to
2367 return it as a pointer to a method. */
2368 v
= search_struct_method (name
, argp
, args
, 0,
2369 static_memfuncp
, t
);
2371 if (v
== (struct value
*) - 1)
2372 error (_("Cannot take address of method %s."), name
);
2375 if (TYPE_NFN_FIELDS (t
))
2376 error (_("There is no member or method named %s."), name
);
2378 error (_("There is no member named %s."), name
);
2383 v
= search_struct_method (name
, argp
, args
, 0,
2384 static_memfuncp
, t
);
2386 if (v
== (struct value
*) - 1)
2388 error (_("One of the arguments you tried to pass to %s could not "
2389 "be converted to what the function wants."), name
);
2393 /* See if user tried to invoke data as function. If so, hand it
2394 back. If it's not callable (i.e., a pointer to function),
2395 gdb should give an error. */
2396 v
= search_struct_field (name
, *argp
, t
, 0);
2397 /* If we found an ordinary field, then it is not a method call.
2398 So, treat it as if it were a static member function. */
2399 if (v
&& static_memfuncp
)
2400 *static_memfuncp
= 1;
2404 throw_error (NOT_FOUND_ERROR
,
2405 _("Structure has no component named %s."), name
);
2409 /* Given *ARGP, a value of type structure or union, or a pointer/reference
2410 to a structure or union, extract and return its component (field) of
2411 type FTYPE at the specified BITPOS.
2412 Throw an exception on error. */
2415 value_struct_elt_bitpos (struct value
**argp
, int bitpos
, struct type
*ftype
,
2421 *argp
= coerce_array (*argp
);
2423 t
= check_typedef (value_type (*argp
));
2425 while (t
->code () == TYPE_CODE_PTR
|| TYPE_IS_REFERENCE (t
))
2427 *argp
= value_ind (*argp
);
2428 if (check_typedef (value_type (*argp
))->code () != TYPE_CODE_FUNC
)
2429 *argp
= coerce_array (*argp
);
2430 t
= check_typedef (value_type (*argp
));
2433 if (t
->code () != TYPE_CODE_STRUCT
2434 && t
->code () != TYPE_CODE_UNION
)
2435 error (_("Attempt to extract a component of a value that is not a %s."),
2438 for (i
= TYPE_N_BASECLASSES (t
); i
< t
->num_fields (); i
++)
2440 if (!field_is_static (&t
->field (i
))
2441 && bitpos
== TYPE_FIELD_BITPOS (t
, i
)
2442 && types_equal (ftype
, t
->field (i
).type ()))
2443 return value_primitive_field (*argp
, 0, i
, t
);
2446 error (_("No field with matching bitpos and type."));
2452 /* Search through the methods of an object (and its bases) to find a
2453 specified method. Return a reference to the fn_field list METHODS of
2454 overloaded instances defined in the source language. If available
2455 and matching, a vector of matching xmethods defined in extension
2456 languages are also returned in XMETHODS.
2458 Helper function for value_find_oload_list.
2459 ARGP is a pointer to a pointer to a value (the object).
2460 METHOD is a string containing the method name.
2461 OFFSET is the offset within the value.
2462 TYPE is the assumed type of the object.
2463 METHODS is a pointer to the matching overloaded instances defined
2464 in the source language. Since this is a recursive function,
2465 *METHODS should be set to NULL when calling this function.
2466 NUM_FNS is the number of overloaded instances. *NUM_FNS should be set to
2467 0 when calling this function.
2468 XMETHODS is the vector of matching xmethod workers. *XMETHODS
2469 should also be set to NULL when calling this function.
2470 BASETYPE is set to the actual type of the subobject where the
2472 BOFFSET is the offset of the base subobject where the method is found. */
2475 find_method_list (struct value
**argp
, const char *method
,
2476 LONGEST offset
, struct type
*type
,
2477 gdb::array_view
<fn_field
> *methods
,
2478 std::vector
<xmethod_worker_up
> *xmethods
,
2479 struct type
**basetype
, LONGEST
*boffset
)
2482 struct fn_field
*f
= NULL
;
2484 gdb_assert (methods
!= NULL
&& xmethods
!= NULL
);
2485 type
= check_typedef (type
);
2487 /* First check in object itself.
2488 This function is called recursively to search through base classes.
2489 If there is a source method match found at some stage, then we need not
2490 look for source methods in consequent recursive calls. */
2491 if (methods
->empty ())
2493 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
2495 /* pai: FIXME What about operators and type conversions? */
2496 const char *fn_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
2498 if (fn_field_name
&& (strcmp_iw (fn_field_name
, method
) == 0))
2500 int len
= TYPE_FN_FIELDLIST_LENGTH (type
, i
);
2501 f
= TYPE_FN_FIELDLIST1 (type
, i
);
2502 *methods
= gdb::make_array_view (f
, len
);
2507 /* Resolve any stub methods. */
2508 check_stub_method_group (type
, i
);
2515 /* Unlike source methods, xmethods can be accumulated over successive
2516 recursive calls. In other words, an xmethod named 'm' in a class
2517 will not hide an xmethod named 'm' in its base class(es). We want
2518 it to be this way because xmethods are after all convenience functions
2519 and hence there is no point restricting them with something like method
2520 hiding. Moreover, if hiding is done for xmethods as well, then we will
2521 have to provide a mechanism to un-hide (like the 'using' construct). */
2522 get_matching_xmethod_workers (type
, method
, xmethods
);
2524 /* If source methods are not found in current class, look for them in the
2525 base classes. We also have to go through the base classes to gather
2526 extension methods. */
2527 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2529 LONGEST base_offset
;
2531 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2533 base_offset
= baseclass_offset (type
, i
,
2534 value_contents_for_printing (*argp
),
2535 value_offset (*argp
) + offset
,
2536 value_address (*argp
), *argp
);
2538 else /* Non-virtual base, simply use bit position from debug
2541 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2544 find_method_list (argp
, method
, base_offset
+ offset
,
2545 TYPE_BASECLASS (type
, i
), methods
,
2546 xmethods
, basetype
, boffset
);
2550 /* Return the list of overloaded methods of a specified name. The methods
2551 could be those GDB finds in the binary, or xmethod. Methods found in
2552 the binary are returned in METHODS, and xmethods are returned in
2555 ARGP is a pointer to a pointer to a value (the object).
2556 METHOD is the method name.
2557 OFFSET is the offset within the value contents.
2558 METHODS is the list of matching overloaded instances defined in
2559 the source language.
2560 XMETHODS is the vector of matching xmethod workers defined in
2561 extension languages.
2562 BASETYPE is set to the type of the base subobject that defines the
2564 BOFFSET is the offset of the base subobject which defines the method. */
2567 value_find_oload_method_list (struct value
**argp
, const char *method
,
2569 gdb::array_view
<fn_field
> *methods
,
2570 std::vector
<xmethod_worker_up
> *xmethods
,
2571 struct type
**basetype
, LONGEST
*boffset
)
2575 t
= check_typedef (value_type (*argp
));
2577 /* Code snarfed from value_struct_elt. */
2578 while (t
->code () == TYPE_CODE_PTR
|| TYPE_IS_REFERENCE (t
))
2580 *argp
= value_ind (*argp
);
2581 /* Don't coerce fn pointer to fn and then back again! */
2582 if (check_typedef (value_type (*argp
))->code () != TYPE_CODE_FUNC
)
2583 *argp
= coerce_array (*argp
);
2584 t
= check_typedef (value_type (*argp
));
2587 if (t
->code () != TYPE_CODE_STRUCT
2588 && t
->code () != TYPE_CODE_UNION
)
2589 error (_("Attempt to extract a component of a "
2590 "value that is not a struct or union"));
2592 gdb_assert (methods
!= NULL
&& xmethods
!= NULL
);
2594 /* Clear the lists. */
2598 find_method_list (argp
, method
, 0, t
, methods
, xmethods
,
2602 /* Given an array of arguments (ARGS) (which includes an entry for
2603 "this" in the case of C++ methods), the NAME of a function, and
2604 whether it's a method or not (METHOD), find the best function that
2605 matches on the argument types according to the overload resolution
2608 METHOD can be one of three values:
2609 NON_METHOD for non-member functions.
2610 METHOD: for member functions.
2611 BOTH: used for overload resolution of operators where the
2612 candidates are expected to be either member or non member
2613 functions. In this case the first argument ARGTYPES
2614 (representing 'this') is expected to be a reference to the
2615 target object, and will be dereferenced when attempting the
2618 In the case of class methods, the parameter OBJ is an object value
2619 in which to search for overloaded methods.
2621 In the case of non-method functions, the parameter FSYM is a symbol
2622 corresponding to one of the overloaded functions.
2624 Return value is an integer: 0 -> good match, 10 -> debugger applied
2625 non-standard coercions, 100 -> incompatible.
2627 If a method is being searched for, VALP will hold the value.
2628 If a non-method is being searched for, SYMP will hold the symbol
2631 If a method is being searched for, and it is a static method,
2632 then STATICP will point to a non-zero value.
2634 If NO_ADL argument dependent lookup is disabled. This is used to prevent
2635 ADL overload candidates when performing overload resolution for a fully
2638 If NOSIDE is EVAL_AVOID_SIDE_EFFECTS, then OBJP's memory cannot be
2639 read while picking the best overload match (it may be all zeroes and thus
2640 not have a vtable pointer), in which case skip virtual function lookup.
2641 This is ok as typically EVAL_AVOID_SIDE_EFFECTS is only used to determine
2644 Note: This function does *not* check the value of
2645 overload_resolution. Caller must check it to see whether overload
2646 resolution is permitted. */
2649 find_overload_match (gdb::array_view
<value
*> args
,
2650 const char *name
, enum oload_search_type method
,
2651 struct value
**objp
, struct symbol
*fsym
,
2652 struct value
**valp
, struct symbol
**symp
,
2653 int *staticp
, const int no_adl
,
2654 const enum noside noside
)
2656 struct value
*obj
= (objp
? *objp
: NULL
);
2657 struct type
*obj_type
= obj
? value_type (obj
) : NULL
;
2658 /* Index of best overloaded function. */
2659 int func_oload_champ
= -1;
2660 int method_oload_champ
= -1;
2661 int src_method_oload_champ
= -1;
2662 int ext_method_oload_champ
= -1;
2664 /* The measure for the current best match. */
2665 badness_vector method_badness
;
2666 badness_vector func_badness
;
2667 badness_vector ext_method_badness
;
2668 badness_vector src_method_badness
;
2670 struct value
*temp
= obj
;
2671 /* For methods, the list of overloaded methods. */
2672 gdb::array_view
<fn_field
> methods
;
2673 /* For non-methods, the list of overloaded function symbols. */
2674 std::vector
<symbol
*> functions
;
2675 /* For xmethods, the vector of xmethod workers. */
2676 std::vector
<xmethod_worker_up
> xmethods
;
2677 struct type
*basetype
= NULL
;
2680 const char *obj_type_name
= NULL
;
2681 const char *func_name
= NULL
;
2682 gdb::unique_xmalloc_ptr
<char> temp_func
;
2683 enum oload_classification match_quality
;
2684 enum oload_classification method_match_quality
= INCOMPATIBLE
;
2685 enum oload_classification src_method_match_quality
= INCOMPATIBLE
;
2686 enum oload_classification ext_method_match_quality
= INCOMPATIBLE
;
2687 enum oload_classification func_match_quality
= INCOMPATIBLE
;
2689 /* Get the list of overloaded methods or functions. */
2690 if (method
== METHOD
|| method
== BOTH
)
2694 /* OBJ may be a pointer value rather than the object itself. */
2695 obj
= coerce_ref (obj
);
2696 while (check_typedef (value_type (obj
))->code () == TYPE_CODE_PTR
)
2697 obj
= coerce_ref (value_ind (obj
));
2698 obj_type_name
= value_type (obj
)->name ();
2700 /* First check whether this is a data member, e.g. a pointer to
2702 if (check_typedef (value_type (obj
))->code () == TYPE_CODE_STRUCT
)
2704 *valp
= search_struct_field (name
, obj
,
2705 check_typedef (value_type (obj
)), 0);
2713 /* Retrieve the list of methods with the name NAME. */
2714 value_find_oload_method_list (&temp
, name
, 0, &methods
,
2715 &xmethods
, &basetype
, &boffset
);
2716 /* If this is a method only search, and no methods were found
2717 the search has failed. */
2718 if (method
== METHOD
&& methods
.empty () && xmethods
.empty ())
2719 error (_("Couldn't find method %s%s%s"),
2721 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2723 /* If we are dealing with stub method types, they should have
2724 been resolved by find_method_list via
2725 value_find_oload_method_list above. */
2726 if (!methods
.empty ())
2728 gdb_assert (TYPE_SELF_TYPE (methods
[0].type
) != NULL
);
2730 src_method_oload_champ
2731 = find_oload_champ (args
,
2733 methods
.data (), NULL
, NULL
,
2734 &src_method_badness
);
2736 src_method_match_quality
= classify_oload_match
2737 (src_method_badness
, args
.size (),
2738 oload_method_static_p (methods
.data (), src_method_oload_champ
));
2741 if (!xmethods
.empty ())
2743 ext_method_oload_champ
2744 = find_oload_champ (args
,
2746 NULL
, xmethods
.data (), NULL
,
2747 &ext_method_badness
);
2748 ext_method_match_quality
= classify_oload_match (ext_method_badness
,
2752 if (src_method_oload_champ
>= 0 && ext_method_oload_champ
>= 0)
2754 switch (compare_badness (ext_method_badness
, src_method_badness
))
2756 case 0: /* Src method and xmethod are equally good. */
2757 /* If src method and xmethod are equally good, then
2758 xmethod should be the winner. Hence, fall through to the
2759 case where a xmethod is better than the source
2760 method, except when the xmethod match quality is
2763 case 1: /* Src method and ext method are incompatible. */
2764 /* If ext method match is not standard, then let source method
2765 win. Otherwise, fallthrough to let xmethod win. */
2766 if (ext_method_match_quality
!= STANDARD
)
2768 method_oload_champ
= src_method_oload_champ
;
2769 method_badness
= src_method_badness
;
2770 ext_method_oload_champ
= -1;
2771 method_match_quality
= src_method_match_quality
;
2775 case 2: /* Ext method is champion. */
2776 method_oload_champ
= ext_method_oload_champ
;
2777 method_badness
= ext_method_badness
;
2778 src_method_oload_champ
= -1;
2779 method_match_quality
= ext_method_match_quality
;
2781 case 3: /* Src method is champion. */
2782 method_oload_champ
= src_method_oload_champ
;
2783 method_badness
= src_method_badness
;
2784 ext_method_oload_champ
= -1;
2785 method_match_quality
= src_method_match_quality
;
2788 gdb_assert_not_reached ("Unexpected overload comparison "
2793 else if (src_method_oload_champ
>= 0)
2795 method_oload_champ
= src_method_oload_champ
;
2796 method_badness
= src_method_badness
;
2797 method_match_quality
= src_method_match_quality
;
2799 else if (ext_method_oload_champ
>= 0)
2801 method_oload_champ
= ext_method_oload_champ
;
2802 method_badness
= ext_method_badness
;
2803 method_match_quality
= ext_method_match_quality
;
2807 if (method
== NON_METHOD
|| method
== BOTH
)
2809 const char *qualified_name
= NULL
;
2811 /* If the overload match is being search for both as a method
2812 and non member function, the first argument must now be
2815 args
[0] = value_ind (args
[0]);
2819 qualified_name
= fsym
->natural_name ();
2821 /* If we have a function with a C++ name, try to extract just
2822 the function part. Do not try this for non-functions (e.g.
2823 function pointers). */
2825 && (check_typedef (SYMBOL_TYPE (fsym
))->code ()
2828 temp_func
= cp_func_name (qualified_name
);
2830 /* If cp_func_name did not remove anything, the name of the
2831 symbol did not include scope or argument types - it was
2832 probably a C-style function. */
2833 if (temp_func
!= nullptr)
2835 if (strcmp (temp_func
.get (), qualified_name
) == 0)
2838 func_name
= temp_func
.get ();
2845 qualified_name
= name
;
2848 /* If there was no C++ name, this must be a C-style function or
2849 not a function at all. Just return the same symbol. Do the
2850 same if cp_func_name fails for some reason. */
2851 if (func_name
== NULL
)
2857 func_oload_champ
= find_oload_champ_namespace (args
,
2864 if (func_oload_champ
>= 0)
2865 func_match_quality
= classify_oload_match (func_badness
,
2869 /* Did we find a match ? */
2870 if (method_oload_champ
== -1 && func_oload_champ
== -1)
2871 throw_error (NOT_FOUND_ERROR
,
2872 _("No symbol \"%s\" in current context."),
2875 /* If we have found both a method match and a function
2876 match, find out which one is better, and calculate match
2878 if (method_oload_champ
>= 0 && func_oload_champ
>= 0)
2880 switch (compare_badness (func_badness
, method_badness
))
2882 case 0: /* Top two contenders are equally good. */
2883 /* FIXME: GDB does not support the general ambiguous case.
2884 All candidates should be collected and presented the
2886 error (_("Ambiguous overload resolution"));
2888 case 1: /* Incomparable top contenders. */
2889 /* This is an error incompatible candidates
2890 should not have been proposed. */
2891 error (_("Internal error: incompatible "
2892 "overload candidates proposed"));
2894 case 2: /* Function champion. */
2895 method_oload_champ
= -1;
2896 match_quality
= func_match_quality
;
2898 case 3: /* Method champion. */
2899 func_oload_champ
= -1;
2900 match_quality
= method_match_quality
;
2903 error (_("Internal error: unexpected overload comparison result"));
2909 /* We have either a method match or a function match. */
2910 if (method_oload_champ
>= 0)
2911 match_quality
= method_match_quality
;
2913 match_quality
= func_match_quality
;
2916 if (match_quality
== INCOMPATIBLE
)
2918 if (method
== METHOD
)
2919 error (_("Cannot resolve method %s%s%s to any overloaded instance"),
2921 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2924 error (_("Cannot resolve function %s to any overloaded instance"),
2927 else if (match_quality
== NON_STANDARD
)
2929 if (method
== METHOD
)
2930 warning (_("Using non-standard conversion to match "
2931 "method %s%s%s to supplied arguments"),
2933 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2936 warning (_("Using non-standard conversion to match "
2937 "function %s to supplied arguments"),
2941 if (staticp
!= NULL
)
2942 *staticp
= oload_method_static_p (methods
.data (), method_oload_champ
);
2944 if (method_oload_champ
>= 0)
2946 if (src_method_oload_champ
>= 0)
2948 if (TYPE_FN_FIELD_VIRTUAL_P (methods
, method_oload_champ
)
2949 && noside
!= EVAL_AVOID_SIDE_EFFECTS
)
2951 *valp
= value_virtual_fn_field (&temp
, methods
.data (),
2952 method_oload_champ
, basetype
,
2956 *valp
= value_fn_field (&temp
, methods
.data (),
2957 method_oload_champ
, basetype
, boffset
);
2960 *valp
= value_from_xmethod
2961 (std::move (xmethods
[ext_method_oload_champ
]));
2964 *symp
= functions
[func_oload_champ
];
2968 struct type
*temp_type
= check_typedef (value_type (temp
));
2969 struct type
*objtype
= check_typedef (obj_type
);
2971 if (temp_type
->code () != TYPE_CODE_PTR
2972 && (objtype
->code () == TYPE_CODE_PTR
2973 || TYPE_IS_REFERENCE (objtype
)))
2975 temp
= value_addr (temp
);
2980 switch (match_quality
)
2986 default: /* STANDARD */
2991 /* Find the best overload match, searching for FUNC_NAME in namespaces
2992 contained in QUALIFIED_NAME until it either finds a good match or
2993 runs out of namespaces. It stores the overloaded functions in
2994 *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. If NO_ADL,
2995 argument dependent lookup is not performed. */
2998 find_oload_champ_namespace (gdb::array_view
<value
*> args
,
2999 const char *func_name
,
3000 const char *qualified_name
,
3001 std::vector
<symbol
*> *oload_syms
,
3002 badness_vector
*oload_champ_bv
,
3007 find_oload_champ_namespace_loop (args
,
3010 oload_syms
, oload_champ_bv
,
3017 /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is
3018 how deep we've looked for namespaces, and the champ is stored in
3019 OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0
3020 if it isn't. Other arguments are the same as in
3021 find_oload_champ_namespace. */
3024 find_oload_champ_namespace_loop (gdb::array_view
<value
*> args
,
3025 const char *func_name
,
3026 const char *qualified_name
,
3028 std::vector
<symbol
*> *oload_syms
,
3029 badness_vector
*oload_champ_bv
,
3033 int next_namespace_len
= namespace_len
;
3034 int searched_deeper
= 0;
3035 int new_oload_champ
;
3036 char *new_namespace
;
3038 if (next_namespace_len
!= 0)
3040 gdb_assert (qualified_name
[next_namespace_len
] == ':');
3041 next_namespace_len
+= 2;
3043 next_namespace_len
+=
3044 cp_find_first_component (qualified_name
+ next_namespace_len
);
3046 /* First, see if we have a deeper namespace we can search in.
3047 If we get a good match there, use it. */
3049 if (qualified_name
[next_namespace_len
] == ':')
3051 searched_deeper
= 1;
3053 if (find_oload_champ_namespace_loop (args
,
3054 func_name
, qualified_name
,
3056 oload_syms
, oload_champ_bv
,
3057 oload_champ
, no_adl
))
3063 /* If we reach here, either we're in the deepest namespace or we
3064 didn't find a good match in a deeper namespace. But, in the
3065 latter case, we still have a bad match in a deeper namespace;
3066 note that we might not find any match at all in the current
3067 namespace. (There's always a match in the deepest namespace,
3068 because this overload mechanism only gets called if there's a
3069 function symbol to start off with.) */
3071 new_namespace
= (char *) alloca (namespace_len
+ 1);
3072 strncpy (new_namespace
, qualified_name
, namespace_len
);
3073 new_namespace
[namespace_len
] = '\0';
3075 std::vector
<symbol
*> new_oload_syms
3076 = make_symbol_overload_list (func_name
, new_namespace
);
3078 /* If we have reached the deepest level perform argument
3079 determined lookup. */
3080 if (!searched_deeper
&& !no_adl
)
3083 struct type
**arg_types
;
3085 /* Prepare list of argument types for overload resolution. */
3086 arg_types
= (struct type
**)
3087 alloca (args
.size () * (sizeof (struct type
*)));
3088 for (ix
= 0; ix
< args
.size (); ix
++)
3089 arg_types
[ix
] = value_type (args
[ix
]);
3090 add_symbol_overload_list_adl ({arg_types
, args
.size ()}, func_name
,
3094 badness_vector new_oload_champ_bv
;
3095 new_oload_champ
= find_oload_champ (args
,
3096 new_oload_syms
.size (),
3097 NULL
, NULL
, new_oload_syms
.data (),
3098 &new_oload_champ_bv
);
3100 /* Case 1: We found a good match. Free earlier matches (if any),
3101 and return it. Case 2: We didn't find a good match, but we're
3102 not the deepest function. Then go with the bad match that the
3103 deeper function found. Case 3: We found a bad match, and we're
3104 the deepest function. Then return what we found, even though
3105 it's a bad match. */
3107 if (new_oload_champ
!= -1
3108 && classify_oload_match (new_oload_champ_bv
, args
.size (), 0) == STANDARD
)
3110 *oload_syms
= std::move (new_oload_syms
);
3111 *oload_champ
= new_oload_champ
;
3112 *oload_champ_bv
= std::move (new_oload_champ_bv
);
3115 else if (searched_deeper
)
3121 *oload_syms
= std::move (new_oload_syms
);
3122 *oload_champ
= new_oload_champ
;
3123 *oload_champ_bv
= std::move (new_oload_champ_bv
);
3128 /* Look for a function to take ARGS. Find the best match from among
3129 the overloaded methods or functions given by METHODS or FUNCTIONS
3130 or XMETHODS, respectively. One, and only one of METHODS, FUNCTIONS
3131 and XMETHODS can be non-NULL.
3133 NUM_FNS is the length of the array pointed at by METHODS, FUNCTIONS
3134 or XMETHODS, whichever is non-NULL.
3136 Return the index of the best match; store an indication of the
3137 quality of the match in OLOAD_CHAMP_BV. */
3140 find_oload_champ (gdb::array_view
<value
*> args
,
3143 xmethod_worker_up
*xmethods
,
3145 badness_vector
*oload_champ_bv
)
3147 /* A measure of how good an overloaded instance is. */
3149 /* Index of best overloaded function. */
3150 int oload_champ
= -1;
3151 /* Current ambiguity state for overload resolution. */
3152 int oload_ambiguous
= 0;
3153 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */
3155 /* A champion can be found among methods alone, or among functions
3156 alone, or in xmethods alone, but not in more than one of these
3158 gdb_assert ((methods
!= NULL
) + (functions
!= NULL
) + (xmethods
!= NULL
)
3161 /* Consider each candidate in turn. */
3162 for (size_t ix
= 0; ix
< num_fns
; ix
++)
3165 int static_offset
= 0;
3166 std::vector
<type
*> parm_types
;
3168 if (xmethods
!= NULL
)
3169 parm_types
= xmethods
[ix
]->get_arg_types ();
3174 if (methods
!= NULL
)
3176 nparms
= TYPE_FN_FIELD_TYPE (methods
, ix
)->num_fields ();
3177 static_offset
= oload_method_static_p (methods
, ix
);
3180 nparms
= SYMBOL_TYPE (functions
[ix
])->num_fields ();
3182 parm_types
.reserve (nparms
);
3183 for (jj
= 0; jj
< nparms
; jj
++)
3185 type
*t
= (methods
!= NULL
3186 ? (TYPE_FN_FIELD_ARGS (methods
, ix
)[jj
].type ())
3187 : SYMBOL_TYPE (functions
[ix
])->field (jj
).type ());
3188 parm_types
.push_back (t
);
3192 /* Compare parameter types to supplied argument types. Skip
3193 THIS for static methods. */
3194 bv
= rank_function (parm_types
,
3195 args
.slice (static_offset
));
3199 if (methods
!= NULL
)
3200 fprintf_filtered (gdb_stderr
,
3201 "Overloaded method instance %s, # of parms %d\n",
3202 methods
[ix
].physname
, (int) parm_types
.size ());
3203 else if (xmethods
!= NULL
)
3204 fprintf_filtered (gdb_stderr
,
3205 "Xmethod worker, # of parms %d\n",
3206 (int) parm_types
.size ());
3208 fprintf_filtered (gdb_stderr
,
3209 "Overloaded function instance "
3210 "%s # of parms %d\n",
3211 functions
[ix
]->demangled_name (),
3212 (int) parm_types
.size ());
3214 fprintf_filtered (gdb_stderr
,
3215 "...Badness of length : {%d, %d}\n",
3216 bv
[0].rank
, bv
[0].subrank
);
3218 for (jj
= 1; jj
< bv
.size (); jj
++)
3219 fprintf_filtered (gdb_stderr
,
3220 "...Badness of arg %d : {%d, %d}\n",
3221 jj
, bv
[jj
].rank
, bv
[jj
].subrank
);
3224 if (oload_champ_bv
->empty ())
3226 *oload_champ_bv
= std::move (bv
);
3229 else /* See whether current candidate is better or worse than
3231 switch (compare_badness (bv
, *oload_champ_bv
))
3233 case 0: /* Top two contenders are equally good. */
3234 oload_ambiguous
= 1;
3236 case 1: /* Incomparable top contenders. */
3237 oload_ambiguous
= 2;
3239 case 2: /* New champion, record details. */
3240 *oload_champ_bv
= std::move (bv
);
3241 oload_ambiguous
= 0;
3249 fprintf_filtered (gdb_stderr
, "Overload resolution "
3250 "champion is %d, ambiguous? %d\n",
3251 oload_champ
, oload_ambiguous
);
3257 /* Return 1 if we're looking at a static method, 0 if we're looking at
3258 a non-static method or a function that isn't a method. */
3261 oload_method_static_p (struct fn_field
*fns_ptr
, int index
)
3263 if (fns_ptr
&& index
>= 0 && TYPE_FN_FIELD_STATIC_P (fns_ptr
, index
))
3269 /* Check how good an overload match OLOAD_CHAMP_BV represents. */
3271 static enum oload_classification
3272 classify_oload_match (const badness_vector
&oload_champ_bv
,
3277 enum oload_classification worst
= STANDARD
;
3279 for (ix
= 1; ix
<= nargs
- static_offset
; ix
++)
3281 /* If this conversion is as bad as INCOMPATIBLE_TYPE_BADNESS
3282 or worse return INCOMPATIBLE. */
3283 if (compare_ranks (oload_champ_bv
[ix
],
3284 INCOMPATIBLE_TYPE_BADNESS
) <= 0)
3285 return INCOMPATIBLE
; /* Truly mismatched types. */
3286 /* Otherwise If this conversion is as bad as
3287 NS_POINTER_CONVERSION_BADNESS or worse return NON_STANDARD. */
3288 else if (compare_ranks (oload_champ_bv
[ix
],
3289 NS_POINTER_CONVERSION_BADNESS
) <= 0)
3290 worst
= NON_STANDARD
; /* Non-standard type conversions
3294 /* If no INCOMPATIBLE classification was found, return the worst one
3295 that was found (if any). */
3299 /* C++: return 1 is NAME is a legitimate name for the destructor of
3300 type TYPE. If TYPE does not have a destructor, or if NAME is
3301 inappropriate for TYPE, an error is signaled. Parameter TYPE should not yet
3302 have CHECK_TYPEDEF applied, this function will apply it itself. */
3305 destructor_name_p (const char *name
, struct type
*type
)
3309 const char *dname
= type_name_or_error (type
);
3310 const char *cp
= strchr (dname
, '<');
3313 /* Do not compare the template part for template classes. */
3315 len
= strlen (dname
);
3318 if (strlen (name
+ 1) != len
|| strncmp (dname
, name
+ 1, len
) != 0)
3319 error (_("name of destructor must equal name of class"));
3326 /* Find an enum constant named NAME in TYPE. TYPE must be an "enum
3327 class". If the name is found, return a value representing it;
3328 otherwise throw an exception. */
3330 static struct value
*
3331 enum_constant_from_type (struct type
*type
, const char *name
)
3334 int name_len
= strlen (name
);
3336 gdb_assert (type
->code () == TYPE_CODE_ENUM
3337 && type
->is_declared_class ());
3339 for (i
= TYPE_N_BASECLASSES (type
); i
< type
->num_fields (); ++i
)
3341 const char *fname
= TYPE_FIELD_NAME (type
, i
);
3344 if (TYPE_FIELD_LOC_KIND (type
, i
) != FIELD_LOC_KIND_ENUMVAL
3348 /* Look for the trailing "::NAME", since enum class constant
3349 names are qualified here. */
3350 len
= strlen (fname
);
3351 if (len
+ 2 >= name_len
3352 && fname
[len
- name_len
- 2] == ':'
3353 && fname
[len
- name_len
- 1] == ':'
3354 && strcmp (&fname
[len
- name_len
], name
) == 0)
3355 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, i
));
3358 error (_("no constant named \"%s\" in enum \"%s\""),
3359 name
, type
->name ());
3362 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3363 return the appropriate member (or the address of the member, if
3364 WANT_ADDRESS). This function is used to resolve user expressions
3365 of the form "DOMAIN::NAME". For more details on what happens, see
3366 the comment before value_struct_elt_for_reference. */
3369 value_aggregate_elt (struct type
*curtype
, const char *name
,
3370 struct type
*expect_type
, int want_address
,
3373 switch (curtype
->code ())
3375 case TYPE_CODE_STRUCT
:
3376 case TYPE_CODE_UNION
:
3377 return value_struct_elt_for_reference (curtype
, 0, curtype
,
3379 want_address
, noside
);
3380 case TYPE_CODE_NAMESPACE
:
3381 return value_namespace_elt (curtype
, name
,
3382 want_address
, noside
);
3384 case TYPE_CODE_ENUM
:
3385 return enum_constant_from_type (curtype
, name
);
3388 internal_error (__FILE__
, __LINE__
,
3389 _("non-aggregate type in value_aggregate_elt"));
3393 /* Compares the two method/function types T1 and T2 for "equality"
3394 with respect to the methods' parameters. If the types of the
3395 two parameter lists are the same, returns 1; 0 otherwise. This
3396 comparison may ignore any artificial parameters in T1 if
3397 SKIP_ARTIFICIAL is non-zero. This function will ALWAYS skip
3398 the first artificial parameter in T1, assumed to be a 'this' pointer.
3400 The type T2 is expected to have come from make_params (in eval.c). */
3403 compare_parameters (struct type
*t1
, struct type
*t2
, int skip_artificial
)
3407 if (t1
->num_fields () > 0 && TYPE_FIELD_ARTIFICIAL (t1
, 0))
3410 /* If skipping artificial fields, find the first real field
3412 if (skip_artificial
)
3414 while (start
< t1
->num_fields ()
3415 && TYPE_FIELD_ARTIFICIAL (t1
, start
))
3419 /* Now compare parameters. */
3421 /* Special case: a method taking void. T1 will contain no
3422 non-artificial fields, and T2 will contain TYPE_CODE_VOID. */
3423 if ((t1
->num_fields () - start
) == 0 && t2
->num_fields () == 1
3424 && t2
->field (0).type ()->code () == TYPE_CODE_VOID
)
3427 if ((t1
->num_fields () - start
) == t2
->num_fields ())
3431 for (i
= 0; i
< t2
->num_fields (); ++i
)
3433 if (compare_ranks (rank_one_type (t1
->field (start
+ i
).type (),
3434 t2
->field (i
).type (), NULL
),
3435 EXACT_MATCH_BADNESS
) != 0)
3445 /* C++: Given an aggregate type VT, and a class type CLS, search
3446 recursively for CLS using value V; If found, store the offset
3447 which is either fetched from the virtual base pointer if CLS
3448 is virtual or accumulated offset of its parent classes if
3449 CLS is non-virtual in *BOFFS, set ISVIRT to indicate if CLS
3450 is virtual, and return true. If not found, return false. */
3453 get_baseclass_offset (struct type
*vt
, struct type
*cls
,
3454 struct value
*v
, int *boffs
, bool *isvirt
)
3456 for (int i
= 0; i
< TYPE_N_BASECLASSES (vt
); i
++)
3458 struct type
*t
= vt
->field (i
).type ();
3459 if (types_equal (t
, cls
))
3461 if (BASETYPE_VIA_VIRTUAL (vt
, i
))
3463 const gdb_byte
*adr
= value_contents_for_printing (v
);
3464 *boffs
= baseclass_offset (vt
, i
, adr
, value_offset (v
),
3465 value_as_long (v
), v
);
3473 if (get_baseclass_offset (check_typedef (t
), cls
, v
, boffs
, isvirt
))
3475 if (*isvirt
== false) /* Add non-virtual base offset. */
3477 const gdb_byte
*adr
= value_contents_for_printing (v
);
3478 *boffs
+= baseclass_offset (vt
, i
, adr
, value_offset (v
),
3479 value_as_long (v
), v
);
3488 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3489 return the address of this member as a "pointer to member" type.
3490 If INTYPE is non-null, then it will be the type of the member we
3491 are looking for. This will help us resolve "pointers to member
3492 functions". This function is used to resolve user expressions of
3493 the form "DOMAIN::NAME". */
3495 static struct value
*
3496 value_struct_elt_for_reference (struct type
*domain
, int offset
,
3497 struct type
*curtype
, const char *name
,
3498 struct type
*intype
,
3502 struct type
*t
= check_typedef (curtype
);
3504 struct value
*result
;
3506 if (t
->code () != TYPE_CODE_STRUCT
3507 && t
->code () != TYPE_CODE_UNION
)
3508 error (_("Internal error: non-aggregate type "
3509 "to value_struct_elt_for_reference"));
3511 for (i
= t
->num_fields () - 1; i
>= TYPE_N_BASECLASSES (t
); i
--)
3513 const char *t_field_name
= TYPE_FIELD_NAME (t
, i
);
3515 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
3517 if (field_is_static (&t
->field (i
)))
3519 struct value
*v
= value_static_field (t
, i
);
3524 if (TYPE_FIELD_PACKED (t
, i
))
3525 error (_("pointers to bitfield members not allowed"));
3528 return value_from_longest
3529 (lookup_memberptr_type (t
->field (i
).type (), domain
),
3530 offset
+ (LONGEST
) (TYPE_FIELD_BITPOS (t
, i
) >> 3));
3531 else if (noside
!= EVAL_NORMAL
)
3532 return allocate_value (t
->field (i
).type ());
3535 /* Try to evaluate NAME as a qualified name with implicit
3536 this pointer. In this case, attempt to return the
3537 equivalent to `this->*(&TYPE::NAME)'. */
3538 struct value
*v
= value_of_this_silent (current_language
);
3541 struct value
*ptr
, *this_v
= v
;
3543 struct type
*type
, *tmp
;
3545 ptr
= value_aggregate_elt (domain
, name
, NULL
, 1, noside
);
3546 type
= check_typedef (value_type (ptr
));
3547 gdb_assert (type
!= NULL
3548 && type
->code () == TYPE_CODE_MEMBERPTR
);
3549 tmp
= lookup_pointer_type (TYPE_SELF_TYPE (type
));
3550 v
= value_cast_pointers (tmp
, v
, 1);
3551 mem_offset
= value_as_long (ptr
);
3552 if (domain
!= curtype
)
3554 /* Find class offset of type CURTYPE from either its
3555 parent type DOMAIN or the type of implied this. */
3557 bool isvirt
= false;
3558 if (get_baseclass_offset (domain
, curtype
, v
, &boff
,
3563 struct type
*p
= check_typedef (value_type (this_v
));
3564 p
= check_typedef (TYPE_TARGET_TYPE (p
));
3565 if (get_baseclass_offset (p
, curtype
, this_v
,
3570 tmp
= lookup_pointer_type (TYPE_TARGET_TYPE (type
));
3571 result
= value_from_pointer (tmp
,
3572 value_as_long (v
) + mem_offset
);
3573 return value_ind (result
);
3576 error (_("Cannot reference non-static field \"%s\""), name
);
3581 /* C++: If it was not found as a data field, then try to return it
3582 as a pointer to a method. */
3584 /* Perform all necessary dereferencing. */
3585 while (intype
&& intype
->code () == TYPE_CODE_PTR
)
3586 intype
= TYPE_TARGET_TYPE (intype
);
3588 for (i
= TYPE_NFN_FIELDS (t
) - 1; i
>= 0; --i
)
3590 const char *t_field_name
= TYPE_FN_FIELDLIST_NAME (t
, i
);
3592 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
3595 int len
= TYPE_FN_FIELDLIST_LENGTH (t
, i
);
3596 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (t
, i
);
3598 check_stub_method_group (t
, i
);
3602 for (j
= 0; j
< len
; ++j
)
3604 if (TYPE_CONST (intype
) != TYPE_FN_FIELD_CONST (f
, j
))
3606 if (TYPE_VOLATILE (intype
) != TYPE_FN_FIELD_VOLATILE (f
, j
))
3609 if (compare_parameters (TYPE_FN_FIELD_TYPE (f
, j
), intype
, 0)
3610 || compare_parameters (TYPE_FN_FIELD_TYPE (f
, j
),
3616 error (_("no member function matches "
3617 "that type instantiation"));
3624 for (ii
= 0; ii
< len
; ++ii
)
3626 /* Skip artificial methods. This is necessary if,
3627 for example, the user wants to "print
3628 subclass::subclass" with only one user-defined
3629 constructor. There is no ambiguity in this case.
3630 We are careful here to allow artificial methods
3631 if they are the unique result. */
3632 if (TYPE_FN_FIELD_ARTIFICIAL (f
, ii
))
3639 /* Desired method is ambiguous if more than one
3640 method is defined. */
3641 if (j
!= -1 && !TYPE_FN_FIELD_ARTIFICIAL (f
, j
))
3642 error (_("non-unique member `%s' requires "
3643 "type instantiation"), name
);
3649 error (_("no matching member function"));
3652 if (TYPE_FN_FIELD_STATIC_P (f
, j
))
3655 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
3656 0, VAR_DOMAIN
, 0).symbol
;
3662 return value_addr (read_var_value (s
, 0, 0));
3664 return read_var_value (s
, 0, 0);
3667 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
3671 result
= allocate_value
3672 (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
3673 cplus_make_method_ptr (value_type (result
),
3674 value_contents_writeable (result
),
3675 TYPE_FN_FIELD_VOFFSET (f
, j
), 1);
3677 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
3678 return allocate_value (TYPE_FN_FIELD_TYPE (f
, j
));
3680 error (_("Cannot reference virtual member function \"%s\""),
3686 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
3687 0, VAR_DOMAIN
, 0).symbol
;
3692 struct value
*v
= read_var_value (s
, 0, 0);
3697 result
= allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
3698 cplus_make_method_ptr (value_type (result
),
3699 value_contents_writeable (result
),
3700 value_address (v
), 0);
3706 for (i
= TYPE_N_BASECLASSES (t
) - 1; i
>= 0; i
--)
3711 if (BASETYPE_VIA_VIRTUAL (t
, i
))
3714 base_offset
= TYPE_BASECLASS_BITPOS (t
, i
) / 8;
3715 v
= value_struct_elt_for_reference (domain
,
3716 offset
+ base_offset
,
3717 TYPE_BASECLASS (t
, i
),
3719 want_address
, noside
);
3724 /* As a last chance, pretend that CURTYPE is a namespace, and look
3725 it up that way; this (frequently) works for types nested inside
3728 return value_maybe_namespace_elt (curtype
, name
,
3729 want_address
, noside
);
3732 /* C++: Return the member NAME of the namespace given by the type
3735 static struct value
*
3736 value_namespace_elt (const struct type
*curtype
,
3737 const char *name
, int want_address
,
3740 struct value
*retval
= value_maybe_namespace_elt (curtype
, name
,
3745 error (_("No symbol \"%s\" in namespace \"%s\"."),
3746 name
, curtype
->name ());
3751 /* A helper function used by value_namespace_elt and
3752 value_struct_elt_for_reference. It looks up NAME inside the
3753 context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE
3754 is a class and NAME refers to a type in CURTYPE itself (as opposed
3755 to, say, some base class of CURTYPE). */
3757 static struct value
*
3758 value_maybe_namespace_elt (const struct type
*curtype
,
3759 const char *name
, int want_address
,
3762 const char *namespace_name
= curtype
->name ();
3763 struct block_symbol sym
;
3764 struct value
*result
;
3766 sym
= cp_lookup_symbol_namespace (namespace_name
, name
,
3767 get_selected_block (0), VAR_DOMAIN
);
3769 if (sym
.symbol
== NULL
)
3771 else if ((noside
== EVAL_AVOID_SIDE_EFFECTS
)
3772 && (SYMBOL_CLASS (sym
.symbol
) == LOC_TYPEDEF
))
3773 result
= allocate_value (SYMBOL_TYPE (sym
.symbol
));
3775 result
= value_of_variable (sym
.symbol
, sym
.block
);
3778 result
= value_addr (result
);
3783 /* Given a pointer or a reference value V, find its real (RTTI) type.
3785 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
3786 and refer to the values computed for the object pointed to. */
3789 value_rtti_indirect_type (struct value
*v
, int *full
,
3790 LONGEST
*top
, int *using_enc
)
3792 struct value
*target
= NULL
;
3793 struct type
*type
, *real_type
, *target_type
;
3795 type
= value_type (v
);
3796 type
= check_typedef (type
);
3797 if (TYPE_IS_REFERENCE (type
))
3798 target
= coerce_ref (v
);
3799 else if (type
->code () == TYPE_CODE_PTR
)
3804 target
= value_ind (v
);
3806 catch (const gdb_exception_error
&except
)
3808 if (except
.error
== MEMORY_ERROR
)
3810 /* value_ind threw a memory error. The pointer is NULL or
3811 contains an uninitialized value: we can't determine any
3821 real_type
= value_rtti_type (target
, full
, top
, using_enc
);
3825 /* Copy qualifiers to the referenced object. */
3826 target_type
= value_type (target
);
3827 real_type
= make_cv_type (TYPE_CONST (target_type
),
3828 TYPE_VOLATILE (target_type
), real_type
, NULL
);
3829 if (TYPE_IS_REFERENCE (type
))
3830 real_type
= lookup_reference_type (real_type
, type
->code ());
3831 else if (type
->code () == TYPE_CODE_PTR
)
3832 real_type
= lookup_pointer_type (real_type
);
3834 internal_error (__FILE__
, __LINE__
, _("Unexpected value type."));
3836 /* Copy qualifiers to the pointer/reference. */
3837 real_type
= make_cv_type (TYPE_CONST (type
), TYPE_VOLATILE (type
),
3844 /* Given a value pointed to by ARGP, check its real run-time type, and
3845 if that is different from the enclosing type, create a new value
3846 using the real run-time type as the enclosing type (and of the same
3847 type as ARGP) and return it, with the embedded offset adjusted to
3848 be the correct offset to the enclosed object. RTYPE is the type,
3849 and XFULL, XTOP, and XUSING_ENC are the other parameters, computed
3850 by value_rtti_type(). If these are available, they can be supplied
3851 and a second call to value_rtti_type() is avoided. (Pass RTYPE ==
3852 NULL if they're not available. */
3855 value_full_object (struct value
*argp
,
3857 int xfull
, int xtop
,
3860 struct type
*real_type
;
3864 struct value
*new_val
;
3871 using_enc
= xusing_enc
;
3874 real_type
= value_rtti_type (argp
, &full
, &top
, &using_enc
);
3876 /* If no RTTI data, or if object is already complete, do nothing. */
3877 if (!real_type
|| real_type
== value_enclosing_type (argp
))
3880 /* In a destructor we might see a real type that is a superclass of
3881 the object's type. In this case it is better to leave the object
3884 && TYPE_LENGTH (real_type
) < TYPE_LENGTH (value_enclosing_type (argp
)))
3887 /* If we have the full object, but for some reason the enclosing
3888 type is wrong, set it. */
3889 /* pai: FIXME -- sounds iffy */
3892 argp
= value_copy (argp
);
3893 set_value_enclosing_type (argp
, real_type
);
3897 /* Check if object is in memory. */
3898 if (VALUE_LVAL (argp
) != lval_memory
)
3900 warning (_("Couldn't retrieve complete object of RTTI "
3901 "type %s; object may be in register(s)."),
3902 real_type
->name ());
3907 /* All other cases -- retrieve the complete object. */
3908 /* Go back by the computed top_offset from the beginning of the
3909 object, adjusting for the embedded offset of argp if that's what
3910 value_rtti_type used for its computation. */
3911 new_val
= value_at_lazy (real_type
, value_address (argp
) - top
+
3912 (using_enc
? 0 : value_embedded_offset (argp
)));
3913 deprecated_set_value_type (new_val
, value_type (argp
));
3914 set_value_embedded_offset (new_val
, (using_enc
3915 ? top
+ value_embedded_offset (argp
)
3921 /* Return the value of the local variable, if one exists. Throw error
3922 otherwise, such as if the request is made in an inappropriate context. */
3925 value_of_this (const struct language_defn
*lang
)
3927 struct block_symbol sym
;
3928 const struct block
*b
;
3929 struct frame_info
*frame
;
3931 if (lang
->name_of_this () == NULL
)
3932 error (_("no `this' in current language"));
3934 frame
= get_selected_frame (_("no frame selected"));
3936 b
= get_frame_block (frame
, NULL
);
3938 sym
= lookup_language_this (lang
, b
);
3939 if (sym
.symbol
== NULL
)
3940 error (_("current stack frame does not contain a variable named `%s'"),
3941 lang
->name_of_this ());
3943 return read_var_value (sym
.symbol
, sym
.block
, frame
);
3946 /* Return the value of the local variable, if one exists. Return NULL
3947 otherwise. Never throw error. */
3950 value_of_this_silent (const struct language_defn
*lang
)
3952 struct value
*ret
= NULL
;
3956 ret
= value_of_this (lang
);
3958 catch (const gdb_exception_error
&except
)
3965 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH
3966 elements long, starting at LOWBOUND. The result has the same lower
3967 bound as the original ARRAY. */
3970 value_slice (struct value
*array
, int lowbound
, int length
)
3972 struct type
*slice_range_type
, *slice_type
, *range_type
;
3973 LONGEST lowerbound
, upperbound
;
3974 struct value
*slice
;
3975 struct type
*array_type
;
3977 array_type
= check_typedef (value_type (array
));
3978 if (array_type
->code () != TYPE_CODE_ARRAY
3979 && array_type
->code () != TYPE_CODE_STRING
)
3980 error (_("cannot take slice of non-array"));
3982 if (type_not_allocated (array_type
))
3983 error (_("array not allocated"));
3984 if (type_not_associated (array_type
))
3985 error (_("array not associated"));
3987 range_type
= array_type
->index_type ();
3988 if (!get_discrete_bounds (range_type
, &lowerbound
, &upperbound
))
3989 error (_("slice from bad array or bitstring"));
3991 if (lowbound
< lowerbound
|| length
< 0
3992 || lowbound
+ length
- 1 > upperbound
)
3993 error (_("slice out of range"));
3995 /* FIXME-type-allocation: need a way to free this type when we are
3997 slice_range_type
= create_static_range_type (NULL
,
3998 TYPE_TARGET_TYPE (range_type
),
4000 lowbound
+ length
- 1);
4003 struct type
*element_type
= TYPE_TARGET_TYPE (array_type
);
4005 = (lowbound
- lowerbound
) * TYPE_LENGTH (check_typedef (element_type
));
4007 slice_type
= create_array_type (NULL
,
4010 slice_type
->set_code (array_type
->code ());
4012 if (VALUE_LVAL (array
) == lval_memory
&& value_lazy (array
))
4013 slice
= allocate_value_lazy (slice_type
);
4016 slice
= allocate_value (slice_type
);
4017 value_contents_copy (slice
, 0, array
, offset
,
4018 type_length_units (slice_type
));
4021 set_value_component_location (slice
, array
);
4022 set_value_offset (slice
, value_offset (array
) + offset
);
4031 value_literal_complex (struct value
*arg1
,
4036 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
4038 val
= allocate_value (type
);
4039 arg1
= value_cast (real_type
, arg1
);
4040 arg2
= value_cast (real_type
, arg2
);
4042 memcpy (value_contents_raw (val
),
4043 value_contents (arg1
), TYPE_LENGTH (real_type
));
4044 memcpy (value_contents_raw (val
) + TYPE_LENGTH (real_type
),
4045 value_contents (arg2
), TYPE_LENGTH (real_type
));
4052 value_real_part (struct value
*value
)
4054 struct type
*type
= check_typedef (value_type (value
));
4055 struct type
*ttype
= TYPE_TARGET_TYPE (type
);
4057 gdb_assert (type
->code () == TYPE_CODE_COMPLEX
);
4058 return value_from_component (value
, ttype
, 0);
4064 value_imaginary_part (struct value
*value
)
4066 struct type
*type
= check_typedef (value_type (value
));
4067 struct type
*ttype
= TYPE_TARGET_TYPE (type
);
4069 gdb_assert (type
->code () == TYPE_CODE_COMPLEX
);
4070 return value_from_component (value
, ttype
,
4071 TYPE_LENGTH (check_typedef (ttype
)));
4074 /* Cast a value into the appropriate complex data type. */
4076 static struct value
*
4077 cast_into_complex (struct type
*type
, struct value
*val
)
4079 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
4081 if (value_type (val
)->code () == TYPE_CODE_COMPLEX
)
4083 struct type
*val_real_type
= TYPE_TARGET_TYPE (value_type (val
));
4084 struct value
*re_val
= allocate_value (val_real_type
);
4085 struct value
*im_val
= allocate_value (val_real_type
);
4087 memcpy (value_contents_raw (re_val
),
4088 value_contents (val
), TYPE_LENGTH (val_real_type
));
4089 memcpy (value_contents_raw (im_val
),
4090 value_contents (val
) + TYPE_LENGTH (val_real_type
),
4091 TYPE_LENGTH (val_real_type
));
4093 return value_literal_complex (re_val
, im_val
, type
);
4095 else if (value_type (val
)->code () == TYPE_CODE_FLT
4096 || value_type (val
)->code () == TYPE_CODE_INT
)
4097 return value_literal_complex (val
,
4098 value_zero (real_type
, not_lval
),
4101 error (_("cannot cast non-number to complex"));
4104 void _initialize_valops ();
4106 _initialize_valops ()
4108 add_setshow_boolean_cmd ("overload-resolution", class_support
,
4109 &overload_resolution
, _("\
4110 Set overload resolution in evaluating C++ functions."), _("\
4111 Show overload resolution in evaluating C++ functions."),
4113 show_overload_resolution
,
4114 &setlist
, &showlist
);
4115 overload_resolution
= 1;