1 /* Perform non-arithmetic operations on values, for GDB.
3 Copyright (C) 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995,
4 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
5 2008, 2009 Free Software Foundation, Inc.
7 This file is part of GDB.
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3 of the License, or
12 (at your option) any later version.
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with this program. If not, see <http://www.gnu.org/licenses/>. */
37 #include "dictionary.h"
38 #include "cp-support.h"
40 #include "user-regs.h"
43 #include "gdb_string.h"
44 #include "gdb_assert.h"
45 #include "cp-support.h"
50 extern int overload_debug
;
51 /* Local functions. */
53 static int typecmp (int staticp
, int varargs
, int nargs
,
54 struct field t1
[], struct value
*t2
[]);
56 static struct value
*search_struct_field (char *, struct value
*,
57 int, struct type
*, int);
59 static struct value
*search_struct_method (char *, struct value
**,
61 int, int *, struct type
*);
63 static int find_oload_champ_namespace (struct type
**, int,
64 const char *, const char *,
66 struct badness_vector
**);
69 int find_oload_champ_namespace_loop (struct type
**, int,
70 const char *, const char *,
71 int, struct symbol
***,
72 struct badness_vector
**, int *);
74 static int find_oload_champ (struct type
**, int, int, int,
75 struct fn_field
*, struct symbol
**,
76 struct badness_vector
**);
78 static int oload_method_static (int, struct fn_field
*, int);
80 enum oload_classification
{ STANDARD
, NON_STANDARD
, INCOMPATIBLE
};
83 oload_classification
classify_oload_match (struct badness_vector
*,
86 static struct value
*value_struct_elt_for_reference (struct type
*,
92 static struct value
*value_namespace_elt (const struct type
*,
93 char *, int , enum noside
);
95 static struct value
*value_maybe_namespace_elt (const struct type
*,
99 static CORE_ADDR
allocate_space_in_inferior (int);
101 static struct value
*cast_into_complex (struct type
*, struct value
*);
103 static struct fn_field
*find_method_list (struct value
**, char *,
104 int, struct type
*, int *,
105 struct type
**, int *);
107 void _initialize_valops (void);
110 /* Flag for whether we want to abandon failed expression evals by
113 static int auto_abandon
= 0;
116 int overload_resolution
= 0;
118 show_overload_resolution (struct ui_file
*file
, int from_tty
,
119 struct cmd_list_element
*c
,
122 fprintf_filtered (file
, _("\
123 Overload resolution in evaluating C++ functions is %s.\n"),
127 /* Find the address of function name NAME in the inferior. If OBJF_P
128 is non-NULL, *OBJF_P will be set to the OBJFILE where the function
132 find_function_in_inferior (const char *name
, struct objfile
**objf_p
)
135 sym
= lookup_symbol (name
, 0, VAR_DOMAIN
, 0);
138 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
140 error (_("\"%s\" exists in this program but is not a function."),
145 *objf_p
= SYMBOL_SYMTAB (sym
)->objfile
;
147 return value_of_variable (sym
, NULL
);
151 struct minimal_symbol
*msymbol
=
152 lookup_minimal_symbol (name
, NULL
, NULL
);
155 struct objfile
*objfile
= msymbol_objfile (msymbol
);
156 struct gdbarch
*gdbarch
= get_objfile_arch (objfile
);
160 type
= lookup_pointer_type (builtin_type (gdbarch
)->builtin_char
);
161 type
= lookup_function_type (type
);
162 type
= lookup_pointer_type (type
);
163 maddr
= SYMBOL_VALUE_ADDRESS (msymbol
);
168 return value_from_pointer (type
, maddr
);
172 if (!target_has_execution
)
173 error (_("evaluation of this expression requires the target program to be active"));
175 error (_("evaluation of this expression requires the program to have a function \"%s\"."), name
);
180 /* Allocate NBYTES of space in the inferior using the inferior's
181 malloc and return a value that is a pointer to the allocated
185 value_allocate_space_in_inferior (int len
)
187 struct objfile
*objf
;
188 struct value
*val
= find_function_in_inferior ("malloc", &objf
);
189 struct gdbarch
*gdbarch
= get_objfile_arch (objf
);
190 struct value
*blocklen
;
192 blocklen
= value_from_longest (builtin_type (gdbarch
)->builtin_int
, len
);
193 val
= call_function_by_hand (val
, 1, &blocklen
);
194 if (value_logical_not (val
))
196 if (!target_has_execution
)
197 error (_("No memory available to program now: you need to start the target first"));
199 error (_("No memory available to program: call to malloc failed"));
205 allocate_space_in_inferior (int len
)
207 return value_as_long (value_allocate_space_in_inferior (len
));
210 /* Cast struct value VAL to type TYPE and return as a value.
211 Both type and val must be of TYPE_CODE_STRUCT or TYPE_CODE_UNION
212 for this to work. Typedef to one of the codes is permitted.
213 Returns NULL if the cast is neither an upcast nor a downcast. */
215 static struct value
*
216 value_cast_structs (struct type
*type
, struct value
*v2
)
222 gdb_assert (type
!= NULL
&& v2
!= NULL
);
224 t1
= check_typedef (type
);
225 t2
= check_typedef (value_type (v2
));
227 /* Check preconditions. */
228 gdb_assert ((TYPE_CODE (t1
) == TYPE_CODE_STRUCT
229 || TYPE_CODE (t1
) == TYPE_CODE_UNION
)
230 && !!"Precondition is that type is of STRUCT or UNION kind.");
231 gdb_assert ((TYPE_CODE (t2
) == TYPE_CODE_STRUCT
232 || TYPE_CODE (t2
) == TYPE_CODE_UNION
)
233 && !!"Precondition is that value is of STRUCT or UNION kind");
235 /* Upcasting: look in the type of the source to see if it contains the
236 type of the target as a superclass. If so, we'll need to
237 offset the pointer rather than just change its type. */
238 if (TYPE_NAME (t1
) != NULL
)
240 v
= search_struct_field (type_name_no_tag (t1
),
246 /* Downcasting: look in the type of the target to see if it contains the
247 type of the source as a superclass. If so, we'll need to
248 offset the pointer rather than just change its type.
249 FIXME: This fails silently with virtual inheritance. */
250 if (TYPE_NAME (t2
) != NULL
)
252 v
= search_struct_field (type_name_no_tag (t2
),
253 value_zero (t1
, not_lval
), 0, t1
, 1);
256 /* Downcasting is possible (t1 is superclass of v2). */
257 CORE_ADDR addr2
= VALUE_ADDRESS (v2
);
258 addr2
-= (VALUE_ADDRESS (v
)
260 + value_embedded_offset (v
));
261 return value_at (type
, addr2
);
268 /* Cast one pointer or reference type to another. Both TYPE and
269 the type of ARG2 should be pointer types, or else both should be
270 reference types. Returns the new pointer or reference. */
273 value_cast_pointers (struct type
*type
, struct value
*arg2
)
275 struct type
*type1
= check_typedef (type
);
276 struct type
*type2
= check_typedef (value_type (arg2
));
277 struct type
*t1
= check_typedef (TYPE_TARGET_TYPE (type
));
278 struct type
*t2
= check_typedef (TYPE_TARGET_TYPE (type2
));
280 if (TYPE_CODE (t1
) == TYPE_CODE_STRUCT
281 && TYPE_CODE (t2
) == TYPE_CODE_STRUCT
282 && !value_logical_not (arg2
))
286 if (TYPE_CODE (type2
) == TYPE_CODE_REF
)
287 v2
= coerce_ref (arg2
);
289 v2
= value_ind (arg2
);
290 gdb_assert (TYPE_CODE (check_typedef (value_type (v2
))) == TYPE_CODE_STRUCT
291 && !!"Why did coercion fail?");
292 v2
= value_cast_structs (t1
, v2
);
293 /* At this point we have what we can have, un-dereference if needed. */
296 struct value
*v
= value_addr (v2
);
297 deprecated_set_value_type (v
, type
);
302 /* No superclass found, just change the pointer type. */
303 arg2
= value_copy (arg2
);
304 deprecated_set_value_type (arg2
, type
);
305 arg2
= value_change_enclosing_type (arg2
, type
);
306 set_value_pointed_to_offset (arg2
, 0); /* pai: chk_val */
310 /* Cast value ARG2 to type TYPE and return as a value.
311 More general than a C cast: accepts any two types of the same length,
312 and if ARG2 is an lvalue it can be cast into anything at all. */
313 /* In C++, casts may change pointer or object representations. */
316 value_cast (struct type
*type
, struct value
*arg2
)
318 enum type_code code1
;
319 enum type_code code2
;
323 int convert_to_boolean
= 0;
325 if (value_type (arg2
) == type
)
328 code1
= TYPE_CODE (check_typedef (type
));
330 /* Check if we are casting struct reference to struct reference. */
331 if (code1
== TYPE_CODE_REF
)
333 /* We dereference type; then we recurse and finally
334 we generate value of the given reference. Nothing wrong with
336 struct type
*t1
= check_typedef (type
);
337 struct type
*dereftype
= check_typedef (TYPE_TARGET_TYPE (t1
));
338 struct value
*val
= value_cast (dereftype
, arg2
);
339 return value_ref (val
);
342 code2
= TYPE_CODE (check_typedef (value_type (arg2
)));
344 if (code2
== TYPE_CODE_REF
)
345 /* We deref the value and then do the cast. */
346 return value_cast (type
, coerce_ref (arg2
));
348 CHECK_TYPEDEF (type
);
349 code1
= TYPE_CODE (type
);
350 arg2
= coerce_ref (arg2
);
351 type2
= check_typedef (value_type (arg2
));
353 /* You can't cast to a reference type. See value_cast_pointers
355 gdb_assert (code1
!= TYPE_CODE_REF
);
357 /* A cast to an undetermined-length array_type, such as
358 (TYPE [])OBJECT, is treated like a cast to (TYPE [N])OBJECT,
359 where N is sizeof(OBJECT)/sizeof(TYPE). */
360 if (code1
== TYPE_CODE_ARRAY
)
362 struct type
*element_type
= TYPE_TARGET_TYPE (type
);
363 unsigned element_length
= TYPE_LENGTH (check_typedef (element_type
));
364 if (element_length
> 0 && TYPE_ARRAY_UPPER_BOUND_IS_UNDEFINED (type
))
366 struct type
*range_type
= TYPE_INDEX_TYPE (type
);
367 int val_length
= TYPE_LENGTH (type2
);
368 LONGEST low_bound
, high_bound
, new_length
;
369 if (get_discrete_bounds (range_type
, &low_bound
, &high_bound
) < 0)
370 low_bound
= 0, high_bound
= 0;
371 new_length
= val_length
/ element_length
;
372 if (val_length
% element_length
!= 0)
373 warning (_("array element type size does not divide object size in cast"));
374 /* FIXME-type-allocation: need a way to free this type when
375 we are done with it. */
376 range_type
= create_range_type ((struct type
*) NULL
,
377 TYPE_TARGET_TYPE (range_type
),
379 new_length
+ low_bound
- 1);
380 deprecated_set_value_type (arg2
,
381 create_array_type ((struct type
*) NULL
,
388 if (current_language
->c_style_arrays
389 && TYPE_CODE (type2
) == TYPE_CODE_ARRAY
)
390 arg2
= value_coerce_array (arg2
);
392 if (TYPE_CODE (type2
) == TYPE_CODE_FUNC
)
393 arg2
= value_coerce_function (arg2
);
395 type2
= check_typedef (value_type (arg2
));
396 code2
= TYPE_CODE (type2
);
398 if (code1
== TYPE_CODE_COMPLEX
)
399 return cast_into_complex (type
, arg2
);
400 if (code1
== TYPE_CODE_BOOL
)
402 code1
= TYPE_CODE_INT
;
403 convert_to_boolean
= 1;
405 if (code1
== TYPE_CODE_CHAR
)
406 code1
= TYPE_CODE_INT
;
407 if (code2
== TYPE_CODE_BOOL
|| code2
== TYPE_CODE_CHAR
)
408 code2
= TYPE_CODE_INT
;
410 scalar
= (code2
== TYPE_CODE_INT
|| code2
== TYPE_CODE_FLT
411 || code2
== TYPE_CODE_DECFLOAT
|| code2
== TYPE_CODE_ENUM
412 || code2
== TYPE_CODE_RANGE
);
414 if ((code1
== TYPE_CODE_STRUCT
|| code1
== TYPE_CODE_UNION
)
415 && (code2
== TYPE_CODE_STRUCT
|| code2
== TYPE_CODE_UNION
)
416 && TYPE_NAME (type
) != 0)
418 struct value
*v
= value_cast_structs (type
, arg2
);
423 if (code1
== TYPE_CODE_FLT
&& scalar
)
424 return value_from_double (type
, value_as_double (arg2
));
425 else if (code1
== TYPE_CODE_DECFLOAT
&& scalar
)
427 int dec_len
= TYPE_LENGTH (type
);
430 if (code2
== TYPE_CODE_FLT
)
431 decimal_from_floating (arg2
, dec
, dec_len
);
432 else if (code2
== TYPE_CODE_DECFLOAT
)
433 decimal_convert (value_contents (arg2
), TYPE_LENGTH (type2
),
436 /* The only option left is an integral type. */
437 decimal_from_integral (arg2
, dec
, dec_len
);
439 return value_from_decfloat (type
, dec
);
441 else if ((code1
== TYPE_CODE_INT
|| code1
== TYPE_CODE_ENUM
442 || code1
== TYPE_CODE_RANGE
)
443 && (scalar
|| code2
== TYPE_CODE_PTR
444 || code2
== TYPE_CODE_MEMBERPTR
))
448 /* When we cast pointers to integers, we mustn't use
449 gdbarch_pointer_to_address to find the address the pointer
450 represents, as value_as_long would. GDB should evaluate
451 expressions just as the compiler would --- and the compiler
452 sees a cast as a simple reinterpretation of the pointer's
454 if (code2
== TYPE_CODE_PTR
)
455 longest
= extract_unsigned_integer (value_contents (arg2
),
456 TYPE_LENGTH (type2
));
458 longest
= value_as_long (arg2
);
459 return value_from_longest (type
, convert_to_boolean
?
460 (LONGEST
) (longest
? 1 : 0) : longest
);
462 else if (code1
== TYPE_CODE_PTR
&& (code2
== TYPE_CODE_INT
463 || code2
== TYPE_CODE_ENUM
464 || code2
== TYPE_CODE_RANGE
))
466 /* TYPE_LENGTH (type) is the length of a pointer, but we really
467 want the length of an address! -- we are really dealing with
468 addresses (i.e., gdb representations) not pointers (i.e.,
469 target representations) here.
471 This allows things like "print *(int *)0x01000234" to work
472 without printing a misleading message -- which would
473 otherwise occur when dealing with a target having two byte
474 pointers and four byte addresses. */
476 int addr_bit
= gdbarch_addr_bit (current_gdbarch
);
478 LONGEST longest
= value_as_long (arg2
);
479 if (addr_bit
< sizeof (LONGEST
) * HOST_CHAR_BIT
)
481 if (longest
>= ((LONGEST
) 1 << addr_bit
)
482 || longest
<= -((LONGEST
) 1 << addr_bit
))
483 warning (_("value truncated"));
485 return value_from_longest (type
, longest
);
487 else if (code1
== TYPE_CODE_METHODPTR
&& code2
== TYPE_CODE_INT
488 && value_as_long (arg2
) == 0)
490 struct value
*result
= allocate_value (type
);
491 cplus_make_method_ptr (type
, value_contents_writeable (result
), 0, 0);
494 else if (code1
== TYPE_CODE_MEMBERPTR
&& code2
== TYPE_CODE_INT
495 && value_as_long (arg2
) == 0)
497 /* The Itanium C++ ABI represents NULL pointers to members as
498 minus one, instead of biasing the normal case. */
499 return value_from_longest (type
, -1);
501 else if (TYPE_LENGTH (type
) == TYPE_LENGTH (type2
))
503 if (code1
== TYPE_CODE_PTR
&& code2
== TYPE_CODE_PTR
)
504 return value_cast_pointers (type
, arg2
);
506 arg2
= value_copy (arg2
);
507 deprecated_set_value_type (arg2
, type
);
508 arg2
= value_change_enclosing_type (arg2
, type
);
509 set_value_pointed_to_offset (arg2
, 0); /* pai: chk_val */
512 else if (VALUE_LVAL (arg2
) == lval_memory
)
513 return value_at_lazy (type
,
514 VALUE_ADDRESS (arg2
) + value_offset (arg2
));
515 else if (code1
== TYPE_CODE_VOID
)
517 return value_zero (builtin_type_void
, not_lval
);
521 error (_("Invalid cast."));
526 /* Create a value of type TYPE that is zero, and return it. */
529 value_zero (struct type
*type
, enum lval_type lv
)
531 struct value
*val
= allocate_value (type
);
532 VALUE_LVAL (val
) = lv
;
537 /* Create a value of numeric type TYPE that is one, and return it. */
540 value_one (struct type
*type
, enum lval_type lv
)
542 struct type
*type1
= check_typedef (type
);
543 struct value
*val
= NULL
; /* avoid -Wall warning */
545 if (TYPE_CODE (type1
) == TYPE_CODE_DECFLOAT
)
547 struct value
*int_one
= value_from_longest (builtin_type_int32
, 1);
551 decimal_from_integral (int_one
, v
, TYPE_LENGTH (builtin_type_int32
));
552 val
= value_from_decfloat (type
, v
);
554 else if (TYPE_CODE (type1
) == TYPE_CODE_FLT
)
556 val
= value_from_double (type
, (DOUBLEST
) 1);
558 else if (is_integral_type (type1
))
560 val
= value_from_longest (type
, (LONGEST
) 1);
564 error (_("Not a numeric type."));
567 VALUE_LVAL (val
) = lv
;
571 /* Return a value with type TYPE located at ADDR.
573 Call value_at only if the data needs to be fetched immediately;
574 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
575 value_at_lazy instead. value_at_lazy simply records the address of
576 the data and sets the lazy-evaluation-required flag. The lazy flag
577 is tested in the value_contents macro, which is used if and when
578 the contents are actually required.
580 Note: value_at does *NOT* handle embedded offsets; perform such
581 adjustments before or after calling it. */
584 value_at (struct type
*type
, CORE_ADDR addr
)
588 if (TYPE_CODE (check_typedef (type
)) == TYPE_CODE_VOID
)
589 error (_("Attempt to dereference a generic pointer."));
591 val
= allocate_value (type
);
593 read_memory (addr
, value_contents_all_raw (val
), TYPE_LENGTH (type
));
595 VALUE_LVAL (val
) = lval_memory
;
596 VALUE_ADDRESS (val
) = addr
;
601 /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
604 value_at_lazy (struct type
*type
, CORE_ADDR addr
)
608 if (TYPE_CODE (check_typedef (type
)) == TYPE_CODE_VOID
)
609 error (_("Attempt to dereference a generic pointer."));
611 val
= allocate_value_lazy (type
);
613 VALUE_LVAL (val
) = lval_memory
;
614 VALUE_ADDRESS (val
) = addr
;
619 /* Called only from the value_contents and value_contents_all()
620 macros, if the current data for a variable needs to be loaded into
621 value_contents(VAL). Fetches the data from the user's process, and
622 clears the lazy flag to indicate that the data in the buffer is
625 If the value is zero-length, we avoid calling read_memory, which
626 would abort. We mark the value as fetched anyway -- all 0 bytes of
629 This function returns a value because it is used in the
630 value_contents macro as part of an expression, where a void would
631 not work. The value is ignored. */
634 value_fetch_lazy (struct value
*val
)
636 gdb_assert (value_lazy (val
));
637 allocate_value_contents (val
);
638 if (VALUE_LVAL (val
) == lval_memory
)
640 CORE_ADDR addr
= VALUE_ADDRESS (val
) + value_offset (val
);
641 int length
= TYPE_LENGTH (check_typedef (value_enclosing_type (val
)));
644 read_memory (addr
, value_contents_all_raw (val
), length
);
646 else if (VALUE_LVAL (val
) == lval_register
)
648 struct frame_info
*frame
;
650 struct type
*type
= check_typedef (value_type (val
));
651 struct value
*new_val
= val
, *mark
= value_mark ();
653 /* Offsets are not supported here; lazy register values must
654 refer to the entire register. */
655 gdb_assert (value_offset (val
) == 0);
657 while (VALUE_LVAL (new_val
) == lval_register
&& value_lazy (new_val
))
659 frame
= frame_find_by_id (VALUE_FRAME_ID (new_val
));
660 regnum
= VALUE_REGNUM (new_val
);
662 gdb_assert (frame
!= NULL
);
664 /* Convertible register routines are used for multi-register
665 values and for interpretation in different types
666 (e.g. float or int from a double register). Lazy
667 register values should have the register's natural type,
668 so they do not apply. */
669 gdb_assert (!gdbarch_convert_register_p (get_frame_arch (frame
),
672 new_val
= get_frame_register_value (frame
, regnum
);
675 /* If it's still lazy (for instance, a saved register on the
677 if (value_lazy (new_val
))
678 value_fetch_lazy (new_val
);
680 /* If the register was not saved, mark it unavailable. */
681 if (value_optimized_out (new_val
))
682 set_value_optimized_out (val
, 1);
684 memcpy (value_contents_raw (val
), value_contents (new_val
),
689 struct gdbarch
*gdbarch
;
690 frame
= frame_find_by_id (VALUE_FRAME_ID (val
));
691 regnum
= VALUE_REGNUM (val
);
692 gdbarch
= get_frame_arch (frame
);
694 fprintf_unfiltered (gdb_stdlog
, "\
695 { value_fetch_lazy (frame=%d,regnum=%d(%s),...) ",
696 frame_relative_level (frame
), regnum
,
697 user_reg_map_regnum_to_name (gdbarch
, regnum
));
699 fprintf_unfiltered (gdb_stdlog
, "->");
700 if (value_optimized_out (new_val
))
701 fprintf_unfiltered (gdb_stdlog
, " optimized out");
705 const gdb_byte
*buf
= value_contents (new_val
);
707 if (VALUE_LVAL (new_val
) == lval_register
)
708 fprintf_unfiltered (gdb_stdlog
, " register=%d",
709 VALUE_REGNUM (new_val
));
710 else if (VALUE_LVAL (new_val
) == lval_memory
)
711 fprintf_unfiltered (gdb_stdlog
, " address=0x%s",
712 paddr_nz (VALUE_ADDRESS (new_val
)));
714 fprintf_unfiltered (gdb_stdlog
, " computed");
716 fprintf_unfiltered (gdb_stdlog
, " bytes=");
717 fprintf_unfiltered (gdb_stdlog
, "[");
718 for (i
= 0; i
< register_size (gdbarch
, regnum
); i
++)
719 fprintf_unfiltered (gdb_stdlog
, "%02x", buf
[i
]);
720 fprintf_unfiltered (gdb_stdlog
, "]");
723 fprintf_unfiltered (gdb_stdlog
, " }\n");
726 /* Dispose of the intermediate values. This prevents
727 watchpoints from trying to watch the saved frame pointer. */
728 value_free_to_mark (mark
);
731 internal_error (__FILE__
, __LINE__
, "Unexpected lazy value type.");
733 set_value_lazy (val
, 0);
738 /* Store the contents of FROMVAL into the location of TOVAL.
739 Return a new value with the location of TOVAL and contents of FROMVAL. */
742 value_assign (struct value
*toval
, struct value
*fromval
)
746 struct frame_id old_frame
;
748 if (!deprecated_value_modifiable (toval
))
749 error (_("Left operand of assignment is not a modifiable lvalue."));
751 toval
= coerce_ref (toval
);
753 type
= value_type (toval
);
754 if (VALUE_LVAL (toval
) != lval_internalvar
)
756 toval
= value_coerce_to_target (toval
);
757 fromval
= value_cast (type
, fromval
);
761 /* Coerce arrays and functions to pointers, except for arrays
762 which only live in GDB's storage. */
763 if (!value_must_coerce_to_target (fromval
))
764 fromval
= coerce_array (fromval
);
767 CHECK_TYPEDEF (type
);
769 /* Since modifying a register can trash the frame chain, and
770 modifying memory can trash the frame cache, we save the old frame
771 and then restore the new frame afterwards. */
772 old_frame
= get_frame_id (deprecated_safe_get_selected_frame ());
774 switch (VALUE_LVAL (toval
))
776 case lval_internalvar
:
777 set_internalvar (VALUE_INTERNALVAR (toval
), fromval
);
778 val
= value_copy (VALUE_INTERNALVAR (toval
)->value
);
779 val
= value_change_enclosing_type (val
,
780 value_enclosing_type (fromval
));
781 set_value_embedded_offset (val
, value_embedded_offset (fromval
));
782 set_value_pointed_to_offset (val
,
783 value_pointed_to_offset (fromval
));
786 case lval_internalvar_component
:
787 set_internalvar_component (VALUE_INTERNALVAR (toval
),
788 value_offset (toval
),
789 value_bitpos (toval
),
790 value_bitsize (toval
),
796 const gdb_byte
*dest_buffer
;
797 CORE_ADDR changed_addr
;
799 gdb_byte buffer
[sizeof (LONGEST
)];
801 if (value_bitsize (toval
))
803 /* We assume that the argument to read_memory is in units
804 of host chars. FIXME: Is that correct? */
805 changed_len
= (value_bitpos (toval
)
806 + value_bitsize (toval
)
810 if (changed_len
> (int) sizeof (LONGEST
))
811 error (_("Can't handle bitfields which don't fit in a %d bit word."),
812 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
814 read_memory (VALUE_ADDRESS (toval
) + value_offset (toval
),
815 buffer
, changed_len
);
816 modify_field (buffer
, value_as_long (fromval
),
817 value_bitpos (toval
), value_bitsize (toval
));
818 changed_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
819 dest_buffer
= buffer
;
823 changed_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
824 changed_len
= TYPE_LENGTH (type
);
825 dest_buffer
= value_contents (fromval
);
828 write_memory (changed_addr
, dest_buffer
, changed_len
);
829 if (deprecated_memory_changed_hook
)
830 deprecated_memory_changed_hook (changed_addr
, changed_len
);
836 struct frame_info
*frame
;
839 /* Figure out which frame this is in currently. */
840 frame
= frame_find_by_id (VALUE_FRAME_ID (toval
));
841 value_reg
= VALUE_REGNUM (toval
);
844 error (_("Value being assigned to is no longer active."));
846 if (gdbarch_convert_register_p
847 (current_gdbarch
, VALUE_REGNUM (toval
), type
))
849 /* If TOVAL is a special machine register requiring
850 conversion of program values to a special raw
852 gdbarch_value_to_register (current_gdbarch
, frame
,
853 VALUE_REGNUM (toval
), type
,
854 value_contents (fromval
));
858 if (value_bitsize (toval
))
861 gdb_byte buffer
[sizeof (LONGEST
)];
863 changed_len
= (value_bitpos (toval
)
864 + value_bitsize (toval
)
868 if (changed_len
> (int) sizeof (LONGEST
))
869 error (_("Can't handle bitfields which don't fit in a %d bit word."),
870 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
872 get_frame_register_bytes (frame
, value_reg
,
873 value_offset (toval
),
874 changed_len
, buffer
);
876 modify_field (buffer
, value_as_long (fromval
),
877 value_bitpos (toval
),
878 value_bitsize (toval
));
880 put_frame_register_bytes (frame
, value_reg
,
881 value_offset (toval
),
882 changed_len
, buffer
);
886 put_frame_register_bytes (frame
, value_reg
,
887 value_offset (toval
),
889 value_contents (fromval
));
893 if (deprecated_register_changed_hook
)
894 deprecated_register_changed_hook (-1);
895 observer_notify_target_changed (¤t_target
);
900 error (_("Left operand of assignment is not an lvalue."));
903 /* Assigning to the stack pointer, frame pointer, and other
904 (architecture and calling convention specific) registers may
905 cause the frame cache to be out of date. Assigning to memory
906 also can. We just do this on all assignments to registers or
907 memory, for simplicity's sake; I doubt the slowdown matters. */
908 switch (VALUE_LVAL (toval
))
913 reinit_frame_cache ();
915 /* Having destroyed the frame cache, restore the selected
918 /* FIXME: cagney/2002-11-02: There has to be a better way of
919 doing this. Instead of constantly saving/restoring the
920 frame. Why not create a get_selected_frame() function that,
921 having saved the selected frame's ID can automatically
922 re-find the previously selected frame automatically. */
925 struct frame_info
*fi
= frame_find_by_id (old_frame
);
935 /* If the field does not entirely fill a LONGEST, then zero the sign
936 bits. If the field is signed, and is negative, then sign
938 if ((value_bitsize (toval
) > 0)
939 && (value_bitsize (toval
) < 8 * (int) sizeof (LONGEST
)))
941 LONGEST fieldval
= value_as_long (fromval
);
942 LONGEST valmask
= (((ULONGEST
) 1) << value_bitsize (toval
)) - 1;
945 if (!TYPE_UNSIGNED (type
)
946 && (fieldval
& (valmask
^ (valmask
>> 1))))
947 fieldval
|= ~valmask
;
949 fromval
= value_from_longest (type
, fieldval
);
952 val
= value_copy (toval
);
953 memcpy (value_contents_raw (val
), value_contents (fromval
),
955 deprecated_set_value_type (val
, type
);
956 val
= value_change_enclosing_type (val
,
957 value_enclosing_type (fromval
));
958 set_value_embedded_offset (val
, value_embedded_offset (fromval
));
959 set_value_pointed_to_offset (val
, value_pointed_to_offset (fromval
));
964 /* Extend a value VAL to COUNT repetitions of its type. */
967 value_repeat (struct value
*arg1
, int count
)
971 if (VALUE_LVAL (arg1
) != lval_memory
)
972 error (_("Only values in memory can be extended with '@'."));
974 error (_("Invalid number %d of repetitions."), count
);
976 val
= allocate_repeat_value (value_enclosing_type (arg1
), count
);
978 read_memory (VALUE_ADDRESS (arg1
) + value_offset (arg1
),
979 value_contents_all_raw (val
),
980 TYPE_LENGTH (value_enclosing_type (val
)));
981 VALUE_LVAL (val
) = lval_memory
;
982 VALUE_ADDRESS (val
) = VALUE_ADDRESS (arg1
) + value_offset (arg1
);
988 value_of_variable (struct symbol
*var
, struct block
*b
)
991 struct frame_info
*frame
= NULL
;
994 frame
= NULL
; /* Use selected frame. */
995 else if (symbol_read_needs_frame (var
))
997 frame
= block_innermost_frame (b
);
1000 if (BLOCK_FUNCTION (b
)
1001 && SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b
)))
1002 error (_("No frame is currently executing in block %s."),
1003 SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b
)));
1005 error (_("No frame is currently executing in specified block"));
1009 val
= read_var_value (var
, frame
);
1011 error (_("Address of symbol \"%s\" is unknown."), SYMBOL_PRINT_NAME (var
));
1016 /* Return one if VAL does not live in target memory, but should in order
1017 to operate on it. Otherwise return zero. */
1020 value_must_coerce_to_target (struct value
*val
)
1022 struct type
*valtype
;
1024 /* The only lval kinds which do not live in target memory. */
1025 if (VALUE_LVAL (val
) != not_lval
1026 && VALUE_LVAL (val
) != lval_internalvar
)
1029 valtype
= check_typedef (value_type (val
));
1031 switch (TYPE_CODE (valtype
))
1033 case TYPE_CODE_ARRAY
:
1034 case TYPE_CODE_STRING
:
1041 /* Make sure that VAL lives in target memory if it's supposed to. For instance,
1042 strings are constructed as character arrays in GDB's storage, and this
1043 function copies them to the target. */
1046 value_coerce_to_target (struct value
*val
)
1051 if (!value_must_coerce_to_target (val
))
1054 length
= TYPE_LENGTH (check_typedef (value_type (val
)));
1055 addr
= allocate_space_in_inferior (length
);
1056 write_memory (addr
, value_contents (val
), length
);
1057 return value_at_lazy (value_type (val
), addr
);
1060 /* Given a value which is an array, return a value which is a pointer
1061 to its first element, regardless of whether or not the array has a
1062 nonzero lower bound.
1064 FIXME: A previous comment here indicated that this routine should
1065 be substracting the array's lower bound. It's not clear to me that
1066 this is correct. Given an array subscripting operation, it would
1067 certainly work to do the adjustment here, essentially computing:
1069 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
1071 However I believe a more appropriate and logical place to account
1072 for the lower bound is to do so in value_subscript, essentially
1075 (&array[0] + ((index - lowerbound) * sizeof array[0]))
1077 As further evidence consider what would happen with operations
1078 other than array subscripting, where the caller would get back a
1079 value that had an address somewhere before the actual first element
1080 of the array, and the information about the lower bound would be
1081 lost because of the coercion to pointer type.
1085 value_coerce_array (struct value
*arg1
)
1087 struct type
*type
= check_typedef (value_type (arg1
));
1089 /* If the user tries to do something requiring a pointer with an
1090 array that has not yet been pushed to the target, then this would
1091 be a good time to do so. */
1092 arg1
= value_coerce_to_target (arg1
);
1094 if (VALUE_LVAL (arg1
) != lval_memory
)
1095 error (_("Attempt to take address of value not located in memory."));
1097 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
1098 (VALUE_ADDRESS (arg1
) + value_offset (arg1
)));
1101 /* Given a value which is a function, return a value which is a pointer
1105 value_coerce_function (struct value
*arg1
)
1107 struct value
*retval
;
1109 if (VALUE_LVAL (arg1
) != lval_memory
)
1110 error (_("Attempt to take address of value not located in memory."));
1112 retval
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1113 (VALUE_ADDRESS (arg1
) + value_offset (arg1
)));
1117 /* Return a pointer value for the object for which ARG1 is the
1121 value_addr (struct value
*arg1
)
1125 struct type
*type
= check_typedef (value_type (arg1
));
1126 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
1128 /* Copy the value, but change the type from (T&) to (T*). We
1129 keep the same location information, which is efficient, and
1130 allows &(&X) to get the location containing the reference. */
1131 arg2
= value_copy (arg1
);
1132 deprecated_set_value_type (arg2
,
1133 lookup_pointer_type (TYPE_TARGET_TYPE (type
)));
1136 if (TYPE_CODE (type
) == TYPE_CODE_FUNC
)
1137 return value_coerce_function (arg1
);
1139 /* If this is an array that has not yet been pushed to the target,
1140 then this would be a good time to force it to memory. */
1141 arg1
= value_coerce_to_target (arg1
);
1143 if (VALUE_LVAL (arg1
) != lval_memory
)
1144 error (_("Attempt to take address of value not located in memory."));
1146 /* Get target memory address */
1147 arg2
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1148 (VALUE_ADDRESS (arg1
)
1149 + value_offset (arg1
)
1150 + value_embedded_offset (arg1
)));
1152 /* This may be a pointer to a base subobject; so remember the
1153 full derived object's type ... */
1154 arg2
= value_change_enclosing_type (arg2
, lookup_pointer_type (value_enclosing_type (arg1
)));
1155 /* ... and also the relative position of the subobject in the full
1157 set_value_pointed_to_offset (arg2
, value_embedded_offset (arg1
));
1161 /* Return a reference value for the object for which ARG1 is the
1165 value_ref (struct value
*arg1
)
1169 struct type
*type
= check_typedef (value_type (arg1
));
1170 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
1173 arg2
= value_addr (arg1
);
1174 deprecated_set_value_type (arg2
, lookup_reference_type (type
));
1178 /* Given a value of a pointer type, apply the C unary * operator to
1182 value_ind (struct value
*arg1
)
1184 struct type
*base_type
;
1187 arg1
= coerce_array (arg1
);
1189 base_type
= check_typedef (value_type (arg1
));
1191 if (TYPE_CODE (base_type
) == TYPE_CODE_PTR
)
1193 struct type
*enc_type
;
1194 /* We may be pointing to something embedded in a larger object.
1195 Get the real type of the enclosing object. */
1196 enc_type
= check_typedef (value_enclosing_type (arg1
));
1197 enc_type
= TYPE_TARGET_TYPE (enc_type
);
1199 if (TYPE_CODE (check_typedef (enc_type
)) == TYPE_CODE_FUNC
1200 || TYPE_CODE (check_typedef (enc_type
)) == TYPE_CODE_METHOD
)
1201 /* For functions, go through find_function_addr, which knows
1202 how to handle function descriptors. */
1203 arg2
= value_at_lazy (enc_type
,
1204 find_function_addr (arg1
, NULL
));
1206 /* Retrieve the enclosing object pointed to */
1207 arg2
= value_at_lazy (enc_type
,
1208 (value_as_address (arg1
)
1209 - value_pointed_to_offset (arg1
)));
1211 /* Re-adjust type. */
1212 deprecated_set_value_type (arg2
, TYPE_TARGET_TYPE (base_type
));
1213 /* Add embedding info. */
1214 arg2
= value_change_enclosing_type (arg2
, enc_type
);
1215 set_value_embedded_offset (arg2
, value_pointed_to_offset (arg1
));
1217 /* We may be pointing to an object of some derived type. */
1218 arg2
= value_full_object (arg2
, NULL
, 0, 0, 0);
1222 error (_("Attempt to take contents of a non-pointer value."));
1223 return 0; /* For lint -- never reached. */
1226 /* Create a value for an array by allocating space in GDB, copying
1227 copying the data into that space, and then setting up an array
1230 The array bounds are set from LOWBOUND and HIGHBOUND, and the array
1231 is populated from the values passed in ELEMVEC.
1233 The element type of the array is inherited from the type of the
1234 first element, and all elements must have the same size (though we
1235 don't currently enforce any restriction on their types). */
1238 value_array (int lowbound
, int highbound
, struct value
**elemvec
)
1242 unsigned int typelength
;
1244 struct type
*rangetype
;
1245 struct type
*arraytype
;
1248 /* Validate that the bounds are reasonable and that each of the
1249 elements have the same size. */
1251 nelem
= highbound
- lowbound
+ 1;
1254 error (_("bad array bounds (%d, %d)"), lowbound
, highbound
);
1256 typelength
= TYPE_LENGTH (value_enclosing_type (elemvec
[0]));
1257 for (idx
= 1; idx
< nelem
; idx
++)
1259 if (TYPE_LENGTH (value_enclosing_type (elemvec
[idx
])) != typelength
)
1261 error (_("array elements must all be the same size"));
1265 rangetype
= create_range_type ((struct type
*) NULL
,
1267 lowbound
, highbound
);
1268 arraytype
= create_array_type ((struct type
*) NULL
,
1269 value_enclosing_type (elemvec
[0]),
1272 if (!current_language
->c_style_arrays
)
1274 val
= allocate_value (arraytype
);
1275 for (idx
= 0; idx
< nelem
; idx
++)
1277 memcpy (value_contents_all_raw (val
) + (idx
* typelength
),
1278 value_contents_all (elemvec
[idx
]),
1284 /* Allocate space to store the array, and then initialize it by
1285 copying in each element. */
1287 val
= allocate_value (arraytype
);
1288 for (idx
= 0; idx
< nelem
; idx
++)
1289 memcpy (value_contents_writeable (val
) + (idx
* typelength
),
1290 value_contents_all (elemvec
[idx
]),
1295 /* Create a value for a string constant by allocating space in the
1296 inferior, copying the data into that space, and returning the
1297 address with type TYPE_CODE_STRING. PTR points to the string
1298 constant data; LEN is number of characters.
1300 Note that string types are like array of char types with a lower
1301 bound of zero and an upper bound of LEN - 1. Also note that the
1302 string may contain embedded null bytes. */
1305 value_string (char *ptr
, int len
)
1308 int lowbound
= current_language
->string_lower_bound
;
1309 struct type
*rangetype
= create_range_type ((struct type
*) NULL
,
1312 len
+ lowbound
- 1);
1313 struct type
*stringtype
1314 = create_string_type ((struct type
*) NULL
, rangetype
);
1317 if (current_language
->c_style_arrays
== 0)
1319 val
= allocate_value (stringtype
);
1320 memcpy (value_contents_raw (val
), ptr
, len
);
1325 /* Allocate space to store the string in the inferior, and then copy
1326 LEN bytes from PTR in gdb to that address in the inferior. */
1328 addr
= allocate_space_in_inferior (len
);
1329 write_memory (addr
, (gdb_byte
*) ptr
, len
);
1331 val
= value_at_lazy (stringtype
, addr
);
1336 value_bitstring (char *ptr
, int len
)
1339 struct type
*domain_type
= create_range_type (NULL
,
1342 struct type
*type
= create_set_type ((struct type
*) NULL
,
1344 TYPE_CODE (type
) = TYPE_CODE_BITSTRING
;
1345 val
= allocate_value (type
);
1346 memcpy (value_contents_raw (val
), ptr
, TYPE_LENGTH (type
));
1350 /* See if we can pass arguments in T2 to a function which takes
1351 arguments of types T1. T1 is a list of NARGS arguments, and T2 is
1352 a NULL-terminated vector. If some arguments need coercion of some
1353 sort, then the coerced values are written into T2. Return value is
1354 0 if the arguments could be matched, or the position at which they
1357 STATICP is nonzero if the T1 argument list came from a static
1358 member function. T2 will still include the ``this'' pointer, but
1361 For non-static member functions, we ignore the first argument,
1362 which is the type of the instance variable. This is because we
1363 want to handle calls with objects from derived classes. This is
1364 not entirely correct: we should actually check to make sure that a
1365 requested operation is type secure, shouldn't we? FIXME. */
1368 typecmp (int staticp
, int varargs
, int nargs
,
1369 struct field t1
[], struct value
*t2
[])
1374 internal_error (__FILE__
, __LINE__
,
1375 _("typecmp: no argument list"));
1377 /* Skip ``this'' argument if applicable. T2 will always include
1383 (i
< nargs
) && TYPE_CODE (t1
[i
].type
) != TYPE_CODE_VOID
;
1386 struct type
*tt1
, *tt2
;
1391 tt1
= check_typedef (t1
[i
].type
);
1392 tt2
= check_typedef (value_type (t2
[i
]));
1394 if (TYPE_CODE (tt1
) == TYPE_CODE_REF
1395 /* We should be doing hairy argument matching, as below. */
1396 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1
))) == TYPE_CODE (tt2
)))
1398 if (TYPE_CODE (tt2
) == TYPE_CODE_ARRAY
)
1399 t2
[i
] = value_coerce_array (t2
[i
]);
1401 t2
[i
] = value_ref (t2
[i
]);
1405 /* djb - 20000715 - Until the new type structure is in the
1406 place, and we can attempt things like implicit conversions,
1407 we need to do this so you can take something like a map<const
1408 char *>, and properly access map["hello"], because the
1409 argument to [] will be a reference to a pointer to a char,
1410 and the argument will be a pointer to a char. */
1411 while (TYPE_CODE(tt1
) == TYPE_CODE_REF
1412 || TYPE_CODE (tt1
) == TYPE_CODE_PTR
)
1414 tt1
= check_typedef( TYPE_TARGET_TYPE(tt1
) );
1416 while (TYPE_CODE(tt2
) == TYPE_CODE_ARRAY
1417 || TYPE_CODE(tt2
) == TYPE_CODE_PTR
1418 || TYPE_CODE(tt2
) == TYPE_CODE_REF
)
1420 tt2
= check_typedef (TYPE_TARGET_TYPE(tt2
));
1422 if (TYPE_CODE (tt1
) == TYPE_CODE (tt2
))
1424 /* Array to pointer is a `trivial conversion' according to the
1427 /* We should be doing much hairier argument matching (see
1428 section 13.2 of the ARM), but as a quick kludge, just check
1429 for the same type code. */
1430 if (TYPE_CODE (t1
[i
].type
) != TYPE_CODE (value_type (t2
[i
])))
1433 if (varargs
|| t2
[i
] == NULL
)
1438 /* Helper function used by value_struct_elt to recurse through
1439 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1440 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1441 TYPE. If found, return value, else return NULL.
1443 If LOOKING_FOR_BASECLASS, then instead of looking for struct
1444 fields, look for a baseclass named NAME. */
1446 static struct value
*
1447 search_struct_field (char *name
, struct value
*arg1
, int offset
,
1448 struct type
*type
, int looking_for_baseclass
)
1451 int nbases
= TYPE_N_BASECLASSES (type
);
1453 CHECK_TYPEDEF (type
);
1455 if (!looking_for_baseclass
)
1456 for (i
= TYPE_NFIELDS (type
) - 1; i
>= nbases
; i
--)
1458 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
1460 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1463 if (field_is_static (&TYPE_FIELD (type
, i
)))
1465 v
= value_static_field (type
, i
);
1467 error (_("field %s is nonexistent or has been optimised out"),
1472 v
= value_primitive_field (arg1
, offset
, i
, type
);
1474 error (_("there is no field named %s"), name
);
1480 && (t_field_name
[0] == '\0'
1481 || (TYPE_CODE (type
) == TYPE_CODE_UNION
1482 && (strcmp_iw (t_field_name
, "else") == 0))))
1484 struct type
*field_type
= TYPE_FIELD_TYPE (type
, i
);
1485 if (TYPE_CODE (field_type
) == TYPE_CODE_UNION
1486 || TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
)
1488 /* Look for a match through the fields of an anonymous
1489 union, or anonymous struct. C++ provides anonymous
1492 In the GNU Chill (now deleted from GDB)
1493 implementation of variant record types, each
1494 <alternative field> has an (anonymous) union type,
1495 each member of the union represents a <variant
1496 alternative>. Each <variant alternative> is
1497 represented as a struct, with a member for each
1501 int new_offset
= offset
;
1503 /* This is pretty gross. In G++, the offset in an
1504 anonymous union is relative to the beginning of the
1505 enclosing struct. In the GNU Chill (now deleted
1506 from GDB) implementation of variant records, the
1507 bitpos is zero in an anonymous union field, so we
1508 have to add the offset of the union here. */
1509 if (TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
1510 || (TYPE_NFIELDS (field_type
) > 0
1511 && TYPE_FIELD_BITPOS (field_type
, 0) == 0))
1512 new_offset
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
1514 v
= search_struct_field (name
, arg1
, new_offset
,
1516 looking_for_baseclass
);
1523 for (i
= 0; i
< nbases
; i
++)
1526 struct type
*basetype
= check_typedef (TYPE_BASECLASS (type
, i
));
1527 /* If we are looking for baseclasses, this is what we get when
1528 we hit them. But it could happen that the base part's member
1529 name is not yet filled in. */
1530 int found_baseclass
= (looking_for_baseclass
1531 && TYPE_BASECLASS_NAME (type
, i
) != NULL
1532 && (strcmp_iw (name
,
1533 TYPE_BASECLASS_NAME (type
,
1536 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1541 boffset
= baseclass_offset (type
, i
,
1542 value_contents (arg1
) + offset
,
1543 VALUE_ADDRESS (arg1
)
1544 + value_offset (arg1
) + offset
);
1546 error (_("virtual baseclass botch"));
1548 /* The virtual base class pointer might have been clobbered
1549 by the user program. Make sure that it still points to a
1550 valid memory location. */
1553 if (boffset
< 0 || boffset
>= TYPE_LENGTH (type
))
1555 CORE_ADDR base_addr
;
1557 v2
= allocate_value (basetype
);
1559 VALUE_ADDRESS (arg1
) + value_offset (arg1
) + boffset
;
1560 if (target_read_memory (base_addr
,
1561 value_contents_raw (v2
),
1562 TYPE_LENGTH (basetype
)) != 0)
1563 error (_("virtual baseclass botch"));
1564 VALUE_LVAL (v2
) = lval_memory
;
1565 VALUE_ADDRESS (v2
) = base_addr
;
1569 if (VALUE_LVAL (arg1
) == lval_memory
&& value_lazy (arg1
))
1570 v2
= allocate_value_lazy (basetype
);
1573 v2
= allocate_value (basetype
);
1574 memcpy (value_contents_raw (v2
),
1575 value_contents_raw (arg1
) + boffset
,
1576 TYPE_LENGTH (basetype
));
1578 set_value_component_location (v2
, arg1
);
1579 VALUE_FRAME_ID (v2
) = VALUE_FRAME_ID (arg1
);
1580 set_value_offset (v2
, value_offset (arg1
) + boffset
);
1583 if (found_baseclass
)
1585 v
= search_struct_field (name
, v2
, 0,
1586 TYPE_BASECLASS (type
, i
),
1587 looking_for_baseclass
);
1589 else if (found_baseclass
)
1590 v
= value_primitive_field (arg1
, offset
, i
, type
);
1592 v
= search_struct_field (name
, arg1
,
1593 offset
+ TYPE_BASECLASS_BITPOS (type
,
1595 basetype
, looking_for_baseclass
);
1602 /* Helper function used by value_struct_elt to recurse through
1603 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1604 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1607 If found, return value, else if name matched and args not return
1608 (value) -1, else return NULL. */
1610 static struct value
*
1611 search_struct_method (char *name
, struct value
**arg1p
,
1612 struct value
**args
, int offset
,
1613 int *static_memfuncp
, struct type
*type
)
1617 int name_matched
= 0;
1618 char dem_opname
[64];
1620 CHECK_TYPEDEF (type
);
1621 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
1623 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
1624 /* FIXME! May need to check for ARM demangling here */
1625 if (strncmp (t_field_name
, "__", 2) == 0 ||
1626 strncmp (t_field_name
, "op", 2) == 0 ||
1627 strncmp (t_field_name
, "type", 4) == 0)
1629 if (cplus_demangle_opname (t_field_name
, dem_opname
, DMGL_ANSI
))
1630 t_field_name
= dem_opname
;
1631 else if (cplus_demangle_opname (t_field_name
, dem_opname
, 0))
1632 t_field_name
= dem_opname
;
1634 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1636 int j
= TYPE_FN_FIELDLIST_LENGTH (type
, i
) - 1;
1637 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
1640 check_stub_method_group (type
, i
);
1641 if (j
> 0 && args
== 0)
1642 error (_("cannot resolve overloaded method `%s': no arguments supplied"), name
);
1643 else if (j
== 0 && args
== 0)
1645 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
1652 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f
, j
),
1653 TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f
, j
)),
1654 TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f
, j
)),
1655 TYPE_FN_FIELD_ARGS (f
, j
), args
))
1657 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
1658 return value_virtual_fn_field (arg1p
, f
, j
,
1660 if (TYPE_FN_FIELD_STATIC_P (f
, j
)
1662 *static_memfuncp
= 1;
1663 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
1672 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
1676 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1678 struct type
*baseclass
= check_typedef (TYPE_BASECLASS (type
, i
));
1679 const gdb_byte
*base_valaddr
;
1681 /* The virtual base class pointer might have been
1682 clobbered by the user program. Make sure that it
1683 still points to a valid memory location. */
1685 if (offset
< 0 || offset
>= TYPE_LENGTH (type
))
1687 gdb_byte
*tmp
= alloca (TYPE_LENGTH (baseclass
));
1688 if (target_read_memory (VALUE_ADDRESS (*arg1p
)
1689 + value_offset (*arg1p
) + offset
,
1690 tmp
, TYPE_LENGTH (baseclass
)) != 0)
1691 error (_("virtual baseclass botch"));
1695 base_valaddr
= value_contents (*arg1p
) + offset
;
1697 base_offset
= baseclass_offset (type
, i
, base_valaddr
,
1698 VALUE_ADDRESS (*arg1p
)
1699 + value_offset (*arg1p
) + offset
);
1700 if (base_offset
== -1)
1701 error (_("virtual baseclass botch"));
1705 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
1707 v
= search_struct_method (name
, arg1p
, args
, base_offset
+ offset
,
1708 static_memfuncp
, TYPE_BASECLASS (type
, i
));
1709 if (v
== (struct value
*) - 1)
1715 /* FIXME-bothner: Why is this commented out? Why is it here? */
1716 /* *arg1p = arg1_tmp; */
1721 return (struct value
*) - 1;
1726 /* Given *ARGP, a value of type (pointer to a)* structure/union,
1727 extract the component named NAME from the ultimate target
1728 structure/union and return it as a value with its appropriate type.
1729 ERR is used in the error message if *ARGP's type is wrong.
1731 C++: ARGS is a list of argument types to aid in the selection of
1732 an appropriate method. Also, handle derived types.
1734 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
1735 where the truthvalue of whether the function that was resolved was
1736 a static member function or not is stored.
1738 ERR is an error message to be printed in case the field is not
1742 value_struct_elt (struct value
**argp
, struct value
**args
,
1743 char *name
, int *static_memfuncp
, char *err
)
1748 *argp
= coerce_array (*argp
);
1750 t
= check_typedef (value_type (*argp
));
1752 /* Follow pointers until we get to a non-pointer. */
1754 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
1756 *argp
= value_ind (*argp
);
1757 /* Don't coerce fn pointer to fn and then back again! */
1758 if (TYPE_CODE (value_type (*argp
)) != TYPE_CODE_FUNC
)
1759 *argp
= coerce_array (*argp
);
1760 t
= check_typedef (value_type (*argp
));
1763 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
1764 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
1765 error (_("Attempt to extract a component of a value that is not a %s."), err
);
1767 /* Assume it's not, unless we see that it is. */
1768 if (static_memfuncp
)
1769 *static_memfuncp
= 0;
1773 /* if there are no arguments ...do this... */
1775 /* Try as a field first, because if we succeed, there is less
1777 v
= search_struct_field (name
, *argp
, 0, t
, 0);
1781 /* C++: If it was not found as a data field, then try to
1782 return it as a pointer to a method. */
1784 if (destructor_name_p (name
, t
))
1785 error (_("Cannot get value of destructor"));
1787 v
= search_struct_method (name
, argp
, args
, 0,
1788 static_memfuncp
, t
);
1790 if (v
== (struct value
*) - 1)
1791 error (_("Cannot take address of method %s."), name
);
1794 if (TYPE_NFN_FIELDS (t
))
1795 error (_("There is no member or method named %s."), name
);
1797 error (_("There is no member named %s."), name
);
1802 if (destructor_name_p (name
, t
))
1806 /* Destructors are a special case. */
1807 int m_index
, f_index
;
1810 if (get_destructor_fn_field (t
, &m_index
, &f_index
))
1812 v
= value_fn_field (NULL
,
1813 TYPE_FN_FIELDLIST1 (t
, m_index
),
1817 error (_("could not find destructor function named %s."),
1824 error (_("destructor should not have any argument"));
1828 v
= search_struct_method (name
, argp
, args
, 0,
1829 static_memfuncp
, t
);
1831 if (v
== (struct value
*) - 1)
1833 error (_("One of the arguments you tried to pass to %s could not be converted to what the function wants."), name
);
1837 /* See if user tried to invoke data as function. If so, hand it
1838 back. If it's not callable (i.e., a pointer to function),
1839 gdb should give an error. */
1840 v
= search_struct_field (name
, *argp
, 0, t
, 0);
1841 /* If we found an ordinary field, then it is not a method call.
1842 So, treat it as if it were a static member function. */
1843 if (v
&& static_memfuncp
)
1844 *static_memfuncp
= 1;
1848 error (_("Structure has no component named %s."), name
);
1852 /* Search through the methods of an object (and its bases) to find a
1853 specified method. Return the pointer to the fn_field list of
1854 overloaded instances.
1856 Helper function for value_find_oload_list.
1857 ARGP is a pointer to a pointer to a value (the object).
1858 METHOD is a string containing the method name.
1859 OFFSET is the offset within the value.
1860 TYPE is the assumed type of the object.
1861 NUM_FNS is the number of overloaded instances.
1862 BASETYPE is set to the actual type of the subobject where the
1864 BOFFSET is the offset of the base subobject where the method is found.
1867 static struct fn_field
*
1868 find_method_list (struct value
**argp
, char *method
,
1869 int offset
, struct type
*type
, int *num_fns
,
1870 struct type
**basetype
, int *boffset
)
1874 CHECK_TYPEDEF (type
);
1878 /* First check in object itself. */
1879 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
1881 /* pai: FIXME What about operators and type conversions? */
1882 char *fn_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
1883 if (fn_field_name
&& (strcmp_iw (fn_field_name
, method
) == 0))
1885 int len
= TYPE_FN_FIELDLIST_LENGTH (type
, i
);
1886 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
1892 /* Resolve any stub methods. */
1893 check_stub_method_group (type
, i
);
1899 /* Not found in object, check in base subobjects. */
1900 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
1903 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1905 base_offset
= value_offset (*argp
) + offset
;
1906 base_offset
= baseclass_offset (type
, i
,
1907 value_contents (*argp
) + base_offset
,
1908 VALUE_ADDRESS (*argp
) + base_offset
);
1909 if (base_offset
== -1)
1910 error (_("virtual baseclass botch"));
1912 else /* Non-virtual base, simply use bit position from debug
1915 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
1917 f
= find_method_list (argp
, method
, base_offset
+ offset
,
1918 TYPE_BASECLASS (type
, i
), num_fns
,
1926 /* Return the list of overloaded methods of a specified name.
1928 ARGP is a pointer to a pointer to a value (the object).
1929 METHOD is the method name.
1930 OFFSET is the offset within the value contents.
1931 NUM_FNS is the number of overloaded instances.
1932 BASETYPE is set to the type of the base subobject that defines the
1934 BOFFSET is the offset of the base subobject which defines the method.
1938 value_find_oload_method_list (struct value
**argp
, char *method
,
1939 int offset
, int *num_fns
,
1940 struct type
**basetype
, int *boffset
)
1944 t
= check_typedef (value_type (*argp
));
1946 /* Code snarfed from value_struct_elt. */
1947 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
1949 *argp
= value_ind (*argp
);
1950 /* Don't coerce fn pointer to fn and then back again! */
1951 if (TYPE_CODE (value_type (*argp
)) != TYPE_CODE_FUNC
)
1952 *argp
= coerce_array (*argp
);
1953 t
= check_typedef (value_type (*argp
));
1956 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
1957 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
1958 error (_("Attempt to extract a component of a value that is not a struct or union"));
1960 return find_method_list (argp
, method
, 0, t
, num_fns
,
1964 /* Given an array of argument types (ARGTYPES) (which includes an
1965 entry for "this" in the case of C++ methods), the number of
1966 arguments NARGS, the NAME of a function whether it's a method or
1967 not (METHOD), and the degree of laxness (LAX) in conforming to
1968 overload resolution rules in ANSI C++, find the best function that
1969 matches on the argument types according to the overload resolution
1972 In the case of class methods, the parameter OBJ is an object value
1973 in which to search for overloaded methods.
1975 In the case of non-method functions, the parameter FSYM is a symbol
1976 corresponding to one of the overloaded functions.
1978 Return value is an integer: 0 -> good match, 10 -> debugger applied
1979 non-standard coercions, 100 -> incompatible.
1981 If a method is being searched for, VALP will hold the value.
1982 If a non-method is being searched for, SYMP will hold the symbol
1985 If a method is being searched for, and it is a static method,
1986 then STATICP will point to a non-zero value.
1988 Note: This function does *not* check the value of
1989 overload_resolution. Caller must check it to see whether overload
1990 resolution is permitted.
1994 find_overload_match (struct type
**arg_types
, int nargs
,
1995 char *name
, int method
, int lax
,
1996 struct value
**objp
, struct symbol
*fsym
,
1997 struct value
**valp
, struct symbol
**symp
,
2000 struct value
*obj
= (objp
? *objp
: NULL
);
2001 /* Index of best overloaded function. */
2003 /* The measure for the current best match. */
2004 struct badness_vector
*oload_champ_bv
= NULL
;
2005 struct value
*temp
= obj
;
2006 /* For methods, the list of overloaded methods. */
2007 struct fn_field
*fns_ptr
= NULL
;
2008 /* For non-methods, the list of overloaded function symbols. */
2009 struct symbol
**oload_syms
= NULL
;
2010 /* Number of overloaded instances being considered. */
2012 struct type
*basetype
= NULL
;
2016 struct cleanup
*old_cleanups
= NULL
;
2018 const char *obj_type_name
= NULL
;
2019 char *func_name
= NULL
;
2020 enum oload_classification match_quality
;
2022 /* Get the list of overloaded methods or functions. */
2026 obj_type_name
= TYPE_NAME (value_type (obj
));
2027 /* Hack: evaluate_subexp_standard often passes in a pointer
2028 value rather than the object itself, so try again. */
2029 if ((!obj_type_name
|| !*obj_type_name
)
2030 && (TYPE_CODE (value_type (obj
)) == TYPE_CODE_PTR
))
2031 obj_type_name
= TYPE_NAME (TYPE_TARGET_TYPE (value_type (obj
)));
2033 fns_ptr
= value_find_oload_method_list (&temp
, name
,
2035 &basetype
, &boffset
);
2036 if (!fns_ptr
|| !num_fns
)
2037 error (_("Couldn't find method %s%s%s"),
2039 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2041 /* If we are dealing with stub method types, they should have
2042 been resolved by find_method_list via
2043 value_find_oload_method_list above. */
2044 gdb_assert (TYPE_DOMAIN_TYPE (fns_ptr
[0].type
) != NULL
);
2045 oload_champ
= find_oload_champ (arg_types
, nargs
, method
,
2047 oload_syms
, &oload_champ_bv
);
2051 const char *qualified_name
= SYMBOL_CPLUS_DEMANGLED_NAME (fsym
);
2053 /* If we have a C++ name, try to extract just the function
2056 func_name
= cp_func_name (qualified_name
);
2058 /* If there was no C++ name, this must be a C-style function.
2059 Just return the same symbol. Do the same if cp_func_name
2060 fails for some reason. */
2061 if (func_name
== NULL
)
2067 old_cleanups
= make_cleanup (xfree
, func_name
);
2068 make_cleanup (xfree
, oload_syms
);
2069 make_cleanup (xfree
, oload_champ_bv
);
2071 oload_champ
= find_oload_champ_namespace (arg_types
, nargs
,
2078 /* Check how bad the best match is. */
2081 classify_oload_match (oload_champ_bv
, nargs
,
2082 oload_method_static (method
, fns_ptr
,
2085 if (match_quality
== INCOMPATIBLE
)
2088 error (_("Cannot resolve method %s%s%s to any overloaded instance"),
2090 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2093 error (_("Cannot resolve function %s to any overloaded instance"),
2096 else if (match_quality
== NON_STANDARD
)
2099 warning (_("Using non-standard conversion to match method %s%s%s to supplied arguments"),
2101 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2104 warning (_("Using non-standard conversion to match function %s to supplied arguments"),
2110 if (staticp
!= NULL
)
2111 *staticp
= oload_method_static (method
, fns_ptr
, oload_champ
);
2112 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr
, oload_champ
))
2113 *valp
= value_virtual_fn_field (&temp
, fns_ptr
, oload_champ
,
2116 *valp
= value_fn_field (&temp
, fns_ptr
, oload_champ
,
2121 *symp
= oload_syms
[oload_champ
];
2126 if (TYPE_CODE (value_type (temp
)) != TYPE_CODE_PTR
2127 && (TYPE_CODE (value_type (*objp
)) == TYPE_CODE_PTR
2128 || TYPE_CODE (value_type (*objp
)) == TYPE_CODE_REF
))
2130 temp
= value_addr (temp
);
2134 if (old_cleanups
!= NULL
)
2135 do_cleanups (old_cleanups
);
2137 switch (match_quality
)
2143 default: /* STANDARD */
2148 /* Find the best overload match, searching for FUNC_NAME in namespaces
2149 contained in QUALIFIED_NAME until it either finds a good match or
2150 runs out of namespaces. It stores the overloaded functions in
2151 *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. The
2152 calling function is responsible for freeing *OLOAD_SYMS and
2156 find_oload_champ_namespace (struct type
**arg_types
, int nargs
,
2157 const char *func_name
,
2158 const char *qualified_name
,
2159 struct symbol
***oload_syms
,
2160 struct badness_vector
**oload_champ_bv
)
2164 find_oload_champ_namespace_loop (arg_types
, nargs
,
2167 oload_syms
, oload_champ_bv
,
2173 /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is
2174 how deep we've looked for namespaces, and the champ is stored in
2175 OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0
2178 It is the caller's responsibility to free *OLOAD_SYMS and
2182 find_oload_champ_namespace_loop (struct type
**arg_types
, int nargs
,
2183 const char *func_name
,
2184 const char *qualified_name
,
2186 struct symbol
***oload_syms
,
2187 struct badness_vector
**oload_champ_bv
,
2190 int next_namespace_len
= namespace_len
;
2191 int searched_deeper
= 0;
2193 struct cleanup
*old_cleanups
;
2194 int new_oload_champ
;
2195 struct symbol
**new_oload_syms
;
2196 struct badness_vector
*new_oload_champ_bv
;
2197 char *new_namespace
;
2199 if (next_namespace_len
!= 0)
2201 gdb_assert (qualified_name
[next_namespace_len
] == ':');
2202 next_namespace_len
+= 2;
2204 next_namespace_len
+=
2205 cp_find_first_component (qualified_name
+ next_namespace_len
);
2207 /* Initialize these to values that can safely be xfree'd. */
2209 *oload_champ_bv
= NULL
;
2211 /* First, see if we have a deeper namespace we can search in.
2212 If we get a good match there, use it. */
2214 if (qualified_name
[next_namespace_len
] == ':')
2216 searched_deeper
= 1;
2218 if (find_oload_champ_namespace_loop (arg_types
, nargs
,
2219 func_name
, qualified_name
,
2221 oload_syms
, oload_champ_bv
,
2228 /* If we reach here, either we're in the deepest namespace or we
2229 didn't find a good match in a deeper namespace. But, in the
2230 latter case, we still have a bad match in a deeper namespace;
2231 note that we might not find any match at all in the current
2232 namespace. (There's always a match in the deepest namespace,
2233 because this overload mechanism only gets called if there's a
2234 function symbol to start off with.) */
2236 old_cleanups
= make_cleanup (xfree
, *oload_syms
);
2237 old_cleanups
= make_cleanup (xfree
, *oload_champ_bv
);
2238 new_namespace
= alloca (namespace_len
+ 1);
2239 strncpy (new_namespace
, qualified_name
, namespace_len
);
2240 new_namespace
[namespace_len
] = '\0';
2241 new_oload_syms
= make_symbol_overload_list (func_name
,
2243 while (new_oload_syms
[num_fns
])
2246 new_oload_champ
= find_oload_champ (arg_types
, nargs
, 0, num_fns
,
2247 NULL
, new_oload_syms
,
2248 &new_oload_champ_bv
);
2250 /* Case 1: We found a good match. Free earlier matches (if any),
2251 and return it. Case 2: We didn't find a good match, but we're
2252 not the deepest function. Then go with the bad match that the
2253 deeper function found. Case 3: We found a bad match, and we're
2254 the deepest function. Then return what we found, even though
2255 it's a bad match. */
2257 if (new_oload_champ
!= -1
2258 && classify_oload_match (new_oload_champ_bv
, nargs
, 0) == STANDARD
)
2260 *oload_syms
= new_oload_syms
;
2261 *oload_champ
= new_oload_champ
;
2262 *oload_champ_bv
= new_oload_champ_bv
;
2263 do_cleanups (old_cleanups
);
2266 else if (searched_deeper
)
2268 xfree (new_oload_syms
);
2269 xfree (new_oload_champ_bv
);
2270 discard_cleanups (old_cleanups
);
2275 gdb_assert (new_oload_champ
!= -1);
2276 *oload_syms
= new_oload_syms
;
2277 *oload_champ
= new_oload_champ
;
2278 *oload_champ_bv
= new_oload_champ_bv
;
2279 discard_cleanups (old_cleanups
);
2284 /* Look for a function to take NARGS args of types ARG_TYPES. Find
2285 the best match from among the overloaded methods or functions
2286 (depending on METHOD) given by FNS_PTR or OLOAD_SYMS, respectively.
2287 The number of methods/functions in the list is given by NUM_FNS.
2288 Return the index of the best match; store an indication of the
2289 quality of the match in OLOAD_CHAMP_BV.
2291 It is the caller's responsibility to free *OLOAD_CHAMP_BV. */
2294 find_oload_champ (struct type
**arg_types
, int nargs
, int method
,
2295 int num_fns
, struct fn_field
*fns_ptr
,
2296 struct symbol
**oload_syms
,
2297 struct badness_vector
**oload_champ_bv
)
2300 /* A measure of how good an overloaded instance is. */
2301 struct badness_vector
*bv
;
2302 /* Index of best overloaded function. */
2303 int oload_champ
= -1;
2304 /* Current ambiguity state for overload resolution. */
2305 int oload_ambiguous
= 0;
2306 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */
2308 *oload_champ_bv
= NULL
;
2310 /* Consider each candidate in turn. */
2311 for (ix
= 0; ix
< num_fns
; ix
++)
2314 int static_offset
= oload_method_static (method
, fns_ptr
, ix
);
2316 struct type
**parm_types
;
2320 nparms
= TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (fns_ptr
, ix
));
2324 /* If it's not a method, this is the proper place. */
2325 nparms
= TYPE_NFIELDS (SYMBOL_TYPE (oload_syms
[ix
]));
2328 /* Prepare array of parameter types. */
2329 parm_types
= (struct type
**)
2330 xmalloc (nparms
* (sizeof (struct type
*)));
2331 for (jj
= 0; jj
< nparms
; jj
++)
2332 parm_types
[jj
] = (method
2333 ? (TYPE_FN_FIELD_ARGS (fns_ptr
, ix
)[jj
].type
)
2334 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms
[ix
]),
2337 /* Compare parameter types to supplied argument types. Skip
2338 THIS for static methods. */
2339 bv
= rank_function (parm_types
, nparms
,
2340 arg_types
+ static_offset
,
2341 nargs
- static_offset
);
2343 if (!*oload_champ_bv
)
2345 *oload_champ_bv
= bv
;
2348 else /* See whether current candidate is better or worse than
2350 switch (compare_badness (bv
, *oload_champ_bv
))
2352 case 0: /* Top two contenders are equally good. */
2353 oload_ambiguous
= 1;
2355 case 1: /* Incomparable top contenders. */
2356 oload_ambiguous
= 2;
2358 case 2: /* New champion, record details. */
2359 *oload_champ_bv
= bv
;
2360 oload_ambiguous
= 0;
2371 fprintf_filtered (gdb_stderr
,
2372 "Overloaded method instance %s, # of parms %d\n",
2373 fns_ptr
[ix
].physname
, nparms
);
2375 fprintf_filtered (gdb_stderr
,
2376 "Overloaded function instance %s # of parms %d\n",
2377 SYMBOL_DEMANGLED_NAME (oload_syms
[ix
]),
2379 for (jj
= 0; jj
< nargs
- static_offset
; jj
++)
2380 fprintf_filtered (gdb_stderr
,
2381 "...Badness @ %d : %d\n",
2383 fprintf_filtered (gdb_stderr
,
2384 "Overload resolution champion is %d, ambiguous? %d\n",
2385 oload_champ
, oload_ambiguous
);
2392 /* Return 1 if we're looking at a static method, 0 if we're looking at
2393 a non-static method or a function that isn't a method. */
2396 oload_method_static (int method
, struct fn_field
*fns_ptr
, int index
)
2398 if (method
&& TYPE_FN_FIELD_STATIC_P (fns_ptr
, index
))
2404 /* Check how good an overload match OLOAD_CHAMP_BV represents. */
2406 static enum oload_classification
2407 classify_oload_match (struct badness_vector
*oload_champ_bv
,
2413 for (ix
= 1; ix
<= nargs
- static_offset
; ix
++)
2415 if (oload_champ_bv
->rank
[ix
] >= 100)
2416 return INCOMPATIBLE
; /* Truly mismatched types. */
2417 else if (oload_champ_bv
->rank
[ix
] >= 10)
2418 return NON_STANDARD
; /* Non-standard type conversions
2422 return STANDARD
; /* Only standard conversions needed. */
2425 /* C++: return 1 is NAME is a legitimate name for the destructor of
2426 type TYPE. If TYPE does not have a destructor, or if NAME is
2427 inappropriate for TYPE, an error is signaled. */
2429 destructor_name_p (const char *name
, const struct type
*type
)
2431 /* Destructors are a special case. */
2435 char *dname
= type_name_no_tag (type
);
2436 char *cp
= strchr (dname
, '<');
2439 /* Do not compare the template part for template classes. */
2441 len
= strlen (dname
);
2444 if (strlen (name
+ 1) != len
|| strncmp (dname
, name
+ 1, len
) != 0)
2445 error (_("name of destructor must equal name of class"));
2452 /* Given TYPE, a structure/union,
2453 return 1 if the component named NAME from the ultimate target
2454 structure/union is defined, otherwise, return 0. */
2457 check_field (struct type
*type
, const char *name
)
2461 for (i
= TYPE_NFIELDS (type
) - 1; i
>= TYPE_N_BASECLASSES (type
); i
--)
2463 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
2464 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
2468 /* C++: If it was not found as a data field, then try to return it
2469 as a pointer to a method. */
2471 /* Destructors are a special case. */
2472 if (destructor_name_p (name
, type
))
2474 int m_index
, f_index
;
2476 return get_destructor_fn_field (type
, &m_index
, &f_index
);
2479 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; --i
)
2481 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type
, i
), name
) == 0)
2485 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2486 if (check_field (TYPE_BASECLASS (type
, i
), name
))
2492 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
2493 return the appropriate member (or the address of the member, if
2494 WANT_ADDRESS). This function is used to resolve user expressions
2495 of the form "DOMAIN::NAME". For more details on what happens, see
2496 the comment before value_struct_elt_for_reference. */
2499 value_aggregate_elt (struct type
*curtype
,
2500 char *name
, int want_address
,
2503 switch (TYPE_CODE (curtype
))
2505 case TYPE_CODE_STRUCT
:
2506 case TYPE_CODE_UNION
:
2507 return value_struct_elt_for_reference (curtype
, 0, curtype
,
2509 want_address
, noside
);
2510 case TYPE_CODE_NAMESPACE
:
2511 return value_namespace_elt (curtype
, name
,
2512 want_address
, noside
);
2514 internal_error (__FILE__
, __LINE__
,
2515 _("non-aggregate type in value_aggregate_elt"));
2519 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
2520 return the address of this member as a "pointer to member" type.
2521 If INTYPE is non-null, then it will be the type of the member we
2522 are looking for. This will help us resolve "pointers to member
2523 functions". This function is used to resolve user expressions of
2524 the form "DOMAIN::NAME". */
2526 static struct value
*
2527 value_struct_elt_for_reference (struct type
*domain
, int offset
,
2528 struct type
*curtype
, char *name
,
2529 struct type
*intype
,
2533 struct type
*t
= curtype
;
2535 struct value
*v
, *result
;
2537 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2538 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2539 error (_("Internal error: non-aggregate type to value_struct_elt_for_reference"));
2541 for (i
= TYPE_NFIELDS (t
) - 1; i
>= TYPE_N_BASECLASSES (t
); i
--)
2543 char *t_field_name
= TYPE_FIELD_NAME (t
, i
);
2545 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
2547 if (field_is_static (&TYPE_FIELD (t
, i
)))
2549 v
= value_static_field (t
, i
);
2551 error (_("static field %s has been optimized out"),
2557 if (TYPE_FIELD_PACKED (t
, i
))
2558 error (_("pointers to bitfield members not allowed"));
2561 return value_from_longest
2562 (lookup_memberptr_type (TYPE_FIELD_TYPE (t
, i
), domain
),
2563 offset
+ (LONGEST
) (TYPE_FIELD_BITPOS (t
, i
) >> 3));
2564 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
2565 return allocate_value (TYPE_FIELD_TYPE (t
, i
));
2567 error (_("Cannot reference non-static field \"%s\""), name
);
2571 /* C++: If it was not found as a data field, then try to return it
2572 as a pointer to a method. */
2574 /* Destructors are a special case. */
2575 if (destructor_name_p (name
, t
))
2577 error (_("member pointers to destructors not implemented yet"));
2580 /* Perform all necessary dereferencing. */
2581 while (intype
&& TYPE_CODE (intype
) == TYPE_CODE_PTR
)
2582 intype
= TYPE_TARGET_TYPE (intype
);
2584 for (i
= TYPE_NFN_FIELDS (t
) - 1; i
>= 0; --i
)
2586 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (t
, i
);
2587 char dem_opname
[64];
2589 if (strncmp (t_field_name
, "__", 2) == 0
2590 || strncmp (t_field_name
, "op", 2) == 0
2591 || strncmp (t_field_name
, "type", 4) == 0)
2593 if (cplus_demangle_opname (t_field_name
,
2594 dem_opname
, DMGL_ANSI
))
2595 t_field_name
= dem_opname
;
2596 else if (cplus_demangle_opname (t_field_name
,
2598 t_field_name
= dem_opname
;
2600 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
2602 int j
= TYPE_FN_FIELDLIST_LENGTH (t
, i
);
2603 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (t
, i
);
2605 check_stub_method_group (t
, i
);
2607 if (intype
== 0 && j
> 1)
2608 error (_("non-unique member `%s' requires type instantiation"), name
);
2612 if (TYPE_FN_FIELD_TYPE (f
, j
) == intype
)
2615 error (_("no member function matches that type instantiation"));
2620 if (TYPE_FN_FIELD_STATIC_P (f
, j
))
2623 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
2629 return value_addr (read_var_value (s
, 0));
2631 return read_var_value (s
, 0);
2634 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
2638 result
= allocate_value
2639 (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
2640 cplus_make_method_ptr (value_type (result
),
2641 value_contents_writeable (result
),
2642 TYPE_FN_FIELD_VOFFSET (f
, j
), 1);
2644 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
2645 return allocate_value (TYPE_FN_FIELD_TYPE (f
, j
));
2647 error (_("Cannot reference virtual member function \"%s\""),
2653 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
2658 v
= read_var_value (s
, 0);
2663 result
= allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
2664 cplus_make_method_ptr (value_type (result
),
2665 value_contents_writeable (result
),
2666 VALUE_ADDRESS (v
), 0);
2672 for (i
= TYPE_N_BASECLASSES (t
) - 1; i
>= 0; i
--)
2677 if (BASETYPE_VIA_VIRTUAL (t
, i
))
2680 base_offset
= TYPE_BASECLASS_BITPOS (t
, i
) / 8;
2681 v
= value_struct_elt_for_reference (domain
,
2682 offset
+ base_offset
,
2683 TYPE_BASECLASS (t
, i
),
2685 want_address
, noside
);
2690 /* As a last chance, pretend that CURTYPE is a namespace, and look
2691 it up that way; this (frequently) works for types nested inside
2694 return value_maybe_namespace_elt (curtype
, name
,
2695 want_address
, noside
);
2698 /* C++: Return the member NAME of the namespace given by the type
2701 static struct value
*
2702 value_namespace_elt (const struct type
*curtype
,
2703 char *name
, int want_address
,
2706 struct value
*retval
= value_maybe_namespace_elt (curtype
, name
,
2711 error (_("No symbol \"%s\" in namespace \"%s\"."),
2712 name
, TYPE_TAG_NAME (curtype
));
2717 /* A helper function used by value_namespace_elt and
2718 value_struct_elt_for_reference. It looks up NAME inside the
2719 context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE
2720 is a class and NAME refers to a type in CURTYPE itself (as opposed
2721 to, say, some base class of CURTYPE). */
2723 static struct value
*
2724 value_maybe_namespace_elt (const struct type
*curtype
,
2725 char *name
, int want_address
,
2728 const char *namespace_name
= TYPE_TAG_NAME (curtype
);
2730 struct value
*result
;
2732 sym
= cp_lookup_symbol_namespace (namespace_name
, name
, NULL
,
2733 get_selected_block (0),
2738 else if ((noside
== EVAL_AVOID_SIDE_EFFECTS
)
2739 && (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
))
2740 result
= allocate_value (SYMBOL_TYPE (sym
));
2742 result
= value_of_variable (sym
, get_selected_block (0));
2744 if (result
&& want_address
)
2745 result
= value_addr (result
);
2750 /* Given a pointer value V, find the real (RTTI) type of the object it
2753 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
2754 and refer to the values computed for the object pointed to. */
2757 value_rtti_target_type (struct value
*v
, int *full
,
2758 int *top
, int *using_enc
)
2760 struct value
*target
;
2762 target
= value_ind (v
);
2764 return value_rtti_type (target
, full
, top
, using_enc
);
2767 /* Given a value pointed to by ARGP, check its real run-time type, and
2768 if that is different from the enclosing type, create a new value
2769 using the real run-time type as the enclosing type (and of the same
2770 type as ARGP) and return it, with the embedded offset adjusted to
2771 be the correct offset to the enclosed object. RTYPE is the type,
2772 and XFULL, XTOP, and XUSING_ENC are the other parameters, computed
2773 by value_rtti_type(). If these are available, they can be supplied
2774 and a second call to value_rtti_type() is avoided. (Pass RTYPE ==
2775 NULL if they're not available. */
2778 value_full_object (struct value
*argp
,
2780 int xfull
, int xtop
,
2783 struct type
*real_type
;
2787 struct value
*new_val
;
2794 using_enc
= xusing_enc
;
2797 real_type
= value_rtti_type (argp
, &full
, &top
, &using_enc
);
2799 /* If no RTTI data, or if object is already complete, do nothing. */
2800 if (!real_type
|| real_type
== value_enclosing_type (argp
))
2803 /* If we have the full object, but for some reason the enclosing
2804 type is wrong, set it. */
2805 /* pai: FIXME -- sounds iffy */
2808 argp
= value_change_enclosing_type (argp
, real_type
);
2812 /* Check if object is in memory */
2813 if (VALUE_LVAL (argp
) != lval_memory
)
2815 warning (_("Couldn't retrieve complete object of RTTI type %s; object may be in register(s)."),
2816 TYPE_NAME (real_type
));
2821 /* All other cases -- retrieve the complete object. */
2822 /* Go back by the computed top_offset from the beginning of the
2823 object, adjusting for the embedded offset of argp if that's what
2824 value_rtti_type used for its computation. */
2825 new_val
= value_at_lazy (real_type
, VALUE_ADDRESS (argp
) - top
+
2826 (using_enc
? 0 : value_embedded_offset (argp
)));
2827 deprecated_set_value_type (new_val
, value_type (argp
));
2828 set_value_embedded_offset (new_val
, (using_enc
2829 ? top
+ value_embedded_offset (argp
)
2835 /* Return the value of the local variable, if one exists.
2836 Flag COMPLAIN signals an error if the request is made in an
2837 inappropriate context. */
2840 value_of_local (const char *name
, int complain
)
2842 struct symbol
*func
, *sym
;
2845 struct frame_info
*frame
;
2848 frame
= get_selected_frame (_("no frame selected"));
2851 frame
= deprecated_safe_get_selected_frame ();
2856 func
= get_frame_function (frame
);
2860 error (_("no `%s' in nameless context"), name
);
2865 b
= SYMBOL_BLOCK_VALUE (func
);
2866 if (dict_empty (BLOCK_DICT (b
)))
2869 error (_("no args, no `%s'"), name
);
2874 /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER
2875 symbol instead of the LOC_ARG one (if both exist). */
2876 sym
= lookup_block_symbol (b
, name
, NULL
, VAR_DOMAIN
);
2880 error (_("current stack frame does not contain a variable named `%s'"),
2886 ret
= read_var_value (sym
, frame
);
2887 if (ret
== 0 && complain
)
2888 error (_("`%s' argument unreadable"), name
);
2892 /* C++/Objective-C: return the value of the class instance variable,
2893 if one exists. Flag COMPLAIN signals an error if the request is
2894 made in an inappropriate context. */
2897 value_of_this (int complain
)
2899 if (!current_language
->la_name_of_this
)
2901 return value_of_local (current_language
->la_name_of_this
, complain
);
2904 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH
2905 elements long, starting at LOWBOUND. The result has the same lower
2906 bound as the original ARRAY. */
2909 value_slice (struct value
*array
, int lowbound
, int length
)
2911 struct type
*slice_range_type
, *slice_type
, *range_type
;
2912 LONGEST lowerbound
, upperbound
;
2913 struct value
*slice
;
2914 struct type
*array_type
;
2916 array_type
= check_typedef (value_type (array
));
2917 if (TYPE_CODE (array_type
) != TYPE_CODE_ARRAY
2918 && TYPE_CODE (array_type
) != TYPE_CODE_STRING
2919 && TYPE_CODE (array_type
) != TYPE_CODE_BITSTRING
)
2920 error (_("cannot take slice of non-array"));
2922 range_type
= TYPE_INDEX_TYPE (array_type
);
2923 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2924 error (_("slice from bad array or bitstring"));
2926 if (lowbound
< lowerbound
|| length
< 0
2927 || lowbound
+ length
- 1 > upperbound
)
2928 error (_("slice out of range"));
2930 /* FIXME-type-allocation: need a way to free this type when we are
2932 slice_range_type
= create_range_type ((struct type
*) NULL
,
2933 TYPE_TARGET_TYPE (range_type
),
2935 lowbound
+ length
- 1);
2936 if (TYPE_CODE (array_type
) == TYPE_CODE_BITSTRING
)
2940 slice_type
= create_set_type ((struct type
*) NULL
,
2942 TYPE_CODE (slice_type
) = TYPE_CODE_BITSTRING
;
2943 slice
= value_zero (slice_type
, not_lval
);
2945 for (i
= 0; i
< length
; i
++)
2947 int element
= value_bit_index (array_type
,
2948 value_contents (array
),
2951 error (_("internal error accessing bitstring"));
2952 else if (element
> 0)
2954 int j
= i
% TARGET_CHAR_BIT
;
2955 if (gdbarch_bits_big_endian (current_gdbarch
))
2956 j
= TARGET_CHAR_BIT
- 1 - j
;
2957 value_contents_raw (slice
)[i
/ TARGET_CHAR_BIT
] |= (1 << j
);
2960 /* We should set the address, bitssize, and bitspos, so the
2961 slice can be used on the LHS, but that may require extensions
2962 to value_assign. For now, just leave as a non_lval.
2967 struct type
*element_type
= TYPE_TARGET_TYPE (array_type
);
2969 (lowbound
- lowerbound
) * TYPE_LENGTH (check_typedef (element_type
));
2971 slice_type
= create_array_type ((struct type
*) NULL
,
2974 TYPE_CODE (slice_type
) = TYPE_CODE (array_type
);
2976 if (VALUE_LVAL (array
) == lval_memory
&& value_lazy (array
))
2977 slice
= allocate_value_lazy (slice_type
);
2980 slice
= allocate_value (slice_type
);
2981 memcpy (value_contents_writeable (slice
),
2982 value_contents (array
) + offset
,
2983 TYPE_LENGTH (slice_type
));
2986 set_value_component_location (slice
, array
);
2987 VALUE_FRAME_ID (slice
) = VALUE_FRAME_ID (array
);
2988 set_value_offset (slice
, value_offset (array
) + offset
);
2993 /* Create a value for a FORTRAN complex number. Currently most of the
2994 time values are coerced to COMPLEX*16 (i.e. a complex number
2995 composed of 2 doubles. This really should be a smarter routine
2996 that figures out precision inteligently as opposed to assuming
2997 doubles. FIXME: fmb */
3000 value_literal_complex (struct value
*arg1
,
3005 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3007 val
= allocate_value (type
);
3008 arg1
= value_cast (real_type
, arg1
);
3009 arg2
= value_cast (real_type
, arg2
);
3011 memcpy (value_contents_raw (val
),
3012 value_contents (arg1
), TYPE_LENGTH (real_type
));
3013 memcpy (value_contents_raw (val
) + TYPE_LENGTH (real_type
),
3014 value_contents (arg2
), TYPE_LENGTH (real_type
));
3018 /* Cast a value into the appropriate complex data type. */
3020 static struct value
*
3021 cast_into_complex (struct type
*type
, struct value
*val
)
3023 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3025 if (TYPE_CODE (value_type (val
)) == TYPE_CODE_COMPLEX
)
3027 struct type
*val_real_type
= TYPE_TARGET_TYPE (value_type (val
));
3028 struct value
*re_val
= allocate_value (val_real_type
);
3029 struct value
*im_val
= allocate_value (val_real_type
);
3031 memcpy (value_contents_raw (re_val
),
3032 value_contents (val
), TYPE_LENGTH (val_real_type
));
3033 memcpy (value_contents_raw (im_val
),
3034 value_contents (val
) + TYPE_LENGTH (val_real_type
),
3035 TYPE_LENGTH (val_real_type
));
3037 return value_literal_complex (re_val
, im_val
, type
);
3039 else if (TYPE_CODE (value_type (val
)) == TYPE_CODE_FLT
3040 || TYPE_CODE (value_type (val
)) == TYPE_CODE_INT
)
3041 return value_literal_complex (val
,
3042 value_zero (real_type
, not_lval
),
3045 error (_("cannot cast non-number to complex"));
3049 _initialize_valops (void)
3051 add_setshow_boolean_cmd ("overload-resolution", class_support
,
3052 &overload_resolution
, _("\
3053 Set overload resolution in evaluating C++ functions."), _("\
3054 Show overload resolution in evaluating C++ functions."),
3056 show_overload_resolution
,
3057 &setlist
, &showlist
);
3058 overload_resolution
= 1;