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
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 "gdb_string.h"
39 #include "gdb_assert.h"
41 /* Flag indicating HP compilers were used; needed to correctly handle some
42 value operations with HP aCC code/runtime. */
43 extern int hp_som_som_object_present
;
45 extern int overload_debug
;
46 /* Local functions. */
48 static int typecmp (int staticp
, int varargs
, int nargs
,
49 struct field t1
[], struct value
*t2
[]);
51 static struct value
*value_arg_coerce (struct value
*, struct type
*, int);
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 check_field_in (struct type
*, const char *);
64 static CORE_ADDR
allocate_space_in_inferior (int);
66 static struct value
*cast_into_complex (struct type
*, struct value
*);
68 static struct fn_field
*find_method_list (struct value
** argp
, char *method
,
70 struct type
*type
, int *num_fns
,
71 struct type
**basetype
,
74 void _initialize_valops (void);
76 /* Flag for whether we want to abandon failed expression evals by default. */
79 static int auto_abandon
= 0;
82 int overload_resolution
= 0;
84 /* This boolean tells what gdb should do if a signal is received while in
85 a function called from gdb (call dummy). If set, gdb unwinds the stack
86 and restore the context to what as it was before the call.
87 The default is to stop in the frame where the signal was received. */
89 int unwind_on_signal_p
= 0;
92 /* Find the address of function name NAME in the inferior. */
95 find_function_in_inferior (const char *name
)
97 register struct symbol
*sym
;
98 sym
= lookup_symbol (name
, 0, VAR_NAMESPACE
, 0, NULL
);
101 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
103 error ("\"%s\" exists in this program but is not a function.",
106 return value_of_variable (sym
, NULL
);
110 struct minimal_symbol
*msymbol
= lookup_minimal_symbol (name
, NULL
, NULL
);
115 type
= lookup_pointer_type (builtin_type_char
);
116 type
= lookup_function_type (type
);
117 type
= lookup_pointer_type (type
);
118 maddr
= SYMBOL_VALUE_ADDRESS (msymbol
);
119 return value_from_pointer (type
, maddr
);
123 if (!target_has_execution
)
124 error ("evaluation of this expression requires the target program to be active");
126 error ("evaluation of this expression requires the program to have a function \"%s\".", name
);
131 /* Allocate NBYTES of space in the inferior using the inferior's malloc
132 and return a value that is a pointer to the allocated space. */
135 value_allocate_space_in_inferior (int len
)
137 struct value
*blocklen
;
138 struct value
*val
= find_function_in_inferior (NAME_OF_MALLOC
);
140 blocklen
= value_from_longest (builtin_type_int
, (LONGEST
) len
);
141 val
= call_function_by_hand (val
, 1, &blocklen
);
142 if (value_logical_not (val
))
144 if (!target_has_execution
)
145 error ("No memory available to program now: you need to start the target first");
147 error ("No memory available to program: call to malloc failed");
153 allocate_space_in_inferior (int len
)
155 return value_as_long (value_allocate_space_in_inferior (len
));
158 /* Cast value ARG2 to type TYPE and return as a value.
159 More general than a C cast: accepts any two types of the same length,
160 and if ARG2 is an lvalue it can be cast into anything at all. */
161 /* In C++, casts may change pointer or object representations. */
164 value_cast (struct type
*type
, struct value
*arg2
)
166 register enum type_code code1
;
167 register enum type_code code2
;
171 int convert_to_boolean
= 0;
173 if (VALUE_TYPE (arg2
) == type
)
176 CHECK_TYPEDEF (type
);
177 code1
= TYPE_CODE (type
);
179 type2
= check_typedef (VALUE_TYPE (arg2
));
181 /* A cast to an undetermined-length array_type, such as (TYPE [])OBJECT,
182 is treated like a cast to (TYPE [N])OBJECT,
183 where N is sizeof(OBJECT)/sizeof(TYPE). */
184 if (code1
== TYPE_CODE_ARRAY
)
186 struct type
*element_type
= TYPE_TARGET_TYPE (type
);
187 unsigned element_length
= TYPE_LENGTH (check_typedef (element_type
));
188 if (element_length
> 0
189 && TYPE_ARRAY_UPPER_BOUND_TYPE (type
) == BOUND_CANNOT_BE_DETERMINED
)
191 struct type
*range_type
= TYPE_INDEX_TYPE (type
);
192 int val_length
= TYPE_LENGTH (type2
);
193 LONGEST low_bound
, high_bound
, new_length
;
194 if (get_discrete_bounds (range_type
, &low_bound
, &high_bound
) < 0)
195 low_bound
= 0, high_bound
= 0;
196 new_length
= val_length
/ element_length
;
197 if (val_length
% element_length
!= 0)
198 warning ("array element type size does not divide object size in cast");
199 /* FIXME-type-allocation: need a way to free this type when we are
201 range_type
= create_range_type ((struct type
*) NULL
,
202 TYPE_TARGET_TYPE (range_type
),
204 new_length
+ low_bound
- 1);
205 VALUE_TYPE (arg2
) = create_array_type ((struct type
*) NULL
,
206 element_type
, range_type
);
211 if (current_language
->c_style_arrays
212 && TYPE_CODE (type2
) == TYPE_CODE_ARRAY
)
213 arg2
= value_coerce_array (arg2
);
215 if (TYPE_CODE (type2
) == TYPE_CODE_FUNC
)
216 arg2
= value_coerce_function (arg2
);
218 type2
= check_typedef (VALUE_TYPE (arg2
));
219 COERCE_VARYING_ARRAY (arg2
, type2
);
220 code2
= TYPE_CODE (type2
);
222 if (code1
== TYPE_CODE_COMPLEX
)
223 return cast_into_complex (type
, arg2
);
224 if (code1
== TYPE_CODE_BOOL
)
226 code1
= TYPE_CODE_INT
;
227 convert_to_boolean
= 1;
229 if (code1
== TYPE_CODE_CHAR
)
230 code1
= TYPE_CODE_INT
;
231 if (code2
== TYPE_CODE_BOOL
|| code2
== TYPE_CODE_CHAR
)
232 code2
= TYPE_CODE_INT
;
234 scalar
= (code2
== TYPE_CODE_INT
|| code2
== TYPE_CODE_FLT
235 || code2
== TYPE_CODE_ENUM
|| code2
== TYPE_CODE_RANGE
);
237 if (code1
== TYPE_CODE_STRUCT
238 && code2
== TYPE_CODE_STRUCT
239 && TYPE_NAME (type
) != 0)
241 /* Look in the type of the source to see if it contains the
242 type of the target as a superclass. If so, we'll need to
243 offset the object in addition to changing its type. */
244 struct value
*v
= search_struct_field (type_name_no_tag (type
),
248 VALUE_TYPE (v
) = type
;
252 if (code1
== TYPE_CODE_FLT
&& scalar
)
253 return value_from_double (type
, value_as_double (arg2
));
254 else if ((code1
== TYPE_CODE_INT
|| code1
== TYPE_CODE_ENUM
255 || code1
== TYPE_CODE_RANGE
)
256 && (scalar
|| code2
== TYPE_CODE_PTR
))
260 if (hp_som_som_object_present
&& /* if target compiled by HP aCC */
261 (code2
== TYPE_CODE_PTR
))
264 struct value
*retvalp
;
266 switch (TYPE_CODE (TYPE_TARGET_TYPE (type2
)))
268 /* With HP aCC, pointers to data members have a bias */
269 case TYPE_CODE_MEMBER
:
270 retvalp
= value_from_longest (type
, value_as_long (arg2
));
271 /* force evaluation */
272 ptr
= (unsigned int *) VALUE_CONTENTS (retvalp
);
273 *ptr
&= ~0x20000000; /* zap 29th bit to remove bias */
276 /* While pointers to methods don't really point to a function */
277 case TYPE_CODE_METHOD
:
278 error ("Pointers to methods not supported with HP aCC");
281 break; /* fall out and go to normal handling */
285 /* When we cast pointers to integers, we mustn't use
286 POINTER_TO_ADDRESS to find the address the pointer
287 represents, as value_as_long would. GDB should evaluate
288 expressions just as the compiler would --- and the compiler
289 sees a cast as a simple reinterpretation of the pointer's
291 if (code2
== TYPE_CODE_PTR
)
292 longest
= extract_unsigned_integer (VALUE_CONTENTS (arg2
),
293 TYPE_LENGTH (type2
));
295 longest
= value_as_long (arg2
);
296 return value_from_longest (type
, convert_to_boolean
?
297 (LONGEST
) (longest
? 1 : 0) : longest
);
299 else if (code1
== TYPE_CODE_PTR
&& (code2
== TYPE_CODE_INT
||
300 code2
== TYPE_CODE_ENUM
||
301 code2
== TYPE_CODE_RANGE
))
303 /* TYPE_LENGTH (type) is the length of a pointer, but we really
304 want the length of an address! -- we are really dealing with
305 addresses (i.e., gdb representations) not pointers (i.e.,
306 target representations) here.
308 This allows things like "print *(int *)0x01000234" to work
309 without printing a misleading message -- which would
310 otherwise occur when dealing with a target having two byte
311 pointers and four byte addresses. */
313 int addr_bit
= TARGET_ADDR_BIT
;
315 LONGEST longest
= value_as_long (arg2
);
316 if (addr_bit
< sizeof (LONGEST
) * HOST_CHAR_BIT
)
318 if (longest
>= ((LONGEST
) 1 << addr_bit
)
319 || longest
<= -((LONGEST
) 1 << addr_bit
))
320 warning ("value truncated");
322 return value_from_longest (type
, longest
);
324 else if (TYPE_LENGTH (type
) == TYPE_LENGTH (type2
))
326 if (code1
== TYPE_CODE_PTR
&& code2
== TYPE_CODE_PTR
)
328 struct type
*t1
= check_typedef (TYPE_TARGET_TYPE (type
));
329 struct type
*t2
= check_typedef (TYPE_TARGET_TYPE (type2
));
330 if (TYPE_CODE (t1
) == TYPE_CODE_STRUCT
331 && TYPE_CODE (t2
) == TYPE_CODE_STRUCT
332 && !value_logical_not (arg2
))
336 /* Look in the type of the source to see if it contains the
337 type of the target as a superclass. If so, we'll need to
338 offset the pointer rather than just change its type. */
339 if (TYPE_NAME (t1
) != NULL
)
341 v
= search_struct_field (type_name_no_tag (t1
),
342 value_ind (arg2
), 0, t2
, 1);
346 VALUE_TYPE (v
) = type
;
351 /* Look in the type of the target to see if it contains the
352 type of the source as a superclass. If so, we'll need to
353 offset the pointer rather than just change its type.
354 FIXME: This fails silently with virtual inheritance. */
355 if (TYPE_NAME (t2
) != NULL
)
357 v
= search_struct_field (type_name_no_tag (t2
),
358 value_zero (t1
, not_lval
), 0, t1
, 1);
361 CORE_ADDR addr2
= value_as_address (arg2
);
362 addr2
-= (VALUE_ADDRESS (v
)
364 + VALUE_EMBEDDED_OFFSET (v
));
365 return value_from_pointer (type
, addr2
);
369 /* No superclass found, just fall through to change ptr type. */
371 VALUE_TYPE (arg2
) = type
;
372 arg2
= value_change_enclosing_type (arg2
, type
);
373 VALUE_POINTED_TO_OFFSET (arg2
) = 0; /* pai: chk_val */
376 /* OBSOLETE else if (chill_varying_type (type)) */
378 /* OBSOLETE struct type *range1, *range2, *eltype1, *eltype2; */
379 /* OBSOLETE struct value *val; */
380 /* OBSOLETE int count1, count2; */
381 /* OBSOLETE LONGEST low_bound, high_bound; */
382 /* OBSOLETE char *valaddr, *valaddr_data; */
383 /* OBSOLETE *//* For lint warning about eltype2 possibly uninitialized: */
384 /* OBSOLETE eltype2 = NULL; */
385 /* OBSOLETE if (code2 == TYPE_CODE_BITSTRING) */
386 /* OBSOLETE error ("not implemented: converting bitstring to varying type"); */
387 /* OBSOLETE if ((code2 != TYPE_CODE_ARRAY && code2 != TYPE_CODE_STRING) */
388 /* OBSOLETE || (eltype1 = check_typedef (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, 1))), */
389 /* OBSOLETE eltype2 = check_typedef (TYPE_TARGET_TYPE (type2)), */
390 /* OBSOLETE (TYPE_LENGTH (eltype1) != TYPE_LENGTH (eltype2) */
391 /* OBSOLETE *//*|| TYPE_CODE (eltype1) != TYPE_CODE (eltype2) *//* ))) */
392 /* OBSOLETE error ("Invalid conversion to varying type"); */
393 /* OBSOLETE range1 = TYPE_FIELD_TYPE (TYPE_FIELD_TYPE (type, 1), 0); */
394 /* OBSOLETE range2 = TYPE_FIELD_TYPE (type2, 0); */
395 /* OBSOLETE if (get_discrete_bounds (range1, &low_bound, &high_bound) < 0) */
396 /* OBSOLETE count1 = -1; */
398 /* OBSOLETE count1 = high_bound - low_bound + 1; */
399 /* OBSOLETE if (get_discrete_bounds (range2, &low_bound, &high_bound) < 0) */
400 /* OBSOLETE count1 = -1, count2 = 0; *//* To force error before */
402 /* OBSOLETE count2 = high_bound - low_bound + 1; */
403 /* OBSOLETE if (count2 > count1) */
404 /* OBSOLETE error ("target varying type is too small"); */
405 /* OBSOLETE val = allocate_value (type); */
406 /* OBSOLETE valaddr = VALUE_CONTENTS_RAW (val); */
407 /* OBSOLETE valaddr_data = valaddr + TYPE_FIELD_BITPOS (type, 1) / 8; */
408 /* OBSOLETE *//* Set val's __var_length field to count2. */
409 /* OBSOLETE store_signed_integer (valaddr, TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0)), */
410 /* OBSOLETE count2); */
411 /* OBSOLETE *//* Set the __var_data field to count2 elements copied from arg2. */
412 /* OBSOLETE memcpy (valaddr_data, VALUE_CONTENTS (arg2), */
413 /* OBSOLETE count2 * TYPE_LENGTH (eltype2)); */
414 /* OBSOLETE *//* Zero the rest of the __var_data field of val. */
415 /* OBSOLETE memset (valaddr_data + count2 * TYPE_LENGTH (eltype2), '\0', */
416 /* OBSOLETE (count1 - count2) * TYPE_LENGTH (eltype2)); */
417 /* OBSOLETE return val; */
419 else if (VALUE_LVAL (arg2
) == lval_memory
)
421 return value_at_lazy (type
, VALUE_ADDRESS (arg2
) + VALUE_OFFSET (arg2
),
422 VALUE_BFD_SECTION (arg2
));
424 else if (code1
== TYPE_CODE_VOID
)
426 return value_zero (builtin_type_void
, not_lval
);
430 error ("Invalid cast.");
435 /* Create a value of type TYPE that is zero, and return it. */
438 value_zero (struct type
*type
, enum lval_type lv
)
440 struct value
*val
= allocate_value (type
);
442 memset (VALUE_CONTENTS (val
), 0, TYPE_LENGTH (check_typedef (type
)));
443 VALUE_LVAL (val
) = lv
;
448 /* Return a value with type TYPE located at ADDR.
450 Call value_at only if the data needs to be fetched immediately;
451 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
452 value_at_lazy instead. value_at_lazy simply records the address of
453 the data and sets the lazy-evaluation-required flag. The lazy flag
454 is tested in the VALUE_CONTENTS macro, which is used if and when
455 the contents are actually required.
457 Note: value_at does *NOT* handle embedded offsets; perform such
458 adjustments before or after calling it. */
461 value_at (struct type
*type
, CORE_ADDR addr
, asection
*sect
)
465 if (TYPE_CODE (check_typedef (type
)) == TYPE_CODE_VOID
)
466 error ("Attempt to dereference a generic pointer.");
468 val
= allocate_value (type
);
470 read_memory (addr
, VALUE_CONTENTS_ALL_RAW (val
), TYPE_LENGTH (type
));
472 VALUE_LVAL (val
) = lval_memory
;
473 VALUE_ADDRESS (val
) = addr
;
474 VALUE_BFD_SECTION (val
) = sect
;
479 /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
482 value_at_lazy (struct type
*type
, CORE_ADDR addr
, asection
*sect
)
486 if (TYPE_CODE (check_typedef (type
)) == TYPE_CODE_VOID
)
487 error ("Attempt to dereference a generic pointer.");
489 val
= allocate_value (type
);
491 VALUE_LVAL (val
) = lval_memory
;
492 VALUE_ADDRESS (val
) = addr
;
493 VALUE_LAZY (val
) = 1;
494 VALUE_BFD_SECTION (val
) = sect
;
499 /* Called only from the VALUE_CONTENTS and VALUE_CONTENTS_ALL macros,
500 if the current data for a variable needs to be loaded into
501 VALUE_CONTENTS(VAL). Fetches the data from the user's process, and
502 clears the lazy flag to indicate that the data in the buffer is valid.
504 If the value is zero-length, we avoid calling read_memory, which would
505 abort. We mark the value as fetched anyway -- all 0 bytes of it.
507 This function returns a value because it is used in the VALUE_CONTENTS
508 macro as part of an expression, where a void would not work. The
512 value_fetch_lazy (struct value
*val
)
514 CORE_ADDR addr
= VALUE_ADDRESS (val
) + VALUE_OFFSET (val
);
515 int length
= TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val
));
517 struct type
*type
= VALUE_TYPE (val
);
519 read_memory (addr
, VALUE_CONTENTS_ALL_RAW (val
), length
);
521 VALUE_LAZY (val
) = 0;
526 /* Store the contents of FROMVAL into the location of TOVAL.
527 Return a new value with the location of TOVAL and contents of FROMVAL. */
530 value_assign (struct value
*toval
, struct value
*fromval
)
532 register struct type
*type
;
534 char *raw_buffer
= (char*) alloca (MAX_REGISTER_RAW_SIZE
);
537 if (!toval
->modifiable
)
538 error ("Left operand of assignment is not a modifiable lvalue.");
542 type
= VALUE_TYPE (toval
);
543 if (VALUE_LVAL (toval
) != lval_internalvar
)
544 fromval
= value_cast (type
, fromval
);
546 COERCE_ARRAY (fromval
);
547 CHECK_TYPEDEF (type
);
549 /* If TOVAL is a special machine register requiring conversion
550 of program values to a special raw format,
551 convert FROMVAL's contents now, with result in `raw_buffer',
552 and set USE_BUFFER to the number of bytes to write. */
554 if (VALUE_REGNO (toval
) >= 0)
556 int regno
= VALUE_REGNO (toval
);
557 if (CONVERT_REGISTER_P (regno
))
559 struct type
*fromtype
= check_typedef (VALUE_TYPE (fromval
));
560 VALUE_TO_REGISTER (fromtype
, regno
, VALUE_CONTENTS (fromval
), raw_buffer
);
561 use_buffer
= REGISTER_RAW_SIZE (regno
);
565 switch (VALUE_LVAL (toval
))
567 case lval_internalvar
:
568 set_internalvar (VALUE_INTERNALVAR (toval
), fromval
);
569 val
= value_copy (VALUE_INTERNALVAR (toval
)->value
);
570 val
= value_change_enclosing_type (val
, VALUE_ENCLOSING_TYPE (fromval
));
571 VALUE_EMBEDDED_OFFSET (val
) = VALUE_EMBEDDED_OFFSET (fromval
);
572 VALUE_POINTED_TO_OFFSET (val
) = VALUE_POINTED_TO_OFFSET (fromval
);
575 case lval_internalvar_component
:
576 set_internalvar_component (VALUE_INTERNALVAR (toval
),
577 VALUE_OFFSET (toval
),
578 VALUE_BITPOS (toval
),
579 VALUE_BITSIZE (toval
),
586 CORE_ADDR changed_addr
;
589 if (VALUE_BITSIZE (toval
))
591 char buffer
[sizeof (LONGEST
)];
592 /* We assume that the argument to read_memory is in units of
593 host chars. FIXME: Is that correct? */
594 changed_len
= (VALUE_BITPOS (toval
)
595 + VALUE_BITSIZE (toval
)
599 if (changed_len
> (int) sizeof (LONGEST
))
600 error ("Can't handle bitfields which don't fit in a %d bit word.",
601 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
603 read_memory (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
604 buffer
, changed_len
);
605 modify_field (buffer
, value_as_long (fromval
),
606 VALUE_BITPOS (toval
), VALUE_BITSIZE (toval
));
607 changed_addr
= VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
);
608 dest_buffer
= buffer
;
612 changed_addr
= VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
);
613 changed_len
= use_buffer
;
614 dest_buffer
= raw_buffer
;
618 changed_addr
= VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
);
619 changed_len
= TYPE_LENGTH (type
);
620 dest_buffer
= VALUE_CONTENTS (fromval
);
623 write_memory (changed_addr
, dest_buffer
, changed_len
);
624 if (memory_changed_hook
)
625 memory_changed_hook (changed_addr
, changed_len
);
626 target_changed_event ();
631 if (VALUE_BITSIZE (toval
))
633 char buffer
[sizeof (LONGEST
)];
635 REGISTER_RAW_SIZE (VALUE_REGNO (toval
)) - VALUE_OFFSET (toval
);
637 if (len
> (int) sizeof (LONGEST
))
638 error ("Can't handle bitfields in registers larger than %d bits.",
639 (int) sizeof (LONGEST
) * HOST_CHAR_BIT
);
641 if (VALUE_BITPOS (toval
) + VALUE_BITSIZE (toval
)
642 > len
* HOST_CHAR_BIT
)
643 /* Getting this right would involve being very careful about
645 error ("Can't assign to bitfields that cross register "
648 read_register_bytes (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
650 modify_field (buffer
, value_as_long (fromval
),
651 VALUE_BITPOS (toval
), VALUE_BITSIZE (toval
));
652 write_register_bytes (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
656 write_register_bytes (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
657 raw_buffer
, use_buffer
);
660 /* Do any conversion necessary when storing this type to more
661 than one register. */
662 #ifdef REGISTER_CONVERT_FROM_TYPE
663 memcpy (raw_buffer
, VALUE_CONTENTS (fromval
), TYPE_LENGTH (type
));
664 REGISTER_CONVERT_FROM_TYPE (VALUE_REGNO (toval
), type
, raw_buffer
);
665 write_register_bytes (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
666 raw_buffer
, TYPE_LENGTH (type
));
668 write_register_bytes (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
669 VALUE_CONTENTS (fromval
), TYPE_LENGTH (type
));
673 target_changed_event ();
675 /* Assigning to the stack pointer, frame pointer, and other
676 (architecture and calling convention specific) registers may
677 cause the frame cache to be out of date. We just do this
678 on all assignments to registers for simplicity; I doubt the slowdown
680 reinit_frame_cache ();
683 case lval_reg_frame_relative
:
685 /* value is stored in a series of registers in the frame
686 specified by the structure. Copy that value out, modify
687 it, and copy it back in. */
688 int amount_to_copy
= (VALUE_BITSIZE (toval
) ? 1 : TYPE_LENGTH (type
));
689 int reg_size
= REGISTER_RAW_SIZE (VALUE_FRAME_REGNUM (toval
));
690 int byte_offset
= VALUE_OFFSET (toval
) % reg_size
;
691 int reg_offset
= VALUE_OFFSET (toval
) / reg_size
;
694 /* Make the buffer large enough in all cases. */
695 /* FIXME (alloca): Not safe for very large data types. */
696 char *buffer
= (char *) alloca (amount_to_copy
698 + MAX_REGISTER_RAW_SIZE
);
701 struct frame_info
*frame
;
703 /* Figure out which frame this is in currently. */
704 for (frame
= get_current_frame ();
705 frame
&& FRAME_FP (frame
) != VALUE_FRAME (toval
);
706 frame
= get_prev_frame (frame
))
710 error ("Value being assigned to is no longer active.");
712 amount_to_copy
+= (reg_size
- amount_to_copy
% reg_size
);
715 for ((regno
= VALUE_FRAME_REGNUM (toval
) + reg_offset
,
717 amount_copied
< amount_to_copy
;
718 amount_copied
+= reg_size
, regno
++)
720 get_saved_register (buffer
+ amount_copied
,
721 (int *) NULL
, (CORE_ADDR
*) NULL
,
722 frame
, regno
, (enum lval_type
*) NULL
);
725 /* Modify what needs to be modified. */
726 if (VALUE_BITSIZE (toval
))
727 modify_field (buffer
+ byte_offset
,
728 value_as_long (fromval
),
729 VALUE_BITPOS (toval
), VALUE_BITSIZE (toval
));
731 memcpy (buffer
+ byte_offset
, raw_buffer
, use_buffer
);
733 memcpy (buffer
+ byte_offset
, VALUE_CONTENTS (fromval
),
737 for ((regno
= VALUE_FRAME_REGNUM (toval
) + reg_offset
,
739 amount_copied
< amount_to_copy
;
740 amount_copied
+= reg_size
, regno
++)
746 /* Just find out where to put it. */
747 get_saved_register ((char *) NULL
,
748 &optim
, &addr
, frame
, regno
, &lval
);
751 error ("Attempt to assign to a value that was optimized out.");
752 if (lval
== lval_memory
)
753 write_memory (addr
, buffer
+ amount_copied
, reg_size
);
754 else if (lval
== lval_register
)
755 write_register_bytes (addr
, buffer
+ amount_copied
, reg_size
);
757 error ("Attempt to assign to an unmodifiable value.");
760 if (register_changed_hook
)
761 register_changed_hook (-1);
762 target_changed_event ();
768 error ("Left operand of assignment is not an lvalue.");
771 /* If the field does not entirely fill a LONGEST, then zero the sign bits.
772 If the field is signed, and is negative, then sign extend. */
773 if ((VALUE_BITSIZE (toval
) > 0)
774 && (VALUE_BITSIZE (toval
) < 8 * (int) sizeof (LONGEST
)))
776 LONGEST fieldval
= value_as_long (fromval
);
777 LONGEST valmask
= (((ULONGEST
) 1) << VALUE_BITSIZE (toval
)) - 1;
780 if (!TYPE_UNSIGNED (type
) && (fieldval
& (valmask
^ (valmask
>> 1))))
781 fieldval
|= ~valmask
;
783 fromval
= value_from_longest (type
, fieldval
);
786 val
= value_copy (toval
);
787 memcpy (VALUE_CONTENTS_RAW (val
), VALUE_CONTENTS (fromval
),
789 VALUE_TYPE (val
) = type
;
790 val
= value_change_enclosing_type (val
, VALUE_ENCLOSING_TYPE (fromval
));
791 VALUE_EMBEDDED_OFFSET (val
) = VALUE_EMBEDDED_OFFSET (fromval
);
792 VALUE_POINTED_TO_OFFSET (val
) = VALUE_POINTED_TO_OFFSET (fromval
);
797 /* Extend a value VAL to COUNT repetitions of its type. */
800 value_repeat (struct value
*arg1
, int count
)
804 if (VALUE_LVAL (arg1
) != lval_memory
)
805 error ("Only values in memory can be extended with '@'.");
807 error ("Invalid number %d of repetitions.", count
);
809 val
= allocate_repeat_value (VALUE_ENCLOSING_TYPE (arg1
), count
);
811 read_memory (VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
),
812 VALUE_CONTENTS_ALL_RAW (val
),
813 TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val
)));
814 VALUE_LVAL (val
) = lval_memory
;
815 VALUE_ADDRESS (val
) = VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
);
821 value_of_variable (struct symbol
*var
, struct block
*b
)
824 struct frame_info
*frame
= NULL
;
827 frame
= NULL
; /* Use selected frame. */
828 else if (symbol_read_needs_frame (var
))
830 frame
= block_innermost_frame (b
);
833 if (BLOCK_FUNCTION (b
)
834 && SYMBOL_SOURCE_NAME (BLOCK_FUNCTION (b
)))
835 error ("No frame is currently executing in block %s.",
836 SYMBOL_SOURCE_NAME (BLOCK_FUNCTION (b
)));
838 error ("No frame is currently executing in specified block");
842 val
= read_var_value (var
, frame
);
844 error ("Address of symbol \"%s\" is unknown.", SYMBOL_SOURCE_NAME (var
));
849 /* Given a value which is an array, return a value which is a pointer to its
850 first element, regardless of whether or not the array has a nonzero lower
853 FIXME: A previous comment here indicated that this routine should be
854 substracting the array's lower bound. It's not clear to me that this
855 is correct. Given an array subscripting operation, it would certainly
856 work to do the adjustment here, essentially computing:
858 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
860 However I believe a more appropriate and logical place to account for
861 the lower bound is to do so in value_subscript, essentially computing:
863 (&array[0] + ((index - lowerbound) * sizeof array[0]))
865 As further evidence consider what would happen with operations other
866 than array subscripting, where the caller would get back a value that
867 had an address somewhere before the actual first element of the array,
868 and the information about the lower bound would be lost because of
869 the coercion to pointer type.
873 value_coerce_array (struct value
*arg1
)
875 register struct type
*type
= check_typedef (VALUE_TYPE (arg1
));
877 if (VALUE_LVAL (arg1
) != lval_memory
)
878 error ("Attempt to take address of value not located in memory.");
880 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
881 (VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
)));
884 /* Given a value which is a function, return a value which is a pointer
888 value_coerce_function (struct value
*arg1
)
890 struct value
*retval
;
892 if (VALUE_LVAL (arg1
) != lval_memory
)
893 error ("Attempt to take address of value not located in memory.");
895 retval
= value_from_pointer (lookup_pointer_type (VALUE_TYPE (arg1
)),
896 (VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
)));
897 VALUE_BFD_SECTION (retval
) = VALUE_BFD_SECTION (arg1
);
901 /* Return a pointer value for the object for which ARG1 is the contents. */
904 value_addr (struct value
*arg1
)
908 struct type
*type
= check_typedef (VALUE_TYPE (arg1
));
909 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
911 /* Copy the value, but change the type from (T&) to (T*).
912 We keep the same location information, which is efficient,
913 and allows &(&X) to get the location containing the reference. */
914 arg2
= value_copy (arg1
);
915 VALUE_TYPE (arg2
) = lookup_pointer_type (TYPE_TARGET_TYPE (type
));
918 if (TYPE_CODE (type
) == TYPE_CODE_FUNC
)
919 return value_coerce_function (arg1
);
921 if (VALUE_LVAL (arg1
) != lval_memory
)
922 error ("Attempt to take address of value not located in memory.");
924 /* Get target memory address */
925 arg2
= value_from_pointer (lookup_pointer_type (VALUE_TYPE (arg1
)),
926 (VALUE_ADDRESS (arg1
)
927 + VALUE_OFFSET (arg1
)
928 + VALUE_EMBEDDED_OFFSET (arg1
)));
930 /* This may be a pointer to a base subobject; so remember the
931 full derived object's type ... */
932 arg2
= value_change_enclosing_type (arg2
, lookup_pointer_type (VALUE_ENCLOSING_TYPE (arg1
)));
933 /* ... and also the relative position of the subobject in the full object */
934 VALUE_POINTED_TO_OFFSET (arg2
) = VALUE_EMBEDDED_OFFSET (arg1
);
935 VALUE_BFD_SECTION (arg2
) = VALUE_BFD_SECTION (arg1
);
939 /* Given a value of a pointer type, apply the C unary * operator to it. */
942 value_ind (struct value
*arg1
)
944 struct type
*base_type
;
949 base_type
= check_typedef (VALUE_TYPE (arg1
));
951 if (TYPE_CODE (base_type
) == TYPE_CODE_MEMBER
)
952 error ("not implemented: member types in value_ind");
954 /* Allow * on an integer so we can cast it to whatever we want.
955 This returns an int, which seems like the most C-like thing
956 to do. "long long" variables are rare enough that
957 BUILTIN_TYPE_LONGEST would seem to be a mistake. */
958 if (TYPE_CODE (base_type
) == TYPE_CODE_INT
)
959 return value_at_lazy (builtin_type_int
,
960 (CORE_ADDR
) value_as_long (arg1
),
961 VALUE_BFD_SECTION (arg1
));
962 else if (TYPE_CODE (base_type
) == TYPE_CODE_PTR
)
964 struct type
*enc_type
;
965 /* We may be pointing to something embedded in a larger object */
966 /* Get the real type of the enclosing object */
967 enc_type
= check_typedef (VALUE_ENCLOSING_TYPE (arg1
));
968 enc_type
= TYPE_TARGET_TYPE (enc_type
);
969 /* Retrieve the enclosing object pointed to */
970 arg2
= value_at_lazy (enc_type
,
971 value_as_address (arg1
) - VALUE_POINTED_TO_OFFSET (arg1
),
972 VALUE_BFD_SECTION (arg1
));
974 VALUE_TYPE (arg2
) = TYPE_TARGET_TYPE (base_type
);
975 /* Add embedding info */
976 arg2
= value_change_enclosing_type (arg2
, enc_type
);
977 VALUE_EMBEDDED_OFFSET (arg2
) = VALUE_POINTED_TO_OFFSET (arg1
);
979 /* We may be pointing to an object of some derived type */
980 arg2
= value_full_object (arg2
, NULL
, 0, 0, 0);
984 error ("Attempt to take contents of a non-pointer value.");
985 return 0; /* For lint -- never reached */
988 /* Pushing small parts of stack frames. */
990 /* Push one word (the size of object that a register holds). */
993 push_word (CORE_ADDR sp
, ULONGEST word
)
995 register int len
= REGISTER_SIZE
;
996 char *buffer
= alloca (MAX_REGISTER_RAW_SIZE
);
998 store_unsigned_integer (buffer
, len
, word
);
999 if (INNER_THAN (1, 2))
1001 /* stack grows downward */
1003 write_memory (sp
, buffer
, len
);
1007 /* stack grows upward */
1008 write_memory (sp
, buffer
, len
);
1015 /* Push LEN bytes with data at BUFFER. */
1018 push_bytes (CORE_ADDR sp
, char *buffer
, int len
)
1020 if (INNER_THAN (1, 2))
1022 /* stack grows downward */
1024 write_memory (sp
, buffer
, len
);
1028 /* stack grows upward */
1029 write_memory (sp
, buffer
, len
);
1036 #ifndef PARM_BOUNDARY
1037 #define PARM_BOUNDARY (0)
1040 /* Push onto the stack the specified value VALUE. Pad it correctly for
1041 it to be an argument to a function. */
1044 value_push (register CORE_ADDR sp
, struct value
*arg
)
1046 register int len
= TYPE_LENGTH (VALUE_ENCLOSING_TYPE (arg
));
1047 register int container_len
= len
;
1048 register int offset
;
1050 /* How big is the container we're going to put this value in? */
1052 container_len
= ((len
+ PARM_BOUNDARY
/ TARGET_CHAR_BIT
- 1)
1053 & ~(PARM_BOUNDARY
/ TARGET_CHAR_BIT
- 1));
1055 /* Are we going to put it at the high or low end of the container? */
1056 if (TARGET_BYTE_ORDER
== BFD_ENDIAN_BIG
)
1057 offset
= container_len
- len
;
1061 if (INNER_THAN (1, 2))
1063 /* stack grows downward */
1064 sp
-= container_len
;
1065 write_memory (sp
+ offset
, VALUE_CONTENTS_ALL (arg
), len
);
1069 /* stack grows upward */
1070 write_memory (sp
+ offset
, VALUE_CONTENTS_ALL (arg
), len
);
1071 sp
+= container_len
;
1078 default_push_arguments (int nargs
, struct value
**args
, CORE_ADDR sp
,
1079 int struct_return
, CORE_ADDR struct_addr
)
1081 /* ASSERT ( !struct_return); */
1083 for (i
= nargs
- 1; i
>= 0; i
--)
1084 sp
= value_push (sp
, args
[i
]);
1089 /* Functions to use for the COERCE_FLOAT_TO_DOUBLE gdbarch method.
1091 How you should pass arguments to a function depends on whether it
1092 was defined in K&R style or prototype style. If you define a
1093 function using the K&R syntax that takes a `float' argument, then
1094 callers must pass that argument as a `double'. If you define the
1095 function using the prototype syntax, then you must pass the
1096 argument as a `float', with no promotion.
1098 Unfortunately, on certain older platforms, the debug info doesn't
1099 indicate reliably how each function was defined. A function type's
1100 TYPE_FLAG_PROTOTYPED flag may be clear, even if the function was
1101 defined in prototype style. When calling a function whose
1102 TYPE_FLAG_PROTOTYPED flag is clear, GDB consults the
1103 COERCE_FLOAT_TO_DOUBLE gdbarch method to decide what to do.
1105 For modern targets, it is proper to assume that, if the prototype
1106 flag is clear, that can be trusted: `float' arguments should be
1107 promoted to `double'. You should register the function
1108 `standard_coerce_float_to_double' to get this behavior.
1110 For some older targets, if the prototype flag is clear, that
1111 doesn't tell us anything. So we guess that, if we don't have a
1112 type for the formal parameter (i.e., the first argument to
1113 COERCE_FLOAT_TO_DOUBLE is null), then we should promote it;
1114 otherwise, we should leave it alone. The function
1115 `default_coerce_float_to_double' provides this behavior; it is the
1116 default value, for compatibility with older configurations. */
1118 default_coerce_float_to_double (struct type
*formal
, struct type
*actual
)
1120 return formal
== NULL
;
1125 standard_coerce_float_to_double (struct type
*formal
, struct type
*actual
)
1131 /* Perform the standard coercions that are specified
1132 for arguments to be passed to C functions.
1134 If PARAM_TYPE is non-NULL, it is the expected parameter type.
1135 IS_PROTOTYPED is non-zero if the function declaration is prototyped. */
1137 static struct value
*
1138 value_arg_coerce (struct value
*arg
, struct type
*param_type
,
1141 register struct type
*arg_type
= check_typedef (VALUE_TYPE (arg
));
1142 register struct type
*type
1143 = param_type
? check_typedef (param_type
) : arg_type
;
1145 switch (TYPE_CODE (type
))
1148 if (TYPE_CODE (arg_type
) != TYPE_CODE_REF
1149 && TYPE_CODE (arg_type
) != TYPE_CODE_PTR
)
1151 arg
= value_addr (arg
);
1152 VALUE_TYPE (arg
) = param_type
;
1157 case TYPE_CODE_CHAR
:
1158 case TYPE_CODE_BOOL
:
1159 case TYPE_CODE_ENUM
:
1160 /* If we don't have a prototype, coerce to integer type if necessary. */
1163 if (TYPE_LENGTH (type
) < TYPE_LENGTH (builtin_type_int
))
1164 type
= builtin_type_int
;
1166 /* Currently all target ABIs require at least the width of an integer
1167 type for an argument. We may have to conditionalize the following
1168 type coercion for future targets. */
1169 if (TYPE_LENGTH (type
) < TYPE_LENGTH (builtin_type_int
))
1170 type
= builtin_type_int
;
1173 /* FIXME: We should always convert floats to doubles in the
1174 non-prototyped case. As many debugging formats include
1175 no information about prototyping, we have to live with
1176 COERCE_FLOAT_TO_DOUBLE for now. */
1177 if (!is_prototyped
&& COERCE_FLOAT_TO_DOUBLE (param_type
, arg_type
))
1179 if (TYPE_LENGTH (type
) < TYPE_LENGTH (builtin_type_double
))
1180 type
= builtin_type_double
;
1181 else if (TYPE_LENGTH (type
) > TYPE_LENGTH (builtin_type_double
))
1182 type
= builtin_type_long_double
;
1185 case TYPE_CODE_FUNC
:
1186 type
= lookup_pointer_type (type
);
1188 case TYPE_CODE_ARRAY
:
1189 /* Arrays are coerced to pointers to their first element, unless
1190 they are vectors, in which case we want to leave them alone,
1191 because they are passed by value. */
1192 if (current_language
->c_style_arrays
)
1193 if (!TYPE_VECTOR (type
))
1194 type
= lookup_pointer_type (TYPE_TARGET_TYPE (type
));
1196 case TYPE_CODE_UNDEF
:
1198 case TYPE_CODE_STRUCT
:
1199 case TYPE_CODE_UNION
:
1200 case TYPE_CODE_VOID
:
1202 case TYPE_CODE_RANGE
:
1203 case TYPE_CODE_STRING
:
1204 case TYPE_CODE_BITSTRING
:
1205 case TYPE_CODE_ERROR
:
1206 case TYPE_CODE_MEMBER
:
1207 case TYPE_CODE_METHOD
:
1208 case TYPE_CODE_COMPLEX
:
1213 return value_cast (type
, arg
);
1216 /* Determine a function's address and its return type from its value.
1217 Calls error() if the function is not valid for calling. */
1220 find_function_addr (struct value
*function
, struct type
**retval_type
)
1222 register struct type
*ftype
= check_typedef (VALUE_TYPE (function
));
1223 register enum type_code code
= TYPE_CODE (ftype
);
1224 struct type
*value_type
;
1227 /* If it's a member function, just look at the function
1230 /* Determine address to call. */
1231 if (code
== TYPE_CODE_FUNC
|| code
== TYPE_CODE_METHOD
)
1233 funaddr
= VALUE_ADDRESS (function
);
1234 value_type
= TYPE_TARGET_TYPE (ftype
);
1236 else if (code
== TYPE_CODE_PTR
)
1238 funaddr
= value_as_address (function
);
1239 ftype
= check_typedef (TYPE_TARGET_TYPE (ftype
));
1240 if (TYPE_CODE (ftype
) == TYPE_CODE_FUNC
1241 || TYPE_CODE (ftype
) == TYPE_CODE_METHOD
)
1243 funaddr
= CONVERT_FROM_FUNC_PTR_ADDR (funaddr
);
1244 value_type
= TYPE_TARGET_TYPE (ftype
);
1247 value_type
= builtin_type_int
;
1249 else if (code
== TYPE_CODE_INT
)
1251 /* Handle the case of functions lacking debugging info.
1252 Their values are characters since their addresses are char */
1253 if (TYPE_LENGTH (ftype
) == 1)
1254 funaddr
= value_as_address (value_addr (function
));
1256 /* Handle integer used as address of a function. */
1257 funaddr
= (CORE_ADDR
) value_as_long (function
);
1259 value_type
= builtin_type_int
;
1262 error ("Invalid data type for function to be called.");
1264 *retval_type
= value_type
;
1268 /* All this stuff with a dummy frame may seem unnecessarily complicated
1269 (why not just save registers in GDB?). The purpose of pushing a dummy
1270 frame which looks just like a real frame is so that if you call a
1271 function and then hit a breakpoint (get a signal, etc), "backtrace"
1272 will look right. Whether the backtrace needs to actually show the
1273 stack at the time the inferior function was called is debatable, but
1274 it certainly needs to not display garbage. So if you are contemplating
1275 making dummy frames be different from normal frames, consider that. */
1277 /* Perform a function call in the inferior.
1278 ARGS is a vector of values of arguments (NARGS of them).
1279 FUNCTION is a value, the function to be called.
1280 Returns a value representing what the function returned.
1281 May fail to return, if a breakpoint or signal is hit
1282 during the execution of the function.
1284 ARGS is modified to contain coerced values. */
1286 static struct value
*
1287 hand_function_call (struct value
*function
, int nargs
, struct value
**args
)
1289 register CORE_ADDR sp
;
1293 /* CALL_DUMMY is an array of words (REGISTER_SIZE), but each word
1294 is in host byte order. Before calling FIX_CALL_DUMMY, we byteswap it
1295 and remove any extra bytes which might exist because ULONGEST is
1296 bigger than REGISTER_SIZE.
1298 NOTE: This is pretty wierd, as the call dummy is actually a
1299 sequence of instructions. But CISC machines will have
1300 to pack the instructions into REGISTER_SIZE units (and
1301 so will RISC machines for which INSTRUCTION_SIZE is not
1304 NOTE: This is pretty stupid. CALL_DUMMY should be in strict
1305 target byte order. */
1307 static ULONGEST
*dummy
;
1311 struct type
*value_type
;
1312 unsigned char struct_return
;
1313 CORE_ADDR struct_addr
= 0;
1314 struct regcache
*retbuf
;
1315 struct cleanup
*retbuf_cleanup
;
1316 struct inferior_status
*inf_status
;
1317 struct cleanup
*inf_status_cleanup
;
1319 int using_gcc
; /* Set to version of gcc in use, or zero if not gcc */
1321 struct type
*param_type
= NULL
;
1322 struct type
*ftype
= check_typedef (SYMBOL_TYPE (function
));
1323 int n_method_args
= 0;
1325 dummy
= alloca (SIZEOF_CALL_DUMMY_WORDS
);
1326 sizeof_dummy1
= REGISTER_SIZE
* SIZEOF_CALL_DUMMY_WORDS
/ sizeof (ULONGEST
);
1327 dummy1
= alloca (sizeof_dummy1
);
1328 memcpy (dummy
, CALL_DUMMY_WORDS
, SIZEOF_CALL_DUMMY_WORDS
);
1330 if (!target_has_execution
)
1333 /* Create a cleanup chain that contains the retbuf (buffer
1334 containing the register values). This chain is create BEFORE the
1335 inf_status chain so that the inferior status can cleaned up
1336 (restored or discarded) without having the retbuf freed. */
1337 retbuf
= regcache_xmalloc (current_gdbarch
);
1338 retbuf_cleanup
= make_cleanup_regcache_xfree (retbuf
);
1340 /* A cleanup for the inferior status. Create this AFTER the retbuf
1341 so that this can be discarded or applied without interfering with
1343 inf_status
= save_inferior_status (1);
1344 inf_status_cleanup
= make_cleanup_restore_inferior_status (inf_status
);
1346 /* PUSH_DUMMY_FRAME is responsible for saving the inferior registers
1347 (and POP_FRAME for restoring them). (At least on most machines)
1348 they are saved on the stack in the inferior. */
1351 old_sp
= read_sp ();
1353 /* Ensure that the initial SP is correctly aligned. */
1354 if (gdbarch_frame_align_p (current_gdbarch
))
1356 /* NOTE: cagney/2002-09-18:
1358 On a RISC architecture, a void parameterless generic dummy
1359 frame (i.e., no parameters, no result) typically does not
1360 need to push anything the stack and hence can leave SP and
1361 FP. Similarly, a framelss (possibly leaf) function does not
1362 push anything on the stack and, hence, that too can leave FP
1363 and SP unchanged. As a consequence, a sequence of void
1364 parameterless generic dummy frame calls to frameless
1365 functions will create a sequence of effectively identical
1366 frames (SP, FP and TOS and PC the same). This, not
1367 suprisingly, results in what appears to be a stack in an
1368 infinite loop --- when GDB tries to find a generic dummy
1369 frame on the internal dummy frame stack, it will always find
1372 To avoid this problem, the code below always grows the stack.
1373 That way, two dummy frames can never be identical. It does
1374 burn a few bytes of stack but that is a small price to pay
1376 sp
= gdbarch_frame_align (current_gdbarch
, old_sp
);
1379 if (INNER_THAN (1, 2))
1380 /* Stack grows down. */
1381 sp
= gdbarch_frame_align (current_gdbarch
, old_sp
- 1);
1383 /* Stack grows up. */
1384 sp
= gdbarch_frame_align (current_gdbarch
, old_sp
+ 1);
1386 gdb_assert ((INNER_THAN (1, 2) && sp
<= old_sp
)
1387 || (INNER_THAN (2, 1) && sp
>= old_sp
));
1390 /* FIXME: cagney/2002-09-18: Hey, you loose! Who knows how badly
1391 aligned the SP is! Further, per comment above, if the generic
1392 dummy frame ends up empty (because nothing is pushed) GDB won't
1393 be able to correctly perform back traces. If a target is
1394 having trouble with backtraces, first thing to do is add
1395 FRAME_ALIGN() to its architecture vector. After that, try
1396 adding SAVE_DUMMY_FRAME_TOS() and modifying FRAME_CHAIN so that
1397 when the next outer frame is a generic dummy, it returns the
1398 current frame's base. */
1401 if (INNER_THAN (1, 2))
1403 /* Stack grows down */
1404 sp
-= sizeof_dummy1
;
1409 /* Stack grows up */
1411 sp
+= sizeof_dummy1
;
1414 /* NOTE: cagney/2002-09-10: Don't bother re-adjusting the stack
1415 after allocating space for the call dummy. A target can specify
1416 a SIZEOF_DUMMY1 (via SIZEOF_CALL_DUMMY_WORDS) such that all local
1417 alignment requirements are met. */
1419 funaddr
= find_function_addr (function
, &value_type
);
1420 CHECK_TYPEDEF (value_type
);
1423 struct block
*b
= block_for_pc (funaddr
);
1424 /* If compiled without -g, assume GCC 2. */
1425 using_gcc
= (b
== NULL
? 2 : BLOCK_GCC_COMPILED (b
));
1428 /* Are we returning a value using a structure return or a normal
1431 struct_return
= using_struct_return (function
, funaddr
, value_type
,
1434 /* Create a call sequence customized for this function
1435 and the number of arguments for it. */
1436 for (i
= 0; i
< (int) (SIZEOF_CALL_DUMMY_WORDS
/ sizeof (dummy
[0])); i
++)
1437 store_unsigned_integer (&dummy1
[i
* REGISTER_SIZE
],
1439 (ULONGEST
) dummy
[i
]);
1441 #ifdef GDB_TARGET_IS_HPPA
1442 real_pc
= FIX_CALL_DUMMY (dummy1
, start_sp
, funaddr
, nargs
, args
,
1443 value_type
, using_gcc
);
1445 FIX_CALL_DUMMY (dummy1
, start_sp
, funaddr
, nargs
, args
,
1446 value_type
, using_gcc
);
1450 if (CALL_DUMMY_LOCATION
== ON_STACK
)
1452 write_memory (start_sp
, (char *) dummy1
, sizeof_dummy1
);
1453 if (USE_GENERIC_DUMMY_FRAMES
)
1454 generic_save_call_dummy_addr (start_sp
, start_sp
+ sizeof_dummy1
);
1457 if (CALL_DUMMY_LOCATION
== BEFORE_TEXT_END
)
1459 /* Convex Unix prohibits executing in the stack segment. */
1460 /* Hope there is empty room at the top of the text segment. */
1461 extern CORE_ADDR text_end
;
1462 static int checked
= 0;
1464 for (start_sp
= text_end
- sizeof_dummy1
; start_sp
< text_end
; ++start_sp
)
1465 if (read_memory_integer (start_sp
, 1) != 0)
1466 error ("text segment full -- no place to put call");
1469 real_pc
= text_end
- sizeof_dummy1
;
1470 write_memory (real_pc
, (char *) dummy1
, sizeof_dummy1
);
1471 if (USE_GENERIC_DUMMY_FRAMES
)
1472 generic_save_call_dummy_addr (real_pc
, real_pc
+ sizeof_dummy1
);
1475 if (CALL_DUMMY_LOCATION
== AFTER_TEXT_END
)
1477 extern CORE_ADDR text_end
;
1481 errcode
= target_write_memory (real_pc
, (char *) dummy1
, sizeof_dummy1
);
1483 error ("Cannot write text segment -- call_function failed");
1484 if (USE_GENERIC_DUMMY_FRAMES
)
1485 generic_save_call_dummy_addr (real_pc
, real_pc
+ sizeof_dummy1
);
1488 if (CALL_DUMMY_LOCATION
== AT_ENTRY_POINT
)
1491 if (USE_GENERIC_DUMMY_FRAMES
)
1492 /* NOTE: cagney/2002-04-13: The entry point is going to be
1493 modified with a single breakpoint. */
1494 generic_save_call_dummy_addr (CALL_DUMMY_ADDRESS (),
1495 CALL_DUMMY_ADDRESS () + 1);
1499 sp
= old_sp
; /* It really is used, for some ifdef's... */
1502 if (nargs
< TYPE_NFIELDS (ftype
))
1503 error ("too few arguments in function call");
1505 for (i
= nargs
- 1; i
>= 0; i
--)
1509 /* FIXME drow/2002-05-31: Should just always mark methods as
1510 prototyped. Can we respect TYPE_VARARGS? Probably not. */
1511 if (TYPE_CODE (ftype
) == TYPE_CODE_METHOD
)
1514 prototyped
= TYPE_PROTOTYPED (ftype
);
1516 if (i
< TYPE_NFIELDS (ftype
))
1517 args
[i
] = value_arg_coerce (args
[i
], TYPE_FIELD_TYPE (ftype
, i
),
1520 args
[i
] = value_arg_coerce (args
[i
], NULL
, 0);
1522 /*elz: this code is to handle the case in which the function to be called
1523 has a pointer to function as parameter and the corresponding actual argument
1524 is the address of a function and not a pointer to function variable.
1525 In aCC compiled code, the calls through pointers to functions (in the body
1526 of the function called by hand) are made via $$dyncall_external which
1527 requires some registers setting, this is taken care of if we call
1528 via a function pointer variable, but not via a function address.
1529 In cc this is not a problem. */
1532 if (param_type
&& TYPE_CODE (ftype
) != TYPE_CODE_METHOD
)
1533 /* if this parameter is a pointer to function */
1534 if (TYPE_CODE (param_type
) == TYPE_CODE_PTR
)
1535 if (TYPE_CODE (TYPE_TARGET_TYPE (param_type
)) == TYPE_CODE_FUNC
)
1536 /* elz: FIXME here should go the test about the compiler used
1537 to compile the target. We want to issue the error
1538 message only if the compiler used was HP's aCC.
1539 If we used HP's cc, then there is no problem and no need
1540 to return at this point */
1541 if (using_gcc
== 0) /* && compiler == aCC */
1542 /* go see if the actual parameter is a variable of type
1543 pointer to function or just a function */
1544 if (args
[i
]->lval
== not_lval
)
1547 if (find_pc_partial_function ((CORE_ADDR
) args
[i
]->aligner
.contents
[0], &arg_name
, NULL
, NULL
))
1549 You cannot use function <%s> as argument. \n\
1550 You must use a pointer to function type variable. Command ignored.", arg_name
);
1554 if (REG_STRUCT_HAS_ADDR_P ())
1556 /* This is a machine like the sparc, where we may need to pass a
1557 pointer to the structure, not the structure itself. */
1558 for (i
= nargs
- 1; i
>= 0; i
--)
1560 struct type
*arg_type
= check_typedef (VALUE_TYPE (args
[i
]));
1561 if ((TYPE_CODE (arg_type
) == TYPE_CODE_STRUCT
1562 || TYPE_CODE (arg_type
) == TYPE_CODE_UNION
1563 || TYPE_CODE (arg_type
) == TYPE_CODE_ARRAY
1564 || TYPE_CODE (arg_type
) == TYPE_CODE_STRING
1565 || TYPE_CODE (arg_type
) == TYPE_CODE_BITSTRING
1566 || TYPE_CODE (arg_type
) == TYPE_CODE_SET
1567 || (TYPE_CODE (arg_type
) == TYPE_CODE_FLT
1568 && TYPE_LENGTH (arg_type
) > 8)
1570 && REG_STRUCT_HAS_ADDR (using_gcc
, arg_type
))
1573 int len
; /* = TYPE_LENGTH (arg_type); */
1575 arg_type
= check_typedef (VALUE_ENCLOSING_TYPE (args
[i
]));
1576 len
= TYPE_LENGTH (arg_type
);
1578 if (STACK_ALIGN_P ())
1579 /* MVS 11/22/96: I think at least some of this
1580 stack_align code is really broken. Better to let
1581 PUSH_ARGUMENTS adjust the stack in a target-defined
1583 aligned_len
= STACK_ALIGN (len
);
1586 if (INNER_THAN (1, 2))
1588 /* stack grows downward */
1590 /* ... so the address of the thing we push is the
1591 stack pointer after we push it. */
1596 /* The stack grows up, so the address of the thing
1597 we push is the stack pointer before we push it. */
1601 /* Push the structure. */
1602 write_memory (addr
, VALUE_CONTENTS_ALL (args
[i
]), len
);
1603 /* The value we're going to pass is the address of the
1604 thing we just pushed. */
1605 /*args[i] = value_from_longest (lookup_pointer_type (value_type),
1607 args
[i
] = value_from_pointer (lookup_pointer_type (arg_type
),
1614 /* Reserve space for the return structure to be written on the
1615 stack, if necessary. Make certain that the value is correctly
1620 int len
= TYPE_LENGTH (value_type
);
1621 if (STACK_ALIGN_P ())
1622 /* MVS 11/22/96: I think at least some of this stack_align
1623 code is really broken. Better to let PUSH_ARGUMENTS adjust
1624 the stack in a target-defined manner. */
1625 len
= STACK_ALIGN (len
);
1626 if (INNER_THAN (1, 2))
1628 /* Stack grows downward. Align STRUCT_ADDR and SP after
1629 making space for the return value. */
1631 if (gdbarch_frame_align_p (current_gdbarch
))
1632 sp
= gdbarch_frame_align (current_gdbarch
, sp
);
1637 /* Stack grows upward. Align the frame, allocate space, and
1638 then again, re-align the frame??? */
1639 if (gdbarch_frame_align_p (current_gdbarch
))
1640 sp
= gdbarch_frame_align (current_gdbarch
, sp
);
1643 if (gdbarch_frame_align_p (current_gdbarch
))
1644 sp
= gdbarch_frame_align (current_gdbarch
, sp
);
1648 /* elz: on HPPA no need for this extra alignment, maybe it is needed
1649 on other architectures. This is because all the alignment is
1650 taken care of in the above code (ifdef REG_STRUCT_HAS_ADDR) and
1651 in hppa_push_arguments */
1652 if (EXTRA_STACK_ALIGNMENT_NEEDED
)
1654 /* MVS 11/22/96: I think at least some of this stack_align code
1655 is really broken. Better to let PUSH_ARGUMENTS adjust the
1656 stack in a target-defined manner. */
1657 if (STACK_ALIGN_P () && INNER_THAN (1, 2))
1659 /* If stack grows down, we must leave a hole at the top. */
1662 for (i
= nargs
- 1; i
>= 0; i
--)
1663 len
+= TYPE_LENGTH (VALUE_ENCLOSING_TYPE (args
[i
]));
1664 if (CALL_DUMMY_STACK_ADJUST_P
)
1665 len
+= CALL_DUMMY_STACK_ADJUST
;
1666 sp
-= STACK_ALIGN (len
) - len
;
1670 sp
= PUSH_ARGUMENTS (nargs
, args
, sp
, struct_return
, struct_addr
);
1672 if (PUSH_RETURN_ADDRESS_P ())
1673 /* for targets that use no CALL_DUMMY */
1674 /* There are a number of targets now which actually don't write
1675 any CALL_DUMMY instructions into the target, but instead just
1676 save the machine state, push the arguments, and jump directly
1677 to the callee function. Since this doesn't actually involve
1678 executing a JSR/BSR instruction, the return address must be set
1679 up by hand, either by pushing onto the stack or copying into a
1680 return-address register as appropriate. Formerly this has been
1681 done in PUSH_ARGUMENTS, but that's overloading its
1682 functionality a bit, so I'm making it explicit to do it here. */
1683 sp
= PUSH_RETURN_ADDRESS (real_pc
, sp
);
1685 if (STACK_ALIGN_P () && !INNER_THAN (1, 2))
1687 /* If stack grows up, we must leave a hole at the bottom, note
1688 that sp already has been advanced for the arguments! */
1689 if (CALL_DUMMY_STACK_ADJUST_P
)
1690 sp
+= CALL_DUMMY_STACK_ADJUST
;
1691 sp
= STACK_ALIGN (sp
);
1694 /* XXX This seems wrong. For stacks that grow down we shouldn't do
1696 /* MVS 11/22/96: I think at least some of this stack_align code is
1697 really broken. Better to let PUSH_ARGUMENTS adjust the stack in
1698 a target-defined manner. */
1699 if (CALL_DUMMY_STACK_ADJUST_P
)
1700 if (INNER_THAN (1, 2))
1702 /* stack grows downward */
1703 sp
-= CALL_DUMMY_STACK_ADJUST
;
1706 /* Store the address at which the structure is supposed to be
1707 written. Note that this (and the code which reserved the space
1708 above) assumes that gcc was used to compile this function. Since
1709 it doesn't cost us anything but space and if the function is pcc
1710 it will ignore this value, we will make that assumption.
1712 Also note that on some machines (like the sparc) pcc uses a
1713 convention like gcc's. */
1716 STORE_STRUCT_RETURN (struct_addr
, sp
);
1718 /* Write the stack pointer. This is here because the statements above
1719 might fool with it. On SPARC, this write also stores the register
1720 window into the right place in the new stack frame, which otherwise
1721 wouldn't happen. (See store_inferior_registers in sparc-nat.c.) */
1724 if (SAVE_DUMMY_FRAME_TOS_P ())
1725 SAVE_DUMMY_FRAME_TOS (sp
);
1729 struct symbol
*symbol
;
1732 symbol
= find_pc_function (funaddr
);
1735 name
= SYMBOL_SOURCE_NAME (symbol
);
1739 /* Try the minimal symbols. */
1740 struct minimal_symbol
*msymbol
= lookup_minimal_symbol_by_pc (funaddr
);
1744 name
= SYMBOL_SOURCE_NAME (msymbol
);
1750 sprintf (format
, "at %s", local_hex_format ());
1752 /* FIXME-32x64: assumes funaddr fits in a long. */
1753 sprintf (name
, format
, (unsigned long) funaddr
);
1756 /* Execute the stack dummy routine, calling FUNCTION.
1757 When it is done, discard the empty frame
1758 after storing the contents of all regs into retbuf. */
1759 rc
= run_stack_dummy (real_pc
+ CALL_DUMMY_START_OFFSET
, retbuf
);
1763 /* We stopped inside the FUNCTION because of a random signal.
1764 Further execution of the FUNCTION is not allowed. */
1766 if (unwind_on_signal_p
)
1768 /* The user wants the context restored. */
1770 /* We must get back to the frame we were before the dummy call. */
1773 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1774 a C++ name with arguments and stuff. */
1776 The program being debugged was signaled while in a function called from GDB.\n\
1777 GDB has restored the context to what it was before the call.\n\
1778 To change this behavior use \"set unwindonsignal off\"\n\
1779 Evaluation of the expression containing the function (%s) will be abandoned.",
1784 /* The user wants to stay in the frame where we stopped (default).*/
1786 /* If we restored the inferior status (via the cleanup),
1787 we would print a spurious error message (Unable to
1788 restore previously selected frame), would write the
1789 registers from the inf_status (which is wrong), and
1790 would do other wrong things. */
1791 discard_cleanups (inf_status_cleanup
);
1792 discard_inferior_status (inf_status
);
1794 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1795 a C++ name with arguments and stuff. */
1797 The program being debugged was signaled while in a function called from GDB.\n\
1798 GDB remains in the frame where the signal was received.\n\
1799 To change this behavior use \"set unwindonsignal on\"\n\
1800 Evaluation of the expression containing the function (%s) will be abandoned.",
1807 /* We hit a breakpoint inside the FUNCTION. */
1809 /* If we restored the inferior status (via the cleanup), we
1810 would print a spurious error message (Unable to restore
1811 previously selected frame), would write the registers from
1812 the inf_status (which is wrong), and would do other wrong
1814 discard_cleanups (inf_status_cleanup
);
1815 discard_inferior_status (inf_status
);
1817 /* The following error message used to say "The expression
1818 which contained the function call has been discarded." It
1819 is a hard concept to explain in a few words. Ideally, GDB
1820 would be able to resume evaluation of the expression when
1821 the function finally is done executing. Perhaps someday
1822 this will be implemented (it would not be easy). */
1824 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1825 a C++ name with arguments and stuff. */
1827 The program being debugged stopped while in a function called from GDB.\n\
1828 When the function (%s) is done executing, GDB will silently\n\
1829 stop (instead of continuing to evaluate the expression containing\n\
1830 the function call).", name
);
1833 /* If we get here the called FUNCTION run to completion. */
1835 /* Restore the inferior status, via its cleanup. At this stage,
1836 leave the RETBUF alone. */
1837 do_cleanups (inf_status_cleanup
);
1839 /* Figure out the value returned by the function. */
1840 /* elz: I defined this new macro for the hppa architecture only.
1841 this gives us a way to get the value returned by the function
1842 from the stack, at the same address we told the function to put
1843 it. We cannot assume on the pa that r28 still contains the
1844 address of the returned structure. Usually this will be
1845 overwritten by the callee. I don't know about other
1846 architectures, so I defined this macro */
1847 #ifdef VALUE_RETURNED_FROM_STACK
1850 do_cleanups (retbuf_cleanup
);
1851 return VALUE_RETURNED_FROM_STACK (value_type
, struct_addr
);
1854 /* NOTE: cagney/2002-09-10: Only when the stack has been correctly
1855 aligned (using frame_align()) do we can trust STRUCT_ADDR and
1856 fetch the return value direct from the stack. This lack of
1857 trust comes about because legacy targets have a nasty habit of
1858 silently, and local to PUSH_ARGUMENTS(), moving STRUCT_ADDR.
1859 For such targets, just hope that value_being_returned() can
1860 find the adjusted value. */
1861 if (struct_return
&& gdbarch_frame_align_p (current_gdbarch
))
1863 struct value
*retval
= value_at (value_type
, struct_addr
, NULL
);
1864 do_cleanups (retbuf_cleanup
);
1869 struct value
*retval
= value_being_returned (value_type
, retbuf
,
1871 do_cleanups (retbuf_cleanup
);
1878 call_function_by_hand (struct value
*function
, int nargs
, struct value
**args
)
1882 return hand_function_call (function
, nargs
, args
);
1886 error ("Cannot invoke functions on this machine.");
1891 call_function_by_hand_expecting_type (struct value
*function
,
1892 struct type
*expect_type
,
1893 int nargs
, struct value
**args
,
1898 /* FIXME: Changes to func not implemented yet */
1899 return hand_function_call (function
, nargs
, args
);
1903 error ("Cannot invoke functions on this machine.");
1909 /* Create a value for an array by allocating space in the inferior, copying
1910 the data into that space, and then setting up an array value.
1912 The array bounds are set from LOWBOUND and HIGHBOUND, and the array is
1913 populated from the values passed in ELEMVEC.
1915 The element type of the array is inherited from the type of the
1916 first element, and all elements must have the same size (though we
1917 don't currently enforce any restriction on their types). */
1920 value_array (int lowbound
, int highbound
, struct value
**elemvec
)
1924 unsigned int typelength
;
1926 struct type
*rangetype
;
1927 struct type
*arraytype
;
1930 /* Validate that the bounds are reasonable and that each of the elements
1931 have the same size. */
1933 nelem
= highbound
- lowbound
+ 1;
1936 error ("bad array bounds (%d, %d)", lowbound
, highbound
);
1938 typelength
= TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec
[0]));
1939 for (idx
= 1; idx
< nelem
; idx
++)
1941 if (TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec
[idx
])) != typelength
)
1943 error ("array elements must all be the same size");
1947 rangetype
= create_range_type ((struct type
*) NULL
, builtin_type_int
,
1948 lowbound
, highbound
);
1949 arraytype
= create_array_type ((struct type
*) NULL
,
1950 VALUE_ENCLOSING_TYPE (elemvec
[0]), rangetype
);
1952 if (!current_language
->c_style_arrays
)
1954 val
= allocate_value (arraytype
);
1955 for (idx
= 0; idx
< nelem
; idx
++)
1957 memcpy (VALUE_CONTENTS_ALL_RAW (val
) + (idx
* typelength
),
1958 VALUE_CONTENTS_ALL (elemvec
[idx
]),
1961 VALUE_BFD_SECTION (val
) = VALUE_BFD_SECTION (elemvec
[0]);
1965 /* Allocate space to store the array in the inferior, and then initialize
1966 it by copying in each element. FIXME: Is it worth it to create a
1967 local buffer in which to collect each value and then write all the
1968 bytes in one operation? */
1970 addr
= allocate_space_in_inferior (nelem
* typelength
);
1971 for (idx
= 0; idx
< nelem
; idx
++)
1973 write_memory (addr
+ (idx
* typelength
), VALUE_CONTENTS_ALL (elemvec
[idx
]),
1977 /* Create the array type and set up an array value to be evaluated lazily. */
1979 val
= value_at_lazy (arraytype
, addr
, VALUE_BFD_SECTION (elemvec
[0]));
1983 /* Create a value for a string constant by allocating space in the inferior,
1984 copying the data into that space, and returning the address with type
1985 TYPE_CODE_STRING. PTR points to the string constant data; LEN is number
1987 Note that string types are like array of char types with a lower bound of
1988 zero and an upper bound of LEN - 1. Also note that the string may contain
1989 embedded null bytes. */
1992 value_string (char *ptr
, int len
)
1995 int lowbound
= current_language
->string_lower_bound
;
1996 struct type
*rangetype
= create_range_type ((struct type
*) NULL
,
1998 lowbound
, len
+ lowbound
- 1);
1999 struct type
*stringtype
2000 = create_string_type ((struct type
*) NULL
, rangetype
);
2003 if (current_language
->c_style_arrays
== 0)
2005 val
= allocate_value (stringtype
);
2006 memcpy (VALUE_CONTENTS_RAW (val
), ptr
, len
);
2011 /* Allocate space to store the string in the inferior, and then
2012 copy LEN bytes from PTR in gdb to that address in the inferior. */
2014 addr
= allocate_space_in_inferior (len
);
2015 write_memory (addr
, ptr
, len
);
2017 val
= value_at_lazy (stringtype
, addr
, NULL
);
2022 value_bitstring (char *ptr
, int len
)
2025 struct type
*domain_type
= create_range_type (NULL
, builtin_type_int
,
2027 struct type
*type
= create_set_type ((struct type
*) NULL
, domain_type
);
2028 TYPE_CODE (type
) = TYPE_CODE_BITSTRING
;
2029 val
= allocate_value (type
);
2030 memcpy (VALUE_CONTENTS_RAW (val
), ptr
, TYPE_LENGTH (type
));
2034 /* See if we can pass arguments in T2 to a function which takes arguments
2035 of types T1. T1 is a list of NARGS arguments, and T2 is a NULL-terminated
2036 vector. If some arguments need coercion of some sort, then the coerced
2037 values are written into T2. Return value is 0 if the arguments could be
2038 matched, or the position at which they differ if not.
2040 STATICP is nonzero if the T1 argument list came from a
2041 static member function. T2 will still include the ``this'' pointer,
2042 but it will be skipped.
2044 For non-static member functions, we ignore the first argument,
2045 which is the type of the instance variable. This is because we want
2046 to handle calls with objects from derived classes. This is not
2047 entirely correct: we should actually check to make sure that a
2048 requested operation is type secure, shouldn't we? FIXME. */
2051 typecmp (int staticp
, int varargs
, int nargs
,
2052 struct field t1
[], struct value
*t2
[])
2057 internal_error (__FILE__
, __LINE__
, "typecmp: no argument list");
2059 /* Skip ``this'' argument if applicable. T2 will always include THIS. */
2064 (i
< nargs
) && TYPE_CODE (t1
[i
].type
) != TYPE_CODE_VOID
;
2067 struct type
*tt1
, *tt2
;
2072 tt1
= check_typedef (t1
[i
].type
);
2073 tt2
= check_typedef (VALUE_TYPE (t2
[i
]));
2075 if (TYPE_CODE (tt1
) == TYPE_CODE_REF
2076 /* We should be doing hairy argument matching, as below. */
2077 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1
))) == TYPE_CODE (tt2
)))
2079 if (TYPE_CODE (tt2
) == TYPE_CODE_ARRAY
)
2080 t2
[i
] = value_coerce_array (t2
[i
]);
2082 t2
[i
] = value_addr (t2
[i
]);
2086 /* djb - 20000715 - Until the new type structure is in the
2087 place, and we can attempt things like implicit conversions,
2088 we need to do this so you can take something like a map<const
2089 char *>, and properly access map["hello"], because the
2090 argument to [] will be a reference to a pointer to a char,
2091 and the argument will be a pointer to a char. */
2092 while ( TYPE_CODE(tt1
) == TYPE_CODE_REF
||
2093 TYPE_CODE (tt1
) == TYPE_CODE_PTR
)
2095 tt1
= check_typedef( TYPE_TARGET_TYPE(tt1
) );
2097 while ( TYPE_CODE(tt2
) == TYPE_CODE_ARRAY
||
2098 TYPE_CODE(tt2
) == TYPE_CODE_PTR
||
2099 TYPE_CODE(tt2
) == TYPE_CODE_REF
)
2101 tt2
= check_typedef( TYPE_TARGET_TYPE(tt2
) );
2103 if (TYPE_CODE (tt1
) == TYPE_CODE (tt2
))
2105 /* Array to pointer is a `trivial conversion' according to the ARM. */
2107 /* We should be doing much hairier argument matching (see section 13.2
2108 of the ARM), but as a quick kludge, just check for the same type
2110 if (TYPE_CODE (t1
[i
].type
) != TYPE_CODE (VALUE_TYPE (t2
[i
])))
2113 if (varargs
|| t2
[i
] == NULL
)
2118 /* Helper function used by value_struct_elt to recurse through baseclasses.
2119 Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
2120 and search in it assuming it has (class) type TYPE.
2121 If found, return value, else return NULL.
2123 If LOOKING_FOR_BASECLASS, then instead of looking for struct fields,
2124 look for a baseclass named NAME. */
2126 static struct value
*
2127 search_struct_field (char *name
, struct value
*arg1
, int offset
,
2128 register struct type
*type
, int looking_for_baseclass
)
2131 int nbases
= TYPE_N_BASECLASSES (type
);
2133 CHECK_TYPEDEF (type
);
2135 if (!looking_for_baseclass
)
2136 for (i
= TYPE_NFIELDS (type
) - 1; i
>= nbases
; i
--)
2138 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
2140 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
2143 if (TYPE_FIELD_STATIC (type
, i
))
2145 v
= value_static_field (type
, i
);
2147 error ("field %s is nonexistent or has been optimised out",
2152 v
= value_primitive_field (arg1
, offset
, i
, type
);
2154 error ("there is no field named %s", name
);
2160 && (t_field_name
[0] == '\0'
2161 || (TYPE_CODE (type
) == TYPE_CODE_UNION
2162 && (strcmp_iw (t_field_name
, "else") == 0))))
2164 struct type
*field_type
= TYPE_FIELD_TYPE (type
, i
);
2165 if (TYPE_CODE (field_type
) == TYPE_CODE_UNION
2166 || TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
)
2168 /* Look for a match through the fields of an anonymous union,
2169 or anonymous struct. C++ provides anonymous unions.
2171 In the GNU Chill (OBSOLETE) implementation of
2172 variant record types, each <alternative field> has
2173 an (anonymous) union type, each member of the union
2174 represents a <variant alternative>. Each <variant
2175 alternative> is represented as a struct, with a
2176 member for each <variant field>. */
2179 int new_offset
= offset
;
2181 /* This is pretty gross. In G++, the offset in an
2182 anonymous union is relative to the beginning of the
2183 enclosing struct. In the GNU Chill (OBSOLETE)
2184 implementation of variant records, the bitpos is
2185 zero in an anonymous union field, so we have to add
2186 the offset of the union here. */
2187 if (TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
2188 || (TYPE_NFIELDS (field_type
) > 0
2189 && TYPE_FIELD_BITPOS (field_type
, 0) == 0))
2190 new_offset
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
2192 v
= search_struct_field (name
, arg1
, new_offset
, field_type
,
2193 looking_for_baseclass
);
2200 for (i
= 0; i
< nbases
; i
++)
2203 struct type
*basetype
= check_typedef (TYPE_BASECLASS (type
, i
));
2204 /* If we are looking for baseclasses, this is what we get when we
2205 hit them. But it could happen that the base part's member name
2206 is not yet filled in. */
2207 int found_baseclass
= (looking_for_baseclass
2208 && TYPE_BASECLASS_NAME (type
, i
) != NULL
2209 && (strcmp_iw (name
, TYPE_BASECLASS_NAME (type
, i
)) == 0));
2211 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2214 struct value
*v2
= allocate_value (basetype
);
2216 boffset
= baseclass_offset (type
, i
,
2217 VALUE_CONTENTS (arg1
) + offset
,
2218 VALUE_ADDRESS (arg1
)
2219 + VALUE_OFFSET (arg1
) + offset
);
2221 error ("virtual baseclass botch");
2223 /* The virtual base class pointer might have been clobbered by the
2224 user program. Make sure that it still points to a valid memory
2228 if (boffset
< 0 || boffset
>= TYPE_LENGTH (type
))
2230 CORE_ADDR base_addr
;
2232 base_addr
= VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
) + boffset
;
2233 if (target_read_memory (base_addr
, VALUE_CONTENTS_RAW (v2
),
2234 TYPE_LENGTH (basetype
)) != 0)
2235 error ("virtual baseclass botch");
2236 VALUE_LVAL (v2
) = lval_memory
;
2237 VALUE_ADDRESS (v2
) = base_addr
;
2241 VALUE_LVAL (v2
) = VALUE_LVAL (arg1
);
2242 VALUE_ADDRESS (v2
) = VALUE_ADDRESS (arg1
);
2243 VALUE_OFFSET (v2
) = VALUE_OFFSET (arg1
) + boffset
;
2244 if (VALUE_LAZY (arg1
))
2245 VALUE_LAZY (v2
) = 1;
2247 memcpy (VALUE_CONTENTS_RAW (v2
),
2248 VALUE_CONTENTS_RAW (arg1
) + boffset
,
2249 TYPE_LENGTH (basetype
));
2252 if (found_baseclass
)
2254 v
= search_struct_field (name
, v2
, 0, TYPE_BASECLASS (type
, i
),
2255 looking_for_baseclass
);
2257 else if (found_baseclass
)
2258 v
= value_primitive_field (arg1
, offset
, i
, type
);
2260 v
= search_struct_field (name
, arg1
,
2261 offset
+ TYPE_BASECLASS_BITPOS (type
, i
) / 8,
2262 basetype
, looking_for_baseclass
);
2270 /* Return the offset (in bytes) of the virtual base of type BASETYPE
2271 * in an object pointed to by VALADDR (on the host), assumed to be of
2272 * type TYPE. OFFSET is number of bytes beyond start of ARG to start
2273 * looking (in case VALADDR is the contents of an enclosing object).
2275 * This routine recurses on the primary base of the derived class because
2276 * the virtual base entries of the primary base appear before the other
2277 * virtual base entries.
2279 * If the virtual base is not found, a negative integer is returned.
2280 * The magnitude of the negative integer is the number of entries in
2281 * the virtual table to skip over (entries corresponding to various
2282 * ancestral classes in the chain of primary bases).
2284 * Important: This assumes the HP / Taligent C++ runtime
2285 * conventions. Use baseclass_offset() instead to deal with g++
2289 find_rt_vbase_offset (struct type
*type
, struct type
*basetype
, char *valaddr
,
2290 int offset
, int *boffset_p
, int *skip_p
)
2292 int boffset
; /* offset of virtual base */
2293 int index
; /* displacement to use in virtual table */
2297 CORE_ADDR vtbl
; /* the virtual table pointer */
2298 struct type
*pbc
; /* the primary base class */
2300 /* Look for the virtual base recursively in the primary base, first.
2301 * This is because the derived class object and its primary base
2302 * subobject share the primary virtual table. */
2305 pbc
= TYPE_PRIMARY_BASE (type
);
2308 find_rt_vbase_offset (pbc
, basetype
, valaddr
, offset
, &boffset
, &skip
);
2311 *boffset_p
= boffset
;
2320 /* Find the index of the virtual base according to HP/Taligent
2321 runtime spec. (Depth-first, left-to-right.) */
2322 index
= virtual_base_index_skip_primaries (basetype
, type
);
2326 *skip_p
= skip
+ virtual_base_list_length_skip_primaries (type
);
2331 /* pai: FIXME -- 32x64 possible problem */
2332 /* First word (4 bytes) in object layout is the vtable pointer */
2333 vtbl
= *(CORE_ADDR
*) (valaddr
+ offset
);
2335 /* Before the constructor is invoked, things are usually zero'd out. */
2337 error ("Couldn't find virtual table -- object may not be constructed yet.");
2340 /* Find virtual base's offset -- jump over entries for primary base
2341 * ancestors, then use the index computed above. But also adjust by
2342 * HP_ACC_VBASE_START for the vtable slots before the start of the
2343 * virtual base entries. Offset is negative -- virtual base entries
2344 * appear _before_ the address point of the virtual table. */
2346 /* pai: FIXME -- 32x64 problem, if word = 8 bytes, change multiplier
2349 /* epstein : FIXME -- added param for overlay section. May not be correct */
2350 vp
= value_at (builtin_type_int
, vtbl
+ 4 * (-skip
- index
- HP_ACC_VBASE_START
), NULL
);
2351 boffset
= value_as_long (vp
);
2353 *boffset_p
= boffset
;
2358 /* Helper function used by value_struct_elt to recurse through baseclasses.
2359 Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
2360 and search in it assuming it has (class) type TYPE.
2361 If found, return value, else if name matched and args not return (value)-1,
2362 else return NULL. */
2364 static struct value
*
2365 search_struct_method (char *name
, struct value
**arg1p
,
2366 struct value
**args
, int offset
,
2367 int *static_memfuncp
, register struct type
*type
)
2371 int name_matched
= 0;
2372 char dem_opname
[64];
2374 CHECK_TYPEDEF (type
);
2375 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
2377 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
2378 /* FIXME! May need to check for ARM demangling here */
2379 if (strncmp (t_field_name
, "__", 2) == 0 ||
2380 strncmp (t_field_name
, "op", 2) == 0 ||
2381 strncmp (t_field_name
, "type", 4) == 0)
2383 if (cplus_demangle_opname (t_field_name
, dem_opname
, DMGL_ANSI
))
2384 t_field_name
= dem_opname
;
2385 else if (cplus_demangle_opname (t_field_name
, dem_opname
, 0))
2386 t_field_name
= dem_opname
;
2388 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
2390 int j
= TYPE_FN_FIELDLIST_LENGTH (type
, i
) - 1;
2391 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
2394 check_stub_method_group (type
, i
);
2395 if (j
> 0 && args
== 0)
2396 error ("cannot resolve overloaded method `%s': no arguments supplied", name
);
2397 else if (j
== 0 && args
== 0)
2399 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
2406 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f
, j
),
2407 TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f
, j
)),
2408 TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f
, j
)),
2409 TYPE_FN_FIELD_ARGS (f
, j
), args
))
2411 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
2412 return value_virtual_fn_field (arg1p
, f
, j
, type
, offset
);
2413 if (TYPE_FN_FIELD_STATIC_P (f
, j
) && static_memfuncp
)
2414 *static_memfuncp
= 1;
2415 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
2424 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2428 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2430 if (TYPE_HAS_VTABLE (type
))
2432 /* HP aCC compiled type, search for virtual base offset
2433 according to HP/Taligent runtime spec. */
2435 find_rt_vbase_offset (type
, TYPE_BASECLASS (type
, i
),
2436 VALUE_CONTENTS_ALL (*arg1p
),
2437 offset
+ VALUE_EMBEDDED_OFFSET (*arg1p
),
2438 &base_offset
, &skip
);
2440 error ("Virtual base class offset not found in vtable");
2444 struct type
*baseclass
= check_typedef (TYPE_BASECLASS (type
, i
));
2447 /* The virtual base class pointer might have been clobbered by the
2448 user program. Make sure that it still points to a valid memory
2451 if (offset
< 0 || offset
>= TYPE_LENGTH (type
))
2453 base_valaddr
= (char *) alloca (TYPE_LENGTH (baseclass
));
2454 if (target_read_memory (VALUE_ADDRESS (*arg1p
)
2455 + VALUE_OFFSET (*arg1p
) + offset
,
2457 TYPE_LENGTH (baseclass
)) != 0)
2458 error ("virtual baseclass botch");
2461 base_valaddr
= VALUE_CONTENTS (*arg1p
) + offset
;
2464 baseclass_offset (type
, i
, base_valaddr
,
2465 VALUE_ADDRESS (*arg1p
)
2466 + VALUE_OFFSET (*arg1p
) + offset
);
2467 if (base_offset
== -1)
2468 error ("virtual baseclass botch");
2473 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2475 v
= search_struct_method (name
, arg1p
, args
, base_offset
+ offset
,
2476 static_memfuncp
, TYPE_BASECLASS (type
, i
));
2477 if (v
== (struct value
*) - 1)
2483 /* FIXME-bothner: Why is this commented out? Why is it here? */
2484 /* *arg1p = arg1_tmp; */
2489 return (struct value
*) - 1;
2494 /* Given *ARGP, a value of type (pointer to a)* structure/union,
2495 extract the component named NAME from the ultimate target structure/union
2496 and return it as a value with its appropriate type.
2497 ERR is used in the error message if *ARGP's type is wrong.
2499 C++: ARGS is a list of argument types to aid in the selection of
2500 an appropriate method. Also, handle derived types.
2502 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
2503 where the truthvalue of whether the function that was resolved was
2504 a static member function or not is stored.
2506 ERR is an error message to be printed in case the field is not found. */
2509 value_struct_elt (struct value
**argp
, struct value
**args
,
2510 char *name
, int *static_memfuncp
, char *err
)
2512 register struct type
*t
;
2515 COERCE_ARRAY (*argp
);
2517 t
= check_typedef (VALUE_TYPE (*argp
));
2519 /* Follow pointers until we get to a non-pointer. */
2521 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
2523 *argp
= value_ind (*argp
);
2524 /* Don't coerce fn pointer to fn and then back again! */
2525 if (TYPE_CODE (VALUE_TYPE (*argp
)) != TYPE_CODE_FUNC
)
2526 COERCE_ARRAY (*argp
);
2527 t
= check_typedef (VALUE_TYPE (*argp
));
2530 if (TYPE_CODE (t
) == TYPE_CODE_MEMBER
)
2531 error ("not implemented: member type in value_struct_elt");
2533 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2534 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2535 error ("Attempt to extract a component of a value that is not a %s.", err
);
2537 /* Assume it's not, unless we see that it is. */
2538 if (static_memfuncp
)
2539 *static_memfuncp
= 0;
2543 /* if there are no arguments ...do this... */
2545 /* Try as a field first, because if we succeed, there
2546 is less work to be done. */
2547 v
= search_struct_field (name
, *argp
, 0, t
, 0);
2551 /* C++: If it was not found as a data field, then try to
2552 return it as a pointer to a method. */
2554 if (destructor_name_p (name
, t
))
2555 error ("Cannot get value of destructor");
2557 v
= search_struct_method (name
, argp
, args
, 0, static_memfuncp
, t
);
2559 if (v
== (struct value
*) - 1)
2560 error ("Cannot take address of a method");
2563 if (TYPE_NFN_FIELDS (t
))
2564 error ("There is no member or method named %s.", name
);
2566 error ("There is no member named %s.", name
);
2571 if (destructor_name_p (name
, t
))
2575 /* Destructors are a special case. */
2576 int m_index
, f_index
;
2579 if (get_destructor_fn_field (t
, &m_index
, &f_index
))
2581 v
= value_fn_field (NULL
, TYPE_FN_FIELDLIST1 (t
, m_index
),
2585 error ("could not find destructor function named %s.", name
);
2591 error ("destructor should not have any argument");
2595 v
= search_struct_method (name
, argp
, args
, 0, static_memfuncp
, t
);
2597 if (v
== (struct value
*) - 1)
2599 error ("One of the arguments you tried to pass to %s could not be converted to what the function wants.", name
);
2603 /* See if user tried to invoke data as function. If so,
2604 hand it back. If it's not callable (i.e., a pointer to function),
2605 gdb should give an error. */
2606 v
= search_struct_field (name
, *argp
, 0, t
, 0);
2610 error ("Structure has no component named %s.", name
);
2614 /* Search through the methods of an object (and its bases)
2615 * to find a specified method. Return the pointer to the
2616 * fn_field list of overloaded instances.
2617 * Helper function for value_find_oload_list.
2618 * ARGP is a pointer to a pointer to a value (the object)
2619 * METHOD is a string containing the method name
2620 * OFFSET is the offset within the value
2621 * TYPE is the assumed type of the object
2622 * NUM_FNS is the number of overloaded instances
2623 * BASETYPE is set to the actual type of the subobject where the method is found
2624 * BOFFSET is the offset of the base subobject where the method is found */
2626 static struct fn_field
*
2627 find_method_list (struct value
**argp
, char *method
, int offset
,
2628 struct type
*type
, int *num_fns
,
2629 struct type
**basetype
, int *boffset
)
2633 CHECK_TYPEDEF (type
);
2637 /* First check in object itself */
2638 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
2640 /* pai: FIXME What about operators and type conversions? */
2641 char *fn_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
2642 if (fn_field_name
&& (strcmp_iw (fn_field_name
, method
) == 0))
2644 int len
= TYPE_FN_FIELDLIST_LENGTH (type
, i
);
2645 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
2651 /* Resolve any stub methods. */
2652 check_stub_method_group (type
, i
);
2658 /* Not found in object, check in base subobjects */
2659 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2662 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2664 if (TYPE_HAS_VTABLE (type
))
2666 /* HP aCC compiled type, search for virtual base offset
2667 * according to HP/Taligent runtime spec. */
2669 find_rt_vbase_offset (type
, TYPE_BASECLASS (type
, i
),
2670 VALUE_CONTENTS_ALL (*argp
),
2671 offset
+ VALUE_EMBEDDED_OFFSET (*argp
),
2672 &base_offset
, &skip
);
2674 error ("Virtual base class offset not found in vtable");
2678 /* probably g++ runtime model */
2679 base_offset
= VALUE_OFFSET (*argp
) + offset
;
2681 baseclass_offset (type
, i
,
2682 VALUE_CONTENTS (*argp
) + base_offset
,
2683 VALUE_ADDRESS (*argp
) + base_offset
);
2684 if (base_offset
== -1)
2685 error ("virtual baseclass botch");
2689 /* non-virtual base, simply use bit position from debug info */
2691 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2693 f
= find_method_list (argp
, method
, base_offset
+ offset
,
2694 TYPE_BASECLASS (type
, i
), num_fns
, basetype
,
2702 /* Return the list of overloaded methods of a specified name.
2703 * ARGP is a pointer to a pointer to a value (the object)
2704 * METHOD is the method name
2705 * OFFSET is the offset within the value contents
2706 * NUM_FNS is the number of overloaded instances
2707 * BASETYPE is set to the type of the base subobject that defines the method
2708 * BOFFSET is the offset of the base subobject which defines the method */
2711 value_find_oload_method_list (struct value
**argp
, char *method
, int offset
,
2712 int *num_fns
, struct type
**basetype
,
2717 t
= check_typedef (VALUE_TYPE (*argp
));
2719 /* code snarfed from value_struct_elt */
2720 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
2722 *argp
= value_ind (*argp
);
2723 /* Don't coerce fn pointer to fn and then back again! */
2724 if (TYPE_CODE (VALUE_TYPE (*argp
)) != TYPE_CODE_FUNC
)
2725 COERCE_ARRAY (*argp
);
2726 t
= check_typedef (VALUE_TYPE (*argp
));
2729 if (TYPE_CODE (t
) == TYPE_CODE_MEMBER
)
2730 error ("Not implemented: member type in value_find_oload_lis");
2732 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2733 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2734 error ("Attempt to extract a component of a value that is not a struct or union");
2736 return find_method_list (argp
, method
, 0, t
, num_fns
, basetype
, boffset
);
2739 /* Given an array of argument types (ARGTYPES) (which includes an
2740 entry for "this" in the case of C++ methods), the number of
2741 arguments NARGS, the NAME of a function whether it's a method or
2742 not (METHOD), and the degree of laxness (LAX) in conforming to
2743 overload resolution rules in ANSI C++, find the best function that
2744 matches on the argument types according to the overload resolution
2747 In the case of class methods, the parameter OBJ is an object value
2748 in which to search for overloaded methods.
2750 In the case of non-method functions, the parameter FSYM is a symbol
2751 corresponding to one of the overloaded functions.
2753 Return value is an integer: 0 -> good match, 10 -> debugger applied
2754 non-standard coercions, 100 -> incompatible.
2756 If a method is being searched for, VALP will hold the value.
2757 If a non-method is being searched for, SYMP will hold the symbol for it.
2759 If a method is being searched for, and it is a static method,
2760 then STATICP will point to a non-zero value.
2762 Note: This function does *not* check the value of
2763 overload_resolution. Caller must check it to see whether overload
2764 resolution is permitted.
2768 find_overload_match (struct type
**arg_types
, int nargs
, char *name
, int method
,
2769 int lax
, struct value
**objp
, struct symbol
*fsym
,
2770 struct value
**valp
, struct symbol
**symp
, int *staticp
)
2773 struct type
**parm_types
;
2774 int champ_nparms
= 0;
2775 struct value
*obj
= (objp
? *objp
: NULL
);
2777 short oload_champ
= -1; /* Index of best overloaded function */
2778 short oload_ambiguous
= 0; /* Current ambiguity state for overload resolution */
2779 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs */
2780 short oload_ambig_champ
= -1; /* 2nd contender for best match */
2781 short oload_non_standard
= 0; /* did we have to use non-standard conversions? */
2782 short oload_incompatible
= 0; /* are args supplied incompatible with any function? */
2784 struct badness_vector
*bv
; /* A measure of how good an overloaded instance is */
2785 struct badness_vector
*oload_champ_bv
= NULL
; /* The measure for the current best match */
2787 struct value
*temp
= obj
;
2788 struct fn_field
*fns_ptr
= NULL
; /* For methods, the list of overloaded methods */
2789 struct symbol
**oload_syms
= NULL
; /* For non-methods, the list of overloaded function symbols */
2790 int num_fns
= 0; /* Number of overloaded instances being considered */
2791 struct type
*basetype
= NULL
;
2796 struct cleanup
*cleanups
= NULL
;
2798 char *obj_type_name
= NULL
;
2799 char *func_name
= NULL
;
2801 /* Get the list of overloaded methods or functions */
2804 obj_type_name
= TYPE_NAME (VALUE_TYPE (obj
));
2805 /* Hack: evaluate_subexp_standard often passes in a pointer
2806 value rather than the object itself, so try again */
2807 if ((!obj_type_name
|| !*obj_type_name
) &&
2808 (TYPE_CODE (VALUE_TYPE (obj
)) == TYPE_CODE_PTR
))
2809 obj_type_name
= TYPE_NAME (TYPE_TARGET_TYPE (VALUE_TYPE (obj
)));
2811 fns_ptr
= value_find_oload_method_list (&temp
, name
, 0,
2813 &basetype
, &boffset
);
2814 if (!fns_ptr
|| !num_fns
)
2815 error ("Couldn't find method %s%s%s",
2817 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2819 /* If we are dealing with stub method types, they should have
2820 been resolved by find_method_list via value_find_oload_method_list
2822 gdb_assert (TYPE_DOMAIN_TYPE (fns_ptr
[0].type
) != NULL
);
2827 func_name
= cplus_demangle (SYMBOL_NAME (fsym
), DMGL_NO_OPTS
);
2829 /* If the name is NULL this must be a C-style function.
2830 Just return the same symbol. */
2837 oload_syms
= make_symbol_overload_list (fsym
);
2838 cleanups
= make_cleanup (xfree
, oload_syms
);
2839 while (oload_syms
[++i
])
2842 error ("Couldn't find function %s", func_name
);
2845 oload_champ_bv
= NULL
;
2847 /* Consider each candidate in turn */
2848 for (ix
= 0; ix
< num_fns
; ix
++)
2853 if (TYPE_FN_FIELD_STATIC_P (fns_ptr
, ix
))
2855 nparms
= TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (fns_ptr
, ix
));
2859 /* If it's not a method, this is the proper place */
2860 nparms
=TYPE_NFIELDS(SYMBOL_TYPE(oload_syms
[ix
]));
2863 /* Prepare array of parameter types */
2864 parm_types
= (struct type
**) xmalloc (nparms
* (sizeof (struct type
*)));
2865 for (jj
= 0; jj
< nparms
; jj
++)
2866 parm_types
[jj
] = (method
2867 ? (TYPE_FN_FIELD_ARGS (fns_ptr
, ix
)[jj
].type
)
2868 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms
[ix
]), jj
));
2870 /* Compare parameter types to supplied argument types. Skip THIS for
2872 bv
= rank_function (parm_types
, nparms
, arg_types
+ static_offset
,
2873 nargs
- static_offset
);
2875 if (!oload_champ_bv
)
2877 oload_champ_bv
= bv
;
2879 champ_nparms
= nparms
;
2882 /* See whether current candidate is better or worse than previous best */
2883 switch (compare_badness (bv
, oload_champ_bv
))
2886 oload_ambiguous
= 1; /* top two contenders are equally good */
2887 oload_ambig_champ
= ix
;
2890 oload_ambiguous
= 2; /* incomparable top contenders */
2891 oload_ambig_champ
= ix
;
2894 oload_champ_bv
= bv
; /* new champion, record details */
2895 oload_ambiguous
= 0;
2897 oload_ambig_champ
= -1;
2898 champ_nparms
= nparms
;
2908 fprintf_filtered (gdb_stderr
,"Overloaded method instance %s, # of parms %d\n", fns_ptr
[ix
].physname
, nparms
);
2910 fprintf_filtered (gdb_stderr
,"Overloaded function instance %s # of parms %d\n", SYMBOL_DEMANGLED_NAME (oload_syms
[ix
]), nparms
);
2911 for (jj
= 0; jj
< nargs
- static_offset
; jj
++)
2912 fprintf_filtered (gdb_stderr
,"...Badness @ %d : %d\n", jj
, bv
->rank
[jj
]);
2913 fprintf_filtered (gdb_stderr
,"Overload resolution champion is %d, ambiguous? %d\n", oload_champ
, oload_ambiguous
);
2915 } /* end loop over all candidates */
2916 /* NOTE: dan/2000-03-10: Seems to be a better idea to just pick one
2917 if they have the exact same goodness. This is because there is no
2918 way to differentiate based on return type, which we need to in
2919 cases like overloads of .begin() <It's both const and non-const> */
2921 if (oload_ambiguous
)
2924 error ("Cannot resolve overloaded method %s%s%s to unique instance; disambiguate by specifying function signature",
2926 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2929 error ("Cannot resolve overloaded function %s to unique instance; disambiguate by specifying function signature",
2934 /* Check how bad the best match is. */
2936 if (method
&& TYPE_FN_FIELD_STATIC_P (fns_ptr
, oload_champ
))
2938 for (ix
= 1; ix
<= nargs
- static_offset
; ix
++)
2940 if (oload_champ_bv
->rank
[ix
] >= 100)
2941 oload_incompatible
= 1; /* truly mismatched types */
2943 else if (oload_champ_bv
->rank
[ix
] >= 10)
2944 oload_non_standard
= 1; /* non-standard type conversions needed */
2946 if (oload_incompatible
)
2949 error ("Cannot resolve method %s%s%s to any overloaded instance",
2951 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2954 error ("Cannot resolve function %s to any overloaded instance",
2957 else if (oload_non_standard
)
2960 warning ("Using non-standard conversion to match method %s%s%s to supplied arguments",
2962 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2965 warning ("Using non-standard conversion to match function %s to supplied arguments",
2971 if (staticp
&& TYPE_FN_FIELD_STATIC_P (fns_ptr
, oload_champ
))
2975 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr
, oload_champ
))
2976 *valp
= value_virtual_fn_field (&temp
, fns_ptr
, oload_champ
, basetype
, boffset
);
2978 *valp
= value_fn_field (&temp
, fns_ptr
, oload_champ
, basetype
, boffset
);
2982 *symp
= oload_syms
[oload_champ
];
2988 if (TYPE_CODE (VALUE_TYPE (temp
)) != TYPE_CODE_PTR
2989 && TYPE_CODE (VALUE_TYPE (*objp
)) == TYPE_CODE_PTR
)
2991 temp
= value_addr (temp
);
2995 if (cleanups
!= NULL
)
2996 do_cleanups (cleanups
);
2998 return oload_incompatible
? 100 : (oload_non_standard
? 10 : 0);
3001 /* C++: return 1 is NAME is a legitimate name for the destructor
3002 of type TYPE. If TYPE does not have a destructor, or
3003 if NAME is inappropriate for TYPE, an error is signaled. */
3005 destructor_name_p (const char *name
, const struct type
*type
)
3007 /* destructors are a special case. */
3011 char *dname
= type_name_no_tag (type
);
3012 char *cp
= strchr (dname
, '<');
3015 /* Do not compare the template part for template classes. */
3017 len
= strlen (dname
);
3020 if (strlen (name
+ 1) != len
|| !STREQN (dname
, name
+ 1, len
))
3021 error ("name of destructor must equal name of class");
3028 /* Helper function for check_field: Given TYPE, a structure/union,
3029 return 1 if the component named NAME from the ultimate
3030 target structure/union is defined, otherwise, return 0. */
3033 check_field_in (register struct type
*type
, const char *name
)
3037 for (i
= TYPE_NFIELDS (type
) - 1; i
>= TYPE_N_BASECLASSES (type
); i
--)
3039 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
3040 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
3044 /* C++: If it was not found as a data field, then try to
3045 return it as a pointer to a method. */
3047 /* Destructors are a special case. */
3048 if (destructor_name_p (name
, type
))
3050 int m_index
, f_index
;
3052 return get_destructor_fn_field (type
, &m_index
, &f_index
);
3055 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; --i
)
3057 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type
, i
), name
) == 0)
3061 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
3062 if (check_field_in (TYPE_BASECLASS (type
, i
), name
))
3069 /* C++: Given ARG1, a value of type (pointer to a)* structure/union,
3070 return 1 if the component named NAME from the ultimate
3071 target structure/union is defined, otherwise, return 0. */
3074 check_field (struct value
*arg1
, const char *name
)
3076 register struct type
*t
;
3078 COERCE_ARRAY (arg1
);
3080 t
= VALUE_TYPE (arg1
);
3082 /* Follow pointers until we get to a non-pointer. */
3087 if (TYPE_CODE (t
) != TYPE_CODE_PTR
&& TYPE_CODE (t
) != TYPE_CODE_REF
)
3089 t
= TYPE_TARGET_TYPE (t
);
3092 if (TYPE_CODE (t
) == TYPE_CODE_MEMBER
)
3093 error ("not implemented: member type in check_field");
3095 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
3096 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
3097 error ("Internal error: `this' is not an aggregate");
3099 return check_field_in (t
, name
);
3102 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3103 return the address of this member as a "pointer to member"
3104 type. If INTYPE is non-null, then it will be the type
3105 of the member we are looking for. This will help us resolve
3106 "pointers to member functions". This function is used
3107 to resolve user expressions of the form "DOMAIN::NAME". */
3110 value_struct_elt_for_reference (struct type
*domain
, int offset
,
3111 struct type
*curtype
, char *name
,
3112 struct type
*intype
)
3114 register struct type
*t
= curtype
;
3118 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
3119 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
3120 error ("Internal error: non-aggregate type to value_struct_elt_for_reference");
3122 for (i
= TYPE_NFIELDS (t
) - 1; i
>= TYPE_N_BASECLASSES (t
); i
--)
3124 char *t_field_name
= TYPE_FIELD_NAME (t
, i
);
3126 if (t_field_name
&& STREQ (t_field_name
, name
))
3128 if (TYPE_FIELD_STATIC (t
, i
))
3130 v
= value_static_field (t
, i
);
3132 error ("static field %s has been optimized out",
3136 if (TYPE_FIELD_PACKED (t
, i
))
3137 error ("pointers to bitfield members not allowed");
3139 return value_from_longest
3140 (lookup_reference_type (lookup_member_type (TYPE_FIELD_TYPE (t
, i
),
3142 offset
+ (LONGEST
) (TYPE_FIELD_BITPOS (t
, i
) >> 3));
3146 /* C++: If it was not found as a data field, then try to
3147 return it as a pointer to a method. */
3149 /* Destructors are a special case. */
3150 if (destructor_name_p (name
, t
))
3152 error ("member pointers to destructors not implemented yet");
3155 /* Perform all necessary dereferencing. */
3156 while (intype
&& TYPE_CODE (intype
) == TYPE_CODE_PTR
)
3157 intype
= TYPE_TARGET_TYPE (intype
);
3159 for (i
= TYPE_NFN_FIELDS (t
) - 1; i
>= 0; --i
)
3161 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (t
, i
);
3162 char dem_opname
[64];
3164 if (strncmp (t_field_name
, "__", 2) == 0 ||
3165 strncmp (t_field_name
, "op", 2) == 0 ||
3166 strncmp (t_field_name
, "type", 4) == 0)
3168 if (cplus_demangle_opname (t_field_name
, dem_opname
, DMGL_ANSI
))
3169 t_field_name
= dem_opname
;
3170 else if (cplus_demangle_opname (t_field_name
, dem_opname
, 0))
3171 t_field_name
= dem_opname
;
3173 if (t_field_name
&& STREQ (t_field_name
, name
))
3175 int j
= TYPE_FN_FIELDLIST_LENGTH (t
, i
);
3176 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (t
, i
);
3178 check_stub_method_group (t
, i
);
3180 if (intype
== 0 && j
> 1)
3181 error ("non-unique member `%s' requires type instantiation", name
);
3185 if (TYPE_FN_FIELD_TYPE (f
, j
) == intype
)
3188 error ("no member function matches that type instantiation");
3193 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
3195 return value_from_longest
3196 (lookup_reference_type
3197 (lookup_member_type (TYPE_FN_FIELD_TYPE (f
, j
),
3199 (LONGEST
) METHOD_PTR_FROM_VOFFSET (TYPE_FN_FIELD_VOFFSET (f
, j
)));
3203 struct symbol
*s
= lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
3204 0, VAR_NAMESPACE
, 0, NULL
);
3211 v
= read_var_value (s
, 0);
3213 VALUE_TYPE (v
) = lookup_reference_type
3214 (lookup_member_type (TYPE_FN_FIELD_TYPE (f
, j
),
3222 for (i
= TYPE_N_BASECLASSES (t
) - 1; i
>= 0; i
--)
3227 if (BASETYPE_VIA_VIRTUAL (t
, i
))
3230 base_offset
= TYPE_BASECLASS_BITPOS (t
, i
) / 8;
3231 v
= value_struct_elt_for_reference (domain
,
3232 offset
+ base_offset
,
3233 TYPE_BASECLASS (t
, i
),
3243 /* Given a pointer value V, find the real (RTTI) type
3244 of the object it points to.
3245 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
3246 and refer to the values computed for the object pointed to. */
3249 value_rtti_target_type (struct value
*v
, int *full
, int *top
, int *using_enc
)
3251 struct value
*target
;
3253 target
= value_ind (v
);
3255 return value_rtti_type (target
, full
, top
, using_enc
);
3258 /* Given a value pointed to by ARGP, check its real run-time type, and
3259 if that is different from the enclosing type, create a new value
3260 using the real run-time type as the enclosing type (and of the same
3261 type as ARGP) and return it, with the embedded offset adjusted to
3262 be the correct offset to the enclosed object
3263 RTYPE is the type, and XFULL, XTOP, and XUSING_ENC are the other
3264 parameters, computed by value_rtti_type(). If these are available,
3265 they can be supplied and a second call to value_rtti_type() is avoided.
3266 (Pass RTYPE == NULL if they're not available */
3269 value_full_object (struct value
*argp
, struct type
*rtype
, int xfull
, int xtop
,
3272 struct type
*real_type
;
3276 struct value
*new_val
;
3283 using_enc
= xusing_enc
;
3286 real_type
= value_rtti_type (argp
, &full
, &top
, &using_enc
);
3288 /* If no RTTI data, or if object is already complete, do nothing */
3289 if (!real_type
|| real_type
== VALUE_ENCLOSING_TYPE (argp
))
3292 /* If we have the full object, but for some reason the enclosing
3293 type is wrong, set it *//* pai: FIXME -- sounds iffy */
3296 argp
= value_change_enclosing_type (argp
, real_type
);
3300 /* Check if object is in memory */
3301 if (VALUE_LVAL (argp
) != lval_memory
)
3303 warning ("Couldn't retrieve complete object of RTTI type %s; object may be in register(s).", TYPE_NAME (real_type
));
3308 /* All other cases -- retrieve the complete object */
3309 /* Go back by the computed top_offset from the beginning of the object,
3310 adjusting for the embedded offset of argp if that's what value_rtti_type
3311 used for its computation. */
3312 new_val
= value_at_lazy (real_type
, VALUE_ADDRESS (argp
) - top
+
3313 (using_enc
? 0 : VALUE_EMBEDDED_OFFSET (argp
)),
3314 VALUE_BFD_SECTION (argp
));
3315 VALUE_TYPE (new_val
) = VALUE_TYPE (argp
);
3316 VALUE_EMBEDDED_OFFSET (new_val
) = using_enc
? top
+ VALUE_EMBEDDED_OFFSET (argp
) : top
;
3320 /* Return the value of the local variable, if one exists.
3321 Flag COMPLAIN signals an error if the request is made in an
3322 inappropriate context. */
3325 value_of_local (const char *name
, int complain
)
3327 struct symbol
*func
, *sym
;
3332 if (selected_frame
== 0)
3335 error ("no frame selected");
3340 func
= get_frame_function (selected_frame
);
3344 error ("no %s in nameless context", name
);
3349 b
= SYMBOL_BLOCK_VALUE (func
);
3350 i
= BLOCK_NSYMS (b
);
3354 error ("no args, no %s", name
);
3359 /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER
3360 symbol instead of the LOC_ARG one (if both exist). */
3361 sym
= lookup_block_symbol (b
, name
, NULL
, VAR_NAMESPACE
);
3365 error ("current stack frame does not contain a variable named \"%s\"", name
);
3370 ret
= read_var_value (sym
, selected_frame
);
3371 if (ret
== 0 && complain
)
3372 error ("%s argument unreadable", name
);
3376 /* C++/Objective-C: return the value of the class instance variable,
3377 if one exists. Flag COMPLAIN signals an error if the request is
3378 made in an inappropriate context. */
3381 value_of_this (int complain
)
3383 if (current_language
->la_language
== language_objc
)
3384 return value_of_local ("self", complain
);
3386 return value_of_local ("this", complain
);
3389 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH elements
3390 long, starting at LOWBOUND. The result has the same lower bound as
3391 the original ARRAY. */
3394 value_slice (struct value
*array
, int lowbound
, int length
)
3396 struct type
*slice_range_type
, *slice_type
, *range_type
;
3397 LONGEST lowerbound
, upperbound
, offset
;
3398 struct value
*slice
;
3399 struct type
*array_type
;
3400 array_type
= check_typedef (VALUE_TYPE (array
));
3401 COERCE_VARYING_ARRAY (array
, array_type
);
3402 if (TYPE_CODE (array_type
) != TYPE_CODE_ARRAY
3403 && TYPE_CODE (array_type
) != TYPE_CODE_STRING
3404 && TYPE_CODE (array_type
) != TYPE_CODE_BITSTRING
)
3405 error ("cannot take slice of non-array");
3406 range_type
= TYPE_INDEX_TYPE (array_type
);
3407 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
3408 error ("slice from bad array or bitstring");
3409 if (lowbound
< lowerbound
|| length
< 0
3410 || lowbound
+ length
- 1 > upperbound
)
3411 /* OBSOLETE Chill allows zero-length strings but not arrays. */
3412 /* OBSOLETE || (current_language->la_language == language_chill */
3413 /* OBSOLETE && length == 0 && TYPE_CODE (array_type) == TYPE_CODE_ARRAY)) */
3414 error ("slice out of range");
3415 /* FIXME-type-allocation: need a way to free this type when we are
3417 slice_range_type
= create_range_type ((struct type
*) NULL
,
3418 TYPE_TARGET_TYPE (range_type
),
3419 lowbound
, lowbound
+ length
- 1);
3420 if (TYPE_CODE (array_type
) == TYPE_CODE_BITSTRING
)
3423 slice_type
= create_set_type ((struct type
*) NULL
, slice_range_type
);
3424 TYPE_CODE (slice_type
) = TYPE_CODE_BITSTRING
;
3425 slice
= value_zero (slice_type
, not_lval
);
3426 for (i
= 0; i
< length
; i
++)
3428 int element
= value_bit_index (array_type
,
3429 VALUE_CONTENTS (array
),
3432 error ("internal error accessing bitstring");
3433 else if (element
> 0)
3435 int j
= i
% TARGET_CHAR_BIT
;
3436 if (BITS_BIG_ENDIAN
)
3437 j
= TARGET_CHAR_BIT
- 1 - j
;
3438 VALUE_CONTENTS_RAW (slice
)[i
/ TARGET_CHAR_BIT
] |= (1 << j
);
3441 /* We should set the address, bitssize, and bitspos, so the clice
3442 can be used on the LHS, but that may require extensions to
3443 value_assign. For now, just leave as a non_lval. FIXME. */
3447 struct type
*element_type
= TYPE_TARGET_TYPE (array_type
);
3449 = (lowbound
- lowerbound
) * TYPE_LENGTH (check_typedef (element_type
));
3450 slice_type
= create_array_type ((struct type
*) NULL
, element_type
,
3452 TYPE_CODE (slice_type
) = TYPE_CODE (array_type
);
3453 slice
= allocate_value (slice_type
);
3454 if (VALUE_LAZY (array
))
3455 VALUE_LAZY (slice
) = 1;
3457 memcpy (VALUE_CONTENTS (slice
), VALUE_CONTENTS (array
) + offset
,
3458 TYPE_LENGTH (slice_type
));
3459 if (VALUE_LVAL (array
) == lval_internalvar
)
3460 VALUE_LVAL (slice
) = lval_internalvar_component
;
3462 VALUE_LVAL (slice
) = VALUE_LVAL (array
);
3463 VALUE_ADDRESS (slice
) = VALUE_ADDRESS (array
);
3464 VALUE_OFFSET (slice
) = VALUE_OFFSET (array
) + offset
;
3469 /* Assuming OBSOLETE chill_varying_type (VARRAY) is true, return an
3470 equivalent value as a fixed-length array. */
3473 varying_to_slice (struct value
*varray
)
3475 struct type
*vtype
= check_typedef (VALUE_TYPE (varray
));
3476 LONGEST length
= unpack_long (TYPE_FIELD_TYPE (vtype
, 0),
3477 VALUE_CONTENTS (varray
)
3478 + TYPE_FIELD_BITPOS (vtype
, 0) / 8);
3479 return value_slice (value_primitive_field (varray
, 0, 1, vtype
), 0, length
);
3482 /* Create a value for a FORTRAN complex number. Currently most of
3483 the time values are coerced to COMPLEX*16 (i.e. a complex number
3484 composed of 2 doubles. This really should be a smarter routine
3485 that figures out precision inteligently as opposed to assuming
3486 doubles. FIXME: fmb */
3489 value_literal_complex (struct value
*arg1
, struct value
*arg2
, struct type
*type
)
3492 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3494 val
= allocate_value (type
);
3495 arg1
= value_cast (real_type
, arg1
);
3496 arg2
= value_cast (real_type
, arg2
);
3498 memcpy (VALUE_CONTENTS_RAW (val
),
3499 VALUE_CONTENTS (arg1
), TYPE_LENGTH (real_type
));
3500 memcpy (VALUE_CONTENTS_RAW (val
) + TYPE_LENGTH (real_type
),
3501 VALUE_CONTENTS (arg2
), TYPE_LENGTH (real_type
));
3505 /* Cast a value into the appropriate complex data type. */
3507 static struct value
*
3508 cast_into_complex (struct type
*type
, struct value
*val
)
3510 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3511 if (TYPE_CODE (VALUE_TYPE (val
)) == TYPE_CODE_COMPLEX
)
3513 struct type
*val_real_type
= TYPE_TARGET_TYPE (VALUE_TYPE (val
));
3514 struct value
*re_val
= allocate_value (val_real_type
);
3515 struct value
*im_val
= allocate_value (val_real_type
);
3517 memcpy (VALUE_CONTENTS_RAW (re_val
),
3518 VALUE_CONTENTS (val
), TYPE_LENGTH (val_real_type
));
3519 memcpy (VALUE_CONTENTS_RAW (im_val
),
3520 VALUE_CONTENTS (val
) + TYPE_LENGTH (val_real_type
),
3521 TYPE_LENGTH (val_real_type
));
3523 return value_literal_complex (re_val
, im_val
, type
);
3525 else if (TYPE_CODE (VALUE_TYPE (val
)) == TYPE_CODE_FLT
3526 || TYPE_CODE (VALUE_TYPE (val
)) == TYPE_CODE_INT
)
3527 return value_literal_complex (val
, value_zero (real_type
, not_lval
), type
);
3529 error ("cannot cast non-number to complex");
3533 _initialize_valops (void)
3537 (add_set_cmd ("abandon", class_support
, var_boolean
, (char *) &auto_abandon
,
3538 "Set automatic abandonment of expressions upon failure.",
3544 (add_set_cmd ("overload-resolution", class_support
, var_boolean
, (char *) &overload_resolution
,
3545 "Set overload resolution in evaluating C++ functions.",
3548 overload_resolution
= 1;
3551 add_set_cmd ("unwindonsignal", no_class
, var_boolean
,
3552 (char *) &unwind_on_signal_p
,
3553 "Set unwinding of stack if a signal is received while in a call dummy.\n\
3554 The unwindonsignal lets the user determine what gdb should do if a signal\n\
3555 is received while in a function called from gdb (call dummy). If set, gdb\n\
3556 unwinds the stack and restore the context to what as it was before the call.\n\
3557 The default is to stop in the frame where the signal was received.", &setlist
),