1 /* Perform non-arithmetic operations on values, for GDB.
2 Copyright 1986, 1987, 1989, 1991, 1992, 1993, 1994, 1995
3 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
33 #include "gdb_string.h"
35 /* Local functions. */
37 static int typecmp
PARAMS ((int staticp
, struct type
*t1
[], value_ptr t2
[]));
39 static CORE_ADDR find_function_addr
PARAMS ((value_ptr
, struct type
**));
41 static CORE_ADDR value_push
PARAMS ((CORE_ADDR
, value_ptr
));
43 static value_ptr search_struct_field
PARAMS ((char *, value_ptr
, int,
46 static value_ptr search_struct_method
PARAMS ((char *, value_ptr
*,
48 int, int *, struct type
*));
50 static int check_field_in
PARAMS ((struct type
*, const char *));
52 static CORE_ADDR allocate_space_in_inferior
PARAMS ((int));
54 static value_ptr cast_into_complex
PARAMS ((struct type
*, value_ptr
));
56 #define VALUE_SUBSTRING_START(VAL) VALUE_FRAME(VAL)
58 /* Flag for whether we want to abandon failed expression evals by default. */
60 static int auto_abandon
= 0;
63 /* Find the address of function name NAME in the inferior. */
66 find_function_in_inferior (name
)
69 register struct symbol
*sym
;
70 sym
= lookup_symbol (name
, 0, VAR_NAMESPACE
, 0, NULL
);
73 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
75 error ("\"%s\" exists in this program but is not a function.",
78 return value_of_variable (sym
, NULL
);
82 struct minimal_symbol
*msymbol
= lookup_minimal_symbol(name
, NULL
, NULL
);
87 type
= lookup_pointer_type (builtin_type_char
);
88 type
= lookup_function_type (type
);
89 type
= lookup_pointer_type (type
);
90 maddr
= (LONGEST
) SYMBOL_VALUE_ADDRESS (msymbol
);
91 return value_from_longest (type
, maddr
);
95 error ("evaluation of this expression requires the program to have a function \"%s\".", name
);
100 /* Allocate NBYTES of space in the inferior using the inferior's malloc
101 and return a value that is a pointer to the allocated space. */
104 value_allocate_space_in_inferior (len
)
108 register value_ptr val
= find_function_in_inferior ("malloc");
110 blocklen
= value_from_longest (builtin_type_int
, (LONGEST
) len
);
111 val
= call_function_by_hand (val
, 1, &blocklen
);
112 if (value_logical_not (val
))
114 error ("No memory available to program.");
120 allocate_space_in_inferior (len
)
123 return value_as_long (value_allocate_space_in_inferior (len
));
126 /* Cast value ARG2 to type TYPE and return as a value.
127 More general than a C cast: accepts any two types of the same length,
128 and if ARG2 is an lvalue it can be cast into anything at all. */
129 /* In C++, casts may change pointer or object representations. */
132 value_cast (type
, arg2
)
134 register value_ptr arg2
;
136 register enum type_code code1
;
137 register enum type_code code2
;
141 if (VALUE_TYPE (arg2
) == type
)
144 CHECK_TYPEDEF (type
);
145 code1
= TYPE_CODE (type
);
147 type2
= check_typedef (VALUE_TYPE (arg2
));
149 /* A cast to an undetermined-length array_type, such as (TYPE [])OBJECT,
150 is treated like a cast to (TYPE [N])OBJECT,
151 where N is sizeof(OBJECT)/sizeof(TYPE). */
152 if (code1
== TYPE_CODE_ARRAY
)
154 struct type
*element_type
= TYPE_TARGET_TYPE (type
);
155 unsigned element_length
= TYPE_LENGTH (check_typedef (element_type
));
156 if (element_length
> 0
157 && TYPE_ARRAY_UPPER_BOUND_TYPE (type
) == BOUND_CANNOT_BE_DETERMINED
)
159 struct type
*range_type
= TYPE_INDEX_TYPE (type
);
160 int val_length
= TYPE_LENGTH (type2
);
161 LONGEST low_bound
, high_bound
, new_length
;
162 if (get_discrete_bounds (range_type
, &low_bound
, &high_bound
) < 0)
163 low_bound
= 0, high_bound
= 0;
164 new_length
= val_length
/ element_length
;
165 if (val_length
% element_length
!= 0)
166 warning("array element type size does not divide object size in cast");
167 /* FIXME-type-allocation: need a way to free this type when we are
169 range_type
= create_range_type ((struct type
*) NULL
,
170 TYPE_TARGET_TYPE (range_type
),
172 new_length
+ low_bound
- 1);
173 VALUE_TYPE (arg2
) = create_array_type ((struct type
*) NULL
,
174 element_type
, range_type
);
179 if (current_language
->c_style_arrays
180 && TYPE_CODE (type2
) == TYPE_CODE_ARRAY
)
181 arg2
= value_coerce_array (arg2
);
183 if (TYPE_CODE (type2
) == TYPE_CODE_FUNC
)
184 arg2
= value_coerce_function (arg2
);
186 type2
= check_typedef (VALUE_TYPE (arg2
));
187 COERCE_VARYING_ARRAY (arg2
, type2
);
188 code2
= TYPE_CODE (type2
);
190 if (code1
== TYPE_CODE_COMPLEX
)
191 return cast_into_complex (type
, arg2
);
192 if (code1
== TYPE_CODE_BOOL
|| code1
== TYPE_CODE_CHAR
)
193 code1
= TYPE_CODE_INT
;
194 if (code2
== TYPE_CODE_BOOL
|| code2
== TYPE_CODE_CHAR
)
195 code2
= TYPE_CODE_INT
;
197 scalar
= (code2
== TYPE_CODE_INT
|| code2
== TYPE_CODE_FLT
198 || code2
== TYPE_CODE_ENUM
|| code2
== TYPE_CODE_RANGE
);
200 if ( code1
== TYPE_CODE_STRUCT
201 && code2
== TYPE_CODE_STRUCT
202 && TYPE_NAME (type
) != 0)
204 /* Look in the type of the source to see if it contains the
205 type of the target as a superclass. If so, we'll need to
206 offset the object in addition to changing its type. */
207 value_ptr v
= search_struct_field (type_name_no_tag (type
),
211 VALUE_TYPE (v
) = type
;
215 if (code1
== TYPE_CODE_FLT
&& scalar
)
216 return value_from_double (type
, value_as_double (arg2
));
217 else if ((code1
== TYPE_CODE_INT
|| code1
== TYPE_CODE_ENUM
218 || code1
== TYPE_CODE_RANGE
)
219 && (scalar
|| code2
== TYPE_CODE_PTR
))
220 return value_from_longest (type
, value_as_long (arg2
));
221 else if (TYPE_LENGTH (type
) == TYPE_LENGTH (type2
))
223 if (code1
== TYPE_CODE_PTR
&& code2
== TYPE_CODE_PTR
)
225 /* Look in the type of the source to see if it contains the
226 type of the target as a superclass. If so, we'll need to
227 offset the pointer rather than just change its type. */
228 struct type
*t1
= check_typedef (TYPE_TARGET_TYPE (type
));
229 struct type
*t2
= check_typedef (TYPE_TARGET_TYPE (type2
));
230 if ( TYPE_CODE (t1
) == TYPE_CODE_STRUCT
231 && TYPE_CODE (t2
) == TYPE_CODE_STRUCT
232 && TYPE_NAME (t1
) != 0) /* if name unknown, can't have supercl */
234 value_ptr v
= search_struct_field (type_name_no_tag (t1
),
235 value_ind (arg2
), 0, t2
, 1);
239 VALUE_TYPE (v
) = type
;
243 /* No superclass found, just fall through to change ptr type. */
245 VALUE_TYPE (arg2
) = type
;
248 else if (chill_varying_type (type
))
250 struct type
*range1
, *range2
, *eltype1
, *eltype2
;
253 LONGEST low_bound
, high_bound
;
254 char *valaddr
, *valaddr_data
;
255 if (code2
== TYPE_CODE_BITSTRING
)
256 error ("not implemented: converting bitstring to varying type");
257 if ((code2
!= TYPE_CODE_ARRAY
&& code2
!= TYPE_CODE_STRING
)
258 || (eltype1
= check_typedef (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, 1))),
259 eltype2
= check_typedef (TYPE_TARGET_TYPE (type2
)),
260 (TYPE_LENGTH (eltype1
) != TYPE_LENGTH (eltype2
)
261 /* || TYPE_CODE (eltype1) != TYPE_CODE (eltype2) */ )))
262 error ("Invalid conversion to varying type");
263 range1
= TYPE_FIELD_TYPE (TYPE_FIELD_TYPE (type
, 1), 0);
264 range2
= TYPE_FIELD_TYPE (type2
, 0);
265 if (get_discrete_bounds (range1
, &low_bound
, &high_bound
) < 0)
268 count1
= high_bound
- low_bound
+ 1;
269 if (get_discrete_bounds (range2
, &low_bound
, &high_bound
) < 0)
270 count1
= -1, count2
= 0; /* To force error before */
272 count2
= high_bound
- low_bound
+ 1;
274 error ("target varying type is too small");
275 val
= allocate_value (type
);
276 valaddr
= VALUE_CONTENTS_RAW (val
);
277 valaddr_data
= valaddr
+ TYPE_FIELD_BITPOS (type
, 1) / 8;
278 /* Set val's __var_length field to count2. */
279 store_signed_integer (valaddr
, TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0)),
281 /* Set the __var_data field to count2 elements copied from arg2. */
282 memcpy (valaddr_data
, VALUE_CONTENTS (arg2
),
283 count2
* TYPE_LENGTH (eltype2
));
284 /* Zero the rest of the __var_data field of val. */
285 memset (valaddr_data
+ count2
* TYPE_LENGTH (eltype2
), '\0',
286 (count1
- count2
) * TYPE_LENGTH (eltype2
));
289 else if (VALUE_LVAL (arg2
) == lval_memory
)
291 return value_at_lazy (type
, VALUE_ADDRESS (arg2
) + VALUE_OFFSET (arg2
));
293 else if (code1
== TYPE_CODE_VOID
)
295 return value_zero (builtin_type_void
, not_lval
);
299 error ("Invalid cast.");
304 /* Create a value of type TYPE that is zero, and return it. */
307 value_zero (type
, lv
)
311 register value_ptr val
= allocate_value (type
);
313 memset (VALUE_CONTENTS (val
), 0, TYPE_LENGTH (check_typedef (type
)));
314 VALUE_LVAL (val
) = lv
;
319 /* Return a value with type TYPE located at ADDR.
321 Call value_at only if the data needs to be fetched immediately;
322 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
323 value_at_lazy instead. value_at_lazy simply records the address of
324 the data and sets the lazy-evaluation-required flag. The lazy flag
325 is tested in the VALUE_CONTENTS macro, which is used if and when
326 the contents are actually required. */
329 value_at (type
, addr
)
333 register value_ptr val
;
335 if (TYPE_CODE (check_typedef (type
)) == TYPE_CODE_VOID
)
336 error ("Attempt to dereference a generic pointer.");
338 val
= allocate_value (type
);
340 read_memory (addr
, VALUE_CONTENTS_RAW (val
), TYPE_LENGTH (type
));
342 VALUE_LVAL (val
) = lval_memory
;
343 VALUE_ADDRESS (val
) = addr
;
348 /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
351 value_at_lazy (type
, addr
)
355 register value_ptr val
;
357 if (TYPE_CODE (check_typedef (type
)) == TYPE_CODE_VOID
)
358 error ("Attempt to dereference a generic pointer.");
360 val
= allocate_value (type
);
362 VALUE_LVAL (val
) = lval_memory
;
363 VALUE_ADDRESS (val
) = addr
;
364 VALUE_LAZY (val
) = 1;
369 /* Called only from the VALUE_CONTENTS macro, if the current data for
370 a variable needs to be loaded into VALUE_CONTENTS(VAL). Fetches the
371 data from the user's process, and clears the lazy flag to indicate
372 that the data in the buffer is valid.
374 If the value is zero-length, we avoid calling read_memory, which would
375 abort. We mark the value as fetched anyway -- all 0 bytes of it.
377 This function returns a value because it is used in the VALUE_CONTENTS
378 macro as part of an expression, where a void would not work. The
382 value_fetch_lazy (val
)
383 register value_ptr val
;
385 CORE_ADDR addr
= VALUE_ADDRESS (val
) + VALUE_OFFSET (val
);
386 int length
= TYPE_LENGTH (VALUE_TYPE (val
));
389 read_memory (addr
, VALUE_CONTENTS_RAW (val
), length
);
390 VALUE_LAZY (val
) = 0;
395 /* Store the contents of FROMVAL into the location of TOVAL.
396 Return a new value with the location of TOVAL and contents of FROMVAL. */
399 value_assign (toval
, fromval
)
400 register value_ptr toval
, fromval
;
402 register struct type
*type
;
403 register value_ptr val
;
404 char raw_buffer
[MAX_REGISTER_RAW_SIZE
];
407 if (!toval
->modifiable
)
408 error ("Left operand of assignment is not a modifiable lvalue.");
410 COERCE_ARRAY (fromval
);
413 type
= VALUE_TYPE (toval
);
414 if (VALUE_LVAL (toval
) != lval_internalvar
)
415 fromval
= value_cast (type
, fromval
);
416 CHECK_TYPEDEF (type
);
418 /* If TOVAL is a special machine register requiring conversion
419 of program values to a special raw format,
420 convert FROMVAL's contents now, with result in `raw_buffer',
421 and set USE_BUFFER to the number of bytes to write. */
423 #ifdef REGISTER_CONVERTIBLE
424 if (VALUE_REGNO (toval
) >= 0
425 && REGISTER_CONVERTIBLE (VALUE_REGNO (toval
)))
427 int regno
= VALUE_REGNO (toval
);
428 if (REGISTER_CONVERTIBLE (regno
))
430 struct type
*fromtype
= check_typedef (VALUE_TYPE (fromval
));
431 REGISTER_CONVERT_TO_RAW (fromtype
, regno
,
432 VALUE_CONTENTS (fromval
), raw_buffer
);
433 use_buffer
= REGISTER_RAW_SIZE (regno
);
438 switch (VALUE_LVAL (toval
))
440 case lval_internalvar
:
441 set_internalvar (VALUE_INTERNALVAR (toval
), fromval
);
442 return VALUE_INTERNALVAR (toval
)->value
;
444 case lval_internalvar_component
:
445 set_internalvar_component (VALUE_INTERNALVAR (toval
),
446 VALUE_OFFSET (toval
),
447 VALUE_BITPOS (toval
),
448 VALUE_BITSIZE (toval
),
453 if (VALUE_BITSIZE (toval
))
455 char buffer
[sizeof (LONGEST
)];
456 /* We assume that the argument to read_memory is in units of
457 host chars. FIXME: Is that correct? */
458 int len
= (VALUE_BITPOS (toval
)
459 + VALUE_BITSIZE (toval
)
463 if (len
> sizeof (LONGEST
))
464 error ("Can't handle bitfields which don't fit in a %d bit word.",
465 sizeof (LONGEST
) * HOST_CHAR_BIT
);
467 read_memory (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
469 modify_field (buffer
, value_as_long (fromval
),
470 VALUE_BITPOS (toval
), VALUE_BITSIZE (toval
));
471 write_memory (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
475 write_memory (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
476 raw_buffer
, use_buffer
);
478 write_memory (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
479 VALUE_CONTENTS (fromval
), TYPE_LENGTH (type
));
483 if (VALUE_BITSIZE (toval
))
485 char buffer
[sizeof (LONGEST
)];
486 int len
= REGISTER_RAW_SIZE (VALUE_REGNO (toval
));
488 if (len
> sizeof (LONGEST
))
489 error ("Can't handle bitfields in registers larger than %d bits.",
490 sizeof (LONGEST
) * HOST_CHAR_BIT
);
492 if (VALUE_BITPOS (toval
) + VALUE_BITSIZE (toval
)
493 > len
* HOST_CHAR_BIT
)
494 /* Getting this right would involve being very careful about
497 Can't handle bitfield which doesn't fit in a single register.");
499 read_register_bytes (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
501 modify_field (buffer
, value_as_long (fromval
),
502 VALUE_BITPOS (toval
), VALUE_BITSIZE (toval
));
503 write_register_bytes (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
507 write_register_bytes (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
508 raw_buffer
, use_buffer
);
511 /* Do any conversion necessary when storing this type to more
512 than one register. */
513 #ifdef REGISTER_CONVERT_FROM_TYPE
514 memcpy (raw_buffer
, VALUE_CONTENTS (fromval
), TYPE_LENGTH (type
));
515 REGISTER_CONVERT_FROM_TYPE(VALUE_REGNO (toval
), type
, raw_buffer
);
516 write_register_bytes (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
517 raw_buffer
, TYPE_LENGTH (type
));
519 write_register_bytes (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
520 VALUE_CONTENTS (fromval
), TYPE_LENGTH (type
));
523 /* Assigning to the stack pointer, frame pointer, and other
524 (architecture and calling convention specific) registers may
525 cause the frame cache to be out of date. We just do this
526 on all assignments to registers for simplicity; I doubt the slowdown
528 reinit_frame_cache ();
531 case lval_reg_frame_relative
:
533 /* value is stored in a series of registers in the frame
534 specified by the structure. Copy that value out, modify
535 it, and copy it back in. */
536 int amount_to_copy
= (VALUE_BITSIZE (toval
) ? 1 : TYPE_LENGTH (type
));
537 int reg_size
= REGISTER_RAW_SIZE (VALUE_FRAME_REGNUM (toval
));
538 int byte_offset
= VALUE_OFFSET (toval
) % reg_size
;
539 int reg_offset
= VALUE_OFFSET (toval
) / reg_size
;
542 /* Make the buffer large enough in all cases. */
543 char *buffer
= (char *) alloca (amount_to_copy
545 + MAX_REGISTER_RAW_SIZE
);
548 struct frame_info
*frame
;
550 /* Figure out which frame this is in currently. */
551 for (frame
= get_current_frame ();
552 frame
&& FRAME_FP (frame
) != VALUE_FRAME (toval
);
553 frame
= get_prev_frame (frame
))
557 error ("Value being assigned to is no longer active.");
559 amount_to_copy
+= (reg_size
- amount_to_copy
% reg_size
);
562 for ((regno
= VALUE_FRAME_REGNUM (toval
) + reg_offset
,
564 amount_copied
< amount_to_copy
;
565 amount_copied
+= reg_size
, regno
++)
567 get_saved_register (buffer
+ amount_copied
,
568 (int *)NULL
, (CORE_ADDR
*)NULL
,
569 frame
, regno
, (enum lval_type
*)NULL
);
572 /* Modify what needs to be modified. */
573 if (VALUE_BITSIZE (toval
))
574 modify_field (buffer
+ byte_offset
,
575 value_as_long (fromval
),
576 VALUE_BITPOS (toval
), VALUE_BITSIZE (toval
));
578 memcpy (buffer
+ byte_offset
, raw_buffer
, use_buffer
);
580 memcpy (buffer
+ byte_offset
, VALUE_CONTENTS (fromval
),
584 for ((regno
= VALUE_FRAME_REGNUM (toval
) + reg_offset
,
586 amount_copied
< amount_to_copy
;
587 amount_copied
+= reg_size
, regno
++)
593 /* Just find out where to put it. */
594 get_saved_register ((char *)NULL
,
595 &optim
, &addr
, frame
, regno
, &lval
);
598 error ("Attempt to assign to a value that was optimized out.");
599 if (lval
== lval_memory
)
600 write_memory (addr
, buffer
+ amount_copied
, reg_size
);
601 else if (lval
== lval_register
)
602 write_register_bytes (addr
, buffer
+ amount_copied
, reg_size
);
604 error ("Attempt to assign to an unmodifiable value.");
611 error ("Left operand of assignment is not an lvalue.");
614 /* If the field does not entirely fill a LONGEST, then zero the sign bits.
615 If the field is signed, and is negative, then sign extend. */
616 if ((VALUE_BITSIZE (toval
) > 0)
617 && (VALUE_BITSIZE (toval
) < 8 * sizeof (LONGEST
)))
619 LONGEST fieldval
= value_as_long (fromval
);
620 LONGEST valmask
= (((unsigned LONGEST
) 1) << VALUE_BITSIZE (toval
)) - 1;
623 if (!TYPE_UNSIGNED (type
) && (fieldval
& (valmask
^ (valmask
>> 1))))
624 fieldval
|= ~valmask
;
626 fromval
= value_from_longest (type
, fieldval
);
629 val
= value_copy (toval
);
630 memcpy (VALUE_CONTENTS_RAW (val
), VALUE_CONTENTS (fromval
),
632 VALUE_TYPE (val
) = type
;
637 /* Extend a value VAL to COUNT repetitions of its type. */
640 value_repeat (arg1
, count
)
644 register value_ptr val
;
646 if (VALUE_LVAL (arg1
) != lval_memory
)
647 error ("Only values in memory can be extended with '@'.");
649 error ("Invalid number %d of repetitions.", count
);
651 val
= allocate_repeat_value (VALUE_TYPE (arg1
), count
);
653 read_memory (VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
),
654 VALUE_CONTENTS_RAW (val
),
655 TYPE_LENGTH (VALUE_TYPE (val
)));
656 VALUE_LVAL (val
) = lval_memory
;
657 VALUE_ADDRESS (val
) = VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
);
663 value_of_variable (var
, b
)
668 struct frame_info
*frame
;
671 /* Use selected frame. */
675 frame
= block_innermost_frame (b
);
676 if (frame
== NULL
&& symbol_read_needs_frame (var
))
678 if (BLOCK_FUNCTION (b
) != NULL
679 && SYMBOL_NAME (BLOCK_FUNCTION (b
)) != NULL
)
680 error ("No frame is currently executing in block %s.",
681 SYMBOL_NAME (BLOCK_FUNCTION (b
)));
683 error ("No frame is currently executing in specified block");
686 val
= read_var_value (var
, frame
);
688 error ("Address of symbol \"%s\" is unknown.", SYMBOL_SOURCE_NAME (var
));
692 /* Given a value which is an array, return a value which is a pointer to its
693 first element, regardless of whether or not the array has a nonzero lower
696 FIXME: A previous comment here indicated that this routine should be
697 substracting the array's lower bound. It's not clear to me that this
698 is correct. Given an array subscripting operation, it would certainly
699 work to do the adjustment here, essentially computing:
701 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
703 However I believe a more appropriate and logical place to account for
704 the lower bound is to do so in value_subscript, essentially computing:
706 (&array[0] + ((index - lowerbound) * sizeof array[0]))
708 As further evidence consider what would happen with operations other
709 than array subscripting, where the caller would get back a value that
710 had an address somewhere before the actual first element of the array,
711 and the information about the lower bound would be lost because of
712 the coercion to pointer type.
716 value_coerce_array (arg1
)
719 register struct type
*type
= check_typedef (VALUE_TYPE (arg1
));
721 if (VALUE_LVAL (arg1
) != lval_memory
)
722 error ("Attempt to take address of value not located in memory.");
724 return value_from_longest (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
725 (LONGEST
) (VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
)));
728 /* Given a value which is a function, return a value which is a pointer
732 value_coerce_function (arg1
)
736 if (VALUE_LVAL (arg1
) != lval_memory
)
737 error ("Attempt to take address of value not located in memory.");
739 return value_from_longest (lookup_pointer_type (VALUE_TYPE (arg1
)),
740 (LONGEST
) (VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
)));
743 /* Return a pointer value for the object for which ARG1 is the contents. */
749 struct type
*type
= check_typedef (VALUE_TYPE (arg1
));
750 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
752 /* Copy the value, but change the type from (T&) to (T*).
753 We keep the same location information, which is efficient,
754 and allows &(&X) to get the location containing the reference. */
755 value_ptr arg2
= value_copy (arg1
);
756 VALUE_TYPE (arg2
) = lookup_pointer_type (TYPE_TARGET_TYPE (type
));
759 if (TYPE_CODE (type
) == TYPE_CODE_FUNC
)
760 return value_coerce_function (arg1
);
762 if (VALUE_LVAL (arg1
) != lval_memory
)
763 error ("Attempt to take address of value not located in memory.");
765 return value_from_longest (lookup_pointer_type (VALUE_TYPE (arg1
)),
766 (LONGEST
) (VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
)));
769 /* Given a value of a pointer type, apply the C unary * operator to it. */
777 type1
= check_typedef (VALUE_TYPE (arg1
));
779 if (TYPE_CODE (type1
) == TYPE_CODE_MEMBER
)
780 error ("not implemented: member types in value_ind");
782 /* Allow * on an integer so we can cast it to whatever we want.
783 This returns an int, which seems like the most C-like thing
784 to do. "long long" variables are rare enough that
785 BUILTIN_TYPE_LONGEST would seem to be a mistake. */
786 if (TYPE_CODE (type1
) == TYPE_CODE_INT
)
787 return value_at (builtin_type_int
,
788 (CORE_ADDR
) value_as_long (arg1
));
789 else if (TYPE_CODE (type1
) == TYPE_CODE_PTR
)
790 return value_at_lazy (TYPE_TARGET_TYPE (type1
), value_as_pointer (arg1
));
791 error ("Attempt to take contents of a non-pointer value.");
792 return 0; /* For lint -- never reached */
795 /* Pushing small parts of stack frames. */
797 /* Push one word (the size of object that a register holds). */
802 unsigned LONGEST word
;
804 register int len
= REGISTER_SIZE
;
805 char buffer
[MAX_REGISTER_RAW_SIZE
];
807 store_unsigned_integer (buffer
, len
, word
);
810 write_memory (sp
, buffer
, len
);
811 #else /* stack grows upward */
812 write_memory (sp
, buffer
, len
);
814 #endif /* stack grows upward */
819 /* Push LEN bytes with data at BUFFER. */
822 push_bytes (sp
, buffer
, len
)
829 write_memory (sp
, buffer
, len
);
830 #else /* stack grows upward */
831 write_memory (sp
, buffer
, len
);
833 #endif /* stack grows upward */
838 /* Push onto the stack the specified value VALUE. */
842 register CORE_ADDR sp
;
845 register int len
= TYPE_LENGTH (VALUE_TYPE (arg
));
849 write_memory (sp
, VALUE_CONTENTS (arg
), len
);
850 #else /* stack grows upward */
851 write_memory (sp
, VALUE_CONTENTS (arg
), len
);
853 #endif /* stack grows upward */
858 /* Perform the standard coercions that are specified
859 for arguments to be passed to C functions.
861 If PARAM_TYPE is non-NULL, it is the expected parameter type. */
864 value_arg_coerce (arg
, param_type
)
866 struct type
*param_type
;
868 register struct type
*arg_type
= check_typedef (VALUE_TYPE (arg
));
869 register struct type
*type
870 = param_type
? check_typedef (param_type
) : arg_type
;
872 switch (TYPE_CODE (type
))
875 if (TYPE_CODE (arg_type
) != TYPE_CODE_REF
)
877 arg
= value_addr (arg
);
878 VALUE_TYPE (arg
) = param_type
;
886 if (TYPE_LENGTH (type
) < TYPE_LENGTH (builtin_type_int
))
887 type
= builtin_type_int
;
890 if (TYPE_LENGTH (type
) < TYPE_LENGTH (builtin_type_double
))
891 type
= builtin_type_double
;
894 type
= lookup_pointer_type (type
);
896 case TYPE_CODE_ARRAY
:
897 if (current_language
->c_style_arrays
)
898 type
= lookup_pointer_type (TYPE_TARGET_TYPE (type
));
900 case TYPE_CODE_UNDEF
:
902 case TYPE_CODE_STRUCT
:
903 case TYPE_CODE_UNION
:
906 case TYPE_CODE_RANGE
:
907 case TYPE_CODE_STRING
:
908 case TYPE_CODE_BITSTRING
:
909 case TYPE_CODE_ERROR
:
910 case TYPE_CODE_MEMBER
:
911 case TYPE_CODE_METHOD
:
912 case TYPE_CODE_COMPLEX
:
917 return value_cast (type
, arg
);
920 /* Determine a function's address and its return type from its value.
921 Calls error() if the function is not valid for calling. */
924 find_function_addr (function
, retval_type
)
926 struct type
**retval_type
;
928 register struct type
*ftype
= check_typedef (VALUE_TYPE (function
));
929 register enum type_code code
= TYPE_CODE (ftype
);
930 struct type
*value_type
;
933 /* If it's a member function, just look at the function
936 /* Determine address to call. */
937 if (code
== TYPE_CODE_FUNC
|| code
== TYPE_CODE_METHOD
)
939 funaddr
= VALUE_ADDRESS (function
);
940 value_type
= TYPE_TARGET_TYPE (ftype
);
942 else if (code
== TYPE_CODE_PTR
)
944 funaddr
= value_as_pointer (function
);
945 ftype
= check_typedef (TYPE_TARGET_TYPE (ftype
));
946 if (TYPE_CODE (ftype
) == TYPE_CODE_FUNC
947 || TYPE_CODE (ftype
) == TYPE_CODE_METHOD
)
949 #ifdef CONVERT_FROM_FUNC_PTR_ADDR
950 /* FIXME: This is a workaround for the unusual function
951 pointer representation on the RS/6000, see comment
952 in config/rs6000/tm-rs6000.h */
953 funaddr
= CONVERT_FROM_FUNC_PTR_ADDR (funaddr
);
955 value_type
= TYPE_TARGET_TYPE (ftype
);
958 value_type
= builtin_type_int
;
960 else if (code
== TYPE_CODE_INT
)
962 /* Handle the case of functions lacking debugging info.
963 Their values are characters since their addresses are char */
964 if (TYPE_LENGTH (ftype
) == 1)
965 funaddr
= value_as_pointer (value_addr (function
));
967 /* Handle integer used as address of a function. */
968 funaddr
= (CORE_ADDR
) value_as_long (function
);
970 value_type
= builtin_type_int
;
973 error ("Invalid data type for function to be called.");
975 *retval_type
= value_type
;
979 #if defined (CALL_DUMMY)
980 /* All this stuff with a dummy frame may seem unnecessarily complicated
981 (why not just save registers in GDB?). The purpose of pushing a dummy
982 frame which looks just like a real frame is so that if you call a
983 function and then hit a breakpoint (get a signal, etc), "backtrace"
984 will look right. Whether the backtrace needs to actually show the
985 stack at the time the inferior function was called is debatable, but
986 it certainly needs to not display garbage. So if you are contemplating
987 making dummy frames be different from normal frames, consider that. */
989 /* Perform a function call in the inferior.
990 ARGS is a vector of values of arguments (NARGS of them).
991 FUNCTION is a value, the function to be called.
992 Returns a value representing what the function returned.
993 May fail to return, if a breakpoint or signal is hit
994 during the execution of the function.
996 ARGS is modified to contain coerced values. */
999 call_function_by_hand (function
, nargs
, args
)
1004 register CORE_ADDR sp
;
1007 /* CALL_DUMMY is an array of words (REGISTER_SIZE), but each word
1008 is in host byte order. Before calling FIX_CALL_DUMMY, we byteswap it
1009 and remove any extra bytes which might exist because unsigned LONGEST is
1010 bigger than REGISTER_SIZE. */
1011 static unsigned LONGEST dummy
[] = CALL_DUMMY
;
1012 char dummy1
[REGISTER_SIZE
* sizeof dummy
/ sizeof (unsigned LONGEST
)];
1014 struct type
*value_type
;
1015 unsigned char struct_return
;
1016 CORE_ADDR struct_addr
;
1017 struct inferior_status inf_status
;
1018 struct cleanup
*old_chain
;
1022 struct type
*ftype
= check_typedef (SYMBOL_TYPE (function
));
1024 if (!target_has_execution
)
1027 save_inferior_status (&inf_status
, 1);
1028 old_chain
= make_cleanup (restore_inferior_status
, &inf_status
);
1030 /* PUSH_DUMMY_FRAME is responsible for saving the inferior registers
1031 (and POP_FRAME for restoring them). (At least on most machines)
1032 they are saved on the stack in the inferior. */
1035 old_sp
= sp
= read_sp ();
1037 #if 1 INNER_THAN 2 /* Stack grows down */
1038 sp
-= sizeof dummy1
;
1040 #else /* Stack grows up */
1042 sp
+= sizeof dummy1
;
1045 funaddr
= find_function_addr (function
, &value_type
);
1046 CHECK_TYPEDEF (value_type
);
1049 struct block
*b
= block_for_pc (funaddr
);
1050 /* If compiled without -g, assume GCC. */
1051 using_gcc
= b
== NULL
? 0 : BLOCK_GCC_COMPILED (b
);
1054 /* Are we returning a value using a structure return or a normal
1057 struct_return
= using_struct_return (function
, funaddr
, value_type
,
1060 /* Create a call sequence customized for this function
1061 and the number of arguments for it. */
1062 for (i
= 0; i
< sizeof dummy
/ sizeof (dummy
[0]); i
++)
1063 store_unsigned_integer (&dummy1
[i
* REGISTER_SIZE
],
1065 (unsigned LONGEST
)dummy
[i
]);
1067 #ifdef GDB_TARGET_IS_HPPA
1068 real_pc
= FIX_CALL_DUMMY (dummy1
, start_sp
, funaddr
, nargs
, args
,
1069 value_type
, using_gcc
);
1071 FIX_CALL_DUMMY (dummy1
, start_sp
, funaddr
, nargs
, args
,
1072 value_type
, using_gcc
);
1076 #if CALL_DUMMY_LOCATION == ON_STACK
1077 write_memory (start_sp
, (char *)dummy1
, sizeof dummy1
);
1078 #endif /* On stack. */
1080 #if CALL_DUMMY_LOCATION == BEFORE_TEXT_END
1081 /* Convex Unix prohibits executing in the stack segment. */
1082 /* Hope there is empty room at the top of the text segment. */
1084 extern CORE_ADDR text_end
;
1087 for (start_sp
= text_end
- sizeof dummy1
; start_sp
< text_end
; ++start_sp
)
1088 if (read_memory_integer (start_sp
, 1) != 0)
1089 error ("text segment full -- no place to put call");
1092 real_pc
= text_end
- sizeof dummy1
;
1093 write_memory (real_pc
, (char *)dummy1
, sizeof dummy1
);
1095 #endif /* Before text_end. */
1097 #if CALL_DUMMY_LOCATION == AFTER_TEXT_END
1099 extern CORE_ADDR text_end
;
1103 errcode
= target_write_memory (real_pc
, (char *)dummy1
, sizeof dummy1
);
1105 error ("Cannot write text segment -- call_function failed");
1107 #endif /* After text_end. */
1109 #if CALL_DUMMY_LOCATION == AT_ENTRY_POINT
1111 #endif /* At entry point. */
1114 sp
= old_sp
; /* It really is used, for some ifdef's... */
1117 if (nargs
< TYPE_NFIELDS (ftype
))
1118 error ("too few arguments in function call");
1120 for (i
= nargs
- 1; i
>= 0; i
--)
1122 struct type
*param_type
;
1123 if (TYPE_NFIELDS (ftype
) > i
)
1124 param_type
= TYPE_FIELD_TYPE (ftype
, i
);
1127 args
[i
] = value_arg_coerce (args
[i
], param_type
);
1130 #if defined (REG_STRUCT_HAS_ADDR)
1132 /* This is a machine like the sparc, where we may need to pass a pointer
1133 to the structure, not the structure itself. */
1134 for (i
= nargs
- 1; i
>= 0; i
--)
1136 struct type
*arg_type
= check_typedef (VALUE_TYPE (args
[i
]));
1137 if ((TYPE_CODE (arg_type
) == TYPE_CODE_STRUCT
1138 || TYPE_CODE (arg_type
) == TYPE_CODE_UNION
1139 || TYPE_CODE (arg_type
) == TYPE_CODE_ARRAY
1140 || TYPE_CODE (arg_type
) == TYPE_CODE_STRING
1141 || TYPE_CODE (arg_type
) == TYPE_CODE_BITSTRING
1142 || TYPE_CODE (arg_type
) == TYPE_CODE_SET
)
1143 && REG_STRUCT_HAS_ADDR (using_gcc
, arg_type
))
1146 int len
= TYPE_LENGTH (arg_type
);
1148 int aligned_len
= STACK_ALIGN (len
);
1150 int aligned_len
= len
;
1152 #if !(1 INNER_THAN 2)
1153 /* The stack grows up, so the address of the thing we push
1154 is the stack pointer before we push it. */
1159 /* Push the structure. */
1160 write_memory (sp
, VALUE_CONTENTS (args
[i
]), len
);
1162 /* The stack grows down, so the address of the thing we push
1163 is the stack pointer after we push it. */
1168 /* The value we're going to pass is the address of the thing
1170 args
[i
] = value_from_longest (lookup_pointer_type (value_type
),
1175 #endif /* REG_STRUCT_HAS_ADDR. */
1177 /* Reserve space for the return structure to be written on the
1178 stack, if necessary */
1182 int len
= TYPE_LENGTH (value_type
);
1184 len
= STACK_ALIGN (len
);
1196 /* If stack grows down, we must leave a hole at the top. */
1200 for (i
= nargs
- 1; i
>= 0; i
--)
1201 len
+= TYPE_LENGTH (VALUE_TYPE (args
[i
]));
1202 #ifdef CALL_DUMMY_STACK_ADJUST
1203 len
+= CALL_DUMMY_STACK_ADJUST
;
1206 sp
-= STACK_ALIGN (len
) - len
;
1208 sp
+= STACK_ALIGN (len
) - len
;
1211 #endif /* STACK_ALIGN */
1213 #ifdef PUSH_ARGUMENTS
1214 PUSH_ARGUMENTS(nargs
, args
, sp
, struct_return
, struct_addr
);
1215 #else /* !PUSH_ARGUMENTS */
1216 for (i
= nargs
- 1; i
>= 0; i
--)
1217 sp
= value_push (sp
, args
[i
]);
1218 #endif /* !PUSH_ARGUMENTS */
1220 #ifdef CALL_DUMMY_STACK_ADJUST
1222 sp
-= CALL_DUMMY_STACK_ADJUST
;
1224 sp
+= CALL_DUMMY_STACK_ADJUST
;
1226 #endif /* CALL_DUMMY_STACK_ADJUST */
1228 /* Store the address at which the structure is supposed to be
1229 written. Note that this (and the code which reserved the space
1230 above) assumes that gcc was used to compile this function. Since
1231 it doesn't cost us anything but space and if the function is pcc
1232 it will ignore this value, we will make that assumption.
1234 Also note that on some machines (like the sparc) pcc uses a
1235 convention like gcc's. */
1238 STORE_STRUCT_RETURN (struct_addr
, sp
);
1240 /* Write the stack pointer. This is here because the statements above
1241 might fool with it. On SPARC, this write also stores the register
1242 window into the right place in the new stack frame, which otherwise
1243 wouldn't happen. (See store_inferior_registers in sparc-nat.c.) */
1247 char retbuf
[REGISTER_BYTES
];
1249 struct symbol
*symbol
;
1252 symbol
= find_pc_function (funaddr
);
1255 name
= SYMBOL_SOURCE_NAME (symbol
);
1259 /* Try the minimal symbols. */
1260 struct minimal_symbol
*msymbol
= lookup_minimal_symbol_by_pc (funaddr
);
1264 name
= SYMBOL_SOURCE_NAME (msymbol
);
1270 sprintf (format
, "at %s", local_hex_format ());
1272 /* FIXME-32x64: assumes funaddr fits in a long. */
1273 sprintf (name
, format
, (unsigned long) funaddr
);
1276 /* Execute the stack dummy routine, calling FUNCTION.
1277 When it is done, discard the empty frame
1278 after storing the contents of all regs into retbuf. */
1279 if (run_stack_dummy (real_pc
+ CALL_DUMMY_START_OFFSET
, retbuf
))
1281 /* We stopped somewhere besides the call dummy. */
1283 /* If we did the cleanups, we would print a spurious error message
1284 (Unable to restore previously selected frame), would write the
1285 registers from the inf_status (which is wrong), and would do other
1286 wrong things (like set stop_bpstat to the wrong thing). */
1287 discard_cleanups (old_chain
);
1288 /* Prevent memory leak. */
1289 bpstat_clear (&inf_status
.stop_bpstat
);
1291 /* The following error message used to say "The expression
1292 which contained the function call has been discarded." It
1293 is a hard concept to explain in a few words. Ideally, GDB
1294 would be able to resume evaluation of the expression when
1295 the function finally is done executing. Perhaps someday
1296 this will be implemented (it would not be easy). */
1298 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1299 a C++ name with arguments and stuff. */
1301 The program being debugged stopped while in a function called from GDB.\n\
1302 When the function (%s) is done executing, GDB will silently\n\
1303 stop (instead of continuing to evaluate the expression containing\n\
1304 the function call).", name
);
1307 do_cleanups (old_chain
);
1309 /* Figure out the value returned by the function. */
1310 return value_being_returned (value_type
, retbuf
, struct_return
);
1313 #else /* no CALL_DUMMY. */
1315 call_function_by_hand (function
, nargs
, args
)
1320 error ("Cannot invoke functions on this machine.");
1322 #endif /* no CALL_DUMMY. */
1325 /* Create a value for an array by allocating space in the inferior, copying
1326 the data into that space, and then setting up an array value.
1328 The array bounds are set from LOWBOUND and HIGHBOUND, and the array is
1329 populated from the values passed in ELEMVEC.
1331 The element type of the array is inherited from the type of the
1332 first element, and all elements must have the same size (though we
1333 don't currently enforce any restriction on their types). */
1336 value_array (lowbound
, highbound
, elemvec
)
1345 struct type
*rangetype
;
1346 struct type
*arraytype
;
1349 /* Validate that the bounds are reasonable and that each of the elements
1350 have the same size. */
1352 nelem
= highbound
- lowbound
+ 1;
1355 error ("bad array bounds (%d, %d)", lowbound
, highbound
);
1357 typelength
= TYPE_LENGTH (VALUE_TYPE (elemvec
[0]));
1358 for (idx
= 1; idx
< nelem
; idx
++)
1360 if (TYPE_LENGTH (VALUE_TYPE (elemvec
[idx
])) != typelength
)
1362 error ("array elements must all be the same size");
1366 /* Allocate space to store the array in the inferior, and then initialize
1367 it by copying in each element. FIXME: Is it worth it to create a
1368 local buffer in which to collect each value and then write all the
1369 bytes in one operation? */
1371 addr
= allocate_space_in_inferior (nelem
* typelength
);
1372 for (idx
= 0; idx
< nelem
; idx
++)
1374 write_memory (addr
+ (idx
* typelength
), VALUE_CONTENTS (elemvec
[idx
]),
1378 /* Create the array type and set up an array value to be evaluated lazily. */
1380 rangetype
= create_range_type ((struct type
*) NULL
, builtin_type_int
,
1381 lowbound
, highbound
);
1382 arraytype
= create_array_type ((struct type
*) NULL
,
1383 VALUE_TYPE (elemvec
[0]), rangetype
);
1384 val
= value_at_lazy (arraytype
, addr
);
1388 /* Create a value for a string constant by allocating space in the inferior,
1389 copying the data into that space, and returning the address with type
1390 TYPE_CODE_STRING. PTR points to the string constant data; LEN is number
1392 Note that string types are like array of char types with a lower bound of
1393 zero and an upper bound of LEN - 1. Also note that the string may contain
1394 embedded null bytes. */
1397 value_string (ptr
, len
)
1402 int lowbound
= current_language
->string_lower_bound
;
1403 struct type
*rangetype
= create_range_type ((struct type
*) NULL
,
1405 lowbound
, len
+ lowbound
- 1);
1406 struct type
*stringtype
1407 = create_string_type ((struct type
*) NULL
, rangetype
);
1410 if (current_language
->c_style_arrays
== 0)
1412 val
= allocate_value (stringtype
);
1413 memcpy (VALUE_CONTENTS_RAW (val
), ptr
, len
);
1418 /* Allocate space to store the string in the inferior, and then
1419 copy LEN bytes from PTR in gdb to that address in the inferior. */
1421 addr
= allocate_space_in_inferior (len
);
1422 write_memory (addr
, ptr
, len
);
1424 val
= value_at_lazy (stringtype
, addr
);
1429 value_bitstring (ptr
, len
)
1434 struct type
*domain_type
= create_range_type (NULL
, builtin_type_int
,
1436 struct type
*type
= create_set_type ((struct type
*) NULL
, domain_type
);
1437 TYPE_CODE (type
) = TYPE_CODE_BITSTRING
;
1438 val
= allocate_value (type
);
1439 memcpy (VALUE_CONTENTS_RAW (val
), ptr
, TYPE_LENGTH (type
));
1443 /* See if we can pass arguments in T2 to a function which takes arguments
1444 of types T1. Both t1 and t2 are NULL-terminated vectors. If some
1445 arguments need coercion of some sort, then the coerced values are written
1446 into T2. Return value is 0 if the arguments could be matched, or the
1447 position at which they differ if not.
1449 STATICP is nonzero if the T1 argument list came from a
1450 static member function.
1452 For non-static member functions, we ignore the first argument,
1453 which is the type of the instance variable. This is because we want
1454 to handle calls with objects from derived classes. This is not
1455 entirely correct: we should actually check to make sure that a
1456 requested operation is type secure, shouldn't we? FIXME. */
1459 typecmp (staticp
, t1
, t2
)
1468 if (staticp
&& t1
== 0)
1472 if (TYPE_CODE (t1
[0]) == TYPE_CODE_VOID
) return 0;
1473 if (t1
[!staticp
] == 0) return 0;
1474 for (i
= !staticp
; t1
[i
] && TYPE_CODE (t1
[i
]) != TYPE_CODE_VOID
; i
++)
1476 struct type
*tt1
, *tt2
;
1479 tt1
= check_typedef (t1
[i
]);
1480 tt2
= check_typedef (VALUE_TYPE(t2
[i
]));
1481 if (TYPE_CODE (tt1
) == TYPE_CODE_REF
1482 /* We should be doing hairy argument matching, as below. */
1483 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1
))) == TYPE_CODE (tt2
)))
1485 if (TYPE_CODE (tt2
) == TYPE_CODE_ARRAY
)
1486 t2
[i
] = value_coerce_array (t2
[i
]);
1488 t2
[i
] = value_addr (t2
[i
]);
1492 while (TYPE_CODE (tt1
) == TYPE_CODE_PTR
1493 && ( TYPE_CODE (tt2
) == TYPE_CODE_ARRAY
1494 || TYPE_CODE (tt2
) == TYPE_CODE_PTR
))
1496 tt1
= check_typedef (TYPE_TARGET_TYPE(tt1
));
1497 tt2
= check_typedef (TYPE_TARGET_TYPE(tt2
));
1499 if (TYPE_CODE(tt1
) == TYPE_CODE(tt2
)) continue;
1500 /* Array to pointer is a `trivial conversion' according to the ARM. */
1502 /* We should be doing much hairier argument matching (see section 13.2
1503 of the ARM), but as a quick kludge, just check for the same type
1505 if (TYPE_CODE (t1
[i
]) != TYPE_CODE (VALUE_TYPE (t2
[i
])))
1508 if (!t1
[i
]) return 0;
1509 return t2
[i
] ? i
+1 : 0;
1512 /* Helper function used by value_struct_elt to recurse through baseclasses.
1513 Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
1514 and search in it assuming it has (class) type TYPE.
1515 If found, return value, else return NULL.
1517 If LOOKING_FOR_BASECLASS, then instead of looking for struct fields,
1518 look for a baseclass named NAME. */
1521 search_struct_field (name
, arg1
, offset
, type
, looking_for_baseclass
)
1523 register value_ptr arg1
;
1525 register struct type
*type
;
1526 int looking_for_baseclass
;
1530 CHECK_TYPEDEF (type
);
1532 if (! looking_for_baseclass
)
1533 for (i
= TYPE_NFIELDS (type
) - 1; i
>= TYPE_N_BASECLASSES (type
); i
--)
1535 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
1537 if (t_field_name
&& STREQ (t_field_name
, name
))
1540 if (TYPE_FIELD_STATIC (type
, i
))
1542 char *phys_name
= TYPE_FIELD_STATIC_PHYSNAME (type
, i
);
1543 struct symbol
*sym
=
1544 lookup_symbol (phys_name
, 0, VAR_NAMESPACE
, 0, NULL
);
1546 error ("Internal error: could not find physical static variable named %s",
1548 v
= value_at (TYPE_FIELD_TYPE (type
, i
),
1549 (CORE_ADDR
)SYMBOL_BLOCK_VALUE (sym
));
1552 v
= value_primitive_field (arg1
, offset
, i
, type
);
1554 error("there is no field named %s", name
);
1559 && (t_field_name
[0] == '\0'
1560 || (TYPE_CODE (type
) == TYPE_CODE_UNION
1561 && STREQ (t_field_name
, "else"))))
1563 struct type
*field_type
= TYPE_FIELD_TYPE (type
, i
);
1564 if (TYPE_CODE (field_type
) == TYPE_CODE_UNION
1565 || TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
)
1567 /* Look for a match through the fields of an anonymous union,
1568 or anonymous struct. C++ provides anonymous unions.
1570 In the GNU Chill implementation of variant record types,
1571 each <alternative field> has an (anonymous) union type,
1572 each member of the union represents a <variant alternative>.
1573 Each <variant alternative> is represented as a struct,
1574 with a member for each <variant field>. */
1577 int new_offset
= offset
;
1579 /* This is pretty gross. In G++, the offset in an anonymous
1580 union is relative to the beginning of the enclosing struct.
1581 In the GNU Chill implementation of variant records,
1582 the bitpos is zero in an anonymous union field, so we
1583 have to add the offset of the union here. */
1584 if (TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
1585 || (TYPE_NFIELDS (field_type
) > 0
1586 && TYPE_FIELD_BITPOS (field_type
, 0) == 0))
1587 new_offset
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
1589 v
= search_struct_field (name
, arg1
, new_offset
, field_type
,
1590 looking_for_baseclass
);
1597 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
1600 struct type
*basetype
= check_typedef (TYPE_BASECLASS (type
, i
));
1601 /* If we are looking for baseclasses, this is what we get when we
1602 hit them. But it could happen that the base part's member name
1603 is not yet filled in. */
1604 int found_baseclass
= (looking_for_baseclass
1605 && TYPE_BASECLASS_NAME (type
, i
) != NULL
1606 && STREQ (name
, TYPE_BASECLASS_NAME (type
, i
)));
1608 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1610 int boffset
= VALUE_OFFSET (arg1
) + offset
;
1611 boffset
= baseclass_offset (type
, i
,
1612 VALUE_CONTENTS (arg1
) + boffset
,
1613 VALUE_ADDRESS (arg1
) + boffset
);
1615 error ("virtual baseclass botch");
1616 if (found_baseclass
)
1618 value_ptr v2
= allocate_value (basetype
);
1619 VALUE_LVAL (v2
) = VALUE_LVAL (arg1
);
1620 VALUE_ADDRESS (v2
) = VALUE_ADDRESS (arg1
);
1621 VALUE_OFFSET (v2
) = VALUE_OFFSET (arg1
) + offset
+ boffset
;
1622 if (VALUE_LAZY (arg1
))
1623 VALUE_LAZY (v2
) = 1;
1625 memcpy (VALUE_CONTENTS_RAW (v2
),
1626 VALUE_CONTENTS_RAW (arg1
) + offset
+ boffset
,
1627 TYPE_LENGTH (basetype
));
1630 v
= search_struct_field (name
, arg1
, offset
+ boffset
,
1631 TYPE_BASECLASS (type
, i
),
1632 looking_for_baseclass
);
1634 else if (found_baseclass
)
1635 v
= value_primitive_field (arg1
, offset
, i
, type
);
1637 v
= search_struct_field (name
, arg1
,
1638 offset
+ TYPE_BASECLASS_BITPOS (type
, i
) / 8,
1639 basetype
, looking_for_baseclass
);
1645 /* Helper function used by value_struct_elt to recurse through baseclasses.
1646 Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
1647 and search in it assuming it has (class) type TYPE.
1648 If found, return value, else if name matched and args not return (value)-1,
1649 else return NULL. */
1652 search_struct_method (name
, arg1p
, args
, offset
, static_memfuncp
, type
)
1654 register value_ptr
*arg1p
, *args
;
1655 int offset
, *static_memfuncp
;
1656 register struct type
*type
;
1660 int name_matched
= 0;
1661 char dem_opname
[64];
1663 CHECK_TYPEDEF (type
);
1664 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
1666 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
1667 if (strncmp(t_field_name
, "__", 2)==0 ||
1668 strncmp(t_field_name
, "op", 2)==0 ||
1669 strncmp(t_field_name
, "type", 4)==0 )
1671 if (cplus_demangle_opname(t_field_name
, dem_opname
, DMGL_ANSI
))
1672 t_field_name
= dem_opname
;
1673 else if (cplus_demangle_opname(t_field_name
, dem_opname
, 0))
1674 t_field_name
= dem_opname
;
1676 if (t_field_name
&& STREQ (t_field_name
, name
))
1678 int j
= TYPE_FN_FIELDLIST_LENGTH (type
, i
) - 1;
1679 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
1682 if (j
> 0 && args
== 0)
1683 error ("cannot resolve overloaded method `%s'", name
);
1686 if (TYPE_FN_FIELD_STUB (f
, j
))
1687 check_stub_method (type
, i
, j
);
1688 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f
, j
),
1689 TYPE_FN_FIELD_ARGS (f
, j
), args
))
1691 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
1692 return value_virtual_fn_field (arg1p
, f
, j
, type
, offset
);
1693 if (TYPE_FN_FIELD_STATIC_P (f
, j
) && static_memfuncp
)
1694 *static_memfuncp
= 1;
1695 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
1696 if (v
!= NULL
) return v
;
1703 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
1707 if (BASETYPE_VIA_VIRTUAL (type
, i
))
1709 base_offset
= VALUE_OFFSET (*arg1p
) + offset
;
1711 baseclass_offset (type
, i
,
1712 VALUE_CONTENTS (*arg1p
) + base_offset
,
1713 VALUE_ADDRESS (*arg1p
) + base_offset
);
1714 if (base_offset
== -1)
1715 error ("virtual baseclass botch");
1719 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
1721 v
= search_struct_method (name
, arg1p
, args
, base_offset
+ offset
,
1722 static_memfuncp
, TYPE_BASECLASS (type
, i
));
1723 if (v
== (value_ptr
) -1)
1729 /* FIXME-bothner: Why is this commented out? Why is it here? */
1730 /* *arg1p = arg1_tmp;*/
1734 if (name_matched
) return (value_ptr
) -1;
1738 /* Given *ARGP, a value of type (pointer to a)* structure/union,
1739 extract the component named NAME from the ultimate target structure/union
1740 and return it as a value with its appropriate type.
1741 ERR is used in the error message if *ARGP's type is wrong.
1743 C++: ARGS is a list of argument types to aid in the selection of
1744 an appropriate method. Also, handle derived types.
1746 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
1747 where the truthvalue of whether the function that was resolved was
1748 a static member function or not is stored.
1750 ERR is an error message to be printed in case the field is not found. */
1753 value_struct_elt (argp
, args
, name
, static_memfuncp
, err
)
1754 register value_ptr
*argp
, *args
;
1756 int *static_memfuncp
;
1759 register struct type
*t
;
1762 COERCE_ARRAY (*argp
);
1764 t
= check_typedef (VALUE_TYPE (*argp
));
1766 /* Follow pointers until we get to a non-pointer. */
1768 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
1770 *argp
= value_ind (*argp
);
1771 /* Don't coerce fn pointer to fn and then back again! */
1772 if (TYPE_CODE (VALUE_TYPE (*argp
)) != TYPE_CODE_FUNC
)
1773 COERCE_ARRAY (*argp
);
1774 t
= check_typedef (VALUE_TYPE (*argp
));
1777 if (TYPE_CODE (t
) == TYPE_CODE_MEMBER
)
1778 error ("not implemented: member type in value_struct_elt");
1780 if ( TYPE_CODE (t
) != TYPE_CODE_STRUCT
1781 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
1782 error ("Attempt to extract a component of a value that is not a %s.", err
);
1784 /* Assume it's not, unless we see that it is. */
1785 if (static_memfuncp
)
1786 *static_memfuncp
=0;
1790 /* if there are no arguments ...do this... */
1792 /* Try as a field first, because if we succeed, there
1793 is less work to be done. */
1794 v
= search_struct_field (name
, *argp
, 0, t
, 0);
1798 /* C++: If it was not found as a data field, then try to
1799 return it as a pointer to a method. */
1801 if (destructor_name_p (name
, t
))
1802 error ("Cannot get value of destructor");
1804 v
= search_struct_method (name
, argp
, args
, 0, static_memfuncp
, t
);
1806 if (v
== (value_ptr
) -1)
1807 error ("Cannot take address of a method");
1810 if (TYPE_NFN_FIELDS (t
))
1811 error ("There is no member or method named %s.", name
);
1813 error ("There is no member named %s.", name
);
1818 if (destructor_name_p (name
, t
))
1822 /* destructors are a special case. */
1823 v
= value_fn_field (NULL
, TYPE_FN_FIELDLIST1 (t
, 0),
1824 TYPE_FN_FIELDLIST_LENGTH (t
, 0), 0, 0);
1825 if (!v
) error("could not find destructor function named %s.", name
);
1830 error ("destructor should not have any argument");
1834 v
= search_struct_method (name
, argp
, args
, 0, static_memfuncp
, t
);
1836 if (v
== (value_ptr
) -1)
1838 error("Argument list of %s mismatch with component in the structure.", name
);
1842 /* See if user tried to invoke data as function. If so,
1843 hand it back. If it's not callable (i.e., a pointer to function),
1844 gdb should give an error. */
1845 v
= search_struct_field (name
, *argp
, 0, t
, 0);
1849 error ("Structure has no component named %s.", name
);
1853 /* C++: return 1 is NAME is a legitimate name for the destructor
1854 of type TYPE. If TYPE does not have a destructor, or
1855 if NAME is inappropriate for TYPE, an error is signaled. */
1857 destructor_name_p (name
, type
)
1859 const struct type
*type
;
1861 /* destructors are a special case. */
1865 char *dname
= type_name_no_tag (type
);
1866 char *cp
= strchr (dname
, '<');
1869 /* Do not compare the template part for template classes. */
1871 len
= strlen (dname
);
1874 if (strlen (name
+ 1) != len
|| !STREQN (dname
, name
+ 1, len
))
1875 error ("name of destructor must equal name of class");
1882 /* Helper function for check_field: Given TYPE, a structure/union,
1883 return 1 if the component named NAME from the ultimate
1884 target structure/union is defined, otherwise, return 0. */
1887 check_field_in (type
, name
)
1888 register struct type
*type
;
1893 for (i
= TYPE_NFIELDS (type
) - 1; i
>= TYPE_N_BASECLASSES (type
); i
--)
1895 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
1896 if (t_field_name
&& STREQ (t_field_name
, name
))
1900 /* C++: If it was not found as a data field, then try to
1901 return it as a pointer to a method. */
1903 /* Destructors are a special case. */
1904 if (destructor_name_p (name
, type
))
1907 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; --i
)
1909 if (STREQ (TYPE_FN_FIELDLIST_NAME (type
, i
), name
))
1913 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
1914 if (check_field_in (TYPE_BASECLASS (type
, i
), name
))
1921 /* C++: Given ARG1, a value of type (pointer to a)* structure/union,
1922 return 1 if the component named NAME from the ultimate
1923 target structure/union is defined, otherwise, return 0. */
1926 check_field (arg1
, name
)
1927 register value_ptr arg1
;
1930 register struct type
*t
;
1932 COERCE_ARRAY (arg1
);
1934 t
= VALUE_TYPE (arg1
);
1936 /* Follow pointers until we get to a non-pointer. */
1941 if (TYPE_CODE (t
) != TYPE_CODE_PTR
&& TYPE_CODE (t
) != TYPE_CODE_REF
)
1943 t
= TYPE_TARGET_TYPE (t
);
1946 if (TYPE_CODE (t
) == TYPE_CODE_MEMBER
)
1947 error ("not implemented: member type in check_field");
1949 if ( TYPE_CODE (t
) != TYPE_CODE_STRUCT
1950 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
1951 error ("Internal error: `this' is not an aggregate");
1953 return check_field_in (t
, name
);
1956 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
1957 return the address of this member as a "pointer to member"
1958 type. If INTYPE is non-null, then it will be the type
1959 of the member we are looking for. This will help us resolve
1960 "pointers to member functions". This function is used
1961 to resolve user expressions of the form "DOMAIN::NAME". */
1964 value_struct_elt_for_reference (domain
, offset
, curtype
, name
, intype
)
1965 struct type
*domain
, *curtype
, *intype
;
1969 register struct type
*t
= curtype
;
1973 if ( TYPE_CODE (t
) != TYPE_CODE_STRUCT
1974 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
1975 error ("Internal error: non-aggregate type to value_struct_elt_for_reference");
1977 for (i
= TYPE_NFIELDS (t
) - 1; i
>= TYPE_N_BASECLASSES (t
); i
--)
1979 char *t_field_name
= TYPE_FIELD_NAME (t
, i
);
1981 if (t_field_name
&& STREQ (t_field_name
, name
))
1983 if (TYPE_FIELD_STATIC (t
, i
))
1985 char *phys_name
= TYPE_FIELD_STATIC_PHYSNAME (t
, i
);
1986 struct symbol
*sym
=
1987 lookup_symbol (phys_name
, 0, VAR_NAMESPACE
, 0, NULL
);
1989 error ("Internal error: could not find physical static variable named %s",
1991 return value_at (SYMBOL_TYPE (sym
),
1992 (CORE_ADDR
)SYMBOL_BLOCK_VALUE (sym
));
1994 if (TYPE_FIELD_PACKED (t
, i
))
1995 error ("pointers to bitfield members not allowed");
1997 return value_from_longest
1998 (lookup_reference_type (lookup_member_type (TYPE_FIELD_TYPE (t
, i
),
2000 offset
+ (LONGEST
) (TYPE_FIELD_BITPOS (t
, i
) >> 3));
2004 /* C++: If it was not found as a data field, then try to
2005 return it as a pointer to a method. */
2007 /* Destructors are a special case. */
2008 if (destructor_name_p (name
, t
))
2010 error ("member pointers to destructors not implemented yet");
2013 /* Perform all necessary dereferencing. */
2014 while (intype
&& TYPE_CODE (intype
) == TYPE_CODE_PTR
)
2015 intype
= TYPE_TARGET_TYPE (intype
);
2017 for (i
= TYPE_NFN_FIELDS (t
) - 1; i
>= 0; --i
)
2019 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (t
, i
);
2020 char dem_opname
[64];
2022 if (strncmp(t_field_name
, "__", 2)==0 ||
2023 strncmp(t_field_name
, "op", 2)==0 ||
2024 strncmp(t_field_name
, "type", 4)==0 )
2026 if (cplus_demangle_opname(t_field_name
, dem_opname
, DMGL_ANSI
))
2027 t_field_name
= dem_opname
;
2028 else if (cplus_demangle_opname(t_field_name
, dem_opname
, 0))
2029 t_field_name
= dem_opname
;
2031 if (t_field_name
&& STREQ (t_field_name
, name
))
2033 int j
= TYPE_FN_FIELDLIST_LENGTH (t
, i
);
2034 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (t
, i
);
2036 if (intype
== 0 && j
> 1)
2037 error ("non-unique member `%s' requires type instantiation", name
);
2041 if (TYPE_FN_FIELD_TYPE (f
, j
) == intype
)
2044 error ("no member function matches that type instantiation");
2049 if (TYPE_FN_FIELD_STUB (f
, j
))
2050 check_stub_method (t
, i
, j
);
2051 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
2053 return value_from_longest
2054 (lookup_reference_type
2055 (lookup_member_type (TYPE_FN_FIELD_TYPE (f
, j
),
2057 (LONGEST
) METHOD_PTR_FROM_VOFFSET (TYPE_FN_FIELD_VOFFSET (f
, j
)));
2061 struct symbol
*s
= lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
2062 0, VAR_NAMESPACE
, 0, NULL
);
2069 v
= read_var_value (s
, 0);
2071 VALUE_TYPE (v
) = lookup_reference_type
2072 (lookup_member_type (TYPE_FN_FIELD_TYPE (f
, j
),
2080 for (i
= TYPE_N_BASECLASSES (t
) - 1; i
>= 0; i
--)
2085 if (BASETYPE_VIA_VIRTUAL (t
, i
))
2088 base_offset
= TYPE_BASECLASS_BITPOS (t
, i
) / 8;
2089 v
= value_struct_elt_for_reference (domain
,
2090 offset
+ base_offset
,
2091 TYPE_BASECLASS (t
, i
),
2100 /* C++: return the value of the class instance variable, if one exists.
2101 Flag COMPLAIN signals an error if the request is made in an
2102 inappropriate context. */
2105 value_of_this (complain
)
2108 struct symbol
*func
, *sym
;
2111 static const char funny_this
[] = "this";
2114 if (selected_frame
== 0)
2116 error ("no frame selected");
2119 func
= get_frame_function (selected_frame
);
2123 error ("no `this' in nameless context");
2127 b
= SYMBOL_BLOCK_VALUE (func
);
2128 i
= BLOCK_NSYMS (b
);
2131 error ("no args, no `this'");
2134 /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER
2135 symbol instead of the LOC_ARG one (if both exist). */
2136 sym
= lookup_block_symbol (b
, funny_this
, VAR_NAMESPACE
);
2140 error ("current stack frame not in method");
2145 this = read_var_value (sym
, selected_frame
);
2146 if (this == 0 && complain
)
2147 error ("`this' argument at unknown address");
2151 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH elements
2152 long, starting at LOWBOUND. The result has the same lower bound as
2153 the original ARRAY. */
2156 value_slice (array
, lowbound
, length
)
2158 int lowbound
, length
;
2160 struct type
*slice_range_type
, *slice_type
, *range_type
;
2161 LONGEST lowerbound
, upperbound
, offset
;
2163 struct type
*array_type
;
2164 array_type
= check_typedef (VALUE_TYPE (array
));
2165 COERCE_VARYING_ARRAY (array
, array_type
);
2166 if (TYPE_CODE (array_type
) != TYPE_CODE_ARRAY
2167 && TYPE_CODE (array_type
) != TYPE_CODE_STRING
2168 && TYPE_CODE (array_type
) != TYPE_CODE_BITSTRING
)
2169 error ("cannot take slice of non-array");
2170 range_type
= TYPE_INDEX_TYPE (array_type
);
2171 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2172 error ("slice from bad array or bitstring");
2173 if (lowbound
< lowerbound
|| length
< 0
2174 || lowbound
+ length
- 1 > upperbound
2175 /* Chill allows zero-length strings but not arrays. */
2176 || (current_language
->la_language
== language_chill
2177 && length
== 0 && TYPE_CODE (array_type
) == TYPE_CODE_ARRAY
))
2178 error ("slice out of range");
2179 /* FIXME-type-allocation: need a way to free this type when we are
2181 slice_range_type
= create_range_type ((struct type
*) NULL
,
2182 TYPE_TARGET_TYPE (range_type
),
2183 lowerbound
, lowerbound
+ length
- 1);
2184 if (TYPE_CODE (array_type
) == TYPE_CODE_BITSTRING
)
2187 slice_type
= create_set_type ((struct type
*) NULL
, slice_range_type
);
2188 TYPE_CODE (slice_type
) = TYPE_CODE_BITSTRING
;
2189 slice
= value_zero (slice_type
, not_lval
);
2190 for (i
= 0; i
< length
; i
++)
2192 int element
= value_bit_index (array_type
,
2193 VALUE_CONTENTS (array
),
2196 error ("internal error accessing bitstring");
2197 else if (element
> 0)
2199 int j
= i
% TARGET_CHAR_BIT
;
2200 if (BITS_BIG_ENDIAN
)
2201 j
= TARGET_CHAR_BIT
- 1 - j
;
2202 VALUE_CONTENTS_RAW (slice
)[i
/ TARGET_CHAR_BIT
] |= (1 << j
);
2205 /* We should set the address, bitssize, and bitspos, so the clice
2206 can be used on the LHS, but that may require extensions to
2207 value_assign. For now, just leave as a non_lval. FIXME. */
2211 struct type
*element_type
= TYPE_TARGET_TYPE (array_type
);
2213 = (lowbound
- lowerbound
) * TYPE_LENGTH (check_typedef (element_type
));
2214 slice_type
= create_array_type ((struct type
*) NULL
, element_type
,
2216 TYPE_CODE (slice_type
) = TYPE_CODE (array_type
);
2217 slice
= allocate_value (slice_type
);
2218 if (VALUE_LAZY (array
))
2219 VALUE_LAZY (slice
) = 1;
2221 memcpy (VALUE_CONTENTS (slice
), VALUE_CONTENTS (array
) + offset
,
2222 TYPE_LENGTH (slice_type
));
2223 if (VALUE_LVAL (array
) == lval_internalvar
)
2224 VALUE_LVAL (slice
) = lval_internalvar_component
;
2226 VALUE_LVAL (slice
) = VALUE_LVAL (array
);
2227 VALUE_ADDRESS (slice
) = VALUE_ADDRESS (array
);
2228 VALUE_OFFSET (slice
) = VALUE_OFFSET (array
) + offset
;
2233 /* Assuming chill_varying_type (VARRAY) is true, return an equivalent
2234 value as a fixed-length array. */
2237 varying_to_slice (varray
)
2240 struct type
*vtype
= check_typedef (VALUE_TYPE (varray
));
2241 LONGEST length
= unpack_long (TYPE_FIELD_TYPE (vtype
, 0),
2242 VALUE_CONTENTS (varray
)
2243 + TYPE_FIELD_BITPOS (vtype
, 0) / 8);
2244 return value_slice (value_primitive_field (varray
, 0, 1, vtype
), 0, length
);
2247 /* Create a value for a FORTRAN complex number. Currently most of
2248 the time values are coerced to COMPLEX*16 (i.e. a complex number
2249 composed of 2 doubles. This really should be a smarter routine
2250 that figures out precision inteligently as opposed to assuming
2251 doubles. FIXME: fmb */
2254 value_literal_complex (arg1
, arg2
, type
)
2259 register value_ptr val
;
2260 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
2262 val
= allocate_value (type
);
2263 arg1
= value_cast (real_type
, arg1
);
2264 arg2
= value_cast (real_type
, arg2
);
2266 memcpy (VALUE_CONTENTS_RAW (val
),
2267 VALUE_CONTENTS (arg1
), TYPE_LENGTH (real_type
));
2268 memcpy (VALUE_CONTENTS_RAW (val
) + TYPE_LENGTH (real_type
),
2269 VALUE_CONTENTS (arg2
), TYPE_LENGTH (real_type
));
2273 /* Cast a value into the appropriate complex data type. */
2276 cast_into_complex (type
, val
)
2278 register value_ptr val
;
2280 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
2281 if (TYPE_CODE (VALUE_TYPE (val
)) == TYPE_CODE_COMPLEX
)
2283 struct type
*val_real_type
= TYPE_TARGET_TYPE (VALUE_TYPE (val
));
2284 value_ptr re_val
= allocate_value (val_real_type
);
2285 value_ptr im_val
= allocate_value (val_real_type
);
2287 memcpy (VALUE_CONTENTS_RAW (re_val
),
2288 VALUE_CONTENTS (val
), TYPE_LENGTH (val_real_type
));
2289 memcpy (VALUE_CONTENTS_RAW (im_val
),
2290 VALUE_CONTENTS (val
) + TYPE_LENGTH (val_real_type
),
2291 TYPE_LENGTH (val_real_type
));
2293 return value_literal_complex (re_val
, im_val
, type
);
2295 else if (TYPE_CODE (VALUE_TYPE (val
)) == TYPE_CODE_FLT
2296 || TYPE_CODE (VALUE_TYPE (val
)) == TYPE_CODE_INT
)
2297 return value_literal_complex (val
, value_zero (real_type
, not_lval
), type
);
2299 error ("cannot cast non-number to complex");
2303 _initialize_valops ()
2307 (add_set_cmd ("abandon", class_support
, var_boolean
, (char *)&auto_abandon
,
2308 "Set automatic abandonment of expressions upon failure.",