1 /* Perform non-arithmetic operations on values, for GDB.
2 Copyright 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994,
3 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004
4 Free Software Foundation, Inc.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
38 #include "dictionary.h"
39 #include "cp-support.h"
42 #include "gdb_string.h"
43 #include "gdb_assert.h"
44 #include "cp-support.h"
47 extern int overload_debug
;
48 /* Local functions. */
50 static int typecmp (int staticp
, int varargs
, int nargs
,
51 struct field t1
[], struct value
*t2
[]);
53 static CORE_ADDR
value_push (CORE_ADDR
, struct value
*);
55 static struct value
*search_struct_field (char *, struct value
*, int,
58 static struct value
*search_struct_method (char *, struct value
**,
60 int, int *, struct type
*);
62 static int find_oload_champ_namespace (struct type
**arg_types
, int nargs
,
63 const char *func_name
,
64 const char *qualified_name
,
65 struct symbol
***oload_syms
,
66 struct badness_vector
**oload_champ_bv
);
69 int find_oload_champ_namespace_loop (struct type
**arg_types
, int nargs
,
70 const char *func_name
,
71 const char *qualified_name
,
73 struct symbol
***oload_syms
,
74 struct badness_vector
**oload_champ_bv
,
77 static int find_oload_champ (struct type
**arg_types
, int nargs
, int method
,
79 struct fn_field
*fns_ptr
,
80 struct symbol
**oload_syms
,
81 struct badness_vector
**oload_champ_bv
);
83 static int oload_method_static (int method
, struct fn_field
*fns_ptr
,
86 enum oload_classification
{ STANDARD
, NON_STANDARD
, INCOMPATIBLE
};
89 oload_classification
classify_oload_match (struct badness_vector
94 static int check_field_in (struct type
*, const char *);
96 static struct value
*value_struct_elt_for_reference (struct type
*domain
,
103 static struct value
*value_namespace_elt (const struct type
*curtype
,
107 static struct value
*value_maybe_namespace_elt (const struct type
*curtype
,
111 static CORE_ADDR
allocate_space_in_inferior (int);
113 static struct value
*cast_into_complex (struct type
*, struct value
*);
115 static struct fn_field
*find_method_list (struct value
** argp
, char *method
,
117 struct type
*type
, int *num_fns
,
118 struct type
**basetype
,
121 void _initialize_valops (void);
123 /* Flag for whether we want to abandon failed expression evals by default. */
126 static int auto_abandon
= 0;
129 int overload_resolution
= 0;
131 /* Find the address of function name NAME in the inferior. */
134 find_function_in_inferior (const char *name
)
137 sym
= lookup_symbol (name
, 0, VAR_DOMAIN
, 0, NULL
);
140 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
142 error ("\"%s\" exists in this program but is not a function.",
145 return value_of_variable (sym
, NULL
);
149 struct minimal_symbol
*msymbol
= lookup_minimal_symbol (name
, NULL
, NULL
);
154 type
= lookup_pointer_type (builtin_type_char
);
155 type
= lookup_function_type (type
);
156 type
= lookup_pointer_type (type
);
157 maddr
= SYMBOL_VALUE_ADDRESS (msymbol
);
158 return value_from_pointer (type
, maddr
);
162 if (!target_has_execution
)
163 error ("evaluation of this expression requires the target program to be active");
165 error ("evaluation of this expression requires the program to have a function \"%s\".", name
);
170 /* Allocate NBYTES of space in the inferior using the inferior's malloc
171 and return a value that is a pointer to the allocated space. */
174 value_allocate_space_in_inferior (int len
)
176 struct value
*blocklen
;
177 struct value
*val
= find_function_in_inferior (NAME_OF_MALLOC
);
179 blocklen
= value_from_longest (builtin_type_int
, (LONGEST
) len
);
180 val
= call_function_by_hand (val
, 1, &blocklen
);
181 if (value_logical_not (val
))
183 if (!target_has_execution
)
184 error ("No memory available to program now: you need to start the target first");
186 error ("No memory available to program: call to malloc failed");
192 allocate_space_in_inferior (int len
)
194 return value_as_long (value_allocate_space_in_inferior (len
));
197 /* Cast value ARG2 to type TYPE and return as a value.
198 More general than a C cast: accepts any two types of the same length,
199 and if ARG2 is an lvalue it can be cast into anything at all. */
200 /* In C++, casts may change pointer or object representations. */
203 value_cast (struct type
*type
, struct value
*arg2
)
205 enum type_code code1
;
206 enum type_code code2
;
210 int convert_to_boolean
= 0;
212 if (VALUE_TYPE (arg2
) == type
)
215 CHECK_TYPEDEF (type
);
216 code1
= TYPE_CODE (type
);
218 type2
= check_typedef (VALUE_TYPE (arg2
));
220 /* A cast to an undetermined-length array_type, such as (TYPE [])OBJECT,
221 is treated like a cast to (TYPE [N])OBJECT,
222 where N is sizeof(OBJECT)/sizeof(TYPE). */
223 if (code1
== TYPE_CODE_ARRAY
)
225 struct type
*element_type
= TYPE_TARGET_TYPE (type
);
226 unsigned element_length
= TYPE_LENGTH (check_typedef (element_type
));
227 if (element_length
> 0
228 && TYPE_ARRAY_UPPER_BOUND_TYPE (type
) == BOUND_CANNOT_BE_DETERMINED
)
230 struct type
*range_type
= TYPE_INDEX_TYPE (type
);
231 int val_length
= TYPE_LENGTH (type2
);
232 LONGEST low_bound
, high_bound
, new_length
;
233 if (get_discrete_bounds (range_type
, &low_bound
, &high_bound
) < 0)
234 low_bound
= 0, high_bound
= 0;
235 new_length
= val_length
/ element_length
;
236 if (val_length
% element_length
!= 0)
237 warning ("array element type size does not divide object size in cast");
238 /* FIXME-type-allocation: need a way to free this type when we are
240 range_type
= create_range_type ((struct type
*) NULL
,
241 TYPE_TARGET_TYPE (range_type
),
243 new_length
+ low_bound
- 1);
244 VALUE_TYPE (arg2
) = create_array_type ((struct type
*) NULL
,
245 element_type
, range_type
);
250 if (current_language
->c_style_arrays
251 && TYPE_CODE (type2
) == TYPE_CODE_ARRAY
)
252 arg2
= value_coerce_array (arg2
);
254 if (TYPE_CODE (type2
) == TYPE_CODE_FUNC
)
255 arg2
= value_coerce_function (arg2
);
257 type2
= check_typedef (VALUE_TYPE (arg2
));
258 COERCE_VARYING_ARRAY (arg2
, type2
);
259 code2
= TYPE_CODE (type2
);
261 if (code1
== TYPE_CODE_COMPLEX
)
262 return cast_into_complex (type
, arg2
);
263 if (code1
== TYPE_CODE_BOOL
)
265 code1
= TYPE_CODE_INT
;
266 convert_to_boolean
= 1;
268 if (code1
== TYPE_CODE_CHAR
)
269 code1
= TYPE_CODE_INT
;
270 if (code2
== TYPE_CODE_BOOL
|| code2
== TYPE_CODE_CHAR
)
271 code2
= TYPE_CODE_INT
;
273 scalar
= (code2
== TYPE_CODE_INT
|| code2
== TYPE_CODE_FLT
274 || code2
== TYPE_CODE_ENUM
|| code2
== TYPE_CODE_RANGE
);
276 if (code1
== TYPE_CODE_STRUCT
277 && code2
== TYPE_CODE_STRUCT
278 && TYPE_NAME (type
) != 0)
280 /* Look in the type of the source to see if it contains the
281 type of the target as a superclass. If so, we'll need to
282 offset the object in addition to changing its type. */
283 struct value
*v
= search_struct_field (type_name_no_tag (type
),
287 VALUE_TYPE (v
) = type
;
291 if (code1
== TYPE_CODE_FLT
&& scalar
)
292 return value_from_double (type
, value_as_double (arg2
));
293 else if ((code1
== TYPE_CODE_INT
|| code1
== TYPE_CODE_ENUM
294 || code1
== TYPE_CODE_RANGE
)
295 && (scalar
|| code2
== TYPE_CODE_PTR
))
299 if (deprecated_hp_som_som_object_present
/* if target compiled by HP aCC */
300 && (code2
== TYPE_CODE_PTR
))
303 struct value
*retvalp
;
305 switch (TYPE_CODE (TYPE_TARGET_TYPE (type2
)))
307 /* With HP aCC, pointers to data members have a bias */
308 case TYPE_CODE_MEMBER
:
309 retvalp
= value_from_longest (type
, value_as_long (arg2
));
310 /* force evaluation */
311 ptr
= (unsigned int *) VALUE_CONTENTS (retvalp
);
312 *ptr
&= ~0x20000000; /* zap 29th bit to remove bias */
315 /* While pointers to methods don't really point to a function */
316 case TYPE_CODE_METHOD
:
317 error ("Pointers to methods not supported with HP aCC");
320 break; /* fall out and go to normal handling */
324 /* When we cast pointers to integers, we mustn't use
325 POINTER_TO_ADDRESS to find the address the pointer
326 represents, as value_as_long would. GDB should evaluate
327 expressions just as the compiler would --- and the compiler
328 sees a cast as a simple reinterpretation of the pointer's
330 if (code2
== TYPE_CODE_PTR
)
331 longest
= extract_unsigned_integer (VALUE_CONTENTS (arg2
),
332 TYPE_LENGTH (type2
));
334 longest
= value_as_long (arg2
);
335 return value_from_longest (type
, convert_to_boolean
?
336 (LONGEST
) (longest
? 1 : 0) : longest
);
338 else if (code1
== TYPE_CODE_PTR
&& (code2
== TYPE_CODE_INT
||
339 code2
== TYPE_CODE_ENUM
||
340 code2
== TYPE_CODE_RANGE
))
342 /* TYPE_LENGTH (type) is the length of a pointer, but we really
343 want the length of an address! -- we are really dealing with
344 addresses (i.e., gdb representations) not pointers (i.e.,
345 target representations) here.
347 This allows things like "print *(int *)0x01000234" to work
348 without printing a misleading message -- which would
349 otherwise occur when dealing with a target having two byte
350 pointers and four byte addresses. */
352 int addr_bit
= TARGET_ADDR_BIT
;
354 LONGEST longest
= value_as_long (arg2
);
355 if (addr_bit
< sizeof (LONGEST
) * HOST_CHAR_BIT
)
357 if (longest
>= ((LONGEST
) 1 << addr_bit
)
358 || longest
<= -((LONGEST
) 1 << addr_bit
))
359 warning ("value truncated");
361 return value_from_longest (type
, longest
);
363 else if (TYPE_LENGTH (type
) == TYPE_LENGTH (type2
))
365 if (code1
== TYPE_CODE_PTR
&& code2
== TYPE_CODE_PTR
)
367 struct type
*t1
= check_typedef (TYPE_TARGET_TYPE (type
));
368 struct type
*t2
= check_typedef (TYPE_TARGET_TYPE (type2
));
369 if (TYPE_CODE (t1
) == TYPE_CODE_STRUCT
370 && TYPE_CODE (t2
) == TYPE_CODE_STRUCT
371 && !value_logical_not (arg2
))
375 /* Look in the type of the source to see if it contains the
376 type of the target as a superclass. If so, we'll need to
377 offset the pointer rather than just change its type. */
378 if (TYPE_NAME (t1
) != NULL
)
380 v
= search_struct_field (type_name_no_tag (t1
),
381 value_ind (arg2
), 0, t2
, 1);
385 VALUE_TYPE (v
) = type
;
390 /* Look in the type of the target to see if it contains the
391 type of the source as a superclass. If so, we'll need to
392 offset the pointer rather than just change its type.
393 FIXME: This fails silently with virtual inheritance. */
394 if (TYPE_NAME (t2
) != NULL
)
396 v
= search_struct_field (type_name_no_tag (t2
),
397 value_zero (t1
, not_lval
), 0, t1
, 1);
400 CORE_ADDR addr2
= value_as_address (arg2
);
401 addr2
-= (VALUE_ADDRESS (v
)
403 + VALUE_EMBEDDED_OFFSET (v
));
404 return value_from_pointer (type
, addr2
);
408 /* No superclass found, just fall through to change ptr type. */
410 VALUE_TYPE (arg2
) = type
;
411 arg2
= value_change_enclosing_type (arg2
, type
);
412 VALUE_POINTED_TO_OFFSET (arg2
) = 0; /* pai: chk_val */
415 else if (VALUE_LVAL (arg2
) == lval_memory
)
417 return value_at_lazy (type
, VALUE_ADDRESS (arg2
) + VALUE_OFFSET (arg2
),
418 VALUE_BFD_SECTION (arg2
));
420 else if (code1
== TYPE_CODE_VOID
)
422 return value_zero (builtin_type_void
, not_lval
);
426 error ("Invalid cast.");
431 /* Create a value of type TYPE that is zero, and return it. */
434 value_zero (struct type
*type
, enum lval_type lv
)
436 struct value
*val
= allocate_value (type
);
438 memset (VALUE_CONTENTS (val
), 0, TYPE_LENGTH (check_typedef (type
)));
439 VALUE_LVAL (val
) = lv
;
444 /* Return a value with type TYPE located at ADDR.
446 Call value_at only if the data needs to be fetched immediately;
447 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
448 value_at_lazy instead. value_at_lazy simply records the address of
449 the data and sets the lazy-evaluation-required flag. The lazy flag
450 is tested in the VALUE_CONTENTS macro, which is used if and when
451 the contents are actually required.
453 Note: value_at does *NOT* handle embedded offsets; perform such
454 adjustments before or after calling it. */
457 value_at (struct type
*type
, CORE_ADDR addr
, asection
*sect
)
461 if (TYPE_CODE (check_typedef (type
)) == TYPE_CODE_VOID
)
462 error ("Attempt to dereference a generic pointer.");
464 val
= allocate_value (type
);
466 read_memory (addr
, VALUE_CONTENTS_ALL_RAW (val
), TYPE_LENGTH (type
));
468 VALUE_LVAL (val
) = lval_memory
;
469 VALUE_ADDRESS (val
) = addr
;
470 VALUE_BFD_SECTION (val
) = sect
;
475 /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
478 value_at_lazy (struct type
*type
, CORE_ADDR addr
, asection
*sect
)
482 if (TYPE_CODE (check_typedef (type
)) == TYPE_CODE_VOID
)
483 error ("Attempt to dereference a generic pointer.");
485 val
= allocate_value (type
);
487 VALUE_LVAL (val
) = lval_memory
;
488 VALUE_ADDRESS (val
) = addr
;
489 VALUE_LAZY (val
) = 1;
490 VALUE_BFD_SECTION (val
) = sect
;
495 /* Called only from the VALUE_CONTENTS and VALUE_CONTENTS_ALL macros,
496 if the current data for a variable needs to be loaded into
497 VALUE_CONTENTS(VAL). Fetches the data from the user's process, and
498 clears the lazy flag to indicate that the data in the buffer is valid.
500 If the value is zero-length, we avoid calling read_memory, which would
501 abort. We mark the value as fetched anyway -- all 0 bytes of it.
503 This function returns a value because it is used in the VALUE_CONTENTS
504 macro as part of an expression, where a void would not work. The
508 value_fetch_lazy (struct value
*val
)
510 CORE_ADDR addr
= VALUE_ADDRESS (val
) + VALUE_OFFSET (val
);
511 int length
= TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val
));
513 struct type
*type
= VALUE_TYPE (val
);
515 read_memory (addr
, VALUE_CONTENTS_ALL_RAW (val
), length
);
517 VALUE_LAZY (val
) = 0;
522 /* Store the contents of FROMVAL into the location of TOVAL.
523 Return a new value with the location of TOVAL and contents of FROMVAL. */
526 value_assign (struct value
*toval
, struct value
*fromval
)
530 char raw_buffer
[MAX_REGISTER_SIZE
];
532 struct frame_id old_frame
;
534 if (!toval
->modifiable
)
535 error ("Left operand of assignment is not a modifiable lvalue.");
539 type
= VALUE_TYPE (toval
);
540 if (VALUE_LVAL (toval
) != lval_internalvar
)
541 fromval
= value_cast (type
, fromval
);
543 COERCE_ARRAY (fromval
);
544 CHECK_TYPEDEF (type
);
546 /* Since modifying a register can trash the frame chain, and modifying memory
547 can trash the frame cache, we save the old frame and then restore the new
549 old_frame
= get_frame_id (deprecated_selected_frame
);
551 switch (VALUE_LVAL (toval
))
553 case lval_internalvar
:
554 set_internalvar (VALUE_INTERNALVAR (toval
), fromval
);
555 val
= value_copy (VALUE_INTERNALVAR (toval
)->value
);
556 val
= value_change_enclosing_type (val
, VALUE_ENCLOSING_TYPE (fromval
));
557 VALUE_EMBEDDED_OFFSET (val
) = VALUE_EMBEDDED_OFFSET (fromval
);
558 VALUE_POINTED_TO_OFFSET (val
) = VALUE_POINTED_TO_OFFSET (fromval
);
561 case lval_internalvar_component
:
562 set_internalvar_component (VALUE_INTERNALVAR (toval
),
563 VALUE_OFFSET (toval
),
564 VALUE_BITPOS (toval
),
565 VALUE_BITSIZE (toval
),
572 CORE_ADDR changed_addr
;
575 if (VALUE_BITSIZE (toval
))
577 char buffer
[sizeof (LONGEST
)];
578 /* We assume that the argument to read_memory is in units of
579 host chars. FIXME: Is that correct? */
580 changed_len
= (VALUE_BITPOS (toval
)
581 + VALUE_BITSIZE (toval
)
585 if (changed_len
> (int) sizeof (LONGEST
))
586 error ("Can't handle bitfields which don't fit in a %d bit word.",
587 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
589 read_memory (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
590 buffer
, changed_len
);
591 modify_field (buffer
, value_as_long (fromval
),
592 VALUE_BITPOS (toval
), VALUE_BITSIZE (toval
));
593 changed_addr
= VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
);
594 dest_buffer
= buffer
;
598 changed_addr
= VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
);
599 changed_len
= use_buffer
;
600 dest_buffer
= raw_buffer
;
604 changed_addr
= VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
);
605 changed_len
= TYPE_LENGTH (type
);
606 dest_buffer
= VALUE_CONTENTS (fromval
);
609 write_memory (changed_addr
, dest_buffer
, changed_len
);
610 if (deprecated_memory_changed_hook
)
611 deprecated_memory_changed_hook (changed_addr
, changed_len
);
612 target_changed_event ();
616 case lval_reg_frame_relative
:
619 struct frame_info
*frame
;
622 /* Figure out which frame this is in currently. */
623 if (VALUE_LVAL (toval
) == lval_register
)
625 frame
= get_current_frame ();
626 value_reg
= VALUE_REGNO (toval
);
630 frame
= frame_find_by_id (VALUE_FRAME_ID (toval
));
631 value_reg
= VALUE_FRAME_REGNUM (toval
);
635 error ("Value being assigned to is no longer active.");
637 if (VALUE_LVAL (toval
) == lval_reg_frame_relative
638 && CONVERT_REGISTER_P (VALUE_FRAME_REGNUM (toval
), type
))
640 /* If TOVAL is a special machine register requiring
641 conversion of program values to a special raw format. */
642 VALUE_TO_REGISTER (frame
, VALUE_FRAME_REGNUM (toval
),
643 type
, VALUE_CONTENTS (fromval
));
647 /* TOVAL is stored in a series of registers in the frame
648 specified by the structure. Copy that value out,
649 modify it, and copy it back in. */
657 /* Locate the first register that falls in the value that
658 needs to be transfered. Compute the offset of the
659 value in that register. */
662 for (reg_offset
= value_reg
, offset
= 0;
663 offset
+ DEPRECATED_REGISTER_RAW_SIZE (reg_offset
) <= VALUE_OFFSET (toval
);
665 byte_offset
= VALUE_OFFSET (toval
) - offset
;
668 /* Compute the number of register aligned values that need
670 if (VALUE_BITSIZE (toval
))
671 amount_to_copy
= byte_offset
+ 1;
673 amount_to_copy
= byte_offset
+ TYPE_LENGTH (type
);
675 /* And a bounce buffer. Be slightly over generous. */
676 buffer
= (char *) alloca (amount_to_copy
+ MAX_REGISTER_SIZE
);
679 for (regno
= reg_offset
, amount_copied
= 0;
680 amount_copied
< amount_to_copy
;
681 amount_copied
+= DEPRECATED_REGISTER_RAW_SIZE (regno
), regno
++)
682 frame_register_read (frame
, regno
, buffer
+ amount_copied
);
684 /* Modify what needs to be modified. */
685 if (VALUE_BITSIZE (toval
))
686 modify_field (buffer
+ byte_offset
,
687 value_as_long (fromval
),
688 VALUE_BITPOS (toval
), VALUE_BITSIZE (toval
));
690 memcpy (buffer
+ VALUE_OFFSET (toval
), raw_buffer
, use_buffer
);
692 memcpy (buffer
+ byte_offset
, VALUE_CONTENTS (fromval
),
696 for (regno
= reg_offset
, amount_copied
= 0;
697 amount_copied
< amount_to_copy
;
698 amount_copied
+= DEPRECATED_REGISTER_RAW_SIZE (regno
), regno
++)
699 put_frame_register (frame
, regno
, buffer
+ amount_copied
);
702 if (deprecated_register_changed_hook
)
703 deprecated_register_changed_hook (-1);
704 target_changed_event ();
705 observer_notify_target_changed (¤t_target
);
710 error ("Left operand of assignment is not an lvalue.");
713 /* Assigning to the stack pointer, frame pointer, and other
714 (architecture and calling convention specific) registers may
715 cause the frame cache to be out of date. Assigning to memory
716 also can. We just do this on all assignments to registers or
717 memory, for simplicity's sake; I doubt the slowdown matters. */
718 switch (VALUE_LVAL (toval
))
722 case lval_reg_frame_relative
:
724 reinit_frame_cache ();
726 /* Having destoroyed the frame cache, restore the selected frame. */
728 /* FIXME: cagney/2002-11-02: There has to be a better way of
729 doing this. Instead of constantly saving/restoring the
730 frame. Why not create a get_selected_frame() function that,
731 having saved the selected frame's ID can automatically
732 re-find the previously selected frame automatically. */
735 struct frame_info
*fi
= frame_find_by_id (old_frame
);
745 /* If the field does not entirely fill a LONGEST, then zero the sign bits.
746 If the field is signed, and is negative, then sign extend. */
747 if ((VALUE_BITSIZE (toval
) > 0)
748 && (VALUE_BITSIZE (toval
) < 8 * (int) sizeof (LONGEST
)))
750 LONGEST fieldval
= value_as_long (fromval
);
751 LONGEST valmask
= (((ULONGEST
) 1) << VALUE_BITSIZE (toval
)) - 1;
754 if (!TYPE_UNSIGNED (type
) && (fieldval
& (valmask
^ (valmask
>> 1))))
755 fieldval
|= ~valmask
;
757 fromval
= value_from_longest (type
, fieldval
);
760 val
= value_copy (toval
);
761 memcpy (VALUE_CONTENTS_RAW (val
), VALUE_CONTENTS (fromval
),
763 VALUE_TYPE (val
) = type
;
764 val
= value_change_enclosing_type (val
, VALUE_ENCLOSING_TYPE (fromval
));
765 VALUE_EMBEDDED_OFFSET (val
) = VALUE_EMBEDDED_OFFSET (fromval
);
766 VALUE_POINTED_TO_OFFSET (val
) = VALUE_POINTED_TO_OFFSET (fromval
);
771 /* Extend a value VAL to COUNT repetitions of its type. */
774 value_repeat (struct value
*arg1
, int count
)
778 if (VALUE_LVAL (arg1
) != lval_memory
)
779 error ("Only values in memory can be extended with '@'.");
781 error ("Invalid number %d of repetitions.", count
);
783 val
= allocate_repeat_value (VALUE_ENCLOSING_TYPE (arg1
), count
);
785 read_memory (VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
),
786 VALUE_CONTENTS_ALL_RAW (val
),
787 TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val
)));
788 VALUE_LVAL (val
) = lval_memory
;
789 VALUE_ADDRESS (val
) = VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
);
795 value_of_variable (struct symbol
*var
, struct block
*b
)
798 struct frame_info
*frame
= NULL
;
801 frame
= NULL
; /* Use selected frame. */
802 else if (symbol_read_needs_frame (var
))
804 frame
= block_innermost_frame (b
);
807 if (BLOCK_FUNCTION (b
)
808 && SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b
)))
809 error ("No frame is currently executing in block %s.",
810 SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b
)));
812 error ("No frame is currently executing in specified block");
816 val
= read_var_value (var
, frame
);
818 error ("Address of symbol \"%s\" is unknown.", SYMBOL_PRINT_NAME (var
));
823 /* Given a value which is an array, return a value which is a pointer to its
824 first element, regardless of whether or not the array has a nonzero lower
827 FIXME: A previous comment here indicated that this routine should be
828 substracting the array's lower bound. It's not clear to me that this
829 is correct. Given an array subscripting operation, it would certainly
830 work to do the adjustment here, essentially computing:
832 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
834 However I believe a more appropriate and logical place to account for
835 the lower bound is to do so in value_subscript, essentially computing:
837 (&array[0] + ((index - lowerbound) * sizeof array[0]))
839 As further evidence consider what would happen with operations other
840 than array subscripting, where the caller would get back a value that
841 had an address somewhere before the actual first element of the array,
842 and the information about the lower bound would be lost because of
843 the coercion to pointer type.
847 value_coerce_array (struct value
*arg1
)
849 struct type
*type
= check_typedef (VALUE_TYPE (arg1
));
851 if (VALUE_LVAL (arg1
) != lval_memory
)
852 error ("Attempt to take address of value not located in memory.");
854 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
855 (VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
)));
858 /* Given a value which is a function, return a value which is a pointer
862 value_coerce_function (struct value
*arg1
)
864 struct value
*retval
;
866 if (VALUE_LVAL (arg1
) != lval_memory
)
867 error ("Attempt to take address of value not located in memory.");
869 retval
= value_from_pointer (lookup_pointer_type (VALUE_TYPE (arg1
)),
870 (VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
)));
871 VALUE_BFD_SECTION (retval
) = VALUE_BFD_SECTION (arg1
);
875 /* Return a pointer value for the object for which ARG1 is the contents. */
878 value_addr (struct value
*arg1
)
882 struct type
*type
= check_typedef (VALUE_TYPE (arg1
));
883 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
885 /* Copy the value, but change the type from (T&) to (T*).
886 We keep the same location information, which is efficient,
887 and allows &(&X) to get the location containing the reference. */
888 arg2
= value_copy (arg1
);
889 VALUE_TYPE (arg2
) = lookup_pointer_type (TYPE_TARGET_TYPE (type
));
892 if (TYPE_CODE (type
) == TYPE_CODE_FUNC
)
893 return value_coerce_function (arg1
);
895 if (VALUE_LVAL (arg1
) != lval_memory
)
896 error ("Attempt to take address of value not located in memory.");
898 /* Get target memory address */
899 arg2
= value_from_pointer (lookup_pointer_type (VALUE_TYPE (arg1
)),
900 (VALUE_ADDRESS (arg1
)
901 + VALUE_OFFSET (arg1
)
902 + VALUE_EMBEDDED_OFFSET (arg1
)));
904 /* This may be a pointer to a base subobject; so remember the
905 full derived object's type ... */
906 arg2
= value_change_enclosing_type (arg2
, lookup_pointer_type (VALUE_ENCLOSING_TYPE (arg1
)));
907 /* ... and also the relative position of the subobject in the full object */
908 VALUE_POINTED_TO_OFFSET (arg2
) = VALUE_EMBEDDED_OFFSET (arg1
);
909 VALUE_BFD_SECTION (arg2
) = VALUE_BFD_SECTION (arg1
);
913 /* Given a value of a pointer type, apply the C unary * operator to it. */
916 value_ind (struct value
*arg1
)
918 struct type
*base_type
;
923 base_type
= check_typedef (VALUE_TYPE (arg1
));
925 if (TYPE_CODE (base_type
) == TYPE_CODE_MEMBER
)
926 error ("not implemented: member types in value_ind");
928 /* Allow * on an integer so we can cast it to whatever we want.
929 This returns an int, which seems like the most C-like thing
930 to do. "long long" variables are rare enough that
931 BUILTIN_TYPE_LONGEST would seem to be a mistake. */
932 if (TYPE_CODE (base_type
) == TYPE_CODE_INT
)
933 return value_at_lazy (builtin_type_int
,
934 (CORE_ADDR
) value_as_long (arg1
),
935 VALUE_BFD_SECTION (arg1
));
936 else if (TYPE_CODE (base_type
) == TYPE_CODE_PTR
)
938 struct type
*enc_type
;
939 /* We may be pointing to something embedded in a larger object */
940 /* Get the real type of the enclosing object */
941 enc_type
= check_typedef (VALUE_ENCLOSING_TYPE (arg1
));
942 enc_type
= TYPE_TARGET_TYPE (enc_type
);
943 /* Retrieve the enclosing object pointed to */
944 arg2
= value_at_lazy (enc_type
,
945 value_as_address (arg1
) - VALUE_POINTED_TO_OFFSET (arg1
),
946 VALUE_BFD_SECTION (arg1
));
948 VALUE_TYPE (arg2
) = TYPE_TARGET_TYPE (base_type
);
949 /* Add embedding info */
950 arg2
= value_change_enclosing_type (arg2
, enc_type
);
951 VALUE_EMBEDDED_OFFSET (arg2
) = VALUE_POINTED_TO_OFFSET (arg1
);
953 /* We may be pointing to an object of some derived type */
954 arg2
= value_full_object (arg2
, NULL
, 0, 0, 0);
958 error ("Attempt to take contents of a non-pointer value.");
959 return 0; /* For lint -- never reached */
962 /* Pushing small parts of stack frames. */
964 /* Push one word (the size of object that a register holds). */
967 push_word (CORE_ADDR sp
, ULONGEST word
)
969 int len
= DEPRECATED_REGISTER_SIZE
;
970 char buffer
[MAX_REGISTER_SIZE
];
972 store_unsigned_integer (buffer
, len
, word
);
973 if (INNER_THAN (1, 2))
975 /* stack grows downward */
977 write_memory (sp
, buffer
, len
);
981 /* stack grows upward */
982 write_memory (sp
, buffer
, len
);
989 /* Push LEN bytes with data at BUFFER. */
992 push_bytes (CORE_ADDR sp
, char *buffer
, int len
)
994 if (INNER_THAN (1, 2))
996 /* stack grows downward */
998 write_memory (sp
, buffer
, len
);
1002 /* stack grows upward */
1003 write_memory (sp
, buffer
, len
);
1010 #ifndef PARM_BOUNDARY
1011 #define PARM_BOUNDARY (0)
1014 /* Push onto the stack the specified value VALUE. Pad it correctly for
1015 it to be an argument to a function. */
1018 value_push (CORE_ADDR sp
, struct value
*arg
)
1020 int len
= TYPE_LENGTH (VALUE_ENCLOSING_TYPE (arg
));
1021 int container_len
= len
;
1024 /* How big is the container we're going to put this value in? */
1026 container_len
= ((len
+ PARM_BOUNDARY
/ TARGET_CHAR_BIT
- 1)
1027 & ~(PARM_BOUNDARY
/ TARGET_CHAR_BIT
- 1));
1029 /* Are we going to put it at the high or low end of the container? */
1030 if (TARGET_BYTE_ORDER
== BFD_ENDIAN_BIG
)
1031 offset
= container_len
- len
;
1035 if (INNER_THAN (1, 2))
1037 /* stack grows downward */
1038 sp
-= container_len
;
1039 write_memory (sp
+ offset
, VALUE_CONTENTS_ALL (arg
), len
);
1043 /* stack grows upward */
1044 write_memory (sp
+ offset
, VALUE_CONTENTS_ALL (arg
), len
);
1045 sp
+= container_len
;
1052 legacy_push_arguments (int nargs
, struct value
**args
, CORE_ADDR sp
,
1053 int struct_return
, CORE_ADDR struct_addr
)
1055 /* ASSERT ( !struct_return); */
1057 for (i
= nargs
- 1; i
>= 0; i
--)
1058 sp
= value_push (sp
, args
[i
]);
1062 /* Create a value for an array by allocating space in the inferior, copying
1063 the data into that space, and then setting up an array value.
1065 The array bounds are set from LOWBOUND and HIGHBOUND, and the array is
1066 populated from the values passed in ELEMVEC.
1068 The element type of the array is inherited from the type of the
1069 first element, and all elements must have the same size (though we
1070 don't currently enforce any restriction on their types). */
1073 value_array (int lowbound
, int highbound
, struct value
**elemvec
)
1077 unsigned int typelength
;
1079 struct type
*rangetype
;
1080 struct type
*arraytype
;
1083 /* Validate that the bounds are reasonable and that each of the elements
1084 have the same size. */
1086 nelem
= highbound
- lowbound
+ 1;
1089 error ("bad array bounds (%d, %d)", lowbound
, highbound
);
1091 typelength
= TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec
[0]));
1092 for (idx
= 1; idx
< nelem
; idx
++)
1094 if (TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec
[idx
])) != typelength
)
1096 error ("array elements must all be the same size");
1100 rangetype
= create_range_type ((struct type
*) NULL
, builtin_type_int
,
1101 lowbound
, highbound
);
1102 arraytype
= create_array_type ((struct type
*) NULL
,
1103 VALUE_ENCLOSING_TYPE (elemvec
[0]), rangetype
);
1105 if (!current_language
->c_style_arrays
)
1107 val
= allocate_value (arraytype
);
1108 for (idx
= 0; idx
< nelem
; idx
++)
1110 memcpy (VALUE_CONTENTS_ALL_RAW (val
) + (idx
* typelength
),
1111 VALUE_CONTENTS_ALL (elemvec
[idx
]),
1114 VALUE_BFD_SECTION (val
) = VALUE_BFD_SECTION (elemvec
[0]);
1118 /* Allocate space to store the array in the inferior, and then initialize
1119 it by copying in each element. FIXME: Is it worth it to create a
1120 local buffer in which to collect each value and then write all the
1121 bytes in one operation? */
1123 addr
= allocate_space_in_inferior (nelem
* typelength
);
1124 for (idx
= 0; idx
< nelem
; idx
++)
1126 write_memory (addr
+ (idx
* typelength
), VALUE_CONTENTS_ALL (elemvec
[idx
]),
1130 /* Create the array type and set up an array value to be evaluated lazily. */
1132 val
= value_at_lazy (arraytype
, addr
, VALUE_BFD_SECTION (elemvec
[0]));
1136 /* Create a value for a string constant by allocating space in the inferior,
1137 copying the data into that space, and returning the address with type
1138 TYPE_CODE_STRING. PTR points to the string constant data; LEN is number
1140 Note that string types are like array of char types with a lower bound of
1141 zero and an upper bound of LEN - 1. Also note that the string may contain
1142 embedded null bytes. */
1145 value_string (char *ptr
, int len
)
1148 int lowbound
= current_language
->string_lower_bound
;
1149 struct type
*rangetype
= create_range_type ((struct type
*) NULL
,
1151 lowbound
, len
+ lowbound
- 1);
1152 struct type
*stringtype
1153 = create_string_type ((struct type
*) NULL
, rangetype
);
1156 if (current_language
->c_style_arrays
== 0)
1158 val
= allocate_value (stringtype
);
1159 memcpy (VALUE_CONTENTS_RAW (val
), ptr
, len
);
1164 /* Allocate space to store the string in the inferior, and then
1165 copy LEN bytes from PTR in gdb to that address in the inferior. */
1167 addr
= allocate_space_in_inferior (len
);
1168 write_memory (addr
, ptr
, len
);
1170 val
= value_at_lazy (stringtype
, addr
, NULL
);
1175 value_bitstring (char *ptr
, int len
)
1178 struct type
*domain_type
= create_range_type (NULL
, builtin_type_int
,
1180 struct type
*type
= create_set_type ((struct type
*) NULL
, domain_type
);
1181 TYPE_CODE (type
) = TYPE_CODE_BITSTRING
;
1182 val
= allocate_value (type
);
1183 memcpy (VALUE_CONTENTS_RAW (val
), ptr
, TYPE_LENGTH (type
));
1187 /* See if we can pass arguments in T2 to a function which takes arguments
1188 of types T1. T1 is a list of NARGS arguments, and T2 is a NULL-terminated
1189 vector. If some arguments need coercion of some sort, then the coerced
1190 values are written into T2. Return value is 0 if the arguments could be
1191 matched, or the position at which they differ if not.
1193 STATICP is nonzero if the T1 argument list came from a
1194 static member function. T2 will still include the ``this'' pointer,
1195 but it will be skipped.
1197 For non-static member functions, we ignore the first argument,
1198 which is the type of the instance variable. This is because we want
1199 to handle calls with objects from derived classes. This is not
1200 entirely correct: we should actually check to make sure that a
1201 requested operation is type secure, shouldn't we? FIXME. */
1204 typecmp (int staticp
, int varargs
, int nargs
,
1205 struct field t1
[], struct value
*t2
[])
1210 internal_error (__FILE__
, __LINE__
, "typecmp: no argument list");
1212 /* Skip ``this'' argument if applicable. T2 will always include THIS. */
1217 (i
< nargs
) && TYPE_CODE (t1
[i
].type
) != TYPE_CODE_VOID
;
1220 struct type
*tt1
, *tt2
;
1225 tt1
= check_typedef (t1
[i
].type
);
1226 tt2
= check_typedef (VALUE_TYPE (t2
[i
]));
1228 if (TYPE_CODE (tt1
) == TYPE_CODE_REF
1229 /* We should be doing hairy argument matching, as below. */
1230 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1
))) == TYPE_CODE (tt2
)))
1232 if (TYPE_CODE (tt2
) == TYPE_CODE_ARRAY
)
1233 t2
[i
] = value_coerce_array (t2
[i
]);
1235 t2
[i
] = value_addr (t2
[i
]);
1239 /* djb - 20000715 - Until the new type structure is in the
1240 place, and we can attempt things like implicit conversions,
1241 we need to do this so you can take something like a map<const
1242 char *>, and properly access map["hello"], because the
1243 argument to [] will be a reference to a pointer to a char,
1244 and the argument will be a pointer to a char. */
1245 while ( TYPE_CODE(tt1
) == TYPE_CODE_REF
||
1246 TYPE_CODE (tt1
) == TYPE_CODE_PTR
)
1248 tt1
= check_typedef( TYPE_TARGET_TYPE(tt1
) );
1250 while ( TYPE_CODE(tt2
) == TYPE_CODE_ARRAY
||
1251 TYPE_CODE(tt2
) == TYPE_CODE_PTR
||
1252 TYPE_CODE(tt2
) == TYPE_CODE_REF
)
1254 tt2
= check_typedef( TYPE_TARGET_TYPE(tt2
) );
1256 if (TYPE_CODE (tt1
) == TYPE_CODE (tt2
))
1258 /* Array to pointer is a `trivial conversion' according to the ARM. */
1260 /* We should be doing much hairier argument matching (see section 13.2
1261 of the ARM), but as a quick kludge, just check for the same type
1263 if (TYPE_CODE (t1
[i
].type
) != TYPE_CODE (VALUE_TYPE (t2
[i
])))
1266 if (varargs
|| t2
[i
] == NULL
)
1271 /* Helper function used by value_struct_elt to recurse through baseclasses.
1272 Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
1273 and search in it assuming it has (class) type TYPE.
1274 If found, return value, else return NULL.
1276 If LOOKING_FOR_BASECLASS, then instead of looking for struct fields,
1277 look for a baseclass named NAME. */
1279 static struct value
*
1280 search_struct_field (char *name
, struct value
*arg1
, int offset
,
1281 struct type
*type
, int looking_for_baseclass
)
1284 int nbases
= TYPE_N_BASECLASSES (type
);
1286 CHECK_TYPEDEF (type
);
1288 if (!looking_for_baseclass
)
1289 for (i
= TYPE_NFIELDS (type
) - 1; i
>= nbases
; i
--)
1291 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
1293 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1296 if (TYPE_FIELD_STATIC (type
, i
))
1298 v
= value_static_field (type
, i
);
1300 error ("field %s is nonexistent or has been optimised out",
1305 v
= value_primitive_field (arg1
, offset
, i
, type
);
1307 error ("there is no field named %s", name
);
1313 && (t_field_name
[0] == '\0'
1314 || (TYPE_CODE (type
) == TYPE_CODE_UNION
1315 && (strcmp_iw (t_field_name
, "else") == 0))))
1317 struct type
*field_type
= TYPE_FIELD_TYPE (type
, i
);
1318 if (TYPE_CODE (field_type
) == TYPE_CODE_UNION
1319 || TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
)
1321 /* Look for a match through the fields of an anonymous union,
1322 or anonymous struct. C++ provides anonymous unions.
1324 In the GNU Chill (now deleted from GDB)
1325 implementation of variant record types, each
1326 <alternative field> has an (anonymous) union type,
1327 each member of the union represents a <variant
1328 alternative>. Each <variant alternative> is
1329 represented as a struct, with a member for each
1333 int new_offset
= offset
;
1335 /* This is pretty gross. In G++, the offset in an
1336 anonymous union is relative to the beginning of the
1337 enclosing struct. In the GNU Chill (now deleted
1338 from GDB) implementation of variant records, the
1339 bitpos is zero in an anonymous union field, so we
1340 have to add the offset of the union here. */
1341 if (TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
1342 || (TYPE_NFIELDS (field_type
) > 0
1343 && TYPE_FIELD_BITPOS (field_type
, 0) == 0))
1344 new_offset
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
1346 v
= search_struct_field (name
, arg1
, new_offset
, field_type
,
1347 looking_for_baseclass
);
1354 for (i
= 0; i
< nbases
; i
++)
1357 struct type
*basetype
= check_typedef (TYPE_BASECLASS (type
, i
));
1358 /* If we are looking for baseclasses, this is what we get when we
1359 hit them. But it could happen that the base part's member name
1360 is not yet filled in. */
1361 int found_baseclass
= (looking_for_baseclass
1362 && TYPE_BASECLASS_NAME (type
, i
) != NULL
1363 && (strcmp_iw (name
, TYPE_BASECLASS_NAME (type
, i
)) == 0));
1365 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1368 struct value
*v2
= allocate_value (basetype
);
1370 boffset
= baseclass_offset (type
, i
,
1371 VALUE_CONTENTS (arg1
) + offset
,
1372 VALUE_ADDRESS (arg1
)
1373 + VALUE_OFFSET (arg1
) + offset
);
1375 error ("virtual baseclass botch");
1377 /* The virtual base class pointer might have been clobbered by the
1378 user program. Make sure that it still points to a valid memory
1382 if (boffset
< 0 || boffset
>= TYPE_LENGTH (type
))
1384 CORE_ADDR base_addr
;
1386 base_addr
= VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
) + boffset
;
1387 if (target_read_memory (base_addr
, VALUE_CONTENTS_RAW (v2
),
1388 TYPE_LENGTH (basetype
)) != 0)
1389 error ("virtual baseclass botch");
1390 VALUE_LVAL (v2
) = lval_memory
;
1391 VALUE_ADDRESS (v2
) = base_addr
;
1395 VALUE_LVAL (v2
) = VALUE_LVAL (arg1
);
1396 VALUE_ADDRESS (v2
) = VALUE_ADDRESS (arg1
);
1397 VALUE_OFFSET (v2
) = VALUE_OFFSET (arg1
) + boffset
;
1398 if (VALUE_LAZY (arg1
))
1399 VALUE_LAZY (v2
) = 1;
1401 memcpy (VALUE_CONTENTS_RAW (v2
),
1402 VALUE_CONTENTS_RAW (arg1
) + boffset
,
1403 TYPE_LENGTH (basetype
));
1406 if (found_baseclass
)
1408 v
= search_struct_field (name
, v2
, 0, TYPE_BASECLASS (type
, i
),
1409 looking_for_baseclass
);
1411 else if (found_baseclass
)
1412 v
= value_primitive_field (arg1
, offset
, i
, type
);
1414 v
= search_struct_field (name
, arg1
,
1415 offset
+ TYPE_BASECLASS_BITPOS (type
, i
) / 8,
1416 basetype
, looking_for_baseclass
);
1424 /* Return the offset (in bytes) of the virtual base of type BASETYPE
1425 * in an object pointed to by VALADDR (on the host), assumed to be of
1426 * type TYPE. OFFSET is number of bytes beyond start of ARG to start
1427 * looking (in case VALADDR is the contents of an enclosing object).
1429 * This routine recurses on the primary base of the derived class because
1430 * the virtual base entries of the primary base appear before the other
1431 * virtual base entries.
1433 * If the virtual base is not found, a negative integer is returned.
1434 * The magnitude of the negative integer is the number of entries in
1435 * the virtual table to skip over (entries corresponding to various
1436 * ancestral classes in the chain of primary bases).
1438 * Important: This assumes the HP / Taligent C++ runtime
1439 * conventions. Use baseclass_offset() instead to deal with g++
1443 find_rt_vbase_offset (struct type
*type
, struct type
*basetype
, char *valaddr
,
1444 int offset
, int *boffset_p
, int *skip_p
)
1446 int boffset
; /* offset of virtual base */
1447 int index
; /* displacement to use in virtual table */
1451 CORE_ADDR vtbl
; /* the virtual table pointer */
1452 struct type
*pbc
; /* the primary base class */
1454 /* Look for the virtual base recursively in the primary base, first.
1455 * This is because the derived class object and its primary base
1456 * subobject share the primary virtual table. */
1459 pbc
= TYPE_PRIMARY_BASE (type
);
1462 find_rt_vbase_offset (pbc
, basetype
, valaddr
, offset
, &boffset
, &skip
);
1465 *boffset_p
= boffset
;
1474 /* Find the index of the virtual base according to HP/Taligent
1475 runtime spec. (Depth-first, left-to-right.) */
1476 index
= virtual_base_index_skip_primaries (basetype
, type
);
1480 *skip_p
= skip
+ virtual_base_list_length_skip_primaries (type
);
1485 /* pai: FIXME -- 32x64 possible problem */
1486 /* First word (4 bytes) in object layout is the vtable pointer */
1487 vtbl
= *(CORE_ADDR
*) (valaddr
+ offset
);
1489 /* Before the constructor is invoked, things are usually zero'd out. */
1491 error ("Couldn't find virtual table -- object may not be constructed yet.");
1494 /* Find virtual base's offset -- jump over entries for primary base
1495 * ancestors, then use the index computed above. But also adjust by
1496 * HP_ACC_VBASE_START for the vtable slots before the start of the
1497 * virtual base entries. Offset is negative -- virtual base entries
1498 * appear _before_ the address point of the virtual table. */
1500 /* pai: FIXME -- 32x64 problem, if word = 8 bytes, change multiplier
1503 /* epstein : FIXME -- added param for overlay section. May not be correct */
1504 vp
= value_at (builtin_type_int
, vtbl
+ 4 * (-skip
- index
- HP_ACC_VBASE_START
), NULL
);
1505 boffset
= value_as_long (vp
);
1507 *boffset_p
= boffset
;
1512 /* Helper function used by value_struct_elt to recurse through baseclasses.
1513 Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
1514 and search in it assuming it has (class) type TYPE.
1515 If found, return value, else if name matched and args not return (value)-1,
1516 else return NULL. */
1518 static struct value
*
1519 search_struct_method (char *name
, struct value
**arg1p
,
1520 struct value
**args
, int offset
,
1521 int *static_memfuncp
, struct type
*type
)
1525 int name_matched
= 0;
1526 char dem_opname
[64];
1528 CHECK_TYPEDEF (type
);
1529 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
1531 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
1532 /* FIXME! May need to check for ARM demangling here */
1533 if (strncmp (t_field_name
, "__", 2) == 0 ||
1534 strncmp (t_field_name
, "op", 2) == 0 ||
1535 strncmp (t_field_name
, "type", 4) == 0)
1537 if (cplus_demangle_opname (t_field_name
, dem_opname
, DMGL_ANSI
))
1538 t_field_name
= dem_opname
;
1539 else if (cplus_demangle_opname (t_field_name
, dem_opname
, 0))
1540 t_field_name
= dem_opname
;
1542 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
1544 int j
= TYPE_FN_FIELDLIST_LENGTH (type
, i
) - 1;
1545 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
1548 check_stub_method_group (type
, i
);
1549 if (j
> 0 && args
== 0)
1550 error ("cannot resolve overloaded method `%s': no arguments supplied", name
);
1551 else if (j
== 0 && args
== 0)
1553 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
1560 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f
, j
),
1561 TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f
, j
)),
1562 TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f
, j
)),
1563 TYPE_FN_FIELD_ARGS (f
, j
), args
))
1565 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
1566 return value_virtual_fn_field (arg1p
, f
, j
, type
, offset
);
1567 if (TYPE_FN_FIELD_STATIC_P (f
, j
) && static_memfuncp
)
1568 *static_memfuncp
= 1;
1569 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
1578 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
1582 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1584 if (TYPE_HAS_VTABLE (type
))
1586 /* HP aCC compiled type, search for virtual base offset
1587 according to HP/Taligent runtime spec. */
1589 find_rt_vbase_offset (type
, TYPE_BASECLASS (type
, i
),
1590 VALUE_CONTENTS_ALL (*arg1p
),
1591 offset
+ VALUE_EMBEDDED_OFFSET (*arg1p
),
1592 &base_offset
, &skip
);
1594 error ("Virtual base class offset not found in vtable");
1598 struct type
*baseclass
= check_typedef (TYPE_BASECLASS (type
, i
));
1601 /* The virtual base class pointer might have been clobbered by the
1602 user program. Make sure that it still points to a valid memory
1605 if (offset
< 0 || offset
>= TYPE_LENGTH (type
))
1607 base_valaddr
= (char *) alloca (TYPE_LENGTH (baseclass
));
1608 if (target_read_memory (VALUE_ADDRESS (*arg1p
)
1609 + VALUE_OFFSET (*arg1p
) + offset
,
1611 TYPE_LENGTH (baseclass
)) != 0)
1612 error ("virtual baseclass botch");
1615 base_valaddr
= VALUE_CONTENTS (*arg1p
) + offset
;
1618 baseclass_offset (type
, i
, base_valaddr
,
1619 VALUE_ADDRESS (*arg1p
)
1620 + VALUE_OFFSET (*arg1p
) + offset
);
1621 if (base_offset
== -1)
1622 error ("virtual baseclass botch");
1627 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
1629 v
= search_struct_method (name
, arg1p
, args
, base_offset
+ offset
,
1630 static_memfuncp
, TYPE_BASECLASS (type
, i
));
1631 if (v
== (struct value
*) - 1)
1637 /* FIXME-bothner: Why is this commented out? Why is it here? */
1638 /* *arg1p = arg1_tmp; */
1643 return (struct value
*) - 1;
1648 /* Given *ARGP, a value of type (pointer to a)* structure/union,
1649 extract the component named NAME from the ultimate target structure/union
1650 and return it as a value with its appropriate type.
1651 ERR is used in the error message if *ARGP's type is wrong.
1653 C++: ARGS is a list of argument types to aid in the selection of
1654 an appropriate method. Also, handle derived types.
1656 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
1657 where the truthvalue of whether the function that was resolved was
1658 a static member function or not is stored.
1660 ERR is an error message to be printed in case the field is not found. */
1663 value_struct_elt (struct value
**argp
, struct value
**args
,
1664 char *name
, int *static_memfuncp
, char *err
)
1669 COERCE_ARRAY (*argp
);
1671 t
= check_typedef (VALUE_TYPE (*argp
));
1673 /* Follow pointers until we get to a non-pointer. */
1675 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
1677 *argp
= value_ind (*argp
);
1678 /* Don't coerce fn pointer to fn and then back again! */
1679 if (TYPE_CODE (VALUE_TYPE (*argp
)) != TYPE_CODE_FUNC
)
1680 COERCE_ARRAY (*argp
);
1681 t
= check_typedef (VALUE_TYPE (*argp
));
1684 if (TYPE_CODE (t
) == TYPE_CODE_MEMBER
)
1685 error ("not implemented: member type in value_struct_elt");
1687 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
1688 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
1689 error ("Attempt to extract a component of a value that is not a %s.", err
);
1691 /* Assume it's not, unless we see that it is. */
1692 if (static_memfuncp
)
1693 *static_memfuncp
= 0;
1697 /* if there are no arguments ...do this... */
1699 /* Try as a field first, because if we succeed, there
1700 is less work to be done. */
1701 v
= search_struct_field (name
, *argp
, 0, t
, 0);
1705 /* C++: If it was not found as a data field, then try to
1706 return it as a pointer to a method. */
1708 if (destructor_name_p (name
, t
))
1709 error ("Cannot get value of destructor");
1711 v
= search_struct_method (name
, argp
, args
, 0, static_memfuncp
, t
);
1713 if (v
== (struct value
*) - 1)
1714 error ("Cannot take address of a method");
1717 if (TYPE_NFN_FIELDS (t
))
1718 error ("There is no member or method named %s.", name
);
1720 error ("There is no member named %s.", name
);
1725 if (destructor_name_p (name
, t
))
1729 /* Destructors are a special case. */
1730 int m_index
, f_index
;
1733 if (get_destructor_fn_field (t
, &m_index
, &f_index
))
1735 v
= value_fn_field (NULL
, TYPE_FN_FIELDLIST1 (t
, m_index
),
1739 error ("could not find destructor function named %s.", name
);
1745 error ("destructor should not have any argument");
1749 v
= search_struct_method (name
, argp
, args
, 0, static_memfuncp
, t
);
1751 if (v
== (struct value
*) - 1)
1753 error ("One of the arguments you tried to pass to %s could not be converted to what the function wants.", name
);
1757 /* See if user tried to invoke data as function. If so,
1758 hand it back. If it's not callable (i.e., a pointer to function),
1759 gdb should give an error. */
1760 v
= search_struct_field (name
, *argp
, 0, t
, 0);
1764 error ("Structure has no component named %s.", name
);
1768 /* Search through the methods of an object (and its bases)
1769 * to find a specified method. Return the pointer to the
1770 * fn_field list of overloaded instances.
1771 * Helper function for value_find_oload_list.
1772 * ARGP is a pointer to a pointer to a value (the object)
1773 * METHOD is a string containing the method name
1774 * OFFSET is the offset within the value
1775 * TYPE is the assumed type of the object
1776 * NUM_FNS is the number of overloaded instances
1777 * BASETYPE is set to the actual type of the subobject where the method is found
1778 * BOFFSET is the offset of the base subobject where the method is found */
1780 static struct fn_field
*
1781 find_method_list (struct value
**argp
, char *method
, int offset
,
1782 struct type
*type
, int *num_fns
,
1783 struct type
**basetype
, int *boffset
)
1787 CHECK_TYPEDEF (type
);
1791 /* First check in object itself */
1792 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
1794 /* pai: FIXME What about operators and type conversions? */
1795 char *fn_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
1796 if (fn_field_name
&& (strcmp_iw (fn_field_name
, method
) == 0))
1798 int len
= TYPE_FN_FIELDLIST_LENGTH (type
, i
);
1799 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
1805 /* Resolve any stub methods. */
1806 check_stub_method_group (type
, i
);
1812 /* Not found in object, check in base subobjects */
1813 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
1816 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1818 if (TYPE_HAS_VTABLE (type
))
1820 /* HP aCC compiled type, search for virtual base offset
1821 * according to HP/Taligent runtime spec. */
1823 find_rt_vbase_offset (type
, TYPE_BASECLASS (type
, i
),
1824 VALUE_CONTENTS_ALL (*argp
),
1825 offset
+ VALUE_EMBEDDED_OFFSET (*argp
),
1826 &base_offset
, &skip
);
1828 error ("Virtual base class offset not found in vtable");
1832 /* probably g++ runtime model */
1833 base_offset
= VALUE_OFFSET (*argp
) + offset
;
1835 baseclass_offset (type
, i
,
1836 VALUE_CONTENTS (*argp
) + base_offset
,
1837 VALUE_ADDRESS (*argp
) + base_offset
);
1838 if (base_offset
== -1)
1839 error ("virtual baseclass botch");
1843 /* non-virtual base, simply use bit position from debug info */
1845 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
1847 f
= find_method_list (argp
, method
, base_offset
+ offset
,
1848 TYPE_BASECLASS (type
, i
), num_fns
, basetype
,
1856 /* Return the list of overloaded methods of a specified name.
1857 * ARGP is a pointer to a pointer to a value (the object)
1858 * METHOD is the method name
1859 * OFFSET is the offset within the value contents
1860 * NUM_FNS is the number of overloaded instances
1861 * BASETYPE is set to the type of the base subobject that defines the method
1862 * BOFFSET is the offset of the base subobject which defines the method */
1865 value_find_oload_method_list (struct value
**argp
, char *method
, int offset
,
1866 int *num_fns
, struct type
**basetype
,
1871 t
= check_typedef (VALUE_TYPE (*argp
));
1873 /* code snarfed from value_struct_elt */
1874 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
1876 *argp
= value_ind (*argp
);
1877 /* Don't coerce fn pointer to fn and then back again! */
1878 if (TYPE_CODE (VALUE_TYPE (*argp
)) != TYPE_CODE_FUNC
)
1879 COERCE_ARRAY (*argp
);
1880 t
= check_typedef (VALUE_TYPE (*argp
));
1883 if (TYPE_CODE (t
) == TYPE_CODE_MEMBER
)
1884 error ("Not implemented: member type in value_find_oload_lis");
1886 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
1887 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
1888 error ("Attempt to extract a component of a value that is not a struct or union");
1890 return find_method_list (argp
, method
, 0, t
, num_fns
, basetype
, boffset
);
1893 /* Given an array of argument types (ARGTYPES) (which includes an
1894 entry for "this" in the case of C++ methods), the number of
1895 arguments NARGS, the NAME of a function whether it's a method or
1896 not (METHOD), and the degree of laxness (LAX) in conforming to
1897 overload resolution rules in ANSI C++, find the best function that
1898 matches on the argument types according to the overload resolution
1901 In the case of class methods, the parameter OBJ is an object value
1902 in which to search for overloaded methods.
1904 In the case of non-method functions, the parameter FSYM is a symbol
1905 corresponding to one of the overloaded functions.
1907 Return value is an integer: 0 -> good match, 10 -> debugger applied
1908 non-standard coercions, 100 -> incompatible.
1910 If a method is being searched for, VALP will hold the value.
1911 If a non-method is being searched for, SYMP will hold the symbol for it.
1913 If a method is being searched for, and it is a static method,
1914 then STATICP will point to a non-zero value.
1916 Note: This function does *not* check the value of
1917 overload_resolution. Caller must check it to see whether overload
1918 resolution is permitted.
1922 find_overload_match (struct type
**arg_types
, int nargs
, char *name
, int method
,
1923 int lax
, struct value
**objp
, struct symbol
*fsym
,
1924 struct value
**valp
, struct symbol
**symp
, int *staticp
)
1926 struct value
*obj
= (objp
? *objp
: NULL
);
1928 int oload_champ
; /* Index of best overloaded function */
1930 struct badness_vector
*oload_champ_bv
= NULL
; /* The measure for the current best match */
1932 struct value
*temp
= obj
;
1933 struct fn_field
*fns_ptr
= NULL
; /* For methods, the list of overloaded methods */
1934 struct symbol
**oload_syms
= NULL
; /* For non-methods, the list of overloaded function symbols */
1935 int num_fns
= 0; /* Number of overloaded instances being considered */
1936 struct type
*basetype
= NULL
;
1940 struct cleanup
*old_cleanups
= NULL
;
1942 const char *obj_type_name
= NULL
;
1943 char *func_name
= NULL
;
1944 enum oload_classification match_quality
;
1946 /* Get the list of overloaded methods or functions */
1949 obj_type_name
= TYPE_NAME (VALUE_TYPE (obj
));
1950 /* Hack: evaluate_subexp_standard often passes in a pointer
1951 value rather than the object itself, so try again */
1952 if ((!obj_type_name
|| !*obj_type_name
) &&
1953 (TYPE_CODE (VALUE_TYPE (obj
)) == TYPE_CODE_PTR
))
1954 obj_type_name
= TYPE_NAME (TYPE_TARGET_TYPE (VALUE_TYPE (obj
)));
1956 fns_ptr
= value_find_oload_method_list (&temp
, name
, 0,
1958 &basetype
, &boffset
);
1959 if (!fns_ptr
|| !num_fns
)
1960 error ("Couldn't find method %s%s%s",
1962 (obj_type_name
&& *obj_type_name
) ? "::" : "",
1964 /* If we are dealing with stub method types, they should have
1965 been resolved by find_method_list via value_find_oload_method_list
1967 gdb_assert (TYPE_DOMAIN_TYPE (fns_ptr
[0].type
) != NULL
);
1968 oload_champ
= find_oload_champ (arg_types
, nargs
, method
, num_fns
,
1969 fns_ptr
, oload_syms
, &oload_champ_bv
);
1973 const char *qualified_name
= SYMBOL_CPLUS_DEMANGLED_NAME (fsym
);
1974 func_name
= cp_func_name (qualified_name
);
1976 /* If the name is NULL this must be a C-style function.
1977 Just return the same symbol. */
1978 if (func_name
== NULL
)
1984 old_cleanups
= make_cleanup (xfree
, func_name
);
1985 make_cleanup (xfree
, oload_syms
);
1986 make_cleanup (xfree
, oload_champ_bv
);
1988 oload_champ
= find_oload_champ_namespace (arg_types
, nargs
,
1995 /* Check how bad the best match is. */
1998 = classify_oload_match (oload_champ_bv
, nargs
,
1999 oload_method_static (method
, fns_ptr
,
2002 if (match_quality
== INCOMPATIBLE
)
2005 error ("Cannot resolve method %s%s%s to any overloaded instance",
2007 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2010 error ("Cannot resolve function %s to any overloaded instance",
2013 else if (match_quality
== NON_STANDARD
)
2016 warning ("Using non-standard conversion to match method %s%s%s to supplied arguments",
2018 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2021 warning ("Using non-standard conversion to match function %s to supplied arguments",
2027 if (staticp
!= NULL
)
2028 *staticp
= oload_method_static (method
, fns_ptr
, oload_champ
);
2029 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr
, oload_champ
))
2030 *valp
= value_virtual_fn_field (&temp
, fns_ptr
, oload_champ
, basetype
, boffset
);
2032 *valp
= value_fn_field (&temp
, fns_ptr
, oload_champ
, basetype
, boffset
);
2036 *symp
= oload_syms
[oload_champ
];
2041 if (TYPE_CODE (VALUE_TYPE (temp
)) != TYPE_CODE_PTR
2042 && TYPE_CODE (VALUE_TYPE (*objp
)) == TYPE_CODE_PTR
)
2044 temp
= value_addr (temp
);
2048 if (old_cleanups
!= NULL
)
2049 do_cleanups (old_cleanups
);
2051 switch (match_quality
)
2057 default: /* STANDARD */
2062 /* Find the best overload match, searching for FUNC_NAME in namespaces
2063 contained in QUALIFIED_NAME until it either finds a good match or
2064 runs out of namespaces. It stores the overloaded functions in
2065 *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. The
2066 calling function is responsible for freeing *OLOAD_SYMS and
2070 find_oload_champ_namespace (struct type
**arg_types
, int nargs
,
2071 const char *func_name
,
2072 const char *qualified_name
,
2073 struct symbol
***oload_syms
,
2074 struct badness_vector
**oload_champ_bv
)
2078 find_oload_champ_namespace_loop (arg_types
, nargs
,
2081 oload_syms
, oload_champ_bv
,
2087 /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is
2088 how deep we've looked for namespaces, and the champ is stored in
2089 OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0
2092 It is the caller's responsibility to free *OLOAD_SYMS and
2096 find_oload_champ_namespace_loop (struct type
**arg_types
, int nargs
,
2097 const char *func_name
,
2098 const char *qualified_name
,
2100 struct symbol
***oload_syms
,
2101 struct badness_vector
**oload_champ_bv
,
2104 int next_namespace_len
= namespace_len
;
2105 int searched_deeper
= 0;
2107 struct cleanup
*old_cleanups
;
2108 int new_oload_champ
;
2109 struct symbol
**new_oload_syms
;
2110 struct badness_vector
*new_oload_champ_bv
;
2111 char *new_namespace
;
2113 if (next_namespace_len
!= 0)
2115 gdb_assert (qualified_name
[next_namespace_len
] == ':');
2116 next_namespace_len
+= 2;
2119 += cp_find_first_component (qualified_name
+ next_namespace_len
);
2121 /* Initialize these to values that can safely be xfree'd. */
2123 *oload_champ_bv
= NULL
;
2125 /* First, see if we have a deeper namespace we can search in. If we
2126 get a good match there, use it. */
2128 if (qualified_name
[next_namespace_len
] == ':')
2130 searched_deeper
= 1;
2132 if (find_oload_champ_namespace_loop (arg_types
, nargs
,
2133 func_name
, qualified_name
,
2135 oload_syms
, oload_champ_bv
,
2142 /* If we reach here, either we're in the deepest namespace or we
2143 didn't find a good match in a deeper namespace. But, in the
2144 latter case, we still have a bad match in a deeper namespace;
2145 note that we might not find any match at all in the current
2146 namespace. (There's always a match in the deepest namespace,
2147 because this overload mechanism only gets called if there's a
2148 function symbol to start off with.) */
2150 old_cleanups
= make_cleanup (xfree
, *oload_syms
);
2151 old_cleanups
= make_cleanup (xfree
, *oload_champ_bv
);
2152 new_namespace
= alloca (namespace_len
+ 1);
2153 strncpy (new_namespace
, qualified_name
, namespace_len
);
2154 new_namespace
[namespace_len
] = '\0';
2155 new_oload_syms
= make_symbol_overload_list (func_name
,
2157 while (new_oload_syms
[num_fns
])
2160 new_oload_champ
= find_oload_champ (arg_types
, nargs
, 0, num_fns
,
2161 NULL
, new_oload_syms
,
2162 &new_oload_champ_bv
);
2164 /* Case 1: We found a good match. Free earlier matches (if any),
2165 and return it. Case 2: We didn't find a good match, but we're
2166 not the deepest function. Then go with the bad match that the
2167 deeper function found. Case 3: We found a bad match, and we're
2168 the deepest function. Then return what we found, even though
2169 it's a bad match. */
2171 if (new_oload_champ
!= -1
2172 && classify_oload_match (new_oload_champ_bv
, nargs
, 0) == STANDARD
)
2174 *oload_syms
= new_oload_syms
;
2175 *oload_champ
= new_oload_champ
;
2176 *oload_champ_bv
= new_oload_champ_bv
;
2177 do_cleanups (old_cleanups
);
2180 else if (searched_deeper
)
2182 xfree (new_oload_syms
);
2183 xfree (new_oload_champ_bv
);
2184 discard_cleanups (old_cleanups
);
2189 gdb_assert (new_oload_champ
!= -1);
2190 *oload_syms
= new_oload_syms
;
2191 *oload_champ
= new_oload_champ
;
2192 *oload_champ_bv
= new_oload_champ_bv
;
2193 discard_cleanups (old_cleanups
);
2198 /* Look for a function to take NARGS args of types ARG_TYPES. Find
2199 the best match from among the overloaded methods or functions
2200 (depending on METHOD) given by FNS_PTR or OLOAD_SYMS, respectively.
2201 The number of methods/functions in the list is given by NUM_FNS.
2202 Return the index of the best match; store an indication of the
2203 quality of the match in OLOAD_CHAMP_BV.
2205 It is the caller's responsibility to free *OLOAD_CHAMP_BV. */
2208 find_oload_champ (struct type
**arg_types
, int nargs
, int method
,
2209 int num_fns
, struct fn_field
*fns_ptr
,
2210 struct symbol
**oload_syms
,
2211 struct badness_vector
**oload_champ_bv
)
2214 struct badness_vector
*bv
; /* A measure of how good an overloaded instance is */
2215 int oload_champ
= -1; /* Index of best overloaded function */
2216 int oload_ambiguous
= 0; /* Current ambiguity state for overload resolution */
2217 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs */
2219 *oload_champ_bv
= NULL
;
2221 /* Consider each candidate in turn */
2222 for (ix
= 0; ix
< num_fns
; ix
++)
2225 int static_offset
= oload_method_static (method
, fns_ptr
, ix
);
2227 struct type
**parm_types
;
2231 nparms
= TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (fns_ptr
, ix
));
2235 /* If it's not a method, this is the proper place */
2236 nparms
=TYPE_NFIELDS(SYMBOL_TYPE(oload_syms
[ix
]));
2239 /* Prepare array of parameter types */
2240 parm_types
= (struct type
**) xmalloc (nparms
* (sizeof (struct type
*)));
2241 for (jj
= 0; jj
< nparms
; jj
++)
2242 parm_types
[jj
] = (method
2243 ? (TYPE_FN_FIELD_ARGS (fns_ptr
, ix
)[jj
].type
)
2244 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms
[ix
]), jj
));
2246 /* Compare parameter types to supplied argument types. Skip THIS for
2248 bv
= rank_function (parm_types
, nparms
, arg_types
+ static_offset
,
2249 nargs
- static_offset
);
2251 if (!*oload_champ_bv
)
2253 *oload_champ_bv
= bv
;
2257 /* See whether current candidate is better or worse than previous best */
2258 switch (compare_badness (bv
, *oload_champ_bv
))
2261 oload_ambiguous
= 1; /* top two contenders are equally good */
2264 oload_ambiguous
= 2; /* incomparable top contenders */
2267 *oload_champ_bv
= bv
; /* new champion, record details */
2268 oload_ambiguous
= 0;
2279 fprintf_filtered (gdb_stderr
,"Overloaded method instance %s, # of parms %d\n", fns_ptr
[ix
].physname
, nparms
);
2281 fprintf_filtered (gdb_stderr
,"Overloaded function instance %s # of parms %d\n", SYMBOL_DEMANGLED_NAME (oload_syms
[ix
]), nparms
);
2282 for (jj
= 0; jj
< nargs
- static_offset
; jj
++)
2283 fprintf_filtered (gdb_stderr
,"...Badness @ %d : %d\n", jj
, bv
->rank
[jj
]);
2284 fprintf_filtered (gdb_stderr
,"Overload resolution champion is %d, ambiguous? %d\n", oload_champ
, oload_ambiguous
);
2291 /* Return 1 if we're looking at a static method, 0 if we're looking at
2292 a non-static method or a function that isn't a method. */
2295 oload_method_static (int method
, struct fn_field
*fns_ptr
, int index
)
2297 if (method
&& TYPE_FN_FIELD_STATIC_P (fns_ptr
, index
))
2303 /* Check how good an overload match OLOAD_CHAMP_BV represents. */
2305 static enum oload_classification
2306 classify_oload_match (struct badness_vector
*oload_champ_bv
,
2312 for (ix
= 1; ix
<= nargs
- static_offset
; ix
++)
2314 if (oload_champ_bv
->rank
[ix
] >= 100)
2315 return INCOMPATIBLE
; /* truly mismatched types */
2316 else if (oload_champ_bv
->rank
[ix
] >= 10)
2317 return NON_STANDARD
; /* non-standard type conversions needed */
2320 return STANDARD
; /* Only standard conversions needed. */
2323 /* C++: return 1 is NAME is a legitimate name for the destructor
2324 of type TYPE. If TYPE does not have a destructor, or
2325 if NAME is inappropriate for TYPE, an error is signaled. */
2327 destructor_name_p (const char *name
, const struct type
*type
)
2329 /* destructors are a special case. */
2333 char *dname
= type_name_no_tag (type
);
2334 char *cp
= strchr (dname
, '<');
2337 /* Do not compare the template part for template classes. */
2339 len
= strlen (dname
);
2342 if (strlen (name
+ 1) != len
|| strncmp (dname
, name
+ 1, len
) != 0)
2343 error ("name of destructor must equal name of class");
2350 /* Helper function for check_field: Given TYPE, a structure/union,
2351 return 1 if the component named NAME from the ultimate
2352 target structure/union is defined, otherwise, return 0. */
2355 check_field_in (struct type
*type
, const char *name
)
2359 for (i
= TYPE_NFIELDS (type
) - 1; i
>= TYPE_N_BASECLASSES (type
); i
--)
2361 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
2362 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
2366 /* C++: If it was not found as a data field, then try to
2367 return it as a pointer to a method. */
2369 /* Destructors are a special case. */
2370 if (destructor_name_p (name
, type
))
2372 int m_index
, f_index
;
2374 return get_destructor_fn_field (type
, &m_index
, &f_index
);
2377 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; --i
)
2379 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type
, i
), name
) == 0)
2383 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2384 if (check_field_in (TYPE_BASECLASS (type
, i
), name
))
2391 /* C++: Given ARG1, a value of type (pointer to a)* structure/union,
2392 return 1 if the component named NAME from the ultimate
2393 target structure/union is defined, otherwise, return 0. */
2396 check_field (struct value
*arg1
, const char *name
)
2400 COERCE_ARRAY (arg1
);
2402 t
= VALUE_TYPE (arg1
);
2404 /* Follow pointers until we get to a non-pointer. */
2409 if (TYPE_CODE (t
) != TYPE_CODE_PTR
&& TYPE_CODE (t
) != TYPE_CODE_REF
)
2411 t
= TYPE_TARGET_TYPE (t
);
2414 if (TYPE_CODE (t
) == TYPE_CODE_MEMBER
)
2415 error ("not implemented: member type in check_field");
2417 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2418 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2419 error ("Internal error: `this' is not an aggregate");
2421 return check_field_in (t
, name
);
2424 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
2425 return the appropriate member. This function is used to resolve
2426 user expressions of the form "DOMAIN::NAME". For more details on
2427 what happens, see the comment before
2428 value_struct_elt_for_reference. */
2431 value_aggregate_elt (struct type
*curtype
,
2435 switch (TYPE_CODE (curtype
))
2437 case TYPE_CODE_STRUCT
:
2438 case TYPE_CODE_UNION
:
2439 return value_struct_elt_for_reference (curtype
, 0, curtype
, name
, NULL
,
2441 case TYPE_CODE_NAMESPACE
:
2442 return value_namespace_elt (curtype
, name
, noside
);
2444 internal_error (__FILE__
, __LINE__
,
2445 "non-aggregate type in value_aggregate_elt");
2449 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
2450 return the address of this member as a "pointer to member"
2451 type. If INTYPE is non-null, then it will be the type
2452 of the member we are looking for. This will help us resolve
2453 "pointers to member functions". This function is used
2454 to resolve user expressions of the form "DOMAIN::NAME". */
2456 static struct value
*
2457 value_struct_elt_for_reference (struct type
*domain
, int offset
,
2458 struct type
*curtype
, char *name
,
2459 struct type
*intype
,
2462 struct type
*t
= curtype
;
2466 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2467 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2468 error ("Internal error: non-aggregate type to value_struct_elt_for_reference");
2470 for (i
= TYPE_NFIELDS (t
) - 1; i
>= TYPE_N_BASECLASSES (t
); i
--)
2472 char *t_field_name
= TYPE_FIELD_NAME (t
, i
);
2474 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
2476 if (TYPE_FIELD_STATIC (t
, i
))
2478 v
= value_static_field (t
, i
);
2480 error ("static field %s has been optimized out",
2484 if (TYPE_FIELD_PACKED (t
, i
))
2485 error ("pointers to bitfield members not allowed");
2487 return value_from_longest
2488 (lookup_reference_type (lookup_member_type (TYPE_FIELD_TYPE (t
, i
),
2490 offset
+ (LONGEST
) (TYPE_FIELD_BITPOS (t
, i
) >> 3));
2494 /* C++: If it was not found as a data field, then try to
2495 return it as a pointer to a method. */
2497 /* Destructors are a special case. */
2498 if (destructor_name_p (name
, t
))
2500 error ("member pointers to destructors not implemented yet");
2503 /* Perform all necessary dereferencing. */
2504 while (intype
&& TYPE_CODE (intype
) == TYPE_CODE_PTR
)
2505 intype
= TYPE_TARGET_TYPE (intype
);
2507 for (i
= TYPE_NFN_FIELDS (t
) - 1; i
>= 0; --i
)
2509 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (t
, i
);
2510 char dem_opname
[64];
2512 if (strncmp (t_field_name
, "__", 2) == 0 ||
2513 strncmp (t_field_name
, "op", 2) == 0 ||
2514 strncmp (t_field_name
, "type", 4) == 0)
2516 if (cplus_demangle_opname (t_field_name
, dem_opname
, DMGL_ANSI
))
2517 t_field_name
= dem_opname
;
2518 else if (cplus_demangle_opname (t_field_name
, dem_opname
, 0))
2519 t_field_name
= dem_opname
;
2521 if (t_field_name
&& strcmp (t_field_name
, name
) == 0)
2523 int j
= TYPE_FN_FIELDLIST_LENGTH (t
, i
);
2524 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (t
, i
);
2526 check_stub_method_group (t
, i
);
2528 if (intype
== 0 && j
> 1)
2529 error ("non-unique member `%s' requires type instantiation", name
);
2533 if (TYPE_FN_FIELD_TYPE (f
, j
) == intype
)
2536 error ("no member function matches that type instantiation");
2541 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
2543 return value_from_longest
2544 (lookup_reference_type
2545 (lookup_member_type (TYPE_FN_FIELD_TYPE (f
, j
),
2547 (LONGEST
) METHOD_PTR_FROM_VOFFSET (TYPE_FN_FIELD_VOFFSET (f
, j
)));
2551 struct symbol
*s
= lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
2552 0, VAR_DOMAIN
, 0, NULL
);
2559 v
= read_var_value (s
, 0);
2561 VALUE_TYPE (v
) = lookup_reference_type
2562 (lookup_member_type (TYPE_FN_FIELD_TYPE (f
, j
),
2570 for (i
= TYPE_N_BASECLASSES (t
) - 1; i
>= 0; i
--)
2575 if (BASETYPE_VIA_VIRTUAL (t
, i
))
2578 base_offset
= TYPE_BASECLASS_BITPOS (t
, i
) / 8;
2579 v
= value_struct_elt_for_reference (domain
,
2580 offset
+ base_offset
,
2581 TYPE_BASECLASS (t
, i
),
2589 /* As a last chance, pretend that CURTYPE is a namespace, and look
2590 it up that way; this (frequently) works for types nested inside
2593 return value_maybe_namespace_elt (curtype
, name
, noside
);
2596 /* C++: Return the member NAME of the namespace given by the type
2599 static struct value
*
2600 value_namespace_elt (const struct type
*curtype
,
2604 struct value
*retval
= value_maybe_namespace_elt (curtype
, name
,
2608 error ("No symbol \"%s\" in namespace \"%s\".", name
,
2609 TYPE_TAG_NAME (curtype
));
2614 /* A helper function used by value_namespace_elt and
2615 value_struct_elt_for_reference. It looks up NAME inside the
2616 context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE
2617 is a class and NAME refers to a type in CURTYPE itself (as opposed
2618 to, say, some base class of CURTYPE). */
2620 static struct value
*
2621 value_maybe_namespace_elt (const struct type
*curtype
,
2625 const char *namespace_name
= TYPE_TAG_NAME (curtype
);
2628 sym
= cp_lookup_symbol_namespace (namespace_name
, name
, NULL
,
2629 get_selected_block (0), VAR_DOMAIN
,
2634 else if ((noside
== EVAL_AVOID_SIDE_EFFECTS
)
2635 && (SYMBOL_CLASS (sym
) == LOC_TYPEDEF
))
2636 return allocate_value (SYMBOL_TYPE (sym
));
2638 return value_of_variable (sym
, get_selected_block (0));
2641 /* Given a pointer value V, find the real (RTTI) type
2642 of the object it points to.
2643 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
2644 and refer to the values computed for the object pointed to. */
2647 value_rtti_target_type (struct value
*v
, int *full
, int *top
, int *using_enc
)
2649 struct value
*target
;
2651 target
= value_ind (v
);
2653 return value_rtti_type (target
, full
, top
, using_enc
);
2656 /* Given a value pointed to by ARGP, check its real run-time type, and
2657 if that is different from the enclosing type, create a new value
2658 using the real run-time type as the enclosing type (and of the same
2659 type as ARGP) and return it, with the embedded offset adjusted to
2660 be the correct offset to the enclosed object
2661 RTYPE is the type, and XFULL, XTOP, and XUSING_ENC are the other
2662 parameters, computed by value_rtti_type(). If these are available,
2663 they can be supplied and a second call to value_rtti_type() is avoided.
2664 (Pass RTYPE == NULL if they're not available */
2667 value_full_object (struct value
*argp
, struct type
*rtype
, int xfull
, int xtop
,
2670 struct type
*real_type
;
2674 struct value
*new_val
;
2681 using_enc
= xusing_enc
;
2684 real_type
= value_rtti_type (argp
, &full
, &top
, &using_enc
);
2686 /* If no RTTI data, or if object is already complete, do nothing */
2687 if (!real_type
|| real_type
== VALUE_ENCLOSING_TYPE (argp
))
2690 /* If we have the full object, but for some reason the enclosing
2691 type is wrong, set it *//* pai: FIXME -- sounds iffy */
2694 argp
= value_change_enclosing_type (argp
, real_type
);
2698 /* Check if object is in memory */
2699 if (VALUE_LVAL (argp
) != lval_memory
)
2701 warning ("Couldn't retrieve complete object of RTTI type %s; object may be in register(s).", TYPE_NAME (real_type
));
2706 /* All other cases -- retrieve the complete object */
2707 /* Go back by the computed top_offset from the beginning of the object,
2708 adjusting for the embedded offset of argp if that's what value_rtti_type
2709 used for its computation. */
2710 new_val
= value_at_lazy (real_type
, VALUE_ADDRESS (argp
) - top
+
2711 (using_enc
? 0 : VALUE_EMBEDDED_OFFSET (argp
)),
2712 VALUE_BFD_SECTION (argp
));
2713 VALUE_TYPE (new_val
) = VALUE_TYPE (argp
);
2714 VALUE_EMBEDDED_OFFSET (new_val
) = using_enc
? top
+ VALUE_EMBEDDED_OFFSET (argp
) : top
;
2721 /* Return the value of the local variable, if one exists.
2722 Flag COMPLAIN signals an error if the request is made in an
2723 inappropriate context. */
2726 value_of_local (const char *name
, int complain
)
2728 struct symbol
*func
, *sym
;
2732 if (deprecated_selected_frame
== 0)
2735 error ("no frame selected");
2740 func
= get_frame_function (deprecated_selected_frame
);
2744 error ("no `%s' in nameless context", name
);
2749 b
= SYMBOL_BLOCK_VALUE (func
);
2750 if (dict_empty (BLOCK_DICT (b
)))
2753 error ("no args, no `%s'", name
);
2758 /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER
2759 symbol instead of the LOC_ARG one (if both exist). */
2760 sym
= lookup_block_symbol (b
, name
, NULL
, VAR_DOMAIN
);
2764 error ("current stack frame does not contain a variable named `%s'", name
);
2769 ret
= read_var_value (sym
, deprecated_selected_frame
);
2770 if (ret
== 0 && complain
)
2771 error ("`%s' argument unreadable", name
);
2775 /* C++/Objective-C: return the value of the class instance variable,
2776 if one exists. Flag COMPLAIN signals an error if the request is
2777 made in an inappropriate context. */
2780 value_of_this (int complain
)
2782 if (current_language
->la_language
== language_objc
)
2783 return value_of_local ("self", complain
);
2785 return value_of_local ("this", complain
);
2788 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH elements
2789 long, starting at LOWBOUND. The result has the same lower bound as
2790 the original ARRAY. */
2793 value_slice (struct value
*array
, int lowbound
, int length
)
2795 struct type
*slice_range_type
, *slice_type
, *range_type
;
2796 LONGEST lowerbound
, upperbound
;
2797 struct value
*slice
;
2798 struct type
*array_type
;
2799 array_type
= check_typedef (VALUE_TYPE (array
));
2800 COERCE_VARYING_ARRAY (array
, array_type
);
2801 if (TYPE_CODE (array_type
) != TYPE_CODE_ARRAY
2802 && TYPE_CODE (array_type
) != TYPE_CODE_STRING
2803 && TYPE_CODE (array_type
) != TYPE_CODE_BITSTRING
)
2804 error ("cannot take slice of non-array");
2805 range_type
= TYPE_INDEX_TYPE (array_type
);
2806 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2807 error ("slice from bad array or bitstring");
2808 if (lowbound
< lowerbound
|| length
< 0
2809 || lowbound
+ length
- 1 > upperbound
)
2810 error ("slice out of range");
2811 /* FIXME-type-allocation: need a way to free this type when we are
2813 slice_range_type
= create_range_type ((struct type
*) NULL
,
2814 TYPE_TARGET_TYPE (range_type
),
2815 lowbound
, lowbound
+ length
- 1);
2816 if (TYPE_CODE (array_type
) == TYPE_CODE_BITSTRING
)
2819 slice_type
= create_set_type ((struct type
*) NULL
, slice_range_type
);
2820 TYPE_CODE (slice_type
) = TYPE_CODE_BITSTRING
;
2821 slice
= value_zero (slice_type
, not_lval
);
2822 for (i
= 0; i
< length
; i
++)
2824 int element
= value_bit_index (array_type
,
2825 VALUE_CONTENTS (array
),
2828 error ("internal error accessing bitstring");
2829 else if (element
> 0)
2831 int j
= i
% TARGET_CHAR_BIT
;
2832 if (BITS_BIG_ENDIAN
)
2833 j
= TARGET_CHAR_BIT
- 1 - j
;
2834 VALUE_CONTENTS_RAW (slice
)[i
/ TARGET_CHAR_BIT
] |= (1 << j
);
2837 /* We should set the address, bitssize, and bitspos, so the clice
2838 can be used on the LHS, but that may require extensions to
2839 value_assign. For now, just leave as a non_lval. FIXME. */
2843 struct type
*element_type
= TYPE_TARGET_TYPE (array_type
);
2845 = (lowbound
- lowerbound
) * TYPE_LENGTH (check_typedef (element_type
));
2846 slice_type
= create_array_type ((struct type
*) NULL
, element_type
,
2848 TYPE_CODE (slice_type
) = TYPE_CODE (array_type
);
2849 slice
= allocate_value (slice_type
);
2850 if (VALUE_LAZY (array
))
2851 VALUE_LAZY (slice
) = 1;
2853 memcpy (VALUE_CONTENTS (slice
), VALUE_CONTENTS (array
) + offset
,
2854 TYPE_LENGTH (slice_type
));
2855 if (VALUE_LVAL (array
) == lval_internalvar
)
2856 VALUE_LVAL (slice
) = lval_internalvar_component
;
2858 VALUE_LVAL (slice
) = VALUE_LVAL (array
);
2859 VALUE_ADDRESS (slice
) = VALUE_ADDRESS (array
);
2860 VALUE_OFFSET (slice
) = VALUE_OFFSET (array
) + offset
;
2865 /* Create a value for a FORTRAN complex number. Currently most of
2866 the time values are coerced to COMPLEX*16 (i.e. a complex number
2867 composed of 2 doubles. This really should be a smarter routine
2868 that figures out precision inteligently as opposed to assuming
2869 doubles. FIXME: fmb */
2872 value_literal_complex (struct value
*arg1
, struct value
*arg2
, struct type
*type
)
2875 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
2877 val
= allocate_value (type
);
2878 arg1
= value_cast (real_type
, arg1
);
2879 arg2
= value_cast (real_type
, arg2
);
2881 memcpy (VALUE_CONTENTS_RAW (val
),
2882 VALUE_CONTENTS (arg1
), TYPE_LENGTH (real_type
));
2883 memcpy (VALUE_CONTENTS_RAW (val
) + TYPE_LENGTH (real_type
),
2884 VALUE_CONTENTS (arg2
), TYPE_LENGTH (real_type
));
2888 /* Cast a value into the appropriate complex data type. */
2890 static struct value
*
2891 cast_into_complex (struct type
*type
, struct value
*val
)
2893 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
2894 if (TYPE_CODE (VALUE_TYPE (val
)) == TYPE_CODE_COMPLEX
)
2896 struct type
*val_real_type
= TYPE_TARGET_TYPE (VALUE_TYPE (val
));
2897 struct value
*re_val
= allocate_value (val_real_type
);
2898 struct value
*im_val
= allocate_value (val_real_type
);
2900 memcpy (VALUE_CONTENTS_RAW (re_val
),
2901 VALUE_CONTENTS (val
), TYPE_LENGTH (val_real_type
));
2902 memcpy (VALUE_CONTENTS_RAW (im_val
),
2903 VALUE_CONTENTS (val
) + TYPE_LENGTH (val_real_type
),
2904 TYPE_LENGTH (val_real_type
));
2906 return value_literal_complex (re_val
, im_val
, type
);
2908 else if (TYPE_CODE (VALUE_TYPE (val
)) == TYPE_CODE_FLT
2909 || TYPE_CODE (VALUE_TYPE (val
)) == TYPE_CODE_INT
)
2910 return value_literal_complex (val
, value_zero (real_type
, not_lval
), type
);
2912 error ("cannot cast non-number to complex");
2916 _initialize_valops (void)
2920 (add_set_cmd ("abandon", class_support
, var_boolean
, (char *) &auto_abandon
,
2921 "Set automatic abandonment of expressions upon failure.",
2927 (add_set_cmd ("overload-resolution", class_support
, var_boolean
, (char *) &overload_resolution
,
2928 "Set overload resolution in evaluating C++ functions.",
2931 overload_resolution
= 1;