1 /* Perform non-arithmetic operations on values, for GDB.
3 Copyright (C) 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995,
4 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
5 2008, 2009, 2010 Free Software Foundation, Inc.
7 This file is part of GDB.
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3 of the License, or
12 (at your option) any later version.
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with this program. If not, see <http://www.gnu.org/licenses/>. */
37 #include "dictionary.h"
38 #include "cp-support.h"
40 #include "user-regs.h"
43 #include "gdb_string.h"
44 #include "gdb_assert.h"
45 #include "cp-support.h"
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 if (TYPE_NAME (t1
) != NULL
236 && TYPE_NAME (t2
) != NULL
237 && !strcmp (TYPE_NAME (t1
), TYPE_NAME (t2
)))
240 /* Upcasting: look in the type of the source to see if it contains the
241 type of the target as a superclass. If so, we'll need to
242 offset the pointer rather than just change its type. */
243 if (TYPE_NAME (t1
) != NULL
)
245 v
= search_struct_field (type_name_no_tag (t1
),
251 /* Downcasting: look in the type of the target to see if it contains the
252 type of the source as a superclass. If so, we'll need to
253 offset the pointer rather than just change its type.
254 FIXME: This fails silently with virtual inheritance. */
255 if (TYPE_NAME (t2
) != NULL
)
257 v
= search_struct_field (type_name_no_tag (t2
),
258 value_zero (t1
, not_lval
), 0, t1
, 1);
261 /* Downcasting is possible (t1 is superclass of v2). */
262 CORE_ADDR addr2
= value_address (v2
);
263 addr2
-= value_address (v
) + value_embedded_offset (v
);
264 return value_at (type
, addr2
);
271 /* Cast one pointer or reference type to another. Both TYPE and
272 the type of ARG2 should be pointer types, or else both should be
273 reference types. Returns the new pointer or reference. */
276 value_cast_pointers (struct type
*type
, struct value
*arg2
)
278 struct type
*type1
= check_typedef (type
);
279 struct type
*type2
= check_typedef (value_type (arg2
));
280 struct type
*t1
= check_typedef (TYPE_TARGET_TYPE (type
));
281 struct type
*t2
= check_typedef (TYPE_TARGET_TYPE (type2
));
283 if (TYPE_CODE (t1
) == TYPE_CODE_STRUCT
284 && TYPE_CODE (t2
) == TYPE_CODE_STRUCT
285 && !value_logical_not (arg2
))
289 if (TYPE_CODE (type2
) == TYPE_CODE_REF
)
290 v2
= coerce_ref (arg2
);
292 v2
= value_ind (arg2
);
293 gdb_assert (TYPE_CODE (check_typedef (value_type (v2
))) == TYPE_CODE_STRUCT
294 && !!"Why did coercion fail?");
295 v2
= value_cast_structs (t1
, v2
);
296 /* At this point we have what we can have, un-dereference if needed. */
299 struct value
*v
= value_addr (v2
);
300 deprecated_set_value_type (v
, type
);
305 /* No superclass found, just change the pointer type. */
306 arg2
= value_copy (arg2
);
307 deprecated_set_value_type (arg2
, type
);
308 arg2
= value_change_enclosing_type (arg2
, type
);
309 set_value_pointed_to_offset (arg2
, 0); /* pai: chk_val */
313 /* Cast value ARG2 to type TYPE and return as a value.
314 More general than a C cast: accepts any two types of the same length,
315 and if ARG2 is an lvalue it can be cast into anything at all. */
316 /* In C++, casts may change pointer or object representations. */
319 value_cast (struct type
*type
, struct value
*arg2
)
321 enum type_code code1
;
322 enum type_code code2
;
326 int convert_to_boolean
= 0;
328 if (value_type (arg2
) == type
)
331 code1
= TYPE_CODE (check_typedef (type
));
333 /* Check if we are casting struct reference to struct reference. */
334 if (code1
== TYPE_CODE_REF
)
336 /* We dereference type; then we recurse and finally
337 we generate value of the given reference. Nothing wrong with
339 struct type
*t1
= check_typedef (type
);
340 struct type
*dereftype
= check_typedef (TYPE_TARGET_TYPE (t1
));
341 struct value
*val
= value_cast (dereftype
, arg2
);
342 return value_ref (val
);
345 code2
= TYPE_CODE (check_typedef (value_type (arg2
)));
347 if (code2
== TYPE_CODE_REF
)
348 /* We deref the value and then do the cast. */
349 return value_cast (type
, coerce_ref (arg2
));
351 CHECK_TYPEDEF (type
);
352 code1
= TYPE_CODE (type
);
353 arg2
= coerce_ref (arg2
);
354 type2
= check_typedef (value_type (arg2
));
356 /* You can't cast to a reference type. See value_cast_pointers
358 gdb_assert (code1
!= TYPE_CODE_REF
);
360 /* A cast to an undetermined-length array_type, such as
361 (TYPE [])OBJECT, is treated like a cast to (TYPE [N])OBJECT,
362 where N is sizeof(OBJECT)/sizeof(TYPE). */
363 if (code1
== TYPE_CODE_ARRAY
)
365 struct type
*element_type
= TYPE_TARGET_TYPE (type
);
366 unsigned element_length
= TYPE_LENGTH (check_typedef (element_type
));
367 if (element_length
> 0 && TYPE_ARRAY_UPPER_BOUND_IS_UNDEFINED (type
))
369 struct type
*range_type
= TYPE_INDEX_TYPE (type
);
370 int val_length
= TYPE_LENGTH (type2
);
371 LONGEST low_bound
, high_bound
, new_length
;
372 if (get_discrete_bounds (range_type
, &low_bound
, &high_bound
) < 0)
373 low_bound
= 0, high_bound
= 0;
374 new_length
= val_length
/ element_length
;
375 if (val_length
% element_length
!= 0)
376 warning (_("array element type size does not divide object size in cast"));
377 /* FIXME-type-allocation: need a way to free this type when
378 we are done with it. */
379 range_type
= create_range_type ((struct type
*) NULL
,
380 TYPE_TARGET_TYPE (range_type
),
382 new_length
+ low_bound
- 1);
383 deprecated_set_value_type (arg2
,
384 create_array_type ((struct type
*) NULL
,
391 if (current_language
->c_style_arrays
392 && TYPE_CODE (type2
) == TYPE_CODE_ARRAY
)
393 arg2
= value_coerce_array (arg2
);
395 if (TYPE_CODE (type2
) == TYPE_CODE_FUNC
)
396 arg2
= value_coerce_function (arg2
);
398 type2
= check_typedef (value_type (arg2
));
399 code2
= TYPE_CODE (type2
);
401 if (code1
== TYPE_CODE_COMPLEX
)
402 return cast_into_complex (type
, arg2
);
403 if (code1
== TYPE_CODE_BOOL
)
405 code1
= TYPE_CODE_INT
;
406 convert_to_boolean
= 1;
408 if (code1
== TYPE_CODE_CHAR
)
409 code1
= TYPE_CODE_INT
;
410 if (code2
== TYPE_CODE_BOOL
|| code2
== TYPE_CODE_CHAR
)
411 code2
= TYPE_CODE_INT
;
413 scalar
= (code2
== TYPE_CODE_INT
|| code2
== TYPE_CODE_FLT
414 || code2
== TYPE_CODE_DECFLOAT
|| code2
== TYPE_CODE_ENUM
415 || code2
== TYPE_CODE_RANGE
);
417 if ((code1
== TYPE_CODE_STRUCT
|| code1
== TYPE_CODE_UNION
)
418 && (code2
== TYPE_CODE_STRUCT
|| code2
== TYPE_CODE_UNION
)
419 && TYPE_NAME (type
) != 0)
421 struct value
*v
= value_cast_structs (type
, arg2
);
426 if (code1
== TYPE_CODE_FLT
&& scalar
)
427 return value_from_double (type
, value_as_double (arg2
));
428 else if (code1
== TYPE_CODE_DECFLOAT
&& scalar
)
430 enum bfd_endian byte_order
= gdbarch_byte_order (get_type_arch (type
));
431 int dec_len
= TYPE_LENGTH (type
);
434 if (code2
== TYPE_CODE_FLT
)
435 decimal_from_floating (arg2
, dec
, dec_len
, byte_order
);
436 else if (code2
== TYPE_CODE_DECFLOAT
)
437 decimal_convert (value_contents (arg2
), TYPE_LENGTH (type2
),
438 byte_order
, dec
, dec_len
, byte_order
);
440 /* The only option left is an integral type. */
441 decimal_from_integral (arg2
, dec
, dec_len
, byte_order
);
443 return value_from_decfloat (type
, dec
);
445 else if ((code1
== TYPE_CODE_INT
|| code1
== TYPE_CODE_ENUM
446 || code1
== TYPE_CODE_RANGE
)
447 && (scalar
|| code2
== TYPE_CODE_PTR
448 || code2
== TYPE_CODE_MEMBERPTR
))
452 /* When we cast pointers to integers, we mustn't use
453 gdbarch_pointer_to_address to find the address the pointer
454 represents, as value_as_long would. GDB should evaluate
455 expressions just as the compiler would --- and the compiler
456 sees a cast as a simple reinterpretation of the pointer's
458 if (code2
== TYPE_CODE_PTR
)
459 longest
= extract_unsigned_integer
460 (value_contents (arg2
), TYPE_LENGTH (type2
),
461 gdbarch_byte_order (get_type_arch (type2
)));
463 longest
= value_as_long (arg2
);
464 return value_from_longest (type
, convert_to_boolean
?
465 (LONGEST
) (longest
? 1 : 0) : longest
);
467 else if (code1
== TYPE_CODE_PTR
&& (code2
== TYPE_CODE_INT
468 || code2
== TYPE_CODE_ENUM
469 || code2
== TYPE_CODE_RANGE
))
471 /* TYPE_LENGTH (type) is the length of a pointer, but we really
472 want the length of an address! -- we are really dealing with
473 addresses (i.e., gdb representations) not pointers (i.e.,
474 target representations) here.
476 This allows things like "print *(int *)0x01000234" to work
477 without printing a misleading message -- which would
478 otherwise occur when dealing with a target having two byte
479 pointers and four byte addresses. */
481 int addr_bit
= gdbarch_addr_bit (get_type_arch (type2
));
483 LONGEST longest
= value_as_long (arg2
);
484 if (addr_bit
< sizeof (LONGEST
) * HOST_CHAR_BIT
)
486 if (longest
>= ((LONGEST
) 1 << addr_bit
)
487 || longest
<= -((LONGEST
) 1 << addr_bit
))
488 warning (_("value truncated"));
490 return value_from_longest (type
, longest
);
492 else if (code1
== TYPE_CODE_METHODPTR
&& code2
== TYPE_CODE_INT
493 && value_as_long (arg2
) == 0)
495 struct value
*result
= allocate_value (type
);
496 cplus_make_method_ptr (type
, value_contents_writeable (result
), 0, 0);
499 else if (code1
== TYPE_CODE_MEMBERPTR
&& code2
== TYPE_CODE_INT
500 && value_as_long (arg2
) == 0)
502 /* The Itanium C++ ABI represents NULL pointers to members as
503 minus one, instead of biasing the normal case. */
504 return value_from_longest (type
, -1);
506 else if (TYPE_LENGTH (type
) == TYPE_LENGTH (type2
))
508 if (code1
== TYPE_CODE_PTR
&& code2
== TYPE_CODE_PTR
)
509 return value_cast_pointers (type
, arg2
);
511 arg2
= value_copy (arg2
);
512 deprecated_set_value_type (arg2
, type
);
513 arg2
= value_change_enclosing_type (arg2
, type
);
514 set_value_pointed_to_offset (arg2
, 0); /* pai: chk_val */
517 else if (VALUE_LVAL (arg2
) == lval_memory
)
518 return value_at_lazy (type
, value_address (arg2
));
519 else if (code1
== TYPE_CODE_VOID
)
521 return value_zero (type
, not_lval
);
525 error (_("Invalid cast."));
530 /* The C++ reinterpret_cast operator. */
533 value_reinterpret_cast (struct type
*type
, struct value
*arg
)
535 struct value
*result
;
536 struct type
*real_type
= check_typedef (type
);
537 struct type
*arg_type
, *dest_type
;
539 enum type_code dest_code
, arg_code
;
541 /* Do reference, function, and array conversion. */
542 arg
= coerce_array (arg
);
544 /* Attempt to preserve the type the user asked for. */
547 /* If we are casting to a reference type, transform
548 reinterpret_cast<T&>(V) to *reinterpret_cast<T*>(&V). */
549 if (TYPE_CODE (real_type
) == TYPE_CODE_REF
)
552 arg
= value_addr (arg
);
553 dest_type
= lookup_pointer_type (TYPE_TARGET_TYPE (dest_type
));
554 real_type
= lookup_pointer_type (real_type
);
557 arg_type
= value_type (arg
);
559 dest_code
= TYPE_CODE (real_type
);
560 arg_code
= TYPE_CODE (arg_type
);
562 /* We can convert pointer types, or any pointer type to int, or int
564 if ((dest_code
== TYPE_CODE_PTR
&& arg_code
== TYPE_CODE_INT
)
565 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_PTR
)
566 || (dest_code
== TYPE_CODE_METHODPTR
&& arg_code
== TYPE_CODE_INT
)
567 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_METHODPTR
)
568 || (dest_code
== TYPE_CODE_MEMBERPTR
&& arg_code
== TYPE_CODE_INT
)
569 || (dest_code
== TYPE_CODE_INT
&& arg_code
== TYPE_CODE_MEMBERPTR
)
570 || (dest_code
== arg_code
571 && (dest_code
== TYPE_CODE_PTR
572 || dest_code
== TYPE_CODE_METHODPTR
573 || dest_code
== TYPE_CODE_MEMBERPTR
)))
574 result
= value_cast (dest_type
, arg
);
576 error (_("Invalid reinterpret_cast"));
579 result
= value_cast (type
, value_ref (value_ind (result
)));
584 /* A helper for value_dynamic_cast. This implements the first of two
585 runtime checks: we iterate over all the base classes of the value's
586 class which are equal to the desired class; if only one of these
587 holds the value, then it is the answer. */
590 dynamic_cast_check_1 (struct type
*desired_type
,
591 const bfd_byte
*contents
,
593 struct type
*search_type
,
595 struct type
*arg_type
,
596 struct value
**result
)
598 int i
, result_count
= 0;
600 for (i
= 0; i
< TYPE_N_BASECLASSES (search_type
) && result_count
< 2; ++i
)
602 int offset
= baseclass_offset (search_type
, i
, contents
, address
);
604 error (_("virtual baseclass botch"));
605 if (class_types_same_p (desired_type
, TYPE_BASECLASS (search_type
, i
)))
607 if (address
+ offset
>= arg_addr
608 && address
+ offset
< arg_addr
+ TYPE_LENGTH (arg_type
))
612 *result
= value_at_lazy (TYPE_BASECLASS (search_type
, i
),
617 result_count
+= dynamic_cast_check_1 (desired_type
,
620 TYPE_BASECLASS (search_type
, i
),
629 /* A helper for value_dynamic_cast. This implements the second of two
630 runtime checks: we look for a unique public sibling class of the
631 argument's declared class. */
634 dynamic_cast_check_2 (struct type
*desired_type
,
635 const bfd_byte
*contents
,
637 struct type
*search_type
,
638 struct value
**result
)
640 int i
, result_count
= 0;
642 for (i
= 0; i
< TYPE_N_BASECLASSES (search_type
) && result_count
< 2; ++i
)
646 if (! BASETYPE_VIA_PUBLIC (search_type
, i
))
649 offset
= baseclass_offset (search_type
, i
, contents
, address
);
651 error (_("virtual baseclass botch"));
652 if (class_types_same_p (desired_type
, TYPE_BASECLASS (search_type
, i
)))
656 *result
= value_at_lazy (TYPE_BASECLASS (search_type
, i
),
660 result_count
+= dynamic_cast_check_2 (desired_type
,
663 TYPE_BASECLASS (search_type
, i
),
670 /* The C++ dynamic_cast operator. */
673 value_dynamic_cast (struct type
*type
, struct value
*arg
)
675 int unambiguous
= 0, full
, top
, using_enc
;
676 struct type
*resolved_type
= check_typedef (type
);
677 struct type
*arg_type
= check_typedef (value_type (arg
));
678 struct type
*class_type
, *rtti_type
;
679 struct value
*result
, *tem
, *original_arg
= arg
;
681 int is_ref
= TYPE_CODE (resolved_type
) == TYPE_CODE_REF
;
683 if (TYPE_CODE (resolved_type
) != TYPE_CODE_PTR
684 && TYPE_CODE (resolved_type
) != TYPE_CODE_REF
)
685 error (_("Argument to dynamic_cast must be a pointer or reference type"));
686 if (TYPE_CODE (TYPE_TARGET_TYPE (resolved_type
)) != TYPE_CODE_VOID
687 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type
)) != TYPE_CODE_CLASS
)
688 error (_("Argument to dynamic_cast must be pointer to class or `void *'"));
690 class_type
= check_typedef (TYPE_TARGET_TYPE (resolved_type
));
691 if (TYPE_CODE (resolved_type
) == TYPE_CODE_PTR
)
693 if (TYPE_CODE (arg_type
) != TYPE_CODE_PTR
694 && ! (TYPE_CODE (arg_type
) == TYPE_CODE_INT
695 && value_as_long (arg
) == 0))
696 error (_("Argument to dynamic_cast does not have pointer type"));
697 if (TYPE_CODE (arg_type
) == TYPE_CODE_PTR
)
699 arg_type
= check_typedef (TYPE_TARGET_TYPE (arg_type
));
700 if (TYPE_CODE (arg_type
) != TYPE_CODE_CLASS
)
701 error (_("Argument to dynamic_cast does not have pointer to class type"));
704 /* Handle NULL pointers. */
705 if (value_as_long (arg
) == 0)
706 return value_zero (type
, not_lval
);
708 arg
= value_ind (arg
);
712 if (TYPE_CODE (arg_type
) != TYPE_CODE_CLASS
)
713 error (_("Argument to dynamic_cast does not have class type"));
716 /* If the classes are the same, just return the argument. */
717 if (class_types_same_p (class_type
, arg_type
))
718 return value_cast (type
, arg
);
720 /* If the target type is a unique base class of the argument's
721 declared type, just cast it. */
722 if (is_ancestor (class_type
, arg_type
))
724 if (is_unique_ancestor (class_type
, arg
))
725 return value_cast (type
, original_arg
);
726 error (_("Ambiguous dynamic_cast"));
729 rtti_type
= value_rtti_type (arg
, &full
, &top
, &using_enc
);
731 error (_("Couldn't determine value's most derived type for dynamic_cast"));
733 /* Compute the most derived object's address. */
734 addr
= value_address (arg
);
742 addr
+= top
+ value_embedded_offset (arg
);
744 /* dynamic_cast<void *> means to return a pointer to the
745 most-derived object. */
746 if (TYPE_CODE (resolved_type
) == TYPE_CODE_PTR
747 && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type
)) == TYPE_CODE_VOID
)
748 return value_at_lazy (type
, addr
);
750 tem
= value_at (type
, addr
);
752 /* The first dynamic check specified in 5.2.7. */
753 if (is_public_ancestor (arg_type
, TYPE_TARGET_TYPE (resolved_type
)))
755 if (class_types_same_p (rtti_type
, TYPE_TARGET_TYPE (resolved_type
)))
758 if (dynamic_cast_check_1 (TYPE_TARGET_TYPE (resolved_type
),
759 value_contents (tem
), value_address (tem
),
763 return value_cast (type
,
764 is_ref
? value_ref (result
) : value_addr (result
));
767 /* The second dynamic check specified in 5.2.7. */
769 if (is_public_ancestor (arg_type
, rtti_type
)
770 && dynamic_cast_check_2 (TYPE_TARGET_TYPE (resolved_type
),
771 value_contents (tem
), value_address (tem
),
772 rtti_type
, &result
) == 1)
773 return value_cast (type
,
774 is_ref
? value_ref (result
) : value_addr (result
));
776 if (TYPE_CODE (resolved_type
) == TYPE_CODE_PTR
)
777 return value_zero (type
, not_lval
);
779 error (_("dynamic_cast failed"));
782 /* Create a value of type TYPE that is zero, and return it. */
785 value_zero (struct type
*type
, enum lval_type lv
)
787 struct value
*val
= allocate_value (type
);
788 VALUE_LVAL (val
) = lv
;
793 /* Create a value of numeric type TYPE that is one, and return it. */
796 value_one (struct type
*type
, enum lval_type lv
)
798 struct type
*type1
= check_typedef (type
);
801 if (TYPE_CODE (type1
) == TYPE_CODE_DECFLOAT
)
803 enum bfd_endian byte_order
= gdbarch_byte_order (get_type_arch (type
));
805 decimal_from_string (v
, TYPE_LENGTH (type
), byte_order
, "1");
806 val
= value_from_decfloat (type
, v
);
808 else if (TYPE_CODE (type1
) == TYPE_CODE_FLT
)
810 val
= value_from_double (type
, (DOUBLEST
) 1);
812 else if (is_integral_type (type1
))
814 val
= value_from_longest (type
, (LONGEST
) 1);
818 error (_("Not a numeric type."));
821 VALUE_LVAL (val
) = lv
;
825 /* Helper function for value_at, value_at_lazy, and value_at_lazy_stack. */
827 static struct value
*
828 get_value_at (struct type
*type
, CORE_ADDR addr
, int lazy
)
832 if (TYPE_CODE (check_typedef (type
)) == TYPE_CODE_VOID
)
833 error (_("Attempt to dereference a generic pointer."));
837 val
= allocate_value_lazy (type
);
841 val
= allocate_value (type
);
842 read_memory (addr
, value_contents_all_raw (val
), TYPE_LENGTH (type
));
845 VALUE_LVAL (val
) = lval_memory
;
846 set_value_address (val
, addr
);
851 /* Return a value with type TYPE located at ADDR.
853 Call value_at only if the data needs to be fetched immediately;
854 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
855 value_at_lazy instead. value_at_lazy simply records the address of
856 the data and sets the lazy-evaluation-required flag. The lazy flag
857 is tested in the value_contents macro, which is used if and when
858 the contents are actually required.
860 Note: value_at does *NOT* handle embedded offsets; perform such
861 adjustments before or after calling it. */
864 value_at (struct type
*type
, CORE_ADDR addr
)
866 return get_value_at (type
, addr
, 0);
869 /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
872 value_at_lazy (struct type
*type
, CORE_ADDR addr
)
874 return get_value_at (type
, addr
, 1);
877 /* Called only from the value_contents and value_contents_all()
878 macros, if the current data for a variable needs to be loaded into
879 value_contents(VAL). Fetches the data from the user's process, and
880 clears the lazy flag to indicate that the data in the buffer is
883 If the value is zero-length, we avoid calling read_memory, which
884 would abort. We mark the value as fetched anyway -- all 0 bytes of
887 This function returns a value because it is used in the
888 value_contents macro as part of an expression, where a void would
889 not work. The value is ignored. */
892 value_fetch_lazy (struct value
*val
)
894 gdb_assert (value_lazy (val
));
895 allocate_value_contents (val
);
896 if (value_bitsize (val
))
898 /* To read a lazy bitfield, read the entire enclosing value. This
899 prevents reading the same block of (possibly volatile) memory once
900 per bitfield. It would be even better to read only the containing
901 word, but we have no way to record that just specific bits of a
902 value have been fetched. */
903 struct type
*type
= check_typedef (value_type (val
));
904 enum bfd_endian byte_order
= gdbarch_byte_order (get_type_arch (type
));
905 struct value
*parent
= value_parent (val
);
906 LONGEST offset
= value_offset (val
);
907 LONGEST num
= unpack_bits_as_long (value_type (val
),
908 value_contents (parent
) + offset
,
910 value_bitsize (val
));
911 int length
= TYPE_LENGTH (type
);
912 store_signed_integer (value_contents_raw (val
), length
, byte_order
, num
);
914 else if (VALUE_LVAL (val
) == lval_memory
)
916 CORE_ADDR addr
= value_address (val
);
917 int length
= TYPE_LENGTH (check_typedef (value_enclosing_type (val
)));
921 if (value_stack (val
))
922 read_stack (addr
, value_contents_all_raw (val
), length
);
924 read_memory (addr
, value_contents_all_raw (val
), length
);
927 else if (VALUE_LVAL (val
) == lval_register
)
929 struct frame_info
*frame
;
931 struct type
*type
= check_typedef (value_type (val
));
932 struct value
*new_val
= val
, *mark
= value_mark ();
934 /* Offsets are not supported here; lazy register values must
935 refer to the entire register. */
936 gdb_assert (value_offset (val
) == 0);
938 while (VALUE_LVAL (new_val
) == lval_register
&& value_lazy (new_val
))
940 frame
= frame_find_by_id (VALUE_FRAME_ID (new_val
));
941 regnum
= VALUE_REGNUM (new_val
);
943 gdb_assert (frame
!= NULL
);
945 /* Convertible register routines are used for multi-register
946 values and for interpretation in different types
947 (e.g. float or int from a double register). Lazy
948 register values should have the register's natural type,
949 so they do not apply. */
950 gdb_assert (!gdbarch_convert_register_p (get_frame_arch (frame
),
953 new_val
= get_frame_register_value (frame
, regnum
);
956 /* If it's still lazy (for instance, a saved register on the
958 if (value_lazy (new_val
))
959 value_fetch_lazy (new_val
);
961 /* If the register was not saved, mark it unavailable. */
962 if (value_optimized_out (new_val
))
963 set_value_optimized_out (val
, 1);
965 memcpy (value_contents_raw (val
), value_contents (new_val
),
970 struct gdbarch
*gdbarch
;
971 frame
= frame_find_by_id (VALUE_FRAME_ID (val
));
972 regnum
= VALUE_REGNUM (val
);
973 gdbarch
= get_frame_arch (frame
);
975 fprintf_unfiltered (gdb_stdlog
, "\
976 { value_fetch_lazy (frame=%d,regnum=%d(%s),...) ",
977 frame_relative_level (frame
), regnum
,
978 user_reg_map_regnum_to_name (gdbarch
, regnum
));
980 fprintf_unfiltered (gdb_stdlog
, "->");
981 if (value_optimized_out (new_val
))
982 fprintf_unfiltered (gdb_stdlog
, " optimized out");
986 const gdb_byte
*buf
= value_contents (new_val
);
988 if (VALUE_LVAL (new_val
) == lval_register
)
989 fprintf_unfiltered (gdb_stdlog
, " register=%d",
990 VALUE_REGNUM (new_val
));
991 else if (VALUE_LVAL (new_val
) == lval_memory
)
992 fprintf_unfiltered (gdb_stdlog
, " address=%s",
994 value_address (new_val
)));
996 fprintf_unfiltered (gdb_stdlog
, " computed");
998 fprintf_unfiltered (gdb_stdlog
, " bytes=");
999 fprintf_unfiltered (gdb_stdlog
, "[");
1000 for (i
= 0; i
< register_size (gdbarch
, regnum
); i
++)
1001 fprintf_unfiltered (gdb_stdlog
, "%02x", buf
[i
]);
1002 fprintf_unfiltered (gdb_stdlog
, "]");
1005 fprintf_unfiltered (gdb_stdlog
, " }\n");
1008 /* Dispose of the intermediate values. This prevents
1009 watchpoints from trying to watch the saved frame pointer. */
1010 value_free_to_mark (mark
);
1012 else if (VALUE_LVAL (val
) == lval_computed
)
1013 value_computed_funcs (val
)->read (val
);
1015 internal_error (__FILE__
, __LINE__
, "Unexpected lazy value type.");
1017 set_value_lazy (val
, 0);
1022 /* Store the contents of FROMVAL into the location of TOVAL.
1023 Return a new value with the location of TOVAL and contents of FROMVAL. */
1026 value_assign (struct value
*toval
, struct value
*fromval
)
1030 struct frame_id old_frame
;
1032 if (!deprecated_value_modifiable (toval
))
1033 error (_("Left operand of assignment is not a modifiable lvalue."));
1035 toval
= coerce_ref (toval
);
1037 type
= value_type (toval
);
1038 if (VALUE_LVAL (toval
) != lval_internalvar
)
1040 toval
= value_coerce_to_target (toval
);
1041 fromval
= value_cast (type
, fromval
);
1045 /* Coerce arrays and functions to pointers, except for arrays
1046 which only live in GDB's storage. */
1047 if (!value_must_coerce_to_target (fromval
))
1048 fromval
= coerce_array (fromval
);
1051 CHECK_TYPEDEF (type
);
1053 /* Since modifying a register can trash the frame chain, and
1054 modifying memory can trash the frame cache, we save the old frame
1055 and then restore the new frame afterwards. */
1056 old_frame
= get_frame_id (deprecated_safe_get_selected_frame ());
1058 switch (VALUE_LVAL (toval
))
1060 case lval_internalvar
:
1061 set_internalvar (VALUE_INTERNALVAR (toval
), fromval
);
1062 val
= value_copy (fromval
);
1063 val
= value_change_enclosing_type (val
,
1064 value_enclosing_type (fromval
));
1065 set_value_embedded_offset (val
, value_embedded_offset (fromval
));
1066 set_value_pointed_to_offset (val
,
1067 value_pointed_to_offset (fromval
));
1070 case lval_internalvar_component
:
1071 set_internalvar_component (VALUE_INTERNALVAR (toval
),
1072 value_offset (toval
),
1073 value_bitpos (toval
),
1074 value_bitsize (toval
),
1080 const gdb_byte
*dest_buffer
;
1081 CORE_ADDR changed_addr
;
1083 gdb_byte buffer
[sizeof (LONGEST
)];
1085 if (value_bitsize (toval
))
1087 struct value
*parent
= value_parent (toval
);
1088 changed_addr
= value_address (parent
) + value_offset (toval
);
1090 changed_len
= (value_bitpos (toval
)
1091 + value_bitsize (toval
)
1092 + HOST_CHAR_BIT
- 1)
1095 /* If we can read-modify-write exactly the size of the
1096 containing type (e.g. short or int) then do so. This
1097 is safer for volatile bitfields mapped to hardware
1099 if (changed_len
< TYPE_LENGTH (type
)
1100 && TYPE_LENGTH (type
) <= (int) sizeof (LONGEST
)
1101 && ((LONGEST
) changed_addr
% TYPE_LENGTH (type
)) == 0)
1102 changed_len
= TYPE_LENGTH (type
);
1104 if (changed_len
> (int) sizeof (LONGEST
))
1105 error (_("Can't handle bitfields which don't fit in a %d bit word."),
1106 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
1108 read_memory (changed_addr
, buffer
, changed_len
);
1109 modify_field (type
, buffer
, value_as_long (fromval
),
1110 value_bitpos (toval
), value_bitsize (toval
));
1111 dest_buffer
= buffer
;
1115 changed_addr
= value_address (toval
);
1116 changed_len
= TYPE_LENGTH (type
);
1117 dest_buffer
= value_contents (fromval
);
1120 write_memory (changed_addr
, dest_buffer
, changed_len
);
1121 observer_notify_memory_changed (changed_addr
, changed_len
,
1128 struct frame_info
*frame
;
1129 struct gdbarch
*gdbarch
;
1132 /* Figure out which frame this is in currently. */
1133 frame
= frame_find_by_id (VALUE_FRAME_ID (toval
));
1134 value_reg
= VALUE_REGNUM (toval
);
1137 error (_("Value being assigned to is no longer active."));
1139 gdbarch
= get_frame_arch (frame
);
1140 if (gdbarch_convert_register_p (gdbarch
, VALUE_REGNUM (toval
), type
))
1142 /* If TOVAL is a special machine register requiring
1143 conversion of program values to a special raw
1145 gdbarch_value_to_register (gdbarch
, frame
,
1146 VALUE_REGNUM (toval
), type
,
1147 value_contents (fromval
));
1151 if (value_bitsize (toval
))
1153 struct value
*parent
= value_parent (toval
);
1154 int offset
= value_offset (parent
) + value_offset (toval
);
1156 gdb_byte buffer
[sizeof (LONGEST
)];
1158 changed_len
= (value_bitpos (toval
)
1159 + value_bitsize (toval
)
1160 + HOST_CHAR_BIT
- 1)
1163 if (changed_len
> (int) sizeof (LONGEST
))
1164 error (_("Can't handle bitfields which don't fit in a %d bit word."),
1165 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
1167 get_frame_register_bytes (frame
, value_reg
, offset
,
1168 changed_len
, buffer
);
1170 modify_field (type
, buffer
, value_as_long (fromval
),
1171 value_bitpos (toval
), value_bitsize (toval
));
1173 put_frame_register_bytes (frame
, value_reg
, offset
,
1174 changed_len
, buffer
);
1178 put_frame_register_bytes (frame
, value_reg
,
1179 value_offset (toval
),
1181 value_contents (fromval
));
1185 if (deprecated_register_changed_hook
)
1186 deprecated_register_changed_hook (-1);
1187 observer_notify_target_changed (¤t_target
);
1193 struct lval_funcs
*funcs
= value_computed_funcs (toval
);
1195 funcs
->write (toval
, fromval
);
1200 error (_("Left operand of assignment is not an lvalue."));
1203 /* Assigning to the stack pointer, frame pointer, and other
1204 (architecture and calling convention specific) registers may
1205 cause the frame cache to be out of date. Assigning to memory
1206 also can. We just do this on all assignments to registers or
1207 memory, for simplicity's sake; I doubt the slowdown matters. */
1208 switch (VALUE_LVAL (toval
))
1213 reinit_frame_cache ();
1215 /* Having destroyed the frame cache, restore the selected
1218 /* FIXME: cagney/2002-11-02: There has to be a better way of
1219 doing this. Instead of constantly saving/restoring the
1220 frame. Why not create a get_selected_frame() function that,
1221 having saved the selected frame's ID can automatically
1222 re-find the previously selected frame automatically. */
1225 struct frame_info
*fi
= frame_find_by_id (old_frame
);
1235 /* If the field does not entirely fill a LONGEST, then zero the sign
1236 bits. If the field is signed, and is negative, then sign
1238 if ((value_bitsize (toval
) > 0)
1239 && (value_bitsize (toval
) < 8 * (int) sizeof (LONGEST
)))
1241 LONGEST fieldval
= value_as_long (fromval
);
1242 LONGEST valmask
= (((ULONGEST
) 1) << value_bitsize (toval
)) - 1;
1244 fieldval
&= valmask
;
1245 if (!TYPE_UNSIGNED (type
)
1246 && (fieldval
& (valmask
^ (valmask
>> 1))))
1247 fieldval
|= ~valmask
;
1249 fromval
= value_from_longest (type
, fieldval
);
1252 val
= value_copy (toval
);
1253 memcpy (value_contents_raw (val
), value_contents (fromval
),
1254 TYPE_LENGTH (type
));
1255 deprecated_set_value_type (val
, type
);
1256 val
= value_change_enclosing_type (val
,
1257 value_enclosing_type (fromval
));
1258 set_value_embedded_offset (val
, value_embedded_offset (fromval
));
1259 set_value_pointed_to_offset (val
, value_pointed_to_offset (fromval
));
1264 /* Extend a value VAL to COUNT repetitions of its type. */
1267 value_repeat (struct value
*arg1
, int count
)
1271 if (VALUE_LVAL (arg1
) != lval_memory
)
1272 error (_("Only values in memory can be extended with '@'."));
1274 error (_("Invalid number %d of repetitions."), count
);
1276 val
= allocate_repeat_value (value_enclosing_type (arg1
), count
);
1278 read_memory (value_address (arg1
),
1279 value_contents_all_raw (val
),
1280 TYPE_LENGTH (value_enclosing_type (val
)));
1281 VALUE_LVAL (val
) = lval_memory
;
1282 set_value_address (val
, value_address (arg1
));
1288 value_of_variable (struct symbol
*var
, struct block
*b
)
1291 struct frame_info
*frame
;
1293 if (!symbol_read_needs_frame (var
))
1296 frame
= get_selected_frame (_("No frame selected."));
1299 frame
= block_innermost_frame (b
);
1302 if (BLOCK_FUNCTION (b
) && !block_inlined_p (b
)
1303 && SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b
)))
1304 error (_("No frame is currently executing in block %s."),
1305 SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b
)));
1307 error (_("No frame is currently executing in specified block"));
1311 val
= read_var_value (var
, frame
);
1313 error (_("Address of symbol \"%s\" is unknown."), SYMBOL_PRINT_NAME (var
));
1319 address_of_variable (struct symbol
*var
, struct block
*b
)
1321 struct type
*type
= SYMBOL_TYPE (var
);
1324 /* Evaluate it first; if the result is a memory address, we're fine.
1325 Lazy evaluation pays off here. */
1327 val
= value_of_variable (var
, b
);
1329 if ((VALUE_LVAL (val
) == lval_memory
&& value_lazy (val
))
1330 || TYPE_CODE (type
) == TYPE_CODE_FUNC
)
1332 CORE_ADDR addr
= value_address (val
);
1333 return value_from_pointer (lookup_pointer_type (type
), addr
);
1336 /* Not a memory address; check what the problem was. */
1337 switch (VALUE_LVAL (val
))
1341 struct frame_info
*frame
;
1342 const char *regname
;
1344 frame
= frame_find_by_id (VALUE_FRAME_ID (val
));
1347 regname
= gdbarch_register_name (get_frame_arch (frame
),
1348 VALUE_REGNUM (val
));
1349 gdb_assert (regname
&& *regname
);
1351 error (_("Address requested for identifier "
1352 "\"%s\" which is in register $%s"),
1353 SYMBOL_PRINT_NAME (var
), regname
);
1358 error (_("Can't take address of \"%s\" which isn't an lvalue."),
1359 SYMBOL_PRINT_NAME (var
));
1366 /* Return one if VAL does not live in target memory, but should in order
1367 to operate on it. Otherwise return zero. */
1370 value_must_coerce_to_target (struct value
*val
)
1372 struct type
*valtype
;
1374 /* The only lval kinds which do not live in target memory. */
1375 if (VALUE_LVAL (val
) != not_lval
1376 && VALUE_LVAL (val
) != lval_internalvar
)
1379 valtype
= check_typedef (value_type (val
));
1381 switch (TYPE_CODE (valtype
))
1383 case TYPE_CODE_ARRAY
:
1384 case TYPE_CODE_STRING
:
1391 /* Make sure that VAL lives in target memory if it's supposed to. For instance,
1392 strings are constructed as character arrays in GDB's storage, and this
1393 function copies them to the target. */
1396 value_coerce_to_target (struct value
*val
)
1401 if (!value_must_coerce_to_target (val
))
1404 length
= TYPE_LENGTH (check_typedef (value_type (val
)));
1405 addr
= allocate_space_in_inferior (length
);
1406 write_memory (addr
, value_contents (val
), length
);
1407 return value_at_lazy (value_type (val
), addr
);
1410 /* Given a value which is an array, return a value which is a pointer
1411 to its first element, regardless of whether or not the array has a
1412 nonzero lower bound.
1414 FIXME: A previous comment here indicated that this routine should
1415 be substracting the array's lower bound. It's not clear to me that
1416 this is correct. Given an array subscripting operation, it would
1417 certainly work to do the adjustment here, essentially computing:
1419 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
1421 However I believe a more appropriate and logical place to account
1422 for the lower bound is to do so in value_subscript, essentially
1425 (&array[0] + ((index - lowerbound) * sizeof array[0]))
1427 As further evidence consider what would happen with operations
1428 other than array subscripting, where the caller would get back a
1429 value that had an address somewhere before the actual first element
1430 of the array, and the information about the lower bound would be
1431 lost because of the coercion to pointer type.
1435 value_coerce_array (struct value
*arg1
)
1437 struct type
*type
= check_typedef (value_type (arg1
));
1439 /* If the user tries to do something requiring a pointer with an
1440 array that has not yet been pushed to the target, then this would
1441 be a good time to do so. */
1442 arg1
= value_coerce_to_target (arg1
);
1444 if (VALUE_LVAL (arg1
) != lval_memory
)
1445 error (_("Attempt to take address of value not located in memory."));
1447 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
1448 value_address (arg1
));
1451 /* Given a value which is a function, return a value which is a pointer
1455 value_coerce_function (struct value
*arg1
)
1457 struct value
*retval
;
1459 if (VALUE_LVAL (arg1
) != lval_memory
)
1460 error (_("Attempt to take address of value not located in memory."));
1462 retval
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1463 value_address (arg1
));
1467 /* Return a pointer value for the object for which ARG1 is the
1471 value_addr (struct value
*arg1
)
1475 struct type
*type
= check_typedef (value_type (arg1
));
1476 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
1478 /* Copy the value, but change the type from (T&) to (T*). We
1479 keep the same location information, which is efficient, and
1480 allows &(&X) to get the location containing the reference. */
1481 arg2
= value_copy (arg1
);
1482 deprecated_set_value_type (arg2
,
1483 lookup_pointer_type (TYPE_TARGET_TYPE (type
)));
1486 if (TYPE_CODE (type
) == TYPE_CODE_FUNC
)
1487 return value_coerce_function (arg1
);
1489 /* If this is an array that has not yet been pushed to the target,
1490 then this would be a good time to force it to memory. */
1491 arg1
= value_coerce_to_target (arg1
);
1493 if (VALUE_LVAL (arg1
) != lval_memory
)
1494 error (_("Attempt to take address of value not located in memory."));
1496 /* Get target memory address */
1497 arg2
= value_from_pointer (lookup_pointer_type (value_type (arg1
)),
1498 (value_address (arg1
)
1499 + value_embedded_offset (arg1
)));
1501 /* This may be a pointer to a base subobject; so remember the
1502 full derived object's type ... */
1503 arg2
= value_change_enclosing_type (arg2
, lookup_pointer_type (value_enclosing_type (arg1
)));
1504 /* ... and also the relative position of the subobject in the full
1506 set_value_pointed_to_offset (arg2
, value_embedded_offset (arg1
));
1510 /* Return a reference value for the object for which ARG1 is the
1514 value_ref (struct value
*arg1
)
1518 struct type
*type
= check_typedef (value_type (arg1
));
1519 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
1522 arg2
= value_addr (arg1
);
1523 deprecated_set_value_type (arg2
, lookup_reference_type (type
));
1527 /* Given a value of a pointer type, apply the C unary * operator to
1531 value_ind (struct value
*arg1
)
1533 struct type
*base_type
;
1536 arg1
= coerce_array (arg1
);
1538 base_type
= check_typedef (value_type (arg1
));
1540 if (TYPE_CODE (base_type
) == TYPE_CODE_PTR
)
1542 struct type
*enc_type
;
1543 /* We may be pointing to something embedded in a larger object.
1544 Get the real type of the enclosing object. */
1545 enc_type
= check_typedef (value_enclosing_type (arg1
));
1546 enc_type
= TYPE_TARGET_TYPE (enc_type
);
1548 if (TYPE_CODE (check_typedef (enc_type
)) == TYPE_CODE_FUNC
1549 || TYPE_CODE (check_typedef (enc_type
)) == TYPE_CODE_METHOD
)
1550 /* For functions, go through find_function_addr, which knows
1551 how to handle function descriptors. */
1552 arg2
= value_at_lazy (enc_type
,
1553 find_function_addr (arg1
, NULL
));
1555 /* Retrieve the enclosing object pointed to */
1556 arg2
= value_at_lazy (enc_type
,
1557 (value_as_address (arg1
)
1558 - value_pointed_to_offset (arg1
)));
1560 /* Re-adjust type. */
1561 deprecated_set_value_type (arg2
, TYPE_TARGET_TYPE (base_type
));
1562 /* Add embedding info. */
1563 arg2
= value_change_enclosing_type (arg2
, enc_type
);
1564 set_value_embedded_offset (arg2
, value_pointed_to_offset (arg1
));
1566 /* We may be pointing to an object of some derived type. */
1567 arg2
= value_full_object (arg2
, NULL
, 0, 0, 0);
1571 error (_("Attempt to take contents of a non-pointer value."));
1572 return 0; /* For lint -- never reached. */
1575 /* Create a value for an array by allocating space in GDB, copying
1576 copying the data into that space, and then setting up an array
1579 The array bounds are set from LOWBOUND and HIGHBOUND, and the array
1580 is populated from the values passed in ELEMVEC.
1582 The element type of the array is inherited from the type of the
1583 first element, and all elements must have the same size (though we
1584 don't currently enforce any restriction on their types). */
1587 value_array (int lowbound
, int highbound
, struct value
**elemvec
)
1591 unsigned int typelength
;
1593 struct type
*arraytype
;
1596 /* Validate that the bounds are reasonable and that each of the
1597 elements have the same size. */
1599 nelem
= highbound
- lowbound
+ 1;
1602 error (_("bad array bounds (%d, %d)"), lowbound
, highbound
);
1604 typelength
= TYPE_LENGTH (value_enclosing_type (elemvec
[0]));
1605 for (idx
= 1; idx
< nelem
; idx
++)
1607 if (TYPE_LENGTH (value_enclosing_type (elemvec
[idx
])) != typelength
)
1609 error (_("array elements must all be the same size"));
1613 arraytype
= lookup_array_range_type (value_enclosing_type (elemvec
[0]),
1614 lowbound
, highbound
);
1616 if (!current_language
->c_style_arrays
)
1618 val
= allocate_value (arraytype
);
1619 for (idx
= 0; idx
< nelem
; idx
++)
1621 memcpy (value_contents_all_raw (val
) + (idx
* typelength
),
1622 value_contents_all (elemvec
[idx
]),
1628 /* Allocate space to store the array, and then initialize it by
1629 copying in each element. */
1631 val
= allocate_value (arraytype
);
1632 for (idx
= 0; idx
< nelem
; idx
++)
1633 memcpy (value_contents_writeable (val
) + (idx
* typelength
),
1634 value_contents_all (elemvec
[idx
]),
1640 value_cstring (char *ptr
, int len
, struct type
*char_type
)
1643 int lowbound
= current_language
->string_lower_bound
;
1644 int highbound
= len
/ TYPE_LENGTH (char_type
);
1645 struct type
*stringtype
1646 = lookup_array_range_type (char_type
, lowbound
, highbound
+ lowbound
- 1);
1648 val
= allocate_value (stringtype
);
1649 memcpy (value_contents_raw (val
), ptr
, len
);
1653 /* Create a value for a string constant by allocating space in the
1654 inferior, copying the data into that space, and returning the
1655 address with type TYPE_CODE_STRING. PTR points to the string
1656 constant data; LEN is number of characters.
1658 Note that string types are like array of char types with a lower
1659 bound of zero and an upper bound of LEN - 1. Also note that the
1660 string may contain embedded null bytes. */
1663 value_string (char *ptr
, int len
, struct type
*char_type
)
1666 int lowbound
= current_language
->string_lower_bound
;
1667 int highbound
= len
/ TYPE_LENGTH (char_type
);
1668 struct type
*stringtype
1669 = lookup_string_range_type (char_type
, lowbound
, highbound
+ lowbound
- 1);
1671 val
= allocate_value (stringtype
);
1672 memcpy (value_contents_raw (val
), ptr
, len
);
1677 value_bitstring (char *ptr
, int len
, struct type
*index_type
)
1680 struct type
*domain_type
1681 = create_range_type (NULL
, index_type
, 0, len
- 1);
1682 struct type
*type
= create_set_type (NULL
, domain_type
);
1683 TYPE_CODE (type
) = TYPE_CODE_BITSTRING
;
1684 val
= allocate_value (type
);
1685 memcpy (value_contents_raw (val
), ptr
, TYPE_LENGTH (type
));
1689 /* See if we can pass arguments in T2 to a function which takes
1690 arguments of types T1. T1 is a list of NARGS arguments, and T2 is
1691 a NULL-terminated vector. If some arguments need coercion of some
1692 sort, then the coerced values are written into T2. Return value is
1693 0 if the arguments could be matched, or the position at which they
1696 STATICP is nonzero if the T1 argument list came from a static
1697 member function. T2 will still include the ``this'' pointer, but
1700 For non-static member functions, we ignore the first argument,
1701 which is the type of the instance variable. This is because we
1702 want to handle calls with objects from derived classes. This is
1703 not entirely correct: we should actually check to make sure that a
1704 requested operation is type secure, shouldn't we? FIXME. */
1707 typecmp (int staticp
, int varargs
, int nargs
,
1708 struct field t1
[], struct value
*t2
[])
1713 internal_error (__FILE__
, __LINE__
,
1714 _("typecmp: no argument list"));
1716 /* Skip ``this'' argument if applicable. T2 will always include
1722 (i
< nargs
) && TYPE_CODE (t1
[i
].type
) != TYPE_CODE_VOID
;
1725 struct type
*tt1
, *tt2
;
1730 tt1
= check_typedef (t1
[i
].type
);
1731 tt2
= check_typedef (value_type (t2
[i
]));
1733 if (TYPE_CODE (tt1
) == TYPE_CODE_REF
1734 /* We should be doing hairy argument matching, as below. */
1735 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1
))) == TYPE_CODE (tt2
)))
1737 if (TYPE_CODE (tt2
) == TYPE_CODE_ARRAY
)
1738 t2
[i
] = value_coerce_array (t2
[i
]);
1740 t2
[i
] = value_ref (t2
[i
]);
1744 /* djb - 20000715 - Until the new type structure is in the
1745 place, and we can attempt things like implicit conversions,
1746 we need to do this so you can take something like a map<const
1747 char *>, and properly access map["hello"], because the
1748 argument to [] will be a reference to a pointer to a char,
1749 and the argument will be a pointer to a char. */
1750 while (TYPE_CODE(tt1
) == TYPE_CODE_REF
1751 || TYPE_CODE (tt1
) == TYPE_CODE_PTR
)
1753 tt1
= check_typedef( TYPE_TARGET_TYPE(tt1
) );
1755 while (TYPE_CODE(tt2
) == TYPE_CODE_ARRAY
1756 || TYPE_CODE(tt2
) == TYPE_CODE_PTR
1757 || TYPE_CODE(tt2
) == TYPE_CODE_REF
)
1759 tt2
= check_typedef (TYPE_TARGET_TYPE(tt2
));
1761 if (TYPE_CODE (tt1
) == TYPE_CODE (tt2
))
1763 /* Array to pointer is a `trivial conversion' according to the
1766 /* We should be doing much hairier argument matching (see
1767 section 13.2 of the ARM), but as a quick kludge, just check
1768 for the same type code. */
1769 if (TYPE_CODE (t1
[i
].type
) != TYPE_CODE (value_type (t2
[i
])))
1772 if (varargs
|| t2
[i
] == NULL
)
1777 /* Helper function used by value_struct_elt to recurse through
1778 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1779 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1780 TYPE. If found, return value, else return NULL.
1782 If LOOKING_FOR_BASECLASS, then instead of looking for struct
1783 fields, look for a baseclass named NAME. */
1785 static struct value
*
1786 search_struct_field (char *name
, struct value
*arg1
, int offset
,
1787 struct type
*type
, int looking_for_baseclass
)
1790 int nbases
= TYPE_N_BASECLASSES (type
);
1792 CHECK_TYPEDEF (type
);
1794 if (!looking_for_baseclass
)
1795 for (i
= TYPE_NFIELDS (type
) - 1; i
>= nbases
; i
--)
1797 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
1799 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1802 if (field_is_static (&TYPE_FIELD (type
, i
)))
1804 v
= value_static_field (type
, i
);
1806 error (_("field %s is nonexistent or has been optimised out"),
1811 v
= value_primitive_field (arg1
, offset
, i
, type
);
1813 error (_("there is no field named %s"), name
);
1819 && (t_field_name
[0] == '\0'
1820 || (TYPE_CODE (type
) == TYPE_CODE_UNION
1821 && (strcmp_iw (t_field_name
, "else") == 0))))
1823 struct type
*field_type
= TYPE_FIELD_TYPE (type
, i
);
1824 if (TYPE_CODE (field_type
) == TYPE_CODE_UNION
1825 || TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
)
1827 /* Look for a match through the fields of an anonymous
1828 union, or anonymous struct. C++ provides anonymous
1831 In the GNU Chill (now deleted from GDB)
1832 implementation of variant record types, each
1833 <alternative field> has an (anonymous) union type,
1834 each member of the union represents a <variant
1835 alternative>. Each <variant alternative> is
1836 represented as a struct, with a member for each
1840 int new_offset
= offset
;
1842 /* This is pretty gross. In G++, the offset in an
1843 anonymous union is relative to the beginning of the
1844 enclosing struct. In the GNU Chill (now deleted
1845 from GDB) implementation of variant records, the
1846 bitpos is zero in an anonymous union field, so we
1847 have to add the offset of the union here. */
1848 if (TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
1849 || (TYPE_NFIELDS (field_type
) > 0
1850 && TYPE_FIELD_BITPOS (field_type
, 0) == 0))
1851 new_offset
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
1853 v
= search_struct_field (name
, arg1
, new_offset
,
1855 looking_for_baseclass
);
1862 for (i
= 0; i
< nbases
; i
++)
1865 struct type
*basetype
= check_typedef (TYPE_BASECLASS (type
, i
));
1866 /* If we are looking for baseclasses, this is what we get when
1867 we hit them. But it could happen that the base part's member
1868 name is not yet filled in. */
1869 int found_baseclass
= (looking_for_baseclass
1870 && TYPE_BASECLASS_NAME (type
, i
) != NULL
1871 && (strcmp_iw (name
,
1872 TYPE_BASECLASS_NAME (type
,
1875 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1880 boffset
= baseclass_offset (type
, i
,
1881 value_contents (arg1
) + offset
,
1882 value_address (arg1
) + offset
);
1884 error (_("virtual baseclass botch"));
1886 /* The virtual base class pointer might have been clobbered
1887 by the user program. Make sure that it still points to a
1888 valid memory location. */
1891 if (boffset
< 0 || boffset
>= TYPE_LENGTH (type
))
1893 CORE_ADDR base_addr
;
1895 v2
= allocate_value (basetype
);
1896 base_addr
= value_address (arg1
) + boffset
;
1897 if (target_read_memory (base_addr
,
1898 value_contents_raw (v2
),
1899 TYPE_LENGTH (basetype
)) != 0)
1900 error (_("virtual baseclass botch"));
1901 VALUE_LVAL (v2
) = lval_memory
;
1902 set_value_address (v2
, base_addr
);
1906 if (VALUE_LVAL (arg1
) == lval_memory
&& value_lazy (arg1
))
1907 v2
= allocate_value_lazy (basetype
);
1910 v2
= allocate_value (basetype
);
1911 memcpy (value_contents_raw (v2
),
1912 value_contents_raw (arg1
) + boffset
,
1913 TYPE_LENGTH (basetype
));
1915 set_value_component_location (v2
, arg1
);
1916 VALUE_FRAME_ID (v2
) = VALUE_FRAME_ID (arg1
);
1917 set_value_offset (v2
, value_offset (arg1
) + boffset
);
1920 if (found_baseclass
)
1922 v
= search_struct_field (name
, v2
, 0,
1923 TYPE_BASECLASS (type
, i
),
1924 looking_for_baseclass
);
1926 else if (found_baseclass
)
1927 v
= value_primitive_field (arg1
, offset
, i
, type
);
1929 v
= search_struct_field (name
, arg1
,
1930 offset
+ TYPE_BASECLASS_BITPOS (type
,
1932 basetype
, looking_for_baseclass
);
1939 /* Helper function used by value_struct_elt to recurse through
1940 baseclasses. Look for a field NAME in ARG1. Adjust the address of
1941 ARG1 by OFFSET bytes, and search in it assuming it has (class) type
1944 If found, return value, else if name matched and args not return
1945 (value) -1, else return NULL. */
1947 static struct value
*
1948 search_struct_method (char *name
, struct value
**arg1p
,
1949 struct value
**args
, int offset
,
1950 int *static_memfuncp
, struct type
*type
)
1954 int name_matched
= 0;
1955 char dem_opname
[64];
1957 CHECK_TYPEDEF (type
);
1958 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
1960 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
1961 /* FIXME! May need to check for ARM demangling here */
1962 if (strncmp (t_field_name
, "__", 2) == 0 ||
1963 strncmp (t_field_name
, "op", 2) == 0 ||
1964 strncmp (t_field_name
, "type", 4) == 0)
1966 if (cplus_demangle_opname (t_field_name
, dem_opname
, DMGL_ANSI
))
1967 t_field_name
= dem_opname
;
1968 else if (cplus_demangle_opname (t_field_name
, dem_opname
, 0))
1969 t_field_name
= dem_opname
;
1971 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1973 int j
= TYPE_FN_FIELDLIST_LENGTH (type
, i
) - 1;
1974 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
1977 check_stub_method_group (type
, i
);
1978 if (j
> 0 && args
== 0)
1979 error (_("cannot resolve overloaded method `%s': no arguments supplied"), name
);
1980 else if (j
== 0 && args
== 0)
1982 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
1989 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f
, j
),
1990 TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f
, j
)),
1991 TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f
, j
)),
1992 TYPE_FN_FIELD_ARGS (f
, j
), args
))
1994 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
1995 return value_virtual_fn_field (arg1p
, f
, j
,
1997 if (TYPE_FN_FIELD_STATIC_P (f
, j
)
1999 *static_memfuncp
= 1;
2000 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
2009 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2013 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2015 struct type
*baseclass
= check_typedef (TYPE_BASECLASS (type
, i
));
2016 const gdb_byte
*base_valaddr
;
2018 /* The virtual base class pointer might have been
2019 clobbered by the user program. Make sure that it
2020 still points to a valid memory location. */
2022 if (offset
< 0 || offset
>= TYPE_LENGTH (type
))
2024 gdb_byte
*tmp
= alloca (TYPE_LENGTH (baseclass
));
2025 if (target_read_memory (value_address (*arg1p
) + offset
,
2026 tmp
, TYPE_LENGTH (baseclass
)) != 0)
2027 error (_("virtual baseclass botch"));
2031 base_valaddr
= value_contents (*arg1p
) + offset
;
2033 base_offset
= baseclass_offset (type
, i
, base_valaddr
,
2034 value_address (*arg1p
) + offset
);
2035 if (base_offset
== -1)
2036 error (_("virtual baseclass botch"));
2040 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2042 v
= search_struct_method (name
, arg1p
, args
, base_offset
+ offset
,
2043 static_memfuncp
, TYPE_BASECLASS (type
, i
));
2044 if (v
== (struct value
*) - 1)
2050 /* FIXME-bothner: Why is this commented out? Why is it here? */
2051 /* *arg1p = arg1_tmp; */
2056 return (struct value
*) - 1;
2061 /* Given *ARGP, a value of type (pointer to a)* structure/union,
2062 extract the component named NAME from the ultimate target
2063 structure/union and return it as a value with its appropriate type.
2064 ERR is used in the error message if *ARGP's type is wrong.
2066 C++: ARGS is a list of argument types to aid in the selection of
2067 an appropriate method. Also, handle derived types.
2069 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
2070 where the truthvalue of whether the function that was resolved was
2071 a static member function or not is stored.
2073 ERR is an error message to be printed in case the field is not
2077 value_struct_elt (struct value
**argp
, struct value
**args
,
2078 char *name
, int *static_memfuncp
, char *err
)
2083 *argp
= coerce_array (*argp
);
2085 t
= check_typedef (value_type (*argp
));
2087 /* Follow pointers until we get to a non-pointer. */
2089 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
2091 *argp
= value_ind (*argp
);
2092 /* Don't coerce fn pointer to fn and then back again! */
2093 if (TYPE_CODE (value_type (*argp
)) != TYPE_CODE_FUNC
)
2094 *argp
= coerce_array (*argp
);
2095 t
= check_typedef (value_type (*argp
));
2098 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2099 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2100 error (_("Attempt to extract a component of a value that is not a %s."), err
);
2102 /* Assume it's not, unless we see that it is. */
2103 if (static_memfuncp
)
2104 *static_memfuncp
= 0;
2108 /* if there are no arguments ...do this... */
2110 /* Try as a field first, because if we succeed, there is less
2112 v
= search_struct_field (name
, *argp
, 0, t
, 0);
2116 /* C++: If it was not found as a data field, then try to
2117 return it as a pointer to a method. */
2118 v
= search_struct_method (name
, argp
, args
, 0,
2119 static_memfuncp
, t
);
2121 if (v
== (struct value
*) - 1)
2122 error (_("Cannot take address of method %s."), name
);
2125 if (TYPE_NFN_FIELDS (t
))
2126 error (_("There is no member or method named %s."), name
);
2128 error (_("There is no member named %s."), name
);
2133 v
= search_struct_method (name
, argp
, args
, 0,
2134 static_memfuncp
, t
);
2136 if (v
== (struct value
*) - 1)
2138 error (_("One of the arguments you tried to pass to %s could not be converted to what the function wants."), name
);
2142 /* See if user tried to invoke data as function. If so, hand it
2143 back. If it's not callable (i.e., a pointer to function),
2144 gdb should give an error. */
2145 v
= search_struct_field (name
, *argp
, 0, t
, 0);
2146 /* If we found an ordinary field, then it is not a method call.
2147 So, treat it as if it were a static member function. */
2148 if (v
&& static_memfuncp
)
2149 *static_memfuncp
= 1;
2153 error (_("Structure has no component named %s."), name
);
2157 /* Search through the methods of an object (and its bases) to find a
2158 specified method. Return the pointer to the fn_field list of
2159 overloaded instances.
2161 Helper function for value_find_oload_list.
2162 ARGP is a pointer to a pointer to a value (the object).
2163 METHOD is a string containing the method name.
2164 OFFSET is the offset within the value.
2165 TYPE is the assumed type of the object.
2166 NUM_FNS is the number of overloaded instances.
2167 BASETYPE is set to the actual type of the subobject where the
2169 BOFFSET is the offset of the base subobject where the method is found.
2172 static struct fn_field
*
2173 find_method_list (struct value
**argp
, char *method
,
2174 int offset
, struct type
*type
, int *num_fns
,
2175 struct type
**basetype
, int *boffset
)
2179 CHECK_TYPEDEF (type
);
2183 /* First check in object itself. */
2184 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
2186 /* pai: FIXME What about operators and type conversions? */
2187 char *fn_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
2188 if (fn_field_name
&& (strcmp_iw (fn_field_name
, method
) == 0))
2190 int len
= TYPE_FN_FIELDLIST_LENGTH (type
, i
);
2191 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
2197 /* Resolve any stub methods. */
2198 check_stub_method_group (type
, i
);
2204 /* Not found in object, check in base subobjects. */
2205 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2208 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2210 base_offset
= value_offset (*argp
) + offset
;
2211 base_offset
= baseclass_offset (type
, i
,
2212 value_contents (*argp
) + base_offset
,
2213 value_address (*argp
) + base_offset
);
2214 if (base_offset
== -1)
2215 error (_("virtual baseclass botch"));
2217 else /* Non-virtual base, simply use bit position from debug
2220 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2222 f
= find_method_list (argp
, method
, base_offset
+ offset
,
2223 TYPE_BASECLASS (type
, i
), num_fns
,
2231 /* Return the list of overloaded methods of a specified name.
2233 ARGP is a pointer to a pointer to a value (the object).
2234 METHOD is the method name.
2235 OFFSET is the offset within the value contents.
2236 NUM_FNS is the number of overloaded instances.
2237 BASETYPE is set to the type of the base subobject that defines the
2239 BOFFSET is the offset of the base subobject which defines the method.
2243 value_find_oload_method_list (struct value
**argp
, char *method
,
2244 int offset
, int *num_fns
,
2245 struct type
**basetype
, int *boffset
)
2249 t
= check_typedef (value_type (*argp
));
2251 /* Code snarfed from value_struct_elt. */
2252 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
2254 *argp
= value_ind (*argp
);
2255 /* Don't coerce fn pointer to fn and then back again! */
2256 if (TYPE_CODE (value_type (*argp
)) != TYPE_CODE_FUNC
)
2257 *argp
= coerce_array (*argp
);
2258 t
= check_typedef (value_type (*argp
));
2261 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2262 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2263 error (_("Attempt to extract a component of a value that is not a struct or union"));
2265 return find_method_list (argp
, method
, 0, t
, num_fns
,
2269 /* Given an array of argument types (ARGTYPES) (which includes an
2270 entry for "this" in the case of C++ methods), the number of
2271 arguments NARGS, the NAME of a function whether it's a method or
2272 not (METHOD), and the degree of laxness (LAX) in conforming to
2273 overload resolution rules in ANSI C++, find the best function that
2274 matches on the argument types according to the overload resolution
2277 In the case of class methods, the parameter OBJ is an object value
2278 in which to search for overloaded methods.
2280 In the case of non-method functions, the parameter FSYM is a symbol
2281 corresponding to one of the overloaded functions.
2283 Return value is an integer: 0 -> good match, 10 -> debugger applied
2284 non-standard coercions, 100 -> incompatible.
2286 If a method is being searched for, VALP will hold the value.
2287 If a non-method is being searched for, SYMP will hold the symbol
2290 If a method is being searched for, and it is a static method,
2291 then STATICP will point to a non-zero value.
2293 Note: This function does *not* check the value of
2294 overload_resolution. Caller must check it to see whether overload
2295 resolution is permitted.
2299 find_overload_match (struct type
**arg_types
, int nargs
,
2300 char *name
, int method
, int lax
,
2301 struct value
**objp
, struct symbol
*fsym
,
2302 struct value
**valp
, struct symbol
**symp
,
2305 struct value
*obj
= (objp
? *objp
: NULL
);
2306 /* Index of best overloaded function. */
2308 /* The measure for the current best match. */
2309 struct badness_vector
*oload_champ_bv
= NULL
;
2310 struct value
*temp
= obj
;
2311 /* For methods, the list of overloaded methods. */
2312 struct fn_field
*fns_ptr
= NULL
;
2313 /* For non-methods, the list of overloaded function symbols. */
2314 struct symbol
**oload_syms
= NULL
;
2315 /* Number of overloaded instances being considered. */
2317 struct type
*basetype
= NULL
;
2321 struct cleanup
*old_cleanups
= NULL
;
2323 const char *obj_type_name
= NULL
;
2324 char *func_name
= NULL
;
2325 enum oload_classification match_quality
;
2327 /* Get the list of overloaded methods or functions. */
2331 obj_type_name
= TYPE_NAME (value_type (obj
));
2332 /* Hack: evaluate_subexp_standard often passes in a pointer
2333 value rather than the object itself, so try again. */
2334 if ((!obj_type_name
|| !*obj_type_name
)
2335 && (TYPE_CODE (value_type (obj
)) == TYPE_CODE_PTR
))
2336 obj_type_name
= TYPE_NAME (TYPE_TARGET_TYPE (value_type (obj
)));
2338 fns_ptr
= value_find_oload_method_list (&temp
, name
,
2340 &basetype
, &boffset
);
2341 if (!fns_ptr
|| !num_fns
)
2342 error (_("Couldn't find method %s%s%s"),
2344 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2346 /* If we are dealing with stub method types, they should have
2347 been resolved by find_method_list via
2348 value_find_oload_method_list above. */
2349 gdb_assert (TYPE_DOMAIN_TYPE (fns_ptr
[0].type
) != NULL
);
2350 oload_champ
= find_oload_champ (arg_types
, nargs
, method
,
2352 oload_syms
, &oload_champ_bv
);
2356 const char *qualified_name
= SYMBOL_CPLUS_DEMANGLED_NAME (fsym
);
2358 /* If we have a C++ name, try to extract just the function
2361 func_name
= cp_func_name (qualified_name
);
2363 /* If there was no C++ name, this must be a C-style function.
2364 Just return the same symbol. Do the same if cp_func_name
2365 fails for some reason. */
2366 if (func_name
== NULL
)
2372 old_cleanups
= make_cleanup (xfree
, func_name
);
2373 make_cleanup (xfree
, oload_syms
);
2374 make_cleanup (xfree
, oload_champ_bv
);
2376 oload_champ
= find_oload_champ_namespace (arg_types
, nargs
,
2383 /* Check how bad the best match is. */
2386 classify_oload_match (oload_champ_bv
, nargs
,
2387 oload_method_static (method
, fns_ptr
,
2390 if (match_quality
== INCOMPATIBLE
)
2393 error (_("Cannot resolve method %s%s%s to any overloaded instance"),
2395 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2398 error (_("Cannot resolve function %s to any overloaded instance"),
2401 else if (match_quality
== NON_STANDARD
)
2404 warning (_("Using non-standard conversion to match method %s%s%s to supplied arguments"),
2406 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2409 warning (_("Using non-standard conversion to match function %s to supplied arguments"),
2415 if (staticp
!= NULL
)
2416 *staticp
= oload_method_static (method
, fns_ptr
, oload_champ
);
2417 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr
, oload_champ
))
2418 *valp
= value_virtual_fn_field (&temp
, fns_ptr
, oload_champ
,
2421 *valp
= value_fn_field (&temp
, fns_ptr
, oload_champ
,
2426 *symp
= oload_syms
[oload_champ
];
2431 struct type
*temp_type
= check_typedef (value_type (temp
));
2432 struct type
*obj_type
= check_typedef (value_type (*objp
));
2433 if (TYPE_CODE (temp_type
) != TYPE_CODE_PTR
2434 && (TYPE_CODE (obj_type
) == TYPE_CODE_PTR
2435 || TYPE_CODE (obj_type
) == TYPE_CODE_REF
))
2437 temp
= value_addr (temp
);
2441 if (old_cleanups
!= NULL
)
2442 do_cleanups (old_cleanups
);
2444 switch (match_quality
)
2450 default: /* STANDARD */
2455 /* Find the best overload match, searching for FUNC_NAME in namespaces
2456 contained in QUALIFIED_NAME until it either finds a good match or
2457 runs out of namespaces. It stores the overloaded functions in
2458 *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. The
2459 calling function is responsible for freeing *OLOAD_SYMS and
2463 find_oload_champ_namespace (struct type
**arg_types
, int nargs
,
2464 const char *func_name
,
2465 const char *qualified_name
,
2466 struct symbol
***oload_syms
,
2467 struct badness_vector
**oload_champ_bv
)
2471 find_oload_champ_namespace_loop (arg_types
, nargs
,
2474 oload_syms
, oload_champ_bv
,
2480 /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is
2481 how deep we've looked for namespaces, and the champ is stored in
2482 OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0
2485 It is the caller's responsibility to free *OLOAD_SYMS and
2489 find_oload_champ_namespace_loop (struct type
**arg_types
, int nargs
,
2490 const char *func_name
,
2491 const char *qualified_name
,
2493 struct symbol
***oload_syms
,
2494 struct badness_vector
**oload_champ_bv
,
2497 int next_namespace_len
= namespace_len
;
2498 int searched_deeper
= 0;
2500 struct cleanup
*old_cleanups
;
2501 int new_oload_champ
;
2502 struct symbol
**new_oload_syms
;
2503 struct badness_vector
*new_oload_champ_bv
;
2504 char *new_namespace
;
2506 if (next_namespace_len
!= 0)
2508 gdb_assert (qualified_name
[next_namespace_len
] == ':');
2509 next_namespace_len
+= 2;
2511 next_namespace_len
+=
2512 cp_find_first_component (qualified_name
+ next_namespace_len
);
2514 /* Initialize these to values that can safely be xfree'd. */
2516 *oload_champ_bv
= NULL
;
2518 /* First, see if we have a deeper namespace we can search in.
2519 If we get a good match there, use it. */
2521 if (qualified_name
[next_namespace_len
] == ':')
2523 searched_deeper
= 1;
2525 if (find_oload_champ_namespace_loop (arg_types
, nargs
,
2526 func_name
, qualified_name
,
2528 oload_syms
, oload_champ_bv
,
2535 /* If we reach here, either we're in the deepest namespace or we
2536 didn't find a good match in a deeper namespace. But, in the
2537 latter case, we still have a bad match in a deeper namespace;
2538 note that we might not find any match at all in the current
2539 namespace. (There's always a match in the deepest namespace,
2540 because this overload mechanism only gets called if there's a
2541 function symbol to start off with.) */
2543 old_cleanups
= make_cleanup (xfree
, *oload_syms
);
2544 old_cleanups
= make_cleanup (xfree
, *oload_champ_bv
);
2545 new_namespace
= alloca (namespace_len
+ 1);
2546 strncpy (new_namespace
, qualified_name
, namespace_len
);
2547 new_namespace
[namespace_len
] = '\0';
2548 new_oload_syms
= make_symbol_overload_list (func_name
,
2550 while (new_oload_syms
[num_fns
])
2553 new_oload_champ
= find_oload_champ (arg_types
, nargs
, 0, num_fns
,
2554 NULL
, new_oload_syms
,
2555 &new_oload_champ_bv
);
2557 /* Case 1: We found a good match. Free earlier matches (if any),
2558 and return it. Case 2: We didn't find a good match, but we're
2559 not the deepest function. Then go with the bad match that the
2560 deeper function found. Case 3: We found a bad match, and we're
2561 the deepest function. Then return what we found, even though
2562 it's a bad match. */
2564 if (new_oload_champ
!= -1
2565 && classify_oload_match (new_oload_champ_bv
, nargs
, 0) == STANDARD
)
2567 *oload_syms
= new_oload_syms
;
2568 *oload_champ
= new_oload_champ
;
2569 *oload_champ_bv
= new_oload_champ_bv
;
2570 do_cleanups (old_cleanups
);
2573 else if (searched_deeper
)
2575 xfree (new_oload_syms
);
2576 xfree (new_oload_champ_bv
);
2577 discard_cleanups (old_cleanups
);
2582 gdb_assert (new_oload_champ
!= -1);
2583 *oload_syms
= new_oload_syms
;
2584 *oload_champ
= new_oload_champ
;
2585 *oload_champ_bv
= new_oload_champ_bv
;
2586 discard_cleanups (old_cleanups
);
2591 /* Look for a function to take NARGS args of types ARG_TYPES. Find
2592 the best match from among the overloaded methods or functions
2593 (depending on METHOD) given by FNS_PTR or OLOAD_SYMS, respectively.
2594 The number of methods/functions in the list is given by NUM_FNS.
2595 Return the index of the best match; store an indication of the
2596 quality of the match in OLOAD_CHAMP_BV.
2598 It is the caller's responsibility to free *OLOAD_CHAMP_BV. */
2601 find_oload_champ (struct type
**arg_types
, int nargs
, int method
,
2602 int num_fns
, struct fn_field
*fns_ptr
,
2603 struct symbol
**oload_syms
,
2604 struct badness_vector
**oload_champ_bv
)
2607 /* A measure of how good an overloaded instance is. */
2608 struct badness_vector
*bv
;
2609 /* Index of best overloaded function. */
2610 int oload_champ
= -1;
2611 /* Current ambiguity state for overload resolution. */
2612 int oload_ambiguous
= 0;
2613 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */
2615 *oload_champ_bv
= NULL
;
2617 /* Consider each candidate in turn. */
2618 for (ix
= 0; ix
< num_fns
; ix
++)
2621 int static_offset
= oload_method_static (method
, fns_ptr
, ix
);
2623 struct type
**parm_types
;
2627 nparms
= TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (fns_ptr
, ix
));
2631 /* If it's not a method, this is the proper place. */
2632 nparms
= TYPE_NFIELDS (SYMBOL_TYPE (oload_syms
[ix
]));
2635 /* Prepare array of parameter types. */
2636 parm_types
= (struct type
**)
2637 xmalloc (nparms
* (sizeof (struct type
*)));
2638 for (jj
= 0; jj
< nparms
; jj
++)
2639 parm_types
[jj
] = (method
2640 ? (TYPE_FN_FIELD_ARGS (fns_ptr
, ix
)[jj
].type
)
2641 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms
[ix
]),
2644 /* Compare parameter types to supplied argument types. Skip
2645 THIS for static methods. */
2646 bv
= rank_function (parm_types
, nparms
,
2647 arg_types
+ static_offset
,
2648 nargs
- static_offset
);
2650 if (!*oload_champ_bv
)
2652 *oload_champ_bv
= bv
;
2655 else /* See whether current candidate is better or worse than
2657 switch (compare_badness (bv
, *oload_champ_bv
))
2659 case 0: /* Top two contenders are equally good. */
2660 oload_ambiguous
= 1;
2662 case 1: /* Incomparable top contenders. */
2663 oload_ambiguous
= 2;
2665 case 2: /* New champion, record details. */
2666 *oload_champ_bv
= bv
;
2667 oload_ambiguous
= 0;
2678 fprintf_filtered (gdb_stderr
,
2679 "Overloaded method instance %s, # of parms %d\n",
2680 fns_ptr
[ix
].physname
, nparms
);
2682 fprintf_filtered (gdb_stderr
,
2683 "Overloaded function instance %s # of parms %d\n",
2684 SYMBOL_DEMANGLED_NAME (oload_syms
[ix
]),
2686 for (jj
= 0; jj
< nargs
- static_offset
; jj
++)
2687 fprintf_filtered (gdb_stderr
,
2688 "...Badness @ %d : %d\n",
2690 fprintf_filtered (gdb_stderr
,
2691 "Overload resolution champion is %d, ambiguous? %d\n",
2692 oload_champ
, oload_ambiguous
);
2699 /* Return 1 if we're looking at a static method, 0 if we're looking at
2700 a non-static method or a function that isn't a method. */
2703 oload_method_static (int method
, struct fn_field
*fns_ptr
, int index
)
2705 if (method
&& TYPE_FN_FIELD_STATIC_P (fns_ptr
, index
))
2711 /* Check how good an overload match OLOAD_CHAMP_BV represents. */
2713 static enum oload_classification
2714 classify_oload_match (struct badness_vector
*oload_champ_bv
,
2720 for (ix
= 1; ix
<= nargs
- static_offset
; ix
++)
2722 if (oload_champ_bv
->rank
[ix
] >= 100)
2723 return INCOMPATIBLE
; /* Truly mismatched types. */
2724 else if (oload_champ_bv
->rank
[ix
] >= 10)
2725 return NON_STANDARD
; /* Non-standard type conversions
2729 return STANDARD
; /* Only standard conversions needed. */
2732 /* C++: return 1 is NAME is a legitimate name for the destructor of
2733 type TYPE. If TYPE does not have a destructor, or if NAME is
2734 inappropriate for TYPE, an error is signaled. */
2736 destructor_name_p (const char *name
, const struct type
*type
)
2740 char *dname
= type_name_no_tag (type
);
2741 char *cp
= strchr (dname
, '<');
2744 /* Do not compare the template part for template classes. */
2746 len
= strlen (dname
);
2749 if (strlen (name
+ 1) != len
|| strncmp (dname
, name
+ 1, len
) != 0)
2750 error (_("name of destructor must equal name of class"));
2757 /* Given TYPE, a structure/union,
2758 return 1 if the component named NAME from the ultimate target
2759 structure/union is defined, otherwise, return 0. */
2762 check_field (struct type
*type
, const char *name
)
2766 for (i
= TYPE_NFIELDS (type
) - 1; i
>= TYPE_N_BASECLASSES (type
); i
--)
2768 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
2769 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
2773 /* C++: If it was not found as a data field, then try to return it
2774 as a pointer to a method. */
2776 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; --i
)
2778 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type
, i
), name
) == 0)
2782 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2783 if (check_field (TYPE_BASECLASS (type
, i
), name
))
2789 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
2790 return the appropriate member (or the address of the member, if
2791 WANT_ADDRESS). This function is used to resolve user expressions
2792 of the form "DOMAIN::NAME". For more details on what happens, see
2793 the comment before value_struct_elt_for_reference. */
2796 value_aggregate_elt (struct type
*curtype
, char *name
,
2797 struct type
*expect_type
, int want_address
,
2800 switch (TYPE_CODE (curtype
))
2802 case TYPE_CODE_STRUCT
:
2803 case TYPE_CODE_UNION
:
2804 return value_struct_elt_for_reference (curtype
, 0, curtype
,
2806 want_address
, noside
);
2807 case TYPE_CODE_NAMESPACE
:
2808 return value_namespace_elt (curtype
, name
,
2809 want_address
, noside
);
2811 internal_error (__FILE__
, __LINE__
,
2812 _("non-aggregate type in value_aggregate_elt"));
2816 /* Compares the two method/function types T1 and T2 for "equality"
2817 with respect to the the methods' parameters. If the types of the
2818 two parameter lists are the same, returns 1; 0 otherwise. This
2819 comparison may ignore any artificial parameters in T1 if
2820 SKIP_ARTIFICIAL is non-zero. This function will ALWAYS skip
2821 the first artificial parameter in T1, assumed to be a 'this' pointer.
2823 The type T2 is expected to have come from make_params (in eval.c). */
2826 compare_parameters (struct type
*t1
, struct type
*t2
, int skip_artificial
)
2830 if (TYPE_FIELD_ARTIFICIAL (t1
, 0))
2833 /* If skipping artificial fields, find the first real field
2835 if (skip_artificial
)
2837 while (start
< TYPE_NFIELDS (t1
)
2838 && TYPE_FIELD_ARTIFICIAL (t1
, start
))
2842 /* Now compare parameters */
2844 /* Special case: a method taking void. T1 will contain no
2845 non-artificial fields, and T2 will contain TYPE_CODE_VOID. */
2846 if ((TYPE_NFIELDS (t1
) - start
) == 0 && TYPE_NFIELDS (t2
) == 1
2847 && TYPE_CODE (TYPE_FIELD_TYPE (t2
, 0)) == TYPE_CODE_VOID
)
2850 if ((TYPE_NFIELDS (t1
) - start
) == TYPE_NFIELDS (t2
))
2853 for (i
= 0; i
< TYPE_NFIELDS (t2
); ++i
)
2855 if (rank_one_type (TYPE_FIELD_TYPE (t1
, start
+ i
),
2856 TYPE_FIELD_TYPE (t2
, i
))
2867 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
2868 return the address of this member as a "pointer to member" type.
2869 If INTYPE is non-null, then it will be the type of the member we
2870 are looking for. This will help us resolve "pointers to member
2871 functions". This function is used to resolve user expressions of
2872 the form "DOMAIN::NAME". */
2874 static struct value
*
2875 value_struct_elt_for_reference (struct type
*domain
, int offset
,
2876 struct type
*curtype
, char *name
,
2877 struct type
*intype
,
2881 struct type
*t
= curtype
;
2883 struct value
*v
, *result
;
2885 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2886 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2887 error (_("Internal error: non-aggregate type to value_struct_elt_for_reference"));
2889 for (i
= TYPE_NFIELDS (t
) - 1; i
>= TYPE_N_BASECLASSES (t
); i
--)
2891 char *t_field_name
= TYPE_FIELD_NAME (t
, i
);
2893 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
2895 if (field_is_static (&TYPE_FIELD (t
, i
)))
2897 v
= value_static_field (t
, i
);
2899 error (_("static field %s has been optimized out"),
2905 if (TYPE_FIELD_PACKED (t
, i
))
2906 error (_("pointers to bitfield members not allowed"));
2909 return value_from_longest
2910 (lookup_memberptr_type (TYPE_FIELD_TYPE (t
, i
), domain
),
2911 offset
+ (LONGEST
) (TYPE_FIELD_BITPOS (t
, i
) >> 3));
2912 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
2913 return allocate_value (TYPE_FIELD_TYPE (t
, i
));
2915 error (_("Cannot reference non-static field \"%s\""), name
);
2919 /* C++: If it was not found as a data field, then try to return it
2920 as a pointer to a method. */
2922 /* Perform all necessary dereferencing. */
2923 while (intype
&& TYPE_CODE (intype
) == TYPE_CODE_PTR
)
2924 intype
= TYPE_TARGET_TYPE (intype
);
2926 for (i
= TYPE_NFN_FIELDS (t
) - 1; i
>= 0; --i
)
2928 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (t
, i
);
2929 char dem_opname
[64];
2931 if (strncmp (t_field_name
, "__", 2) == 0
2932 || strncmp (t_field_name
, "op", 2) == 0
2933 || strncmp (t_field_name
, "type", 4) == 0)
2935 if (cplus_demangle_opname (t_field_name
,
2936 dem_opname
, DMGL_ANSI
))
2937 t_field_name
= dem_opname
;
2938 else if (cplus_demangle_opname (t_field_name
,
2940 t_field_name
= dem_opname
;
2942 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
2945 int len
= TYPE_FN_FIELDLIST_LENGTH (t
, i
);
2946 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (t
, i
);
2948 check_stub_method_group (t
, i
);
2952 for (j
= 0; j
< len
; ++j
)
2954 if (compare_parameters (TYPE_FN_FIELD_TYPE (f
, j
), intype
, 0)
2955 || compare_parameters (TYPE_FN_FIELD_TYPE (f
, j
), intype
, 1))
2960 error (_("no member function matches that type instantiation"));
2967 for (ii
= 0; ii
< TYPE_FN_FIELDLIST_LENGTH (t
, i
);
2970 /* Skip artificial methods. This is necessary if,
2971 for example, the user wants to "print
2972 subclass::subclass" with only one user-defined
2973 constructor. There is no ambiguity in this
2975 if (TYPE_FN_FIELD_ARTIFICIAL (f
, ii
))
2978 /* Desired method is ambiguous if more than one
2979 method is defined. */
2981 error (_("non-unique member `%s' requires type instantiation"), name
);
2987 if (TYPE_FN_FIELD_STATIC_P (f
, j
))
2990 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
2996 return value_addr (read_var_value (s
, 0));
2998 return read_var_value (s
, 0);
3001 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
3005 result
= allocate_value
3006 (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
3007 cplus_make_method_ptr (value_type (result
),
3008 value_contents_writeable (result
),
3009 TYPE_FN_FIELD_VOFFSET (f
, j
), 1);
3011 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
3012 return allocate_value (TYPE_FN_FIELD_TYPE (f
, j
));
3014 error (_("Cannot reference virtual member function \"%s\""),
3020 lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
3025 v
= read_var_value (s
, 0);
3030 result
= allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f
, j
)));
3031 cplus_make_method_ptr (value_type (result
),
3032 value_contents_writeable (result
),
3033 value_address (v
), 0);
3039 for (i
= TYPE_N_BASECLASSES (t
) - 1; i
>= 0; i
--)
3044 if (BASETYPE_VIA_VIRTUAL (t
, i
))
3047 base_offset
= TYPE_BASECLASS_BITPOS (t
, i
) / 8;
3048 v
= value_struct_elt_for_reference (domain
,
3049 offset
+ base_offset
,
3050 TYPE_BASECLASS (t
, i
),
3052 want_address
, noside
);
3057 /* As a last chance, pretend that CURTYPE is a namespace, and look
3058 it up that way; this (frequently) works for types nested inside
3061 return value_maybe_namespace_elt (curtype
, name
,
3062 want_address
, noside
);
3065 /* C++: Return the member NAME of the namespace given by the type
3068 static struct value
*
3069 value_namespace_elt (const struct type
*curtype
,
3070 char *name
, int want_address
,
3073 struct value
*retval
= value_maybe_namespace_elt (curtype
, name
,
3078 error (_("No symbol \"%s\" in namespace \"%s\"."),
3079 name
, TYPE_TAG_NAME (curtype
));
3084 /* A helper function used by value_namespace_elt and
3085 value_struct_elt_for_reference. It looks up NAME inside the
3086 context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE
3087 is a class and NAME refers to a type in CURTYPE itself (as opposed
3088 to, say, some base class of CURTYPE). */
3090 static struct value
*
3091 value_maybe_namespace_elt (const struct type
*curtype
,
3092 char *name
, int want_address
,
3095 const char *namespace_name
= TYPE_TAG_NAME (curtype
);
3097 struct value
*result
;
3099 sym
= cp_lookup_symbol_namespace (namespace_name
, name
, NULL
,
3100 get_selected_block (0),
3105 else if ((noside
== EVAL_AVOID_SIDE_EFFECTS
)
3106 && (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
))
3107 result
= allocate_value (SYMBOL_TYPE (sym
));
3109 result
= value_of_variable (sym
, get_selected_block (0));
3111 if (result
&& want_address
)
3112 result
= value_addr (result
);
3117 /* Given a pointer value V, find the real (RTTI) type of the object it
3120 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
3121 and refer to the values computed for the object pointed to. */
3124 value_rtti_target_type (struct value
*v
, int *full
,
3125 int *top
, int *using_enc
)
3127 struct value
*target
;
3129 target
= value_ind (v
);
3131 return value_rtti_type (target
, full
, top
, using_enc
);
3134 /* Given a value pointed to by ARGP, check its real run-time type, and
3135 if that is different from the enclosing type, create a new value
3136 using the real run-time type as the enclosing type (and of the same
3137 type as ARGP) and return it, with the embedded offset adjusted to
3138 be the correct offset to the enclosed object. RTYPE is the type,
3139 and XFULL, XTOP, and XUSING_ENC are the other parameters, computed
3140 by value_rtti_type(). If these are available, they can be supplied
3141 and a second call to value_rtti_type() is avoided. (Pass RTYPE ==
3142 NULL if they're not available. */
3145 value_full_object (struct value
*argp
,
3147 int xfull
, int xtop
,
3150 struct type
*real_type
;
3154 struct value
*new_val
;
3161 using_enc
= xusing_enc
;
3164 real_type
= value_rtti_type (argp
, &full
, &top
, &using_enc
);
3166 /* If no RTTI data, or if object is already complete, do nothing. */
3167 if (!real_type
|| real_type
== value_enclosing_type (argp
))
3170 /* If we have the full object, but for some reason the enclosing
3171 type is wrong, set it. */
3172 /* pai: FIXME -- sounds iffy */
3175 argp
= value_change_enclosing_type (argp
, real_type
);
3179 /* Check if object is in memory */
3180 if (VALUE_LVAL (argp
) != lval_memory
)
3182 warning (_("Couldn't retrieve complete object of RTTI type %s; object may be in register(s)."),
3183 TYPE_NAME (real_type
));
3188 /* All other cases -- retrieve the complete object. */
3189 /* Go back by the computed top_offset from the beginning of the
3190 object, adjusting for the embedded offset of argp if that's what
3191 value_rtti_type used for its computation. */
3192 new_val
= value_at_lazy (real_type
, value_address (argp
) - top
+
3193 (using_enc
? 0 : value_embedded_offset (argp
)));
3194 deprecated_set_value_type (new_val
, value_type (argp
));
3195 set_value_embedded_offset (new_val
, (using_enc
3196 ? top
+ value_embedded_offset (argp
)
3202 /* Return the value of the local variable, if one exists.
3203 Flag COMPLAIN signals an error if the request is made in an
3204 inappropriate context. */
3207 value_of_local (const char *name
, int complain
)
3209 struct symbol
*func
, *sym
;
3212 struct frame_info
*frame
;
3215 frame
= get_selected_frame (_("no frame selected"));
3218 frame
= deprecated_safe_get_selected_frame ();
3223 func
= get_frame_function (frame
);
3227 error (_("no `%s' in nameless context"), name
);
3232 b
= SYMBOL_BLOCK_VALUE (func
);
3233 if (dict_empty (BLOCK_DICT (b
)))
3236 error (_("no args, no `%s'"), name
);
3241 /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER
3242 symbol instead of the LOC_ARG one (if both exist). */
3243 sym
= lookup_block_symbol (b
, name
, NULL
, VAR_DOMAIN
);
3247 error (_("current stack frame does not contain a variable named `%s'"),
3253 ret
= read_var_value (sym
, frame
);
3254 if (ret
== 0 && complain
)
3255 error (_("`%s' argument unreadable"), name
);
3259 /* C++/Objective-C: return the value of the class instance variable,
3260 if one exists. Flag COMPLAIN signals an error if the request is
3261 made in an inappropriate context. */
3264 value_of_this (int complain
)
3266 if (!current_language
->la_name_of_this
)
3268 return value_of_local (current_language
->la_name_of_this
, complain
);
3271 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH
3272 elements long, starting at LOWBOUND. The result has the same lower
3273 bound as the original ARRAY. */
3276 value_slice (struct value
*array
, int lowbound
, int length
)
3278 struct type
*slice_range_type
, *slice_type
, *range_type
;
3279 LONGEST lowerbound
, upperbound
;
3280 struct value
*slice
;
3281 struct type
*array_type
;
3283 array_type
= check_typedef (value_type (array
));
3284 if (TYPE_CODE (array_type
) != TYPE_CODE_ARRAY
3285 && TYPE_CODE (array_type
) != TYPE_CODE_STRING
3286 && TYPE_CODE (array_type
) != TYPE_CODE_BITSTRING
)
3287 error (_("cannot take slice of non-array"));
3289 range_type
= TYPE_INDEX_TYPE (array_type
);
3290 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
3291 error (_("slice from bad array or bitstring"));
3293 if (lowbound
< lowerbound
|| length
< 0
3294 || lowbound
+ length
- 1 > upperbound
)
3295 error (_("slice out of range"));
3297 /* FIXME-type-allocation: need a way to free this type when we are
3299 slice_range_type
= create_range_type ((struct type
*) NULL
,
3300 TYPE_TARGET_TYPE (range_type
),
3302 lowbound
+ length
- 1);
3303 if (TYPE_CODE (array_type
) == TYPE_CODE_BITSTRING
)
3307 slice_type
= create_set_type ((struct type
*) NULL
,
3309 TYPE_CODE (slice_type
) = TYPE_CODE_BITSTRING
;
3310 slice
= value_zero (slice_type
, not_lval
);
3312 for (i
= 0; i
< length
; i
++)
3314 int element
= value_bit_index (array_type
,
3315 value_contents (array
),
3318 error (_("internal error accessing bitstring"));
3319 else if (element
> 0)
3321 int j
= i
% TARGET_CHAR_BIT
;
3322 if (gdbarch_bits_big_endian (get_type_arch (array_type
)))
3323 j
= TARGET_CHAR_BIT
- 1 - j
;
3324 value_contents_raw (slice
)[i
/ TARGET_CHAR_BIT
] |= (1 << j
);
3327 /* We should set the address, bitssize, and bitspos, so the
3328 slice can be used on the LHS, but that may require extensions
3329 to value_assign. For now, just leave as a non_lval.
3334 struct type
*element_type
= TYPE_TARGET_TYPE (array_type
);
3336 (lowbound
- lowerbound
) * TYPE_LENGTH (check_typedef (element_type
));
3338 slice_type
= create_array_type ((struct type
*) NULL
,
3341 TYPE_CODE (slice_type
) = TYPE_CODE (array_type
);
3343 if (VALUE_LVAL (array
) == lval_memory
&& value_lazy (array
))
3344 slice
= allocate_value_lazy (slice_type
);
3347 slice
= allocate_value (slice_type
);
3348 memcpy (value_contents_writeable (slice
),
3349 value_contents (array
) + offset
,
3350 TYPE_LENGTH (slice_type
));
3353 set_value_component_location (slice
, array
);
3354 VALUE_FRAME_ID (slice
) = VALUE_FRAME_ID (array
);
3355 set_value_offset (slice
, value_offset (array
) + offset
);
3360 /* Create a value for a FORTRAN complex number. Currently most of the
3361 time values are coerced to COMPLEX*16 (i.e. a complex number
3362 composed of 2 doubles. This really should be a smarter routine
3363 that figures out precision inteligently as opposed to assuming
3364 doubles. FIXME: fmb */
3367 value_literal_complex (struct value
*arg1
,
3372 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3374 val
= allocate_value (type
);
3375 arg1
= value_cast (real_type
, arg1
);
3376 arg2
= value_cast (real_type
, arg2
);
3378 memcpy (value_contents_raw (val
),
3379 value_contents (arg1
), TYPE_LENGTH (real_type
));
3380 memcpy (value_contents_raw (val
) + TYPE_LENGTH (real_type
),
3381 value_contents (arg2
), TYPE_LENGTH (real_type
));
3385 /* Cast a value into the appropriate complex data type. */
3387 static struct value
*
3388 cast_into_complex (struct type
*type
, struct value
*val
)
3390 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3392 if (TYPE_CODE (value_type (val
)) == TYPE_CODE_COMPLEX
)
3394 struct type
*val_real_type
= TYPE_TARGET_TYPE (value_type (val
));
3395 struct value
*re_val
= allocate_value (val_real_type
);
3396 struct value
*im_val
= allocate_value (val_real_type
);
3398 memcpy (value_contents_raw (re_val
),
3399 value_contents (val
), TYPE_LENGTH (val_real_type
));
3400 memcpy (value_contents_raw (im_val
),
3401 value_contents (val
) + TYPE_LENGTH (val_real_type
),
3402 TYPE_LENGTH (val_real_type
));
3404 return value_literal_complex (re_val
, im_val
, type
);
3406 else if (TYPE_CODE (value_type (val
)) == TYPE_CODE_FLT
3407 || TYPE_CODE (value_type (val
)) == TYPE_CODE_INT
)
3408 return value_literal_complex (val
,
3409 value_zero (real_type
, not_lval
),
3412 error (_("cannot cast non-number to complex"));
3416 _initialize_valops (void)
3418 add_setshow_boolean_cmd ("overload-resolution", class_support
,
3419 &overload_resolution
, _("\
3420 Set overload resolution in evaluating C++ functions."), _("\
3421 Show overload resolution in evaluating C++ functions."),
3423 show_overload_resolution
,
3424 &setlist
, &showlist
);
3425 overload_resolution
= 1;