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 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, _("\
126 Overload resolution in evaluating 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 requires the target program to be active"));
180 error (_("evaluation of this expression requires the program to have a function \"%s\"."), name);
185 /* Allocate NBYTES of space in the inferior using the inferior's
186 malloc and return a value that is a pointer to the allocated
190 value_allocate_space_in_inferior (int len)
192 struct objfile *objf;
193 struct value *val = find_function_in_inferior ("malloc", &objf);
194 struct gdbarch *gdbarch = get_objfile_arch (objf);
195 struct value *blocklen;
197 blocklen = value_from_longest (builtin_type (gdbarch)->builtin_int, len);
198 val = call_function_by_hand (val, 1, &blocklen);
199 if (value_logical_not (val))
201 if (!target_has_execution)
202 error (_("No memory available to program now: you need to start the target first"));
204 error (_("No memory available to program: call to malloc failed"));
210 allocate_space_in_inferior (int len)
212 return value_as_long (value_allocate_space_in_inferior (len));
215 /* Cast struct value VAL to type TYPE and return as a value.
216 Both type and val must be of TYPE_CODE_STRUCT or TYPE_CODE_UNION
217 for this to work. Typedef to one of the codes is permitted.
218 Returns NULL if the cast is neither an upcast nor a downcast. */
220 static struct value *
221 value_cast_structs (struct type *type, struct value *v2)
227 gdb_assert (type != NULL && v2 != NULL);
229 t1 = check_typedef (type);
230 t2 = check_typedef (value_type (v2));
232 /* Check preconditions. */
233 gdb_assert ((TYPE_CODE (t1) == TYPE_CODE_STRUCT
234 || TYPE_CODE (t1) == TYPE_CODE_UNION)
235 && !!"Precondition is that type is of STRUCT or UNION kind.");
236 gdb_assert ((TYPE_CODE (t2) == TYPE_CODE_STRUCT
237 || TYPE_CODE (t2) == TYPE_CODE_UNION)
238 && !!"Precondition is that value is of STRUCT or UNION kind");
240 if (TYPE_NAME (t1) != NULL
241 && TYPE_NAME (t2) != NULL
242 && !strcmp (TYPE_NAME (t1), TYPE_NAME (t2)))
245 /* Upcasting: look in the type of the source to see if it contains the
246 type of the target as a superclass. If so, we'll need to
247 offset the pointer rather than just change its type. */
248 if (TYPE_NAME (t1) != NULL)
250 v = search_struct_field (type_name_no_tag (t1),
256 /* Downcasting: look in the type of the target to see if it contains the
257 type of the source as a superclass. If so, we'll need to
258 offset the pointer rather than just change its type. */
259 if (TYPE_NAME (t2) != NULL)
261 /* Try downcasting using the run-time type of the value. */
262 int full, top, using_enc;
263 struct type *real_type;
265 real_type = value_rtti_type (v2, &full, &top, &using_enc);
268 v = value_full_object (v2, real_type, full, top, using_enc);
269 v = value_at_lazy (real_type, value_address (v));
271 /* We might be trying to cast to the outermost enclosing
272 type, in which case search_struct_field won't work. */
273 if (TYPE_NAME (real_type) != NULL
274 && !strcmp (TYPE_NAME (real_type), TYPE_NAME (t1)))
277 v = search_struct_field (type_name_no_tag (t2), v, 0, real_type, 1);
282 /* Try downcasting using information from the destination type
283 T2. This wouldn't work properly for classes with virtual
284 bases, but those were handled above. */
285 v = search_struct_field (type_name_no_tag (t2),
286 value_zero (t1, not_lval), 0, t1, 1);
289 /* Downcasting is possible (t1 is superclass of v2). */
290 CORE_ADDR addr2 = value_address (v2);
292 addr2 -= value_address (v) + value_embedded_offset (v);
293 return value_at (type, addr2);
300 /* Cast one pointer or reference type to another. Both TYPE and
301 the type of ARG2 should be pointer types, or else both should be
302 reference types. Returns the new pointer or reference. */
305 value_cast_pointers (struct type *type, struct value *arg2)
307 struct type *type1 = check_typedef (type);
308 struct type *type2 = check_typedef (value_type (arg2));
309 struct type *t1 = check_typedef (TYPE_TARGET_TYPE (type1));
310 struct type *t2 = check_typedef (TYPE_TARGET_TYPE (type2));
312 if (TYPE_CODE (t1) == TYPE_CODE_STRUCT
313 && TYPE_CODE (t2) == TYPE_CODE_STRUCT
314 && !value_logical_not (arg2))
318 if (TYPE_CODE (type2) == TYPE_CODE_REF)
319 v2 = coerce_ref (arg2);
321 v2 = value_ind (arg2);
322 gdb_assert (TYPE_CODE (check_typedef (value_type (v2))) == TYPE_CODE_STRUCT
323 && !!"Why did coercion fail?");
324 v2 = value_cast_structs (t1, v2);
325 /* At this point we have what we can have, un-dereference if needed. */
328 struct value *v = value_addr (v2);
330 deprecated_set_value_type (v, type);
335 /* No superclass found, just change the pointer type. */
336 arg2 = value_copy (arg2);
337 deprecated_set_value_type (arg2, type);
338 set_value_enclosing_type (arg2, type);
339 set_value_pointed_to_offset (arg2, 0); /* pai: chk_val */
343 /* Cast value ARG2 to type TYPE and return as a value.
344 More general than a C cast: accepts any two types of the same length,
345 and if ARG2 is an lvalue it can be cast into anything at all. */
346 /* In C++, casts may change pointer or object representations. */
349 value_cast (struct type *type, struct value *arg2)
351 enum type_code code1;
352 enum type_code code2;
356 int convert_to_boolean = 0;
358 if (value_type (arg2) == type)
361 code1 = TYPE_CODE (check_typedef (type));
363 /* Check if we are casting struct reference to struct reference. */
364 if (code1 == TYPE_CODE_REF)
366 /* We dereference type; then we recurse and finally
367 we generate value of the given reference. Nothing wrong with
369 struct type *t1 = check_typedef (type);
370 struct type *dereftype = check_typedef (TYPE_TARGET_TYPE (t1));
371 struct value *val = value_cast (dereftype, arg2);
373 return value_ref (val);
376 code2 = TYPE_CODE (check_typedef (value_type (arg2)));
378 if (code2 == TYPE_CODE_REF)
379 /* We deref the value and then do the cast. */
380 return value_cast (type, coerce_ref (arg2));
382 CHECK_TYPEDEF (type);
383 code1 = TYPE_CODE (type);
384 arg2 = coerce_ref (arg2);
385 type2 = check_typedef (value_type (arg2));
387 /* You can't cast to a reference type. See value_cast_pointers
389 gdb_assert (code1 != TYPE_CODE_REF);
391 /* A cast to an undetermined-length array_type, such as
392 (TYPE [])OBJECT, is treated like a cast to (TYPE [N])OBJECT,
393 where N is sizeof(OBJECT)/sizeof(TYPE). */
394 if (code1 == TYPE_CODE_ARRAY)
396 struct type *element_type = TYPE_TARGET_TYPE (type);
397 unsigned element_length = TYPE_LENGTH (check_typedef (element_type));
399 if (element_length > 0 && TYPE_ARRAY_UPPER_BOUND_IS_UNDEFINED (type))
401 struct type *range_type = TYPE_INDEX_TYPE (type);
402 int val_length = TYPE_LENGTH (type2);
403 LONGEST low_bound, high_bound, new_length;
405 if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0)
406 low_bound = 0, high_bound = 0;
407 new_length = val_length / element_length;
408 if (val_length % element_length != 0)
409 warning (_("array element type size does not divide object size in cast"));
410 /* FIXME-type-allocation: need a way to free this type when
411 we are done with it. */
412 range_type = create_range_type ((struct type *) NULL,
413 TYPE_TARGET_TYPE (range_type),
415 new_length + low_bound - 1);
416 deprecated_set_value_type (arg2,
417 create_array_type ((struct type *) NULL,
424 if (current_language->c_style_arrays
425 && TYPE_CODE (type2) == TYPE_CODE_ARRAY
426 && !TYPE_VECTOR (type2))
427 arg2 = value_coerce_array (arg2);
429 if (TYPE_CODE (type2) == TYPE_CODE_FUNC)
430 arg2 = value_coerce_function (arg2);
432 type2 = check_typedef (value_type (arg2));
433 code2 = TYPE_CODE (type2);
435 if (code1 == TYPE_CODE_COMPLEX)
436 return cast_into_complex (type, arg2);
437 if (code1 == TYPE_CODE_BOOL)
439 code1 = TYPE_CODE_INT;
440 convert_to_boolean = 1;
442 if (code1 == TYPE_CODE_CHAR)
443 code1 = TYPE_CODE_INT;
444 if (code2 == TYPE_CODE_BOOL || code2 == TYPE_CODE_CHAR)
445 code2 = TYPE_CODE_INT;
447 scalar = (code2 == TYPE_CODE_INT || code2 == TYPE_CODE_FLT
448 || code2 == TYPE_CODE_DECFLOAT || code2 == TYPE_CODE_ENUM
449 || code2 == TYPE_CODE_RANGE);
451 if ((code1 == TYPE_CODE_STRUCT || code1 == TYPE_CODE_UNION)
452 && (code2 == TYPE_CODE_STRUCT || code2 == TYPE_CODE_UNION)
453 && TYPE_NAME (type) != 0)
455 struct value *v = value_cast_structs (type, arg2);
461 if (code1 == TYPE_CODE_FLT && scalar)
462 return value_from_double (type, value_as_double (arg2));
463 else if (code1 == TYPE_CODE_DECFLOAT && scalar)
465 enum bfd_endian byte_order = gdbarch_byte_order (get_type_arch (type));
466 int dec_len = TYPE_LENGTH (type);
469 if (code2 == TYPE_CODE_FLT)
470 decimal_from_floating (arg2, dec, dec_len, byte_order);
471 else if (code2 == TYPE_CODE_DECFLOAT)
472 decimal_convert (value_contents (arg2), TYPE_LENGTH (type2),
473 byte_order, dec, dec_len, byte_order);
475 /* The only option left is an integral type. */
476 decimal_from_integral (arg2, dec, dec_len, byte_order);
478 return value_from_decfloat (type, dec);
480 else if ((code1 == TYPE_CODE_INT || code1 == TYPE_CODE_ENUM
481 || code1 == TYPE_CODE_RANGE)
482 && (scalar || code2 == TYPE_CODE_PTR
483 || code2 == TYPE_CODE_MEMBERPTR))
487 /* When we cast pointers to integers, we mustn't use
488 gdbarch_pointer_to_address to find the address the pointer
489 represents, as value_as_long would. GDB should evaluate
490 expressions just as the compiler would --- and the compiler
491 sees a cast as a simple reinterpretation of the pointer's
493 if (code2 == TYPE_CODE_PTR)
494 longest = extract_unsigned_integer
495 (value_contents (arg2), TYPE_LENGTH (type2),
496 gdbarch_byte_order (get_type_arch (type2)));
498 longest = value_as_long (arg2);
499 return value_from_longest (type, convert_to_boolean ?
500 (LONGEST) (longest ? 1 : 0) : longest);
502 else if (code1 == TYPE_CODE_PTR && (code2 == TYPE_CODE_INT
503 || code2 == TYPE_CODE_ENUM
504 || code2 == TYPE_CODE_RANGE))
506 /* TYPE_LENGTH (type) is the length of a pointer, but we really
507 want the length of an address! -- we are really dealing with
508 addresses (i.e., gdb representations) not pointers (i.e.,
509 target representations) here.
511 This allows things like "print *(int *)0x01000234" to work
512 without printing a misleading message -- which would
513 otherwise occur when dealing with a target having two byte
514 pointers and four byte addresses. */
516 int addr_bit = gdbarch_addr_bit (get_type_arch (type2));
517 LONGEST longest = value_as_long (arg2);
519 if (addr_bit < sizeof (LONGEST) * HOST_CHAR_BIT)
521 if (longest >= ((LONGEST) 1 << addr_bit)
522 || longest <= -((LONGEST) 1 << addr_bit))
523 warning (_("value truncated"));
525 return value_from_longest (type, longest);
527 else if (code1 == TYPE_CODE_METHODPTR && code2 == TYPE_CODE_INT
528 && value_as_long (arg2) == 0)
530 struct value *result = allocate_value (type);
532 cplus_make_method_ptr (type, value_contents_writeable (result), 0, 0);
535 else if (code1 == TYPE_CODE_MEMBERPTR && code2 == TYPE_CODE_INT
536 && value_as_long (arg2) == 0)
538 /* The Itanium C++ ABI represents NULL pointers to members as
539 minus one, instead of biasing the normal case. */
540 return value_from_longest (type, -1);
542 else if (code1 == TYPE_CODE_ARRAY && TYPE_VECTOR (type) && scalar)
544 /* Widen the scalar to a vector. */
547 LONGEST low_bound, high_bound;
550 if (!get_array_bounds (type, &low_bound, &high_bound))
551 error (_("Could not determine the vector bounds"));
553 eltype = check_typedef (TYPE_TARGET_TYPE (type));
554 arg2 = value_cast (eltype, arg2);
555 val = allocate_value (type);
557 for (i = 0; i < high_bound - low_bound + 1; i++)
559 /* Duplicate the contents of arg2 into the destination vector. */
560 memcpy (value_contents_writeable (val) + (i * TYPE_LENGTH (eltype)),
561 value_contents_all (arg2), TYPE_LENGTH (eltype));
565 else if (TYPE_LENGTH (type) == TYPE_LENGTH (type2))
567 if (code1 == TYPE_CODE_PTR && code2 == TYPE_CODE_PTR)
568 return value_cast_pointers (type, arg2);
570 arg2 = value_copy (arg2);
571 deprecated_set_value_type (arg2, type);
572 set_value_enclosing_type (arg2, type);
573 set_value_pointed_to_offset (arg2, 0); /* pai: chk_val */
576 else if (VALUE_LVAL (arg2) == lval_memory)
577 return value_at_lazy (type, value_address (arg2));
578 else if (code1 == TYPE_CODE_VOID)
580 return value_zero (type, not_lval);
584 error (_("Invalid cast."));
589 /* The C++ reinterpret_cast operator. */
592 value_reinterpret_cast (struct type *type, struct value *arg)
594 struct value *result;
595 struct type *real_type = check_typedef (type);
596 struct type *arg_type, *dest_type;
598 enum type_code dest_code, arg_code;
600 /* Do reference, function, and array conversion. */
601 arg = coerce_array (arg);
603 /* Attempt to preserve the type the user asked for. */
606 /* If we are casting to a reference type, transform
607 reinterpret_cast<T&>(V) to *reinterpret_cast<T*>(&V). */
608 if (TYPE_CODE (real_type) == TYPE_CODE_REF)
611 arg = value_addr (arg);
612 dest_type = lookup_pointer_type (TYPE_TARGET_TYPE (dest_type));
613 real_type = lookup_pointer_type (real_type);
616 arg_type = value_type (arg);
618 dest_code = TYPE_CODE (real_type);
619 arg_code = TYPE_CODE (arg_type);
621 /* We can convert pointer types, or any pointer type to int, or int
623 if ((dest_code == TYPE_CODE_PTR && arg_code == TYPE_CODE_INT)
624 || (dest_code == TYPE_CODE_INT && arg_code == TYPE_CODE_PTR)
625 || (dest_code == TYPE_CODE_METHODPTR && arg_code == TYPE_CODE_INT)
626 || (dest_code == TYPE_CODE_INT && arg_code == TYPE_CODE_METHODPTR)
627 || (dest_code == TYPE_CODE_MEMBERPTR && arg_code == TYPE_CODE_INT)
628 || (dest_code == TYPE_CODE_INT && arg_code == TYPE_CODE_MEMBERPTR)
629 || (dest_code == arg_code
630 && (dest_code == TYPE_CODE_PTR
631 || dest_code == TYPE_CODE_METHODPTR
632 || dest_code == TYPE_CODE_MEMBERPTR)))
633 result = value_cast (dest_type, arg);
635 error (_("Invalid reinterpret_cast"));
638 result = value_cast (type, value_ref (value_ind (result)));
643 /* A helper for value_dynamic_cast. This implements the first of two
644 runtime checks: we iterate over all the base classes of the value's
645 class which are equal to the desired class; if only one of these
646 holds the value, then it is the answer. */
649 dynamic_cast_check_1 (struct type *desired_type,
650 const bfd_byte *contents,
652 struct type *search_type,
654 struct type *arg_type,
655 struct value **result)
657 int i, result_count = 0;
659 for (i = 0; i < TYPE_N_BASECLASSES (search_type) && result_count < 2; ++i)
661 int offset = baseclass_offset (search_type, i, contents, address);
664 error (_("virtual baseclass botch"));
665 if (class_types_same_p (desired_type, TYPE_BASECLASS (search_type, i)))
667 if (address + offset >= arg_addr
668 && address + offset < arg_addr + TYPE_LENGTH (arg_type))
672 *result = value_at_lazy (TYPE_BASECLASS (search_type, i),
677 result_count += dynamic_cast_check_1 (desired_type,
680 TYPE_BASECLASS (search_type, i),
689 /* A helper for value_dynamic_cast. This implements the second of two
690 runtime checks: we look for a unique public sibling class of the
691 argument's declared class. */
694 dynamic_cast_check_2 (struct type *desired_type,
695 const bfd_byte *contents,
697 struct type *search_type,
698 struct value **result)
700 int i, result_count = 0;
702 for (i = 0; i < TYPE_N_BASECLASSES (search_type) && result_count < 2; ++i)
706 if (! BASETYPE_VIA_PUBLIC (search_type, i))
709 offset = baseclass_offset (search_type, i, contents, address);
711 error (_("virtual baseclass botch"));
712 if (class_types_same_p (desired_type, TYPE_BASECLASS (search_type, i)))
716 *result = value_at_lazy (TYPE_BASECLASS (search_type, i),
720 result_count += dynamic_cast_check_2 (desired_type,
723 TYPE_BASECLASS (search_type, i),
730 /* The C++ dynamic_cast operator. */
733 value_dynamic_cast (struct type *type, struct value *arg)
735 int full, top, using_enc;
736 struct type *resolved_type = check_typedef (type);
737 struct type *arg_type = check_typedef (value_type (arg));
738 struct type *class_type, *rtti_type;
739 struct value *result, *tem, *original_arg = arg;
741 int is_ref = TYPE_CODE (resolved_type) == TYPE_CODE_REF;
743 if (TYPE_CODE (resolved_type) != TYPE_CODE_PTR
744 && TYPE_CODE (resolved_type) != TYPE_CODE_REF)
745 error (_("Argument to dynamic_cast must be a pointer or reference type"));
746 if (TYPE_CODE (TYPE_TARGET_TYPE (resolved_type)) != TYPE_CODE_VOID
747 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type)) != TYPE_CODE_CLASS)
748 error (_("Argument to dynamic_cast must be pointer to class or `void *'"));
750 class_type = check_typedef (TYPE_TARGET_TYPE (resolved_type));
751 if (TYPE_CODE (resolved_type) == TYPE_CODE_PTR)
753 if (TYPE_CODE (arg_type) != TYPE_CODE_PTR
754 && ! (TYPE_CODE (arg_type) == TYPE_CODE_INT
755 && value_as_long (arg) == 0))
756 error (_("Argument to dynamic_cast does not have pointer type"));
757 if (TYPE_CODE (arg_type) == TYPE_CODE_PTR)
759 arg_type = check_typedef (TYPE_TARGET_TYPE (arg_type));
760 if (TYPE_CODE (arg_type) != TYPE_CODE_CLASS)
761 error (_("Argument to dynamic_cast does not have pointer to class type"));
764 /* Handle NULL pointers. */
765 if (value_as_long (arg) == 0)
766 return value_zero (type, not_lval);
768 arg = value_ind (arg);
772 if (TYPE_CODE (arg_type) != TYPE_CODE_CLASS)
773 error (_("Argument to dynamic_cast does not have class type"));
776 /* If the classes are the same, just return the argument. */
777 if (class_types_same_p (class_type, arg_type))
778 return value_cast (type, arg);
780 /* If the target type is a unique base class of the argument's
781 declared type, just cast it. */
782 if (is_ancestor (class_type, arg_type))
784 if (is_unique_ancestor (class_type, arg))
785 return value_cast (type, original_arg);
786 error (_("Ambiguous dynamic_cast"));
789 rtti_type = value_rtti_type (arg, &full, &top, &using_enc);
791 error (_("Couldn't determine value's most derived type for dynamic_cast"));
793 /* Compute the most derived object's address. */
794 addr = value_address (arg);
802 addr += top + value_embedded_offset (arg);
804 /* dynamic_cast<void *> means to return a pointer to the
805 most-derived object. */
806 if (TYPE_CODE (resolved_type) == TYPE_CODE_PTR
807 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type)) == TYPE_CODE_VOID)
808 return value_at_lazy (type, addr);
810 tem = value_at (type, addr);
812 /* The first dynamic check specified in 5.2.7. */
813 if (is_public_ancestor (arg_type, TYPE_TARGET_TYPE (resolved_type)))
815 if (class_types_same_p (rtti_type, TYPE_TARGET_TYPE (resolved_type)))
818 if (dynamic_cast_check_1 (TYPE_TARGET_TYPE (resolved_type),
819 value_contents (tem), value_address (tem),
823 return value_cast (type,
824 is_ref ? value_ref (result) : value_addr (result));
827 /* The second dynamic check specified in 5.2.7. */
829 if (is_public_ancestor (arg_type, rtti_type)
830 && dynamic_cast_check_2 (TYPE_TARGET_TYPE (resolved_type),
831 value_contents (tem), value_address (tem),
832 rtti_type, &result) == 1)
833 return value_cast (type,
834 is_ref ? value_ref (result) : value_addr (result));
836 if (TYPE_CODE (resolved_type) == TYPE_CODE_PTR)
837 return value_zero (type, not_lval);
839 error (_("dynamic_cast failed"));
842 /* Create a value of type TYPE that is zero, and return it. */
845 value_zero (struct type *type, enum lval_type lv)
847 struct value *val = allocate_value (type);
849 VALUE_LVAL (val) = lv;
853 /* Create a value of numeric type TYPE that is one, and return it. */
856 value_one (struct type *type, enum lval_type lv)
858 struct type *type1 = check_typedef (type);
861 if (TYPE_CODE (type1) == TYPE_CODE_DECFLOAT)
863 enum bfd_endian byte_order = gdbarch_byte_order (get_type_arch (type));
866 decimal_from_string (v, TYPE_LENGTH (type), byte_order, "1");
867 val = value_from_decfloat (type, v);
869 else if (TYPE_CODE (type1) == TYPE_CODE_FLT)
871 val = value_from_double (type, (DOUBLEST) 1);
873 else if (is_integral_type (type1))
875 val = value_from_longest (type, (LONGEST) 1);
877 else if (TYPE_CODE (type1) == TYPE_CODE_ARRAY && TYPE_VECTOR (type1))
879 struct type *eltype = check_typedef (TYPE_TARGET_TYPE (type1));
880 int i, n = TYPE_LENGTH (type1) / TYPE_LENGTH (eltype);
883 val = allocate_value (type);
884 for (i = 0; i < n; i++)
886 tmp = value_one (eltype, lv);
887 memcpy (value_contents_writeable (val) + i * TYPE_LENGTH (eltype),
888 value_contents_all (tmp), TYPE_LENGTH (eltype));
893 error (_("Not a numeric type."));
896 VALUE_LVAL (val) = lv;
900 /* Helper function for value_at, value_at_lazy, and value_at_lazy_stack. */
902 static struct value *
903 get_value_at (struct type *type, CORE_ADDR addr, int lazy)
907 if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
908 error (_("Attempt to dereference a generic pointer."));
912 val = allocate_value_lazy (type);
916 val = allocate_value (type);
917 read_memory (addr, value_contents_all_raw (val), TYPE_LENGTH (type));
920 VALUE_LVAL (val) = lval_memory;
921 set_value_address (val, addr);
926 /* Return a value with type TYPE located at ADDR.
928 Call value_at only if the data needs to be fetched immediately;
929 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
930 value_at_lazy instead. value_at_lazy simply records the address of
931 the data and sets the lazy-evaluation-required flag. The lazy flag
932 is tested in the value_contents macro, which is used if and when
933 the contents are actually required.
935 Note: value_at does *NOT* handle embedded offsets; perform such
936 adjustments before or after calling it. */
939 value_at (struct type *type, CORE_ADDR addr)
941 return get_value_at (type, addr, 0);
944 /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
947 value_at_lazy (struct type *type, CORE_ADDR addr)
949 return get_value_at (type, addr, 1);
952 /* Called only from the value_contents and value_contents_all()
953 macros, if the current data for a variable needs to be loaded into
954 value_contents(VAL). Fetches the data from the user's process, and
955 clears the lazy flag to indicate that the data in the buffer is
958 If the value is zero-length, we avoid calling read_memory, which
959 would abort. We mark the value as fetched anyway -- all 0 bytes of
962 This function returns a value because it is used in the
963 value_contents macro as part of an expression, where a void would
964 not work. The value is ignored. */
967 value_fetch_lazy (struct value *val)
969 gdb_assert (value_lazy (val));
970 allocate_value_contents (val);
971 if (value_bitsize (val))
973 /* To read a lazy bitfield, read the entire enclosing value. This
974 prevents reading the same block of (possibly volatile) memory once
975 per bitfield. It would be even better to read only the containing
976 word, but we have no way to record that just specific bits of a
977 value have been fetched. */
978 struct type *type = check_typedef (value_type (val));
979 enum bfd_endian byte_order = gdbarch_byte_order (get_type_arch (type));
980 struct value *parent = value_parent (val);
981 LONGEST offset = value_offset (val);
982 LONGEST num = unpack_bits_as_long (value_type (val),
983 (value_contents_for_printing (parent)
986 value_bitsize (val));
987 int length = TYPE_LENGTH (type);
989 if (!value_bits_valid (val,
990 TARGET_CHAR_BIT * offset + value_bitpos (val),
991 value_bitsize (val)))
992 error (_("value has been optimized out"));
994 store_signed_integer (value_contents_raw (val), length, byte_order, num);
996 else if (VALUE_LVAL (val) == lval_memory)
998 CORE_ADDR addr = value_address (val);
999 int length = TYPE_LENGTH (check_typedef (value_enclosing_type (val)));
1003 if (value_stack (val))
1004 read_stack (addr, value_contents_all_raw (val), length);
1006 read_memory (addr, value_contents_all_raw (val), length);
1009 else if (VALUE_LVAL (val) == lval_register)
1011 struct frame_info *frame;
1013 struct type *type = check_typedef (value_type (val));
1014 struct value *new_val = val, *mark = value_mark ();
1016 /* Offsets are not supported here; lazy register values must
1017 refer to the entire register. */
1018 gdb_assert (value_offset (val) == 0);
1020 while (VALUE_LVAL (new_val) == lval_register && value_lazy (new_val))
1022 frame = frame_find_by_id (VALUE_FRAME_ID (new_val));
1023 regnum = VALUE_REGNUM (new_val);
1025 gdb_assert (frame != NULL);
1027 /* Convertible register routines are used for multi-register
1028 values and for interpretation in different types
1029 (e.g. float or int from a double register). Lazy
1030 register values should have the register's natural type,
1031 so they do not apply. */
1032 gdb_assert (!gdbarch_convert_register_p (get_frame_arch (frame),
1035 new_val = get_frame_register_value (frame, regnum);
1038 /* If it's still lazy (for instance, a saved register on the
1039 stack), fetch it. */
1040 if (value_lazy (new_val))
1041 value_fetch_lazy (new_val);
1043 /* If the register was not saved, mark it unavailable. */
1044 if (value_optimized_out (new_val))
1045 set_value_optimized_out (val, 1);
1047 memcpy (value_contents_raw (val), value_contents (new_val),
1048 TYPE_LENGTH (type));
1052 struct gdbarch *gdbarch;
1053 frame = frame_find_by_id (VALUE_FRAME_ID (val));
1054 regnum = VALUE_REGNUM (val);
1055 gdbarch = get_frame_arch (frame);
1057 fprintf_unfiltered (gdb_stdlog, "\
1058 { value_fetch_lazy (frame=%d,regnum=%d(%s),...) ",
1059 frame_relative_level (frame), regnum,
1060 user_reg_map_regnum_to_name (gdbarch, regnum));
1062 fprintf_unfiltered (gdb_stdlog, "->");
1063 if (value_optimized_out (new_val))
1064 fprintf_unfiltered (gdb_stdlog, " optimized out");
1068 const gdb_byte *buf = value_contents (new_val);
1070 if (VALUE_LVAL (new_val) == lval_register)
1071 fprintf_unfiltered (gdb_stdlog, " register=%d",
1072 VALUE_REGNUM (new_val));
1073 else if (VALUE_LVAL (new_val) == lval_memory)
1074 fprintf_unfiltered (gdb_stdlog, " address=%s",
1076 value_address (new_val)));
1078 fprintf_unfiltered (gdb_stdlog, " computed");
1080 fprintf_unfiltered (gdb_stdlog, " bytes=");
1081 fprintf_unfiltered (gdb_stdlog, "[");
1082 for (i = 0; i < register_size (gdbarch, regnum); i++)
1083 fprintf_unfiltered (gdb_stdlog, "%02x", buf[i]);
1084 fprintf_unfiltered (gdb_stdlog, "]");
1087 fprintf_unfiltered (gdb_stdlog, " }\n");
1090 /* Dispose of the intermediate values. This prevents
1091 watchpoints from trying to watch the saved frame pointer. */
1092 value_free_to_mark (mark);
1094 else if (VALUE_LVAL (val) == lval_computed)
1095 value_computed_funcs (val)->read (val);
1097 internal_error (__FILE__, __LINE__, "Unexpected lazy value type.");
1099 set_value_lazy (val, 0);
1104 /* Store the contents of FROMVAL into the location of TOVAL.
1105 Return a new value with the location of TOVAL and contents of FROMVAL. */
1108 value_assign (struct value *toval, struct value *fromval)
1112 struct frame_id old_frame;
1114 if (!deprecated_value_modifiable (toval))
1115 error (_("Left operand of assignment is not a modifiable lvalue."));
1117 toval = coerce_ref (toval);
1119 type = value_type (toval);
1120 if (VALUE_LVAL (toval) != lval_internalvar)
1121 fromval = value_cast (type, fromval);
1124 /* Coerce arrays and functions to pointers, except for arrays
1125 which only live in GDB's storage. */
1126 if (!value_must_coerce_to_target (fromval))
1127 fromval = coerce_array (fromval);
1130 CHECK_TYPEDEF (type);
1132 /* Since modifying a register can trash the frame chain, and
1133 modifying memory can trash the frame cache, we save the old frame
1134 and then restore the new frame afterwards. */
1135 old_frame = get_frame_id (deprecated_safe_get_selected_frame ());
1137 switch (VALUE_LVAL (toval))
1139 case lval_internalvar:
1140 set_internalvar (VALUE_INTERNALVAR (toval), fromval);
1141 val = value_copy (fromval);
1142 set_value_enclosing_type (val, value_enclosing_type (fromval));
1143 set_value_embedded_offset (val, value_embedded_offset (fromval));
1144 set_value_pointed_to_offset (val, value_pointed_to_offset (fromval));
1147 case lval_internalvar_component:
1148 set_internalvar_component (VALUE_INTERNALVAR (toval),
1149 value_offset (toval),
1150 value_bitpos (toval),
1151 value_bitsize (toval),
1157 const gdb_byte *dest_buffer;
1158 CORE_ADDR changed_addr;
1160 gdb_byte buffer[sizeof (LONGEST)];
1162 if (value_bitsize (toval))
1164 struct value *parent = value_parent (toval);
1166 changed_addr = value_address (parent) + value_offset (toval);
1167 changed_len = (value_bitpos (toval)
1168 + value_bitsize (toval)
1169 + HOST_CHAR_BIT - 1)
1172 /* If we can read-modify-write exactly the size of the
1173 containing type (e.g. short or int) then do so. This
1174 is safer for volatile bitfields mapped to hardware
1176 if (changed_len < TYPE_LENGTH (type)
1177 && TYPE_LENGTH (type) <= (int) sizeof (LONGEST)
1178 && ((LONGEST) changed_addr % TYPE_LENGTH (type)) == 0)
1179 changed_len = TYPE_LENGTH (type);
1181 if (changed_len > (int) sizeof (LONGEST))
1182 error (_("Can't handle bitfields which don't fit in a %d bit word."),
1183 (int) sizeof (LONGEST) * HOST_CHAR_BIT);
1185 read_memory (changed_addr, buffer, changed_len);
1186 modify_field (type, buffer, value_as_long (fromval),
1187 value_bitpos (toval), value_bitsize (toval));
1188 dest_buffer = buffer;
1192 changed_addr = value_address (toval);
1193 changed_len = TYPE_LENGTH (type);
1194 dest_buffer = value_contents (fromval);
1197 write_memory (changed_addr, dest_buffer, changed_len);
1198 observer_notify_memory_changed (changed_addr, changed_len,
1205 struct frame_info *frame;
1206 struct gdbarch *gdbarch;
1209 /* Figure out which frame this is in currently. */
1210 frame = frame_find_by_id (VALUE_FRAME_ID (toval));
1211 value_reg = VALUE_REGNUM (toval);
1214 error (_("Value being assigned to is no longer active."));
1216 gdbarch = get_frame_arch (frame);
1217 if (gdbarch_convert_register_p (gdbarch, VALUE_REGNUM (toval), type))
1219 /* If TOVAL is a special machine register requiring
1220 conversion of program values to a special raw
1222 gdbarch_value_to_register (gdbarch, frame,
1223 VALUE_REGNUM (toval), type,
1224 value_contents (fromval));
1228 if (value_bitsize (toval))
1230 struct value *parent = value_parent (toval);
1231 int offset = value_offset (parent) + value_offset (toval);
1233 gdb_byte buffer[sizeof (LONGEST)];
1235 changed_len = (value_bitpos (toval)
1236 + value_bitsize (toval)
1237 + HOST_CHAR_BIT - 1)
1240 if (changed_len > (int) sizeof (LONGEST))
1241 error (_("Can't handle bitfields which don't fit in a %d bit word."),
1242 (int) sizeof (LONGEST) * HOST_CHAR_BIT);
1244 get_frame_register_bytes (frame, value_reg, offset,
1245 changed_len, buffer);
1247 modify_field (type, buffer, value_as_long (fromval),
1248 value_bitpos (toval), value_bitsize (toval));
1250 put_frame_register_bytes (frame, value_reg, offset,
1251 changed_len, buffer);
1255 put_frame_register_bytes (frame, value_reg,
1256 value_offset (toval),
1258 value_contents (fromval));
1262 if (deprecated_register_changed_hook)
1263 deprecated_register_changed_hook (-1);
1264 observer_notify_target_changed (¤t_target);
1270 struct lval_funcs *funcs = value_computed_funcs (toval);
1272 funcs->write (toval, fromval);
1277 error (_("Left operand of assignment is not an lvalue."));
1280 /* Assigning to the stack pointer, frame pointer, and other
1281 (architecture and calling convention specific) registers may
1282 cause the frame cache to be out of date. Assigning to memory
1283 also can. We just do this on all assignments to registers or
1284 memory, for simplicity's sake; I doubt the slowdown matters. */
1285 switch (VALUE_LVAL (toval))
1291 reinit_frame_cache ();
1293 /* Having destroyed the frame cache, restore the selected
1296 /* FIXME: cagney/2002-11-02: There has to be a better way of
1297 doing this. Instead of constantly saving/restoring the
1298 frame. Why not create a get_selected_frame() function that,
1299 having saved the selected frame's ID can automatically
1300 re-find the previously selected frame automatically. */
1303 struct frame_info *fi = frame_find_by_id (old_frame);
1314 /* If the field does not entirely fill a LONGEST, then zero the sign
1315 bits. If the field is signed, and is negative, then sign
1317 if ((value_bitsize (toval) > 0)
1318 && (value_bitsize (toval) < 8 * (int) sizeof (LONGEST)))
1320 LONGEST fieldval = value_as_long (fromval);
1321 LONGEST valmask = (((ULONGEST) 1) << value_bitsize (toval)) - 1;
1323 fieldval &= valmask;
1324 if (!TYPE_UNSIGNED (type)
1325 && (fieldval & (valmask ^ (valmask >> 1))))
1326 fieldval |= ~valmask;
1328 fromval = value_from_longest (type, fieldval);
1331 val = value_copy (toval);
1332 memcpy (value_contents_raw (val), value_contents (fromval),
1333 TYPE_LENGTH (type));
1334 deprecated_set_value_type (val, type);
1335 set_value_enclosing_type (val, value_enclosing_type (fromval));
1336 set_value_embedded_offset (val, value_embedded_offset (fromval));
1337 set_value_pointed_to_offset (val, value_pointed_to_offset (fromval));
1342 /* Extend a value VAL to COUNT repetitions of its type. */
1345 value_repeat (struct value *arg1, int count)
1349 if (VALUE_LVAL (arg1) != lval_memory)
1350 error (_("Only values in memory can be extended with '@'."));
1352 error (_("Invalid number %d of repetitions."), count);
1354 val = allocate_repeat_value (value_enclosing_type (arg1), count);
1356 read_memory (value_address (arg1),
1357 value_contents_all_raw (val),
1358 TYPE_LENGTH (value_enclosing_type (val)));
1359 VALUE_LVAL (val) = lval_memory;
1360 set_value_address (val, value_address (arg1));
1366 value_of_variable (struct symbol *var, struct block *b)
1369 struct frame_info *frame;
1371 if (!symbol_read_needs_frame (var))
1374 frame = get_selected_frame (_("No frame selected."));
1377 frame = block_innermost_frame (b);
1380 if (BLOCK_FUNCTION (b) && !block_inlined_p (b)
1381 && SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b)))
1382 error (_("No frame is currently executing in block %s."),
1383 SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b)));
1385 error (_("No frame is currently executing in specified block"));
1389 val = read_var_value (var, frame);
1391 error (_("Address of symbol \"%s\" is unknown."), SYMBOL_PRINT_NAME (var));
1397 address_of_variable (struct symbol *var, struct block *b)
1399 struct type *type = SYMBOL_TYPE (var);
1402 /* Evaluate it first; if the result is a memory address, we're fine.
1403 Lazy evaluation pays off here. */
1405 val = value_of_variable (var, b);
1407 if ((VALUE_LVAL (val) == lval_memory && value_lazy (val))
1408 || TYPE_CODE (type) == TYPE_CODE_FUNC)
1410 CORE_ADDR addr = value_address (val);
1412 return value_from_pointer (lookup_pointer_type (type), addr);
1415 /* Not a memory address; check what the problem was. */
1416 switch (VALUE_LVAL (val))
1420 struct frame_info *frame;
1421 const char *regname;
1423 frame = frame_find_by_id (VALUE_FRAME_ID (val));
1426 regname = gdbarch_register_name (get_frame_arch (frame),
1427 VALUE_REGNUM (val));
1428 gdb_assert (regname && *regname);
1430 error (_("Address requested for identifier "
1431 "\"%s\" which is in register $%s"),
1432 SYMBOL_PRINT_NAME (var), regname);
1437 error (_("Can't take address of \"%s\" which isn't an lvalue."),
1438 SYMBOL_PRINT_NAME (var));
1445 /* Return one if VAL does not live in target memory, but should in order
1446 to operate on it. Otherwise return zero. */
1449 value_must_coerce_to_target (struct value *val)
1451 struct type *valtype;
1453 /* The only lval kinds which do not live in target memory. */
1454 if (VALUE_LVAL (val) != not_lval
1455 && VALUE_LVAL (val) != lval_internalvar)
1458 valtype = check_typedef (value_type (val));
1460 switch (TYPE_CODE (valtype))
1462 case TYPE_CODE_ARRAY:
1463 return TYPE_VECTOR (valtype) ? 0 : 1;
1464 case TYPE_CODE_STRING:
1471 /* Make sure that VAL lives in target memory if it's supposed to. For instance,
1472 strings are constructed as character arrays in GDB's storage, and this
1473 function copies them to the target. */
1476 value_coerce_to_target (struct value *val)
1481 if (!value_must_coerce_to_target (val))
1484 length = TYPE_LENGTH (check_typedef (value_type (val)));
1485 addr = allocate_space_in_inferior (length);
1486 write_memory (addr, value_contents (val), length);
1487 return value_at_lazy (value_type (val), addr);
1490 /* Given a value which is an array, return a value which is a pointer
1491 to its first element, regardless of whether or not the array has a
1492 nonzero lower bound.
1494 FIXME: A previous comment here indicated that this routine should
1495 be substracting the array's lower bound. It's not clear to me that
1496 this is correct. Given an array subscripting operation, it would
1497 certainly work to do the adjustment here, essentially computing:
1499 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
1501 However I believe a more appropriate and logical place to account
1502 for the lower bound is to do so in value_subscript, essentially
1505 (&array[0] + ((index - lowerbound) * sizeof array[0]))
1507 As further evidence consider what would happen with operations
1508 other than array subscripting, where the caller would get back a
1509 value that had an address somewhere before the actual first element
1510 of the array, and the information about the lower bound would be
1511 lost because of the coercion to pointer type.
1515 value_coerce_array (struct value *arg1)
1517 struct type *type = check_typedef (value_type (arg1));
1519 /* If the user tries to do something requiring a pointer with an
1520 array that has not yet been pushed to the target, then this would
1521 be a good time to do so. */
1522 arg1 = value_coerce_to_target (arg1);
1524 if (VALUE_LVAL (arg1) != lval_memory)
1525 error (_("Attempt to take address of value not located in memory."));
1527 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
1528 value_address (arg1));
1531 /* Given a value which is a function, return a value which is a pointer
1535 value_coerce_function (struct value *arg1)
1537 struct value *retval;
1539 if (VALUE_LVAL (arg1) != lval_memory)
1540 error (_("Attempt to take address of value not located in memory."));
1542 retval = value_from_pointer (lookup_pointer_type (value_type (arg1)),
1543 value_address (arg1));
1547 /* Return a pointer value for the object for which ARG1 is the
1551 value_addr (struct value *arg1)
1554 struct type *type = check_typedef (value_type (arg1));
1556 if (TYPE_CODE (type) == TYPE_CODE_REF)
1558 /* Copy the value, but change the type from (T&) to (T*). We
1559 keep the same location information, which is efficient, and
1560 allows &(&X) to get the location containing the reference. */
1561 arg2 = value_copy (arg1);
1562 deprecated_set_value_type (arg2,
1563 lookup_pointer_type (TYPE_TARGET_TYPE (type)));
1566 if (TYPE_CODE (type) == TYPE_CODE_FUNC)
1567 return value_coerce_function (arg1);
1569 /* If this is an array that has not yet been pushed to the target,
1570 then this would be a good time to force it to memory. */
1571 arg1 = value_coerce_to_target (arg1);
1573 if (VALUE_LVAL (arg1) != lval_memory)
1574 error (_("Attempt to take address of value not located in memory."));
1576 /* Get target memory address */
1577 arg2 = value_from_pointer (lookup_pointer_type (value_type (arg1)),
1578 (value_address (arg1)
1579 + value_embedded_offset (arg1)));
1581 /* This may be a pointer to a base subobject; so remember the
1582 full derived object's type ... */
1583 set_value_enclosing_type (arg2,
1584 lookup_pointer_type (value_enclosing_type (arg1)));
1585 /* ... and also the relative position of the subobject in the full
1587 set_value_pointed_to_offset (arg2, value_embedded_offset (arg1));
1591 /* Return a reference value for the object for which ARG1 is the
1595 value_ref (struct value *arg1)
1598 struct type *type = check_typedef (value_type (arg1));
1600 if (TYPE_CODE (type) == TYPE_CODE_REF)
1603 arg2 = value_addr (arg1);
1604 deprecated_set_value_type (arg2, lookup_reference_type (type));
1608 /* Given a value of a pointer type, apply the C unary * operator to
1612 value_ind (struct value *arg1)
1614 struct type *base_type;
1617 arg1 = coerce_array (arg1);
1619 base_type = check_typedef (value_type (arg1));
1621 if (TYPE_CODE (base_type) == TYPE_CODE_PTR)
1623 struct type *enc_type;
1625 /* We may be pointing to something embedded in a larger object.
1626 Get the real type of the enclosing object. */
1627 enc_type = check_typedef (value_enclosing_type (arg1));
1628 enc_type = TYPE_TARGET_TYPE (enc_type);
1630 if (TYPE_CODE (check_typedef (enc_type)) == TYPE_CODE_FUNC
1631 || TYPE_CODE (check_typedef (enc_type)) == TYPE_CODE_METHOD)
1632 /* For functions, go through find_function_addr, which knows
1633 how to handle function descriptors. */
1634 arg2 = value_at_lazy (enc_type,
1635 find_function_addr (arg1, NULL));
1637 /* Retrieve the enclosing object pointed to */
1638 arg2 = value_at_lazy (enc_type,
1639 (value_as_address (arg1)
1640 - value_pointed_to_offset (arg1)));
1642 /* Re-adjust type. */
1643 deprecated_set_value_type (arg2, TYPE_TARGET_TYPE (base_type));
1644 /* Add embedding info. */
1645 set_value_enclosing_type (arg2, enc_type);
1646 set_value_embedded_offset (arg2, value_pointed_to_offset (arg1));
1648 /* We may be pointing to an object of some derived type. */
1649 arg2 = value_full_object (arg2, NULL, 0, 0, 0);
1653 error (_("Attempt to take contents of a non-pointer value."));
1654 return 0; /* For lint -- never reached. */
1657 /* Create a value for an array by allocating space in GDB, copying
1658 copying the data into that space, and then setting up an array
1661 The array bounds are set from LOWBOUND and HIGHBOUND, and the array
1662 is populated from the values passed in ELEMVEC.
1664 The element type of the array is inherited from the type of the
1665 first element, and all elements must have the same size (though we
1666 don't currently enforce any restriction on their types). */
1669 value_array (int lowbound, int highbound, struct value **elemvec)
1673 unsigned int typelength;
1675 struct type *arraytype;
1677 /* Validate that the bounds are reasonable and that each of the
1678 elements have the same size. */
1680 nelem = highbound - lowbound + 1;
1683 error (_("bad array bounds (%d, %d)"), lowbound, highbound);
1685 typelength = TYPE_LENGTH (value_enclosing_type (elemvec[0]));
1686 for (idx = 1; idx < nelem; idx++)
1688 if (TYPE_LENGTH (value_enclosing_type (elemvec[idx])) != typelength)
1690 error (_("array elements must all be the same size"));
1694 arraytype = lookup_array_range_type (value_enclosing_type (elemvec[0]),
1695 lowbound, highbound);
1697 if (!current_language->c_style_arrays)
1699 val = allocate_value (arraytype);
1700 for (idx = 0; idx < nelem; idx++)
1702 memcpy (value_contents_all_raw (val) + (idx * typelength),
1703 value_contents_all (elemvec[idx]),
1709 /* Allocate space to store the array, and then initialize it by
1710 copying in each element. */
1712 val = allocate_value (arraytype);
1713 for (idx = 0; idx < nelem; idx++)
1714 memcpy (value_contents_writeable (val) + (idx * typelength),
1715 value_contents_all (elemvec[idx]),
1721 value_cstring (char *ptr, int len, struct type *char_type)
1724 int lowbound = current_language->string_lower_bound;
1725 int highbound = len / TYPE_LENGTH (char_type);
1726 struct type *stringtype
1727 = lookup_array_range_type (char_type, lowbound, highbound + lowbound - 1);
1729 val = allocate_value (stringtype);
1730 memcpy (value_contents_raw (val), ptr, len);
1734 /* Create a value for a string constant by allocating space in the
1735 inferior, copying the data into that space, and returning the
1736 address with type TYPE_CODE_STRING. PTR points to the string
1737 constant data; LEN is number of characters.
1739 Note that string types are like array of char types with a lower
1740 bound of zero and an upper bound of LEN - 1. Also note that the
1741 string may contain embedded null bytes. */
1744 value_string (char *ptr, int len, struct type *char_type)
1747 int lowbound = current_language->string_lower_bound;
1748 int highbound = len / TYPE_LENGTH (char_type);
1749 struct type *stringtype
1750 = lookup_string_range_type (char_type, lowbound, highbound + lowbound - 1);
1752 val = allocate_value (stringtype);
1753 memcpy (value_contents_raw (val), ptr, len);
1758 value_bitstring (char *ptr, int len, struct type *index_type)
1761 struct type *domain_type
1762 = create_range_type (NULL, index_type, 0, len - 1);
1763 struct type *type = create_set_type (NULL, domain_type);
1765 TYPE_CODE (type) = TYPE_CODE_BITSTRING;
1766 val = allocate_value (type);
1767 memcpy (value_contents_raw (val), ptr, TYPE_LENGTH (type));
1771 /* See if we can pass arguments in T2 to a function which takes
1772 arguments of types T1. T1 is a list of NARGS arguments, and T2 is
1773 a NULL-terminated vector. If some arguments need coercion of some
1774 sort, then the coerced values are written into T2. Return value is
1775 0 if the arguments could be matched, or the position at which they
1778 STATICP is nonzero if the T1 argument list came from a static
1779 member function. T2 will still include the ``this'' pointer, but
1782 For non-static member functions, we ignore the first argument,
1783 which is the type of the instance variable. This is because we
1784 want to handle calls with objects from derived classes. This is
1785 not entirely correct: we should actually check to make sure that a
1786 requested operation is type secure, shouldn't we? FIXME. */
1789 typecmp (int staticp, int varargs, int nargs,
1790 struct field t1[], struct value *t2[])
1795 internal_error (__FILE__, __LINE__,
1796 _("typecmp: no argument list"));
1798 /* Skip ``this'' argument if applicable. T2 will always include
1804 (i < nargs) && TYPE_CODE (t1[i].type) != TYPE_CODE_VOID;
1807 struct type *tt1, *tt2;
1812 tt1 = check_typedef (t1[i].type);
1813 tt2 = check_typedef (value_type (t2[i]));
1815 if (TYPE_CODE (tt1) == TYPE_CODE_REF
1816 /* We should be doing hairy argument matching, as below. */
1817 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1))) == TYPE_CODE (tt2)))
1819 if (TYPE_CODE (tt2) == TYPE_CODE_ARRAY)
1820 t2[i] = value_coerce_array (t2[i]);
1822 t2[i] = value_ref (t2[i]);
1826 /* djb - 20000715 - Until the new type structure is in the
1827 place, and we can attempt things like implicit conversions,
1828 we need to do this so you can take something like a map<const
1829 char *>, and properly access map["hello"], because the
1830 argument to [] will be a reference to a pointer to a char,
1831 and the argument will be a pointer to a char. */
1832 while (TYPE_CODE(tt1) == TYPE_CODE_REF
1833 || TYPE_CODE (tt1) == TYPE_CODE_PTR)
1835 tt1 = check_typedef( TYPE_TARGET_TYPE(tt1) );
1837 while (TYPE_CODE(tt2) == TYPE_CODE_ARRAY
1838 || TYPE_CODE(tt2) == TYPE_CODE_PTR
1839 || TYPE_CODE(tt2) == TYPE_CODE_REF)
1841 tt2 = check_typedef (TYPE_TARGET_TYPE(tt2));
1843 if (TYPE_CODE (tt1) == TYPE_CODE (tt2))
1845 /* Array to pointer is a `trivial conversion' according to the
1848 /* We should be doing much hairier argument matching (see
1849 section 13.2 of the ARM), but as a quick kludge, just check
1850 for the same type code. */
1851 if (TYPE_CODE (t1[i].type) != TYPE_CODE (value_type (t2[i])))
1854 if (varargs || t2[i] == NULL)
1859 /* Helper function used by value_struct_elt to recurse through
1860 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1861 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1862 TYPE. If found, return value, else return NULL.
1864 If LOOKING_FOR_BASECLASS, then instead of looking for struct
1865 fields, look for a baseclass named NAME. */
1867 static struct value *
1868 search_struct_field (const char *name, struct value *arg1, int offset,
1869 struct type *type, int looking_for_baseclass)
1874 CHECK_TYPEDEF (type);
1875 nbases = TYPE_N_BASECLASSES (type);
1877 if (!looking_for_baseclass)
1878 for (i = TYPE_NFIELDS (type) - 1; i >= nbases; i--)
1880 char *t_field_name = TYPE_FIELD_NAME (type, i);
1882 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
1886 if (field_is_static (&TYPE_FIELD (type, i)))
1888 v = value_static_field (type, i);
1890 error (_("field %s is nonexistent or has been optimized out"),
1895 v = value_primitive_field (arg1, offset, i, type);
1897 error (_("there is no field named %s"), name);
1903 && (t_field_name[0] == '\0'
1904 || (TYPE_CODE (type) == TYPE_CODE_UNION
1905 && (strcmp_iw (t_field_name, "else") == 0))))
1907 struct type *field_type = TYPE_FIELD_TYPE (type, i);
1909 if (TYPE_CODE (field_type) == TYPE_CODE_UNION
1910 || TYPE_CODE (field_type) == TYPE_CODE_STRUCT)
1912 /* Look for a match through the fields of an anonymous
1913 union, or anonymous struct. C++ provides anonymous
1916 In the GNU Chill (now deleted from GDB)
1917 implementation of variant record types, each
1918 <alternative field> has an (anonymous) union type,
1919 each member of the union represents a <variant
1920 alternative>. Each <variant alternative> is
1921 represented as a struct, with a member for each
1925 int new_offset = offset;
1927 /* This is pretty gross. In G++, the offset in an
1928 anonymous union is relative to the beginning of the
1929 enclosing struct. In the GNU Chill (now deleted
1930 from GDB) implementation of variant records, the
1931 bitpos is zero in an anonymous union field, so we
1932 have to add the offset of the union here. */
1933 if (TYPE_CODE (field_type) == TYPE_CODE_STRUCT
1934 || (TYPE_NFIELDS (field_type) > 0
1935 && TYPE_FIELD_BITPOS (field_type, 0) == 0))
1936 new_offset += TYPE_FIELD_BITPOS (type, i) / 8;
1938 v = search_struct_field (name, arg1, new_offset,
1940 looking_for_baseclass);
1947 for (i = 0; i < nbases; i++)
1950 struct type *basetype = check_typedef (TYPE_BASECLASS (type, i));
1951 /* If we are looking for baseclasses, this is what we get when
1952 we hit them. But it could happen that the base part's member
1953 name is not yet filled in. */
1954 int found_baseclass = (looking_for_baseclass
1955 && TYPE_BASECLASS_NAME (type, i) != NULL
1956 && (strcmp_iw (name,
1957 TYPE_BASECLASS_NAME (type,
1960 if (BASETYPE_VIA_VIRTUAL (type, i))
1965 boffset = baseclass_offset (type, i,
1966 value_contents (arg1) + offset,
1967 value_address (arg1)
1968 + value_embedded_offset (arg1)
1971 error (_("virtual baseclass botch"));
1973 /* The virtual base class pointer might have been clobbered
1974 by the user program. Make sure that it still points to a
1975 valid memory location. */
1977 boffset += value_embedded_offset (arg1) + offset;
1979 || boffset >= TYPE_LENGTH (value_enclosing_type (arg1)))
1981 CORE_ADDR base_addr;
1983 v2 = allocate_value (basetype);
1984 base_addr = value_address (arg1) + boffset;
1985 if (target_read_memory (base_addr,
1986 value_contents_raw (v2),
1987 TYPE_LENGTH (basetype)) != 0)
1988 error (_("virtual baseclass botch"));
1989 VALUE_LVAL (v2) = lval_memory;
1990 set_value_address (v2, base_addr);
1994 v2 = value_copy (arg1);
1995 deprecated_set_value_type (v2, basetype);
1996 set_value_embedded_offset (v2, boffset);
1999 if (found_baseclass)
2001 v = search_struct_field (name, v2, 0,
2002 TYPE_BASECLASS (type, i),
2003 looking_for_baseclass);
2005 else if (found_baseclass)
2006 v = value_primitive_field (arg1, offset, i, type);
2008 v = search_struct_field (name, arg1,
2009 offset + TYPE_BASECLASS_BITPOS (type,
2011 basetype, looking_for_baseclass);
2018 /* Helper function used by value_struct_elt to recurse through
2019 baseclasses. Look for a field NAME in ARG1. Adjust the address of
2020 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
2023 If found, return value, else if name matched and args not return
2024 (value) -1, else return NULL. */
2026 static struct value *
2027 search_struct_method (const char *name, struct value **arg1p,
2028 struct value **args, int offset,
2029 int *static_memfuncp, struct type *type)
2033 int name_matched = 0;
2034 char dem_opname[64];
2036 CHECK_TYPEDEF (type);
2037 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
2039 char *t_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
2041 /* FIXME! May need to check for ARM demangling here */
2042 if (strncmp (t_field_name, "__", 2) == 0 ||
2043 strncmp (t_field_name, "op", 2) == 0 ||
2044 strncmp (t_field_name, "type", 4) == 0)
2046 if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI))
2047 t_field_name = dem_opname;
2048 else if (cplus_demangle_opname (t_field_name, dem_opname, 0))
2049 t_field_name = dem_opname;
2051 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
2053 int j = TYPE_FN_FIELDLIST_LENGTH (type, i) - 1;
2054 struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i);
2057 check_stub_method_group (type, i);
2058 if (j > 0 && args == 0)
2059 error (_("cannot resolve overloaded method `%s': no arguments supplied"), name);
2060 else if (j == 0 && args == 0)
2062 v = value_fn_field (arg1p, f, j, type, offset);
2069 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f, j),
2070 TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f, j)),
2071 TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f, j)),
2072 TYPE_FN_FIELD_ARGS (f, j), args))
2074 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
2075 return value_virtual_fn_field (arg1p, f, j,
2077 if (TYPE_FN_FIELD_STATIC_P (f, j)
2079 *static_memfuncp = 1;
2080 v = value_fn_field (arg1p, f, j, type, offset);
2089 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2093 if (BASETYPE_VIA_VIRTUAL (type, i))
2095 struct type *baseclass = check_typedef (TYPE_BASECLASS (type, i));
2096 const gdb_byte *base_valaddr;
2098 /* The virtual base class pointer might have been
2099 clobbered by the user program. Make sure that it
2100 still points to a valid memory location. */
2102 if (offset < 0 || offset >= TYPE_LENGTH (type))
2104 gdb_byte *tmp = alloca (TYPE_LENGTH (baseclass));
2106 if (target_read_memory (value_address (*arg1p) + offset,
2107 tmp, TYPE_LENGTH (baseclass)) != 0)
2108 error (_("virtual baseclass botch"));
2112 base_valaddr = value_contents (*arg1p) + offset;
2114 base_offset = baseclass_offset (type, i, base_valaddr,
2115 value_address (*arg1p) + offset);
2116 if (base_offset == -1)
2117 error (_("virtual baseclass botch"));
2121 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
2123 v = search_struct_method (name, arg1p, args, base_offset + offset,
2124 static_memfuncp, TYPE_BASECLASS (type, i));
2125 if (v == (struct value *) - 1)
2131 /* FIXME-bothner: Why is this commented out? Why is it here? */
2132 /* *arg1p = arg1_tmp; */
2137 return (struct value *) - 1;
2142 /* Given *ARGP, a value of type (pointer to a)* structure/union,
2143 extract the component named NAME from the ultimate target
2144 structure/union and return it as a value with its appropriate type.
2145 ERR is used in the error message if *ARGP's type is wrong.
2147 C++: ARGS is a list of argument types to aid in the selection of
2148 an appropriate method. Also, handle derived types.
2150 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
2151 where the truthvalue of whether the function that was resolved was
2152 a static member function or not is stored.
2154 ERR is an error message to be printed in case the field is not
2158 value_struct_elt (struct value **argp, struct value **args,
2159 const char *name, int *static_memfuncp, const char *err)
2164 *argp = coerce_array (*argp);
2166 t = check_typedef (value_type (*argp));
2168 /* Follow pointers until we get to a non-pointer. */
2170 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
2172 *argp = value_ind (*argp);
2173 /* Don't coerce fn pointer to fn and then back again! */
2174 if (TYPE_CODE (value_type (*argp)) != TYPE_CODE_FUNC)
2175 *argp = coerce_array (*argp);
2176 t = check_typedef (value_type (*argp));
2179 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2180 && TYPE_CODE (t) != TYPE_CODE_UNION)
2181 error (_("Attempt to extract a component of a value that is not a %s."), err);
2183 /* Assume it's not, unless we see that it is. */
2184 if (static_memfuncp)
2185 *static_memfuncp = 0;
2189 /* if there are no arguments ...do this... */
2191 /* Try as a field first, because if we succeed, there is less
2193 v = search_struct_field (name, *argp, 0, t, 0);
2197 /* C++: If it was not found as a data field, then try to
2198 return it as a pointer to a method. */
2199 v = search_struct_method (name, argp, args, 0,
2200 static_memfuncp, t);
2202 if (v == (struct value *) - 1)
2203 error (_("Cannot take address of method %s."), name);
2206 if (TYPE_NFN_FIELDS (t))
2207 error (_("There is no member or method named %s."), name);
2209 error (_("There is no member named %s."), name);
2214 v = search_struct_method (name, argp, args, 0,
2215 static_memfuncp, t);
2217 if (v == (struct value *) - 1)
2219 error (_("One of the arguments you tried to pass to %s could not be converted to what the function wants."), name);
2223 /* See if user tried to invoke data as function. If so, hand it
2224 back. If it's not callable (i.e., a pointer to function),
2225 gdb should give an error. */
2226 v = search_struct_field (name, *argp, 0, t, 0);
2227 /* If we found an ordinary field, then it is not a method call.
2228 So, treat it as if it were a static member function. */
2229 if (v && static_memfuncp)
2230 *static_memfuncp = 1;
2234 throw_error (NOT_FOUND_ERROR,
2235 _("Structure has no component named %s."), name);
2239 /* Search through the methods of an object (and its bases) to find a
2240 specified method. Return the pointer to the fn_field list of
2241 overloaded instances.
2243 Helper function for value_find_oload_list.
2244 ARGP is a pointer to a pointer to a value (the object).
2245 METHOD is a string containing the method name.
2246 OFFSET is the offset within the value.
2247 TYPE is the assumed type of the object.
2248 NUM_FNS is the number of overloaded instances.
2249 BASETYPE is set to the actual type of the subobject where the
2251 BOFFSET is the offset of the base subobject where the method is found.
2254 static struct fn_field *
2255 find_method_list (struct value **argp, const char *method,
2256 int offset, struct type *type, int *num_fns,
2257 struct type **basetype, int *boffset)
2261 CHECK_TYPEDEF (type);
2265 /* First check in object itself. */
2266 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
2268 /* pai: FIXME What about operators and type conversions? */
2269 char *fn_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
2271 if (fn_field_name && (strcmp_iw (fn_field_name, method) == 0))
2273 int len = TYPE_FN_FIELDLIST_LENGTH (type, i);
2274 struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i);
2280 /* Resolve any stub methods. */
2281 check_stub_method_group (type, i);
2287 /* Not found in object, check in base subobjects. */
2288 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2292 if (BASETYPE_VIA_VIRTUAL (type, i))
2294 base_offset = value_offset (*argp) + offset;
2295 base_offset = baseclass_offset (type, i,
2296 value_contents (*argp) + base_offset,
2297 value_address (*argp) + base_offset);
2298 if (base_offset == -1)
2299 error (_("virtual baseclass botch"));
2301 else /* Non-virtual base, simply use bit position from debug
2304 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
2306 f = find_method_list (argp, method, base_offset + offset,
2307 TYPE_BASECLASS (type, i), num_fns,
2315 /* Return the list of overloaded methods of a specified name.
2317 ARGP is a pointer to a pointer to a value (the object).
2318 METHOD is the method name.
2319 OFFSET is the offset within the value contents.
2320 NUM_FNS is the number of overloaded instances.
2321 BASETYPE is set to the type of the base subobject that defines the
2323 BOFFSET is the offset of the base subobject which defines the method.
2327 value_find_oload_method_list (struct value **argp, const char *method,
2328 int offset, int *num_fns,
2329 struct type **basetype, int *boffset)
2333 t = check_typedef (value_type (*argp));
2335 /* Code snarfed from value_struct_elt. */
2336 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
2338 *argp = value_ind (*argp);
2339 /* Don't coerce fn pointer to fn and then back again! */
2340 if (TYPE_CODE (value_type (*argp)) != TYPE_CODE_FUNC)
2341 *argp = coerce_array (*argp);
2342 t = check_typedef (value_type (*argp));
2345 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2346 && TYPE_CODE (t) != TYPE_CODE_UNION)
2347 error (_("Attempt to extract a component of a value that is not a struct or union"));
2349 return find_method_list (argp, method, 0, t, num_fns,
2353 /* Given an array of argument types (ARGTYPES) (which includes an
2354 entry for "this" in the case of C++ methods), the number of
2355 arguments NARGS, the NAME of a function whether it's a method or
2356 not (METHOD), and the degree of laxness (LAX) in conforming to
2357 overload resolution rules in ANSI C++, find the best function that
2358 matches on the argument types according to the overload resolution
2361 METHOD can be one of three values:
2362 NON_METHOD for non-member functions.
2363 METHOD: for member functions.
2364 BOTH: used for overload resolution of operators where the
2365 candidates are expected to be either member or non member
2366 functions. In this case the first argument ARGTYPES
2367 (representing 'this') is expected to be a reference to the
2368 target object, and will be dereferenced when attempting the
2371 In the case of class methods, the parameter OBJ is an object value
2372 in which to search for overloaded methods.
2374 In the case of non-method functions, the parameter FSYM is a symbol
2375 corresponding to one of the overloaded functions.
2377 Return value is an integer: 0 -> good match, 10 -> debugger applied
2378 non-standard coercions, 100 -> incompatible.
2380 If a method is being searched for, VALP will hold the value.
2381 If a non-method is being searched for, SYMP will hold the symbol
2384 If a method is being searched for, and it is a static method,
2385 then STATICP will point to a non-zero value.
2387 If NO_ADL argument dependent lookup is disabled. This is used to prevent
2388 ADL overload candidates when performing overload resolution for a fully
2391 Note: This function does *not* check the value of
2392 overload_resolution. Caller must check it to see whether overload
2393 resolution is permitted.
2397 find_overload_match (struct type **arg_types, int nargs,
2398 const char *name, enum oload_search_type method,
2399 int lax, struct value **objp, struct symbol *fsym,
2400 struct value **valp, struct symbol **symp,
2401 int *staticp, const int no_adl)
2403 struct value *obj = (objp ? *objp : NULL);
2404 /* Index of best overloaded function. */
2405 int func_oload_champ = -1;
2406 int method_oload_champ = -1;
2408 /* The measure for the current best match. */
2409 struct badness_vector *method_badness = NULL;
2410 struct badness_vector *func_badness = NULL;
2412 struct value *temp = obj;
2413 /* For methods, the list of overloaded methods. */
2414 struct fn_field *fns_ptr = NULL;
2415 /* For non-methods, the list of overloaded function symbols. */
2416 struct symbol **oload_syms = NULL;
2417 /* Number of overloaded instances being considered. */
2419 struct type *basetype = NULL;
2422 struct cleanup *all_cleanups = make_cleanup (null_cleanup, NULL);
2424 const char *obj_type_name = NULL;
2425 const char *func_name = NULL;
2426 enum oload_classification match_quality;
2427 enum oload_classification method_match_quality = INCOMPATIBLE;
2428 enum oload_classification func_match_quality = INCOMPATIBLE;
2430 /* Get the list of overloaded methods or functions. */
2431 if (method == METHOD || method == BOTH)
2435 /* OBJ may be a pointer value rather than the object itself. */
2436 obj = coerce_ref (obj);
2437 while (TYPE_CODE (check_typedef (value_type (obj))) == TYPE_CODE_PTR)
2438 obj = coerce_ref (value_ind (obj));
2439 obj_type_name = TYPE_NAME (value_type (obj));
2441 /* First check whether this is a data member, e.g. a pointer to
2443 if (TYPE_CODE (check_typedef (value_type (obj))) == TYPE_CODE_STRUCT)
2445 *valp = search_struct_field (name, obj, 0,
2446 check_typedef (value_type (obj)), 0);
2454 /* Retrieve the list of methods with the name NAME. */
2455 fns_ptr = value_find_oload_method_list (&temp, name,
2457 &basetype, &boffset);
2458 /* If this is a method only search, and no methods were found
2459 the search has faild. */
2460 if (method == METHOD && (!fns_ptr || !num_fns))
2461 error (_("Couldn't find method %s%s%s"),
2463 (obj_type_name && *obj_type_name) ? "::" : "",
2465 /* If we are dealing with stub method types, they should have
2466 been resolved by find_method_list via
2467 value_find_oload_method_list above. */
2470 gdb_assert (TYPE_DOMAIN_TYPE (fns_ptr[0].type) != NULL);
2471 method_oload_champ = find_oload_champ (arg_types, nargs, method,
2473 oload_syms, &method_badness);
2475 method_match_quality =
2476 classify_oload_match (method_badness, nargs,
2477 oload_method_static (method, fns_ptr,
2478 method_oload_champ));
2480 make_cleanup (xfree, method_badness);
2485 if (method == NON_METHOD || method == BOTH)
2487 const char *qualified_name = NULL;
2489 /* If the the overload match is being search for both
2490 as a method and non member function, the first argument
2491 must now be dereferenced. */
2493 arg_types[0] = TYPE_TARGET_TYPE (arg_types[0]);
2497 qualified_name = SYMBOL_NATURAL_NAME (fsym);
2499 /* If we have a function with a C++ name, try to extract just
2500 the function part. Do not try this for non-functions (e.g.
2501 function pointers). */
2503 && TYPE_CODE (check_typedef (SYMBOL_TYPE (fsym))) == TYPE_CODE_FUNC)
2507 temp = cp_func_name (qualified_name);
2509 /* If cp_func_name did not remove anything, the name of the
2510 symbol did not include scope or argument types - it was
2511 probably a C-style function. */
2514 make_cleanup (xfree, temp);
2515 if (strcmp (temp, qualified_name) == 0)
2525 qualified_name = name;
2528 /* If there was no C++ name, this must be a C-style function or
2529 not a function at all. Just return the same symbol. Do the
2530 same if cp_func_name fails for some reason. */
2531 if (func_name == NULL)
2537 func_oload_champ = find_oload_champ_namespace (arg_types, nargs,
2544 if (func_oload_champ >= 0)
2545 func_match_quality = classify_oload_match (func_badness, nargs, 0);
2547 make_cleanup (xfree, oload_syms);
2548 make_cleanup (xfree, func_badness);
2551 /* Did we find a match ? */
2552 if (method_oload_champ == -1 && func_oload_champ == -1)
2553 throw_error (NOT_FOUND_ERROR,
2554 _("No symbol \"%s\" in current context."),
2557 /* If we have found both a method match and a function
2558 match, find out which one is better, and calculate match
2560 if (method_oload_champ >= 0 && func_oload_champ >= 0)
2562 switch (compare_badness (func_badness, method_badness))
2564 case 0: /* Top two contenders are equally good. */
2565 /* FIXME: GDB does not support the general ambiguous
2566 case. All candidates should be collected and presented
2568 error (_("Ambiguous overload resolution"));
2570 case 1: /* Incomparable top contenders. */
2571 /* This is an error incompatible candidates
2572 should not have been proposed. */
2573 error (_("Internal error: incompatible overload candidates proposed"));
2575 case 2: /* Function champion. */
2576 method_oload_champ = -1;
2577 match_quality = func_match_quality;
2579 case 3: /* Method champion. */
2580 func_oload_champ = -1;
2581 match_quality = method_match_quality;
2584 error (_("Internal error: unexpected overload comparison result"));
2590 /* We have either a method match or a function match. */
2591 if (method_oload_champ >= 0)
2592 match_quality = method_match_quality;
2594 match_quality = func_match_quality;
2597 if (match_quality == INCOMPATIBLE)
2599 if (method == METHOD)
2600 error (_("Cannot resolve method %s%s%s to any overloaded instance"),
2602 (obj_type_name && *obj_type_name) ? "::" : "",
2605 error (_("Cannot resolve function %s to any overloaded instance"),
2608 else if (match_quality == NON_STANDARD)
2610 if (method == METHOD)
2611 warning (_("Using non-standard conversion to match method %s%s%s to supplied arguments"),
2613 (obj_type_name && *obj_type_name) ? "::" : "",
2616 warning (_("Using non-standard conversion to match function %s to supplied arguments"),
2620 if (staticp != NULL)
2621 *staticp = oload_method_static (method, fns_ptr, method_oload_champ);
2623 if (method_oload_champ >= 0)
2625 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr, method_oload_champ))
2626 *valp = value_virtual_fn_field (&temp, fns_ptr, method_oload_champ,
2629 *valp = value_fn_field (&temp, fns_ptr, method_oload_champ,
2633 *symp = oload_syms[func_oload_champ];
2637 struct type *temp_type = check_typedef (value_type (temp));
2638 struct type *obj_type = check_typedef (value_type (*objp));
2640 if (TYPE_CODE (temp_type) != TYPE_CODE_PTR
2641 && (TYPE_CODE (obj_type) == TYPE_CODE_PTR
2642 || TYPE_CODE (obj_type) == TYPE_CODE_REF))
2644 temp = value_addr (temp);
2649 do_cleanups (all_cleanups);
2651 switch (match_quality)
2657 default: /* STANDARD */
2662 /* Find the best overload match, searching for FUNC_NAME in namespaces
2663 contained in QUALIFIED_NAME until it either finds a good match or
2664 runs out of namespaces. It stores the overloaded functions in
2665 *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. The
2666 calling function is responsible for freeing *OLOAD_SYMS and
2667 *OLOAD_CHAMP_BV. If NO_ADL, argument dependent lookup is not
2671 find_oload_champ_namespace (struct type **arg_types, int nargs,
2672 const char *func_name,
2673 const char *qualified_name,
2674 struct symbol ***oload_syms,
2675 struct badness_vector **oload_champ_bv,
2680 find_oload_champ_namespace_loop (arg_types, nargs,
2683 oload_syms, oload_champ_bv,
2690 /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is
2691 how deep we've looked for namespaces, and the champ is stored in
2692 OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0
2693 if it isn't. Other arguments are the same as in
2694 find_oload_champ_namespace
2696 It is the caller's responsibility to free *OLOAD_SYMS and
2700 find_oload_champ_namespace_loop (struct type **arg_types, int nargs,
2701 const char *func_name,
2702 const char *qualified_name,
2704 struct symbol ***oload_syms,
2705 struct badness_vector **oload_champ_bv,
2709 int next_namespace_len = namespace_len;
2710 int searched_deeper = 0;
2712 struct cleanup *old_cleanups;
2713 int new_oload_champ;
2714 struct symbol **new_oload_syms;
2715 struct badness_vector *new_oload_champ_bv;
2716 char *new_namespace;
2718 if (next_namespace_len != 0)
2720 gdb_assert (qualified_name[next_namespace_len] == ':');
2721 next_namespace_len += 2;
2723 next_namespace_len +=
2724 cp_find_first_component (qualified_name + next_namespace_len);
2726 /* Initialize these to values that can safely be xfree'd. */
2728 *oload_champ_bv = NULL;
2730 /* First, see if we have a deeper namespace we can search in.
2731 If we get a good match there, use it. */
2733 if (qualified_name[next_namespace_len] == ':')
2735 searched_deeper = 1;
2737 if (find_oload_champ_namespace_loop (arg_types, nargs,
2738 func_name, qualified_name,
2740 oload_syms, oload_champ_bv,
2741 oload_champ, no_adl))
2747 /* If we reach here, either we're in the deepest namespace or we
2748 didn't find a good match in a deeper namespace. But, in the
2749 latter case, we still have a bad match in a deeper namespace;
2750 note that we might not find any match at all in the current
2751 namespace. (There's always a match in the deepest namespace,
2752 because this overload mechanism only gets called if there's a
2753 function symbol to start off with.) */
2755 old_cleanups = make_cleanup (xfree, *oload_syms);
2756 make_cleanup (xfree, *oload_champ_bv);
2757 new_namespace = alloca (namespace_len + 1);
2758 strncpy (new_namespace, qualified_name, namespace_len);
2759 new_namespace[namespace_len] = '\0';
2760 new_oload_syms = make_symbol_overload_list (func_name,
2763 /* If we have reached the deepest level perform argument
2764 determined lookup. */
2765 if (!searched_deeper && !no_adl)
2766 make_symbol_overload_list_adl (arg_types, nargs, func_name);
2768 while (new_oload_syms[num_fns])
2771 new_oload_champ = find_oload_champ (arg_types, nargs, 0, num_fns,
2772 NULL, new_oload_syms,
2773 &new_oload_champ_bv);
2775 /* Case 1: We found a good match. Free earlier matches (if any),
2776 and return it. Case 2: We didn't find a good match, but we're
2777 not the deepest function. Then go with the bad match that the
2778 deeper function found. Case 3: We found a bad match, and we're
2779 the deepest function. Then return what we found, even though
2780 it's a bad match. */
2782 if (new_oload_champ != -1
2783 && classify_oload_match (new_oload_champ_bv, nargs, 0) == STANDARD)
2785 *oload_syms = new_oload_syms;
2786 *oload_champ = new_oload_champ;
2787 *oload_champ_bv = new_oload_champ_bv;
2788 do_cleanups (old_cleanups);
2791 else if (searched_deeper)
2793 xfree (new_oload_syms);
2794 xfree (new_oload_champ_bv);
2795 discard_cleanups (old_cleanups);
2800 *oload_syms = new_oload_syms;
2801 *oload_champ = new_oload_champ;
2802 *oload_champ_bv = new_oload_champ_bv;
2803 do_cleanups (old_cleanups);
2808 /* Look for a function to take NARGS args of types ARG_TYPES. Find
2809 the best match from among the overloaded methods or functions
2810 (depending on METHOD) given by FNS_PTR or OLOAD_SYMS, respectively.
2811 The number of methods/functions in the list is given by NUM_FNS.
2812 Return the index of the best match; store an indication of the
2813 quality of the match in OLOAD_CHAMP_BV.
2815 It is the caller's responsibility to free *OLOAD_CHAMP_BV. */
2818 find_oload_champ (struct type **arg_types, int nargs, int method,
2819 int num_fns, struct fn_field *fns_ptr,
2820 struct symbol **oload_syms,
2821 struct badness_vector **oload_champ_bv)
2824 /* A measure of how good an overloaded instance is. */
2825 struct badness_vector *bv;
2826 /* Index of best overloaded function. */
2827 int oload_champ = -1;
2828 /* Current ambiguity state for overload resolution. */
2829 int oload_ambiguous = 0;
2830 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */
2832 *oload_champ_bv = NULL;
2834 /* Consider each candidate in turn. */
2835 for (ix = 0; ix < num_fns; ix++)
2838 int static_offset = oload_method_static (method, fns_ptr, ix);
2840 struct type **parm_types;
2844 nparms = TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (fns_ptr, ix));
2848 /* If it's not a method, this is the proper place. */
2849 nparms = TYPE_NFIELDS (SYMBOL_TYPE (oload_syms[ix]));
2852 /* Prepare array of parameter types. */
2853 parm_types = (struct type **)
2854 xmalloc (nparms * (sizeof (struct type *)));
2855 for (jj = 0; jj < nparms; jj++)
2856 parm_types[jj] = (method
2857 ? (TYPE_FN_FIELD_ARGS (fns_ptr, ix)[jj].type)
2858 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms[ix]),
2861 /* Compare parameter types to supplied argument types. Skip
2862 THIS for static methods. */
2863 bv = rank_function (parm_types, nparms,
2864 arg_types + static_offset,
2865 nargs - static_offset);
2867 if (!*oload_champ_bv)
2869 *oload_champ_bv = bv;
2872 else /* See whether current candidate is better or worse than
2874 switch (compare_badness (bv, *oload_champ_bv))
2876 case 0: /* Top two contenders are equally good. */
2877 oload_ambiguous = 1;
2879 case 1: /* Incomparable top contenders. */
2880 oload_ambiguous = 2;
2882 case 2: /* New champion, record details. */
2883 *oload_champ_bv = bv;
2884 oload_ambiguous = 0;
2895 fprintf_filtered (gdb_stderr,
2896 "Overloaded method instance %s, # of parms %d\n",
2897 fns_ptr[ix].physname, nparms);
2899 fprintf_filtered (gdb_stderr,
2900 "Overloaded function instance %s # of parms %d\n",
2901 SYMBOL_DEMANGLED_NAME (oload_syms[ix]),
2903 for (jj = 0; jj < nargs - static_offset; jj++)
2904 fprintf_filtered (gdb_stderr,
2905 "...Badness @ %d : %d\n",
2906 jj, bv->rank[jj].rank);
2907 fprintf_filtered (gdb_stderr,
2908 "Overload resolution champion is %d, ambiguous? %d\n",
2909 oload_champ, oload_ambiguous);
2916 /* Return 1 if we're looking at a static method, 0 if we're looking at
2917 a non-static method or a function that isn't a method. */
2920 oload_method_static (int method, struct fn_field *fns_ptr, int index)
2922 if (method && fns_ptr && index >= 0
2923 && TYPE_FN_FIELD_STATIC_P (fns_ptr, index))
2929 /* Check how good an overload match OLOAD_CHAMP_BV represents. */
2931 static enum oload_classification
2932 classify_oload_match (struct badness_vector *oload_champ_bv,
2938 for (ix = 1; ix <= nargs - static_offset; ix++)
2940 /* If this conversion is as bad as INCOMPATIBLE_TYPE_BADNESS
2941 or worse return INCOMPATIBLE. */
2942 if (compare_ranks (oload_champ_bv->rank[ix],
2943 INCOMPATIBLE_TYPE_BADNESS) <= 0)
2944 return INCOMPATIBLE; /* Truly mismatched types. */
2945 /* Otherwise If this conversion is as bad as
2946 NS_POINTER_CONVERSION_BADNESS or worse return NON_STANDARD. */
2947 else if (compare_ranks (oload_champ_bv->rank[ix],
2948 NS_POINTER_CONVERSION_BADNESS) <= 0)
2949 return NON_STANDARD; /* Non-standard type conversions
2953 return STANDARD; /* Only standard conversions needed. */
2956 /* C++: return 1 is NAME is a legitimate name for the destructor of
2957 type TYPE. If TYPE does not have a destructor, or if NAME is
2958 inappropriate for TYPE, an error is signaled. */
2960 destructor_name_p (const char *name, const struct type *type)
2964 char *dname = type_name_no_tag (type);
2965 char *cp = strchr (dname, '<');
2968 /* Do not compare the template part for template classes. */
2970 len = strlen (dname);
2973 if (strlen (name + 1) != len || strncmp (dname, name + 1, len) != 0)
2974 error (_("name of destructor must equal name of class"));
2981 /* Given TYPE, a structure/union,
2982 return 1 if the component named NAME from the ultimate target
2983 structure/union is defined, otherwise, return 0. */
2986 check_field (struct type *type, const char *name)
2990 /* The type may be a stub. */
2991 CHECK_TYPEDEF (type);
2993 for (i = TYPE_NFIELDS (type) - 1; i >= TYPE_N_BASECLASSES (type); i--)
2995 char *t_field_name = TYPE_FIELD_NAME (type, i);
2997 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
3001 /* C++: If it was not found as a data field, then try to return it
3002 as a pointer to a method. */
3004 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; --i)
3006 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type, i), name) == 0)
3010 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
3011 if (check_field (TYPE_BASECLASS (type, i), name))
3017 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3018 return the appropriate member (or the address of the member, if
3019 WANT_ADDRESS). This function is used to resolve user expressions
3020 of the form "DOMAIN::NAME". For more details on what happens, see
3021 the comment before value_struct_elt_for_reference. */
3024 value_aggregate_elt (struct type *curtype, char *name,
3025 struct type *expect_type, int want_address,
3028 switch (TYPE_CODE (curtype))
3030 case TYPE_CODE_STRUCT:
3031 case TYPE_CODE_UNION:
3032 return value_struct_elt_for_reference (curtype, 0, curtype,
3034 want_address, noside);
3035 case TYPE_CODE_NAMESPACE:
3036 return value_namespace_elt (curtype, name,
3037 want_address, noside);
3039 internal_error (__FILE__, __LINE__,
3040 _("non-aggregate type in value_aggregate_elt"));
3044 /* Compares the two method/function types T1 and T2 for "equality"
3045 with respect to the the methods' parameters. If the types of the
3046 two parameter lists are the same, returns 1; 0 otherwise. This
3047 comparison may ignore any artificial parameters in T1 if
3048 SKIP_ARTIFICIAL is non-zero. This function will ALWAYS skip
3049 the first artificial parameter in T1, assumed to be a 'this' pointer.
3051 The type T2 is expected to have come from make_params (in eval.c). */
3054 compare_parameters (struct type *t1, struct type *t2, int skip_artificial)
3058 if (TYPE_FIELD_ARTIFICIAL (t1, 0))
3061 /* If skipping artificial fields, find the first real field
3063 if (skip_artificial)
3065 while (start < TYPE_NFIELDS (t1)
3066 && TYPE_FIELD_ARTIFICIAL (t1, start))
3070 /* Now compare parameters */
3072 /* Special case: a method taking void. T1 will contain no
3073 non-artificial fields, and T2 will contain TYPE_CODE_VOID. */
3074 if ((TYPE_NFIELDS (t1) - start) == 0 && TYPE_NFIELDS (t2) == 1
3075 && TYPE_CODE (TYPE_FIELD_TYPE (t2, 0)) == TYPE_CODE_VOID)
3078 if ((TYPE_NFIELDS (t1) - start) == TYPE_NFIELDS (t2))
3082 for (i = 0; i < TYPE_NFIELDS (t2); ++i)
3084 if (compare_ranks (rank_one_type (TYPE_FIELD_TYPE (t1, start + i),
3085 TYPE_FIELD_TYPE (t2, i)),
3086 EXACT_MATCH_BADNESS) != 0)
3096 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3097 return the address of this member as a "pointer to member" type.
3098 If INTYPE is non-null, then it will be the type of the member we
3099 are looking for. This will help us resolve "pointers to member
3100 functions". This function is used to resolve user expressions of
3101 the form "DOMAIN::NAME". */
3103 static struct value *
3104 value_struct_elt_for_reference (struct type *domain, int offset,
3105 struct type *curtype, char *name,
3106 struct type *intype,
3110 struct type *t = curtype;
3112 struct value *v, *result;
3114 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
3115 && TYPE_CODE (t) != TYPE_CODE_UNION)
3116 error (_("Internal error: non-aggregate type to value_struct_elt_for_reference"));
3118 for (i = TYPE_NFIELDS (t) - 1; i >= TYPE_N_BASECLASSES (t); i--)
3120 char *t_field_name = TYPE_FIELD_NAME (t, i);
3122 if (t_field_name && strcmp (t_field_name, name) == 0)
3124 if (field_is_static (&TYPE_FIELD (t, i)))
3126 v = value_static_field (t, i);
3128 error (_("static field %s has been optimized out"),
3134 if (TYPE_FIELD_PACKED (t, i))
3135 error (_("pointers to bitfield members not allowed"));
3138 return value_from_longest
3139 (lookup_memberptr_type (TYPE_FIELD_TYPE (t, i), domain),
3140 offset + (LONGEST) (TYPE_FIELD_BITPOS (t, i) >> 3));
3141 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
3142 return allocate_value (TYPE_FIELD_TYPE (t, i));
3144 error (_("Cannot reference non-static field \"%s\""), name);
3148 /* C++: If it was not found as a data field, then try to return it
3149 as a pointer to a method. */
3151 /* Perform all necessary dereferencing. */
3152 while (intype && TYPE_CODE (intype) == TYPE_CODE_PTR)
3153 intype = TYPE_TARGET_TYPE (intype);
3155 for (i = TYPE_NFN_FIELDS (t) - 1; i >= 0; --i)
3157 char *t_field_name = TYPE_FN_FIELDLIST_NAME (t, i);
3158 char dem_opname[64];
3160 if (strncmp (t_field_name, "__", 2) == 0
3161 || strncmp (t_field_name, "op", 2) == 0
3162 || strncmp (t_field_name, "type", 4) == 0)
3164 if (cplus_demangle_opname (t_field_name,
3165 dem_opname, DMGL_ANSI))
3166 t_field_name = dem_opname;
3167 else if (cplus_demangle_opname (t_field_name,
3169 t_field_name = dem_opname;
3171 if (t_field_name && strcmp (t_field_name, name) == 0)
3174 int len = TYPE_FN_FIELDLIST_LENGTH (t, i);
3175 struct fn_field *f = TYPE_FN_FIELDLIST1 (t, i);
3177 check_stub_method_group (t, i);
3181 for (j = 0; j < len; ++j)
3183 if (compare_parameters (TYPE_FN_FIELD_TYPE (f, j), intype, 0)
3184 || compare_parameters (TYPE_FN_FIELD_TYPE (f, j), intype, 1))
3189 error (_("no member function matches that type instantiation"));
3196 for (ii = 0; ii < TYPE_FN_FIELDLIST_LENGTH (t, i);
3199 /* Skip artificial methods. This is necessary if,
3200 for example, the user wants to "print
3201 subclass::subclass" with only one user-defined
3202 constructor. There is no ambiguity in this
3204 if (TYPE_FN_FIELD_ARTIFICIAL (f, ii))
3207 /* Desired method is ambiguous if more than one
3208 method is defined. */
3210 error (_("non-unique member `%s' requires type instantiation"), name);
3216 if (TYPE_FN_FIELD_STATIC_P (f, j))
3219 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j),
3226 return value_addr (read_var_value (s, 0));
3228 return read_var_value (s, 0);
3231 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
3235 result = allocate_value
3236 (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f, j)));
3237 cplus_make_method_ptr (value_type (result),
3238 value_contents_writeable (result),
3239 TYPE_FN_FIELD_VOFFSET (f, j), 1);
3241 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
3242 return allocate_value (TYPE_FN_FIELD_TYPE (f, j));
3244 error (_("Cannot reference virtual member function \"%s\""),
3250 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j),
3256 v = read_var_value (s, 0);
3261 result = allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f, j)));
3262 cplus_make_method_ptr (value_type (result),
3263 value_contents_writeable (result),
3264 value_address (v), 0);
3270 for (i = TYPE_N_BASECLASSES (t) - 1; i >= 0; i--)
3275 if (BASETYPE_VIA_VIRTUAL (t, i))
3278 base_offset = TYPE_BASECLASS_BITPOS (t, i) / 8;
3279 v = value_struct_elt_for_reference (domain,
3280 offset + base_offset,
3281 TYPE_BASECLASS (t, i),
3283 want_address, noside);
3288 /* As a last chance, pretend that CURTYPE is a namespace, and look
3289 it up that way; this (frequently) works for types nested inside
3292 return value_maybe_namespace_elt (curtype, name,
3293 want_address, noside);
3296 /* C++: Return the member NAME of the namespace given by the type
3299 static struct value *
3300 value_namespace_elt (const struct type *curtype,
3301 char *name, int want_address,
3304 struct value *retval = value_maybe_namespace_elt (curtype, name,
3309 error (_("No symbol \"%s\" in namespace \"%s\"."),
3310 name, TYPE_TAG_NAME (curtype));
3315 /* A helper function used by value_namespace_elt and
3316 value_struct_elt_for_reference. It looks up NAME inside the
3317 context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE
3318 is a class and NAME refers to a type in CURTYPE itself (as opposed
3319 to, say, some base class of CURTYPE). */
3321 static struct value *
3322 value_maybe_namespace_elt (const struct type *curtype,
3323 char *name, int want_address,
3326 const char *namespace_name = TYPE_TAG_NAME (curtype);
3328 struct value *result;
3330 sym = cp_lookup_symbol_namespace (namespace_name, name,
3331 get_selected_block (0), VAR_DOMAIN);
3335 char *concatenated_name = alloca (strlen (namespace_name) + 2
3336 + strlen (name) + 1);
3338 sprintf (concatenated_name, "%s::%s", namespace_name, name);
3339 sym = lookup_static_symbol_aux (concatenated_name, VAR_DOMAIN);
3344 else if ((noside == EVAL_AVOID_SIDE_EFFECTS)
3345 && (SYMBOL_CLASS (sym) == LOC_TYPEDEF))
3346 result = allocate_value (SYMBOL_TYPE (sym));
3348 result = value_of_variable (sym, get_selected_block (0));
3350 if (result && want_address)
3351 result = value_addr (result);
3356 /* Given a pointer value V, find the real (RTTI) type of the object it
3359 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
3360 and refer to the values computed for the object pointed to. */
3363 value_rtti_target_type (struct value *v, int *full,
3364 int *top, int *using_enc)
3366 struct value *target;
3368 target = value_ind (v);
3370 return value_rtti_type (target, full, top, using_enc);
3373 /* Given a value pointed to by ARGP, check its real run-time type, and
3374 if that is different from the enclosing type, create a new value
3375 using the real run-time type as the enclosing type (and of the same
3376 type as ARGP) and return it, with the embedded offset adjusted to
3377 be the correct offset to the enclosed object. RTYPE is the type,
3378 and XFULL, XTOP, and XUSING_ENC are the other parameters, computed
3379 by value_rtti_type(). If these are available, they can be supplied
3380 and a second call to value_rtti_type() is avoided. (Pass RTYPE ==
3381 NULL if they're not available. */
3384 value_full_object (struct value *argp,
3386 int xfull, int xtop,
3389 struct type *real_type;
3393 struct value *new_val;
3400 using_enc = xusing_enc;
3403 real_type = value_rtti_type (argp, &full, &top, &using_enc);
3405 /* If no RTTI data, or if object is already complete, do nothing. */
3406 if (!real_type || real_type == value_enclosing_type (argp))
3409 /* If we have the full object, but for some reason the enclosing
3410 type is wrong, set it. */
3411 /* pai: FIXME -- sounds iffy */
3414 argp = value_copy (argp);
3415 set_value_enclosing_type (argp, real_type);
3419 /* Check if object is in memory */
3420 if (VALUE_LVAL (argp) != lval_memory)
3422 warning (_("Couldn't retrieve complete object of RTTI type %s; object may be in register(s)."),
3423 TYPE_NAME (real_type));
3428 /* All other cases -- retrieve the complete object. */
3429 /* Go back by the computed top_offset from the beginning of the
3430 object, adjusting for the embedded offset of argp if that's what
3431 value_rtti_type used for its computation. */
3432 new_val = value_at_lazy (real_type, value_address (argp) - top +
3433 (using_enc ? 0 : value_embedded_offset (argp)));
3434 deprecated_set_value_type (new_val, value_type (argp));
3435 set_value_embedded_offset (new_val, (using_enc
3436 ? top + value_embedded_offset (argp)
3442 /* Return the value of the local variable, if one exists.
3443 Flag COMPLAIN signals an error if the request is made in an
3444 inappropriate context. */
3447 value_of_local (const char *name, int complain)
3449 struct symbol *func, *sym;
3452 struct frame_info *frame;
3455 frame = get_selected_frame (_("no frame selected"));
3458 frame = deprecated_safe_get_selected_frame ();
3463 func = get_frame_function (frame);
3467 error (_("no `%s' in nameless context"), name);
3472 b = SYMBOL_BLOCK_VALUE (func);
3473 if (dict_empty (BLOCK_DICT (b)))
3476 error (_("no args, no `%s'"), name);
3481 /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER
3482 symbol instead of the LOC_ARG one (if both exist). */
3483 sym = lookup_block_symbol (b, name, VAR_DOMAIN);
3487 error (_("current stack frame does not contain a variable named `%s'"),
3493 ret = read_var_value (sym, frame);
3494 if (ret == 0 && complain)
3495 error (_("`%s' argument unreadable"), name);
3499 /* C++/Objective-C: return the value of the class instance variable,
3500 if one exists. Flag COMPLAIN signals an error if the request is
3501 made in an inappropriate context. */
3504 value_of_this (int complain)
3506 if (!current_language->la_name_of_this)
3508 return value_of_local (current_language->la_name_of_this, complain);
3511 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH
3512 elements long, starting at LOWBOUND. The result has the same lower
3513 bound as the original ARRAY. */
3516 value_slice (struct value *array, int lowbound, int length)
3518 struct type *slice_range_type, *slice_type, *range_type;
3519 LONGEST lowerbound, upperbound;
3520 struct value *slice;
3521 struct type *array_type;
3523 array_type = check_typedef (value_type (array));
3524 if (TYPE_CODE (array_type) != TYPE_CODE_ARRAY
3525 && TYPE_CODE (array_type) != TYPE_CODE_STRING
3526 && TYPE_CODE (array_type) != TYPE_CODE_BITSTRING)
3527 error (_("cannot take slice of non-array"));
3529 range_type = TYPE_INDEX_TYPE (array_type);
3530 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
3531 error (_("slice from bad array or bitstring"));
3533 if (lowbound < lowerbound || length < 0
3534 || lowbound + length - 1 > upperbound)
3535 error (_("slice out of range"));
3537 /* FIXME-type-allocation: need a way to free this type when we are
3539 slice_range_type = create_range_type ((struct type *) NULL,
3540 TYPE_TARGET_TYPE (range_type),
3542 lowbound + length - 1);
3543 if (TYPE_CODE (array_type) == TYPE_CODE_BITSTRING)
3547 slice_type = create_set_type ((struct type *) NULL,
3549 TYPE_CODE (slice_type) = TYPE_CODE_BITSTRING;
3550 slice = value_zero (slice_type, not_lval);
3552 for (i = 0; i < length; i++)
3554 int element = value_bit_index (array_type,
3555 value_contents (array),
3559 error (_("internal error accessing bitstring"));
3560 else if (element > 0)
3562 int j = i % TARGET_CHAR_BIT;
3564 if (gdbarch_bits_big_endian (get_type_arch (array_type)))
3565 j = TARGET_CHAR_BIT - 1 - j;
3566 value_contents_raw (slice)[i / TARGET_CHAR_BIT] |= (1 << j);
3569 /* We should set the address, bitssize, and bitspos, so the
3570 slice can be used on the LHS, but that may require extensions
3571 to value_assign. For now, just leave as a non_lval.
3576 struct type *element_type = TYPE_TARGET_TYPE (array_type);
3578 (lowbound - lowerbound) * TYPE_LENGTH (check_typedef (element_type));
3580 slice_type = create_array_type ((struct type *) NULL,
3583 TYPE_CODE (slice_type) = TYPE_CODE (array_type);
3585 if (VALUE_LVAL (array) == lval_memory && value_lazy (array))
3586 slice = allocate_value_lazy (slice_type);
3589 slice = allocate_value (slice_type);
3590 memcpy (value_contents_writeable (slice),
3591 value_contents (array) + offset,
3592 TYPE_LENGTH (slice_type));
3595 set_value_component_location (slice, array);
3596 VALUE_FRAME_ID (slice) = VALUE_FRAME_ID (array);
3597 set_value_offset (slice, value_offset (array) + offset);
3602 /* Create a value for a FORTRAN complex number. Currently most of the
3603 time values are coerced to COMPLEX*16 (i.e. a complex number
3604 composed of 2 doubles. This really should be a smarter routine
3605 that figures out precision inteligently as opposed to assuming
3606 doubles. FIXME: fmb */
3609 value_literal_complex (struct value *arg1,
3614 struct type *real_type = TYPE_TARGET_TYPE (type);
3616 val = allocate_value (type);
3617 arg1 = value_cast (real_type, arg1);
3618 arg2 = value_cast (real_type, arg2);
3620 memcpy (value_contents_raw (val),
3621 value_contents (arg1), TYPE_LENGTH (real_type));
3622 memcpy (value_contents_raw (val) + TYPE_LENGTH (real_type),
3623 value_contents (arg2), TYPE_LENGTH (real_type));
3627 /* Cast a value into the appropriate complex data type. */
3629 static struct value *
3630 cast_into_complex (struct type *type, struct value *val)
3632 struct type *real_type = TYPE_TARGET_TYPE (type);
3634 if (TYPE_CODE (value_type (val)) == TYPE_CODE_COMPLEX)
3636 struct type *val_real_type = TYPE_TARGET_TYPE (value_type (val));
3637 struct value *re_val = allocate_value (val_real_type);
3638 struct value *im_val = allocate_value (val_real_type);
3640 memcpy (value_contents_raw (re_val),
3641 value_contents (val), TYPE_LENGTH (val_real_type));
3642 memcpy (value_contents_raw (im_val),
3643 value_contents (val) + TYPE_LENGTH (val_real_type),
3644 TYPE_LENGTH (val_real_type));
3646 return value_literal_complex (re_val, im_val, type);
3648 else if (TYPE_CODE (value_type (val)) == TYPE_CODE_FLT
3649 || TYPE_CODE (value_type (val)) == TYPE_CODE_INT)
3650 return value_literal_complex (val,
3651 value_zero (real_type, not_lval),
3654 error (_("cannot cast non-number to complex"));
3658 _initialize_valops (void)
3660 add_setshow_boolean_cmd ("overload-resolution", class_support,
3661 &overload_resolution, _("\
3662 Set overload resolution in evaluating C++ functions."), _("\
3663 Show overload resolution in evaluating C++ functions."),
3665 show_overload_resolution,
3666 &setlist, &showlist);
3667 overload_resolution = 1;