1 /* Perform non-arithmetic operations on values, for GDB.
3 Copyright (C) 1986-2019 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"
42 #include "gdbsupport/byte-vector.h"
44 extern unsigned int overload_debug
;
45 /* Local functions. */
47 static int typecmp (int staticp
, int varargs
, int nargs
,
48 struct field t1
[], struct value
*t2
[]);
50 static struct value
*search_struct_field (const char *, struct value
*,
53 static struct value
*search_struct_method (const char *, struct value
**,
55 LONGEST
, int *, struct type
*);
57 static int find_oload_champ_namespace (gdb::array_view
<value
*> args
,
58 const char *, const char *,
59 std::vector
<symbol
*> *oload_syms
,
63 static int find_oload_champ_namespace_loop (gdb::array_view
<value
*> args
,
64 const char *, const char *,
65 int, std::vector
<symbol
*> *oload_syms
,
66 badness_vector
*, int *,
69 static int find_oload_champ (gdb::array_view
<value
*> args
,
72 xmethod_worker_up
*xmethods
,
74 badness_vector
*oload_champ_bv
);
76 static int oload_method_static_p (struct fn_field
*, int);
78 enum oload_classification
{ STANDARD
, NON_STANDARD
, INCOMPATIBLE
};
80 static enum oload_classification classify_oload_match
81 (const badness_vector
&, int, int);
83 static struct value
*value_struct_elt_for_reference (struct type
*,
89 static struct value
*value_namespace_elt (const struct type
*,
90 const char *, int , enum noside
);
92 static struct value
*value_maybe_namespace_elt (const struct type
*,
96 static CORE_ADDR
allocate_space_in_inferior (int);
98 static struct value
*cast_into_complex (struct type
*, struct value
*);
100 int overload_resolution
= 0;
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
= get_objfile_arch (objfile
);
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
= get_objfile_arch (objf
);
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 ((TYPE_CODE (t1
) == TYPE_CODE_STRUCT
219 || TYPE_CODE (t1
) == TYPE_CODE_UNION
)
220 && !!"Precondition is that type is of STRUCT or UNION kind.");
221 gdb_assert ((TYPE_CODE (t2
) == TYPE_CODE_STRUCT
222 || TYPE_CODE (t2
) == TYPE_CODE_UNION
)
223 && !!"Precondition is that value is of STRUCT or UNION kind");
225 if (TYPE_NAME (t1
) != NULL
226 && TYPE_NAME (t2
) != NULL
227 && !strcmp (TYPE_NAME (t1
), TYPE_NAME (t2
)))
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 (TYPE_NAME (t1
) != NULL
)
235 v
= search_struct_field (TYPE_NAME (t1
),
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 (TYPE_NAME (t2
) != 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 (TYPE_NAME (real_type
) != NULL
261 && !strcmp (TYPE_NAME (real_type
), TYPE_NAME (t1
)))
264 v
= search_struct_field (TYPE_NAME (t2
), 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 (TYPE_NAME (t2
),
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 (TYPE_CODE (t1
) == TYPE_CODE_STRUCT
304 && TYPE_CODE (t2
) == 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 (TYPE_CODE (check_typedef (value_type (v2
)))
314 == TYPE_CODE_STRUCT
&& !!"Why did coercion fail?");
315 v2
= value_cast_structs (t1
, v2
);
316 /* At this point we have what we can have, un-dereference if needed. */
319 struct value
*v
= value_addr (v2
);
321 deprecated_set_value_type (v
, type
);
326 /* No superclass found, just change the pointer type. */
327 arg2
= value_copy (arg2
);
328 deprecated_set_value_type (arg2
, type
);
329 set_value_enclosing_type (arg2
, type
);
330 set_value_pointed_to_offset (arg2
, 0); /* pai: chk_val */
334 /* Cast value ARG2 to type TYPE and return as a value.
335 More general than a C cast: accepts any two types of the same length,
336 and if ARG2 is an lvalue it can be cast into anything at all. */
337 /* In C++, casts may change pointer or object representations. */
340 value_cast (struct type
*type
, struct value
*arg2
)
342 enum type_code code1
;
343 enum type_code code2
;
347 int convert_to_boolean
= 0;
349 if (value_type (arg2
) == type
)
352 /* Check if we are casting struct reference to struct reference. */
353 if (TYPE_IS_REFERENCE (check_typedef (type
)))
355 /* We dereference type; then we recurse and finally
356 we generate value of the given reference. Nothing wrong with
358 struct type
*t1
= check_typedef (type
);
359 struct type
*dereftype
= check_typedef (TYPE_TARGET_TYPE (t1
));
360 struct value
*val
= value_cast (dereftype
, arg2
);
362 return value_ref (val
, TYPE_CODE (t1
));
365 if (TYPE_IS_REFERENCE (check_typedef (value_type (arg2
))))
366 /* We deref the value and then do the cast. */
367 return value_cast (type
, coerce_ref (arg2
));
369 /* Strip typedefs / resolve stubs in order to get at the type's
370 code/length, but remember the original type, to use as the
371 resulting type of the cast, in case it was a typedef. */
372 struct type
*to_type
= type
;
374 type
= check_typedef (type
);
375 code1
= TYPE_CODE (type
);
376 arg2
= coerce_ref (arg2
);
377 type2
= check_typedef (value_type (arg2
));
379 /* You can't cast to a reference type. See value_cast_pointers
381 gdb_assert (!TYPE_IS_REFERENCE (type
));
383 /* A cast to an undetermined-length array_type, such as
384 (TYPE [])OBJECT, is treated like a cast to (TYPE [N])OBJECT,
385 where N is sizeof(OBJECT)/sizeof(TYPE). */
386 if (code1
== TYPE_CODE_ARRAY
)
388 struct type
*element_type
= TYPE_TARGET_TYPE (type
);
389 unsigned element_length
= TYPE_LENGTH (check_typedef (element_type
));
391 if (element_length
> 0 && TYPE_ARRAY_UPPER_BOUND_IS_UNDEFINED (type
))
393 struct type
*range_type
= TYPE_INDEX_TYPE (type
);
394 int val_length
= TYPE_LENGTH (type2
);
395 LONGEST low_bound
, high_bound
, new_length
;
397 if (get_discrete_bounds (range_type
, &low_bound
, &high_bound
) < 0)
398 low_bound
= 0, high_bound
= 0;
399 new_length
= val_length
/ element_length
;
400 if (val_length
% element_length
!= 0)
401 warning (_("array element type size does not "
402 "divide object size in cast"));
403 /* FIXME-type-allocation: need a way to free this type when
404 we are done with it. */
405 range_type
= create_static_range_type (NULL
,
406 TYPE_TARGET_TYPE (range_type
),
408 new_length
+ low_bound
- 1);
409 deprecated_set_value_type (arg2
,
410 create_array_type (NULL
,
417 if (current_language
->c_style_arrays
418 && TYPE_CODE (type2
) == TYPE_CODE_ARRAY
419 && !TYPE_VECTOR (type2
))
420 arg2
= value_coerce_array (arg2
);
422 if (TYPE_CODE (type2
) == TYPE_CODE_FUNC
)
423 arg2
= value_coerce_function (arg2
);
425 type2
= check_typedef (value_type (arg2
));
426 code2
= TYPE_CODE (type2
);
428 if (code1
== TYPE_CODE_COMPLEX
)
429 return cast_into_complex (to_type
, arg2
);
430 if (code1
== TYPE_CODE_BOOL
)
432 code1
= TYPE_CODE_INT
;
433 convert_to_boolean
= 1;
435 if (code1
== TYPE_CODE_CHAR
)
436 code1
= TYPE_CODE_INT
;
437 if (code2
== TYPE_CODE_BOOL
|| code2
== TYPE_CODE_CHAR
)
438 code2
= TYPE_CODE_INT
;
440 scalar
= (code2
== TYPE_CODE_INT
|| code2
== TYPE_CODE_FLT
441 || code2
== TYPE_CODE_DECFLOAT
|| code2
== TYPE_CODE_ENUM
442 || code2
== TYPE_CODE_RANGE
);
444 if ((code1
== TYPE_CODE_STRUCT
|| code1
== TYPE_CODE_UNION
)
445 && (code2
== TYPE_CODE_STRUCT
|| code2
== TYPE_CODE_UNION
)
446 && TYPE_NAME (type
) != 0)
448 struct value
*v
= value_cast_structs (to_type
, arg2
);
454 if (is_floating_type (type
) && scalar
)
456 if (is_floating_value (arg2
))
458 struct value
*v
= allocate_value (to_type
);
459 target_float_convert (value_contents (arg2
), type2
,
460 value_contents_raw (v
), type
);
464 /* The only option left is an integral type. */
465 if (TYPE_UNSIGNED (type2
))
466 return value_from_ulongest (to_type
, value_as_long (arg2
));
468 return value_from_longest (to_type
, value_as_long (arg2
));
470 else if ((code1
== TYPE_CODE_INT
|| code1
== TYPE_CODE_ENUM
471 || code1
== TYPE_CODE_RANGE
)
472 && (scalar
|| code2
== TYPE_CODE_PTR
473 || code2
== TYPE_CODE_MEMBERPTR
))
477 /* When we cast pointers to integers, we mustn't use
478 gdbarch_pointer_to_address to find the address the pointer
479 represents, as value_as_long would. GDB should evaluate
480 expressions just as the compiler would --- and the compiler
481 sees a cast as a simple reinterpretation of the pointer's
483 if (code2
== TYPE_CODE_PTR
)
484 longest
= extract_unsigned_integer
485 (value_contents (arg2
), TYPE_LENGTH (type2
),
486 gdbarch_byte_order (get_type_arch (type2
)));
488 longest
= value_as_long (arg2
);
489 return value_from_longest (to_type
, convert_to_boolean
?
490 (LONGEST
) (longest
? 1 : 0) : longest
);
492 else if (code1
== TYPE_CODE_PTR
&& (code2
== TYPE_CODE_INT
493 || code2
== TYPE_CODE_ENUM
494 || code2
== TYPE_CODE_RANGE
))
496 /* TYPE_LENGTH (type) is the length of a pointer, but we really
497 want the length of an address! -- we are really dealing with
498 addresses (i.e., gdb representations) not pointers (i.e.,
499 target representations) here.
501 This allows things like "print *(int *)0x01000234" to work
502 without printing a misleading message -- which would
503 otherwise occur when dealing with a target having two byte
504 pointers and four byte addresses. */
506 int addr_bit
= gdbarch_addr_bit (get_type_arch (type2
));
507 LONGEST longest
= value_as_long (arg2
);
509 if (addr_bit
< sizeof (LONGEST
) * HOST_CHAR_BIT
)
511 if (longest
>= ((LONGEST
) 1 << addr_bit
)
512 || longest
<= -((LONGEST
) 1 << addr_bit
))
513 warning (_("value truncated"));
515 return value_from_longest (to_type
, longest
);
517 else if (code1
== TYPE_CODE_METHODPTR
&& code2
== TYPE_CODE_INT
518 && value_as_long (arg2
) == 0)
520 struct value
*result
= allocate_value (to_type
);
522 cplus_make_method_ptr (to_type
, value_contents_writeable (result
), 0, 0);
525 else if (code1
== TYPE_CODE_MEMBERPTR
&& code2
== TYPE_CODE_INT
526 && value_as_long (arg2
) == 0)
528 /* The Itanium C++ ABI represents NULL pointers to members as
529 minus one, instead of biasing the normal case. */
530 return value_from_longest (to_type
, -1);
532 else if (code1
== TYPE_CODE_ARRAY
&& TYPE_VECTOR (type
)
533 && code2
== TYPE_CODE_ARRAY
&& TYPE_VECTOR (type2
)
534 && TYPE_LENGTH (type
) != TYPE_LENGTH (type2
))
535 error (_("Cannot convert between vector values of different sizes"));
536 else if (code1
== TYPE_CODE_ARRAY
&& TYPE_VECTOR (type
) && scalar
537 && TYPE_LENGTH (type
) != TYPE_LENGTH (type2
))
538 error (_("can only cast scalar to vector of same size"));
539 else if (code1
== TYPE_CODE_VOID
)
541 return value_zero (to_type
, not_lval
);
543 else if (TYPE_LENGTH (type
) == TYPE_LENGTH (type2
))
545 if (code1
== TYPE_CODE_PTR
&& code2
== TYPE_CODE_PTR
)
546 return value_cast_pointers (to_type
, arg2
, 0);
548 arg2
= value_copy (arg2
);
549 deprecated_set_value_type (arg2
, to_type
);
550 set_value_enclosing_type (arg2
, to_type
);
551 set_value_pointed_to_offset (arg2
, 0); /* pai: chk_val */
554 else if (VALUE_LVAL (arg2
) == lval_memory
)
555 return value_at_lazy (to_type
, value_address (arg2
));
558 if (current_language
->la_language
== language_ada
)
559 error (_("Invalid type conversion."));
560 error (_("Invalid cast."));
564 /* The C++ reinterpret_cast operator. */
567 value_reinterpret_cast (struct type
*type
, struct value
*arg
)
569 struct value
*result
;
570 struct type
*real_type
= check_typedef (type
);
571 struct type
*arg_type
, *dest_type
;
573 enum type_code dest_code
, arg_code
;
575 /* Do reference, function, and array conversion. */
576 arg
= coerce_array (arg
);
578 /* Attempt to preserve the type the user asked for. */
581 /* If we are casting to a reference type, transform
582 reinterpret_cast<T&[&]>(V) to *reinterpret_cast<T*>(&V). */
583 if (TYPE_IS_REFERENCE (real_type
))
586 arg
= value_addr (arg
);
587 dest_type
= lookup_pointer_type (TYPE_TARGET_TYPE (dest_type
));
588 real_type
= lookup_pointer_type (real_type
);
591 arg_type
= value_type (arg
);
593 dest_code
= TYPE_CODE (real_type
);
594 arg_code
= TYPE_CODE (arg_type
);
596 /* We can convert pointer types, or any pointer type to int, or int
598 if ((dest_code
== TYPE_CODE_PTR
&& arg_code
== TYPE_CODE_INT
)
599 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_PTR
)
600 || (dest_code
== TYPE_CODE_METHODPTR
&& arg_code
== TYPE_CODE_INT
)
601 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_METHODPTR
)
602 || (dest_code
== TYPE_CODE_MEMBERPTR
&& arg_code
== TYPE_CODE_INT
)
603 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_MEMBERPTR
)
604 || (dest_code
== arg_code
605 && (dest_code
== TYPE_CODE_PTR
606 || dest_code
== TYPE_CODE_METHODPTR
607 || dest_code
== TYPE_CODE_MEMBERPTR
)))
608 result
= value_cast (dest_type
, arg
);
610 error (_("Invalid reinterpret_cast"));
613 result
= value_cast (type
, value_ref (value_ind (result
),
619 /* A helper for value_dynamic_cast. This implements the first of two
620 runtime checks: we iterate over all the base classes of the value's
621 class which are equal to the desired class; if only one of these
622 holds the value, then it is the answer. */
625 dynamic_cast_check_1 (struct type
*desired_type
,
626 const gdb_byte
*valaddr
,
627 LONGEST embedded_offset
,
630 struct type
*search_type
,
632 struct type
*arg_type
,
633 struct value
**result
)
635 int i
, result_count
= 0;
637 for (i
= 0; i
< TYPE_N_BASECLASSES (search_type
) && result_count
< 2; ++i
)
639 LONGEST offset
= baseclass_offset (search_type
, i
, valaddr
,
643 if (class_types_same_p (desired_type
, TYPE_BASECLASS (search_type
, i
)))
645 if (address
+ embedded_offset
+ offset
>= arg_addr
646 && address
+ embedded_offset
+ offset
< arg_addr
+ TYPE_LENGTH (arg_type
))
650 *result
= value_at_lazy (TYPE_BASECLASS (search_type
, i
),
651 address
+ embedded_offset
+ offset
);
655 result_count
+= dynamic_cast_check_1 (desired_type
,
657 embedded_offset
+ offset
,
659 TYPE_BASECLASS (search_type
, i
),
668 /* A helper for value_dynamic_cast. This implements the second of two
669 runtime checks: we look for a unique public sibling class of the
670 argument's declared class. */
673 dynamic_cast_check_2 (struct type
*desired_type
,
674 const gdb_byte
*valaddr
,
675 LONGEST embedded_offset
,
678 struct type
*search_type
,
679 struct value
**result
)
681 int i
, result_count
= 0;
683 for (i
= 0; i
< TYPE_N_BASECLASSES (search_type
) && result_count
< 2; ++i
)
687 if (! BASETYPE_VIA_PUBLIC (search_type
, i
))
690 offset
= baseclass_offset (search_type
, i
, valaddr
, embedded_offset
,
692 if (class_types_same_p (desired_type
, TYPE_BASECLASS (search_type
, i
)))
696 *result
= value_at_lazy (TYPE_BASECLASS (search_type
, i
),
697 address
+ embedded_offset
+ offset
);
700 result_count
+= dynamic_cast_check_2 (desired_type
,
702 embedded_offset
+ offset
,
704 TYPE_BASECLASS (search_type
, i
),
711 /* The C++ dynamic_cast operator. */
714 value_dynamic_cast (struct type
*type
, struct value
*arg
)
718 struct type
*resolved_type
= check_typedef (type
);
719 struct type
*arg_type
= check_typedef (value_type (arg
));
720 struct type
*class_type
, *rtti_type
;
721 struct value
*result
, *tem
, *original_arg
= arg
;
723 int is_ref
= TYPE_IS_REFERENCE (resolved_type
);
725 if (TYPE_CODE (resolved_type
) != TYPE_CODE_PTR
726 && !TYPE_IS_REFERENCE (resolved_type
))
727 error (_("Argument to dynamic_cast must be a pointer or reference type"));
728 if (TYPE_CODE (TYPE_TARGET_TYPE (resolved_type
)) != TYPE_CODE_VOID
729 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type
)) != TYPE_CODE_STRUCT
)
730 error (_("Argument to dynamic_cast must be pointer to class or `void *'"));
732 class_type
= check_typedef (TYPE_TARGET_TYPE (resolved_type
));
733 if (TYPE_CODE (resolved_type
) == TYPE_CODE_PTR
)
735 if (TYPE_CODE (arg_type
) != TYPE_CODE_PTR
736 && ! (TYPE_CODE (arg_type
) == TYPE_CODE_INT
737 && value_as_long (arg
) == 0))
738 error (_("Argument to dynamic_cast does not have pointer type"));
739 if (TYPE_CODE (arg_type
) == TYPE_CODE_PTR
)
741 arg_type
= check_typedef (TYPE_TARGET_TYPE (arg_type
));
742 if (TYPE_CODE (arg_type
) != TYPE_CODE_STRUCT
)
743 error (_("Argument to dynamic_cast does "
744 "not have pointer to class type"));
747 /* Handle NULL pointers. */
748 if (value_as_long (arg
) == 0)
749 return value_zero (type
, not_lval
);
751 arg
= value_ind (arg
);
755 if (TYPE_CODE (arg_type
) != TYPE_CODE_STRUCT
)
756 error (_("Argument to dynamic_cast does not have class type"));
759 /* If the classes are the same, just return the argument. */
760 if (class_types_same_p (class_type
, arg_type
))
761 return value_cast (type
, arg
);
763 /* If the target type is a unique base class of the argument's
764 declared type, just cast it. */
765 if (is_ancestor (class_type
, arg_type
))
767 if (is_unique_ancestor (class_type
, arg
))
768 return value_cast (type
, original_arg
);
769 error (_("Ambiguous dynamic_cast"));
772 rtti_type
= value_rtti_type (arg
, &full
, &top
, &using_enc
);
774 error (_("Couldn't determine value's most derived type for dynamic_cast"));
776 /* Compute the most derived object's address. */
777 addr
= value_address (arg
);
785 addr
+= top
+ value_embedded_offset (arg
);
787 /* dynamic_cast<void *> means to return a pointer to the
788 most-derived object. */
789 if (TYPE_CODE (resolved_type
) == TYPE_CODE_PTR
790 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type
)) == TYPE_CODE_VOID
)
791 return value_at_lazy (type
, addr
);
793 tem
= value_at (type
, addr
);
794 type
= value_type (tem
);
796 /* The first dynamic check specified in 5.2.7. */
797 if (is_public_ancestor (arg_type
, TYPE_TARGET_TYPE (resolved_type
)))
799 if (class_types_same_p (rtti_type
, TYPE_TARGET_TYPE (resolved_type
)))
802 if (dynamic_cast_check_1 (TYPE_TARGET_TYPE (resolved_type
),
803 value_contents_for_printing (tem
),
804 value_embedded_offset (tem
),
805 value_address (tem
), tem
,
809 return value_cast (type
,
811 ? value_ref (result
, TYPE_CODE (resolved_type
))
812 : value_addr (result
));
815 /* The second dynamic check specified in 5.2.7. */
817 if (is_public_ancestor (arg_type
, rtti_type
)
818 && dynamic_cast_check_2 (TYPE_TARGET_TYPE (resolved_type
),
819 value_contents_for_printing (tem
),
820 value_embedded_offset (tem
),
821 value_address (tem
), tem
,
822 rtti_type
, &result
) == 1)
823 return value_cast (type
,
825 ? value_ref (result
, TYPE_CODE (resolved_type
))
826 : value_addr (result
));
828 if (TYPE_CODE (resolved_type
) == TYPE_CODE_PTR
)
829 return value_zero (type
, not_lval
);
831 error (_("dynamic_cast failed"));
834 /* Create a value of type TYPE that is zero, and return it. */
837 value_zero (struct type
*type
, enum lval_type lv
)
839 struct value
*val
= allocate_value (type
);
841 VALUE_LVAL (val
) = (lv
== lval_computed
? not_lval
: lv
);
845 /* Create a not_lval value of numeric type TYPE that is one, and return it. */
848 value_one (struct type
*type
)
850 struct type
*type1
= check_typedef (type
);
853 if (is_integral_type (type1
) || is_floating_type (type1
))
855 val
= value_from_longest (type
, (LONGEST
) 1);
857 else if (TYPE_CODE (type1
) == TYPE_CODE_ARRAY
&& TYPE_VECTOR (type1
))
859 struct type
*eltype
= check_typedef (TYPE_TARGET_TYPE (type1
));
861 LONGEST low_bound
, high_bound
;
864 if (!get_array_bounds (type1
, &low_bound
, &high_bound
))
865 error (_("Could not determine the vector bounds"));
867 val
= allocate_value (type
);
868 for (i
= 0; i
< high_bound
- low_bound
+ 1; i
++)
870 tmp
= value_one (eltype
);
871 memcpy (value_contents_writeable (val
) + i
* TYPE_LENGTH (eltype
),
872 value_contents_all (tmp
), TYPE_LENGTH (eltype
));
877 error (_("Not a numeric type."));
880 /* value_one result is never used for assignments to. */
881 gdb_assert (VALUE_LVAL (val
) == not_lval
);
886 /* Helper function for value_at, value_at_lazy, and value_at_lazy_stack.
887 The type of the created value may differ from the passed type TYPE.
888 Make sure to retrieve the returned values's new type after this call
889 e.g. in case the type is a variable length array. */
891 static struct value
*
892 get_value_at (struct type
*type
, CORE_ADDR addr
, int lazy
)
896 if (TYPE_CODE (check_typedef (type
)) == TYPE_CODE_VOID
)
897 error (_("Attempt to dereference a generic pointer."));
899 val
= value_from_contents_and_address (type
, NULL
, addr
);
902 value_fetch_lazy (val
);
907 /* Return a value with type TYPE located at ADDR.
909 Call value_at only if the data needs to be fetched immediately;
910 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
911 value_at_lazy instead. value_at_lazy simply records the address of
912 the data and sets the lazy-evaluation-required flag. The lazy flag
913 is tested in the value_contents macro, which is used if and when
914 the contents are actually required. The type of the created value
915 may differ from the passed type TYPE. Make sure to retrieve the
916 returned values's new type after this call e.g. in case the type
917 is a variable length array.
919 Note: value_at does *NOT* handle embedded offsets; perform such
920 adjustments before or after calling it. */
923 value_at (struct type
*type
, CORE_ADDR addr
)
925 return get_value_at (type
, addr
, 0);
928 /* Return a lazy value with type TYPE located at ADDR (cf. value_at).
929 The type of the created value may differ from the passed type TYPE.
930 Make sure to retrieve the returned values's new type after this call
931 e.g. in case the type is a variable length array. */
934 value_at_lazy (struct type
*type
, CORE_ADDR addr
)
936 return get_value_at (type
, addr
, 1);
940 read_value_memory (struct value
*val
, LONGEST bit_offset
,
941 int stack
, CORE_ADDR memaddr
,
942 gdb_byte
*buffer
, size_t length
)
944 ULONGEST xfered_total
= 0;
945 struct gdbarch
*arch
= get_value_arch (val
);
946 int unit_size
= gdbarch_addressable_memory_unit_size (arch
);
947 enum target_object object
;
949 object
= stack
? TARGET_OBJECT_STACK_MEMORY
: TARGET_OBJECT_MEMORY
;
951 while (xfered_total
< length
)
953 enum target_xfer_status status
;
954 ULONGEST xfered_partial
;
956 status
= target_xfer_partial (current_top_target (),
958 buffer
+ xfered_total
* unit_size
, NULL
,
959 memaddr
+ xfered_total
,
960 length
- xfered_total
,
963 if (status
== TARGET_XFER_OK
)
965 else if (status
== TARGET_XFER_UNAVAILABLE
)
966 mark_value_bits_unavailable (val
, (xfered_total
* HOST_CHAR_BIT
968 xfered_partial
* HOST_CHAR_BIT
);
969 else if (status
== TARGET_XFER_EOF
)
970 memory_error (TARGET_XFER_E_IO
, memaddr
+ xfered_total
);
972 memory_error (status
, memaddr
+ xfered_total
);
974 xfered_total
+= xfered_partial
;
979 /* Store the contents of FROMVAL into the location of TOVAL.
980 Return a new value with the location of TOVAL and contents of FROMVAL. */
983 value_assign (struct value
*toval
, struct value
*fromval
)
987 struct frame_id old_frame
;
989 if (!deprecated_value_modifiable (toval
))
990 error (_("Left operand of assignment is not a modifiable lvalue."));
992 toval
= coerce_ref (toval
);
994 type
= value_type (toval
);
995 if (VALUE_LVAL (toval
) != lval_internalvar
)
996 fromval
= value_cast (type
, fromval
);
999 /* Coerce arrays and functions to pointers, except for arrays
1000 which only live in GDB's storage. */
1001 if (!value_must_coerce_to_target (fromval
))
1002 fromval
= coerce_array (fromval
);
1005 type
= check_typedef (type
);
1007 /* Since modifying a register can trash the frame chain, and
1008 modifying memory can trash the frame cache, we save the old frame
1009 and then restore the new frame afterwards. */
1010 old_frame
= get_frame_id (deprecated_safe_get_selected_frame ());
1012 switch (VALUE_LVAL (toval
))
1014 case lval_internalvar
:
1015 set_internalvar (VALUE_INTERNALVAR (toval
), fromval
);
1016 return value_of_internalvar (get_type_arch (type
),
1017 VALUE_INTERNALVAR (toval
));
1019 case lval_internalvar_component
:
1021 LONGEST offset
= value_offset (toval
);
1023 /* Are we dealing with a bitfield?
1025 It is important to mention that `value_parent (toval)' is
1026 non-NULL iff `value_bitsize (toval)' is non-zero. */
1027 if (value_bitsize (toval
))
1029 /* VALUE_INTERNALVAR below refers to the parent value, while
1030 the offset is relative to this parent value. */
1031 gdb_assert (value_parent (value_parent (toval
)) == NULL
);
1032 offset
+= value_offset (value_parent (toval
));
1035 set_internalvar_component (VALUE_INTERNALVAR (toval
),
1037 value_bitpos (toval
),
1038 value_bitsize (toval
),
1045 const gdb_byte
*dest_buffer
;
1046 CORE_ADDR changed_addr
;
1048 gdb_byte buffer
[sizeof (LONGEST
)];
1050 if (value_bitsize (toval
))
1052 struct value
*parent
= value_parent (toval
);
1054 changed_addr
= value_address (parent
) + value_offset (toval
);
1055 changed_len
= (value_bitpos (toval
)
1056 + value_bitsize (toval
)
1057 + HOST_CHAR_BIT
- 1)
1060 /* If we can read-modify-write exactly the size of the
1061 containing type (e.g. short or int) then do so. This
1062 is safer for volatile bitfields mapped to hardware
1064 if (changed_len
< TYPE_LENGTH (type
)
1065 && TYPE_LENGTH (type
) <= (int) sizeof (LONGEST
)
1066 && ((LONGEST
) changed_addr
% TYPE_LENGTH (type
)) == 0)
1067 changed_len
= TYPE_LENGTH (type
);
1069 if (changed_len
> (int) sizeof (LONGEST
))
1070 error (_("Can't handle bitfields which "
1071 "don't fit in a %d bit word."),
1072 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
1074 read_memory (changed_addr
, buffer
, changed_len
);
1075 modify_field (type
, buffer
, value_as_long (fromval
),
1076 value_bitpos (toval
), value_bitsize (toval
));
1077 dest_buffer
= buffer
;
1081 changed_addr
= value_address (toval
);
1082 changed_len
= type_length_units (type
);
1083 dest_buffer
= value_contents (fromval
);
1086 write_memory_with_notification (changed_addr
, dest_buffer
, changed_len
);
1092 struct frame_info
*frame
;
1093 struct gdbarch
*gdbarch
;
1096 /* Figure out which frame this is in currently.
1098 We use VALUE_FRAME_ID for obtaining the value's frame id instead of
1099 VALUE_NEXT_FRAME_ID due to requiring a frame which may be passed to
1100 put_frame_register_bytes() below. That function will (eventually)
1101 perform the necessary unwind operation by first obtaining the next
1103 frame
= frame_find_by_id (VALUE_FRAME_ID (toval
));
1105 value_reg
= VALUE_REGNUM (toval
);
1108 error (_("Value being assigned to is no longer active."));
1110 gdbarch
= get_frame_arch (frame
);
1112 if (value_bitsize (toval
))
1114 struct value
*parent
= value_parent (toval
);
1115 LONGEST offset
= value_offset (parent
) + value_offset (toval
);
1117 gdb_byte buffer
[sizeof (LONGEST
)];
1120 changed_len
= (value_bitpos (toval
)
1121 + value_bitsize (toval
)
1122 + HOST_CHAR_BIT
- 1)
1125 if (changed_len
> (int) sizeof (LONGEST
))
1126 error (_("Can't handle bitfields which "
1127 "don't fit in a %d bit word."),
1128 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
1130 if (!get_frame_register_bytes (frame
, value_reg
, offset
,
1131 changed_len
, buffer
,
1135 throw_error (OPTIMIZED_OUT_ERROR
,
1136 _("value has been optimized out"));
1138 throw_error (NOT_AVAILABLE_ERROR
,
1139 _("value is not available"));
1142 modify_field (type
, buffer
, value_as_long (fromval
),
1143 value_bitpos (toval
), value_bitsize (toval
));
1145 put_frame_register_bytes (frame
, value_reg
, offset
,
1146 changed_len
, buffer
);
1150 if (gdbarch_convert_register_p (gdbarch
, VALUE_REGNUM (toval
),
1153 /* If TOVAL is a special machine register requiring
1154 conversion of program values to a special raw
1156 gdbarch_value_to_register (gdbarch
, frame
,
1157 VALUE_REGNUM (toval
), type
,
1158 value_contents (fromval
));
1162 put_frame_register_bytes (frame
, value_reg
,
1163 value_offset (toval
),
1165 value_contents (fromval
));
1169 gdb::observers::register_changed
.notify (frame
, value_reg
);
1175 const struct lval_funcs
*funcs
= value_computed_funcs (toval
);
1177 if (funcs
->write
!= NULL
)
1179 funcs
->write (toval
, fromval
);
1186 error (_("Left operand of assignment is not an lvalue."));
1189 /* Assigning to the stack pointer, frame pointer, and other
1190 (architecture and calling convention specific) registers may
1191 cause the frame cache and regcache to be out of date. Assigning to memory
1192 also can. We just do this on all assignments to registers or
1193 memory, for simplicity's sake; I doubt the slowdown matters. */
1194 switch (VALUE_LVAL (toval
))
1200 gdb::observers::target_changed
.notify (current_top_target ());
1202 /* Having destroyed the frame cache, restore the selected
1205 /* FIXME: cagney/2002-11-02: There has to be a better way of
1206 doing this. Instead of constantly saving/restoring the
1207 frame. Why not create a get_selected_frame() function that,
1208 having saved the selected frame's ID can automatically
1209 re-find the previously selected frame automatically. */
1212 struct frame_info
*fi
= frame_find_by_id (old_frame
);
1223 /* If the field does not entirely fill a LONGEST, then zero the sign
1224 bits. If the field is signed, and is negative, then sign
1226 if ((value_bitsize (toval
) > 0)
1227 && (value_bitsize (toval
) < 8 * (int) sizeof (LONGEST
)))
1229 LONGEST fieldval
= value_as_long (fromval
);
1230 LONGEST valmask
= (((ULONGEST
) 1) << value_bitsize (toval
)) - 1;
1232 fieldval
&= valmask
;
1233 if (!TYPE_UNSIGNED (type
)
1234 && (fieldval
& (valmask
^ (valmask
>> 1))))
1235 fieldval
|= ~valmask
;
1237 fromval
= value_from_longest (type
, fieldval
);
1240 /* The return value is a copy of TOVAL so it shares its location
1241 information, but its contents are updated from FROMVAL. This
1242 implies the returned value is not lazy, even if TOVAL was. */
1243 val
= value_copy (toval
);
1244 set_value_lazy (val
, 0);
1245 memcpy (value_contents_raw (val
), value_contents (fromval
),
1246 TYPE_LENGTH (type
));
1248 /* We copy over the enclosing type and pointed-to offset from FROMVAL
1249 in the case of pointer types. For object types, the enclosing type
1250 and embedded offset must *not* be copied: the target object refered
1251 to by TOVAL retains its original dynamic type after assignment. */
1252 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1254 set_value_enclosing_type (val
, value_enclosing_type (fromval
));
1255 set_value_pointed_to_offset (val
, value_pointed_to_offset (fromval
));
1261 /* Extend a value VAL to COUNT repetitions of its type. */
1264 value_repeat (struct value
*arg1
, int count
)
1268 if (VALUE_LVAL (arg1
) != lval_memory
)
1269 error (_("Only values in memory can be extended with '@'."));
1271 error (_("Invalid number %d of repetitions."), count
);
1273 val
= allocate_repeat_value (value_enclosing_type (arg1
), count
);
1275 VALUE_LVAL (val
) = lval_memory
;
1276 set_value_address (val
, value_address (arg1
));
1278 read_value_memory (val
, 0, value_stack (val
), value_address (val
),
1279 value_contents_all_raw (val
),
1280 type_length_units (value_enclosing_type (val
)));
1286 value_of_variable (struct symbol
*var
, const struct block
*b
)
1288 struct frame_info
*frame
= NULL
;
1290 if (symbol_read_needs_frame (var
))
1291 frame
= get_selected_frame (_("No frame selected."));
1293 return read_var_value (var
, b
, frame
);
1297 address_of_variable (struct symbol
*var
, const struct block
*b
)
1299 struct type
*type
= SYMBOL_TYPE (var
);
1302 /* Evaluate it first; if the result is a memory address, we're fine.
1303 Lazy evaluation pays off here. */
1305 val
= value_of_variable (var
, b
);
1306 type
= value_type (val
);
1308 if ((VALUE_LVAL (val
) == lval_memory
&& value_lazy (val
))
1309 || TYPE_CODE (type
) == TYPE_CODE_FUNC
)
1311 CORE_ADDR addr
= value_address (val
);
1313 return value_from_pointer (lookup_pointer_type (type
), addr
);
1316 /* Not a memory address; check what the problem was. */
1317 switch (VALUE_LVAL (val
))
1321 struct frame_info
*frame
;
1322 const char *regname
;
1324 frame
= frame_find_by_id (VALUE_NEXT_FRAME_ID (val
));
1327 regname
= gdbarch_register_name (get_frame_arch (frame
),
1328 VALUE_REGNUM (val
));
1329 gdb_assert (regname
&& *regname
);
1331 error (_("Address requested for identifier "
1332 "\"%s\" which is in register $%s"),
1333 SYMBOL_PRINT_NAME (var
), regname
);
1338 error (_("Can't take address of \"%s\" which isn't an lvalue."),
1339 SYMBOL_PRINT_NAME (var
));
1346 /* Return one if VAL does not live in target memory, but should in order
1347 to operate on it. Otherwise return zero. */
1350 value_must_coerce_to_target (struct value
*val
)
1352 struct type
*valtype
;
1354 /* The only lval kinds which do not live in target memory. */
1355 if (VALUE_LVAL (val
) != not_lval
1356 && VALUE_LVAL (val
) != lval_internalvar
1357 && VALUE_LVAL (val
) != lval_xcallable
)
1360 valtype
= check_typedef (value_type (val
));
1362 switch (TYPE_CODE (valtype
))
1364 case TYPE_CODE_ARRAY
:
1365 return TYPE_VECTOR (valtype
) ? 0 : 1;
1366 case TYPE_CODE_STRING
:
1373 /* Make sure that VAL lives in target memory if it's supposed to. For
1374 instance, strings are constructed as character arrays in GDB's
1375 storage, and this function copies them to the target. */
1378 value_coerce_to_target (struct value
*val
)
1383 if (!value_must_coerce_to_target (val
))
1386 length
= TYPE_LENGTH (check_typedef (value_type (val
)));
1387 addr
= allocate_space_in_inferior (length
);
1388 write_memory (addr
, value_contents (val
), length
);
1389 return value_at_lazy (value_type (val
), addr
);
1392 /* Given a value which is an array, return a value which is a pointer
1393 to its first element, regardless of whether or not the array has a
1394 nonzero lower bound.
1396 FIXME: A previous comment here indicated that this routine should
1397 be substracting the array's lower bound. It's not clear to me that
1398 this is correct. Given an array subscripting operation, it would
1399 certainly work to do the adjustment here, essentially computing:
1401 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
1403 However I believe a more appropriate and logical place to account
1404 for the lower bound is to do so in value_subscript, essentially
1407 (&array[0] + ((index - lowerbound) * sizeof array[0]))
1409 As further evidence consider what would happen with operations
1410 other than array subscripting, where the caller would get back a
1411 value that had an address somewhere before the actual first element
1412 of the array, and the information about the lower bound would be
1413 lost because of the coercion to pointer type. */
1416 value_coerce_array (struct value
*arg1
)
1418 struct type
*type
= check_typedef (value_type (arg1
));
1420 /* If the user tries to do something requiring a pointer with an
1421 array that has not yet been pushed to the target, then this would
1422 be a good time to do so. */
1423 arg1
= value_coerce_to_target (arg1
);
1425 if (VALUE_LVAL (arg1
) != lval_memory
)
1426 error (_("Attempt to take address of value not located in memory."));
1428 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
1429 value_address (arg1
));
1432 /* Given a value which is a function, return a value which is a pointer
1436 value_coerce_function (struct value
*arg1
)
1438 struct value
*retval
;
1440 if (VALUE_LVAL (arg1
) != lval_memory
)
1441 error (_("Attempt to take address of value not located in memory."));
1443 retval
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1444 value_address (arg1
));
1448 /* Return a pointer value for the object for which ARG1 is the
1452 value_addr (struct value
*arg1
)
1455 struct type
*type
= check_typedef (value_type (arg1
));
1457 if (TYPE_IS_REFERENCE (type
))
1459 if (value_bits_synthetic_pointer (arg1
, value_embedded_offset (arg1
),
1460 TARGET_CHAR_BIT
* TYPE_LENGTH (type
)))
1461 arg1
= coerce_ref (arg1
);
1464 /* Copy the value, but change the type from (T&) to (T*). We
1465 keep the same location information, which is efficient, and
1466 allows &(&X) to get the location containing the reference.
1467 Do the same to its enclosing type for consistency. */
1468 struct type
*type_ptr
1469 = lookup_pointer_type (TYPE_TARGET_TYPE (type
));
1470 struct type
*enclosing_type
1471 = check_typedef (value_enclosing_type (arg1
));
1472 struct type
*enclosing_type_ptr
1473 = lookup_pointer_type (TYPE_TARGET_TYPE (enclosing_type
));
1475 arg2
= value_copy (arg1
);
1476 deprecated_set_value_type (arg2
, type_ptr
);
1477 set_value_enclosing_type (arg2
, enclosing_type_ptr
);
1482 if (TYPE_CODE (type
) == TYPE_CODE_FUNC
)
1483 return value_coerce_function (arg1
);
1485 /* If this is an array that has not yet been pushed to the target,
1486 then this would be a good time to force it to memory. */
1487 arg1
= value_coerce_to_target (arg1
);
1489 if (VALUE_LVAL (arg1
) != lval_memory
)
1490 error (_("Attempt to take address of value not located in memory."));
1492 /* Get target memory address. */
1493 arg2
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1494 (value_address (arg1
)
1495 + value_embedded_offset (arg1
)));
1497 /* This may be a pointer to a base subobject; so remember the
1498 full derived object's type ... */
1499 set_value_enclosing_type (arg2
,
1500 lookup_pointer_type (value_enclosing_type (arg1
)));
1501 /* ... and also the relative position of the subobject in the full
1503 set_value_pointed_to_offset (arg2
, value_embedded_offset (arg1
));
1507 /* Return a reference value for the object for which ARG1 is the
1511 value_ref (struct value
*arg1
, enum type_code refcode
)
1514 struct type
*type
= check_typedef (value_type (arg1
));
1516 gdb_assert (refcode
== TYPE_CODE_REF
|| refcode
== TYPE_CODE_RVALUE_REF
);
1518 if ((TYPE_CODE (type
) == TYPE_CODE_REF
1519 || TYPE_CODE (type
) == TYPE_CODE_RVALUE_REF
)
1520 && TYPE_CODE (type
) == refcode
)
1523 arg2
= value_addr (arg1
);
1524 deprecated_set_value_type (arg2
, lookup_reference_type (type
, refcode
));
1528 /* Given a value of a pointer type, apply the C unary * operator to
1532 value_ind (struct value
*arg1
)
1534 struct type
*base_type
;
1537 arg1
= coerce_array (arg1
);
1539 base_type
= check_typedef (value_type (arg1
));
1541 if (VALUE_LVAL (arg1
) == lval_computed
)
1543 const struct lval_funcs
*funcs
= value_computed_funcs (arg1
);
1545 if (funcs
->indirect
)
1547 struct value
*result
= funcs
->indirect (arg1
);
1554 if (TYPE_CODE (base_type
) == TYPE_CODE_PTR
)
1556 struct type
*enc_type
;
1558 /* We may be pointing to something embedded in a larger object.
1559 Get the real type of the enclosing object. */
1560 enc_type
= check_typedef (value_enclosing_type (arg1
));
1561 enc_type
= TYPE_TARGET_TYPE (enc_type
);
1563 if (TYPE_CODE (check_typedef (enc_type
)) == TYPE_CODE_FUNC
1564 || TYPE_CODE (check_typedef (enc_type
)) == TYPE_CODE_METHOD
)
1565 /* For functions, go through find_function_addr, which knows
1566 how to handle function descriptors. */
1567 arg2
= value_at_lazy (enc_type
,
1568 find_function_addr (arg1
, NULL
));
1570 /* Retrieve the enclosing object pointed to. */
1571 arg2
= value_at_lazy (enc_type
,
1572 (value_as_address (arg1
)
1573 - value_pointed_to_offset (arg1
)));
1575 enc_type
= value_type (arg2
);
1576 return readjust_indirect_value_type (arg2
, enc_type
, base_type
, arg1
);
1579 error (_("Attempt to take contents of a non-pointer value."));
1582 /* Create a value for an array by allocating space in GDB, copying the
1583 data into that space, and then setting up an array value.
1585 The array bounds are set from LOWBOUND and HIGHBOUND, and the array
1586 is populated from the values passed in ELEMVEC.
1588 The element type of the array is inherited from the type of the
1589 first element, and all elements must have the same size (though we
1590 don't currently enforce any restriction on their types). */
1593 value_array (int lowbound
, int highbound
, struct value
**elemvec
)
1597 ULONGEST typelength
;
1599 struct type
*arraytype
;
1601 /* Validate that the bounds are reasonable and that each of the
1602 elements have the same size. */
1604 nelem
= highbound
- lowbound
+ 1;
1607 error (_("bad array bounds (%d, %d)"), lowbound
, highbound
);
1609 typelength
= type_length_units (value_enclosing_type (elemvec
[0]));
1610 for (idx
= 1; idx
< nelem
; idx
++)
1612 if (type_length_units (value_enclosing_type (elemvec
[idx
]))
1615 error (_("array elements must all be the same size"));
1619 arraytype
= lookup_array_range_type (value_enclosing_type (elemvec
[0]),
1620 lowbound
, highbound
);
1622 if (!current_language
->c_style_arrays
)
1624 val
= allocate_value (arraytype
);
1625 for (idx
= 0; idx
< nelem
; idx
++)
1626 value_contents_copy (val
, idx
* typelength
, elemvec
[idx
], 0,
1631 /* Allocate space to store the array, and then initialize it by
1632 copying in each element. */
1634 val
= allocate_value (arraytype
);
1635 for (idx
= 0; idx
< nelem
; idx
++)
1636 value_contents_copy (val
, idx
* typelength
, elemvec
[idx
], 0, typelength
);
1641 value_cstring (const char *ptr
, ssize_t len
, struct type
*char_type
)
1644 int lowbound
= current_language
->string_lower_bound
;
1645 ssize_t highbound
= len
/ TYPE_LENGTH (char_type
);
1646 struct type
*stringtype
1647 = lookup_array_range_type (char_type
, lowbound
, highbound
+ lowbound
- 1);
1649 val
= allocate_value (stringtype
);
1650 memcpy (value_contents_raw (val
), ptr
, len
);
1654 /* Create a value for a string constant by allocating space in the
1655 inferior, copying the data into that space, and returning the
1656 address with type TYPE_CODE_STRING. PTR points to the string
1657 constant data; LEN is number of characters.
1659 Note that string types are like array of char types with a lower
1660 bound of zero and an upper bound of LEN - 1. Also note that the
1661 string may contain embedded null bytes. */
1664 value_string (const char *ptr
, ssize_t len
, struct type
*char_type
)
1667 int lowbound
= current_language
->string_lower_bound
;
1668 ssize_t highbound
= len
/ TYPE_LENGTH (char_type
);
1669 struct type
*stringtype
1670 = lookup_string_range_type (char_type
, lowbound
, highbound
+ lowbound
- 1);
1672 val
= allocate_value (stringtype
);
1673 memcpy (value_contents_raw (val
), ptr
, len
);
1678 /* See if we can pass arguments in T2 to a function which takes
1679 arguments of types T1. T1 is a list of NARGS arguments, and T2 is
1680 a NULL-terminated vector. If some arguments need coercion of some
1681 sort, then the coerced values are written into T2. Return value is
1682 0 if the arguments could be matched, or the position at which they
1685 STATICP is nonzero if the T1 argument list came from a static
1686 member function. T2 will still include the ``this'' pointer, but
1689 For non-static member functions, we ignore the first argument,
1690 which is the type of the instance variable. This is because we
1691 want to handle calls with objects from derived classes. This is
1692 not entirely correct: we should actually check to make sure that a
1693 requested operation is type secure, shouldn't we? FIXME. */
1696 typecmp (int staticp
, int varargs
, int nargs
,
1697 struct field t1
[], struct value
*t2
[])
1702 internal_error (__FILE__
, __LINE__
,
1703 _("typecmp: no argument list"));
1705 /* Skip ``this'' argument if applicable. T2 will always include
1711 (i
< nargs
) && TYPE_CODE (t1
[i
].type
) != TYPE_CODE_VOID
;
1714 struct type
*tt1
, *tt2
;
1719 tt1
= check_typedef (t1
[i
].type
);
1720 tt2
= check_typedef (value_type (t2
[i
]));
1722 if (TYPE_IS_REFERENCE (tt1
)
1723 /* We should be doing hairy argument matching, as below. */
1724 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1
)))
1725 == TYPE_CODE (tt2
)))
1727 if (TYPE_CODE (tt2
) == TYPE_CODE_ARRAY
)
1728 t2
[i
] = value_coerce_array (t2
[i
]);
1730 t2
[i
] = value_ref (t2
[i
], TYPE_CODE (tt1
));
1734 /* djb - 20000715 - Until the new type structure is in the
1735 place, and we can attempt things like implicit conversions,
1736 we need to do this so you can take something like a map<const
1737 char *>, and properly access map["hello"], because the
1738 argument to [] will be a reference to a pointer to a char,
1739 and the argument will be a pointer to a char. */
1740 while (TYPE_IS_REFERENCE (tt1
) || TYPE_CODE (tt1
) == TYPE_CODE_PTR
)
1742 tt1
= check_typedef( TYPE_TARGET_TYPE(tt1
) );
1744 while (TYPE_CODE(tt2
) == TYPE_CODE_ARRAY
1745 || TYPE_CODE(tt2
) == TYPE_CODE_PTR
1746 || TYPE_IS_REFERENCE (tt2
))
1748 tt2
= check_typedef (TYPE_TARGET_TYPE(tt2
));
1750 if (TYPE_CODE (tt1
) == TYPE_CODE (tt2
))
1752 /* Array to pointer is a `trivial conversion' according to the
1755 /* We should be doing much hairier argument matching (see
1756 section 13.2 of the ARM), but as a quick kludge, just check
1757 for the same type code. */
1758 if (TYPE_CODE (t1
[i
].type
) != TYPE_CODE (value_type (t2
[i
])))
1761 if (varargs
|| t2
[i
] == NULL
)
1766 /* Helper class for do_search_struct_field that updates *RESULT_PTR
1767 and *LAST_BOFFSET, and possibly throws an exception if the field
1768 search has yielded ambiguous results. */
1771 update_search_result (struct value
**result_ptr
, struct value
*v
,
1772 LONGEST
*last_boffset
, LONGEST boffset
,
1773 const char *name
, struct type
*type
)
1777 if (*result_ptr
!= NULL
1778 /* The result is not ambiguous if all the classes that are
1779 found occupy the same space. */
1780 && *last_boffset
!= boffset
)
1781 error (_("base class '%s' is ambiguous in type '%s'"),
1782 name
, TYPE_SAFE_NAME (type
));
1784 *last_boffset
= boffset
;
1788 /* A helper for search_struct_field. This does all the work; most
1789 arguments are as passed to search_struct_field. The result is
1790 stored in *RESULT_PTR, which must be initialized to NULL.
1791 OUTERMOST_TYPE is the type of the initial type passed to
1792 search_struct_field; this is used for error reporting when the
1793 lookup is ambiguous. */
1796 do_search_struct_field (const char *name
, struct value
*arg1
, LONGEST offset
,
1797 struct type
*type
, int looking_for_baseclass
,
1798 struct value
**result_ptr
,
1799 LONGEST
*last_boffset
,
1800 struct type
*outermost_type
)
1805 type
= check_typedef (type
);
1806 nbases
= TYPE_N_BASECLASSES (type
);
1808 if (!looking_for_baseclass
)
1809 for (i
= TYPE_NFIELDS (type
) - 1; i
>= nbases
; i
--)
1811 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
1813 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1817 if (field_is_static (&TYPE_FIELD (type
, i
)))
1818 v
= value_static_field (type
, i
);
1820 v
= value_primitive_field (arg1
, offset
, i
, type
);
1826 && t_field_name
[0] == '\0')
1828 struct type
*field_type
= TYPE_FIELD_TYPE (type
, i
);
1830 if (TYPE_CODE (field_type
) == TYPE_CODE_UNION
1831 || TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
)
1833 /* Look for a match through the fields of an anonymous
1834 union, or anonymous struct. C++ provides anonymous
1837 In the GNU Chill (now deleted from GDB)
1838 implementation of variant record types, each
1839 <alternative field> has an (anonymous) union type,
1840 each member of the union represents a <variant
1841 alternative>. Each <variant alternative> is
1842 represented as a struct, with a member for each
1845 struct value
*v
= NULL
;
1846 LONGEST new_offset
= offset
;
1848 /* This is pretty gross. In G++, the offset in an
1849 anonymous union is relative to the beginning of the
1850 enclosing struct. In the GNU Chill (now deleted
1851 from GDB) implementation of variant records, the
1852 bitpos is zero in an anonymous union field, so we
1853 have to add the offset of the union here. */
1854 if (TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
1855 || (TYPE_NFIELDS (field_type
) > 0
1856 && TYPE_FIELD_BITPOS (field_type
, 0) == 0))
1857 new_offset
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
1859 do_search_struct_field (name
, arg1
, new_offset
,
1861 looking_for_baseclass
, &v
,
1873 for (i
= 0; i
< nbases
; i
++)
1875 struct value
*v
= NULL
;
1876 struct type
*basetype
= check_typedef (TYPE_BASECLASS (type
, i
));
1877 /* If we are looking for baseclasses, this is what we get when
1878 we hit them. But it could happen that the base part's member
1879 name is not yet filled in. */
1880 int found_baseclass
= (looking_for_baseclass
1881 && TYPE_BASECLASS_NAME (type
, i
) != NULL
1882 && (strcmp_iw (name
,
1883 TYPE_BASECLASS_NAME (type
,
1885 LONGEST boffset
= value_embedded_offset (arg1
) + offset
;
1887 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1891 boffset
= baseclass_offset (type
, i
,
1892 value_contents_for_printing (arg1
),
1893 value_embedded_offset (arg1
) + offset
,
1894 value_address (arg1
),
1897 /* The virtual base class pointer might have been clobbered
1898 by the user program. Make sure that it still points to a
1899 valid memory location. */
1901 boffset
+= value_embedded_offset (arg1
) + offset
;
1903 || boffset
>= TYPE_LENGTH (value_enclosing_type (arg1
)))
1905 CORE_ADDR base_addr
;
1907 base_addr
= value_address (arg1
) + boffset
;
1908 v2
= value_at_lazy (basetype
, base_addr
);
1909 if (target_read_memory (base_addr
,
1910 value_contents_raw (v2
),
1911 TYPE_LENGTH (value_type (v2
))) != 0)
1912 error (_("virtual baseclass botch"));
1916 v2
= value_copy (arg1
);
1917 deprecated_set_value_type (v2
, basetype
);
1918 set_value_embedded_offset (v2
, boffset
);
1921 if (found_baseclass
)
1925 do_search_struct_field (name
, v2
, 0,
1926 TYPE_BASECLASS (type
, i
),
1927 looking_for_baseclass
,
1928 result_ptr
, last_boffset
,
1932 else if (found_baseclass
)
1933 v
= value_primitive_field (arg1
, offset
, i
, type
);
1936 do_search_struct_field (name
, arg1
,
1937 offset
+ TYPE_BASECLASS_BITPOS (type
,
1939 basetype
, looking_for_baseclass
,
1940 result_ptr
, last_boffset
,
1944 update_search_result (result_ptr
, v
, last_boffset
,
1945 boffset
, name
, outermost_type
);
1949 /* Helper function used by value_struct_elt to recurse through
1950 baseclasses. Look for a field NAME in ARG1. Search in it assuming
1951 it has (class) type TYPE. If found, return value, else return NULL.
1953 If LOOKING_FOR_BASECLASS, then instead of looking for struct
1954 fields, look for a baseclass named NAME. */
1956 static struct value
*
1957 search_struct_field (const char *name
, struct value
*arg1
,
1958 struct type
*type
, int looking_for_baseclass
)
1960 struct value
*result
= NULL
;
1961 LONGEST boffset
= 0;
1963 do_search_struct_field (name
, arg1
, 0, type
, looking_for_baseclass
,
1964 &result
, &boffset
, type
);
1968 /* Helper function used by value_struct_elt to recurse through
1969 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1970 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1973 If found, return value, else if name matched and args not return
1974 (value) -1, else return NULL. */
1976 static struct value
*
1977 search_struct_method (const char *name
, struct value
**arg1p
,
1978 struct value
**args
, LONGEST offset
,
1979 int *static_memfuncp
, struct type
*type
)
1983 int name_matched
= 0;
1985 type
= check_typedef (type
);
1986 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
1988 const char *t_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
1990 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1992 int j
= TYPE_FN_FIELDLIST_LENGTH (type
, i
) - 1;
1993 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
1996 check_stub_method_group (type
, i
);
1997 if (j
> 0 && args
== 0)
1998 error (_("cannot resolve overloaded method "
1999 "`%s': no arguments supplied"), name
);
2000 else if (j
== 0 && args
== 0)
2002 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
2009 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f
, j
),
2010 TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f
, j
)),
2011 TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f
, j
)),
2012 TYPE_FN_FIELD_ARGS (f
, j
), args
))
2014 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
2015 return value_virtual_fn_field (arg1p
, f
, j
,
2017 if (TYPE_FN_FIELD_STATIC_P (f
, j
)
2019 *static_memfuncp
= 1;
2020 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
2029 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2031 LONGEST base_offset
;
2032 LONGEST this_offset
;
2034 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2036 struct type
*baseclass
= check_typedef (TYPE_BASECLASS (type
, i
));
2037 struct value
*base_val
;
2038 const gdb_byte
*base_valaddr
;
2040 /* The virtual base class pointer might have been
2041 clobbered by the user program. Make sure that it
2042 still points to a valid memory location. */
2044 if (offset
< 0 || offset
>= TYPE_LENGTH (type
))
2048 gdb::byte_vector
tmp (TYPE_LENGTH (baseclass
));
2049 address
= value_address (*arg1p
);
2051 if (target_read_memory (address
+ offset
,
2052 tmp
.data (), TYPE_LENGTH (baseclass
)) != 0)
2053 error (_("virtual baseclass botch"));
2055 base_val
= value_from_contents_and_address (baseclass
,
2058 base_valaddr
= value_contents_for_printing (base_val
);
2064 base_valaddr
= value_contents_for_printing (*arg1p
);
2065 this_offset
= offset
;
2068 base_offset
= baseclass_offset (type
, i
, base_valaddr
,
2069 this_offset
, value_address (base_val
),
2074 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2076 v
= search_struct_method (name
, arg1p
, args
, base_offset
+ offset
,
2077 static_memfuncp
, TYPE_BASECLASS (type
, i
));
2078 if (v
== (struct value
*) - 1)
2084 /* FIXME-bothner: Why is this commented out? Why is it here? */
2085 /* *arg1p = arg1_tmp; */
2090 return (struct value
*) - 1;
2095 /* Given *ARGP, a value of type (pointer to a)* structure/union,
2096 extract the component named NAME from the ultimate target
2097 structure/union and return it as a value with its appropriate type.
2098 ERR is used in the error message if *ARGP's type is wrong.
2100 C++: ARGS is a list of argument types to aid in the selection of
2101 an appropriate method. Also, handle derived types.
2103 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
2104 where the truthvalue of whether the function that was resolved was
2105 a static member function or not is stored.
2107 ERR is an error message to be printed in case the field is not
2111 value_struct_elt (struct value
**argp
, struct value
**args
,
2112 const char *name
, int *static_memfuncp
, const char *err
)
2117 *argp
= coerce_array (*argp
);
2119 t
= check_typedef (value_type (*argp
));
2121 /* Follow pointers until we get to a non-pointer. */
2123 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_IS_REFERENCE (t
))
2125 *argp
= value_ind (*argp
);
2126 /* Don't coerce fn pointer to fn and then back again! */
2127 if (TYPE_CODE (check_typedef (value_type (*argp
))) != TYPE_CODE_FUNC
)
2128 *argp
= coerce_array (*argp
);
2129 t
= check_typedef (value_type (*argp
));
2132 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2133 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2134 error (_("Attempt to extract a component of a value that is not a %s."),
2137 /* Assume it's not, unless we see that it is. */
2138 if (static_memfuncp
)
2139 *static_memfuncp
= 0;
2143 /* if there are no arguments ...do this... */
2145 /* Try as a field first, because if we succeed, there is less
2147 v
= search_struct_field (name
, *argp
, t
, 0);
2151 /* C++: If it was not found as a data field, then try to
2152 return it as a pointer to a method. */
2153 v
= search_struct_method (name
, argp
, args
, 0,
2154 static_memfuncp
, t
);
2156 if (v
== (struct value
*) - 1)
2157 error (_("Cannot take address of method %s."), name
);
2160 if (TYPE_NFN_FIELDS (t
))
2161 error (_("There is no member or method named %s."), name
);
2163 error (_("There is no member named %s."), name
);
2168 v
= search_struct_method (name
, argp
, args
, 0,
2169 static_memfuncp
, t
);
2171 if (v
== (struct value
*) - 1)
2173 error (_("One of the arguments you tried to pass to %s could not "
2174 "be converted to what the function wants."), name
);
2178 /* See if user tried to invoke data as function. If so, hand it
2179 back. If it's not callable (i.e., a pointer to function),
2180 gdb should give an error. */
2181 v
= search_struct_field (name
, *argp
, t
, 0);
2182 /* If we found an ordinary field, then it is not a method call.
2183 So, treat it as if it were a static member function. */
2184 if (v
&& static_memfuncp
)
2185 *static_memfuncp
= 1;
2189 throw_error (NOT_FOUND_ERROR
,
2190 _("Structure has no component named %s."), name
);
2194 /* Given *ARGP, a value of type structure or union, or a pointer/reference
2195 to a structure or union, extract and return its component (field) of
2196 type FTYPE at the specified BITPOS.
2197 Throw an exception on error. */
2200 value_struct_elt_bitpos (struct value
**argp
, int bitpos
, struct type
*ftype
,
2206 *argp
= coerce_array (*argp
);
2208 t
= check_typedef (value_type (*argp
));
2210 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_IS_REFERENCE (t
))
2212 *argp
= value_ind (*argp
);
2213 if (TYPE_CODE (check_typedef (value_type (*argp
))) != TYPE_CODE_FUNC
)
2214 *argp
= coerce_array (*argp
);
2215 t
= check_typedef (value_type (*argp
));
2218 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2219 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2220 error (_("Attempt to extract a component of a value that is not a %s."),
2223 for (i
= TYPE_N_BASECLASSES (t
); i
< TYPE_NFIELDS (t
); i
++)
2225 if (!field_is_static (&TYPE_FIELD (t
, i
))
2226 && bitpos
== TYPE_FIELD_BITPOS (t
, i
)
2227 && types_equal (ftype
, TYPE_FIELD_TYPE (t
, i
)))
2228 return value_primitive_field (*argp
, 0, i
, t
);
2231 error (_("No field with matching bitpos and type."));
2240 value_union_variant (struct type
*union_type
, const gdb_byte
*contents
)
2242 gdb_assert (TYPE_CODE (union_type
) == TYPE_CODE_UNION
2243 && TYPE_FLAG_DISCRIMINATED_UNION (union_type
));
2245 struct dynamic_prop
*discriminant_prop
2246 = get_dyn_prop (DYN_PROP_DISCRIMINATED
, union_type
);
2247 gdb_assert (discriminant_prop
!= nullptr);
2249 struct discriminant_info
*info
2250 = (struct discriminant_info
*) discriminant_prop
->data
.baton
;
2251 gdb_assert (info
!= nullptr);
2253 /* If this is a univariant union, just return the sole field. */
2254 if (TYPE_NFIELDS (union_type
) == 1)
2256 /* This should only happen for univariants, which we already dealt
2258 gdb_assert (info
->discriminant_index
!= -1);
2260 /* Compute the discriminant. Note that unpack_field_as_long handles
2261 sign extension when necessary, as does the DWARF reader -- so
2262 signed discriminants will be handled correctly despite the use of
2263 an unsigned type here. */
2264 ULONGEST discriminant
= unpack_field_as_long (union_type
, contents
,
2265 info
->discriminant_index
);
2267 for (int i
= 0; i
< TYPE_NFIELDS (union_type
); ++i
)
2269 if (i
!= info
->default_index
2270 && i
!= info
->discriminant_index
2271 && discriminant
== info
->discriminants
[i
])
2275 if (info
->default_index
== -1)
2276 error (_("Could not find variant corresponding to discriminant %s"),
2277 pulongest (discriminant
));
2278 return info
->default_index
;
2281 /* Search through the methods of an object (and its bases) to find a
2282 specified method. Return a reference to the fn_field list METHODS of
2283 overloaded instances defined in the source language. If available
2284 and matching, a vector of matching xmethods defined in extension
2285 languages are also returned in XMETHODS.
2287 Helper function for value_find_oload_list.
2288 ARGP is a pointer to a pointer to a value (the object).
2289 METHOD is a string containing the method name.
2290 OFFSET is the offset within the value.
2291 TYPE is the assumed type of the object.
2292 METHODS is a pointer to the matching overloaded instances defined
2293 in the source language. Since this is a recursive function,
2294 *METHODS should be set to NULL when calling this function.
2295 NUM_FNS is the number of overloaded instances. *NUM_FNS should be set to
2296 0 when calling this function.
2297 XMETHODS is the vector of matching xmethod workers. *XMETHODS
2298 should also be set to NULL when calling this function.
2299 BASETYPE is set to the actual type of the subobject where the
2301 BOFFSET is the offset of the base subobject where the method is found. */
2304 find_method_list (struct value
**argp
, const char *method
,
2305 LONGEST offset
, struct type
*type
,
2306 gdb::array_view
<fn_field
> *methods
,
2307 std::vector
<xmethod_worker_up
> *xmethods
,
2308 struct type
**basetype
, LONGEST
*boffset
)
2311 struct fn_field
*f
= NULL
;
2313 gdb_assert (methods
!= NULL
&& xmethods
!= NULL
);
2314 type
= check_typedef (type
);
2316 /* First check in object itself.
2317 This function is called recursively to search through base classes.
2318 If there is a source method match found at some stage, then we need not
2319 look for source methods in consequent recursive calls. */
2320 if (methods
->empty ())
2322 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
2324 /* pai: FIXME What about operators and type conversions? */
2325 const char *fn_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
2327 if (fn_field_name
&& (strcmp_iw (fn_field_name
, method
) == 0))
2329 int len
= TYPE_FN_FIELDLIST_LENGTH (type
, i
);
2330 f
= TYPE_FN_FIELDLIST1 (type
, i
);
2331 *methods
= gdb::make_array_view (f
, len
);
2336 /* Resolve any stub methods. */
2337 check_stub_method_group (type
, i
);
2344 /* Unlike source methods, xmethods can be accumulated over successive
2345 recursive calls. In other words, an xmethod named 'm' in a class
2346 will not hide an xmethod named 'm' in its base class(es). We want
2347 it to be this way because xmethods are after all convenience functions
2348 and hence there is no point restricting them with something like method
2349 hiding. Moreover, if hiding is done for xmethods as well, then we will
2350 have to provide a mechanism to un-hide (like the 'using' construct). */
2351 get_matching_xmethod_workers (type
, method
, xmethods
);
2353 /* If source methods are not found in current class, look for them in the
2354 base classes. We also have to go through the base classes to gather
2355 extension methods. */
2356 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2358 LONGEST base_offset
;
2360 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2362 base_offset
= baseclass_offset (type
, i
,
2363 value_contents_for_printing (*argp
),
2364 value_offset (*argp
) + offset
,
2365 value_address (*argp
), *argp
);
2367 else /* Non-virtual base, simply use bit position from debug
2370 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2373 find_method_list (argp
, method
, base_offset
+ offset
,
2374 TYPE_BASECLASS (type
, i
), methods
,
2375 xmethods
, basetype
, boffset
);
2379 /* Return the list of overloaded methods of a specified name. The methods
2380 could be those GDB finds in the binary, or xmethod. Methods found in
2381 the binary are returned in METHODS, and xmethods are returned in
2384 ARGP is a pointer to a pointer to a value (the object).
2385 METHOD is the method name.
2386 OFFSET is the offset within the value contents.
2387 METHODS is the list of matching overloaded instances defined in
2388 the source language.
2389 XMETHODS is the vector of matching xmethod workers defined in
2390 extension languages.
2391 BASETYPE is set to the type of the base subobject that defines the
2393 BOFFSET is the offset of the base subobject which defines the method. */
2396 value_find_oload_method_list (struct value
**argp
, const char *method
,
2398 gdb::array_view
<fn_field
> *methods
,
2399 std::vector
<xmethod_worker_up
> *xmethods
,
2400 struct type
**basetype
, LONGEST
*boffset
)
2404 t
= check_typedef (value_type (*argp
));
2406 /* Code snarfed from value_struct_elt. */
2407 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_IS_REFERENCE (t
))
2409 *argp
= value_ind (*argp
);
2410 /* Don't coerce fn pointer to fn and then back again! */
2411 if (TYPE_CODE (check_typedef (value_type (*argp
))) != TYPE_CODE_FUNC
)
2412 *argp
= coerce_array (*argp
);
2413 t
= check_typedef (value_type (*argp
));
2416 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2417 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2418 error (_("Attempt to extract a component of a "
2419 "value that is not a struct or union"));
2421 gdb_assert (methods
!= NULL
&& xmethods
!= NULL
);
2423 /* Clear the lists. */
2427 find_method_list (argp
, method
, 0, t
, methods
, xmethods
,
2431 /* Given an array of arguments (ARGS) (which includes an entry for
2432 "this" in the case of C++ methods), the NAME of a function, and
2433 whether it's a method or not (METHOD), find the best function that
2434 matches on the argument types according to the overload resolution
2437 METHOD can be one of three values:
2438 NON_METHOD for non-member functions.
2439 METHOD: for member functions.
2440 BOTH: used for overload resolution of operators where the
2441 candidates are expected to be either member or non member
2442 functions. In this case the first argument ARGTYPES
2443 (representing 'this') is expected to be a reference to the
2444 target object, and will be dereferenced when attempting the
2447 In the case of class methods, the parameter OBJ is an object value
2448 in which to search for overloaded methods.
2450 In the case of non-method functions, the parameter FSYM is a symbol
2451 corresponding to one of the overloaded functions.
2453 Return value is an integer: 0 -> good match, 10 -> debugger applied
2454 non-standard coercions, 100 -> incompatible.
2456 If a method is being searched for, VALP will hold the value.
2457 If a non-method is being searched for, SYMP will hold the symbol
2460 If a method is being searched for, and it is a static method,
2461 then STATICP will point to a non-zero value.
2463 If NO_ADL argument dependent lookup is disabled. This is used to prevent
2464 ADL overload candidates when performing overload resolution for a fully
2467 If NOSIDE is EVAL_AVOID_SIDE_EFFECTS, then OBJP's memory cannot be
2468 read while picking the best overload match (it may be all zeroes and thus
2469 not have a vtable pointer), in which case skip virtual function lookup.
2470 This is ok as typically EVAL_AVOID_SIDE_EFFECTS is only used to determine
2473 Note: This function does *not* check the value of
2474 overload_resolution. Caller must check it to see whether overload
2475 resolution is permitted. */
2478 find_overload_match (gdb::array_view
<value
*> args
,
2479 const char *name
, enum oload_search_type method
,
2480 struct value
**objp
, struct symbol
*fsym
,
2481 struct value
**valp
, struct symbol
**symp
,
2482 int *staticp
, const int no_adl
,
2483 const enum noside noside
)
2485 struct value
*obj
= (objp
? *objp
: NULL
);
2486 struct type
*obj_type
= obj
? value_type (obj
) : NULL
;
2487 /* Index of best overloaded function. */
2488 int func_oload_champ
= -1;
2489 int method_oload_champ
= -1;
2490 int src_method_oload_champ
= -1;
2491 int ext_method_oload_champ
= -1;
2493 /* The measure for the current best match. */
2494 badness_vector method_badness
;
2495 badness_vector func_badness
;
2496 badness_vector ext_method_badness
;
2497 badness_vector src_method_badness
;
2499 struct value
*temp
= obj
;
2500 /* For methods, the list of overloaded methods. */
2501 gdb::array_view
<fn_field
> methods
;
2502 /* For non-methods, the list of overloaded function symbols. */
2503 std::vector
<symbol
*> functions
;
2504 /* For xmethods, the vector of xmethod workers. */
2505 std::vector
<xmethod_worker_up
> xmethods
;
2506 struct type
*basetype
= NULL
;
2509 const char *obj_type_name
= NULL
;
2510 const char *func_name
= NULL
;
2511 gdb::unique_xmalloc_ptr
<char> temp_func
;
2512 enum oload_classification match_quality
;
2513 enum oload_classification method_match_quality
= INCOMPATIBLE
;
2514 enum oload_classification src_method_match_quality
= INCOMPATIBLE
;
2515 enum oload_classification ext_method_match_quality
= INCOMPATIBLE
;
2516 enum oload_classification func_match_quality
= INCOMPATIBLE
;
2518 /* Get the list of overloaded methods or functions. */
2519 if (method
== METHOD
|| method
== BOTH
)
2523 /* OBJ may be a pointer value rather than the object itself. */
2524 obj
= coerce_ref (obj
);
2525 while (TYPE_CODE (check_typedef (value_type (obj
))) == TYPE_CODE_PTR
)
2526 obj
= coerce_ref (value_ind (obj
));
2527 obj_type_name
= TYPE_NAME (value_type (obj
));
2529 /* First check whether this is a data member, e.g. a pointer to
2531 if (TYPE_CODE (check_typedef (value_type (obj
))) == TYPE_CODE_STRUCT
)
2533 *valp
= search_struct_field (name
, obj
,
2534 check_typedef (value_type (obj
)), 0);
2542 /* Retrieve the list of methods with the name NAME. */
2543 value_find_oload_method_list (&temp
, name
, 0, &methods
,
2544 &xmethods
, &basetype
, &boffset
);
2545 /* If this is a method only search, and no methods were found
2546 the search has failed. */
2547 if (method
== METHOD
&& methods
.empty () && xmethods
.empty ())
2548 error (_("Couldn't find method %s%s%s"),
2550 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2552 /* If we are dealing with stub method types, they should have
2553 been resolved by find_method_list via
2554 value_find_oload_method_list above. */
2555 if (!methods
.empty ())
2557 gdb_assert (TYPE_SELF_TYPE (methods
[0].type
) != NULL
);
2559 src_method_oload_champ
2560 = find_oload_champ (args
,
2562 methods
.data (), NULL
, NULL
,
2563 &src_method_badness
);
2565 src_method_match_quality
= classify_oload_match
2566 (src_method_badness
, args
.size (),
2567 oload_method_static_p (methods
.data (), src_method_oload_champ
));
2570 if (!xmethods
.empty ())
2572 ext_method_oload_champ
2573 = find_oload_champ (args
,
2575 NULL
, xmethods
.data (), NULL
,
2576 &ext_method_badness
);
2577 ext_method_match_quality
= classify_oload_match (ext_method_badness
,
2581 if (src_method_oload_champ
>= 0 && ext_method_oload_champ
>= 0)
2583 switch (compare_badness (ext_method_badness
, src_method_badness
))
2585 case 0: /* Src method and xmethod are equally good. */
2586 /* If src method and xmethod are equally good, then
2587 xmethod should be the winner. Hence, fall through to the
2588 case where a xmethod is better than the source
2589 method, except when the xmethod match quality is
2592 case 1: /* Src method and ext method are incompatible. */
2593 /* If ext method match is not standard, then let source method
2594 win. Otherwise, fallthrough to let xmethod win. */
2595 if (ext_method_match_quality
!= STANDARD
)
2597 method_oload_champ
= src_method_oload_champ
;
2598 method_badness
= src_method_badness
;
2599 ext_method_oload_champ
= -1;
2600 method_match_quality
= src_method_match_quality
;
2604 case 2: /* Ext method is champion. */
2605 method_oload_champ
= ext_method_oload_champ
;
2606 method_badness
= ext_method_badness
;
2607 src_method_oload_champ
= -1;
2608 method_match_quality
= ext_method_match_quality
;
2610 case 3: /* Src method is champion. */
2611 method_oload_champ
= src_method_oload_champ
;
2612 method_badness
= src_method_badness
;
2613 ext_method_oload_champ
= -1;
2614 method_match_quality
= src_method_match_quality
;
2617 gdb_assert_not_reached ("Unexpected overload comparison "
2622 else if (src_method_oload_champ
>= 0)
2624 method_oload_champ
= src_method_oload_champ
;
2625 method_badness
= src_method_badness
;
2626 method_match_quality
= src_method_match_quality
;
2628 else if (ext_method_oload_champ
>= 0)
2630 method_oload_champ
= ext_method_oload_champ
;
2631 method_badness
= ext_method_badness
;
2632 method_match_quality
= ext_method_match_quality
;
2636 if (method
== NON_METHOD
|| method
== BOTH
)
2638 const char *qualified_name
= NULL
;
2640 /* If the overload match is being search for both as a method
2641 and non member function, the first argument must now be
2644 args
[0] = value_ind (args
[0]);
2648 qualified_name
= SYMBOL_NATURAL_NAME (fsym
);
2650 /* If we have a function with a C++ name, try to extract just
2651 the function part. Do not try this for non-functions (e.g.
2652 function pointers). */
2654 && TYPE_CODE (check_typedef (SYMBOL_TYPE (fsym
)))
2657 temp_func
= cp_func_name (qualified_name
);
2659 /* If cp_func_name did not remove anything, the name of the
2660 symbol did not include scope or argument types - it was
2661 probably a C-style function. */
2662 if (temp_func
!= nullptr)
2664 if (strcmp (temp_func
.get (), qualified_name
) == 0)
2667 func_name
= temp_func
.get ();
2674 qualified_name
= name
;
2677 /* If there was no C++ name, this must be a C-style function or
2678 not a function at all. Just return the same symbol. Do the
2679 same if cp_func_name fails for some reason. */
2680 if (func_name
== NULL
)
2686 func_oload_champ
= find_oload_champ_namespace (args
,
2693 if (func_oload_champ
>= 0)
2694 func_match_quality
= classify_oload_match (func_badness
,
2698 /* Did we find a match ? */
2699 if (method_oload_champ
== -1 && func_oload_champ
== -1)
2700 throw_error (NOT_FOUND_ERROR
,
2701 _("No symbol \"%s\" in current context."),
2704 /* If we have found both a method match and a function
2705 match, find out which one is better, and calculate match
2707 if (method_oload_champ
>= 0 && func_oload_champ
>= 0)
2709 switch (compare_badness (func_badness
, method_badness
))
2711 case 0: /* Top two contenders are equally good. */
2712 /* FIXME: GDB does not support the general ambiguous case.
2713 All candidates should be collected and presented the
2715 error (_("Ambiguous overload resolution"));
2717 case 1: /* Incomparable top contenders. */
2718 /* This is an error incompatible candidates
2719 should not have been proposed. */
2720 error (_("Internal error: incompatible "
2721 "overload candidates proposed"));
2723 case 2: /* Function champion. */
2724 method_oload_champ
= -1;
2725 match_quality
= func_match_quality
;
2727 case 3: /* Method champion. */
2728 func_oload_champ
= -1;
2729 match_quality
= method_match_quality
;
2732 error (_("Internal error: unexpected overload comparison result"));
2738 /* We have either a method match or a function match. */
2739 if (method_oload_champ
>= 0)
2740 match_quality
= method_match_quality
;
2742 match_quality
= func_match_quality
;
2745 if (match_quality
== INCOMPATIBLE
)
2747 if (method
== METHOD
)
2748 error (_("Cannot resolve method %s%s%s to any overloaded instance"),
2750 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2753 error (_("Cannot resolve function %s to any overloaded instance"),
2756 else if (match_quality
== NON_STANDARD
)
2758 if (method
== METHOD
)
2759 warning (_("Using non-standard conversion to match "
2760 "method %s%s%s to supplied arguments"),
2762 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2765 warning (_("Using non-standard conversion to match "
2766 "function %s to supplied arguments"),
2770 if (staticp
!= NULL
)
2771 *staticp
= oload_method_static_p (methods
.data (), method_oload_champ
);
2773 if (method_oload_champ
>= 0)
2775 if (src_method_oload_champ
>= 0)
2777 if (TYPE_FN_FIELD_VIRTUAL_P (methods
, method_oload_champ
)
2778 && noside
!= EVAL_AVOID_SIDE_EFFECTS
)
2780 *valp
= value_virtual_fn_field (&temp
, methods
.data (),
2781 method_oload_champ
, basetype
,
2785 *valp
= value_fn_field (&temp
, methods
.data (),
2786 method_oload_champ
, basetype
, boffset
);
2789 *valp
= value_from_xmethod
2790 (std::move (xmethods
[ext_method_oload_champ
]));
2793 *symp
= functions
[func_oload_champ
];
2797 struct type
*temp_type
= check_typedef (value_type (temp
));
2798 struct type
*objtype
= check_typedef (obj_type
);
2800 if (TYPE_CODE (temp_type
) != TYPE_CODE_PTR
2801 && (TYPE_CODE (objtype
) == TYPE_CODE_PTR
2802 || TYPE_IS_REFERENCE (objtype
)))
2804 temp
= value_addr (temp
);
2809 switch (match_quality
)
2815 default: /* STANDARD */
2820 /* Find the best overload match, searching for FUNC_NAME in namespaces
2821 contained in QUALIFIED_NAME until it either finds a good match or
2822 runs out of namespaces. It stores the overloaded functions in
2823 *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. If NO_ADL,
2824 argument dependent lookup is not performned. */
2827 find_oload_champ_namespace (gdb::array_view
<value
*> args
,
2828 const char *func_name
,
2829 const char *qualified_name
,
2830 std::vector
<symbol
*> *oload_syms
,
2831 badness_vector
*oload_champ_bv
,
2836 find_oload_champ_namespace_loop (args
,
2839 oload_syms
, oload_champ_bv
,
2846 /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is
2847 how deep we've looked for namespaces, and the champ is stored in
2848 OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0
2849 if it isn't. Other arguments are the same as in
2850 find_oload_champ_namespace. */
2853 find_oload_champ_namespace_loop (gdb::array_view
<value
*> args
,
2854 const char *func_name
,
2855 const char *qualified_name
,
2857 std::vector
<symbol
*> *oload_syms
,
2858 badness_vector
*oload_champ_bv
,
2862 int next_namespace_len
= namespace_len
;
2863 int searched_deeper
= 0;
2864 int new_oload_champ
;
2865 char *new_namespace
;
2867 if (next_namespace_len
!= 0)
2869 gdb_assert (qualified_name
[next_namespace_len
] == ':');
2870 next_namespace_len
+= 2;
2872 next_namespace_len
+=
2873 cp_find_first_component (qualified_name
+ next_namespace_len
);
2875 /* First, see if we have a deeper namespace we can search in.
2876 If we get a good match there, use it. */
2878 if (qualified_name
[next_namespace_len
] == ':')
2880 searched_deeper
= 1;
2882 if (find_oload_champ_namespace_loop (args
,
2883 func_name
, qualified_name
,
2885 oload_syms
, oload_champ_bv
,
2886 oload_champ
, no_adl
))
2892 /* If we reach here, either we're in the deepest namespace or we
2893 didn't find a good match in a deeper namespace. But, in the
2894 latter case, we still have a bad match in a deeper namespace;
2895 note that we might not find any match at all in the current
2896 namespace. (There's always a match in the deepest namespace,
2897 because this overload mechanism only gets called if there's a
2898 function symbol to start off with.) */
2900 new_namespace
= (char *) alloca (namespace_len
+ 1);
2901 strncpy (new_namespace
, qualified_name
, namespace_len
);
2902 new_namespace
[namespace_len
] = '\0';
2904 std::vector
<symbol
*> new_oload_syms
2905 = make_symbol_overload_list (func_name
, new_namespace
);
2907 /* If we have reached the deepest level perform argument
2908 determined lookup. */
2909 if (!searched_deeper
&& !no_adl
)
2912 struct type
**arg_types
;
2914 /* Prepare list of argument types for overload resolution. */
2915 arg_types
= (struct type
**)
2916 alloca (args
.size () * (sizeof (struct type
*)));
2917 for (ix
= 0; ix
< args
.size (); ix
++)
2918 arg_types
[ix
] = value_type (args
[ix
]);
2919 add_symbol_overload_list_adl ({arg_types
, args
.size ()}, func_name
,
2923 badness_vector new_oload_champ_bv
;
2924 new_oload_champ
= find_oload_champ (args
,
2925 new_oload_syms
.size (),
2926 NULL
, NULL
, new_oload_syms
.data (),
2927 &new_oload_champ_bv
);
2929 /* Case 1: We found a good match. Free earlier matches (if any),
2930 and return it. Case 2: We didn't find a good match, but we're
2931 not the deepest function. Then go with the bad match that the
2932 deeper function found. Case 3: We found a bad match, and we're
2933 the deepest function. Then return what we found, even though
2934 it's a bad match. */
2936 if (new_oload_champ
!= -1
2937 && classify_oload_match (new_oload_champ_bv
, args
.size (), 0) == STANDARD
)
2939 *oload_syms
= std::move (new_oload_syms
);
2940 *oload_champ
= new_oload_champ
;
2941 *oload_champ_bv
= std::move (new_oload_champ_bv
);
2944 else if (searched_deeper
)
2950 *oload_syms
= std::move (new_oload_syms
);
2951 *oload_champ
= new_oload_champ
;
2952 *oload_champ_bv
= std::move (new_oload_champ_bv
);
2957 /* Look for a function to take ARGS. Find the best match from among
2958 the overloaded methods or functions given by METHODS or FUNCTIONS
2959 or XMETHODS, respectively. One, and only one of METHODS, FUNCTIONS
2960 and XMETHODS can be non-NULL.
2962 NUM_FNS is the length of the array pointed at by METHODS, FUNCTIONS
2963 or XMETHODS, whichever is non-NULL.
2965 Return the index of the best match; store an indication of the
2966 quality of the match in OLOAD_CHAMP_BV. */
2969 find_oload_champ (gdb::array_view
<value
*> args
,
2972 xmethod_worker_up
*xmethods
,
2974 badness_vector
*oload_champ_bv
)
2976 /* A measure of how good an overloaded instance is. */
2978 /* Index of best overloaded function. */
2979 int oload_champ
= -1;
2980 /* Current ambiguity state for overload resolution. */
2981 int oload_ambiguous
= 0;
2982 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */
2984 /* A champion can be found among methods alone, or among functions
2985 alone, or in xmethods alone, but not in more than one of these
2987 gdb_assert ((methods
!= NULL
) + (functions
!= NULL
) + (xmethods
!= NULL
)
2990 /* Consider each candidate in turn. */
2991 for (size_t ix
= 0; ix
< num_fns
; ix
++)
2994 int static_offset
= 0;
2995 std::vector
<type
*> parm_types
;
2997 if (xmethods
!= NULL
)
2998 parm_types
= xmethods
[ix
]->get_arg_types ();
3003 if (methods
!= NULL
)
3005 nparms
= TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (methods
, ix
));
3006 static_offset
= oload_method_static_p (methods
, ix
);
3009 nparms
= TYPE_NFIELDS (SYMBOL_TYPE (functions
[ix
]));
3011 parm_types
.reserve (nparms
);
3012 for (jj
= 0; jj
< nparms
; jj
++)
3014 type
*t
= (methods
!= NULL
3015 ? (TYPE_FN_FIELD_ARGS (methods
, ix
)[jj
].type
)
3016 : TYPE_FIELD_TYPE (SYMBOL_TYPE (functions
[ix
]),
3018 parm_types
.push_back (t
);
3022 /* Compare parameter types to supplied argument types. Skip
3023 THIS for static methods. */
3024 bv
= rank_function (parm_types
,
3025 args
.slice (static_offset
));
3027 if (oload_champ_bv
->empty ())
3029 *oload_champ_bv
= std::move (bv
);
3032 else /* See whether current candidate is better or worse than
3034 switch (compare_badness (bv
, *oload_champ_bv
))
3036 case 0: /* Top two contenders are equally good. */
3037 oload_ambiguous
= 1;
3039 case 1: /* Incomparable top contenders. */
3040 oload_ambiguous
= 2;
3042 case 2: /* New champion, record details. */
3043 *oload_champ_bv
= std::move (bv
);
3044 oload_ambiguous
= 0;
3053 if (methods
!= NULL
)
3054 fprintf_filtered (gdb_stderr
,
3055 "Overloaded method instance %s, # of parms %d\n",
3056 methods
[ix
].physname
, (int) parm_types
.size ());
3057 else if (xmethods
!= NULL
)
3058 fprintf_filtered (gdb_stderr
,
3059 "Xmethod worker, # of parms %d\n",
3060 (int) parm_types
.size ());
3062 fprintf_filtered (gdb_stderr
,
3063 "Overloaded function instance "
3064 "%s # of parms %d\n",
3065 SYMBOL_DEMANGLED_NAME (functions
[ix
]),
3066 (int) parm_types
.size ());
3067 for (jj
= 0; jj
< args
.size () - static_offset
; jj
++)
3068 fprintf_filtered (gdb_stderr
,
3069 "...Badness @ %d : %d\n",
3071 fprintf_filtered (gdb_stderr
, "Overload resolution "
3072 "champion is %d, ambiguous? %d\n",
3073 oload_champ
, oload_ambiguous
);
3080 /* Return 1 if we're looking at a static method, 0 if we're looking at
3081 a non-static method or a function that isn't a method. */
3084 oload_method_static_p (struct fn_field
*fns_ptr
, int index
)
3086 if (fns_ptr
&& index
>= 0 && TYPE_FN_FIELD_STATIC_P (fns_ptr
, index
))
3092 /* Check how good an overload match OLOAD_CHAMP_BV represents. */
3094 static enum oload_classification
3095 classify_oload_match (const badness_vector
&oload_champ_bv
,
3100 enum oload_classification worst
= STANDARD
;
3102 for (ix
= 1; ix
<= nargs
- static_offset
; ix
++)
3104 /* If this conversion is as bad as INCOMPATIBLE_TYPE_BADNESS
3105 or worse return INCOMPATIBLE. */
3106 if (compare_ranks (oload_champ_bv
[ix
],
3107 INCOMPATIBLE_TYPE_BADNESS
) <= 0)
3108 return INCOMPATIBLE
; /* Truly mismatched types. */
3109 /* Otherwise If this conversion is as bad as
3110 NS_POINTER_CONVERSION_BADNESS or worse return NON_STANDARD. */
3111 else if (compare_ranks (oload_champ_bv
[ix
],
3112 NS_POINTER_CONVERSION_BADNESS
) <= 0)
3113 worst
= NON_STANDARD
; /* Non-standard type conversions
3117 /* If no INCOMPATIBLE classification was found, return the worst one
3118 that was found (if any). */
3122 /* C++: return 1 is NAME is a legitimate name for the destructor of
3123 type TYPE. If TYPE does not have a destructor, or if NAME is
3124 inappropriate for TYPE, an error is signaled. Parameter TYPE should not yet
3125 have CHECK_TYPEDEF applied, this function will apply it itself. */
3128 destructor_name_p (const char *name
, struct type
*type
)
3132 const char *dname
= type_name_or_error (type
);
3133 const char *cp
= strchr (dname
, '<');
3136 /* Do not compare the template part for template classes. */
3138 len
= strlen (dname
);
3141 if (strlen (name
+ 1) != len
|| strncmp (dname
, name
+ 1, len
) != 0)
3142 error (_("name of destructor must equal name of class"));
3149 /* Find an enum constant named NAME in TYPE. TYPE must be an "enum
3150 class". If the name is found, return a value representing it;
3151 otherwise throw an exception. */
3153 static struct value
*
3154 enum_constant_from_type (struct type
*type
, const char *name
)
3157 int name_len
= strlen (name
);
3159 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ENUM
3160 && TYPE_DECLARED_CLASS (type
));
3162 for (i
= TYPE_N_BASECLASSES (type
); i
< TYPE_NFIELDS (type
); ++i
)
3164 const char *fname
= TYPE_FIELD_NAME (type
, i
);
3167 if (TYPE_FIELD_LOC_KIND (type
, i
) != FIELD_LOC_KIND_ENUMVAL
3171 /* Look for the trailing "::NAME", since enum class constant
3172 names are qualified here. */
3173 len
= strlen (fname
);
3174 if (len
+ 2 >= name_len
3175 && fname
[len
- name_len
- 2] == ':'
3176 && fname
[len
- name_len
- 1] == ':'
3177 && strcmp (&fname
[len
- name_len
], name
) == 0)
3178 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, i
));
3181 error (_("no constant named \"%s\" in enum \"%s\""),
3182 name
, TYPE_NAME (type
));
3185 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3186 return the appropriate member (or the address of the member, if
3187 WANT_ADDRESS). This function is used to resolve user expressions
3188 of the form "DOMAIN::NAME". For more details on what happens, see
3189 the comment before value_struct_elt_for_reference. */
3192 value_aggregate_elt (struct type
*curtype
, const char *name
,
3193 struct type
*expect_type
, int want_address
,
3196 switch (TYPE_CODE (curtype
))
3198 case TYPE_CODE_STRUCT
:
3199 case TYPE_CODE_UNION
:
3200 return value_struct_elt_for_reference (curtype
, 0, curtype
,
3202 want_address
, noside
);
3203 case TYPE_CODE_NAMESPACE
:
3204 return value_namespace_elt (curtype
, name
,
3205 want_address
, noside
);
3207 case TYPE_CODE_ENUM
:
3208 return enum_constant_from_type (curtype
, name
);
3211 internal_error (__FILE__
, __LINE__
,
3212 _("non-aggregate type in value_aggregate_elt"));
3216 /* Compares the two method/function types T1 and T2 for "equality"
3217 with respect to the methods' parameters. If the types of the
3218 two parameter lists are the same, returns 1; 0 otherwise. This
3219 comparison may ignore any artificial parameters in T1 if
3220 SKIP_ARTIFICIAL is non-zero. This function will ALWAYS skip
3221 the first artificial parameter in T1, assumed to be a 'this' pointer.
3223 The type T2 is expected to have come from make_params (in eval.c). */
3226 compare_parameters (struct type
*t1
, struct type
*t2
, int skip_artificial
)
3230 if (TYPE_NFIELDS (t1
) > 0 && TYPE_FIELD_ARTIFICIAL (t1
, 0))
3233 /* If skipping artificial fields, find the first real field
3235 if (skip_artificial
)
3237 while (start
< TYPE_NFIELDS (t1
)
3238 && TYPE_FIELD_ARTIFICIAL (t1
, start
))
3242 /* Now compare parameters. */
3244 /* Special case: a method taking void. T1 will contain no
3245 non-artificial fields, and T2 will contain TYPE_CODE_VOID. */
3246 if ((TYPE_NFIELDS (t1
) - start
) == 0 && TYPE_NFIELDS (t2
) == 1
3247 && TYPE_CODE (TYPE_FIELD_TYPE (t2
, 0)) == TYPE_CODE_VOID
)
3250 if ((TYPE_NFIELDS (t1
) - start
) == TYPE_NFIELDS (t2
))
3254 for (i
= 0; i
< TYPE_NFIELDS (t2
); ++i
)
3256 if (compare_ranks (rank_one_type (TYPE_FIELD_TYPE (t1
, start
+ i
),
3257 TYPE_FIELD_TYPE (t2
, i
), NULL
),
3258 EXACT_MATCH_BADNESS
) != 0)
3268 /* C++: Given an aggregate type VT, and a class type CLS, search
3269 recursively for CLS using value V; If found, store the offset
3270 which is either fetched from the virtual base pointer if CLS
3271 is virtual or accumulated offset of its parent classes if
3272 CLS is non-virtual in *BOFFS, set ISVIRT to indicate if CLS
3273 is virtual, and return true. If not found, return false. */
3276 get_baseclass_offset (struct type
*vt
, struct type
*cls
,
3277 struct value
*v
, int *boffs
, bool *isvirt
)
3279 for (int i
= 0; i
< TYPE_N_BASECLASSES (vt
); i
++)
3281 struct type
*t
= TYPE_FIELD_TYPE (vt
, i
);
3282 if (types_equal (t
, cls
))
3284 if (BASETYPE_VIA_VIRTUAL (vt
, i
))
3286 const gdb_byte
*adr
= value_contents_for_printing (v
);
3287 *boffs
= baseclass_offset (vt
, i
, adr
, value_offset (v
),
3288 value_as_long (v
), v
);
3296 if (get_baseclass_offset (check_typedef (t
), cls
, v
, boffs
, isvirt
))
3298 if (*isvirt
== false) /* Add non-virtual base offset. */
3300 const gdb_byte
*adr
= value_contents_for_printing (v
);
3301 *boffs
+= baseclass_offset (vt
, i
, adr
, value_offset (v
),
3302 value_as_long (v
), v
);
3311 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3312 return the address of this member as a "pointer to member" type.
3313 If INTYPE is non-null, then it will be the type of the member we
3314 are looking for. This will help us resolve "pointers to member
3315 functions". This function is used to resolve user expressions of
3316 the form "DOMAIN::NAME". */
3318 static struct value
*
3319 value_struct_elt_for_reference (struct type
*domain
, int offset
,
3320 struct type
*curtype
, const char *name
,
3321 struct type
*intype
,
3325 struct type
*t
= check_typedef (curtype
);
3327 struct value
*result
;
3329 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
3330 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
3331 error (_("Internal error: non-aggregate type "
3332 "to value_struct_elt_for_reference"));
3334 for (i
= TYPE_NFIELDS (t
) - 1; i
>= TYPE_N_BASECLASSES (t
); i
--)
3336 const char *t_field_name
= TYPE_FIELD_NAME (t
, i
);
3338 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
3340 if (field_is_static (&TYPE_FIELD (t
, i
)))
3342 struct value
*v
= value_static_field (t
, i
);
3347 if (TYPE_FIELD_PACKED (t
, i
))
3348 error (_("pointers to bitfield members not allowed"));
3351 return value_from_longest
3352 (lookup_memberptr_type (TYPE_FIELD_TYPE (t
, i
), domain
),
3353 offset
+ (LONGEST
) (TYPE_FIELD_BITPOS (t
, i
) >> 3));
3354 else if (noside
!= EVAL_NORMAL
)
3355 return allocate_value (TYPE_FIELD_TYPE (t
, i
));
3358 /* Try to evaluate NAME as a qualified name with implicit
3359 this pointer. In this case, attempt to return the
3360 equivalent to `this->*(&TYPE::NAME)'. */
3361 struct value
*v
= value_of_this_silent (current_language
);
3364 struct value
*ptr
, *this_v
= v
;
3366 struct type
*type
, *tmp
;
3368 ptr
= value_aggregate_elt (domain
, name
, NULL
, 1, noside
);
3369 type
= check_typedef (value_type (ptr
));
3370 gdb_assert (type
!= NULL
3371 && TYPE_CODE (type
) == TYPE_CODE_MEMBERPTR
);
3372 tmp
= lookup_pointer_type (TYPE_SELF_TYPE (type
));
3373 v
= value_cast_pointers (tmp
, v
, 1);
3374 mem_offset
= value_as_long (ptr
);
3375 if (domain
!= curtype
)
3377 /* Find class offset of type CURTYPE from either its
3378 parent type DOMAIN or the type of implied this. */
3380 bool isvirt
= false;
3381 if (get_baseclass_offset (domain
, curtype
, v
, &boff
,
3386 struct type
*p
= check_typedef (value_type (this_v
));
3387 p
= check_typedef (TYPE_TARGET_TYPE (p
));
3388 if (get_baseclass_offset (p
, curtype
, this_v
,
3393 tmp
= lookup_pointer_type (TYPE_TARGET_TYPE (type
));
3394 result
= value_from_pointer (tmp
,
3395 value_as_long (v
) + mem_offset
);
3396 return value_ind (result
);
3399 error (_("Cannot reference non-static field \"%s\""), name
);
3404 /* C++: If it was not found as a data field, then try to return it
3405 as a pointer to a method. */
3407 /* Perform all necessary dereferencing. */
3408 while (intype
&& TYPE_CODE (intype
) == TYPE_CODE_PTR
)
3409 intype
= TYPE_TARGET_TYPE (intype
);
3411 for (i
= TYPE_NFN_FIELDS (t
) - 1; i
>= 0; --i
)
3413 const char *t_field_name
= TYPE_FN_FIELDLIST_NAME (t
, i
);
3415 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
3418 int len
= TYPE_FN_FIELDLIST_LENGTH (t
, i
);
3419 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (t
, i
);
3421 check_stub_method_group (t
, i
);
3425 for (j
= 0; j
< len
; ++j
)
3427 if (TYPE_CONST (intype
) != TYPE_FN_FIELD_CONST (f
, j
))
3429 if (TYPE_VOLATILE (intype
) != TYPE_FN_FIELD_VOLATILE (f
, j
))
3432 if (compare_parameters (TYPE_FN_FIELD_TYPE (f
, j
), intype
, 0)
3433 || compare_parameters (TYPE_FN_FIELD_TYPE (f
, j
),
3439 error (_("no member function matches "
3440 "that type instantiation"));
3447 for (ii
= 0; ii
< len
; ++ii
)
3449 /* Skip artificial methods. This is necessary if,
3450 for example, the user wants to "print
3451 subclass::subclass" with only one user-defined
3452 constructor. There is no ambiguity in this case.
3453 We are careful here to allow artificial methods
3454 if they are the unique result. */
3455 if (TYPE_FN_FIELD_ARTIFICIAL (f
, ii
))
3462 /* Desired method is ambiguous if more than one
3463 method is defined. */
3464 if (j
!= -1 && !TYPE_FN_FIELD_ARTIFICIAL (f
, j
))
3465 error (_("non-unique member `%s' requires "
3466 "type instantiation"), name
);
3472 error (_("no matching member function"));
3475 if (TYPE_FN_FIELD_STATIC_P (f
, j
))
3478 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
3479 0, VAR_DOMAIN
, 0).symbol
;
3485 return value_addr (read_var_value (s
, 0, 0));
3487 return read_var_value (s
, 0, 0);
3490 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
3494 result
= allocate_value
3495 (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
3496 cplus_make_method_ptr (value_type (result
),
3497 value_contents_writeable (result
),
3498 TYPE_FN_FIELD_VOFFSET (f
, j
), 1);
3500 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
3501 return allocate_value (TYPE_FN_FIELD_TYPE (f
, j
));
3503 error (_("Cannot reference virtual member function \"%s\""),
3509 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
3510 0, VAR_DOMAIN
, 0).symbol
;
3515 struct value
*v
= read_var_value (s
, 0, 0);
3520 result
= allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
3521 cplus_make_method_ptr (value_type (result
),
3522 value_contents_writeable (result
),
3523 value_address (v
), 0);
3529 for (i
= TYPE_N_BASECLASSES (t
) - 1; i
>= 0; i
--)
3534 if (BASETYPE_VIA_VIRTUAL (t
, i
))
3537 base_offset
= TYPE_BASECLASS_BITPOS (t
, i
) / 8;
3538 v
= value_struct_elt_for_reference (domain
,
3539 offset
+ base_offset
,
3540 TYPE_BASECLASS (t
, i
),
3542 want_address
, noside
);
3547 /* As a last chance, pretend that CURTYPE is a namespace, and look
3548 it up that way; this (frequently) works for types nested inside
3551 return value_maybe_namespace_elt (curtype
, name
,
3552 want_address
, noside
);
3555 /* C++: Return the member NAME of the namespace given by the type
3558 static struct value
*
3559 value_namespace_elt (const struct type
*curtype
,
3560 const char *name
, int want_address
,
3563 struct value
*retval
= value_maybe_namespace_elt (curtype
, name
,
3568 error (_("No symbol \"%s\" in namespace \"%s\"."),
3569 name
, TYPE_NAME (curtype
));
3574 /* A helper function used by value_namespace_elt and
3575 value_struct_elt_for_reference. It looks up NAME inside the
3576 context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE
3577 is a class and NAME refers to a type in CURTYPE itself (as opposed
3578 to, say, some base class of CURTYPE). */
3580 static struct value
*
3581 value_maybe_namespace_elt (const struct type
*curtype
,
3582 const char *name
, int want_address
,
3585 const char *namespace_name
= TYPE_NAME (curtype
);
3586 struct block_symbol sym
;
3587 struct value
*result
;
3589 sym
= cp_lookup_symbol_namespace (namespace_name
, name
,
3590 get_selected_block (0), VAR_DOMAIN
);
3592 if (sym
.symbol
== NULL
)
3594 else if ((noside
== EVAL_AVOID_SIDE_EFFECTS
)
3595 && (SYMBOL_CLASS (sym
.symbol
) == LOC_TYPEDEF
))
3596 result
= allocate_value (SYMBOL_TYPE (sym
.symbol
));
3598 result
= value_of_variable (sym
.symbol
, sym
.block
);
3601 result
= value_addr (result
);
3606 /* Given a pointer or a reference value V, find its real (RTTI) type.
3608 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
3609 and refer to the values computed for the object pointed to. */
3612 value_rtti_indirect_type (struct value
*v
, int *full
,
3613 LONGEST
*top
, int *using_enc
)
3615 struct value
*target
= NULL
;
3616 struct type
*type
, *real_type
, *target_type
;
3618 type
= value_type (v
);
3619 type
= check_typedef (type
);
3620 if (TYPE_IS_REFERENCE (type
))
3621 target
= coerce_ref (v
);
3622 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3627 target
= value_ind (v
);
3629 catch (const gdb_exception_error
&except
)
3631 if (except
.error
== MEMORY_ERROR
)
3633 /* value_ind threw a memory error. The pointer is NULL or
3634 contains an uninitialized value: we can't determine any
3644 real_type
= value_rtti_type (target
, full
, top
, using_enc
);
3648 /* Copy qualifiers to the referenced object. */
3649 target_type
= value_type (target
);
3650 real_type
= make_cv_type (TYPE_CONST (target_type
),
3651 TYPE_VOLATILE (target_type
), real_type
, NULL
);
3652 if (TYPE_IS_REFERENCE (type
))
3653 real_type
= lookup_reference_type (real_type
, TYPE_CODE (type
));
3654 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3655 real_type
= lookup_pointer_type (real_type
);
3657 internal_error (__FILE__
, __LINE__
, _("Unexpected value type."));
3659 /* Copy qualifiers to the pointer/reference. */
3660 real_type
= make_cv_type (TYPE_CONST (type
), TYPE_VOLATILE (type
),
3667 /* Given a value pointed to by ARGP, check its real run-time type, and
3668 if that is different from the enclosing type, create a new value
3669 using the real run-time type as the enclosing type (and of the same
3670 type as ARGP) and return it, with the embedded offset adjusted to
3671 be the correct offset to the enclosed object. RTYPE is the type,
3672 and XFULL, XTOP, and XUSING_ENC are the other parameters, computed
3673 by value_rtti_type(). If these are available, they can be supplied
3674 and a second call to value_rtti_type() is avoided. (Pass RTYPE ==
3675 NULL if they're not available. */
3678 value_full_object (struct value
*argp
,
3680 int xfull
, int xtop
,
3683 struct type
*real_type
;
3687 struct value
*new_val
;
3694 using_enc
= xusing_enc
;
3697 real_type
= value_rtti_type (argp
, &full
, &top
, &using_enc
);
3699 /* If no RTTI data, or if object is already complete, do nothing. */
3700 if (!real_type
|| real_type
== value_enclosing_type (argp
))
3703 /* In a destructor we might see a real type that is a superclass of
3704 the object's type. In this case it is better to leave the object
3707 && TYPE_LENGTH (real_type
) < TYPE_LENGTH (value_enclosing_type (argp
)))
3710 /* If we have the full object, but for some reason the enclosing
3711 type is wrong, set it. */
3712 /* pai: FIXME -- sounds iffy */
3715 argp
= value_copy (argp
);
3716 set_value_enclosing_type (argp
, real_type
);
3720 /* Check if object is in memory. */
3721 if (VALUE_LVAL (argp
) != lval_memory
)
3723 warning (_("Couldn't retrieve complete object of RTTI "
3724 "type %s; object may be in register(s)."),
3725 TYPE_NAME (real_type
));
3730 /* All other cases -- retrieve the complete object. */
3731 /* Go back by the computed top_offset from the beginning of the
3732 object, adjusting for the embedded offset of argp if that's what
3733 value_rtti_type used for its computation. */
3734 new_val
= value_at_lazy (real_type
, value_address (argp
) - top
+
3735 (using_enc
? 0 : value_embedded_offset (argp
)));
3736 deprecated_set_value_type (new_val
, value_type (argp
));
3737 set_value_embedded_offset (new_val
, (using_enc
3738 ? top
+ value_embedded_offset (argp
)
3744 /* Return the value of the local variable, if one exists. Throw error
3745 otherwise, such as if the request is made in an inappropriate context. */
3748 value_of_this (const struct language_defn
*lang
)
3750 struct block_symbol sym
;
3751 const struct block
*b
;
3752 struct frame_info
*frame
;
3754 if (!lang
->la_name_of_this
)
3755 error (_("no `this' in current language"));
3757 frame
= get_selected_frame (_("no frame selected"));
3759 b
= get_frame_block (frame
, NULL
);
3761 sym
= lookup_language_this (lang
, b
);
3762 if (sym
.symbol
== NULL
)
3763 error (_("current stack frame does not contain a variable named `%s'"),
3764 lang
->la_name_of_this
);
3766 return read_var_value (sym
.symbol
, sym
.block
, frame
);
3769 /* Return the value of the local variable, if one exists. Return NULL
3770 otherwise. Never throw error. */
3773 value_of_this_silent (const struct language_defn
*lang
)
3775 struct value
*ret
= NULL
;
3779 ret
= value_of_this (lang
);
3781 catch (const gdb_exception_error
&except
)
3788 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH
3789 elements long, starting at LOWBOUND. The result has the same lower
3790 bound as the original ARRAY. */
3793 value_slice (struct value
*array
, int lowbound
, int length
)
3795 struct type
*slice_range_type
, *slice_type
, *range_type
;
3796 LONGEST lowerbound
, upperbound
;
3797 struct value
*slice
;
3798 struct type
*array_type
;
3800 array_type
= check_typedef (value_type (array
));
3801 if (TYPE_CODE (array_type
) != TYPE_CODE_ARRAY
3802 && TYPE_CODE (array_type
) != TYPE_CODE_STRING
)
3803 error (_("cannot take slice of non-array"));
3805 if (type_not_allocated (array_type
))
3806 error (_("array not allocated"));
3807 if (type_not_associated (array_type
))
3808 error (_("array not associated"));
3810 range_type
= TYPE_INDEX_TYPE (array_type
);
3811 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
3812 error (_("slice from bad array or bitstring"));
3814 if (lowbound
< lowerbound
|| length
< 0
3815 || lowbound
+ length
- 1 > upperbound
)
3816 error (_("slice out of range"));
3818 /* FIXME-type-allocation: need a way to free this type when we are
3820 slice_range_type
= create_static_range_type (NULL
,
3821 TYPE_TARGET_TYPE (range_type
),
3823 lowbound
+ length
- 1);
3826 struct type
*element_type
= TYPE_TARGET_TYPE (array_type
);
3828 = (lowbound
- lowerbound
) * TYPE_LENGTH (check_typedef (element_type
));
3830 slice_type
= create_array_type (NULL
,
3833 TYPE_CODE (slice_type
) = TYPE_CODE (array_type
);
3835 if (VALUE_LVAL (array
) == lval_memory
&& value_lazy (array
))
3836 slice
= allocate_value_lazy (slice_type
);
3839 slice
= allocate_value (slice_type
);
3840 value_contents_copy (slice
, 0, array
, offset
,
3841 type_length_units (slice_type
));
3844 set_value_component_location (slice
, array
);
3845 set_value_offset (slice
, value_offset (array
) + offset
);
3851 /* Create a value for a FORTRAN complex number. Currently most of the
3852 time values are coerced to COMPLEX*16 (i.e. a complex number
3853 composed of 2 doubles. This really should be a smarter routine
3854 that figures out precision inteligently as opposed to assuming
3855 doubles. FIXME: fmb */
3858 value_literal_complex (struct value
*arg1
,
3863 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3865 val
= allocate_value (type
);
3866 arg1
= value_cast (real_type
, arg1
);
3867 arg2
= value_cast (real_type
, arg2
);
3869 memcpy (value_contents_raw (val
),
3870 value_contents (arg1
), TYPE_LENGTH (real_type
));
3871 memcpy (value_contents_raw (val
) + TYPE_LENGTH (real_type
),
3872 value_contents (arg2
), TYPE_LENGTH (real_type
));
3876 /* Cast a value into the appropriate complex data type. */
3878 static struct value
*
3879 cast_into_complex (struct type
*type
, struct value
*val
)
3881 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3883 if (TYPE_CODE (value_type (val
)) == TYPE_CODE_COMPLEX
)
3885 struct type
*val_real_type
= TYPE_TARGET_TYPE (value_type (val
));
3886 struct value
*re_val
= allocate_value (val_real_type
);
3887 struct value
*im_val
= allocate_value (val_real_type
);
3889 memcpy (value_contents_raw (re_val
),
3890 value_contents (val
), TYPE_LENGTH (val_real_type
));
3891 memcpy (value_contents_raw (im_val
),
3892 value_contents (val
) + TYPE_LENGTH (val_real_type
),
3893 TYPE_LENGTH (val_real_type
));
3895 return value_literal_complex (re_val
, im_val
, type
);
3897 else if (TYPE_CODE (value_type (val
)) == TYPE_CODE_FLT
3898 || TYPE_CODE (value_type (val
)) == TYPE_CODE_INT
)
3899 return value_literal_complex (val
,
3900 value_zero (real_type
, not_lval
),
3903 error (_("cannot cast non-number to complex"));
3907 _initialize_valops (void)
3909 add_setshow_boolean_cmd ("overload-resolution", class_support
,
3910 &overload_resolution
, _("\
3911 Set overload resolution in evaluating C++ functions."), _("\
3912 Show overload resolution in evaluating C++ functions."),
3914 show_overload_resolution
,
3915 &setlist
, &showlist
);
3916 overload_resolution
= 1;