1 /* Perform non-arithmetic operations on values, for GDB.
3 Copyright (C) 1986-2016 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
35 #include "dictionary.h"
36 #include "cp-support.h"
38 #include "tracepoint.h"
41 #include "extension.h"
43 extern unsigned int overload_debug;
44 /* Local functions. */
46 static int typecmp (int staticp, int varargs, int nargs,
47 struct field t1[], struct value *t2[]);
49 static struct value *search_struct_field (const char *, struct value *,
52 static struct value *search_struct_method (const char *, struct value **,
54 int, int *, struct type *);
56 static int find_oload_champ_namespace (struct value **, int,
57 const char *, const char *,
59 struct badness_vector **,
63 int find_oload_champ_namespace_loop (struct value **, int,
64 const char *, const char *,
65 int, struct symbol ***,
66 struct badness_vector **, int *,
69 static int find_oload_champ (struct value **, int, int,
70 struct fn_field *, VEC (xmethod_worker_ptr) *,
71 struct symbol **, struct badness_vector **);
73 static int oload_method_static_p (struct fn_field *, int);
75 enum oload_classification { STANDARD, NON_STANDARD, INCOMPATIBLE };
78 oload_classification classify_oload_match (struct badness_vector *,
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 int, struct type *, struct fn_field **, int *,
100 VEC (xmethod_worker_ptr) **,
101 struct type **, int *);
103 void _initialize_valops (void);
106 /* Flag for whether we want to abandon failed expression evals by
109 static int auto_abandon = 0;
112 int overload_resolution = 0;
114 show_overload_resolution (struct ui_file *file, int from_tty,
115 struct cmd_list_element *c,
118 fprintf_filtered (file, _("Overload resolution in evaluating "
119 "C++ functions is %s.\n"),
123 /* Find the address of function name NAME in the inferior. If OBJF_P
124 is non-NULL, *OBJF_P will be set to the OBJFILE where the function
128 find_function_in_inferior (const char *name, struct objfile **objf_p)
130 struct block_symbol sym;
132 sym = lookup_symbol (name, 0, VAR_DOMAIN, 0);
133 if (sym.symbol != NULL)
135 if (SYMBOL_CLASS (sym.symbol) != LOC_BLOCK)
137 error (_("\"%s\" exists in this program but is not a function."),
142 *objf_p = symbol_objfile (sym.symbol);
144 return value_of_variable (sym.symbol, sym.block);
148 struct bound_minimal_symbol msymbol =
149 lookup_bound_minimal_symbol (name);
151 if (msymbol.minsym != NULL)
153 struct objfile *objfile = msymbol.objfile;
154 struct gdbarch *gdbarch = get_objfile_arch (objfile);
158 type = lookup_pointer_type (builtin_type (gdbarch)->builtin_char);
159 type = lookup_function_type (type);
160 type = lookup_pointer_type (type);
161 maddr = BMSYMBOL_VALUE_ADDRESS (msymbol);
166 return value_from_pointer (type, maddr);
170 if (!target_has_execution)
171 error (_("evaluation of this expression "
172 "requires the target program to be active"));
174 error (_("evaluation of this expression requires the "
175 "program to have a function \"%s\"."),
181 /* Allocate NBYTES of space in the inferior using the inferior's
182 malloc and return a value that is a pointer to the allocated
186 value_allocate_space_in_inferior (int len)
188 struct objfile *objf;
189 struct value *val = find_function_in_inferior ("malloc", &objf);
190 struct gdbarch *gdbarch = get_objfile_arch (objf);
191 struct value *blocklen;
193 blocklen = value_from_longest (builtin_type (gdbarch)->builtin_int, len);
194 val = call_function_by_hand (val, 1, &blocklen);
195 if (value_logical_not (val))
197 if (!target_has_execution)
198 error (_("No memory available to program now: "
199 "you need to start the target first"));
201 error (_("No memory available to program: call to malloc failed"));
207 allocate_space_in_inferior (int len)
209 return value_as_long (value_allocate_space_in_inferior (len));
212 /* Cast struct value VAL to type TYPE and return as a value.
213 Both type and val must be of TYPE_CODE_STRUCT or TYPE_CODE_UNION
214 for this to work. Typedef to one of the codes is permitted.
215 Returns NULL if the cast is neither an upcast nor a downcast. */
217 static struct value *
218 value_cast_structs (struct type *type, struct value *v2)
224 gdb_assert (type != NULL && v2 != NULL);
226 t1 = check_typedef (type);
227 t2 = check_typedef (value_type (v2));
229 /* Check preconditions. */
230 gdb_assert ((TYPE_CODE (t1) == TYPE_CODE_STRUCT
231 || TYPE_CODE (t1) == TYPE_CODE_UNION)
232 && !!"Precondition is that type is of STRUCT or UNION kind.");
233 gdb_assert ((TYPE_CODE (t2) == TYPE_CODE_STRUCT
234 || TYPE_CODE (t2) == TYPE_CODE_UNION)
235 && !!"Precondition is that value is of STRUCT or UNION kind");
237 if (TYPE_NAME (t1) != NULL
238 && TYPE_NAME (t2) != NULL
239 && !strcmp (TYPE_NAME (t1), TYPE_NAME (t2)))
242 /* Upcasting: look in the type of the source to see if it contains the
243 type of the target as a superclass. If so, we'll need to
244 offset the pointer rather than just change its type. */
245 if (TYPE_NAME (t1) != NULL)
247 v = search_struct_field (type_name_no_tag (t1),
253 /* Downcasting: look in the type of the target to see if it contains the
254 type of the source as a superclass. If so, we'll need to
255 offset the pointer rather than just change its type. */
256 if (TYPE_NAME (t2) != NULL)
258 /* Try downcasting using the run-time type of the value. */
259 int full, top, using_enc;
260 struct type *real_type;
262 real_type = value_rtti_type (v2, &full, &top, &using_enc);
265 v = value_full_object (v2, real_type, full, top, using_enc);
266 v = value_at_lazy (real_type, value_address (v));
267 real_type = value_type (v);
269 /* We might be trying to cast to the outermost enclosing
270 type, in which case search_struct_field won't work. */
271 if (TYPE_NAME (real_type) != NULL
272 && !strcmp (TYPE_NAME (real_type), TYPE_NAME (t1)))
275 v = search_struct_field (type_name_no_tag (t2), v, real_type, 1);
280 /* Try downcasting using information from the destination type
281 T2. This wouldn't work properly for classes with virtual
282 bases, but those were handled above. */
283 v = search_struct_field (type_name_no_tag (t2),
284 value_zero (t1, not_lval), t1, 1);
287 /* Downcasting is possible (t1 is superclass of v2). */
288 CORE_ADDR addr2 = value_address (v2);
290 addr2 -= value_address (v) + value_embedded_offset (v);
291 return value_at (type, addr2);
298 /* Cast one pointer or reference type to another. Both TYPE and
299 the type of ARG2 should be pointer types, or else both should be
300 reference types. If SUBCLASS_CHECK is non-zero, this will force a
301 check to see whether TYPE is a superclass of ARG2's type. If
302 SUBCLASS_CHECK is zero, then the subclass check is done only when
303 ARG2 is itself non-zero. Returns the new pointer or reference. */
306 value_cast_pointers (struct type *type, struct value *arg2,
309 struct type *type1 = check_typedef (type);
310 struct type *type2 = check_typedef (value_type (arg2));
311 struct type *t1 = check_typedef (TYPE_TARGET_TYPE (type1));
312 struct type *t2 = check_typedef (TYPE_TARGET_TYPE (type2));
314 if (TYPE_CODE (t1) == TYPE_CODE_STRUCT
315 && TYPE_CODE (t2) == TYPE_CODE_STRUCT
316 && (subclass_check || !value_logical_not (arg2)))
320 if (TYPE_CODE (type2) == TYPE_CODE_REF)
321 v2 = coerce_ref (arg2);
323 v2 = value_ind (arg2);
324 gdb_assert (TYPE_CODE (check_typedef (value_type (v2)))
325 == TYPE_CODE_STRUCT && !!"Why did coercion fail?");
326 v2 = value_cast_structs (t1, v2);
327 /* At this point we have what we can have, un-dereference if needed. */
330 struct value *v = value_addr (v2);
332 deprecated_set_value_type (v, type);
337 /* No superclass found, just change the pointer type. */
338 arg2 = value_copy (arg2);
339 deprecated_set_value_type (arg2, type);
340 set_value_enclosing_type (arg2, type);
341 set_value_pointed_to_offset (arg2, 0); /* pai: chk_val */
345 /* Cast value ARG2 to type TYPE and return as a value.
346 More general than a C cast: accepts any two types of the same length,
347 and if ARG2 is an lvalue it can be cast into anything at all. */
348 /* In C++, casts may change pointer or object representations. */
351 value_cast (struct type *type, struct value *arg2)
353 enum type_code code1;
354 enum type_code code2;
358 int convert_to_boolean = 0;
360 if (value_type (arg2) == type)
363 code1 = TYPE_CODE (check_typedef (type));
365 /* Check if we are casting struct reference to struct reference. */
366 if (code1 == TYPE_CODE_REF)
368 /* We dereference type; then we recurse and finally
369 we generate value of the given reference. Nothing wrong with
371 struct type *t1 = check_typedef (type);
372 struct type *dereftype = check_typedef (TYPE_TARGET_TYPE (t1));
373 struct value *val = value_cast (dereftype, arg2);
375 return value_ref (val);
378 code2 = TYPE_CODE (check_typedef (value_type (arg2)));
380 if (code2 == TYPE_CODE_REF)
381 /* We deref the value and then do the cast. */
382 return value_cast (type, coerce_ref (arg2));
384 type = check_typedef (type);
385 code1 = TYPE_CODE (type);
386 arg2 = coerce_ref (arg2);
387 type2 = check_typedef (value_type (arg2));
389 /* You can't cast to a reference type. See value_cast_pointers
391 gdb_assert (code1 != TYPE_CODE_REF);
393 /* A cast to an undetermined-length array_type, such as
394 (TYPE [])OBJECT, is treated like a cast to (TYPE [N])OBJECT,
395 where N is sizeof(OBJECT)/sizeof(TYPE). */
396 if (code1 == TYPE_CODE_ARRAY)
398 struct type *element_type = TYPE_TARGET_TYPE (type);
399 unsigned element_length = TYPE_LENGTH (check_typedef (element_type));
401 if (element_length > 0 && TYPE_ARRAY_UPPER_BOUND_IS_UNDEFINED (type))
403 struct type *range_type = TYPE_INDEX_TYPE (type);
404 int val_length = TYPE_LENGTH (type2);
405 LONGEST low_bound, high_bound, new_length;
407 if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0)
408 low_bound = 0, high_bound = 0;
409 new_length = val_length / element_length;
410 if (val_length % element_length != 0)
411 warning (_("array element type size does not "
412 "divide object size in cast"));
413 /* FIXME-type-allocation: need a way to free this type when
414 we are done with it. */
415 range_type = create_static_range_type ((struct type *) NULL,
416 TYPE_TARGET_TYPE (range_type),
418 new_length + low_bound - 1);
419 deprecated_set_value_type (arg2,
420 create_array_type ((struct type *) NULL,
427 if (current_language->c_style_arrays
428 && TYPE_CODE (type2) == TYPE_CODE_ARRAY
429 && !TYPE_VECTOR (type2))
430 arg2 = value_coerce_array (arg2);
432 if (TYPE_CODE (type2) == TYPE_CODE_FUNC)
433 arg2 = value_coerce_function (arg2);
435 type2 = check_typedef (value_type (arg2));
436 code2 = TYPE_CODE (type2);
438 if (code1 == TYPE_CODE_COMPLEX)
439 return cast_into_complex (type, arg2);
440 if (code1 == TYPE_CODE_BOOL)
442 code1 = TYPE_CODE_INT;
443 convert_to_boolean = 1;
445 if (code1 == TYPE_CODE_CHAR)
446 code1 = TYPE_CODE_INT;
447 if (code2 == TYPE_CODE_BOOL || code2 == TYPE_CODE_CHAR)
448 code2 = TYPE_CODE_INT;
450 scalar = (code2 == TYPE_CODE_INT || code2 == TYPE_CODE_FLT
451 || code2 == TYPE_CODE_DECFLOAT || code2 == TYPE_CODE_ENUM
452 || code2 == TYPE_CODE_RANGE);
454 if ((code1 == TYPE_CODE_STRUCT || code1 == TYPE_CODE_UNION)
455 && (code2 == TYPE_CODE_STRUCT || code2 == TYPE_CODE_UNION)
456 && TYPE_NAME (type) != 0)
458 struct value *v = value_cast_structs (type, arg2);
464 if (code1 == TYPE_CODE_FLT && scalar)
465 return value_from_double (type, value_as_double (arg2));
466 else if (code1 == TYPE_CODE_DECFLOAT && scalar)
468 enum bfd_endian byte_order = gdbarch_byte_order (get_type_arch (type));
469 int dec_len = TYPE_LENGTH (type);
472 if (code2 == TYPE_CODE_FLT)
473 decimal_from_floating (arg2, dec, dec_len, byte_order);
474 else if (code2 == TYPE_CODE_DECFLOAT)
475 decimal_convert (value_contents (arg2), TYPE_LENGTH (type2),
476 byte_order, dec, dec_len, byte_order);
478 /* The only option left is an integral type. */
479 decimal_from_integral (arg2, dec, dec_len, byte_order);
481 return value_from_decfloat (type, dec);
483 else if ((code1 == TYPE_CODE_INT || code1 == TYPE_CODE_ENUM
484 || code1 == TYPE_CODE_RANGE)
485 && (scalar || code2 == TYPE_CODE_PTR
486 || code2 == TYPE_CODE_MEMBERPTR))
490 /* When we cast pointers to integers, we mustn't use
491 gdbarch_pointer_to_address to find the address the pointer
492 represents, as value_as_long would. GDB should evaluate
493 expressions just as the compiler would --- and the compiler
494 sees a cast as a simple reinterpretation of the pointer's
496 if (code2 == TYPE_CODE_PTR)
497 longest = extract_unsigned_integer
498 (value_contents (arg2), TYPE_LENGTH (type2),
499 gdbarch_byte_order (get_type_arch (type2)));
501 longest = value_as_long (arg2);
502 return value_from_longest (type, convert_to_boolean ?
503 (LONGEST) (longest ? 1 : 0) : longest);
505 else if (code1 == TYPE_CODE_PTR && (code2 == TYPE_CODE_INT
506 || code2 == TYPE_CODE_ENUM
507 || code2 == TYPE_CODE_RANGE))
509 /* TYPE_LENGTH (type) is the length of a pointer, but we really
510 want the length of an address! -- we are really dealing with
511 addresses (i.e., gdb representations) not pointers (i.e.,
512 target representations) here.
514 This allows things like "print *(int *)0x01000234" to work
515 without printing a misleading message -- which would
516 otherwise occur when dealing with a target having two byte
517 pointers and four byte addresses. */
519 int addr_bit = gdbarch_addr_bit (get_type_arch (type2));
520 LONGEST longest = value_as_long (arg2);
522 if (addr_bit < sizeof (LONGEST) * HOST_CHAR_BIT)
524 if (longest >= ((LONGEST) 1 << addr_bit)
525 || longest <= -((LONGEST) 1 << addr_bit))
526 warning (_("value truncated"));
528 return value_from_longest (type, longest);
530 else if (code1 == TYPE_CODE_METHODPTR && code2 == TYPE_CODE_INT
531 && value_as_long (arg2) == 0)
533 struct value *result = allocate_value (type);
535 cplus_make_method_ptr (type, value_contents_writeable (result), 0, 0);
538 else if (code1 == TYPE_CODE_MEMBERPTR && code2 == TYPE_CODE_INT
539 && value_as_long (arg2) == 0)
541 /* The Itanium C++ ABI represents NULL pointers to members as
542 minus one, instead of biasing the normal case. */
543 return value_from_longest (type, -1);
545 else if (code1 == TYPE_CODE_ARRAY && TYPE_VECTOR (type)
546 && code2 == TYPE_CODE_ARRAY && TYPE_VECTOR (type2)
547 && TYPE_LENGTH (type) != TYPE_LENGTH (type2))
548 error (_("Cannot convert between vector values of different sizes"));
549 else if (code1 == TYPE_CODE_ARRAY && TYPE_VECTOR (type) && scalar
550 && TYPE_LENGTH (type) != TYPE_LENGTH (type2))
551 error (_("can only cast scalar to vector of same size"));
552 else if (code1 == TYPE_CODE_VOID)
554 return value_zero (type, not_lval);
556 else if (TYPE_LENGTH (type) == TYPE_LENGTH (type2))
558 if (code1 == TYPE_CODE_PTR && code2 == TYPE_CODE_PTR)
559 return value_cast_pointers (type, arg2, 0);
561 arg2 = value_copy (arg2);
562 deprecated_set_value_type (arg2, type);
563 set_value_enclosing_type (arg2, type);
564 set_value_pointed_to_offset (arg2, 0); /* pai: chk_val */
567 else if (VALUE_LVAL (arg2) == lval_memory)
568 return value_at_lazy (type, value_address (arg2));
571 error (_("Invalid cast."));
576 /* The C++ reinterpret_cast operator. */
579 value_reinterpret_cast (struct type *type, struct value *arg)
581 struct value *result;
582 struct type *real_type = check_typedef (type);
583 struct type *arg_type, *dest_type;
585 enum type_code dest_code, arg_code;
587 /* Do reference, function, and array conversion. */
588 arg = coerce_array (arg);
590 /* Attempt to preserve the type the user asked for. */
593 /* If we are casting to a reference type, transform
594 reinterpret_cast<T&>(V) to *reinterpret_cast<T*>(&V). */
595 if (TYPE_CODE (real_type) == TYPE_CODE_REF)
598 arg = value_addr (arg);
599 dest_type = lookup_pointer_type (TYPE_TARGET_TYPE (dest_type));
600 real_type = lookup_pointer_type (real_type);
603 arg_type = value_type (arg);
605 dest_code = TYPE_CODE (real_type);
606 arg_code = TYPE_CODE (arg_type);
608 /* We can convert pointer types, or any pointer type to int, or int
610 if ((dest_code == TYPE_CODE_PTR && arg_code == TYPE_CODE_INT)
611 || (dest_code == TYPE_CODE_INT && arg_code == TYPE_CODE_PTR)
612 || (dest_code == TYPE_CODE_METHODPTR && arg_code == TYPE_CODE_INT)
613 || (dest_code == TYPE_CODE_INT && arg_code == TYPE_CODE_METHODPTR)
614 || (dest_code == TYPE_CODE_MEMBERPTR && arg_code == TYPE_CODE_INT)
615 || (dest_code == TYPE_CODE_INT && arg_code == TYPE_CODE_MEMBERPTR)
616 || (dest_code == arg_code
617 && (dest_code == TYPE_CODE_PTR
618 || dest_code == TYPE_CODE_METHODPTR
619 || dest_code == TYPE_CODE_MEMBERPTR)))
620 result = value_cast (dest_type, arg);
622 error (_("Invalid reinterpret_cast"));
625 result = value_cast (type, value_ref (value_ind (result)));
630 /* A helper for value_dynamic_cast. This implements the first of two
631 runtime checks: we iterate over all the base classes of the value's
632 class which are equal to the desired class; if only one of these
633 holds the value, then it is the answer. */
636 dynamic_cast_check_1 (struct type *desired_type,
637 const gdb_byte *valaddr,
641 struct type *search_type,
643 struct type *arg_type,
644 struct value **result)
646 int i, result_count = 0;
648 for (i = 0; i < TYPE_N_BASECLASSES (search_type) && result_count < 2; ++i)
650 int offset = baseclass_offset (search_type, i, valaddr, embedded_offset,
653 if (class_types_same_p (desired_type, TYPE_BASECLASS (search_type, i)))
655 if (address + embedded_offset + offset >= arg_addr
656 && address + embedded_offset + offset < arg_addr + TYPE_LENGTH (arg_type))
660 *result = value_at_lazy (TYPE_BASECLASS (search_type, i),
661 address + embedded_offset + offset);
665 result_count += dynamic_cast_check_1 (desired_type,
667 embedded_offset + offset,
669 TYPE_BASECLASS (search_type, i),
678 /* A helper for value_dynamic_cast. This implements the second of two
679 runtime checks: we look for a unique public sibling class of the
680 argument's declared class. */
683 dynamic_cast_check_2 (struct type *desired_type,
684 const gdb_byte *valaddr,
688 struct type *search_type,
689 struct value **result)
691 int i, result_count = 0;
693 for (i = 0; i < TYPE_N_BASECLASSES (search_type) && result_count < 2; ++i)
697 if (! BASETYPE_VIA_PUBLIC (search_type, i))
700 offset = baseclass_offset (search_type, i, valaddr, embedded_offset,
702 if (class_types_same_p (desired_type, TYPE_BASECLASS (search_type, i)))
706 *result = value_at_lazy (TYPE_BASECLASS (search_type, i),
707 address + embedded_offset + offset);
710 result_count += dynamic_cast_check_2 (desired_type,
712 embedded_offset + offset,
714 TYPE_BASECLASS (search_type, i),
721 /* The C++ dynamic_cast operator. */
724 value_dynamic_cast (struct type *type, struct value *arg)
726 int full, top, using_enc;
727 struct type *resolved_type = check_typedef (type);
728 struct type *arg_type = check_typedef (value_type (arg));
729 struct type *class_type, *rtti_type;
730 struct value *result, *tem, *original_arg = arg;
732 int is_ref = TYPE_CODE (resolved_type) == TYPE_CODE_REF;
734 if (TYPE_CODE (resolved_type) != TYPE_CODE_PTR
735 && TYPE_CODE (resolved_type) != TYPE_CODE_REF)
736 error (_("Argument to dynamic_cast must be a pointer or reference type"));
737 if (TYPE_CODE (TYPE_TARGET_TYPE (resolved_type)) != TYPE_CODE_VOID
738 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type)) != TYPE_CODE_STRUCT)
739 error (_("Argument to dynamic_cast must be pointer to class or `void *'"));
741 class_type = check_typedef (TYPE_TARGET_TYPE (resolved_type));
742 if (TYPE_CODE (resolved_type) == TYPE_CODE_PTR)
744 if (TYPE_CODE (arg_type) != TYPE_CODE_PTR
745 && ! (TYPE_CODE (arg_type) == TYPE_CODE_INT
746 && value_as_long (arg) == 0))
747 error (_("Argument to dynamic_cast does not have pointer type"));
748 if (TYPE_CODE (arg_type) == TYPE_CODE_PTR)
750 arg_type = check_typedef (TYPE_TARGET_TYPE (arg_type));
751 if (TYPE_CODE (arg_type) != TYPE_CODE_STRUCT)
752 error (_("Argument to dynamic_cast does "
753 "not have pointer to class type"));
756 /* Handle NULL pointers. */
757 if (value_as_long (arg) == 0)
758 return value_zero (type, not_lval);
760 arg = value_ind (arg);
764 if (TYPE_CODE (arg_type) != TYPE_CODE_STRUCT)
765 error (_("Argument to dynamic_cast does not have class type"));
768 /* If the classes are the same, just return the argument. */
769 if (class_types_same_p (class_type, arg_type))
770 return value_cast (type, arg);
772 /* If the target type is a unique base class of the argument's
773 declared type, just cast it. */
774 if (is_ancestor (class_type, arg_type))
776 if (is_unique_ancestor (class_type, arg))
777 return value_cast (type, original_arg);
778 error (_("Ambiguous dynamic_cast"));
781 rtti_type = value_rtti_type (arg, &full, &top, &using_enc);
783 error (_("Couldn't determine value's most derived type for dynamic_cast"));
785 /* Compute the most derived object's address. */
786 addr = value_address (arg);
794 addr += top + value_embedded_offset (arg);
796 /* dynamic_cast<void *> means to return a pointer to the
797 most-derived object. */
798 if (TYPE_CODE (resolved_type) == TYPE_CODE_PTR
799 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type)) == TYPE_CODE_VOID)
800 return value_at_lazy (type, addr);
802 tem = value_at (type, addr);
803 type = value_type (tem);
805 /* The first dynamic check specified in 5.2.7. */
806 if (is_public_ancestor (arg_type, TYPE_TARGET_TYPE (resolved_type)))
808 if (class_types_same_p (rtti_type, TYPE_TARGET_TYPE (resolved_type)))
811 if (dynamic_cast_check_1 (TYPE_TARGET_TYPE (resolved_type),
812 value_contents_for_printing (tem),
813 value_embedded_offset (tem),
814 value_address (tem), tem,
818 return value_cast (type,
819 is_ref ? value_ref (result) : value_addr (result));
822 /* The second dynamic check specified in 5.2.7. */
824 if (is_public_ancestor (arg_type, rtti_type)
825 && dynamic_cast_check_2 (TYPE_TARGET_TYPE (resolved_type),
826 value_contents_for_printing (tem),
827 value_embedded_offset (tem),
828 value_address (tem), tem,
829 rtti_type, &result) == 1)
830 return value_cast (type,
831 is_ref ? value_ref (result) : value_addr (result));
833 if (TYPE_CODE (resolved_type) == TYPE_CODE_PTR)
834 return value_zero (type, not_lval);
836 error (_("dynamic_cast failed"));
839 /* Create a value of type TYPE that is zero, and return it. */
842 value_zero (struct type *type, enum lval_type lv)
844 struct value *val = allocate_value (type);
846 VALUE_LVAL (val) = (lv == lval_computed ? not_lval : lv);
850 /* Create a not_lval value of numeric type TYPE that is one, and return it. */
853 value_one (struct type *type)
855 struct type *type1 = check_typedef (type);
858 if (TYPE_CODE (type1) == TYPE_CODE_DECFLOAT)
860 enum bfd_endian byte_order = gdbarch_byte_order (get_type_arch (type));
863 decimal_from_string (v, TYPE_LENGTH (type), byte_order, "1");
864 val = value_from_decfloat (type, v);
866 else if (TYPE_CODE (type1) == TYPE_CODE_FLT)
868 val = value_from_double (type, (DOUBLEST) 1);
870 else if (is_integral_type (type1))
872 val = value_from_longest (type, (LONGEST) 1);
874 else if (TYPE_CODE (type1) == TYPE_CODE_ARRAY && TYPE_VECTOR (type1))
876 struct type *eltype = check_typedef (TYPE_TARGET_TYPE (type1));
878 LONGEST low_bound, high_bound;
881 if (!get_array_bounds (type1, &low_bound, &high_bound))
882 error (_("Could not determine the vector bounds"));
884 val = allocate_value (type);
885 for (i = 0; i < high_bound - low_bound + 1; i++)
887 tmp = value_one (eltype);
888 memcpy (value_contents_writeable (val) + i * TYPE_LENGTH (eltype),
889 value_contents_all (tmp), TYPE_LENGTH (eltype));
894 error (_("Not a numeric type."));
897 /* value_one result is never used for assignments to. */
898 gdb_assert (VALUE_LVAL (val) == not_lval);
903 /* Helper function for value_at, value_at_lazy, and value_at_lazy_stack.
904 The type of the created value may differ from the passed type TYPE.
905 Make sure to retrieve the returned values's new type after this call
906 e.g. in case the type is a variable length array. */
908 static struct value *
909 get_value_at (struct type *type, CORE_ADDR addr, int lazy)
913 if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
914 error (_("Attempt to dereference a generic pointer."));
916 val = value_from_contents_and_address (type, NULL, addr);
919 value_fetch_lazy (val);
924 /* Return a value with type TYPE located at ADDR.
926 Call value_at only if the data needs to be fetched immediately;
927 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
928 value_at_lazy instead. value_at_lazy simply records the address of
929 the data and sets the lazy-evaluation-required flag. The lazy flag
930 is tested in the value_contents macro, which is used if and when
931 the contents are actually required. The type of the created value
932 may differ from the passed type TYPE. Make sure to retrieve the
933 returned values's new type after this call e.g. in case the type
934 is a variable length array.
936 Note: value_at does *NOT* handle embedded offsets; perform such
937 adjustments before or after calling it. */
940 value_at (struct type *type, CORE_ADDR addr)
942 return get_value_at (type, addr, 0);
945 /* Return a lazy value with type TYPE located at ADDR (cf. value_at).
946 The type of the created value may differ from the passed type TYPE.
947 Make sure to retrieve the returned values's new type after this call
948 e.g. in case the type is a variable length array. */
951 value_at_lazy (struct type *type, CORE_ADDR addr)
953 return get_value_at (type, addr, 1);
957 read_value_memory (struct value *val, int embedded_offset,
958 int stack, CORE_ADDR memaddr,
959 gdb_byte *buffer, size_t length)
961 ULONGEST xfered_total = 0;
962 struct gdbarch *arch = get_value_arch (val);
963 int unit_size = gdbarch_addressable_memory_unit_size (arch);
964 enum target_object object;
966 object = stack ? TARGET_OBJECT_STACK_MEMORY : TARGET_OBJECT_MEMORY;
968 while (xfered_total < length)
970 enum target_xfer_status status;
971 ULONGEST xfered_partial;
973 status = target_xfer_partial (current_target.beneath,
975 buffer + xfered_total * unit_size, NULL,
976 memaddr + xfered_total,
977 length - xfered_total,
980 if (status == TARGET_XFER_OK)
982 else if (status == TARGET_XFER_UNAVAILABLE)
983 mark_value_bytes_unavailable (val, embedded_offset + xfered_total,
985 else if (status == TARGET_XFER_EOF)
986 memory_error (TARGET_XFER_E_IO, memaddr + xfered_total);
988 memory_error (status, memaddr + xfered_total);
990 xfered_total += xfered_partial;
995 /* Store the contents of FROMVAL into the location of TOVAL.
996 Return a new value with the location of TOVAL and contents of FROMVAL. */
999 value_assign (struct value *toval, struct value *fromval)
1003 struct frame_id old_frame;
1005 if (!deprecated_value_modifiable (toval))
1006 error (_("Left operand of assignment is not a modifiable lvalue."));
1008 toval = coerce_ref (toval);
1010 type = value_type (toval);
1011 if (VALUE_LVAL (toval) != lval_internalvar)
1012 fromval = value_cast (type, fromval);
1015 /* Coerce arrays and functions to pointers, except for arrays
1016 which only live in GDB's storage. */
1017 if (!value_must_coerce_to_target (fromval))
1018 fromval = coerce_array (fromval);
1021 type = check_typedef (type);
1023 /* Since modifying a register can trash the frame chain, and
1024 modifying memory can trash the frame cache, we save the old frame
1025 and then restore the new frame afterwards. */
1026 old_frame = get_frame_id (deprecated_safe_get_selected_frame ());
1028 switch (VALUE_LVAL (toval))
1030 case lval_internalvar:
1031 set_internalvar (VALUE_INTERNALVAR (toval), fromval);
1032 return value_of_internalvar (get_type_arch (type),
1033 VALUE_INTERNALVAR (toval));
1035 case lval_internalvar_component:
1037 int offset = value_offset (toval);
1039 /* Are we dealing with a bitfield?
1041 It is important to mention that `value_parent (toval)' is
1042 non-NULL iff `value_bitsize (toval)' is non-zero. */
1043 if (value_bitsize (toval))
1045 /* VALUE_INTERNALVAR below refers to the parent value, while
1046 the offset is relative to this parent value. */
1047 gdb_assert (value_parent (value_parent (toval)) == NULL);
1048 offset += value_offset (value_parent (toval));
1051 set_internalvar_component (VALUE_INTERNALVAR (toval),
1053 value_bitpos (toval),
1054 value_bitsize (toval),
1061 const gdb_byte *dest_buffer;
1062 CORE_ADDR changed_addr;
1064 gdb_byte buffer[sizeof (LONGEST)];
1066 if (value_bitsize (toval))
1068 struct value *parent = value_parent (toval);
1070 changed_addr = value_address (parent) + value_offset (toval);
1071 changed_len = (value_bitpos (toval)
1072 + value_bitsize (toval)
1073 + HOST_CHAR_BIT - 1)
1076 /* If we can read-modify-write exactly the size of the
1077 containing type (e.g. short or int) then do so. This
1078 is safer for volatile bitfields mapped to hardware
1080 if (changed_len < TYPE_LENGTH (type)
1081 && TYPE_LENGTH (type) <= (int) sizeof (LONGEST)
1082 && ((LONGEST) changed_addr % TYPE_LENGTH (type)) == 0)
1083 changed_len = TYPE_LENGTH (type);
1085 if (changed_len > (int) sizeof (LONGEST))
1086 error (_("Can't handle bitfields which "
1087 "don't fit in a %d bit word."),
1088 (int) sizeof (LONGEST) * HOST_CHAR_BIT);
1090 read_memory (changed_addr, buffer, changed_len);
1091 modify_field (type, buffer, value_as_long (fromval),
1092 value_bitpos (toval), value_bitsize (toval));
1093 dest_buffer = buffer;
1097 changed_addr = value_address (toval);
1098 changed_len = type_length_units (type);
1099 dest_buffer = value_contents (fromval);
1102 write_memory_with_notification (changed_addr, dest_buffer, changed_len);
1108 struct frame_info *frame;
1109 struct gdbarch *gdbarch;
1112 /* Figure out which frame this is in currently. */
1113 frame = frame_find_by_id (VALUE_FRAME_ID (toval));
1114 value_reg = VALUE_REGNUM (toval);
1117 error (_("Value being assigned to is no longer active."));
1119 gdbarch = get_frame_arch (frame);
1121 if (value_bitsize (toval))
1123 struct value *parent = value_parent (toval);
1124 int offset = value_offset (parent) + value_offset (toval);
1126 gdb_byte buffer[sizeof (LONGEST)];
1129 changed_len = (value_bitpos (toval)
1130 + value_bitsize (toval)
1131 + HOST_CHAR_BIT - 1)
1134 if (changed_len > (int) sizeof (LONGEST))
1135 error (_("Can't handle bitfields which "
1136 "don't fit in a %d bit word."),
1137 (int) sizeof (LONGEST) * HOST_CHAR_BIT);
1139 if (!get_frame_register_bytes (frame, value_reg, offset,
1140 changed_len, buffer,
1144 throw_error (OPTIMIZED_OUT_ERROR,
1145 _("value has been optimized out"));
1147 throw_error (NOT_AVAILABLE_ERROR,
1148 _("value is not available"));
1151 modify_field (type, buffer, value_as_long (fromval),
1152 value_bitpos (toval), value_bitsize (toval));
1154 put_frame_register_bytes (frame, value_reg, offset,
1155 changed_len, buffer);
1159 if (gdbarch_convert_register_p (gdbarch, VALUE_REGNUM (toval),
1162 /* If TOVAL is a special machine register requiring
1163 conversion of program values to a special raw
1165 gdbarch_value_to_register (gdbarch, frame,
1166 VALUE_REGNUM (toval), type,
1167 value_contents (fromval));
1171 put_frame_register_bytes (frame, value_reg,
1172 value_offset (toval),
1174 value_contents (fromval));
1178 observer_notify_register_changed (frame, value_reg);
1184 const struct lval_funcs *funcs = value_computed_funcs (toval);
1186 if (funcs->write != NULL)
1188 funcs->write (toval, fromval);
1195 error (_("Left operand of assignment is not an lvalue."));
1198 /* Assigning to the stack pointer, frame pointer, and other
1199 (architecture and calling convention specific) registers may
1200 cause the frame cache and regcache to be out of date. Assigning to memory
1201 also can. We just do this on all assignments to registers or
1202 memory, for simplicity's sake; I doubt the slowdown matters. */
1203 switch (VALUE_LVAL (toval))
1209 observer_notify_target_changed (¤t_target);
1211 /* Having destroyed the frame cache, restore the selected
1214 /* FIXME: cagney/2002-11-02: There has to be a better way of
1215 doing this. Instead of constantly saving/restoring the
1216 frame. Why not create a get_selected_frame() function that,
1217 having saved the selected frame's ID can automatically
1218 re-find the previously selected frame automatically. */
1221 struct frame_info *fi = frame_find_by_id (old_frame);
1232 /* If the field does not entirely fill a LONGEST, then zero the sign
1233 bits. If the field is signed, and is negative, then sign
1235 if ((value_bitsize (toval) > 0)
1236 && (value_bitsize (toval) < 8 * (int) sizeof (LONGEST)))
1238 LONGEST fieldval = value_as_long (fromval);
1239 LONGEST valmask = (((ULONGEST) 1) << value_bitsize (toval)) - 1;
1241 fieldval &= valmask;
1242 if (!TYPE_UNSIGNED (type)
1243 && (fieldval & (valmask ^ (valmask >> 1))))
1244 fieldval |= ~valmask;
1246 fromval = value_from_longest (type, fieldval);
1249 /* The return value is a copy of TOVAL so it shares its location
1250 information, but its contents are updated from FROMVAL. This
1251 implies the returned value is not lazy, even if TOVAL was. */
1252 val = value_copy (toval);
1253 set_value_lazy (val, 0);
1254 memcpy (value_contents_raw (val), value_contents (fromval),
1255 TYPE_LENGTH (type));
1257 /* We copy over the enclosing type and pointed-to offset from FROMVAL
1258 in the case of pointer types. For object types, the enclosing type
1259 and embedded offset must *not* be copied: the target object refered
1260 to by TOVAL retains its original dynamic type after assignment. */
1261 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1263 set_value_enclosing_type (val, value_enclosing_type (fromval));
1264 set_value_pointed_to_offset (val, value_pointed_to_offset (fromval));
1270 /* Extend a value VAL to COUNT repetitions of its type. */
1273 value_repeat (struct value *arg1, int count)
1277 if (VALUE_LVAL (arg1) != lval_memory)
1278 error (_("Only values in memory can be extended with '@'."));
1280 error (_("Invalid number %d of repetitions."), count);
1282 val = allocate_repeat_value (value_enclosing_type (arg1), count);
1284 VALUE_LVAL (val) = lval_memory;
1285 set_value_address (val, value_address (arg1));
1287 read_value_memory (val, 0, value_stack (val), value_address (val),
1288 value_contents_all_raw (val),
1289 type_length_units (value_enclosing_type (val)));
1295 value_of_variable (struct symbol *var, const struct block *b)
1297 struct frame_info *frame = NULL;
1299 if (symbol_read_needs_frame (var))
1300 frame = get_selected_frame (_("No frame selected."));
1302 return read_var_value (var, b, frame);
1306 address_of_variable (struct symbol *var, const struct block *b)
1308 struct type *type = SYMBOL_TYPE (var);
1311 /* Evaluate it first; if the result is a memory address, we're fine.
1312 Lazy evaluation pays off here. */
1314 val = value_of_variable (var, b);
1315 type = value_type (val);
1317 if ((VALUE_LVAL (val) == lval_memory && value_lazy (val))
1318 || TYPE_CODE (type) == TYPE_CODE_FUNC)
1320 CORE_ADDR addr = value_address (val);
1322 return value_from_pointer (lookup_pointer_type (type), addr);
1325 /* Not a memory address; check what the problem was. */
1326 switch (VALUE_LVAL (val))
1330 struct frame_info *frame;
1331 const char *regname;
1333 frame = frame_find_by_id (VALUE_FRAME_ID (val));
1336 regname = gdbarch_register_name (get_frame_arch (frame),
1337 VALUE_REGNUM (val));
1338 gdb_assert (regname && *regname);
1340 error (_("Address requested for identifier "
1341 "\"%s\" which is in register $%s"),
1342 SYMBOL_PRINT_NAME (var), regname);
1347 error (_("Can't take address of \"%s\" which isn't an lvalue."),
1348 SYMBOL_PRINT_NAME (var));
1355 /* Return one if VAL does not live in target memory, but should in order
1356 to operate on it. Otherwise return zero. */
1359 value_must_coerce_to_target (struct value *val)
1361 struct type *valtype;
1363 /* The only lval kinds which do not live in target memory. */
1364 if (VALUE_LVAL (val) != not_lval
1365 && VALUE_LVAL (val) != lval_internalvar
1366 && VALUE_LVAL (val) != lval_xcallable)
1369 valtype = check_typedef (value_type (val));
1371 switch (TYPE_CODE (valtype))
1373 case TYPE_CODE_ARRAY:
1374 return TYPE_VECTOR (valtype) ? 0 : 1;
1375 case TYPE_CODE_STRING:
1382 /* Make sure that VAL lives in target memory if it's supposed to. For
1383 instance, strings are constructed as character arrays in GDB's
1384 storage, and this function copies them to the target. */
1387 value_coerce_to_target (struct value *val)
1392 if (!value_must_coerce_to_target (val))
1395 length = TYPE_LENGTH (check_typedef (value_type (val)));
1396 addr = allocate_space_in_inferior (length);
1397 write_memory (addr, value_contents (val), length);
1398 return value_at_lazy (value_type (val), addr);
1401 /* Given a value which is an array, return a value which is a pointer
1402 to its first element, regardless of whether or not the array has a
1403 nonzero lower bound.
1405 FIXME: A previous comment here indicated that this routine should
1406 be substracting the array's lower bound. It's not clear to me that
1407 this is correct. Given an array subscripting operation, it would
1408 certainly work to do the adjustment here, essentially computing:
1410 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
1412 However I believe a more appropriate and logical place to account
1413 for the lower bound is to do so in value_subscript, essentially
1416 (&array[0] + ((index - lowerbound) * sizeof array[0]))
1418 As further evidence consider what would happen with operations
1419 other than array subscripting, where the caller would get back a
1420 value that had an address somewhere before the actual first element
1421 of the array, and the information about the lower bound would be
1422 lost because of the coercion to pointer type. */
1425 value_coerce_array (struct value *arg1)
1427 struct type *type = check_typedef (value_type (arg1));
1429 /* If the user tries to do something requiring a pointer with an
1430 array that has not yet been pushed to the target, then this would
1431 be a good time to do so. */
1432 arg1 = value_coerce_to_target (arg1);
1434 if (VALUE_LVAL (arg1) != lval_memory)
1435 error (_("Attempt to take address of value not located in memory."));
1437 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
1438 value_address (arg1));
1441 /* Given a value which is a function, return a value which is a pointer
1445 value_coerce_function (struct value *arg1)
1447 struct value *retval;
1449 if (VALUE_LVAL (arg1) != lval_memory)
1450 error (_("Attempt to take address of value not located in memory."));
1452 retval = value_from_pointer (lookup_pointer_type (value_type (arg1)),
1453 value_address (arg1));
1457 /* Return a pointer value for the object for which ARG1 is the
1461 value_addr (struct value *arg1)
1464 struct type *type = check_typedef (value_type (arg1));
1466 if (TYPE_CODE (type) == TYPE_CODE_REF)
1468 /* Copy the value, but change the type from (T&) to (T*). We
1469 keep the same location information, which is efficient, and
1470 allows &(&X) to get the location containing the reference.
1471 Do the same to its enclosing type for consistency. */
1472 struct type *type_ptr
1473 = lookup_pointer_type (TYPE_TARGET_TYPE (type));
1474 struct type *enclosing_type
1475 = check_typedef (value_enclosing_type (arg1));
1476 struct type *enclosing_type_ptr
1477 = lookup_pointer_type (TYPE_TARGET_TYPE (enclosing_type));
1479 arg2 = value_copy (arg1);
1480 deprecated_set_value_type (arg2, type_ptr);
1481 set_value_enclosing_type (arg2, enclosing_type_ptr);
1485 if (TYPE_CODE (type) == TYPE_CODE_FUNC)
1486 return value_coerce_function (arg1);
1488 /* If this is an array that has not yet been pushed to the target,
1489 then this would be a good time to force it to memory. */
1490 arg1 = value_coerce_to_target (arg1);
1492 if (VALUE_LVAL (arg1) != lval_memory)
1493 error (_("Attempt to take address of value not located in memory."));
1495 /* Get target memory address. */
1496 arg2 = value_from_pointer (lookup_pointer_type (value_type (arg1)),
1497 (value_address (arg1)
1498 + value_embedded_offset (arg1)));
1500 /* This may be a pointer to a base subobject; so remember the
1501 full derived object's type ... */
1502 set_value_enclosing_type (arg2,
1503 lookup_pointer_type (value_enclosing_type (arg1)));
1504 /* ... and also the relative position of the subobject in the full
1506 set_value_pointed_to_offset (arg2, value_embedded_offset (arg1));
1510 /* Return a reference value for the object for which ARG1 is the
1514 value_ref (struct value *arg1)
1517 struct type *type = check_typedef (value_type (arg1));
1519 if (TYPE_CODE (type) == TYPE_CODE_REF)
1522 arg2 = value_addr (arg1);
1523 deprecated_set_value_type (arg2, lookup_reference_type (type));
1527 /* Given a value of a pointer type, apply the C unary * operator to
1531 value_ind (struct value *arg1)
1533 struct type *base_type;
1536 arg1 = coerce_array (arg1);
1538 base_type = check_typedef (value_type (arg1));
1540 if (VALUE_LVAL (arg1) == lval_computed)
1542 const struct lval_funcs *funcs = value_computed_funcs (arg1);
1544 if (funcs->indirect)
1546 struct value *result = funcs->indirect (arg1);
1553 if (TYPE_CODE (base_type) == TYPE_CODE_PTR)
1555 struct type *enc_type;
1557 /* We may be pointing to something embedded in a larger object.
1558 Get the real type of the enclosing object. */
1559 enc_type = check_typedef (value_enclosing_type (arg1));
1560 enc_type = TYPE_TARGET_TYPE (enc_type);
1562 if (TYPE_CODE (check_typedef (enc_type)) == TYPE_CODE_FUNC
1563 || TYPE_CODE (check_typedef (enc_type)) == TYPE_CODE_METHOD)
1564 /* For functions, go through find_function_addr, which knows
1565 how to handle function descriptors. */
1566 arg2 = value_at_lazy (enc_type,
1567 find_function_addr (arg1, NULL));
1569 /* Retrieve the enclosing object pointed to. */
1570 arg2 = value_at_lazy (enc_type,
1571 (value_as_address (arg1)
1572 - value_pointed_to_offset (arg1)));
1574 enc_type = value_type (arg2);
1575 return readjust_indirect_value_type (arg2, enc_type, base_type, arg1);
1578 error (_("Attempt to take contents of a non-pointer value."));
1579 return 0; /* For lint -- never reached. */
1582 /* Create a value for an array by allocating space in GDB, copying the
1583 data into that space, and then setting up an array value.
1585 The array bounds are set from LOWBOUND and HIGHBOUND, and the array
1586 is populated from the values passed in ELEMVEC.
1588 The element type of the array is inherited from the type of the
1589 first element, and all elements must have the same size (though we
1590 don't currently enforce any restriction on their types). */
1593 value_array (int lowbound, int highbound, struct value **elemvec)
1597 unsigned int typelength;
1599 struct type *arraytype;
1601 /* Validate that the bounds are reasonable and that each of the
1602 elements have the same size. */
1604 nelem = highbound - lowbound + 1;
1607 error (_("bad array bounds (%d, %d)"), lowbound, highbound);
1609 typelength = type_length_units (value_enclosing_type (elemvec[0]));
1610 for (idx = 1; idx < nelem; idx++)
1612 if (type_length_units (value_enclosing_type (elemvec[idx]))
1615 error (_("array elements must all be the same size"));
1619 arraytype = lookup_array_range_type (value_enclosing_type (elemvec[0]),
1620 lowbound, highbound);
1622 if (!current_language->c_style_arrays)
1624 val = allocate_value (arraytype);
1625 for (idx = 0; idx < nelem; idx++)
1626 value_contents_copy (val, idx * typelength, elemvec[idx], 0,
1631 /* Allocate space to store the array, and then initialize it by
1632 copying in each element. */
1634 val = allocate_value (arraytype);
1635 for (idx = 0; idx < nelem; idx++)
1636 value_contents_copy (val, idx * typelength, elemvec[idx], 0, typelength);
1641 value_cstring (const char *ptr, ssize_t len, struct type *char_type)
1644 int lowbound = current_language->string_lower_bound;
1645 ssize_t highbound = len / TYPE_LENGTH (char_type);
1646 struct type *stringtype
1647 = lookup_array_range_type (char_type, lowbound, highbound + lowbound - 1);
1649 val = allocate_value (stringtype);
1650 memcpy (value_contents_raw (val), ptr, len);
1654 /* Create a value for a string constant by allocating space in the
1655 inferior, copying the data into that space, and returning the
1656 address with type TYPE_CODE_STRING. PTR points to the string
1657 constant data; LEN is number of characters.
1659 Note that string types are like array of char types with a lower
1660 bound of zero and an upper bound of LEN - 1. Also note that the
1661 string may contain embedded null bytes. */
1664 value_string (const char *ptr, ssize_t len, struct type *char_type)
1667 int lowbound = current_language->string_lower_bound;
1668 ssize_t highbound = len / TYPE_LENGTH (char_type);
1669 struct type *stringtype
1670 = lookup_string_range_type (char_type, lowbound, highbound + lowbound - 1);
1672 val = allocate_value (stringtype);
1673 memcpy (value_contents_raw (val), ptr, len);
1678 /* See if we can pass arguments in T2 to a function which takes
1679 arguments of types T1. T1 is a list of NARGS arguments, and T2 is
1680 a NULL-terminated vector. If some arguments need coercion of some
1681 sort, then the coerced values are written into T2. Return value is
1682 0 if the arguments could be matched, or the position at which they
1685 STATICP is nonzero if the T1 argument list came from a static
1686 member function. T2 will still include the ``this'' pointer, but
1689 For non-static member functions, we ignore the first argument,
1690 which is the type of the instance variable. This is because we
1691 want to handle calls with objects from derived classes. This is
1692 not entirely correct: we should actually check to make sure that a
1693 requested operation is type secure, shouldn't we? FIXME. */
1696 typecmp (int staticp, int varargs, int nargs,
1697 struct field t1[], struct value *t2[])
1702 internal_error (__FILE__, __LINE__,
1703 _("typecmp: no argument list"));
1705 /* Skip ``this'' argument if applicable. T2 will always include
1711 (i < nargs) && TYPE_CODE (t1[i].type) != TYPE_CODE_VOID;
1714 struct type *tt1, *tt2;
1719 tt1 = check_typedef (t1[i].type);
1720 tt2 = check_typedef (value_type (t2[i]));
1722 if (TYPE_CODE (tt1) == TYPE_CODE_REF
1723 /* We should be doing hairy argument matching, as below. */
1724 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1)))
1725 == TYPE_CODE (tt2)))
1727 if (TYPE_CODE (tt2) == TYPE_CODE_ARRAY)
1728 t2[i] = value_coerce_array (t2[i]);
1730 t2[i] = value_ref (t2[i]);
1734 /* djb - 20000715 - Until the new type structure is in the
1735 place, and we can attempt things like implicit conversions,
1736 we need to do this so you can take something like a map<const
1737 char *>, and properly access map["hello"], because the
1738 argument to [] will be a reference to a pointer to a char,
1739 and the argument will be a pointer to a char. */
1740 while (TYPE_CODE(tt1) == TYPE_CODE_REF
1741 || TYPE_CODE (tt1) == TYPE_CODE_PTR)
1743 tt1 = check_typedef( TYPE_TARGET_TYPE(tt1) );
1745 while (TYPE_CODE(tt2) == TYPE_CODE_ARRAY
1746 || TYPE_CODE(tt2) == TYPE_CODE_PTR
1747 || TYPE_CODE(tt2) == TYPE_CODE_REF)
1749 tt2 = check_typedef (TYPE_TARGET_TYPE(tt2));
1751 if (TYPE_CODE (tt1) == TYPE_CODE (tt2))
1753 /* Array to pointer is a `trivial conversion' according to the
1756 /* We should be doing much hairier argument matching (see
1757 section 13.2 of the ARM), but as a quick kludge, just check
1758 for the same type code. */
1759 if (TYPE_CODE (t1[i].type) != TYPE_CODE (value_type (t2[i])))
1762 if (varargs || t2[i] == NULL)
1767 /* Helper class for do_search_struct_field that updates *RESULT_PTR
1768 and *LAST_BOFFSET, and possibly throws an exception if the field
1769 search has yielded ambiguous results. */
1772 update_search_result (struct value **result_ptr, struct value *v,
1773 int *last_boffset, int boffset,
1774 const char *name, struct type *type)
1778 if (*result_ptr != NULL
1779 /* The result is not ambiguous if all the classes that are
1780 found occupy the same space. */
1781 && *last_boffset != boffset)
1782 error (_("base class '%s' is ambiguous in type '%s'"),
1783 name, TYPE_SAFE_NAME (type));
1785 *last_boffset = boffset;
1789 /* A helper for search_struct_field. This does all the work; most
1790 arguments are as passed to search_struct_field. The result is
1791 stored in *RESULT_PTR, which must be initialized to NULL.
1792 OUTERMOST_TYPE is the type of the initial type passed to
1793 search_struct_field; this is used for error reporting when the
1794 lookup is ambiguous. */
1797 do_search_struct_field (const char *name, struct value *arg1, int offset,
1798 struct type *type, int looking_for_baseclass,
1799 struct value **result_ptr,
1801 struct type *outermost_type)
1806 type = check_typedef (type);
1807 nbases = TYPE_N_BASECLASSES (type);
1809 if (!looking_for_baseclass)
1810 for (i = TYPE_NFIELDS (type) - 1; i >= nbases; i--)
1812 const char *t_field_name = TYPE_FIELD_NAME (type, i);
1814 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
1818 if (field_is_static (&TYPE_FIELD (type, i)))
1819 v = value_static_field (type, i);
1821 v = value_primitive_field (arg1, offset, i, type);
1827 && t_field_name[0] == '\0')
1829 struct type *field_type = TYPE_FIELD_TYPE (type, i);
1831 if (TYPE_CODE (field_type) == TYPE_CODE_UNION
1832 || TYPE_CODE (field_type) == TYPE_CODE_STRUCT)
1834 /* Look for a match through the fields of an anonymous
1835 union, or anonymous struct. C++ provides anonymous
1838 In the GNU Chill (now deleted from GDB)
1839 implementation of variant record types, each
1840 <alternative field> has an (anonymous) union type,
1841 each member of the union represents a <variant
1842 alternative>. Each <variant alternative> is
1843 represented as a struct, with a member for each
1846 struct value *v = NULL;
1847 int new_offset = offset;
1849 /* This is pretty gross. In G++, the offset in an
1850 anonymous union is relative to the beginning of the
1851 enclosing struct. In the GNU Chill (now deleted
1852 from GDB) implementation of variant records, the
1853 bitpos is zero in an anonymous union field, so we
1854 have to add the offset of the union here. */
1855 if (TYPE_CODE (field_type) == TYPE_CODE_STRUCT
1856 || (TYPE_NFIELDS (field_type) > 0
1857 && TYPE_FIELD_BITPOS (field_type, 0) == 0))
1858 new_offset += TYPE_FIELD_BITPOS (type, i) / 8;
1860 do_search_struct_field (name, arg1, new_offset,
1862 looking_for_baseclass, &v,
1874 for (i = 0; i < nbases; i++)
1876 struct value *v = NULL;
1877 struct type *basetype = check_typedef (TYPE_BASECLASS (type, i));
1878 /* If we are looking for baseclasses, this is what we get when
1879 we hit them. But it could happen that the base part's member
1880 name is not yet filled in. */
1881 int found_baseclass = (looking_for_baseclass
1882 && TYPE_BASECLASS_NAME (type, i) != NULL
1883 && (strcmp_iw (name,
1884 TYPE_BASECLASS_NAME (type,
1886 int boffset = value_embedded_offset (arg1) + offset;
1888 if (BASETYPE_VIA_VIRTUAL (type, i))
1892 boffset = baseclass_offset (type, i,
1893 value_contents_for_printing (arg1),
1894 value_embedded_offset (arg1) + offset,
1895 value_address (arg1),
1898 /* The virtual base class pointer might have been clobbered
1899 by the user program. Make sure that it still points to a
1900 valid memory location. */
1902 boffset += value_embedded_offset (arg1) + offset;
1904 || boffset >= TYPE_LENGTH (value_enclosing_type (arg1)))
1906 CORE_ADDR base_addr;
1908 base_addr = value_address (arg1) + boffset;
1909 v2 = value_at_lazy (basetype, base_addr);
1910 if (target_read_memory (base_addr,
1911 value_contents_raw (v2),
1912 TYPE_LENGTH (value_type (v2))) != 0)
1913 error (_("virtual baseclass botch"));
1917 v2 = value_copy (arg1);
1918 deprecated_set_value_type (v2, basetype);
1919 set_value_embedded_offset (v2, boffset);
1922 if (found_baseclass)
1926 do_search_struct_field (name, v2, 0,
1927 TYPE_BASECLASS (type, i),
1928 looking_for_baseclass,
1929 result_ptr, last_boffset,
1933 else if (found_baseclass)
1934 v = value_primitive_field (arg1, offset, i, type);
1937 do_search_struct_field (name, arg1,
1938 offset + TYPE_BASECLASS_BITPOS (type,
1940 basetype, looking_for_baseclass,
1941 result_ptr, last_boffset,
1945 update_search_result (result_ptr, v, last_boffset,
1946 boffset, name, outermost_type);
1950 /* Helper function used by value_struct_elt to recurse through
1951 baseclasses. Look for a field NAME in ARG1. Search in it assuming
1952 it has (class) type TYPE. If found, return value, else return NULL.
1954 If LOOKING_FOR_BASECLASS, then instead of looking for struct
1955 fields, look for a baseclass named NAME. */
1957 static struct value *
1958 search_struct_field (const char *name, struct value *arg1,
1959 struct type *type, int looking_for_baseclass)
1961 struct value *result = NULL;
1964 do_search_struct_field (name, arg1, 0, type, looking_for_baseclass,
1965 &result, &boffset, type);
1969 /* Helper function used by value_struct_elt to recurse through
1970 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1971 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1974 If found, return value, else if name matched and args not return
1975 (value) -1, else return NULL. */
1977 static struct value *
1978 search_struct_method (const char *name, struct value **arg1p,
1979 struct value **args, int offset,
1980 int *static_memfuncp, struct type *type)
1984 int name_matched = 0;
1985 char dem_opname[64];
1987 type = check_typedef (type);
1988 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
1990 const char *t_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
1992 /* FIXME! May need to check for ARM demangling here. */
1993 if (startswith (t_field_name, "__") ||
1994 startswith (t_field_name, "op") ||
1995 startswith (t_field_name, "type"))
1997 if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI))
1998 t_field_name = dem_opname;
1999 else if (cplus_demangle_opname (t_field_name, dem_opname, 0))
2000 t_field_name = dem_opname;
2002 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
2004 int j = TYPE_FN_FIELDLIST_LENGTH (type, i) - 1;
2005 struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i);
2008 check_stub_method_group (type, i);
2009 if (j > 0 && args == 0)
2010 error (_("cannot resolve overloaded method "
2011 "`%s': no arguments supplied"), name);
2012 else if (j == 0 && args == 0)
2014 v = value_fn_field (arg1p, f, j, type, offset);
2021 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f, j),
2022 TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f, j)),
2023 TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f, j)),
2024 TYPE_FN_FIELD_ARGS (f, j), args))
2026 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
2027 return value_virtual_fn_field (arg1p, f, j,
2029 if (TYPE_FN_FIELD_STATIC_P (f, j)
2031 *static_memfuncp = 1;
2032 v = value_fn_field (arg1p, f, j, type, offset);
2041 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2046 if (BASETYPE_VIA_VIRTUAL (type, i))
2048 struct type *baseclass = check_typedef (TYPE_BASECLASS (type, i));
2049 struct value *base_val;
2050 const gdb_byte *base_valaddr;
2052 /* The virtual base class pointer might have been
2053 clobbered by the user program. Make sure that it
2054 still points to a valid memory location. */
2056 if (offset < 0 || offset >= TYPE_LENGTH (type))
2059 struct cleanup *back_to;
2062 tmp = (gdb_byte *) xmalloc (TYPE_LENGTH (baseclass));
2063 back_to = make_cleanup (xfree, tmp);
2064 address = value_address (*arg1p);
2066 if (target_read_memory (address + offset,
2067 tmp, TYPE_LENGTH (baseclass)) != 0)
2068 error (_("virtual baseclass botch"));
2070 base_val = value_from_contents_and_address (baseclass,
2073 base_valaddr = value_contents_for_printing (base_val);
2075 do_cleanups (back_to);
2080 base_valaddr = value_contents_for_printing (*arg1p);
2081 this_offset = offset;
2084 base_offset = baseclass_offset (type, i, base_valaddr,
2085 this_offset, value_address (base_val),
2090 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
2092 v = search_struct_method (name, arg1p, args, base_offset + offset,
2093 static_memfuncp, TYPE_BASECLASS (type, i));
2094 if (v == (struct value *) - 1)
2100 /* FIXME-bothner: Why is this commented out? Why is it here? */
2101 /* *arg1p = arg1_tmp; */
2106 return (struct value *) - 1;
2111 /* Given *ARGP, a value of type (pointer to a)* structure/union,
2112 extract the component named NAME from the ultimate target
2113 structure/union and return it as a value with its appropriate type.
2114 ERR is used in the error message if *ARGP's type is wrong.
2116 C++: ARGS is a list of argument types to aid in the selection of
2117 an appropriate method. Also, handle derived types.
2119 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
2120 where the truthvalue of whether the function that was resolved was
2121 a static member function or not is stored.
2123 ERR is an error message to be printed in case the field is not
2127 value_struct_elt (struct value **argp, struct value **args,
2128 const char *name, int *static_memfuncp, const char *err)
2133 *argp = coerce_array (*argp);
2135 t = check_typedef (value_type (*argp));
2137 /* Follow pointers until we get to a non-pointer. */
2139 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
2141 *argp = value_ind (*argp);
2142 /* Don't coerce fn pointer to fn and then back again! */
2143 if (TYPE_CODE (check_typedef (value_type (*argp))) != TYPE_CODE_FUNC)
2144 *argp = coerce_array (*argp);
2145 t = check_typedef (value_type (*argp));
2148 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2149 && TYPE_CODE (t) != TYPE_CODE_UNION)
2150 error (_("Attempt to extract a component of a value that is not a %s."),
2153 /* Assume it's not, unless we see that it is. */
2154 if (static_memfuncp)
2155 *static_memfuncp = 0;
2159 /* if there are no arguments ...do this... */
2161 /* Try as a field first, because if we succeed, there is less
2163 v = search_struct_field (name, *argp, t, 0);
2167 /* C++: If it was not found as a data field, then try to
2168 return it as a pointer to a method. */
2169 v = search_struct_method (name, argp, args, 0,
2170 static_memfuncp, t);
2172 if (v == (struct value *) - 1)
2173 error (_("Cannot take address of method %s."), name);
2176 if (TYPE_NFN_FIELDS (t))
2177 error (_("There is no member or method named %s."), name);
2179 error (_("There is no member named %s."), name);
2184 v = search_struct_method (name, argp, args, 0,
2185 static_memfuncp, t);
2187 if (v == (struct value *) - 1)
2189 error (_("One of the arguments you tried to pass to %s could not "
2190 "be converted to what the function wants."), name);
2194 /* See if user tried to invoke data as function. If so, hand it
2195 back. If it's not callable (i.e., a pointer to function),
2196 gdb should give an error. */
2197 v = search_struct_field (name, *argp, t, 0);
2198 /* If we found an ordinary field, then it is not a method call.
2199 So, treat it as if it were a static member function. */
2200 if (v && static_memfuncp)
2201 *static_memfuncp = 1;
2205 throw_error (NOT_FOUND_ERROR,
2206 _("Structure has no component named %s."), name);
2210 /* Given *ARGP, a value of type structure or union, or a pointer/reference
2211 to a structure or union, extract and return its component (field) of
2212 type FTYPE at the specified BITPOS.
2213 Throw an exception on error. */
2216 value_struct_elt_bitpos (struct value **argp, int bitpos, struct type *ftype,
2222 *argp = coerce_array (*argp);
2224 t = check_typedef (value_type (*argp));
2226 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
2228 *argp = value_ind (*argp);
2229 if (TYPE_CODE (check_typedef (value_type (*argp))) != TYPE_CODE_FUNC)
2230 *argp = coerce_array (*argp);
2231 t = check_typedef (value_type (*argp));
2234 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2235 && TYPE_CODE (t) != TYPE_CODE_UNION)
2236 error (_("Attempt to extract a component of a value that is not a %s."),
2239 for (i = TYPE_N_BASECLASSES (t); i < TYPE_NFIELDS (t); i++)
2241 if (!field_is_static (&TYPE_FIELD (t, i))
2242 && bitpos == TYPE_FIELD_BITPOS (t, i)
2243 && types_equal (ftype, TYPE_FIELD_TYPE (t, i)))
2244 return value_primitive_field (*argp, 0, i, t);
2247 error (_("No field with matching bitpos and type."));
2253 /* Search through the methods of an object (and its bases) to find a
2254 specified method. Return the pointer to the fn_field list FN_LIST of
2255 overloaded instances defined in the source language. If available
2256 and matching, a vector of matching xmethods defined in extension
2257 languages are also returned in XM_WORKER_VEC
2259 Helper function for value_find_oload_list.
2260 ARGP is a pointer to a pointer to a value (the object).
2261 METHOD is a string containing the method name.
2262 OFFSET is the offset within the value.
2263 TYPE is the assumed type of the object.
2264 FN_LIST is the pointer to matching overloaded instances defined in
2265 source language. Since this is a recursive function, *FN_LIST
2266 should be set to NULL when calling this function.
2267 NUM_FNS is the number of overloaded instances. *NUM_FNS should be set to
2268 0 when calling this function.
2269 XM_WORKER_VEC is the vector of matching xmethod workers. *XM_WORKER_VEC
2270 should also be set to NULL when calling this function.
2271 BASETYPE is set to the actual type of the subobject where the
2273 BOFFSET is the offset of the base subobject where the method is found. */
2276 find_method_list (struct value **argp, const char *method,
2277 int offset, struct type *type,
2278 struct fn_field **fn_list, int *num_fns,
2279 VEC (xmethod_worker_ptr) **xm_worker_vec,
2280 struct type **basetype, int *boffset)
2283 struct fn_field *f = NULL;
2284 VEC (xmethod_worker_ptr) *worker_vec = NULL, *new_vec = NULL;
2286 gdb_assert (fn_list != NULL && xm_worker_vec != NULL);
2287 type = check_typedef (type);
2289 /* First check in object itself.
2290 This function is called recursively to search through base classes.
2291 If there is a source method match found at some stage, then we need not
2292 look for source methods in consequent recursive calls. */
2293 if ((*fn_list) == NULL)
2295 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
2297 /* pai: FIXME What about operators and type conversions? */
2298 const char *fn_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
2300 if (fn_field_name && (strcmp_iw (fn_field_name, method) == 0))
2302 int len = TYPE_FN_FIELDLIST_LENGTH (type, i);
2303 f = TYPE_FN_FIELDLIST1 (type, i);
2310 /* Resolve any stub methods. */
2311 check_stub_method_group (type, i);
2318 /* Unlike source methods, xmethods can be accumulated over successive
2319 recursive calls. In other words, an xmethod named 'm' in a class
2320 will not hide an xmethod named 'm' in its base class(es). We want
2321 it to be this way because xmethods are after all convenience functions
2322 and hence there is no point restricting them with something like method
2323 hiding. Moreover, if hiding is done for xmethods as well, then we will
2324 have to provide a mechanism to un-hide (like the 'using' construct). */
2325 worker_vec = get_matching_xmethod_workers (type, method);
2326 new_vec = VEC_merge (xmethod_worker_ptr, *xm_worker_vec, worker_vec);
2328 VEC_free (xmethod_worker_ptr, *xm_worker_vec);
2329 VEC_free (xmethod_worker_ptr, worker_vec);
2330 *xm_worker_vec = new_vec;
2332 /* If source methods are not found in current class, look for them in the
2333 base classes. We also have to go through the base classes to gather
2334 extension methods. */
2335 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2339 if (BASETYPE_VIA_VIRTUAL (type, i))
2341 base_offset = baseclass_offset (type, i,
2342 value_contents_for_printing (*argp),
2343 value_offset (*argp) + offset,
2344 value_address (*argp), *argp);
2346 else /* Non-virtual base, simply use bit position from debug
2349 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
2352 find_method_list (argp, method, base_offset + offset,
2353 TYPE_BASECLASS (type, i), fn_list, num_fns,
2354 xm_worker_vec, basetype, boffset);
2358 /* Return the list of overloaded methods of a specified name. The methods
2359 could be those GDB finds in the binary, or xmethod. Methods found in
2360 the binary are returned in FN_LIST, and xmethods are returned in
2363 ARGP is a pointer to a pointer to a value (the object).
2364 METHOD is the method name.
2365 OFFSET is the offset within the value contents.
2366 FN_LIST is the pointer to matching overloaded instances defined in
2368 NUM_FNS is the number of overloaded instances.
2369 XM_WORKER_VEC is the vector of matching xmethod workers defined in
2370 extension languages.
2371 BASETYPE is set to the type of the base subobject that defines the
2373 BOFFSET is the offset of the base subobject which defines the method. */
2376 value_find_oload_method_list (struct value **argp, const char *method,
2377 int offset, struct fn_field **fn_list,
2379 VEC (xmethod_worker_ptr) **xm_worker_vec,
2380 struct type **basetype, int *boffset)
2384 t = check_typedef (value_type (*argp));
2386 /* Code snarfed from value_struct_elt. */
2387 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
2389 *argp = value_ind (*argp);
2390 /* Don't coerce fn pointer to fn and then back again! */
2391 if (TYPE_CODE (check_typedef (value_type (*argp))) != TYPE_CODE_FUNC)
2392 *argp = coerce_array (*argp);
2393 t = check_typedef (value_type (*argp));
2396 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2397 && TYPE_CODE (t) != TYPE_CODE_UNION)
2398 error (_("Attempt to extract a component of a "
2399 "value that is not a struct or union"));
2401 gdb_assert (fn_list != NULL && xm_worker_vec != NULL);
2403 /* Clear the lists. */
2406 *xm_worker_vec = NULL;
2408 find_method_list (argp, method, 0, t, fn_list, num_fns, xm_worker_vec,
2412 /* Given an array of arguments (ARGS) (which includes an
2413 entry for "this" in the case of C++ methods), the number of
2414 arguments NARGS, the NAME of a function, and whether it's a method or
2415 not (METHOD), find the best function that matches on the argument types
2416 according to the overload resolution rules.
2418 METHOD can be one of three values:
2419 NON_METHOD for non-member functions.
2420 METHOD: for member functions.
2421 BOTH: used for overload resolution of operators where the
2422 candidates are expected to be either member or non member
2423 functions. In this case the first argument ARGTYPES
2424 (representing 'this') is expected to be a reference to the
2425 target object, and will be dereferenced when attempting the
2428 In the case of class methods, the parameter OBJ is an object value
2429 in which to search for overloaded methods.
2431 In the case of non-method functions, the parameter FSYM is a symbol
2432 corresponding to one of the overloaded functions.
2434 Return value is an integer: 0 -> good match, 10 -> debugger applied
2435 non-standard coercions, 100 -> incompatible.
2437 If a method is being searched for, VALP will hold the value.
2438 If a non-method is being searched for, SYMP will hold the symbol
2441 If a method is being searched for, and it is a static method,
2442 then STATICP will point to a non-zero value.
2444 If NO_ADL argument dependent lookup is disabled. This is used to prevent
2445 ADL overload candidates when performing overload resolution for a fully
2448 If NOSIDE is EVAL_AVOID_SIDE_EFFECTS, then OBJP's memory cannot be
2449 read while picking the best overload match (it may be all zeroes and thus
2450 not have a vtable pointer), in which case skip virtual function lookup.
2451 This is ok as typically EVAL_AVOID_SIDE_EFFECTS is only used to determine
2454 Note: This function does *not* check the value of
2455 overload_resolution. Caller must check it to see whether overload
2456 resolution is permitted. */
2459 find_overload_match (struct value **args, int nargs,
2460 const char *name, enum oload_search_type method,
2461 struct value **objp, struct symbol *fsym,
2462 struct value **valp, struct symbol **symp,
2463 int *staticp, const int no_adl,
2464 const enum noside noside)
2466 struct value *obj = (objp ? *objp : NULL);
2467 struct type *obj_type = obj ? value_type (obj) : NULL;
2468 /* Index of best overloaded function. */
2469 int func_oload_champ = -1;
2470 int method_oload_champ = -1;
2471 int src_method_oload_champ = -1;
2472 int ext_method_oload_champ = -1;
2474 /* The measure for the current best match. */
2475 struct badness_vector *method_badness = NULL;
2476 struct badness_vector *func_badness = NULL;
2477 struct badness_vector *ext_method_badness = NULL;
2478 struct badness_vector *src_method_badness = NULL;
2480 struct value *temp = obj;
2481 /* For methods, the list of overloaded methods. */
2482 struct fn_field *fns_ptr = NULL;
2483 /* For non-methods, the list of overloaded function symbols. */
2484 struct symbol **oload_syms = NULL;
2485 /* For xmethods, the VEC of xmethod workers. */
2486 VEC (xmethod_worker_ptr) *xm_worker_vec = NULL;
2487 /* Number of overloaded instances being considered. */
2489 struct type *basetype = NULL;
2492 struct cleanup *all_cleanups = make_cleanup (null_cleanup, NULL);
2494 const char *obj_type_name = NULL;
2495 const char *func_name = NULL;
2496 enum oload_classification match_quality;
2497 enum oload_classification method_match_quality = INCOMPATIBLE;
2498 enum oload_classification src_method_match_quality = INCOMPATIBLE;
2499 enum oload_classification ext_method_match_quality = INCOMPATIBLE;
2500 enum oload_classification func_match_quality = INCOMPATIBLE;
2502 /* Get the list of overloaded methods or functions. */
2503 if (method == METHOD || method == BOTH)
2507 /* OBJ may be a pointer value rather than the object itself. */
2508 obj = coerce_ref (obj);
2509 while (TYPE_CODE (check_typedef (value_type (obj))) == TYPE_CODE_PTR)
2510 obj = coerce_ref (value_ind (obj));
2511 obj_type_name = TYPE_NAME (value_type (obj));
2513 /* First check whether this is a data member, e.g. a pointer to
2515 if (TYPE_CODE (check_typedef (value_type (obj))) == TYPE_CODE_STRUCT)
2517 *valp = search_struct_field (name, obj,
2518 check_typedef (value_type (obj)), 0);
2522 do_cleanups (all_cleanups);
2527 /* Retrieve the list of methods with the name NAME. */
2528 value_find_oload_method_list (&temp, name, 0, &fns_ptr, &num_fns,
2529 &xm_worker_vec, &basetype, &boffset);
2530 /* If this is a method only search, and no methods were found
2531 the search has faild. */
2532 if (method == METHOD && (!fns_ptr || !num_fns) && !xm_worker_vec)
2533 error (_("Couldn't find method %s%s%s"),
2535 (obj_type_name && *obj_type_name) ? "::" : "",
2537 /* If we are dealing with stub method types, they should have
2538 been resolved by find_method_list via
2539 value_find_oload_method_list above. */
2542 gdb_assert (TYPE_SELF_TYPE (fns_ptr[0].type) != NULL);
2544 src_method_oload_champ = find_oload_champ (args, nargs,
2545 num_fns, fns_ptr, NULL,
2546 NULL, &src_method_badness);
2548 src_method_match_quality = classify_oload_match
2549 (src_method_badness, nargs,
2550 oload_method_static_p (fns_ptr, src_method_oload_champ));
2552 make_cleanup (xfree, src_method_badness);
2555 if (VEC_length (xmethod_worker_ptr, xm_worker_vec) > 0)
2557 ext_method_oload_champ = find_oload_champ (args, nargs,
2558 0, NULL, xm_worker_vec,
2559 NULL, &ext_method_badness);
2560 ext_method_match_quality = classify_oload_match (ext_method_badness,
2562 make_cleanup (xfree, ext_method_badness);
2563 make_cleanup (free_xmethod_worker_vec, xm_worker_vec);
2566 if (src_method_oload_champ >= 0 && ext_method_oload_champ >= 0)
2568 switch (compare_badness (ext_method_badness, src_method_badness))
2570 case 0: /* Src method and xmethod are equally good. */
2571 /* If src method and xmethod are equally good, then
2572 xmethod should be the winner. Hence, fall through to the
2573 case where a xmethod is better than the source
2574 method, except when the xmethod match quality is
2577 case 1: /* Src method and ext method are incompatible. */
2578 /* If ext method match is not standard, then let source method
2579 win. Otherwise, fallthrough to let xmethod win. */
2580 if (ext_method_match_quality != STANDARD)
2582 method_oload_champ = src_method_oload_champ;
2583 method_badness = src_method_badness;
2584 ext_method_oload_champ = -1;
2585 method_match_quality = src_method_match_quality;
2589 case 2: /* Ext method is champion. */
2590 method_oload_champ = ext_method_oload_champ;
2591 method_badness = ext_method_badness;
2592 src_method_oload_champ = -1;
2593 method_match_quality = ext_method_match_quality;
2595 case 3: /* Src method is champion. */
2596 method_oload_champ = src_method_oload_champ;
2597 method_badness = src_method_badness;
2598 ext_method_oload_champ = -1;
2599 method_match_quality = src_method_match_quality;
2602 gdb_assert_not_reached ("Unexpected overload comparison "
2607 else if (src_method_oload_champ >= 0)
2609 method_oload_champ = src_method_oload_champ;
2610 method_badness = src_method_badness;
2611 method_match_quality = src_method_match_quality;
2613 else if (ext_method_oload_champ >= 0)
2615 method_oload_champ = ext_method_oload_champ;
2616 method_badness = ext_method_badness;
2617 method_match_quality = ext_method_match_quality;
2621 if (method == NON_METHOD || method == BOTH)
2623 const char *qualified_name = NULL;
2625 /* If the overload match is being search for both as a method
2626 and non member function, the first argument must now be
2629 args[0] = value_ind (args[0]);
2633 qualified_name = SYMBOL_NATURAL_NAME (fsym);
2635 /* If we have a function with a C++ name, try to extract just
2636 the function part. Do not try this for non-functions (e.g.
2637 function pointers). */
2639 && TYPE_CODE (check_typedef (SYMBOL_TYPE (fsym)))
2644 temp = cp_func_name (qualified_name);
2646 /* If cp_func_name did not remove anything, the name of the
2647 symbol did not include scope or argument types - it was
2648 probably a C-style function. */
2651 make_cleanup (xfree, temp);
2652 if (strcmp (temp, qualified_name) == 0)
2662 qualified_name = name;
2665 /* If there was no C++ name, this must be a C-style function or
2666 not a function at all. Just return the same symbol. Do the
2667 same if cp_func_name fails for some reason. */
2668 if (func_name == NULL)
2671 do_cleanups (all_cleanups);
2675 func_oload_champ = find_oload_champ_namespace (args, nargs,
2682 if (func_oload_champ >= 0)
2683 func_match_quality = classify_oload_match (func_badness, nargs, 0);
2685 make_cleanup (xfree, oload_syms);
2686 make_cleanup (xfree, func_badness);
2689 /* Did we find a match ? */
2690 if (method_oload_champ == -1 && func_oload_champ == -1)
2691 throw_error (NOT_FOUND_ERROR,
2692 _("No symbol \"%s\" in current context."),
2695 /* If we have found both a method match and a function
2696 match, find out which one is better, and calculate match
2698 if (method_oload_champ >= 0 && func_oload_champ >= 0)
2700 switch (compare_badness (func_badness, method_badness))
2702 case 0: /* Top two contenders are equally good. */
2703 /* FIXME: GDB does not support the general ambiguous case.
2704 All candidates should be collected and presented the
2706 error (_("Ambiguous overload resolution"));
2708 case 1: /* Incomparable top contenders. */
2709 /* This is an error incompatible candidates
2710 should not have been proposed. */
2711 error (_("Internal error: incompatible "
2712 "overload candidates proposed"));
2714 case 2: /* Function champion. */
2715 method_oload_champ = -1;
2716 match_quality = func_match_quality;
2718 case 3: /* Method champion. */
2719 func_oload_champ = -1;
2720 match_quality = method_match_quality;
2723 error (_("Internal error: unexpected overload comparison result"));
2729 /* We have either a method match or a function match. */
2730 if (method_oload_champ >= 0)
2731 match_quality = method_match_quality;
2733 match_quality = func_match_quality;
2736 if (match_quality == INCOMPATIBLE)
2738 if (method == METHOD)
2739 error (_("Cannot resolve method %s%s%s to any overloaded instance"),
2741 (obj_type_name && *obj_type_name) ? "::" : "",
2744 error (_("Cannot resolve function %s to any overloaded instance"),
2747 else if (match_quality == NON_STANDARD)
2749 if (method == METHOD)
2750 warning (_("Using non-standard conversion to match "
2751 "method %s%s%s to supplied arguments"),
2753 (obj_type_name && *obj_type_name) ? "::" : "",
2756 warning (_("Using non-standard conversion to match "
2757 "function %s to supplied arguments"),
2761 if (staticp != NULL)
2762 *staticp = oload_method_static_p (fns_ptr, method_oload_champ);
2764 if (method_oload_champ >= 0)
2766 if (src_method_oload_champ >= 0)
2768 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr, method_oload_champ)
2769 && noside != EVAL_AVOID_SIDE_EFFECTS)
2771 *valp = value_virtual_fn_field (&temp, fns_ptr,
2772 method_oload_champ, basetype,
2776 *valp = value_fn_field (&temp, fns_ptr, method_oload_champ,
2781 *valp = value_of_xmethod (clone_xmethod_worker
2782 (VEC_index (xmethod_worker_ptr, xm_worker_vec,
2783 ext_method_oload_champ)));
2787 *symp = oload_syms[func_oload_champ];
2791 struct type *temp_type = check_typedef (value_type (temp));
2792 struct type *objtype = check_typedef (obj_type);
2794 if (TYPE_CODE (temp_type) != TYPE_CODE_PTR
2795 && (TYPE_CODE (objtype) == TYPE_CODE_PTR
2796 || TYPE_CODE (objtype) == TYPE_CODE_REF))
2798 temp = value_addr (temp);
2803 do_cleanups (all_cleanups);
2805 switch (match_quality)
2811 default: /* STANDARD */
2816 /* Find the best overload match, searching for FUNC_NAME in namespaces
2817 contained in QUALIFIED_NAME until it either finds a good match or
2818 runs out of namespaces. It stores the overloaded functions in
2819 *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. The
2820 calling function is responsible for freeing *OLOAD_SYMS and
2821 *OLOAD_CHAMP_BV. If NO_ADL, argument dependent lookup is not
2825 find_oload_champ_namespace (struct value **args, int nargs,
2826 const char *func_name,
2827 const char *qualified_name,
2828 struct symbol ***oload_syms,
2829 struct badness_vector **oload_champ_bv,
2834 find_oload_champ_namespace_loop (args, nargs,
2837 oload_syms, oload_champ_bv,
2844 /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is
2845 how deep we've looked for namespaces, and the champ is stored in
2846 OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0
2847 if it isn't. Other arguments are the same as in
2848 find_oload_champ_namespace
2850 It is the caller's responsibility to free *OLOAD_SYMS and
2854 find_oload_champ_namespace_loop (struct value **args, int nargs,
2855 const char *func_name,
2856 const char *qualified_name,
2858 struct symbol ***oload_syms,
2859 struct badness_vector **oload_champ_bv,
2863 int next_namespace_len = namespace_len;
2864 int searched_deeper = 0;
2866 struct cleanup *old_cleanups;
2867 int new_oload_champ;
2868 struct symbol **new_oload_syms;
2869 struct badness_vector *new_oload_champ_bv;
2870 char *new_namespace;
2872 if (next_namespace_len != 0)
2874 gdb_assert (qualified_name[next_namespace_len] == ':');
2875 next_namespace_len += 2;
2877 next_namespace_len +=
2878 cp_find_first_component (qualified_name + next_namespace_len);
2880 /* Initialize these to values that can safely be xfree'd. */
2882 *oload_champ_bv = NULL;
2884 /* First, see if we have a deeper namespace we can search in.
2885 If we get a good match there, use it. */
2887 if (qualified_name[next_namespace_len] == ':')
2889 searched_deeper = 1;
2891 if (find_oload_champ_namespace_loop (args, nargs,
2892 func_name, qualified_name,
2894 oload_syms, oload_champ_bv,
2895 oload_champ, no_adl))
2901 /* If we reach here, either we're in the deepest namespace or we
2902 didn't find a good match in a deeper namespace. But, in the
2903 latter case, we still have a bad match in a deeper namespace;
2904 note that we might not find any match at all in the current
2905 namespace. (There's always a match in the deepest namespace,
2906 because this overload mechanism only gets called if there's a
2907 function symbol to start off with.) */
2909 old_cleanups = make_cleanup (xfree, *oload_syms);
2910 make_cleanup (xfree, *oload_champ_bv);
2911 new_namespace = (char *) alloca (namespace_len + 1);
2912 strncpy (new_namespace, qualified_name, namespace_len);
2913 new_namespace[namespace_len] = '\0';
2914 new_oload_syms = make_symbol_overload_list (func_name,
2917 /* If we have reached the deepest level perform argument
2918 determined lookup. */
2919 if (!searched_deeper && !no_adl)
2922 struct type **arg_types;
2924 /* Prepare list of argument types for overload resolution. */
2925 arg_types = (struct type **)
2926 alloca (nargs * (sizeof (struct type *)));
2927 for (ix = 0; ix < nargs; ix++)
2928 arg_types[ix] = value_type (args[ix]);
2929 make_symbol_overload_list_adl (arg_types, nargs, func_name);
2932 while (new_oload_syms[num_fns])
2935 new_oload_champ = find_oload_champ (args, nargs, num_fns,
2936 NULL, NULL, new_oload_syms,
2937 &new_oload_champ_bv);
2939 /* Case 1: We found a good match. Free earlier matches (if any),
2940 and return it. Case 2: We didn't find a good match, but we're
2941 not the deepest function. Then go with the bad match that the
2942 deeper function found. Case 3: We found a bad match, and we're
2943 the deepest function. Then return what we found, even though
2944 it's a bad match. */
2946 if (new_oload_champ != -1
2947 && classify_oload_match (new_oload_champ_bv, nargs, 0) == STANDARD)
2949 *oload_syms = new_oload_syms;
2950 *oload_champ = new_oload_champ;
2951 *oload_champ_bv = new_oload_champ_bv;
2952 do_cleanups (old_cleanups);
2955 else if (searched_deeper)
2957 xfree (new_oload_syms);
2958 xfree (new_oload_champ_bv);
2959 discard_cleanups (old_cleanups);
2964 *oload_syms = new_oload_syms;
2965 *oload_champ = new_oload_champ;
2966 *oload_champ_bv = new_oload_champ_bv;
2967 do_cleanups (old_cleanups);
2972 /* Look for a function to take NARGS args of ARGS. Find
2973 the best match from among the overloaded methods or functions
2974 given by FNS_PTR or OLOAD_SYMS or XM_WORKER_VEC, respectively.
2975 One, and only one of FNS_PTR, OLOAD_SYMS and XM_WORKER_VEC can be
2978 If XM_WORKER_VEC is NULL, then the length of the arrays FNS_PTR
2979 or OLOAD_SYMS (whichever is non-NULL) is specified in NUM_FNS.
2981 Return the index of the best match; store an indication of the
2982 quality of the match in OLOAD_CHAMP_BV.
2984 It is the caller's responsibility to free *OLOAD_CHAMP_BV. */
2987 find_oload_champ (struct value **args, int nargs,
2988 int num_fns, struct fn_field *fns_ptr,
2989 VEC (xmethod_worker_ptr) *xm_worker_vec,
2990 struct symbol **oload_syms,
2991 struct badness_vector **oload_champ_bv)
2995 /* A measure of how good an overloaded instance is. */
2996 struct badness_vector *bv;
2997 /* Index of best overloaded function. */
2998 int oload_champ = -1;
2999 /* Current ambiguity state for overload resolution. */
3000 int oload_ambiguous = 0;
3001 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */
3003 /* A champion can be found among methods alone, or among functions
3004 alone, or in xmethods alone, but not in more than one of these
3006 gdb_assert ((fns_ptr != NULL) + (oload_syms != NULL) + (xm_worker_vec != NULL)
3009 *oload_champ_bv = NULL;
3011 fn_count = (xm_worker_vec != NULL
3012 ? VEC_length (xmethod_worker_ptr, xm_worker_vec)
3014 /* Consider each candidate in turn. */
3015 for (ix = 0; ix < fn_count; ix++)
3018 int static_offset = 0;
3020 struct type **parm_types;
3021 struct xmethod_worker *worker = NULL;
3023 if (xm_worker_vec != NULL)
3025 worker = VEC_index (xmethod_worker_ptr, xm_worker_vec, ix);
3026 parm_types = get_xmethod_arg_types (worker, &nparms);
3030 if (fns_ptr != NULL)
3032 nparms = TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (fns_ptr, ix));
3033 static_offset = oload_method_static_p (fns_ptr, ix);
3036 nparms = TYPE_NFIELDS (SYMBOL_TYPE (oload_syms[ix]));
3038 parm_types = XNEWVEC (struct type *, nparms);
3039 for (jj = 0; jj < nparms; jj++)
3040 parm_types[jj] = (fns_ptr != NULL
3041 ? (TYPE_FN_FIELD_ARGS (fns_ptr, ix)[jj].type)
3042 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms[ix]),
3046 /* Compare parameter types to supplied argument types. Skip
3047 THIS for static methods. */
3048 bv = rank_function (parm_types, nparms,
3049 args + static_offset,
3050 nargs - static_offset);
3052 if (!*oload_champ_bv)
3054 *oload_champ_bv = 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 = bv;
3069 oload_ambiguous = 0;
3079 if (fns_ptr != NULL)
3080 fprintf_filtered (gdb_stderr,
3081 "Overloaded method instance %s, # of parms %d\n",
3082 fns_ptr[ix].physname, nparms);
3083 else if (xm_worker_vec != NULL)
3084 fprintf_filtered (gdb_stderr,
3085 "Xmethod worker, # of parms %d\n",
3088 fprintf_filtered (gdb_stderr,
3089 "Overloaded function instance "
3090 "%s # of parms %d\n",
3091 SYMBOL_DEMANGLED_NAME (oload_syms[ix]),
3093 for (jj = 0; jj < nargs - static_offset; jj++)
3094 fprintf_filtered (gdb_stderr,
3095 "...Badness @ %d : %d\n",
3096 jj, bv->rank[jj].rank);
3097 fprintf_filtered (gdb_stderr, "Overload resolution "
3098 "champion is %d, ambiguous? %d\n",
3099 oload_champ, oload_ambiguous);
3106 /* Return 1 if we're looking at a static method, 0 if we're looking at
3107 a non-static method or a function that isn't a method. */
3110 oload_method_static_p (struct fn_field *fns_ptr, int index)
3112 if (fns_ptr && index >= 0 && TYPE_FN_FIELD_STATIC_P (fns_ptr, index))
3118 /* Check how good an overload match OLOAD_CHAMP_BV represents. */
3120 static enum oload_classification
3121 classify_oload_match (struct badness_vector *oload_champ_bv,
3126 enum oload_classification worst = STANDARD;
3128 for (ix = 1; ix <= nargs - static_offset; ix++)
3130 /* If this conversion is as bad as INCOMPATIBLE_TYPE_BADNESS
3131 or worse return INCOMPATIBLE. */
3132 if (compare_ranks (oload_champ_bv->rank[ix],
3133 INCOMPATIBLE_TYPE_BADNESS) <= 0)
3134 return INCOMPATIBLE; /* Truly mismatched types. */
3135 /* Otherwise If this conversion is as bad as
3136 NS_POINTER_CONVERSION_BADNESS or worse return NON_STANDARD. */
3137 else if (compare_ranks (oload_champ_bv->rank[ix],
3138 NS_POINTER_CONVERSION_BADNESS) <= 0)
3139 worst = NON_STANDARD; /* Non-standard type conversions
3143 /* If no INCOMPATIBLE classification was found, return the worst one
3144 that was found (if any). */
3148 /* C++: return 1 is NAME is a legitimate name for the destructor of
3149 type TYPE. If TYPE does not have a destructor, or if NAME is
3150 inappropriate for TYPE, an error is signaled. Parameter TYPE should not yet
3151 have CHECK_TYPEDEF applied, this function will apply it itself. */
3154 destructor_name_p (const char *name, struct type *type)
3158 const char *dname = type_name_no_tag_or_error (type);
3159 const char *cp = strchr (dname, '<');
3162 /* Do not compare the template part for template classes. */
3164 len = strlen (dname);
3167 if (strlen (name + 1) != len || strncmp (dname, name + 1, len) != 0)
3168 error (_("name of destructor must equal name of class"));
3175 /* Find an enum constant named NAME in TYPE. TYPE must be an "enum
3176 class". If the name is found, return a value representing it;
3177 otherwise throw an exception. */
3179 static struct value *
3180 enum_constant_from_type (struct type *type, const char *name)
3183 int name_len = strlen (name);
3185 gdb_assert (TYPE_CODE (type) == TYPE_CODE_ENUM
3186 && TYPE_DECLARED_CLASS (type));
3188 for (i = TYPE_N_BASECLASSES (type); i < TYPE_NFIELDS (type); ++i)
3190 const char *fname = TYPE_FIELD_NAME (type, i);
3193 if (TYPE_FIELD_LOC_KIND (type, i) != FIELD_LOC_KIND_ENUMVAL
3197 /* Look for the trailing "::NAME", since enum class constant
3198 names are qualified here. */
3199 len = strlen (fname);
3200 if (len + 2 >= name_len
3201 && fname[len - name_len - 2] == ':'
3202 && fname[len - name_len - 1] == ':'
3203 && strcmp (&fname[len - name_len], name) == 0)
3204 return value_from_longest (type, TYPE_FIELD_ENUMVAL (type, i));
3207 error (_("no constant named \"%s\" in enum \"%s\""),
3208 name, TYPE_TAG_NAME (type));
3211 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3212 return the appropriate member (or the address of the member, if
3213 WANT_ADDRESS). This function is used to resolve user expressions
3214 of the form "DOMAIN::NAME". For more details on what happens, see
3215 the comment before value_struct_elt_for_reference. */
3218 value_aggregate_elt (struct type *curtype, const char *name,
3219 struct type *expect_type, int want_address,
3222 switch (TYPE_CODE (curtype))
3224 case TYPE_CODE_STRUCT:
3225 case TYPE_CODE_UNION:
3226 return value_struct_elt_for_reference (curtype, 0, curtype,
3228 want_address, noside);
3229 case TYPE_CODE_NAMESPACE:
3230 return value_namespace_elt (curtype, name,
3231 want_address, noside);
3233 case TYPE_CODE_ENUM:
3234 return enum_constant_from_type (curtype, name);
3237 internal_error (__FILE__, __LINE__,
3238 _("non-aggregate type in value_aggregate_elt"));
3242 /* Compares the two method/function types T1 and T2 for "equality"
3243 with respect to the methods' parameters. If the types of the
3244 two parameter lists are the same, returns 1; 0 otherwise. This
3245 comparison may ignore any artificial parameters in T1 if
3246 SKIP_ARTIFICIAL is non-zero. This function will ALWAYS skip
3247 the first artificial parameter in T1, assumed to be a 'this' pointer.
3249 The type T2 is expected to have come from make_params (in eval.c). */
3252 compare_parameters (struct type *t1, struct type *t2, int skip_artificial)
3256 if (TYPE_NFIELDS (t1) > 0 && TYPE_FIELD_ARTIFICIAL (t1, 0))
3259 /* If skipping artificial fields, find the first real field
3261 if (skip_artificial)
3263 while (start < TYPE_NFIELDS (t1)
3264 && TYPE_FIELD_ARTIFICIAL (t1, start))
3268 /* Now compare parameters. */
3270 /* Special case: a method taking void. T1 will contain no
3271 non-artificial fields, and T2 will contain TYPE_CODE_VOID. */
3272 if ((TYPE_NFIELDS (t1) - start) == 0 && TYPE_NFIELDS (t2) == 1
3273 && TYPE_CODE (TYPE_FIELD_TYPE (t2, 0)) == TYPE_CODE_VOID)
3276 if ((TYPE_NFIELDS (t1) - start) == TYPE_NFIELDS (t2))
3280 for (i = 0; i < TYPE_NFIELDS (t2); ++i)
3282 if (compare_ranks (rank_one_type (TYPE_FIELD_TYPE (t1, start + i),
3283 TYPE_FIELD_TYPE (t2, i), NULL),
3284 EXACT_MATCH_BADNESS) != 0)
3294 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3295 return the address of this member as a "pointer to member" type.
3296 If INTYPE is non-null, then it will be the type of the member we
3297 are looking for. This will help us resolve "pointers to member
3298 functions". This function is used to resolve user expressions of
3299 the form "DOMAIN::NAME". */
3301 static struct value *
3302 value_struct_elt_for_reference (struct type *domain, int offset,
3303 struct type *curtype, const char *name,
3304 struct type *intype,
3308 struct type *t = curtype;
3310 struct value *v, *result;
3312 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
3313 && TYPE_CODE (t) != TYPE_CODE_UNION)
3314 error (_("Internal error: non-aggregate type "
3315 "to value_struct_elt_for_reference"));
3317 for (i = TYPE_NFIELDS (t) - 1; i >= TYPE_N_BASECLASSES (t); i--)
3319 const char *t_field_name = TYPE_FIELD_NAME (t, i);
3321 if (t_field_name && strcmp (t_field_name, name) == 0)
3323 if (field_is_static (&TYPE_FIELD (t, i)))
3325 v = value_static_field (t, i);
3330 if (TYPE_FIELD_PACKED (t, i))
3331 error (_("pointers to bitfield members not allowed"));
3334 return value_from_longest
3335 (lookup_memberptr_type (TYPE_FIELD_TYPE (t, i), domain),
3336 offset + (LONGEST) (TYPE_FIELD_BITPOS (t, i) >> 3));
3337 else if (noside != EVAL_NORMAL)
3338 return allocate_value (TYPE_FIELD_TYPE (t, i));
3341 /* Try to evaluate NAME as a qualified name with implicit
3342 this pointer. In this case, attempt to return the
3343 equivalent to `this->*(&TYPE::NAME)'. */
3344 v = value_of_this_silent (current_language);
3349 struct type *type, *tmp;
3351 ptr = value_aggregate_elt (domain, name, NULL, 1, noside);
3352 type = check_typedef (value_type (ptr));
3353 gdb_assert (type != NULL
3354 && TYPE_CODE (type) == TYPE_CODE_MEMBERPTR);
3355 tmp = lookup_pointer_type (TYPE_SELF_TYPE (type));
3356 v = value_cast_pointers (tmp, v, 1);
3357 mem_offset = value_as_long (ptr);
3358 tmp = lookup_pointer_type (TYPE_TARGET_TYPE (type));
3359 result = value_from_pointer (tmp,
3360 value_as_long (v) + mem_offset);
3361 return value_ind (result);
3364 error (_("Cannot reference non-static field \"%s\""), name);
3369 /* C++: If it was not found as a data field, then try to return it
3370 as a pointer to a method. */
3372 /* Perform all necessary dereferencing. */
3373 while (intype && TYPE_CODE (intype) == TYPE_CODE_PTR)
3374 intype = TYPE_TARGET_TYPE (intype);
3376 for (i = TYPE_NFN_FIELDS (t) - 1; i >= 0; --i)
3378 const char *t_field_name = TYPE_FN_FIELDLIST_NAME (t, i);
3379 char dem_opname[64];
3381 if (startswith (t_field_name, "__")
3382 || startswith (t_field_name, "op")
3383 || startswith (t_field_name, "type"))
3385 if (cplus_demangle_opname (t_field_name,
3386 dem_opname, DMGL_ANSI))
3387 t_field_name = dem_opname;
3388 else if (cplus_demangle_opname (t_field_name,
3390 t_field_name = dem_opname;
3392 if (t_field_name && strcmp (t_field_name, name) == 0)
3395 int len = TYPE_FN_FIELDLIST_LENGTH (t, i);
3396 struct fn_field *f = TYPE_FN_FIELDLIST1 (t, i);
3398 check_stub_method_group (t, i);
3402 for (j = 0; j < len; ++j)
3404 if (compare_parameters (TYPE_FN_FIELD_TYPE (f, j), intype, 0)
3405 || compare_parameters (TYPE_FN_FIELD_TYPE (f, j),
3411 error (_("no member function matches "
3412 "that type instantiation"));
3419 for (ii = 0; ii < len; ++ii)
3421 /* Skip artificial methods. This is necessary if,
3422 for example, the user wants to "print
3423 subclass::subclass" with only one user-defined
3424 constructor. There is no ambiguity in this case.
3425 We are careful here to allow artificial methods
3426 if they are the unique result. */
3427 if (TYPE_FN_FIELD_ARTIFICIAL (f, ii))
3434 /* Desired method is ambiguous if more than one
3435 method is defined. */
3436 if (j != -1 && !TYPE_FN_FIELD_ARTIFICIAL (f, j))
3437 error (_("non-unique member `%s' requires "
3438 "type instantiation"), name);
3444 error (_("no matching member function"));
3447 if (TYPE_FN_FIELD_STATIC_P (f, j))
3450 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j),
3451 0, VAR_DOMAIN, 0).symbol;
3457 return value_addr (read_var_value (s, 0, 0));
3459 return read_var_value (s, 0, 0);
3462 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
3466 result = allocate_value
3467 (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f, j)));
3468 cplus_make_method_ptr (value_type (result),
3469 value_contents_writeable (result),
3470 TYPE_FN_FIELD_VOFFSET (f, j), 1);
3472 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
3473 return allocate_value (TYPE_FN_FIELD_TYPE (f, j));
3475 error (_("Cannot reference virtual member function \"%s\""),
3481 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j),
3482 0, VAR_DOMAIN, 0).symbol;
3487 v = read_var_value (s, 0, 0);
3492 result = allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f, j)));
3493 cplus_make_method_ptr (value_type (result),
3494 value_contents_writeable (result),
3495 value_address (v), 0);
3501 for (i = TYPE_N_BASECLASSES (t) - 1; i >= 0; i--)
3506 if (BASETYPE_VIA_VIRTUAL (t, i))
3509 base_offset = TYPE_BASECLASS_BITPOS (t, i) / 8;
3510 v = value_struct_elt_for_reference (domain,
3511 offset + base_offset,
3512 TYPE_BASECLASS (t, i),
3514 want_address, noside);
3519 /* As a last chance, pretend that CURTYPE is a namespace, and look
3520 it up that way; this (frequently) works for types nested inside
3523 return value_maybe_namespace_elt (curtype, name,
3524 want_address, noside);
3527 /* C++: Return the member NAME of the namespace given by the type
3530 static struct value *
3531 value_namespace_elt (const struct type *curtype,
3532 const char *name, int want_address,
3535 struct value *retval = value_maybe_namespace_elt (curtype, name,
3540 error (_("No symbol \"%s\" in namespace \"%s\"."),
3541 name, TYPE_TAG_NAME (curtype));
3546 /* A helper function used by value_namespace_elt and
3547 value_struct_elt_for_reference. It looks up NAME inside the
3548 context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE
3549 is a class and NAME refers to a type in CURTYPE itself (as opposed
3550 to, say, some base class of CURTYPE). */
3552 static struct value *
3553 value_maybe_namespace_elt (const struct type *curtype,
3554 const char *name, int want_address,
3557 const char *namespace_name = TYPE_TAG_NAME (curtype);
3558 struct block_symbol sym;
3559 struct value *result;
3561 sym = cp_lookup_symbol_namespace (namespace_name, name,
3562 get_selected_block (0), VAR_DOMAIN);
3564 if (sym.symbol == NULL)
3566 else if ((noside == EVAL_AVOID_SIDE_EFFECTS)
3567 && (SYMBOL_CLASS (sym.symbol) == LOC_TYPEDEF))
3568 result = allocate_value (SYMBOL_TYPE (sym.symbol));
3570 result = value_of_variable (sym.symbol, sym.block);
3573 result = value_addr (result);
3578 /* Given a pointer or a reference value V, find its real (RTTI) type.
3580 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
3581 and refer to the values computed for the object pointed to. */
3584 value_rtti_indirect_type (struct value *v, int *full,
3585 int *top, int *using_enc)
3587 struct value *target = NULL;
3588 struct type *type, *real_type, *target_type;
3590 type = value_type (v);
3591 type = check_typedef (type);
3592 if (TYPE_CODE (type) == TYPE_CODE_REF)
3593 target = coerce_ref (v);
3594 else if (TYPE_CODE (type) == TYPE_CODE_PTR)
3599 target = value_ind (v);
3601 CATCH (except, RETURN_MASK_ERROR)
3603 if (except.error == MEMORY_ERROR)
3605 /* value_ind threw a memory error. The pointer is NULL or
3606 contains an uninitialized value: we can't determine any
3610 throw_exception (except);
3617 real_type = value_rtti_type (target, full, top, using_enc);
3621 /* Copy qualifiers to the referenced object. */
3622 target_type = value_type (target);
3623 real_type = make_cv_type (TYPE_CONST (target_type),
3624 TYPE_VOLATILE (target_type), real_type, NULL);
3625 if (TYPE_CODE (type) == TYPE_CODE_REF)
3626 real_type = lookup_reference_type (real_type);
3627 else if (TYPE_CODE (type) == TYPE_CODE_PTR)
3628 real_type = lookup_pointer_type (real_type);
3630 internal_error (__FILE__, __LINE__, _("Unexpected value type."));
3632 /* Copy qualifiers to the pointer/reference. */
3633 real_type = make_cv_type (TYPE_CONST (type), TYPE_VOLATILE (type),
3640 /* Given a value pointed to by ARGP, check its real run-time type, and
3641 if that is different from the enclosing type, create a new value
3642 using the real run-time type as the enclosing type (and of the same
3643 type as ARGP) and return it, with the embedded offset adjusted to
3644 be the correct offset to the enclosed object. RTYPE is the type,
3645 and XFULL, XTOP, and XUSING_ENC are the other parameters, computed
3646 by value_rtti_type(). If these are available, they can be supplied
3647 and a second call to value_rtti_type() is avoided. (Pass RTYPE ==
3648 NULL if they're not available. */
3651 value_full_object (struct value *argp,
3653 int xfull, int xtop,
3656 struct type *real_type;
3660 struct value *new_val;
3667 using_enc = xusing_enc;
3670 real_type = value_rtti_type (argp, &full, &top, &using_enc);
3672 /* If no RTTI data, or if object is already complete, do nothing. */
3673 if (!real_type || real_type == value_enclosing_type (argp))
3676 /* In a destructor we might see a real type that is a superclass of
3677 the object's type. In this case it is better to leave the object
3680 && TYPE_LENGTH (real_type) < TYPE_LENGTH (value_enclosing_type (argp)))
3683 /* If we have the full object, but for some reason the enclosing
3684 type is wrong, set it. */
3685 /* pai: FIXME -- sounds iffy */
3688 argp = value_copy (argp);
3689 set_value_enclosing_type (argp, real_type);
3693 /* Check if object is in memory. */
3694 if (VALUE_LVAL (argp) != lval_memory)
3696 warning (_("Couldn't retrieve complete object of RTTI "
3697 "type %s; object may be in register(s)."),
3698 TYPE_NAME (real_type));
3703 /* All other cases -- retrieve the complete object. */
3704 /* Go back by the computed top_offset from the beginning of the
3705 object, adjusting for the embedded offset of argp if that's what
3706 value_rtti_type used for its computation. */
3707 new_val = value_at_lazy (real_type, value_address (argp) - top +
3708 (using_enc ? 0 : value_embedded_offset (argp)));
3709 deprecated_set_value_type (new_val, value_type (argp));
3710 set_value_embedded_offset (new_val, (using_enc
3711 ? top + value_embedded_offset (argp)
3717 /* Return the value of the local variable, if one exists. Throw error
3718 otherwise, such as if the request is made in an inappropriate context. */
3721 value_of_this (const struct language_defn *lang)
3723 struct block_symbol sym;
3724 const struct block *b;
3725 struct frame_info *frame;
3727 if (!lang->la_name_of_this)
3728 error (_("no `this' in current language"));
3730 frame = get_selected_frame (_("no frame selected"));
3732 b = get_frame_block (frame, NULL);
3734 sym = lookup_language_this (lang, b);
3735 if (sym.symbol == NULL)
3736 error (_("current stack frame does not contain a variable named `%s'"),
3737 lang->la_name_of_this);
3739 return read_var_value (sym.symbol, sym.block, frame);
3742 /* Return the value of the local variable, if one exists. Return NULL
3743 otherwise. Never throw error. */
3746 value_of_this_silent (const struct language_defn *lang)
3748 struct value *ret = NULL;
3752 ret = value_of_this (lang);
3754 CATCH (except, RETURN_MASK_ERROR)
3762 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH
3763 elements long, starting at LOWBOUND. The result has the same lower
3764 bound as the original ARRAY. */
3767 value_slice (struct value *array, int lowbound, int length)
3769 struct type *slice_range_type, *slice_type, *range_type;
3770 LONGEST lowerbound, upperbound;
3771 struct value *slice;
3772 struct type *array_type;
3774 array_type = check_typedef (value_type (array));
3775 if (TYPE_CODE (array_type) != TYPE_CODE_ARRAY
3776 && TYPE_CODE (array_type) != TYPE_CODE_STRING)
3777 error (_("cannot take slice of non-array"));
3779 range_type = TYPE_INDEX_TYPE (array_type);
3780 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
3781 error (_("slice from bad array or bitstring"));
3783 if (lowbound < lowerbound || length < 0
3784 || lowbound + length - 1 > upperbound)
3785 error (_("slice out of range"));
3787 /* FIXME-type-allocation: need a way to free this type when we are
3789 slice_range_type = create_static_range_type ((struct type *) NULL,
3790 TYPE_TARGET_TYPE (range_type),
3792 lowbound + length - 1);
3795 struct type *element_type = TYPE_TARGET_TYPE (array_type);
3797 = (lowbound - lowerbound) * TYPE_LENGTH (check_typedef (element_type));
3799 slice_type = create_array_type ((struct type *) NULL,
3802 TYPE_CODE (slice_type) = TYPE_CODE (array_type);
3804 if (VALUE_LVAL (array) == lval_memory && value_lazy (array))
3805 slice = allocate_value_lazy (slice_type);
3808 slice = allocate_value (slice_type);
3809 value_contents_copy (slice, 0, array, offset,
3810 type_length_units (slice_type));
3813 set_value_component_location (slice, array);
3814 VALUE_FRAME_ID (slice) = VALUE_FRAME_ID (array);
3815 set_value_offset (slice, value_offset (array) + offset);
3821 /* Create a value for a FORTRAN complex number. Currently most of the
3822 time values are coerced to COMPLEX*16 (i.e. a complex number
3823 composed of 2 doubles. This really should be a smarter routine
3824 that figures out precision inteligently as opposed to assuming
3825 doubles. FIXME: fmb */
3828 value_literal_complex (struct value *arg1,
3833 struct type *real_type = TYPE_TARGET_TYPE (type);
3835 val = allocate_value (type);
3836 arg1 = value_cast (real_type, arg1);
3837 arg2 = value_cast (real_type, arg2);
3839 memcpy (value_contents_raw (val),
3840 value_contents (arg1), TYPE_LENGTH (real_type));
3841 memcpy (value_contents_raw (val) + TYPE_LENGTH (real_type),
3842 value_contents (arg2), TYPE_LENGTH (real_type));
3846 /* Cast a value into the appropriate complex data type. */
3848 static struct value *
3849 cast_into_complex (struct type *type, struct value *val)
3851 struct type *real_type = TYPE_TARGET_TYPE (type);
3853 if (TYPE_CODE (value_type (val)) == TYPE_CODE_COMPLEX)
3855 struct type *val_real_type = TYPE_TARGET_TYPE (value_type (val));
3856 struct value *re_val = allocate_value (val_real_type);
3857 struct value *im_val = allocate_value (val_real_type);
3859 memcpy (value_contents_raw (re_val),
3860 value_contents (val), TYPE_LENGTH (val_real_type));
3861 memcpy (value_contents_raw (im_val),
3862 value_contents (val) + TYPE_LENGTH (val_real_type),
3863 TYPE_LENGTH (val_real_type));
3865 return value_literal_complex (re_val, im_val, type);
3867 else if (TYPE_CODE (value_type (val)) == TYPE_CODE_FLT
3868 || TYPE_CODE (value_type (val)) == TYPE_CODE_INT)
3869 return value_literal_complex (val,
3870 value_zero (real_type, not_lval),
3873 error (_("cannot cast non-number to complex"));
3877 _initialize_valops (void)
3879 add_setshow_boolean_cmd ("overload-resolution", class_support,
3880 &overload_resolution, _("\
3881 Set overload resolution in evaluating C++ functions."), _("\
3882 Show overload resolution in evaluating C++ functions."),
3884 show_overload_resolution,
3885 &setlist, &showlist);
3886 overload_resolution = 1;