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 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"
42 #include "gdb_string.h"
43 #include "gdb_assert.h"
44 #include "cp-support.h"
47 extern int overload_debug;
48 /* Local functions. */
50 static int typecmp (int staticp, int varargs, int nargs,
51 struct field t1[], struct value *t2[]);
53 static struct value *search_struct_field (char *, struct value *,
54 int, struct type *, int);
56 static struct value *search_struct_method (char *, struct value **,
58 int, int *, struct type *);
60 static int find_oload_champ_namespace (struct type **, int,
61 const char *, const char *,
63 struct badness_vector **);
66 int find_oload_champ_namespace_loop (struct type **, int,
67 const char *, const char *,
68 int, struct symbol ***,
69 struct badness_vector **, int *);
71 static int find_oload_champ (struct type **, int, int, int,
72 struct fn_field *, struct symbol **,
73 struct badness_vector **);
75 static int oload_method_static (int, struct fn_field *, int);
77 enum oload_classification { STANDARD, NON_STANDARD, INCOMPATIBLE };
80 oload_classification classify_oload_match (struct badness_vector *,
83 static struct value *value_struct_elt_for_reference (struct type *,
89 static struct value *value_namespace_elt (const struct type *,
90 char *, int , enum noside);
92 static struct value *value_maybe_namespace_elt (const struct type *,
96 static CORE_ADDR allocate_space_in_inferior (int);
98 static struct value *cast_into_complex (struct type *, struct value *);
100 static struct fn_field *find_method_list (struct value **, char *,
101 int, struct type *, int *,
102 struct type **, int *);
104 void _initialize_valops (void);
107 /* Flag for whether we want to abandon failed expression evals by
110 static int auto_abandon = 0;
113 int overload_resolution = 0;
115 show_overload_resolution (struct ui_file *file, int from_tty,
116 struct cmd_list_element *c,
119 fprintf_filtered (file, _("\
120 Overload resolution in evaluating C++ functions is %s.\n"),
124 /* Find the address of function name NAME in the inferior. */
127 find_function_in_inferior (const char *name)
130 sym = lookup_symbol (name, 0, VAR_DOMAIN, 0, NULL);
133 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
135 error (_("\"%s\" exists in this program but is not a function."),
138 return value_of_variable (sym, NULL);
142 struct minimal_symbol *msymbol =
143 lookup_minimal_symbol (name, NULL, NULL);
148 type = lookup_pointer_type (builtin_type_char);
149 type = lookup_function_type (type);
150 type = lookup_pointer_type (type);
151 maddr = SYMBOL_VALUE_ADDRESS (msymbol);
152 return value_from_pointer (type, maddr);
156 if (!target_has_execution)
157 error (_("evaluation of this expression requires the target program to be active"));
159 error (_("evaluation of this expression requires the program to have a function \"%s\"."), name);
164 /* Allocate NBYTES of space in the inferior using the inferior's
165 malloc and return a value that is a pointer to the allocated
169 value_allocate_space_in_inferior (int len)
171 struct value *blocklen;
173 find_function_in_inferior (gdbarch_name_of_malloc (current_gdbarch));
175 blocklen = value_from_longest (builtin_type_int, (LONGEST) len);
176 val = call_function_by_hand (val, 1, &blocklen);
177 if (value_logical_not (val))
179 if (!target_has_execution)
180 error (_("No memory available to program now: you need to start the target first"));
182 error (_("No memory available to program: call to malloc failed"));
188 allocate_space_in_inferior (int len)
190 return value_as_long (value_allocate_space_in_inferior (len));
193 /* Cast struct value VAL to type TYPE and return as a value.
194 Both type and val must be of TYPE_CODE_STRUCT or TYPE_CODE_UNION
195 for this to work. Typedef to one of the codes is permitted. */
197 static struct value *
198 value_cast_structs (struct type *type, struct value *v2)
204 gdb_assert (type != NULL && v2 != NULL);
206 t1 = check_typedef (type);
207 t2 = check_typedef (value_type (v2));
209 /* Check preconditions. */
210 gdb_assert ((TYPE_CODE (t1) == TYPE_CODE_STRUCT
211 || TYPE_CODE (t1) == TYPE_CODE_UNION)
212 && !!"Precondition is that type is of STRUCT or UNION kind.");
213 gdb_assert ((TYPE_CODE (t2) == TYPE_CODE_STRUCT
214 || TYPE_CODE (t2) == TYPE_CODE_UNION)
215 && !!"Precondition is that value is of STRUCT or UNION kind");
217 /* Upcasting: look in the type of the source to see if it contains the
218 type of the target as a superclass. If so, we'll need to
219 offset the pointer rather than just change its type. */
220 if (TYPE_NAME (t1) != NULL)
222 v = search_struct_field (type_name_no_tag (t1),
228 /* Downcasting: look in the type of the target to see if it contains the
229 type of the source as a superclass. If so, we'll need to
230 offset the pointer rather than just change its type.
231 FIXME: This fails silently with virtual inheritance. */
232 if (TYPE_NAME (t2) != NULL)
234 v = search_struct_field (type_name_no_tag (t2),
235 value_zero (t1, not_lval), 0, t1, 1);
238 /* Downcasting is possible (t1 is superclass of v2). */
239 CORE_ADDR addr2 = VALUE_ADDRESS (v2);
240 addr2 -= (VALUE_ADDRESS (v)
242 + value_embedded_offset (v));
243 return value_at (type, addr2);
249 /* Cast one pointer or reference type to another. Both TYPE and
250 the type of ARG2 should be pointer types, or else both should be
251 reference types. Returns the new pointer or reference. */
254 value_cast_pointers (struct type *type, struct value *arg2)
256 struct type *type1 = check_typedef (type);
257 struct type *type2 = check_typedef (value_type (arg2));
258 struct type *t1 = check_typedef (TYPE_TARGET_TYPE (type));
259 struct type *t2 = check_typedef (TYPE_TARGET_TYPE (type2));
261 if (TYPE_CODE (t1) == TYPE_CODE_STRUCT
262 && TYPE_CODE (t2) == TYPE_CODE_STRUCT
263 && !value_logical_not (arg2))
267 if (TYPE_CODE (type2) == TYPE_CODE_REF)
268 v2 = coerce_ref (arg2);
270 v2 = value_ind (arg2);
271 gdb_assert (TYPE_CODE (value_type (v2)) == TYPE_CODE_STRUCT
272 && !!"Why did coercion fail?");
273 v2 = value_cast_structs (t1, v2);
274 /* At this point we have what we can have, un-dereference if needed. */
277 struct value *v = value_addr (v2);
278 deprecated_set_value_type (v, type);
283 /* No superclass found, just change the pointer type. */
284 arg2 = value_copy (arg2);
285 deprecated_set_value_type (arg2, type);
286 arg2 = value_change_enclosing_type (arg2, type);
287 set_value_pointed_to_offset (arg2, 0); /* pai: chk_val */
291 /* Cast value ARG2 to type TYPE and return as a value.
292 More general than a C cast: accepts any two types of the same length,
293 and if ARG2 is an lvalue it can be cast into anything at all. */
294 /* In C++, casts may change pointer or object representations. */
297 value_cast (struct type *type, struct value *arg2)
299 enum type_code code1;
300 enum type_code code2;
304 int convert_to_boolean = 0;
306 if (value_type (arg2) == type)
309 code1 = TYPE_CODE (check_typedef (type));
311 /* Check if we are casting struct reference to struct reference. */
312 if (code1 == TYPE_CODE_REF)
314 /* We dereference type; then we recurse and finally
315 we generate value of the given reference. Nothing wrong with
317 struct type *t1 = check_typedef (type);
318 struct type *dereftype = check_typedef (TYPE_TARGET_TYPE (t1));
319 struct value *val = value_cast (dereftype, arg2);
320 return value_ref (val);
323 code2 = TYPE_CODE (check_typedef (value_type (arg2)));
325 if (code2 == TYPE_CODE_REF)
326 /* We deref the value and then do the cast. */
327 return value_cast (type, coerce_ref (arg2));
329 CHECK_TYPEDEF (type);
330 code1 = TYPE_CODE (type);
331 arg2 = coerce_ref (arg2);
332 type2 = check_typedef (value_type (arg2));
334 /* You can't cast to a reference type. See value_cast_pointers
336 gdb_assert (code1 != TYPE_CODE_REF);
338 /* A cast to an undetermined-length array_type, such as
339 (TYPE [])OBJECT, is treated like a cast to (TYPE [N])OBJECT,
340 where N is sizeof(OBJECT)/sizeof(TYPE). */
341 if (code1 == TYPE_CODE_ARRAY)
343 struct type *element_type = TYPE_TARGET_TYPE (type);
344 unsigned element_length = TYPE_LENGTH (check_typedef (element_type));
345 if (element_length > 0
346 && TYPE_ARRAY_UPPER_BOUND_TYPE (type) == BOUND_CANNOT_BE_DETERMINED)
348 struct type *range_type = TYPE_INDEX_TYPE (type);
349 int val_length = TYPE_LENGTH (type2);
350 LONGEST low_bound, high_bound, new_length;
351 if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0)
352 low_bound = 0, high_bound = 0;
353 new_length = val_length / element_length;
354 if (val_length % element_length != 0)
355 warning (_("array element type size does not divide object size in cast"));
356 /* FIXME-type-allocation: need a way to free this type when
357 we are done with it. */
358 range_type = create_range_type ((struct type *) NULL,
359 TYPE_TARGET_TYPE (range_type),
361 new_length + low_bound - 1);
362 deprecated_set_value_type (arg2,
363 create_array_type ((struct type *) NULL,
370 if (current_language->c_style_arrays
371 && TYPE_CODE (type2) == TYPE_CODE_ARRAY)
372 arg2 = value_coerce_array (arg2);
374 if (TYPE_CODE (type2) == TYPE_CODE_FUNC)
375 arg2 = value_coerce_function (arg2);
377 type2 = check_typedef (value_type (arg2));
378 code2 = TYPE_CODE (type2);
380 if (code1 == TYPE_CODE_COMPLEX)
381 return cast_into_complex (type, arg2);
382 if (code1 == TYPE_CODE_BOOL)
384 code1 = TYPE_CODE_INT;
385 convert_to_boolean = 1;
387 if (code1 == TYPE_CODE_CHAR)
388 code1 = TYPE_CODE_INT;
389 if (code2 == TYPE_CODE_BOOL || code2 == TYPE_CODE_CHAR)
390 code2 = TYPE_CODE_INT;
392 scalar = (code2 == TYPE_CODE_INT || code2 == TYPE_CODE_FLT
393 || code2 == TYPE_CODE_DECFLOAT || code2 == TYPE_CODE_ENUM
394 || code2 == TYPE_CODE_RANGE);
396 if ((code1 == TYPE_CODE_STRUCT || code1 == TYPE_CODE_UNION)
397 && (code2 == TYPE_CODE_STRUCT || code2 == TYPE_CODE_UNION)
398 && TYPE_NAME (type) != 0)
399 return value_cast_structs (type, arg2);
400 if (code1 == TYPE_CODE_FLT && scalar)
401 return value_from_double (type, value_as_double (arg2));
402 else if (code1 == TYPE_CODE_DECFLOAT && scalar)
404 int dec_len = TYPE_LENGTH (type);
407 if (code2 == TYPE_CODE_FLT)
408 decimal_from_floating (arg2, dec, dec_len);
409 else if (code2 == TYPE_CODE_DECFLOAT)
410 decimal_convert (value_contents (arg2), TYPE_LENGTH (type2),
413 /* The only option left is an integral type. */
414 decimal_from_integral (arg2, dec, dec_len);
416 return value_from_decfloat (type, dec);
418 else if ((code1 == TYPE_CODE_INT || code1 == TYPE_CODE_ENUM
419 || code1 == TYPE_CODE_RANGE)
420 && (scalar || code2 == TYPE_CODE_PTR
421 || code2 == TYPE_CODE_MEMBERPTR))
425 /* When we cast pointers to integers, we mustn't use
426 gdbarch_pointer_to_address to find the address the pointer
427 represents, as value_as_long would. GDB should evaluate
428 expressions just as the compiler would --- and the compiler
429 sees a cast as a simple reinterpretation of the pointer's
431 if (code2 == TYPE_CODE_PTR)
432 longest = extract_unsigned_integer (value_contents (arg2),
433 TYPE_LENGTH (type2));
435 longest = value_as_long (arg2);
436 return value_from_longest (type, convert_to_boolean ?
437 (LONGEST) (longest ? 1 : 0) : longest);
439 else if (code1 == TYPE_CODE_PTR && (code2 == TYPE_CODE_INT
440 || code2 == TYPE_CODE_ENUM
441 || code2 == TYPE_CODE_RANGE))
443 /* TYPE_LENGTH (type) is the length of a pointer, but we really
444 want the length of an address! -- we are really dealing with
445 addresses (i.e., gdb representations) not pointers (i.e.,
446 target representations) here.
448 This allows things like "print *(int *)0x01000234" to work
449 without printing a misleading message -- which would
450 otherwise occur when dealing with a target having two byte
451 pointers and four byte addresses. */
453 int addr_bit = gdbarch_addr_bit (current_gdbarch);
455 LONGEST longest = value_as_long (arg2);
456 if (addr_bit < sizeof (LONGEST) * HOST_CHAR_BIT)
458 if (longest >= ((LONGEST) 1 << addr_bit)
459 || longest <= -((LONGEST) 1 << addr_bit))
460 warning (_("value truncated"));
462 return value_from_longest (type, longest);
464 else if (code1 == TYPE_CODE_METHODPTR && code2 == TYPE_CODE_INT
465 && value_as_long (arg2) == 0)
467 struct value *result = allocate_value (type);
468 cplus_make_method_ptr (value_contents_writeable (result), 0, 0);
471 else if (code1 == TYPE_CODE_MEMBERPTR && code2 == TYPE_CODE_INT
472 && value_as_long (arg2) == 0)
474 /* The Itanium C++ ABI represents NULL pointers to members as
475 minus one, instead of biasing the normal case. */
476 return value_from_longest (type, -1);
478 else if (TYPE_LENGTH (type) == TYPE_LENGTH (type2))
480 if (code1 == TYPE_CODE_PTR && code2 == TYPE_CODE_PTR)
481 return value_cast_pointers (type, arg2);
483 arg2 = value_copy (arg2);
484 deprecated_set_value_type (arg2, type);
485 arg2 = value_change_enclosing_type (arg2, type);
486 set_value_pointed_to_offset (arg2, 0); /* pai: chk_val */
489 else if (VALUE_LVAL (arg2) == lval_memory)
490 return value_at_lazy (type,
491 VALUE_ADDRESS (arg2) + value_offset (arg2));
492 else if (code1 == TYPE_CODE_VOID)
494 return value_zero (builtin_type_void, not_lval);
498 error (_("Invalid cast."));
503 /* Create a value of type TYPE that is zero, and return it. */
506 value_zero (struct type *type, enum lval_type lv)
508 struct value *val = allocate_value (type);
509 VALUE_LVAL (val) = lv;
514 /* Create a value of numeric type TYPE that is one, and return it. */
517 value_one (struct type *type, enum lval_type lv)
519 struct type *type1 = check_typedef (type);
520 struct value *val = NULL; /* avoid -Wall warning */
522 if (TYPE_CODE (type1) == TYPE_CODE_DECFLOAT)
524 struct value *int_one = value_from_longest (builtin_type_int, 1);
528 decimal_from_integral (int_one, v, TYPE_LENGTH (builtin_type_int));
529 val = value_from_decfloat (type, v);
531 else if (TYPE_CODE (type1) == TYPE_CODE_FLT)
533 val = value_from_double (type, (DOUBLEST) 1);
535 else if (is_integral_type (type1))
537 val = value_from_longest (type, (LONGEST) 1);
541 error (_("Not a numeric type."));
544 VALUE_LVAL (val) = lv;
548 /* Return a value with type TYPE located at ADDR.
550 Call value_at only if the data needs to be fetched immediately;
551 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
552 value_at_lazy instead. value_at_lazy simply records the address of
553 the data and sets the lazy-evaluation-required flag. The lazy flag
554 is tested in the value_contents macro, which is used if and when
555 the contents are actually required.
557 Note: value_at does *NOT* handle embedded offsets; perform such
558 adjustments before or after calling it. */
561 value_at (struct type *type, CORE_ADDR addr)
565 if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
566 error (_("Attempt to dereference a generic pointer."));
568 val = allocate_value (type);
570 read_memory (addr, value_contents_all_raw (val), TYPE_LENGTH (type));
572 VALUE_LVAL (val) = lval_memory;
573 VALUE_ADDRESS (val) = addr;
578 /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
581 value_at_lazy (struct type *type, CORE_ADDR addr)
585 if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
586 error (_("Attempt to dereference a generic pointer."));
588 val = allocate_value (type);
590 VALUE_LVAL (val) = lval_memory;
591 VALUE_ADDRESS (val) = addr;
592 set_value_lazy (val, 1);
597 /* Called only from the value_contents and value_contents_all()
598 macros, if the current data for a variable needs to be loaded into
599 value_contents(VAL). Fetches the data from the user's process, and
600 clears the lazy flag to indicate that the data in the buffer is
603 If the value is zero-length, we avoid calling read_memory, which
604 would abort. We mark the value as fetched anyway -- all 0 bytes of
607 This function returns a value because it is used in the
608 value_contents macro as part of an expression, where a void would
609 not work. The value is ignored. */
612 value_fetch_lazy (struct value *val)
614 CORE_ADDR addr = VALUE_ADDRESS (val) + value_offset (val);
615 int length = TYPE_LENGTH (value_enclosing_type (val));
617 struct type *type = value_type (val);
619 read_memory (addr, value_contents_all_raw (val), length);
621 set_value_lazy (val, 0);
626 /* Store the contents of FROMVAL into the location of TOVAL.
627 Return a new value with the location of TOVAL and contents of FROMVAL. */
630 value_assign (struct value *toval, struct value *fromval)
634 struct frame_id old_frame;
636 if (!deprecated_value_modifiable (toval))
637 error (_("Left operand of assignment is not a modifiable lvalue."));
639 toval = coerce_ref (toval);
641 type = value_type (toval);
642 if (VALUE_LVAL (toval) != lval_internalvar)
644 toval = value_coerce_to_target (toval);
645 fromval = value_cast (type, fromval);
649 /* Coerce arrays and functions to pointers, except for arrays
650 which only live in GDB's storage. */
651 if (!value_must_coerce_to_target (fromval))
652 fromval = coerce_array (fromval);
655 CHECK_TYPEDEF (type);
657 /* Since modifying a register can trash the frame chain, and
658 modifying memory can trash the frame cache, we save the old frame
659 and then restore the new frame afterwards. */
660 old_frame = get_frame_id (deprecated_safe_get_selected_frame ());
662 switch (VALUE_LVAL (toval))
664 case lval_internalvar:
665 set_internalvar (VALUE_INTERNALVAR (toval), fromval);
666 val = value_copy (VALUE_INTERNALVAR (toval)->value);
667 val = value_change_enclosing_type (val,
668 value_enclosing_type (fromval));
669 set_value_embedded_offset (val, value_embedded_offset (fromval));
670 set_value_pointed_to_offset (val,
671 value_pointed_to_offset (fromval));
674 case lval_internalvar_component:
675 set_internalvar_component (VALUE_INTERNALVAR (toval),
676 value_offset (toval),
677 value_bitpos (toval),
678 value_bitsize (toval),
684 const gdb_byte *dest_buffer;
685 CORE_ADDR changed_addr;
687 gdb_byte buffer[sizeof (LONGEST)];
689 if (value_bitsize (toval))
691 /* We assume that the argument to read_memory is in units
692 of host chars. FIXME: Is that correct? */
693 changed_len = (value_bitpos (toval)
694 + value_bitsize (toval)
698 if (changed_len > (int) sizeof (LONGEST))
699 error (_("Can't handle bitfields which don't fit in a %d bit word."),
700 (int) sizeof (LONGEST) * HOST_CHAR_BIT);
702 read_memory (VALUE_ADDRESS (toval) + value_offset (toval),
703 buffer, changed_len);
704 modify_field (buffer, value_as_long (fromval),
705 value_bitpos (toval), value_bitsize (toval));
706 changed_addr = VALUE_ADDRESS (toval) + value_offset (toval);
707 dest_buffer = buffer;
711 changed_addr = VALUE_ADDRESS (toval) + value_offset (toval);
712 changed_len = TYPE_LENGTH (type);
713 dest_buffer = value_contents (fromval);
716 write_memory (changed_addr, dest_buffer, changed_len);
717 if (deprecated_memory_changed_hook)
718 deprecated_memory_changed_hook (changed_addr, changed_len);
724 struct frame_info *frame;
727 /* Figure out which frame this is in currently. */
728 frame = frame_find_by_id (VALUE_FRAME_ID (toval));
729 value_reg = VALUE_REGNUM (toval);
732 error (_("Value being assigned to is no longer active."));
734 if (gdbarch_convert_register_p
735 (current_gdbarch, VALUE_REGNUM (toval), type))
737 /* If TOVAL is a special machine register requiring
738 conversion of program values to a special raw
740 gdbarch_value_to_register (current_gdbarch, frame,
741 VALUE_REGNUM (toval), type,
742 value_contents (fromval));
746 if (value_bitsize (toval))
749 gdb_byte buffer[sizeof (LONGEST)];
751 changed_len = (value_bitpos (toval)
752 + value_bitsize (toval)
756 if (changed_len > (int) sizeof (LONGEST))
757 error (_("Can't handle bitfields which don't fit in a %d bit word."),
758 (int) sizeof (LONGEST) * HOST_CHAR_BIT);
760 get_frame_register_bytes (frame, value_reg,
761 value_offset (toval),
762 changed_len, buffer);
764 modify_field (buffer, value_as_long (fromval),
765 value_bitpos (toval),
766 value_bitsize (toval));
768 put_frame_register_bytes (frame, value_reg,
769 value_offset (toval),
770 changed_len, buffer);
774 put_frame_register_bytes (frame, value_reg,
775 value_offset (toval),
777 value_contents (fromval));
781 if (deprecated_register_changed_hook)
782 deprecated_register_changed_hook (-1);
783 observer_notify_target_changed (¤t_target);
788 error (_("Left operand of assignment is not an lvalue."));
791 /* Assigning to the stack pointer, frame pointer, and other
792 (architecture and calling convention specific) registers may
793 cause the frame cache to be out of date. Assigning to memory
794 also can. We just do this on all assignments to registers or
795 memory, for simplicity's sake; I doubt the slowdown matters. */
796 switch (VALUE_LVAL (toval))
801 reinit_frame_cache ();
803 /* Having destroyed the frame cache, restore the selected
806 /* FIXME: cagney/2002-11-02: There has to be a better way of
807 doing this. Instead of constantly saving/restoring the
808 frame. Why not create a get_selected_frame() function that,
809 having saved the selected frame's ID can automatically
810 re-find the previously selected frame automatically. */
813 struct frame_info *fi = frame_find_by_id (old_frame);
823 /* If the field does not entirely fill a LONGEST, then zero the sign
824 bits. If the field is signed, and is negative, then sign
826 if ((value_bitsize (toval) > 0)
827 && (value_bitsize (toval) < 8 * (int) sizeof (LONGEST)))
829 LONGEST fieldval = value_as_long (fromval);
830 LONGEST valmask = (((ULONGEST) 1) << value_bitsize (toval)) - 1;
833 if (!TYPE_UNSIGNED (type)
834 && (fieldval & (valmask ^ (valmask >> 1))))
835 fieldval |= ~valmask;
837 fromval = value_from_longest (type, fieldval);
840 val = value_copy (toval);
841 memcpy (value_contents_raw (val), value_contents (fromval),
843 deprecated_set_value_type (val, type);
844 val = value_change_enclosing_type (val,
845 value_enclosing_type (fromval));
846 set_value_embedded_offset (val, value_embedded_offset (fromval));
847 set_value_pointed_to_offset (val, value_pointed_to_offset (fromval));
852 /* Extend a value VAL to COUNT repetitions of its type. */
855 value_repeat (struct value *arg1, int count)
859 if (VALUE_LVAL (arg1) != lval_memory)
860 error (_("Only values in memory can be extended with '@'."));
862 error (_("Invalid number %d of repetitions."), count);
864 val = allocate_repeat_value (value_enclosing_type (arg1), count);
866 read_memory (VALUE_ADDRESS (arg1) + value_offset (arg1),
867 value_contents_all_raw (val),
868 TYPE_LENGTH (value_enclosing_type (val)));
869 VALUE_LVAL (val) = lval_memory;
870 VALUE_ADDRESS (val) = VALUE_ADDRESS (arg1) + value_offset (arg1);
876 value_of_variable (struct symbol *var, struct block *b)
879 struct frame_info *frame = NULL;
882 frame = NULL; /* Use selected frame. */
883 else if (symbol_read_needs_frame (var))
885 frame = block_innermost_frame (b);
888 if (BLOCK_FUNCTION (b)
889 && SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b)))
890 error (_("No frame is currently executing in block %s."),
891 SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b)));
893 error (_("No frame is currently executing in specified block"));
897 val = read_var_value (var, frame);
899 error (_("Address of symbol \"%s\" is unknown."), SYMBOL_PRINT_NAME (var));
904 /* Return one if VAL does not live in target memory, but should in order
905 to operate on it. Otherwise return zero. */
908 value_must_coerce_to_target (struct value *val)
910 struct type *valtype;
912 /* The only lval kinds which do not live in target memory. */
913 if (VALUE_LVAL (val) != not_lval
914 && VALUE_LVAL (val) != lval_internalvar)
917 valtype = check_typedef (value_type (val));
919 switch (TYPE_CODE (valtype))
921 case TYPE_CODE_ARRAY:
922 case TYPE_CODE_STRING:
929 /* Make sure that VAL lives in target memory if it's supposed to. For instance,
930 strings are constructed as character arrays in GDB's storage, and this
931 function copies them to the target. */
934 value_coerce_to_target (struct value *val)
939 if (!value_must_coerce_to_target (val))
942 length = TYPE_LENGTH (check_typedef (value_type (val)));
943 addr = allocate_space_in_inferior (length);
944 write_memory (addr, value_contents (val), length);
945 return value_at_lazy (value_type (val), addr);
948 /* Given a value which is an array, return a value which is a pointer
949 to its first element, regardless of whether or not the array has a
952 FIXME: A previous comment here indicated that this routine should
953 be substracting the array's lower bound. It's not clear to me that
954 this is correct. Given an array subscripting operation, it would
955 certainly work to do the adjustment here, essentially computing:
957 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
959 However I believe a more appropriate and logical place to account
960 for the lower bound is to do so in value_subscript, essentially
963 (&array[0] + ((index - lowerbound) * sizeof array[0]))
965 As further evidence consider what would happen with operations
966 other than array subscripting, where the caller would get back a
967 value that had an address somewhere before the actual first element
968 of the array, and the information about the lower bound would be
969 lost because of the coercion to pointer type.
973 value_coerce_array (struct value *arg1)
975 struct type *type = check_typedef (value_type (arg1));
977 /* If the user tries to do something requiring a pointer with an
978 array that has not yet been pushed to the target, then this would
979 be a good time to do so. */
980 arg1 = value_coerce_to_target (arg1);
982 if (VALUE_LVAL (arg1) != lval_memory)
983 error (_("Attempt to take address of value not located in memory."));
985 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
986 (VALUE_ADDRESS (arg1) + value_offset (arg1)));
989 /* Given a value which is a function, return a value which is a pointer
993 value_coerce_function (struct value *arg1)
995 struct value *retval;
997 if (VALUE_LVAL (arg1) != lval_memory)
998 error (_("Attempt to take address of value not located in memory."));
1000 retval = value_from_pointer (lookup_pointer_type (value_type (arg1)),
1001 (VALUE_ADDRESS (arg1) + value_offset (arg1)));
1005 /* Return a pointer value for the object for which ARG1 is the
1009 value_addr (struct value *arg1)
1013 struct type *type = check_typedef (value_type (arg1));
1014 if (TYPE_CODE (type) == TYPE_CODE_REF)
1016 /* Copy the value, but change the type from (T&) to (T*). We
1017 keep the same location information, which is efficient, and
1018 allows &(&X) to get the location containing the reference. */
1019 arg2 = value_copy (arg1);
1020 deprecated_set_value_type (arg2,
1021 lookup_pointer_type (TYPE_TARGET_TYPE (type)));
1024 if (TYPE_CODE (type) == TYPE_CODE_FUNC)
1025 return value_coerce_function (arg1);
1027 /* If this is an array that has not yet been pushed to the target,
1028 then this would be a good time to force it to memory. */
1029 arg1 = value_coerce_to_target (arg1);
1031 if (VALUE_LVAL (arg1) != lval_memory)
1032 error (_("Attempt to take address of value not located in memory."));
1034 /* Get target memory address */
1035 arg2 = value_from_pointer (lookup_pointer_type (value_type (arg1)),
1036 (VALUE_ADDRESS (arg1)
1037 + value_offset (arg1)
1038 + value_embedded_offset (arg1)));
1040 /* This may be a pointer to a base subobject; so remember the
1041 full derived object's type ... */
1042 arg2 = value_change_enclosing_type (arg2, lookup_pointer_type (value_enclosing_type (arg1)));
1043 /* ... and also the relative position of the subobject in the full
1045 set_value_pointed_to_offset (arg2, value_embedded_offset (arg1));
1049 /* Return a reference value for the object for which ARG1 is the
1053 value_ref (struct value *arg1)
1057 struct type *type = check_typedef (value_type (arg1));
1058 if (TYPE_CODE (type) == TYPE_CODE_REF)
1061 arg2 = value_addr (arg1);
1062 deprecated_set_value_type (arg2, lookup_reference_type (type));
1066 /* Given a value of a pointer type, apply the C unary * operator to
1070 value_ind (struct value *arg1)
1072 struct type *base_type;
1075 arg1 = coerce_array (arg1);
1077 base_type = check_typedef (value_type (arg1));
1079 /* Allow * on an integer so we can cast it to whatever we want.
1080 This returns an int, which seems like the most C-like thing to
1081 do. "long long" variables are rare enough that
1082 BUILTIN_TYPE_LONGEST would seem to be a mistake. */
1083 if (TYPE_CODE (base_type) == TYPE_CODE_INT)
1084 return value_at_lazy (builtin_type_int,
1085 (CORE_ADDR) value_as_address (arg1));
1086 else if (TYPE_CODE (base_type) == TYPE_CODE_PTR)
1088 struct type *enc_type;
1089 /* We may be pointing to something embedded in a larger object.
1090 Get the real type of the enclosing object. */
1091 enc_type = check_typedef (value_enclosing_type (arg1));
1092 enc_type = TYPE_TARGET_TYPE (enc_type);
1094 if (TYPE_CODE (check_typedef (enc_type)) == TYPE_CODE_FUNC
1095 || TYPE_CODE (check_typedef (enc_type)) == TYPE_CODE_METHOD)
1096 /* For functions, go through find_function_addr, which knows
1097 how to handle function descriptors. */
1098 arg2 = value_at_lazy (enc_type,
1099 find_function_addr (arg1, NULL));
1101 /* Retrieve the enclosing object pointed to */
1102 arg2 = value_at_lazy (enc_type,
1103 (value_as_address (arg1)
1104 - value_pointed_to_offset (arg1)));
1106 /* Re-adjust type. */
1107 deprecated_set_value_type (arg2, TYPE_TARGET_TYPE (base_type));
1108 /* Add embedding info. */
1109 arg2 = value_change_enclosing_type (arg2, enc_type);
1110 set_value_embedded_offset (arg2, value_pointed_to_offset (arg1));
1112 /* We may be pointing to an object of some derived type. */
1113 arg2 = value_full_object (arg2, NULL, 0, 0, 0);
1117 error (_("Attempt to take contents of a non-pointer value."));
1118 return 0; /* For lint -- never reached. */
1121 /* Create a value for an array by allocating space in GDB, copying
1122 copying the data into that space, and then setting up an array
1125 The array bounds are set from LOWBOUND and HIGHBOUND, and the array
1126 is populated from the values passed in ELEMVEC.
1128 The element type of the array is inherited from the type of the
1129 first element, and all elements must have the same size (though we
1130 don't currently enforce any restriction on their types). */
1133 value_array (int lowbound, int highbound, struct value **elemvec)
1137 unsigned int typelength;
1139 struct type *rangetype;
1140 struct type *arraytype;
1143 /* Validate that the bounds are reasonable and that each of the
1144 elements have the same size. */
1146 nelem = highbound - lowbound + 1;
1149 error (_("bad array bounds (%d, %d)"), lowbound, highbound);
1151 typelength = TYPE_LENGTH (value_enclosing_type (elemvec[0]));
1152 for (idx = 1; idx < nelem; idx++)
1154 if (TYPE_LENGTH (value_enclosing_type (elemvec[idx])) != typelength)
1156 error (_("array elements must all be the same size"));
1160 rangetype = create_range_type ((struct type *) NULL,
1162 lowbound, highbound);
1163 arraytype = create_array_type ((struct type *) NULL,
1164 value_enclosing_type (elemvec[0]),
1167 if (!current_language->c_style_arrays)
1169 val = allocate_value (arraytype);
1170 for (idx = 0; idx < nelem; idx++)
1172 memcpy (value_contents_all_raw (val) + (idx * typelength),
1173 value_contents_all (elemvec[idx]),
1179 /* Allocate space to store the array, and then initialize it by
1180 copying in each element. */
1182 val = allocate_value (arraytype);
1183 for (idx = 0; idx < nelem; idx++)
1184 memcpy (value_contents_writeable (val) + (idx * typelength),
1185 value_contents_all (elemvec[idx]),
1190 /* Create a value for a string constant by allocating space in the
1191 inferior, copying the data into that space, and returning the
1192 address with type TYPE_CODE_STRING. PTR points to the string
1193 constant data; LEN is number of characters.
1195 Note that string types are like array of char types with a lower
1196 bound of zero and an upper bound of LEN - 1. Also note that the
1197 string may contain embedded null bytes. */
1200 value_string (char *ptr, int len)
1203 int lowbound = current_language->string_lower_bound;
1204 struct type *rangetype = create_range_type ((struct type *) NULL,
1207 len + lowbound - 1);
1208 struct type *stringtype
1209 = create_string_type ((struct type *) NULL, rangetype);
1212 if (current_language->c_style_arrays == 0)
1214 val = allocate_value (stringtype);
1215 memcpy (value_contents_raw (val), ptr, len);
1220 /* Allocate space to store the string in the inferior, and then copy
1221 LEN bytes from PTR in gdb to that address in the inferior. */
1223 addr = allocate_space_in_inferior (len);
1224 write_memory (addr, (gdb_byte *) ptr, len);
1226 val = value_at_lazy (stringtype, addr);
1231 value_bitstring (char *ptr, int len)
1234 struct type *domain_type = create_range_type (NULL,
1237 struct type *type = create_set_type ((struct type *) NULL,
1239 TYPE_CODE (type) = TYPE_CODE_BITSTRING;
1240 val = allocate_value (type);
1241 memcpy (value_contents_raw (val), ptr, TYPE_LENGTH (type));
1245 /* See if we can pass arguments in T2 to a function which takes
1246 arguments of types T1. T1 is a list of NARGS arguments, and T2 is
1247 a NULL-terminated vector. If some arguments need coercion of some
1248 sort, then the coerced values are written into T2. Return value is
1249 0 if the arguments could be matched, or the position at which they
1252 STATICP is nonzero if the T1 argument list came from a static
1253 member function. T2 will still include the ``this'' pointer, but
1256 For non-static member functions, we ignore the first argument,
1257 which is the type of the instance variable. This is because we
1258 want to handle calls with objects from derived classes. This is
1259 not entirely correct: we should actually check to make sure that a
1260 requested operation is type secure, shouldn't we? FIXME. */
1263 typecmp (int staticp, int varargs, int nargs,
1264 struct field t1[], struct value *t2[])
1269 internal_error (__FILE__, __LINE__,
1270 _("typecmp: no argument list"));
1272 /* Skip ``this'' argument if applicable. T2 will always include
1278 (i < nargs) && TYPE_CODE (t1[i].type) != TYPE_CODE_VOID;
1281 struct type *tt1, *tt2;
1286 tt1 = check_typedef (t1[i].type);
1287 tt2 = check_typedef (value_type (t2[i]));
1289 if (TYPE_CODE (tt1) == TYPE_CODE_REF
1290 /* We should be doing hairy argument matching, as below. */
1291 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1))) == TYPE_CODE (tt2)))
1293 if (TYPE_CODE (tt2) == TYPE_CODE_ARRAY)
1294 t2[i] = value_coerce_array (t2[i]);
1296 t2[i] = value_ref (t2[i]);
1300 /* djb - 20000715 - Until the new type structure is in the
1301 place, and we can attempt things like implicit conversions,
1302 we need to do this so you can take something like a map<const
1303 char *>, and properly access map["hello"], because the
1304 argument to [] will be a reference to a pointer to a char,
1305 and the argument will be a pointer to a char. */
1306 while (TYPE_CODE(tt1) == TYPE_CODE_REF
1307 || TYPE_CODE (tt1) == TYPE_CODE_PTR)
1309 tt1 = check_typedef( TYPE_TARGET_TYPE(tt1) );
1311 while (TYPE_CODE(tt2) == TYPE_CODE_ARRAY
1312 || TYPE_CODE(tt2) == TYPE_CODE_PTR
1313 || TYPE_CODE(tt2) == TYPE_CODE_REF)
1315 tt2 = check_typedef (TYPE_TARGET_TYPE(tt2));
1317 if (TYPE_CODE (tt1) == TYPE_CODE (tt2))
1319 /* Array to pointer is a `trivial conversion' according to the
1322 /* We should be doing much hairier argument matching (see
1323 section 13.2 of the ARM), but as a quick kludge, just check
1324 for the same type code. */
1325 if (TYPE_CODE (t1[i].type) != TYPE_CODE (value_type (t2[i])))
1328 if (varargs || t2[i] == NULL)
1333 /* Helper function used by value_struct_elt to recurse through
1334 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1335 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1336 TYPE. If found, return value, else return NULL.
1338 If LOOKING_FOR_BASECLASS, then instead of looking for struct
1339 fields, look for a baseclass named NAME. */
1341 static struct value *
1342 search_struct_field (char *name, struct value *arg1, int offset,
1343 struct type *type, int looking_for_baseclass)
1346 int nbases = TYPE_N_BASECLASSES (type);
1348 CHECK_TYPEDEF (type);
1350 if (!looking_for_baseclass)
1351 for (i = TYPE_NFIELDS (type) - 1; i >= nbases; i--)
1353 char *t_field_name = TYPE_FIELD_NAME (type, i);
1355 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
1358 if (TYPE_FIELD_STATIC (type, i))
1360 v = value_static_field (type, i);
1362 error (_("field %s is nonexistent or has been optimised out"),
1367 v = value_primitive_field (arg1, offset, i, type);
1369 error (_("there is no field named %s"), name);
1375 && (t_field_name[0] == '\0'
1376 || (TYPE_CODE (type) == TYPE_CODE_UNION
1377 && (strcmp_iw (t_field_name, "else") == 0))))
1379 struct type *field_type = TYPE_FIELD_TYPE (type, i);
1380 if (TYPE_CODE (field_type) == TYPE_CODE_UNION
1381 || TYPE_CODE (field_type) == TYPE_CODE_STRUCT)
1383 /* Look for a match through the fields of an anonymous
1384 union, or anonymous struct. C++ provides anonymous
1387 In the GNU Chill (now deleted from GDB)
1388 implementation of variant record types, each
1389 <alternative field> has an (anonymous) union type,
1390 each member of the union represents a <variant
1391 alternative>. Each <variant alternative> is
1392 represented as a struct, with a member for each
1396 int new_offset = offset;
1398 /* This is pretty gross. In G++, the offset in an
1399 anonymous union is relative to the beginning of the
1400 enclosing struct. In the GNU Chill (now deleted
1401 from GDB) implementation of variant records, the
1402 bitpos is zero in an anonymous union field, so we
1403 have to add the offset of the union here. */
1404 if (TYPE_CODE (field_type) == TYPE_CODE_STRUCT
1405 || (TYPE_NFIELDS (field_type) > 0
1406 && TYPE_FIELD_BITPOS (field_type, 0) == 0))
1407 new_offset += TYPE_FIELD_BITPOS (type, i) / 8;
1409 v = search_struct_field (name, arg1, new_offset,
1411 looking_for_baseclass);
1418 for (i = 0; i < nbases; i++)
1421 struct type *basetype = check_typedef (TYPE_BASECLASS (type, i));
1422 /* If we are looking for baseclasses, this is what we get when
1423 we hit them. But it could happen that the base part's member
1424 name is not yet filled in. */
1425 int found_baseclass = (looking_for_baseclass
1426 && TYPE_BASECLASS_NAME (type, i) != NULL
1427 && (strcmp_iw (name,
1428 TYPE_BASECLASS_NAME (type,
1431 if (BASETYPE_VIA_VIRTUAL (type, i))
1434 struct value *v2 = allocate_value (basetype);
1436 boffset = baseclass_offset (type, i,
1437 value_contents (arg1) + offset,
1438 VALUE_ADDRESS (arg1)
1439 + value_offset (arg1) + offset);
1441 error (_("virtual baseclass botch"));
1443 /* The virtual base class pointer might have been clobbered
1444 by the user program. Make sure that it still points to a
1445 valid memory location. */
1448 if (boffset < 0 || boffset >= TYPE_LENGTH (type))
1450 CORE_ADDR base_addr;
1453 VALUE_ADDRESS (arg1) + value_offset (arg1) + boffset;
1454 if (target_read_memory (base_addr,
1455 value_contents_raw (v2),
1456 TYPE_LENGTH (basetype)) != 0)
1457 error (_("virtual baseclass botch"));
1458 VALUE_LVAL (v2) = lval_memory;
1459 VALUE_ADDRESS (v2) = base_addr;
1463 VALUE_LVAL (v2) = VALUE_LVAL (arg1);
1464 VALUE_ADDRESS (v2) = VALUE_ADDRESS (arg1);
1465 VALUE_FRAME_ID (v2) = VALUE_FRAME_ID (arg1);
1466 set_value_offset (v2, value_offset (arg1) + boffset);
1467 if (value_lazy (arg1))
1468 set_value_lazy (v2, 1);
1470 memcpy (value_contents_raw (v2),
1471 value_contents_raw (arg1) + boffset,
1472 TYPE_LENGTH (basetype));
1475 if (found_baseclass)
1477 v = search_struct_field (name, v2, 0,
1478 TYPE_BASECLASS (type, i),
1479 looking_for_baseclass);
1481 else if (found_baseclass)
1482 v = value_primitive_field (arg1, offset, i, type);
1484 v = search_struct_field (name, arg1,
1485 offset + TYPE_BASECLASS_BITPOS (type,
1487 basetype, looking_for_baseclass);
1494 /* Helper function used by value_struct_elt to recurse through
1495 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1496 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1499 If found, return value, else if name matched and args not return
1500 (value) -1, else return NULL. */
1502 static struct value *
1503 search_struct_method (char *name, struct value **arg1p,
1504 struct value **args, int offset,
1505 int *static_memfuncp, struct type *type)
1509 int name_matched = 0;
1510 char dem_opname[64];
1512 CHECK_TYPEDEF (type);
1513 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
1515 char *t_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
1516 /* FIXME! May need to check for ARM demangling here */
1517 if (strncmp (t_field_name, "__", 2) == 0 ||
1518 strncmp (t_field_name, "op", 2) == 0 ||
1519 strncmp (t_field_name, "type", 4) == 0)
1521 if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI))
1522 t_field_name = dem_opname;
1523 else if (cplus_demangle_opname (t_field_name, dem_opname, 0))
1524 t_field_name = dem_opname;
1526 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
1528 int j = TYPE_FN_FIELDLIST_LENGTH (type, i) - 1;
1529 struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i);
1532 check_stub_method_group (type, i);
1533 if (j > 0 && args == 0)
1534 error (_("cannot resolve overloaded method `%s': no arguments supplied"), name);
1535 else if (j == 0 && args == 0)
1537 v = value_fn_field (arg1p, f, j, type, offset);
1544 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f, j),
1545 TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f, j)),
1546 TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f, j)),
1547 TYPE_FN_FIELD_ARGS (f, j), args))
1549 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
1550 return value_virtual_fn_field (arg1p, f, j,
1552 if (TYPE_FN_FIELD_STATIC_P (f, j)
1554 *static_memfuncp = 1;
1555 v = value_fn_field (arg1p, f, j, type, offset);
1564 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
1568 if (BASETYPE_VIA_VIRTUAL (type, i))
1570 struct type *baseclass = check_typedef (TYPE_BASECLASS (type, i));
1571 const gdb_byte *base_valaddr;
1573 /* The virtual base class pointer might have been
1574 clobbered by the user program. Make sure that it
1575 still points to a valid memory location. */
1577 if (offset < 0 || offset >= TYPE_LENGTH (type))
1579 gdb_byte *tmp = alloca (TYPE_LENGTH (baseclass));
1580 if (target_read_memory (VALUE_ADDRESS (*arg1p)
1581 + value_offset (*arg1p) + offset,
1582 tmp, TYPE_LENGTH (baseclass)) != 0)
1583 error (_("virtual baseclass botch"));
1587 base_valaddr = value_contents (*arg1p) + offset;
1589 base_offset = baseclass_offset (type, i, base_valaddr,
1590 VALUE_ADDRESS (*arg1p)
1591 + value_offset (*arg1p) + offset);
1592 if (base_offset == -1)
1593 error (_("virtual baseclass botch"));
1597 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
1599 v = search_struct_method (name, arg1p, args, base_offset + offset,
1600 static_memfuncp, TYPE_BASECLASS (type, i));
1601 if (v == (struct value *) - 1)
1607 /* FIXME-bothner: Why is this commented out? Why is it here? */
1608 /* *arg1p = arg1_tmp; */
1613 return (struct value *) - 1;
1618 /* Given *ARGP, a value of type (pointer to a)* structure/union,
1619 extract the component named NAME from the ultimate target
1620 structure/union and return it as a value with its appropriate type.
1621 ERR is used in the error message if *ARGP's type is wrong.
1623 C++: ARGS is a list of argument types to aid in the selection of
1624 an appropriate method. Also, handle derived types.
1626 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
1627 where the truthvalue of whether the function that was resolved was
1628 a static member function or not is stored.
1630 ERR is an error message to be printed in case the field is not
1634 value_struct_elt (struct value **argp, struct value **args,
1635 char *name, int *static_memfuncp, char *err)
1640 *argp = coerce_array (*argp);
1642 t = check_typedef (value_type (*argp));
1644 /* Follow pointers until we get to a non-pointer. */
1646 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
1648 *argp = value_ind (*argp);
1649 /* Don't coerce fn pointer to fn and then back again! */
1650 if (TYPE_CODE (value_type (*argp)) != TYPE_CODE_FUNC)
1651 *argp = coerce_array (*argp);
1652 t = check_typedef (value_type (*argp));
1655 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
1656 && TYPE_CODE (t) != TYPE_CODE_UNION)
1657 error (_("Attempt to extract a component of a value that is not a %s."), err);
1659 /* Assume it's not, unless we see that it is. */
1660 if (static_memfuncp)
1661 *static_memfuncp = 0;
1665 /* if there are no arguments ...do this... */
1667 /* Try as a field first, because if we succeed, there is less
1669 v = search_struct_field (name, *argp, 0, t, 0);
1673 /* C++: If it was not found as a data field, then try to
1674 return it as a pointer to a method. */
1676 if (destructor_name_p (name, t))
1677 error (_("Cannot get value of destructor"));
1679 v = search_struct_method (name, argp, args, 0,
1680 static_memfuncp, t);
1682 if (v == (struct value *) - 1)
1683 error (_("Cannot take address of method %s."), name);
1686 if (TYPE_NFN_FIELDS (t))
1687 error (_("There is no member or method named %s."), name);
1689 error (_("There is no member named %s."), name);
1694 if (destructor_name_p (name, t))
1698 /* Destructors are a special case. */
1699 int m_index, f_index;
1702 if (get_destructor_fn_field (t, &m_index, &f_index))
1704 v = value_fn_field (NULL,
1705 TYPE_FN_FIELDLIST1 (t, m_index),
1709 error (_("could not find destructor function named %s."),
1716 error (_("destructor should not have any argument"));
1720 v = search_struct_method (name, argp, args, 0,
1721 static_memfuncp, t);
1723 if (v == (struct value *) - 1)
1725 error (_("One of the arguments you tried to pass to %s could not be converted to what the function wants."), name);
1729 /* See if user tried to invoke data as function. If so, hand it
1730 back. If it's not callable (i.e., a pointer to function),
1731 gdb should give an error. */
1732 v = search_struct_field (name, *argp, 0, t, 0);
1736 error (_("Structure has no component named %s."), name);
1740 /* Search through the methods of an object (and its bases) to find a
1741 specified method. Return the pointer to the fn_field list of
1742 overloaded instances.
1744 Helper function for value_find_oload_list.
1745 ARGP is a pointer to a pointer to a value (the object).
1746 METHOD is a string containing the method name.
1747 OFFSET is the offset within the value.
1748 TYPE is the assumed type of the object.
1749 NUM_FNS is the number of overloaded instances.
1750 BASETYPE is set to the actual type of the subobject where the
1752 BOFFSET is the offset of the base subobject where the method is found.
1755 static struct fn_field *
1756 find_method_list (struct value **argp, char *method,
1757 int offset, struct type *type, int *num_fns,
1758 struct type **basetype, int *boffset)
1762 CHECK_TYPEDEF (type);
1766 /* First check in object itself. */
1767 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
1769 /* pai: FIXME What about operators and type conversions? */
1770 char *fn_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
1771 if (fn_field_name && (strcmp_iw (fn_field_name, method) == 0))
1773 int len = TYPE_FN_FIELDLIST_LENGTH (type, i);
1774 struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i);
1780 /* Resolve any stub methods. */
1781 check_stub_method_group (type, i);
1787 /* Not found in object, check in base subobjects. */
1788 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
1791 if (BASETYPE_VIA_VIRTUAL (type, i))
1793 base_offset = value_offset (*argp) + offset;
1794 base_offset = baseclass_offset (type, i,
1795 value_contents (*argp) + base_offset,
1796 VALUE_ADDRESS (*argp) + base_offset);
1797 if (base_offset == -1)
1798 error (_("virtual baseclass botch"));
1800 else /* Non-virtual base, simply use bit position from debug
1803 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
1805 f = find_method_list (argp, method, base_offset + offset,
1806 TYPE_BASECLASS (type, i), num_fns,
1814 /* Return the list of overloaded methods of a specified name.
1816 ARGP is a pointer to a pointer to a value (the object).
1817 METHOD is the method name.
1818 OFFSET is the offset within the value contents.
1819 NUM_FNS is the number of overloaded instances.
1820 BASETYPE is set to the type of the base subobject that defines the
1822 BOFFSET is the offset of the base subobject which defines the method.
1826 value_find_oload_method_list (struct value **argp, char *method,
1827 int offset, int *num_fns,
1828 struct type **basetype, int *boffset)
1832 t = check_typedef (value_type (*argp));
1834 /* Code snarfed from value_struct_elt. */
1835 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
1837 *argp = value_ind (*argp);
1838 /* Don't coerce fn pointer to fn and then back again! */
1839 if (TYPE_CODE (value_type (*argp)) != TYPE_CODE_FUNC)
1840 *argp = coerce_array (*argp);
1841 t = check_typedef (value_type (*argp));
1844 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
1845 && TYPE_CODE (t) != TYPE_CODE_UNION)
1846 error (_("Attempt to extract a component of a value that is not a struct or union"));
1848 return find_method_list (argp, method, 0, t, num_fns,
1852 /* Given an array of argument types (ARGTYPES) (which includes an
1853 entry for "this" in the case of C++ methods), the number of
1854 arguments NARGS, the NAME of a function whether it's a method or
1855 not (METHOD), and the degree of laxness (LAX) in conforming to
1856 overload resolution rules in ANSI C++, find the best function that
1857 matches on the argument types according to the overload resolution
1860 In the case of class methods, the parameter OBJ is an object value
1861 in which to search for overloaded methods.
1863 In the case of non-method functions, the parameter FSYM is a symbol
1864 corresponding to one of the overloaded functions.
1866 Return value is an integer: 0 -> good match, 10 -> debugger applied
1867 non-standard coercions, 100 -> incompatible.
1869 If a method is being searched for, VALP will hold the value.
1870 If a non-method is being searched for, SYMP will hold the symbol
1873 If a method is being searched for, and it is a static method,
1874 then STATICP will point to a non-zero value.
1876 Note: This function does *not* check the value of
1877 overload_resolution. Caller must check it to see whether overload
1878 resolution is permitted.
1882 find_overload_match (struct type **arg_types, int nargs,
1883 char *name, int method, int lax,
1884 struct value **objp, struct symbol *fsym,
1885 struct value **valp, struct symbol **symp,
1888 struct value *obj = (objp ? *objp : NULL);
1889 /* Index of best overloaded function. */
1891 /* The measure for the current best match. */
1892 struct badness_vector *oload_champ_bv = NULL;
1893 struct value *temp = obj;
1894 /* For methods, the list of overloaded methods. */
1895 struct fn_field *fns_ptr = NULL;
1896 /* For non-methods, the list of overloaded function symbols. */
1897 struct symbol **oload_syms = NULL;
1898 /* Number of overloaded instances being considered. */
1900 struct type *basetype = NULL;
1904 struct cleanup *old_cleanups = NULL;
1906 const char *obj_type_name = NULL;
1907 char *func_name = NULL;
1908 enum oload_classification match_quality;
1910 /* Get the list of overloaded methods or functions. */
1914 obj_type_name = TYPE_NAME (value_type (obj));
1915 /* Hack: evaluate_subexp_standard often passes in a pointer
1916 value rather than the object itself, so try again. */
1917 if ((!obj_type_name || !*obj_type_name)
1918 && (TYPE_CODE (value_type (obj)) == TYPE_CODE_PTR))
1919 obj_type_name = TYPE_NAME (TYPE_TARGET_TYPE (value_type (obj)));
1921 fns_ptr = value_find_oload_method_list (&temp, name,
1923 &basetype, &boffset);
1924 if (!fns_ptr || !num_fns)
1925 error (_("Couldn't find method %s%s%s"),
1927 (obj_type_name && *obj_type_name) ? "::" : "",
1929 /* If we are dealing with stub method types, they should have
1930 been resolved by find_method_list via
1931 value_find_oload_method_list above. */
1932 gdb_assert (TYPE_DOMAIN_TYPE (fns_ptr[0].type) != NULL);
1933 oload_champ = find_oload_champ (arg_types, nargs, method,
1935 oload_syms, &oload_champ_bv);
1939 const char *qualified_name = SYMBOL_CPLUS_DEMANGLED_NAME (fsym);
1941 /* If we have a C++ name, try to extract just the function
1944 func_name = cp_func_name (qualified_name);
1946 /* If there was no C++ name, this must be a C-style function.
1947 Just return the same symbol. Do the same if cp_func_name
1948 fails for some reason. */
1949 if (func_name == NULL)
1955 old_cleanups = make_cleanup (xfree, func_name);
1956 make_cleanup (xfree, oload_syms);
1957 make_cleanup (xfree, oload_champ_bv);
1959 oload_champ = find_oload_champ_namespace (arg_types, nargs,
1966 /* Check how bad the best match is. */
1969 classify_oload_match (oload_champ_bv, nargs,
1970 oload_method_static (method, fns_ptr,
1973 if (match_quality == INCOMPATIBLE)
1976 error (_("Cannot resolve method %s%s%s to any overloaded instance"),
1978 (obj_type_name && *obj_type_name) ? "::" : "",
1981 error (_("Cannot resolve function %s to any overloaded instance"),
1984 else if (match_quality == NON_STANDARD)
1987 warning (_("Using non-standard conversion to match method %s%s%s to supplied arguments"),
1989 (obj_type_name && *obj_type_name) ? "::" : "",
1992 warning (_("Using non-standard conversion to match function %s to supplied arguments"),
1998 if (staticp != NULL)
1999 *staticp = oload_method_static (method, fns_ptr, oload_champ);
2000 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr, oload_champ))
2001 *valp = value_virtual_fn_field (&temp, fns_ptr, oload_champ,
2004 *valp = value_fn_field (&temp, fns_ptr, oload_champ,
2009 *symp = oload_syms[oload_champ];
2014 if (TYPE_CODE (value_type (temp)) != TYPE_CODE_PTR
2015 && TYPE_CODE (value_type (*objp)) == TYPE_CODE_PTR)
2017 temp = value_addr (temp);
2021 if (old_cleanups != NULL)
2022 do_cleanups (old_cleanups);
2024 switch (match_quality)
2030 default: /* STANDARD */
2035 /* Find the best overload match, searching for FUNC_NAME in namespaces
2036 contained in QUALIFIED_NAME until it either finds a good match or
2037 runs out of namespaces. It stores the overloaded functions in
2038 *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. The
2039 calling function is responsible for freeing *OLOAD_SYMS and
2043 find_oload_champ_namespace (struct type **arg_types, int nargs,
2044 const char *func_name,
2045 const char *qualified_name,
2046 struct symbol ***oload_syms,
2047 struct badness_vector **oload_champ_bv)
2051 find_oload_champ_namespace_loop (arg_types, nargs,
2054 oload_syms, oload_champ_bv,
2060 /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is
2061 how deep we've looked for namespaces, and the champ is stored in
2062 OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0
2065 It is the caller's responsibility to free *OLOAD_SYMS and
2069 find_oload_champ_namespace_loop (struct type **arg_types, int nargs,
2070 const char *func_name,
2071 const char *qualified_name,
2073 struct symbol ***oload_syms,
2074 struct badness_vector **oload_champ_bv,
2077 int next_namespace_len = namespace_len;
2078 int searched_deeper = 0;
2080 struct cleanup *old_cleanups;
2081 int new_oload_champ;
2082 struct symbol **new_oload_syms;
2083 struct badness_vector *new_oload_champ_bv;
2084 char *new_namespace;
2086 if (next_namespace_len != 0)
2088 gdb_assert (qualified_name[next_namespace_len] == ':');
2089 next_namespace_len += 2;
2091 next_namespace_len +=
2092 cp_find_first_component (qualified_name + next_namespace_len);
2094 /* Initialize these to values that can safely be xfree'd. */
2096 *oload_champ_bv = NULL;
2098 /* First, see if we have a deeper namespace we can search in.
2099 If we get a good match there, use it. */
2101 if (qualified_name[next_namespace_len] == ':')
2103 searched_deeper = 1;
2105 if (find_oload_champ_namespace_loop (arg_types, nargs,
2106 func_name, qualified_name,
2108 oload_syms, oload_champ_bv,
2115 /* If we reach here, either we're in the deepest namespace or we
2116 didn't find a good match in a deeper namespace. But, in the
2117 latter case, we still have a bad match in a deeper namespace;
2118 note that we might not find any match at all in the current
2119 namespace. (There's always a match in the deepest namespace,
2120 because this overload mechanism only gets called if there's a
2121 function symbol to start off with.) */
2123 old_cleanups = make_cleanup (xfree, *oload_syms);
2124 old_cleanups = make_cleanup (xfree, *oload_champ_bv);
2125 new_namespace = alloca (namespace_len + 1);
2126 strncpy (new_namespace, qualified_name, namespace_len);
2127 new_namespace[namespace_len] = '\0';
2128 new_oload_syms = make_symbol_overload_list (func_name,
2130 while (new_oload_syms[num_fns])
2133 new_oload_champ = find_oload_champ (arg_types, nargs, 0, num_fns,
2134 NULL, new_oload_syms,
2135 &new_oload_champ_bv);
2137 /* Case 1: We found a good match. Free earlier matches (if any),
2138 and return it. Case 2: We didn't find a good match, but we're
2139 not the deepest function. Then go with the bad match that the
2140 deeper function found. Case 3: We found a bad match, and we're
2141 the deepest function. Then return what we found, even though
2142 it's a bad match. */
2144 if (new_oload_champ != -1
2145 && classify_oload_match (new_oload_champ_bv, nargs, 0) == STANDARD)
2147 *oload_syms = new_oload_syms;
2148 *oload_champ = new_oload_champ;
2149 *oload_champ_bv = new_oload_champ_bv;
2150 do_cleanups (old_cleanups);
2153 else if (searched_deeper)
2155 xfree (new_oload_syms);
2156 xfree (new_oload_champ_bv);
2157 discard_cleanups (old_cleanups);
2162 gdb_assert (new_oload_champ != -1);
2163 *oload_syms = new_oload_syms;
2164 *oload_champ = new_oload_champ;
2165 *oload_champ_bv = new_oload_champ_bv;
2166 discard_cleanups (old_cleanups);
2171 /* Look for a function to take NARGS args of types ARG_TYPES. Find
2172 the best match from among the overloaded methods or functions
2173 (depending on METHOD) given by FNS_PTR or OLOAD_SYMS, respectively.
2174 The number of methods/functions in the list is given by NUM_FNS.
2175 Return the index of the best match; store an indication of the
2176 quality of the match in OLOAD_CHAMP_BV.
2178 It is the caller's responsibility to free *OLOAD_CHAMP_BV. */
2181 find_oload_champ (struct type **arg_types, int nargs, int method,
2182 int num_fns, struct fn_field *fns_ptr,
2183 struct symbol **oload_syms,
2184 struct badness_vector **oload_champ_bv)
2187 /* A measure of how good an overloaded instance is. */
2188 struct badness_vector *bv;
2189 /* Index of best overloaded function. */
2190 int oload_champ = -1;
2191 /* Current ambiguity state for overload resolution. */
2192 int oload_ambiguous = 0;
2193 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */
2195 *oload_champ_bv = NULL;
2197 /* Consider each candidate in turn. */
2198 for (ix = 0; ix < num_fns; ix++)
2201 int static_offset = oload_method_static (method, fns_ptr, ix);
2203 struct type **parm_types;
2207 nparms = TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (fns_ptr, ix));
2211 /* If it's not a method, this is the proper place. */
2212 nparms = TYPE_NFIELDS (SYMBOL_TYPE (oload_syms[ix]));
2215 /* Prepare array of parameter types. */
2216 parm_types = (struct type **)
2217 xmalloc (nparms * (sizeof (struct type *)));
2218 for (jj = 0; jj < nparms; jj++)
2219 parm_types[jj] = (method
2220 ? (TYPE_FN_FIELD_ARGS (fns_ptr, ix)[jj].type)
2221 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms[ix]),
2224 /* Compare parameter types to supplied argument types. Skip
2225 THIS for static methods. */
2226 bv = rank_function (parm_types, nparms,
2227 arg_types + static_offset,
2228 nargs - static_offset);
2230 if (!*oload_champ_bv)
2232 *oload_champ_bv = bv;
2235 else /* See whether current candidate is better or worse than
2237 switch (compare_badness (bv, *oload_champ_bv))
2239 case 0: /* Top two contenders are equally good. */
2240 oload_ambiguous = 1;
2242 case 1: /* Incomparable top contenders. */
2243 oload_ambiguous = 2;
2245 case 2: /* New champion, record details. */
2246 *oload_champ_bv = bv;
2247 oload_ambiguous = 0;
2258 fprintf_filtered (gdb_stderr,
2259 "Overloaded method instance %s, # of parms %d\n",
2260 fns_ptr[ix].physname, nparms);
2262 fprintf_filtered (gdb_stderr,
2263 "Overloaded function instance %s # of parms %d\n",
2264 SYMBOL_DEMANGLED_NAME (oload_syms[ix]),
2266 for (jj = 0; jj < nargs - static_offset; jj++)
2267 fprintf_filtered (gdb_stderr,
2268 "...Badness @ %d : %d\n",
2270 fprintf_filtered (gdb_stderr,
2271 "Overload resolution champion is %d, ambiguous? %d\n",
2272 oload_champ, oload_ambiguous);
2279 /* Return 1 if we're looking at a static method, 0 if we're looking at
2280 a non-static method or a function that isn't a method. */
2283 oload_method_static (int method, struct fn_field *fns_ptr, int index)
2285 if (method && TYPE_FN_FIELD_STATIC_P (fns_ptr, index))
2291 /* Check how good an overload match OLOAD_CHAMP_BV represents. */
2293 static enum oload_classification
2294 classify_oload_match (struct badness_vector *oload_champ_bv,
2300 for (ix = 1; ix <= nargs - static_offset; ix++)
2302 if (oload_champ_bv->rank[ix] >= 100)
2303 return INCOMPATIBLE; /* Truly mismatched types. */
2304 else if (oload_champ_bv->rank[ix] >= 10)
2305 return NON_STANDARD; /* Non-standard type conversions
2309 return STANDARD; /* Only standard conversions needed. */
2312 /* C++: return 1 is NAME is a legitimate name for the destructor of
2313 type TYPE. If TYPE does not have a destructor, or if NAME is
2314 inappropriate for TYPE, an error is signaled. */
2316 destructor_name_p (const char *name, const struct type *type)
2318 /* Destructors are a special case. */
2322 char *dname = type_name_no_tag (type);
2323 char *cp = strchr (dname, '<');
2326 /* Do not compare the template part for template classes. */
2328 len = strlen (dname);
2331 if (strlen (name + 1) != len || strncmp (dname, name + 1, len) != 0)
2332 error (_("name of destructor must equal name of class"));
2339 /* Given TYPE, a structure/union,
2340 return 1 if the component named NAME from the ultimate target
2341 structure/union is defined, otherwise, return 0. */
2344 check_field (struct type *type, const char *name)
2348 for (i = TYPE_NFIELDS (type) - 1; i >= TYPE_N_BASECLASSES (type); i--)
2350 char *t_field_name = TYPE_FIELD_NAME (type, i);
2351 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
2355 /* C++: If it was not found as a data field, then try to return it
2356 as a pointer to a method. */
2358 /* Destructors are a special case. */
2359 if (destructor_name_p (name, type))
2361 int m_index, f_index;
2363 return get_destructor_fn_field (type, &m_index, &f_index);
2366 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; --i)
2368 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type, i), name) == 0)
2372 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2373 if (check_field (TYPE_BASECLASS (type, i), name))
2379 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
2380 return the appropriate member (or the address of the member, if
2381 WANT_ADDRESS). This function is used to resolve user expressions
2382 of the form "DOMAIN::NAME". For more details on what happens, see
2383 the comment before value_struct_elt_for_reference. */
2386 value_aggregate_elt (struct type *curtype,
2387 char *name, int want_address,
2390 switch (TYPE_CODE (curtype))
2392 case TYPE_CODE_STRUCT:
2393 case TYPE_CODE_UNION:
2394 return value_struct_elt_for_reference (curtype, 0, curtype,
2396 want_address, noside);
2397 case TYPE_CODE_NAMESPACE:
2398 return value_namespace_elt (curtype, name,
2399 want_address, noside);
2401 internal_error (__FILE__, __LINE__,
2402 _("non-aggregate type in value_aggregate_elt"));
2406 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
2407 return the address of this member as a "pointer to member" type.
2408 If INTYPE is non-null, then it will be the type of the member we
2409 are looking for. This will help us resolve "pointers to member
2410 functions". This function is used to resolve user expressions of
2411 the form "DOMAIN::NAME". */
2413 static struct value *
2414 value_struct_elt_for_reference (struct type *domain, int offset,
2415 struct type *curtype, char *name,
2416 struct type *intype,
2420 struct type *t = curtype;
2422 struct value *v, *result;
2424 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2425 && TYPE_CODE (t) != TYPE_CODE_UNION)
2426 error (_("Internal error: non-aggregate type to value_struct_elt_for_reference"));
2428 for (i = TYPE_NFIELDS (t) - 1; i >= TYPE_N_BASECLASSES (t); i--)
2430 char *t_field_name = TYPE_FIELD_NAME (t, i);
2432 if (t_field_name && strcmp (t_field_name, name) == 0)
2434 if (TYPE_FIELD_STATIC (t, i))
2436 v = value_static_field (t, i);
2438 error (_("static field %s has been optimized out"),
2444 if (TYPE_FIELD_PACKED (t, i))
2445 error (_("pointers to bitfield members not allowed"));
2448 return value_from_longest
2449 (lookup_memberptr_type (TYPE_FIELD_TYPE (t, i), domain),
2450 offset + (LONGEST) (TYPE_FIELD_BITPOS (t, i) >> 3));
2451 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
2452 return allocate_value (TYPE_FIELD_TYPE (t, i));
2454 error (_("Cannot reference non-static field \"%s\""), name);
2458 /* C++: If it was not found as a data field, then try to return it
2459 as a pointer to a method. */
2461 /* Destructors are a special case. */
2462 if (destructor_name_p (name, t))
2464 error (_("member pointers to destructors not implemented yet"));
2467 /* Perform all necessary dereferencing. */
2468 while (intype && TYPE_CODE (intype) == TYPE_CODE_PTR)
2469 intype = TYPE_TARGET_TYPE (intype);
2471 for (i = TYPE_NFN_FIELDS (t) - 1; i >= 0; --i)
2473 char *t_field_name = TYPE_FN_FIELDLIST_NAME (t, i);
2474 char dem_opname[64];
2476 if (strncmp (t_field_name, "__", 2) == 0
2477 || strncmp (t_field_name, "op", 2) == 0
2478 || strncmp (t_field_name, "type", 4) == 0)
2480 if (cplus_demangle_opname (t_field_name,
2481 dem_opname, DMGL_ANSI))
2482 t_field_name = dem_opname;
2483 else if (cplus_demangle_opname (t_field_name,
2485 t_field_name = dem_opname;
2487 if (t_field_name && strcmp (t_field_name, name) == 0)
2489 int j = TYPE_FN_FIELDLIST_LENGTH (t, i);
2490 struct fn_field *f = TYPE_FN_FIELDLIST1 (t, i);
2492 check_stub_method_group (t, i);
2494 if (intype == 0 && j > 1)
2495 error (_("non-unique member `%s' requires type instantiation"), name);
2499 if (TYPE_FN_FIELD_TYPE (f, j) == intype)
2502 error (_("no member function matches that type instantiation"));
2507 if (TYPE_FN_FIELD_STATIC_P (f, j))
2510 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j),
2511 0, VAR_DOMAIN, 0, NULL);
2516 return value_addr (read_var_value (s, 0));
2518 return read_var_value (s, 0);
2521 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
2525 result = allocate_value
2526 (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f, j)));
2527 cplus_make_method_ptr (value_contents_writeable (result),
2528 TYPE_FN_FIELD_VOFFSET (f, j), 1);
2530 else if (noside == EVAL_AVOID_SIDE_EFFECTS)
2531 return allocate_value (TYPE_FN_FIELD_TYPE (f, j));
2533 error (_("Cannot reference virtual member function \"%s\""),
2539 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j),
2540 0, VAR_DOMAIN, 0, NULL);
2544 v = read_var_value (s, 0);
2549 result = allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f, j)));
2550 cplus_make_method_ptr (value_contents_writeable (result),
2551 VALUE_ADDRESS (v), 0);
2557 for (i = TYPE_N_BASECLASSES (t) - 1; i >= 0; i--)
2562 if (BASETYPE_VIA_VIRTUAL (t, i))
2565 base_offset = TYPE_BASECLASS_BITPOS (t, i) / 8;
2566 v = value_struct_elt_for_reference (domain,
2567 offset + base_offset,
2568 TYPE_BASECLASS (t, i),
2570 want_address, noside);
2575 /* As a last chance, pretend that CURTYPE is a namespace, and look
2576 it up that way; this (frequently) works for types nested inside
2579 return value_maybe_namespace_elt (curtype, name,
2580 want_address, noside);
2583 /* C++: Return the member NAME of the namespace given by the type
2586 static struct value *
2587 value_namespace_elt (const struct type *curtype,
2588 char *name, int want_address,
2591 struct value *retval = value_maybe_namespace_elt (curtype, name,
2596 error (_("No symbol \"%s\" in namespace \"%s\"."),
2597 name, TYPE_TAG_NAME (curtype));
2602 /* A helper function used by value_namespace_elt and
2603 value_struct_elt_for_reference. It looks up NAME inside the
2604 context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE
2605 is a class and NAME refers to a type in CURTYPE itself (as opposed
2606 to, say, some base class of CURTYPE). */
2608 static struct value *
2609 value_maybe_namespace_elt (const struct type *curtype,
2610 char *name, int want_address,
2613 const char *namespace_name = TYPE_TAG_NAME (curtype);
2615 struct value *result;
2617 sym = cp_lookup_symbol_namespace (namespace_name, name, NULL,
2618 get_selected_block (0),
2623 else if ((noside == EVAL_AVOID_SIDE_EFFECTS)
2624 && (SYMBOL_CLASS (sym) == LOC_TYPEDEF))
2625 result = allocate_value (SYMBOL_TYPE (sym));
2627 result = value_of_variable (sym, get_selected_block (0));
2629 if (result && want_address)
2630 result = value_addr (result);
2635 /* Given a pointer value V, find the real (RTTI) type of the object it
2638 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
2639 and refer to the values computed for the object pointed to. */
2642 value_rtti_target_type (struct value *v, int *full,
2643 int *top, int *using_enc)
2645 struct value *target;
2647 target = value_ind (v);
2649 return value_rtti_type (target, full, top, using_enc);
2652 /* Given a value pointed to by ARGP, check its real run-time type, and
2653 if that is different from the enclosing type, create a new value
2654 using the real run-time type as the enclosing type (and of the same
2655 type as ARGP) and return it, with the embedded offset adjusted to
2656 be the correct offset to the enclosed object. RTYPE is the type,
2657 and XFULL, XTOP, and XUSING_ENC are the other parameters, computed
2658 by value_rtti_type(). If these are available, they can be supplied
2659 and a second call to value_rtti_type() is avoided. (Pass RTYPE ==
2660 NULL if they're not available. */
2663 value_full_object (struct value *argp,
2665 int xfull, int xtop,
2668 struct type *real_type;
2672 struct value *new_val;
2679 using_enc = xusing_enc;
2682 real_type = value_rtti_type (argp, &full, &top, &using_enc);
2684 /* If no RTTI data, or if object is already complete, do nothing. */
2685 if (!real_type || real_type == value_enclosing_type (argp))
2688 /* If we have the full object, but for some reason the enclosing
2689 type is wrong, set it. */
2690 /* pai: FIXME -- sounds iffy */
2693 argp = value_change_enclosing_type (argp, real_type);
2697 /* Check if object is in memory */
2698 if (VALUE_LVAL (argp) != lval_memory)
2700 warning (_("Couldn't retrieve complete object of RTTI type %s; object may be in register(s)."),
2701 TYPE_NAME (real_type));
2706 /* All other cases -- retrieve the complete object. */
2707 /* Go back by the computed top_offset from the beginning of the
2708 object, adjusting for the embedded offset of argp if that's what
2709 value_rtti_type used for its computation. */
2710 new_val = value_at_lazy (real_type, VALUE_ADDRESS (argp) - top +
2711 (using_enc ? 0 : value_embedded_offset (argp)));
2712 deprecated_set_value_type (new_val, value_type (argp));
2713 set_value_embedded_offset (new_val, (using_enc
2714 ? top + value_embedded_offset (argp)
2720 /* Return the value of the local variable, if one exists.
2721 Flag COMPLAIN signals an error if the request is made in an
2722 inappropriate context. */
2725 value_of_local (const char *name, int complain)
2727 struct symbol *func, *sym;
2730 struct frame_info *frame;
2733 frame = get_selected_frame (_("no frame selected"));
2736 frame = deprecated_safe_get_selected_frame ();
2741 func = get_frame_function (frame);
2745 error (_("no `%s' in nameless context"), name);
2750 b = SYMBOL_BLOCK_VALUE (func);
2751 if (dict_empty (BLOCK_DICT (b)))
2754 error (_("no args, no `%s'"), name);
2759 /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER
2760 symbol instead of the LOC_ARG one (if both exist). */
2761 sym = lookup_block_symbol (b, name, NULL, VAR_DOMAIN);
2765 error (_("current stack frame does not contain a variable named `%s'"),
2771 ret = read_var_value (sym, frame);
2772 if (ret == 0 && complain)
2773 error (_("`%s' argument unreadable"), name);
2777 /* C++/Objective-C: return the value of the class instance variable,
2778 if one exists. Flag COMPLAIN signals an error if the request is
2779 made in an inappropriate context. */
2782 value_of_this (int complain)
2784 if (!current_language->la_name_of_this)
2786 return value_of_local (current_language->la_name_of_this, complain);
2789 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH
2790 elements long, starting at LOWBOUND. The result has the same lower
2791 bound as the original ARRAY. */
2794 value_slice (struct value *array, int lowbound, int length)
2796 struct type *slice_range_type, *slice_type, *range_type;
2797 LONGEST lowerbound, upperbound;
2798 struct value *slice;
2799 struct type *array_type;
2801 array_type = check_typedef (value_type (array));
2802 if (TYPE_CODE (array_type) != TYPE_CODE_ARRAY
2803 && TYPE_CODE (array_type) != TYPE_CODE_STRING
2804 && TYPE_CODE (array_type) != TYPE_CODE_BITSTRING)
2805 error (_("cannot take slice of non-array"));
2807 range_type = TYPE_INDEX_TYPE (array_type);
2808 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
2809 error (_("slice from bad array or bitstring"));
2811 if (lowbound < lowerbound || length < 0
2812 || lowbound + length - 1 > upperbound)
2813 error (_("slice out of range"));
2815 /* FIXME-type-allocation: need a way to free this type when we are
2817 slice_range_type = create_range_type ((struct type *) NULL,
2818 TYPE_TARGET_TYPE (range_type),
2820 lowbound + length - 1);
2821 if (TYPE_CODE (array_type) == TYPE_CODE_BITSTRING)
2825 slice_type = create_set_type ((struct type *) NULL,
2827 TYPE_CODE (slice_type) = TYPE_CODE_BITSTRING;
2828 slice = value_zero (slice_type, not_lval);
2830 for (i = 0; i < length; i++)
2832 int element = value_bit_index (array_type,
2833 value_contents (array),
2836 error (_("internal error accessing bitstring"));
2837 else if (element > 0)
2839 int j = i % TARGET_CHAR_BIT;
2840 if (gdbarch_bits_big_endian (current_gdbarch))
2841 j = TARGET_CHAR_BIT - 1 - j;
2842 value_contents_raw (slice)[i / TARGET_CHAR_BIT] |= (1 << j);
2845 /* We should set the address, bitssize, and bitspos, so the
2846 slice can be used on the LHS, but that may require extensions
2847 to value_assign. For now, just leave as a non_lval.
2852 struct type *element_type = TYPE_TARGET_TYPE (array_type);
2854 (lowbound - lowerbound) * TYPE_LENGTH (check_typedef (element_type));
2856 slice_type = create_array_type ((struct type *) NULL,
2859 TYPE_CODE (slice_type) = TYPE_CODE (array_type);
2861 slice = allocate_value (slice_type);
2862 if (value_lazy (array))
2863 set_value_lazy (slice, 1);
2865 memcpy (value_contents_writeable (slice),
2866 value_contents (array) + offset,
2867 TYPE_LENGTH (slice_type));
2869 if (VALUE_LVAL (array) == lval_internalvar)
2870 VALUE_LVAL (slice) = lval_internalvar_component;
2872 VALUE_LVAL (slice) = VALUE_LVAL (array);
2874 VALUE_ADDRESS (slice) = VALUE_ADDRESS (array);
2875 VALUE_FRAME_ID (slice) = VALUE_FRAME_ID (array);
2876 set_value_offset (slice, value_offset (array) + offset);
2881 /* Create a value for a FORTRAN complex number. Currently most of the
2882 time values are coerced to COMPLEX*16 (i.e. a complex number
2883 composed of 2 doubles. This really should be a smarter routine
2884 that figures out precision inteligently as opposed to assuming
2885 doubles. FIXME: fmb */
2888 value_literal_complex (struct value *arg1,
2893 struct type *real_type = TYPE_TARGET_TYPE (type);
2895 val = allocate_value (type);
2896 arg1 = value_cast (real_type, arg1);
2897 arg2 = value_cast (real_type, arg2);
2899 memcpy (value_contents_raw (val),
2900 value_contents (arg1), TYPE_LENGTH (real_type));
2901 memcpy (value_contents_raw (val) + TYPE_LENGTH (real_type),
2902 value_contents (arg2), TYPE_LENGTH (real_type));
2906 /* Cast a value into the appropriate complex data type. */
2908 static struct value *
2909 cast_into_complex (struct type *type, struct value *val)
2911 struct type *real_type = TYPE_TARGET_TYPE (type);
2913 if (TYPE_CODE (value_type (val)) == TYPE_CODE_COMPLEX)
2915 struct type *val_real_type = TYPE_TARGET_TYPE (value_type (val));
2916 struct value *re_val = allocate_value (val_real_type);
2917 struct value *im_val = allocate_value (val_real_type);
2919 memcpy (value_contents_raw (re_val),
2920 value_contents (val), TYPE_LENGTH (val_real_type));
2921 memcpy (value_contents_raw (im_val),
2922 value_contents (val) + TYPE_LENGTH (val_real_type),
2923 TYPE_LENGTH (val_real_type));
2925 return value_literal_complex (re_val, im_val, type);
2927 else if (TYPE_CODE (value_type (val)) == TYPE_CODE_FLT
2928 || TYPE_CODE (value_type (val)) == TYPE_CODE_INT)
2929 return value_literal_complex (val,
2930 value_zero (real_type, not_lval),
2933 error (_("cannot cast non-number to complex"));
2937 _initialize_valops (void)
2939 add_setshow_boolean_cmd ("overload-resolution", class_support,
2940 &overload_resolution, _("\
2941 Set overload resolution in evaluating C++ functions."), _("\
2942 Show overload resolution in evaluating C++ functions."),
2944 show_overload_resolution,
2945 &setlist, &showlist);
2946 overload_resolution = 1;