1 /* Perform non-arithmetic operations on values, for GDB.
3 Copyright (C) 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995,
4 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
5 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
7 This file is part of GDB.
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3 of the License, or
12 (at your option) any later version.
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with this program. If not, see <http://www.gnu.org/licenses/>. */
37 #include "dictionary.h"
38 #include "cp-support.h"
40 #include "user-regs.h"
41 #include "tracepoint.h"
43 #include "gdb_string.h"
44 #include "gdb_assert.h"
45 #include "cp-support.h"
49 #include "exceptions.h"
51 extern int overload_debug;
52 /* Local functions. */
54 static int typecmp (int staticp, int varargs, int nargs,
55 struct field t1[], struct value *t2[]);
57 static struct value *search_struct_field (const char *, struct value *,
58 int, struct type *, int);
60 static struct value *search_struct_method (const char *, struct value **,
62 int, int *, struct type *);
64 static int find_oload_champ_namespace (struct value **, int,
65 const char *, const char *,
67 struct badness_vector **,
71 int find_oload_champ_namespace_loop (struct value **, int,
72 const char *, const char *,
73 int, struct symbol ***,
74 struct badness_vector **, int *,
77 static int find_oload_champ (struct value **, int, int, int,
78 struct fn_field *, struct symbol **,
79 struct badness_vector **);
81 static int oload_method_static (int, struct fn_field *, int);
83 enum oload_classification { STANDARD, NON_STANDARD, INCOMPATIBLE };
86 oload_classification classify_oload_match (struct badness_vector *,
89 static struct value *value_struct_elt_for_reference (struct type *,
95 static struct value *value_namespace_elt (const struct type *,
96 char *, int , enum noside);
98 static struct value *value_maybe_namespace_elt (const struct type *,
102 static CORE_ADDR allocate_space_in_inferior (int);
104 static struct value *cast_into_complex (struct type *, struct value *);
106 static struct fn_field *find_method_list (struct value **, const char *,
107 int, struct type *, int *,
108 struct type **, int *);
110 void _initialize_valops (void);
113 /* Flag for whether we want to abandon failed expression evals by
116 static int auto_abandon = 0;
119 int overload_resolution = 0;
121 show_overload_resolution (struct ui_file *file, int from_tty,
122 struct cmd_list_element *c,
125 fprintf_filtered (file, _("Overload resolution in evaluating "
126 "C++ functions is %s.\n"),
130 /* Find the address of function name NAME in the inferior. If OBJF_P
131 is non-NULL, *OBJF_P will be set to the OBJFILE where the function
135 find_function_in_inferior (const char *name, struct objfile **objf_p)
139 sym = lookup_symbol (name, 0, VAR_DOMAIN, 0);
142 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
144 error (_("\"%s\" exists in this program but is not a function."),
149 *objf_p = SYMBOL_SYMTAB (sym)->objfile;
151 return value_of_variable (sym, NULL);
155 struct minimal_symbol *msymbol =
156 lookup_minimal_symbol (name, NULL, NULL);
160 struct objfile *objfile = msymbol_objfile (msymbol);
161 struct gdbarch *gdbarch = get_objfile_arch (objfile);
165 type = lookup_pointer_type (builtin_type (gdbarch)->builtin_char);
166 type = lookup_function_type (type);
167 type = lookup_pointer_type (type);
168 maddr = SYMBOL_VALUE_ADDRESS (msymbol);
173 return value_from_pointer (type, maddr);
177 if (!target_has_execution)
178 error (_("evaluation of this expression "
179 "requires the target program to be active"));
181 error (_("evaluation of this expression requires the "
182 "program to have a function \"%s\"."),
188 /* Allocate NBYTES of space in the inferior using the inferior's
189 malloc and return a value that is a pointer to the allocated
193 value_allocate_space_in_inferior (int len)
195 struct objfile *objf;
196 struct value *val = find_function_in_inferior ("malloc", &objf);
197 struct gdbarch *gdbarch = get_objfile_arch (objf);
198 struct value *blocklen;
200 blocklen = value_from_longest (builtin_type (gdbarch)->builtin_int, len);
201 val = call_function_by_hand (val, 1, &blocklen);
202 if (value_logical_not (val))
204 if (!target_has_execution)
205 error (_("No memory available to program now: "
206 "you need to start the target first"));
208 error (_("No memory available to program: call to malloc failed"));
214 allocate_space_in_inferior (int len)
216 return value_as_long (value_allocate_space_in_inferior (len));
219 /* Cast struct value VAL to type TYPE and return as a value.
220 Both type and val must be of TYPE_CODE_STRUCT or TYPE_CODE_UNION
221 for this to work. Typedef to one of the codes is permitted.
222 Returns NULL if the cast is neither an upcast nor a downcast. */
224 static struct value *
225 value_cast_structs (struct type *type, struct value *v2)
231 gdb_assert (type != NULL && v2 != NULL);
233 t1 = check_typedef (type);
234 t2 = check_typedef (value_type (v2));
236 /* Check preconditions. */
237 gdb_assert ((TYPE_CODE (t1) == TYPE_CODE_STRUCT
238 || TYPE_CODE (t1) == TYPE_CODE_UNION)
239 && !!"Precondition is that type is of STRUCT or UNION kind.");
240 gdb_assert ((TYPE_CODE (t2) == TYPE_CODE_STRUCT
241 || TYPE_CODE (t2) == TYPE_CODE_UNION)
242 && !!"Precondition is that value is of STRUCT or UNION kind");
244 if (TYPE_NAME (t1) != NULL
245 && TYPE_NAME (t2) != NULL
246 && !strcmp (TYPE_NAME (t1), TYPE_NAME (t2)))
249 /* Upcasting: look in the type of the source to see if it contains the
250 type of the target as a superclass. If so, we'll need to
251 offset the pointer rather than just change its type. */
252 if (TYPE_NAME (t1) != NULL)
254 v = search_struct_field (type_name_no_tag (t1),
260 /* Downcasting: look in the type of the target to see if it contains the
261 type of the source as a superclass. If so, we'll need to
262 offset the pointer rather than just change its type. */
263 if (TYPE_NAME (t2) != NULL)
265 /* Try downcasting using the run-time type of the value. */
266 int full, top, using_enc;
267 struct type *real_type;
269 real_type = value_rtti_type (v2, &full, &top, &using_enc);
272 v = value_full_object (v2, real_type, full, top, using_enc);
273 v = value_at_lazy (real_type, value_address (v));
275 /* We might be trying to cast to the outermost enclosing
276 type, in which case search_struct_field won't work. */
277 if (TYPE_NAME (real_type) != NULL
278 && !strcmp (TYPE_NAME (real_type), TYPE_NAME (t1)))
281 v = search_struct_field (type_name_no_tag (t2), v, 0, real_type, 1);
286 /* Try downcasting using information from the destination type
287 T2. This wouldn't work properly for classes with virtual
288 bases, but those were handled above. */
289 v = search_struct_field (type_name_no_tag (t2),
290 value_zero (t1, not_lval), 0, t1, 1);
293 /* Downcasting is possible (t1 is superclass of v2). */
294 CORE_ADDR addr2 = value_address (v2);
296 addr2 -= value_address (v) + value_embedded_offset (v);
297 return value_at (type, addr2);
304 /* Cast one pointer or reference type to another. Both TYPE and
305 the type of ARG2 should be pointer types, or else both should be
306 reference types. Returns the new pointer or reference. */
309 value_cast_pointers (struct type *type, struct value *arg2)
311 struct type *type1 = check_typedef (type);
312 struct type *type2 = check_typedef (value_type (arg2));
313 struct type *t1 = check_typedef (TYPE_TARGET_TYPE (type1));
314 struct type *t2 = check_typedef (TYPE_TARGET_TYPE (type2));
316 if (TYPE_CODE (t1) == TYPE_CODE_STRUCT
317 && TYPE_CODE (t2) == TYPE_CODE_STRUCT
318 && !value_logical_not (arg2))
322 if (TYPE_CODE (type2) == TYPE_CODE_REF)
323 v2 = coerce_ref (arg2);
325 v2 = value_ind (arg2);
326 gdb_assert (TYPE_CODE (check_typedef (value_type (v2)))
327 == TYPE_CODE_STRUCT && !!"Why did coercion fail?");
328 v2 = value_cast_structs (t1, v2);
329 /* At this point we have what we can have, un-dereference if needed. */
332 struct value *v = value_addr (v2);
334 deprecated_set_value_type (v, type);
339 /* No superclass found, just change the pointer type. */
340 arg2 = value_copy (arg2);
341 deprecated_set_value_type (arg2, type);
342 set_value_enclosing_type (arg2, type);
343 set_value_pointed_to_offset (arg2, 0); /* pai: chk_val */
347 /* Cast value ARG2 to type TYPE and return as a value.
348 More general than a C cast: accepts any two types of the same length,
349 and if ARG2 is an lvalue it can be cast into anything at all. */
350 /* In C++, casts may change pointer or object representations. */
353 value_cast (struct type *type, struct value *arg2)
355 enum type_code code1;
356 enum type_code code2;
360 int convert_to_boolean = 0;
362 if (value_type (arg2) == type)
365 code1 = TYPE_CODE (check_typedef (type));
367 /* Check if we are casting struct reference to struct reference. */
368 if (code1 == TYPE_CODE_REF)
370 /* We dereference type; then we recurse and finally
371 we generate value of the given reference. Nothing wrong with
373 struct type *t1 = check_typedef (type);
374 struct type *dereftype = check_typedef (TYPE_TARGET_TYPE (t1));
375 struct value *val = value_cast (dereftype, arg2);
377 return value_ref (val);
380 code2 = TYPE_CODE (check_typedef (value_type (arg2)));
382 if (code2 == TYPE_CODE_REF)
383 /* We deref the value and then do the cast. */
384 return value_cast (type, coerce_ref (arg2));
386 CHECK_TYPEDEF (type);
387 code1 = TYPE_CODE (type);
388 arg2 = coerce_ref (arg2);
389 type2 = check_typedef (value_type (arg2));
391 /* You can't cast to a reference type. See value_cast_pointers
393 gdb_assert (code1 != TYPE_CODE_REF);
395 /* A cast to an undetermined-length array_type, such as
396 (TYPE [])OBJECT, is treated like a cast to (TYPE [N])OBJECT,
397 where N is sizeof(OBJECT)/sizeof(TYPE). */
398 if (code1 == TYPE_CODE_ARRAY)
400 struct type *element_type = TYPE_TARGET_TYPE (type);
401 unsigned element_length = TYPE_LENGTH (check_typedef (element_type));
403 if (element_length > 0 && TYPE_ARRAY_UPPER_BOUND_IS_UNDEFINED (type))
405 struct type *range_type = TYPE_INDEX_TYPE (type);
406 int val_length = TYPE_LENGTH (type2);
407 LONGEST low_bound, high_bound, new_length;
409 if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0)
410 low_bound = 0, high_bound = 0;
411 new_length = val_length / element_length;
412 if (val_length % element_length != 0)
413 warning (_("array element type size does not "
414 "divide object size in cast"));
415 /* FIXME-type-allocation: need a way to free this type when
416 we are done with it. */
417 range_type = create_range_type ((struct type *) NULL,
418 TYPE_TARGET_TYPE (range_type),
420 new_length + low_bound - 1);
421 deprecated_set_value_type (arg2,
422 create_array_type ((struct type *) NULL,
429 if (current_language->c_style_arrays
430 && TYPE_CODE (type2) == TYPE_CODE_ARRAY
431 && !TYPE_VECTOR (type2))
432 arg2 = value_coerce_array (arg2);
434 if (TYPE_CODE (type2) == TYPE_CODE_FUNC)
435 arg2 = value_coerce_function (arg2);
437 type2 = check_typedef (value_type (arg2));
438 code2 = TYPE_CODE (type2);
440 if (code1 == TYPE_CODE_COMPLEX)
441 return cast_into_complex (type, arg2);
442 if (code1 == TYPE_CODE_BOOL)
444 code1 = TYPE_CODE_INT;
445 convert_to_boolean = 1;
447 if (code1 == TYPE_CODE_CHAR)
448 code1 = TYPE_CODE_INT;
449 if (code2 == TYPE_CODE_BOOL || code2 == TYPE_CODE_CHAR)
450 code2 = TYPE_CODE_INT;
452 scalar = (code2 == TYPE_CODE_INT || code2 == TYPE_CODE_FLT
453 || code2 == TYPE_CODE_DECFLOAT || code2 == TYPE_CODE_ENUM
454 || code2 == TYPE_CODE_RANGE);
456 if ((code1 == TYPE_CODE_STRUCT || code1 == TYPE_CODE_UNION)
457 && (code2 == TYPE_CODE_STRUCT || code2 == TYPE_CODE_UNION)
458 && TYPE_NAME (type) != 0)
460 struct value *v = value_cast_structs (type, arg2);
466 if (code1 == TYPE_CODE_FLT && scalar)
467 return value_from_double (type, value_as_double (arg2));
468 else if (code1 == TYPE_CODE_DECFLOAT && scalar)
470 enum bfd_endian byte_order = gdbarch_byte_order (get_type_arch (type));
471 int dec_len = TYPE_LENGTH (type);
474 if (code2 == TYPE_CODE_FLT)
475 decimal_from_floating (arg2, dec, dec_len, byte_order);
476 else if (code2 == TYPE_CODE_DECFLOAT)
477 decimal_convert (value_contents (arg2), TYPE_LENGTH (type2),
478 byte_order, dec, dec_len, byte_order);
480 /* The only option left is an integral type. */
481 decimal_from_integral (arg2, dec, dec_len, byte_order);
483 return value_from_decfloat (type, dec);
485 else if ((code1 == TYPE_CODE_INT || code1 == TYPE_CODE_ENUM
486 || code1 == TYPE_CODE_RANGE)
487 && (scalar || code2 == TYPE_CODE_PTR
488 || code2 == TYPE_CODE_MEMBERPTR))
492 /* When we cast pointers to integers, we mustn't use
493 gdbarch_pointer_to_address to find the address the pointer
494 represents, as value_as_long would. GDB should evaluate
495 expressions just as the compiler would --- and the compiler
496 sees a cast as a simple reinterpretation of the pointer's
498 if (code2 == TYPE_CODE_PTR)
499 longest = extract_unsigned_integer
500 (value_contents (arg2), TYPE_LENGTH (type2),
501 gdbarch_byte_order (get_type_arch (type2)));
503 longest = value_as_long (arg2);
504 return value_from_longest (type, convert_to_boolean ?
505 (LONGEST) (longest ? 1 : 0) : longest);
507 else if (code1 == TYPE_CODE_PTR && (code2 == TYPE_CODE_INT
508 || code2 == TYPE_CODE_ENUM
509 || code2 == TYPE_CODE_RANGE))
511 /* TYPE_LENGTH (type) is the length of a pointer, but we really
512 want the length of an address! -- we are really dealing with
513 addresses (i.e., gdb representations) not pointers (i.e.,
514 target representations) here.
516 This allows things like "print *(int *)0x01000234" to work
517 without printing a misleading message -- which would
518 otherwise occur when dealing with a target having two byte
519 pointers and four byte addresses. */
521 int addr_bit = gdbarch_addr_bit (get_type_arch (type2));
522 LONGEST longest = value_as_long (arg2);
524 if (addr_bit < sizeof (LONGEST) * HOST_CHAR_BIT)
526 if (longest >= ((LONGEST) 1 << addr_bit)
527 || longest <= -((LONGEST) 1 << addr_bit))
528 warning (_("value truncated"));
530 return value_from_longest (type, longest);
532 else if (code1 == TYPE_CODE_METHODPTR && code2 == TYPE_CODE_INT
533 && value_as_long (arg2) == 0)
535 struct value *result = allocate_value (type);
537 cplus_make_method_ptr (type, value_contents_writeable (result), 0, 0);
540 else if (code1 == TYPE_CODE_MEMBERPTR && code2 == TYPE_CODE_INT
541 && value_as_long (arg2) == 0)
543 /* The Itanium C++ ABI represents NULL pointers to members as
544 minus one, instead of biasing the normal case. */
545 return value_from_longest (type, -1);
547 else if (code1 == TYPE_CODE_ARRAY && TYPE_VECTOR (type) && scalar)
549 /* Widen the scalar to a vector. */
552 LONGEST low_bound, high_bound;
555 if (!get_array_bounds (type, &low_bound, &high_bound))
556 error (_("Could not determine the vector bounds"));
558 eltype = check_typedef (TYPE_TARGET_TYPE (type));
559 arg2 = value_cast (eltype, arg2);
560 val = allocate_value (type);
562 for (i = 0; i < high_bound - low_bound + 1; i++)
564 /* Duplicate the contents of arg2 into the destination vector. */
565 memcpy (value_contents_writeable (val) + (i * TYPE_LENGTH (eltype)),
566 value_contents_all (arg2), TYPE_LENGTH (eltype));
570 else if (TYPE_LENGTH (type) == TYPE_LENGTH (type2))
572 if (code1 == TYPE_CODE_PTR && code2 == TYPE_CODE_PTR)
573 return value_cast_pointers (type, arg2);
575 arg2 = value_copy (arg2);
576 deprecated_set_value_type (arg2, type);
577 set_value_enclosing_type (arg2, type);
578 set_value_pointed_to_offset (arg2, 0); /* pai: chk_val */
581 else if (VALUE_LVAL (arg2) == lval_memory)
582 return value_at_lazy (type, value_address (arg2));
583 else if (code1 == TYPE_CODE_VOID)
585 return value_zero (type, not_lval);
589 error (_("Invalid cast."));
594 /* The C++ reinterpret_cast operator. */
597 value_reinterpret_cast (struct type *type, struct value *arg)
599 struct value *result;
600 struct type *real_type = check_typedef (type);
601 struct type *arg_type, *dest_type;
603 enum type_code dest_code, arg_code;
605 /* Do reference, function, and array conversion. */
606 arg = coerce_array (arg);
608 /* Attempt to preserve the type the user asked for. */
611 /* If we are casting to a reference type, transform
612 reinterpret_cast<T&>(V) to *reinterpret_cast<T*>(&V). */
613 if (TYPE_CODE (real_type) == TYPE_CODE_REF)
616 arg = value_addr (arg);
617 dest_type = lookup_pointer_type (TYPE_TARGET_TYPE (dest_type));
618 real_type = lookup_pointer_type (real_type);
621 arg_type = value_type (arg);
623 dest_code = TYPE_CODE (real_type);
624 arg_code = TYPE_CODE (arg_type);
626 /* We can convert pointer types, or any pointer type to int, or int
628 if ((dest_code == TYPE_CODE_PTR && arg_code == TYPE_CODE_INT)
629 || (dest_code == TYPE_CODE_INT && arg_code == TYPE_CODE_PTR)
630 || (dest_code == TYPE_CODE_METHODPTR && arg_code == TYPE_CODE_INT)
631 || (dest_code == TYPE_CODE_INT && arg_code == TYPE_CODE_METHODPTR)
632 || (dest_code == TYPE_CODE_MEMBERPTR && arg_code == TYPE_CODE_INT)
633 || (dest_code == TYPE_CODE_INT && arg_code == TYPE_CODE_MEMBERPTR)
634 || (dest_code == arg_code
635 && (dest_code == TYPE_CODE_PTR
636 || dest_code == TYPE_CODE_METHODPTR
637 || dest_code == TYPE_CODE_MEMBERPTR)))
638 result = value_cast (dest_type, arg);
640 error (_("Invalid reinterpret_cast"));
643 result = value_cast (type, value_ref (value_ind (result)));
648 /* A helper for value_dynamic_cast. This implements the first of two
649 runtime checks: we iterate over all the base classes of the value's
650 class which are equal to the desired class; if only one of these
651 holds the value, then it is the answer. */
654 dynamic_cast_check_1 (struct type *desired_type,
655 const gdb_byte *valaddr,
659 struct type *search_type,
661 struct type *arg_type,
662 struct value **result)
664 int i, result_count = 0;
666 for (i = 0; i < TYPE_N_BASECLASSES (search_type) && result_count < 2; ++i)
668 int offset = baseclass_offset (search_type, i, valaddr, embedded_offset,
671 if (class_types_same_p (desired_type, TYPE_BASECLASS (search_type, i)))
673 if (address + embedded_offset + offset >= arg_addr
674 && address + embedded_offset + offset < arg_addr + TYPE_LENGTH (arg_type))
678 *result = value_at_lazy (TYPE_BASECLASS (search_type, i),
679 address + embedded_offset + offset);
683 result_count += dynamic_cast_check_1 (desired_type,
685 embedded_offset + offset,
687 TYPE_BASECLASS (search_type, i),
696 /* A helper for value_dynamic_cast. This implements the second of two
697 runtime checks: we look for a unique public sibling class of the
698 argument's declared class. */
701 dynamic_cast_check_2 (struct type *desired_type,
702 const gdb_byte *valaddr,
706 struct type *search_type,
707 struct value **result)
709 int i, result_count = 0;
711 for (i = 0; i < TYPE_N_BASECLASSES (search_type) && result_count < 2; ++i)
715 if (! BASETYPE_VIA_PUBLIC (search_type, i))
718 offset = baseclass_offset (search_type, i, valaddr, embedded_offset,
720 if (class_types_same_p (desired_type, TYPE_BASECLASS (search_type, i)))
724 *result = value_at_lazy (TYPE_BASECLASS (search_type, i),
725 address + embedded_offset + offset);
728 result_count += dynamic_cast_check_2 (desired_type,
730 embedded_offset + offset,
732 TYPE_BASECLASS (search_type, i),
739 /* The C++ dynamic_cast operator. */
742 value_dynamic_cast (struct type *type, struct value *arg)
744 int full, top, using_enc;
745 struct type *resolved_type = check_typedef (type);
746 struct type *arg_type = check_typedef (value_type (arg));
747 struct type *class_type, *rtti_type;
748 struct value *result, *tem, *original_arg = arg;
750 int is_ref = TYPE_CODE (resolved_type) == TYPE_CODE_REF;
752 if (TYPE_CODE (resolved_type) != TYPE_CODE_PTR
753 && TYPE_CODE (resolved_type) != TYPE_CODE_REF)
754 error (_("Argument to dynamic_cast must be a pointer or reference type"));
755 if (TYPE_CODE (TYPE_TARGET_TYPE (resolved_type)) != TYPE_CODE_VOID
756 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type)) != TYPE_CODE_CLASS)
757 error (_("Argument to dynamic_cast must be pointer to class or `void *'"));
759 class_type = check_typedef (TYPE_TARGET_TYPE (resolved_type));
760 if (TYPE_CODE (resolved_type) == TYPE_CODE_PTR)
762 if (TYPE_CODE (arg_type) != TYPE_CODE_PTR
763 && ! (TYPE_CODE (arg_type) == TYPE_CODE_INT
764 && value_as_long (arg) == 0))
765 error (_("Argument to dynamic_cast does not have pointer type"));
766 if (TYPE_CODE (arg_type) == TYPE_CODE_PTR)
768 arg_type = check_typedef (TYPE_TARGET_TYPE (arg_type));
769 if (TYPE_CODE (arg_type) != TYPE_CODE_CLASS)
770 error (_("Argument to dynamic_cast does "
771 "not have pointer to class type"));
774 /* Handle NULL pointers. */
775 if (value_as_long (arg) == 0)
776 return value_zero (type, not_lval);
778 arg = value_ind (arg);
782 if (TYPE_CODE (arg_type) != TYPE_CODE_CLASS)
783 error (_("Argument to dynamic_cast does not have class type"));
786 /* If the classes are the same, just return the argument. */
787 if (class_types_same_p (class_type, arg_type))
788 return value_cast (type, arg);
790 /* If the target type is a unique base class of the argument's
791 declared type, just cast it. */
792 if (is_ancestor (class_type, arg_type))
794 if (is_unique_ancestor (class_type, arg))
795 return value_cast (type, original_arg);
796 error (_("Ambiguous dynamic_cast"));
799 rtti_type = value_rtti_type (arg, &full, &top, &using_enc);
801 error (_("Couldn't determine value's most derived type for dynamic_cast"));
803 /* Compute the most derived object's address. */
804 addr = value_address (arg);
812 addr += top + value_embedded_offset (arg);
814 /* dynamic_cast<void *> means to return a pointer to the
815 most-derived object. */
816 if (TYPE_CODE (resolved_type) == TYPE_CODE_PTR
817 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type)) == TYPE_CODE_VOID)
818 return value_at_lazy (type, addr);
820 tem = value_at (type, addr);
822 /* The first dynamic check specified in 5.2.7. */
823 if (is_public_ancestor (arg_type, TYPE_TARGET_TYPE (resolved_type)))
825 if (class_types_same_p (rtti_type, TYPE_TARGET_TYPE (resolved_type)))
828 if (dynamic_cast_check_1 (TYPE_TARGET_TYPE (resolved_type),
829 value_contents_for_printing (tem),
830 value_embedded_offset (tem),
831 value_address (tem), tem,
835 return value_cast (type,
836 is_ref ? value_ref (result) : value_addr (result));
839 /* The second dynamic check specified in 5.2.7. */
841 if (is_public_ancestor (arg_type, rtti_type)
842 && dynamic_cast_check_2 (TYPE_TARGET_TYPE (resolved_type),
843 value_contents_for_printing (tem),
844 value_embedded_offset (tem),
845 value_address (tem), tem,
846 rtti_type, &result) == 1)
847 return value_cast (type,
848 is_ref ? value_ref (result) : value_addr (result));
850 if (TYPE_CODE (resolved_type) == TYPE_CODE_PTR)
851 return value_zero (type, not_lval);
853 error (_("dynamic_cast failed"));
856 /* Create a value of type TYPE that is zero, and return it. */
859 value_zero (struct type *type, enum lval_type lv)
861 struct value *val = allocate_value (type);
863 VALUE_LVAL (val) = (lv == lval_computed ? not_lval : lv);
867 /* Create a not_lval value of numeric type TYPE that is one, and return it. */
870 value_one (struct type *type)
872 struct type *type1 = check_typedef (type);
875 if (TYPE_CODE (type1) == TYPE_CODE_DECFLOAT)
877 enum bfd_endian byte_order = gdbarch_byte_order (get_type_arch (type));
880 decimal_from_string (v, TYPE_LENGTH (type), byte_order, "1");
881 val = value_from_decfloat (type, v);
883 else if (TYPE_CODE (type1) == TYPE_CODE_FLT)
885 val = value_from_double (type, (DOUBLEST) 1);
887 else if (is_integral_type (type1))
889 val = value_from_longest (type, (LONGEST) 1);
891 else if (TYPE_CODE (type1) == TYPE_CODE_ARRAY && TYPE_VECTOR (type1))
893 struct type *eltype = check_typedef (TYPE_TARGET_TYPE (type1));
895 LONGEST low_bound, high_bound;
898 if (!get_array_bounds (type1, &low_bound, &high_bound))
899 error (_("Could not determine the vector bounds"));
901 val = allocate_value (type);
902 for (i = 0; i < high_bound - low_bound + 1; i++)
904 tmp = value_one (eltype);
905 memcpy (value_contents_writeable (val) + i * TYPE_LENGTH (eltype),
906 value_contents_all (tmp), TYPE_LENGTH (eltype));
911 error (_("Not a numeric type."));
914 /* value_one result is never used for assignments to. */
915 gdb_assert (VALUE_LVAL (val) == not_lval);
920 /* Helper function for value_at, value_at_lazy, and value_at_lazy_stack. */
922 static struct value *
923 get_value_at (struct type *type, CORE_ADDR addr, int lazy)
927 if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
928 error (_("Attempt to dereference a generic pointer."));
930 val = value_from_contents_and_address (type, NULL, addr);
933 value_fetch_lazy (val);
938 /* Return a value with type TYPE located at ADDR.
940 Call value_at only if the data needs to be fetched immediately;
941 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
942 value_at_lazy instead. value_at_lazy simply records the address of
943 the data and sets the lazy-evaluation-required flag. The lazy flag
944 is tested in the value_contents macro, which is used if and when
945 the contents are actually required.
947 Note: value_at does *NOT* handle embedded offsets; perform such
948 adjustments before or after calling it. */
951 value_at (struct type *type, CORE_ADDR addr)
953 return get_value_at (type, addr, 0);
956 /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
959 value_at_lazy (struct type *type, CORE_ADDR addr)
961 return get_value_at (type, addr, 1);
964 /* Called only from the value_contents and value_contents_all()
965 macros, if the current data for a variable needs to be loaded into
966 value_contents(VAL). Fetches the data from the user's process, and
967 clears the lazy flag to indicate that the data in the buffer is
970 If the value is zero-length, we avoid calling read_memory, which
971 would abort. We mark the value as fetched anyway -- all 0 bytes of
974 This function returns a value because it is used in the
975 value_contents macro as part of an expression, where a void would
976 not work. The value is ignored. */
979 value_fetch_lazy (struct value *val)
981 gdb_assert (value_lazy (val));
982 allocate_value_contents (val);
983 if (value_bitsize (val))
985 /* To read a lazy bitfield, read the entire enclosing value. This
986 prevents reading the same block of (possibly volatile) memory once
987 per bitfield. It would be even better to read only the containing
988 word, but we have no way to record that just specific bits of a
989 value have been fetched. */
990 struct type *type = check_typedef (value_type (val));
991 enum bfd_endian byte_order = gdbarch_byte_order (get_type_arch (type));
992 struct value *parent = value_parent (val);
993 LONGEST offset = value_offset (val);
995 int length = TYPE_LENGTH (type);
997 if (!value_bits_valid (val,
998 TARGET_CHAR_BIT * offset + value_bitpos (val),
999 value_bitsize (val)))
1000 error (_("value has been optimized out"));
1002 if (!unpack_value_bits_as_long (value_type (val),
1003 value_contents_for_printing (parent),
1006 value_bitsize (val), parent, &num))
1007 mark_value_bytes_unavailable (val,
1008 value_embedded_offset (val),
1011 store_signed_integer (value_contents_raw (val), length,
1014 else if (VALUE_LVAL (val) == lval_memory)
1016 CORE_ADDR addr = value_address (val);
1017 int length = TYPE_LENGTH (check_typedef (value_enclosing_type (val)));
1020 read_value_memory (val, 0, value_stack (val),
1021 addr, value_contents_all_raw (val), length);
1023 else if (VALUE_LVAL (val) == lval_register)
1025 struct frame_info *frame;
1027 struct type *type = check_typedef (value_type (val));
1028 struct value *new_val = val, *mark = value_mark ();
1030 /* Offsets are not supported here; lazy register values must
1031 refer to the entire register. */
1032 gdb_assert (value_offset (val) == 0);
1034 while (VALUE_LVAL (new_val) == lval_register && value_lazy (new_val))
1036 frame = frame_find_by_id (VALUE_FRAME_ID (new_val));
1037 regnum = VALUE_REGNUM (new_val);
1039 gdb_assert (frame != NULL);
1041 /* Convertible register routines are used for multi-register
1042 values and for interpretation in different types
1043 (e.g. float or int from a double register). Lazy
1044 register values should have the register's natural type,
1045 so they do not apply. */
1046 gdb_assert (!gdbarch_convert_register_p (get_frame_arch (frame),
1049 new_val = get_frame_register_value (frame, regnum);
1052 /* If it's still lazy (for instance, a saved register on the
1053 stack), fetch it. */
1054 if (value_lazy (new_val))
1055 value_fetch_lazy (new_val);
1057 /* If the register was not saved, mark it optimized out. */
1058 if (value_optimized_out (new_val))
1059 set_value_optimized_out (val, 1);
1062 set_value_lazy (val, 0);
1063 value_contents_copy (val, value_embedded_offset (val),
1064 new_val, value_embedded_offset (new_val),
1065 TYPE_LENGTH (type));
1070 struct gdbarch *gdbarch;
1071 frame = frame_find_by_id (VALUE_FRAME_ID (val));
1072 regnum = VALUE_REGNUM (val);
1073 gdbarch = get_frame_arch (frame);
1075 fprintf_unfiltered (gdb_stdlog,
1076 "{ value_fetch_lazy "
1077 "(frame=%d,regnum=%d(%s),...) ",
1078 frame_relative_level (frame), regnum,
1079 user_reg_map_regnum_to_name (gdbarch, regnum));
1081 fprintf_unfiltered (gdb_stdlog, "->");
1082 if (value_optimized_out (new_val))
1083 fprintf_unfiltered (gdb_stdlog, " optimized out");
1087 const gdb_byte *buf = value_contents (new_val);
1089 if (VALUE_LVAL (new_val) == lval_register)
1090 fprintf_unfiltered (gdb_stdlog, " register=%d",
1091 VALUE_REGNUM (new_val));
1092 else if (VALUE_LVAL (new_val) == lval_memory)
1093 fprintf_unfiltered (gdb_stdlog, " address=%s",
1095 value_address (new_val)));
1097 fprintf_unfiltered (gdb_stdlog, " computed");
1099 fprintf_unfiltered (gdb_stdlog, " bytes=");
1100 fprintf_unfiltered (gdb_stdlog, "[");
1101 for (i = 0; i < register_size (gdbarch, regnum); i++)
1102 fprintf_unfiltered (gdb_stdlog, "%02x", buf[i]);
1103 fprintf_unfiltered (gdb_stdlog, "]");
1106 fprintf_unfiltered (gdb_stdlog, " }\n");
1109 /* Dispose of the intermediate values. This prevents
1110 watchpoints from trying to watch the saved frame pointer. */
1111 value_free_to_mark (mark);
1113 else if (VALUE_LVAL (val) == lval_computed
1114 && value_computed_funcs (val)->read != NULL)
1115 value_computed_funcs (val)->read (val);
1116 else if (value_optimized_out (val))
1117 /* Keep it optimized out. */;
1119 internal_error (__FILE__, __LINE__, _("Unexpected lazy value type."));
1121 set_value_lazy (val, 0);
1126 read_value_memory (struct value *val, int embedded_offset,
1127 int stack, CORE_ADDR memaddr,
1128 gdb_byte *buffer, size_t length)
1132 VEC(mem_range_s) *available_memory;
1134 if (get_traceframe_number () < 0
1135 || !traceframe_available_memory (&available_memory, memaddr, length))
1138 read_stack (memaddr, buffer, length);
1140 read_memory (memaddr, buffer, length);
1144 struct target_section_table *table;
1145 struct cleanup *old_chain;
1150 /* Fallback to reading from read-only sections. */
1151 table = target_get_section_table (&exec_ops);
1153 section_table_available_memory (available_memory,
1156 table->sections_end);
1158 old_chain = make_cleanup (VEC_cleanup(mem_range_s),
1161 normalize_mem_ranges (available_memory);
1163 /* Mark which bytes are unavailable, and read those which
1169 VEC_iterate (mem_range_s, available_memory, i, r);
1172 if (mem_ranges_overlap (r->start, r->length,
1175 CORE_ADDR lo1, hi1, lo2, hi2;
1176 CORE_ADDR start, end;
1178 /* Get the intersection window. */
1180 hi1 = memaddr + length;
1182 hi2 = r->start + r->length;
1183 start = max (lo1, lo2);
1184 end = min (hi1, hi2);
1186 gdb_assert (end - memaddr <= length);
1188 if (start > unavail)
1189 mark_value_bytes_unavailable (val,
1191 + unavail - memaddr),
1195 read_memory (start, buffer + start - memaddr, end - start);
1199 if (unavail != memaddr + length)
1200 mark_value_bytes_unavailable (val,
1201 embedded_offset + unavail - memaddr,
1202 (memaddr + length) - unavail);
1204 do_cleanups (old_chain);
1209 /* Store the contents of FROMVAL into the location of TOVAL.
1210 Return a new value with the location of TOVAL and contents of FROMVAL. */
1213 value_assign (struct value *toval, struct value *fromval)
1217 struct frame_id old_frame;
1219 if (!deprecated_value_modifiable (toval))
1220 error (_("Left operand of assignment is not a modifiable lvalue."));
1222 toval = coerce_ref (toval);
1224 type = value_type (toval);
1225 if (VALUE_LVAL (toval) != lval_internalvar)
1226 fromval = value_cast (type, fromval);
1229 /* Coerce arrays and functions to pointers, except for arrays
1230 which only live in GDB's storage. */
1231 if (!value_must_coerce_to_target (fromval))
1232 fromval = coerce_array (fromval);
1235 CHECK_TYPEDEF (type);
1237 /* Since modifying a register can trash the frame chain, and
1238 modifying memory can trash the frame cache, we save the old frame
1239 and then restore the new frame afterwards. */
1240 old_frame = get_frame_id (deprecated_safe_get_selected_frame ());
1242 switch (VALUE_LVAL (toval))
1244 case lval_internalvar:
1245 set_internalvar (VALUE_INTERNALVAR (toval), fromval);
1246 return value_of_internalvar (get_type_arch (type),
1247 VALUE_INTERNALVAR (toval));
1249 case lval_internalvar_component:
1250 set_internalvar_component (VALUE_INTERNALVAR (toval),
1251 value_offset (toval),
1252 value_bitpos (toval),
1253 value_bitsize (toval),
1259 const gdb_byte *dest_buffer;
1260 CORE_ADDR changed_addr;
1262 gdb_byte buffer[sizeof (LONGEST)];
1264 if (value_bitsize (toval))
1266 struct value *parent = value_parent (toval);
1268 changed_addr = value_address (parent) + value_offset (toval);
1269 changed_len = (value_bitpos (toval)
1270 + value_bitsize (toval)
1271 + HOST_CHAR_BIT - 1)
1274 /* If we can read-modify-write exactly the size of the
1275 containing type (e.g. short or int) then do so. This
1276 is safer for volatile bitfields mapped to hardware
1278 if (changed_len < TYPE_LENGTH (type)
1279 && TYPE_LENGTH (type) <= (int) sizeof (LONGEST)
1280 && ((LONGEST) changed_addr % TYPE_LENGTH (type)) == 0)
1281 changed_len = TYPE_LENGTH (type);
1283 if (changed_len > (int) sizeof (LONGEST))
1284 error (_("Can't handle bitfields which "
1285 "don't fit in a %d bit word."),
1286 (int) sizeof (LONGEST) * HOST_CHAR_BIT);
1288 read_memory (changed_addr, buffer, changed_len);
1289 modify_field (type, buffer, value_as_long (fromval),
1290 value_bitpos (toval), value_bitsize (toval));
1291 dest_buffer = buffer;
1295 changed_addr = value_address (toval);
1296 changed_len = TYPE_LENGTH (type);
1297 dest_buffer = value_contents (fromval);
1300 write_memory (changed_addr, dest_buffer, changed_len);
1301 observer_notify_memory_changed (changed_addr, changed_len,
1308 struct frame_info *frame;
1309 struct gdbarch *gdbarch;
1312 /* Figure out which frame this is in currently. */
1313 frame = frame_find_by_id (VALUE_FRAME_ID (toval));
1314 value_reg = VALUE_REGNUM (toval);
1317 error (_("Value being assigned to is no longer active."));
1319 gdbarch = get_frame_arch (frame);
1320 if (gdbarch_convert_register_p (gdbarch, VALUE_REGNUM (toval), type))
1322 /* If TOVAL is a special machine register requiring
1323 conversion of program values to a special raw
1325 gdbarch_value_to_register (gdbarch, frame,
1326 VALUE_REGNUM (toval), type,
1327 value_contents (fromval));
1331 if (value_bitsize (toval))
1333 struct value *parent = value_parent (toval);
1334 int offset = value_offset (parent) + value_offset (toval);
1336 gdb_byte buffer[sizeof (LONGEST)];
1339 changed_len = (value_bitpos (toval)
1340 + value_bitsize (toval)
1341 + HOST_CHAR_BIT - 1)
1344 if (changed_len > (int) sizeof (LONGEST))
1345 error (_("Can't handle bitfields which "
1346 "don't fit in a %d bit word."),
1347 (int) sizeof (LONGEST) * HOST_CHAR_BIT);
1349 if (!get_frame_register_bytes (frame, value_reg, offset,
1350 changed_len, buffer,
1354 error (_("value has been optimized out"));
1356 throw_error (NOT_AVAILABLE_ERROR,
1357 _("value is not available"));
1360 modify_field (type, buffer, value_as_long (fromval),
1361 value_bitpos (toval), value_bitsize (toval));
1363 put_frame_register_bytes (frame, value_reg, offset,
1364 changed_len, buffer);
1368 put_frame_register_bytes (frame, value_reg,
1369 value_offset (toval),
1371 value_contents (fromval));
1375 if (deprecated_register_changed_hook)
1376 deprecated_register_changed_hook (-1);
1377 observer_notify_target_changed (¤t_target);
1383 const struct lval_funcs *funcs = value_computed_funcs (toval);
1385 if (funcs->write != NULL)
1387 funcs->write (toval, fromval);
1394 error (_("Left operand of assignment is not an lvalue."));
1397 /* Assigning to the stack pointer, frame pointer, and other
1398 (architecture and calling convention specific) registers may
1399 cause the frame cache to be out of date. Assigning to memory
1400 also can. We just do this on all assignments to registers or
1401 memory, for simplicity's sake; I doubt the slowdown matters. */
1402 switch (VALUE_LVAL (toval))
1408 reinit_frame_cache ();
1410 /* Having destroyed the frame cache, restore the selected
1413 /* FIXME: cagney/2002-11-02: There has to be a better way of
1414 doing this. Instead of constantly saving/restoring the
1415 frame. Why not create a get_selected_frame() function that,
1416 having saved the selected frame's ID can automatically
1417 re-find the previously selected frame automatically. */
1420 struct frame_info *fi = frame_find_by_id (old_frame);
1431 /* If the field does not entirely fill a LONGEST, then zero the sign
1432 bits. If the field is signed, and is negative, then sign
1434 if ((value_bitsize (toval) > 0)
1435 && (value_bitsize (toval) < 8 * (int) sizeof (LONGEST)))
1437 LONGEST fieldval = value_as_long (fromval);
1438 LONGEST valmask = (((ULONGEST) 1) << value_bitsize (toval)) - 1;
1440 fieldval &= valmask;
1441 if (!TYPE_UNSIGNED (type)
1442 && (fieldval & (valmask ^ (valmask >> 1))))
1443 fieldval |= ~valmask;
1445 fromval = value_from_longest (type, fieldval);
1448 /* The return value is a copy of TOVAL so it shares its location
1449 information, but its contents are updated from FROMVAL. This
1450 implies the returned value is not lazy, even if TOVAL was. */
1451 val = value_copy (toval);
1452 set_value_lazy (val, 0);
1453 memcpy (value_contents_raw (val), value_contents (fromval),
1454 TYPE_LENGTH (type));
1456 /* We copy over the enclosing type and pointed-to offset from FROMVAL
1457 in the case of pointer types. For object types, the enclosing type
1458 and embedded offset must *not* be copied: the target object refered
1459 to by TOVAL retains its original dynamic type after assignment. */
1460 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1462 set_value_enclosing_type (val, value_enclosing_type (fromval));
1463 set_value_pointed_to_offset (val, value_pointed_to_offset (fromval));
1469 /* Extend a value VAL to COUNT repetitions of its type. */
1472 value_repeat (struct value *arg1, int count)
1476 if (VALUE_LVAL (arg1) != lval_memory)
1477 error (_("Only values in memory can be extended with '@'."));
1479 error (_("Invalid number %d of repetitions."), count);
1481 val = allocate_repeat_value (value_enclosing_type (arg1), count);
1483 VALUE_LVAL (val) = lval_memory;
1484 set_value_address (val, value_address (arg1));
1486 read_value_memory (val, 0, value_stack (val), value_address (val),
1487 value_contents_all_raw (val),
1488 TYPE_LENGTH (value_enclosing_type (val)));
1494 value_of_variable (struct symbol *var, struct block *b)
1496 struct frame_info *frame;
1498 if (!symbol_read_needs_frame (var))
1501 frame = get_selected_frame (_("No frame selected."));
1504 frame = block_innermost_frame (b);
1507 if (BLOCK_FUNCTION (b) && !block_inlined_p (b)
1508 && SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b)))
1509 error (_("No frame is currently executing in block %s."),
1510 SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b)));
1512 error (_("No frame is currently executing in specified block"));
1516 return read_var_value (var, frame);
1520 address_of_variable (struct symbol *var, struct block *b)
1522 struct type *type = SYMBOL_TYPE (var);
1525 /* Evaluate it first; if the result is a memory address, we're fine.
1526 Lazy evaluation pays off here. */
1528 val = value_of_variable (var, b);
1530 if ((VALUE_LVAL (val) == lval_memory && value_lazy (val))
1531 || TYPE_CODE (type) == TYPE_CODE_FUNC)
1533 CORE_ADDR addr = value_address (val);
1535 return value_from_pointer (lookup_pointer_type (type), addr);
1538 /* Not a memory address; check what the problem was. */
1539 switch (VALUE_LVAL (val))
1543 struct frame_info *frame;
1544 const char *regname;
1546 frame = frame_find_by_id (VALUE_FRAME_ID (val));
1549 regname = gdbarch_register_name (get_frame_arch (frame),
1550 VALUE_REGNUM (val));
1551 gdb_assert (regname && *regname);
1553 error (_("Address requested for identifier "
1554 "\"%s\" which is in register $%s"),
1555 SYMBOL_PRINT_NAME (var), regname);
1560 error (_("Can't take address of \"%s\" which isn't an lvalue."),
1561 SYMBOL_PRINT_NAME (var));
1568 /* Return one if VAL does not live in target memory, but should in order
1569 to operate on it. Otherwise return zero. */
1572 value_must_coerce_to_target (struct value *val)
1574 struct type *valtype;
1576 /* The only lval kinds which do not live in target memory. */
1577 if (VALUE_LVAL (val) != not_lval
1578 && VALUE_LVAL (val) != lval_internalvar)
1581 valtype = check_typedef (value_type (val));
1583 switch (TYPE_CODE (valtype))
1585 case TYPE_CODE_ARRAY:
1586 return TYPE_VECTOR (valtype) ? 0 : 1;
1587 case TYPE_CODE_STRING:
1594 /* Make sure that VAL lives in target memory if it's supposed to. For
1595 instance, strings are constructed as character arrays in GDB's
1596 storage, and this function copies them to the target. */
1599 value_coerce_to_target (struct value *val)
1604 if (!value_must_coerce_to_target (val))
1607 length = TYPE_LENGTH (check_typedef (value_type (val)));
1608 addr = allocate_space_in_inferior (length);
1609 write_memory (addr, value_contents (val), length);
1610 return value_at_lazy (value_type (val), addr);
1613 /* Given a value which is an array, return a value which is a pointer
1614 to its first element, regardless of whether or not the array has a
1615 nonzero lower bound.
1617 FIXME: A previous comment here indicated that this routine should
1618 be substracting the array's lower bound. It's not clear to me that
1619 this is correct. Given an array subscripting operation, it would
1620 certainly work to do the adjustment here, essentially computing:
1622 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
1624 However I believe a more appropriate and logical place to account
1625 for the lower bound is to do so in value_subscript, essentially
1628 (&array[0] + ((index - lowerbound) * sizeof array[0]))
1630 As further evidence consider what would happen with operations
1631 other than array subscripting, where the caller would get back a
1632 value that had an address somewhere before the actual first element
1633 of the array, and the information about the lower bound would be
1634 lost because of the coercion to pointer type. */
1637 value_coerce_array (struct value *arg1)
1639 struct type *type = check_typedef (value_type (arg1));
1641 /* If the user tries to do something requiring a pointer with an
1642 array that has not yet been pushed to the target, then this would
1643 be a good time to do so. */
1644 arg1 = value_coerce_to_target (arg1);
1646 if (VALUE_LVAL (arg1) != lval_memory)
1647 error (_("Attempt to take address of value not located in memory."));
1649 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
1650 value_address (arg1));
1653 /* Given a value which is a function, return a value which is a pointer
1657 value_coerce_function (struct value *arg1)
1659 struct value *retval;
1661 if (VALUE_LVAL (arg1) != lval_memory)
1662 error (_("Attempt to take address of value not located in memory."));
1664 retval = value_from_pointer (lookup_pointer_type (value_type (arg1)),
1665 value_address (arg1));
1669 /* Return a pointer value for the object for which ARG1 is the
1673 value_addr (struct value *arg1)
1676 struct type *type = check_typedef (value_type (arg1));
1678 if (TYPE_CODE (type) == TYPE_CODE_REF)
1680 /* Copy the value, but change the type from (T&) to (T*). We
1681 keep the same location information, which is efficient, and
1682 allows &(&X) to get the location containing the reference. */
1683 arg2 = value_copy (arg1);
1684 deprecated_set_value_type (arg2,
1685 lookup_pointer_type (TYPE_TARGET_TYPE (type)));
1688 if (TYPE_CODE (type) == TYPE_CODE_FUNC)
1689 return value_coerce_function (arg1);
1691 /* If this is an array that has not yet been pushed to the target,
1692 then this would be a good time to force it to memory. */
1693 arg1 = value_coerce_to_target (arg1);
1695 if (VALUE_LVAL (arg1) != lval_memory)
1696 error (_("Attempt to take address of value not located in memory."));
1698 /* Get target memory address. */
1699 arg2 = value_from_pointer (lookup_pointer_type (value_type (arg1)),
1700 (value_address (arg1)
1701 + value_embedded_offset (arg1)));
1703 /* This may be a pointer to a base subobject; so remember the
1704 full derived object's type ... */
1705 set_value_enclosing_type (arg2,
1706 lookup_pointer_type (value_enclosing_type (arg1)));
1707 /* ... and also the relative position of the subobject in the full
1709 set_value_pointed_to_offset (arg2, value_embedded_offset (arg1));
1713 /* Return a reference value for the object for which ARG1 is the
1717 value_ref (struct value *arg1)
1720 struct type *type = check_typedef (value_type (arg1));
1722 if (TYPE_CODE (type) == TYPE_CODE_REF)
1725 arg2 = value_addr (arg1);
1726 deprecated_set_value_type (arg2, lookup_reference_type (type));
1730 /* Given a value of a pointer type, apply the C unary * operator to
1734 value_ind (struct value *arg1)
1736 struct type *base_type;
1739 arg1 = coerce_array (arg1);
1741 base_type = check_typedef (value_type (arg1));
1743 if (VALUE_LVAL (arg1) == lval_computed)
1745 const struct lval_funcs *funcs = value_computed_funcs (arg1);
1747 if (funcs->indirect)
1749 struct value *result = funcs->indirect (arg1);
1756 if (TYPE_CODE (base_type) == TYPE_CODE_PTR)
1758 struct type *enc_type;
1760 /* We may be pointing to something embedded in a larger object.
1761 Get the real type of the enclosing object. */
1762 enc_type = check_typedef (value_enclosing_type (arg1));
1763 enc_type = TYPE_TARGET_TYPE (enc_type);
1765 if (TYPE_CODE (check_typedef (enc_type)) == TYPE_CODE_FUNC
1766 || TYPE_CODE (check_typedef (enc_type)) == TYPE_CODE_METHOD)
1767 /* For functions, go through find_function_addr, which knows
1768 how to handle function descriptors. */
1769 arg2 = value_at_lazy (enc_type,
1770 find_function_addr (arg1, NULL));
1772 /* Retrieve the enclosing object pointed to. */
1773 arg2 = value_at_lazy (enc_type,
1774 (value_as_address (arg1)
1775 - value_pointed_to_offset (arg1)));
1777 /* Re-adjust type. */
1778 deprecated_set_value_type (arg2, TYPE_TARGET_TYPE (base_type));
1779 /* Add embedding info. */
1780 set_value_enclosing_type (arg2, enc_type);
1781 set_value_embedded_offset (arg2, value_pointed_to_offset (arg1));
1783 /* We may be pointing to an object of some derived type. */
1784 arg2 = value_full_object (arg2, NULL, 0, 0, 0);
1788 error (_("Attempt to take contents of a non-pointer value."));
1789 return 0; /* For lint -- never reached. */
1792 /* Create a value for an array by allocating space in GDB, copying the
1793 data into that space, and then setting up an array value.
1795 The array bounds are set from LOWBOUND and HIGHBOUND, and the array
1796 is populated from the values passed in ELEMVEC.
1798 The element type of the array is inherited from the type of the
1799 first element, and all elements must have the same size (though we
1800 don't currently enforce any restriction on their types). */
1803 value_array (int lowbound, int highbound, struct value **elemvec)
1807 unsigned int typelength;
1809 struct type *arraytype;
1811 /* Validate that the bounds are reasonable and that each of the
1812 elements have the same size. */
1814 nelem = highbound - lowbound + 1;
1817 error (_("bad array bounds (%d, %d)"), lowbound, highbound);
1819 typelength = TYPE_LENGTH (value_enclosing_type (elemvec[0]));
1820 for (idx = 1; idx < nelem; idx++)
1822 if (TYPE_LENGTH (value_enclosing_type (elemvec[idx])) != typelength)
1824 error (_("array elements must all be the same size"));
1828 arraytype = lookup_array_range_type (value_enclosing_type (elemvec[0]),
1829 lowbound, highbound);
1831 if (!current_language->c_style_arrays)
1833 val = allocate_value (arraytype);
1834 for (idx = 0; idx < nelem; idx++)
1835 value_contents_copy (val, idx * typelength, elemvec[idx], 0,
1840 /* Allocate space to store the array, and then initialize it by
1841 copying in each element. */
1843 val = allocate_value (arraytype);
1844 for (idx = 0; idx < nelem; idx++)
1845 value_contents_copy (val, idx * typelength, elemvec[idx], 0, typelength);
1850 value_cstring (char *ptr, int len, struct type *char_type)
1853 int lowbound = current_language->string_lower_bound;
1854 int highbound = len / TYPE_LENGTH (char_type);
1855 struct type *stringtype
1856 = lookup_array_range_type (char_type, lowbound, highbound + lowbound - 1);
1858 val = allocate_value (stringtype);
1859 memcpy (value_contents_raw (val), ptr, len);
1863 /* Create a value for a string constant by allocating space in the
1864 inferior, copying the data into that space, and returning the
1865 address with type TYPE_CODE_STRING. PTR points to the string
1866 constant data; LEN is number of characters.
1868 Note that string types are like array of char types with a lower
1869 bound of zero and an upper bound of LEN - 1. Also note that the
1870 string may contain embedded null bytes. */
1873 value_string (char *ptr, int len, struct type *char_type)
1876 int lowbound = current_language->string_lower_bound;
1877 int highbound = len / TYPE_LENGTH (char_type);
1878 struct type *stringtype
1879 = lookup_string_range_type (char_type, lowbound, highbound + lowbound - 1);
1881 val = allocate_value (stringtype);
1882 memcpy (value_contents_raw (val), ptr, len);
1887 value_bitstring (char *ptr, int len, struct type *index_type)
1890 struct type *domain_type
1891 = create_range_type (NULL, index_type, 0, len - 1);
1892 struct type *type = create_set_type (NULL, domain_type);
1894 TYPE_CODE (type) = TYPE_CODE_BITSTRING;
1895 val = allocate_value (type);
1896 memcpy (value_contents_raw (val), ptr, TYPE_LENGTH (type));
1900 /* See if we can pass arguments in T2 to a function which takes
1901 arguments of types T1. T1 is a list of NARGS arguments, and T2 is
1902 a NULL-terminated vector. If some arguments need coercion of some
1903 sort, then the coerced values are written into T2. Return value is
1904 0 if the arguments could be matched, or the position at which they
1907 STATICP is nonzero if the T1 argument list came from a static
1908 member function. T2 will still include the ``this'' pointer, but
1911 For non-static member functions, we ignore the first argument,
1912 which is the type of the instance variable. This is because we
1913 want to handle calls with objects from derived classes. This is
1914 not entirely correct: we should actually check to make sure that a
1915 requested operation is type secure, shouldn't we? FIXME. */
1918 typecmp (int staticp, int varargs, int nargs,
1919 struct field t1[], struct value *t2[])
1924 internal_error (__FILE__, __LINE__,
1925 _("typecmp: no argument list"));
1927 /* Skip ``this'' argument if applicable. T2 will always include
1933 (i < nargs) && TYPE_CODE (t1[i].type) != TYPE_CODE_VOID;
1936 struct type *tt1, *tt2;
1941 tt1 = check_typedef (t1[i].type);
1942 tt2 = check_typedef (value_type (t2[i]));
1944 if (TYPE_CODE (tt1) == TYPE_CODE_REF
1945 /* We should be doing hairy argument matching, as below. */
1946 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1)))
1947 == TYPE_CODE (tt2)))
1949 if (TYPE_CODE (tt2) == TYPE_CODE_ARRAY)
1950 t2[i] = value_coerce_array (t2[i]);
1952 t2[i] = value_ref (t2[i]);
1956 /* djb - 20000715 - Until the new type structure is in the
1957 place, and we can attempt things like implicit conversions,
1958 we need to do this so you can take something like a map<const
1959 char *>, and properly access map["hello"], because the
1960 argument to [] will be a reference to a pointer to a char,
1961 and the argument will be a pointer to a char. */
1962 while (TYPE_CODE(tt1) == TYPE_CODE_REF
1963 || TYPE_CODE (tt1) == TYPE_CODE_PTR)
1965 tt1 = check_typedef( TYPE_TARGET_TYPE(tt1) );
1967 while (TYPE_CODE(tt2) == TYPE_CODE_ARRAY
1968 || TYPE_CODE(tt2) == TYPE_CODE_PTR
1969 || TYPE_CODE(tt2) == TYPE_CODE_REF)
1971 tt2 = check_typedef (TYPE_TARGET_TYPE(tt2));
1973 if (TYPE_CODE (tt1) == TYPE_CODE (tt2))
1975 /* Array to pointer is a `trivial conversion' according to the
1978 /* We should be doing much hairier argument matching (see
1979 section 13.2 of the ARM), but as a quick kludge, just check
1980 for the same type code. */
1981 if (TYPE_CODE (t1[i].type) != TYPE_CODE (value_type (t2[i])))
1984 if (varargs || t2[i] == NULL)
1989 /* Helper function used by value_struct_elt to recurse through
1990 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1991 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1992 TYPE. If found, return value, else return NULL.
1994 If LOOKING_FOR_BASECLASS, then instead of looking for struct
1995 fields, look for a baseclass named NAME. */
1997 static struct value *
1998 search_struct_field (const char *name, struct value *arg1, int offset,
1999 struct type *type, int looking_for_baseclass)
2004 CHECK_TYPEDEF (type);
2005 nbases = TYPE_N_BASECLASSES (type);
2007 if (!looking_for_baseclass)
2008 for (i = TYPE_NFIELDS (type) - 1; i >= nbases; i--)
2010 char *t_field_name = TYPE_FIELD_NAME (type, i);
2012 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
2016 if (field_is_static (&TYPE_FIELD (type, i)))
2018 v = value_static_field (type, i);
2020 error (_("field %s is nonexistent or "
2021 "has been optimized out"),
2026 v = value_primitive_field (arg1, offset, i, type);
2028 error (_("there is no field named %s"), name);
2034 && (t_field_name[0] == '\0'
2035 || (TYPE_CODE (type) == TYPE_CODE_UNION
2036 && (strcmp_iw (t_field_name, "else") == 0))))
2038 struct type *field_type = TYPE_FIELD_TYPE (type, i);
2040 if (TYPE_CODE (field_type) == TYPE_CODE_UNION
2041 || TYPE_CODE (field_type) == TYPE_CODE_STRUCT)
2043 /* Look for a match through the fields of an anonymous
2044 union, or anonymous struct. C++ provides anonymous
2047 In the GNU Chill (now deleted from GDB)
2048 implementation of variant record types, each
2049 <alternative field> has an (anonymous) union type,
2050 each member of the union represents a <variant
2051 alternative>. Each <variant alternative> is
2052 represented as a struct, with a member for each
2056 int new_offset = offset;
2058 /* This is pretty gross. In G++, the offset in an
2059 anonymous union is relative to the beginning of the
2060 enclosing struct. In the GNU Chill (now deleted
2061 from GDB) implementation of variant records, the
2062 bitpos is zero in an anonymous union field, so we
2063 have to add the offset of the union here. */
2064 if (TYPE_CODE (field_type) == TYPE_CODE_STRUCT
2065 || (TYPE_NFIELDS (field_type) > 0
2066 && TYPE_FIELD_BITPOS (field_type, 0) == 0))
2067 new_offset += TYPE_FIELD_BITPOS (type, i) / 8;
2069 v = search_struct_field (name, arg1, new_offset,
2071 looking_for_baseclass);
2078 for (i = 0; i < nbases; i++)
2081 struct type *basetype = check_typedef (TYPE_BASECLASS (type, i));
2082 /* If we are looking for baseclasses, this is what we get when
2083 we hit them. But it could happen that the base part's member
2084 name is not yet filled in. */
2085 int found_baseclass = (looking_for_baseclass
2086 && TYPE_BASECLASS_NAME (type, i) != NULL
2087 && (strcmp_iw (name,
2088 TYPE_BASECLASS_NAME (type,
2091 if (BASETYPE_VIA_VIRTUAL (type, i))
2096 boffset = baseclass_offset (type, i,
2097 value_contents_for_printing (arg1),
2098 value_embedded_offset (arg1) + offset,
2099 value_address (arg1),
2102 /* The virtual base class pointer might have been clobbered
2103 by the user program. Make sure that it still points to a
2104 valid memory location. */
2106 boffset += value_embedded_offset (arg1) + offset;
2108 || boffset >= TYPE_LENGTH (value_enclosing_type (arg1)))
2110 CORE_ADDR base_addr;
2112 v2 = allocate_value (basetype);
2113 base_addr = value_address (arg1) + boffset;
2114 if (target_read_memory (base_addr,
2115 value_contents_raw (v2),
2116 TYPE_LENGTH (basetype)) != 0)
2117 error (_("virtual baseclass botch"));
2118 VALUE_LVAL (v2) = lval_memory;
2119 set_value_address (v2, base_addr);
2123 v2 = value_copy (arg1);
2124 deprecated_set_value_type (v2, basetype);
2125 set_value_embedded_offset (v2, boffset);
2128 if (found_baseclass)
2130 v = search_struct_field (name, v2, 0,
2131 TYPE_BASECLASS (type, i),
2132 looking_for_baseclass);
2134 else if (found_baseclass)
2135 v = value_primitive_field (arg1, offset, i, type);
2137 v = search_struct_field (name, arg1,
2138 offset + TYPE_BASECLASS_BITPOS (type,
2140 basetype, looking_for_baseclass);
2147 /* Helper function used by value_struct_elt to recurse through
2148 baseclasses. Look for a field NAME in ARG1. Adjust the address of
2149 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
2152 If found, return value, else if name matched and args not return
2153 (value) -1, else return NULL. */
2155 static struct value *
2156 search_struct_method (const char *name, struct value **arg1p,
2157 struct value **args, int offset,
2158 int *static_memfuncp, struct type *type)
2162 int name_matched = 0;
2163 char dem_opname[64];
2165 CHECK_TYPEDEF (type);
2166 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
2168 char *t_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
2170 /* FIXME! May need to check for ARM demangling here. */
2171 if (strncmp (t_field_name, "__", 2) == 0 ||
2172 strncmp (t_field_name, "op", 2) == 0 ||
2173 strncmp (t_field_name, "type", 4) == 0)
2175 if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI))
2176 t_field_name = dem_opname;
2177 else if (cplus_demangle_opname (t_field_name, dem_opname, 0))
2178 t_field_name = dem_opname;
2180 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
2182 int j = TYPE_FN_FIELDLIST_LENGTH (type, i) - 1;
2183 struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i);
2186 check_stub_method_group (type, i);
2187 if (j > 0 && args == 0)
2188 error (_("cannot resolve overloaded method "
2189 "`%s': no arguments supplied"), name);
2190 else if (j == 0 && args == 0)
2192 v = value_fn_field (arg1p, f, j, type, offset);
2199 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f, j),
2200 TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f, j)),
2201 TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f, j)),
2202 TYPE_FN_FIELD_ARGS (f, j), args))
2204 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
2205 return value_virtual_fn_field (arg1p, f, j,
2207 if (TYPE_FN_FIELD_STATIC_P (f, j)
2209 *static_memfuncp = 1;
2210 v = value_fn_field (arg1p, f, j, type, offset);
2219 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2225 if (BASETYPE_VIA_VIRTUAL (type, i))
2227 struct type *baseclass = check_typedef (TYPE_BASECLASS (type, i));
2228 struct value *base_val;
2229 const gdb_byte *base_valaddr;
2231 /* The virtual base class pointer might have been
2232 clobbered by the user program. Make sure that it
2233 still points to a valid memory location. */
2235 if (offset < 0 || offset >= TYPE_LENGTH (type))
2237 gdb_byte *tmp = alloca (TYPE_LENGTH (baseclass));
2238 CORE_ADDR address = value_address (*arg1p);
2240 if (target_read_memory (address + offset,
2241 tmp, TYPE_LENGTH (baseclass)) != 0)
2242 error (_("virtual baseclass botch"));
2244 base_val = value_from_contents_and_address (baseclass,
2247 base_valaddr = value_contents_for_printing (base_val);
2253 base_valaddr = value_contents_for_printing (*arg1p);
2254 this_offset = offset;
2257 base_offset = baseclass_offset (type, i, base_valaddr,
2258 this_offset, value_address (base_val),
2263 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
2265 v = search_struct_method (name, arg1p, args, base_offset + offset,
2266 static_memfuncp, TYPE_BASECLASS (type, i));
2267 if (v == (struct value *) - 1)
2273 /* FIXME-bothner: Why is this commented out? Why is it here? */
2274 /* *arg1p = arg1_tmp; */
2279 return (struct value *) - 1;
2284 /* Given *ARGP, a value of type (pointer to a)* structure/union,
2285 extract the component named NAME from the ultimate target
2286 structure/union and return it as a value with its appropriate type.
2287 ERR is used in the error message if *ARGP's type is wrong.
2289 C++: ARGS is a list of argument types to aid in the selection of
2290 an appropriate method. Also, handle derived types.
2292 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
2293 where the truthvalue of whether the function that was resolved was
2294 a static member function or not is stored.
2296 ERR is an error message to be printed in case the field is not
2300 value_struct_elt (struct value **argp, struct value **args,
2301 const char *name, int *static_memfuncp, const char *err)
2306 *argp = coerce_array (*argp);
2308 t = check_typedef (value_type (*argp));
2310 /* Follow pointers until we get to a non-pointer. */
2312 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
2314 *argp = value_ind (*argp);
2315 /* Don't coerce fn pointer to fn and then back again! */
2316 if (TYPE_CODE (value_type (*argp)) != TYPE_CODE_FUNC)
2317 *argp = coerce_array (*argp);
2318 t = check_typedef (value_type (*argp));
2321 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2322 && TYPE_CODE (t) != TYPE_CODE_UNION)
2323 error (_("Attempt to extract a component of a value that is not a %s."),
2326 /* Assume it's not, unless we see that it is. */
2327 if (static_memfuncp)
2328 *static_memfuncp = 0;
2332 /* if there are no arguments ...do this... */
2334 /* Try as a field first, because if we succeed, there is less
2336 v = search_struct_field (name, *argp, 0, t, 0);
2340 /* C++: If it was not found as a data field, then try to
2341 return it as a pointer to a method. */
2342 v = search_struct_method (name, argp, args, 0,
2343 static_memfuncp, t);
2345 if (v == (struct value *) - 1)
2346 error (_("Cannot take address of method %s."), name);
2349 if (TYPE_NFN_FIELDS (t))
2350 error (_("There is no member or method named %s."), name);
2352 error (_("There is no member named %s."), name);
2357 v = search_struct_method (name, argp, args, 0,
2358 static_memfuncp, t);
2360 if (v == (struct value *) - 1)
2362 error (_("One of the arguments you tried to pass to %s could not "
2363 "be converted to what the function wants."), name);
2367 /* See if user tried to invoke data as function. If so, hand it
2368 back. If it's not callable (i.e., a pointer to function),
2369 gdb should give an error. */
2370 v = search_struct_field (name, *argp, 0, t, 0);
2371 /* If we found an ordinary field, then it is not a method call.
2372 So, treat it as if it were a static member function. */
2373 if (v && static_memfuncp)
2374 *static_memfuncp = 1;
2378 throw_error (NOT_FOUND_ERROR,
2379 _("Structure has no component named %s."), name);
2383 /* Search through the methods of an object (and its bases) to find a
2384 specified method. Return the pointer to the fn_field list of
2385 overloaded instances.
2387 Helper function for value_find_oload_list.
2388 ARGP is a pointer to a pointer to a value (the object).
2389 METHOD is a string containing the method name.
2390 OFFSET is the offset within the value.
2391 TYPE is the assumed type of the object.
2392 NUM_FNS is the number of overloaded instances.
2393 BASETYPE is set to the actual type of the subobject where the
2395 BOFFSET is the offset of the base subobject where the method is found. */
2397 static struct fn_field *
2398 find_method_list (struct value **argp, const char *method,
2399 int offset, struct type *type, int *num_fns,
2400 struct type **basetype, int *boffset)
2404 CHECK_TYPEDEF (type);
2408 /* First check in object itself. */
2409 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
2411 /* pai: FIXME What about operators and type conversions? */
2412 char *fn_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
2414 if (fn_field_name && (strcmp_iw (fn_field_name, method) == 0))
2416 int len = TYPE_FN_FIELDLIST_LENGTH (type, i);
2417 struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i);
2423 /* Resolve any stub methods. */
2424 check_stub_method_group (type, i);
2430 /* Not found in object, check in base subobjects. */
2431 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2435 if (BASETYPE_VIA_VIRTUAL (type, i))
2437 base_offset = baseclass_offset (type, i,
2438 value_contents_for_printing (*argp),
2439 value_offset (*argp) + offset,
2440 value_address (*argp), *argp);
2442 else /* Non-virtual base, simply use bit position from debug
2445 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
2447 f = find_method_list (argp, method, base_offset + offset,
2448 TYPE_BASECLASS (type, i), num_fns,
2456 /* Return the list of overloaded methods of a specified name.
2458 ARGP is a pointer to a pointer to a value (the object).
2459 METHOD is the method name.
2460 OFFSET is the offset within the value contents.
2461 NUM_FNS is the number of overloaded instances.
2462 BASETYPE is set to the type of the base subobject that defines the
2464 BOFFSET is the offset of the base subobject which defines the method. */
2467 value_find_oload_method_list (struct value **argp, const char *method,
2468 int offset, int *num_fns,
2469 struct type **basetype, int *boffset)
2473 t = check_typedef (value_type (*argp));
2475 /* Code snarfed from value_struct_elt. */
2476 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
2478 *argp = value_ind (*argp);
2479 /* Don't coerce fn pointer to fn and then back again! */
2480 if (TYPE_CODE (value_type (*argp)) != TYPE_CODE_FUNC)
2481 *argp = coerce_array (*argp);
2482 t = check_typedef (value_type (*argp));
2485 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2486 && TYPE_CODE (t) != TYPE_CODE_UNION)
2487 error (_("Attempt to extract a component of a "
2488 "value that is not a struct or union"));
2490 return find_method_list (argp, method, 0, t, num_fns,
2494 /* Given an array of arguments (ARGS) (which includes an
2495 entry for "this" in the case of C++ methods), the number of
2496 arguments NARGS, the NAME of a function whether it's a method or
2497 not (METHOD), and the degree of laxness (LAX) in conforming to
2498 overload resolution rules in ANSI C++, find the best function that
2499 matches on the argument types according to the overload resolution
2502 METHOD can be one of three values:
2503 NON_METHOD for non-member functions.
2504 METHOD: for member functions.
2505 BOTH: used for overload resolution of operators where the
2506 candidates are expected to be either member or non member
2507 functions. In this case the first argument ARGTYPES
2508 (representing 'this') is expected to be a reference to the
2509 target object, and will be dereferenced when attempting the
2512 In the case of class methods, the parameter OBJ is an object value
2513 in which to search for overloaded methods.
2515 In the case of non-method functions, the parameter FSYM is a symbol
2516 corresponding to one of the overloaded functions.
2518 Return value is an integer: 0 -> good match, 10 -> debugger applied
2519 non-standard coercions, 100 -> incompatible.
2521 If a method is being searched for, VALP will hold the value.
2522 If a non-method is being searched for, SYMP will hold the symbol
2525 If a method is being searched for, and it is a static method,
2526 then STATICP will point to a non-zero value.
2528 If NO_ADL argument dependent lookup is disabled. This is used to prevent
2529 ADL overload candidates when performing overload resolution for a fully
2532 Note: This function does *not* check the value of
2533 overload_resolution. Caller must check it to see whether overload
2534 resolution is permitted. */
2537 find_overload_match (struct value **args, int nargs,
2538 const char *name, enum oload_search_type method,
2539 int lax, struct value **objp, struct symbol *fsym,
2540 struct value **valp, struct symbol **symp,
2541 int *staticp, const int no_adl)
2543 struct value *obj = (objp ? *objp : NULL);
2544 struct type *obj_type = obj ? value_type (obj) : NULL;
2545 /* Index of best overloaded function. */
2546 int func_oload_champ = -1;
2547 int method_oload_champ = -1;
2549 /* The measure for the current best match. */
2550 struct badness_vector *method_badness = NULL;
2551 struct badness_vector *func_badness = NULL;
2553 struct value *temp = obj;
2554 /* For methods, the list of overloaded methods. */
2555 struct fn_field *fns_ptr = NULL;
2556 /* For non-methods, the list of overloaded function symbols. */
2557 struct symbol **oload_syms = NULL;
2558 /* Number of overloaded instances being considered. */
2560 struct type *basetype = NULL;
2563 struct cleanup *all_cleanups = make_cleanup (null_cleanup, NULL);
2565 const char *obj_type_name = NULL;
2566 const char *func_name = NULL;
2567 enum oload_classification match_quality;
2568 enum oload_classification method_match_quality = INCOMPATIBLE;
2569 enum oload_classification func_match_quality = INCOMPATIBLE;
2571 /* Get the list of overloaded methods or functions. */
2572 if (method == METHOD || method == BOTH)
2576 /* OBJ may be a pointer value rather than the object itself. */
2577 obj = coerce_ref (obj);
2578 while (TYPE_CODE (check_typedef (value_type (obj))) == TYPE_CODE_PTR)
2579 obj = coerce_ref (value_ind (obj));
2580 obj_type_name = TYPE_NAME (value_type (obj));
2582 /* First check whether this is a data member, e.g. a pointer to
2584 if (TYPE_CODE (check_typedef (value_type (obj))) == TYPE_CODE_STRUCT)
2586 *valp = search_struct_field (name, obj, 0,
2587 check_typedef (value_type (obj)), 0);
2591 do_cleanups (all_cleanups);
2596 /* Retrieve the list of methods with the name NAME. */
2597 fns_ptr = value_find_oload_method_list (&temp, name,
2599 &basetype, &boffset);
2600 /* If this is a method only search, and no methods were found
2601 the search has faild. */
2602 if (method == METHOD && (!fns_ptr || !num_fns))
2603 error (_("Couldn't find method %s%s%s"),
2605 (obj_type_name && *obj_type_name) ? "::" : "",
2607 /* If we are dealing with stub method types, they should have
2608 been resolved by find_method_list via
2609 value_find_oload_method_list above. */
2612 gdb_assert (TYPE_DOMAIN_TYPE (fns_ptr[0].type) != NULL);
2613 method_oload_champ = find_oload_champ (args, nargs, method,
2615 oload_syms, &method_badness);
2617 method_match_quality =
2618 classify_oload_match (method_badness, nargs,
2619 oload_method_static (method, fns_ptr,
2620 method_oload_champ));
2622 make_cleanup (xfree, method_badness);
2627 if (method == NON_METHOD || method == BOTH)
2629 const char *qualified_name = NULL;
2631 /* If the overload match is being search for both as a method
2632 and non member function, the first argument must now be
2635 deprecated_set_value_type (args[0],
2636 TYPE_TARGET_TYPE (value_type (args[0])));
2640 qualified_name = SYMBOL_NATURAL_NAME (fsym);
2642 /* If we have a function with a C++ name, try to extract just
2643 the function part. Do not try this for non-functions (e.g.
2644 function pointers). */
2646 && TYPE_CODE (check_typedef (SYMBOL_TYPE (fsym)))
2651 temp = cp_func_name (qualified_name);
2653 /* If cp_func_name did not remove anything, the name of the
2654 symbol did not include scope or argument types - it was
2655 probably a C-style function. */
2658 make_cleanup (xfree, temp);
2659 if (strcmp (temp, qualified_name) == 0)
2669 qualified_name = name;
2672 /* If there was no C++ name, this must be a C-style function or
2673 not a function at all. Just return the same symbol. Do the
2674 same if cp_func_name fails for some reason. */
2675 if (func_name == NULL)
2678 do_cleanups (all_cleanups);
2682 func_oload_champ = find_oload_champ_namespace (args, nargs,
2689 if (func_oload_champ >= 0)
2690 func_match_quality = classify_oload_match (func_badness, nargs, 0);
2692 make_cleanup (xfree, oload_syms);
2693 make_cleanup (xfree, func_badness);
2696 /* Did we find a match ? */
2697 if (method_oload_champ == -1 && func_oload_champ == -1)
2698 throw_error (NOT_FOUND_ERROR,
2699 _("No symbol \"%s\" in current context."),
2702 /* If we have found both a method match and a function
2703 match, find out which one is better, and calculate match
2705 if (method_oload_champ >= 0 && func_oload_champ >= 0)
2707 switch (compare_badness (func_badness, method_badness))
2709 case 0: /* Top two contenders are equally good. */
2710 /* FIXME: GDB does not support the general ambiguous case.
2711 All candidates should be collected and presented the
2713 error (_("Ambiguous overload resolution"));
2715 case 1: /* Incomparable top contenders. */
2716 /* This is an error incompatible candidates
2717 should not have been proposed. */
2718 error (_("Internal error: incompatible "
2719 "overload candidates proposed"));
2721 case 2: /* Function champion. */
2722 method_oload_champ = -1;
2723 match_quality = func_match_quality;
2725 case 3: /* Method champion. */
2726 func_oload_champ = -1;
2727 match_quality = method_match_quality;
2730 error (_("Internal error: unexpected overload comparison result"));
2736 /* We have either a method match or a function match. */
2737 if (method_oload_champ >= 0)
2738 match_quality = method_match_quality;
2740 match_quality = func_match_quality;
2743 if (match_quality == INCOMPATIBLE)
2745 if (method == METHOD)
2746 error (_("Cannot resolve method %s%s%s to any overloaded instance"),
2748 (obj_type_name && *obj_type_name) ? "::" : "",
2751 error (_("Cannot resolve function %s to any overloaded instance"),
2754 else if (match_quality == NON_STANDARD)
2756 if (method == METHOD)
2757 warning (_("Using non-standard conversion to match "
2758 "method %s%s%s to supplied arguments"),
2760 (obj_type_name && *obj_type_name) ? "::" : "",
2763 warning (_("Using non-standard conversion to match "
2764 "function %s to supplied arguments"),
2768 if (staticp != NULL)
2769 *staticp = oload_method_static (method, fns_ptr, method_oload_champ);
2771 if (method_oload_champ >= 0)
2773 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr, method_oload_champ))
2774 *valp = value_virtual_fn_field (&temp, fns_ptr, method_oload_champ,
2777 *valp = value_fn_field (&temp, fns_ptr, method_oload_champ,
2781 *symp = oload_syms[func_oload_champ];
2785 struct type *temp_type = check_typedef (value_type (temp));
2786 struct type *objtype = check_typedef (obj_type);
2788 if (TYPE_CODE (temp_type) != TYPE_CODE_PTR
2789 && (TYPE_CODE (objtype) == TYPE_CODE_PTR
2790 || TYPE_CODE (objtype) == TYPE_CODE_REF))
2792 temp = value_addr (temp);
2797 do_cleanups (all_cleanups);
2799 switch (match_quality)
2805 default: /* STANDARD */
2810 /* Find the best overload match, searching for FUNC_NAME in namespaces
2811 contained in QUALIFIED_NAME until it either finds a good match or
2812 runs out of namespaces. It stores the overloaded functions in
2813 *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. The
2814 calling function is responsible for freeing *OLOAD_SYMS and
2815 *OLOAD_CHAMP_BV. If NO_ADL, argument dependent lookup is not
2819 find_oload_champ_namespace (struct value **args, int nargs,
2820 const char *func_name,
2821 const char *qualified_name,
2822 struct symbol ***oload_syms,
2823 struct badness_vector **oload_champ_bv,
2828 find_oload_champ_namespace_loop (args, nargs,
2831 oload_syms, oload_champ_bv,
2838 /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is
2839 how deep we've looked for namespaces, and the champ is stored in
2840 OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0
2841 if it isn't. Other arguments are the same as in
2842 find_oload_champ_namespace
2844 It is the caller's responsibility to free *OLOAD_SYMS and
2848 find_oload_champ_namespace_loop (struct value **args, int nargs,
2849 const char *func_name,
2850 const char *qualified_name,
2852 struct symbol ***oload_syms,
2853 struct badness_vector **oload_champ_bv,
2857 int next_namespace_len = namespace_len;
2858 int searched_deeper = 0;
2860 struct cleanup *old_cleanups;
2861 int new_oload_champ;
2862 struct symbol **new_oload_syms;
2863 struct badness_vector *new_oload_champ_bv;
2864 char *new_namespace;
2866 if (next_namespace_len != 0)
2868 gdb_assert (qualified_name[next_namespace_len] == ':');
2869 next_namespace_len += 2;
2871 next_namespace_len +=
2872 cp_find_first_component (qualified_name + next_namespace_len);
2874 /* Initialize these to values that can safely be xfree'd. */
2876 *oload_champ_bv = NULL;
2878 /* First, see if we have a deeper namespace we can search in.
2879 If we get a good match there, use it. */
2881 if (qualified_name[next_namespace_len] == ':')
2883 searched_deeper = 1;
2885 if (find_oload_champ_namespace_loop (args, nargs,
2886 func_name, qualified_name,
2888 oload_syms, oload_champ_bv,
2889 oload_champ, no_adl))
2895 /* If we reach here, either we're in the deepest namespace or we
2896 didn't find a good match in a deeper namespace. But, in the
2897 latter case, we still have a bad match in a deeper namespace;
2898 note that we might not find any match at all in the current
2899 namespace. (There's always a match in the deepest namespace,
2900 because this overload mechanism only gets called if there's a
2901 function symbol to start off with.) */
2903 old_cleanups = make_cleanup (xfree, *oload_syms);
2904 make_cleanup (xfree, *oload_champ_bv);
2905 new_namespace = alloca (namespace_len + 1);
2906 strncpy (new_namespace, qualified_name, namespace_len);
2907 new_namespace[namespace_len] = '\0';
2908 new_oload_syms = make_symbol_overload_list (func_name,
2911 /* If we have reached the deepest level perform argument
2912 determined lookup. */
2913 if (!searched_deeper && !no_adl)
2916 struct type **arg_types;
2918 /* Prepare list of argument types for overload resolution. */
2919 arg_types = (struct type **)
2920 alloca (nargs * (sizeof (struct type *)));
2921 for (ix = 0; ix < nargs; ix++)
2922 arg_types[ix] = value_type (args[ix]);
2923 make_symbol_overload_list_adl (arg_types, nargs, func_name);
2926 while (new_oload_syms[num_fns])
2929 new_oload_champ = find_oload_champ (args, nargs, 0, num_fns,
2930 NULL, new_oload_syms,
2931 &new_oload_champ_bv);
2933 /* Case 1: We found a good match. Free earlier matches (if any),
2934 and return it. Case 2: We didn't find a good match, but we're
2935 not the deepest function. Then go with the bad match that the
2936 deeper function found. Case 3: We found a bad match, and we're
2937 the deepest function. Then return what we found, even though
2938 it's a bad match. */
2940 if (new_oload_champ != -1
2941 && classify_oload_match (new_oload_champ_bv, nargs, 0) == STANDARD)
2943 *oload_syms = new_oload_syms;
2944 *oload_champ = new_oload_champ;
2945 *oload_champ_bv = new_oload_champ_bv;
2946 do_cleanups (old_cleanups);
2949 else if (searched_deeper)
2951 xfree (new_oload_syms);
2952 xfree (new_oload_champ_bv);
2953 discard_cleanups (old_cleanups);
2958 *oload_syms = new_oload_syms;
2959 *oload_champ = new_oload_champ;
2960 *oload_champ_bv = new_oload_champ_bv;
2961 do_cleanups (old_cleanups);
2966 /* Look for a function to take NARGS args of ARGS. Find
2967 the best match from among the overloaded methods or functions
2968 (depending on METHOD) given by FNS_PTR or OLOAD_SYMS, respectively.
2969 The number of methods/functions in the list is given by NUM_FNS.
2970 Return the index of the best match; store an indication of the
2971 quality of the match in OLOAD_CHAMP_BV.
2973 It is the caller's responsibility to free *OLOAD_CHAMP_BV. */
2976 find_oload_champ (struct value **args, int nargs, int method,
2977 int num_fns, struct fn_field *fns_ptr,
2978 struct symbol **oload_syms,
2979 struct badness_vector **oload_champ_bv)
2982 /* A measure of how good an overloaded instance is. */
2983 struct badness_vector *bv;
2984 /* Index of best overloaded function. */
2985 int oload_champ = -1;
2986 /* Current ambiguity state for overload resolution. */
2987 int oload_ambiguous = 0;
2988 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */
2990 *oload_champ_bv = NULL;
2992 /* Consider each candidate in turn. */
2993 for (ix = 0; ix < num_fns; ix++)
2996 int static_offset = oload_method_static (method, fns_ptr, ix);
2998 struct type **parm_types;
3002 nparms = TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (fns_ptr, ix));
3006 /* If it's not a method, this is the proper place. */
3007 nparms = TYPE_NFIELDS (SYMBOL_TYPE (oload_syms[ix]));
3010 /* Prepare array of parameter types. */
3011 parm_types = (struct type **)
3012 xmalloc (nparms * (sizeof (struct type *)));
3013 for (jj = 0; jj < nparms; jj++)
3014 parm_types[jj] = (method
3015 ? (TYPE_FN_FIELD_ARGS (fns_ptr, ix)[jj].type)
3016 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms[ix]),
3019 /* Compare parameter types to supplied argument types. Skip
3020 THIS for static methods. */
3021 bv = rank_function (parm_types, nparms,
3022 args + static_offset,
3023 nargs - static_offset);
3025 if (!*oload_champ_bv)
3027 *oload_champ_bv = bv;
3030 else /* See whether current candidate is better or worse than
3032 switch (compare_badness (bv, *oload_champ_bv))
3034 case 0: /* Top two contenders are equally good. */
3035 oload_ambiguous = 1;
3037 case 1: /* Incomparable top contenders. */
3038 oload_ambiguous = 2;
3040 case 2: /* New champion, record details. */
3041 *oload_champ_bv = bv;
3042 oload_ambiguous = 0;
3053 fprintf_filtered (gdb_stderr,
3054 "Overloaded method instance %s, # of parms %d\n",
3055 fns_ptr[ix].physname, nparms);
3057 fprintf_filtered (gdb_stderr,
3058 "Overloaded function instance "
3059 "%s # of parms %d\n",
3060 SYMBOL_DEMANGLED_NAME (oload_syms[ix]),
3062 for (jj = 0; jj < nargs - static_offset; jj++)
3063 fprintf_filtered (gdb_stderr,
3064 "...Badness @ %d : %d\n",
3065 jj, bv->rank[jj].rank);
3066 fprintf_filtered (gdb_stderr, "Overload resolution "
3067 "champion is %d, ambiguous? %d\n",
3068 oload_champ, oload_ambiguous);
3075 /* Return 1 if we're looking at a static method, 0 if we're looking at
3076 a non-static method or a function that isn't a method. */
3079 oload_method_static (int method, struct fn_field *fns_ptr, int index)
3081 if (method && fns_ptr && index >= 0
3082 && TYPE_FN_FIELD_STATIC_P (fns_ptr, index))
3088 /* Check how good an overload match OLOAD_CHAMP_BV represents. */
3090 static enum oload_classification
3091 classify_oload_match (struct badness_vector *oload_champ_bv,
3096 enum oload_classification worst = STANDARD;
3098 for (ix = 1; ix <= nargs - static_offset; ix++)
3100 /* If this conversion is as bad as INCOMPATIBLE_TYPE_BADNESS
3101 or worse return INCOMPATIBLE. */
3102 if (compare_ranks (oload_champ_bv->rank[ix],
3103 INCOMPATIBLE_TYPE_BADNESS) <= 0)
3104 return INCOMPATIBLE; /* Truly mismatched types. */
3105 /* Otherwise If this conversion is as bad as
3106 NS_POINTER_CONVERSION_BADNESS or worse return NON_STANDARD. */
3107 else if (compare_ranks (oload_champ_bv->rank[ix],
3108 NS_POINTER_CONVERSION_BADNESS) <= 0)
3109 worst = NON_STANDARD; /* Non-standard type conversions
3113 /* If no INCOMPATIBLE classification was found, return the worst one
3114 that was found (if any). */
3118 /* C++: return 1 is NAME is a legitimate name for the destructor of
3119 type TYPE. If TYPE does not have a destructor, or if NAME is
3120 inappropriate for TYPE, an error is signaled. Parameter TYPE should not yet
3121 have CHECK_TYPEDEF applied, this function will apply it itself. */
3124 destructor_name_p (const char *name, struct type *type)
3128 const char *dname = type_name_no_tag_or_error (type);
3129 const char *cp = strchr (dname, '<');
3132 /* Do not compare the template part for template classes. */
3134 len = strlen (dname);
3137 if (strlen (name + 1) != len || strncmp (dname, name + 1, len) != 0)
3138 error (_("name of destructor must equal name of class"));
3145 /* Given TYPE, a structure/union,
3146 return 1 if the component named NAME from the ultimate target
3147 structure/union is defined, otherwise, return 0. */
3150 check_field (struct type *type, const char *name)
3154 /* The type may be a stub. */
3155 CHECK_TYPEDEF (type);
3157 for (i = TYPE_NFIELDS (type) - 1; i >= TYPE_N_BASECLASSES (type); i--)
3159 char *t_field_name = TYPE_FIELD_NAME (type, i);
3161 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
3165 /* C++: If it was not found as a data field, then try to return it
3166 as a pointer to a method. */
3168 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; --i)
3170 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type, i), name) == 0)
3174 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
3175 if (check_field (TYPE_BASECLASS (type, i), name))
3181 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3182 return the appropriate member (or the address of the member, if
3183 WANT_ADDRESS). This function is used to resolve user expressions
3184 of the form "DOMAIN::NAME". For more details on what happens, see
3185 the comment before value_struct_elt_for_reference. */
3188 value_aggregate_elt (struct type *curtype, char *name,
3189 struct type *expect_type, int want_address,
3192 switch (TYPE_CODE (curtype))
3194 case TYPE_CODE_STRUCT:
3195 case TYPE_CODE_UNION:
3196 return value_struct_elt_for_reference (curtype, 0, curtype,
3198 want_address, noside);
3199 case TYPE_CODE_NAMESPACE:
3200 return value_namespace_elt (curtype, name,
3201 want_address, noside);
3203 internal_error (__FILE__, __LINE__,
3204 _("non-aggregate type in value_aggregate_elt"));
3208 /* Compares the two method/function types T1 and T2 for "equality"
3209 with respect to the methods' parameters. If the types of the
3210 two parameter lists are the same, returns 1; 0 otherwise. This
3211 comparison may ignore any artificial parameters in T1 if
3212 SKIP_ARTIFICIAL is non-zero. This function will ALWAYS skip
3213 the first artificial parameter in T1, assumed to be a 'this' pointer.
3215 The type T2 is expected to have come from make_params (in eval.c). */
3218 compare_parameters (struct type *t1, struct type *t2, int skip_artificial)
3222 if (TYPE_NFIELDS (t1) > 0 && TYPE_FIELD_ARTIFICIAL (t1, 0))
3225 /* If skipping artificial fields, find the first real field
3227 if (skip_artificial)
3229 while (start < TYPE_NFIELDS (t1)
3230 && TYPE_FIELD_ARTIFICIAL (t1, start))
3234 /* Now compare parameters. */
3236 /* Special case: a method taking void. T1 will contain no
3237 non-artificial fields, and T2 will contain TYPE_CODE_VOID. */
3238 if ((TYPE_NFIELDS (t1) - start) == 0 && TYPE_NFIELDS (t2) == 1
3239 && TYPE_CODE (TYPE_FIELD_TYPE (t2, 0)) == TYPE_CODE_VOID)
3242 if ((TYPE_NFIELDS (t1) - start) == TYPE_NFIELDS (t2))
3246 for (i = 0; i < TYPE_NFIELDS (t2); ++i)
3248 if (compare_ranks (rank_one_type (TYPE_FIELD_TYPE (t1, start + i),
3249 TYPE_FIELD_TYPE (t2, i), NULL),
3250 EXACT_MATCH_BADNESS) != 0)
3260 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3261 return the address of this member as a "pointer to member" type.
3262 If INTYPE is non-null, then it will be the type of the member we
3263 are looking for. This will help us resolve "pointers to member
3264 functions". This function is used to resolve user expressions of
3265 the form "DOMAIN::NAME". */
3267 static struct value *
3268 value_struct_elt_for_reference (struct type *domain, int offset,
3269 struct type *curtype, char *name,
3270 struct type *intype,
3274 struct type *t = curtype;
3276 struct value *v, *result;
3278 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
3279 && TYPE_CODE (t) != TYPE_CODE_UNION)
3280 error (_("Internal error: non-aggregate type "
3281 "to value_struct_elt_for_reference"));
3283 for (i = TYPE_NFIELDS (t) - 1; i >= TYPE_N_BASECLASSES (t); i--)
3285 char *t_field_name = TYPE_FIELD_NAME (t, i);
3287 if (t_field_name && strcmp (t_field_name, name) == 0)
3289 if (field_is_static (&TYPE_FIELD (t, i)))
3291 v = value_static_field (t, i);
3293 error (_("static field %s has been optimized out"),
3299 if (TYPE_FIELD_PACKED (t, i))
3300 error (_("pointers to bitfield members not allowed"));
3303 return value_from_longest
3304 (lookup_memberptr_type (TYPE_FIELD_TYPE (t, i), domain),
3305 offset + (LONGEST) (TYPE_FIELD_BITPOS (t, i) >> 3));
3306 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
3307 return allocate_value (TYPE_FIELD_TYPE (t, i));
3309 error (_("Cannot reference non-static field \"%s\""), name);
3313 /* C++: If it was not found as a data field, then try to return it
3314 as a pointer to a method. */
3316 /* Perform all necessary dereferencing. */
3317 while (intype && TYPE_CODE (intype) == TYPE_CODE_PTR)
3318 intype = TYPE_TARGET_TYPE (intype);
3320 for (i = TYPE_NFN_FIELDS (t) - 1; i >= 0; --i)
3322 char *t_field_name = TYPE_FN_FIELDLIST_NAME (t, i);
3323 char dem_opname[64];
3325 if (strncmp (t_field_name, "__", 2) == 0
3326 || strncmp (t_field_name, "op", 2) == 0
3327 || strncmp (t_field_name, "type", 4) == 0)
3329 if (cplus_demangle_opname (t_field_name,
3330 dem_opname, DMGL_ANSI))
3331 t_field_name = dem_opname;
3332 else if (cplus_demangle_opname (t_field_name,
3334 t_field_name = dem_opname;
3336 if (t_field_name && strcmp (t_field_name, name) == 0)
3339 int len = TYPE_FN_FIELDLIST_LENGTH (t, i);
3340 struct fn_field *f = TYPE_FN_FIELDLIST1 (t, i);
3342 check_stub_method_group (t, i);
3346 for (j = 0; j < len; ++j)
3348 if (compare_parameters (TYPE_FN_FIELD_TYPE (f, j), intype, 0)
3349 || compare_parameters (TYPE_FN_FIELD_TYPE (f, j),
3355 error (_("no member function matches "
3356 "that type instantiation"));
3363 for (ii = 0; ii < len; ++ii)
3365 /* Skip artificial methods. This is necessary if,
3366 for example, the user wants to "print
3367 subclass::subclass" with only one user-defined
3368 constructor. There is no ambiguity in this case.
3369 We are careful here to allow artificial methods
3370 if they are the unique result. */
3371 if (TYPE_FN_FIELD_ARTIFICIAL (f, ii))
3378 /* Desired method is ambiguous if more than one
3379 method is defined. */
3380 if (j != -1 && !TYPE_FN_FIELD_ARTIFICIAL (f, j))
3381 error (_("non-unique member `%s' requires "
3382 "type instantiation"), name);
3388 error (_("no matching member function"));
3391 if (TYPE_FN_FIELD_STATIC_P (f, j))
3394 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j),
3401 return value_addr (read_var_value (s, 0));
3403 return read_var_value (s, 0);
3406 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
3410 result = allocate_value
3411 (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f, j)));
3412 cplus_make_method_ptr (value_type (result),
3413 value_contents_writeable (result),
3414 TYPE_FN_FIELD_VOFFSET (f, j), 1);
3416 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
3417 return allocate_value (TYPE_FN_FIELD_TYPE (f, j));
3419 error (_("Cannot reference virtual member function \"%s\""),
3425 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j),
3431 v = read_var_value (s, 0);
3436 result = allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f, j)));
3437 cplus_make_method_ptr (value_type (result),
3438 value_contents_writeable (result),
3439 value_address (v), 0);
3445 for (i = TYPE_N_BASECLASSES (t) - 1; i >= 0; i--)
3450 if (BASETYPE_VIA_VIRTUAL (t, i))
3453 base_offset = TYPE_BASECLASS_BITPOS (t, i) / 8;
3454 v = value_struct_elt_for_reference (domain,
3455 offset + base_offset,
3456 TYPE_BASECLASS (t, i),
3458 want_address, noside);
3463 /* As a last chance, pretend that CURTYPE is a namespace, and look
3464 it up that way; this (frequently) works for types nested inside
3467 return value_maybe_namespace_elt (curtype, name,
3468 want_address, noside);
3471 /* C++: Return the member NAME of the namespace given by the type
3474 static struct value *
3475 value_namespace_elt (const struct type *curtype,
3476 char *name, int want_address,
3479 struct value *retval = value_maybe_namespace_elt (curtype, name,
3484 error (_("No symbol \"%s\" in namespace \"%s\"."),
3485 name, TYPE_TAG_NAME (curtype));
3490 /* A helper function used by value_namespace_elt and
3491 value_struct_elt_for_reference. It looks up NAME inside the
3492 context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE
3493 is a class and NAME refers to a type in CURTYPE itself (as opposed
3494 to, say, some base class of CURTYPE). */
3496 static struct value *
3497 value_maybe_namespace_elt (const struct type *curtype,
3498 char *name, int want_address,
3501 const char *namespace_name = TYPE_TAG_NAME (curtype);
3503 struct value *result;
3505 sym = cp_lookup_symbol_namespace (namespace_name, name,
3506 get_selected_block (0), VAR_DOMAIN);
3510 char *concatenated_name = alloca (strlen (namespace_name) + 2
3511 + strlen (name) + 1);
3513 sprintf (concatenated_name, "%s::%s", namespace_name, name);
3514 sym = lookup_static_symbol_aux (concatenated_name, VAR_DOMAIN);
3519 else if ((noside == EVAL_AVOID_SIDE_EFFECTS)
3520 && (SYMBOL_CLASS (sym) == LOC_TYPEDEF))
3521 result = allocate_value (SYMBOL_TYPE (sym));
3523 result = value_of_variable (sym, get_selected_block (0));
3525 if (result && want_address)
3526 result = value_addr (result);
3531 /* Given a pointer value V, find the real (RTTI) type of the object it
3534 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
3535 and refer to the values computed for the object pointed to. */
3538 value_rtti_target_type (struct value *v, int *full,
3539 int *top, int *using_enc)
3541 struct value *target;
3543 target = value_ind (v);
3545 return value_rtti_type (target, full, top, using_enc);
3548 /* Given a value pointed to by ARGP, check its real run-time type, and
3549 if that is different from the enclosing type, create a new value
3550 using the real run-time type as the enclosing type (and of the same
3551 type as ARGP) and return it, with the embedded offset adjusted to
3552 be the correct offset to the enclosed object. RTYPE is the type,
3553 and XFULL, XTOP, and XUSING_ENC are the other parameters, computed
3554 by value_rtti_type(). If these are available, they can be supplied
3555 and a second call to value_rtti_type() is avoided. (Pass RTYPE ==
3556 NULL if they're not available. */
3559 value_full_object (struct value *argp,
3561 int xfull, int xtop,
3564 struct type *real_type;
3568 struct value *new_val;
3575 using_enc = xusing_enc;
3578 real_type = value_rtti_type (argp, &full, &top, &using_enc);
3580 /* If no RTTI data, or if object is already complete, do nothing. */
3581 if (!real_type || real_type == value_enclosing_type (argp))
3584 /* If we have the full object, but for some reason the enclosing
3585 type is wrong, set it. */
3586 /* pai: FIXME -- sounds iffy */
3589 argp = value_copy (argp);
3590 set_value_enclosing_type (argp, real_type);
3594 /* Check if object is in memory. */
3595 if (VALUE_LVAL (argp) != lval_memory)
3597 warning (_("Couldn't retrieve complete object of RTTI "
3598 "type %s; object may be in register(s)."),
3599 TYPE_NAME (real_type));
3604 /* All other cases -- retrieve the complete object. */
3605 /* Go back by the computed top_offset from the beginning of the
3606 object, adjusting for the embedded offset of argp if that's what
3607 value_rtti_type used for its computation. */
3608 new_val = value_at_lazy (real_type, value_address (argp) - top +
3609 (using_enc ? 0 : value_embedded_offset (argp)));
3610 deprecated_set_value_type (new_val, value_type (argp));
3611 set_value_embedded_offset (new_val, (using_enc
3612 ? top + value_embedded_offset (argp)
3618 /* Return the value of the local variable, if one exists. Throw error
3619 otherwise, such as if the request is made in an inappropriate context. */
3622 value_of_this (const struct language_defn *lang)
3626 struct frame_info *frame;
3628 if (!lang->la_name_of_this)
3629 error (_("no `this' in current language"));
3631 frame = get_selected_frame (_("no frame selected"));
3633 b = get_frame_block (frame, NULL);
3635 sym = lookup_language_this (lang, b);
3637 error (_("current stack frame does not contain a variable named `%s'"),
3638 lang->la_name_of_this);
3640 return read_var_value (sym, frame);
3643 /* Return the value of the local variable, if one exists. Return NULL
3644 otherwise. Never throw error. */
3647 value_of_this_silent (const struct language_defn *lang)
3649 struct value *ret = NULL;
3650 volatile struct gdb_exception except;
3652 TRY_CATCH (except, RETURN_MASK_ERROR)
3654 ret = value_of_this (lang);
3660 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH
3661 elements long, starting at LOWBOUND. The result has the same lower
3662 bound as the original ARRAY. */
3665 value_slice (struct value *array, int lowbound, int length)
3667 struct type *slice_range_type, *slice_type, *range_type;
3668 LONGEST lowerbound, upperbound;
3669 struct value *slice;
3670 struct type *array_type;
3672 array_type = check_typedef (value_type (array));
3673 if (TYPE_CODE (array_type) != TYPE_CODE_ARRAY
3674 && TYPE_CODE (array_type) != TYPE_CODE_STRING
3675 && TYPE_CODE (array_type) != TYPE_CODE_BITSTRING)
3676 error (_("cannot take slice of non-array"));
3678 range_type = TYPE_INDEX_TYPE (array_type);
3679 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
3680 error (_("slice from bad array or bitstring"));
3682 if (lowbound < lowerbound || length < 0
3683 || lowbound + length - 1 > upperbound)
3684 error (_("slice out of range"));
3686 /* FIXME-type-allocation: need a way to free this type when we are
3688 slice_range_type = create_range_type ((struct type *) NULL,
3689 TYPE_TARGET_TYPE (range_type),
3691 lowbound + length - 1);
3692 if (TYPE_CODE (array_type) == TYPE_CODE_BITSTRING)
3696 slice_type = create_set_type ((struct type *) NULL,
3698 TYPE_CODE (slice_type) = TYPE_CODE_BITSTRING;
3699 slice = value_zero (slice_type, not_lval);
3701 for (i = 0; i < length; i++)
3703 int element = value_bit_index (array_type,
3704 value_contents (array),
3708 error (_("internal error accessing bitstring"));
3709 else if (element > 0)
3711 int j = i % TARGET_CHAR_BIT;
3713 if (gdbarch_bits_big_endian (get_type_arch (array_type)))
3714 j = TARGET_CHAR_BIT - 1 - j;
3715 value_contents_raw (slice)[i / TARGET_CHAR_BIT] |= (1 << j);
3718 /* We should set the address, bitssize, and bitspos, so the
3719 slice can be used on the LHS, but that may require extensions
3720 to value_assign. For now, just leave as a non_lval.
3725 struct type *element_type = TYPE_TARGET_TYPE (array_type);
3727 (lowbound - lowerbound) * TYPE_LENGTH (check_typedef (element_type));
3729 slice_type = create_array_type ((struct type *) NULL,
3732 TYPE_CODE (slice_type) = TYPE_CODE (array_type);
3734 if (VALUE_LVAL (array) == lval_memory && value_lazy (array))
3735 slice = allocate_value_lazy (slice_type);
3738 slice = allocate_value (slice_type);
3739 value_contents_copy (slice, 0, array, offset,
3740 TYPE_LENGTH (slice_type));
3743 set_value_component_location (slice, array);
3744 VALUE_FRAME_ID (slice) = VALUE_FRAME_ID (array);
3745 set_value_offset (slice, value_offset (array) + offset);
3750 /* Create a value for a FORTRAN complex number. Currently most of the
3751 time values are coerced to COMPLEX*16 (i.e. a complex number
3752 composed of 2 doubles. This really should be a smarter routine
3753 that figures out precision inteligently as opposed to assuming
3754 doubles. FIXME: fmb */
3757 value_literal_complex (struct value *arg1,
3762 struct type *real_type = TYPE_TARGET_TYPE (type);
3764 val = allocate_value (type);
3765 arg1 = value_cast (real_type, arg1);
3766 arg2 = value_cast (real_type, arg2);
3768 memcpy (value_contents_raw (val),
3769 value_contents (arg1), TYPE_LENGTH (real_type));
3770 memcpy (value_contents_raw (val) + TYPE_LENGTH (real_type),
3771 value_contents (arg2), TYPE_LENGTH (real_type));
3775 /* Cast a value into the appropriate complex data type. */
3777 static struct value *
3778 cast_into_complex (struct type *type, struct value *val)
3780 struct type *real_type = TYPE_TARGET_TYPE (type);
3782 if (TYPE_CODE (value_type (val)) == TYPE_CODE_COMPLEX)
3784 struct type *val_real_type = TYPE_TARGET_TYPE (value_type (val));
3785 struct value *re_val = allocate_value (val_real_type);
3786 struct value *im_val = allocate_value (val_real_type);
3788 memcpy (value_contents_raw (re_val),
3789 value_contents (val), TYPE_LENGTH (val_real_type));
3790 memcpy (value_contents_raw (im_val),
3791 value_contents (val) + TYPE_LENGTH (val_real_type),
3792 TYPE_LENGTH (val_real_type));
3794 return value_literal_complex (re_val, im_val, type);
3796 else if (TYPE_CODE (value_type (val)) == TYPE_CODE_FLT
3797 || TYPE_CODE (value_type (val)) == TYPE_CODE_INT)
3798 return value_literal_complex (val,
3799 value_zero (real_type, not_lval),
3802 error (_("cannot cast non-number to complex"));
3806 _initialize_valops (void)
3808 add_setshow_boolean_cmd ("overload-resolution", class_support,
3809 &overload_resolution, _("\
3810 Set overload resolution in evaluating C++ functions."), _("\
3811 Show overload resolution in evaluating C++ functions."),
3813 show_overload_resolution,
3814 &setlist, &showlist);
3815 overload_resolution = 1;