1 /* Perform non-arithmetic operations on values, for GDB.
3 Copyright (C) 1986-2018 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 "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
, int,
71 const std::vector
<xmethod_worker_up
> *,
72 struct symbol
**, badness_vector
*);
74 static int oload_method_static_p (struct fn_field
*, int);
76 enum oload_classification
{ STANDARD
, NON_STANDARD
, INCOMPATIBLE
};
78 static enum oload_classification classify_oload_match
79 (const badness_vector
&, int, int);
81 static struct value
*value_struct_elt_for_reference (struct type
*,
87 static struct value
*value_namespace_elt (const struct type
*,
88 const char *, int , enum noside
);
90 static struct value
*value_maybe_namespace_elt (const struct type
*,
94 static CORE_ADDR
allocate_space_in_inferior (int);
96 static struct value
*cast_into_complex (struct type
*, struct value
*);
98 static void find_method_list (struct value
**, const char *,
99 LONGEST
, struct type
*, struct fn_field
**, int *,
100 std::vector
<xmethod_worker_up
> *,
101 struct type
**, LONGEST
*);
103 int overload_resolution
= 0;
105 show_overload_resolution (struct ui_file
*file
, int from_tty
,
106 struct cmd_list_element
*c
,
109 fprintf_filtered (file
, _("Overload resolution in evaluating "
110 "C++ functions is %s.\n"),
114 /* Find the address of function name NAME in the inferior. If OBJF_P
115 is non-NULL, *OBJF_P will be set to the OBJFILE where the function
119 find_function_in_inferior (const char *name
, struct objfile
**objf_p
)
121 struct block_symbol sym
;
123 sym
= lookup_symbol (name
, 0, VAR_DOMAIN
, 0);
124 if (sym
.symbol
!= NULL
)
126 if (SYMBOL_CLASS (sym
.symbol
) != LOC_BLOCK
)
128 error (_("\"%s\" exists in this program but is not a function."),
133 *objf_p
= symbol_objfile (sym
.symbol
);
135 return value_of_variable (sym
.symbol
, sym
.block
);
139 struct bound_minimal_symbol msymbol
=
140 lookup_bound_minimal_symbol (name
);
142 if (msymbol
.minsym
!= NULL
)
144 struct objfile
*objfile
= msymbol
.objfile
;
145 struct gdbarch
*gdbarch
= get_objfile_arch (objfile
);
149 type
= lookup_pointer_type (builtin_type (gdbarch
)->builtin_char
);
150 type
= lookup_function_type (type
);
151 type
= lookup_pointer_type (type
);
152 maddr
= BMSYMBOL_VALUE_ADDRESS (msymbol
);
157 return value_from_pointer (type
, maddr
);
161 if (!target_has_execution
)
162 error (_("evaluation of this expression "
163 "requires the target program to be active"));
165 error (_("evaluation of this expression requires the "
166 "program to have a function \"%s\"."),
172 /* Allocate NBYTES of space in the inferior using the inferior's
173 malloc and return a value that is a pointer to the allocated
177 value_allocate_space_in_inferior (int len
)
179 struct objfile
*objf
;
180 struct value
*val
= find_function_in_inferior ("malloc", &objf
);
181 struct gdbarch
*gdbarch
= get_objfile_arch (objf
);
182 struct value
*blocklen
;
184 blocklen
= value_from_longest (builtin_type (gdbarch
)->builtin_int
, len
);
185 val
= call_function_by_hand (val
, NULL
, blocklen
);
186 if (value_logical_not (val
))
188 if (!target_has_execution
)
189 error (_("No memory available to program now: "
190 "you need to start the target first"));
192 error (_("No memory available to program: call to malloc failed"));
198 allocate_space_in_inferior (int len
)
200 return value_as_long (value_allocate_space_in_inferior (len
));
203 /* Cast struct value VAL to type TYPE and return as a value.
204 Both type and val must be of TYPE_CODE_STRUCT or TYPE_CODE_UNION
205 for this to work. Typedef to one of the codes is permitted.
206 Returns NULL if the cast is neither an upcast nor a downcast. */
208 static struct value
*
209 value_cast_structs (struct type
*type
, struct value
*v2
)
215 gdb_assert (type
!= NULL
&& v2
!= NULL
);
217 t1
= check_typedef (type
);
218 t2
= check_typedef (value_type (v2
));
220 /* Check preconditions. */
221 gdb_assert ((TYPE_CODE (t1
) == TYPE_CODE_STRUCT
222 || TYPE_CODE (t1
) == TYPE_CODE_UNION
)
223 && !!"Precondition is that type is of STRUCT or UNION kind.");
224 gdb_assert ((TYPE_CODE (t2
) == TYPE_CODE_STRUCT
225 || TYPE_CODE (t2
) == TYPE_CODE_UNION
)
226 && !!"Precondition is that value is of STRUCT or UNION kind");
228 if (TYPE_NAME (t1
) != NULL
229 && TYPE_NAME (t2
) != NULL
230 && !strcmp (TYPE_NAME (t1
), TYPE_NAME (t2
)))
233 /* Upcasting: look in the type of the source to see if it contains the
234 type of the target as a superclass. If so, we'll need to
235 offset the pointer rather than just change its type. */
236 if (TYPE_NAME (t1
) != NULL
)
238 v
= search_struct_field (TYPE_NAME (t1
),
244 /* Downcasting: look in the type of the target to see if it contains the
245 type of the source as a superclass. If so, we'll need to
246 offset the pointer rather than just change its type. */
247 if (TYPE_NAME (t2
) != NULL
)
249 /* Try downcasting using the run-time type of the value. */
252 struct type
*real_type
;
254 real_type
= value_rtti_type (v2
, &full
, &top
, &using_enc
);
257 v
= value_full_object (v2
, real_type
, full
, top
, using_enc
);
258 v
= value_at_lazy (real_type
, value_address (v
));
259 real_type
= value_type (v
);
261 /* We might be trying to cast to the outermost enclosing
262 type, in which case search_struct_field won't work. */
263 if (TYPE_NAME (real_type
) != NULL
264 && !strcmp (TYPE_NAME (real_type
), TYPE_NAME (t1
)))
267 v
= search_struct_field (TYPE_NAME (t2
), v
, real_type
, 1);
272 /* Try downcasting using information from the destination type
273 T2. This wouldn't work properly for classes with virtual
274 bases, but those were handled above. */
275 v
= search_struct_field (TYPE_NAME (t2
),
276 value_zero (t1
, not_lval
), t1
, 1);
279 /* Downcasting is possible (t1 is superclass of v2). */
280 CORE_ADDR addr2
= value_address (v2
);
282 addr2
-= value_address (v
) + value_embedded_offset (v
);
283 return value_at (type
, addr2
);
290 /* Cast one pointer or reference type to another. Both TYPE and
291 the type of ARG2 should be pointer types, or else both should be
292 reference types. If SUBCLASS_CHECK is non-zero, this will force a
293 check to see whether TYPE is a superclass of ARG2's type. If
294 SUBCLASS_CHECK is zero, then the subclass check is done only when
295 ARG2 is itself non-zero. Returns the new pointer or reference. */
298 value_cast_pointers (struct type
*type
, struct value
*arg2
,
301 struct type
*type1
= check_typedef (type
);
302 struct type
*type2
= check_typedef (value_type (arg2
));
303 struct type
*t1
= check_typedef (TYPE_TARGET_TYPE (type1
));
304 struct type
*t2
= check_typedef (TYPE_TARGET_TYPE (type2
));
306 if (TYPE_CODE (t1
) == TYPE_CODE_STRUCT
307 && TYPE_CODE (t2
) == TYPE_CODE_STRUCT
308 && (subclass_check
|| !value_logical_not (arg2
)))
312 if (TYPE_IS_REFERENCE (type2
))
313 v2
= coerce_ref (arg2
);
315 v2
= value_ind (arg2
);
316 gdb_assert (TYPE_CODE (check_typedef (value_type (v2
)))
317 == TYPE_CODE_STRUCT
&& !!"Why did coercion fail?");
318 v2
= value_cast_structs (t1
, v2
);
319 /* At this point we have what we can have, un-dereference if needed. */
322 struct value
*v
= value_addr (v2
);
324 deprecated_set_value_type (v
, type
);
329 /* No superclass found, just change the pointer type. */
330 arg2
= value_copy (arg2
);
331 deprecated_set_value_type (arg2
, type
);
332 set_value_enclosing_type (arg2
, type
);
333 set_value_pointed_to_offset (arg2
, 0); /* pai: chk_val */
337 /* Cast value ARG2 to type TYPE and return as a value.
338 More general than a C cast: accepts any two types of the same length,
339 and if ARG2 is an lvalue it can be cast into anything at all. */
340 /* In C++, casts may change pointer or object representations. */
343 value_cast (struct type
*type
, struct value
*arg2
)
345 enum type_code code1
;
346 enum type_code code2
;
350 int convert_to_boolean
= 0;
352 if (value_type (arg2
) == type
)
355 /* Check if we are casting struct reference to struct reference. */
356 if (TYPE_IS_REFERENCE (check_typedef (type
)))
358 /* We dereference type; then we recurse and finally
359 we generate value of the given reference. Nothing wrong with
361 struct type
*t1
= check_typedef (type
);
362 struct type
*dereftype
= check_typedef (TYPE_TARGET_TYPE (t1
));
363 struct value
*val
= value_cast (dereftype
, arg2
);
365 return value_ref (val
, TYPE_CODE (t1
));
368 if (TYPE_IS_REFERENCE (check_typedef (value_type (arg2
))))
369 /* We deref the value and then do the cast. */
370 return value_cast (type
, coerce_ref (arg2
));
372 /* Strip typedefs / resolve stubs in order to get at the type's
373 code/length, but remember the original type, to use as the
374 resulting type of the cast, in case it was a typedef. */
375 struct type
*to_type
= type
;
377 type
= check_typedef (type
);
378 code1
= TYPE_CODE (type
);
379 arg2
= coerce_ref (arg2
);
380 type2
= check_typedef (value_type (arg2
));
382 /* You can't cast to a reference type. See value_cast_pointers
384 gdb_assert (!TYPE_IS_REFERENCE (type
));
386 /* A cast to an undetermined-length array_type, such as
387 (TYPE [])OBJECT, is treated like a cast to (TYPE [N])OBJECT,
388 where N is sizeof(OBJECT)/sizeof(TYPE). */
389 if (code1
== TYPE_CODE_ARRAY
)
391 struct type
*element_type
= TYPE_TARGET_TYPE (type
);
392 unsigned element_length
= TYPE_LENGTH (check_typedef (element_type
));
394 if (element_length
> 0 && TYPE_ARRAY_UPPER_BOUND_IS_UNDEFINED (type
))
396 struct type
*range_type
= TYPE_INDEX_TYPE (type
);
397 int val_length
= TYPE_LENGTH (type2
);
398 LONGEST low_bound
, high_bound
, new_length
;
400 if (get_discrete_bounds (range_type
, &low_bound
, &high_bound
) < 0)
401 low_bound
= 0, high_bound
= 0;
402 new_length
= val_length
/ element_length
;
403 if (val_length
% element_length
!= 0)
404 warning (_("array element type size does not "
405 "divide object size in cast"));
406 /* FIXME-type-allocation: need a way to free this type when
407 we are done with it. */
408 range_type
= create_static_range_type ((struct type
*) NULL
,
409 TYPE_TARGET_TYPE (range_type
),
411 new_length
+ low_bound
- 1);
412 deprecated_set_value_type (arg2
,
413 create_array_type ((struct type
*) NULL
,
420 if (current_language
->c_style_arrays
421 && TYPE_CODE (type2
) == TYPE_CODE_ARRAY
422 && !TYPE_VECTOR (type2
))
423 arg2
= value_coerce_array (arg2
);
425 if (TYPE_CODE (type2
) == TYPE_CODE_FUNC
)
426 arg2
= value_coerce_function (arg2
);
428 type2
= check_typedef (value_type (arg2
));
429 code2
= TYPE_CODE (type2
);
431 if (code1
== TYPE_CODE_COMPLEX
)
432 return cast_into_complex (to_type
, arg2
);
433 if (code1
== TYPE_CODE_BOOL
)
435 code1
= TYPE_CODE_INT
;
436 convert_to_boolean
= 1;
438 if (code1
== TYPE_CODE_CHAR
)
439 code1
= TYPE_CODE_INT
;
440 if (code2
== TYPE_CODE_BOOL
|| code2
== TYPE_CODE_CHAR
)
441 code2
= TYPE_CODE_INT
;
443 scalar
= (code2
== TYPE_CODE_INT
|| code2
== TYPE_CODE_FLT
444 || code2
== TYPE_CODE_DECFLOAT
|| code2
== TYPE_CODE_ENUM
445 || code2
== TYPE_CODE_RANGE
);
447 if ((code1
== TYPE_CODE_STRUCT
|| code1
== TYPE_CODE_UNION
)
448 && (code2
== TYPE_CODE_STRUCT
|| code2
== TYPE_CODE_UNION
)
449 && TYPE_NAME (type
) != 0)
451 struct value
*v
= value_cast_structs (to_type
, arg2
);
457 if (is_floating_type (type
) && scalar
)
459 if (is_floating_value (arg2
))
461 struct value
*v
= allocate_value (to_type
);
462 target_float_convert (value_contents (arg2
), type2
,
463 value_contents_raw (v
), type
);
467 /* The only option left is an integral type. */
468 if (TYPE_UNSIGNED (type2
))
469 return value_from_ulongest (to_type
, value_as_long (arg2
));
471 return value_from_longest (to_type
, value_as_long (arg2
));
473 else if ((code1
== TYPE_CODE_INT
|| code1
== TYPE_CODE_ENUM
474 || code1
== TYPE_CODE_RANGE
)
475 && (scalar
|| code2
== TYPE_CODE_PTR
476 || code2
== TYPE_CODE_MEMBERPTR
))
480 /* When we cast pointers to integers, we mustn't use
481 gdbarch_pointer_to_address to find the address the pointer
482 represents, as value_as_long would. GDB should evaluate
483 expressions just as the compiler would --- and the compiler
484 sees a cast as a simple reinterpretation of the pointer's
486 if (code2
== TYPE_CODE_PTR
)
487 longest
= extract_unsigned_integer
488 (value_contents (arg2
), TYPE_LENGTH (type2
),
489 gdbarch_byte_order (get_type_arch (type2
)));
491 longest
= value_as_long (arg2
);
492 return value_from_longest (to_type
, convert_to_boolean
?
493 (LONGEST
) (longest
? 1 : 0) : longest
);
495 else if (code1
== TYPE_CODE_PTR
&& (code2
== TYPE_CODE_INT
496 || code2
== TYPE_CODE_ENUM
497 || code2
== TYPE_CODE_RANGE
))
499 /* TYPE_LENGTH (type) is the length of a pointer, but we really
500 want the length of an address! -- we are really dealing with
501 addresses (i.e., gdb representations) not pointers (i.e.,
502 target representations) here.
504 This allows things like "print *(int *)0x01000234" to work
505 without printing a misleading message -- which would
506 otherwise occur when dealing with a target having two byte
507 pointers and four byte addresses. */
509 int addr_bit
= gdbarch_addr_bit (get_type_arch (type2
));
510 LONGEST longest
= value_as_long (arg2
);
512 if (addr_bit
< sizeof (LONGEST
) * HOST_CHAR_BIT
)
514 if (longest
>= ((LONGEST
) 1 << addr_bit
)
515 || longest
<= -((LONGEST
) 1 << addr_bit
))
516 warning (_("value truncated"));
518 return value_from_longest (to_type
, longest
);
520 else if (code1
== TYPE_CODE_METHODPTR
&& code2
== TYPE_CODE_INT
521 && value_as_long (arg2
) == 0)
523 struct value
*result
= allocate_value (to_type
);
525 cplus_make_method_ptr (to_type
, value_contents_writeable (result
), 0, 0);
528 else if (code1
== TYPE_CODE_MEMBERPTR
&& code2
== TYPE_CODE_INT
529 && value_as_long (arg2
) == 0)
531 /* The Itanium C++ ABI represents NULL pointers to members as
532 minus one, instead of biasing the normal case. */
533 return value_from_longest (to_type
, -1);
535 else if (code1
== TYPE_CODE_ARRAY
&& TYPE_VECTOR (type
)
536 && code2
== TYPE_CODE_ARRAY
&& TYPE_VECTOR (type2
)
537 && TYPE_LENGTH (type
) != TYPE_LENGTH (type2
))
538 error (_("Cannot convert between vector values of different sizes"));
539 else if (code1
== TYPE_CODE_ARRAY
&& TYPE_VECTOR (type
) && scalar
540 && TYPE_LENGTH (type
) != TYPE_LENGTH (type2
))
541 error (_("can only cast scalar to vector of same size"));
542 else if (code1
== TYPE_CODE_VOID
)
544 return value_zero (to_type
, not_lval
);
546 else if (TYPE_LENGTH (type
) == TYPE_LENGTH (type2
))
548 if (code1
== TYPE_CODE_PTR
&& code2
== TYPE_CODE_PTR
)
549 return value_cast_pointers (to_type
, arg2
, 0);
551 arg2
= value_copy (arg2
);
552 deprecated_set_value_type (arg2
, to_type
);
553 set_value_enclosing_type (arg2
, to_type
);
554 set_value_pointed_to_offset (arg2
, 0); /* pai: chk_val */
557 else if (VALUE_LVAL (arg2
) == lval_memory
)
558 return value_at_lazy (to_type
, value_address (arg2
));
561 error (_("Invalid cast."));
566 /* The C++ reinterpret_cast operator. */
569 value_reinterpret_cast (struct type
*type
, struct value
*arg
)
571 struct value
*result
;
572 struct type
*real_type
= check_typedef (type
);
573 struct type
*arg_type
, *dest_type
;
575 enum type_code dest_code
, arg_code
;
577 /* Do reference, function, and array conversion. */
578 arg
= coerce_array (arg
);
580 /* Attempt to preserve the type the user asked for. */
583 /* If we are casting to a reference type, transform
584 reinterpret_cast<T&[&]>(V) to *reinterpret_cast<T*>(&V). */
585 if (TYPE_IS_REFERENCE (real_type
))
588 arg
= value_addr (arg
);
589 dest_type
= lookup_pointer_type (TYPE_TARGET_TYPE (dest_type
));
590 real_type
= lookup_pointer_type (real_type
);
593 arg_type
= value_type (arg
);
595 dest_code
= TYPE_CODE (real_type
);
596 arg_code
= TYPE_CODE (arg_type
);
598 /* We can convert pointer types, or any pointer type to int, or int
600 if ((dest_code
== TYPE_CODE_PTR
&& arg_code
== TYPE_CODE_INT
)
601 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_PTR
)
602 || (dest_code
== TYPE_CODE_METHODPTR
&& arg_code
== TYPE_CODE_INT
)
603 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_METHODPTR
)
604 || (dest_code
== TYPE_CODE_MEMBERPTR
&& arg_code
== TYPE_CODE_INT
)
605 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_MEMBERPTR
)
606 || (dest_code
== arg_code
607 && (dest_code
== TYPE_CODE_PTR
608 || dest_code
== TYPE_CODE_METHODPTR
609 || dest_code
== TYPE_CODE_MEMBERPTR
)))
610 result
= value_cast (dest_type
, arg
);
612 error (_("Invalid reinterpret_cast"));
615 result
= value_cast (type
, value_ref (value_ind (result
),
621 /* A helper for value_dynamic_cast. This implements the first of two
622 runtime checks: we iterate over all the base classes of the value's
623 class which are equal to the desired class; if only one of these
624 holds the value, then it is the answer. */
627 dynamic_cast_check_1 (struct type
*desired_type
,
628 const gdb_byte
*valaddr
,
629 LONGEST embedded_offset
,
632 struct type
*search_type
,
634 struct type
*arg_type
,
635 struct value
**result
)
637 int i
, result_count
= 0;
639 for (i
= 0; i
< TYPE_N_BASECLASSES (search_type
) && result_count
< 2; ++i
)
641 LONGEST offset
= baseclass_offset (search_type
, i
, valaddr
,
645 if (class_types_same_p (desired_type
, TYPE_BASECLASS (search_type
, i
)))
647 if (address
+ embedded_offset
+ offset
>= arg_addr
648 && address
+ embedded_offset
+ offset
< arg_addr
+ TYPE_LENGTH (arg_type
))
652 *result
= value_at_lazy (TYPE_BASECLASS (search_type
, i
),
653 address
+ embedded_offset
+ offset
);
657 result_count
+= dynamic_cast_check_1 (desired_type
,
659 embedded_offset
+ offset
,
661 TYPE_BASECLASS (search_type
, i
),
670 /* A helper for value_dynamic_cast. This implements the second of two
671 runtime checks: we look for a unique public sibling class of the
672 argument's declared class. */
675 dynamic_cast_check_2 (struct type
*desired_type
,
676 const gdb_byte
*valaddr
,
677 LONGEST embedded_offset
,
680 struct type
*search_type
,
681 struct value
**result
)
683 int i
, result_count
= 0;
685 for (i
= 0; i
< TYPE_N_BASECLASSES (search_type
) && result_count
< 2; ++i
)
689 if (! BASETYPE_VIA_PUBLIC (search_type
, i
))
692 offset
= baseclass_offset (search_type
, i
, valaddr
, embedded_offset
,
694 if (class_types_same_p (desired_type
, TYPE_BASECLASS (search_type
, i
)))
698 *result
= value_at_lazy (TYPE_BASECLASS (search_type
, i
),
699 address
+ embedded_offset
+ offset
);
702 result_count
+= dynamic_cast_check_2 (desired_type
,
704 embedded_offset
+ offset
,
706 TYPE_BASECLASS (search_type
, i
),
713 /* The C++ dynamic_cast operator. */
716 value_dynamic_cast (struct type
*type
, struct value
*arg
)
720 struct type
*resolved_type
= check_typedef (type
);
721 struct type
*arg_type
= check_typedef (value_type (arg
));
722 struct type
*class_type
, *rtti_type
;
723 struct value
*result
, *tem
, *original_arg
= arg
;
725 int is_ref
= TYPE_IS_REFERENCE (resolved_type
);
727 if (TYPE_CODE (resolved_type
) != TYPE_CODE_PTR
728 && !TYPE_IS_REFERENCE (resolved_type
))
729 error (_("Argument to dynamic_cast must be a pointer or reference type"));
730 if (TYPE_CODE (TYPE_TARGET_TYPE (resolved_type
)) != TYPE_CODE_VOID
731 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type
)) != TYPE_CODE_STRUCT
)
732 error (_("Argument to dynamic_cast must be pointer to class or `void *'"));
734 class_type
= check_typedef (TYPE_TARGET_TYPE (resolved_type
));
735 if (TYPE_CODE (resolved_type
) == TYPE_CODE_PTR
)
737 if (TYPE_CODE (arg_type
) != TYPE_CODE_PTR
738 && ! (TYPE_CODE (arg_type
) == TYPE_CODE_INT
739 && value_as_long (arg
) == 0))
740 error (_("Argument to dynamic_cast does not have pointer type"));
741 if (TYPE_CODE (arg_type
) == TYPE_CODE_PTR
)
743 arg_type
= check_typedef (TYPE_TARGET_TYPE (arg_type
));
744 if (TYPE_CODE (arg_type
) != TYPE_CODE_STRUCT
)
745 error (_("Argument to dynamic_cast does "
746 "not have pointer to class type"));
749 /* Handle NULL pointers. */
750 if (value_as_long (arg
) == 0)
751 return value_zero (type
, not_lval
);
753 arg
= value_ind (arg
);
757 if (TYPE_CODE (arg_type
) != TYPE_CODE_STRUCT
)
758 error (_("Argument to dynamic_cast does not have class type"));
761 /* If the classes are the same, just return the argument. */
762 if (class_types_same_p (class_type
, arg_type
))
763 return value_cast (type
, arg
);
765 /* If the target type is a unique base class of the argument's
766 declared type, just cast it. */
767 if (is_ancestor (class_type
, arg_type
))
769 if (is_unique_ancestor (class_type
, arg
))
770 return value_cast (type
, original_arg
);
771 error (_("Ambiguous dynamic_cast"));
774 rtti_type
= value_rtti_type (arg
, &full
, &top
, &using_enc
);
776 error (_("Couldn't determine value's most derived type for dynamic_cast"));
778 /* Compute the most derived object's address. */
779 addr
= value_address (arg
);
787 addr
+= top
+ value_embedded_offset (arg
);
789 /* dynamic_cast<void *> means to return a pointer to the
790 most-derived object. */
791 if (TYPE_CODE (resolved_type
) == TYPE_CODE_PTR
792 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type
)) == TYPE_CODE_VOID
)
793 return value_at_lazy (type
, addr
);
795 tem
= value_at (type
, addr
);
796 type
= value_type (tem
);
798 /* The first dynamic check specified in 5.2.7. */
799 if (is_public_ancestor (arg_type
, TYPE_TARGET_TYPE (resolved_type
)))
801 if (class_types_same_p (rtti_type
, TYPE_TARGET_TYPE (resolved_type
)))
804 if (dynamic_cast_check_1 (TYPE_TARGET_TYPE (resolved_type
),
805 value_contents_for_printing (tem
),
806 value_embedded_offset (tem
),
807 value_address (tem
), tem
,
811 return value_cast (type
,
813 ? value_ref (result
, TYPE_CODE (resolved_type
))
814 : value_addr (result
));
817 /* The second dynamic check specified in 5.2.7. */
819 if (is_public_ancestor (arg_type
, rtti_type
)
820 && dynamic_cast_check_2 (TYPE_TARGET_TYPE (resolved_type
),
821 value_contents_for_printing (tem
),
822 value_embedded_offset (tem
),
823 value_address (tem
), tem
,
824 rtti_type
, &result
) == 1)
825 return value_cast (type
,
827 ? value_ref (result
, TYPE_CODE (resolved_type
))
828 : value_addr (result
));
830 if (TYPE_CODE (resolved_type
) == TYPE_CODE_PTR
)
831 return value_zero (type
, not_lval
);
833 error (_("dynamic_cast failed"));
836 /* Create a value of type TYPE that is zero, and return it. */
839 value_zero (struct type
*type
, enum lval_type lv
)
841 struct value
*val
= allocate_value (type
);
843 VALUE_LVAL (val
) = (lv
== lval_computed
? not_lval
: lv
);
847 /* Create a not_lval value of numeric type TYPE that is one, and return it. */
850 value_one (struct type
*type
)
852 struct type
*type1
= check_typedef (type
);
855 if (is_integral_type (type1
) || is_floating_type (type1
))
857 val
= value_from_longest (type
, (LONGEST
) 1);
859 else if (TYPE_CODE (type1
) == TYPE_CODE_ARRAY
&& TYPE_VECTOR (type1
))
861 struct type
*eltype
= check_typedef (TYPE_TARGET_TYPE (type1
));
863 LONGEST low_bound
, high_bound
;
866 if (!get_array_bounds (type1
, &low_bound
, &high_bound
))
867 error (_("Could not determine the vector bounds"));
869 val
= allocate_value (type
);
870 for (i
= 0; i
< high_bound
- low_bound
+ 1; i
++)
872 tmp
= value_one (eltype
);
873 memcpy (value_contents_writeable (val
) + i
* TYPE_LENGTH (eltype
),
874 value_contents_all (tmp
), TYPE_LENGTH (eltype
));
879 error (_("Not a numeric type."));
882 /* value_one result is never used for assignments to. */
883 gdb_assert (VALUE_LVAL (val
) == not_lval
);
888 /* Helper function for value_at, value_at_lazy, and value_at_lazy_stack.
889 The type of the created value may differ from the passed type TYPE.
890 Make sure to retrieve the returned values's new type after this call
891 e.g. in case the type is a variable length array. */
893 static struct value
*
894 get_value_at (struct type
*type
, CORE_ADDR addr
, int lazy
)
898 if (TYPE_CODE (check_typedef (type
)) == TYPE_CODE_VOID
)
899 error (_("Attempt to dereference a generic pointer."));
901 val
= value_from_contents_and_address (type
, NULL
, addr
);
904 value_fetch_lazy (val
);
909 /* Return a value with type TYPE located at ADDR.
911 Call value_at only if the data needs to be fetched immediately;
912 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
913 value_at_lazy instead. value_at_lazy simply records the address of
914 the data and sets the lazy-evaluation-required flag. The lazy flag
915 is tested in the value_contents macro, which is used if and when
916 the contents are actually required. The type of the created value
917 may differ from the passed type TYPE. Make sure to retrieve the
918 returned values's new type after this call e.g. in case the type
919 is a variable length array.
921 Note: value_at does *NOT* handle embedded offsets; perform such
922 adjustments before or after calling it. */
925 value_at (struct type
*type
, CORE_ADDR addr
)
927 return get_value_at (type
, addr
, 0);
930 /* Return a lazy value with type TYPE located at ADDR (cf. value_at).
931 The type of the created value may differ from the passed type TYPE.
932 Make sure to retrieve the returned values's new type after this call
933 e.g. in case the type is a variable length array. */
936 value_at_lazy (struct type
*type
, CORE_ADDR addr
)
938 return get_value_at (type
, addr
, 1);
942 read_value_memory (struct value
*val
, LONGEST bit_offset
,
943 int stack
, CORE_ADDR memaddr
,
944 gdb_byte
*buffer
, size_t length
)
946 ULONGEST xfered_total
= 0;
947 struct gdbarch
*arch
= get_value_arch (val
);
948 int unit_size
= gdbarch_addressable_memory_unit_size (arch
);
949 enum target_object object
;
951 object
= stack
? TARGET_OBJECT_STACK_MEMORY
: TARGET_OBJECT_MEMORY
;
953 while (xfered_total
< length
)
955 enum target_xfer_status status
;
956 ULONGEST xfered_partial
;
958 status
= target_xfer_partial (current_top_target (),
960 buffer
+ xfered_total
* unit_size
, NULL
,
961 memaddr
+ xfered_total
,
962 length
- xfered_total
,
965 if (status
== TARGET_XFER_OK
)
967 else if (status
== TARGET_XFER_UNAVAILABLE
)
968 mark_value_bits_unavailable (val
, (xfered_total
* HOST_CHAR_BIT
970 xfered_partial
* HOST_CHAR_BIT
);
971 else if (status
== TARGET_XFER_EOF
)
972 memory_error (TARGET_XFER_E_IO
, memaddr
+ xfered_total
);
974 memory_error (status
, memaddr
+ xfered_total
);
976 xfered_total
+= xfered_partial
;
981 /* Store the contents of FROMVAL into the location of TOVAL.
982 Return a new value with the location of TOVAL and contents of FROMVAL. */
985 value_assign (struct value
*toval
, struct value
*fromval
)
989 struct frame_id old_frame
;
991 if (!deprecated_value_modifiable (toval
))
992 error (_("Left operand of assignment is not a modifiable lvalue."));
994 toval
= coerce_ref (toval
);
996 type
= value_type (toval
);
997 if (VALUE_LVAL (toval
) != lval_internalvar
)
998 fromval
= value_cast (type
, fromval
);
1001 /* Coerce arrays and functions to pointers, except for arrays
1002 which only live in GDB's storage. */
1003 if (!value_must_coerce_to_target (fromval
))
1004 fromval
= coerce_array (fromval
);
1007 type
= check_typedef (type
);
1009 /* Since modifying a register can trash the frame chain, and
1010 modifying memory can trash the frame cache, we save the old frame
1011 and then restore the new frame afterwards. */
1012 old_frame
= get_frame_id (deprecated_safe_get_selected_frame ());
1014 switch (VALUE_LVAL (toval
))
1016 case lval_internalvar
:
1017 set_internalvar (VALUE_INTERNALVAR (toval
), fromval
);
1018 return value_of_internalvar (get_type_arch (type
),
1019 VALUE_INTERNALVAR (toval
));
1021 case lval_internalvar_component
:
1023 LONGEST offset
= value_offset (toval
);
1025 /* Are we dealing with a bitfield?
1027 It is important to mention that `value_parent (toval)' is
1028 non-NULL iff `value_bitsize (toval)' is non-zero. */
1029 if (value_bitsize (toval
))
1031 /* VALUE_INTERNALVAR below refers to the parent value, while
1032 the offset is relative to this parent value. */
1033 gdb_assert (value_parent (value_parent (toval
)) == NULL
);
1034 offset
+= value_offset (value_parent (toval
));
1037 set_internalvar_component (VALUE_INTERNALVAR (toval
),
1039 value_bitpos (toval
),
1040 value_bitsize (toval
),
1047 const gdb_byte
*dest_buffer
;
1048 CORE_ADDR changed_addr
;
1050 gdb_byte buffer
[sizeof (LONGEST
)];
1052 if (value_bitsize (toval
))
1054 struct value
*parent
= value_parent (toval
);
1056 changed_addr
= value_address (parent
) + value_offset (toval
);
1057 changed_len
= (value_bitpos (toval
)
1058 + value_bitsize (toval
)
1059 + HOST_CHAR_BIT
- 1)
1062 /* If we can read-modify-write exactly the size of the
1063 containing type (e.g. short or int) then do so. This
1064 is safer for volatile bitfields mapped to hardware
1066 if (changed_len
< TYPE_LENGTH (type
)
1067 && TYPE_LENGTH (type
) <= (int) sizeof (LONGEST
)
1068 && ((LONGEST
) changed_addr
% TYPE_LENGTH (type
)) == 0)
1069 changed_len
= TYPE_LENGTH (type
);
1071 if (changed_len
> (int) sizeof (LONGEST
))
1072 error (_("Can't handle bitfields which "
1073 "don't fit in a %d bit word."),
1074 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
1076 read_memory (changed_addr
, buffer
, changed_len
);
1077 modify_field (type
, buffer
, value_as_long (fromval
),
1078 value_bitpos (toval
), value_bitsize (toval
));
1079 dest_buffer
= buffer
;
1083 changed_addr
= value_address (toval
);
1084 changed_len
= type_length_units (type
);
1085 dest_buffer
= value_contents (fromval
);
1088 write_memory_with_notification (changed_addr
, dest_buffer
, changed_len
);
1094 struct frame_info
*frame
;
1095 struct gdbarch
*gdbarch
;
1098 /* Figure out which frame this is in currently.
1100 We use VALUE_FRAME_ID for obtaining the value's frame id instead of
1101 VALUE_NEXT_FRAME_ID due to requiring a frame which may be passed to
1102 put_frame_register_bytes() below. That function will (eventually)
1103 perform the necessary unwind operation by first obtaining the next
1105 frame
= frame_find_by_id (VALUE_FRAME_ID (toval
));
1107 value_reg
= VALUE_REGNUM (toval
);
1110 error (_("Value being assigned to is no longer active."));
1112 gdbarch
= get_frame_arch (frame
);
1114 if (value_bitsize (toval
))
1116 struct value
*parent
= value_parent (toval
);
1117 LONGEST offset
= value_offset (parent
) + value_offset (toval
);
1119 gdb_byte buffer
[sizeof (LONGEST
)];
1122 changed_len
= (value_bitpos (toval
)
1123 + value_bitsize (toval
)
1124 + HOST_CHAR_BIT
- 1)
1127 if (changed_len
> (int) sizeof (LONGEST
))
1128 error (_("Can't handle bitfields which "
1129 "don't fit in a %d bit word."),
1130 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
1132 if (!get_frame_register_bytes (frame
, value_reg
, offset
,
1133 changed_len
, buffer
,
1137 throw_error (OPTIMIZED_OUT_ERROR
,
1138 _("value has been optimized out"));
1140 throw_error (NOT_AVAILABLE_ERROR
,
1141 _("value is not available"));
1144 modify_field (type
, buffer
, value_as_long (fromval
),
1145 value_bitpos (toval
), value_bitsize (toval
));
1147 put_frame_register_bytes (frame
, value_reg
, offset
,
1148 changed_len
, buffer
);
1152 if (gdbarch_convert_register_p (gdbarch
, VALUE_REGNUM (toval
),
1155 /* If TOVAL is a special machine register requiring
1156 conversion of program values to a special raw
1158 gdbarch_value_to_register (gdbarch
, frame
,
1159 VALUE_REGNUM (toval
), type
,
1160 value_contents (fromval
));
1164 put_frame_register_bytes (frame
, value_reg
,
1165 value_offset (toval
),
1167 value_contents (fromval
));
1171 gdb::observers::register_changed
.notify (frame
, value_reg
);
1177 const struct lval_funcs
*funcs
= value_computed_funcs (toval
);
1179 if (funcs
->write
!= NULL
)
1181 funcs
->write (toval
, fromval
);
1188 error (_("Left operand of assignment is not an lvalue."));
1191 /* Assigning to the stack pointer, frame pointer, and other
1192 (architecture and calling convention specific) registers may
1193 cause the frame cache and regcache to be out of date. Assigning to memory
1194 also can. We just do this on all assignments to registers or
1195 memory, for simplicity's sake; I doubt the slowdown matters. */
1196 switch (VALUE_LVAL (toval
))
1202 gdb::observers::target_changed
.notify (current_top_target ());
1204 /* Having destroyed the frame cache, restore the selected
1207 /* FIXME: cagney/2002-11-02: There has to be a better way of
1208 doing this. Instead of constantly saving/restoring the
1209 frame. Why not create a get_selected_frame() function that,
1210 having saved the selected frame's ID can automatically
1211 re-find the previously selected frame automatically. */
1214 struct frame_info
*fi
= frame_find_by_id (old_frame
);
1225 /* If the field does not entirely fill a LONGEST, then zero the sign
1226 bits. If the field is signed, and is negative, then sign
1228 if ((value_bitsize (toval
) > 0)
1229 && (value_bitsize (toval
) < 8 * (int) sizeof (LONGEST
)))
1231 LONGEST fieldval
= value_as_long (fromval
);
1232 LONGEST valmask
= (((ULONGEST
) 1) << value_bitsize (toval
)) - 1;
1234 fieldval
&= valmask
;
1235 if (!TYPE_UNSIGNED (type
)
1236 && (fieldval
& (valmask
^ (valmask
>> 1))))
1237 fieldval
|= ~valmask
;
1239 fromval
= value_from_longest (type
, fieldval
);
1242 /* The return value is a copy of TOVAL so it shares its location
1243 information, but its contents are updated from FROMVAL. This
1244 implies the returned value is not lazy, even if TOVAL was. */
1245 val
= value_copy (toval
);
1246 set_value_lazy (val
, 0);
1247 memcpy (value_contents_raw (val
), value_contents (fromval
),
1248 TYPE_LENGTH (type
));
1250 /* We copy over the enclosing type and pointed-to offset from FROMVAL
1251 in the case of pointer types. For object types, the enclosing type
1252 and embedded offset must *not* be copied: the target object refered
1253 to by TOVAL retains its original dynamic type after assignment. */
1254 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1256 set_value_enclosing_type (val
, value_enclosing_type (fromval
));
1257 set_value_pointed_to_offset (val
, value_pointed_to_offset (fromval
));
1263 /* Extend a value VAL to COUNT repetitions of its type. */
1266 value_repeat (struct value
*arg1
, int count
)
1270 if (VALUE_LVAL (arg1
) != lval_memory
)
1271 error (_("Only values in memory can be extended with '@'."));
1273 error (_("Invalid number %d of repetitions."), count
);
1275 val
= allocate_repeat_value (value_enclosing_type (arg1
), count
);
1277 VALUE_LVAL (val
) = lval_memory
;
1278 set_value_address (val
, value_address (arg1
));
1280 read_value_memory (val
, 0, value_stack (val
), value_address (val
),
1281 value_contents_all_raw (val
),
1282 type_length_units (value_enclosing_type (val
)));
1288 value_of_variable (struct symbol
*var
, const struct block
*b
)
1290 struct frame_info
*frame
= NULL
;
1292 if (symbol_read_needs_frame (var
))
1293 frame
= get_selected_frame (_("No frame selected."));
1295 return read_var_value (var
, b
, frame
);
1299 address_of_variable (struct symbol
*var
, const struct block
*b
)
1301 struct type
*type
= SYMBOL_TYPE (var
);
1304 /* Evaluate it first; if the result is a memory address, we're fine.
1305 Lazy evaluation pays off here. */
1307 val
= value_of_variable (var
, b
);
1308 type
= value_type (val
);
1310 if ((VALUE_LVAL (val
) == lval_memory
&& value_lazy (val
))
1311 || TYPE_CODE (type
) == TYPE_CODE_FUNC
)
1313 CORE_ADDR addr
= value_address (val
);
1315 return value_from_pointer (lookup_pointer_type (type
), addr
);
1318 /* Not a memory address; check what the problem was. */
1319 switch (VALUE_LVAL (val
))
1323 struct frame_info
*frame
;
1324 const char *regname
;
1326 frame
= frame_find_by_id (VALUE_NEXT_FRAME_ID (val
));
1329 regname
= gdbarch_register_name (get_frame_arch (frame
),
1330 VALUE_REGNUM (val
));
1331 gdb_assert (regname
&& *regname
);
1333 error (_("Address requested for identifier "
1334 "\"%s\" which is in register $%s"),
1335 SYMBOL_PRINT_NAME (var
), regname
);
1340 error (_("Can't take address of \"%s\" which isn't an lvalue."),
1341 SYMBOL_PRINT_NAME (var
));
1348 /* Return one if VAL does not live in target memory, but should in order
1349 to operate on it. Otherwise return zero. */
1352 value_must_coerce_to_target (struct value
*val
)
1354 struct type
*valtype
;
1356 /* The only lval kinds which do not live in target memory. */
1357 if (VALUE_LVAL (val
) != not_lval
1358 && VALUE_LVAL (val
) != lval_internalvar
1359 && VALUE_LVAL (val
) != lval_xcallable
)
1362 valtype
= check_typedef (value_type (val
));
1364 switch (TYPE_CODE (valtype
))
1366 case TYPE_CODE_ARRAY
:
1367 return TYPE_VECTOR (valtype
) ? 0 : 1;
1368 case TYPE_CODE_STRING
:
1375 /* Make sure that VAL lives in target memory if it's supposed to. For
1376 instance, strings are constructed as character arrays in GDB's
1377 storage, and this function copies them to the target. */
1380 value_coerce_to_target (struct value
*val
)
1385 if (!value_must_coerce_to_target (val
))
1388 length
= TYPE_LENGTH (check_typedef (value_type (val
)));
1389 addr
= allocate_space_in_inferior (length
);
1390 write_memory (addr
, value_contents (val
), length
);
1391 return value_at_lazy (value_type (val
), addr
);
1394 /* Given a value which is an array, return a value which is a pointer
1395 to its first element, regardless of whether or not the array has a
1396 nonzero lower bound.
1398 FIXME: A previous comment here indicated that this routine should
1399 be substracting the array's lower bound. It's not clear to me that
1400 this is correct. Given an array subscripting operation, it would
1401 certainly work to do the adjustment here, essentially computing:
1403 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
1405 However I believe a more appropriate and logical place to account
1406 for the lower bound is to do so in value_subscript, essentially
1409 (&array[0] + ((index - lowerbound) * sizeof array[0]))
1411 As further evidence consider what would happen with operations
1412 other than array subscripting, where the caller would get back a
1413 value that had an address somewhere before the actual first element
1414 of the array, and the information about the lower bound would be
1415 lost because of the coercion to pointer type. */
1418 value_coerce_array (struct value
*arg1
)
1420 struct type
*type
= check_typedef (value_type (arg1
));
1422 /* If the user tries to do something requiring a pointer with an
1423 array that has not yet been pushed to the target, then this would
1424 be a good time to do so. */
1425 arg1
= value_coerce_to_target (arg1
);
1427 if (VALUE_LVAL (arg1
) != lval_memory
)
1428 error (_("Attempt to take address of value not located in memory."));
1430 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
1431 value_address (arg1
));
1434 /* Given a value which is a function, return a value which is a pointer
1438 value_coerce_function (struct value
*arg1
)
1440 struct value
*retval
;
1442 if (VALUE_LVAL (arg1
) != lval_memory
)
1443 error (_("Attempt to take address of value not located in memory."));
1445 retval
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1446 value_address (arg1
));
1450 /* Return a pointer value for the object for which ARG1 is the
1454 value_addr (struct value
*arg1
)
1457 struct type
*type
= check_typedef (value_type (arg1
));
1459 if (TYPE_IS_REFERENCE (type
))
1461 if (value_bits_synthetic_pointer (arg1
, value_embedded_offset (arg1
),
1462 TARGET_CHAR_BIT
* TYPE_LENGTH (type
)))
1463 arg1
= coerce_ref (arg1
);
1466 /* Copy the value, but change the type from (T&) to (T*). We
1467 keep the same location information, which is efficient, and
1468 allows &(&X) to get the location containing the reference.
1469 Do the same to its enclosing type for consistency. */
1470 struct type
*type_ptr
1471 = lookup_pointer_type (TYPE_TARGET_TYPE (type
));
1472 struct type
*enclosing_type
1473 = check_typedef (value_enclosing_type (arg1
));
1474 struct type
*enclosing_type_ptr
1475 = lookup_pointer_type (TYPE_TARGET_TYPE (enclosing_type
));
1477 arg2
= value_copy (arg1
);
1478 deprecated_set_value_type (arg2
, type_ptr
);
1479 set_value_enclosing_type (arg2
, enclosing_type_ptr
);
1484 if (TYPE_CODE (type
) == TYPE_CODE_FUNC
)
1485 return value_coerce_function (arg1
);
1487 /* If this is an array that has not yet been pushed to the target,
1488 then this would be a good time to force it to memory. */
1489 arg1
= value_coerce_to_target (arg1
);
1491 if (VALUE_LVAL (arg1
) != lval_memory
)
1492 error (_("Attempt to take address of value not located in memory."));
1494 /* Get target memory address. */
1495 arg2
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1496 (value_address (arg1
)
1497 + value_embedded_offset (arg1
)));
1499 /* This may be a pointer to a base subobject; so remember the
1500 full derived object's type ... */
1501 set_value_enclosing_type (arg2
,
1502 lookup_pointer_type (value_enclosing_type (arg1
)));
1503 /* ... and also the relative position of the subobject in the full
1505 set_value_pointed_to_offset (arg2
, value_embedded_offset (arg1
));
1509 /* Return a reference value for the object for which ARG1 is the
1513 value_ref (struct value
*arg1
, enum type_code refcode
)
1516 struct type
*type
= check_typedef (value_type (arg1
));
1518 gdb_assert (refcode
== TYPE_CODE_REF
|| refcode
== TYPE_CODE_RVALUE_REF
);
1520 if ((TYPE_CODE (type
) == TYPE_CODE_REF
1521 || TYPE_CODE (type
) == TYPE_CODE_RVALUE_REF
)
1522 && TYPE_CODE (type
) == refcode
)
1525 arg2
= value_addr (arg1
);
1526 deprecated_set_value_type (arg2
, lookup_reference_type (type
, refcode
));
1530 /* Given a value of a pointer type, apply the C unary * operator to
1534 value_ind (struct value
*arg1
)
1536 struct type
*base_type
;
1539 arg1
= coerce_array (arg1
);
1541 base_type
= check_typedef (value_type (arg1
));
1543 if (VALUE_LVAL (arg1
) == lval_computed
)
1545 const struct lval_funcs
*funcs
= value_computed_funcs (arg1
);
1547 if (funcs
->indirect
)
1549 struct value
*result
= funcs
->indirect (arg1
);
1556 if (TYPE_CODE (base_type
) == TYPE_CODE_PTR
)
1558 struct type
*enc_type
;
1560 /* We may be pointing to something embedded in a larger object.
1561 Get the real type of the enclosing object. */
1562 enc_type
= check_typedef (value_enclosing_type (arg1
));
1563 enc_type
= TYPE_TARGET_TYPE (enc_type
);
1565 if (TYPE_CODE (check_typedef (enc_type
)) == TYPE_CODE_FUNC
1566 || TYPE_CODE (check_typedef (enc_type
)) == TYPE_CODE_METHOD
)
1567 /* For functions, go through find_function_addr, which knows
1568 how to handle function descriptors. */
1569 arg2
= value_at_lazy (enc_type
,
1570 find_function_addr (arg1
, NULL
));
1572 /* Retrieve the enclosing object pointed to. */
1573 arg2
= value_at_lazy (enc_type
,
1574 (value_as_address (arg1
)
1575 - value_pointed_to_offset (arg1
)));
1577 enc_type
= value_type (arg2
);
1578 return readjust_indirect_value_type (arg2
, enc_type
, base_type
, arg1
);
1581 error (_("Attempt to take contents of a non-pointer value."));
1584 /* Create a value for an array by allocating space in GDB, copying the
1585 data into that space, and then setting up an array value.
1587 The array bounds are set from LOWBOUND and HIGHBOUND, and the array
1588 is populated from the values passed in ELEMVEC.
1590 The element type of the array is inherited from the type of the
1591 first element, and all elements must have the same size (though we
1592 don't currently enforce any restriction on their types). */
1595 value_array (int lowbound
, int highbound
, struct value
**elemvec
)
1599 ULONGEST typelength
;
1601 struct type
*arraytype
;
1603 /* Validate that the bounds are reasonable and that each of the
1604 elements have the same size. */
1606 nelem
= highbound
- lowbound
+ 1;
1609 error (_("bad array bounds (%d, %d)"), lowbound
, highbound
);
1611 typelength
= type_length_units (value_enclosing_type (elemvec
[0]));
1612 for (idx
= 1; idx
< nelem
; idx
++)
1614 if (type_length_units (value_enclosing_type (elemvec
[idx
]))
1617 error (_("array elements must all be the same size"));
1621 arraytype
= lookup_array_range_type (value_enclosing_type (elemvec
[0]),
1622 lowbound
, highbound
);
1624 if (!current_language
->c_style_arrays
)
1626 val
= allocate_value (arraytype
);
1627 for (idx
= 0; idx
< nelem
; idx
++)
1628 value_contents_copy (val
, idx
* typelength
, elemvec
[idx
], 0,
1633 /* Allocate space to store the array, and then initialize it by
1634 copying in each element. */
1636 val
= allocate_value (arraytype
);
1637 for (idx
= 0; idx
< nelem
; idx
++)
1638 value_contents_copy (val
, idx
* typelength
, elemvec
[idx
], 0, typelength
);
1643 value_cstring (const char *ptr
, ssize_t len
, struct type
*char_type
)
1646 int lowbound
= current_language
->string_lower_bound
;
1647 ssize_t highbound
= len
/ TYPE_LENGTH (char_type
);
1648 struct type
*stringtype
1649 = lookup_array_range_type (char_type
, lowbound
, highbound
+ lowbound
- 1);
1651 val
= allocate_value (stringtype
);
1652 memcpy (value_contents_raw (val
), ptr
, len
);
1656 /* Create a value for a string constant by allocating space in the
1657 inferior, copying the data into that space, and returning the
1658 address with type TYPE_CODE_STRING. PTR points to the string
1659 constant data; LEN is number of characters.
1661 Note that string types are like array of char types with a lower
1662 bound of zero and an upper bound of LEN - 1. Also note that the
1663 string may contain embedded null bytes. */
1666 value_string (const char *ptr
, ssize_t len
, struct type
*char_type
)
1669 int lowbound
= current_language
->string_lower_bound
;
1670 ssize_t highbound
= len
/ TYPE_LENGTH (char_type
);
1671 struct type
*stringtype
1672 = lookup_string_range_type (char_type
, lowbound
, highbound
+ lowbound
- 1);
1674 val
= allocate_value (stringtype
);
1675 memcpy (value_contents_raw (val
), ptr
, len
);
1680 /* See if we can pass arguments in T2 to a function which takes
1681 arguments of types T1. T1 is a list of NARGS arguments, and T2 is
1682 a NULL-terminated vector. If some arguments need coercion of some
1683 sort, then the coerced values are written into T2. Return value is
1684 0 if the arguments could be matched, or the position at which they
1687 STATICP is nonzero if the T1 argument list came from a static
1688 member function. T2 will still include the ``this'' pointer, but
1691 For non-static member functions, we ignore the first argument,
1692 which is the type of the instance variable. This is because we
1693 want to handle calls with objects from derived classes. This is
1694 not entirely correct: we should actually check to make sure that a
1695 requested operation is type secure, shouldn't we? FIXME. */
1698 typecmp (int staticp
, int varargs
, int nargs
,
1699 struct field t1
[], struct value
*t2
[])
1704 internal_error (__FILE__
, __LINE__
,
1705 _("typecmp: no argument list"));
1707 /* Skip ``this'' argument if applicable. T2 will always include
1713 (i
< nargs
) && TYPE_CODE (t1
[i
].type
) != TYPE_CODE_VOID
;
1716 struct type
*tt1
, *tt2
;
1721 tt1
= check_typedef (t1
[i
].type
);
1722 tt2
= check_typedef (value_type (t2
[i
]));
1724 if (TYPE_IS_REFERENCE (tt1
)
1725 /* We should be doing hairy argument matching, as below. */
1726 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1
)))
1727 == TYPE_CODE (tt2
)))
1729 if (TYPE_CODE (tt2
) == TYPE_CODE_ARRAY
)
1730 t2
[i
] = value_coerce_array (t2
[i
]);
1732 t2
[i
] = value_ref (t2
[i
], TYPE_CODE (tt1
));
1736 /* djb - 20000715 - Until the new type structure is in the
1737 place, and we can attempt things like implicit conversions,
1738 we need to do this so you can take something like a map<const
1739 char *>, and properly access map["hello"], because the
1740 argument to [] will be a reference to a pointer to a char,
1741 and the argument will be a pointer to a char. */
1742 while (TYPE_IS_REFERENCE (tt1
) || TYPE_CODE (tt1
) == TYPE_CODE_PTR
)
1744 tt1
= check_typedef( TYPE_TARGET_TYPE(tt1
) );
1746 while (TYPE_CODE(tt2
) == TYPE_CODE_ARRAY
1747 || TYPE_CODE(tt2
) == TYPE_CODE_PTR
1748 || TYPE_IS_REFERENCE (tt2
))
1750 tt2
= check_typedef (TYPE_TARGET_TYPE(tt2
));
1752 if (TYPE_CODE (tt1
) == TYPE_CODE (tt2
))
1754 /* Array to pointer is a `trivial conversion' according to the
1757 /* We should be doing much hairier argument matching (see
1758 section 13.2 of the ARM), but as a quick kludge, just check
1759 for the same type code. */
1760 if (TYPE_CODE (t1
[i
].type
) != TYPE_CODE (value_type (t2
[i
])))
1763 if (varargs
|| t2
[i
] == NULL
)
1768 /* Helper class for do_search_struct_field that updates *RESULT_PTR
1769 and *LAST_BOFFSET, and possibly throws an exception if the field
1770 search has yielded ambiguous results. */
1773 update_search_result (struct value
**result_ptr
, struct value
*v
,
1774 LONGEST
*last_boffset
, LONGEST boffset
,
1775 const char *name
, struct type
*type
)
1779 if (*result_ptr
!= NULL
1780 /* The result is not ambiguous if all the classes that are
1781 found occupy the same space. */
1782 && *last_boffset
!= boffset
)
1783 error (_("base class '%s' is ambiguous in type '%s'"),
1784 name
, TYPE_SAFE_NAME (type
));
1786 *last_boffset
= boffset
;
1790 /* A helper for search_struct_field. This does all the work; most
1791 arguments are as passed to search_struct_field. The result is
1792 stored in *RESULT_PTR, which must be initialized to NULL.
1793 OUTERMOST_TYPE is the type of the initial type passed to
1794 search_struct_field; this is used for error reporting when the
1795 lookup is ambiguous. */
1798 do_search_struct_field (const char *name
, struct value
*arg1
, LONGEST offset
,
1799 struct type
*type
, int looking_for_baseclass
,
1800 struct value
**result_ptr
,
1801 LONGEST
*last_boffset
,
1802 struct type
*outermost_type
)
1807 type
= check_typedef (type
);
1808 nbases
= TYPE_N_BASECLASSES (type
);
1810 if (!looking_for_baseclass
)
1811 for (i
= TYPE_NFIELDS (type
) - 1; i
>= nbases
; i
--)
1813 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
1815 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1819 if (field_is_static (&TYPE_FIELD (type
, i
)))
1820 v
= value_static_field (type
, i
);
1822 v
= value_primitive_field (arg1
, offset
, i
, type
);
1828 && t_field_name
[0] == '\0')
1830 struct type
*field_type
= TYPE_FIELD_TYPE (type
, i
);
1832 if (TYPE_CODE (field_type
) == TYPE_CODE_UNION
1833 || TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
)
1835 /* Look for a match through the fields of an anonymous
1836 union, or anonymous struct. C++ provides anonymous
1839 In the GNU Chill (now deleted from GDB)
1840 implementation of variant record types, each
1841 <alternative field> has an (anonymous) union type,
1842 each member of the union represents a <variant
1843 alternative>. Each <variant alternative> is
1844 represented as a struct, with a member for each
1847 struct value
*v
= NULL
;
1848 LONGEST new_offset
= offset
;
1850 /* This is pretty gross. In G++, the offset in an
1851 anonymous union is relative to the beginning of the
1852 enclosing struct. In the GNU Chill (now deleted
1853 from GDB) implementation of variant records, the
1854 bitpos is zero in an anonymous union field, so we
1855 have to add the offset of the union here. */
1856 if (TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
1857 || (TYPE_NFIELDS (field_type
) > 0
1858 && TYPE_FIELD_BITPOS (field_type
, 0) == 0))
1859 new_offset
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
1861 do_search_struct_field (name
, arg1
, new_offset
,
1863 looking_for_baseclass
, &v
,
1875 for (i
= 0; i
< nbases
; i
++)
1877 struct value
*v
= NULL
;
1878 struct type
*basetype
= check_typedef (TYPE_BASECLASS (type
, i
));
1879 /* If we are looking for baseclasses, this is what we get when
1880 we hit them. But it could happen that the base part's member
1881 name is not yet filled in. */
1882 int found_baseclass
= (looking_for_baseclass
1883 && TYPE_BASECLASS_NAME (type
, i
) != NULL
1884 && (strcmp_iw (name
,
1885 TYPE_BASECLASS_NAME (type
,
1887 LONGEST boffset
= value_embedded_offset (arg1
) + offset
;
1889 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1893 boffset
= baseclass_offset (type
, i
,
1894 value_contents_for_printing (arg1
),
1895 value_embedded_offset (arg1
) + offset
,
1896 value_address (arg1
),
1899 /* The virtual base class pointer might have been clobbered
1900 by the user program. Make sure that it still points to a
1901 valid memory location. */
1903 boffset
+= value_embedded_offset (arg1
) + offset
;
1905 || boffset
>= TYPE_LENGTH (value_enclosing_type (arg1
)))
1907 CORE_ADDR base_addr
;
1909 base_addr
= value_address (arg1
) + boffset
;
1910 v2
= value_at_lazy (basetype
, base_addr
);
1911 if (target_read_memory (base_addr
,
1912 value_contents_raw (v2
),
1913 TYPE_LENGTH (value_type (v2
))) != 0)
1914 error (_("virtual baseclass botch"));
1918 v2
= value_copy (arg1
);
1919 deprecated_set_value_type (v2
, basetype
);
1920 set_value_embedded_offset (v2
, boffset
);
1923 if (found_baseclass
)
1927 do_search_struct_field (name
, v2
, 0,
1928 TYPE_BASECLASS (type
, i
),
1929 looking_for_baseclass
,
1930 result_ptr
, last_boffset
,
1934 else if (found_baseclass
)
1935 v
= value_primitive_field (arg1
, offset
, i
, type
);
1938 do_search_struct_field (name
, arg1
,
1939 offset
+ TYPE_BASECLASS_BITPOS (type
,
1941 basetype
, looking_for_baseclass
,
1942 result_ptr
, last_boffset
,
1946 update_search_result (result_ptr
, v
, last_boffset
,
1947 boffset
, name
, outermost_type
);
1951 /* Helper function used by value_struct_elt to recurse through
1952 baseclasses. Look for a field NAME in ARG1. Search in it assuming
1953 it has (class) type TYPE. If found, return value, else return NULL.
1955 If LOOKING_FOR_BASECLASS, then instead of looking for struct
1956 fields, look for a baseclass named NAME. */
1958 static struct value
*
1959 search_struct_field (const char *name
, struct value
*arg1
,
1960 struct type
*type
, int looking_for_baseclass
)
1962 struct value
*result
= NULL
;
1963 LONGEST boffset
= 0;
1965 do_search_struct_field (name
, arg1
, 0, type
, looking_for_baseclass
,
1966 &result
, &boffset
, type
);
1970 /* Helper function used by value_struct_elt to recurse through
1971 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1972 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1975 If found, return value, else if name matched and args not return
1976 (value) -1, else return NULL. */
1978 static struct value
*
1979 search_struct_method (const char *name
, struct value
**arg1p
,
1980 struct value
**args
, LONGEST offset
,
1981 int *static_memfuncp
, struct type
*type
)
1985 int name_matched
= 0;
1986 char dem_opname
[64];
1988 type
= check_typedef (type
);
1989 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
1991 const char *t_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
1993 /* FIXME! May need to check for ARM demangling here. */
1994 if (startswith (t_field_name
, "__") ||
1995 startswith (t_field_name
, "op") ||
1996 startswith (t_field_name
, "type"))
1998 if (cplus_demangle_opname (t_field_name
, dem_opname
, DMGL_ANSI
))
1999 t_field_name
= dem_opname
;
2000 else if (cplus_demangle_opname (t_field_name
, dem_opname
, 0))
2001 t_field_name
= dem_opname
;
2003 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
2005 int j
= TYPE_FN_FIELDLIST_LENGTH (type
, i
) - 1;
2006 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
2009 check_stub_method_group (type
, i
);
2010 if (j
> 0 && args
== 0)
2011 error (_("cannot resolve overloaded method "
2012 "`%s': no arguments supplied"), name
);
2013 else if (j
== 0 && args
== 0)
2015 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
2022 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f
, j
),
2023 TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f
, j
)),
2024 TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f
, j
)),
2025 TYPE_FN_FIELD_ARGS (f
, j
), args
))
2027 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
2028 return value_virtual_fn_field (arg1p
, f
, j
,
2030 if (TYPE_FN_FIELD_STATIC_P (f
, j
)
2032 *static_memfuncp
= 1;
2033 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
2042 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2044 LONGEST base_offset
;
2045 LONGEST this_offset
;
2047 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2049 struct type
*baseclass
= check_typedef (TYPE_BASECLASS (type
, i
));
2050 struct value
*base_val
;
2051 const gdb_byte
*base_valaddr
;
2053 /* The virtual base class pointer might have been
2054 clobbered by the user program. Make sure that it
2055 still points to a valid memory location. */
2057 if (offset
< 0 || offset
>= TYPE_LENGTH (type
))
2061 gdb::byte_vector
tmp (TYPE_LENGTH (baseclass
));
2062 address
= value_address (*arg1p
);
2064 if (target_read_memory (address
+ offset
,
2065 tmp
.data (), TYPE_LENGTH (baseclass
)) != 0)
2066 error (_("virtual baseclass botch"));
2068 base_val
= value_from_contents_and_address (baseclass
,
2071 base_valaddr
= value_contents_for_printing (base_val
);
2077 base_valaddr
= value_contents_for_printing (*arg1p
);
2078 this_offset
= offset
;
2081 base_offset
= baseclass_offset (type
, i
, base_valaddr
,
2082 this_offset
, value_address (base_val
),
2087 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2089 v
= search_struct_method (name
, arg1p
, args
, base_offset
+ offset
,
2090 static_memfuncp
, TYPE_BASECLASS (type
, i
));
2091 if (v
== (struct value
*) - 1)
2097 /* FIXME-bothner: Why is this commented out? Why is it here? */
2098 /* *arg1p = arg1_tmp; */
2103 return (struct value
*) - 1;
2108 /* Given *ARGP, a value of type (pointer to a)* structure/union,
2109 extract the component named NAME from the ultimate target
2110 structure/union and return it as a value with its appropriate type.
2111 ERR is used in the error message if *ARGP's type is wrong.
2113 C++: ARGS is a list of argument types to aid in the selection of
2114 an appropriate method. Also, handle derived types.
2116 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
2117 where the truthvalue of whether the function that was resolved was
2118 a static member function or not is stored.
2120 ERR is an error message to be printed in case the field is not
2124 value_struct_elt (struct value
**argp
, struct value
**args
,
2125 const char *name
, int *static_memfuncp
, const char *err
)
2130 *argp
= coerce_array (*argp
);
2132 t
= check_typedef (value_type (*argp
));
2134 /* Follow pointers until we get to a non-pointer. */
2136 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_IS_REFERENCE (t
))
2138 *argp
= value_ind (*argp
);
2139 /* Don't coerce fn pointer to fn and then back again! */
2140 if (TYPE_CODE (check_typedef (value_type (*argp
))) != TYPE_CODE_FUNC
)
2141 *argp
= coerce_array (*argp
);
2142 t
= check_typedef (value_type (*argp
));
2145 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2146 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2147 error (_("Attempt to extract a component of a value that is not a %s."),
2150 /* Assume it's not, unless we see that it is. */
2151 if (static_memfuncp
)
2152 *static_memfuncp
= 0;
2156 /* if there are no arguments ...do this... */
2158 /* Try as a field first, because if we succeed, there is less
2160 v
= search_struct_field (name
, *argp
, t
, 0);
2164 /* C++: If it was not found as a data field, then try to
2165 return it as a pointer to a method. */
2166 v
= search_struct_method (name
, argp
, args
, 0,
2167 static_memfuncp
, t
);
2169 if (v
== (struct value
*) - 1)
2170 error (_("Cannot take address of method %s."), name
);
2173 if (TYPE_NFN_FIELDS (t
))
2174 error (_("There is no member or method named %s."), name
);
2176 error (_("There is no member named %s."), name
);
2181 v
= search_struct_method (name
, argp
, args
, 0,
2182 static_memfuncp
, t
);
2184 if (v
== (struct value
*) - 1)
2186 error (_("One of the arguments you tried to pass to %s could not "
2187 "be converted to what the function wants."), name
);
2191 /* See if user tried to invoke data as function. If so, hand it
2192 back. If it's not callable (i.e., a pointer to function),
2193 gdb should give an error. */
2194 v
= search_struct_field (name
, *argp
, t
, 0);
2195 /* If we found an ordinary field, then it is not a method call.
2196 So, treat it as if it were a static member function. */
2197 if (v
&& static_memfuncp
)
2198 *static_memfuncp
= 1;
2202 throw_error (NOT_FOUND_ERROR
,
2203 _("Structure has no component named %s."), name
);
2207 /* Given *ARGP, a value of type structure or union, or a pointer/reference
2208 to a structure or union, extract and return its component (field) of
2209 type FTYPE at the specified BITPOS.
2210 Throw an exception on error. */
2213 value_struct_elt_bitpos (struct value
**argp
, int bitpos
, struct type
*ftype
,
2219 *argp
= coerce_array (*argp
);
2221 t
= check_typedef (value_type (*argp
));
2223 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_IS_REFERENCE (t
))
2225 *argp
= value_ind (*argp
);
2226 if (TYPE_CODE (check_typedef (value_type (*argp
))) != TYPE_CODE_FUNC
)
2227 *argp
= coerce_array (*argp
);
2228 t
= check_typedef (value_type (*argp
));
2231 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2232 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2233 error (_("Attempt to extract a component of a value that is not a %s."),
2236 for (i
= TYPE_N_BASECLASSES (t
); i
< TYPE_NFIELDS (t
); i
++)
2238 if (!field_is_static (&TYPE_FIELD (t
, i
))
2239 && bitpos
== TYPE_FIELD_BITPOS (t
, i
)
2240 && types_equal (ftype
, TYPE_FIELD_TYPE (t
, i
)))
2241 return value_primitive_field (*argp
, 0, i
, t
);
2244 error (_("No field with matching bitpos and type."));
2253 value_union_variant (struct type
*union_type
, const gdb_byte
*contents
)
2255 gdb_assert (TYPE_CODE (union_type
) == TYPE_CODE_UNION
2256 && TYPE_FLAG_DISCRIMINATED_UNION (union_type
));
2258 struct dynamic_prop
*discriminant_prop
2259 = get_dyn_prop (DYN_PROP_DISCRIMINATED
, union_type
);
2260 gdb_assert (discriminant_prop
!= nullptr);
2262 struct discriminant_info
*info
2263 = (struct discriminant_info
*) discriminant_prop
->data
.baton
;
2264 gdb_assert (info
!= nullptr);
2266 /* If this is a univariant union, just return the sole field. */
2267 if (TYPE_NFIELDS (union_type
) == 1)
2269 /* This should only happen for univariants, which we already dealt
2271 gdb_assert (info
->discriminant_index
!= -1);
2273 /* Compute the discriminant. Note that unpack_field_as_long handles
2274 sign extension when necessary, as does the DWARF reader -- so
2275 signed discriminants will be handled correctly despite the use of
2276 an unsigned type here. */
2277 ULONGEST discriminant
= unpack_field_as_long (union_type
, contents
,
2278 info
->discriminant_index
);
2280 for (int i
= 0; i
< TYPE_NFIELDS (union_type
); ++i
)
2282 if (i
!= info
->default_index
2283 && i
!= info
->discriminant_index
2284 && discriminant
== info
->discriminants
[i
])
2288 if (info
->default_index
== -1)
2289 error (_("Could not find variant corresponding to discriminant %s"),
2290 pulongest (discriminant
));
2291 return info
->default_index
;
2294 /* Search through the methods of an object (and its bases) to find a
2295 specified method. Return the pointer to the fn_field list FN_LIST of
2296 overloaded instances defined in the source language. If available
2297 and matching, a vector of matching xmethods defined in extension
2298 languages are also returned in XM_WORKER_VEC
2300 Helper function for value_find_oload_list.
2301 ARGP is a pointer to a pointer to a value (the object).
2302 METHOD is a string containing the method name.
2303 OFFSET is the offset within the value.
2304 TYPE is the assumed type of the object.
2305 FN_LIST is the pointer to matching overloaded instances defined in
2306 source language. Since this is a recursive function, *FN_LIST
2307 should be set to NULL when calling this function.
2308 NUM_FNS is the number of overloaded instances. *NUM_FNS should be set to
2309 0 when calling this function.
2310 XM_WORKER_VEC is the vector of matching xmethod workers. *XM_WORKER_VEC
2311 should also be set to NULL when calling this function.
2312 BASETYPE is set to the actual type of the subobject where the
2314 BOFFSET is the offset of the base subobject where the method is found. */
2317 find_method_list (struct value
**argp
, const char *method
,
2318 LONGEST offset
, struct type
*type
,
2319 struct fn_field
**fn_list
, int *num_fns
,
2320 std::vector
<xmethod_worker_up
> *xm_worker_vec
,
2321 struct type
**basetype
, LONGEST
*boffset
)
2324 struct fn_field
*f
= NULL
;
2326 gdb_assert (fn_list
!= NULL
&& xm_worker_vec
!= NULL
);
2327 type
= check_typedef (type
);
2329 /* First check in object itself.
2330 This function is called recursively to search through base classes.
2331 If there is a source method match found at some stage, then we need not
2332 look for source methods in consequent recursive calls. */
2333 if ((*fn_list
) == NULL
)
2335 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
2337 /* pai: FIXME What about operators and type conversions? */
2338 const char *fn_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
2340 if (fn_field_name
&& (strcmp_iw (fn_field_name
, method
) == 0))
2342 int len
= TYPE_FN_FIELDLIST_LENGTH (type
, i
);
2343 f
= TYPE_FN_FIELDLIST1 (type
, i
);
2350 /* Resolve any stub methods. */
2351 check_stub_method_group (type
, i
);
2358 /* Unlike source methods, xmethods can be accumulated over successive
2359 recursive calls. In other words, an xmethod named 'm' in a class
2360 will not hide an xmethod named 'm' in its base class(es). We want
2361 it to be this way because xmethods are after all convenience functions
2362 and hence there is no point restricting them with something like method
2363 hiding. Moreover, if hiding is done for xmethods as well, then we will
2364 have to provide a mechanism to un-hide (like the 'using' construct). */
2365 get_matching_xmethod_workers (type
, method
, xm_worker_vec
);
2367 /* If source methods are not found in current class, look for them in the
2368 base classes. We also have to go through the base classes to gather
2369 extension methods. */
2370 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2372 LONGEST base_offset
;
2374 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2376 base_offset
= baseclass_offset (type
, i
,
2377 value_contents_for_printing (*argp
),
2378 value_offset (*argp
) + offset
,
2379 value_address (*argp
), *argp
);
2381 else /* Non-virtual base, simply use bit position from debug
2384 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2387 find_method_list (argp
, method
, base_offset
+ offset
,
2388 TYPE_BASECLASS (type
, i
), fn_list
, num_fns
,
2389 xm_worker_vec
, basetype
, boffset
);
2393 /* Return the list of overloaded methods of a specified name. The methods
2394 could be those GDB finds in the binary, or xmethod. Methods found in
2395 the binary are returned in FN_LIST, and xmethods are returned in
2398 ARGP is a pointer to a pointer to a value (the object).
2399 METHOD is the method name.
2400 OFFSET is the offset within the value contents.
2401 FN_LIST is the pointer to matching overloaded instances defined in
2403 NUM_FNS is the number of overloaded instances.
2404 XM_WORKER_VEC is the vector of matching xmethod workers defined in
2405 extension languages.
2406 BASETYPE is set to the type of the base subobject that defines the
2408 BOFFSET is the offset of the base subobject which defines the method. */
2411 value_find_oload_method_list (struct value
**argp
, const char *method
,
2412 LONGEST offset
, struct fn_field
**fn_list
,
2414 std::vector
<xmethod_worker_up
> *xm_worker_vec
,
2415 struct type
**basetype
, LONGEST
*boffset
)
2419 t
= check_typedef (value_type (*argp
));
2421 /* Code snarfed from value_struct_elt. */
2422 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_IS_REFERENCE (t
))
2424 *argp
= value_ind (*argp
);
2425 /* Don't coerce fn pointer to fn and then back again! */
2426 if (TYPE_CODE (check_typedef (value_type (*argp
))) != TYPE_CODE_FUNC
)
2427 *argp
= coerce_array (*argp
);
2428 t
= check_typedef (value_type (*argp
));
2431 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2432 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2433 error (_("Attempt to extract a component of a "
2434 "value that is not a struct or union"));
2436 gdb_assert (fn_list
!= NULL
&& xm_worker_vec
!= NULL
);
2438 /* Clear the lists. */
2441 xm_worker_vec
->clear ();
2443 find_method_list (argp
, method
, 0, t
, fn_list
, num_fns
, xm_worker_vec
,
2447 /* Given an array of arguments (ARGS) (which includes an entry for
2448 "this" in the case of C++ methods), the NAME of a function, and
2449 whether it's a method or not (METHOD), find the best function that
2450 matches on the argument types according to the overload resolution
2453 METHOD can be one of three values:
2454 NON_METHOD for non-member functions.
2455 METHOD: for member functions.
2456 BOTH: used for overload resolution of operators where the
2457 candidates are expected to be either member or non member
2458 functions. In this case the first argument ARGTYPES
2459 (representing 'this') is expected to be a reference to the
2460 target object, and will be dereferenced when attempting the
2463 In the case of class methods, the parameter OBJ is an object value
2464 in which to search for overloaded methods.
2466 In the case of non-method functions, the parameter FSYM is a symbol
2467 corresponding to one of the overloaded functions.
2469 Return value is an integer: 0 -> good match, 10 -> debugger applied
2470 non-standard coercions, 100 -> incompatible.
2472 If a method is being searched for, VALP will hold the value.
2473 If a non-method is being searched for, SYMP will hold the symbol
2476 If a method is being searched for, and it is a static method,
2477 then STATICP will point to a non-zero value.
2479 If NO_ADL argument dependent lookup is disabled. This is used to prevent
2480 ADL overload candidates when performing overload resolution for a fully
2483 If NOSIDE is EVAL_AVOID_SIDE_EFFECTS, then OBJP's memory cannot be
2484 read while picking the best overload match (it may be all zeroes and thus
2485 not have a vtable pointer), in which case skip virtual function lookup.
2486 This is ok as typically EVAL_AVOID_SIDE_EFFECTS is only used to determine
2489 Note: This function does *not* check the value of
2490 overload_resolution. Caller must check it to see whether overload
2491 resolution is permitted. */
2494 find_overload_match (gdb::array_view
<value
*> args
,
2495 const char *name
, enum oload_search_type method
,
2496 struct value
**objp
, struct symbol
*fsym
,
2497 struct value
**valp
, struct symbol
**symp
,
2498 int *staticp
, const int no_adl
,
2499 const enum noside noside
)
2501 struct value
*obj
= (objp
? *objp
: NULL
);
2502 struct type
*obj_type
= obj
? value_type (obj
) : NULL
;
2503 /* Index of best overloaded function. */
2504 int func_oload_champ
= -1;
2505 int method_oload_champ
= -1;
2506 int src_method_oload_champ
= -1;
2507 int ext_method_oload_champ
= -1;
2509 /* The measure for the current best match. */
2510 badness_vector method_badness
;
2511 badness_vector func_badness
;
2512 badness_vector ext_method_badness
;
2513 badness_vector src_method_badness
;
2515 struct value
*temp
= obj
;
2516 /* For methods, the list of overloaded methods. */
2517 struct fn_field
*fns_ptr
= NULL
;
2518 /* For non-methods, the list of overloaded function symbols. */
2519 std::vector
<symbol
*> oload_syms
;
2520 /* For xmethods, the vector of xmethod workers. */
2521 std::vector
<xmethod_worker_up
> xm_worker_vec
;
2522 /* Number of overloaded instances being considered. */
2524 struct type
*basetype
= NULL
;
2527 struct cleanup
*all_cleanups
= make_cleanup (null_cleanup
, NULL
);
2529 const char *obj_type_name
= NULL
;
2530 const char *func_name
= NULL
;
2531 enum oload_classification match_quality
;
2532 enum oload_classification method_match_quality
= INCOMPATIBLE
;
2533 enum oload_classification src_method_match_quality
= INCOMPATIBLE
;
2534 enum oload_classification ext_method_match_quality
= INCOMPATIBLE
;
2535 enum oload_classification func_match_quality
= INCOMPATIBLE
;
2537 /* Get the list of overloaded methods or functions. */
2538 if (method
== METHOD
|| method
== BOTH
)
2542 /* OBJ may be a pointer value rather than the object itself. */
2543 obj
= coerce_ref (obj
);
2544 while (TYPE_CODE (check_typedef (value_type (obj
))) == TYPE_CODE_PTR
)
2545 obj
= coerce_ref (value_ind (obj
));
2546 obj_type_name
= TYPE_NAME (value_type (obj
));
2548 /* First check whether this is a data member, e.g. a pointer to
2550 if (TYPE_CODE (check_typedef (value_type (obj
))) == TYPE_CODE_STRUCT
)
2552 *valp
= search_struct_field (name
, obj
,
2553 check_typedef (value_type (obj
)), 0);
2557 do_cleanups (all_cleanups
);
2562 /* Retrieve the list of methods with the name NAME. */
2563 value_find_oload_method_list (&temp
, name
, 0, &fns_ptr
, &num_fns
,
2564 &xm_worker_vec
, &basetype
, &boffset
);
2565 /* If this is a method only search, and no methods were found
2566 the search has failed. */
2567 if (method
== METHOD
&& (!fns_ptr
|| !num_fns
) && xm_worker_vec
.empty ())
2568 error (_("Couldn't find method %s%s%s"),
2570 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2572 /* If we are dealing with stub method types, they should have
2573 been resolved by find_method_list via
2574 value_find_oload_method_list above. */
2577 gdb_assert (TYPE_SELF_TYPE (fns_ptr
[0].type
) != NULL
);
2579 src_method_oload_champ
= find_oload_champ (args
,
2580 num_fns
, fns_ptr
, NULL
,
2581 NULL
, &src_method_badness
);
2583 src_method_match_quality
= classify_oload_match
2584 (src_method_badness
, args
.size (),
2585 oload_method_static_p (fns_ptr
, src_method_oload_champ
));
2588 if (!xm_worker_vec
.empty ())
2590 ext_method_oload_champ
= find_oload_champ (args
, 0, NULL
, &xm_worker_vec
,
2591 NULL
, &ext_method_badness
);
2592 ext_method_match_quality
= classify_oload_match (ext_method_badness
,
2596 if (src_method_oload_champ
>= 0 && ext_method_oload_champ
>= 0)
2598 switch (compare_badness (ext_method_badness
, src_method_badness
))
2600 case 0: /* Src method and xmethod are equally good. */
2601 /* If src method and xmethod are equally good, then
2602 xmethod should be the winner. Hence, fall through to the
2603 case where a xmethod is better than the source
2604 method, except when the xmethod match quality is
2607 case 1: /* Src method and ext method are incompatible. */
2608 /* If ext method match is not standard, then let source method
2609 win. Otherwise, fallthrough to let xmethod win. */
2610 if (ext_method_match_quality
!= STANDARD
)
2612 method_oload_champ
= src_method_oload_champ
;
2613 method_badness
= src_method_badness
;
2614 ext_method_oload_champ
= -1;
2615 method_match_quality
= src_method_match_quality
;
2619 case 2: /* Ext method is champion. */
2620 method_oload_champ
= ext_method_oload_champ
;
2621 method_badness
= ext_method_badness
;
2622 src_method_oload_champ
= -1;
2623 method_match_quality
= ext_method_match_quality
;
2625 case 3: /* Src method is champion. */
2626 method_oload_champ
= src_method_oload_champ
;
2627 method_badness
= src_method_badness
;
2628 ext_method_oload_champ
= -1;
2629 method_match_quality
= src_method_match_quality
;
2632 gdb_assert_not_reached ("Unexpected overload comparison "
2637 else if (src_method_oload_champ
>= 0)
2639 method_oload_champ
= src_method_oload_champ
;
2640 method_badness
= src_method_badness
;
2641 method_match_quality
= src_method_match_quality
;
2643 else if (ext_method_oload_champ
>= 0)
2645 method_oload_champ
= ext_method_oload_champ
;
2646 method_badness
= ext_method_badness
;
2647 method_match_quality
= ext_method_match_quality
;
2651 if (method
== NON_METHOD
|| method
== BOTH
)
2653 const char *qualified_name
= NULL
;
2655 /* If the overload match is being search for both as a method
2656 and non member function, the first argument must now be
2659 args
[0] = value_ind (args
[0]);
2663 qualified_name
= SYMBOL_NATURAL_NAME (fsym
);
2665 /* If we have a function with a C++ name, try to extract just
2666 the function part. Do not try this for non-functions (e.g.
2667 function pointers). */
2669 && TYPE_CODE (check_typedef (SYMBOL_TYPE (fsym
)))
2674 temp_func
= cp_func_name (qualified_name
);
2676 /* If cp_func_name did not remove anything, the name of the
2677 symbol did not include scope or argument types - it was
2678 probably a C-style function. */
2681 make_cleanup (xfree
, temp_func
);
2682 if (strcmp (temp_func
, qualified_name
) == 0)
2685 func_name
= temp_func
;
2692 qualified_name
= name
;
2695 /* If there was no C++ name, this must be a C-style function or
2696 not a function at all. Just return the same symbol. Do the
2697 same if cp_func_name fails for some reason. */
2698 if (func_name
== NULL
)
2701 do_cleanups (all_cleanups
);
2705 func_oload_champ
= find_oload_champ_namespace (args
,
2712 if (func_oload_champ
>= 0)
2713 func_match_quality
= classify_oload_match (func_badness
,
2717 /* Did we find a match ? */
2718 if (method_oload_champ
== -1 && func_oload_champ
== -1)
2719 throw_error (NOT_FOUND_ERROR
,
2720 _("No symbol \"%s\" in current context."),
2723 /* If we have found both a method match and a function
2724 match, find out which one is better, and calculate match
2726 if (method_oload_champ
>= 0 && func_oload_champ
>= 0)
2728 switch (compare_badness (func_badness
, method_badness
))
2730 case 0: /* Top two contenders are equally good. */
2731 /* FIXME: GDB does not support the general ambiguous case.
2732 All candidates should be collected and presented the
2734 error (_("Ambiguous overload resolution"));
2736 case 1: /* Incomparable top contenders. */
2737 /* This is an error incompatible candidates
2738 should not have been proposed. */
2739 error (_("Internal error: incompatible "
2740 "overload candidates proposed"));
2742 case 2: /* Function champion. */
2743 method_oload_champ
= -1;
2744 match_quality
= func_match_quality
;
2746 case 3: /* Method champion. */
2747 func_oload_champ
= -1;
2748 match_quality
= method_match_quality
;
2751 error (_("Internal error: unexpected overload comparison result"));
2757 /* We have either a method match or a function match. */
2758 if (method_oload_champ
>= 0)
2759 match_quality
= method_match_quality
;
2761 match_quality
= func_match_quality
;
2764 if (match_quality
== INCOMPATIBLE
)
2766 if (method
== METHOD
)
2767 error (_("Cannot resolve method %s%s%s to any overloaded instance"),
2769 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2772 error (_("Cannot resolve function %s to any overloaded instance"),
2775 else if (match_quality
== NON_STANDARD
)
2777 if (method
== METHOD
)
2778 warning (_("Using non-standard conversion to match "
2779 "method %s%s%s to supplied arguments"),
2781 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2784 warning (_("Using non-standard conversion to match "
2785 "function %s to supplied arguments"),
2789 if (staticp
!= NULL
)
2790 *staticp
= oload_method_static_p (fns_ptr
, method_oload_champ
);
2792 if (method_oload_champ
>= 0)
2794 if (src_method_oload_champ
>= 0)
2796 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr
, method_oload_champ
)
2797 && noside
!= EVAL_AVOID_SIDE_EFFECTS
)
2799 *valp
= value_virtual_fn_field (&temp
, fns_ptr
,
2800 method_oload_champ
, basetype
,
2804 *valp
= value_fn_field (&temp
, fns_ptr
, method_oload_champ
,
2808 *valp
= value_from_xmethod
2809 (std::move (xm_worker_vec
[ext_method_oload_champ
]));
2812 *symp
= oload_syms
[func_oload_champ
];
2816 struct type
*temp_type
= check_typedef (value_type (temp
));
2817 struct type
*objtype
= check_typedef (obj_type
);
2819 if (TYPE_CODE (temp_type
) != TYPE_CODE_PTR
2820 && (TYPE_CODE (objtype
) == TYPE_CODE_PTR
2821 || TYPE_IS_REFERENCE (objtype
)))
2823 temp
= value_addr (temp
);
2828 do_cleanups (all_cleanups
);
2830 switch (match_quality
)
2836 default: /* STANDARD */
2841 /* Find the best overload match, searching for FUNC_NAME in namespaces
2842 contained in QUALIFIED_NAME until it either finds a good match or
2843 runs out of namespaces. It stores the overloaded functions in
2844 *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. If NO_ADL,
2845 argument dependent lookup is not performned. */
2848 find_oload_champ_namespace (gdb::array_view
<value
*> args
,
2849 const char *func_name
,
2850 const char *qualified_name
,
2851 std::vector
<symbol
*> *oload_syms
,
2852 badness_vector
*oload_champ_bv
,
2857 find_oload_champ_namespace_loop (args
,
2860 oload_syms
, oload_champ_bv
,
2867 /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is
2868 how deep we've looked for namespaces, and the champ is stored in
2869 OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0
2870 if it isn't. Other arguments are the same as in
2871 find_oload_champ_namespace. */
2874 find_oload_champ_namespace_loop (gdb::array_view
<value
*> args
,
2875 const char *func_name
,
2876 const char *qualified_name
,
2878 std::vector
<symbol
*> *oload_syms
,
2879 badness_vector
*oload_champ_bv
,
2883 int next_namespace_len
= namespace_len
;
2884 int searched_deeper
= 0;
2885 int new_oload_champ
;
2886 char *new_namespace
;
2888 if (next_namespace_len
!= 0)
2890 gdb_assert (qualified_name
[next_namespace_len
] == ':');
2891 next_namespace_len
+= 2;
2893 next_namespace_len
+=
2894 cp_find_first_component (qualified_name
+ next_namespace_len
);
2896 /* First, see if we have a deeper namespace we can search in.
2897 If we get a good match there, use it. */
2899 if (qualified_name
[next_namespace_len
] == ':')
2901 searched_deeper
= 1;
2903 if (find_oload_champ_namespace_loop (args
,
2904 func_name
, qualified_name
,
2906 oload_syms
, oload_champ_bv
,
2907 oload_champ
, no_adl
))
2913 /* If we reach here, either we're in the deepest namespace or we
2914 didn't find a good match in a deeper namespace. But, in the
2915 latter case, we still have a bad match in a deeper namespace;
2916 note that we might not find any match at all in the current
2917 namespace. (There's always a match in the deepest namespace,
2918 because this overload mechanism only gets called if there's a
2919 function symbol to start off with.) */
2921 new_namespace
= (char *) alloca (namespace_len
+ 1);
2922 strncpy (new_namespace
, qualified_name
, namespace_len
);
2923 new_namespace
[namespace_len
] = '\0';
2925 std::vector
<symbol
*> new_oload_syms
2926 = make_symbol_overload_list (func_name
, new_namespace
);
2928 /* If we have reached the deepest level perform argument
2929 determined lookup. */
2930 if (!searched_deeper
&& !no_adl
)
2933 struct type
**arg_types
;
2935 /* Prepare list of argument types for overload resolution. */
2936 arg_types
= (struct type
**)
2937 alloca (args
.size () * (sizeof (struct type
*)));
2938 for (ix
= 0; ix
< args
.size (); ix
++)
2939 arg_types
[ix
] = value_type (args
[ix
]);
2940 add_symbol_overload_list_adl ({arg_types
, args
.size ()}, func_name
,
2944 badness_vector new_oload_champ_bv
;
2945 new_oload_champ
= find_oload_champ (args
, new_oload_syms
.size (),
2946 NULL
, NULL
, new_oload_syms
.data (),
2947 &new_oload_champ_bv
);
2949 /* Case 1: We found a good match. Free earlier matches (if any),
2950 and return it. Case 2: We didn't find a good match, but we're
2951 not the deepest function. Then go with the bad match that the
2952 deeper function found. Case 3: We found a bad match, and we're
2953 the deepest function. Then return what we found, even though
2954 it's a bad match. */
2956 if (new_oload_champ
!= -1
2957 && classify_oload_match (new_oload_champ_bv
, args
.size (), 0) == STANDARD
)
2959 *oload_syms
= std::move (new_oload_syms
);
2960 *oload_champ
= new_oload_champ
;
2961 *oload_champ_bv
= std::move (new_oload_champ_bv
);
2964 else if (searched_deeper
)
2970 *oload_syms
= std::move (new_oload_syms
);
2971 *oload_champ
= new_oload_champ
;
2972 *oload_champ_bv
= std::move (new_oload_champ_bv
);
2977 /* Look for a function to take ARGS. Find the best match from among
2978 the overloaded methods or functions given by FNS_PTR or OLOAD_SYMS
2979 or XM_WORKER_VEC, respectively. One, and only one of FNS_PTR,
2980 OLOAD_SYMS and XM_WORKER_VEC can be non-NULL.
2982 If XM_WORKER_VEC is NULL, then the length of the arrays FNS_PTR
2983 or OLOAD_SYMS (whichever is non-NULL) is specified in NUM_FNS.
2985 Return the index of the best match; store an indication of the
2986 quality of the match in OLOAD_CHAMP_BV. */
2989 find_oload_champ (gdb::array_view
<value
*> args
,
2990 int num_fns
, struct fn_field
*fns_ptr
,
2991 const std::vector
<xmethod_worker_up
> *xm_worker_vec
,
2992 struct symbol
**oload_syms
,
2993 badness_vector
*oload_champ_bv
)
2996 /* A measure of how good an overloaded instance is. */
2998 /* Index of best overloaded function. */
2999 int oload_champ
= -1;
3000 /* Current ambiguity state for overload resolution. */
3001 int oload_ambiguous
= 0;
3002 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */
3004 /* A champion can be found among methods alone, or among functions
3005 alone, or in xmethods alone, but not in more than one of these
3007 gdb_assert ((fns_ptr
!= NULL
) + (oload_syms
!= NULL
) + (xm_worker_vec
!= NULL
)
3010 int fn_count
= xm_worker_vec
!= NULL
? xm_worker_vec
->size () : num_fns
;
3012 /* Consider each candidate in turn. */
3013 for (ix
= 0; ix
< fn_count
; ix
++)
3016 int static_offset
= 0;
3017 std::vector
<type
*> parm_types
;
3019 if (xm_worker_vec
!= NULL
)
3021 xmethod_worker
*worker
= (*xm_worker_vec
)[ix
].get ();
3022 parm_types
= worker
->get_arg_types ();
3028 if (fns_ptr
!= NULL
)
3030 nparms
= TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (fns_ptr
, ix
));
3031 static_offset
= oload_method_static_p (fns_ptr
, ix
);
3034 nparms
= TYPE_NFIELDS (SYMBOL_TYPE (oload_syms
[ix
]));
3036 parm_types
.reserve (nparms
);
3037 for (jj
= 0; jj
< nparms
; jj
++)
3039 type
*t
= (fns_ptr
!= NULL
3040 ? (TYPE_FN_FIELD_ARGS (fns_ptr
, ix
)[jj
].type
)
3041 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms
[ix
]),
3043 parm_types
.push_back (t
);
3047 /* Compare parameter types to supplied argument types. Skip
3048 THIS for static methods. */
3049 bv
= rank_function (parm_types
,
3050 args
.slice (static_offset
));
3052 if (oload_champ_bv
->empty ())
3054 *oload_champ_bv
= std::move (bv
);
3057 else /* See whether current candidate is better or worse than
3059 switch (compare_badness (bv
, *oload_champ_bv
))
3061 case 0: /* Top two contenders are equally good. */
3062 oload_ambiguous
= 1;
3064 case 1: /* Incomparable top contenders. */
3065 oload_ambiguous
= 2;
3067 case 2: /* New champion, record details. */
3068 *oload_champ_bv
= std::move (bv
);
3069 oload_ambiguous
= 0;
3078 if (fns_ptr
!= NULL
)
3079 fprintf_filtered (gdb_stderr
,
3080 "Overloaded method instance %s, # of parms %d\n",
3081 fns_ptr
[ix
].physname
, (int) parm_types
.size ());
3082 else if (xm_worker_vec
!= NULL
)
3083 fprintf_filtered (gdb_stderr
,
3084 "Xmethod worker, # of parms %d\n",
3085 (int) parm_types
.size ());
3087 fprintf_filtered (gdb_stderr
,
3088 "Overloaded function instance "
3089 "%s # of parms %d\n",
3090 SYMBOL_DEMANGLED_NAME (oload_syms
[ix
]),
3091 (int) parm_types
.size ());
3092 for (jj
= 0; jj
< args
.size () - static_offset
; jj
++)
3093 fprintf_filtered (gdb_stderr
,
3094 "...Badness @ %d : %d\n",
3096 fprintf_filtered (gdb_stderr
, "Overload resolution "
3097 "champion is %d, ambiguous? %d\n",
3098 oload_champ
, oload_ambiguous
);
3105 /* Return 1 if we're looking at a static method, 0 if we're looking at
3106 a non-static method or a function that isn't a method. */
3109 oload_method_static_p (struct fn_field
*fns_ptr
, int index
)
3111 if (fns_ptr
&& index
>= 0 && TYPE_FN_FIELD_STATIC_P (fns_ptr
, index
))
3117 /* Check how good an overload match OLOAD_CHAMP_BV represents. */
3119 static enum oload_classification
3120 classify_oload_match (const badness_vector
&oload_champ_bv
,
3125 enum oload_classification worst
= STANDARD
;
3127 for (ix
= 1; ix
<= nargs
- static_offset
; ix
++)
3129 /* If this conversion is as bad as INCOMPATIBLE_TYPE_BADNESS
3130 or worse return INCOMPATIBLE. */
3131 if (compare_ranks (oload_champ_bv
[ix
],
3132 INCOMPATIBLE_TYPE_BADNESS
) <= 0)
3133 return INCOMPATIBLE
; /* Truly mismatched types. */
3134 /* Otherwise If this conversion is as bad as
3135 NS_POINTER_CONVERSION_BADNESS or worse return NON_STANDARD. */
3136 else if (compare_ranks (oload_champ_bv
[ix
],
3137 NS_POINTER_CONVERSION_BADNESS
) <= 0)
3138 worst
= NON_STANDARD
; /* Non-standard type conversions
3142 /* If no INCOMPATIBLE classification was found, return the worst one
3143 that was found (if any). */
3147 /* C++: return 1 is NAME is a legitimate name for the destructor of
3148 type TYPE. If TYPE does not have a destructor, or if NAME is
3149 inappropriate for TYPE, an error is signaled. Parameter TYPE should not yet
3150 have CHECK_TYPEDEF applied, this function will apply it itself. */
3153 destructor_name_p (const char *name
, struct type
*type
)
3157 const char *dname
= type_name_or_error (type
);
3158 const char *cp
= strchr (dname
, '<');
3161 /* Do not compare the template part for template classes. */
3163 len
= strlen (dname
);
3166 if (strlen (name
+ 1) != len
|| strncmp (dname
, name
+ 1, len
) != 0)
3167 error (_("name of destructor must equal name of class"));
3174 /* Find an enum constant named NAME in TYPE. TYPE must be an "enum
3175 class". If the name is found, return a value representing it;
3176 otherwise throw an exception. */
3178 static struct value
*
3179 enum_constant_from_type (struct type
*type
, const char *name
)
3182 int name_len
= strlen (name
);
3184 gdb_assert (TYPE_CODE (type
) == TYPE_CODE_ENUM
3185 && TYPE_DECLARED_CLASS (type
));
3187 for (i
= TYPE_N_BASECLASSES (type
); i
< TYPE_NFIELDS (type
); ++i
)
3189 const char *fname
= TYPE_FIELD_NAME (type
, i
);
3192 if (TYPE_FIELD_LOC_KIND (type
, i
) != FIELD_LOC_KIND_ENUMVAL
3196 /* Look for the trailing "::NAME", since enum class constant
3197 names are qualified here. */
3198 len
= strlen (fname
);
3199 if (len
+ 2 >= name_len
3200 && fname
[len
- name_len
- 2] == ':'
3201 && fname
[len
- name_len
- 1] == ':'
3202 && strcmp (&fname
[len
- name_len
], name
) == 0)
3203 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, i
));
3206 error (_("no constant named \"%s\" in enum \"%s\""),
3207 name
, TYPE_NAME (type
));
3210 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3211 return the appropriate member (or the address of the member, if
3212 WANT_ADDRESS). This function is used to resolve user expressions
3213 of the form "DOMAIN::NAME". For more details on what happens, see
3214 the comment before value_struct_elt_for_reference. */
3217 value_aggregate_elt (struct type
*curtype
, const char *name
,
3218 struct type
*expect_type
, int want_address
,
3221 switch (TYPE_CODE (curtype
))
3223 case TYPE_CODE_STRUCT
:
3224 case TYPE_CODE_UNION
:
3225 return value_struct_elt_for_reference (curtype
, 0, curtype
,
3227 want_address
, noside
);
3228 case TYPE_CODE_NAMESPACE
:
3229 return value_namespace_elt (curtype
, name
,
3230 want_address
, noside
);
3232 case TYPE_CODE_ENUM
:
3233 return enum_constant_from_type (curtype
, name
);
3236 internal_error (__FILE__
, __LINE__
,
3237 _("non-aggregate type in value_aggregate_elt"));
3241 /* Compares the two method/function types T1 and T2 for "equality"
3242 with respect to the methods' parameters. If the types of the
3243 two parameter lists are the same, returns 1; 0 otherwise. This
3244 comparison may ignore any artificial parameters in T1 if
3245 SKIP_ARTIFICIAL is non-zero. This function will ALWAYS skip
3246 the first artificial parameter in T1, assumed to be a 'this' pointer.
3248 The type T2 is expected to have come from make_params (in eval.c). */
3251 compare_parameters (struct type
*t1
, struct type
*t2
, int skip_artificial
)
3255 if (TYPE_NFIELDS (t1
) > 0 && TYPE_FIELD_ARTIFICIAL (t1
, 0))
3258 /* If skipping artificial fields, find the first real field
3260 if (skip_artificial
)
3262 while (start
< TYPE_NFIELDS (t1
)
3263 && TYPE_FIELD_ARTIFICIAL (t1
, start
))
3267 /* Now compare parameters. */
3269 /* Special case: a method taking void. T1 will contain no
3270 non-artificial fields, and T2 will contain TYPE_CODE_VOID. */
3271 if ((TYPE_NFIELDS (t1
) - start
) == 0 && TYPE_NFIELDS (t2
) == 1
3272 && TYPE_CODE (TYPE_FIELD_TYPE (t2
, 0)) == TYPE_CODE_VOID
)
3275 if ((TYPE_NFIELDS (t1
) - start
) == TYPE_NFIELDS (t2
))
3279 for (i
= 0; i
< TYPE_NFIELDS (t2
); ++i
)
3281 if (compare_ranks (rank_one_type (TYPE_FIELD_TYPE (t1
, start
+ i
),
3282 TYPE_FIELD_TYPE (t2
, i
), NULL
),
3283 EXACT_MATCH_BADNESS
) != 0)
3293 /* C++: Given an aggregate type VT, and a class type CLS, search
3294 recursively for CLS using value V; If found, store the offset
3295 which is either fetched from the virtual base pointer if CLS
3296 is virtual or accumulated offset of its parent classes if
3297 CLS is non-virtual in *BOFFS, set ISVIRT to indicate if CLS
3298 is virtual, and return true. If not found, return false. */
3301 get_baseclass_offset (struct type
*vt
, struct type
*cls
,
3302 struct value
*v
, int *boffs
, bool *isvirt
)
3304 for (int i
= 0; i
< TYPE_N_BASECLASSES (vt
); i
++)
3306 struct type
*t
= TYPE_FIELD_TYPE (vt
, i
);
3307 if (types_equal (t
, cls
))
3309 if (BASETYPE_VIA_VIRTUAL (vt
, i
))
3311 const gdb_byte
*adr
= value_contents_for_printing (v
);
3312 *boffs
= baseclass_offset (vt
, i
, adr
, value_offset (v
),
3313 value_as_long (v
), v
);
3321 if (get_baseclass_offset (check_typedef (t
), cls
, v
, boffs
, isvirt
))
3323 if (*isvirt
== false) /* Add non-virtual base offset. */
3325 const gdb_byte
*adr
= value_contents_for_printing (v
);
3326 *boffs
+= baseclass_offset (vt
, i
, adr
, value_offset (v
),
3327 value_as_long (v
), v
);
3336 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3337 return the address of this member as a "pointer to member" type.
3338 If INTYPE is non-null, then it will be the type of the member we
3339 are looking for. This will help us resolve "pointers to member
3340 functions". This function is used to resolve user expressions of
3341 the form "DOMAIN::NAME". */
3343 static struct value
*
3344 value_struct_elt_for_reference (struct type
*domain
, int offset
,
3345 struct type
*curtype
, const char *name
,
3346 struct type
*intype
,
3350 struct type
*t
= check_typedef (curtype
);
3352 struct value
*result
;
3354 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
3355 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
3356 error (_("Internal error: non-aggregate type "
3357 "to value_struct_elt_for_reference"));
3359 for (i
= TYPE_NFIELDS (t
) - 1; i
>= TYPE_N_BASECLASSES (t
); i
--)
3361 const char *t_field_name
= TYPE_FIELD_NAME (t
, i
);
3363 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
3365 if (field_is_static (&TYPE_FIELD (t
, i
)))
3367 struct value
*v
= value_static_field (t
, i
);
3372 if (TYPE_FIELD_PACKED (t
, i
))
3373 error (_("pointers to bitfield members not allowed"));
3376 return value_from_longest
3377 (lookup_memberptr_type (TYPE_FIELD_TYPE (t
, i
), domain
),
3378 offset
+ (LONGEST
) (TYPE_FIELD_BITPOS (t
, i
) >> 3));
3379 else if (noside
!= EVAL_NORMAL
)
3380 return allocate_value (TYPE_FIELD_TYPE (t
, i
));
3383 /* Try to evaluate NAME as a qualified name with implicit
3384 this pointer. In this case, attempt to return the
3385 equivalent to `this->*(&TYPE::NAME)'. */
3386 struct value
*v
= value_of_this_silent (current_language
);
3389 struct value
*ptr
, *this_v
= v
;
3391 struct type
*type
, *tmp
;
3393 ptr
= value_aggregate_elt (domain
, name
, NULL
, 1, noside
);
3394 type
= check_typedef (value_type (ptr
));
3395 gdb_assert (type
!= NULL
3396 && TYPE_CODE (type
) == TYPE_CODE_MEMBERPTR
);
3397 tmp
= lookup_pointer_type (TYPE_SELF_TYPE (type
));
3398 v
= value_cast_pointers (tmp
, v
, 1);
3399 mem_offset
= value_as_long (ptr
);
3400 if (domain
!= curtype
)
3402 /* Find class offset of type CURTYPE from either its
3403 parent type DOMAIN or the type of implied this. */
3405 bool isvirt
= false;
3406 if (get_baseclass_offset (domain
, curtype
, v
, &boff
,
3411 struct type
*p
= check_typedef (value_type (this_v
));
3412 p
= check_typedef (TYPE_TARGET_TYPE (p
));
3413 if (get_baseclass_offset (p
, curtype
, this_v
,
3418 tmp
= lookup_pointer_type (TYPE_TARGET_TYPE (type
));
3419 result
= value_from_pointer (tmp
,
3420 value_as_long (v
) + mem_offset
);
3421 return value_ind (result
);
3424 error (_("Cannot reference non-static field \"%s\""), name
);
3429 /* C++: If it was not found as a data field, then try to return it
3430 as a pointer to a method. */
3432 /* Perform all necessary dereferencing. */
3433 while (intype
&& TYPE_CODE (intype
) == TYPE_CODE_PTR
)
3434 intype
= TYPE_TARGET_TYPE (intype
);
3436 for (i
= TYPE_NFN_FIELDS (t
) - 1; i
>= 0; --i
)
3438 const char *t_field_name
= TYPE_FN_FIELDLIST_NAME (t
, i
);
3439 char dem_opname
[64];
3441 if (startswith (t_field_name
, "__")
3442 || startswith (t_field_name
, "op")
3443 || startswith (t_field_name
, "type"))
3445 if (cplus_demangle_opname (t_field_name
,
3446 dem_opname
, DMGL_ANSI
))
3447 t_field_name
= dem_opname
;
3448 else if (cplus_demangle_opname (t_field_name
,
3450 t_field_name
= dem_opname
;
3452 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
3455 int len
= TYPE_FN_FIELDLIST_LENGTH (t
, i
);
3456 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (t
, i
);
3458 check_stub_method_group (t
, i
);
3462 for (j
= 0; j
< len
; ++j
)
3464 if (TYPE_CONST (intype
) != TYPE_FN_FIELD_CONST (f
, j
))
3466 if (TYPE_VOLATILE (intype
) != TYPE_FN_FIELD_VOLATILE (f
, j
))
3469 if (compare_parameters (TYPE_FN_FIELD_TYPE (f
, j
), intype
, 0)
3470 || compare_parameters (TYPE_FN_FIELD_TYPE (f
, j
),
3476 error (_("no member function matches "
3477 "that type instantiation"));
3484 for (ii
= 0; ii
< len
; ++ii
)
3486 /* Skip artificial methods. This is necessary if,
3487 for example, the user wants to "print
3488 subclass::subclass" with only one user-defined
3489 constructor. There is no ambiguity in this case.
3490 We are careful here to allow artificial methods
3491 if they are the unique result. */
3492 if (TYPE_FN_FIELD_ARTIFICIAL (f
, ii
))
3499 /* Desired method is ambiguous if more than one
3500 method is defined. */
3501 if (j
!= -1 && !TYPE_FN_FIELD_ARTIFICIAL (f
, j
))
3502 error (_("non-unique member `%s' requires "
3503 "type instantiation"), name
);
3509 error (_("no matching member function"));
3512 if (TYPE_FN_FIELD_STATIC_P (f
, j
))
3515 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
3516 0, VAR_DOMAIN
, 0).symbol
;
3522 return value_addr (read_var_value (s
, 0, 0));
3524 return read_var_value (s
, 0, 0);
3527 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
3531 result
= allocate_value
3532 (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
3533 cplus_make_method_ptr (value_type (result
),
3534 value_contents_writeable (result
),
3535 TYPE_FN_FIELD_VOFFSET (f
, j
), 1);
3537 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
3538 return allocate_value (TYPE_FN_FIELD_TYPE (f
, j
));
3540 error (_("Cannot reference virtual member function \"%s\""),
3546 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
3547 0, VAR_DOMAIN
, 0).symbol
;
3552 struct value
*v
= read_var_value (s
, 0, 0);
3557 result
= allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
3558 cplus_make_method_ptr (value_type (result
),
3559 value_contents_writeable (result
),
3560 value_address (v
), 0);
3566 for (i
= TYPE_N_BASECLASSES (t
) - 1; i
>= 0; i
--)
3571 if (BASETYPE_VIA_VIRTUAL (t
, i
))
3574 base_offset
= TYPE_BASECLASS_BITPOS (t
, i
) / 8;
3575 v
= value_struct_elt_for_reference (domain
,
3576 offset
+ base_offset
,
3577 TYPE_BASECLASS (t
, i
),
3579 want_address
, noside
);
3584 /* As a last chance, pretend that CURTYPE is a namespace, and look
3585 it up that way; this (frequently) works for types nested inside
3588 return value_maybe_namespace_elt (curtype
, name
,
3589 want_address
, noside
);
3592 /* C++: Return the member NAME of the namespace given by the type
3595 static struct value
*
3596 value_namespace_elt (const struct type
*curtype
,
3597 const char *name
, int want_address
,
3600 struct value
*retval
= value_maybe_namespace_elt (curtype
, name
,
3605 error (_("No symbol \"%s\" in namespace \"%s\"."),
3606 name
, TYPE_NAME (curtype
));
3611 /* A helper function used by value_namespace_elt and
3612 value_struct_elt_for_reference. It looks up NAME inside the
3613 context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE
3614 is a class and NAME refers to a type in CURTYPE itself (as opposed
3615 to, say, some base class of CURTYPE). */
3617 static struct value
*
3618 value_maybe_namespace_elt (const struct type
*curtype
,
3619 const char *name
, int want_address
,
3622 const char *namespace_name
= TYPE_NAME (curtype
);
3623 struct block_symbol sym
;
3624 struct value
*result
;
3626 sym
= cp_lookup_symbol_namespace (namespace_name
, name
,
3627 get_selected_block (0), VAR_DOMAIN
);
3629 if (sym
.symbol
== NULL
)
3631 else if ((noside
== EVAL_AVOID_SIDE_EFFECTS
)
3632 && (SYMBOL_CLASS (sym
.symbol
) == LOC_TYPEDEF
))
3633 result
= allocate_value (SYMBOL_TYPE (sym
.symbol
));
3635 result
= value_of_variable (sym
.symbol
, sym
.block
);
3638 result
= value_addr (result
);
3643 /* Given a pointer or a reference value V, find its real (RTTI) type.
3645 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
3646 and refer to the values computed for the object pointed to. */
3649 value_rtti_indirect_type (struct value
*v
, int *full
,
3650 LONGEST
*top
, int *using_enc
)
3652 struct value
*target
= NULL
;
3653 struct type
*type
, *real_type
, *target_type
;
3655 type
= value_type (v
);
3656 type
= check_typedef (type
);
3657 if (TYPE_IS_REFERENCE (type
))
3658 target
= coerce_ref (v
);
3659 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3664 target
= value_ind (v
);
3666 CATCH (except
, RETURN_MASK_ERROR
)
3668 if (except
.error
== MEMORY_ERROR
)
3670 /* value_ind threw a memory error. The pointer is NULL or
3671 contains an uninitialized value: we can't determine any
3675 throw_exception (except
);
3682 real_type
= value_rtti_type (target
, full
, top
, using_enc
);
3686 /* Copy qualifiers to the referenced object. */
3687 target_type
= value_type (target
);
3688 real_type
= make_cv_type (TYPE_CONST (target_type
),
3689 TYPE_VOLATILE (target_type
), real_type
, NULL
);
3690 if (TYPE_IS_REFERENCE (type
))
3691 real_type
= lookup_reference_type (real_type
, TYPE_CODE (type
));
3692 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3693 real_type
= lookup_pointer_type (real_type
);
3695 internal_error (__FILE__
, __LINE__
, _("Unexpected value type."));
3697 /* Copy qualifiers to the pointer/reference. */
3698 real_type
= make_cv_type (TYPE_CONST (type
), TYPE_VOLATILE (type
),
3705 /* Given a value pointed to by ARGP, check its real run-time type, and
3706 if that is different from the enclosing type, create a new value
3707 using the real run-time type as the enclosing type (and of the same
3708 type as ARGP) and return it, with the embedded offset adjusted to
3709 be the correct offset to the enclosed object. RTYPE is the type,
3710 and XFULL, XTOP, and XUSING_ENC are the other parameters, computed
3711 by value_rtti_type(). If these are available, they can be supplied
3712 and a second call to value_rtti_type() is avoided. (Pass RTYPE ==
3713 NULL if they're not available. */
3716 value_full_object (struct value
*argp
,
3718 int xfull
, int xtop
,
3721 struct type
*real_type
;
3725 struct value
*new_val
;
3732 using_enc
= xusing_enc
;
3735 real_type
= value_rtti_type (argp
, &full
, &top
, &using_enc
);
3737 /* If no RTTI data, or if object is already complete, do nothing. */
3738 if (!real_type
|| real_type
== value_enclosing_type (argp
))
3741 /* In a destructor we might see a real type that is a superclass of
3742 the object's type. In this case it is better to leave the object
3745 && TYPE_LENGTH (real_type
) < TYPE_LENGTH (value_enclosing_type (argp
)))
3748 /* If we have the full object, but for some reason the enclosing
3749 type is wrong, set it. */
3750 /* pai: FIXME -- sounds iffy */
3753 argp
= value_copy (argp
);
3754 set_value_enclosing_type (argp
, real_type
);
3758 /* Check if object is in memory. */
3759 if (VALUE_LVAL (argp
) != lval_memory
)
3761 warning (_("Couldn't retrieve complete object of RTTI "
3762 "type %s; object may be in register(s)."),
3763 TYPE_NAME (real_type
));
3768 /* All other cases -- retrieve the complete object. */
3769 /* Go back by the computed top_offset from the beginning of the
3770 object, adjusting for the embedded offset of argp if that's what
3771 value_rtti_type used for its computation. */
3772 new_val
= value_at_lazy (real_type
, value_address (argp
) - top
+
3773 (using_enc
? 0 : value_embedded_offset (argp
)));
3774 deprecated_set_value_type (new_val
, value_type (argp
));
3775 set_value_embedded_offset (new_val
, (using_enc
3776 ? top
+ value_embedded_offset (argp
)
3782 /* Return the value of the local variable, if one exists. Throw error
3783 otherwise, such as if the request is made in an inappropriate context. */
3786 value_of_this (const struct language_defn
*lang
)
3788 struct block_symbol sym
;
3789 const struct block
*b
;
3790 struct frame_info
*frame
;
3792 if (!lang
->la_name_of_this
)
3793 error (_("no `this' in current language"));
3795 frame
= get_selected_frame (_("no frame selected"));
3797 b
= get_frame_block (frame
, NULL
);
3799 sym
= lookup_language_this (lang
, b
);
3800 if (sym
.symbol
== NULL
)
3801 error (_("current stack frame does not contain a variable named `%s'"),
3802 lang
->la_name_of_this
);
3804 return read_var_value (sym
.symbol
, sym
.block
, frame
);
3807 /* Return the value of the local variable, if one exists. Return NULL
3808 otherwise. Never throw error. */
3811 value_of_this_silent (const struct language_defn
*lang
)
3813 struct value
*ret
= NULL
;
3817 ret
= value_of_this (lang
);
3819 CATCH (except
, RETURN_MASK_ERROR
)
3827 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH
3828 elements long, starting at LOWBOUND. The result has the same lower
3829 bound as the original ARRAY. */
3832 value_slice (struct value
*array
, int lowbound
, int length
)
3834 struct type
*slice_range_type
, *slice_type
, *range_type
;
3835 LONGEST lowerbound
, upperbound
;
3836 struct value
*slice
;
3837 struct type
*array_type
;
3839 array_type
= check_typedef (value_type (array
));
3840 if (TYPE_CODE (array_type
) != TYPE_CODE_ARRAY
3841 && TYPE_CODE (array_type
) != TYPE_CODE_STRING
)
3842 error (_("cannot take slice of non-array"));
3844 range_type
= TYPE_INDEX_TYPE (array_type
);
3845 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
3846 error (_("slice from bad array or bitstring"));
3848 if (lowbound
< lowerbound
|| length
< 0
3849 || lowbound
+ length
- 1 > upperbound
)
3850 error (_("slice out of range"));
3852 /* FIXME-type-allocation: need a way to free this type when we are
3854 slice_range_type
= create_static_range_type ((struct type
*) NULL
,
3855 TYPE_TARGET_TYPE (range_type
),
3857 lowbound
+ length
- 1);
3860 struct type
*element_type
= TYPE_TARGET_TYPE (array_type
);
3862 = (lowbound
- lowerbound
) * TYPE_LENGTH (check_typedef (element_type
));
3864 slice_type
= create_array_type ((struct type
*) NULL
,
3867 TYPE_CODE (slice_type
) = TYPE_CODE (array_type
);
3869 if (VALUE_LVAL (array
) == lval_memory
&& value_lazy (array
))
3870 slice
= allocate_value_lazy (slice_type
);
3873 slice
= allocate_value (slice_type
);
3874 value_contents_copy (slice
, 0, array
, offset
,
3875 type_length_units (slice_type
));
3878 set_value_component_location (slice
, array
);
3879 set_value_offset (slice
, value_offset (array
) + offset
);
3885 /* Create a value for a FORTRAN complex number. Currently most of the
3886 time values are coerced to COMPLEX*16 (i.e. a complex number
3887 composed of 2 doubles. This really should be a smarter routine
3888 that figures out precision inteligently as opposed to assuming
3889 doubles. FIXME: fmb */
3892 value_literal_complex (struct value
*arg1
,
3897 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3899 val
= allocate_value (type
);
3900 arg1
= value_cast (real_type
, arg1
);
3901 arg2
= value_cast (real_type
, arg2
);
3903 memcpy (value_contents_raw (val
),
3904 value_contents (arg1
), TYPE_LENGTH (real_type
));
3905 memcpy (value_contents_raw (val
) + TYPE_LENGTH (real_type
),
3906 value_contents (arg2
), TYPE_LENGTH (real_type
));
3910 /* Cast a value into the appropriate complex data type. */
3912 static struct value
*
3913 cast_into_complex (struct type
*type
, struct value
*val
)
3915 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3917 if (TYPE_CODE (value_type (val
)) == TYPE_CODE_COMPLEX
)
3919 struct type
*val_real_type
= TYPE_TARGET_TYPE (value_type (val
));
3920 struct value
*re_val
= allocate_value (val_real_type
);
3921 struct value
*im_val
= allocate_value (val_real_type
);
3923 memcpy (value_contents_raw (re_val
),
3924 value_contents (val
), TYPE_LENGTH (val_real_type
));
3925 memcpy (value_contents_raw (im_val
),
3926 value_contents (val
) + TYPE_LENGTH (val_real_type
),
3927 TYPE_LENGTH (val_real_type
));
3929 return value_literal_complex (re_val
, im_val
, type
);
3931 else if (TYPE_CODE (value_type (val
)) == TYPE_CODE_FLT
3932 || TYPE_CODE (value_type (val
)) == TYPE_CODE_INT
)
3933 return value_literal_complex (val
,
3934 value_zero (real_type
, not_lval
),
3937 error (_("cannot cast non-number to complex"));
3941 _initialize_valops (void)
3943 add_setshow_boolean_cmd ("overload-resolution", class_support
,
3944 &overload_resolution
, _("\
3945 Set overload resolution in evaluating C++ functions."), _("\
3946 Show overload resolution in evaluating C++ functions."),
3948 show_overload_resolution
,
3949 &setlist
, &showlist
);
3950 overload_resolution
= 1;