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"
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 type **, int,
65 const char *, const char *,
67 struct badness_vector **,
71 int find_oload_champ_namespace_loop (struct type **, int,
72 const char *, const char *,
73 int, struct symbol ***,
74 struct badness_vector **, int *,
77 static int find_oload_champ (struct type **, 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 bfd_byte *contents,
657 struct type *search_type,
659 struct type *arg_type,
660 struct value **result)
662 int i, result_count = 0;
664 for (i = 0; i < TYPE_N_BASECLASSES (search_type) && result_count < 2; ++i)
666 int offset = baseclass_offset (search_type, i, contents, address);
669 error (_("virtual baseclass botch"));
670 if (class_types_same_p (desired_type, TYPE_BASECLASS (search_type, i)))
672 if (address + offset >= arg_addr
673 && address + offset < arg_addr + TYPE_LENGTH (arg_type))
677 *result = value_at_lazy (TYPE_BASECLASS (search_type, i),
682 result_count += dynamic_cast_check_1 (desired_type,
685 TYPE_BASECLASS (search_type, i),
694 /* A helper for value_dynamic_cast. This implements the second of two
695 runtime checks: we look for a unique public sibling class of the
696 argument's declared class. */
699 dynamic_cast_check_2 (struct type *desired_type,
700 const bfd_byte *contents,
702 struct type *search_type,
703 struct value **result)
705 int i, result_count = 0;
707 for (i = 0; i < TYPE_N_BASECLASSES (search_type) && result_count < 2; ++i)
711 if (! BASETYPE_VIA_PUBLIC (search_type, i))
714 offset = baseclass_offset (search_type, i, contents, address);
716 error (_("virtual baseclass botch"));
717 if (class_types_same_p (desired_type, TYPE_BASECLASS (search_type, i)))
721 *result = value_at_lazy (TYPE_BASECLASS (search_type, i),
725 result_count += dynamic_cast_check_2 (desired_type,
728 TYPE_BASECLASS (search_type, i),
735 /* The C++ dynamic_cast operator. */
738 value_dynamic_cast (struct type *type, struct value *arg)
740 int full, top, using_enc;
741 struct type *resolved_type = check_typedef (type);
742 struct type *arg_type = check_typedef (value_type (arg));
743 struct type *class_type, *rtti_type;
744 struct value *result, *tem, *original_arg = arg;
746 int is_ref = TYPE_CODE (resolved_type) == TYPE_CODE_REF;
748 if (TYPE_CODE (resolved_type) != TYPE_CODE_PTR
749 && TYPE_CODE (resolved_type) != TYPE_CODE_REF)
750 error (_("Argument to dynamic_cast must be a pointer or reference type"));
751 if (TYPE_CODE (TYPE_TARGET_TYPE (resolved_type)) != TYPE_CODE_VOID
752 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type)) != TYPE_CODE_CLASS)
753 error (_("Argument to dynamic_cast must be pointer to class or `void *'"));
755 class_type = check_typedef (TYPE_TARGET_TYPE (resolved_type));
756 if (TYPE_CODE (resolved_type) == TYPE_CODE_PTR)
758 if (TYPE_CODE (arg_type) != TYPE_CODE_PTR
759 && ! (TYPE_CODE (arg_type) == TYPE_CODE_INT
760 && value_as_long (arg) == 0))
761 error (_("Argument to dynamic_cast does not have pointer type"));
762 if (TYPE_CODE (arg_type) == TYPE_CODE_PTR)
764 arg_type = check_typedef (TYPE_TARGET_TYPE (arg_type));
765 if (TYPE_CODE (arg_type) != TYPE_CODE_CLASS)
766 error (_("Argument to dynamic_cast does "
767 "not have pointer to class type"));
770 /* Handle NULL pointers. */
771 if (value_as_long (arg) == 0)
772 return value_zero (type, not_lval);
774 arg = value_ind (arg);
778 if (TYPE_CODE (arg_type) != TYPE_CODE_CLASS)
779 error (_("Argument to dynamic_cast does not have class type"));
782 /* If the classes are the same, just return the argument. */
783 if (class_types_same_p (class_type, arg_type))
784 return value_cast (type, arg);
786 /* If the target type is a unique base class of the argument's
787 declared type, just cast it. */
788 if (is_ancestor (class_type, arg_type))
790 if (is_unique_ancestor (class_type, arg))
791 return value_cast (type, original_arg);
792 error (_("Ambiguous dynamic_cast"));
795 rtti_type = value_rtti_type (arg, &full, &top, &using_enc);
797 error (_("Couldn't determine value's most derived type for dynamic_cast"));
799 /* Compute the most derived object's address. */
800 addr = value_address (arg);
808 addr += top + value_embedded_offset (arg);
810 /* dynamic_cast<void *> means to return a pointer to the
811 most-derived object. */
812 if (TYPE_CODE (resolved_type) == TYPE_CODE_PTR
813 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type)) == TYPE_CODE_VOID)
814 return value_at_lazy (type, addr);
816 tem = value_at (type, addr);
818 /* The first dynamic check specified in 5.2.7. */
819 if (is_public_ancestor (arg_type, TYPE_TARGET_TYPE (resolved_type)))
821 if (class_types_same_p (rtti_type, TYPE_TARGET_TYPE (resolved_type)))
824 if (dynamic_cast_check_1 (TYPE_TARGET_TYPE (resolved_type),
825 value_contents (tem), value_address (tem),
829 return value_cast (type,
830 is_ref ? value_ref (result) : value_addr (result));
833 /* The second dynamic check specified in 5.2.7. */
835 if (is_public_ancestor (arg_type, rtti_type)
836 && dynamic_cast_check_2 (TYPE_TARGET_TYPE (resolved_type),
837 value_contents (tem), value_address (tem),
838 rtti_type, &result) == 1)
839 return value_cast (type,
840 is_ref ? value_ref (result) : value_addr (result));
842 if (TYPE_CODE (resolved_type) == TYPE_CODE_PTR)
843 return value_zero (type, not_lval);
845 error (_("dynamic_cast failed"));
848 /* Create a value of type TYPE that is zero, and return it. */
851 value_zero (struct type *type, enum lval_type lv)
853 struct value *val = allocate_value (type);
855 VALUE_LVAL (val) = lv;
859 /* Create a value of numeric type TYPE that is one, and return it. */
862 value_one (struct type *type, enum lval_type lv)
864 struct type *type1 = check_typedef (type);
867 if (TYPE_CODE (type1) == TYPE_CODE_DECFLOAT)
869 enum bfd_endian byte_order = gdbarch_byte_order (get_type_arch (type));
872 decimal_from_string (v, TYPE_LENGTH (type), byte_order, "1");
873 val = value_from_decfloat (type, v);
875 else if (TYPE_CODE (type1) == TYPE_CODE_FLT)
877 val = value_from_double (type, (DOUBLEST) 1);
879 else if (is_integral_type (type1))
881 val = value_from_longest (type, (LONGEST) 1);
883 else if (TYPE_CODE (type1) == TYPE_CODE_ARRAY && TYPE_VECTOR (type1))
885 struct type *eltype = check_typedef (TYPE_TARGET_TYPE (type1));
887 LONGEST low_bound, high_bound;
890 if (!get_array_bounds (type1, &low_bound, &high_bound))
891 error (_("Could not determine the vector bounds"));
893 val = allocate_value (type);
894 for (i = 0; i < high_bound - low_bound + 1; i++)
896 tmp = value_one (eltype, lv);
897 memcpy (value_contents_writeable (val) + i * TYPE_LENGTH (eltype),
898 value_contents_all (tmp), TYPE_LENGTH (eltype));
903 error (_("Not a numeric type."));
906 VALUE_LVAL (val) = lv;
910 /* Helper function for value_at, value_at_lazy, and value_at_lazy_stack. */
912 static struct value *
913 get_value_at (struct type *type, CORE_ADDR addr, int lazy)
917 if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
918 error (_("Attempt to dereference a generic pointer."));
922 val = allocate_value_lazy (type);
926 val = allocate_value (type);
927 read_memory (addr, value_contents_all_raw (val), TYPE_LENGTH (type));
930 VALUE_LVAL (val) = lval_memory;
931 set_value_address (val, addr);
936 /* Return a value with type TYPE located at ADDR.
938 Call value_at only if the data needs to be fetched immediately;
939 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
940 value_at_lazy instead. value_at_lazy simply records the address of
941 the data and sets the lazy-evaluation-required flag. The lazy flag
942 is tested in the value_contents macro, which is used if and when
943 the contents are actually required.
945 Note: value_at does *NOT* handle embedded offsets; perform such
946 adjustments before or after calling it. */
949 value_at (struct type *type, CORE_ADDR addr)
951 return get_value_at (type, addr, 0);
954 /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
957 value_at_lazy (struct type *type, CORE_ADDR addr)
959 return get_value_at (type, addr, 1);
962 /* Called only from the value_contents and value_contents_all()
963 macros, if the current data for a variable needs to be loaded into
964 value_contents(VAL). Fetches the data from the user's process, and
965 clears the lazy flag to indicate that the data in the buffer is
968 If the value is zero-length, we avoid calling read_memory, which
969 would abort. We mark the value as fetched anyway -- all 0 bytes of
972 This function returns a value because it is used in the
973 value_contents macro as part of an expression, where a void would
974 not work. The value is ignored. */
977 value_fetch_lazy (struct value *val)
979 gdb_assert (value_lazy (val));
980 allocate_value_contents (val);
981 if (value_bitsize (val))
983 /* To read a lazy bitfield, read the entire enclosing value. This
984 prevents reading the same block of (possibly volatile) memory once
985 per bitfield. It would be even better to read only the containing
986 word, but we have no way to record that just specific bits of a
987 value have been fetched. */
988 struct type *type = check_typedef (value_type (val));
989 enum bfd_endian byte_order = gdbarch_byte_order (get_type_arch (type));
990 struct value *parent = value_parent (val);
991 LONGEST offset = value_offset (val);
992 LONGEST num = unpack_bits_as_long (value_type (val),
993 (value_contents_for_printing (parent)
996 value_bitsize (val));
997 int length = TYPE_LENGTH (type);
999 if (!value_bits_valid (val,
1000 TARGET_CHAR_BIT * offset + value_bitpos (val),
1001 value_bitsize (val)))
1002 error (_("value has been optimized out"));
1004 store_signed_integer (value_contents_raw (val), length, byte_order, num);
1006 else if (VALUE_LVAL (val) == lval_memory)
1008 CORE_ADDR addr = value_address (val);
1009 int length = TYPE_LENGTH (check_typedef (value_enclosing_type (val)));
1013 if (value_stack (val))
1014 read_stack (addr, value_contents_all_raw (val), length);
1016 read_memory (addr, value_contents_all_raw (val), length);
1019 else if (VALUE_LVAL (val) == lval_register)
1021 struct frame_info *frame;
1023 struct type *type = check_typedef (value_type (val));
1024 struct value *new_val = val, *mark = value_mark ();
1026 /* Offsets are not supported here; lazy register values must
1027 refer to the entire register. */
1028 gdb_assert (value_offset (val) == 0);
1030 while (VALUE_LVAL (new_val) == lval_register && value_lazy (new_val))
1032 frame = frame_find_by_id (VALUE_FRAME_ID (new_val));
1033 regnum = VALUE_REGNUM (new_val);
1035 gdb_assert (frame != NULL);
1037 /* Convertible register routines are used for multi-register
1038 values and for interpretation in different types
1039 (e.g. float or int from a double register). Lazy
1040 register values should have the register's natural type,
1041 so they do not apply. */
1042 gdb_assert (!gdbarch_convert_register_p (get_frame_arch (frame),
1045 new_val = get_frame_register_value (frame, regnum);
1048 /* If it's still lazy (for instance, a saved register on the
1049 stack), fetch it. */
1050 if (value_lazy (new_val))
1051 value_fetch_lazy (new_val);
1053 /* If the register was not saved, mark it unavailable. */
1054 if (value_optimized_out (new_val))
1055 set_value_optimized_out (val, 1);
1057 memcpy (value_contents_raw (val), value_contents (new_val),
1058 TYPE_LENGTH (type));
1062 struct gdbarch *gdbarch;
1063 frame = frame_find_by_id (VALUE_FRAME_ID (val));
1064 regnum = VALUE_REGNUM (val);
1065 gdbarch = get_frame_arch (frame);
1067 fprintf_unfiltered (gdb_stdlog,
1068 "{ value_fetch_lazy "
1069 "(frame=%d,regnum=%d(%s),...) ",
1070 frame_relative_level (frame), regnum,
1071 user_reg_map_regnum_to_name (gdbarch, regnum));
1073 fprintf_unfiltered (gdb_stdlog, "->");
1074 if (value_optimized_out (new_val))
1075 fprintf_unfiltered (gdb_stdlog, " optimized out");
1079 const gdb_byte *buf = value_contents (new_val);
1081 if (VALUE_LVAL (new_val) == lval_register)
1082 fprintf_unfiltered (gdb_stdlog, " register=%d",
1083 VALUE_REGNUM (new_val));
1084 else if (VALUE_LVAL (new_val) == lval_memory)
1085 fprintf_unfiltered (gdb_stdlog, " address=%s",
1087 value_address (new_val)));
1089 fprintf_unfiltered (gdb_stdlog, " computed");
1091 fprintf_unfiltered (gdb_stdlog, " bytes=");
1092 fprintf_unfiltered (gdb_stdlog, "[");
1093 for (i = 0; i < register_size (gdbarch, regnum); i++)
1094 fprintf_unfiltered (gdb_stdlog, "%02x", buf[i]);
1095 fprintf_unfiltered (gdb_stdlog, "]");
1098 fprintf_unfiltered (gdb_stdlog, " }\n");
1101 /* Dispose of the intermediate values. This prevents
1102 watchpoints from trying to watch the saved frame pointer. */
1103 value_free_to_mark (mark);
1105 else if (VALUE_LVAL (val) == lval_computed)
1106 value_computed_funcs (val)->read (val);
1108 internal_error (__FILE__, __LINE__, _("Unexpected lazy value type."));
1110 set_value_lazy (val, 0);
1115 /* Store the contents of FROMVAL into the location of TOVAL.
1116 Return a new value with the location of TOVAL and contents of FROMVAL. */
1119 value_assign (struct value *toval, struct value *fromval)
1123 struct frame_id old_frame;
1125 if (!deprecated_value_modifiable (toval))
1126 error (_("Left operand of assignment is not a modifiable lvalue."));
1128 toval = coerce_ref (toval);
1130 type = value_type (toval);
1131 if (VALUE_LVAL (toval) != lval_internalvar)
1132 fromval = value_cast (type, fromval);
1135 /* Coerce arrays and functions to pointers, except for arrays
1136 which only live in GDB's storage. */
1137 if (!value_must_coerce_to_target (fromval))
1138 fromval = coerce_array (fromval);
1141 CHECK_TYPEDEF (type);
1143 /* Since modifying a register can trash the frame chain, and
1144 modifying memory can trash the frame cache, we save the old frame
1145 and then restore the new frame afterwards. */
1146 old_frame = get_frame_id (deprecated_safe_get_selected_frame ());
1148 switch (VALUE_LVAL (toval))
1150 case lval_internalvar:
1151 set_internalvar (VALUE_INTERNALVAR (toval), fromval);
1152 return value_of_internalvar (get_type_arch (type),
1153 VALUE_INTERNALVAR (toval));
1155 case lval_internalvar_component:
1156 set_internalvar_component (VALUE_INTERNALVAR (toval),
1157 value_offset (toval),
1158 value_bitpos (toval),
1159 value_bitsize (toval),
1165 const gdb_byte *dest_buffer;
1166 CORE_ADDR changed_addr;
1168 gdb_byte buffer[sizeof (LONGEST)];
1170 if (value_bitsize (toval))
1172 struct value *parent = value_parent (toval);
1174 changed_addr = value_address (parent) + value_offset (toval);
1175 changed_len = (value_bitpos (toval)
1176 + value_bitsize (toval)
1177 + HOST_CHAR_BIT - 1)
1180 /* If we can read-modify-write exactly the size of the
1181 containing type (e.g. short or int) then do so. This
1182 is safer for volatile bitfields mapped to hardware
1184 if (changed_len < TYPE_LENGTH (type)
1185 && TYPE_LENGTH (type) <= (int) sizeof (LONGEST)
1186 && ((LONGEST) changed_addr % TYPE_LENGTH (type)) == 0)
1187 changed_len = TYPE_LENGTH (type);
1189 if (changed_len > (int) sizeof (LONGEST))
1190 error (_("Can't handle bitfields which "
1191 "don't fit in a %d bit word."),
1192 (int) sizeof (LONGEST) * HOST_CHAR_BIT);
1194 read_memory (changed_addr, buffer, changed_len);
1195 modify_field (type, buffer, value_as_long (fromval),
1196 value_bitpos (toval), value_bitsize (toval));
1197 dest_buffer = buffer;
1201 changed_addr = value_address (toval);
1202 changed_len = TYPE_LENGTH (type);
1203 dest_buffer = value_contents (fromval);
1206 write_memory (changed_addr, dest_buffer, changed_len);
1207 observer_notify_memory_changed (changed_addr, changed_len,
1214 struct frame_info *frame;
1215 struct gdbarch *gdbarch;
1218 /* Figure out which frame this is in currently. */
1219 frame = frame_find_by_id (VALUE_FRAME_ID (toval));
1220 value_reg = VALUE_REGNUM (toval);
1223 error (_("Value being assigned to is no longer active."));
1225 gdbarch = get_frame_arch (frame);
1226 if (gdbarch_convert_register_p (gdbarch, VALUE_REGNUM (toval), type))
1228 /* If TOVAL is a special machine register requiring
1229 conversion of program values to a special raw
1231 gdbarch_value_to_register (gdbarch, frame,
1232 VALUE_REGNUM (toval), type,
1233 value_contents (fromval));
1237 if (value_bitsize (toval))
1239 struct value *parent = value_parent (toval);
1240 int offset = value_offset (parent) + value_offset (toval);
1242 gdb_byte buffer[sizeof (LONGEST)];
1244 changed_len = (value_bitpos (toval)
1245 + value_bitsize (toval)
1246 + HOST_CHAR_BIT - 1)
1249 if (changed_len > (int) sizeof (LONGEST))
1250 error (_("Can't handle bitfields which "
1251 "don't fit in a %d bit word."),
1252 (int) sizeof (LONGEST) * HOST_CHAR_BIT);
1254 get_frame_register_bytes (frame, value_reg, offset,
1255 changed_len, buffer);
1257 modify_field (type, buffer, value_as_long (fromval),
1258 value_bitpos (toval), value_bitsize (toval));
1260 put_frame_register_bytes (frame, value_reg, offset,
1261 changed_len, buffer);
1265 put_frame_register_bytes (frame, value_reg,
1266 value_offset (toval),
1268 value_contents (fromval));
1272 if (deprecated_register_changed_hook)
1273 deprecated_register_changed_hook (-1);
1274 observer_notify_target_changed (¤t_target);
1280 struct lval_funcs *funcs = value_computed_funcs (toval);
1282 funcs->write (toval, fromval);
1287 error (_("Left operand of assignment is not an lvalue."));
1290 /* Assigning to the stack pointer, frame pointer, and other
1291 (architecture and calling convention specific) registers may
1292 cause the frame cache to be out of date. Assigning to memory
1293 also can. We just do this on all assignments to registers or
1294 memory, for simplicity's sake; I doubt the slowdown matters. */
1295 switch (VALUE_LVAL (toval))
1301 reinit_frame_cache ();
1303 /* Having destroyed the frame cache, restore the selected
1306 /* FIXME: cagney/2002-11-02: There has to be a better way of
1307 doing this. Instead of constantly saving/restoring the
1308 frame. Why not create a get_selected_frame() function that,
1309 having saved the selected frame's ID can automatically
1310 re-find the previously selected frame automatically. */
1313 struct frame_info *fi = frame_find_by_id (old_frame);
1324 /* If the field does not entirely fill a LONGEST, then zero the sign
1325 bits. If the field is signed, and is negative, then sign
1327 if ((value_bitsize (toval) > 0)
1328 && (value_bitsize (toval) < 8 * (int) sizeof (LONGEST)))
1330 LONGEST fieldval = value_as_long (fromval);
1331 LONGEST valmask = (((ULONGEST) 1) << value_bitsize (toval)) - 1;
1333 fieldval &= valmask;
1334 if (!TYPE_UNSIGNED (type)
1335 && (fieldval & (valmask ^ (valmask >> 1))))
1336 fieldval |= ~valmask;
1338 fromval = value_from_longest (type, fieldval);
1341 /* The return value is a copy of TOVAL so it shares its location
1342 information, but its contents are updated from FROMVAL. This
1343 implies the returned value is not lazy, even if TOVAL was. */
1344 val = value_copy (toval);
1345 set_value_lazy (val, 0);
1346 memcpy (value_contents_raw (val), value_contents (fromval),
1347 TYPE_LENGTH (type));
1349 /* We copy over the enclosing type and pointed-to offset from FROMVAL
1350 in the case of pointer types. For object types, the enclosing type
1351 and embedded offset must *not* be copied: the target object refered
1352 to by TOVAL retains its original dynamic type after assignment. */
1353 if (TYPE_CODE (type) == TYPE_CODE_PTR)
1355 set_value_enclosing_type (val, value_enclosing_type (fromval));
1356 set_value_pointed_to_offset (val, value_pointed_to_offset (fromval));
1362 /* Extend a value VAL to COUNT repetitions of its type. */
1365 value_repeat (struct value *arg1, int count)
1369 if (VALUE_LVAL (arg1) != lval_memory)
1370 error (_("Only values in memory can be extended with '@'."));
1372 error (_("Invalid number %d of repetitions."), count);
1374 val = allocate_repeat_value (value_enclosing_type (arg1), count);
1376 read_memory (value_address (arg1),
1377 value_contents_all_raw (val),
1378 TYPE_LENGTH (value_enclosing_type (val)));
1379 VALUE_LVAL (val) = lval_memory;
1380 set_value_address (val, value_address (arg1));
1386 value_of_variable (struct symbol *var, struct block *b)
1389 struct frame_info *frame;
1391 if (!symbol_read_needs_frame (var))
1394 frame = get_selected_frame (_("No frame selected."));
1397 frame = block_innermost_frame (b);
1400 if (BLOCK_FUNCTION (b) && !block_inlined_p (b)
1401 && SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b)))
1402 error (_("No frame is currently executing in block %s."),
1403 SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b)));
1405 error (_("No frame is currently executing in specified block"));
1409 val = read_var_value (var, frame);
1411 error (_("Address of symbol \"%s\" is unknown."), SYMBOL_PRINT_NAME (var));
1417 address_of_variable (struct symbol *var, struct block *b)
1419 struct type *type = SYMBOL_TYPE (var);
1422 /* Evaluate it first; if the result is a memory address, we're fine.
1423 Lazy evaluation pays off here. */
1425 val = value_of_variable (var, b);
1427 if ((VALUE_LVAL (val) == lval_memory && value_lazy (val))
1428 || TYPE_CODE (type) == TYPE_CODE_FUNC)
1430 CORE_ADDR addr = value_address (val);
1432 return value_from_pointer (lookup_pointer_type (type), addr);
1435 /* Not a memory address; check what the problem was. */
1436 switch (VALUE_LVAL (val))
1440 struct frame_info *frame;
1441 const char *regname;
1443 frame = frame_find_by_id (VALUE_FRAME_ID (val));
1446 regname = gdbarch_register_name (get_frame_arch (frame),
1447 VALUE_REGNUM (val));
1448 gdb_assert (regname && *regname);
1450 error (_("Address requested for identifier "
1451 "\"%s\" which is in register $%s"),
1452 SYMBOL_PRINT_NAME (var), regname);
1457 error (_("Can't take address of \"%s\" which isn't an lvalue."),
1458 SYMBOL_PRINT_NAME (var));
1465 /* Return one if VAL does not live in target memory, but should in order
1466 to operate on it. Otherwise return zero. */
1469 value_must_coerce_to_target (struct value *val)
1471 struct type *valtype;
1473 /* The only lval kinds which do not live in target memory. */
1474 if (VALUE_LVAL (val) != not_lval
1475 && VALUE_LVAL (val) != lval_internalvar)
1478 valtype = check_typedef (value_type (val));
1480 switch (TYPE_CODE (valtype))
1482 case TYPE_CODE_ARRAY:
1483 return TYPE_VECTOR (valtype) ? 0 : 1;
1484 case TYPE_CODE_STRING:
1491 /* Make sure that VAL lives in target memory if it's supposed to. For
1492 instance, strings are constructed as character arrays in GDB's
1493 storage, and this function copies them to the target. */
1496 value_coerce_to_target (struct value *val)
1501 if (!value_must_coerce_to_target (val))
1504 length = TYPE_LENGTH (check_typedef (value_type (val)));
1505 addr = allocate_space_in_inferior (length);
1506 write_memory (addr, value_contents (val), length);
1507 return value_at_lazy (value_type (val), addr);
1510 /* Given a value which is an array, return a value which is a pointer
1511 to its first element, regardless of whether or not the array has a
1512 nonzero lower bound.
1514 FIXME: A previous comment here indicated that this routine should
1515 be substracting the array's lower bound. It's not clear to me that
1516 this is correct. Given an array subscripting operation, it would
1517 certainly work to do the adjustment here, essentially computing:
1519 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
1521 However I believe a more appropriate and logical place to account
1522 for the lower bound is to do so in value_subscript, essentially
1525 (&array[0] + ((index - lowerbound) * sizeof array[0]))
1527 As further evidence consider what would happen with operations
1528 other than array subscripting, where the caller would get back a
1529 value that had an address somewhere before the actual first element
1530 of the array, and the information about the lower bound would be
1531 lost because of the coercion to pointer type.
1535 value_coerce_array (struct value *arg1)
1537 struct type *type = check_typedef (value_type (arg1));
1539 /* If the user tries to do something requiring a pointer with an
1540 array that has not yet been pushed to the target, then this would
1541 be a good time to do so. */
1542 arg1 = value_coerce_to_target (arg1);
1544 if (VALUE_LVAL (arg1) != lval_memory)
1545 error (_("Attempt to take address of value not located in memory."));
1547 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
1548 value_address (arg1));
1551 /* Given a value which is a function, return a value which is a pointer
1555 value_coerce_function (struct value *arg1)
1557 struct value *retval;
1559 if (VALUE_LVAL (arg1) != lval_memory)
1560 error (_("Attempt to take address of value not located in memory."));
1562 retval = value_from_pointer (lookup_pointer_type (value_type (arg1)),
1563 value_address (arg1));
1567 /* Return a pointer value for the object for which ARG1 is the
1571 value_addr (struct value *arg1)
1574 struct type *type = check_typedef (value_type (arg1));
1576 if (TYPE_CODE (type) == TYPE_CODE_REF)
1578 /* Copy the value, but change the type from (T&) to (T*). We
1579 keep the same location information, which is efficient, and
1580 allows &(&X) to get the location containing the reference. */
1581 arg2 = value_copy (arg1);
1582 deprecated_set_value_type (arg2,
1583 lookup_pointer_type (TYPE_TARGET_TYPE (type)));
1586 if (TYPE_CODE (type) == TYPE_CODE_FUNC)
1587 return value_coerce_function (arg1);
1589 /* If this is an array that has not yet been pushed to the target,
1590 then this would be a good time to force it to memory. */
1591 arg1 = value_coerce_to_target (arg1);
1593 if (VALUE_LVAL (arg1) != lval_memory)
1594 error (_("Attempt to take address of value not located in memory."));
1596 /* Get target memory address */
1597 arg2 = value_from_pointer (lookup_pointer_type (value_type (arg1)),
1598 (value_address (arg1)
1599 + value_embedded_offset (arg1)));
1601 /* This may be a pointer to a base subobject; so remember the
1602 full derived object's type ... */
1603 set_value_enclosing_type (arg2,
1604 lookup_pointer_type (value_enclosing_type (arg1)));
1605 /* ... and also the relative position of the subobject in the full
1607 set_value_pointed_to_offset (arg2, value_embedded_offset (arg1));
1611 /* Return a reference value for the object for which ARG1 is the
1615 value_ref (struct value *arg1)
1618 struct type *type = check_typedef (value_type (arg1));
1620 if (TYPE_CODE (type) == TYPE_CODE_REF)
1623 arg2 = value_addr (arg1);
1624 deprecated_set_value_type (arg2, lookup_reference_type (type));
1628 /* Given a value of a pointer type, apply the C unary * operator to
1632 value_ind (struct value *arg1)
1634 struct type *base_type;
1637 arg1 = coerce_array (arg1);
1639 base_type = check_typedef (value_type (arg1));
1641 if (VALUE_LVAL (arg1) == lval_computed)
1643 struct lval_funcs *funcs = value_computed_funcs (arg1);
1645 if (funcs->indirect)
1647 struct value *result = funcs->indirect (arg1);
1654 if (TYPE_CODE (base_type) == TYPE_CODE_PTR)
1656 struct type *enc_type;
1658 /* We may be pointing to something embedded in a larger object.
1659 Get the real type of the enclosing object. */
1660 enc_type = check_typedef (value_enclosing_type (arg1));
1661 enc_type = TYPE_TARGET_TYPE (enc_type);
1663 if (TYPE_CODE (check_typedef (enc_type)) == TYPE_CODE_FUNC
1664 || TYPE_CODE (check_typedef (enc_type)) == TYPE_CODE_METHOD)
1665 /* For functions, go through find_function_addr, which knows
1666 how to handle function descriptors. */
1667 arg2 = value_at_lazy (enc_type,
1668 find_function_addr (arg1, NULL));
1670 /* Retrieve the enclosing object pointed to */
1671 arg2 = value_at_lazy (enc_type,
1672 (value_as_address (arg1)
1673 - value_pointed_to_offset (arg1)));
1675 /* Re-adjust type. */
1676 deprecated_set_value_type (arg2, TYPE_TARGET_TYPE (base_type));
1677 /* Add embedding info. */
1678 set_value_enclosing_type (arg2, enc_type);
1679 set_value_embedded_offset (arg2, value_pointed_to_offset (arg1));
1681 /* We may be pointing to an object of some derived type. */
1682 arg2 = value_full_object (arg2, NULL, 0, 0, 0);
1686 error (_("Attempt to take contents of a non-pointer value."));
1687 return 0; /* For lint -- never reached. */
1690 /* Create a value for an array by allocating space in GDB, copying
1691 copying the data into that space, and then setting up an array
1694 The array bounds are set from LOWBOUND and HIGHBOUND, and the array
1695 is populated from the values passed in ELEMVEC.
1697 The element type of the array is inherited from the type of the
1698 first element, and all elements must have the same size (though we
1699 don't currently enforce any restriction on their types). */
1702 value_array (int lowbound, int highbound, struct value **elemvec)
1706 unsigned int typelength;
1708 struct type *arraytype;
1710 /* Validate that the bounds are reasonable and that each of the
1711 elements have the same size. */
1713 nelem = highbound - lowbound + 1;
1716 error (_("bad array bounds (%d, %d)"), lowbound, highbound);
1718 typelength = TYPE_LENGTH (value_enclosing_type (elemvec[0]));
1719 for (idx = 1; idx < nelem; idx++)
1721 if (TYPE_LENGTH (value_enclosing_type (elemvec[idx])) != typelength)
1723 error (_("array elements must all be the same size"));
1727 arraytype = lookup_array_range_type (value_enclosing_type (elemvec[0]),
1728 lowbound, highbound);
1730 if (!current_language->c_style_arrays)
1732 val = allocate_value (arraytype);
1733 for (idx = 0; idx < nelem; idx++)
1735 memcpy (value_contents_all_raw (val) + (idx * typelength),
1736 value_contents_all (elemvec[idx]),
1742 /* Allocate space to store the array, and then initialize it by
1743 copying in each element. */
1745 val = allocate_value (arraytype);
1746 for (idx = 0; idx < nelem; idx++)
1747 memcpy (value_contents_writeable (val) + (idx * typelength),
1748 value_contents_all (elemvec[idx]),
1754 value_cstring (char *ptr, int len, struct type *char_type)
1757 int lowbound = current_language->string_lower_bound;
1758 int highbound = len / TYPE_LENGTH (char_type);
1759 struct type *stringtype
1760 = lookup_array_range_type (char_type, lowbound, highbound + lowbound - 1);
1762 val = allocate_value (stringtype);
1763 memcpy (value_contents_raw (val), ptr, len);
1767 /* Create a value for a string constant by allocating space in the
1768 inferior, copying the data into that space, and returning the
1769 address with type TYPE_CODE_STRING. PTR points to the string
1770 constant data; LEN is number of characters.
1772 Note that string types are like array of char types with a lower
1773 bound of zero and an upper bound of LEN - 1. Also note that the
1774 string may contain embedded null bytes. */
1777 value_string (char *ptr, int len, struct type *char_type)
1780 int lowbound = current_language->string_lower_bound;
1781 int highbound = len / TYPE_LENGTH (char_type);
1782 struct type *stringtype
1783 = lookup_string_range_type (char_type, lowbound, highbound + lowbound - 1);
1785 val = allocate_value (stringtype);
1786 memcpy (value_contents_raw (val), ptr, len);
1791 value_bitstring (char *ptr, int len, struct type *index_type)
1794 struct type *domain_type
1795 = create_range_type (NULL, index_type, 0, len - 1);
1796 struct type *type = create_set_type (NULL, domain_type);
1798 TYPE_CODE (type) = TYPE_CODE_BITSTRING;
1799 val = allocate_value (type);
1800 memcpy (value_contents_raw (val), ptr, TYPE_LENGTH (type));
1804 /* See if we can pass arguments in T2 to a function which takes
1805 arguments of types T1. T1 is a list of NARGS arguments, and T2 is
1806 a NULL-terminated vector. If some arguments need coercion of some
1807 sort, then the coerced values are written into T2. Return value is
1808 0 if the arguments could be matched, or the position at which they
1811 STATICP is nonzero if the T1 argument list came from a static
1812 member function. T2 will still include the ``this'' pointer, but
1815 For non-static member functions, we ignore the first argument,
1816 which is the type of the instance variable. This is because we
1817 want to handle calls with objects from derived classes. This is
1818 not entirely correct: we should actually check to make sure that a
1819 requested operation is type secure, shouldn't we? FIXME. */
1822 typecmp (int staticp, int varargs, int nargs,
1823 struct field t1[], struct value *t2[])
1828 internal_error (__FILE__, __LINE__,
1829 _("typecmp: no argument list"));
1831 /* Skip ``this'' argument if applicable. T2 will always include
1837 (i < nargs) && TYPE_CODE (t1[i].type) != TYPE_CODE_VOID;
1840 struct type *tt1, *tt2;
1845 tt1 = check_typedef (t1[i].type);
1846 tt2 = check_typedef (value_type (t2[i]));
1848 if (TYPE_CODE (tt1) == TYPE_CODE_REF
1849 /* We should be doing hairy argument matching, as below. */
1850 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1)))
1851 == TYPE_CODE (tt2)))
1853 if (TYPE_CODE (tt2) == TYPE_CODE_ARRAY)
1854 t2[i] = value_coerce_array (t2[i]);
1856 t2[i] = value_ref (t2[i]);
1860 /* djb - 20000715 - Until the new type structure is in the
1861 place, and we can attempt things like implicit conversions,
1862 we need to do this so you can take something like a map<const
1863 char *>, and properly access map["hello"], because the
1864 argument to [] will be a reference to a pointer to a char,
1865 and the argument will be a pointer to a char. */
1866 while (TYPE_CODE(tt1) == TYPE_CODE_REF
1867 || TYPE_CODE (tt1) == TYPE_CODE_PTR)
1869 tt1 = check_typedef( TYPE_TARGET_TYPE(tt1) );
1871 while (TYPE_CODE(tt2) == TYPE_CODE_ARRAY
1872 || TYPE_CODE(tt2) == TYPE_CODE_PTR
1873 || TYPE_CODE(tt2) == TYPE_CODE_REF)
1875 tt2 = check_typedef (TYPE_TARGET_TYPE(tt2));
1877 if (TYPE_CODE (tt1) == TYPE_CODE (tt2))
1879 /* Array to pointer is a `trivial conversion' according to the
1882 /* We should be doing much hairier argument matching (see
1883 section 13.2 of the ARM), but as a quick kludge, just check
1884 for the same type code. */
1885 if (TYPE_CODE (t1[i].type) != TYPE_CODE (value_type (t2[i])))
1888 if (varargs || t2[i] == NULL)
1893 /* Helper function used by value_struct_elt to recurse through
1894 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1895 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1896 TYPE. If found, return value, else return NULL.
1898 If LOOKING_FOR_BASECLASS, then instead of looking for struct
1899 fields, look for a baseclass named NAME. */
1901 static struct value *
1902 search_struct_field (const char *name, struct value *arg1, int offset,
1903 struct type *type, int looking_for_baseclass)
1908 CHECK_TYPEDEF (type);
1909 nbases = TYPE_N_BASECLASSES (type);
1911 if (!looking_for_baseclass)
1912 for (i = TYPE_NFIELDS (type) - 1; i >= nbases; i--)
1914 char *t_field_name = TYPE_FIELD_NAME (type, i);
1916 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
1920 if (field_is_static (&TYPE_FIELD (type, i)))
1922 v = value_static_field (type, i);
1924 error (_("field %s is nonexistent or "
1925 "has been optimized out"),
1930 v = value_primitive_field (arg1, offset, i, type);
1932 error (_("there is no field named %s"), name);
1938 && (t_field_name[0] == '\0'
1939 || (TYPE_CODE (type) == TYPE_CODE_UNION
1940 && (strcmp_iw (t_field_name, "else") == 0))))
1942 struct type *field_type = TYPE_FIELD_TYPE (type, i);
1944 if (TYPE_CODE (field_type) == TYPE_CODE_UNION
1945 || TYPE_CODE (field_type) == TYPE_CODE_STRUCT)
1947 /* Look for a match through the fields of an anonymous
1948 union, or anonymous struct. C++ provides anonymous
1951 In the GNU Chill (now deleted from GDB)
1952 implementation of variant record types, each
1953 <alternative field> has an (anonymous) union type,
1954 each member of the union represents a <variant
1955 alternative>. Each <variant alternative> is
1956 represented as a struct, with a member for each
1960 int new_offset = offset;
1962 /* This is pretty gross. In G++, the offset in an
1963 anonymous union is relative to the beginning of the
1964 enclosing struct. In the GNU Chill (now deleted
1965 from GDB) implementation of variant records, the
1966 bitpos is zero in an anonymous union field, so we
1967 have to add the offset of the union here. */
1968 if (TYPE_CODE (field_type) == TYPE_CODE_STRUCT
1969 || (TYPE_NFIELDS (field_type) > 0
1970 && TYPE_FIELD_BITPOS (field_type, 0) == 0))
1971 new_offset += TYPE_FIELD_BITPOS (type, i) / 8;
1973 v = search_struct_field (name, arg1, new_offset,
1975 looking_for_baseclass);
1982 for (i = 0; i < nbases; i++)
1985 struct type *basetype = check_typedef (TYPE_BASECLASS (type, i));
1986 /* If we are looking for baseclasses, this is what we get when
1987 we hit them. But it could happen that the base part's member
1988 name is not yet filled in. */
1989 int found_baseclass = (looking_for_baseclass
1990 && TYPE_BASECLASS_NAME (type, i) != NULL
1991 && (strcmp_iw (name,
1992 TYPE_BASECLASS_NAME (type,
1995 if (BASETYPE_VIA_VIRTUAL (type, i))
2000 boffset = baseclass_offset (type, i,
2001 value_contents (arg1) + offset,
2002 value_address (arg1)
2003 + value_embedded_offset (arg1)
2006 error (_("virtual baseclass botch"));
2008 /* The virtual base class pointer might have been clobbered
2009 by the user program. Make sure that it still points to a
2010 valid memory location. */
2012 boffset += value_embedded_offset (arg1) + offset;
2014 || boffset >= TYPE_LENGTH (value_enclosing_type (arg1)))
2016 CORE_ADDR base_addr;
2018 v2 = allocate_value (basetype);
2019 base_addr = value_address (arg1) + boffset;
2020 if (target_read_memory (base_addr,
2021 value_contents_raw (v2),
2022 TYPE_LENGTH (basetype)) != 0)
2023 error (_("virtual baseclass botch"));
2024 VALUE_LVAL (v2) = lval_memory;
2025 set_value_address (v2, base_addr);
2029 v2 = value_copy (arg1);
2030 deprecated_set_value_type (v2, basetype);
2031 set_value_embedded_offset (v2, boffset);
2034 if (found_baseclass)
2036 v = search_struct_field (name, v2, 0,
2037 TYPE_BASECLASS (type, i),
2038 looking_for_baseclass);
2040 else if (found_baseclass)
2041 v = value_primitive_field (arg1, offset, i, type);
2043 v = search_struct_field (name, arg1,
2044 offset + TYPE_BASECLASS_BITPOS (type,
2046 basetype, looking_for_baseclass);
2053 /* Helper function used by value_struct_elt to recurse through
2054 baseclasses. Look for a field NAME in ARG1. Adjust the address of
2055 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
2058 If found, return value, else if name matched and args not return
2059 (value) -1, else return NULL. */
2061 static struct value *
2062 search_struct_method (const char *name, struct value **arg1p,
2063 struct value **args, int offset,
2064 int *static_memfuncp, struct type *type)
2068 int name_matched = 0;
2069 char dem_opname[64];
2071 CHECK_TYPEDEF (type);
2072 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
2074 char *t_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
2076 /* FIXME! May need to check for ARM demangling here */
2077 if (strncmp (t_field_name, "__", 2) == 0 ||
2078 strncmp (t_field_name, "op", 2) == 0 ||
2079 strncmp (t_field_name, "type", 4) == 0)
2081 if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI))
2082 t_field_name = dem_opname;
2083 else if (cplus_demangle_opname (t_field_name, dem_opname, 0))
2084 t_field_name = dem_opname;
2086 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
2088 int j = TYPE_FN_FIELDLIST_LENGTH (type, i) - 1;
2089 struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i);
2092 check_stub_method_group (type, i);
2093 if (j > 0 && args == 0)
2094 error (_("cannot resolve overloaded method "
2095 "`%s': no arguments supplied"), name);
2096 else if (j == 0 && args == 0)
2098 v = value_fn_field (arg1p, f, j, type, offset);
2105 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f, j),
2106 TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f, j)),
2107 TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f, j)),
2108 TYPE_FN_FIELD_ARGS (f, j), args))
2110 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
2111 return value_virtual_fn_field (arg1p, f, j,
2113 if (TYPE_FN_FIELD_STATIC_P (f, j)
2115 *static_memfuncp = 1;
2116 v = value_fn_field (arg1p, f, j, type, offset);
2125 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2129 if (BASETYPE_VIA_VIRTUAL (type, i))
2131 struct type *baseclass = check_typedef (TYPE_BASECLASS (type, i));
2132 const gdb_byte *base_valaddr;
2134 /* The virtual base class pointer might have been
2135 clobbered by the user program. Make sure that it
2136 still points to a valid memory location. */
2138 if (offset < 0 || offset >= TYPE_LENGTH (type))
2140 gdb_byte *tmp = alloca (TYPE_LENGTH (baseclass));
2142 if (target_read_memory (value_address (*arg1p) + offset,
2143 tmp, TYPE_LENGTH (baseclass)) != 0)
2144 error (_("virtual baseclass botch"));
2148 base_valaddr = value_contents (*arg1p) + offset;
2150 base_offset = baseclass_offset (type, i, base_valaddr,
2151 value_address (*arg1p) + offset);
2152 if (base_offset == -1)
2153 error (_("virtual baseclass botch"));
2157 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
2159 v = search_struct_method (name, arg1p, args, base_offset + offset,
2160 static_memfuncp, TYPE_BASECLASS (type, i));
2161 if (v == (struct value *) - 1)
2167 /* FIXME-bothner: Why is this commented out? Why is it here? */
2168 /* *arg1p = arg1_tmp; */
2173 return (struct value *) - 1;
2178 /* Given *ARGP, a value of type (pointer to a)* structure/union,
2179 extract the component named NAME from the ultimate target
2180 structure/union and return it as a value with its appropriate type.
2181 ERR is used in the error message if *ARGP's type is wrong.
2183 C++: ARGS is a list of argument types to aid in the selection of
2184 an appropriate method. Also, handle derived types.
2186 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
2187 where the truthvalue of whether the function that was resolved was
2188 a static member function or not is stored.
2190 ERR is an error message to be printed in case the field is not
2194 value_struct_elt (struct value **argp, struct value **args,
2195 const char *name, int *static_memfuncp, const char *err)
2200 *argp = coerce_array (*argp);
2202 t = check_typedef (value_type (*argp));
2204 /* Follow pointers until we get to a non-pointer. */
2206 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
2208 *argp = value_ind (*argp);
2209 /* Don't coerce fn pointer to fn and then back again! */
2210 if (TYPE_CODE (value_type (*argp)) != TYPE_CODE_FUNC)
2211 *argp = coerce_array (*argp);
2212 t = check_typedef (value_type (*argp));
2215 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2216 && TYPE_CODE (t) != TYPE_CODE_UNION)
2217 error (_("Attempt to extract a component of a value that is not a %s."),
2220 /* Assume it's not, unless we see that it is. */
2221 if (static_memfuncp)
2222 *static_memfuncp = 0;
2226 /* if there are no arguments ...do this... */
2228 /* Try as a field first, because if we succeed, there is less
2230 v = search_struct_field (name, *argp, 0, t, 0);
2234 /* C++: If it was not found as a data field, then try to
2235 return it as a pointer to a method. */
2236 v = search_struct_method (name, argp, args, 0,
2237 static_memfuncp, t);
2239 if (v == (struct value *) - 1)
2240 error (_("Cannot take address of method %s."), name);
2243 if (TYPE_NFN_FIELDS (t))
2244 error (_("There is no member or method named %s."), name);
2246 error (_("There is no member named %s."), name);
2251 v = search_struct_method (name, argp, args, 0,
2252 static_memfuncp, t);
2254 if (v == (struct value *) - 1)
2256 error (_("One of the arguments you tried to pass to %s could not "
2257 "be converted to what the function wants."), name);
2261 /* See if user tried to invoke data as function. If so, hand it
2262 back. If it's not callable (i.e., a pointer to function),
2263 gdb should give an error. */
2264 v = search_struct_field (name, *argp, 0, t, 0);
2265 /* If we found an ordinary field, then it is not a method call.
2266 So, treat it as if it were a static member function. */
2267 if (v && static_memfuncp)
2268 *static_memfuncp = 1;
2272 throw_error (NOT_FOUND_ERROR,
2273 _("Structure has no component named %s."), name);
2277 /* Search through the methods of an object (and its bases) to find a
2278 specified method. Return the pointer to the fn_field list of
2279 overloaded instances.
2281 Helper function for value_find_oload_list.
2282 ARGP is a pointer to a pointer to a value (the object).
2283 METHOD is a string containing the method name.
2284 OFFSET is the offset within the value.
2285 TYPE is the assumed type of the object.
2286 NUM_FNS is the number of overloaded instances.
2287 BASETYPE is set to the actual type of the subobject where the
2289 BOFFSET is the offset of the base subobject where the method is found.
2292 static struct fn_field *
2293 find_method_list (struct value **argp, const char *method,
2294 int offset, struct type *type, int *num_fns,
2295 struct type **basetype, int *boffset)
2299 CHECK_TYPEDEF (type);
2303 /* First check in object itself. */
2304 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
2306 /* pai: FIXME What about operators and type conversions? */
2307 char *fn_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
2309 if (fn_field_name && (strcmp_iw (fn_field_name, method) == 0))
2311 int len = TYPE_FN_FIELDLIST_LENGTH (type, i);
2312 struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i);
2318 /* Resolve any stub methods. */
2319 check_stub_method_group (type, i);
2325 /* Not found in object, check in base subobjects. */
2326 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2330 if (BASETYPE_VIA_VIRTUAL (type, i))
2332 base_offset = value_offset (*argp) + offset;
2333 base_offset = baseclass_offset (type, i,
2334 value_contents (*argp) + base_offset,
2335 value_address (*argp) + base_offset);
2336 if (base_offset == -1)
2337 error (_("virtual baseclass botch"));
2339 else /* Non-virtual base, simply use bit position from debug
2342 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
2344 f = find_method_list (argp, method, base_offset + offset,
2345 TYPE_BASECLASS (type, i), num_fns,
2353 /* Return the list of overloaded methods of a specified name.
2355 ARGP is a pointer to a pointer to a value (the object).
2356 METHOD is the method name.
2357 OFFSET is the offset within the value contents.
2358 NUM_FNS is the number of overloaded instances.
2359 BASETYPE is set to the type of the base subobject that defines the
2361 BOFFSET is the offset of the base subobject which defines the method.
2365 value_find_oload_method_list (struct value **argp, const char *method,
2366 int offset, int *num_fns,
2367 struct type **basetype, int *boffset)
2371 t = check_typedef (value_type (*argp));
2373 /* Code snarfed from value_struct_elt. */
2374 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
2376 *argp = value_ind (*argp);
2377 /* Don't coerce fn pointer to fn and then back again! */
2378 if (TYPE_CODE (value_type (*argp)) != TYPE_CODE_FUNC)
2379 *argp = coerce_array (*argp);
2380 t = check_typedef (value_type (*argp));
2383 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2384 && TYPE_CODE (t) != TYPE_CODE_UNION)
2385 error (_("Attempt to extract a component of a "
2386 "value that is not a struct or union"));
2388 return find_method_list (argp, method, 0, t, num_fns,
2392 /* Given an array of argument types (ARGTYPES) (which includes an
2393 entry for "this" in the case of C++ methods), the number of
2394 arguments NARGS, the NAME of a function whether it's a method or
2395 not (METHOD), and the degree of laxness (LAX) in conforming to
2396 overload resolution rules in ANSI C++, find the best function that
2397 matches on the argument types according to the overload resolution
2400 METHOD can be one of three values:
2401 NON_METHOD for non-member functions.
2402 METHOD: for member functions.
2403 BOTH: used for overload resolution of operators where the
2404 candidates are expected to be either member or non member
2405 functions. In this case the first argument ARGTYPES
2406 (representing 'this') is expected to be a reference to the
2407 target object, and will be dereferenced when attempting the
2410 In the case of class methods, the parameter OBJ is an object value
2411 in which to search for overloaded methods.
2413 In the case of non-method functions, the parameter FSYM is a symbol
2414 corresponding to one of the overloaded functions.
2416 Return value is an integer: 0 -> good match, 10 -> debugger applied
2417 non-standard coercions, 100 -> incompatible.
2419 If a method is being searched for, VALP will hold the value.
2420 If a non-method is being searched for, SYMP will hold the symbol
2423 If a method is being searched for, and it is a static method,
2424 then STATICP will point to a non-zero value.
2426 If NO_ADL argument dependent lookup is disabled. This is used to prevent
2427 ADL overload candidates when performing overload resolution for a fully
2430 Note: This function does *not* check the value of
2431 overload_resolution. Caller must check it to see whether overload
2432 resolution is permitted.
2436 find_overload_match (struct type **arg_types, int nargs,
2437 const char *name, enum oload_search_type method,
2438 int lax, struct value **objp, struct symbol *fsym,
2439 struct value **valp, struct symbol **symp,
2440 int *staticp, const int no_adl)
2442 struct value *obj = (objp ? *objp : NULL);
2443 /* Index of best overloaded function. */
2444 int func_oload_champ = -1;
2445 int method_oload_champ = -1;
2447 /* The measure for the current best match. */
2448 struct badness_vector *method_badness = NULL;
2449 struct badness_vector *func_badness = NULL;
2451 struct value *temp = obj;
2452 /* For methods, the list of overloaded methods. */
2453 struct fn_field *fns_ptr = NULL;
2454 /* For non-methods, the list of overloaded function symbols. */
2455 struct symbol **oload_syms = NULL;
2456 /* Number of overloaded instances being considered. */
2458 struct type *basetype = NULL;
2461 struct cleanup *all_cleanups = make_cleanup (null_cleanup, NULL);
2463 const char *obj_type_name = NULL;
2464 const char *func_name = NULL;
2465 enum oload_classification match_quality;
2466 enum oload_classification method_match_quality = INCOMPATIBLE;
2467 enum oload_classification func_match_quality = INCOMPATIBLE;
2469 /* Get the list of overloaded methods or functions. */
2470 if (method == METHOD || method == BOTH)
2474 /* OBJ may be a pointer value rather than the object itself. */
2475 obj = coerce_ref (obj);
2476 while (TYPE_CODE (check_typedef (value_type (obj))) == TYPE_CODE_PTR)
2477 obj = coerce_ref (value_ind (obj));
2478 obj_type_name = TYPE_NAME (value_type (obj));
2480 /* First check whether this is a data member, e.g. a pointer to
2482 if (TYPE_CODE (check_typedef (value_type (obj))) == TYPE_CODE_STRUCT)
2484 *valp = search_struct_field (name, obj, 0,
2485 check_typedef (value_type (obj)), 0);
2493 /* Retrieve the list of methods with the name NAME. */
2494 fns_ptr = value_find_oload_method_list (&temp, name,
2496 &basetype, &boffset);
2497 /* If this is a method only search, and no methods were found
2498 the search has faild. */
2499 if (method == METHOD && (!fns_ptr || !num_fns))
2500 error (_("Couldn't find method %s%s%s"),
2502 (obj_type_name && *obj_type_name) ? "::" : "",
2504 /* If we are dealing with stub method types, they should have
2505 been resolved by find_method_list via
2506 value_find_oload_method_list above. */
2509 gdb_assert (TYPE_DOMAIN_TYPE (fns_ptr[0].type) != NULL);
2510 method_oload_champ = find_oload_champ (arg_types, nargs, method,
2512 oload_syms, &method_badness);
2514 method_match_quality =
2515 classify_oload_match (method_badness, nargs,
2516 oload_method_static (method, fns_ptr,
2517 method_oload_champ));
2519 make_cleanup (xfree, method_badness);
2524 if (method == NON_METHOD || method == BOTH)
2526 const char *qualified_name = NULL;
2528 /* If the the overload match is being search for both
2529 as a method and non member function, the first argument
2530 must now be dereferenced. */
2532 arg_types[0] = TYPE_TARGET_TYPE (arg_types[0]);
2536 qualified_name = SYMBOL_NATURAL_NAME (fsym);
2538 /* If we have a function with a C++ name, try to extract just
2539 the function part. Do not try this for non-functions (e.g.
2540 function pointers). */
2542 && TYPE_CODE (check_typedef (SYMBOL_TYPE (fsym)))
2547 temp = cp_func_name (qualified_name);
2549 /* If cp_func_name did not remove anything, the name of the
2550 symbol did not include scope or argument types - it was
2551 probably a C-style function. */
2554 make_cleanup (xfree, temp);
2555 if (strcmp (temp, qualified_name) == 0)
2565 qualified_name = name;
2568 /* If there was no C++ name, this must be a C-style function or
2569 not a function at all. Just return the same symbol. Do the
2570 same if cp_func_name fails for some reason. */
2571 if (func_name == NULL)
2577 func_oload_champ = find_oload_champ_namespace (arg_types, nargs,
2584 if (func_oload_champ >= 0)
2585 func_match_quality = classify_oload_match (func_badness, nargs, 0);
2587 make_cleanup (xfree, oload_syms);
2588 make_cleanup (xfree, func_badness);
2591 /* Did we find a match ? */
2592 if (method_oload_champ == -1 && func_oload_champ == -1)
2593 throw_error (NOT_FOUND_ERROR,
2594 _("No symbol \"%s\" in current context."),
2597 /* If we have found both a method match and a function
2598 match, find out which one is better, and calculate match
2600 if (method_oload_champ >= 0 && func_oload_champ >= 0)
2602 switch (compare_badness (func_badness, method_badness))
2604 case 0: /* Top two contenders are equally good. */
2605 /* FIXME: GDB does not support the general ambiguous
2606 case. All candidates should be collected and presented
2608 error (_("Ambiguous overload resolution"));
2610 case 1: /* Incomparable top contenders. */
2611 /* This is an error incompatible candidates
2612 should not have been proposed. */
2613 error (_("Internal error: incompatible "
2614 "overload candidates proposed"));
2616 case 2: /* Function champion. */
2617 method_oload_champ = -1;
2618 match_quality = func_match_quality;
2620 case 3: /* Method champion. */
2621 func_oload_champ = -1;
2622 match_quality = method_match_quality;
2625 error (_("Internal error: unexpected overload comparison result"));
2631 /* We have either a method match or a function match. */
2632 if (method_oload_champ >= 0)
2633 match_quality = method_match_quality;
2635 match_quality = func_match_quality;
2638 if (match_quality == INCOMPATIBLE)
2640 if (method == METHOD)
2641 error (_("Cannot resolve method %s%s%s to any overloaded instance"),
2643 (obj_type_name && *obj_type_name) ? "::" : "",
2646 error (_("Cannot resolve function %s to any overloaded instance"),
2649 else if (match_quality == NON_STANDARD)
2651 if (method == METHOD)
2652 warning (_("Using non-standard conversion to match "
2653 "method %s%s%s to supplied arguments"),
2655 (obj_type_name && *obj_type_name) ? "::" : "",
2658 warning (_("Using non-standard conversion to match "
2659 "function %s to supplied arguments"),
2663 if (staticp != NULL)
2664 *staticp = oload_method_static (method, fns_ptr, method_oload_champ);
2666 if (method_oload_champ >= 0)
2668 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr, method_oload_champ))
2669 *valp = value_virtual_fn_field (&temp, fns_ptr, method_oload_champ,
2672 *valp = value_fn_field (&temp, fns_ptr, method_oload_champ,
2676 *symp = oload_syms[func_oload_champ];
2680 struct type *temp_type = check_typedef (value_type (temp));
2681 struct type *obj_type = check_typedef (value_type (*objp));
2683 if (TYPE_CODE (temp_type) != TYPE_CODE_PTR
2684 && (TYPE_CODE (obj_type) == TYPE_CODE_PTR
2685 || TYPE_CODE (obj_type) == TYPE_CODE_REF))
2687 temp = value_addr (temp);
2692 do_cleanups (all_cleanups);
2694 switch (match_quality)
2700 default: /* STANDARD */
2705 /* Find the best overload match, searching for FUNC_NAME in namespaces
2706 contained in QUALIFIED_NAME until it either finds a good match or
2707 runs out of namespaces. It stores the overloaded functions in
2708 *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. The
2709 calling function is responsible for freeing *OLOAD_SYMS and
2710 *OLOAD_CHAMP_BV. If NO_ADL, argument dependent lookup is not
2714 find_oload_champ_namespace (struct type **arg_types, int nargs,
2715 const char *func_name,
2716 const char *qualified_name,
2717 struct symbol ***oload_syms,
2718 struct badness_vector **oload_champ_bv,
2723 find_oload_champ_namespace_loop (arg_types, nargs,
2726 oload_syms, oload_champ_bv,
2733 /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is
2734 how deep we've looked for namespaces, and the champ is stored in
2735 OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0
2736 if it isn't. Other arguments are the same as in
2737 find_oload_champ_namespace
2739 It is the caller's responsibility to free *OLOAD_SYMS and
2743 find_oload_champ_namespace_loop (struct type **arg_types, int nargs,
2744 const char *func_name,
2745 const char *qualified_name,
2747 struct symbol ***oload_syms,
2748 struct badness_vector **oload_champ_bv,
2752 int next_namespace_len = namespace_len;
2753 int searched_deeper = 0;
2755 struct cleanup *old_cleanups;
2756 int new_oload_champ;
2757 struct symbol **new_oload_syms;
2758 struct badness_vector *new_oload_champ_bv;
2759 char *new_namespace;
2761 if (next_namespace_len != 0)
2763 gdb_assert (qualified_name[next_namespace_len] == ':');
2764 next_namespace_len += 2;
2766 next_namespace_len +=
2767 cp_find_first_component (qualified_name + next_namespace_len);
2769 /* Initialize these to values that can safely be xfree'd. */
2771 *oload_champ_bv = NULL;
2773 /* First, see if we have a deeper namespace we can search in.
2774 If we get a good match there, use it. */
2776 if (qualified_name[next_namespace_len] == ':')
2778 searched_deeper = 1;
2780 if (find_oload_champ_namespace_loop (arg_types, nargs,
2781 func_name, qualified_name,
2783 oload_syms, oload_champ_bv,
2784 oload_champ, no_adl))
2790 /* If we reach here, either we're in the deepest namespace or we
2791 didn't find a good match in a deeper namespace. But, in the
2792 latter case, we still have a bad match in a deeper namespace;
2793 note that we might not find any match at all in the current
2794 namespace. (There's always a match in the deepest namespace,
2795 because this overload mechanism only gets called if there's a
2796 function symbol to start off with.) */
2798 old_cleanups = make_cleanup (xfree, *oload_syms);
2799 make_cleanup (xfree, *oload_champ_bv);
2800 new_namespace = alloca (namespace_len + 1);
2801 strncpy (new_namespace, qualified_name, namespace_len);
2802 new_namespace[namespace_len] = '\0';
2803 new_oload_syms = make_symbol_overload_list (func_name,
2806 /* If we have reached the deepest level perform argument
2807 determined lookup. */
2808 if (!searched_deeper && !no_adl)
2809 make_symbol_overload_list_adl (arg_types, nargs, func_name);
2811 while (new_oload_syms[num_fns])
2814 new_oload_champ = find_oload_champ (arg_types, nargs, 0, num_fns,
2815 NULL, new_oload_syms,
2816 &new_oload_champ_bv);
2818 /* Case 1: We found a good match. Free earlier matches (if any),
2819 and return it. Case 2: We didn't find a good match, but we're
2820 not the deepest function. Then go with the bad match that the
2821 deeper function found. Case 3: We found a bad match, and we're
2822 the deepest function. Then return what we found, even though
2823 it's a bad match. */
2825 if (new_oload_champ != -1
2826 && classify_oload_match (new_oload_champ_bv, nargs, 0) == STANDARD)
2828 *oload_syms = new_oload_syms;
2829 *oload_champ = new_oload_champ;
2830 *oload_champ_bv = new_oload_champ_bv;
2831 do_cleanups (old_cleanups);
2834 else if (searched_deeper)
2836 xfree (new_oload_syms);
2837 xfree (new_oload_champ_bv);
2838 discard_cleanups (old_cleanups);
2843 *oload_syms = new_oload_syms;
2844 *oload_champ = new_oload_champ;
2845 *oload_champ_bv = new_oload_champ_bv;
2846 do_cleanups (old_cleanups);
2851 /* Look for a function to take NARGS args of types ARG_TYPES. Find
2852 the best match from among the overloaded methods or functions
2853 (depending on METHOD) given by FNS_PTR or OLOAD_SYMS, respectively.
2854 The number of methods/functions in the list is given by NUM_FNS.
2855 Return the index of the best match; store an indication of the
2856 quality of the match in OLOAD_CHAMP_BV.
2858 It is the caller's responsibility to free *OLOAD_CHAMP_BV. */
2861 find_oload_champ (struct type **arg_types, int nargs, int method,
2862 int num_fns, struct fn_field *fns_ptr,
2863 struct symbol **oload_syms,
2864 struct badness_vector **oload_champ_bv)
2867 /* A measure of how good an overloaded instance is. */
2868 struct badness_vector *bv;
2869 /* Index of best overloaded function. */
2870 int oload_champ = -1;
2871 /* Current ambiguity state for overload resolution. */
2872 int oload_ambiguous = 0;
2873 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */
2875 *oload_champ_bv = NULL;
2877 /* Consider each candidate in turn. */
2878 for (ix = 0; ix < num_fns; ix++)
2881 int static_offset = oload_method_static (method, fns_ptr, ix);
2883 struct type **parm_types;
2887 nparms = TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (fns_ptr, ix));
2891 /* If it's not a method, this is the proper place. */
2892 nparms = TYPE_NFIELDS (SYMBOL_TYPE (oload_syms[ix]));
2895 /* Prepare array of parameter types. */
2896 parm_types = (struct type **)
2897 xmalloc (nparms * (sizeof (struct type *)));
2898 for (jj = 0; jj < nparms; jj++)
2899 parm_types[jj] = (method
2900 ? (TYPE_FN_FIELD_ARGS (fns_ptr, ix)[jj].type)
2901 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms[ix]),
2904 /* Compare parameter types to supplied argument types. Skip
2905 THIS for static methods. */
2906 bv = rank_function (parm_types, nparms,
2907 arg_types + static_offset,
2908 nargs - static_offset);
2910 if (!*oload_champ_bv)
2912 *oload_champ_bv = bv;
2915 else /* See whether current candidate is better or worse than
2917 switch (compare_badness (bv, *oload_champ_bv))
2919 case 0: /* Top two contenders are equally good. */
2920 oload_ambiguous = 1;
2922 case 1: /* Incomparable top contenders. */
2923 oload_ambiguous = 2;
2925 case 2: /* New champion, record details. */
2926 *oload_champ_bv = bv;
2927 oload_ambiguous = 0;
2938 fprintf_filtered (gdb_stderr,
2939 "Overloaded method instance %s, # of parms %d\n",
2940 fns_ptr[ix].physname, nparms);
2942 fprintf_filtered (gdb_stderr,
2943 "Overloaded function instance "
2944 "%s # of parms %d\n",
2945 SYMBOL_DEMANGLED_NAME (oload_syms[ix]),
2947 for (jj = 0; jj < nargs - static_offset; jj++)
2948 fprintf_filtered (gdb_stderr,
2949 "...Badness @ %d : %d\n",
2950 jj, bv->rank[jj].rank);
2951 fprintf_filtered (gdb_stderr, "Overload resolution "
2952 "champion is %d, ambiguous? %d\n",
2953 oload_champ, oload_ambiguous);
2960 /* Return 1 if we're looking at a static method, 0 if we're looking at
2961 a non-static method or a function that isn't a method. */
2964 oload_method_static (int method, struct fn_field *fns_ptr, int index)
2966 if (method && fns_ptr && index >= 0
2967 && TYPE_FN_FIELD_STATIC_P (fns_ptr, index))
2973 /* Check how good an overload match OLOAD_CHAMP_BV represents. */
2975 static enum oload_classification
2976 classify_oload_match (struct badness_vector *oload_champ_bv,
2982 for (ix = 1; ix <= nargs - static_offset; ix++)
2984 /* If this conversion is as bad as INCOMPATIBLE_TYPE_BADNESS
2985 or worse return INCOMPATIBLE. */
2986 if (compare_ranks (oload_champ_bv->rank[ix],
2987 INCOMPATIBLE_TYPE_BADNESS) <= 0)
2988 return INCOMPATIBLE; /* Truly mismatched types. */
2989 /* Otherwise If this conversion is as bad as
2990 NS_POINTER_CONVERSION_BADNESS or worse return NON_STANDARD. */
2991 else if (compare_ranks (oload_champ_bv->rank[ix],
2992 NS_POINTER_CONVERSION_BADNESS) <= 0)
2993 return NON_STANDARD; /* Non-standard type conversions
2997 return STANDARD; /* Only standard conversions needed. */
3000 /* C++: return 1 is NAME is a legitimate name for the destructor of
3001 type TYPE. If TYPE does not have a destructor, or if NAME is
3002 inappropriate for TYPE, an error is signaled. */
3004 destructor_name_p (const char *name, const struct type *type)
3008 char *dname = type_name_no_tag (type);
3009 char *cp = strchr (dname, '<');
3012 /* Do not compare the template part for template classes. */
3014 len = strlen (dname);
3017 if (strlen (name + 1) != len || strncmp (dname, name + 1, len) != 0)
3018 error (_("name of destructor must equal name of class"));
3025 /* Given TYPE, a structure/union,
3026 return 1 if the component named NAME from the ultimate target
3027 structure/union is defined, otherwise, return 0. */
3030 check_field (struct type *type, const char *name)
3034 /* The type may be a stub. */
3035 CHECK_TYPEDEF (type);
3037 for (i = TYPE_NFIELDS (type) - 1; i >= TYPE_N_BASECLASSES (type); i--)
3039 char *t_field_name = TYPE_FIELD_NAME (type, i);
3041 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
3045 /* C++: If it was not found as a data field, then try to return it
3046 as a pointer to a method. */
3048 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; --i)
3050 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type, i), name) == 0)
3054 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
3055 if (check_field (TYPE_BASECLASS (type, i), name))
3061 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3062 return the appropriate member (or the address of the member, if
3063 WANT_ADDRESS). This function is used to resolve user expressions
3064 of the form "DOMAIN::NAME". For more details on what happens, see
3065 the comment before value_struct_elt_for_reference. */
3068 value_aggregate_elt (struct type *curtype, char *name,
3069 struct type *expect_type, int want_address,
3072 switch (TYPE_CODE (curtype))
3074 case TYPE_CODE_STRUCT:
3075 case TYPE_CODE_UNION:
3076 return value_struct_elt_for_reference (curtype, 0, curtype,
3078 want_address, noside);
3079 case TYPE_CODE_NAMESPACE:
3080 return value_namespace_elt (curtype, name,
3081 want_address, noside);
3083 internal_error (__FILE__, __LINE__,
3084 _("non-aggregate type in value_aggregate_elt"));
3088 /* Compares the two method/function types T1 and T2 for "equality"
3089 with respect to the the methods' parameters. If the types of the
3090 two parameter lists are the same, returns 1; 0 otherwise. This
3091 comparison may ignore any artificial parameters in T1 if
3092 SKIP_ARTIFICIAL is non-zero. This function will ALWAYS skip
3093 the first artificial parameter in T1, assumed to be a 'this' pointer.
3095 The type T2 is expected to have come from make_params (in eval.c). */
3098 compare_parameters (struct type *t1, struct type *t2, int skip_artificial)
3102 if (TYPE_FIELD_ARTIFICIAL (t1, 0))
3105 /* If skipping artificial fields, find the first real field
3107 if (skip_artificial)
3109 while (start < TYPE_NFIELDS (t1)
3110 && TYPE_FIELD_ARTIFICIAL (t1, start))
3114 /* Now compare parameters */
3116 /* Special case: a method taking void. T1 will contain no
3117 non-artificial fields, and T2 will contain TYPE_CODE_VOID. */
3118 if ((TYPE_NFIELDS (t1) - start) == 0 && TYPE_NFIELDS (t2) == 1
3119 && TYPE_CODE (TYPE_FIELD_TYPE (t2, 0)) == TYPE_CODE_VOID)
3122 if ((TYPE_NFIELDS (t1) - start) == TYPE_NFIELDS (t2))
3126 for (i = 0; i < TYPE_NFIELDS (t2); ++i)
3128 if (compare_ranks (rank_one_type (TYPE_FIELD_TYPE (t1, start + i),
3129 TYPE_FIELD_TYPE (t2, i)),
3130 EXACT_MATCH_BADNESS) != 0)
3140 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3141 return the address of this member as a "pointer to member" type.
3142 If INTYPE is non-null, then it will be the type of the member we
3143 are looking for. This will help us resolve "pointers to member
3144 functions". This function is used to resolve user expressions of
3145 the form "DOMAIN::NAME". */
3147 static struct value *
3148 value_struct_elt_for_reference (struct type *domain, int offset,
3149 struct type *curtype, char *name,
3150 struct type *intype,
3154 struct type *t = curtype;
3156 struct value *v, *result;
3158 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
3159 && TYPE_CODE (t) != TYPE_CODE_UNION)
3160 error (_("Internal error: non-aggregate type "
3161 "to value_struct_elt_for_reference"));
3163 for (i = TYPE_NFIELDS (t) - 1; i >= TYPE_N_BASECLASSES (t); i--)
3165 char *t_field_name = TYPE_FIELD_NAME (t, i);
3167 if (t_field_name && strcmp (t_field_name, name) == 0)
3169 if (field_is_static (&TYPE_FIELD (t, i)))
3171 v = value_static_field (t, i);
3173 error (_("static field %s has been optimized out"),
3179 if (TYPE_FIELD_PACKED (t, i))
3180 error (_("pointers to bitfield members not allowed"));
3183 return value_from_longest
3184 (lookup_memberptr_type (TYPE_FIELD_TYPE (t, i), domain),
3185 offset + (LONGEST) (TYPE_FIELD_BITPOS (t, i) >> 3));
3186 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
3187 return allocate_value (TYPE_FIELD_TYPE (t, i));
3189 error (_("Cannot reference non-static field \"%s\""), name);
3193 /* C++: If it was not found as a data field, then try to return it
3194 as a pointer to a method. */
3196 /* Perform all necessary dereferencing. */
3197 while (intype && TYPE_CODE (intype) == TYPE_CODE_PTR)
3198 intype = TYPE_TARGET_TYPE (intype);
3200 for (i = TYPE_NFN_FIELDS (t) - 1; i >= 0; --i)
3202 char *t_field_name = TYPE_FN_FIELDLIST_NAME (t, i);
3203 char dem_opname[64];
3205 if (strncmp (t_field_name, "__", 2) == 0
3206 || strncmp (t_field_name, "op", 2) == 0
3207 || strncmp (t_field_name, "type", 4) == 0)
3209 if (cplus_demangle_opname (t_field_name,
3210 dem_opname, DMGL_ANSI))
3211 t_field_name = dem_opname;
3212 else if (cplus_demangle_opname (t_field_name,
3214 t_field_name = dem_opname;
3216 if (t_field_name && strcmp (t_field_name, name) == 0)
3219 int len = TYPE_FN_FIELDLIST_LENGTH (t, i);
3220 struct fn_field *f = TYPE_FN_FIELDLIST1 (t, i);
3222 check_stub_method_group (t, i);
3226 for (j = 0; j < len; ++j)
3228 if (compare_parameters (TYPE_FN_FIELD_TYPE (f, j), intype, 0)
3229 || compare_parameters (TYPE_FN_FIELD_TYPE (f, j),
3235 error (_("no member function matches "
3236 "that type instantiation"));
3243 for (ii = 0; ii < TYPE_FN_FIELDLIST_LENGTH (t, i);
3246 /* Skip artificial methods. This is necessary if,
3247 for example, the user wants to "print
3248 subclass::subclass" with only one user-defined
3249 constructor. There is no ambiguity in this
3251 if (TYPE_FN_FIELD_ARTIFICIAL (f, ii))
3254 /* Desired method is ambiguous if more than one
3255 method is defined. */
3257 error (_("non-unique member `%s' requires "
3258 "type instantiation"), name);
3264 if (TYPE_FN_FIELD_STATIC_P (f, j))
3267 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j),
3274 return value_addr (read_var_value (s, 0));
3276 return read_var_value (s, 0);
3279 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
3283 result = allocate_value
3284 (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f, j)));
3285 cplus_make_method_ptr (value_type (result),
3286 value_contents_writeable (result),
3287 TYPE_FN_FIELD_VOFFSET (f, j), 1);
3289 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
3290 return allocate_value (TYPE_FN_FIELD_TYPE (f, j));
3292 error (_("Cannot reference virtual member function \"%s\""),
3298 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j),
3304 v = read_var_value (s, 0);
3309 result = allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f, j)));
3310 cplus_make_method_ptr (value_type (result),
3311 value_contents_writeable (result),
3312 value_address (v), 0);
3318 for (i = TYPE_N_BASECLASSES (t) - 1; i >= 0; i--)
3323 if (BASETYPE_VIA_VIRTUAL (t, i))
3326 base_offset = TYPE_BASECLASS_BITPOS (t, i) / 8;
3327 v = value_struct_elt_for_reference (domain,
3328 offset + base_offset,
3329 TYPE_BASECLASS (t, i),
3331 want_address, noside);
3336 /* As a last chance, pretend that CURTYPE is a namespace, and look
3337 it up that way; this (frequently) works for types nested inside
3340 return value_maybe_namespace_elt (curtype, name,
3341 want_address, noside);
3344 /* C++: Return the member NAME of the namespace given by the type
3347 static struct value *
3348 value_namespace_elt (const struct type *curtype,
3349 char *name, int want_address,
3352 struct value *retval = value_maybe_namespace_elt (curtype, name,
3357 error (_("No symbol \"%s\" in namespace \"%s\"."),
3358 name, TYPE_TAG_NAME (curtype));
3363 /* A helper function used by value_namespace_elt and
3364 value_struct_elt_for_reference. It looks up NAME inside the
3365 context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE
3366 is a class and NAME refers to a type in CURTYPE itself (as opposed
3367 to, say, some base class of CURTYPE). */
3369 static struct value *
3370 value_maybe_namespace_elt (const struct type *curtype,
3371 char *name, int want_address,
3374 const char *namespace_name = TYPE_TAG_NAME (curtype);
3376 struct value *result;
3378 sym = cp_lookup_symbol_namespace (namespace_name, name,
3379 get_selected_block (0), VAR_DOMAIN);
3383 char *concatenated_name = alloca (strlen (namespace_name) + 2
3384 + strlen (name) + 1);
3386 sprintf (concatenated_name, "%s::%s", namespace_name, name);
3387 sym = lookup_static_symbol_aux (concatenated_name, VAR_DOMAIN);
3392 else if ((noside == EVAL_AVOID_SIDE_EFFECTS)
3393 && (SYMBOL_CLASS (sym) == LOC_TYPEDEF))
3394 result = allocate_value (SYMBOL_TYPE (sym));
3396 result = value_of_variable (sym, get_selected_block (0));
3398 if (result && want_address)
3399 result = value_addr (result);
3404 /* Given a pointer value V, find the real (RTTI) type of the object it
3407 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
3408 and refer to the values computed for the object pointed to. */
3411 value_rtti_target_type (struct value *v, int *full,
3412 int *top, int *using_enc)
3414 struct value *target;
3416 target = value_ind (v);
3418 return value_rtti_type (target, full, top, using_enc);
3421 /* Given a value pointed to by ARGP, check its real run-time type, and
3422 if that is different from the enclosing type, create a new value
3423 using the real run-time type as the enclosing type (and of the same
3424 type as ARGP) and return it, with the embedded offset adjusted to
3425 be the correct offset to the enclosed object. RTYPE is the type,
3426 and XFULL, XTOP, and XUSING_ENC are the other parameters, computed
3427 by value_rtti_type(). If these are available, they can be supplied
3428 and a second call to value_rtti_type() is avoided. (Pass RTYPE ==
3429 NULL if they're not available. */
3432 value_full_object (struct value *argp,
3434 int xfull, int xtop,
3437 struct type *real_type;
3441 struct value *new_val;
3448 using_enc = xusing_enc;
3451 real_type = value_rtti_type (argp, &full, &top, &using_enc);
3453 /* If no RTTI data, or if object is already complete, do nothing. */
3454 if (!real_type || real_type == value_enclosing_type (argp))
3457 /* If we have the full object, but for some reason the enclosing
3458 type is wrong, set it. */
3459 /* pai: FIXME -- sounds iffy */
3462 argp = value_copy (argp);
3463 set_value_enclosing_type (argp, real_type);
3467 /* Check if object is in memory */
3468 if (VALUE_LVAL (argp) != lval_memory)
3470 warning (_("Couldn't retrieve complete object of RTTI "
3471 "type %s; object may be in register(s)."),
3472 TYPE_NAME (real_type));
3477 /* All other cases -- retrieve the complete object. */
3478 /* Go back by the computed top_offset from the beginning of the
3479 object, adjusting for the embedded offset of argp if that's what
3480 value_rtti_type used for its computation. */
3481 new_val = value_at_lazy (real_type, value_address (argp) - top +
3482 (using_enc ? 0 : value_embedded_offset (argp)));
3483 deprecated_set_value_type (new_val, value_type (argp));
3484 set_value_embedded_offset (new_val, (using_enc
3485 ? top + value_embedded_offset (argp)
3491 /* Return the value of the local variable, if one exists.
3492 Flag COMPLAIN signals an error if the request is made in an
3493 inappropriate context. */
3496 value_of_local (const char *name, int complain)
3498 struct symbol *func, *sym;
3501 struct frame_info *frame;
3504 frame = get_selected_frame (_("no frame selected"));
3507 frame = deprecated_safe_get_selected_frame ();
3512 func = get_frame_function (frame);
3516 error (_("no `%s' in nameless context"), name);
3521 b = SYMBOL_BLOCK_VALUE (func);
3522 if (dict_empty (BLOCK_DICT (b)))
3525 error (_("no args, no `%s'"), name);
3530 /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER
3531 symbol instead of the LOC_ARG one (if both exist). */
3532 sym = lookup_block_symbol (b, name, VAR_DOMAIN);
3536 error (_("current stack frame does not contain a variable named `%s'"),
3542 ret = read_var_value (sym, frame);
3543 if (ret == 0 && complain)
3544 error (_("`%s' argument unreadable"), name);
3548 /* C++/Objective-C: return the value of the class instance variable,
3549 if one exists. Flag COMPLAIN signals an error if the request is
3550 made in an inappropriate context. */
3553 value_of_this (int complain)
3555 if (!current_language->la_name_of_this)
3557 return value_of_local (current_language->la_name_of_this, complain);
3560 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH
3561 elements long, starting at LOWBOUND. The result has the same lower
3562 bound as the original ARRAY. */
3565 value_slice (struct value *array, int lowbound, int length)
3567 struct type *slice_range_type, *slice_type, *range_type;
3568 LONGEST lowerbound, upperbound;
3569 struct value *slice;
3570 struct type *array_type;
3572 array_type = check_typedef (value_type (array));
3573 if (TYPE_CODE (array_type) != TYPE_CODE_ARRAY
3574 && TYPE_CODE (array_type) != TYPE_CODE_STRING
3575 && TYPE_CODE (array_type) != TYPE_CODE_BITSTRING)
3576 error (_("cannot take slice of non-array"));
3578 range_type = TYPE_INDEX_TYPE (array_type);
3579 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
3580 error (_("slice from bad array or bitstring"));
3582 if (lowbound < lowerbound || length < 0
3583 || lowbound + length - 1 > upperbound)
3584 error (_("slice out of range"));
3586 /* FIXME-type-allocation: need a way to free this type when we are
3588 slice_range_type = create_range_type ((struct type *) NULL,
3589 TYPE_TARGET_TYPE (range_type),
3591 lowbound + length - 1);
3592 if (TYPE_CODE (array_type) == TYPE_CODE_BITSTRING)
3596 slice_type = create_set_type ((struct type *) NULL,
3598 TYPE_CODE (slice_type) = TYPE_CODE_BITSTRING;
3599 slice = value_zero (slice_type, not_lval);
3601 for (i = 0; i < length; i++)
3603 int element = value_bit_index (array_type,
3604 value_contents (array),
3608 error (_("internal error accessing bitstring"));
3609 else if (element > 0)
3611 int j = i % TARGET_CHAR_BIT;
3613 if (gdbarch_bits_big_endian (get_type_arch (array_type)))
3614 j = TARGET_CHAR_BIT - 1 - j;
3615 value_contents_raw (slice)[i / TARGET_CHAR_BIT] |= (1 << j);
3618 /* We should set the address, bitssize, and bitspos, so the
3619 slice can be used on the LHS, but that may require extensions
3620 to value_assign. For now, just leave as a non_lval.
3625 struct type *element_type = TYPE_TARGET_TYPE (array_type);
3627 (lowbound - lowerbound) * TYPE_LENGTH (check_typedef (element_type));
3629 slice_type = create_array_type ((struct type *) NULL,
3632 TYPE_CODE (slice_type) = TYPE_CODE (array_type);
3634 if (VALUE_LVAL (array) == lval_memory && value_lazy (array))
3635 slice = allocate_value_lazy (slice_type);
3638 slice = allocate_value (slice_type);
3639 memcpy (value_contents_writeable (slice),
3640 value_contents (array) + offset,
3641 TYPE_LENGTH (slice_type));
3644 set_value_component_location (slice, array);
3645 VALUE_FRAME_ID (slice) = VALUE_FRAME_ID (array);
3646 set_value_offset (slice, value_offset (array) + offset);
3651 /* Create a value for a FORTRAN complex number. Currently most of the
3652 time values are coerced to COMPLEX*16 (i.e. a complex number
3653 composed of 2 doubles. This really should be a smarter routine
3654 that figures out precision inteligently as opposed to assuming
3655 doubles. FIXME: fmb */
3658 value_literal_complex (struct value *arg1,
3663 struct type *real_type = TYPE_TARGET_TYPE (type);
3665 val = allocate_value (type);
3666 arg1 = value_cast (real_type, arg1);
3667 arg2 = value_cast (real_type, arg2);
3669 memcpy (value_contents_raw (val),
3670 value_contents (arg1), TYPE_LENGTH (real_type));
3671 memcpy (value_contents_raw (val) + TYPE_LENGTH (real_type),
3672 value_contents (arg2), TYPE_LENGTH (real_type));
3676 /* Cast a value into the appropriate complex data type. */
3678 static struct value *
3679 cast_into_complex (struct type *type, struct value *val)
3681 struct type *real_type = TYPE_TARGET_TYPE (type);
3683 if (TYPE_CODE (value_type (val)) == TYPE_CODE_COMPLEX)
3685 struct type *val_real_type = TYPE_TARGET_TYPE (value_type (val));
3686 struct value *re_val = allocate_value (val_real_type);
3687 struct value *im_val = allocate_value (val_real_type);
3689 memcpy (value_contents_raw (re_val),
3690 value_contents (val), TYPE_LENGTH (val_real_type));
3691 memcpy (value_contents_raw (im_val),
3692 value_contents (val) + TYPE_LENGTH (val_real_type),
3693 TYPE_LENGTH (val_real_type));
3695 return value_literal_complex (re_val, im_val, type);
3697 else if (TYPE_CODE (value_type (val)) == TYPE_CODE_FLT
3698 || TYPE_CODE (value_type (val)) == TYPE_CODE_INT)
3699 return value_literal_complex (val,
3700 value_zero (real_type, not_lval),
3703 error (_("cannot cast non-number to complex"));
3707 _initialize_valops (void)
3709 add_setshow_boolean_cmd ("overload-resolution", class_support,
3710 &overload_resolution, _("\
3711 Set overload resolution in evaluating C++ functions."), _("\
3712 Show overload resolution in evaluating C++ functions."),
3714 show_overload_resolution,
3715 &setlist, &showlist);
3716 overload_resolution = 1;