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 int check_field_in (struct type
*, const char *);
85 static struct value
*value_struct_elt_for_reference (struct type
*,
91 static struct value
*value_namespace_elt (const struct type
*,
92 char *, int , enum noside
);
94 static struct value
*value_maybe_namespace_elt (const struct type
*,
98 static CORE_ADDR
allocate_space_in_inferior (int);
100 static struct value
*cast_into_complex (struct type
*, struct value
*);
102 static struct fn_field
*find_method_list (struct value
**, char *,
103 int, struct type
*, int *,
104 struct type
**, int *);
106 void _initialize_valops (void);
109 /* Flag for whether we want to abandon failed expression evals by
112 static int auto_abandon
= 0;
115 int overload_resolution
= 0;
117 show_overload_resolution (struct ui_file
*file
, int from_tty
,
118 struct cmd_list_element
*c
,
121 fprintf_filtered (file
, _("\
122 Overload resolution in evaluating C++ functions is %s.\n"),
126 /* Find the address of function name NAME in the inferior. */
129 find_function_in_inferior (const char *name
)
132 sym
= lookup_symbol (name
, 0, VAR_DOMAIN
, 0, NULL
);
135 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
137 error (_("\"%s\" exists in this program but is not a function."),
140 return value_of_variable (sym
, NULL
);
144 struct minimal_symbol
*msymbol
=
145 lookup_minimal_symbol (name
, NULL
, NULL
);
150 type
= lookup_pointer_type (builtin_type_char
);
151 type
= lookup_function_type (type
);
152 type
= lookup_pointer_type (type
);
153 maddr
= SYMBOL_VALUE_ADDRESS (msymbol
);
154 return value_from_pointer (type
, maddr
);
158 if (!target_has_execution
)
159 error (_("evaluation of this expression requires the target program to be active"));
161 error (_("evaluation of this expression requires the program to have a function \"%s\"."), name
);
166 /* Allocate NBYTES of space in the inferior using the inferior's
167 malloc and return a value that is a pointer to the allocated
171 value_allocate_space_in_inferior (int len
)
173 struct value
*blocklen
;
175 find_function_in_inferior (gdbarch_name_of_malloc (current_gdbarch
));
177 blocklen
= value_from_longest (builtin_type_int
, (LONGEST
) len
);
178 val
= call_function_by_hand (val
, 1, &blocklen
);
179 if (value_logical_not (val
))
181 if (!target_has_execution
)
182 error (_("No memory available to program now: you need to start the target first"));
184 error (_("No memory available to program: call to malloc failed"));
190 allocate_space_in_inferior (int len
)
192 return value_as_long (value_allocate_space_in_inferior (len
));
195 /* Cast one pointer or reference type to another. Both TYPE and
196 the type of ARG2 should be pointer types, or else both should be
197 reference types. Returns the new pointer or reference. */
200 value_cast_pointers (struct type
*type
, struct value
*arg2
)
202 struct type
*type2
= check_typedef (value_type (arg2
));
203 struct type
*t1
= check_typedef (TYPE_TARGET_TYPE (type
));
204 struct type
*t2
= check_typedef (TYPE_TARGET_TYPE (type2
));
206 if (TYPE_CODE (t1
) == TYPE_CODE_STRUCT
207 && TYPE_CODE (t2
) == TYPE_CODE_STRUCT
208 && !value_logical_not (arg2
))
212 /* Look in the type of the source to see if it contains the
213 type of the target as a superclass. If so, we'll need to
214 offset the pointer rather than just change its type. */
215 if (TYPE_NAME (t1
) != NULL
)
219 if (TYPE_CODE (type2
) == TYPE_CODE_REF
)
220 v2
= coerce_ref (arg2
);
222 v2
= value_ind (arg2
);
223 v
= search_struct_field (type_name_no_tag (t1
),
228 deprecated_set_value_type (v
, type
);
233 /* Look in the type of the target to see if it contains the
234 type of the source as a superclass. If so, we'll need to
235 offset the pointer rather than just change its type.
236 FIXME: This fails silently with virtual inheritance. */
237 if (TYPE_NAME (t2
) != NULL
)
239 v
= search_struct_field (type_name_no_tag (t2
),
240 value_zero (t1
, not_lval
), 0, t1
, 1);
243 CORE_ADDR addr2
= value_as_address (arg2
);
244 addr2
-= (VALUE_ADDRESS (v
)
246 + value_embedded_offset (v
));
247 return value_from_pointer (type
, addr2
);
252 /* No superclass found, just change the pointer type. */
253 arg2
= value_copy (arg2
);
254 deprecated_set_value_type (arg2
, type
);
255 arg2
= value_change_enclosing_type (arg2
, type
);
256 set_value_pointed_to_offset (arg2
, 0); /* pai: chk_val */
260 /* Cast value ARG2 to type TYPE and return as a value.
261 More general than a C cast: accepts any two types of the same length,
262 and if ARG2 is an lvalue it can be cast into anything at all. */
263 /* In C++, casts may change pointer or object representations. */
266 value_cast (struct type
*type
, struct value
*arg2
)
268 enum type_code code1
;
269 enum type_code code2
;
273 int convert_to_boolean
= 0;
275 if (value_type (arg2
) == type
)
278 CHECK_TYPEDEF (type
);
279 code1
= TYPE_CODE (type
);
280 arg2
= coerce_ref (arg2
);
281 type2
= check_typedef (value_type (arg2
));
283 /* You can't cast to a reference type. See value_cast_pointers
285 gdb_assert (code1
!= TYPE_CODE_REF
);
287 /* A cast to an undetermined-length array_type, such as
288 (TYPE [])OBJECT, is treated like a cast to (TYPE [N])OBJECT,
289 where N is sizeof(OBJECT)/sizeof(TYPE). */
290 if (code1
== TYPE_CODE_ARRAY
)
292 struct type
*element_type
= TYPE_TARGET_TYPE (type
);
293 unsigned element_length
= TYPE_LENGTH (check_typedef (element_type
));
294 if (element_length
> 0
295 && TYPE_ARRAY_UPPER_BOUND_TYPE (type
) == BOUND_CANNOT_BE_DETERMINED
)
297 struct type
*range_type
= TYPE_INDEX_TYPE (type
);
298 int val_length
= TYPE_LENGTH (type2
);
299 LONGEST low_bound
, high_bound
, new_length
;
300 if (get_discrete_bounds (range_type
, &low_bound
, &high_bound
) < 0)
301 low_bound
= 0, high_bound
= 0;
302 new_length
= val_length
/ element_length
;
303 if (val_length
% element_length
!= 0)
304 warning (_("array element type size does not divide object size in cast"));
305 /* FIXME-type-allocation: need a way to free this type when
306 we are done with it. */
307 range_type
= create_range_type ((struct type
*) NULL
,
308 TYPE_TARGET_TYPE (range_type
),
310 new_length
+ low_bound
- 1);
311 deprecated_set_value_type (arg2
,
312 create_array_type ((struct type
*) NULL
,
319 if (current_language
->c_style_arrays
320 && TYPE_CODE (type2
) == TYPE_CODE_ARRAY
)
321 arg2
= value_coerce_array (arg2
);
323 if (TYPE_CODE (type2
) == TYPE_CODE_FUNC
)
324 arg2
= value_coerce_function (arg2
);
326 type2
= check_typedef (value_type (arg2
));
327 code2
= TYPE_CODE (type2
);
329 if (code1
== TYPE_CODE_COMPLEX
)
330 return cast_into_complex (type
, arg2
);
331 if (code1
== TYPE_CODE_BOOL
)
333 code1
= TYPE_CODE_INT
;
334 convert_to_boolean
= 1;
336 if (code1
== TYPE_CODE_CHAR
)
337 code1
= TYPE_CODE_INT
;
338 if (code2
== TYPE_CODE_BOOL
|| code2
== TYPE_CODE_CHAR
)
339 code2
= TYPE_CODE_INT
;
341 scalar
= (code2
== TYPE_CODE_INT
|| code2
== TYPE_CODE_FLT
342 || code2
== TYPE_CODE_DECFLOAT
|| code2
== TYPE_CODE_ENUM
343 || code2
== TYPE_CODE_RANGE
);
345 if (code1
== TYPE_CODE_STRUCT
346 && code2
== TYPE_CODE_STRUCT
347 && TYPE_NAME (type
) != 0)
349 /* Look in the type of the source to see if it contains the
350 type of the target as a superclass. If so, we'll need to
351 offset the object in addition to changing its type. */
352 struct value
*v
= search_struct_field (type_name_no_tag (type
),
356 deprecated_set_value_type (v
, type
);
360 if (code1
== TYPE_CODE_FLT
&& scalar
)
361 return value_from_double (type
, value_as_double (arg2
));
362 else if (code1
== TYPE_CODE_DECFLOAT
&& scalar
)
364 int dec_len
= TYPE_LENGTH (type
);
367 if (code2
== TYPE_CODE_FLT
)
368 decimal_from_floating (arg2
, dec
, dec_len
);
369 else if (code2
== TYPE_CODE_DECFLOAT
)
370 decimal_convert (value_contents (arg2
), TYPE_LENGTH (type2
),
373 /* The only option left is an integral type. */
374 decimal_from_integral (arg2
, dec
, dec_len
);
376 return value_from_decfloat (type
, dec
);
378 else if ((code1
== TYPE_CODE_INT
|| code1
== TYPE_CODE_ENUM
379 || code1
== TYPE_CODE_RANGE
)
380 && (scalar
|| code2
== TYPE_CODE_PTR
381 || code2
== TYPE_CODE_MEMBERPTR
))
385 /* When we cast pointers to integers, we mustn't use
386 gdbarch_pointer_to_address to find the address the pointer
387 represents, as value_as_long would. GDB should evaluate
388 expressions just as the compiler would --- and the compiler
389 sees a cast as a simple reinterpretation of the pointer's
391 if (code2
== TYPE_CODE_PTR
)
392 longest
= extract_unsigned_integer (value_contents (arg2
),
393 TYPE_LENGTH (type2
));
395 longest
= value_as_long (arg2
);
396 return value_from_longest (type
, convert_to_boolean
?
397 (LONGEST
) (longest
? 1 : 0) : longest
);
399 else if (code1
== TYPE_CODE_PTR
&& (code2
== TYPE_CODE_INT
400 || code2
== TYPE_CODE_ENUM
401 || code2
== TYPE_CODE_RANGE
))
403 /* TYPE_LENGTH (type) is the length of a pointer, but we really
404 want the length of an address! -- we are really dealing with
405 addresses (i.e., gdb representations) not pointers (i.e.,
406 target representations) here.
408 This allows things like "print *(int *)0x01000234" to work
409 without printing a misleading message -- which would
410 otherwise occur when dealing with a target having two byte
411 pointers and four byte addresses. */
413 int addr_bit
= gdbarch_addr_bit (current_gdbarch
);
415 LONGEST longest
= value_as_long (arg2
);
416 if (addr_bit
< sizeof (LONGEST
) * HOST_CHAR_BIT
)
418 if (longest
>= ((LONGEST
) 1 << addr_bit
)
419 || longest
<= -((LONGEST
) 1 << addr_bit
))
420 warning (_("value truncated"));
422 return value_from_longest (type
, longest
);
424 else if (code1
== TYPE_CODE_METHODPTR
&& code2
== TYPE_CODE_INT
425 && value_as_long (arg2
) == 0)
427 struct value
*result
= allocate_value (type
);
428 cplus_make_method_ptr (value_contents_writeable (result
), 0, 0);
431 else if (code1
== TYPE_CODE_MEMBERPTR
&& code2
== TYPE_CODE_INT
432 && value_as_long (arg2
) == 0)
434 /* The Itanium C++ ABI represents NULL pointers to members as
435 minus one, instead of biasing the normal case. */
436 return value_from_longest (type
, -1);
438 else if (TYPE_LENGTH (type
) == TYPE_LENGTH (type2
))
440 if (code1
== TYPE_CODE_PTR
&& code2
== TYPE_CODE_PTR
)
441 return value_cast_pointers (type
, arg2
);
443 arg2
= value_copy (arg2
);
444 deprecated_set_value_type (arg2
, type
);
445 arg2
= value_change_enclosing_type (arg2
, type
);
446 set_value_pointed_to_offset (arg2
, 0); /* pai: chk_val */
449 else if (VALUE_LVAL (arg2
) == lval_memory
)
450 return value_at_lazy (type
,
451 VALUE_ADDRESS (arg2
) + value_offset (arg2
));
452 else if (code1
== TYPE_CODE_VOID
)
454 return value_zero (builtin_type_void
, not_lval
);
458 error (_("Invalid cast."));
463 /* Create a value of type TYPE that is zero, and return it. */
466 value_zero (struct type
*type
, enum lval_type lv
)
468 struct value
*val
= allocate_value (type
);
469 VALUE_LVAL (val
) = lv
;
474 /* Create a value of numeric type TYPE that is one, and return it. */
477 value_one (struct type
*type
, enum lval_type lv
)
479 struct type
*type1
= check_typedef (type
);
480 struct value
*val
= NULL
; /* avoid -Wall warning */
482 if (TYPE_CODE (type1
) == TYPE_CODE_DECFLOAT
)
484 struct value
*int_one
= value_from_longest (builtin_type_int
, 1);
488 decimal_from_integral (int_one
, v
, TYPE_LENGTH (builtin_type_int
));
489 val
= value_from_decfloat (type
, v
);
491 else if (TYPE_CODE (type1
) == TYPE_CODE_FLT
)
493 val
= value_from_double (type
, (DOUBLEST
) 1);
495 else if (is_integral_type (type1
))
497 val
= value_from_longest (type
, (LONGEST
) 1);
501 error (_("Not a numeric type."));
504 VALUE_LVAL (val
) = lv
;
508 /* Return a value with type TYPE located at ADDR.
510 Call value_at only if the data needs to be fetched immediately;
511 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
512 value_at_lazy instead. value_at_lazy simply records the address of
513 the data and sets the lazy-evaluation-required flag. The lazy flag
514 is tested in the value_contents macro, which is used if and when
515 the contents are actually required.
517 Note: value_at does *NOT* handle embedded offsets; perform such
518 adjustments before or after calling it. */
521 value_at (struct type
*type
, CORE_ADDR addr
)
525 if (TYPE_CODE (check_typedef (type
)) == TYPE_CODE_VOID
)
526 error (_("Attempt to dereference a generic pointer."));
528 val
= allocate_value (type
);
530 read_memory (addr
, value_contents_all_raw (val
), TYPE_LENGTH (type
));
532 VALUE_LVAL (val
) = lval_memory
;
533 VALUE_ADDRESS (val
) = addr
;
538 /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
541 value_at_lazy (struct type
*type
, CORE_ADDR addr
)
545 if (TYPE_CODE (check_typedef (type
)) == TYPE_CODE_VOID
)
546 error (_("Attempt to dereference a generic pointer."));
548 val
= allocate_value (type
);
550 VALUE_LVAL (val
) = lval_memory
;
551 VALUE_ADDRESS (val
) = addr
;
552 set_value_lazy (val
, 1);
557 /* Called only from the value_contents and value_contents_all()
558 macros, if the current data for a variable needs to be loaded into
559 value_contents(VAL). Fetches the data from the user's process, and
560 clears the lazy flag to indicate that the data in the buffer is
563 If the value is zero-length, we avoid calling read_memory, which
564 would abort. We mark the value as fetched anyway -- all 0 bytes of
567 This function returns a value because it is used in the
568 value_contents macro as part of an expression, where a void would
569 not work. The value is ignored. */
572 value_fetch_lazy (struct value
*val
)
574 CORE_ADDR addr
= VALUE_ADDRESS (val
) + value_offset (val
);
575 int length
= TYPE_LENGTH (value_enclosing_type (val
));
577 struct type
*type
= value_type (val
);
579 read_memory (addr
, value_contents_all_raw (val
), length
);
581 set_value_lazy (val
, 0);
586 /* Store the contents of FROMVAL into the location of TOVAL.
587 Return a new value with the location of TOVAL and contents of FROMVAL. */
590 value_assign (struct value
*toval
, struct value
*fromval
)
594 struct frame_id old_frame
;
596 if (!deprecated_value_modifiable (toval
))
597 error (_("Left operand of assignment is not a modifiable lvalue."));
599 toval
= coerce_ref (toval
);
601 type
= value_type (toval
);
602 if (VALUE_LVAL (toval
) != lval_internalvar
)
604 toval
= value_coerce_to_target (toval
);
605 fromval
= value_cast (type
, fromval
);
609 /* Coerce arrays and functions to pointers, except for arrays
610 which only live in GDB's storage. */
611 if (!value_must_coerce_to_target (fromval
))
612 fromval
= coerce_array (fromval
);
615 CHECK_TYPEDEF (type
);
617 /* Since modifying a register can trash the frame chain, and
618 modifying memory can trash the frame cache, we save the old frame
619 and then restore the new frame afterwards. */
620 old_frame
= get_frame_id (deprecated_safe_get_selected_frame ());
622 switch (VALUE_LVAL (toval
))
624 case lval_internalvar
:
625 set_internalvar (VALUE_INTERNALVAR (toval
), fromval
);
626 val
= value_copy (VALUE_INTERNALVAR (toval
)->value
);
627 val
= value_change_enclosing_type (val
,
628 value_enclosing_type (fromval
));
629 set_value_embedded_offset (val
, value_embedded_offset (fromval
));
630 set_value_pointed_to_offset (val
,
631 value_pointed_to_offset (fromval
));
634 case lval_internalvar_component
:
635 set_internalvar_component (VALUE_INTERNALVAR (toval
),
636 value_offset (toval
),
637 value_bitpos (toval
),
638 value_bitsize (toval
),
644 const gdb_byte
*dest_buffer
;
645 CORE_ADDR changed_addr
;
647 gdb_byte buffer
[sizeof (LONGEST
)];
649 if (value_bitsize (toval
))
651 /* We assume that the argument to read_memory is in units
652 of host chars. FIXME: Is that correct? */
653 changed_len
= (value_bitpos (toval
)
654 + value_bitsize (toval
)
658 if (changed_len
> (int) sizeof (LONGEST
))
659 error (_("Can't handle bitfields which don't fit in a %d bit word."),
660 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
662 read_memory (VALUE_ADDRESS (toval
) + value_offset (toval
),
663 buffer
, changed_len
);
664 modify_field (buffer
, value_as_long (fromval
),
665 value_bitpos (toval
), value_bitsize (toval
));
666 changed_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
667 dest_buffer
= buffer
;
671 changed_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
672 changed_len
= TYPE_LENGTH (type
);
673 dest_buffer
= value_contents (fromval
);
676 write_memory (changed_addr
, dest_buffer
, changed_len
);
677 if (deprecated_memory_changed_hook
)
678 deprecated_memory_changed_hook (changed_addr
, changed_len
);
684 struct frame_info
*frame
;
687 /* Figure out which frame this is in currently. */
688 frame
= frame_find_by_id (VALUE_FRAME_ID (toval
));
689 value_reg
= VALUE_REGNUM (toval
);
692 error (_("Value being assigned to is no longer active."));
694 if (gdbarch_convert_register_p
695 (current_gdbarch
, VALUE_REGNUM (toval
), type
))
697 /* If TOVAL is a special machine register requiring
698 conversion of program values to a special raw
700 gdbarch_value_to_register (current_gdbarch
, frame
,
701 VALUE_REGNUM (toval
), type
,
702 value_contents (fromval
));
706 if (value_bitsize (toval
))
709 gdb_byte buffer
[sizeof (LONGEST
)];
711 changed_len
= (value_bitpos (toval
)
712 + value_bitsize (toval
)
716 if (changed_len
> (int) sizeof (LONGEST
))
717 error (_("Can't handle bitfields which don't fit in a %d bit word."),
718 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
720 get_frame_register_bytes (frame
, value_reg
,
721 value_offset (toval
),
722 changed_len
, buffer
);
724 modify_field (buffer
, value_as_long (fromval
),
725 value_bitpos (toval
),
726 value_bitsize (toval
));
728 put_frame_register_bytes (frame
, value_reg
,
729 value_offset (toval
),
730 changed_len
, buffer
);
734 put_frame_register_bytes (frame
, value_reg
,
735 value_offset (toval
),
737 value_contents (fromval
));
741 if (deprecated_register_changed_hook
)
742 deprecated_register_changed_hook (-1);
743 observer_notify_target_changed (¤t_target
);
748 error (_("Left operand of assignment is not an lvalue."));
751 /* Assigning to the stack pointer, frame pointer, and other
752 (architecture and calling convention specific) registers may
753 cause the frame cache to be out of date. Assigning to memory
754 also can. We just do this on all assignments to registers or
755 memory, for simplicity's sake; I doubt the slowdown matters. */
756 switch (VALUE_LVAL (toval
))
761 reinit_frame_cache ();
763 /* Having destroyed the frame cache, restore the selected
766 /* FIXME: cagney/2002-11-02: There has to be a better way of
767 doing this. Instead of constantly saving/restoring the
768 frame. Why not create a get_selected_frame() function that,
769 having saved the selected frame's ID can automatically
770 re-find the previously selected frame automatically. */
773 struct frame_info
*fi
= frame_find_by_id (old_frame
);
783 /* If the field does not entirely fill a LONGEST, then zero the sign
784 bits. If the field is signed, and is negative, then sign
786 if ((value_bitsize (toval
) > 0)
787 && (value_bitsize (toval
) < 8 * (int) sizeof (LONGEST
)))
789 LONGEST fieldval
= value_as_long (fromval
);
790 LONGEST valmask
= (((ULONGEST
) 1) << value_bitsize (toval
)) - 1;
793 if (!TYPE_UNSIGNED (type
)
794 && (fieldval
& (valmask
^ (valmask
>> 1))))
795 fieldval
|= ~valmask
;
797 fromval
= value_from_longest (type
, fieldval
);
800 val
= value_copy (toval
);
801 memcpy (value_contents_raw (val
), value_contents (fromval
),
803 deprecated_set_value_type (val
, type
);
804 val
= value_change_enclosing_type (val
,
805 value_enclosing_type (fromval
));
806 set_value_embedded_offset (val
, value_embedded_offset (fromval
));
807 set_value_pointed_to_offset (val
, value_pointed_to_offset (fromval
));
812 /* Extend a value VAL to COUNT repetitions of its type. */
815 value_repeat (struct value
*arg1
, int count
)
819 if (VALUE_LVAL (arg1
) != lval_memory
)
820 error (_("Only values in memory can be extended with '@'."));
822 error (_("Invalid number %d of repetitions."), count
);
824 val
= allocate_repeat_value (value_enclosing_type (arg1
), count
);
826 read_memory (VALUE_ADDRESS (arg1
) + value_offset (arg1
),
827 value_contents_all_raw (val
),
828 TYPE_LENGTH (value_enclosing_type (val
)));
829 VALUE_LVAL (val
) = lval_memory
;
830 VALUE_ADDRESS (val
) = VALUE_ADDRESS (arg1
) + value_offset (arg1
);
836 value_of_variable (struct symbol
*var
, struct block
*b
)
839 struct frame_info
*frame
= NULL
;
842 frame
= NULL
; /* Use selected frame. */
843 else if (symbol_read_needs_frame (var
))
845 frame
= block_innermost_frame (b
);
848 if (BLOCK_FUNCTION (b
)
849 && SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b
)))
850 error (_("No frame is currently executing in block %s."),
851 SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b
)));
853 error (_("No frame is currently executing in specified block"));
857 val
= read_var_value (var
, frame
);
859 error (_("Address of symbol \"%s\" is unknown."), SYMBOL_PRINT_NAME (var
));
864 /* Return one if VAL does not live in target memory, but should in order
865 to operate on it. Otherwise return zero. */
868 value_must_coerce_to_target (struct value
*val
)
870 struct type
*valtype
;
872 /* The only lval kinds which do not live in target memory. */
873 if (VALUE_LVAL (val
) != not_lval
874 && VALUE_LVAL (val
) != lval_internalvar
)
877 valtype
= check_typedef (value_type (val
));
879 switch (TYPE_CODE (valtype
))
881 case TYPE_CODE_ARRAY
:
882 case TYPE_CODE_STRING
:
889 /* Make sure that VAL lives in target memory if it's supposed to. For instance,
890 strings are constructed as character arrays in GDB's storage, and this
891 function copies them to the target. */
894 value_coerce_to_target (struct value
*val
)
899 if (!value_must_coerce_to_target (val
))
902 length
= TYPE_LENGTH (check_typedef (value_type (val
)));
903 addr
= allocate_space_in_inferior (length
);
904 write_memory (addr
, value_contents (val
), length
);
905 return value_at_lazy (value_type (val
), addr
);
908 /* Given a value which is an array, return a value which is a pointer
909 to its first element, regardless of whether or not the array has a
912 FIXME: A previous comment here indicated that this routine should
913 be substracting the array's lower bound. It's not clear to me that
914 this is correct. Given an array subscripting operation, it would
915 certainly work to do the adjustment here, essentially computing:
917 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
919 However I believe a more appropriate and logical place to account
920 for the lower bound is to do so in value_subscript, essentially
923 (&array[0] + ((index - lowerbound) * sizeof array[0]))
925 As further evidence consider what would happen with operations
926 other than array subscripting, where the caller would get back a
927 value that had an address somewhere before the actual first element
928 of the array, and the information about the lower bound would be
929 lost because of the coercion to pointer type.
933 value_coerce_array (struct value
*arg1
)
935 struct type
*type
= check_typedef (value_type (arg1
));
937 /* If the user tries to do something requiring a pointer with an
938 array that has not yet been pushed to the target, then this would
939 be a good time to do so. */
940 arg1
= value_coerce_to_target (arg1
);
942 if (VALUE_LVAL (arg1
) != lval_memory
)
943 error (_("Attempt to take address of value not located in memory."));
945 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
946 (VALUE_ADDRESS (arg1
) + value_offset (arg1
)));
949 /* Given a value which is a function, return a value which is a pointer
953 value_coerce_function (struct value
*arg1
)
955 struct value
*retval
;
957 if (VALUE_LVAL (arg1
) != lval_memory
)
958 error (_("Attempt to take address of value not located in memory."));
960 retval
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
961 (VALUE_ADDRESS (arg1
) + value_offset (arg1
)));
965 /* Return a pointer value for the object for which ARG1 is the
969 value_addr (struct value
*arg1
)
973 struct type
*type
= check_typedef (value_type (arg1
));
974 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
976 /* Copy the value, but change the type from (T&) to (T*). We
977 keep the same location information, which is efficient, and
978 allows &(&X) to get the location containing the reference. */
979 arg2
= value_copy (arg1
);
980 deprecated_set_value_type (arg2
,
981 lookup_pointer_type (TYPE_TARGET_TYPE (type
)));
984 if (TYPE_CODE (type
) == TYPE_CODE_FUNC
)
985 return value_coerce_function (arg1
);
987 /* If this is an array that has not yet been pushed to the target,
988 then this would be a good time to force it to memory. */
989 arg1
= value_coerce_to_target (arg1
);
991 if (VALUE_LVAL (arg1
) != lval_memory
)
992 error (_("Attempt to take address of value not located in memory."));
994 /* Get target memory address */
995 arg2
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
996 (VALUE_ADDRESS (arg1
)
997 + value_offset (arg1
)
998 + value_embedded_offset (arg1
)));
1000 /* This may be a pointer to a base subobject; so remember the
1001 full derived object's type ... */
1002 arg2
= value_change_enclosing_type (arg2
, lookup_pointer_type (value_enclosing_type (arg1
)));
1003 /* ... and also the relative position of the subobject in the full
1005 set_value_pointed_to_offset (arg2
, value_embedded_offset (arg1
));
1009 /* Return a reference value for the object for which ARG1 is the
1013 value_ref (struct value
*arg1
)
1017 struct type
*type
= check_typedef (value_type (arg1
));
1018 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
1021 arg2
= value_addr (arg1
);
1022 deprecated_set_value_type (arg2
, lookup_reference_type (type
));
1026 /* Given a value of a pointer type, apply the C unary * operator to
1030 value_ind (struct value
*arg1
)
1032 struct type
*base_type
;
1035 arg1
= coerce_array (arg1
);
1037 base_type
= check_typedef (value_type (arg1
));
1039 /* Allow * on an integer so we can cast it to whatever we want.
1040 This returns an int, which seems like the most C-like thing to
1041 do. "long long" variables are rare enough that
1042 BUILTIN_TYPE_LONGEST would seem to be a mistake. */
1043 if (TYPE_CODE (base_type
) == TYPE_CODE_INT
)
1044 return value_at_lazy (builtin_type_int
,
1045 (CORE_ADDR
) value_as_address (arg1
));
1046 else if (TYPE_CODE (base_type
) == TYPE_CODE_PTR
)
1048 struct type
*enc_type
;
1049 /* We may be pointing to something embedded in a larger object.
1050 Get the real type of the enclosing object. */
1051 enc_type
= check_typedef (value_enclosing_type (arg1
));
1052 enc_type
= TYPE_TARGET_TYPE (enc_type
);
1054 if (TYPE_CODE (check_typedef (enc_type
)) == TYPE_CODE_FUNC
1055 || TYPE_CODE (check_typedef (enc_type
)) == TYPE_CODE_METHOD
)
1056 /* For functions, go through find_function_addr, which knows
1057 how to handle function descriptors. */
1058 arg2
= value_at_lazy (enc_type
,
1059 find_function_addr (arg1
, NULL
));
1061 /* Retrieve the enclosing object pointed to */
1062 arg2
= value_at_lazy (enc_type
,
1063 (value_as_address (arg1
)
1064 - value_pointed_to_offset (arg1
)));
1066 /* Re-adjust type. */
1067 deprecated_set_value_type (arg2
, TYPE_TARGET_TYPE (base_type
));
1068 /* Add embedding info. */
1069 arg2
= value_change_enclosing_type (arg2
, enc_type
);
1070 set_value_embedded_offset (arg2
, value_pointed_to_offset (arg1
));
1072 /* We may be pointing to an object of some derived type. */
1073 arg2
= value_full_object (arg2
, NULL
, 0, 0, 0);
1077 error (_("Attempt to take contents of a non-pointer value."));
1078 return 0; /* For lint -- never reached. */
1081 /* Create a value for an array by allocating space in GDB, copying
1082 copying the data into that space, and then setting up an array
1085 The array bounds are set from LOWBOUND and HIGHBOUND, and the array
1086 is populated from the values passed in ELEMVEC.
1088 The element type of the array is inherited from the type of the
1089 first element, and all elements must have the same size (though we
1090 don't currently enforce any restriction on their types). */
1093 value_array (int lowbound
, int highbound
, struct value
**elemvec
)
1097 unsigned int typelength
;
1099 struct type
*rangetype
;
1100 struct type
*arraytype
;
1103 /* Validate that the bounds are reasonable and that each of the
1104 elements have the same size. */
1106 nelem
= highbound
- lowbound
+ 1;
1109 error (_("bad array bounds (%d, %d)"), lowbound
, highbound
);
1111 typelength
= TYPE_LENGTH (value_enclosing_type (elemvec
[0]));
1112 for (idx
= 1; idx
< nelem
; idx
++)
1114 if (TYPE_LENGTH (value_enclosing_type (elemvec
[idx
])) != typelength
)
1116 error (_("array elements must all be the same size"));
1120 rangetype
= create_range_type ((struct type
*) NULL
,
1122 lowbound
, highbound
);
1123 arraytype
= create_array_type ((struct type
*) NULL
,
1124 value_enclosing_type (elemvec
[0]),
1127 if (!current_language
->c_style_arrays
)
1129 val
= allocate_value (arraytype
);
1130 for (idx
= 0; idx
< nelem
; idx
++)
1132 memcpy (value_contents_all_raw (val
) + (idx
* typelength
),
1133 value_contents_all (elemvec
[idx
]),
1139 /* Allocate space to store the array, and then initialize it by
1140 copying in each element. */
1142 val
= allocate_value (arraytype
);
1143 for (idx
= 0; idx
< nelem
; idx
++)
1144 memcpy (value_contents_writeable (val
) + (idx
* typelength
),
1145 value_contents_all (elemvec
[idx
]),
1150 /* Create a value for a string constant by allocating space in the
1151 inferior, copying the data into that space, and returning the
1152 address with type TYPE_CODE_STRING. PTR points to the string
1153 constant data; LEN is number of characters.
1155 Note that string types are like array of char types with a lower
1156 bound of zero and an upper bound of LEN - 1. Also note that the
1157 string may contain embedded null bytes. */
1160 value_string (char *ptr
, int len
)
1163 int lowbound
= current_language
->string_lower_bound
;
1164 struct type
*rangetype
= create_range_type ((struct type
*) NULL
,
1167 len
+ lowbound
- 1);
1168 struct type
*stringtype
1169 = create_string_type ((struct type
*) NULL
, rangetype
);
1172 if (current_language
->c_style_arrays
== 0)
1174 val
= allocate_value (stringtype
);
1175 memcpy (value_contents_raw (val
), ptr
, len
);
1180 /* Allocate space to store the string in the inferior, and then copy
1181 LEN bytes from PTR in gdb to that address in the inferior. */
1183 addr
= allocate_space_in_inferior (len
);
1184 write_memory (addr
, (gdb_byte
*) ptr
, len
);
1186 val
= value_at_lazy (stringtype
, addr
);
1191 value_bitstring (char *ptr
, int len
)
1194 struct type
*domain_type
= create_range_type (NULL
,
1197 struct type
*type
= create_set_type ((struct type
*) NULL
,
1199 TYPE_CODE (type
) = TYPE_CODE_BITSTRING
;
1200 val
= allocate_value (type
);
1201 memcpy (value_contents_raw (val
), ptr
, TYPE_LENGTH (type
));
1205 /* See if we can pass arguments in T2 to a function which takes
1206 arguments of types T1. T1 is a list of NARGS arguments, and T2 is
1207 a NULL-terminated vector. If some arguments need coercion of some
1208 sort, then the coerced values are written into T2. Return value is
1209 0 if the arguments could be matched, or the position at which they
1212 STATICP is nonzero if the T1 argument list came from a static
1213 member function. T2 will still include the ``this'' pointer, but
1216 For non-static member functions, we ignore the first argument,
1217 which is the type of the instance variable. This is because we
1218 want to handle calls with objects from derived classes. This is
1219 not entirely correct: we should actually check to make sure that a
1220 requested operation is type secure, shouldn't we? FIXME. */
1223 typecmp (int staticp
, int varargs
, int nargs
,
1224 struct field t1
[], struct value
*t2
[])
1229 internal_error (__FILE__
, __LINE__
,
1230 _("typecmp: no argument list"));
1232 /* Skip ``this'' argument if applicable. T2 will always include
1238 (i
< nargs
) && TYPE_CODE (t1
[i
].type
) != TYPE_CODE_VOID
;
1241 struct type
*tt1
, *tt2
;
1246 tt1
= check_typedef (t1
[i
].type
);
1247 tt2
= check_typedef (value_type (t2
[i
]));
1249 if (TYPE_CODE (tt1
) == TYPE_CODE_REF
1250 /* We should be doing hairy argument matching, as below. */
1251 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1
))) == TYPE_CODE (tt2
)))
1253 if (TYPE_CODE (tt2
) == TYPE_CODE_ARRAY
)
1254 t2
[i
] = value_coerce_array (t2
[i
]);
1256 t2
[i
] = value_ref (t2
[i
]);
1260 /* djb - 20000715 - Until the new type structure is in the
1261 place, and we can attempt things like implicit conversions,
1262 we need to do this so you can take something like a map<const
1263 char *>, and properly access map["hello"], because the
1264 argument to [] will be a reference to a pointer to a char,
1265 and the argument will be a pointer to a char. */
1266 while (TYPE_CODE(tt1
) == TYPE_CODE_REF
1267 || TYPE_CODE (tt1
) == TYPE_CODE_PTR
)
1269 tt1
= check_typedef( TYPE_TARGET_TYPE(tt1
) );
1271 while (TYPE_CODE(tt2
) == TYPE_CODE_ARRAY
1272 || TYPE_CODE(tt2
) == TYPE_CODE_PTR
1273 || TYPE_CODE(tt2
) == TYPE_CODE_REF
)
1275 tt2
= check_typedef (TYPE_TARGET_TYPE(tt2
));
1277 if (TYPE_CODE (tt1
) == TYPE_CODE (tt2
))
1279 /* Array to pointer is a `trivial conversion' according to the
1282 /* We should be doing much hairier argument matching (see
1283 section 13.2 of the ARM), but as a quick kludge, just check
1284 for the same type code. */
1285 if (TYPE_CODE (t1
[i
].type
) != TYPE_CODE (value_type (t2
[i
])))
1288 if (varargs
|| t2
[i
] == NULL
)
1293 /* Helper function used by value_struct_elt to recurse through
1294 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1295 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1296 TYPE. If found, return value, else return NULL.
1298 If LOOKING_FOR_BASECLASS, then instead of looking for struct
1299 fields, look for a baseclass named NAME. */
1301 static struct value
*
1302 search_struct_field (char *name
, struct value
*arg1
, int offset
,
1303 struct type
*type
, int looking_for_baseclass
)
1306 int nbases
= TYPE_N_BASECLASSES (type
);
1308 CHECK_TYPEDEF (type
);
1310 if (!looking_for_baseclass
)
1311 for (i
= TYPE_NFIELDS (type
) - 1; i
>= nbases
; i
--)
1313 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
1315 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1318 if (TYPE_FIELD_STATIC (type
, i
))
1320 v
= value_static_field (type
, i
);
1322 error (_("field %s is nonexistent or has been optimised out"),
1327 v
= value_primitive_field (arg1
, offset
, i
, type
);
1329 error (_("there is no field named %s"), name
);
1335 && (t_field_name
[0] == '\0'
1336 || (TYPE_CODE (type
) == TYPE_CODE_UNION
1337 && (strcmp_iw (t_field_name
, "else") == 0))))
1339 struct type
*field_type
= TYPE_FIELD_TYPE (type
, i
);
1340 if (TYPE_CODE (field_type
) == TYPE_CODE_UNION
1341 || TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
)
1343 /* Look for a match through the fields of an anonymous
1344 union, or anonymous struct. C++ provides anonymous
1347 In the GNU Chill (now deleted from GDB)
1348 implementation of variant record types, each
1349 <alternative field> has an (anonymous) union type,
1350 each member of the union represents a <variant
1351 alternative>. Each <variant alternative> is
1352 represented as a struct, with a member for each
1356 int new_offset
= offset
;
1358 /* This is pretty gross. In G++, the offset in an
1359 anonymous union is relative to the beginning of the
1360 enclosing struct. In the GNU Chill (now deleted
1361 from GDB) implementation of variant records, the
1362 bitpos is zero in an anonymous union field, so we
1363 have to add the offset of the union here. */
1364 if (TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
1365 || (TYPE_NFIELDS (field_type
) > 0
1366 && TYPE_FIELD_BITPOS (field_type
, 0) == 0))
1367 new_offset
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
1369 v
= search_struct_field (name
, arg1
, new_offset
,
1371 looking_for_baseclass
);
1378 for (i
= 0; i
< nbases
; i
++)
1381 struct type
*basetype
= check_typedef (TYPE_BASECLASS (type
, i
));
1382 /* If we are looking for baseclasses, this is what we get when
1383 we hit them. But it could happen that the base part's member
1384 name is not yet filled in. */
1385 int found_baseclass
= (looking_for_baseclass
1386 && TYPE_BASECLASS_NAME (type
, i
) != NULL
1387 && (strcmp_iw (name
,
1388 TYPE_BASECLASS_NAME (type
,
1391 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1394 struct value
*v2
= allocate_value (basetype
);
1396 boffset
= baseclass_offset (type
, i
,
1397 value_contents (arg1
) + offset
,
1398 VALUE_ADDRESS (arg1
)
1399 + value_offset (arg1
) + offset
);
1401 error (_("virtual baseclass botch"));
1403 /* The virtual base class pointer might have been clobbered
1404 by the user program. Make sure that it still points to a
1405 valid memory location. */
1408 if (boffset
< 0 || boffset
>= TYPE_LENGTH (type
))
1410 CORE_ADDR base_addr
;
1413 VALUE_ADDRESS (arg1
) + value_offset (arg1
) + boffset
;
1414 if (target_read_memory (base_addr
,
1415 value_contents_raw (v2
),
1416 TYPE_LENGTH (basetype
)) != 0)
1417 error (_("virtual baseclass botch"));
1418 VALUE_LVAL (v2
) = lval_memory
;
1419 VALUE_ADDRESS (v2
) = base_addr
;
1423 VALUE_LVAL (v2
) = VALUE_LVAL (arg1
);
1424 VALUE_ADDRESS (v2
) = VALUE_ADDRESS (arg1
);
1425 VALUE_FRAME_ID (v2
) = VALUE_FRAME_ID (arg1
);
1426 set_value_offset (v2
, value_offset (arg1
) + boffset
);
1427 if (value_lazy (arg1
))
1428 set_value_lazy (v2
, 1);
1430 memcpy (value_contents_raw (v2
),
1431 value_contents_raw (arg1
) + boffset
,
1432 TYPE_LENGTH (basetype
));
1435 if (found_baseclass
)
1437 v
= search_struct_field (name
, v2
, 0,
1438 TYPE_BASECLASS (type
, i
),
1439 looking_for_baseclass
);
1441 else if (found_baseclass
)
1442 v
= value_primitive_field (arg1
, offset
, i
, type
);
1444 v
= search_struct_field (name
, arg1
,
1445 offset
+ TYPE_BASECLASS_BITPOS (type
,
1447 basetype
, looking_for_baseclass
);
1454 /* Helper function used by value_struct_elt to recurse through
1455 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1456 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1459 If found, return value, else if name matched and args not return
1460 (value) -1, else return NULL. */
1462 static struct value
*
1463 search_struct_method (char *name
, struct value
**arg1p
,
1464 struct value
**args
, int offset
,
1465 int *static_memfuncp
, struct type
*type
)
1469 int name_matched
= 0;
1470 char dem_opname
[64];
1472 CHECK_TYPEDEF (type
);
1473 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
1475 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
1476 /* FIXME! May need to check for ARM demangling here */
1477 if (strncmp (t_field_name
, "__", 2) == 0 ||
1478 strncmp (t_field_name
, "op", 2) == 0 ||
1479 strncmp (t_field_name
, "type", 4) == 0)
1481 if (cplus_demangle_opname (t_field_name
, dem_opname
, DMGL_ANSI
))
1482 t_field_name
= dem_opname
;
1483 else if (cplus_demangle_opname (t_field_name
, dem_opname
, 0))
1484 t_field_name
= dem_opname
;
1486 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1488 int j
= TYPE_FN_FIELDLIST_LENGTH (type
, i
) - 1;
1489 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
1492 check_stub_method_group (type
, i
);
1493 if (j
> 0 && args
== 0)
1494 error (_("cannot resolve overloaded method `%s': no arguments supplied"), name
);
1495 else if (j
== 0 && args
== 0)
1497 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
1504 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f
, j
),
1505 TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f
, j
)),
1506 TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f
, j
)),
1507 TYPE_FN_FIELD_ARGS (f
, j
), args
))
1509 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
1510 return value_virtual_fn_field (arg1p
, f
, j
,
1512 if (TYPE_FN_FIELD_STATIC_P (f
, j
)
1514 *static_memfuncp
= 1;
1515 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
1524 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
1528 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1530 struct type
*baseclass
= check_typedef (TYPE_BASECLASS (type
, i
));
1531 const gdb_byte
*base_valaddr
;
1533 /* The virtual base class pointer might have been
1534 clobbered by the user program. Make sure that it
1535 still points to a valid memory location. */
1537 if (offset
< 0 || offset
>= TYPE_LENGTH (type
))
1539 gdb_byte
*tmp
= alloca (TYPE_LENGTH (baseclass
));
1540 if (target_read_memory (VALUE_ADDRESS (*arg1p
)
1541 + value_offset (*arg1p
) + offset
,
1542 tmp
, TYPE_LENGTH (baseclass
)) != 0)
1543 error (_("virtual baseclass botch"));
1547 base_valaddr
= value_contents (*arg1p
) + offset
;
1549 base_offset
= baseclass_offset (type
, i
, base_valaddr
,
1550 VALUE_ADDRESS (*arg1p
)
1551 + value_offset (*arg1p
) + offset
);
1552 if (base_offset
== -1)
1553 error (_("virtual baseclass botch"));
1557 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
1559 v
= search_struct_method (name
, arg1p
, args
, base_offset
+ offset
,
1560 static_memfuncp
, TYPE_BASECLASS (type
, i
));
1561 if (v
== (struct value
*) - 1)
1567 /* FIXME-bothner: Why is this commented out? Why is it here? */
1568 /* *arg1p = arg1_tmp; */
1573 return (struct value
*) - 1;
1578 /* Given *ARGP, a value of type (pointer to a)* structure/union,
1579 extract the component named NAME from the ultimate target
1580 structure/union and return it as a value with its appropriate type.
1581 ERR is used in the error message if *ARGP's type is wrong.
1583 C++: ARGS is a list of argument types to aid in the selection of
1584 an appropriate method. Also, handle derived types.
1586 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
1587 where the truthvalue of whether the function that was resolved was
1588 a static member function or not is stored.
1590 ERR is an error message to be printed in case the field is not
1594 value_struct_elt (struct value
**argp
, struct value
**args
,
1595 char *name
, int *static_memfuncp
, char *err
)
1600 *argp
= coerce_array (*argp
);
1602 t
= check_typedef (value_type (*argp
));
1604 /* Follow pointers until we get to a non-pointer. */
1606 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
1608 *argp
= value_ind (*argp
);
1609 /* Don't coerce fn pointer to fn and then back again! */
1610 if (TYPE_CODE (value_type (*argp
)) != TYPE_CODE_FUNC
)
1611 *argp
= coerce_array (*argp
);
1612 t
= check_typedef (value_type (*argp
));
1615 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
1616 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
1617 error (_("Attempt to extract a component of a value that is not a %s."), err
);
1619 /* Assume it's not, unless we see that it is. */
1620 if (static_memfuncp
)
1621 *static_memfuncp
= 0;
1625 /* if there are no arguments ...do this... */
1627 /* Try as a field first, because if we succeed, there is less
1629 v
= search_struct_field (name
, *argp
, 0, t
, 0);
1633 /* C++: If it was not found as a data field, then try to
1634 return it as a pointer to a method. */
1636 if (destructor_name_p (name
, t
))
1637 error (_("Cannot get value of destructor"));
1639 v
= search_struct_method (name
, argp
, args
, 0,
1640 static_memfuncp
, t
);
1642 if (v
== (struct value
*) - 1)
1643 error (_("Cannot take address of method %s."), name
);
1646 if (TYPE_NFN_FIELDS (t
))
1647 error (_("There is no member or method named %s."), name
);
1649 error (_("There is no member named %s."), name
);
1654 if (destructor_name_p (name
, t
))
1658 /* Destructors are a special case. */
1659 int m_index
, f_index
;
1662 if (get_destructor_fn_field (t
, &m_index
, &f_index
))
1664 v
= value_fn_field (NULL
,
1665 TYPE_FN_FIELDLIST1 (t
, m_index
),
1669 error (_("could not find destructor function named %s."),
1676 error (_("destructor should not have any argument"));
1680 v
= search_struct_method (name
, argp
, args
, 0,
1681 static_memfuncp
, t
);
1683 if (v
== (struct value
*) - 1)
1685 error (_("One of the arguments you tried to pass to %s could not be converted to what the function wants."), name
);
1689 /* See if user tried to invoke data as function. If so, hand it
1690 back. If it's not callable (i.e., a pointer to function),
1691 gdb should give an error. */
1692 v
= search_struct_field (name
, *argp
, 0, t
, 0);
1696 error (_("Structure has no component named %s."), name
);
1700 /* Search through the methods of an object (and its bases) to find a
1701 specified method. Return the pointer to the fn_field list of
1702 overloaded instances.
1704 Helper function for value_find_oload_list.
1705 ARGP is a pointer to a pointer to a value (the object).
1706 METHOD is a string containing the method name.
1707 OFFSET is the offset within the value.
1708 TYPE is the assumed type of the object.
1709 NUM_FNS is the number of overloaded instances.
1710 BASETYPE is set to the actual type of the subobject where the
1712 BOFFSET is the offset of the base subobject where the method is found.
1715 static struct fn_field
*
1716 find_method_list (struct value
**argp
, char *method
,
1717 int offset
, struct type
*type
, int *num_fns
,
1718 struct type
**basetype
, int *boffset
)
1722 CHECK_TYPEDEF (type
);
1726 /* First check in object itself. */
1727 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
1729 /* pai: FIXME What about operators and type conversions? */
1730 char *fn_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
1731 if (fn_field_name
&& (strcmp_iw (fn_field_name
, method
) == 0))
1733 int len
= TYPE_FN_FIELDLIST_LENGTH (type
, i
);
1734 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
1740 /* Resolve any stub methods. */
1741 check_stub_method_group (type
, i
);
1747 /* Not found in object, check in base subobjects. */
1748 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
1751 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1753 base_offset
= value_offset (*argp
) + offset
;
1754 base_offset
= baseclass_offset (type
, i
,
1755 value_contents (*argp
) + base_offset
,
1756 VALUE_ADDRESS (*argp
) + base_offset
);
1757 if (base_offset
== -1)
1758 error (_("virtual baseclass botch"));
1760 else /* Non-virtual base, simply use bit position from debug
1763 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
1765 f
= find_method_list (argp
, method
, base_offset
+ offset
,
1766 TYPE_BASECLASS (type
, i
), num_fns
,
1774 /* Return the list of overloaded methods of a specified name.
1776 ARGP is a pointer to a pointer to a value (the object).
1777 METHOD is the method name.
1778 OFFSET is the offset within the value contents.
1779 NUM_FNS is the number of overloaded instances.
1780 BASETYPE is set to the type of the base subobject that defines the
1782 BOFFSET is the offset of the base subobject which defines the method.
1786 value_find_oload_method_list (struct value
**argp
, char *method
,
1787 int offset
, int *num_fns
,
1788 struct type
**basetype
, int *boffset
)
1792 t
= check_typedef (value_type (*argp
));
1794 /* Code snarfed from value_struct_elt. */
1795 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
1797 *argp
= value_ind (*argp
);
1798 /* Don't coerce fn pointer to fn and then back again! */
1799 if (TYPE_CODE (value_type (*argp
)) != TYPE_CODE_FUNC
)
1800 *argp
= coerce_array (*argp
);
1801 t
= check_typedef (value_type (*argp
));
1804 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
1805 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
1806 error (_("Attempt to extract a component of a value that is not a struct or union"));
1808 return find_method_list (argp
, method
, 0, t
, num_fns
,
1812 /* Given an array of argument types (ARGTYPES) (which includes an
1813 entry for "this" in the case of C++ methods), the number of
1814 arguments NARGS, the NAME of a function whether it's a method or
1815 not (METHOD), and the degree of laxness (LAX) in conforming to
1816 overload resolution rules in ANSI C++, find the best function that
1817 matches on the argument types according to the overload resolution
1820 In the case of class methods, the parameter OBJ is an object value
1821 in which to search for overloaded methods.
1823 In the case of non-method functions, the parameter FSYM is a symbol
1824 corresponding to one of the overloaded functions.
1826 Return value is an integer: 0 -> good match, 10 -> debugger applied
1827 non-standard coercions, 100 -> incompatible.
1829 If a method is being searched for, VALP will hold the value.
1830 If a non-method is being searched for, SYMP will hold the symbol
1833 If a method is being searched for, and it is a static method,
1834 then STATICP will point to a non-zero value.
1836 Note: This function does *not* check the value of
1837 overload_resolution. Caller must check it to see whether overload
1838 resolution is permitted.
1842 find_overload_match (struct type
**arg_types
, int nargs
,
1843 char *name
, int method
, int lax
,
1844 struct value
**objp
, struct symbol
*fsym
,
1845 struct value
**valp
, struct symbol
**symp
,
1848 struct value
*obj
= (objp
? *objp
: NULL
);
1849 /* Index of best overloaded function. */
1851 /* The measure for the current best match. */
1852 struct badness_vector
*oload_champ_bv
= NULL
;
1853 struct value
*temp
= obj
;
1854 /* For methods, the list of overloaded methods. */
1855 struct fn_field
*fns_ptr
= NULL
;
1856 /* For non-methods, the list of overloaded function symbols. */
1857 struct symbol
**oload_syms
= NULL
;
1858 /* Number of overloaded instances being considered. */
1860 struct type
*basetype
= NULL
;
1864 struct cleanup
*old_cleanups
= NULL
;
1866 const char *obj_type_name
= NULL
;
1867 char *func_name
= NULL
;
1868 enum oload_classification match_quality
;
1870 /* Get the list of overloaded methods or functions. */
1874 obj_type_name
= TYPE_NAME (value_type (obj
));
1875 /* Hack: evaluate_subexp_standard often passes in a pointer
1876 value rather than the object itself, so try again. */
1877 if ((!obj_type_name
|| !*obj_type_name
)
1878 && (TYPE_CODE (value_type (obj
)) == TYPE_CODE_PTR
))
1879 obj_type_name
= TYPE_NAME (TYPE_TARGET_TYPE (value_type (obj
)));
1881 fns_ptr
= value_find_oload_method_list (&temp
, name
,
1883 &basetype
, &boffset
);
1884 if (!fns_ptr
|| !num_fns
)
1885 error (_("Couldn't find method %s%s%s"),
1887 (obj_type_name
&& *obj_type_name
) ? "::" : "",
1889 /* If we are dealing with stub method types, they should have
1890 been resolved by find_method_list via
1891 value_find_oload_method_list above. */
1892 gdb_assert (TYPE_DOMAIN_TYPE (fns_ptr
[0].type
) != NULL
);
1893 oload_champ
= find_oload_champ (arg_types
, nargs
, method
,
1895 oload_syms
, &oload_champ_bv
);
1899 const char *qualified_name
= SYMBOL_CPLUS_DEMANGLED_NAME (fsym
);
1901 /* If we have a C++ name, try to extract just the function
1904 func_name
= cp_func_name (qualified_name
);
1906 /* If there was no C++ name, this must be a C-style function.
1907 Just return the same symbol. Do the same if cp_func_name
1908 fails for some reason. */
1909 if (func_name
== NULL
)
1915 old_cleanups
= make_cleanup (xfree
, func_name
);
1916 make_cleanup (xfree
, oload_syms
);
1917 make_cleanup (xfree
, oload_champ_bv
);
1919 oload_champ
= find_oload_champ_namespace (arg_types
, nargs
,
1926 /* Check how bad the best match is. */
1929 classify_oload_match (oload_champ_bv
, nargs
,
1930 oload_method_static (method
, fns_ptr
,
1933 if (match_quality
== INCOMPATIBLE
)
1936 error (_("Cannot resolve method %s%s%s to any overloaded instance"),
1938 (obj_type_name
&& *obj_type_name
) ? "::" : "",
1941 error (_("Cannot resolve function %s to any overloaded instance"),
1944 else if (match_quality
== NON_STANDARD
)
1947 warning (_("Using non-standard conversion to match method %s%s%s to supplied arguments"),
1949 (obj_type_name
&& *obj_type_name
) ? "::" : "",
1952 warning (_("Using non-standard conversion to match function %s to supplied arguments"),
1958 if (staticp
!= NULL
)
1959 *staticp
= oload_method_static (method
, fns_ptr
, oload_champ
);
1960 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr
, oload_champ
))
1961 *valp
= value_virtual_fn_field (&temp
, fns_ptr
, oload_champ
,
1964 *valp
= value_fn_field (&temp
, fns_ptr
, oload_champ
,
1969 *symp
= oload_syms
[oload_champ
];
1974 if (TYPE_CODE (value_type (temp
)) != TYPE_CODE_PTR
1975 && TYPE_CODE (value_type (*objp
)) == TYPE_CODE_PTR
)
1977 temp
= value_addr (temp
);
1981 if (old_cleanups
!= NULL
)
1982 do_cleanups (old_cleanups
);
1984 switch (match_quality
)
1990 default: /* STANDARD */
1995 /* Find the best overload match, searching for FUNC_NAME in namespaces
1996 contained in QUALIFIED_NAME until it either finds a good match or
1997 runs out of namespaces. It stores the overloaded functions in
1998 *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. The
1999 calling function is responsible for freeing *OLOAD_SYMS and
2003 find_oload_champ_namespace (struct type
**arg_types
, int nargs
,
2004 const char *func_name
,
2005 const char *qualified_name
,
2006 struct symbol
***oload_syms
,
2007 struct badness_vector
**oload_champ_bv
)
2011 find_oload_champ_namespace_loop (arg_types
, nargs
,
2014 oload_syms
, oload_champ_bv
,
2020 /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is
2021 how deep we've looked for namespaces, and the champ is stored in
2022 OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0
2025 It is the caller's responsibility to free *OLOAD_SYMS and
2029 find_oload_champ_namespace_loop (struct type
**arg_types
, int nargs
,
2030 const char *func_name
,
2031 const char *qualified_name
,
2033 struct symbol
***oload_syms
,
2034 struct badness_vector
**oload_champ_bv
,
2037 int next_namespace_len
= namespace_len
;
2038 int searched_deeper
= 0;
2040 struct cleanup
*old_cleanups
;
2041 int new_oload_champ
;
2042 struct symbol
**new_oload_syms
;
2043 struct badness_vector
*new_oload_champ_bv
;
2044 char *new_namespace
;
2046 if (next_namespace_len
!= 0)
2048 gdb_assert (qualified_name
[next_namespace_len
] == ':');
2049 next_namespace_len
+= 2;
2051 next_namespace_len
+=
2052 cp_find_first_component (qualified_name
+ next_namespace_len
);
2054 /* Initialize these to values that can safely be xfree'd. */
2056 *oload_champ_bv
= NULL
;
2058 /* First, see if we have a deeper namespace we can search in.
2059 If we get a good match there, use it. */
2061 if (qualified_name
[next_namespace_len
] == ':')
2063 searched_deeper
= 1;
2065 if (find_oload_champ_namespace_loop (arg_types
, nargs
,
2066 func_name
, qualified_name
,
2068 oload_syms
, oload_champ_bv
,
2075 /* If we reach here, either we're in the deepest namespace or we
2076 didn't find a good match in a deeper namespace. But, in the
2077 latter case, we still have a bad match in a deeper namespace;
2078 note that we might not find any match at all in the current
2079 namespace. (There's always a match in the deepest namespace,
2080 because this overload mechanism only gets called if there's a
2081 function symbol to start off with.) */
2083 old_cleanups
= make_cleanup (xfree
, *oload_syms
);
2084 old_cleanups
= make_cleanup (xfree
, *oload_champ_bv
);
2085 new_namespace
= alloca (namespace_len
+ 1);
2086 strncpy (new_namespace
, qualified_name
, namespace_len
);
2087 new_namespace
[namespace_len
] = '\0';
2088 new_oload_syms
= make_symbol_overload_list (func_name
,
2090 while (new_oload_syms
[num_fns
])
2093 new_oload_champ
= find_oload_champ (arg_types
, nargs
, 0, num_fns
,
2094 NULL
, new_oload_syms
,
2095 &new_oload_champ_bv
);
2097 /* Case 1: We found a good match. Free earlier matches (if any),
2098 and return it. Case 2: We didn't find a good match, but we're
2099 not the deepest function. Then go with the bad match that the
2100 deeper function found. Case 3: We found a bad match, and we're
2101 the deepest function. Then return what we found, even though
2102 it's a bad match. */
2104 if (new_oload_champ
!= -1
2105 && classify_oload_match (new_oload_champ_bv
, nargs
, 0) == STANDARD
)
2107 *oload_syms
= new_oload_syms
;
2108 *oload_champ
= new_oload_champ
;
2109 *oload_champ_bv
= new_oload_champ_bv
;
2110 do_cleanups (old_cleanups
);
2113 else if (searched_deeper
)
2115 xfree (new_oload_syms
);
2116 xfree (new_oload_champ_bv
);
2117 discard_cleanups (old_cleanups
);
2122 gdb_assert (new_oload_champ
!= -1);
2123 *oload_syms
= new_oload_syms
;
2124 *oload_champ
= new_oload_champ
;
2125 *oload_champ_bv
= new_oload_champ_bv
;
2126 discard_cleanups (old_cleanups
);
2131 /* Look for a function to take NARGS args of types ARG_TYPES. Find
2132 the best match from among the overloaded methods or functions
2133 (depending on METHOD) given by FNS_PTR or OLOAD_SYMS, respectively.
2134 The number of methods/functions in the list is given by NUM_FNS.
2135 Return the index of the best match; store an indication of the
2136 quality of the match in OLOAD_CHAMP_BV.
2138 It is the caller's responsibility to free *OLOAD_CHAMP_BV. */
2141 find_oload_champ (struct type
**arg_types
, int nargs
, int method
,
2142 int num_fns
, struct fn_field
*fns_ptr
,
2143 struct symbol
**oload_syms
,
2144 struct badness_vector
**oload_champ_bv
)
2147 /* A measure of how good an overloaded instance is. */
2148 struct badness_vector
*bv
;
2149 /* Index of best overloaded function. */
2150 int oload_champ
= -1;
2151 /* Current ambiguity state for overload resolution. */
2152 int oload_ambiguous
= 0;
2153 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */
2155 *oload_champ_bv
= NULL
;
2157 /* Consider each candidate in turn. */
2158 for (ix
= 0; ix
< num_fns
; ix
++)
2161 int static_offset
= oload_method_static (method
, fns_ptr
, ix
);
2163 struct type
**parm_types
;
2167 nparms
= TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (fns_ptr
, ix
));
2171 /* If it's not a method, this is the proper place. */
2172 nparms
= TYPE_NFIELDS (SYMBOL_TYPE (oload_syms
[ix
]));
2175 /* Prepare array of parameter types. */
2176 parm_types
= (struct type
**)
2177 xmalloc (nparms
* (sizeof (struct type
*)));
2178 for (jj
= 0; jj
< nparms
; jj
++)
2179 parm_types
[jj
] = (method
2180 ? (TYPE_FN_FIELD_ARGS (fns_ptr
, ix
)[jj
].type
)
2181 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms
[ix
]),
2184 /* Compare parameter types to supplied argument types. Skip
2185 THIS for static methods. */
2186 bv
= rank_function (parm_types
, nparms
,
2187 arg_types
+ static_offset
,
2188 nargs
- static_offset
);
2190 if (!*oload_champ_bv
)
2192 *oload_champ_bv
= bv
;
2195 else /* See whether current candidate is better or worse than
2197 switch (compare_badness (bv
, *oload_champ_bv
))
2199 case 0: /* Top two contenders are equally good. */
2200 oload_ambiguous
= 1;
2202 case 1: /* Incomparable top contenders. */
2203 oload_ambiguous
= 2;
2205 case 2: /* New champion, record details. */
2206 *oload_champ_bv
= bv
;
2207 oload_ambiguous
= 0;
2218 fprintf_filtered (gdb_stderr
,
2219 "Overloaded method instance %s, # of parms %d\n",
2220 fns_ptr
[ix
].physname
, nparms
);
2222 fprintf_filtered (gdb_stderr
,
2223 "Overloaded function instance %s # of parms %d\n",
2224 SYMBOL_DEMANGLED_NAME (oload_syms
[ix
]),
2226 for (jj
= 0; jj
< nargs
- static_offset
; jj
++)
2227 fprintf_filtered (gdb_stderr
,
2228 "...Badness @ %d : %d\n",
2230 fprintf_filtered (gdb_stderr
,
2231 "Overload resolution champion is %d, ambiguous? %d\n",
2232 oload_champ
, oload_ambiguous
);
2239 /* Return 1 if we're looking at a static method, 0 if we're looking at
2240 a non-static method or a function that isn't a method. */
2243 oload_method_static (int method
, struct fn_field
*fns_ptr
, int index
)
2245 if (method
&& TYPE_FN_FIELD_STATIC_P (fns_ptr
, index
))
2251 /* Check how good an overload match OLOAD_CHAMP_BV represents. */
2253 static enum oload_classification
2254 classify_oload_match (struct badness_vector
*oload_champ_bv
,
2260 for (ix
= 1; ix
<= nargs
- static_offset
; ix
++)
2262 if (oload_champ_bv
->rank
[ix
] >= 100)
2263 return INCOMPATIBLE
; /* Truly mismatched types. */
2264 else if (oload_champ_bv
->rank
[ix
] >= 10)
2265 return NON_STANDARD
; /* Non-standard type conversions
2269 return STANDARD
; /* Only standard conversions needed. */
2272 /* C++: return 1 is NAME is a legitimate name for the destructor of
2273 type TYPE. If TYPE does not have a destructor, or if NAME is
2274 inappropriate for TYPE, an error is signaled. */
2276 destructor_name_p (const char *name
, const struct type
*type
)
2278 /* Destructors are a special case. */
2282 char *dname
= type_name_no_tag (type
);
2283 char *cp
= strchr (dname
, '<');
2286 /* Do not compare the template part for template classes. */
2288 len
= strlen (dname
);
2291 if (strlen (name
+ 1) != len
|| strncmp (dname
, name
+ 1, len
) != 0)
2292 error (_("name of destructor must equal name of class"));
2299 /* Helper function for check_field: Given TYPE, a structure/union,
2300 return 1 if the component named NAME from the ultimate target
2301 structure/union is defined, otherwise, return 0. */
2304 check_field_in (struct type
*type
, const char *name
)
2308 for (i
= TYPE_NFIELDS (type
) - 1; i
>= TYPE_N_BASECLASSES (type
); i
--)
2310 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
2311 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
2315 /* C++: If it was not found as a data field, then try to return it
2316 as a pointer to a method. */
2318 /* Destructors are a special case. */
2319 if (destructor_name_p (name
, type
))
2321 int m_index
, f_index
;
2323 return get_destructor_fn_field (type
, &m_index
, &f_index
);
2326 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; --i
)
2328 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type
, i
), name
) == 0)
2332 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2333 if (check_field_in (TYPE_BASECLASS (type
, i
), name
))
2340 /* C++: Given ARG1, a value of type (pointer to a)* structure/union,
2341 return 1 if the component named NAME from the ultimate target
2342 structure/union is defined, otherwise, return 0. */
2345 check_field (struct value
*arg1
, const char *name
)
2349 arg1
= coerce_array (arg1
);
2351 t
= value_type (arg1
);
2353 /* Follow pointers until we get to a non-pointer. */
2358 if (TYPE_CODE (t
) != TYPE_CODE_PTR
2359 && TYPE_CODE (t
) != TYPE_CODE_REF
)
2361 t
= TYPE_TARGET_TYPE (t
);
2364 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2365 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2366 error (_("Internal error: `this' is not an aggregate"));
2368 return check_field_in (t
, name
);
2371 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
2372 return the appropriate member (or the address of the member, if
2373 WANT_ADDRESS). This function is used to resolve user expressions
2374 of the form "DOMAIN::NAME". For more details on what happens, see
2375 the comment before value_struct_elt_for_reference. */
2378 value_aggregate_elt (struct type
*curtype
,
2379 char *name
, int want_address
,
2382 switch (TYPE_CODE (curtype
))
2384 case TYPE_CODE_STRUCT
:
2385 case TYPE_CODE_UNION
:
2386 return value_struct_elt_for_reference (curtype
, 0, curtype
,
2388 want_address
, noside
);
2389 case TYPE_CODE_NAMESPACE
:
2390 return value_namespace_elt (curtype
, name
,
2391 want_address
, noside
);
2393 internal_error (__FILE__
, __LINE__
,
2394 _("non-aggregate type in value_aggregate_elt"));
2398 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
2399 return the address of this member as a "pointer to member" type.
2400 If INTYPE is non-null, then it will be the type of the member we
2401 are looking for. This will help us resolve "pointers to member
2402 functions". This function is used to resolve user expressions of
2403 the form "DOMAIN::NAME". */
2405 static struct value
*
2406 value_struct_elt_for_reference (struct type
*domain
, int offset
,
2407 struct type
*curtype
, char *name
,
2408 struct type
*intype
,
2412 struct type
*t
= curtype
;
2414 struct value
*v
, *result
;
2416 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2417 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2418 error (_("Internal error: non-aggregate type to value_struct_elt_for_reference"));
2420 for (i
= TYPE_NFIELDS (t
) - 1; i
>= TYPE_N_BASECLASSES (t
); i
--)
2422 char *t_field_name
= TYPE_FIELD_NAME (t
, i
);
2424 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
2426 if (TYPE_FIELD_STATIC (t
, i
))
2428 v
= value_static_field (t
, i
);
2430 error (_("static field %s has been optimized out"),
2436 if (TYPE_FIELD_PACKED (t
, i
))
2437 error (_("pointers to bitfield members not allowed"));
2440 return value_from_longest
2441 (lookup_memberptr_type (TYPE_FIELD_TYPE (t
, i
), domain
),
2442 offset
+ (LONGEST
) (TYPE_FIELD_BITPOS (t
, i
) >> 3));
2443 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
2444 return allocate_value (TYPE_FIELD_TYPE (t
, i
));
2446 error (_("Cannot reference non-static field \"%s\""), name
);
2450 /* C++: If it was not found as a data field, then try to return it
2451 as a pointer to a method. */
2453 /* Destructors are a special case. */
2454 if (destructor_name_p (name
, t
))
2456 error (_("member pointers to destructors not implemented yet"));
2459 /* Perform all necessary dereferencing. */
2460 while (intype
&& TYPE_CODE (intype
) == TYPE_CODE_PTR
)
2461 intype
= TYPE_TARGET_TYPE (intype
);
2463 for (i
= TYPE_NFN_FIELDS (t
) - 1; i
>= 0; --i
)
2465 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (t
, i
);
2466 char dem_opname
[64];
2468 if (strncmp (t_field_name
, "__", 2) == 0
2469 || strncmp (t_field_name
, "op", 2) == 0
2470 || strncmp (t_field_name
, "type", 4) == 0)
2472 if (cplus_demangle_opname (t_field_name
,
2473 dem_opname
, DMGL_ANSI
))
2474 t_field_name
= dem_opname
;
2475 else if (cplus_demangle_opname (t_field_name
,
2477 t_field_name
= dem_opname
;
2479 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
2481 int j
= TYPE_FN_FIELDLIST_LENGTH (t
, i
);
2482 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (t
, i
);
2484 check_stub_method_group (t
, i
);
2486 if (intype
== 0 && j
> 1)
2487 error (_("non-unique member `%s' requires type instantiation"), name
);
2491 if (TYPE_FN_FIELD_TYPE (f
, j
) == intype
)
2494 error (_("no member function matches that type instantiation"));
2499 if (TYPE_FN_FIELD_STATIC_P (f
, j
))
2502 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
2503 0, VAR_DOMAIN
, 0, NULL
);
2508 return value_addr (read_var_value (s
, 0));
2510 return read_var_value (s
, 0);
2513 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
2517 result
= allocate_value
2518 (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
2519 cplus_make_method_ptr (value_contents_writeable (result
),
2520 TYPE_FN_FIELD_VOFFSET (f
, j
), 1);
2522 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
2523 return allocate_value (TYPE_FN_FIELD_TYPE (f
, j
));
2525 error (_("Cannot reference virtual member function \"%s\""),
2531 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
2532 0, VAR_DOMAIN
, 0, NULL
);
2536 v
= read_var_value (s
, 0);
2541 result
= allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
2542 cplus_make_method_ptr (value_contents_writeable (result
),
2543 VALUE_ADDRESS (v
), 0);
2549 for (i
= TYPE_N_BASECLASSES (t
) - 1; i
>= 0; i
--)
2554 if (BASETYPE_VIA_VIRTUAL (t
, i
))
2557 base_offset
= TYPE_BASECLASS_BITPOS (t
, i
) / 8;
2558 v
= value_struct_elt_for_reference (domain
,
2559 offset
+ base_offset
,
2560 TYPE_BASECLASS (t
, i
),
2562 want_address
, noside
);
2567 /* As a last chance, pretend that CURTYPE is a namespace, and look
2568 it up that way; this (frequently) works for types nested inside
2571 return value_maybe_namespace_elt (curtype
, name
,
2572 want_address
, noside
);
2575 /* C++: Return the member NAME of the namespace given by the type
2578 static struct value
*
2579 value_namespace_elt (const struct type
*curtype
,
2580 char *name
, int want_address
,
2583 struct value
*retval
= value_maybe_namespace_elt (curtype
, name
,
2588 error (_("No symbol \"%s\" in namespace \"%s\"."),
2589 name
, TYPE_TAG_NAME (curtype
));
2594 /* A helper function used by value_namespace_elt and
2595 value_struct_elt_for_reference. It looks up NAME inside the
2596 context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE
2597 is a class and NAME refers to a type in CURTYPE itself (as opposed
2598 to, say, some base class of CURTYPE). */
2600 static struct value
*
2601 value_maybe_namespace_elt (const struct type
*curtype
,
2602 char *name
, int want_address
,
2605 const char *namespace_name
= TYPE_TAG_NAME (curtype
);
2607 struct value
*result
;
2609 sym
= cp_lookup_symbol_namespace (namespace_name
, name
, NULL
,
2610 get_selected_block (0),
2615 else if ((noside
== EVAL_AVOID_SIDE_EFFECTS
)
2616 && (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
))
2617 result
= allocate_value (SYMBOL_TYPE (sym
));
2619 result
= value_of_variable (sym
, get_selected_block (0));
2621 if (result
&& want_address
)
2622 result
= value_addr (result
);
2627 /* Given a pointer value V, find the real (RTTI) type of the object it
2630 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
2631 and refer to the values computed for the object pointed to. */
2634 value_rtti_target_type (struct value
*v
, int *full
,
2635 int *top
, int *using_enc
)
2637 struct value
*target
;
2639 target
= value_ind (v
);
2641 return value_rtti_type (target
, full
, top
, using_enc
);
2644 /* Given a value pointed to by ARGP, check its real run-time type, and
2645 if that is different from the enclosing type, create a new value
2646 using the real run-time type as the enclosing type (and of the same
2647 type as ARGP) and return it, with the embedded offset adjusted to
2648 be the correct offset to the enclosed object. RTYPE is the type,
2649 and XFULL, XTOP, and XUSING_ENC are the other parameters, computed
2650 by value_rtti_type(). If these are available, they can be supplied
2651 and a second call to value_rtti_type() is avoided. (Pass RTYPE ==
2652 NULL if they're not available. */
2655 value_full_object (struct value
*argp
,
2657 int xfull
, int xtop
,
2660 struct type
*real_type
;
2664 struct value
*new_val
;
2671 using_enc
= xusing_enc
;
2674 real_type
= value_rtti_type (argp
, &full
, &top
, &using_enc
);
2676 /* If no RTTI data, or if object is already complete, do nothing. */
2677 if (!real_type
|| real_type
== value_enclosing_type (argp
))
2680 /* If we have the full object, but for some reason the enclosing
2681 type is wrong, set it. */
2682 /* pai: FIXME -- sounds iffy */
2685 argp
= value_change_enclosing_type (argp
, real_type
);
2689 /* Check if object is in memory */
2690 if (VALUE_LVAL (argp
) != lval_memory
)
2692 warning (_("Couldn't retrieve complete object of RTTI type %s; object may be in register(s)."),
2693 TYPE_NAME (real_type
));
2698 /* All other cases -- retrieve the complete object. */
2699 /* Go back by the computed top_offset from the beginning of the
2700 object, adjusting for the embedded offset of argp if that's what
2701 value_rtti_type used for its computation. */
2702 new_val
= value_at_lazy (real_type
, VALUE_ADDRESS (argp
) - top
+
2703 (using_enc
? 0 : value_embedded_offset (argp
)));
2704 deprecated_set_value_type (new_val
, value_type (argp
));
2705 set_value_embedded_offset (new_val
, (using_enc
2706 ? top
+ value_embedded_offset (argp
)
2712 /* Return the value of the local variable, if one exists.
2713 Flag COMPLAIN signals an error if the request is made in an
2714 inappropriate context. */
2717 value_of_local (const char *name
, int complain
)
2719 struct symbol
*func
, *sym
;
2722 struct frame_info
*frame
;
2725 frame
= get_selected_frame (_("no frame selected"));
2728 frame
= deprecated_safe_get_selected_frame ();
2733 func
= get_frame_function (frame
);
2737 error (_("no `%s' in nameless context"), name
);
2742 b
= SYMBOL_BLOCK_VALUE (func
);
2743 if (dict_empty (BLOCK_DICT (b
)))
2746 error (_("no args, no `%s'"), name
);
2751 /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER
2752 symbol instead of the LOC_ARG one (if both exist). */
2753 sym
= lookup_block_symbol (b
, name
, NULL
, VAR_DOMAIN
);
2757 error (_("current stack frame does not contain a variable named `%s'"),
2763 ret
= read_var_value (sym
, frame
);
2764 if (ret
== 0 && complain
)
2765 error (_("`%s' argument unreadable"), name
);
2769 /* C++/Objective-C: return the value of the class instance variable,
2770 if one exists. Flag COMPLAIN signals an error if the request is
2771 made in an inappropriate context. */
2774 value_of_this (int complain
)
2776 if (current_language
->la_language
== language_objc
)
2777 return value_of_local ("self", complain
);
2779 return value_of_local ("this", complain
);
2782 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH
2783 elements long, starting at LOWBOUND. The result has the same lower
2784 bound as the original ARRAY. */
2787 value_slice (struct value
*array
, int lowbound
, int length
)
2789 struct type
*slice_range_type
, *slice_type
, *range_type
;
2790 LONGEST lowerbound
, upperbound
;
2791 struct value
*slice
;
2792 struct type
*array_type
;
2794 array_type
= check_typedef (value_type (array
));
2795 if (TYPE_CODE (array_type
) != TYPE_CODE_ARRAY
2796 && TYPE_CODE (array_type
) != TYPE_CODE_STRING
2797 && TYPE_CODE (array_type
) != TYPE_CODE_BITSTRING
)
2798 error (_("cannot take slice of non-array"));
2800 range_type
= TYPE_INDEX_TYPE (array_type
);
2801 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2802 error (_("slice from bad array or bitstring"));
2804 if (lowbound
< lowerbound
|| length
< 0
2805 || lowbound
+ length
- 1 > upperbound
)
2806 error (_("slice out of range"));
2808 /* FIXME-type-allocation: need a way to free this type when we are
2810 slice_range_type
= create_range_type ((struct type
*) NULL
,
2811 TYPE_TARGET_TYPE (range_type
),
2813 lowbound
+ length
- 1);
2814 if (TYPE_CODE (array_type
) == TYPE_CODE_BITSTRING
)
2818 slice_type
= create_set_type ((struct type
*) NULL
,
2820 TYPE_CODE (slice_type
) = TYPE_CODE_BITSTRING
;
2821 slice
= value_zero (slice_type
, not_lval
);
2823 for (i
= 0; i
< length
; i
++)
2825 int element
= value_bit_index (array_type
,
2826 value_contents (array
),
2829 error (_("internal error accessing bitstring"));
2830 else if (element
> 0)
2832 int j
= i
% TARGET_CHAR_BIT
;
2833 if (gdbarch_bits_big_endian (current_gdbarch
))
2834 j
= TARGET_CHAR_BIT
- 1 - j
;
2835 value_contents_raw (slice
)[i
/ TARGET_CHAR_BIT
] |= (1 << j
);
2838 /* We should set the address, bitssize, and bitspos, so the
2839 slice can be used on the LHS, but that may require extensions
2840 to value_assign. For now, just leave as a non_lval.
2845 struct type
*element_type
= TYPE_TARGET_TYPE (array_type
);
2847 (lowbound
- lowerbound
) * TYPE_LENGTH (check_typedef (element_type
));
2849 slice_type
= create_array_type ((struct type
*) NULL
,
2852 TYPE_CODE (slice_type
) = TYPE_CODE (array_type
);
2854 slice
= allocate_value (slice_type
);
2855 if (value_lazy (array
))
2856 set_value_lazy (slice
, 1);
2858 memcpy (value_contents_writeable (slice
),
2859 value_contents (array
) + offset
,
2860 TYPE_LENGTH (slice_type
));
2862 if (VALUE_LVAL (array
) == lval_internalvar
)
2863 VALUE_LVAL (slice
) = lval_internalvar_component
;
2865 VALUE_LVAL (slice
) = VALUE_LVAL (array
);
2867 VALUE_ADDRESS (slice
) = VALUE_ADDRESS (array
);
2868 VALUE_FRAME_ID (slice
) = VALUE_FRAME_ID (array
);
2869 set_value_offset (slice
, value_offset (array
) + offset
);
2874 /* Create a value for a FORTRAN complex number. Currently most of the
2875 time values are coerced to COMPLEX*16 (i.e. a complex number
2876 composed of 2 doubles. This really should be a smarter routine
2877 that figures out precision inteligently as opposed to assuming
2878 doubles. FIXME: fmb */
2881 value_literal_complex (struct value
*arg1
,
2886 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
2888 val
= allocate_value (type
);
2889 arg1
= value_cast (real_type
, arg1
);
2890 arg2
= value_cast (real_type
, arg2
);
2892 memcpy (value_contents_raw (val
),
2893 value_contents (arg1
), TYPE_LENGTH (real_type
));
2894 memcpy (value_contents_raw (val
) + TYPE_LENGTH (real_type
),
2895 value_contents (arg2
), TYPE_LENGTH (real_type
));
2899 /* Cast a value into the appropriate complex data type. */
2901 static struct value
*
2902 cast_into_complex (struct type
*type
, struct value
*val
)
2904 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
2906 if (TYPE_CODE (value_type (val
)) == TYPE_CODE_COMPLEX
)
2908 struct type
*val_real_type
= TYPE_TARGET_TYPE (value_type (val
));
2909 struct value
*re_val
= allocate_value (val_real_type
);
2910 struct value
*im_val
= allocate_value (val_real_type
);
2912 memcpy (value_contents_raw (re_val
),
2913 value_contents (val
), TYPE_LENGTH (val_real_type
));
2914 memcpy (value_contents_raw (im_val
),
2915 value_contents (val
) + TYPE_LENGTH (val_real_type
),
2916 TYPE_LENGTH (val_real_type
));
2918 return value_literal_complex (re_val
, im_val
, type
);
2920 else if (TYPE_CODE (value_type (val
)) == TYPE_CODE_FLT
2921 || TYPE_CODE (value_type (val
)) == TYPE_CODE_INT
)
2922 return value_literal_complex (val
,
2923 value_zero (real_type
, not_lval
),
2926 error (_("cannot cast non-number to complex"));
2930 _initialize_valops (void)
2932 add_setshow_boolean_cmd ("overload-resolution", class_support
,
2933 &overload_resolution
, _("\
2934 Set overload resolution in evaluating C++ functions."), _("\
2935 Show overload resolution in evaluating C++ functions."),
2937 show_overload_resolution
,
2938 &setlist
, &showlist
);
2939 overload_resolution
= 1;