1 /* Perform non-arithmetic operations on values, for GDB.
2 Copyright 1986, 87, 89, 91, 92, 93, 94, 95, 96, 97, 1998
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,
20 Boston, MA 02111-1307, USA. */
35 #include "gdb_string.h"
37 /* Flag indicating HP compilers were used; needed to correctly handle some
38 value operations with HP aCC code/runtime. */
39 extern int hp_som_som_object_present
;
42 /* Local functions. */
44 static int typecmp
PARAMS ((int staticp
, struct type
* t1
[], value_ptr t2
[]));
46 static CORE_ADDR find_function_addr
PARAMS ((value_ptr
, struct type
**));
47 static value_ptr value_arg_coerce
PARAMS ((value_ptr
, struct type
*, int));
50 static CORE_ADDR value_push
PARAMS ((CORE_ADDR
, value_ptr
));
52 static value_ptr search_struct_field
PARAMS ((char *, value_ptr
, int,
55 static value_ptr search_struct_method
PARAMS ((char *, value_ptr
*,
57 int, int *, struct type
*));
59 static int check_field_in
PARAMS ((struct type
*, const char *));
61 static CORE_ADDR allocate_space_in_inferior
PARAMS ((int));
63 static value_ptr cast_into_complex
PARAMS ((struct type
*, value_ptr
));
65 static struct fn_field
*find_method_list
PARAMS ((value_ptr
* argp
, char *method
, int offset
, int *static_memfuncp
, struct type
* type
, int *num_fns
, struct type
** basetype
, int *boffset
));
67 void _initialize_valops
PARAMS ((void));
69 #define VALUE_SUBSTRING_START(VAL) VALUE_FRAME(VAL)
71 /* Flag for whether we want to abandon failed expression evals by default. */
74 static int auto_abandon
= 0;
77 int overload_resolution
= 0;
79 /* This boolean tells what gdb should do if a signal is received while in
80 a function called from gdb (call dummy). If set, gdb unwinds the stack
81 and restore the context to what as it was before the call.
82 The default is to stop in the frame where the signal was received. */
84 int unwind_on_signal_p
= 0;
88 /* Find the address of function name NAME in the inferior. */
91 find_function_in_inferior (name
)
94 register struct symbol
*sym
;
95 sym
= lookup_symbol (name
, 0, VAR_NAMESPACE
, 0, NULL
);
98 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
100 error ("\"%s\" exists in this program but is not a function.",
103 return value_of_variable (sym
, NULL
);
107 struct minimal_symbol
*msymbol
= lookup_minimal_symbol (name
, NULL
, NULL
);
112 type
= lookup_pointer_type (builtin_type_char
);
113 type
= lookup_function_type (type
);
114 type
= lookup_pointer_type (type
);
115 maddr
= (LONGEST
) SYMBOL_VALUE_ADDRESS (msymbol
);
116 return value_from_longest (type
, maddr
);
120 if (!target_has_execution
)
121 error ("evaluation of this expression requires the target program to be active");
123 error ("evaluation of this expression requires the program to have a function \"%s\".", name
);
128 /* Allocate NBYTES of space in the inferior using the inferior's malloc
129 and return a value that is a pointer to the allocated space. */
132 value_allocate_space_in_inferior (len
)
136 register value_ptr val
= find_function_in_inferior ("malloc");
138 blocklen
= value_from_longest (builtin_type_int
, (LONGEST
) len
);
139 val
= call_function_by_hand (val
, 1, &blocklen
);
140 if (value_logical_not (val
))
142 if (!target_has_execution
)
143 error ("No memory available to program now: you need to start the target first");
145 error ("No memory available to program: call to malloc failed");
151 allocate_space_in_inferior (len
)
154 return value_as_long (value_allocate_space_in_inferior (len
));
157 /* Cast value ARG2 to type TYPE and return as a value.
158 More general than a C cast: accepts any two types of the same length,
159 and if ARG2 is an lvalue it can be cast into anything at all. */
160 /* In C++, casts may change pointer or object representations. */
163 value_cast (type
, arg2
)
165 register value_ptr arg2
;
167 register enum type_code code1
;
168 register enum type_code code2
;
172 int convert_to_boolean
= 0;
174 if (VALUE_TYPE (arg2
) == type
)
177 CHECK_TYPEDEF (type
);
178 code1
= TYPE_CODE (type
);
180 type2
= check_typedef (VALUE_TYPE (arg2
));
182 /* A cast to an undetermined-length array_type, such as (TYPE [])OBJECT,
183 is treated like a cast to (TYPE [N])OBJECT,
184 where N is sizeof(OBJECT)/sizeof(TYPE). */
185 if (code1
== TYPE_CODE_ARRAY
)
187 struct type
*element_type
= TYPE_TARGET_TYPE (type
);
188 unsigned element_length
= TYPE_LENGTH (check_typedef (element_type
));
189 if (element_length
> 0
190 && TYPE_ARRAY_UPPER_BOUND_TYPE (type
) == BOUND_CANNOT_BE_DETERMINED
)
192 struct type
*range_type
= TYPE_INDEX_TYPE (type
);
193 int val_length
= TYPE_LENGTH (type2
);
194 LONGEST low_bound
, high_bound
, new_length
;
195 if (get_discrete_bounds (range_type
, &low_bound
, &high_bound
) < 0)
196 low_bound
= 0, high_bound
= 0;
197 new_length
= val_length
/ element_length
;
198 if (val_length
% element_length
!= 0)
199 warning ("array element type size does not divide object size in cast");
200 /* FIXME-type-allocation: need a way to free this type when we are
202 range_type
= create_range_type ((struct type
*) NULL
,
203 TYPE_TARGET_TYPE (range_type
),
205 new_length
+ low_bound
- 1);
206 VALUE_TYPE (arg2
) = create_array_type ((struct type
*) NULL
,
207 element_type
, range_type
);
212 if (current_language
->c_style_arrays
213 && TYPE_CODE (type2
) == TYPE_CODE_ARRAY
)
214 arg2
= value_coerce_array (arg2
);
216 if (TYPE_CODE (type2
) == TYPE_CODE_FUNC
)
217 arg2
= value_coerce_function (arg2
);
219 type2
= check_typedef (VALUE_TYPE (arg2
));
220 COERCE_VARYING_ARRAY (arg2
, type2
);
221 code2
= TYPE_CODE (type2
);
223 if (code1
== TYPE_CODE_COMPLEX
)
224 return cast_into_complex (type
, arg2
);
225 if (code1
== TYPE_CODE_BOOL
)
227 code1
= TYPE_CODE_INT
;
228 convert_to_boolean
= 1;
230 if (code1
== TYPE_CODE_CHAR
)
231 code1
= TYPE_CODE_INT
;
232 if (code2
== TYPE_CODE_BOOL
|| code2
== TYPE_CODE_CHAR
)
233 code2
= TYPE_CODE_INT
;
235 scalar
= (code2
== TYPE_CODE_INT
|| code2
== TYPE_CODE_FLT
236 || code2
== TYPE_CODE_ENUM
|| code2
== TYPE_CODE_RANGE
);
238 if (code1
== TYPE_CODE_STRUCT
239 && code2
== TYPE_CODE_STRUCT
240 && TYPE_NAME (type
) != 0)
242 /* Look in the type of the source to see if it contains the
243 type of the target as a superclass. If so, we'll need to
244 offset the object in addition to changing its type. */
245 value_ptr v
= search_struct_field (type_name_no_tag (type
),
249 VALUE_TYPE (v
) = type
;
253 if (code1
== TYPE_CODE_FLT
&& scalar
)
254 return value_from_double (type
, value_as_double (arg2
));
255 else if ((code1
== TYPE_CODE_INT
|| code1
== TYPE_CODE_ENUM
256 || code1
== TYPE_CODE_RANGE
)
257 && (scalar
|| code2
== TYPE_CODE_PTR
))
261 if (hp_som_som_object_present
&& /* if target compiled by HP aCC */
262 (code2
== TYPE_CODE_PTR
))
267 switch (TYPE_CODE (TYPE_TARGET_TYPE (type2
)))
269 /* With HP aCC, pointers to data members have a bias */
270 case TYPE_CODE_MEMBER
:
271 retvalp
= value_from_longest (type
, value_as_long (arg2
));
272 ptr
= (unsigned int *) VALUE_CONTENTS (retvalp
); /* force evaluation */
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 */
284 longest
= value_as_long (arg2
);
285 return value_from_longest (type
, convert_to_boolean
? (LONGEST
) (longest
? 1 : 0) : longest
);
287 else if (TYPE_LENGTH (type
) == TYPE_LENGTH (type2
))
289 if (code1
== TYPE_CODE_PTR
&& code2
== TYPE_CODE_PTR
)
291 struct type
*t1
= check_typedef (TYPE_TARGET_TYPE (type
));
292 struct type
*t2
= check_typedef (TYPE_TARGET_TYPE (type2
));
293 if (TYPE_CODE (t1
) == TYPE_CODE_STRUCT
294 && TYPE_CODE (t2
) == TYPE_CODE_STRUCT
295 && !value_logical_not (arg2
))
299 /* Look in the type of the source to see if it contains the
300 type of the target as a superclass. If so, we'll need to
301 offset the pointer rather than just change its type. */
302 if (TYPE_NAME (t1
) != NULL
)
304 v
= search_struct_field (type_name_no_tag (t1
),
305 value_ind (arg2
), 0, t2
, 1);
309 VALUE_TYPE (v
) = type
;
314 /* Look in the type of the target to see if it contains the
315 type of the source as a superclass. If so, we'll need to
316 offset the pointer rather than just change its type.
317 FIXME: This fails silently with virtual inheritance. */
318 if (TYPE_NAME (t2
) != NULL
)
320 v
= search_struct_field (type_name_no_tag (t2
),
321 value_zero (t1
, not_lval
), 0, t1
, 1);
324 value_ptr v2
= value_ind (arg2
);
325 VALUE_ADDRESS (v2
) -= VALUE_ADDRESS (v
)
327 v2
= value_addr (v2
);
328 VALUE_TYPE (v2
) = type
;
333 /* No superclass found, just fall through to change ptr type. */
335 VALUE_TYPE (arg2
) = type
;
336 VALUE_ENCLOSING_TYPE (arg2
) = type
; /* pai: chk_val */
337 VALUE_POINTED_TO_OFFSET (arg2
) = 0; /* pai: chk_val */
340 else if (chill_varying_type (type
))
342 struct type
*range1
, *range2
, *eltype1
, *eltype2
;
345 LONGEST low_bound
, high_bound
;
346 char *valaddr
, *valaddr_data
;
347 /* For lint warning about eltype2 possibly uninitialized: */
349 if (code2
== TYPE_CODE_BITSTRING
)
350 error ("not implemented: converting bitstring to varying type");
351 if ((code2
!= TYPE_CODE_ARRAY
&& code2
!= TYPE_CODE_STRING
)
352 || (eltype1
= check_typedef (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, 1))),
353 eltype2
= check_typedef (TYPE_TARGET_TYPE (type2
)),
354 (TYPE_LENGTH (eltype1
) != TYPE_LENGTH (eltype2
)
355 /* || TYPE_CODE (eltype1) != TYPE_CODE (eltype2) */ )))
356 error ("Invalid conversion to varying type");
357 range1
= TYPE_FIELD_TYPE (TYPE_FIELD_TYPE (type
, 1), 0);
358 range2
= TYPE_FIELD_TYPE (type2
, 0);
359 if (get_discrete_bounds (range1
, &low_bound
, &high_bound
) < 0)
362 count1
= high_bound
- low_bound
+ 1;
363 if (get_discrete_bounds (range2
, &low_bound
, &high_bound
) < 0)
364 count1
= -1, count2
= 0; /* To force error before */
366 count2
= high_bound
- low_bound
+ 1;
368 error ("target varying type is too small");
369 val
= allocate_value (type
);
370 valaddr
= VALUE_CONTENTS_RAW (val
);
371 valaddr_data
= valaddr
+ TYPE_FIELD_BITPOS (type
, 1) / 8;
372 /* Set val's __var_length field to count2. */
373 store_signed_integer (valaddr
, TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0)),
375 /* Set the __var_data field to count2 elements copied from arg2. */
376 memcpy (valaddr_data
, VALUE_CONTENTS (arg2
),
377 count2
* TYPE_LENGTH (eltype2
));
378 /* Zero the rest of the __var_data field of val. */
379 memset (valaddr_data
+ count2
* TYPE_LENGTH (eltype2
), '\0',
380 (count1
- count2
) * TYPE_LENGTH (eltype2
));
383 else if (VALUE_LVAL (arg2
) == lval_memory
)
385 return value_at_lazy (type
, VALUE_ADDRESS (arg2
) + VALUE_OFFSET (arg2
),
386 VALUE_BFD_SECTION (arg2
));
388 else if (code1
== TYPE_CODE_VOID
)
390 return value_zero (builtin_type_void
, not_lval
);
394 error ("Invalid cast.");
399 /* Create a value of type TYPE that is zero, and return it. */
402 value_zero (type
, lv
)
406 register value_ptr val
= allocate_value (type
);
408 memset (VALUE_CONTENTS (val
), 0, TYPE_LENGTH (check_typedef (type
)));
409 VALUE_LVAL (val
) = lv
;
414 /* Return a value with type TYPE located at ADDR.
416 Call value_at only if the data needs to be fetched immediately;
417 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
418 value_at_lazy instead. value_at_lazy simply records the address of
419 the data and sets the lazy-evaluation-required flag. The lazy flag
420 is tested in the VALUE_CONTENTS macro, which is used if and when
421 the contents are actually required.
423 Note: value_at does *NOT* handle embedded offsets; perform such
424 adjustments before or after calling it. */
427 value_at (type
, addr
, sect
)
432 register value_ptr val
;
434 if (TYPE_CODE (check_typedef (type
)) == TYPE_CODE_VOID
)
435 error ("Attempt to dereference a generic pointer.");
437 val
= allocate_value (type
);
439 if (GDB_TARGET_IS_D10V
440 && TYPE_CODE (type
) == TYPE_CODE_PTR
441 && TYPE_TARGET_TYPE (type
)
442 && (TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_FUNC
))
444 /* pointer to function */
447 snum
= read_memory_unsigned_integer (addr
, 2);
448 num
= D10V_MAKE_IADDR (snum
);
449 store_address (VALUE_CONTENTS_RAW (val
), 4, num
);
451 else if (GDB_TARGET_IS_D10V
452 && TYPE_CODE (type
) == TYPE_CODE_PTR
)
454 /* pointer to data */
457 snum
= read_memory_unsigned_integer (addr
, 2);
458 num
= D10V_MAKE_DADDR (snum
);
459 store_address (VALUE_CONTENTS_RAW (val
), 4, num
);
462 read_memory_section (addr
, VALUE_CONTENTS_ALL_RAW (val
), TYPE_LENGTH (type
), sect
);
464 VALUE_LVAL (val
) = lval_memory
;
465 VALUE_ADDRESS (val
) = addr
;
466 VALUE_BFD_SECTION (val
) = sect
;
471 /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
474 value_at_lazy (type
, addr
, sect
)
479 register value_ptr val
;
481 if (TYPE_CODE (check_typedef (type
)) == TYPE_CODE_VOID
)
482 error ("Attempt to dereference a generic pointer.");
484 val
= allocate_value (type
);
486 VALUE_LVAL (val
) = lval_memory
;
487 VALUE_ADDRESS (val
) = addr
;
488 VALUE_LAZY (val
) = 1;
489 VALUE_BFD_SECTION (val
) = sect
;
494 /* Called only from the VALUE_CONTENTS and VALUE_CONTENTS_ALL macros,
495 if the current data for a variable needs to be loaded into
496 VALUE_CONTENTS(VAL). Fetches the data from the user's process, and
497 clears the lazy flag to indicate that the data in the buffer is valid.
499 If the value is zero-length, we avoid calling read_memory, which would
500 abort. We mark the value as fetched anyway -- all 0 bytes of it.
502 This function returns a value because it is used in the VALUE_CONTENTS
503 macro as part of an expression, where a void would not work. The
507 value_fetch_lazy (val
)
508 register value_ptr val
;
510 CORE_ADDR addr
= VALUE_ADDRESS (val
) + VALUE_OFFSET (val
);
511 int length
= TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val
));
513 struct type
*type
= VALUE_TYPE (val
);
514 if (GDB_TARGET_IS_D10V
515 && TYPE_CODE (type
) == TYPE_CODE_PTR
516 && TYPE_TARGET_TYPE (type
)
517 && (TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_FUNC
))
519 /* pointer to function */
522 snum
= read_memory_unsigned_integer (addr
, 2);
523 num
= D10V_MAKE_IADDR (snum
);
524 store_address (VALUE_CONTENTS_RAW (val
), 4, num
);
526 else if (GDB_TARGET_IS_D10V
527 && TYPE_CODE (type
) == TYPE_CODE_PTR
)
529 /* pointer to data */
532 snum
= read_memory_unsigned_integer (addr
, 2);
533 num
= D10V_MAKE_DADDR (snum
);
534 store_address (VALUE_CONTENTS_RAW (val
), 4, num
);
537 read_memory_section (addr
, VALUE_CONTENTS_ALL_RAW (val
), length
,
538 VALUE_BFD_SECTION (val
));
539 VALUE_LAZY (val
) = 0;
544 /* Store the contents of FROMVAL into the location of TOVAL.
545 Return a new value with the location of TOVAL and contents of FROMVAL. */
548 value_assign (toval
, fromval
)
549 register value_ptr toval
, fromval
;
551 register struct type
*type
;
552 register value_ptr val
;
553 char raw_buffer
[MAX_REGISTER_RAW_SIZE
];
556 if (!toval
->modifiable
)
557 error ("Left operand of assignment is not a modifiable lvalue.");
561 type
= VALUE_TYPE (toval
);
562 if (VALUE_LVAL (toval
) != lval_internalvar
)
563 fromval
= value_cast (type
, fromval
);
565 COERCE_ARRAY (fromval
);
566 CHECK_TYPEDEF (type
);
568 /* If TOVAL is a special machine register requiring conversion
569 of program values to a special raw format,
570 convert FROMVAL's contents now, with result in `raw_buffer',
571 and set USE_BUFFER to the number of bytes to write. */
573 if (VALUE_REGNO (toval
) >= 0)
575 int regno
= VALUE_REGNO (toval
);
576 if (REGISTER_CONVERTIBLE (regno
))
578 struct type
*fromtype
= check_typedef (VALUE_TYPE (fromval
));
579 REGISTER_CONVERT_TO_RAW (fromtype
, regno
,
580 VALUE_CONTENTS (fromval
), raw_buffer
);
581 use_buffer
= REGISTER_RAW_SIZE (regno
);
585 switch (VALUE_LVAL (toval
))
587 case lval_internalvar
:
588 set_internalvar (VALUE_INTERNALVAR (toval
), fromval
);
589 val
= value_copy (VALUE_INTERNALVAR (toval
)->value
);
590 VALUE_ENCLOSING_TYPE (val
) = VALUE_ENCLOSING_TYPE (fromval
);
591 VALUE_EMBEDDED_OFFSET (val
) = VALUE_EMBEDDED_OFFSET (fromval
);
592 VALUE_POINTED_TO_OFFSET (val
) = VALUE_POINTED_TO_OFFSET (fromval
);
595 case lval_internalvar_component
:
596 set_internalvar_component (VALUE_INTERNALVAR (toval
),
597 VALUE_OFFSET (toval
),
598 VALUE_BITPOS (toval
),
599 VALUE_BITSIZE (toval
),
606 CORE_ADDR changed_addr
;
609 if (VALUE_BITSIZE (toval
))
611 char buffer
[sizeof (LONGEST
)];
612 /* We assume that the argument to read_memory is in units of
613 host chars. FIXME: Is that correct? */
614 changed_len
= (VALUE_BITPOS (toval
)
615 + VALUE_BITSIZE (toval
)
619 if (changed_len
> (int) sizeof (LONGEST
))
620 error ("Can't handle bitfields which don't fit in a %d bit word.",
621 sizeof (LONGEST
) * HOST_CHAR_BIT
);
623 read_memory (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
624 buffer
, changed_len
);
625 modify_field (buffer
, value_as_long (fromval
),
626 VALUE_BITPOS (toval
), VALUE_BITSIZE (toval
));
627 changed_addr
= VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
);
628 dest_buffer
= buffer
;
632 changed_addr
= VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
);
633 changed_len
= use_buffer
;
634 dest_buffer
= raw_buffer
;
638 changed_addr
= VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
);
639 changed_len
= TYPE_LENGTH (type
);
640 dest_buffer
= VALUE_CONTENTS (fromval
);
643 write_memory (changed_addr
, dest_buffer
, changed_len
);
644 if (memory_changed_hook
)
645 memory_changed_hook (changed_addr
, changed_len
);
650 if (VALUE_BITSIZE (toval
))
652 char buffer
[sizeof (LONGEST
)];
653 int len
= REGISTER_RAW_SIZE (VALUE_REGNO (toval
));
655 if (len
> (int) sizeof (LONGEST
))
656 error ("Can't handle bitfields in registers larger than %d bits.",
657 sizeof (LONGEST
) * HOST_CHAR_BIT
);
659 if (VALUE_BITPOS (toval
) + VALUE_BITSIZE (toval
)
660 > len
* HOST_CHAR_BIT
)
661 /* Getting this right would involve being very careful about
663 error ("Can't assign to bitfields that cross register "
666 read_register_bytes (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
668 modify_field (buffer
, value_as_long (fromval
),
669 VALUE_BITPOS (toval
), VALUE_BITSIZE (toval
));
670 write_register_bytes (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
674 write_register_bytes (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
675 raw_buffer
, use_buffer
);
678 /* Do any conversion necessary when storing this type to more
679 than one register. */
680 #ifdef REGISTER_CONVERT_FROM_TYPE
681 memcpy (raw_buffer
, VALUE_CONTENTS (fromval
), TYPE_LENGTH (type
));
682 REGISTER_CONVERT_FROM_TYPE (VALUE_REGNO (toval
), type
, raw_buffer
);
683 write_register_bytes (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
684 raw_buffer
, TYPE_LENGTH (type
));
686 write_register_bytes (VALUE_ADDRESS (toval
) + VALUE_OFFSET (toval
),
687 VALUE_CONTENTS (fromval
), TYPE_LENGTH (type
));
690 /* Assigning to the stack pointer, frame pointer, and other
691 (architecture and calling convention specific) registers may
692 cause the frame cache to be out of date. We just do this
693 on all assignments to registers for simplicity; I doubt the slowdown
695 reinit_frame_cache ();
698 case lval_reg_frame_relative
:
700 /* value is stored in a series of registers in the frame
701 specified by the structure. Copy that value out, modify
702 it, and copy it back in. */
703 int amount_to_copy
= (VALUE_BITSIZE (toval
) ? 1 : TYPE_LENGTH (type
));
704 int reg_size
= REGISTER_RAW_SIZE (VALUE_FRAME_REGNUM (toval
));
705 int byte_offset
= VALUE_OFFSET (toval
) % reg_size
;
706 int reg_offset
= VALUE_OFFSET (toval
) / reg_size
;
709 /* Make the buffer large enough in all cases. */
710 char *buffer
= (char *) alloca (amount_to_copy
712 + MAX_REGISTER_RAW_SIZE
);
715 struct frame_info
*frame
;
717 /* Figure out which frame this is in currently. */
718 for (frame
= get_current_frame ();
719 frame
&& FRAME_FP (frame
) != VALUE_FRAME (toval
);
720 frame
= get_prev_frame (frame
))
724 error ("Value being assigned to is no longer active.");
726 amount_to_copy
+= (reg_size
- amount_to_copy
% reg_size
);
729 for ((regno
= VALUE_FRAME_REGNUM (toval
) + reg_offset
,
731 amount_copied
< amount_to_copy
;
732 amount_copied
+= reg_size
, regno
++)
734 get_saved_register (buffer
+ amount_copied
,
735 (int *) NULL
, (CORE_ADDR
*) NULL
,
736 frame
, regno
, (enum lval_type
*) NULL
);
739 /* Modify what needs to be modified. */
740 if (VALUE_BITSIZE (toval
))
741 modify_field (buffer
+ byte_offset
,
742 value_as_long (fromval
),
743 VALUE_BITPOS (toval
), VALUE_BITSIZE (toval
));
745 memcpy (buffer
+ byte_offset
, raw_buffer
, use_buffer
);
747 memcpy (buffer
+ byte_offset
, VALUE_CONTENTS (fromval
),
751 for ((regno
= VALUE_FRAME_REGNUM (toval
) + reg_offset
,
753 amount_copied
< amount_to_copy
;
754 amount_copied
+= reg_size
, regno
++)
760 /* Just find out where to put it. */
761 get_saved_register ((char *) NULL
,
762 &optim
, &addr
, frame
, regno
, &lval
);
765 error ("Attempt to assign to a value that was optimized out.");
766 if (lval
== lval_memory
)
767 write_memory (addr
, buffer
+ amount_copied
, reg_size
);
768 else if (lval
== lval_register
)
769 write_register_bytes (addr
, buffer
+ amount_copied
, reg_size
);
771 error ("Attempt to assign to an unmodifiable value.");
774 if (register_changed_hook
)
775 register_changed_hook (-1);
781 error ("Left operand of assignment is not an lvalue.");
784 /* If the field does not entirely fill a LONGEST, then zero the sign bits.
785 If the field is signed, and is negative, then sign extend. */
786 if ((VALUE_BITSIZE (toval
) > 0)
787 && (VALUE_BITSIZE (toval
) < 8 * (int) sizeof (LONGEST
)))
789 LONGEST fieldval
= value_as_long (fromval
);
790 LONGEST valmask
= (((ULONGEST
) 1) << VALUE_BITSIZE (toval
)) - 1;
793 if (!TYPE_UNSIGNED (type
) && (fieldval
& (valmask
^ (valmask
>> 1))))
794 fieldval
|= ~valmask
;
796 fromval
= value_from_longest (type
, fieldval
);
799 val
= value_copy (toval
);
800 memcpy (VALUE_CONTENTS_RAW (val
), VALUE_CONTENTS (fromval
),
802 VALUE_TYPE (val
) = type
;
803 VALUE_ENCLOSING_TYPE (val
) = VALUE_ENCLOSING_TYPE (fromval
);
804 VALUE_EMBEDDED_OFFSET (val
) = VALUE_EMBEDDED_OFFSET (fromval
);
805 VALUE_POINTED_TO_OFFSET (val
) = VALUE_POINTED_TO_OFFSET (fromval
);
810 /* Extend a value VAL to COUNT repetitions of its type. */
813 value_repeat (arg1
, count
)
817 register value_ptr val
;
819 if (VALUE_LVAL (arg1
) != lval_memory
)
820 error ("Only values in memory can be extended with '@'.");
822 error ("Invalid number %d of repetitions.", count
);
824 val
= allocate_repeat_value (VALUE_ENCLOSING_TYPE (arg1
), count
);
826 read_memory (VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
),
827 VALUE_CONTENTS_ALL_RAW (val
),
828 TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val
)));
829 VALUE_LVAL (val
) = lval_memory
;
830 VALUE_ADDRESS (val
) = VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
);
836 value_of_variable (var
, b
)
841 struct frame_info
*frame
= NULL
;
844 frame
= NULL
; /* Use selected frame. */
845 else if (symbol_read_needs_frame (var
))
847 frame
= block_innermost_frame (b
);
850 if (BLOCK_FUNCTION (b
)
851 && SYMBOL_SOURCE_NAME (BLOCK_FUNCTION (b
)))
852 error ("No frame is currently executing in block %s.",
853 SYMBOL_SOURCE_NAME (BLOCK_FUNCTION (b
)));
855 error ("No frame is currently executing in specified block");
859 val
= read_var_value (var
, frame
);
861 error ("Address of symbol \"%s\" is unknown.", SYMBOL_SOURCE_NAME (var
));
866 /* Given a value which is an array, return a value which is a pointer to its
867 first element, regardless of whether or not the array has a nonzero lower
870 FIXME: A previous comment here indicated that this routine should be
871 substracting the array's lower bound. It's not clear to me that this
872 is correct. Given an array subscripting operation, it would certainly
873 work to do the adjustment here, essentially computing:
875 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
877 However I believe a more appropriate and logical place to account for
878 the lower bound is to do so in value_subscript, essentially computing:
880 (&array[0] + ((index - lowerbound) * sizeof array[0]))
882 As further evidence consider what would happen with operations other
883 than array subscripting, where the caller would get back a value that
884 had an address somewhere before the actual first element of the array,
885 and the information about the lower bound would be lost because of
886 the coercion to pointer type.
890 value_coerce_array (arg1
)
893 register struct type
*type
= check_typedef (VALUE_TYPE (arg1
));
895 if (VALUE_LVAL (arg1
) != lval_memory
)
896 error ("Attempt to take address of value not located in memory.");
898 return value_from_longest (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
899 (LONGEST
) (VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
)));
902 /* Given a value which is a function, return a value which is a pointer
906 value_coerce_function (arg1
)
911 if (VALUE_LVAL (arg1
) != lval_memory
)
912 error ("Attempt to take address of value not located in memory.");
914 retval
= value_from_longest (lookup_pointer_type (VALUE_TYPE (arg1
)),
915 (LONGEST
) (VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
)));
916 VALUE_BFD_SECTION (retval
) = VALUE_BFD_SECTION (arg1
);
920 /* Return a pointer value for the object for which ARG1 is the contents. */
928 struct type
*type
= check_typedef (VALUE_TYPE (arg1
));
929 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
931 /* Copy the value, but change the type from (T&) to (T*).
932 We keep the same location information, which is efficient,
933 and allows &(&X) to get the location containing the reference. */
934 arg2
= value_copy (arg1
);
935 VALUE_TYPE (arg2
) = lookup_pointer_type (TYPE_TARGET_TYPE (type
));
938 if (TYPE_CODE (type
) == TYPE_CODE_FUNC
)
939 return value_coerce_function (arg1
);
941 if (VALUE_LVAL (arg1
) != lval_memory
)
942 error ("Attempt to take address of value not located in memory.");
944 /* Get target memory address */
945 arg2
= value_from_longest (lookup_pointer_type (VALUE_TYPE (arg1
)),
946 (LONGEST
) (VALUE_ADDRESS (arg1
)
947 + VALUE_OFFSET (arg1
)
948 + VALUE_EMBEDDED_OFFSET (arg1
)));
950 /* This may be a pointer to a base subobject; so remember the
951 full derived object's type ... */
952 VALUE_ENCLOSING_TYPE (arg2
) = lookup_pointer_type (VALUE_ENCLOSING_TYPE (arg1
));
953 /* ... and also the relative position of the subobject in the full object */
954 VALUE_POINTED_TO_OFFSET (arg2
) = VALUE_EMBEDDED_OFFSET (arg1
);
955 VALUE_BFD_SECTION (arg2
) = VALUE_BFD_SECTION (arg1
);
959 /* Given a value of a pointer type, apply the C unary * operator to it. */
965 struct type
*base_type
;
970 base_type
= check_typedef (VALUE_TYPE (arg1
));
972 if (TYPE_CODE (base_type
) == TYPE_CODE_MEMBER
)
973 error ("not implemented: member types in value_ind");
975 /* Allow * on an integer so we can cast it to whatever we want.
976 This returns an int, which seems like the most C-like thing
977 to do. "long long" variables are rare enough that
978 BUILTIN_TYPE_LONGEST would seem to be a mistake. */
979 if (TYPE_CODE (base_type
) == TYPE_CODE_INT
)
980 return value_at (builtin_type_int
,
981 (CORE_ADDR
) value_as_long (arg1
),
982 VALUE_BFD_SECTION (arg1
));
983 else if (TYPE_CODE (base_type
) == TYPE_CODE_PTR
)
985 struct type
*enc_type
;
986 /* We may be pointing to something embedded in a larger object */
987 /* Get the real type of the enclosing object */
988 enc_type
= check_typedef (VALUE_ENCLOSING_TYPE (arg1
));
989 enc_type
= TYPE_TARGET_TYPE (enc_type
);
990 /* Retrieve the enclosing object pointed to */
991 arg2
= value_at_lazy (enc_type
,
992 value_as_pointer (arg1
) - VALUE_POINTED_TO_OFFSET (arg1
),
993 VALUE_BFD_SECTION (arg1
));
995 VALUE_TYPE (arg2
) = TYPE_TARGET_TYPE (base_type
);
996 /* Add embedding info */
997 VALUE_ENCLOSING_TYPE (arg2
) = enc_type
;
998 VALUE_EMBEDDED_OFFSET (arg2
) = VALUE_POINTED_TO_OFFSET (arg1
);
1000 /* We may be pointing to an object of some derived type */
1001 arg2
= value_full_object (arg2
, NULL
, 0, 0, 0);
1005 error ("Attempt to take contents of a non-pointer value.");
1006 return 0; /* For lint -- never reached */
1009 /* Pushing small parts of stack frames. */
1011 /* Push one word (the size of object that a register holds). */
1014 push_word (sp
, word
)
1018 register int len
= REGISTER_SIZE
;
1019 char buffer
[MAX_REGISTER_RAW_SIZE
];
1021 store_unsigned_integer (buffer
, len
, word
);
1022 if (INNER_THAN (1, 2))
1024 /* stack grows downward */
1026 write_memory (sp
, buffer
, len
);
1030 /* stack grows upward */
1031 write_memory (sp
, buffer
, len
);
1038 /* Push LEN bytes with data at BUFFER. */
1041 push_bytes (sp
, buffer
, len
)
1046 if (INNER_THAN (1, 2))
1048 /* stack grows downward */
1050 write_memory (sp
, buffer
, len
);
1054 /* stack grows upward */
1055 write_memory (sp
, buffer
, len
);
1062 #ifndef PARM_BOUNDARY
1063 #define PARM_BOUNDARY (0)
1066 /* Push onto the stack the specified value VALUE. Pad it correctly for
1067 it to be an argument to a function. */
1070 value_push (sp
, arg
)
1071 register CORE_ADDR sp
;
1074 register int len
= TYPE_LENGTH (VALUE_ENCLOSING_TYPE (arg
));
1075 register int container_len
= len
;
1076 register int offset
;
1078 /* How big is the container we're going to put this value in? */
1080 container_len
= ((len
+ PARM_BOUNDARY
/ TARGET_CHAR_BIT
- 1)
1081 & ~(PARM_BOUNDARY
/ TARGET_CHAR_BIT
- 1));
1083 /* Are we going to put it at the high or low end of the container? */
1084 if (TARGET_BYTE_ORDER
== BIG_ENDIAN
)
1085 offset
= container_len
- len
;
1089 if (INNER_THAN (1, 2))
1091 /* stack grows downward */
1092 sp
-= container_len
;
1093 write_memory (sp
+ offset
, VALUE_CONTENTS_ALL (arg
), len
);
1097 /* stack grows upward */
1098 write_memory (sp
+ offset
, VALUE_CONTENTS_ALL (arg
), len
);
1099 sp
+= container_len
;
1105 #ifndef PUSH_ARGUMENTS
1106 #define PUSH_ARGUMENTS default_push_arguments
1110 default_push_arguments (nargs
, args
, sp
, struct_return
, struct_addr
)
1115 CORE_ADDR struct_addr
;
1117 /* ASSERT ( !struct_return); */
1119 for (i
= nargs
- 1; i
>= 0; i
--)
1120 sp
= value_push (sp
, args
[i
]);
1125 /* If we're calling a function declared without a prototype, should we
1126 promote floats to doubles? FORMAL and ACTUAL are the types of the
1127 arguments; FORMAL may be NULL.
1129 If we have no definition for this macro, either from the target or
1130 from gdbarch, provide a default. */
1131 #ifndef COERCE_FLOAT_TO_DOUBLE
1132 #define COERCE_FLOAT_TO_DOUBLE(formal, actual) \
1133 (default_coerce_float_to_double ((formal), (actual)))
1137 /* A default function for COERCE_FLOAT_TO_DOUBLE: do the coercion only
1138 when we don't have any type for the argument at hand. This occurs
1139 when we have no debug info, or when passing varargs.
1141 This is an annoying default: the rule the compiler follows is to do
1142 the standard promotions whenever there is no prototype in scope,
1143 and almost all targets want this behavior. But there are some old
1144 architectures which want this odd behavior. If you want to go
1145 through them all and fix them, please do. Modern gdbarch-style
1146 targets may find it convenient to use standard_coerce_float_to_double. */
1148 default_coerce_float_to_double (struct type
*formal
, struct type
*actual
)
1150 return formal
== NULL
;
1154 /* Always coerce floats to doubles when there is no prototype in scope.
1155 If your architecture follows the standard type promotion rules for
1156 calling unprototyped functions, your gdbarch init function can pass
1157 this function to set_gdbarch_coerce_float_to_double to use its logic. */
1159 standard_coerce_float_to_double (struct type
*formal
, struct type
*actual
)
1165 /* Perform the standard coercions that are specified
1166 for arguments to be passed to C functions.
1168 If PARAM_TYPE is non-NULL, it is the expected parameter type.
1169 IS_PROTOTYPED is non-zero if the function declaration is prototyped. */
1172 value_arg_coerce (arg
, param_type
, is_prototyped
)
1174 struct type
*param_type
;
1177 register struct type
*arg_type
= check_typedef (VALUE_TYPE (arg
));
1178 register struct type
*type
1179 = param_type
? check_typedef (param_type
) : arg_type
;
1181 switch (TYPE_CODE (type
))
1184 if (TYPE_CODE (arg_type
) != TYPE_CODE_REF
)
1186 arg
= value_addr (arg
);
1187 VALUE_TYPE (arg
) = param_type
;
1192 case TYPE_CODE_CHAR
:
1193 case TYPE_CODE_BOOL
:
1194 case TYPE_CODE_ENUM
:
1195 /* If we don't have a prototype, coerce to integer type if necessary. */
1198 if (TYPE_LENGTH (type
) < TYPE_LENGTH (builtin_type_int
))
1199 type
= builtin_type_int
;
1201 /* Currently all target ABIs require at least the width of an integer
1202 type for an argument. We may have to conditionalize the following
1203 type coercion for future targets. */
1204 if (TYPE_LENGTH (type
) < TYPE_LENGTH (builtin_type_int
))
1205 type
= builtin_type_int
;
1208 /* FIXME: We should always convert floats to doubles in the
1209 non-prototyped case. As many debugging formats include
1210 no information about prototyping, we have to live with
1211 COERCE_FLOAT_TO_DOUBLE for now. */
1212 if (!is_prototyped
&& COERCE_FLOAT_TO_DOUBLE (param_type
, arg_type
))
1214 if (TYPE_LENGTH (type
) < TYPE_LENGTH (builtin_type_double
))
1215 type
= builtin_type_double
;
1216 else if (TYPE_LENGTH (type
) > TYPE_LENGTH (builtin_type_double
))
1217 type
= builtin_type_long_double
;
1220 case TYPE_CODE_FUNC
:
1221 type
= lookup_pointer_type (type
);
1223 case TYPE_CODE_ARRAY
:
1224 if (current_language
->c_style_arrays
)
1225 type
= lookup_pointer_type (TYPE_TARGET_TYPE (type
));
1227 case TYPE_CODE_UNDEF
:
1229 case TYPE_CODE_STRUCT
:
1230 case TYPE_CODE_UNION
:
1231 case TYPE_CODE_VOID
:
1233 case TYPE_CODE_RANGE
:
1234 case TYPE_CODE_STRING
:
1235 case TYPE_CODE_BITSTRING
:
1236 case TYPE_CODE_ERROR
:
1237 case TYPE_CODE_MEMBER
:
1238 case TYPE_CODE_METHOD
:
1239 case TYPE_CODE_COMPLEX
:
1244 return value_cast (type
, arg
);
1247 /* Determine a function's address and its return type from its value.
1248 Calls error() if the function is not valid for calling. */
1251 find_function_addr (function
, retval_type
)
1253 struct type
**retval_type
;
1255 register struct type
*ftype
= check_typedef (VALUE_TYPE (function
));
1256 register enum type_code code
= TYPE_CODE (ftype
);
1257 struct type
*value_type
;
1260 /* If it's a member function, just look at the function
1263 /* Determine address to call. */
1264 if (code
== TYPE_CODE_FUNC
|| code
== TYPE_CODE_METHOD
)
1266 funaddr
= VALUE_ADDRESS (function
);
1267 value_type
= TYPE_TARGET_TYPE (ftype
);
1269 else if (code
== TYPE_CODE_PTR
)
1271 funaddr
= value_as_pointer (function
);
1272 ftype
= check_typedef (TYPE_TARGET_TYPE (ftype
));
1273 if (TYPE_CODE (ftype
) == TYPE_CODE_FUNC
1274 || TYPE_CODE (ftype
) == TYPE_CODE_METHOD
)
1276 #ifdef CONVERT_FROM_FUNC_PTR_ADDR
1277 /* FIXME: This is a workaround for the unusual function
1278 pointer representation on the RS/6000, see comment
1279 in config/rs6000/tm-rs6000.h */
1280 funaddr
= CONVERT_FROM_FUNC_PTR_ADDR (funaddr
);
1282 value_type
= TYPE_TARGET_TYPE (ftype
);
1285 value_type
= builtin_type_int
;
1287 else if (code
== TYPE_CODE_INT
)
1289 /* Handle the case of functions lacking debugging info.
1290 Their values are characters since their addresses are char */
1291 if (TYPE_LENGTH (ftype
) == 1)
1292 funaddr
= value_as_pointer (value_addr (function
));
1294 /* Handle integer used as address of a function. */
1295 funaddr
= (CORE_ADDR
) value_as_long (function
);
1297 value_type
= builtin_type_int
;
1300 error ("Invalid data type for function to be called.");
1302 *retval_type
= value_type
;
1306 /* All this stuff with a dummy frame may seem unnecessarily complicated
1307 (why not just save registers in GDB?). The purpose of pushing a dummy
1308 frame which looks just like a real frame is so that if you call a
1309 function and then hit a breakpoint (get a signal, etc), "backtrace"
1310 will look right. Whether the backtrace needs to actually show the
1311 stack at the time the inferior function was called is debatable, but
1312 it certainly needs to not display garbage. So if you are contemplating
1313 making dummy frames be different from normal frames, consider that. */
1315 /* Perform a function call in the inferior.
1316 ARGS is a vector of values of arguments (NARGS of them).
1317 FUNCTION is a value, the function to be called.
1318 Returns a value representing what the function returned.
1319 May fail to return, if a breakpoint or signal is hit
1320 during the execution of the function.
1322 ARGS is modified to contain coerced values. */
1324 static value_ptr hand_function_call
PARAMS ((value_ptr function
, int nargs
, value_ptr
* args
));
1326 hand_function_call (function
, nargs
, args
)
1331 register CORE_ADDR sp
;
1335 /* CALL_DUMMY is an array of words (REGISTER_SIZE), but each word
1336 is in host byte order. Before calling FIX_CALL_DUMMY, we byteswap it
1337 and remove any extra bytes which might exist because ULONGEST is
1338 bigger than REGISTER_SIZE.
1340 NOTE: This is pretty wierd, as the call dummy is actually a
1341 sequence of instructions. But CISC machines will have
1342 to pack the instructions into REGISTER_SIZE units (and
1343 so will RISC machines for which INSTRUCTION_SIZE is not
1346 NOTE: This is pretty stupid. CALL_DUMMY should be in strict
1347 target byte order. */
1349 static ULONGEST
*dummy
;
1353 struct type
*value_type
;
1354 unsigned char struct_return
;
1355 CORE_ADDR struct_addr
= 0;
1356 struct inferior_status
*inf_status
;
1357 struct cleanup
*old_chain
;
1359 int using_gcc
; /* Set to version of gcc in use, or zero if not gcc */
1361 struct type
*param_type
= NULL
;
1362 struct type
*ftype
= check_typedef (SYMBOL_TYPE (function
));
1364 dummy
= alloca (SIZEOF_CALL_DUMMY_WORDS
);
1365 sizeof_dummy1
= REGISTER_SIZE
* SIZEOF_CALL_DUMMY_WORDS
/ sizeof (ULONGEST
);
1366 dummy1
= alloca (sizeof_dummy1
);
1367 memcpy (dummy
, CALL_DUMMY_WORDS
, SIZEOF_CALL_DUMMY_WORDS
);
1369 if (!target_has_execution
)
1372 inf_status
= save_inferior_status (1);
1373 old_chain
= make_cleanup ((make_cleanup_func
) restore_inferior_status
,
1376 /* PUSH_DUMMY_FRAME is responsible for saving the inferior registers
1377 (and POP_FRAME for restoring them). (At least on most machines)
1378 they are saved on the stack in the inferior. */
1381 old_sp
= sp
= read_sp ();
1383 if (INNER_THAN (1, 2))
1385 /* Stack grows down */
1386 sp
-= sizeof_dummy1
;
1391 /* Stack grows up */
1393 sp
+= sizeof_dummy1
;
1396 funaddr
= find_function_addr (function
, &value_type
);
1397 CHECK_TYPEDEF (value_type
);
1400 struct block
*b
= block_for_pc (funaddr
);
1401 /* If compiled without -g, assume GCC 2. */
1402 using_gcc
= (b
== NULL
? 2 : BLOCK_GCC_COMPILED (b
));
1405 /* Are we returning a value using a structure return or a normal
1408 struct_return
= using_struct_return (function
, funaddr
, value_type
,
1411 /* Create a call sequence customized for this function
1412 and the number of arguments for it. */
1413 for (i
= 0; i
< (int) (SIZEOF_CALL_DUMMY_WORDS
/ sizeof (dummy
[0])); i
++)
1414 store_unsigned_integer (&dummy1
[i
* REGISTER_SIZE
],
1416 (ULONGEST
) dummy
[i
]);
1418 #ifdef GDB_TARGET_IS_HPPA
1419 real_pc
= FIX_CALL_DUMMY (dummy1
, start_sp
, funaddr
, nargs
, args
,
1420 value_type
, using_gcc
);
1422 FIX_CALL_DUMMY (dummy1
, start_sp
, funaddr
, nargs
, args
,
1423 value_type
, using_gcc
);
1427 if (CALL_DUMMY_LOCATION
== ON_STACK
)
1429 write_memory (start_sp
, (char *) dummy1
, sizeof_dummy1
);
1432 if (CALL_DUMMY_LOCATION
== BEFORE_TEXT_END
)
1434 /* Convex Unix prohibits executing in the stack segment. */
1435 /* Hope there is empty room at the top of the text segment. */
1436 extern CORE_ADDR text_end
;
1437 static int checked
= 0;
1439 for (start_sp
= text_end
- sizeof_dummy1
; start_sp
< text_end
; ++start_sp
)
1440 if (read_memory_integer (start_sp
, 1) != 0)
1441 error ("text segment full -- no place to put call");
1444 real_pc
= text_end
- sizeof_dummy1
;
1445 write_memory (real_pc
, (char *) dummy1
, sizeof_dummy1
);
1448 if (CALL_DUMMY_LOCATION
== AFTER_TEXT_END
)
1450 extern CORE_ADDR text_end
;
1454 errcode
= target_write_memory (real_pc
, (char *) dummy1
, sizeof_dummy1
);
1456 error ("Cannot write text segment -- call_function failed");
1459 if (CALL_DUMMY_LOCATION
== AT_ENTRY_POINT
)
1465 sp
= old_sp
; /* It really is used, for some ifdef's... */
1468 if (nargs
< TYPE_NFIELDS (ftype
))
1469 error ("too few arguments in function call");
1471 for (i
= nargs
- 1; i
>= 0; i
--)
1473 /* If we're off the end of the known arguments, do the standard
1474 promotions. FIXME: if we had a prototype, this should only
1475 be allowed if ... were present. */
1476 if (i
>= TYPE_NFIELDS (ftype
))
1477 args
[i
] = value_arg_coerce (args
[i
], NULL
, 0);
1481 int is_prototyped
= TYPE_FLAGS (ftype
) & TYPE_FLAG_PROTOTYPED
;
1482 param_type
= TYPE_FIELD_TYPE (ftype
, i
);
1484 args
[i
] = value_arg_coerce (args
[i
], param_type
, is_prototyped
);
1487 /*elz: this code is to handle the case in which the function to be called
1488 has a pointer to function as parameter and the corresponding actual argument
1489 is the address of a function and not a pointer to function variable.
1490 In aCC compiled code, the calls through pointers to functions (in the body
1491 of the function called by hand) are made via $$dyncall_external which
1492 requires some registers setting, this is taken care of if we call
1493 via a function pointer variable, but not via a function address.
1494 In cc this is not a problem. */
1498 /* if this parameter is a pointer to function */
1499 if (TYPE_CODE (param_type
) == TYPE_CODE_PTR
)
1500 if (TYPE_CODE (param_type
->target_type
) == TYPE_CODE_FUNC
)
1501 /* elz: FIXME here should go the test about the compiler used
1502 to compile the target. We want to issue the error
1503 message only if the compiler used was HP's aCC.
1504 If we used HP's cc, then there is no problem and no need
1505 to return at this point */
1506 if (using_gcc
== 0) /* && compiler == aCC */
1507 /* go see if the actual parameter is a variable of type
1508 pointer to function or just a function */
1509 if (args
[i
]->lval
== not_lval
)
1512 if (find_pc_partial_function ((CORE_ADDR
) args
[i
]->aligner
.contents
[0], &arg_name
, NULL
, NULL
))
1514 You cannot use function <%s> as argument. \n\
1515 You must use a pointer to function type variable. Command ignored.", arg_name
);
1519 #if defined (REG_STRUCT_HAS_ADDR)
1521 /* This is a machine like the sparc, where we may need to pass a pointer
1522 to the structure, not the structure itself. */
1523 for (i
= nargs
- 1; i
>= 0; i
--)
1525 struct type
*arg_type
= check_typedef (VALUE_TYPE (args
[i
]));
1526 if ((TYPE_CODE (arg_type
) == TYPE_CODE_STRUCT
1527 || TYPE_CODE (arg_type
) == TYPE_CODE_UNION
1528 || TYPE_CODE (arg_type
) == TYPE_CODE_ARRAY
1529 || TYPE_CODE (arg_type
) == TYPE_CODE_STRING
1530 || TYPE_CODE (arg_type
) == TYPE_CODE_BITSTRING
1531 || TYPE_CODE (arg_type
) == TYPE_CODE_SET
1532 || (TYPE_CODE (arg_type
) == TYPE_CODE_FLT
1533 && TYPE_LENGTH (arg_type
) > 8)
1535 && REG_STRUCT_HAS_ADDR (using_gcc
, arg_type
))
1538 int len
; /* = TYPE_LENGTH (arg_type); */
1540 arg_type
= check_typedef (VALUE_ENCLOSING_TYPE (args
[i
]));
1541 len
= TYPE_LENGTH (arg_type
);
1544 /* MVS 11/22/96: I think at least some of this stack_align code is
1545 really broken. Better to let PUSH_ARGUMENTS adjust the stack in
1546 a target-defined manner. */
1547 aligned_len
= STACK_ALIGN (len
);
1551 if (INNER_THAN (1, 2))
1553 /* stack grows downward */
1558 /* The stack grows up, so the address of the thing we push
1559 is the stack pointer before we push it. */
1562 /* Push the structure. */
1563 write_memory (sp
, VALUE_CONTENTS_ALL (args
[i
]), len
);
1564 if (INNER_THAN (1, 2))
1566 /* The stack grows down, so the address of the thing we push
1567 is the stack pointer after we push it. */
1572 /* stack grows upward */
1575 /* The value we're going to pass is the address of the thing
1577 /*args[i] = value_from_longest (lookup_pointer_type (value_type),
1579 args
[i
] = value_from_longest (lookup_pointer_type (arg_type
),
1584 #endif /* REG_STRUCT_HAS_ADDR. */
1586 /* Reserve space for the return structure to be written on the
1587 stack, if necessary */
1591 int len
= TYPE_LENGTH (value_type
);
1593 /* MVS 11/22/96: I think at least some of this stack_align code is
1594 really broken. Better to let PUSH_ARGUMENTS adjust the stack in
1595 a target-defined manner. */
1596 len
= STACK_ALIGN (len
);
1598 if (INNER_THAN (1, 2))
1600 /* stack grows downward */
1606 /* stack grows upward */
1612 /* elz: on HPPA no need for this extra alignment, maybe it is needed
1613 on other architectures. This is because all the alignment is taken care
1614 of in the above code (ifdef REG_STRUCT_HAS_ADDR) and in
1615 hppa_push_arguments */
1616 #ifndef NO_EXTRA_ALIGNMENT_NEEDED
1618 #if defined(STACK_ALIGN)
1619 /* MVS 11/22/96: I think at least some of this stack_align code is
1620 really broken. Better to let PUSH_ARGUMENTS adjust the stack in
1621 a target-defined manner. */
1622 if (INNER_THAN (1, 2))
1624 /* If stack grows down, we must leave a hole at the top. */
1627 for (i
= nargs
- 1; i
>= 0; i
--)
1628 len
+= TYPE_LENGTH (VALUE_ENCLOSING_TYPE (args
[i
]));
1629 if (CALL_DUMMY_STACK_ADJUST_P
)
1630 len
+= CALL_DUMMY_STACK_ADJUST
;
1631 sp
-= STACK_ALIGN (len
) - len
;
1633 #endif /* STACK_ALIGN */
1634 #endif /* NO_EXTRA_ALIGNMENT_NEEDED */
1636 sp
= PUSH_ARGUMENTS (nargs
, args
, sp
, struct_return
, struct_addr
);
1638 #ifdef PUSH_RETURN_ADDRESS /* for targets that use no CALL_DUMMY */
1639 /* There are a number of targets now which actually don't write any
1640 CALL_DUMMY instructions into the target, but instead just save the
1641 machine state, push the arguments, and jump directly to the callee
1642 function. Since this doesn't actually involve executing a JSR/BSR
1643 instruction, the return address must be set up by hand, either by
1644 pushing onto the stack or copying into a return-address register
1645 as appropriate. Formerly this has been done in PUSH_ARGUMENTS,
1646 but that's overloading its functionality a bit, so I'm making it
1647 explicit to do it here. */
1648 sp
= PUSH_RETURN_ADDRESS (real_pc
, sp
);
1649 #endif /* PUSH_RETURN_ADDRESS */
1651 #if defined(STACK_ALIGN)
1652 if (!INNER_THAN (1, 2))
1654 /* If stack grows up, we must leave a hole at the bottom, note
1655 that sp already has been advanced for the arguments! */
1656 if (CALL_DUMMY_STACK_ADJUST_P
)
1657 sp
+= CALL_DUMMY_STACK_ADJUST
;
1658 sp
= STACK_ALIGN (sp
);
1660 #endif /* STACK_ALIGN */
1662 /* XXX This seems wrong. For stacks that grow down we shouldn't do
1664 /* MVS 11/22/96: I think at least some of this stack_align code is
1665 really broken. Better to let PUSH_ARGUMENTS adjust the stack in
1666 a target-defined manner. */
1667 if (CALL_DUMMY_STACK_ADJUST_P
)
1668 if (INNER_THAN (1, 2))
1670 /* stack grows downward */
1671 sp
-= CALL_DUMMY_STACK_ADJUST
;
1674 /* Store the address at which the structure is supposed to be
1675 written. Note that this (and the code which reserved the space
1676 above) assumes that gcc was used to compile this function. Since
1677 it doesn't cost us anything but space and if the function is pcc
1678 it will ignore this value, we will make that assumption.
1680 Also note that on some machines (like the sparc) pcc uses a
1681 convention like gcc's. */
1684 STORE_STRUCT_RETURN (struct_addr
, sp
);
1686 /* Write the stack pointer. This is here because the statements above
1687 might fool with it. On SPARC, this write also stores the register
1688 window into the right place in the new stack frame, which otherwise
1689 wouldn't happen. (See store_inferior_registers in sparc-nat.c.) */
1692 #ifdef SAVE_DUMMY_FRAME_TOS
1693 SAVE_DUMMY_FRAME_TOS (sp
);
1697 char retbuf
[REGISTER_BYTES
];
1699 struct symbol
*symbol
;
1702 symbol
= find_pc_function (funaddr
);
1705 name
= SYMBOL_SOURCE_NAME (symbol
);
1709 /* Try the minimal symbols. */
1710 struct minimal_symbol
*msymbol
= lookup_minimal_symbol_by_pc (funaddr
);
1714 name
= SYMBOL_SOURCE_NAME (msymbol
);
1720 sprintf (format
, "at %s", local_hex_format ());
1722 /* FIXME-32x64: assumes funaddr fits in a long. */
1723 sprintf (name
, format
, (unsigned long) funaddr
);
1726 /* Execute the stack dummy routine, calling FUNCTION.
1727 When it is done, discard the empty frame
1728 after storing the contents of all regs into retbuf. */
1729 rc
= run_stack_dummy (real_pc
+ CALL_DUMMY_START_OFFSET
, retbuf
);
1733 /* We stopped inside the FUNCTION because of a random signal.
1734 Further execution of the FUNCTION is not allowed. */
1736 if (unwind_on_signal_p
)
1738 /* The user wants the context restored. */
1740 /* We must get back to the frame we were before the dummy call. */
1743 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1744 a C++ name with arguments and stuff. */
1746 The program being debugged was signaled while in a function called from GDB.\n\
1747 GDB has restored the context to what it was before the call.\n\
1748 To change this behavior use \"set unwindonsignal off\"\n\
1749 Evaluation of the expression containing the function (%s) will be abandoned.",
1754 /* The user wants to stay in the frame where we stopped (default).*/
1756 /* If we did the cleanups, we would print a spurious error
1757 message (Unable to restore previously selected frame),
1758 would write the registers from the inf_status (which is
1759 wrong), and would do other wrong things. */
1760 discard_cleanups (old_chain
);
1761 discard_inferior_status (inf_status
);
1763 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1764 a C++ name with arguments and stuff. */
1766 The program being debugged was signaled while in a function called from GDB.\n\
1767 GDB remains in the frame where the signal was received.\n\
1768 To change this behavior use \"set unwindonsignal on\"\n\
1769 Evaluation of the expression containing the function (%s) will be abandoned.",
1776 /* We hit a breakpoint inside the FUNCTION. */
1778 /* If we did the cleanups, we would print a spurious error
1779 message (Unable to restore previously selected frame),
1780 would write the registers from the inf_status (which is
1781 wrong), and would do other wrong things. */
1782 discard_cleanups (old_chain
);
1783 discard_inferior_status (inf_status
);
1785 /* The following error message used to say "The expression
1786 which contained the function call has been discarded." It
1787 is a hard concept to explain in a few words. Ideally, GDB
1788 would be able to resume evaluation of the expression when
1789 the function finally is done executing. Perhaps someday
1790 this will be implemented (it would not be easy). */
1792 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1793 a C++ name with arguments and stuff. */
1795 The program being debugged stopped while in a function called from GDB.\n\
1796 When the function (%s) is done executing, GDB will silently\n\
1797 stop (instead of continuing to evaluate the expression containing\n\
1798 the function call).", name
);
1801 /* If we get here the called FUNCTION run to completion. */
1802 do_cleanups (old_chain
);
1804 /* Figure out the value returned by the function. */
1805 /* elz: I defined this new macro for the hppa architecture only.
1806 this gives us a way to get the value returned by the function from the stack,
1807 at the same address we told the function to put it.
1808 We cannot assume on the pa that r28 still contains the address of the returned
1809 structure. Usually this will be overwritten by the callee.
1810 I don't know about other architectures, so I defined this macro
1813 #ifdef VALUE_RETURNED_FROM_STACK
1815 return (value_ptr
) VALUE_RETURNED_FROM_STACK (value_type
, struct_addr
);
1818 return value_being_returned (value_type
, retbuf
, struct_return
);
1823 call_function_by_hand (function
, nargs
, args
)
1830 return hand_function_call (function
, nargs
, args
);
1834 error ("Cannot invoke functions on this machine.");
1840 /* Create a value for an array by allocating space in the inferior, copying
1841 the data into that space, and then setting up an array value.
1843 The array bounds are set from LOWBOUND and HIGHBOUND, and the array is
1844 populated from the values passed in ELEMVEC.
1846 The element type of the array is inherited from the type of the
1847 first element, and all elements must have the same size (though we
1848 don't currently enforce any restriction on their types). */
1851 value_array (lowbound
, highbound
, elemvec
)
1858 unsigned int typelength
;
1860 struct type
*rangetype
;
1861 struct type
*arraytype
;
1864 /* Validate that the bounds are reasonable and that each of the elements
1865 have the same size. */
1867 nelem
= highbound
- lowbound
+ 1;
1870 error ("bad array bounds (%d, %d)", lowbound
, highbound
);
1872 typelength
= TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec
[0]));
1873 for (idx
= 1; idx
< nelem
; idx
++)
1875 if (TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec
[idx
])) != typelength
)
1877 error ("array elements must all be the same size");
1881 rangetype
= create_range_type ((struct type
*) NULL
, builtin_type_int
,
1882 lowbound
, highbound
);
1883 arraytype
= create_array_type ((struct type
*) NULL
,
1884 VALUE_ENCLOSING_TYPE (elemvec
[0]), rangetype
);
1886 if (!current_language
->c_style_arrays
)
1888 val
= allocate_value (arraytype
);
1889 for (idx
= 0; idx
< nelem
; idx
++)
1891 memcpy (VALUE_CONTENTS_ALL_RAW (val
) + (idx
* typelength
),
1892 VALUE_CONTENTS_ALL (elemvec
[idx
]),
1895 VALUE_BFD_SECTION (val
) = VALUE_BFD_SECTION (elemvec
[0]);
1899 /* Allocate space to store the array in the inferior, and then initialize
1900 it by copying in each element. FIXME: Is it worth it to create a
1901 local buffer in which to collect each value and then write all the
1902 bytes in one operation? */
1904 addr
= allocate_space_in_inferior (nelem
* typelength
);
1905 for (idx
= 0; idx
< nelem
; idx
++)
1907 write_memory (addr
+ (idx
* typelength
), VALUE_CONTENTS_ALL (elemvec
[idx
]),
1911 /* Create the array type and set up an array value to be evaluated lazily. */
1913 val
= value_at_lazy (arraytype
, addr
, VALUE_BFD_SECTION (elemvec
[0]));
1917 /* Create a value for a string constant by allocating space in the inferior,
1918 copying the data into that space, and returning the address with type
1919 TYPE_CODE_STRING. PTR points to the string constant data; LEN is number
1921 Note that string types are like array of char types with a lower bound of
1922 zero and an upper bound of LEN - 1. Also note that the string may contain
1923 embedded null bytes. */
1926 value_string (ptr
, len
)
1931 int lowbound
= current_language
->string_lower_bound
;
1932 struct type
*rangetype
= create_range_type ((struct type
*) NULL
,
1934 lowbound
, len
+ lowbound
- 1);
1935 struct type
*stringtype
1936 = create_string_type ((struct type
*) NULL
, rangetype
);
1939 if (current_language
->c_style_arrays
== 0)
1941 val
= allocate_value (stringtype
);
1942 memcpy (VALUE_CONTENTS_RAW (val
), ptr
, len
);
1947 /* Allocate space to store the string in the inferior, and then
1948 copy LEN bytes from PTR in gdb to that address in the inferior. */
1950 addr
= allocate_space_in_inferior (len
);
1951 write_memory (addr
, ptr
, len
);
1953 val
= value_at_lazy (stringtype
, addr
, NULL
);
1958 value_bitstring (ptr
, len
)
1963 struct type
*domain_type
= create_range_type (NULL
, builtin_type_int
,
1965 struct type
*type
= create_set_type ((struct type
*) NULL
, domain_type
);
1966 TYPE_CODE (type
) = TYPE_CODE_BITSTRING
;
1967 val
= allocate_value (type
);
1968 memcpy (VALUE_CONTENTS_RAW (val
), ptr
, TYPE_LENGTH (type
));
1972 /* See if we can pass arguments in T2 to a function which takes arguments
1973 of types T1. Both t1 and t2 are NULL-terminated vectors. If some
1974 arguments need coercion of some sort, then the coerced values are written
1975 into T2. Return value is 0 if the arguments could be matched, or the
1976 position at which they differ if not.
1978 STATICP is nonzero if the T1 argument list came from a
1979 static member function.
1981 For non-static member functions, we ignore the first argument,
1982 which is the type of the instance variable. This is because we want
1983 to handle calls with objects from derived classes. This is not
1984 entirely correct: we should actually check to make sure that a
1985 requested operation is type secure, shouldn't we? FIXME. */
1988 typecmp (staticp
, t1
, t2
)
1997 if (staticp
&& t1
== 0)
2001 if (TYPE_CODE (t1
[0]) == TYPE_CODE_VOID
)
2003 if (t1
[!staticp
] == 0)
2005 for (i
= !staticp
; t1
[i
] && TYPE_CODE (t1
[i
]) != TYPE_CODE_VOID
; i
++)
2007 struct type
*tt1
, *tt2
;
2010 tt1
= check_typedef (t1
[i
]);
2011 tt2
= check_typedef (VALUE_TYPE (t2
[i
]));
2012 if (TYPE_CODE (tt1
) == TYPE_CODE_REF
2013 /* We should be doing hairy argument matching, as below. */
2014 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1
))) == TYPE_CODE (tt2
)))
2016 if (TYPE_CODE (tt2
) == TYPE_CODE_ARRAY
)
2017 t2
[i
] = value_coerce_array (t2
[i
]);
2019 t2
[i
] = value_addr (t2
[i
]);
2023 while (TYPE_CODE (tt1
) == TYPE_CODE_PTR
2024 && (TYPE_CODE (tt2
) == TYPE_CODE_ARRAY
2025 || TYPE_CODE (tt2
) == TYPE_CODE_PTR
))
2027 tt1
= check_typedef (TYPE_TARGET_TYPE (tt1
));
2028 tt2
= check_typedef (TYPE_TARGET_TYPE (tt2
));
2030 if (TYPE_CODE (tt1
) == TYPE_CODE (tt2
))
2032 /* Array to pointer is a `trivial conversion' according to the ARM. */
2034 /* We should be doing much hairier argument matching (see section 13.2
2035 of the ARM), but as a quick kludge, just check for the same type
2037 if (TYPE_CODE (t1
[i
]) != TYPE_CODE (VALUE_TYPE (t2
[i
])))
2042 return t2
[i
] ? i
+ 1 : 0;
2045 /* Helper function used by value_struct_elt to recurse through baseclasses.
2046 Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
2047 and search in it assuming it has (class) type TYPE.
2048 If found, return value, else return NULL.
2050 If LOOKING_FOR_BASECLASS, then instead of looking for struct fields,
2051 look for a baseclass named NAME. */
2054 search_struct_field (name
, arg1
, offset
, type
, looking_for_baseclass
)
2056 register value_ptr arg1
;
2058 register struct type
*type
;
2059 int looking_for_baseclass
;
2062 int nbases
= TYPE_N_BASECLASSES (type
);
2064 CHECK_TYPEDEF (type
);
2066 if (!looking_for_baseclass
)
2067 for (i
= TYPE_NFIELDS (type
) - 1; i
>= nbases
; i
--)
2069 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
2071 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
2074 if (TYPE_FIELD_STATIC (type
, i
))
2075 v
= value_static_field (type
, i
);
2077 v
= value_primitive_field (arg1
, offset
, i
, type
);
2079 error ("there is no field named %s", name
);
2084 && (t_field_name
[0] == '\0'
2085 || (TYPE_CODE (type
) == TYPE_CODE_UNION
2086 && (strcmp_iw (t_field_name
, "else") == 0))))
2088 struct type
*field_type
= TYPE_FIELD_TYPE (type
, i
);
2089 if (TYPE_CODE (field_type
) == TYPE_CODE_UNION
2090 || TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
)
2092 /* Look for a match through the fields of an anonymous union,
2093 or anonymous struct. C++ provides anonymous unions.
2095 In the GNU Chill implementation of variant record types,
2096 each <alternative field> has an (anonymous) union type,
2097 each member of the union represents a <variant alternative>.
2098 Each <variant alternative> is represented as a struct,
2099 with a member for each <variant field>. */
2102 int new_offset
= offset
;
2104 /* This is pretty gross. In G++, the offset in an anonymous
2105 union is relative to the beginning of the enclosing struct.
2106 In the GNU Chill implementation of variant records,
2107 the bitpos is zero in an anonymous union field, so we
2108 have to add the offset of the union here. */
2109 if (TYPE_CODE (field_type
) == TYPE_CODE_STRUCT
2110 || (TYPE_NFIELDS (field_type
) > 0
2111 && TYPE_FIELD_BITPOS (field_type
, 0) == 0))
2112 new_offset
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
2114 v
= search_struct_field (name
, arg1
, new_offset
, field_type
,
2115 looking_for_baseclass
);
2122 for (i
= 0; i
< nbases
; i
++)
2125 struct type
*basetype
= check_typedef (TYPE_BASECLASS (type
, i
));
2126 /* If we are looking for baseclasses, this is what we get when we
2127 hit them. But it could happen that the base part's member name
2128 is not yet filled in. */
2129 int found_baseclass
= (looking_for_baseclass
2130 && TYPE_BASECLASS_NAME (type
, i
) != NULL
2131 && (strcmp_iw (name
, TYPE_BASECLASS_NAME (type
, i
)) == 0));
2133 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2136 value_ptr v2
= allocate_value (basetype
);
2138 boffset
= baseclass_offset (type
, i
,
2139 VALUE_CONTENTS (arg1
) + offset
,
2140 VALUE_ADDRESS (arg1
)
2141 + VALUE_OFFSET (arg1
) + offset
);
2143 error ("virtual baseclass botch");
2145 /* The virtual base class pointer might have been clobbered by the
2146 user program. Make sure that it still points to a valid memory
2150 if (boffset
< 0 || boffset
>= TYPE_LENGTH (type
))
2152 CORE_ADDR base_addr
;
2154 base_addr
= VALUE_ADDRESS (arg1
) + VALUE_OFFSET (arg1
) + boffset
;
2155 if (target_read_memory (base_addr
, VALUE_CONTENTS_RAW (v2
),
2156 TYPE_LENGTH (basetype
)) != 0)
2157 error ("virtual baseclass botch");
2158 VALUE_LVAL (v2
) = lval_memory
;
2159 VALUE_ADDRESS (v2
) = base_addr
;
2163 VALUE_LVAL (v2
) = VALUE_LVAL (arg1
);
2164 VALUE_ADDRESS (v2
) = VALUE_ADDRESS (arg1
);
2165 VALUE_OFFSET (v2
) = VALUE_OFFSET (arg1
) + boffset
;
2166 if (VALUE_LAZY (arg1
))
2167 VALUE_LAZY (v2
) = 1;
2169 memcpy (VALUE_CONTENTS_RAW (v2
),
2170 VALUE_CONTENTS_RAW (arg1
) + boffset
,
2171 TYPE_LENGTH (basetype
));
2174 if (found_baseclass
)
2176 v
= search_struct_field (name
, v2
, 0, TYPE_BASECLASS (type
, i
),
2177 looking_for_baseclass
);
2179 else if (found_baseclass
)
2180 v
= value_primitive_field (arg1
, offset
, i
, type
);
2182 v
= search_struct_field (name
, arg1
,
2183 offset
+ TYPE_BASECLASS_BITPOS (type
, i
) / 8,
2184 basetype
, looking_for_baseclass
);
2192 /* Return the offset (in bytes) of the virtual base of type BASETYPE
2193 * in an object pointed to by VALADDR (on the host), assumed to be of
2194 * type TYPE. OFFSET is number of bytes beyond start of ARG to start
2195 * looking (in case VALADDR is the contents of an enclosing object).
2197 * This routine recurses on the primary base of the derived class because
2198 * the virtual base entries of the primary base appear before the other
2199 * virtual base entries.
2201 * If the virtual base is not found, a negative integer is returned.
2202 * The magnitude of the negative integer is the number of entries in
2203 * the virtual table to skip over (entries corresponding to various
2204 * ancestral classes in the chain of primary bases).
2206 * Important: This assumes the HP / Taligent C++ runtime
2207 * conventions. Use baseclass_offset() instead to deal with g++
2211 find_rt_vbase_offset (type
, basetype
, valaddr
, offset
, boffset_p
, skip_p
)
2213 struct type
*basetype
;
2219 int boffset
; /* offset of virtual base */
2220 int index
; /* displacement to use in virtual table */
2224 CORE_ADDR vtbl
; /* the virtual table pointer */
2225 struct type
*pbc
; /* the primary base class */
2227 /* Look for the virtual base recursively in the primary base, first.
2228 * This is because the derived class object and its primary base
2229 * subobject share the primary virtual table. */
2232 pbc
= TYPE_PRIMARY_BASE (type
);
2235 find_rt_vbase_offset (pbc
, basetype
, valaddr
, offset
, &boffset
, &skip
);
2238 *boffset_p
= boffset
;
2247 /* Find the index of the virtual base according to HP/Taligent
2248 runtime spec. (Depth-first, left-to-right.) */
2249 index
= virtual_base_index_skip_primaries (basetype
, type
);
2253 *skip_p
= skip
+ virtual_base_list_length_skip_primaries (type
);
2258 /* pai: FIXME -- 32x64 possible problem */
2259 /* First word (4 bytes) in object layout is the vtable pointer */
2260 vtbl
= *(CORE_ADDR
*) (valaddr
+ offset
);
2262 /* Before the constructor is invoked, things are usually zero'd out. */
2264 error ("Couldn't find virtual table -- object may not be constructed yet.");
2267 /* Find virtual base's offset -- jump over entries for primary base
2268 * ancestors, then use the index computed above. But also adjust by
2269 * HP_ACC_VBASE_START for the vtable slots before the start of the
2270 * virtual base entries. Offset is negative -- virtual base entries
2271 * appear _before_ the address point of the virtual table. */
2273 /* pai: FIXME -- 32x64 problem, if word = 8 bytes, change multiplier
2276 /* epstein : FIXME -- added param for overlay section. May not be correct */
2277 vp
= value_at (builtin_type_int
, vtbl
+ 4 * (-skip
- index
- HP_ACC_VBASE_START
), NULL
);
2278 boffset
= value_as_long (vp
);
2280 *boffset_p
= boffset
;
2285 /* Helper function used by value_struct_elt to recurse through baseclasses.
2286 Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
2287 and search in it assuming it has (class) type TYPE.
2288 If found, return value, else if name matched and args not return (value)-1,
2289 else return NULL. */
2292 search_struct_method (name
, arg1p
, args
, offset
, static_memfuncp
, type
)
2294 register value_ptr
*arg1p
, *args
;
2295 int offset
, *static_memfuncp
;
2296 register struct type
*type
;
2300 int name_matched
= 0;
2301 char dem_opname
[64];
2303 CHECK_TYPEDEF (type
);
2304 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
2306 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
2307 /* FIXME! May need to check for ARM demangling here */
2308 if (strncmp (t_field_name
, "__", 2) == 0 ||
2309 strncmp (t_field_name
, "op", 2) == 0 ||
2310 strncmp (t_field_name
, "type", 4) == 0)
2312 if (cplus_demangle_opname (t_field_name
, dem_opname
, DMGL_ANSI
))
2313 t_field_name
= dem_opname
;
2314 else if (cplus_demangle_opname (t_field_name
, dem_opname
, 0))
2315 t_field_name
= dem_opname
;
2317 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
2319 int j
= TYPE_FN_FIELDLIST_LENGTH (type
, i
) - 1;
2320 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (type
, i
);
2323 if (j
> 0 && args
== 0)
2324 error ("cannot resolve overloaded method `%s': no arguments supplied", name
);
2327 if (TYPE_FN_FIELD_STUB (f
, j
))
2328 check_stub_method (type
, i
, j
);
2329 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f
, j
),
2330 TYPE_FN_FIELD_ARGS (f
, j
), args
))
2332 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
2333 return value_virtual_fn_field (arg1p
, f
, j
, type
, offset
);
2334 if (TYPE_FN_FIELD_STATIC_P (f
, j
) && static_memfuncp
)
2335 *static_memfuncp
= 1;
2336 v
= value_fn_field (arg1p
, f
, j
, type
, offset
);
2345 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2349 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2351 if (TYPE_HAS_VTABLE (type
))
2353 /* HP aCC compiled type, search for virtual base offset
2354 according to HP/Taligent runtime spec. */
2356 find_rt_vbase_offset (type
, TYPE_BASECLASS (type
, i
),
2357 VALUE_CONTENTS_ALL (*arg1p
),
2358 offset
+ VALUE_EMBEDDED_OFFSET (*arg1p
),
2359 &base_offset
, &skip
);
2361 error ("Virtual base class offset not found in vtable");
2365 struct type
*baseclass
= check_typedef (TYPE_BASECLASS (type
, i
));
2368 /* The virtual base class pointer might have been clobbered by the
2369 user program. Make sure that it still points to a valid memory
2372 if (offset
< 0 || offset
>= TYPE_LENGTH (type
))
2374 base_valaddr
= (char *) alloca (TYPE_LENGTH (baseclass
));
2375 if (target_read_memory (VALUE_ADDRESS (*arg1p
)
2376 + VALUE_OFFSET (*arg1p
) + offset
,
2378 TYPE_LENGTH (baseclass
)) != 0)
2379 error ("virtual baseclass botch");
2382 base_valaddr
= VALUE_CONTENTS (*arg1p
) + offset
;
2385 baseclass_offset (type
, i
, base_valaddr
,
2386 VALUE_ADDRESS (*arg1p
)
2387 + VALUE_OFFSET (*arg1p
) + offset
);
2388 if (base_offset
== -1)
2389 error ("virtual baseclass botch");
2394 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2396 v
= search_struct_method (name
, arg1p
, args
, base_offset
+ offset
,
2397 static_memfuncp
, TYPE_BASECLASS (type
, i
));
2398 if (v
== (value_ptr
) - 1)
2404 /* FIXME-bothner: Why is this commented out? Why is it here? */
2405 /* *arg1p = arg1_tmp; */
2410 return (value_ptr
) - 1;
2415 /* Given *ARGP, a value of type (pointer to a)* structure/union,
2416 extract the component named NAME from the ultimate target structure/union
2417 and return it as a value with its appropriate type.
2418 ERR is used in the error message if *ARGP's type is wrong.
2420 C++: ARGS is a list of argument types to aid in the selection of
2421 an appropriate method. Also, handle derived types.
2423 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
2424 where the truthvalue of whether the function that was resolved was
2425 a static member function or not is stored.
2427 ERR is an error message to be printed in case the field is not found. */
2430 value_struct_elt (argp
, args
, name
, static_memfuncp
, err
)
2431 register value_ptr
*argp
, *args
;
2433 int *static_memfuncp
;
2436 register struct type
*t
;
2439 COERCE_ARRAY (*argp
);
2441 t
= check_typedef (VALUE_TYPE (*argp
));
2443 /* Follow pointers until we get to a non-pointer. */
2445 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
2447 *argp
= value_ind (*argp
);
2448 /* Don't coerce fn pointer to fn and then back again! */
2449 if (TYPE_CODE (VALUE_TYPE (*argp
)) != TYPE_CODE_FUNC
)
2450 COERCE_ARRAY (*argp
);
2451 t
= check_typedef (VALUE_TYPE (*argp
));
2454 if (TYPE_CODE (t
) == TYPE_CODE_MEMBER
)
2455 error ("not implemented: member type in value_struct_elt");
2457 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2458 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2459 error ("Attempt to extract a component of a value that is not a %s.", err
);
2461 /* Assume it's not, unless we see that it is. */
2462 if (static_memfuncp
)
2463 *static_memfuncp
= 0;
2467 /* if there are no arguments ...do this... */
2469 /* Try as a field first, because if we succeed, there
2470 is less work to be done. */
2471 v
= search_struct_field (name
, *argp
, 0, t
, 0);
2475 /* C++: If it was not found as a data field, then try to
2476 return it as a pointer to a method. */
2478 if (destructor_name_p (name
, t
))
2479 error ("Cannot get value of destructor");
2481 v
= search_struct_method (name
, argp
, args
, 0, static_memfuncp
, t
);
2483 if (v
== (value_ptr
) - 1)
2484 error ("Cannot take address of a method");
2487 if (TYPE_NFN_FIELDS (t
))
2488 error ("There is no member or method named %s.", name
);
2490 error ("There is no member named %s.", name
);
2495 if (destructor_name_p (name
, t
))
2499 /* Destructors are a special case. */
2500 int m_index
, f_index
;
2503 if (get_destructor_fn_field (t
, &m_index
, &f_index
))
2505 v
= value_fn_field (NULL
, TYPE_FN_FIELDLIST1 (t
, m_index
),
2509 error ("could not find destructor function named %s.", name
);
2515 error ("destructor should not have any argument");
2519 v
= search_struct_method (name
, argp
, args
, 0, static_memfuncp
, t
);
2521 if (v
== (value_ptr
) - 1)
2523 error ("Argument list of %s mismatch with component in the structure.", name
);
2527 /* See if user tried to invoke data as function. If so,
2528 hand it back. If it's not callable (i.e., a pointer to function),
2529 gdb should give an error. */
2530 v
= search_struct_field (name
, *argp
, 0, t
, 0);
2534 error ("Structure has no component named %s.", name
);
2538 /* Search through the methods of an object (and its bases)
2539 * to find a specified method. Return the pointer to the
2540 * fn_field list of overloaded instances.
2541 * Helper function for value_find_oload_list.
2542 * ARGP is a pointer to a pointer to a value (the object)
2543 * METHOD is a string containing the method name
2544 * OFFSET is the offset within the value
2545 * STATIC_MEMFUNCP is set if the method is static
2546 * TYPE is the assumed type of the object
2547 * NUM_FNS is the number of overloaded instances
2548 * BASETYPE is set to the actual type of the subobject where the method is found
2549 * BOFFSET is the offset of the base subobject where the method is found */
2551 static struct fn_field
*
2552 find_method_list (argp
, method
, offset
, static_memfuncp
, type
, num_fns
, basetype
, boffset
)
2556 int *static_memfuncp
;
2559 struct type
**basetype
;
2564 CHECK_TYPEDEF (type
);
2568 /* First check in object itself */
2569 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; i
--)
2571 /* pai: FIXME What about operators and type conversions? */
2572 char *fn_field_name
= TYPE_FN_FIELDLIST_NAME (type
, i
);
2573 if (fn_field_name
&& (strcmp_iw (fn_field_name
, method
) == 0))
2575 *num_fns
= TYPE_FN_FIELDLIST_LENGTH (type
, i
);
2578 return TYPE_FN_FIELDLIST1 (type
, i
);
2582 /* Not found in object, check in base subobjects */
2583 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
2586 if (BASETYPE_VIA_VIRTUAL (type
, i
))
2588 if (TYPE_HAS_VTABLE (type
))
2590 /* HP aCC compiled type, search for virtual base offset
2591 * according to HP/Taligent runtime spec. */
2593 find_rt_vbase_offset (type
, TYPE_BASECLASS (type
, i
),
2594 VALUE_CONTENTS_ALL (*argp
),
2595 offset
+ VALUE_EMBEDDED_OFFSET (*argp
),
2596 &base_offset
, &skip
);
2598 error ("Virtual base class offset not found in vtable");
2602 /* probably g++ runtime model */
2603 base_offset
= VALUE_OFFSET (*argp
) + offset
;
2605 baseclass_offset (type
, i
,
2606 VALUE_CONTENTS (*argp
) + base_offset
,
2607 VALUE_ADDRESS (*argp
) + base_offset
);
2608 if (base_offset
== -1)
2609 error ("virtual baseclass botch");
2613 /* non-virtual base, simply use bit position from debug info */
2615 base_offset
= TYPE_BASECLASS_BITPOS (type
, i
) / 8;
2617 f
= find_method_list (argp
, method
, base_offset
+ offset
,
2618 static_memfuncp
, TYPE_BASECLASS (type
, i
), num_fns
, basetype
, boffset
);
2625 /* Return the list of overloaded methods of a specified name.
2626 * ARGP is a pointer to a pointer to a value (the object)
2627 * METHOD is the method name
2628 * OFFSET is the offset within the value contents
2629 * STATIC_MEMFUNCP is set if the method is static
2630 * NUM_FNS is the number of overloaded instances
2631 * BASETYPE is set to the type of the base subobject that defines the method
2632 * BOFFSET is the offset of the base subobject which defines the method */
2635 value_find_oload_method_list (argp
, method
, offset
, static_memfuncp
, num_fns
, basetype
, boffset
)
2639 int *static_memfuncp
;
2641 struct type
**basetype
;
2646 t
= check_typedef (VALUE_TYPE (*argp
));
2648 /* code snarfed from value_struct_elt */
2649 while (TYPE_CODE (t
) == TYPE_CODE_PTR
|| TYPE_CODE (t
) == TYPE_CODE_REF
)
2651 *argp
= value_ind (*argp
);
2652 /* Don't coerce fn pointer to fn and then back again! */
2653 if (TYPE_CODE (VALUE_TYPE (*argp
)) != TYPE_CODE_FUNC
)
2654 COERCE_ARRAY (*argp
);
2655 t
= check_typedef (VALUE_TYPE (*argp
));
2658 if (TYPE_CODE (t
) == TYPE_CODE_MEMBER
)
2659 error ("Not implemented: member type in value_find_oload_lis");
2661 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
2662 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
2663 error ("Attempt to extract a component of a value that is not a struct or union");
2665 /* Assume it's not static, unless we see that it is. */
2666 if (static_memfuncp
)
2667 *static_memfuncp
= 0;
2669 return find_method_list (argp
, method
, 0, static_memfuncp
, t
, num_fns
, basetype
, boffset
);
2673 /* Given an array of argument types (ARGTYPES) (which includes an
2674 entry for "this" in the case of C++ methods), the number of
2675 arguments NARGS, the NAME of a function whether it's a method or
2676 not (METHOD), and the degree of laxness (LAX) in conforming to
2677 overload resolution rules in ANSI C++, find the best function that
2678 matches on the argument types according to the overload resolution
2681 In the case of class methods, the parameter OBJ is an object value
2682 in which to search for overloaded methods.
2684 In the case of non-method functions, the parameter FSYM is a symbol
2685 corresponding to one of the overloaded functions.
2687 Return value is an integer: 0 -> good match, 10 -> debugger applied
2688 non-standard coercions, 100 -> incompatible.
2690 If a method is being searched for, VALP will hold the value.
2691 If a non-method is being searched for, SYMP will hold the symbol for it.
2693 If a method is being searched for, and it is a static method,
2694 then STATICP will point to a non-zero value.
2696 Note: This function does *not* check the value of
2697 overload_resolution. Caller must check it to see whether overload
2698 resolution is permitted.
2702 find_overload_match (arg_types
, nargs
, name
, method
, lax
, obj
, fsym
, valp
, symp
, staticp
)
2703 struct type
**arg_types
;
2709 struct symbol
*fsym
;
2711 struct symbol
**symp
;
2715 struct type
**parm_types
;
2716 int champ_nparms
= 0;
2718 short oload_champ
= -1; /* Index of best overloaded function */
2719 short oload_ambiguous
= 0; /* Current ambiguity state for overload resolution */
2720 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs */
2721 short oload_ambig_champ
= -1; /* 2nd contender for best match */
2722 short oload_non_standard
= 0; /* did we have to use non-standard conversions? */
2723 short oload_incompatible
= 0; /* are args supplied incompatible with any function? */
2725 struct badness_vector
*bv
; /* A measure of how good an overloaded instance is */
2726 struct badness_vector
*oload_champ_bv
= NULL
; /* The measure for the current best match */
2728 value_ptr temp
= obj
;
2729 struct fn_field
*fns_ptr
= NULL
; /* For methods, the list of overloaded methods */
2730 struct symbol
**oload_syms
= NULL
; /* For non-methods, the list of overloaded function symbols */
2731 int num_fns
= 0; /* Number of overloaded instances being considered */
2732 struct type
*basetype
= NULL
;
2737 char *obj_type_name
= NULL
;
2738 char *func_name
= NULL
;
2740 /* Get the list of overloaded methods or functions */
2745 struct type
*domain
;
2746 obj_type_name
= TYPE_NAME (VALUE_TYPE (obj
));
2747 /* Hack: evaluate_subexp_standard often passes in a pointer
2748 value rather than the object itself, so try again */
2749 if ((!obj_type_name
|| !*obj_type_name
) &&
2750 (TYPE_CODE (VALUE_TYPE (obj
)) == TYPE_CODE_PTR
))
2751 obj_type_name
= TYPE_NAME (TYPE_TARGET_TYPE (VALUE_TYPE (obj
)));
2753 fns_ptr
= value_find_oload_method_list (&temp
, name
, 0,
2756 &basetype
, &boffset
);
2757 if (!fns_ptr
|| !num_fns
)
2758 error ("Couldn't find method %s%s%s",
2760 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2762 domain
= TYPE_DOMAIN_TYPE (fns_ptr
[0].type
);
2763 len
= TYPE_NFN_FIELDS (domain
);
2764 /* NOTE: dan/2000-03-10: This stuff is for STABS, which won't
2765 give us the info we need directly in the types. We have to
2766 use the method stub conversion to get it. Be aware that this
2767 is by no means perfect, and if you use STABS, please move to
2768 DWARF-2, or something like it, because trying to improve
2769 overloading using STABS is really a waste of time. */
2770 for (i
= 0; i
< len
; i
++)
2773 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (domain
, i
);
2774 int len2
= TYPE_FN_FIELDLIST_LENGTH (domain
, i
);
2776 for (j
= 0; j
< len2
; j
++)
2778 if (TYPE_FN_FIELD_STUB (f
, j
))
2779 check_stub_method (domain
, i
, j
);
2786 func_name
= cplus_demangle (SYMBOL_NAME (fsym
), DMGL_NO_OPTS
);
2788 /* If the name is NULL this must be a C-style function.
2789 Just return the same symbol. */
2796 oload_syms
= make_symbol_overload_list (fsym
);
2797 while (oload_syms
[++i
])
2800 error ("Couldn't find function %s", func_name
);
2803 oload_champ_bv
= NULL
;
2805 /* Consider each candidate in turn */
2806 for (ix
= 0; ix
< num_fns
; ix
++)
2810 /* For static member functions, we won't have a this pointer, but nothing
2811 else seems to handle them right now, so we just pretend ourselves */
2814 if (TYPE_FN_FIELD_ARGS(fns_ptr
,ix
))
2816 while (TYPE_CODE(TYPE_FN_FIELD_ARGS(fns_ptr
,ix
)[nparms
]) != TYPE_CODE_VOID
)
2822 /* If it's not a method, this is the proper place */
2823 nparms
=TYPE_NFIELDS(SYMBOL_TYPE(oload_syms
[ix
]));
2826 /* Prepare array of parameter types */
2827 parm_types
= (struct type
**) xmalloc (nparms
* (sizeof (struct type
*)));
2828 for (jj
= 0; jj
< nparms
; jj
++)
2829 parm_types
[jj
] = (method
2830 ? (TYPE_FN_FIELD_ARGS (fns_ptr
, ix
)[jj
])
2831 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms
[ix
]), jj
));
2833 /* Compare parameter types to supplied argument types */
2834 bv
= rank_function (parm_types
, nparms
, arg_types
, nargs
);
2836 if (!oload_champ_bv
)
2838 oload_champ_bv
= bv
;
2840 champ_nparms
= nparms
;
2843 /* See whether current candidate is better or worse than previous best */
2844 switch (compare_badness (bv
, oload_champ_bv
))
2847 oload_ambiguous
= 1; /* top two contenders are equally good */
2848 oload_ambig_champ
= ix
;
2851 oload_ambiguous
= 2; /* incomparable top contenders */
2852 oload_ambig_champ
= ix
;
2855 oload_champ_bv
= bv
; /* new champion, record details */
2856 oload_ambiguous
= 0;
2858 oload_ambig_champ
= -1;
2859 champ_nparms
= nparms
;
2867 /* FIXME: cagney/2000-03-12: Send the output to gdb_stderr. See
2868 comments above about adding a ``set debug'' command. */
2870 printf ("Overloaded method instance %s, # of parms %d\n", fns_ptr
[ix
].physname
, nparms
);
2872 printf ("Overloaded function instance %s # of parms %d\n", SYMBOL_DEMANGLED_NAME (oload_syms
[ix
]), nparms
);
2873 for (jj
= 0; jj
< nargs
; jj
++)
2874 printf ("...Badness @ %d : %d\n", jj
, bv
->rank
[jj
]);
2875 printf ("Overload resolution champion is %d, ambiguous? %d\n", oload_champ
, oload_ambiguous
);
2877 } /* end loop over all candidates */
2879 /* NOTE: dan/2000-03-10: Seems to be a better idea to just pick one
2880 if they have the exact same goodness. This is because there is no
2881 way to differentiate based on return type, which we need to in
2882 cases like overloads of .begin() <It's both const and non-const> */
2884 if (oload_ambiguous
)
2887 error ("Cannot resolve overloaded method %s%s%s to unique instance; disambiguate by specifying function signature",
2889 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2892 error ("Cannot resolve overloaded function %s to unique instance; disambiguate by specifying function signature",
2897 /* Check how bad the best match is */
2898 for (ix
= 1; ix
<= nargs
; ix
++)
2900 switch (oload_champ_bv
->rank
[ix
])
2903 oload_non_standard
= 1; /* non-standard type conversions needed */
2906 oload_incompatible
= 1; /* truly mismatched types */
2910 if (oload_incompatible
)
2913 error ("Cannot resolve method %s%s%s to any overloaded instance",
2915 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2918 error ("Cannot resolve function %s to any overloaded instance",
2921 else if (oload_non_standard
)
2924 warning ("Using non-standard conversion to match method %s%s%s to supplied arguments",
2926 (obj_type_name
&& *obj_type_name
) ? "::" : "",
2929 warning ("Using non-standard conversion to match function %s to supplied arguments",
2935 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr
, oload_champ
))
2936 *valp
= value_virtual_fn_field (&temp
, fns_ptr
, oload_champ
, basetype
, boffset
);
2938 *valp
= value_fn_field (&temp
, fns_ptr
, oload_champ
, basetype
, boffset
);
2942 *symp
= oload_syms
[oload_champ
];
2946 return oload_incompatible
? 100 : (oload_non_standard
? 10 : 0);
2949 /* C++: return 1 is NAME is a legitimate name for the destructor
2950 of type TYPE. If TYPE does not have a destructor, or
2951 if NAME is inappropriate for TYPE, an error is signaled. */
2953 destructor_name_p (name
, type
)
2955 const struct type
*type
;
2957 /* destructors are a special case. */
2961 char *dname
= type_name_no_tag (type
);
2962 char *cp
= strchr (dname
, '<');
2965 /* Do not compare the template part for template classes. */
2967 len
= strlen (dname
);
2970 if (strlen (name
+ 1) != len
|| !STREQN (dname
, name
+ 1, len
))
2971 error ("name of destructor must equal name of class");
2978 /* Helper function for check_field: Given TYPE, a structure/union,
2979 return 1 if the component named NAME from the ultimate
2980 target structure/union is defined, otherwise, return 0. */
2983 check_field_in (type
, name
)
2984 register struct type
*type
;
2989 for (i
= TYPE_NFIELDS (type
) - 1; i
>= TYPE_N_BASECLASSES (type
); i
--)
2991 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
2992 if (t_field_name
&& (strcmp_iw (t_field_name
, name
) == 0))
2996 /* C++: If it was not found as a data field, then try to
2997 return it as a pointer to a method. */
2999 /* Destructors are a special case. */
3000 if (destructor_name_p (name
, type
))
3002 int m_index
, f_index
;
3004 return get_destructor_fn_field (type
, &m_index
, &f_index
);
3007 for (i
= TYPE_NFN_FIELDS (type
) - 1; i
>= 0; --i
)
3009 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type
, i
), name
) == 0)
3013 for (i
= TYPE_N_BASECLASSES (type
) - 1; i
>= 0; i
--)
3014 if (check_field_in (TYPE_BASECLASS (type
, i
), name
))
3021 /* C++: Given ARG1, a value of type (pointer to a)* structure/union,
3022 return 1 if the component named NAME from the ultimate
3023 target structure/union is defined, otherwise, return 0. */
3026 check_field (arg1
, name
)
3027 register value_ptr arg1
;
3030 register struct type
*t
;
3032 COERCE_ARRAY (arg1
);
3034 t
= VALUE_TYPE (arg1
);
3036 /* Follow pointers until we get to a non-pointer. */
3041 if (TYPE_CODE (t
) != TYPE_CODE_PTR
&& TYPE_CODE (t
) != TYPE_CODE_REF
)
3043 t
= TYPE_TARGET_TYPE (t
);
3046 if (TYPE_CODE (t
) == TYPE_CODE_MEMBER
)
3047 error ("not implemented: member type in check_field");
3049 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
3050 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
3051 error ("Internal error: `this' is not an aggregate");
3053 return check_field_in (t
, name
);
3056 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3057 return the address of this member as a "pointer to member"
3058 type. If INTYPE is non-null, then it will be the type
3059 of the member we are looking for. This will help us resolve
3060 "pointers to member functions". This function is used
3061 to resolve user expressions of the form "DOMAIN::NAME". */
3064 value_struct_elt_for_reference (domain
, offset
, curtype
, name
, intype
)
3065 struct type
*domain
, *curtype
, *intype
;
3069 register struct type
*t
= curtype
;
3073 if (TYPE_CODE (t
) != TYPE_CODE_STRUCT
3074 && TYPE_CODE (t
) != TYPE_CODE_UNION
)
3075 error ("Internal error: non-aggregate type to value_struct_elt_for_reference");
3077 for (i
= TYPE_NFIELDS (t
) - 1; i
>= TYPE_N_BASECLASSES (t
); i
--)
3079 char *t_field_name
= TYPE_FIELD_NAME (t
, i
);
3081 if (t_field_name
&& STREQ (t_field_name
, name
))
3083 if (TYPE_FIELD_STATIC (t
, i
))
3085 v
= value_static_field (t
, i
);
3087 error ("Internal error: could not find static variable %s",
3091 if (TYPE_FIELD_PACKED (t
, i
))
3092 error ("pointers to bitfield members not allowed");
3094 return value_from_longest
3095 (lookup_reference_type (lookup_member_type (TYPE_FIELD_TYPE (t
, i
),
3097 offset
+ (LONGEST
) (TYPE_FIELD_BITPOS (t
, i
) >> 3));
3101 /* C++: If it was not found as a data field, then try to
3102 return it as a pointer to a method. */
3104 /* Destructors are a special case. */
3105 if (destructor_name_p (name
, t
))
3107 error ("member pointers to destructors not implemented yet");
3110 /* Perform all necessary dereferencing. */
3111 while (intype
&& TYPE_CODE (intype
) == TYPE_CODE_PTR
)
3112 intype
= TYPE_TARGET_TYPE (intype
);
3114 for (i
= TYPE_NFN_FIELDS (t
) - 1; i
>= 0; --i
)
3116 char *t_field_name
= TYPE_FN_FIELDLIST_NAME (t
, i
);
3117 char dem_opname
[64];
3119 if (strncmp (t_field_name
, "__", 2) == 0 ||
3120 strncmp (t_field_name
, "op", 2) == 0 ||
3121 strncmp (t_field_name
, "type", 4) == 0)
3123 if (cplus_demangle_opname (t_field_name
, dem_opname
, DMGL_ANSI
))
3124 t_field_name
= dem_opname
;
3125 else if (cplus_demangle_opname (t_field_name
, dem_opname
, 0))
3126 t_field_name
= dem_opname
;
3128 if (t_field_name
&& STREQ (t_field_name
, name
))
3130 int j
= TYPE_FN_FIELDLIST_LENGTH (t
, i
);
3131 struct fn_field
*f
= TYPE_FN_FIELDLIST1 (t
, i
);
3133 if (intype
== 0 && j
> 1)
3134 error ("non-unique member `%s' requires type instantiation", name
);
3138 if (TYPE_FN_FIELD_TYPE (f
, j
) == intype
)
3141 error ("no member function matches that type instantiation");
3146 if (TYPE_FN_FIELD_STUB (f
, j
))
3147 check_stub_method (t
, i
, j
);
3148 if (TYPE_FN_FIELD_VIRTUAL_P (f
, j
))
3150 return value_from_longest
3151 (lookup_reference_type
3152 (lookup_member_type (TYPE_FN_FIELD_TYPE (f
, j
),
3154 (LONGEST
) METHOD_PTR_FROM_VOFFSET (TYPE_FN_FIELD_VOFFSET (f
, j
)));
3158 struct symbol
*s
= lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f
, j
),
3159 0, VAR_NAMESPACE
, 0, NULL
);
3166 v
= read_var_value (s
, 0);
3168 VALUE_TYPE (v
) = lookup_reference_type
3169 (lookup_member_type (TYPE_FN_FIELD_TYPE (f
, j
),
3177 for (i
= TYPE_N_BASECLASSES (t
) - 1; i
>= 0; i
--)
3182 if (BASETYPE_VIA_VIRTUAL (t
, i
))
3185 base_offset
= TYPE_BASECLASS_BITPOS (t
, i
) / 8;
3186 v
= value_struct_elt_for_reference (domain
,
3187 offset
+ base_offset
,
3188 TYPE_BASECLASS (t
, i
),
3198 /* Find the real run-time type of a value using RTTI.
3199 * V is a pointer to the value.
3200 * A pointer to the struct type entry of the run-time type
3202 * FULL is a flag that is set only if the value V includes
3203 * the entire contents of an object of the RTTI type.
3204 * TOP is the offset to the top of the enclosing object of
3205 * the real run-time type. This offset may be for the embedded
3206 * object, or for the enclosing object of V.
3207 * USING_ENC is the flag that distinguishes the two cases.
3208 * If it is 1, then the offset is for the enclosing object,
3209 * otherwise for the embedded object.
3211 * This currently works only for RTTI information generated
3212 * by the HP ANSI C++ compiler (aCC). g++ today (1997-06-10)
3213 * does not appear to support RTTI. This function returns a
3214 * NULL value for objects in the g++ runtime model. */
3217 value_rtti_type (v
, full
, top
, using_enc
)
3223 struct type
*known_type
;
3224 struct type
*rtti_type
;
3227 int using_enclosing
= 0;
3228 long top_offset
= 0;
3229 char rtti_type_name
[256];
3238 /* Get declared type */
3239 known_type
= VALUE_TYPE (v
);
3240 CHECK_TYPEDEF (known_type
);
3241 /* RTTI works only or class objects */
3242 if (TYPE_CODE (known_type
) != TYPE_CODE_CLASS
)
3245 /* If neither the declared type nor the enclosing type of the
3246 * value structure has a HP ANSI C++ style virtual table,
3247 * we can't do anything. */
3248 if (!TYPE_HAS_VTABLE (known_type
))
3250 known_type
= VALUE_ENCLOSING_TYPE (v
);
3251 CHECK_TYPEDEF (known_type
);
3252 if ((TYPE_CODE (known_type
) != TYPE_CODE_CLASS
) ||
3253 !TYPE_HAS_VTABLE (known_type
))
3254 return NULL
; /* No RTTI, or not HP-compiled types */
3255 CHECK_TYPEDEF (known_type
);
3256 using_enclosing
= 1;
3259 if (using_enclosing
&& using_enc
)
3262 /* First get the virtual table address */
3263 coreptr
= *(CORE_ADDR
*) ((VALUE_CONTENTS_ALL (v
))
3265 + (using_enclosing
? 0 : VALUE_EMBEDDED_OFFSET (v
)));
3267 return NULL
; /* return silently -- maybe called on gdb-generated value */
3269 /* Fetch the top offset of the object */
3270 /* FIXME possible 32x64 problem with pointer size & arithmetic */
3271 vp
= value_at (builtin_type_int
,
3272 coreptr
+ 4 * HP_ACC_TOP_OFFSET_OFFSET
,
3273 VALUE_BFD_SECTION (v
));
3274 top_offset
= value_as_long (vp
);
3278 /* Fetch the typeinfo pointer */
3279 /* FIXME possible 32x64 problem with pointer size & arithmetic */
3280 vp
= value_at (builtin_type_int
, coreptr
+ 4 * HP_ACC_TYPEINFO_OFFSET
, VALUE_BFD_SECTION (v
));
3281 /* Indirect through the typeinfo pointer and retrieve the pointer
3282 * to the string name */
3283 coreptr
= *(CORE_ADDR
*) (VALUE_CONTENTS (vp
));
3285 error ("Retrieved null typeinfo pointer in trying to determine run-time type");
3286 vp
= value_at (builtin_type_int
, coreptr
+ 4, VALUE_BFD_SECTION (v
)); /* 4 -> offset of name field */
3287 /* FIXME possible 32x64 problem */
3289 coreptr
= *(CORE_ADDR
*) (VALUE_CONTENTS (vp
));
3291 read_memory_string (coreptr
, rtti_type_name
, 256);
3293 if (strlen (rtti_type_name
) == 0)
3294 error ("Retrieved null type name from typeinfo");
3296 /* search for type */
3297 rtti_type
= lookup_typename (rtti_type_name
, (struct block
*) 0, 1);
3300 error ("Could not find run-time type: invalid type name %s in typeinfo??", rtti_type_name
);
3301 CHECK_TYPEDEF (rtti_type
);
3303 #if 0 /* debugging */
3304 printf ("RTTI type name %s, tag %s, full? %d\n", TYPE_NAME (rtti_type
), TYPE_TAG_NAME (rtti_type
), full
? *full
: -1);
3307 /* Check whether we have the entire object */
3308 if (full
/* Non-null pointer passed */
3311 /* Either we checked on the whole object in hand and found the
3312 top offset to be zero */
3313 (((top_offset
== 0) &&
3315 TYPE_LENGTH (known_type
) == TYPE_LENGTH (rtti_type
))
3317 /* Or we checked on the embedded object and top offset was the
3318 same as the embedded offset */
3319 ((top_offset
== VALUE_EMBEDDED_OFFSET (v
)) &&
3321 TYPE_LENGTH (VALUE_ENCLOSING_TYPE (v
)) == TYPE_LENGTH (rtti_type
))))
3328 /* Given a pointer value V, find the real (RTTI) type
3329 of the object it points to.
3330 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
3331 and refer to the values computed for the object pointed to. */
3334 value_rtti_target_type (v
, full
, top
, using_enc
)
3342 target
= value_ind (v
);
3344 return value_rtti_type (target
, full
, top
, using_enc
);
3347 /* Given a value pointed to by ARGP, check its real run-time type, and
3348 if that is different from the enclosing type, create a new value
3349 using the real run-time type as the enclosing type (and of the same
3350 type as ARGP) and return it, with the embedded offset adjusted to
3351 be the correct offset to the enclosed object
3352 RTYPE is the type, and XFULL, XTOP, and XUSING_ENC are the other
3353 parameters, computed by value_rtti_type(). If these are available,
3354 they can be supplied and a second call to value_rtti_type() is avoided.
3355 (Pass RTYPE == NULL if they're not available */
3358 value_full_object (argp
, rtype
, xfull
, xtop
, xusing_enc
)
3366 struct type
*real_type
;
3377 using_enc
= xusing_enc
;
3380 real_type
= value_rtti_type (argp
, &full
, &top
, &using_enc
);
3382 /* If no RTTI data, or if object is already complete, do nothing */
3383 if (!real_type
|| real_type
== VALUE_ENCLOSING_TYPE (argp
))
3386 /* If we have the full object, but for some reason the enclosing
3387 type is wrong, set it *//* pai: FIXME -- sounds iffy */
3390 VALUE_ENCLOSING_TYPE (argp
) = real_type
;
3394 /* Check if object is in memory */
3395 if (VALUE_LVAL (argp
) != lval_memory
)
3397 warning ("Couldn't retrieve complete object of RTTI type %s; object may be in register(s).", TYPE_NAME (real_type
));
3402 /* All other cases -- retrieve the complete object */
3403 /* Go back by the computed top_offset from the beginning of the object,
3404 adjusting for the embedded offset of argp if that's what value_rtti_type
3405 used for its computation. */
3406 new_val
= value_at_lazy (real_type
, VALUE_ADDRESS (argp
) - top
+
3407 (using_enc
? 0 : VALUE_EMBEDDED_OFFSET (argp
)),
3408 VALUE_BFD_SECTION (argp
));
3409 VALUE_TYPE (new_val
) = VALUE_TYPE (argp
);
3410 VALUE_EMBEDDED_OFFSET (new_val
) = using_enc
? top
+ VALUE_EMBEDDED_OFFSET (argp
) : top
;
3417 /* C++: return the value of the class instance variable, if one exists.
3418 Flag COMPLAIN signals an error if the request is made in an
3419 inappropriate context. */
3422 value_of_this (complain
)
3425 struct symbol
*func
, *sym
;
3428 static const char funny_this
[] = "this";
3431 if (selected_frame
== 0)
3434 error ("no frame selected");
3439 func
= get_frame_function (selected_frame
);
3443 error ("no `this' in nameless context");
3448 b
= SYMBOL_BLOCK_VALUE (func
);
3449 i
= BLOCK_NSYMS (b
);
3453 error ("no args, no `this'");
3458 /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER
3459 symbol instead of the LOC_ARG one (if both exist). */
3460 sym
= lookup_block_symbol (b
, funny_this
, VAR_NAMESPACE
);
3464 error ("current stack frame not in method");
3469 this = read_var_value (sym
, selected_frame
);
3470 if (this == 0 && complain
)
3471 error ("`this' argument at unknown address");
3475 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH elements
3476 long, starting at LOWBOUND. The result has the same lower bound as
3477 the original ARRAY. */
3480 value_slice (array
, lowbound
, length
)
3482 int lowbound
, length
;
3484 struct type
*slice_range_type
, *slice_type
, *range_type
;
3485 LONGEST lowerbound
, upperbound
, offset
;
3487 struct type
*array_type
;
3488 array_type
= check_typedef (VALUE_TYPE (array
));
3489 COERCE_VARYING_ARRAY (array
, array_type
);
3490 if (TYPE_CODE (array_type
) != TYPE_CODE_ARRAY
3491 && TYPE_CODE (array_type
) != TYPE_CODE_STRING
3492 && TYPE_CODE (array_type
) != TYPE_CODE_BITSTRING
)
3493 error ("cannot take slice of non-array");
3494 range_type
= TYPE_INDEX_TYPE (array_type
);
3495 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
3496 error ("slice from bad array or bitstring");
3497 if (lowbound
< lowerbound
|| length
< 0
3498 || lowbound
+ length
- 1 > upperbound
3499 /* Chill allows zero-length strings but not arrays. */
3500 || (current_language
->la_language
== language_chill
3501 && length
== 0 && TYPE_CODE (array_type
) == TYPE_CODE_ARRAY
))
3502 error ("slice out of range");
3503 /* FIXME-type-allocation: need a way to free this type when we are
3505 slice_range_type
= create_range_type ((struct type
*) NULL
,
3506 TYPE_TARGET_TYPE (range_type
),
3507 lowbound
, lowbound
+ length
- 1);
3508 if (TYPE_CODE (array_type
) == TYPE_CODE_BITSTRING
)
3511 slice_type
= create_set_type ((struct type
*) NULL
, slice_range_type
);
3512 TYPE_CODE (slice_type
) = TYPE_CODE_BITSTRING
;
3513 slice
= value_zero (slice_type
, not_lval
);
3514 for (i
= 0; i
< length
; i
++)
3516 int element
= value_bit_index (array_type
,
3517 VALUE_CONTENTS (array
),
3520 error ("internal error accessing bitstring");
3521 else if (element
> 0)
3523 int j
= i
% TARGET_CHAR_BIT
;
3524 if (BITS_BIG_ENDIAN
)
3525 j
= TARGET_CHAR_BIT
- 1 - j
;
3526 VALUE_CONTENTS_RAW (slice
)[i
/ TARGET_CHAR_BIT
] |= (1 << j
);
3529 /* We should set the address, bitssize, and bitspos, so the clice
3530 can be used on the LHS, but that may require extensions to
3531 value_assign. For now, just leave as a non_lval. FIXME. */
3535 struct type
*element_type
= TYPE_TARGET_TYPE (array_type
);
3537 = (lowbound
- lowerbound
) * TYPE_LENGTH (check_typedef (element_type
));
3538 slice_type
= create_array_type ((struct type
*) NULL
, element_type
,
3540 TYPE_CODE (slice_type
) = TYPE_CODE (array_type
);
3541 slice
= allocate_value (slice_type
);
3542 if (VALUE_LAZY (array
))
3543 VALUE_LAZY (slice
) = 1;
3545 memcpy (VALUE_CONTENTS (slice
), VALUE_CONTENTS (array
) + offset
,
3546 TYPE_LENGTH (slice_type
));
3547 if (VALUE_LVAL (array
) == lval_internalvar
)
3548 VALUE_LVAL (slice
) = lval_internalvar_component
;
3550 VALUE_LVAL (slice
) = VALUE_LVAL (array
);
3551 VALUE_ADDRESS (slice
) = VALUE_ADDRESS (array
);
3552 VALUE_OFFSET (slice
) = VALUE_OFFSET (array
) + offset
;
3557 /* Assuming chill_varying_type (VARRAY) is true, return an equivalent
3558 value as a fixed-length array. */
3561 varying_to_slice (varray
)
3564 struct type
*vtype
= check_typedef (VALUE_TYPE (varray
));
3565 LONGEST length
= unpack_long (TYPE_FIELD_TYPE (vtype
, 0),
3566 VALUE_CONTENTS (varray
)
3567 + TYPE_FIELD_BITPOS (vtype
, 0) / 8);
3568 return value_slice (value_primitive_field (varray
, 0, 1, vtype
), 0, length
);
3571 /* Create a value for a FORTRAN complex number. Currently most of
3572 the time values are coerced to COMPLEX*16 (i.e. a complex number
3573 composed of 2 doubles. This really should be a smarter routine
3574 that figures out precision inteligently as opposed to assuming
3575 doubles. FIXME: fmb */
3578 value_literal_complex (arg1
, arg2
, type
)
3583 register value_ptr val
;
3584 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3586 val
= allocate_value (type
);
3587 arg1
= value_cast (real_type
, arg1
);
3588 arg2
= value_cast (real_type
, arg2
);
3590 memcpy (VALUE_CONTENTS_RAW (val
),
3591 VALUE_CONTENTS (arg1
), TYPE_LENGTH (real_type
));
3592 memcpy (VALUE_CONTENTS_RAW (val
) + TYPE_LENGTH (real_type
),
3593 VALUE_CONTENTS (arg2
), TYPE_LENGTH (real_type
));
3597 /* Cast a value into the appropriate complex data type. */
3600 cast_into_complex (type
, val
)
3602 register value_ptr val
;
3604 struct type
*real_type
= TYPE_TARGET_TYPE (type
);
3605 if (TYPE_CODE (VALUE_TYPE (val
)) == TYPE_CODE_COMPLEX
)
3607 struct type
*val_real_type
= TYPE_TARGET_TYPE (VALUE_TYPE (val
));
3608 value_ptr re_val
= allocate_value (val_real_type
);
3609 value_ptr im_val
= allocate_value (val_real_type
);
3611 memcpy (VALUE_CONTENTS_RAW (re_val
),
3612 VALUE_CONTENTS (val
), TYPE_LENGTH (val_real_type
));
3613 memcpy (VALUE_CONTENTS_RAW (im_val
),
3614 VALUE_CONTENTS (val
) + TYPE_LENGTH (val_real_type
),
3615 TYPE_LENGTH (val_real_type
));
3617 return value_literal_complex (re_val
, im_val
, type
);
3619 else if (TYPE_CODE (VALUE_TYPE (val
)) == TYPE_CODE_FLT
3620 || TYPE_CODE (VALUE_TYPE (val
)) == TYPE_CODE_INT
)
3621 return value_literal_complex (val
, value_zero (real_type
, not_lval
), type
);
3623 error ("cannot cast non-number to complex");
3627 _initialize_valops ()
3631 (add_set_cmd ("abandon", class_support
, var_boolean
, (char *) &auto_abandon
,
3632 "Set automatic abandonment of expressions upon failure.",
3638 (add_set_cmd ("overload-resolution", class_support
, var_boolean
, (char *) &overload_resolution
,
3639 "Set overload resolution in evaluating C++ functions.",
3642 overload_resolution
= 1;
3645 add_set_cmd ("unwindonsignal", no_class
, var_boolean
,
3646 (char *) &unwind_on_signal_p
,
3647 "Set unwinding of stack if a signal is received while in a call dummy.\n\
3648 The unwindonsignal lets the user determine what gdb should do if a signal\n\
3649 is received while in a function called from gdb (call dummy). If set, gdb\n\
3650 unwinds the stack and restore the context to what as it was before the call.\n\
3651 The default is to stop in the frame where the signal was received.", &setlist
),