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 if (VALUE_LVAL (val
) == lval_memory
)
616 CORE_ADDR addr
= VALUE_ADDRESS (val
) + value_offset (val
);
617 int length
= TYPE_LENGTH (value_enclosing_type (val
));
619 struct type
*type
= value_type (val
);
621 read_memory (addr
, value_contents_all_raw (val
), length
);
623 else if (VALUE_LVAL (val
) == lval_register
)
625 struct frame_info
*frame
= frame_find_by_id (VALUE_FRAME_ID (val
));
626 int regnum
= VALUE_REGNUM (val
);
627 struct type
*type
= check_typedef (value_type (val
));
629 gdb_assert (frame
!= NULL
);
631 /* Convertible register routines are used for multi-register
632 values and for interpretation in different types (e.g. float
633 or int from a double register). Lazy register values should
634 have the register's natural type, so they do not apply. */
635 gdb_assert (!gdbarch_convert_register_p (get_frame_arch (frame
), regnum
,
639 if (!get_frame_register_bytes (frame
, regnum
, value_offset (val
),
640 TYPE_LENGTH (value_type (val
)),
641 value_contents_raw (val
)))
642 set_value_optimized_out (val
, 1);
645 internal_error (__FILE__
, __LINE__
, "Unexpected lazy value type.");
647 set_value_lazy (val
, 0);
652 /* Store the contents of FROMVAL into the location of TOVAL.
653 Return a new value with the location of TOVAL and contents of FROMVAL. */
656 value_assign (struct value
*toval
, struct value
*fromval
)
660 struct frame_id old_frame
;
662 if (!deprecated_value_modifiable (toval
))
663 error (_("Left operand of assignment is not a modifiable lvalue."));
665 toval
= coerce_ref (toval
);
667 type
= value_type (toval
);
668 if (VALUE_LVAL (toval
) != lval_internalvar
)
670 toval
= value_coerce_to_target (toval
);
671 fromval
= value_cast (type
, fromval
);
675 /* Coerce arrays and functions to pointers, except for arrays
676 which only live in GDB's storage. */
677 if (!value_must_coerce_to_target (fromval
))
678 fromval
= coerce_array (fromval
);
681 CHECK_TYPEDEF (type
);
683 /* Since modifying a register can trash the frame chain, and
684 modifying memory can trash the frame cache, we save the old frame
685 and then restore the new frame afterwards. */
686 old_frame
= get_frame_id (deprecated_safe_get_selected_frame ());
688 switch (VALUE_LVAL (toval
))
690 case lval_internalvar
:
691 set_internalvar (VALUE_INTERNALVAR (toval
), fromval
);
692 val
= value_copy (VALUE_INTERNALVAR (toval
)->value
);
693 val
= value_change_enclosing_type (val
,
694 value_enclosing_type (fromval
));
695 set_value_embedded_offset (val
, value_embedded_offset (fromval
));
696 set_value_pointed_to_offset (val
,
697 value_pointed_to_offset (fromval
));
700 case lval_internalvar_component
:
701 set_internalvar_component (VALUE_INTERNALVAR (toval
),
702 value_offset (toval
),
703 value_bitpos (toval
),
704 value_bitsize (toval
),
710 const gdb_byte
*dest_buffer
;
711 CORE_ADDR changed_addr
;
713 gdb_byte buffer
[sizeof (LONGEST
)];
715 if (value_bitsize (toval
))
717 /* We assume that the argument to read_memory is in units
718 of host chars. FIXME: Is that correct? */
719 changed_len
= (value_bitpos (toval
)
720 + value_bitsize (toval
)
724 if (changed_len
> (int) sizeof (LONGEST
))
725 error (_("Can't handle bitfields which don't fit in a %d bit word."),
726 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
728 read_memory (VALUE_ADDRESS (toval
) + value_offset (toval
),
729 buffer
, changed_len
);
730 modify_field (buffer
, value_as_long (fromval
),
731 value_bitpos (toval
), value_bitsize (toval
));
732 changed_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
733 dest_buffer
= buffer
;
737 changed_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
738 changed_len
= TYPE_LENGTH (type
);
739 dest_buffer
= value_contents (fromval
);
742 write_memory (changed_addr
, dest_buffer
, changed_len
);
743 if (deprecated_memory_changed_hook
)
744 deprecated_memory_changed_hook (changed_addr
, changed_len
);
750 struct frame_info
*frame
;
753 /* Figure out which frame this is in currently. */
754 frame
= frame_find_by_id (VALUE_FRAME_ID (toval
));
755 value_reg
= VALUE_REGNUM (toval
);
758 error (_("Value being assigned to is no longer active."));
760 if (gdbarch_convert_register_p
761 (current_gdbarch
, VALUE_REGNUM (toval
), type
))
763 /* If TOVAL is a special machine register requiring
764 conversion of program values to a special raw
766 gdbarch_value_to_register (current_gdbarch
, frame
,
767 VALUE_REGNUM (toval
), type
,
768 value_contents (fromval
));
772 if (value_bitsize (toval
))
775 gdb_byte buffer
[sizeof (LONGEST
)];
777 changed_len
= (value_bitpos (toval
)
778 + value_bitsize (toval
)
782 if (changed_len
> (int) sizeof (LONGEST
))
783 error (_("Can't handle bitfields which don't fit in a %d bit word."),
784 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
786 get_frame_register_bytes (frame
, value_reg
,
787 value_offset (toval
),
788 changed_len
, buffer
);
790 modify_field (buffer
, value_as_long (fromval
),
791 value_bitpos (toval
),
792 value_bitsize (toval
));
794 put_frame_register_bytes (frame
, value_reg
,
795 value_offset (toval
),
796 changed_len
, buffer
);
800 put_frame_register_bytes (frame
, value_reg
,
801 value_offset (toval
),
803 value_contents (fromval
));
807 if (deprecated_register_changed_hook
)
808 deprecated_register_changed_hook (-1);
809 observer_notify_target_changed (¤t_target
);
814 error (_("Left operand of assignment is not an lvalue."));
817 /* Assigning to the stack pointer, frame pointer, and other
818 (architecture and calling convention specific) registers may
819 cause the frame cache to be out of date. Assigning to memory
820 also can. We just do this on all assignments to registers or
821 memory, for simplicity's sake; I doubt the slowdown matters. */
822 switch (VALUE_LVAL (toval
))
827 reinit_frame_cache ();
829 /* Having destroyed the frame cache, restore the selected
832 /* FIXME: cagney/2002-11-02: There has to be a better way of
833 doing this. Instead of constantly saving/restoring the
834 frame. Why not create a get_selected_frame() function that,
835 having saved the selected frame's ID can automatically
836 re-find the previously selected frame automatically. */
839 struct frame_info
*fi
= frame_find_by_id (old_frame
);
849 /* If the field does not entirely fill a LONGEST, then zero the sign
850 bits. If the field is signed, and is negative, then sign
852 if ((value_bitsize (toval
) > 0)
853 && (value_bitsize (toval
) < 8 * (int) sizeof (LONGEST
)))
855 LONGEST fieldval
= value_as_long (fromval
);
856 LONGEST valmask
= (((ULONGEST
) 1) << value_bitsize (toval
)) - 1;
859 if (!TYPE_UNSIGNED (type
)
860 && (fieldval
& (valmask
^ (valmask
>> 1))))
861 fieldval
|= ~valmask
;
863 fromval
= value_from_longest (type
, fieldval
);
866 val
= value_copy (toval
);
867 memcpy (value_contents_raw (val
), value_contents (fromval
),
869 deprecated_set_value_type (val
, type
);
870 val
= value_change_enclosing_type (val
,
871 value_enclosing_type (fromval
));
872 set_value_embedded_offset (val
, value_embedded_offset (fromval
));
873 set_value_pointed_to_offset (val
, value_pointed_to_offset (fromval
));
878 /* Extend a value VAL to COUNT repetitions of its type. */
881 value_repeat (struct value
*arg1
, int count
)
885 if (VALUE_LVAL (arg1
) != lval_memory
)
886 error (_("Only values in memory can be extended with '@'."));
888 error (_("Invalid number %d of repetitions."), count
);
890 val
= allocate_repeat_value (value_enclosing_type (arg1
), count
);
892 read_memory (VALUE_ADDRESS (arg1
) + value_offset (arg1
),
893 value_contents_all_raw (val
),
894 TYPE_LENGTH (value_enclosing_type (val
)));
895 VALUE_LVAL (val
) = lval_memory
;
896 VALUE_ADDRESS (val
) = VALUE_ADDRESS (arg1
) + value_offset (arg1
);
902 value_of_variable (struct symbol
*var
, struct block
*b
)
905 struct frame_info
*frame
= NULL
;
908 frame
= NULL
; /* Use selected frame. */
909 else if (symbol_read_needs_frame (var
))
911 frame
= block_innermost_frame (b
);
914 if (BLOCK_FUNCTION (b
)
915 && SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b
)))
916 error (_("No frame is currently executing in block %s."),
917 SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b
)));
919 error (_("No frame is currently executing in specified block"));
923 val
= read_var_value (var
, frame
);
925 error (_("Address of symbol \"%s\" is unknown."), SYMBOL_PRINT_NAME (var
));
930 /* Return one if VAL does not live in target memory, but should in order
931 to operate on it. Otherwise return zero. */
934 value_must_coerce_to_target (struct value
*val
)
936 struct type
*valtype
;
938 /* The only lval kinds which do not live in target memory. */
939 if (VALUE_LVAL (val
) != not_lval
940 && VALUE_LVAL (val
) != lval_internalvar
)
943 valtype
= check_typedef (value_type (val
));
945 switch (TYPE_CODE (valtype
))
947 case TYPE_CODE_ARRAY
:
948 case TYPE_CODE_STRING
:
955 /* Make sure that VAL lives in target memory if it's supposed to. For instance,
956 strings are constructed as character arrays in GDB's storage, and this
957 function copies them to the target. */
960 value_coerce_to_target (struct value
*val
)
965 if (!value_must_coerce_to_target (val
))
968 length
= TYPE_LENGTH (check_typedef (value_type (val
)));
969 addr
= allocate_space_in_inferior (length
);
970 write_memory (addr
, value_contents (val
), length
);
971 return value_at_lazy (value_type (val
), addr
);
974 /* Given a value which is an array, return a value which is a pointer
975 to its first element, regardless of whether or not the array has a
978 FIXME: A previous comment here indicated that this routine should
979 be substracting the array's lower bound. It's not clear to me that
980 this is correct. Given an array subscripting operation, it would
981 certainly work to do the adjustment here, essentially computing:
983 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
985 However I believe a more appropriate and logical place to account
986 for the lower bound is to do so in value_subscript, essentially
989 (&array[0] + ((index - lowerbound) * sizeof array[0]))
991 As further evidence consider what would happen with operations
992 other than array subscripting, where the caller would get back a
993 value that had an address somewhere before the actual first element
994 of the array, and the information about the lower bound would be
995 lost because of the coercion to pointer type.
999 value_coerce_array (struct value
*arg1
)
1001 struct type
*type
= check_typedef (value_type (arg1
));
1003 /* If the user tries to do something requiring a pointer with an
1004 array that has not yet been pushed to the target, then this would
1005 be a good time to do so. */
1006 arg1
= value_coerce_to_target (arg1
);
1008 if (VALUE_LVAL (arg1
) != lval_memory
)
1009 error (_("Attempt to take address of value not located in memory."));
1011 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
1012 (VALUE_ADDRESS (arg1
) + value_offset (arg1
)));
1015 /* Given a value which is a function, return a value which is a pointer
1019 value_coerce_function (struct value
*arg1
)
1021 struct value
*retval
;
1023 if (VALUE_LVAL (arg1
) != lval_memory
)
1024 error (_("Attempt to take address of value not located in memory."));
1026 retval
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1027 (VALUE_ADDRESS (arg1
) + value_offset (arg1
)));
1031 /* Return a pointer value for the object for which ARG1 is the
1035 value_addr (struct value
*arg1
)
1039 struct type
*type
= check_typedef (value_type (arg1
));
1040 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
1042 /* Copy the value, but change the type from (T&) to (T*). We
1043 keep the same location information, which is efficient, and
1044 allows &(&X) to get the location containing the reference. */
1045 arg2
= value_copy (arg1
);
1046 deprecated_set_value_type (arg2
,
1047 lookup_pointer_type (TYPE_TARGET_TYPE (type
)));
1050 if (TYPE_CODE (type
) == TYPE_CODE_FUNC
)
1051 return value_coerce_function (arg1
);
1053 /* If this is an array that has not yet been pushed to the target,
1054 then this would be a good time to force it to memory. */
1055 arg1
= value_coerce_to_target (arg1
);
1057 if (VALUE_LVAL (arg1
) != lval_memory
)
1058 error (_("Attempt to take address of value not located in memory."));
1060 /* Get target memory address */
1061 arg2
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1062 (VALUE_ADDRESS (arg1
)
1063 + value_offset (arg1
)
1064 + value_embedded_offset (arg1
)));
1066 /* This may be a pointer to a base subobject; so remember the
1067 full derived object's type ... */
1068 arg2
= value_change_enclosing_type (arg2
, lookup_pointer_type (value_enclosing_type (arg1
)));
1069 /* ... and also the relative position of the subobject in the full
1071 set_value_pointed_to_offset (arg2
, value_embedded_offset (arg1
));
1075 /* Return a reference value for the object for which ARG1 is the
1079 value_ref (struct value
*arg1
)
1083 struct type
*type
= check_typedef (value_type (arg1
));
1084 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
1087 arg2
= value_addr (arg1
);
1088 deprecated_set_value_type (arg2
, lookup_reference_type (type
));
1092 /* Given a value of a pointer type, apply the C unary * operator to
1096 value_ind (struct value
*arg1
)
1098 struct type
*base_type
;
1101 arg1
= coerce_array (arg1
);
1103 base_type
= check_typedef (value_type (arg1
));
1105 /* Allow * on an integer so we can cast it to whatever we want.
1106 This returns an int, which seems like the most C-like thing to
1107 do. "long long" variables are rare enough that
1108 BUILTIN_TYPE_LONGEST would seem to be a mistake. */
1109 if (TYPE_CODE (base_type
) == TYPE_CODE_INT
)
1110 return value_at_lazy (builtin_type_int
,
1111 (CORE_ADDR
) value_as_address (arg1
));
1112 else if (TYPE_CODE (base_type
) == TYPE_CODE_PTR
)
1114 struct type
*enc_type
;
1115 /* We may be pointing to something embedded in a larger object.
1116 Get the real type of the enclosing object. */
1117 enc_type
= check_typedef (value_enclosing_type (arg1
));
1118 enc_type
= TYPE_TARGET_TYPE (enc_type
);
1120 if (TYPE_CODE (check_typedef (enc_type
)) == TYPE_CODE_FUNC
1121 || TYPE_CODE (check_typedef (enc_type
)) == TYPE_CODE_METHOD
)
1122 /* For functions, go through find_function_addr, which knows
1123 how to handle function descriptors. */
1124 arg2
= value_at_lazy (enc_type
,
1125 find_function_addr (arg1
, NULL
));
1127 /* Retrieve the enclosing object pointed to */
1128 arg2
= value_at_lazy (enc_type
,
1129 (value_as_address (arg1
)
1130 - value_pointed_to_offset (arg1
)));
1132 /* Re-adjust type. */
1133 deprecated_set_value_type (arg2
, TYPE_TARGET_TYPE (base_type
));
1134 /* Add embedding info. */
1135 arg2
= value_change_enclosing_type (arg2
, enc_type
);
1136 set_value_embedded_offset (arg2
, value_pointed_to_offset (arg1
));
1138 /* We may be pointing to an object of some derived type. */
1139 arg2
= value_full_object (arg2
, NULL
, 0, 0, 0);
1143 error (_("Attempt to take contents of a non-pointer value."));
1144 return 0; /* For lint -- never reached. */
1147 /* Create a value for an array by allocating space in GDB, copying
1148 copying the data into that space, and then setting up an array
1151 The array bounds are set from LOWBOUND and HIGHBOUND, and the array
1152 is populated from the values passed in ELEMVEC.
1154 The element type of the array is inherited from the type of the
1155 first element, and all elements must have the same size (though we
1156 don't currently enforce any restriction on their types). */
1159 value_array (int lowbound
, int highbound
, struct value
**elemvec
)
1163 unsigned int typelength
;
1165 struct type
*rangetype
;
1166 struct type
*arraytype
;
1169 /* Validate that the bounds are reasonable and that each of the
1170 elements have the same size. */
1172 nelem
= highbound
- lowbound
+ 1;
1175 error (_("bad array bounds (%d, %d)"), lowbound
, highbound
);
1177 typelength
= TYPE_LENGTH (value_enclosing_type (elemvec
[0]));
1178 for (idx
= 1; idx
< nelem
; idx
++)
1180 if (TYPE_LENGTH (value_enclosing_type (elemvec
[idx
])) != typelength
)
1182 error (_("array elements must all be the same size"));
1186 rangetype
= create_range_type ((struct type
*) NULL
,
1188 lowbound
, highbound
);
1189 arraytype
= create_array_type ((struct type
*) NULL
,
1190 value_enclosing_type (elemvec
[0]),
1193 if (!current_language
->c_style_arrays
)
1195 val
= allocate_value (arraytype
);
1196 for (idx
= 0; idx
< nelem
; idx
++)
1198 memcpy (value_contents_all_raw (val
) + (idx
* typelength
),
1199 value_contents_all (elemvec
[idx
]),
1205 /* Allocate space to store the array, and then initialize it by
1206 copying in each element. */
1208 val
= allocate_value (arraytype
);
1209 for (idx
= 0; idx
< nelem
; idx
++)
1210 memcpy (value_contents_writeable (val
) + (idx
* typelength
),
1211 value_contents_all (elemvec
[idx
]),
1216 /* Create a value for a string constant by allocating space in the
1217 inferior, copying the data into that space, and returning the
1218 address with type TYPE_CODE_STRING. PTR points to the string
1219 constant data; LEN is number of characters.
1221 Note that string types are like array of char types with a lower
1222 bound of zero and an upper bound of LEN - 1. Also note that the
1223 string may contain embedded null bytes. */
1226 value_string (char *ptr
, int len
)
1229 int lowbound
= current_language
->string_lower_bound
;
1230 struct type
*rangetype
= create_range_type ((struct type
*) NULL
,
1233 len
+ lowbound
- 1);
1234 struct type
*stringtype
1235 = create_string_type ((struct type
*) NULL
, rangetype
);
1238 if (current_language
->c_style_arrays
== 0)
1240 val
= allocate_value (stringtype
);
1241 memcpy (value_contents_raw (val
), ptr
, len
);
1246 /* Allocate space to store the string in the inferior, and then copy
1247 LEN bytes from PTR in gdb to that address in the inferior. */
1249 addr
= allocate_space_in_inferior (len
);
1250 write_memory (addr
, (gdb_byte
*) ptr
, len
);
1252 val
= value_at_lazy (stringtype
, addr
);
1257 value_bitstring (char *ptr
, int len
)
1260 struct type
*domain_type
= create_range_type (NULL
,
1263 struct type
*type
= create_set_type ((struct type
*) NULL
,
1265 TYPE_CODE (type
) = TYPE_CODE_BITSTRING
;
1266 val
= allocate_value (type
);
1267 memcpy (value_contents_raw (val
), ptr
, TYPE_LENGTH (type
));
1271 /* See if we can pass arguments in T2 to a function which takes
1272 arguments of types T1. T1 is a list of NARGS arguments, and T2 is
1273 a NULL-terminated vector. If some arguments need coercion of some
1274 sort, then the coerced values are written into T2. Return value is
1275 0 if the arguments could be matched, or the position at which they
1278 STATICP is nonzero if the T1 argument list came from a static
1279 member function. T2 will still include the ``this'' pointer, but
1282 For non-static member functions, we ignore the first argument,
1283 which is the type of the instance variable. This is because we
1284 want to handle calls with objects from derived classes. This is
1285 not entirely correct: we should actually check to make sure that a
1286 requested operation is type secure, shouldn't we? FIXME. */
1289 typecmp (int staticp
, int varargs
, int nargs
,
1290 struct field t1
[], struct value
*t2
[])
1295 internal_error (__FILE__
, __LINE__
,
1296 _("typecmp: no argument list"));
1298 /* Skip ``this'' argument if applicable. T2 will always include
1304 (i
< nargs
) && TYPE_CODE (t1
[i
].type
) != TYPE_CODE_VOID
;
1307 struct type
*tt1
, *tt2
;
1312 tt1
= check_typedef (t1
[i
].type
);
1313 tt2
= check_typedef (value_type (t2
[i
]));
1315 if (TYPE_CODE (tt1
) == TYPE_CODE_REF
1316 /* We should be doing hairy argument matching, as below. */
1317 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1
))) == TYPE_CODE (tt2
)))
1319 if (TYPE_CODE (tt2
) == TYPE_CODE_ARRAY
)
1320 t2
[i
] = value_coerce_array (t2
[i
]);
1322 t2
[i
] = value_ref (t2
[i
]);
1326 /* djb - 20000715 - Until the new type structure is in the
1327 place, and we can attempt things like implicit conversions,
1328 we need to do this so you can take something like a map<const
1329 char *>, and properly access map["hello"], because the
1330 argument to [] will be a reference to a pointer to a char,
1331 and the argument will be a pointer to a char. */
1332 while (TYPE_CODE(tt1
) == TYPE_CODE_REF
1333 || TYPE_CODE (tt1
) == TYPE_CODE_PTR
)
1335 tt1
= check_typedef( TYPE_TARGET_TYPE(tt1
) );
1337 while (TYPE_CODE(tt2
) == TYPE_CODE_ARRAY
1338 || TYPE_CODE(tt2
) == TYPE_CODE_PTR
1339 || TYPE_CODE(tt2
) == TYPE_CODE_REF
)
1341 tt2
= check_typedef (TYPE_TARGET_TYPE(tt2
));
1343 if (TYPE_CODE (tt1
) == TYPE_CODE (tt2
))
1345 /* Array to pointer is a `trivial conversion' according to the
1348 /* We should be doing much hairier argument matching (see
1349 section 13.2 of the ARM), but as a quick kludge, just check
1350 for the same type code. */
1351 if (TYPE_CODE (t1
[i
].type
) != TYPE_CODE (value_type (t2
[i
])))
1354 if (varargs
|| t2
[i
] == NULL
)
1359 /* Helper function used by value_struct_elt to recurse through
1360 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1361 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1362 TYPE. If found, return value, else return NULL.
1364 If LOOKING_FOR_BASECLASS, then instead of looking for struct
1365 fields, look for a baseclass named NAME. */
1367 static struct value
*
1368 search_struct_field (char *name
, struct value
*arg1
, int offset
,
1369 struct type
*type
, int looking_for_baseclass
)
1372 int nbases
= TYPE_N_BASECLASSES (type
);
1374 CHECK_TYPEDEF (type
);
1376 if (!looking_for_baseclass
)
1377 for (i
= TYPE_NFIELDS (type
) - 1; i
>= nbases
; i
--)
1379 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
1381 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1384 if (TYPE_FIELD_STATIC (type
, i
))
1386 v
= value_static_field (type
, i
);
1388 error (_("field %s is nonexistent or has been optimised out"),
1393 v
= value_primitive_field (arg1
, offset
, i
, type
);
1395 error (_("there is no field named %s"), name
);
1401 && (t_field_name
[0] == '\0'
1402 || (TYPE_CODE (type
) == TYPE_CODE_UNION
1403 && (strcmp_iw (t_field_name
, "else") == 0))))
1405 struct type
*field_type
= TYPE_FIELD_TYPE (type
, i
);
1406 if (TYPE_CODE (field_type
) == TYPE_CODE_UNION
1407 || TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
)
1409 /* Look for a match through the fields of an anonymous
1410 union, or anonymous struct. C++ provides anonymous
1413 In the GNU Chill (now deleted from GDB)
1414 implementation of variant record types, each
1415 <alternative field> has an (anonymous) union type,
1416 each member of the union represents a <variant
1417 alternative>. Each <variant alternative> is
1418 represented as a struct, with a member for each
1422 int new_offset
= offset
;
1424 /* This is pretty gross. In G++, the offset in an
1425 anonymous union is relative to the beginning of the
1426 enclosing struct. In the GNU Chill (now deleted
1427 from GDB) implementation of variant records, the
1428 bitpos is zero in an anonymous union field, so we
1429 have to add the offset of the union here. */
1430 if (TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
1431 || (TYPE_NFIELDS (field_type
) > 0
1432 && TYPE_FIELD_BITPOS (field_type
, 0) == 0))
1433 new_offset
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
1435 v
= search_struct_field (name
, arg1
, new_offset
,
1437 looking_for_baseclass
);
1444 for (i
= 0; i
< nbases
; i
++)
1447 struct type
*basetype
= check_typedef (TYPE_BASECLASS (type
, i
));
1448 /* If we are looking for baseclasses, this is what we get when
1449 we hit them. But it could happen that the base part's member
1450 name is not yet filled in. */
1451 int found_baseclass
= (looking_for_baseclass
1452 && TYPE_BASECLASS_NAME (type
, i
) != NULL
1453 && (strcmp_iw (name
,
1454 TYPE_BASECLASS_NAME (type
,
1457 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1460 struct value
*v2
= allocate_value (basetype
);
1462 boffset
= baseclass_offset (type
, i
,
1463 value_contents (arg1
) + offset
,
1464 VALUE_ADDRESS (arg1
)
1465 + value_offset (arg1
) + offset
);
1467 error (_("virtual baseclass botch"));
1469 /* The virtual base class pointer might have been clobbered
1470 by the user program. Make sure that it still points to a
1471 valid memory location. */
1474 if (boffset
< 0 || boffset
>= TYPE_LENGTH (type
))
1476 CORE_ADDR base_addr
;
1479 VALUE_ADDRESS (arg1
) + value_offset (arg1
) + boffset
;
1480 if (target_read_memory (base_addr
,
1481 value_contents_raw (v2
),
1482 TYPE_LENGTH (basetype
)) != 0)
1483 error (_("virtual baseclass botch"));
1484 VALUE_LVAL (v2
) = lval_memory
;
1485 VALUE_ADDRESS (v2
) = base_addr
;
1489 VALUE_LVAL (v2
) = VALUE_LVAL (arg1
);
1490 VALUE_ADDRESS (v2
) = VALUE_ADDRESS (arg1
);
1491 VALUE_FRAME_ID (v2
) = VALUE_FRAME_ID (arg1
);
1492 set_value_offset (v2
, value_offset (arg1
) + boffset
);
1493 if (VALUE_LVAL (arg1
) == lval_memory
&& value_lazy (arg1
))
1494 set_value_lazy (v2
, 1);
1496 memcpy (value_contents_raw (v2
),
1497 value_contents_raw (arg1
) + boffset
,
1498 TYPE_LENGTH (basetype
));
1501 if (found_baseclass
)
1503 v
= search_struct_field (name
, v2
, 0,
1504 TYPE_BASECLASS (type
, i
),
1505 looking_for_baseclass
);
1507 else if (found_baseclass
)
1508 v
= value_primitive_field (arg1
, offset
, i
, type
);
1510 v
= search_struct_field (name
, arg1
,
1511 offset
+ TYPE_BASECLASS_BITPOS (type
,
1513 basetype
, looking_for_baseclass
);
1520 /* Helper function used by value_struct_elt to recurse through
1521 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1522 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1525 If found, return value, else if name matched and args not return
1526 (value) -1, else return NULL. */
1528 static struct value
*
1529 search_struct_method (char *name
, struct value
**arg1p
,
1530 struct value
**args
, int offset
,
1531 int *static_memfuncp
, struct type
*type
)
1535 int name_matched
= 0;
1536 char dem_opname
[64];
1538 CHECK_TYPEDEF (type
);
1539 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
1541 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
1542 /* FIXME! May need to check for ARM demangling here */
1543 if (strncmp (t_field_name
, "__", 2) == 0 ||
1544 strncmp (t_field_name
, "op", 2) == 0 ||
1545 strncmp (t_field_name
, "type", 4) == 0)
1547 if (cplus_demangle_opname (t_field_name
, dem_opname
, DMGL_ANSI
))
1548 t_field_name
= dem_opname
;
1549 else if (cplus_demangle_opname (t_field_name
, dem_opname
, 0))
1550 t_field_name
= dem_opname
;
1552 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1554 int j
= TYPE_FN_FIELDLIST_LENGTH (type
, i
) - 1;
1555 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
1558 check_stub_method_group (type
, i
);
1559 if (j
> 0 && args
== 0)
1560 error (_("cannot resolve overloaded method `%s': no arguments supplied"), name
);
1561 else if (j
== 0 && args
== 0)
1563 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
1570 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f
, j
),
1571 TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f
, j
)),
1572 TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f
, j
)),
1573 TYPE_FN_FIELD_ARGS (f
, j
), args
))
1575 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
1576 return value_virtual_fn_field (arg1p
, f
, j
,
1578 if (TYPE_FN_FIELD_STATIC_P (f
, j
)
1580 *static_memfuncp
= 1;
1581 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
1590 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
1594 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1596 struct type
*baseclass
= check_typedef (TYPE_BASECLASS (type
, i
));
1597 const gdb_byte
*base_valaddr
;
1599 /* The virtual base class pointer might have been
1600 clobbered by the user program. Make sure that it
1601 still points to a valid memory location. */
1603 if (offset
< 0 || offset
>= TYPE_LENGTH (type
))
1605 gdb_byte
*tmp
= alloca (TYPE_LENGTH (baseclass
));
1606 if (target_read_memory (VALUE_ADDRESS (*arg1p
)
1607 + value_offset (*arg1p
) + offset
,
1608 tmp
, TYPE_LENGTH (baseclass
)) != 0)
1609 error (_("virtual baseclass botch"));
1613 base_valaddr
= value_contents (*arg1p
) + offset
;
1615 base_offset
= baseclass_offset (type
, i
, base_valaddr
,
1616 VALUE_ADDRESS (*arg1p
)
1617 + value_offset (*arg1p
) + offset
);
1618 if (base_offset
== -1)
1619 error (_("virtual baseclass botch"));
1623 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
1625 v
= search_struct_method (name
, arg1p
, args
, base_offset
+ offset
,
1626 static_memfuncp
, TYPE_BASECLASS (type
, i
));
1627 if (v
== (struct value
*) - 1)
1633 /* FIXME-bothner: Why is this commented out? Why is it here? */
1634 /* *arg1p = arg1_tmp; */
1639 return (struct value
*) - 1;
1644 /* Given *ARGP, a value of type (pointer to a)* structure/union,
1645 extract the component named NAME from the ultimate target
1646 structure/union and return it as a value with its appropriate type.
1647 ERR is used in the error message if *ARGP's type is wrong.
1649 C++: ARGS is a list of argument types to aid in the selection of
1650 an appropriate method. Also, handle derived types.
1652 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
1653 where the truthvalue of whether the function that was resolved was
1654 a static member function or not is stored.
1656 ERR is an error message to be printed in case the field is not
1660 value_struct_elt (struct value
**argp
, struct value
**args
,
1661 char *name
, int *static_memfuncp
, char *err
)
1666 *argp
= coerce_array (*argp
);
1668 t
= check_typedef (value_type (*argp
));
1670 /* Follow pointers until we get to a non-pointer. */
1672 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
1674 *argp
= value_ind (*argp
);
1675 /* Don't coerce fn pointer to fn and then back again! */
1676 if (TYPE_CODE (value_type (*argp
)) != TYPE_CODE_FUNC
)
1677 *argp
= coerce_array (*argp
);
1678 t
= check_typedef (value_type (*argp
));
1681 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
1682 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
1683 error (_("Attempt to extract a component of a value that is not a %s."), err
);
1685 /* Assume it's not, unless we see that it is. */
1686 if (static_memfuncp
)
1687 *static_memfuncp
= 0;
1691 /* if there are no arguments ...do this... */
1693 /* Try as a field first, because if we succeed, there is less
1695 v
= search_struct_field (name
, *argp
, 0, t
, 0);
1699 /* C++: If it was not found as a data field, then try to
1700 return it as a pointer to a method. */
1702 if (destructor_name_p (name
, t
))
1703 error (_("Cannot get value of destructor"));
1705 v
= search_struct_method (name
, argp
, args
, 0,
1706 static_memfuncp
, t
);
1708 if (v
== (struct value
*) - 1)
1709 error (_("Cannot take address of method %s."), name
);
1712 if (TYPE_NFN_FIELDS (t
))
1713 error (_("There is no member or method named %s."), name
);
1715 error (_("There is no member named %s."), name
);
1720 if (destructor_name_p (name
, t
))
1724 /* Destructors are a special case. */
1725 int m_index
, f_index
;
1728 if (get_destructor_fn_field (t
, &m_index
, &f_index
))
1730 v
= value_fn_field (NULL
,
1731 TYPE_FN_FIELDLIST1 (t
, m_index
),
1735 error (_("could not find destructor function named %s."),
1742 error (_("destructor should not have any argument"));
1746 v
= search_struct_method (name
, argp
, args
, 0,
1747 static_memfuncp
, t
);
1749 if (v
== (struct value
*) - 1)
1751 error (_("One of the arguments you tried to pass to %s could not be converted to what the function wants."), name
);
1755 /* See if user tried to invoke data as function. If so, hand it
1756 back. If it's not callable (i.e., a pointer to function),
1757 gdb should give an error. */
1758 v
= search_struct_field (name
, *argp
, 0, t
, 0);
1762 error (_("Structure has no component named %s."), name
);
1766 /* Search through the methods of an object (and its bases) to find a
1767 specified method. Return the pointer to the fn_field list of
1768 overloaded instances.
1770 Helper function for value_find_oload_list.
1771 ARGP is a pointer to a pointer to a value (the object).
1772 METHOD is a string containing the method name.
1773 OFFSET is the offset within the value.
1774 TYPE is the assumed type of the object.
1775 NUM_FNS is the number of overloaded instances.
1776 BASETYPE is set to the actual type of the subobject where the
1778 BOFFSET is the offset of the base subobject where the method is found.
1781 static struct fn_field
*
1782 find_method_list (struct value
**argp
, char *method
,
1783 int offset
, struct type
*type
, int *num_fns
,
1784 struct type
**basetype
, int *boffset
)
1788 CHECK_TYPEDEF (type
);
1792 /* First check in object itself. */
1793 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
1795 /* pai: FIXME What about operators and type conversions? */
1796 char *fn_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
1797 if (fn_field_name
&& (strcmp_iw (fn_field_name
, method
) == 0))
1799 int len
= TYPE_FN_FIELDLIST_LENGTH (type
, i
);
1800 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
1806 /* Resolve any stub methods. */
1807 check_stub_method_group (type
, i
);
1813 /* Not found in object, check in base subobjects. */
1814 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
1817 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1819 base_offset
= value_offset (*argp
) + offset
;
1820 base_offset
= baseclass_offset (type
, i
,
1821 value_contents (*argp
) + base_offset
,
1822 VALUE_ADDRESS (*argp
) + base_offset
);
1823 if (base_offset
== -1)
1824 error (_("virtual baseclass botch"));
1826 else /* Non-virtual base, simply use bit position from debug
1829 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
1831 f
= find_method_list (argp
, method
, base_offset
+ offset
,
1832 TYPE_BASECLASS (type
, i
), num_fns
,
1840 /* Return the list of overloaded methods of a specified name.
1842 ARGP is a pointer to a pointer to a value (the object).
1843 METHOD is the method name.
1844 OFFSET is the offset within the value contents.
1845 NUM_FNS is the number of overloaded instances.
1846 BASETYPE is set to the type of the base subobject that defines the
1848 BOFFSET is the offset of the base subobject which defines the method.
1852 value_find_oload_method_list (struct value
**argp
, char *method
,
1853 int offset
, int *num_fns
,
1854 struct type
**basetype
, int *boffset
)
1858 t
= check_typedef (value_type (*argp
));
1860 /* Code snarfed from value_struct_elt. */
1861 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
1863 *argp
= value_ind (*argp
);
1864 /* Don't coerce fn pointer to fn and then back again! */
1865 if (TYPE_CODE (value_type (*argp
)) != TYPE_CODE_FUNC
)
1866 *argp
= coerce_array (*argp
);
1867 t
= check_typedef (value_type (*argp
));
1870 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
1871 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
1872 error (_("Attempt to extract a component of a value that is not a struct or union"));
1874 return find_method_list (argp
, method
, 0, t
, num_fns
,
1878 /* Given an array of argument types (ARGTYPES) (which includes an
1879 entry for "this" in the case of C++ methods), the number of
1880 arguments NARGS, the NAME of a function whether it's a method or
1881 not (METHOD), and the degree of laxness (LAX) in conforming to
1882 overload resolution rules in ANSI C++, find the best function that
1883 matches on the argument types according to the overload resolution
1886 In the case of class methods, the parameter OBJ is an object value
1887 in which to search for overloaded methods.
1889 In the case of non-method functions, the parameter FSYM is a symbol
1890 corresponding to one of the overloaded functions.
1892 Return value is an integer: 0 -> good match, 10 -> debugger applied
1893 non-standard coercions, 100 -> incompatible.
1895 If a method is being searched for, VALP will hold the value.
1896 If a non-method is being searched for, SYMP will hold the symbol
1899 If a method is being searched for, and it is a static method,
1900 then STATICP will point to a non-zero value.
1902 Note: This function does *not* check the value of
1903 overload_resolution. Caller must check it to see whether overload
1904 resolution is permitted.
1908 find_overload_match (struct type
**arg_types
, int nargs
,
1909 char *name
, int method
, int lax
,
1910 struct value
**objp
, struct symbol
*fsym
,
1911 struct value
**valp
, struct symbol
**symp
,
1914 struct value
*obj
= (objp
? *objp
: NULL
);
1915 /* Index of best overloaded function. */
1917 /* The measure for the current best match. */
1918 struct badness_vector
*oload_champ_bv
= NULL
;
1919 struct value
*temp
= obj
;
1920 /* For methods, the list of overloaded methods. */
1921 struct fn_field
*fns_ptr
= NULL
;
1922 /* For non-methods, the list of overloaded function symbols. */
1923 struct symbol
**oload_syms
= NULL
;
1924 /* Number of overloaded instances being considered. */
1926 struct type
*basetype
= NULL
;
1930 struct cleanup
*old_cleanups
= NULL
;
1932 const char *obj_type_name
= NULL
;
1933 char *func_name
= NULL
;
1934 enum oload_classification match_quality
;
1936 /* Get the list of overloaded methods or functions. */
1940 obj_type_name
= TYPE_NAME (value_type (obj
));
1941 /* Hack: evaluate_subexp_standard often passes in a pointer
1942 value rather than the object itself, so try again. */
1943 if ((!obj_type_name
|| !*obj_type_name
)
1944 && (TYPE_CODE (value_type (obj
)) == TYPE_CODE_PTR
))
1945 obj_type_name
= TYPE_NAME (TYPE_TARGET_TYPE (value_type (obj
)));
1947 fns_ptr
= value_find_oload_method_list (&temp
, name
,
1949 &basetype
, &boffset
);
1950 if (!fns_ptr
|| !num_fns
)
1951 error (_("Couldn't find method %s%s%s"),
1953 (obj_type_name
&& *obj_type_name
) ? "::" : "",
1955 /* If we are dealing with stub method types, they should have
1956 been resolved by find_method_list via
1957 value_find_oload_method_list above. */
1958 gdb_assert (TYPE_DOMAIN_TYPE (fns_ptr
[0].type
) != NULL
);
1959 oload_champ
= find_oload_champ (arg_types
, nargs
, method
,
1961 oload_syms
, &oload_champ_bv
);
1965 const char *qualified_name
= SYMBOL_CPLUS_DEMANGLED_NAME (fsym
);
1967 /* If we have a C++ name, try to extract just the function
1970 func_name
= cp_func_name (qualified_name
);
1972 /* If there was no C++ name, this must be a C-style function.
1973 Just return the same symbol. Do the same if cp_func_name
1974 fails for some reason. */
1975 if (func_name
== NULL
)
1981 old_cleanups
= make_cleanup (xfree
, func_name
);
1982 make_cleanup (xfree
, oload_syms
);
1983 make_cleanup (xfree
, oload_champ_bv
);
1985 oload_champ
= find_oload_champ_namespace (arg_types
, nargs
,
1992 /* Check how bad the best match is. */
1995 classify_oload_match (oload_champ_bv
, nargs
,
1996 oload_method_static (method
, fns_ptr
,
1999 if (match_quality
== INCOMPATIBLE
)
2002 error (_("Cannot resolve method %s%s%s to any overloaded instance"),
2004 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2007 error (_("Cannot resolve function %s to any overloaded instance"),
2010 else if (match_quality
== NON_STANDARD
)
2013 warning (_("Using non-standard conversion to match method %s%s%s to supplied arguments"),
2015 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2018 warning (_("Using non-standard conversion to match function %s to supplied arguments"),
2024 if (staticp
!= NULL
)
2025 *staticp
= oload_method_static (method
, fns_ptr
, oload_champ
);
2026 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr
, oload_champ
))
2027 *valp
= value_virtual_fn_field (&temp
, fns_ptr
, oload_champ
,
2030 *valp
= value_fn_field (&temp
, fns_ptr
, oload_champ
,
2035 *symp
= oload_syms
[oload_champ
];
2040 if (TYPE_CODE (value_type (temp
)) != TYPE_CODE_PTR
2041 && TYPE_CODE (value_type (*objp
)) == TYPE_CODE_PTR
)
2043 temp
= value_addr (temp
);
2047 if (old_cleanups
!= NULL
)
2048 do_cleanups (old_cleanups
);
2050 switch (match_quality
)
2056 default: /* STANDARD */
2061 /* Find the best overload match, searching for FUNC_NAME in namespaces
2062 contained in QUALIFIED_NAME until it either finds a good match or
2063 runs out of namespaces. It stores the overloaded functions in
2064 *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. The
2065 calling function is responsible for freeing *OLOAD_SYMS and
2069 find_oload_champ_namespace (struct type
**arg_types
, int nargs
,
2070 const char *func_name
,
2071 const char *qualified_name
,
2072 struct symbol
***oload_syms
,
2073 struct badness_vector
**oload_champ_bv
)
2077 find_oload_champ_namespace_loop (arg_types
, nargs
,
2080 oload_syms
, oload_champ_bv
,
2086 /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is
2087 how deep we've looked for namespaces, and the champ is stored in
2088 OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0
2091 It is the caller's responsibility to free *OLOAD_SYMS and
2095 find_oload_champ_namespace_loop (struct type
**arg_types
, int nargs
,
2096 const char *func_name
,
2097 const char *qualified_name
,
2099 struct symbol
***oload_syms
,
2100 struct badness_vector
**oload_champ_bv
,
2103 int next_namespace_len
= namespace_len
;
2104 int searched_deeper
= 0;
2106 struct cleanup
*old_cleanups
;
2107 int new_oload_champ
;
2108 struct symbol
**new_oload_syms
;
2109 struct badness_vector
*new_oload_champ_bv
;
2110 char *new_namespace
;
2112 if (next_namespace_len
!= 0)
2114 gdb_assert (qualified_name
[next_namespace_len
] == ':');
2115 next_namespace_len
+= 2;
2117 next_namespace_len
+=
2118 cp_find_first_component (qualified_name
+ next_namespace_len
);
2120 /* Initialize these to values that can safely be xfree'd. */
2122 *oload_champ_bv
= NULL
;
2124 /* First, see if we have a deeper namespace we can search in.
2125 If we get a good match there, use it. */
2127 if (qualified_name
[next_namespace_len
] == ':')
2129 searched_deeper
= 1;
2131 if (find_oload_champ_namespace_loop (arg_types
, nargs
,
2132 func_name
, qualified_name
,
2134 oload_syms
, oload_champ_bv
,
2141 /* If we reach here, either we're in the deepest namespace or we
2142 didn't find a good match in a deeper namespace. But, in the
2143 latter case, we still have a bad match in a deeper namespace;
2144 note that we might not find any match at all in the current
2145 namespace. (There's always a match in the deepest namespace,
2146 because this overload mechanism only gets called if there's a
2147 function symbol to start off with.) */
2149 old_cleanups
= make_cleanup (xfree
, *oload_syms
);
2150 old_cleanups
= make_cleanup (xfree
, *oload_champ_bv
);
2151 new_namespace
= alloca (namespace_len
+ 1);
2152 strncpy (new_namespace
, qualified_name
, namespace_len
);
2153 new_namespace
[namespace_len
] = '\0';
2154 new_oload_syms
= make_symbol_overload_list (func_name
,
2156 while (new_oload_syms
[num_fns
])
2159 new_oload_champ
= find_oload_champ (arg_types
, nargs
, 0, num_fns
,
2160 NULL
, new_oload_syms
,
2161 &new_oload_champ_bv
);
2163 /* Case 1: We found a good match. Free earlier matches (if any),
2164 and return it. Case 2: We didn't find a good match, but we're
2165 not the deepest function. Then go with the bad match that the
2166 deeper function found. Case 3: We found a bad match, and we're
2167 the deepest function. Then return what we found, even though
2168 it's a bad match. */
2170 if (new_oload_champ
!= -1
2171 && classify_oload_match (new_oload_champ_bv
, nargs
, 0) == STANDARD
)
2173 *oload_syms
= new_oload_syms
;
2174 *oload_champ
= new_oload_champ
;
2175 *oload_champ_bv
= new_oload_champ_bv
;
2176 do_cleanups (old_cleanups
);
2179 else if (searched_deeper
)
2181 xfree (new_oload_syms
);
2182 xfree (new_oload_champ_bv
);
2183 discard_cleanups (old_cleanups
);
2188 gdb_assert (new_oload_champ
!= -1);
2189 *oload_syms
= new_oload_syms
;
2190 *oload_champ
= new_oload_champ
;
2191 *oload_champ_bv
= new_oload_champ_bv
;
2192 discard_cleanups (old_cleanups
);
2197 /* Look for a function to take NARGS args of types ARG_TYPES. Find
2198 the best match from among the overloaded methods or functions
2199 (depending on METHOD) given by FNS_PTR or OLOAD_SYMS, respectively.
2200 The number of methods/functions in the list is given by NUM_FNS.
2201 Return the index of the best match; store an indication of the
2202 quality of the match in OLOAD_CHAMP_BV.
2204 It is the caller's responsibility to free *OLOAD_CHAMP_BV. */
2207 find_oload_champ (struct type
**arg_types
, int nargs
, int method
,
2208 int num_fns
, struct fn_field
*fns_ptr
,
2209 struct symbol
**oload_syms
,
2210 struct badness_vector
**oload_champ_bv
)
2213 /* A measure of how good an overloaded instance is. */
2214 struct badness_vector
*bv
;
2215 /* Index of best overloaded function. */
2216 int oload_champ
= -1;
2217 /* Current ambiguity state for overload resolution. */
2218 int oload_ambiguous
= 0;
2219 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */
2221 *oload_champ_bv
= NULL
;
2223 /* Consider each candidate in turn. */
2224 for (ix
= 0; ix
< num_fns
; ix
++)
2227 int static_offset
= oload_method_static (method
, fns_ptr
, ix
);
2229 struct type
**parm_types
;
2233 nparms
= TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (fns_ptr
, ix
));
2237 /* If it's not a method, this is the proper place. */
2238 nparms
= TYPE_NFIELDS (SYMBOL_TYPE (oload_syms
[ix
]));
2241 /* Prepare array of parameter types. */
2242 parm_types
= (struct type
**)
2243 xmalloc (nparms
* (sizeof (struct type
*)));
2244 for (jj
= 0; jj
< nparms
; jj
++)
2245 parm_types
[jj
] = (method
2246 ? (TYPE_FN_FIELD_ARGS (fns_ptr
, ix
)[jj
].type
)
2247 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms
[ix
]),
2250 /* Compare parameter types to supplied argument types. Skip
2251 THIS for static methods. */
2252 bv
= rank_function (parm_types
, nparms
,
2253 arg_types
+ static_offset
,
2254 nargs
- static_offset
);
2256 if (!*oload_champ_bv
)
2258 *oload_champ_bv
= bv
;
2261 else /* See whether current candidate is better or worse than
2263 switch (compare_badness (bv
, *oload_champ_bv
))
2265 case 0: /* Top two contenders are equally good. */
2266 oload_ambiguous
= 1;
2268 case 1: /* Incomparable top contenders. */
2269 oload_ambiguous
= 2;
2271 case 2: /* New champion, record details. */
2272 *oload_champ_bv
= bv
;
2273 oload_ambiguous
= 0;
2284 fprintf_filtered (gdb_stderr
,
2285 "Overloaded method instance %s, # of parms %d\n",
2286 fns_ptr
[ix
].physname
, nparms
);
2288 fprintf_filtered (gdb_stderr
,
2289 "Overloaded function instance %s # of parms %d\n",
2290 SYMBOL_DEMANGLED_NAME (oload_syms
[ix
]),
2292 for (jj
= 0; jj
< nargs
- static_offset
; jj
++)
2293 fprintf_filtered (gdb_stderr
,
2294 "...Badness @ %d : %d\n",
2296 fprintf_filtered (gdb_stderr
,
2297 "Overload resolution champion is %d, ambiguous? %d\n",
2298 oload_champ
, oload_ambiguous
);
2305 /* Return 1 if we're looking at a static method, 0 if we're looking at
2306 a non-static method or a function that isn't a method. */
2309 oload_method_static (int method
, struct fn_field
*fns_ptr
, int index
)
2311 if (method
&& TYPE_FN_FIELD_STATIC_P (fns_ptr
, index
))
2317 /* Check how good an overload match OLOAD_CHAMP_BV represents. */
2319 static enum oload_classification
2320 classify_oload_match (struct badness_vector
*oload_champ_bv
,
2326 for (ix
= 1; ix
<= nargs
- static_offset
; ix
++)
2328 if (oload_champ_bv
->rank
[ix
] >= 100)
2329 return INCOMPATIBLE
; /* Truly mismatched types. */
2330 else if (oload_champ_bv
->rank
[ix
] >= 10)
2331 return NON_STANDARD
; /* Non-standard type conversions
2335 return STANDARD
; /* Only standard conversions needed. */
2338 /* C++: return 1 is NAME is a legitimate name for the destructor of
2339 type TYPE. If TYPE does not have a destructor, or if NAME is
2340 inappropriate for TYPE, an error is signaled. */
2342 destructor_name_p (const char *name
, const struct type
*type
)
2344 /* Destructors are a special case. */
2348 char *dname
= type_name_no_tag (type
);
2349 char *cp
= strchr (dname
, '<');
2352 /* Do not compare the template part for template classes. */
2354 len
= strlen (dname
);
2357 if (strlen (name
+ 1) != len
|| strncmp (dname
, name
+ 1, len
) != 0)
2358 error (_("name of destructor must equal name of class"));
2365 /* Given TYPE, a structure/union,
2366 return 1 if the component named NAME from the ultimate target
2367 structure/union is defined, otherwise, return 0. */
2370 check_field (struct type
*type
, const char *name
)
2374 for (i
= TYPE_NFIELDS (type
) - 1; i
>= TYPE_N_BASECLASSES (type
); i
--)
2376 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
2377 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
2381 /* C++: If it was not found as a data field, then try to return it
2382 as a pointer to a method. */
2384 /* Destructors are a special case. */
2385 if (destructor_name_p (name
, type
))
2387 int m_index
, f_index
;
2389 return get_destructor_fn_field (type
, &m_index
, &f_index
);
2392 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; --i
)
2394 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type
, i
), name
) == 0)
2398 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2399 if (check_field (TYPE_BASECLASS (type
, i
), name
))
2405 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
2406 return the appropriate member (or the address of the member, if
2407 WANT_ADDRESS). This function is used to resolve user expressions
2408 of the form "DOMAIN::NAME". For more details on what happens, see
2409 the comment before value_struct_elt_for_reference. */
2412 value_aggregate_elt (struct type
*curtype
,
2413 char *name
, int want_address
,
2416 switch (TYPE_CODE (curtype
))
2418 case TYPE_CODE_STRUCT
:
2419 case TYPE_CODE_UNION
:
2420 return value_struct_elt_for_reference (curtype
, 0, curtype
,
2422 want_address
, noside
);
2423 case TYPE_CODE_NAMESPACE
:
2424 return value_namespace_elt (curtype
, name
,
2425 want_address
, noside
);
2427 internal_error (__FILE__
, __LINE__
,
2428 _("non-aggregate type in value_aggregate_elt"));
2432 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
2433 return the address of this member as a "pointer to member" type.
2434 If INTYPE is non-null, then it will be the type of the member we
2435 are looking for. This will help us resolve "pointers to member
2436 functions". This function is used to resolve user expressions of
2437 the form "DOMAIN::NAME". */
2439 static struct value
*
2440 value_struct_elt_for_reference (struct type
*domain
, int offset
,
2441 struct type
*curtype
, char *name
,
2442 struct type
*intype
,
2446 struct type
*t
= curtype
;
2448 struct value
*v
, *result
;
2450 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2451 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2452 error (_("Internal error: non-aggregate type to value_struct_elt_for_reference"));
2454 for (i
= TYPE_NFIELDS (t
) - 1; i
>= TYPE_N_BASECLASSES (t
); i
--)
2456 char *t_field_name
= TYPE_FIELD_NAME (t
, i
);
2458 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
2460 if (TYPE_FIELD_STATIC (t
, i
))
2462 v
= value_static_field (t
, i
);
2464 error (_("static field %s has been optimized out"),
2470 if (TYPE_FIELD_PACKED (t
, i
))
2471 error (_("pointers to bitfield members not allowed"));
2474 return value_from_longest
2475 (lookup_memberptr_type (TYPE_FIELD_TYPE (t
, i
), domain
),
2476 offset
+ (LONGEST
) (TYPE_FIELD_BITPOS (t
, i
) >> 3));
2477 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
2478 return allocate_value (TYPE_FIELD_TYPE (t
, i
));
2480 error (_("Cannot reference non-static field \"%s\""), name
);
2484 /* C++: If it was not found as a data field, then try to return it
2485 as a pointer to a method. */
2487 /* Destructors are a special case. */
2488 if (destructor_name_p (name
, t
))
2490 error (_("member pointers to destructors not implemented yet"));
2493 /* Perform all necessary dereferencing. */
2494 while (intype
&& TYPE_CODE (intype
) == TYPE_CODE_PTR
)
2495 intype
= TYPE_TARGET_TYPE (intype
);
2497 for (i
= TYPE_NFN_FIELDS (t
) - 1; i
>= 0; --i
)
2499 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (t
, i
);
2500 char dem_opname
[64];
2502 if (strncmp (t_field_name
, "__", 2) == 0
2503 || strncmp (t_field_name
, "op", 2) == 0
2504 || strncmp (t_field_name
, "type", 4) == 0)
2506 if (cplus_demangle_opname (t_field_name
,
2507 dem_opname
, DMGL_ANSI
))
2508 t_field_name
= dem_opname
;
2509 else if (cplus_demangle_opname (t_field_name
,
2511 t_field_name
= dem_opname
;
2513 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
2515 int j
= TYPE_FN_FIELDLIST_LENGTH (t
, i
);
2516 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (t
, i
);
2518 check_stub_method_group (t
, i
);
2520 if (intype
== 0 && j
> 1)
2521 error (_("non-unique member `%s' requires type instantiation"), name
);
2525 if (TYPE_FN_FIELD_TYPE (f
, j
) == intype
)
2528 error (_("no member function matches that type instantiation"));
2533 if (TYPE_FN_FIELD_STATIC_P (f
, j
))
2536 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
2537 0, VAR_DOMAIN
, 0, NULL
);
2542 return value_addr (read_var_value (s
, 0));
2544 return read_var_value (s
, 0);
2547 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
2551 result
= allocate_value
2552 (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
2553 cplus_make_method_ptr (value_contents_writeable (result
),
2554 TYPE_FN_FIELD_VOFFSET (f
, j
), 1);
2556 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
2557 return allocate_value (TYPE_FN_FIELD_TYPE (f
, j
));
2559 error (_("Cannot reference virtual member function \"%s\""),
2565 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
2566 0, VAR_DOMAIN
, 0, NULL
);
2570 v
= read_var_value (s
, 0);
2575 result
= allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
2576 cplus_make_method_ptr (value_contents_writeable (result
),
2577 VALUE_ADDRESS (v
), 0);
2583 for (i
= TYPE_N_BASECLASSES (t
) - 1; i
>= 0; i
--)
2588 if (BASETYPE_VIA_VIRTUAL (t
, i
))
2591 base_offset
= TYPE_BASECLASS_BITPOS (t
, i
) / 8;
2592 v
= value_struct_elt_for_reference (domain
,
2593 offset
+ base_offset
,
2594 TYPE_BASECLASS (t
, i
),
2596 want_address
, noside
);
2601 /* As a last chance, pretend that CURTYPE is a namespace, and look
2602 it up that way; this (frequently) works for types nested inside
2605 return value_maybe_namespace_elt (curtype
, name
,
2606 want_address
, noside
);
2609 /* C++: Return the member NAME of the namespace given by the type
2612 static struct value
*
2613 value_namespace_elt (const struct type
*curtype
,
2614 char *name
, int want_address
,
2617 struct value
*retval
= value_maybe_namespace_elt (curtype
, name
,
2622 error (_("No symbol \"%s\" in namespace \"%s\"."),
2623 name
, TYPE_TAG_NAME (curtype
));
2628 /* A helper function used by value_namespace_elt and
2629 value_struct_elt_for_reference. It looks up NAME inside the
2630 context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE
2631 is a class and NAME refers to a type in CURTYPE itself (as opposed
2632 to, say, some base class of CURTYPE). */
2634 static struct value
*
2635 value_maybe_namespace_elt (const struct type
*curtype
,
2636 char *name
, int want_address
,
2639 const char *namespace_name
= TYPE_TAG_NAME (curtype
);
2641 struct value
*result
;
2643 sym
= cp_lookup_symbol_namespace (namespace_name
, name
, NULL
,
2644 get_selected_block (0),
2649 else if ((noside
== EVAL_AVOID_SIDE_EFFECTS
)
2650 && (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
))
2651 result
= allocate_value (SYMBOL_TYPE (sym
));
2653 result
= value_of_variable (sym
, get_selected_block (0));
2655 if (result
&& want_address
)
2656 result
= value_addr (result
);
2661 /* Given a pointer value V, find the real (RTTI) type of the object it
2664 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
2665 and refer to the values computed for the object pointed to. */
2668 value_rtti_target_type (struct value
*v
, int *full
,
2669 int *top
, int *using_enc
)
2671 struct value
*target
;
2673 target
= value_ind (v
);
2675 return value_rtti_type (target
, full
, top
, using_enc
);
2678 /* Given a value pointed to by ARGP, check its real run-time type, and
2679 if that is different from the enclosing type, create a new value
2680 using the real run-time type as the enclosing type (and of the same
2681 type as ARGP) and return it, with the embedded offset adjusted to
2682 be the correct offset to the enclosed object. RTYPE is the type,
2683 and XFULL, XTOP, and XUSING_ENC are the other parameters, computed
2684 by value_rtti_type(). If these are available, they can be supplied
2685 and a second call to value_rtti_type() is avoided. (Pass RTYPE ==
2686 NULL if they're not available. */
2689 value_full_object (struct value
*argp
,
2691 int xfull
, int xtop
,
2694 struct type
*real_type
;
2698 struct value
*new_val
;
2705 using_enc
= xusing_enc
;
2708 real_type
= value_rtti_type (argp
, &full
, &top
, &using_enc
);
2710 /* If no RTTI data, or if object is already complete, do nothing. */
2711 if (!real_type
|| real_type
== value_enclosing_type (argp
))
2714 /* If we have the full object, but for some reason the enclosing
2715 type is wrong, set it. */
2716 /* pai: FIXME -- sounds iffy */
2719 argp
= value_change_enclosing_type (argp
, real_type
);
2723 /* Check if object is in memory */
2724 if (VALUE_LVAL (argp
) != lval_memory
)
2726 warning (_("Couldn't retrieve complete object of RTTI type %s; object may be in register(s)."),
2727 TYPE_NAME (real_type
));
2732 /* All other cases -- retrieve the complete object. */
2733 /* Go back by the computed top_offset from the beginning of the
2734 object, adjusting for the embedded offset of argp if that's what
2735 value_rtti_type used for its computation. */
2736 new_val
= value_at_lazy (real_type
, VALUE_ADDRESS (argp
) - top
+
2737 (using_enc
? 0 : value_embedded_offset (argp
)));
2738 deprecated_set_value_type (new_val
, value_type (argp
));
2739 set_value_embedded_offset (new_val
, (using_enc
2740 ? top
+ value_embedded_offset (argp
)
2746 /* Return the value of the local variable, if one exists.
2747 Flag COMPLAIN signals an error if the request is made in an
2748 inappropriate context. */
2751 value_of_local (const char *name
, int complain
)
2753 struct symbol
*func
, *sym
;
2756 struct frame_info
*frame
;
2759 frame
= get_selected_frame (_("no frame selected"));
2762 frame
= deprecated_safe_get_selected_frame ();
2767 func
= get_frame_function (frame
);
2771 error (_("no `%s' in nameless context"), name
);
2776 b
= SYMBOL_BLOCK_VALUE (func
);
2777 if (dict_empty (BLOCK_DICT (b
)))
2780 error (_("no args, no `%s'"), name
);
2785 /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER
2786 symbol instead of the LOC_ARG one (if both exist). */
2787 sym
= lookup_block_symbol (b
, name
, NULL
, VAR_DOMAIN
);
2791 error (_("current stack frame does not contain a variable named `%s'"),
2797 ret
= read_var_value (sym
, frame
);
2798 if (ret
== 0 && complain
)
2799 error (_("`%s' argument unreadable"), name
);
2803 /* C++/Objective-C: return the value of the class instance variable,
2804 if one exists. Flag COMPLAIN signals an error if the request is
2805 made in an inappropriate context. */
2808 value_of_this (int complain
)
2810 if (!current_language
->la_name_of_this
)
2812 return value_of_local (current_language
->la_name_of_this
, complain
);
2815 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH
2816 elements long, starting at LOWBOUND. The result has the same lower
2817 bound as the original ARRAY. */
2820 value_slice (struct value
*array
, int lowbound
, int length
)
2822 struct type
*slice_range_type
, *slice_type
, *range_type
;
2823 LONGEST lowerbound
, upperbound
;
2824 struct value
*slice
;
2825 struct type
*array_type
;
2827 array_type
= check_typedef (value_type (array
));
2828 if (TYPE_CODE (array_type
) != TYPE_CODE_ARRAY
2829 && TYPE_CODE (array_type
) != TYPE_CODE_STRING
2830 && TYPE_CODE (array_type
) != TYPE_CODE_BITSTRING
)
2831 error (_("cannot take slice of non-array"));
2833 range_type
= TYPE_INDEX_TYPE (array_type
);
2834 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2835 error (_("slice from bad array or bitstring"));
2837 if (lowbound
< lowerbound
|| length
< 0
2838 || lowbound
+ length
- 1 > upperbound
)
2839 error (_("slice out of range"));
2841 /* FIXME-type-allocation: need a way to free this type when we are
2843 slice_range_type
= create_range_type ((struct type
*) NULL
,
2844 TYPE_TARGET_TYPE (range_type
),
2846 lowbound
+ length
- 1);
2847 if (TYPE_CODE (array_type
) == TYPE_CODE_BITSTRING
)
2851 slice_type
= create_set_type ((struct type
*) NULL
,
2853 TYPE_CODE (slice_type
) = TYPE_CODE_BITSTRING
;
2854 slice
= value_zero (slice_type
, not_lval
);
2856 for (i
= 0; i
< length
; i
++)
2858 int element
= value_bit_index (array_type
,
2859 value_contents (array
),
2862 error (_("internal error accessing bitstring"));
2863 else if (element
> 0)
2865 int j
= i
% TARGET_CHAR_BIT
;
2866 if (gdbarch_bits_big_endian (current_gdbarch
))
2867 j
= TARGET_CHAR_BIT
- 1 - j
;
2868 value_contents_raw (slice
)[i
/ TARGET_CHAR_BIT
] |= (1 << j
);
2871 /* We should set the address, bitssize, and bitspos, so the
2872 slice can be used on the LHS, but that may require extensions
2873 to value_assign. For now, just leave as a non_lval.
2878 struct type
*element_type
= TYPE_TARGET_TYPE (array_type
);
2880 (lowbound
- lowerbound
) * TYPE_LENGTH (check_typedef (element_type
));
2882 slice_type
= create_array_type ((struct type
*) NULL
,
2885 TYPE_CODE (slice_type
) = TYPE_CODE (array_type
);
2887 slice
= allocate_value (slice_type
);
2888 if (VALUE_LVAL (array
) == lval_memory
&& value_lazy (array
))
2889 set_value_lazy (slice
, 1);
2891 memcpy (value_contents_writeable (slice
),
2892 value_contents (array
) + offset
,
2893 TYPE_LENGTH (slice_type
));
2895 if (VALUE_LVAL (array
) == lval_internalvar
)
2896 VALUE_LVAL (slice
) = lval_internalvar_component
;
2898 VALUE_LVAL (slice
) = VALUE_LVAL (array
);
2900 VALUE_ADDRESS (slice
) = VALUE_ADDRESS (array
);
2901 VALUE_FRAME_ID (slice
) = VALUE_FRAME_ID (array
);
2902 set_value_offset (slice
, value_offset (array
) + offset
);
2907 /* Create a value for a FORTRAN complex number. Currently most of the
2908 time values are coerced to COMPLEX*16 (i.e. a complex number
2909 composed of 2 doubles. This really should be a smarter routine
2910 that figures out precision inteligently as opposed to assuming
2911 doubles. FIXME: fmb */
2914 value_literal_complex (struct value
*arg1
,
2919 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
2921 val
= allocate_value (type
);
2922 arg1
= value_cast (real_type
, arg1
);
2923 arg2
= value_cast (real_type
, arg2
);
2925 memcpy (value_contents_raw (val
),
2926 value_contents (arg1
), TYPE_LENGTH (real_type
));
2927 memcpy (value_contents_raw (val
) + TYPE_LENGTH (real_type
),
2928 value_contents (arg2
), TYPE_LENGTH (real_type
));
2932 /* Cast a value into the appropriate complex data type. */
2934 static struct value
*
2935 cast_into_complex (struct type
*type
, struct value
*val
)
2937 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
2939 if (TYPE_CODE (value_type (val
)) == TYPE_CODE_COMPLEX
)
2941 struct type
*val_real_type
= TYPE_TARGET_TYPE (value_type (val
));
2942 struct value
*re_val
= allocate_value (val_real_type
);
2943 struct value
*im_val
= allocate_value (val_real_type
);
2945 memcpy (value_contents_raw (re_val
),
2946 value_contents (val
), TYPE_LENGTH (val_real_type
));
2947 memcpy (value_contents_raw (im_val
),
2948 value_contents (val
) + TYPE_LENGTH (val_real_type
),
2949 TYPE_LENGTH (val_real_type
));
2951 return value_literal_complex (re_val
, im_val
, type
);
2953 else if (TYPE_CODE (value_type (val
)) == TYPE_CODE_FLT
2954 || TYPE_CODE (value_type (val
)) == TYPE_CODE_INT
)
2955 return value_literal_complex (val
,
2956 value_zero (real_type
, not_lval
),
2959 error (_("cannot cast non-number to complex"));
2963 _initialize_valops (void)
2965 add_setshow_boolean_cmd ("overload-resolution", class_support
,
2966 &overload_resolution
, _("\
2967 Set overload resolution in evaluating C++ functions."), _("\
2968 Show overload resolution in evaluating C++ functions."),
2970 show_overload_resolution
,
2971 &setlist
, &showlist
);
2972 overload_resolution
= 1;