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;
81 /* Find the address of function name NAME in the inferior. */
84 find_function_in_inferior (name)
87 register struct symbol *sym;
88 sym = lookup_symbol (name, 0, VAR_NAMESPACE, 0, NULL);
91 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
93 error ("\"%s\" exists in this program but is not a function.",
96 return value_of_variable (sym, NULL);
100 struct minimal_symbol *msymbol = lookup_minimal_symbol (name, NULL, NULL);
105 type = lookup_pointer_type (builtin_type_char);
106 type = lookup_function_type (type);
107 type = lookup_pointer_type (type);
108 maddr = (LONGEST) SYMBOL_VALUE_ADDRESS (msymbol);
109 return value_from_longest (type, maddr);
113 if (!target_has_execution)
114 error ("evaluation of this expression requires the target program to be active");
116 error ("evaluation of this expression requires the program to have a function \"%s\".", name);
121 /* Allocate NBYTES of space in the inferior using the inferior's malloc
122 and return a value that is a pointer to the allocated space. */
125 value_allocate_space_in_inferior (len)
129 register value_ptr val = find_function_in_inferior ("malloc");
131 blocklen = value_from_longest (builtin_type_int, (LONGEST) len);
132 val = call_function_by_hand (val, 1, &blocklen);
133 if (value_logical_not (val))
135 if (!target_has_execution)
136 error ("No memory available to program now: you need to start the target first");
138 error ("No memory available to program: call to malloc failed");
144 allocate_space_in_inferior (len)
147 return value_as_long (value_allocate_space_in_inferior (len));
150 /* Cast value ARG2 to type TYPE and return as a value.
151 More general than a C cast: accepts any two types of the same length,
152 and if ARG2 is an lvalue it can be cast into anything at all. */
153 /* In C++, casts may change pointer or object representations. */
156 value_cast (type, arg2)
158 register value_ptr arg2;
160 register enum type_code code1;
161 register enum type_code code2;
165 int convert_to_boolean = 0;
167 if (VALUE_TYPE (arg2) == type)
170 CHECK_TYPEDEF (type);
171 code1 = TYPE_CODE (type);
173 type2 = check_typedef (VALUE_TYPE (arg2));
175 /* A cast to an undetermined-length array_type, such as (TYPE [])OBJECT,
176 is treated like a cast to (TYPE [N])OBJECT,
177 where N is sizeof(OBJECT)/sizeof(TYPE). */
178 if (code1 == TYPE_CODE_ARRAY)
180 struct type *element_type = TYPE_TARGET_TYPE (type);
181 unsigned element_length = TYPE_LENGTH (check_typedef (element_type));
182 if (element_length > 0
183 && TYPE_ARRAY_UPPER_BOUND_TYPE (type) == BOUND_CANNOT_BE_DETERMINED)
185 struct type *range_type = TYPE_INDEX_TYPE (type);
186 int val_length = TYPE_LENGTH (type2);
187 LONGEST low_bound, high_bound, new_length;
188 if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0)
189 low_bound = 0, high_bound = 0;
190 new_length = val_length / element_length;
191 if (val_length % element_length != 0)
192 warning ("array element type size does not divide object size in cast");
193 /* FIXME-type-allocation: need a way to free this type when we are
195 range_type = create_range_type ((struct type *) NULL,
196 TYPE_TARGET_TYPE (range_type),
198 new_length + low_bound - 1);
199 VALUE_TYPE (arg2) = create_array_type ((struct type *) NULL,
200 element_type, range_type);
205 if (current_language->c_style_arrays
206 && TYPE_CODE (type2) == TYPE_CODE_ARRAY)
207 arg2 = value_coerce_array (arg2);
209 if (TYPE_CODE (type2) == TYPE_CODE_FUNC)
210 arg2 = value_coerce_function (arg2);
212 type2 = check_typedef (VALUE_TYPE (arg2));
213 COERCE_VARYING_ARRAY (arg2, type2);
214 code2 = TYPE_CODE (type2);
216 if (code1 == TYPE_CODE_COMPLEX)
217 return cast_into_complex (type, arg2);
218 if (code1 == TYPE_CODE_BOOL)
220 code1 = TYPE_CODE_INT;
221 convert_to_boolean = 1;
223 if (code1 == TYPE_CODE_CHAR)
224 code1 = TYPE_CODE_INT;
225 if (code2 == TYPE_CODE_BOOL || code2 == TYPE_CODE_CHAR)
226 code2 = TYPE_CODE_INT;
228 scalar = (code2 == TYPE_CODE_INT || code2 == TYPE_CODE_FLT
229 || code2 == TYPE_CODE_ENUM || code2 == TYPE_CODE_RANGE);
231 if (code1 == TYPE_CODE_STRUCT
232 && code2 == TYPE_CODE_STRUCT
233 && TYPE_NAME (type) != 0)
235 /* Look in the type of the source to see if it contains the
236 type of the target as a superclass. If so, we'll need to
237 offset the object in addition to changing its type. */
238 value_ptr v = search_struct_field (type_name_no_tag (type),
242 VALUE_TYPE (v) = type;
246 if (code1 == TYPE_CODE_FLT && scalar)
247 return value_from_double (type, value_as_double (arg2));
248 else if ((code1 == TYPE_CODE_INT || code1 == TYPE_CODE_ENUM
249 || code1 == TYPE_CODE_RANGE)
250 && (scalar || code2 == TYPE_CODE_PTR))
254 if (hp_som_som_object_present && /* if target compiled by HP aCC */
255 (code2 == TYPE_CODE_PTR))
260 switch (TYPE_CODE (TYPE_TARGET_TYPE (type2)))
262 /* With HP aCC, pointers to data members have a bias */
263 case TYPE_CODE_MEMBER:
264 retvalp = value_from_longest (type, value_as_long (arg2));
265 ptr = (unsigned int *) VALUE_CONTENTS (retvalp); /* force evaluation */
266 *ptr &= ~0x20000000; /* zap 29th bit to remove bias */
269 /* While pointers to methods don't really point to a function */
270 case TYPE_CODE_METHOD:
271 error ("Pointers to methods not supported with HP aCC");
274 break; /* fall out and go to normal handling */
277 longest = value_as_long (arg2);
278 return value_from_longest (type, convert_to_boolean ? (LONGEST) (longest ? 1 : 0) : longest);
280 else if (TYPE_LENGTH (type) == TYPE_LENGTH (type2))
282 if (code1 == TYPE_CODE_PTR && code2 == TYPE_CODE_PTR)
284 struct type *t1 = check_typedef (TYPE_TARGET_TYPE (type));
285 struct type *t2 = check_typedef (TYPE_TARGET_TYPE (type2));
286 if (TYPE_CODE (t1) == TYPE_CODE_STRUCT
287 && TYPE_CODE (t2) == TYPE_CODE_STRUCT
288 && !value_logical_not (arg2))
292 /* Look in the type of the source to see if it contains the
293 type of the target as a superclass. If so, we'll need to
294 offset the pointer rather than just change its type. */
295 if (TYPE_NAME (t1) != NULL)
297 v = search_struct_field (type_name_no_tag (t1),
298 value_ind (arg2), 0, t2, 1);
302 VALUE_TYPE (v) = type;
307 /* Look in the type of the target to see if it contains the
308 type of the source as a superclass. If so, we'll need to
309 offset the pointer rather than just change its type.
310 FIXME: This fails silently with virtual inheritance. */
311 if (TYPE_NAME (t2) != NULL)
313 v = search_struct_field (type_name_no_tag (t2),
314 value_zero (t1, not_lval), 0, t1, 1);
317 value_ptr v2 = value_ind (arg2);
318 VALUE_ADDRESS (v2) -= VALUE_ADDRESS (v)
320 v2 = value_addr (v2);
321 VALUE_TYPE (v2) = type;
326 /* No superclass found, just fall through to change ptr type. */
328 VALUE_TYPE (arg2) = type;
329 VALUE_ENCLOSING_TYPE (arg2) = type; /* pai: chk_val */
330 VALUE_POINTED_TO_OFFSET (arg2) = 0; /* pai: chk_val */
333 else if (chill_varying_type (type))
335 struct type *range1, *range2, *eltype1, *eltype2;
338 LONGEST low_bound, high_bound;
339 char *valaddr, *valaddr_data;
340 /* For lint warning about eltype2 possibly uninitialized: */
342 if (code2 == TYPE_CODE_BITSTRING)
343 error ("not implemented: converting bitstring to varying type");
344 if ((code2 != TYPE_CODE_ARRAY && code2 != TYPE_CODE_STRING)
345 || (eltype1 = check_typedef (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, 1))),
346 eltype2 = check_typedef (TYPE_TARGET_TYPE (type2)),
347 (TYPE_LENGTH (eltype1) != TYPE_LENGTH (eltype2)
348 /* || TYPE_CODE (eltype1) != TYPE_CODE (eltype2) */ )))
349 error ("Invalid conversion to varying type");
350 range1 = TYPE_FIELD_TYPE (TYPE_FIELD_TYPE (type, 1), 0);
351 range2 = TYPE_FIELD_TYPE (type2, 0);
352 if (get_discrete_bounds (range1, &low_bound, &high_bound) < 0)
355 count1 = high_bound - low_bound + 1;
356 if (get_discrete_bounds (range2, &low_bound, &high_bound) < 0)
357 count1 = -1, count2 = 0; /* To force error before */
359 count2 = high_bound - low_bound + 1;
361 error ("target varying type is too small");
362 val = allocate_value (type);
363 valaddr = VALUE_CONTENTS_RAW (val);
364 valaddr_data = valaddr + TYPE_FIELD_BITPOS (type, 1) / 8;
365 /* Set val's __var_length field to count2. */
366 store_signed_integer (valaddr, TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0)),
368 /* Set the __var_data field to count2 elements copied from arg2. */
369 memcpy (valaddr_data, VALUE_CONTENTS (arg2),
370 count2 * TYPE_LENGTH (eltype2));
371 /* Zero the rest of the __var_data field of val. */
372 memset (valaddr_data + count2 * TYPE_LENGTH (eltype2), '\0',
373 (count1 - count2) * TYPE_LENGTH (eltype2));
376 else if (VALUE_LVAL (arg2) == lval_memory)
378 return value_at_lazy (type, VALUE_ADDRESS (arg2) + VALUE_OFFSET (arg2),
379 VALUE_BFD_SECTION (arg2));
381 else if (code1 == TYPE_CODE_VOID)
383 return value_zero (builtin_type_void, not_lval);
387 error ("Invalid cast.");
392 /* Create a value of type TYPE that is zero, and return it. */
395 value_zero (type, lv)
399 register value_ptr val = allocate_value (type);
401 memset (VALUE_CONTENTS (val), 0, TYPE_LENGTH (check_typedef (type)));
402 VALUE_LVAL (val) = lv;
407 /* Return a value with type TYPE located at ADDR.
409 Call value_at only if the data needs to be fetched immediately;
410 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
411 value_at_lazy instead. value_at_lazy simply records the address of
412 the data and sets the lazy-evaluation-required flag. The lazy flag
413 is tested in the VALUE_CONTENTS macro, which is used if and when
414 the contents are actually required.
416 Note: value_at does *NOT* handle embedded offsets; perform such
417 adjustments before or after calling it. */
420 value_at (type, addr, sect)
425 register value_ptr val;
427 if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
428 error ("Attempt to dereference a generic pointer.");
430 val = allocate_value (type);
432 if (GDB_TARGET_IS_D10V
433 && TYPE_CODE (type) == TYPE_CODE_PTR
434 && TYPE_TARGET_TYPE (type)
435 && (TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_FUNC))
437 /* pointer to function */
440 snum = read_memory_unsigned_integer (addr, 2);
441 num = D10V_MAKE_IADDR (snum);
442 store_address (VALUE_CONTENTS_RAW (val), 4, num);
444 else if (GDB_TARGET_IS_D10V
445 && TYPE_CODE (type) == TYPE_CODE_PTR)
447 /* pointer to data */
450 snum = read_memory_unsigned_integer (addr, 2);
451 num = D10V_MAKE_DADDR (snum);
452 store_address (VALUE_CONTENTS_RAW (val), 4, num);
455 read_memory_section (addr, VALUE_CONTENTS_ALL_RAW (val), TYPE_LENGTH (type), sect);
457 VALUE_LVAL (val) = lval_memory;
458 VALUE_ADDRESS (val) = addr;
459 VALUE_BFD_SECTION (val) = sect;
464 /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
467 value_at_lazy (type, addr, sect)
472 register value_ptr val;
474 if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
475 error ("Attempt to dereference a generic pointer.");
477 val = allocate_value (type);
479 VALUE_LVAL (val) = lval_memory;
480 VALUE_ADDRESS (val) = addr;
481 VALUE_LAZY (val) = 1;
482 VALUE_BFD_SECTION (val) = sect;
487 /* Called only from the VALUE_CONTENTS and VALUE_CONTENTS_ALL macros,
488 if the current data for a variable needs to be loaded into
489 VALUE_CONTENTS(VAL). Fetches the data from the user's process, and
490 clears the lazy flag to indicate that the data in the buffer is valid.
492 If the value is zero-length, we avoid calling read_memory, which would
493 abort. We mark the value as fetched anyway -- all 0 bytes of it.
495 This function returns a value because it is used in the VALUE_CONTENTS
496 macro as part of an expression, where a void would not work. The
500 value_fetch_lazy (val)
501 register value_ptr val;
503 CORE_ADDR addr = VALUE_ADDRESS (val) + VALUE_OFFSET (val);
504 int length = TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val));
506 struct type *type = VALUE_TYPE (val);
507 if (GDB_TARGET_IS_D10V
508 && TYPE_CODE (type) == TYPE_CODE_PTR
509 && TYPE_TARGET_TYPE (type)
510 && (TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_FUNC))
512 /* pointer to function */
515 snum = read_memory_unsigned_integer (addr, 2);
516 num = D10V_MAKE_IADDR (snum);
517 store_address (VALUE_CONTENTS_RAW (val), 4, num);
519 else if (GDB_TARGET_IS_D10V
520 && TYPE_CODE (type) == TYPE_CODE_PTR)
522 /* pointer to data */
525 snum = read_memory_unsigned_integer (addr, 2);
526 num = D10V_MAKE_DADDR (snum);
527 store_address (VALUE_CONTENTS_RAW (val), 4, num);
530 read_memory_section (addr, VALUE_CONTENTS_ALL_RAW (val), length,
531 VALUE_BFD_SECTION (val));
532 VALUE_LAZY (val) = 0;
537 /* Store the contents of FROMVAL into the location of TOVAL.
538 Return a new value with the location of TOVAL and contents of FROMVAL. */
541 value_assign (toval, fromval)
542 register value_ptr toval, fromval;
544 register struct type *type;
545 register value_ptr val;
546 char raw_buffer[MAX_REGISTER_RAW_SIZE];
549 if (!toval->modifiable)
550 error ("Left operand of assignment is not a modifiable lvalue.");
554 type = VALUE_TYPE (toval);
555 if (VALUE_LVAL (toval) != lval_internalvar)
556 fromval = value_cast (type, fromval);
558 COERCE_ARRAY (fromval);
559 CHECK_TYPEDEF (type);
561 /* If TOVAL is a special machine register requiring conversion
562 of program values to a special raw format,
563 convert FROMVAL's contents now, with result in `raw_buffer',
564 and set USE_BUFFER to the number of bytes to write. */
566 if (VALUE_REGNO (toval) >= 0)
568 int regno = VALUE_REGNO (toval);
569 if (REGISTER_CONVERTIBLE (regno))
571 struct type *fromtype = check_typedef (VALUE_TYPE (fromval));
572 REGISTER_CONVERT_TO_RAW (fromtype, regno,
573 VALUE_CONTENTS (fromval), raw_buffer);
574 use_buffer = REGISTER_RAW_SIZE (regno);
578 switch (VALUE_LVAL (toval))
580 case lval_internalvar:
581 set_internalvar (VALUE_INTERNALVAR (toval), fromval);
582 val = value_copy (VALUE_INTERNALVAR (toval)->value);
583 VALUE_ENCLOSING_TYPE (val) = VALUE_ENCLOSING_TYPE (fromval);
584 VALUE_EMBEDDED_OFFSET (val) = VALUE_EMBEDDED_OFFSET (fromval);
585 VALUE_POINTED_TO_OFFSET (val) = VALUE_POINTED_TO_OFFSET (fromval);
588 case lval_internalvar_component:
589 set_internalvar_component (VALUE_INTERNALVAR (toval),
590 VALUE_OFFSET (toval),
591 VALUE_BITPOS (toval),
592 VALUE_BITSIZE (toval),
599 CORE_ADDR changed_addr;
602 if (VALUE_BITSIZE (toval))
604 char buffer[sizeof (LONGEST)];
605 /* We assume that the argument to read_memory is in units of
606 host chars. FIXME: Is that correct? */
607 changed_len = (VALUE_BITPOS (toval)
608 + VALUE_BITSIZE (toval)
612 if (changed_len > (int) sizeof (LONGEST))
613 error ("Can't handle bitfields which don't fit in a %d bit word.",
614 sizeof (LONGEST) * HOST_CHAR_BIT);
616 read_memory (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
617 buffer, changed_len);
618 modify_field (buffer, value_as_long (fromval),
619 VALUE_BITPOS (toval), VALUE_BITSIZE (toval));
620 changed_addr = VALUE_ADDRESS (toval) + VALUE_OFFSET (toval);
621 dest_buffer = buffer;
625 changed_addr = VALUE_ADDRESS (toval) + VALUE_OFFSET (toval);
626 changed_len = use_buffer;
627 dest_buffer = raw_buffer;
631 changed_addr = VALUE_ADDRESS (toval) + VALUE_OFFSET (toval);
632 changed_len = TYPE_LENGTH (type);
633 dest_buffer = VALUE_CONTENTS (fromval);
636 write_memory (changed_addr, dest_buffer, changed_len);
637 if (memory_changed_hook)
638 memory_changed_hook (changed_addr, changed_len);
643 if (VALUE_BITSIZE (toval))
645 char buffer[sizeof (LONGEST)];
646 int len = REGISTER_RAW_SIZE (VALUE_REGNO (toval));
648 if (len > (int) sizeof (LONGEST))
649 error ("Can't handle bitfields in registers larger than %d bits.",
650 sizeof (LONGEST) * HOST_CHAR_BIT);
652 if (VALUE_BITPOS (toval) + VALUE_BITSIZE (toval)
653 > len * HOST_CHAR_BIT)
654 /* Getting this right would involve being very careful about
656 error ("Can't assign to bitfields that cross register "
659 read_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
661 modify_field (buffer, value_as_long (fromval),
662 VALUE_BITPOS (toval), VALUE_BITSIZE (toval));
663 write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
667 write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
668 raw_buffer, use_buffer);
671 /* Do any conversion necessary when storing this type to more
672 than one register. */
673 #ifdef REGISTER_CONVERT_FROM_TYPE
674 memcpy (raw_buffer, VALUE_CONTENTS (fromval), TYPE_LENGTH (type));
675 REGISTER_CONVERT_FROM_TYPE (VALUE_REGNO (toval), type, raw_buffer);
676 write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
677 raw_buffer, TYPE_LENGTH (type));
679 write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
680 VALUE_CONTENTS (fromval), TYPE_LENGTH (type));
683 /* Assigning to the stack pointer, frame pointer, and other
684 (architecture and calling convention specific) registers may
685 cause the frame cache to be out of date. We just do this
686 on all assignments to registers for simplicity; I doubt the slowdown
688 reinit_frame_cache ();
691 case lval_reg_frame_relative:
693 /* value is stored in a series of registers in the frame
694 specified by the structure. Copy that value out, modify
695 it, and copy it back in. */
696 int amount_to_copy = (VALUE_BITSIZE (toval) ? 1 : TYPE_LENGTH (type));
697 int reg_size = REGISTER_RAW_SIZE (VALUE_FRAME_REGNUM (toval));
698 int byte_offset = VALUE_OFFSET (toval) % reg_size;
699 int reg_offset = VALUE_OFFSET (toval) / reg_size;
702 /* Make the buffer large enough in all cases. */
703 char *buffer = (char *) alloca (amount_to_copy
705 + MAX_REGISTER_RAW_SIZE);
708 struct frame_info *frame;
710 /* Figure out which frame this is in currently. */
711 for (frame = get_current_frame ();
712 frame && FRAME_FP (frame) != VALUE_FRAME (toval);
713 frame = get_prev_frame (frame))
717 error ("Value being assigned to is no longer active.");
719 amount_to_copy += (reg_size - amount_to_copy % reg_size);
722 for ((regno = VALUE_FRAME_REGNUM (toval) + reg_offset,
724 amount_copied < amount_to_copy;
725 amount_copied += reg_size, regno++)
727 get_saved_register (buffer + amount_copied,
728 (int *) NULL, (CORE_ADDR *) NULL,
729 frame, regno, (enum lval_type *) NULL);
732 /* Modify what needs to be modified. */
733 if (VALUE_BITSIZE (toval))
734 modify_field (buffer + byte_offset,
735 value_as_long (fromval),
736 VALUE_BITPOS (toval), VALUE_BITSIZE (toval));
738 memcpy (buffer + byte_offset, raw_buffer, use_buffer);
740 memcpy (buffer + byte_offset, VALUE_CONTENTS (fromval),
744 for ((regno = VALUE_FRAME_REGNUM (toval) + reg_offset,
746 amount_copied < amount_to_copy;
747 amount_copied += reg_size, regno++)
753 /* Just find out where to put it. */
754 get_saved_register ((char *) NULL,
755 &optim, &addr, frame, regno, &lval);
758 error ("Attempt to assign to a value that was optimized out.");
759 if (lval == lval_memory)
760 write_memory (addr, buffer + amount_copied, reg_size);
761 else if (lval == lval_register)
762 write_register_bytes (addr, buffer + amount_copied, reg_size);
764 error ("Attempt to assign to an unmodifiable value.");
767 if (register_changed_hook)
768 register_changed_hook (-1);
774 error ("Left operand of assignment is not an lvalue.");
777 /* If the field does not entirely fill a LONGEST, then zero the sign bits.
778 If the field is signed, and is negative, then sign extend. */
779 if ((VALUE_BITSIZE (toval) > 0)
780 && (VALUE_BITSIZE (toval) < 8 * (int) sizeof (LONGEST)))
782 LONGEST fieldval = value_as_long (fromval);
783 LONGEST valmask = (((ULONGEST) 1) << VALUE_BITSIZE (toval)) - 1;
786 if (!TYPE_UNSIGNED (type) && (fieldval & (valmask ^ (valmask >> 1))))
787 fieldval |= ~valmask;
789 fromval = value_from_longest (type, fieldval);
792 val = value_copy (toval);
793 memcpy (VALUE_CONTENTS_RAW (val), VALUE_CONTENTS (fromval),
795 VALUE_TYPE (val) = type;
796 VALUE_ENCLOSING_TYPE (val) = VALUE_ENCLOSING_TYPE (fromval);
797 VALUE_EMBEDDED_OFFSET (val) = VALUE_EMBEDDED_OFFSET (fromval);
798 VALUE_POINTED_TO_OFFSET (val) = VALUE_POINTED_TO_OFFSET (fromval);
803 /* Extend a value VAL to COUNT repetitions of its type. */
806 value_repeat (arg1, count)
810 register value_ptr val;
812 if (VALUE_LVAL (arg1) != lval_memory)
813 error ("Only values in memory can be extended with '@'.");
815 error ("Invalid number %d of repetitions.", count);
817 val = allocate_repeat_value (VALUE_ENCLOSING_TYPE (arg1), count);
819 read_memory (VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1),
820 VALUE_CONTENTS_ALL_RAW (val),
821 TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val)));
822 VALUE_LVAL (val) = lval_memory;
823 VALUE_ADDRESS (val) = VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1);
829 value_of_variable (var, b)
834 struct frame_info *frame = NULL;
837 frame = NULL; /* Use selected frame. */
838 else if (symbol_read_needs_frame (var))
840 frame = block_innermost_frame (b);
843 if (BLOCK_FUNCTION (b)
844 && SYMBOL_SOURCE_NAME (BLOCK_FUNCTION (b)))
845 error ("No frame is currently executing in block %s.",
846 SYMBOL_SOURCE_NAME (BLOCK_FUNCTION (b)));
848 error ("No frame is currently executing in specified block");
852 val = read_var_value (var, frame);
854 error ("Address of symbol \"%s\" is unknown.", SYMBOL_SOURCE_NAME (var));
859 /* Given a value which is an array, return a value which is a pointer to its
860 first element, regardless of whether or not the array has a nonzero lower
863 FIXME: A previous comment here indicated that this routine should be
864 substracting the array's lower bound. It's not clear to me that this
865 is correct. Given an array subscripting operation, it would certainly
866 work to do the adjustment here, essentially computing:
868 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
870 However I believe a more appropriate and logical place to account for
871 the lower bound is to do so in value_subscript, essentially computing:
873 (&array[0] + ((index - lowerbound) * sizeof array[0]))
875 As further evidence consider what would happen with operations other
876 than array subscripting, where the caller would get back a value that
877 had an address somewhere before the actual first element of the array,
878 and the information about the lower bound would be lost because of
879 the coercion to pointer type.
883 value_coerce_array (arg1)
886 register struct type *type = check_typedef (VALUE_TYPE (arg1));
888 if (VALUE_LVAL (arg1) != lval_memory)
889 error ("Attempt to take address of value not located in memory.");
891 return value_from_longest (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
892 (LONGEST) (VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1)));
895 /* Given a value which is a function, return a value which is a pointer
899 value_coerce_function (arg1)
904 if (VALUE_LVAL (arg1) != lval_memory)
905 error ("Attempt to take address of value not located in memory.");
907 retval = value_from_longest (lookup_pointer_type (VALUE_TYPE (arg1)),
908 (LONGEST) (VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1)));
909 VALUE_BFD_SECTION (retval) = VALUE_BFD_SECTION (arg1);
913 /* Return a pointer value for the object for which ARG1 is the contents. */
921 struct type *type = check_typedef (VALUE_TYPE (arg1));
922 if (TYPE_CODE (type) == TYPE_CODE_REF)
924 /* Copy the value, but change the type from (T&) to (T*).
925 We keep the same location information, which is efficient,
926 and allows &(&X) to get the location containing the reference. */
927 arg2 = value_copy (arg1);
928 VALUE_TYPE (arg2) = lookup_pointer_type (TYPE_TARGET_TYPE (type));
931 if (TYPE_CODE (type) == TYPE_CODE_FUNC)
932 return value_coerce_function (arg1);
934 if (VALUE_LVAL (arg1) != lval_memory)
935 error ("Attempt to take address of value not located in memory.");
937 /* Get target memory address */
938 arg2 = value_from_longest (lookup_pointer_type (VALUE_TYPE (arg1)),
939 (LONGEST) (VALUE_ADDRESS (arg1)
940 + VALUE_OFFSET (arg1)
941 + VALUE_EMBEDDED_OFFSET (arg1)));
943 /* This may be a pointer to a base subobject; so remember the
944 full derived object's type ... */
945 VALUE_ENCLOSING_TYPE (arg2) = lookup_pointer_type (VALUE_ENCLOSING_TYPE (arg1));
946 /* ... and also the relative position of the subobject in the full object */
947 VALUE_POINTED_TO_OFFSET (arg2) = VALUE_EMBEDDED_OFFSET (arg1);
948 VALUE_BFD_SECTION (arg2) = VALUE_BFD_SECTION (arg1);
952 /* Given a value of a pointer type, apply the C unary * operator to it. */
958 struct type *base_type;
963 base_type = check_typedef (VALUE_TYPE (arg1));
965 if (TYPE_CODE (base_type) == TYPE_CODE_MEMBER)
966 error ("not implemented: member types in value_ind");
968 /* Allow * on an integer so we can cast it to whatever we want.
969 This returns an int, which seems like the most C-like thing
970 to do. "long long" variables are rare enough that
971 BUILTIN_TYPE_LONGEST would seem to be a mistake. */
972 if (TYPE_CODE (base_type) == TYPE_CODE_INT)
973 return value_at (builtin_type_int,
974 (CORE_ADDR) value_as_long (arg1),
975 VALUE_BFD_SECTION (arg1));
976 else if (TYPE_CODE (base_type) == TYPE_CODE_PTR)
978 struct type *enc_type;
979 /* We may be pointing to something embedded in a larger object */
980 /* Get the real type of the enclosing object */
981 enc_type = check_typedef (VALUE_ENCLOSING_TYPE (arg1));
982 enc_type = TYPE_TARGET_TYPE (enc_type);
983 /* Retrieve the enclosing object pointed to */
984 arg2 = value_at_lazy (enc_type,
985 value_as_pointer (arg1) - VALUE_POINTED_TO_OFFSET (arg1),
986 VALUE_BFD_SECTION (arg1));
988 VALUE_TYPE (arg2) = TYPE_TARGET_TYPE (base_type);
989 /* Add embedding info */
990 VALUE_ENCLOSING_TYPE (arg2) = enc_type;
991 VALUE_EMBEDDED_OFFSET (arg2) = VALUE_POINTED_TO_OFFSET (arg1);
993 /* We may be pointing to an object of some derived type */
994 arg2 = value_full_object (arg2, NULL, 0, 0, 0);
998 error ("Attempt to take contents of a non-pointer value.");
999 return 0; /* For lint -- never reached */
1002 /* Pushing small parts of stack frames. */
1004 /* Push one word (the size of object that a register holds). */
1007 push_word (sp, word)
1011 register int len = REGISTER_SIZE;
1012 char buffer[MAX_REGISTER_RAW_SIZE];
1014 store_unsigned_integer (buffer, len, word);
1015 if (INNER_THAN (1, 2))
1017 /* stack grows downward */
1019 write_memory (sp, buffer, len);
1023 /* stack grows upward */
1024 write_memory (sp, buffer, len);
1031 /* Push LEN bytes with data at BUFFER. */
1034 push_bytes (sp, buffer, len)
1039 if (INNER_THAN (1, 2))
1041 /* stack grows downward */
1043 write_memory (sp, buffer, len);
1047 /* stack grows upward */
1048 write_memory (sp, buffer, len);
1055 #ifndef PARM_BOUNDARY
1056 #define PARM_BOUNDARY (0)
1059 /* Push onto the stack the specified value VALUE. Pad it correctly for
1060 it to be an argument to a function. */
1063 value_push (sp, arg)
1064 register CORE_ADDR sp;
1067 register int len = TYPE_LENGTH (VALUE_ENCLOSING_TYPE (arg));
1068 register int container_len = len;
1069 register int offset;
1071 /* How big is the container we're going to put this value in? */
1073 container_len = ((len + PARM_BOUNDARY / TARGET_CHAR_BIT - 1)
1074 & ~(PARM_BOUNDARY / TARGET_CHAR_BIT - 1));
1076 /* Are we going to put it at the high or low end of the container? */
1077 if (TARGET_BYTE_ORDER == BIG_ENDIAN)
1078 offset = container_len - len;
1082 if (INNER_THAN (1, 2))
1084 /* stack grows downward */
1085 sp -= container_len;
1086 write_memory (sp + offset, VALUE_CONTENTS_ALL (arg), len);
1090 /* stack grows upward */
1091 write_memory (sp + offset, VALUE_CONTENTS_ALL (arg), len);
1092 sp += container_len;
1098 #ifndef PUSH_ARGUMENTS
1099 #define PUSH_ARGUMENTS default_push_arguments
1103 default_push_arguments (nargs, args, sp, struct_return, struct_addr)
1108 CORE_ADDR struct_addr;
1110 /* ASSERT ( !struct_return); */
1112 for (i = nargs - 1; i >= 0; i--)
1113 sp = value_push (sp, args[i]);
1118 /* If we're calling a function declared without a prototype, should we
1119 promote floats to doubles? FORMAL and ACTUAL are the types of the
1120 arguments; FORMAL may be NULL.
1122 If we have no definition for this macro, either from the target or
1123 from gdbarch, provide a default. */
1124 #ifndef COERCE_FLOAT_TO_DOUBLE
1125 #define COERCE_FLOAT_TO_DOUBLE(formal, actual) \
1126 (default_coerce_float_to_double ((formal), (actual)))
1130 /* A default function for COERCE_FLOAT_TO_DOUBLE: do the coercion only
1131 when we don't have any type for the argument at hand. This occurs
1132 when we have no debug info, or when passing varargs.
1134 This is an annoying default: the rule the compiler follows is to do
1135 the standard promotions whenever there is no prototype in scope,
1136 and almost all targets want this behavior. But there are some old
1137 architectures which want this odd behavior. If you want to go
1138 through them all and fix them, please do. Modern gdbarch-style
1139 targets may find it convenient to use standard_coerce_float_to_double. */
1141 default_coerce_float_to_double (struct type *formal, struct type *actual)
1143 return formal == NULL;
1147 /* Always coerce floats to doubles when there is no prototype in scope.
1148 If your architecture follows the standard type promotion rules for
1149 calling unprototyped functions, your gdbarch init function can pass
1150 this function to set_gdbarch_coerce_float_to_double to use its logic. */
1152 standard_coerce_float_to_double (struct type *formal, struct type *actual)
1158 /* Perform the standard coercions that are specified
1159 for arguments to be passed to C functions.
1161 If PARAM_TYPE is non-NULL, it is the expected parameter type.
1162 IS_PROTOTYPED is non-zero if the function declaration is prototyped. */
1165 value_arg_coerce (arg, param_type, is_prototyped)
1167 struct type *param_type;
1170 register struct type *arg_type = check_typedef (VALUE_TYPE (arg));
1171 register struct type *type
1172 = param_type ? check_typedef (param_type) : arg_type;
1174 switch (TYPE_CODE (type))
1177 if (TYPE_CODE (arg_type) != TYPE_CODE_REF)
1179 arg = value_addr (arg);
1180 VALUE_TYPE (arg) = param_type;
1185 case TYPE_CODE_CHAR:
1186 case TYPE_CODE_BOOL:
1187 case TYPE_CODE_ENUM:
1188 /* If we don't have a prototype, coerce to integer type if necessary. */
1191 if (TYPE_LENGTH (type) < TYPE_LENGTH (builtin_type_int))
1192 type = builtin_type_int;
1194 /* Currently all target ABIs require at least the width of an integer
1195 type for an argument. We may have to conditionalize the following
1196 type coercion for future targets. */
1197 if (TYPE_LENGTH (type) < TYPE_LENGTH (builtin_type_int))
1198 type = builtin_type_int;
1201 /* FIXME: We should always convert floats to doubles in the
1202 non-prototyped case. As many debugging formats include
1203 no information about prototyping, we have to live with
1204 COERCE_FLOAT_TO_DOUBLE for now. */
1205 if (!is_prototyped && COERCE_FLOAT_TO_DOUBLE (param_type, arg_type))
1207 if (TYPE_LENGTH (type) < TYPE_LENGTH (builtin_type_double))
1208 type = builtin_type_double;
1209 else if (TYPE_LENGTH (type) > TYPE_LENGTH (builtin_type_double))
1210 type = builtin_type_long_double;
1213 case TYPE_CODE_FUNC:
1214 type = lookup_pointer_type (type);
1216 case TYPE_CODE_ARRAY:
1217 if (current_language->c_style_arrays)
1218 type = lookup_pointer_type (TYPE_TARGET_TYPE (type));
1220 case TYPE_CODE_UNDEF:
1222 case TYPE_CODE_STRUCT:
1223 case TYPE_CODE_UNION:
1224 case TYPE_CODE_VOID:
1226 case TYPE_CODE_RANGE:
1227 case TYPE_CODE_STRING:
1228 case TYPE_CODE_BITSTRING:
1229 case TYPE_CODE_ERROR:
1230 case TYPE_CODE_MEMBER:
1231 case TYPE_CODE_METHOD:
1232 case TYPE_CODE_COMPLEX:
1237 return value_cast (type, arg);
1240 /* Determine a function's address and its return type from its value.
1241 Calls error() if the function is not valid for calling. */
1244 find_function_addr (function, retval_type)
1246 struct type **retval_type;
1248 register struct type *ftype = check_typedef (VALUE_TYPE (function));
1249 register enum type_code code = TYPE_CODE (ftype);
1250 struct type *value_type;
1253 /* If it's a member function, just look at the function
1256 /* Determine address to call. */
1257 if (code == TYPE_CODE_FUNC || code == TYPE_CODE_METHOD)
1259 funaddr = VALUE_ADDRESS (function);
1260 value_type = TYPE_TARGET_TYPE (ftype);
1262 else if (code == TYPE_CODE_PTR)
1264 funaddr = value_as_pointer (function);
1265 ftype = check_typedef (TYPE_TARGET_TYPE (ftype));
1266 if (TYPE_CODE (ftype) == TYPE_CODE_FUNC
1267 || TYPE_CODE (ftype) == TYPE_CODE_METHOD)
1269 #ifdef CONVERT_FROM_FUNC_PTR_ADDR
1270 /* FIXME: This is a workaround for the unusual function
1271 pointer representation on the RS/6000, see comment
1272 in config/rs6000/tm-rs6000.h */
1273 funaddr = CONVERT_FROM_FUNC_PTR_ADDR (funaddr);
1275 value_type = TYPE_TARGET_TYPE (ftype);
1278 value_type = builtin_type_int;
1280 else if (code == TYPE_CODE_INT)
1282 /* Handle the case of functions lacking debugging info.
1283 Their values are characters since their addresses are char */
1284 if (TYPE_LENGTH (ftype) == 1)
1285 funaddr = value_as_pointer (value_addr (function));
1287 /* Handle integer used as address of a function. */
1288 funaddr = (CORE_ADDR) value_as_long (function);
1290 value_type = builtin_type_int;
1293 error ("Invalid data type for function to be called.");
1295 *retval_type = value_type;
1299 /* All this stuff with a dummy frame may seem unnecessarily complicated
1300 (why not just save registers in GDB?). The purpose of pushing a dummy
1301 frame which looks just like a real frame is so that if you call a
1302 function and then hit a breakpoint (get a signal, etc), "backtrace"
1303 will look right. Whether the backtrace needs to actually show the
1304 stack at the time the inferior function was called is debatable, but
1305 it certainly needs to not display garbage. So if you are contemplating
1306 making dummy frames be different from normal frames, consider that. */
1308 /* Perform a function call in the inferior.
1309 ARGS is a vector of values of arguments (NARGS of them).
1310 FUNCTION is a value, the function to be called.
1311 Returns a value representing what the function returned.
1312 May fail to return, if a breakpoint or signal is hit
1313 during the execution of the function.
1315 ARGS is modified to contain coerced values. */
1317 static value_ptr hand_function_call PARAMS ((value_ptr function, int nargs, value_ptr * args));
1319 hand_function_call (function, nargs, args)
1324 register CORE_ADDR sp;
1328 /* CALL_DUMMY is an array of words (REGISTER_SIZE), but each word
1329 is in host byte order. Before calling FIX_CALL_DUMMY, we byteswap it
1330 and remove any extra bytes which might exist because ULONGEST is
1331 bigger than REGISTER_SIZE.
1333 NOTE: This is pretty wierd, as the call dummy is actually a
1334 sequence of instructions. But CISC machines will have
1335 to pack the instructions into REGISTER_SIZE units (and
1336 so will RISC machines for which INSTRUCTION_SIZE is not
1339 NOTE: This is pretty stupid. CALL_DUMMY should be in strict
1340 target byte order. */
1342 static ULONGEST *dummy;
1346 struct type *value_type;
1347 unsigned char struct_return;
1348 CORE_ADDR struct_addr = 0;
1349 struct inferior_status *inf_status;
1350 struct cleanup *old_chain;
1352 int using_gcc; /* Set to version of gcc in use, or zero if not gcc */
1354 struct type *param_type = NULL;
1355 struct type *ftype = check_typedef (SYMBOL_TYPE (function));
1357 dummy = alloca (SIZEOF_CALL_DUMMY_WORDS);
1358 sizeof_dummy1 = REGISTER_SIZE * SIZEOF_CALL_DUMMY_WORDS / sizeof (ULONGEST);
1359 dummy1 = alloca (sizeof_dummy1);
1360 memcpy (dummy, CALL_DUMMY_WORDS, SIZEOF_CALL_DUMMY_WORDS);
1362 if (!target_has_execution)
1365 inf_status = save_inferior_status (1);
1366 old_chain = make_cleanup ((make_cleanup_func) restore_inferior_status,
1369 /* PUSH_DUMMY_FRAME is responsible for saving the inferior registers
1370 (and POP_FRAME for restoring them). (At least on most machines)
1371 they are saved on the stack in the inferior. */
1374 old_sp = sp = read_sp ();
1376 if (INNER_THAN (1, 2))
1378 /* Stack grows down */
1379 sp -= sizeof_dummy1;
1384 /* Stack grows up */
1386 sp += sizeof_dummy1;
1389 funaddr = find_function_addr (function, &value_type);
1390 CHECK_TYPEDEF (value_type);
1393 struct block *b = block_for_pc (funaddr);
1394 /* If compiled without -g, assume GCC 2. */
1395 using_gcc = (b == NULL ? 2 : BLOCK_GCC_COMPILED (b));
1398 /* Are we returning a value using a structure return or a normal
1401 struct_return = using_struct_return (function, funaddr, value_type,
1404 /* Create a call sequence customized for this function
1405 and the number of arguments for it. */
1406 for (i = 0; i < (int) (SIZEOF_CALL_DUMMY_WORDS / sizeof (dummy[0])); i++)
1407 store_unsigned_integer (&dummy1[i * REGISTER_SIZE],
1409 (ULONGEST) dummy[i]);
1411 #ifdef GDB_TARGET_IS_HPPA
1412 real_pc = FIX_CALL_DUMMY (dummy1, start_sp, funaddr, nargs, args,
1413 value_type, using_gcc);
1415 FIX_CALL_DUMMY (dummy1, start_sp, funaddr, nargs, args,
1416 value_type, using_gcc);
1420 if (CALL_DUMMY_LOCATION == ON_STACK)
1422 write_memory (start_sp, (char *) dummy1, sizeof_dummy1);
1425 if (CALL_DUMMY_LOCATION == BEFORE_TEXT_END)
1427 /* Convex Unix prohibits executing in the stack segment. */
1428 /* Hope there is empty room at the top of the text segment. */
1429 extern CORE_ADDR text_end;
1430 static int checked = 0;
1432 for (start_sp = text_end - sizeof_dummy1; start_sp < text_end; ++start_sp)
1433 if (read_memory_integer (start_sp, 1) != 0)
1434 error ("text segment full -- no place to put call");
1437 real_pc = text_end - sizeof_dummy1;
1438 write_memory (real_pc, (char *) dummy1, sizeof_dummy1);
1441 if (CALL_DUMMY_LOCATION == AFTER_TEXT_END)
1443 extern CORE_ADDR text_end;
1447 errcode = target_write_memory (real_pc, (char *) dummy1, sizeof_dummy1);
1449 error ("Cannot write text segment -- call_function failed");
1452 if (CALL_DUMMY_LOCATION == AT_ENTRY_POINT)
1458 sp = old_sp; /* It really is used, for some ifdef's... */
1461 if (nargs < TYPE_NFIELDS (ftype))
1462 error ("too few arguments in function call");
1464 for (i = nargs - 1; i >= 0; i--)
1466 /* If we're off the end of the known arguments, do the standard
1467 promotions. FIXME: if we had a prototype, this should only
1468 be allowed if ... were present. */
1469 if (i >= TYPE_NFIELDS (ftype))
1470 args[i] = value_arg_coerce (args[i], NULL, 0);
1474 int is_prototyped = TYPE_FLAGS (ftype) & TYPE_FLAG_PROTOTYPED;
1475 param_type = TYPE_FIELD_TYPE (ftype, i);
1477 args[i] = value_arg_coerce (args[i], param_type, is_prototyped);
1480 /*elz: this code is to handle the case in which the function to be called
1481 has a pointer to function as parameter and the corresponding actual argument
1482 is the address of a function and not a pointer to function variable.
1483 In aCC compiled code, the calls through pointers to functions (in the body
1484 of the function called by hand) are made via $$dyncall_external which
1485 requires some registers setting, this is taken care of if we call
1486 via a function pointer variable, but not via a function address.
1487 In cc this is not a problem. */
1491 /* if this parameter is a pointer to function */
1492 if (TYPE_CODE (param_type) == TYPE_CODE_PTR)
1493 if (TYPE_CODE (param_type->target_type) == TYPE_CODE_FUNC)
1494 /* elz: FIXME here should go the test about the compiler used
1495 to compile the target. We want to issue the error
1496 message only if the compiler used was HP's aCC.
1497 If we used HP's cc, then there is no problem and no need
1498 to return at this point */
1499 if (using_gcc == 0) /* && compiler == aCC */
1500 /* go see if the actual parameter is a variable of type
1501 pointer to function or just a function */
1502 if (args[i]->lval == not_lval)
1505 if (find_pc_partial_function ((CORE_ADDR) args[i]->aligner.contents[0], &arg_name, NULL, NULL))
1507 You cannot use function <%s> as argument. \n\
1508 You must use a pointer to function type variable. Command ignored.", arg_name);
1512 #if defined (REG_STRUCT_HAS_ADDR)
1514 /* This is a machine like the sparc, where we may need to pass a pointer
1515 to the structure, not the structure itself. */
1516 for (i = nargs - 1; i >= 0; i--)
1518 struct type *arg_type = check_typedef (VALUE_TYPE (args[i]));
1519 if ((TYPE_CODE (arg_type) == TYPE_CODE_STRUCT
1520 || TYPE_CODE (arg_type) == TYPE_CODE_UNION
1521 || TYPE_CODE (arg_type) == TYPE_CODE_ARRAY
1522 || TYPE_CODE (arg_type) == TYPE_CODE_STRING
1523 || TYPE_CODE (arg_type) == TYPE_CODE_BITSTRING
1524 || TYPE_CODE (arg_type) == TYPE_CODE_SET
1525 || (TYPE_CODE (arg_type) == TYPE_CODE_FLT
1526 && TYPE_LENGTH (arg_type) > 8)
1528 && REG_STRUCT_HAS_ADDR (using_gcc, arg_type))
1531 int len; /* = TYPE_LENGTH (arg_type); */
1533 arg_type = check_typedef (VALUE_ENCLOSING_TYPE (args[i]));
1534 len = TYPE_LENGTH (arg_type);
1537 /* MVS 11/22/96: I think at least some of this stack_align code is
1538 really broken. Better to let PUSH_ARGUMENTS adjust the stack in
1539 a target-defined manner. */
1540 aligned_len = STACK_ALIGN (len);
1544 if (INNER_THAN (1, 2))
1546 /* stack grows downward */
1551 /* The stack grows up, so the address of the thing we push
1552 is the stack pointer before we push it. */
1555 /* Push the structure. */
1556 write_memory (sp, VALUE_CONTENTS_ALL (args[i]), len);
1557 if (INNER_THAN (1, 2))
1559 /* The stack grows down, so the address of the thing we push
1560 is the stack pointer after we push it. */
1565 /* stack grows upward */
1568 /* The value we're going to pass is the address of the thing
1570 /*args[i] = value_from_longest (lookup_pointer_type (value_type),
1572 args[i] = value_from_longest (lookup_pointer_type (arg_type),
1577 #endif /* REG_STRUCT_HAS_ADDR. */
1579 /* Reserve space for the return structure to be written on the
1580 stack, if necessary */
1584 int len = TYPE_LENGTH (value_type);
1586 /* MVS 11/22/96: I think at least some of this stack_align code is
1587 really broken. Better to let PUSH_ARGUMENTS adjust the stack in
1588 a target-defined manner. */
1589 len = STACK_ALIGN (len);
1591 if (INNER_THAN (1, 2))
1593 /* stack grows downward */
1599 /* stack grows upward */
1605 /* elz: on HPPA no need for this extra alignment, maybe it is needed
1606 on other architectures. This is because all the alignment is taken care
1607 of in the above code (ifdef REG_STRUCT_HAS_ADDR) and in
1608 hppa_push_arguments */
1609 #ifndef NO_EXTRA_ALIGNMENT_NEEDED
1611 #if defined(STACK_ALIGN)
1612 /* MVS 11/22/96: I think at least some of this stack_align code is
1613 really broken. Better to let PUSH_ARGUMENTS adjust the stack in
1614 a target-defined manner. */
1615 if (INNER_THAN (1, 2))
1617 /* If stack grows down, we must leave a hole at the top. */
1620 for (i = nargs - 1; i >= 0; i--)
1621 len += TYPE_LENGTH (VALUE_ENCLOSING_TYPE (args[i]));
1622 if (CALL_DUMMY_STACK_ADJUST_P)
1623 len += CALL_DUMMY_STACK_ADJUST;
1624 sp -= STACK_ALIGN (len) - len;
1626 #endif /* STACK_ALIGN */
1627 #endif /* NO_EXTRA_ALIGNMENT_NEEDED */
1629 sp = PUSH_ARGUMENTS (nargs, args, sp, struct_return, struct_addr);
1631 #ifdef PUSH_RETURN_ADDRESS /* for targets that use no CALL_DUMMY */
1632 /* There are a number of targets now which actually don't write any
1633 CALL_DUMMY instructions into the target, but instead just save the
1634 machine state, push the arguments, and jump directly to the callee
1635 function. Since this doesn't actually involve executing a JSR/BSR
1636 instruction, the return address must be set up by hand, either by
1637 pushing onto the stack or copying into a return-address register
1638 as appropriate. Formerly this has been done in PUSH_ARGUMENTS,
1639 but that's overloading its functionality a bit, so I'm making it
1640 explicit to do it here. */
1641 sp = PUSH_RETURN_ADDRESS (real_pc, sp);
1642 #endif /* PUSH_RETURN_ADDRESS */
1644 #if defined(STACK_ALIGN)
1645 if (!INNER_THAN (1, 2))
1647 /* If stack grows up, we must leave a hole at the bottom, note
1648 that sp already has been advanced for the arguments! */
1649 if (CALL_DUMMY_STACK_ADJUST_P)
1650 sp += CALL_DUMMY_STACK_ADJUST;
1651 sp = STACK_ALIGN (sp);
1653 #endif /* STACK_ALIGN */
1655 /* XXX This seems wrong. For stacks that grow down we shouldn't do
1657 /* MVS 11/22/96: I think at least some of this stack_align code is
1658 really broken. Better to let PUSH_ARGUMENTS adjust the stack in
1659 a target-defined manner. */
1660 if (CALL_DUMMY_STACK_ADJUST_P)
1661 if (INNER_THAN (1, 2))
1663 /* stack grows downward */
1664 sp -= CALL_DUMMY_STACK_ADJUST;
1667 /* Store the address at which the structure is supposed to be
1668 written. Note that this (and the code which reserved the space
1669 above) assumes that gcc was used to compile this function. Since
1670 it doesn't cost us anything but space and if the function is pcc
1671 it will ignore this value, we will make that assumption.
1673 Also note that on some machines (like the sparc) pcc uses a
1674 convention like gcc's. */
1677 STORE_STRUCT_RETURN (struct_addr, sp);
1679 /* Write the stack pointer. This is here because the statements above
1680 might fool with it. On SPARC, this write also stores the register
1681 window into the right place in the new stack frame, which otherwise
1682 wouldn't happen. (See store_inferior_registers in sparc-nat.c.) */
1685 #ifdef SAVE_DUMMY_FRAME_TOS
1686 SAVE_DUMMY_FRAME_TOS (sp);
1690 char retbuf[REGISTER_BYTES];
1692 struct symbol *symbol;
1695 symbol = find_pc_function (funaddr);
1698 name = SYMBOL_SOURCE_NAME (symbol);
1702 /* Try the minimal symbols. */
1703 struct minimal_symbol *msymbol = lookup_minimal_symbol_by_pc (funaddr);
1707 name = SYMBOL_SOURCE_NAME (msymbol);
1713 sprintf (format, "at %s", local_hex_format ());
1715 /* FIXME-32x64: assumes funaddr fits in a long. */
1716 sprintf (name, format, (unsigned long) funaddr);
1719 /* Execute the stack dummy routine, calling FUNCTION.
1720 When it is done, discard the empty frame
1721 after storing the contents of all regs into retbuf. */
1722 rc = run_stack_dummy (real_pc + CALL_DUMMY_START_OFFSET, retbuf);
1726 /* We stopped inside the FUNCTION because of a random signal.
1727 Further execution of the FUNCTION is not allowed. */
1729 /* In this case, we must do the cleanups because we don't
1730 want the dummy anymore (the dummy frame has been poped already. */
1731 do_cleanups (old_chain);
1733 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1734 a C++ name with arguments and stuff. */
1736 The program being debugged stopped while in a function called from GDB.\n\
1737 Evaluation of the expression containing the function (%s) will be abandoned.",
1743 /* We hit a breakpoint inside the FUNCTION. */
1745 /* If we did the cleanups, we would print a spurious error
1746 message (Unable to restore previously selected frame),
1747 would write the registers from the inf_status (which is
1748 wrong), and would do other wrong things. */
1749 discard_cleanups (old_chain);
1750 discard_inferior_status (inf_status);
1752 /* The following error message used to say "The expression
1753 which contained the function call has been discarded." It
1754 is a hard concept to explain in a few words. Ideally, GDB
1755 would be able to resume evaluation of the expression when
1756 the function finally is done executing. Perhaps someday
1757 this will be implemented (it would not be easy). */
1759 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1760 a C++ name with arguments and stuff. */
1762 The program being debugged stopped while in a function called from GDB.\n\
1763 When the function (%s) is done executing, GDB will silently\n\
1764 stop (instead of continuing to evaluate the expression containing\n\
1765 the function call).", name);
1768 /* If we get here the called FUNCTION run to completion. */
1769 do_cleanups (old_chain);
1771 /* Figure out the value returned by the function. */
1772 /* elz: I defined this new macro for the hppa architecture only.
1773 this gives us a way to get the value returned by the function from the stack,
1774 at the same address we told the function to put it.
1775 We cannot assume on the pa that r28 still contains the address of the returned
1776 structure. Usually this will be overwritten by the callee.
1777 I don't know about other architectures, so I defined this macro
1780 #ifdef VALUE_RETURNED_FROM_STACK
1782 return (value_ptr) VALUE_RETURNED_FROM_STACK (value_type, struct_addr);
1785 return value_being_returned (value_type, retbuf, struct_return);
1790 call_function_by_hand (function, nargs, args)
1797 return hand_function_call (function, nargs, args);
1801 error ("Cannot invoke functions on this machine.");
1807 /* Create a value for an array by allocating space in the inferior, copying
1808 the data into that space, and then setting up an array value.
1810 The array bounds are set from LOWBOUND and HIGHBOUND, and the array is
1811 populated from the values passed in ELEMVEC.
1813 The element type of the array is inherited from the type of the
1814 first element, and all elements must have the same size (though we
1815 don't currently enforce any restriction on their types). */
1818 value_array (lowbound, highbound, elemvec)
1825 unsigned int typelength;
1827 struct type *rangetype;
1828 struct type *arraytype;
1831 /* Validate that the bounds are reasonable and that each of the elements
1832 have the same size. */
1834 nelem = highbound - lowbound + 1;
1837 error ("bad array bounds (%d, %d)", lowbound, highbound);
1839 typelength = TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec[0]));
1840 for (idx = 1; idx < nelem; idx++)
1842 if (TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec[idx])) != typelength)
1844 error ("array elements must all be the same size");
1848 rangetype = create_range_type ((struct type *) NULL, builtin_type_int,
1849 lowbound, highbound);
1850 arraytype = create_array_type ((struct type *) NULL,
1851 VALUE_ENCLOSING_TYPE (elemvec[0]), rangetype);
1853 if (!current_language->c_style_arrays)
1855 val = allocate_value (arraytype);
1856 for (idx = 0; idx < nelem; idx++)
1858 memcpy (VALUE_CONTENTS_ALL_RAW (val) + (idx * typelength),
1859 VALUE_CONTENTS_ALL (elemvec[idx]),
1862 VALUE_BFD_SECTION (val) = VALUE_BFD_SECTION (elemvec[0]);
1866 /* Allocate space to store the array in the inferior, and then initialize
1867 it by copying in each element. FIXME: Is it worth it to create a
1868 local buffer in which to collect each value and then write all the
1869 bytes in one operation? */
1871 addr = allocate_space_in_inferior (nelem * typelength);
1872 for (idx = 0; idx < nelem; idx++)
1874 write_memory (addr + (idx * typelength), VALUE_CONTENTS_ALL (elemvec[idx]),
1878 /* Create the array type and set up an array value to be evaluated lazily. */
1880 val = value_at_lazy (arraytype, addr, VALUE_BFD_SECTION (elemvec[0]));
1884 /* Create a value for a string constant by allocating space in the inferior,
1885 copying the data into that space, and returning the address with type
1886 TYPE_CODE_STRING. PTR points to the string constant data; LEN is number
1888 Note that string types are like array of char types with a lower bound of
1889 zero and an upper bound of LEN - 1. Also note that the string may contain
1890 embedded null bytes. */
1893 value_string (ptr, len)
1898 int lowbound = current_language->string_lower_bound;
1899 struct type *rangetype = create_range_type ((struct type *) NULL,
1901 lowbound, len + lowbound - 1);
1902 struct type *stringtype
1903 = create_string_type ((struct type *) NULL, rangetype);
1906 if (current_language->c_style_arrays == 0)
1908 val = allocate_value (stringtype);
1909 memcpy (VALUE_CONTENTS_RAW (val), ptr, len);
1914 /* Allocate space to store the string in the inferior, and then
1915 copy LEN bytes from PTR in gdb to that address in the inferior. */
1917 addr = allocate_space_in_inferior (len);
1918 write_memory (addr, ptr, len);
1920 val = value_at_lazy (stringtype, addr, NULL);
1925 value_bitstring (ptr, len)
1930 struct type *domain_type = create_range_type (NULL, builtin_type_int,
1932 struct type *type = create_set_type ((struct type *) NULL, domain_type);
1933 TYPE_CODE (type) = TYPE_CODE_BITSTRING;
1934 val = allocate_value (type);
1935 memcpy (VALUE_CONTENTS_RAW (val), ptr, TYPE_LENGTH (type));
1939 /* See if we can pass arguments in T2 to a function which takes arguments
1940 of types T1. Both t1 and t2 are NULL-terminated vectors. If some
1941 arguments need coercion of some sort, then the coerced values are written
1942 into T2. Return value is 0 if the arguments could be matched, or the
1943 position at which they differ if not.
1945 STATICP is nonzero if the T1 argument list came from a
1946 static member function.
1948 For non-static member functions, we ignore the first argument,
1949 which is the type of the instance variable. This is because we want
1950 to handle calls with objects from derived classes. This is not
1951 entirely correct: we should actually check to make sure that a
1952 requested operation is type secure, shouldn't we? FIXME. */
1955 typecmp (staticp, t1, t2)
1964 if (staticp && t1 == 0)
1968 if (TYPE_CODE (t1[0]) == TYPE_CODE_VOID)
1970 if (t1[!staticp] == 0)
1972 for (i = !staticp; t1[i] && TYPE_CODE (t1[i]) != TYPE_CODE_VOID; i++)
1974 struct type *tt1, *tt2;
1977 tt1 = check_typedef (t1[i]);
1978 tt2 = check_typedef (VALUE_TYPE (t2[i]));
1979 if (TYPE_CODE (tt1) == TYPE_CODE_REF
1980 /* We should be doing hairy argument matching, as below. */
1981 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1))) == TYPE_CODE (tt2)))
1983 if (TYPE_CODE (tt2) == TYPE_CODE_ARRAY)
1984 t2[i] = value_coerce_array (t2[i]);
1986 t2[i] = value_addr (t2[i]);
1990 while (TYPE_CODE (tt1) == TYPE_CODE_PTR
1991 && (TYPE_CODE (tt2) == TYPE_CODE_ARRAY
1992 || TYPE_CODE (tt2) == TYPE_CODE_PTR))
1994 tt1 = check_typedef (TYPE_TARGET_TYPE (tt1));
1995 tt2 = check_typedef (TYPE_TARGET_TYPE (tt2));
1997 if (TYPE_CODE (tt1) == TYPE_CODE (tt2))
1999 /* Array to pointer is a `trivial conversion' according to the ARM. */
2001 /* We should be doing much hairier argument matching (see section 13.2
2002 of the ARM), but as a quick kludge, just check for the same type
2004 if (TYPE_CODE (t1[i]) != TYPE_CODE (VALUE_TYPE (t2[i])))
2009 return t2[i] ? i + 1 : 0;
2012 /* Helper function used by value_struct_elt to recurse through baseclasses.
2013 Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
2014 and search in it assuming it has (class) type TYPE.
2015 If found, return value, else return NULL.
2017 If LOOKING_FOR_BASECLASS, then instead of looking for struct fields,
2018 look for a baseclass named NAME. */
2021 search_struct_field (name, arg1, offset, type, looking_for_baseclass)
2023 register value_ptr arg1;
2025 register struct type *type;
2026 int looking_for_baseclass;
2029 int nbases = TYPE_N_BASECLASSES (type);
2031 CHECK_TYPEDEF (type);
2033 if (!looking_for_baseclass)
2034 for (i = TYPE_NFIELDS (type) - 1; i >= nbases; i--)
2036 char *t_field_name = TYPE_FIELD_NAME (type, i);
2038 if (t_field_name && STREQ (t_field_name, name))
2041 if (TYPE_FIELD_STATIC (type, i))
2042 v = value_static_field (type, i);
2044 v = value_primitive_field (arg1, offset, i, type);
2046 error ("there is no field named %s", name);
2051 && (t_field_name[0] == '\0'
2052 || (TYPE_CODE (type) == TYPE_CODE_UNION
2053 && STREQ (t_field_name, "else"))))
2055 struct type *field_type = TYPE_FIELD_TYPE (type, i);
2056 if (TYPE_CODE (field_type) == TYPE_CODE_UNION
2057 || TYPE_CODE (field_type) == TYPE_CODE_STRUCT)
2059 /* Look for a match through the fields of an anonymous union,
2060 or anonymous struct. C++ provides anonymous unions.
2062 In the GNU Chill implementation of variant record types,
2063 each <alternative field> has an (anonymous) union type,
2064 each member of the union represents a <variant alternative>.
2065 Each <variant alternative> is represented as a struct,
2066 with a member for each <variant field>. */
2069 int new_offset = offset;
2071 /* This is pretty gross. In G++, the offset in an anonymous
2072 union is relative to the beginning of the enclosing struct.
2073 In the GNU Chill implementation of variant records,
2074 the bitpos is zero in an anonymous union field, so we
2075 have to add the offset of the union here. */
2076 if (TYPE_CODE (field_type) == TYPE_CODE_STRUCT
2077 || (TYPE_NFIELDS (field_type) > 0
2078 && TYPE_FIELD_BITPOS (field_type, 0) == 0))
2079 new_offset += TYPE_FIELD_BITPOS (type, i) / 8;
2081 v = search_struct_field (name, arg1, new_offset, field_type,
2082 looking_for_baseclass);
2089 for (i = 0; i < nbases; i++)
2092 struct type *basetype = check_typedef (TYPE_BASECLASS (type, i));
2093 /* If we are looking for baseclasses, this is what we get when we
2094 hit them. But it could happen that the base part's member name
2095 is not yet filled in. */
2096 int found_baseclass = (looking_for_baseclass
2097 && TYPE_BASECLASS_NAME (type, i) != NULL
2098 && STREQ (name, TYPE_BASECLASS_NAME (type, i)));
2100 if (BASETYPE_VIA_VIRTUAL (type, i))
2103 value_ptr v2 = allocate_value (basetype);
2105 boffset = baseclass_offset (type, i,
2106 VALUE_CONTENTS (arg1) + offset,
2107 VALUE_ADDRESS (arg1)
2108 + VALUE_OFFSET (arg1) + offset);
2110 error ("virtual baseclass botch");
2112 /* The virtual base class pointer might have been clobbered by the
2113 user program. Make sure that it still points to a valid memory
2117 if (boffset < 0 || boffset >= TYPE_LENGTH (type))
2119 CORE_ADDR base_addr;
2121 base_addr = VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1) + boffset;
2122 if (target_read_memory (base_addr, VALUE_CONTENTS_RAW (v2),
2123 TYPE_LENGTH (basetype)) != 0)
2124 error ("virtual baseclass botch");
2125 VALUE_LVAL (v2) = lval_memory;
2126 VALUE_ADDRESS (v2) = base_addr;
2130 VALUE_LVAL (v2) = VALUE_LVAL (arg1);
2131 VALUE_ADDRESS (v2) = VALUE_ADDRESS (arg1);
2132 VALUE_OFFSET (v2) = VALUE_OFFSET (arg1) + boffset;
2133 if (VALUE_LAZY (arg1))
2134 VALUE_LAZY (v2) = 1;
2136 memcpy (VALUE_CONTENTS_RAW (v2),
2137 VALUE_CONTENTS_RAW (arg1) + boffset,
2138 TYPE_LENGTH (basetype));
2141 if (found_baseclass)
2143 v = search_struct_field (name, v2, 0, TYPE_BASECLASS (type, i),
2144 looking_for_baseclass);
2146 else if (found_baseclass)
2147 v = value_primitive_field (arg1, offset, i, type);
2149 v = search_struct_field (name, arg1,
2150 offset + TYPE_BASECLASS_BITPOS (type, i) / 8,
2151 basetype, looking_for_baseclass);
2159 /* Return the offset (in bytes) of the virtual base of type BASETYPE
2160 * in an object pointed to by VALADDR (on the host), assumed to be of
2161 * type TYPE. OFFSET is number of bytes beyond start of ARG to start
2162 * looking (in case VALADDR is the contents of an enclosing object).
2164 * This routine recurses on the primary base of the derived class because
2165 * the virtual base entries of the primary base appear before the other
2166 * virtual base entries.
2168 * If the virtual base is not found, a negative integer is returned.
2169 * The magnitude of the negative integer is the number of entries in
2170 * the virtual table to skip over (entries corresponding to various
2171 * ancestral classes in the chain of primary bases).
2173 * Important: This assumes the HP / Taligent C++ runtime
2174 * conventions. Use baseclass_offset() instead to deal with g++
2178 find_rt_vbase_offset (type, basetype, valaddr, offset, boffset_p, skip_p)
2180 struct type *basetype;
2186 int boffset; /* offset of virtual base */
2187 int index; /* displacement to use in virtual table */
2191 CORE_ADDR vtbl; /* the virtual table pointer */
2192 struct type *pbc; /* the primary base class */
2194 /* Look for the virtual base recursively in the primary base, first.
2195 * This is because the derived class object and its primary base
2196 * subobject share the primary virtual table. */
2199 pbc = TYPE_PRIMARY_BASE (type);
2202 find_rt_vbase_offset (pbc, basetype, valaddr, offset, &boffset, &skip);
2205 *boffset_p = boffset;
2214 /* Find the index of the virtual base according to HP/Taligent
2215 runtime spec. (Depth-first, left-to-right.) */
2216 index = virtual_base_index_skip_primaries (basetype, type);
2220 *skip_p = skip + virtual_base_list_length_skip_primaries (type);
2225 /* pai: FIXME -- 32x64 possible problem */
2226 /* First word (4 bytes) in object layout is the vtable pointer */
2227 vtbl = *(CORE_ADDR *) (valaddr + offset);
2229 /* Before the constructor is invoked, things are usually zero'd out. */
2231 error ("Couldn't find virtual table -- object may not be constructed yet.");
2234 /* Find virtual base's offset -- jump over entries for primary base
2235 * ancestors, then use the index computed above. But also adjust by
2236 * HP_ACC_VBASE_START for the vtable slots before the start of the
2237 * virtual base entries. Offset is negative -- virtual base entries
2238 * appear _before_ the address point of the virtual table. */
2240 /* pai: FIXME -- 32x64 problem, if word = 8 bytes, change multiplier
2243 /* epstein : FIXME -- added param for overlay section. May not be correct */
2244 vp = value_at (builtin_type_int, vtbl + 4 * (-skip - index - HP_ACC_VBASE_START), NULL);
2245 boffset = value_as_long (vp);
2247 *boffset_p = boffset;
2252 /* Helper function used by value_struct_elt to recurse through baseclasses.
2253 Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
2254 and search in it assuming it has (class) type TYPE.
2255 If found, return value, else if name matched and args not return (value)-1,
2256 else return NULL. */
2259 search_struct_method (name, arg1p, args, offset, static_memfuncp, type)
2261 register value_ptr *arg1p, *args;
2262 int offset, *static_memfuncp;
2263 register struct type *type;
2267 int name_matched = 0;
2268 char dem_opname[64];
2270 CHECK_TYPEDEF (type);
2271 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
2273 char *t_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
2274 /* FIXME! May need to check for ARM demangling here */
2275 if (strncmp (t_field_name, "__", 2) == 0 ||
2276 strncmp (t_field_name, "op", 2) == 0 ||
2277 strncmp (t_field_name, "type", 4) == 0)
2279 if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI))
2280 t_field_name = dem_opname;
2281 else if (cplus_demangle_opname (t_field_name, dem_opname, 0))
2282 t_field_name = dem_opname;
2284 if (t_field_name && STREQ (t_field_name, name))
2286 int j = TYPE_FN_FIELDLIST_LENGTH (type, i) - 1;
2287 struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i);
2290 if (j > 0 && args == 0)
2291 error ("cannot resolve overloaded method `%s': no arguments supplied", name);
2294 if (TYPE_FN_FIELD_STUB (f, j))
2295 check_stub_method (type, i, j);
2296 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f, j),
2297 TYPE_FN_FIELD_ARGS (f, j), args))
2299 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
2300 return value_virtual_fn_field (arg1p, f, j, type, offset);
2301 if (TYPE_FN_FIELD_STATIC_P (f, j) && static_memfuncp)
2302 *static_memfuncp = 1;
2303 v = value_fn_field (arg1p, f, j, type, offset);
2312 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2316 if (BASETYPE_VIA_VIRTUAL (type, i))
2318 if (TYPE_HAS_VTABLE (type))
2320 /* HP aCC compiled type, search for virtual base offset
2321 according to HP/Taligent runtime spec. */
2323 find_rt_vbase_offset (type, TYPE_BASECLASS (type, i),
2324 VALUE_CONTENTS_ALL (*arg1p),
2325 offset + VALUE_EMBEDDED_OFFSET (*arg1p),
2326 &base_offset, &skip);
2328 error ("Virtual base class offset not found in vtable");
2332 struct type *baseclass = check_typedef (TYPE_BASECLASS (type, i));
2335 /* The virtual base class pointer might have been clobbered by the
2336 user program. Make sure that it still points to a valid memory
2339 if (offset < 0 || offset >= TYPE_LENGTH (type))
2341 base_valaddr = (char *) alloca (TYPE_LENGTH (baseclass));
2342 if (target_read_memory (VALUE_ADDRESS (*arg1p)
2343 + VALUE_OFFSET (*arg1p) + offset,
2345 TYPE_LENGTH (baseclass)) != 0)
2346 error ("virtual baseclass botch");
2349 base_valaddr = VALUE_CONTENTS (*arg1p) + offset;
2352 baseclass_offset (type, i, base_valaddr,
2353 VALUE_ADDRESS (*arg1p)
2354 + VALUE_OFFSET (*arg1p) + offset);
2355 if (base_offset == -1)
2356 error ("virtual baseclass botch");
2361 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
2363 v = search_struct_method (name, arg1p, args, base_offset + offset,
2364 static_memfuncp, TYPE_BASECLASS (type, i));
2365 if (v == (value_ptr) - 1)
2371 /* FIXME-bothner: Why is this commented out? Why is it here? */
2372 /* *arg1p = arg1_tmp; */
2377 return (value_ptr) - 1;
2382 /* Given *ARGP, a value of type (pointer to a)* structure/union,
2383 extract the component named NAME from the ultimate target structure/union
2384 and return it as a value with its appropriate type.
2385 ERR is used in the error message if *ARGP's type is wrong.
2387 C++: ARGS is a list of argument types to aid in the selection of
2388 an appropriate method. Also, handle derived types.
2390 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
2391 where the truthvalue of whether the function that was resolved was
2392 a static member function or not is stored.
2394 ERR is an error message to be printed in case the field is not found. */
2397 value_struct_elt (argp, args, name, static_memfuncp, err)
2398 register value_ptr *argp, *args;
2400 int *static_memfuncp;
2403 register struct type *t;
2406 COERCE_ARRAY (*argp);
2408 t = check_typedef (VALUE_TYPE (*argp));
2410 /* Follow pointers until we get to a non-pointer. */
2412 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
2414 *argp = value_ind (*argp);
2415 /* Don't coerce fn pointer to fn and then back again! */
2416 if (TYPE_CODE (VALUE_TYPE (*argp)) != TYPE_CODE_FUNC)
2417 COERCE_ARRAY (*argp);
2418 t = check_typedef (VALUE_TYPE (*argp));
2421 if (TYPE_CODE (t) == TYPE_CODE_MEMBER)
2422 error ("not implemented: member type in value_struct_elt");
2424 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2425 && TYPE_CODE (t) != TYPE_CODE_UNION)
2426 error ("Attempt to extract a component of a value that is not a %s.", err);
2428 /* Assume it's not, unless we see that it is. */
2429 if (static_memfuncp)
2430 *static_memfuncp = 0;
2434 /* if there are no arguments ...do this... */
2436 /* Try as a field first, because if we succeed, there
2437 is less work to be done. */
2438 v = search_struct_field (name, *argp, 0, t, 0);
2442 /* C++: If it was not found as a data field, then try to
2443 return it as a pointer to a method. */
2445 if (destructor_name_p (name, t))
2446 error ("Cannot get value of destructor");
2448 v = search_struct_method (name, argp, args, 0, static_memfuncp, t);
2450 if (v == (value_ptr) - 1)
2451 error ("Cannot take address of a method");
2454 if (TYPE_NFN_FIELDS (t))
2455 error ("There is no member or method named %s.", name);
2457 error ("There is no member named %s.", name);
2462 if (destructor_name_p (name, t))
2466 /* Destructors are a special case. */
2467 int m_index, f_index;
2470 if (get_destructor_fn_field (t, &m_index, &f_index))
2472 v = value_fn_field (NULL, TYPE_FN_FIELDLIST1 (t, m_index),
2476 error ("could not find destructor function named %s.", name);
2482 error ("destructor should not have any argument");
2486 v = search_struct_method (name, argp, args, 0, static_memfuncp, t);
2488 if (v == (value_ptr) - 1)
2490 error ("Argument list of %s mismatch with component in the structure.", name);
2494 /* See if user tried to invoke data as function. If so,
2495 hand it back. If it's not callable (i.e., a pointer to function),
2496 gdb should give an error. */
2497 v = search_struct_field (name, *argp, 0, t, 0);
2501 error ("Structure has no component named %s.", name);
2505 /* Search through the methods of an object (and its bases)
2506 * to find a specified method. Return the pointer to the
2507 * fn_field list of overloaded instances.
2508 * Helper function for value_find_oload_list.
2509 * ARGP is a pointer to a pointer to a value (the object)
2510 * METHOD is a string containing the method name
2511 * OFFSET is the offset within the value
2512 * STATIC_MEMFUNCP is set if the method is static
2513 * TYPE is the assumed type of the object
2514 * NUM_FNS is the number of overloaded instances
2515 * BASETYPE is set to the actual type of the subobject where the method is found
2516 * BOFFSET is the offset of the base subobject where the method is found */
2518 static struct fn_field *
2519 find_method_list (argp, method, offset, static_memfuncp, type, num_fns, basetype, boffset)
2523 int *static_memfuncp;
2526 struct type **basetype;
2531 CHECK_TYPEDEF (type);
2535 /* First check in object itself */
2536 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
2538 /* pai: FIXME What about operators and type conversions? */
2539 char *fn_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
2540 if (fn_field_name && STREQ (fn_field_name, method))
2542 *num_fns = TYPE_FN_FIELDLIST_LENGTH (type, i);
2545 return TYPE_FN_FIELDLIST1 (type, i);
2549 /* Not found in object, check in base subobjects */
2550 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2553 if (BASETYPE_VIA_VIRTUAL (type, i))
2555 if (TYPE_HAS_VTABLE (type))
2557 /* HP aCC compiled type, search for virtual base offset
2558 * according to HP/Taligent runtime spec. */
2560 find_rt_vbase_offset (type, TYPE_BASECLASS (type, i),
2561 VALUE_CONTENTS_ALL (*argp),
2562 offset + VALUE_EMBEDDED_OFFSET (*argp),
2563 &base_offset, &skip);
2565 error ("Virtual base class offset not found in vtable");
2569 /* probably g++ runtime model */
2570 base_offset = VALUE_OFFSET (*argp) + offset;
2572 baseclass_offset (type, i,
2573 VALUE_CONTENTS (*argp) + base_offset,
2574 VALUE_ADDRESS (*argp) + base_offset);
2575 if (base_offset == -1)
2576 error ("virtual baseclass botch");
2580 /* non-virtual base, simply use bit position from debug info */
2582 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
2584 f = find_method_list (argp, method, base_offset + offset,
2585 static_memfuncp, TYPE_BASECLASS (type, i), num_fns, basetype, boffset);
2592 /* Return the list of overloaded methods of a specified name.
2593 * ARGP is a pointer to a pointer to a value (the object)
2594 * METHOD is the method name
2595 * OFFSET is the offset within the value contents
2596 * STATIC_MEMFUNCP is set if the method is static
2597 * NUM_FNS is the number of overloaded instances
2598 * BASETYPE is set to the type of the base subobject that defines the method
2599 * BOFFSET is the offset of the base subobject which defines the method */
2602 value_find_oload_method_list (argp, method, offset, static_memfuncp, num_fns, basetype, boffset)
2606 int *static_memfuncp;
2608 struct type **basetype;
2613 t = check_typedef (VALUE_TYPE (*argp));
2615 /* code snarfed from value_struct_elt */
2616 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
2618 *argp = value_ind (*argp);
2619 /* Don't coerce fn pointer to fn and then back again! */
2620 if (TYPE_CODE (VALUE_TYPE (*argp)) != TYPE_CODE_FUNC)
2621 COERCE_ARRAY (*argp);
2622 t = check_typedef (VALUE_TYPE (*argp));
2625 if (TYPE_CODE (t) == TYPE_CODE_MEMBER)
2626 error ("Not implemented: member type in value_find_oload_lis");
2628 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2629 && TYPE_CODE (t) != TYPE_CODE_UNION)
2630 error ("Attempt to extract a component of a value that is not a struct or union");
2632 /* Assume it's not static, unless we see that it is. */
2633 if (static_memfuncp)
2634 *static_memfuncp = 0;
2636 return find_method_list (argp, method, 0, static_memfuncp, t, num_fns, basetype, boffset);
2640 /* Given an array of argument types (ARGTYPES) (which includes an
2641 entry for "this" in the case of C++ methods), the number of
2642 arguments NARGS, the NAME of a function whether it's a method or
2643 not (METHOD), and the degree of laxness (LAX) in conforming to
2644 overload resolution rules in ANSI C++, find the best function that
2645 matches on the argument types according to the overload resolution
2648 In the case of class methods, the parameter OBJ is an object value
2649 in which to search for overloaded methods.
2651 In the case of non-method functions, the parameter FSYM is a symbol
2652 corresponding to one of the overloaded functions.
2654 Return value is an integer: 0 -> good match, 10 -> debugger applied
2655 non-standard coercions, 100 -> incompatible.
2657 If a method is being searched for, VALP will hold the value.
2658 If a non-method is being searched for, SYMP will hold the symbol for it.
2660 If a method is being searched for, and it is a static method,
2661 then STATICP will point to a non-zero value.
2663 Note: This function does *not* check the value of
2664 overload_resolution. Caller must check it to see whether overload
2665 resolution is permitted.
2669 find_overload_match (arg_types, nargs, name, method, lax, obj, fsym, valp, symp, staticp)
2670 struct type **arg_types;
2676 struct symbol *fsym;
2678 struct symbol **symp;
2682 struct type **parm_types;
2683 int champ_nparms = 0;
2685 short oload_champ = -1; /* Index of best overloaded function */
2686 short oload_ambiguous = 0; /* Current ambiguity state for overload resolution */
2687 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs */
2688 short oload_ambig_champ = -1; /* 2nd contender for best match */
2689 short oload_non_standard = 0; /* did we have to use non-standard conversions? */
2690 short oload_incompatible = 0; /* are args supplied incompatible with any function? */
2692 struct badness_vector *bv; /* A measure of how good an overloaded instance is */
2693 struct badness_vector *oload_champ_bv = NULL; /* The measure for the current best match */
2695 value_ptr temp = obj;
2696 struct fn_field *fns_ptr = NULL; /* For methods, the list of overloaded methods */
2697 struct symbol **oload_syms = NULL; /* For non-methods, the list of overloaded function symbols */
2698 int num_fns = 0; /* Number of overloaded instances being considered */
2699 struct type *basetype = NULL;
2704 char *obj_type_name = NULL;
2705 char *func_name = NULL;
2707 /* Get the list of overloaded methods or functions */
2710 obj_type_name = TYPE_NAME (VALUE_TYPE (obj));
2711 /* Hack: evaluate_subexp_standard often passes in a pointer
2712 value rather than the object itself, so try again */
2713 if ((!obj_type_name || !*obj_type_name) &&
2714 (TYPE_CODE (VALUE_TYPE (obj)) == TYPE_CODE_PTR))
2715 obj_type_name = TYPE_NAME (TYPE_TARGET_TYPE (VALUE_TYPE (obj)));
2717 fns_ptr = value_find_oload_method_list (&temp, name, 0,
2720 &basetype, &boffset);
2721 if (!fns_ptr || !num_fns)
2722 error ("Couldn't find method %s%s%s",
2724 (obj_type_name && *obj_type_name) ? "::" : "",
2730 func_name = cplus_demangle (SYMBOL_NAME (fsym), DMGL_NO_OPTS);
2732 /* If the name is NULL this must be a C-style function.
2733 Just return the same symbol. */
2740 oload_syms = make_symbol_overload_list (fsym);
2741 while (oload_syms[++i])
2744 error ("Couldn't find function %s", func_name);
2747 oload_champ_bv = NULL;
2749 /* Consider each candidate in turn */
2750 for (ix = 0; ix < num_fns; ix++)
2752 /* Number of parameters for current candidate */
2753 nparms = method ? TYPE_NFIELDS (fns_ptr[ix].type)
2754 : TYPE_NFIELDS (SYMBOL_TYPE (oload_syms[ix]));
2756 /* Prepare array of parameter types */
2757 parm_types = (struct type **) xmalloc (nparms * (sizeof (struct type *)));
2758 for (jj = 0; jj < nparms; jj++)
2759 parm_types[jj] = method ? TYPE_FIELD_TYPE (fns_ptr[ix].type, jj)
2760 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms[ix]), jj);
2762 /* Compare parameter types to supplied argument types */
2763 bv = rank_function (parm_types, nparms, arg_types, nargs);
2765 if (!oload_champ_bv)
2767 oload_champ_bv = bv;
2769 champ_nparms = nparms;
2772 /* See whether current candidate is better or worse than previous best */
2773 switch (compare_badness (bv, oload_champ_bv))
2776 oload_ambiguous = 1; /* top two contenders are equally good */
2777 oload_ambig_champ = ix;
2780 oload_ambiguous = 2; /* incomparable top contenders */
2781 oload_ambig_champ = ix;
2784 oload_champ_bv = bv; /* new champion, record details */
2785 oload_ambiguous = 0;
2787 oload_ambig_champ = -1;
2788 champ_nparms = nparms;
2797 printf ("Overloaded method instance %s, # of parms %d\n", fns_ptr[ix].physname, nparms);
2799 printf ("Overloaded function instance %s # of parms %d\n", SYMBOL_DEMANGLED_NAME (oload_syms[ix]), nparms);
2800 for (jj = 0; jj <= nargs; jj++)
2801 printf ("...Badness @ %d : %d\n", jj, bv->rank[jj]);
2802 printf ("Overload resolution champion is %d, ambiguous? %d\n", oload_champ, oload_ambiguous);
2804 } /* end loop over all candidates */
2806 if (oload_ambiguous)
2809 error ("Cannot resolve overloaded method %s%s%s to unique instance; disambiguate by specifying function signature",
2811 (obj_type_name && *obj_type_name) ? "::" : "",
2814 error ("Cannot resolve overloaded function %s to unique instance; disambiguate by specifying function signature",
2818 /* Check how bad the best match is */
2819 for (ix = 1; ix <= nargs; ix++)
2821 switch (oload_champ_bv->rank[ix])
2824 oload_non_standard = 1; /* non-standard type conversions needed */
2827 oload_incompatible = 1; /* truly mismatched types */
2831 if (oload_incompatible)
2834 error ("Cannot resolve method %s%s%s to any overloaded instance",
2836 (obj_type_name && *obj_type_name) ? "::" : "",
2839 error ("Cannot resolve function %s to any overloaded instance",
2842 else if (oload_non_standard)
2845 warning ("Using non-standard conversion to match method %s%s%s to supplied arguments",
2847 (obj_type_name && *obj_type_name) ? "::" : "",
2850 warning ("Using non-standard conversion to match function %s to supplied arguments",
2856 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr, oload_champ))
2857 *valp = value_virtual_fn_field (&temp, fns_ptr, oload_champ, basetype, boffset);
2859 *valp = value_fn_field (&temp, fns_ptr, oload_champ, basetype, boffset);
2863 *symp = oload_syms[oload_champ];
2867 return oload_incompatible ? 100 : (oload_non_standard ? 10 : 0);
2870 /* C++: return 1 is NAME is a legitimate name for the destructor
2871 of type TYPE. If TYPE does not have a destructor, or
2872 if NAME is inappropriate for TYPE, an error is signaled. */
2874 destructor_name_p (name, type)
2876 const struct type *type;
2878 /* destructors are a special case. */
2882 char *dname = type_name_no_tag (type);
2883 char *cp = strchr (dname, '<');
2886 /* Do not compare the template part for template classes. */
2888 len = strlen (dname);
2891 if (strlen (name + 1) != len || !STREQN (dname, name + 1, len))
2892 error ("name of destructor must equal name of class");
2899 /* Helper function for check_field: Given TYPE, a structure/union,
2900 return 1 if the component named NAME from the ultimate
2901 target structure/union is defined, otherwise, return 0. */
2904 check_field_in (type, name)
2905 register struct type *type;
2910 for (i = TYPE_NFIELDS (type) - 1; i >= TYPE_N_BASECLASSES (type); i--)
2912 char *t_field_name = TYPE_FIELD_NAME (type, i);
2913 if (t_field_name && STREQ (t_field_name, name))
2917 /* C++: If it was not found as a data field, then try to
2918 return it as a pointer to a method. */
2920 /* Destructors are a special case. */
2921 if (destructor_name_p (name, type))
2923 int m_index, f_index;
2925 return get_destructor_fn_field (type, &m_index, &f_index);
2928 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; --i)
2930 if (STREQ (TYPE_FN_FIELDLIST_NAME (type, i), name))
2934 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2935 if (check_field_in (TYPE_BASECLASS (type, i), name))
2942 /* C++: Given ARG1, a value of type (pointer to a)* structure/union,
2943 return 1 if the component named NAME from the ultimate
2944 target structure/union is defined, otherwise, return 0. */
2947 check_field (arg1, name)
2948 register value_ptr arg1;
2951 register struct type *t;
2953 COERCE_ARRAY (arg1);
2955 t = VALUE_TYPE (arg1);
2957 /* Follow pointers until we get to a non-pointer. */
2962 if (TYPE_CODE (t) != TYPE_CODE_PTR && TYPE_CODE (t) != TYPE_CODE_REF)
2964 t = TYPE_TARGET_TYPE (t);
2967 if (TYPE_CODE (t) == TYPE_CODE_MEMBER)
2968 error ("not implemented: member type in check_field");
2970 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2971 && TYPE_CODE (t) != TYPE_CODE_UNION)
2972 error ("Internal error: `this' is not an aggregate");
2974 return check_field_in (t, name);
2977 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
2978 return the address of this member as a "pointer to member"
2979 type. If INTYPE is non-null, then it will be the type
2980 of the member we are looking for. This will help us resolve
2981 "pointers to member functions". This function is used
2982 to resolve user expressions of the form "DOMAIN::NAME". */
2985 value_struct_elt_for_reference (domain, offset, curtype, name, intype)
2986 struct type *domain, *curtype, *intype;
2990 register struct type *t = curtype;
2994 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2995 && TYPE_CODE (t) != TYPE_CODE_UNION)
2996 error ("Internal error: non-aggregate type to value_struct_elt_for_reference");
2998 for (i = TYPE_NFIELDS (t) - 1; i >= TYPE_N_BASECLASSES (t); i--)
3000 char *t_field_name = TYPE_FIELD_NAME (t, i);
3002 if (t_field_name && STREQ (t_field_name, name))
3004 if (TYPE_FIELD_STATIC (t, i))
3006 v = value_static_field (t, i);
3008 error ("Internal error: could not find static variable %s",
3012 if (TYPE_FIELD_PACKED (t, i))
3013 error ("pointers to bitfield members not allowed");
3015 return value_from_longest
3016 (lookup_reference_type (lookup_member_type (TYPE_FIELD_TYPE (t, i),
3018 offset + (LONGEST) (TYPE_FIELD_BITPOS (t, i) >> 3));
3022 /* C++: If it was not found as a data field, then try to
3023 return it as a pointer to a method. */
3025 /* Destructors are a special case. */
3026 if (destructor_name_p (name, t))
3028 error ("member pointers to destructors not implemented yet");
3031 /* Perform all necessary dereferencing. */
3032 while (intype && TYPE_CODE (intype) == TYPE_CODE_PTR)
3033 intype = TYPE_TARGET_TYPE (intype);
3035 for (i = TYPE_NFN_FIELDS (t) - 1; i >= 0; --i)
3037 char *t_field_name = TYPE_FN_FIELDLIST_NAME (t, i);
3038 char dem_opname[64];
3040 if (strncmp (t_field_name, "__", 2) == 0 ||
3041 strncmp (t_field_name, "op", 2) == 0 ||
3042 strncmp (t_field_name, "type", 4) == 0)
3044 if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI))
3045 t_field_name = dem_opname;
3046 else if (cplus_demangle_opname (t_field_name, dem_opname, 0))
3047 t_field_name = dem_opname;
3049 if (t_field_name && STREQ (t_field_name, name))
3051 int j = TYPE_FN_FIELDLIST_LENGTH (t, i);
3052 struct fn_field *f = TYPE_FN_FIELDLIST1 (t, i);
3054 if (intype == 0 && j > 1)
3055 error ("non-unique member `%s' requires type instantiation", name);
3059 if (TYPE_FN_FIELD_TYPE (f, j) == intype)
3062 error ("no member function matches that type instantiation");
3067 if (TYPE_FN_FIELD_STUB (f, j))
3068 check_stub_method (t, i, j);
3069 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
3071 return value_from_longest
3072 (lookup_reference_type
3073 (lookup_member_type (TYPE_FN_FIELD_TYPE (f, j),
3075 (LONGEST) METHOD_PTR_FROM_VOFFSET (TYPE_FN_FIELD_VOFFSET (f, j)));
3079 struct symbol *s = lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j),
3080 0, VAR_NAMESPACE, 0, NULL);
3087 v = read_var_value (s, 0);
3089 VALUE_TYPE (v) = lookup_reference_type
3090 (lookup_member_type (TYPE_FN_FIELD_TYPE (f, j),
3098 for (i = TYPE_N_BASECLASSES (t) - 1; i >= 0; i--)
3103 if (BASETYPE_VIA_VIRTUAL (t, i))
3106 base_offset = TYPE_BASECLASS_BITPOS (t, i) / 8;
3107 v = value_struct_elt_for_reference (domain,
3108 offset + base_offset,
3109 TYPE_BASECLASS (t, i),
3119 /* Find the real run-time type of a value using RTTI.
3120 * V is a pointer to the value.
3121 * A pointer to the struct type entry of the run-time type
3123 * FULL is a flag that is set only if the value V includes
3124 * the entire contents of an object of the RTTI type.
3125 * TOP is the offset to the top of the enclosing object of
3126 * the real run-time type. This offset may be for the embedded
3127 * object, or for the enclosing object of V.
3128 * USING_ENC is the flag that distinguishes the two cases.
3129 * If it is 1, then the offset is for the enclosing object,
3130 * otherwise for the embedded object.
3132 * This currently works only for RTTI information generated
3133 * by the HP ANSI C++ compiler (aCC). g++ today (1997-06-10)
3134 * does not appear to support RTTI. This function returns a
3135 * NULL value for objects in the g++ runtime model. */
3138 value_rtti_type (v, full, top, using_enc)
3144 struct type *known_type;
3145 struct type *rtti_type;
3148 int using_enclosing = 0;
3149 long top_offset = 0;
3150 char rtti_type_name[256];
3159 /* Get declared type */
3160 known_type = VALUE_TYPE (v);
3161 CHECK_TYPEDEF (known_type);
3162 /* RTTI works only or class objects */
3163 if (TYPE_CODE (known_type) != TYPE_CODE_CLASS)
3166 /* If neither the declared type nor the enclosing type of the
3167 * value structure has a HP ANSI C++ style virtual table,
3168 * we can't do anything. */
3169 if (!TYPE_HAS_VTABLE (known_type))
3171 known_type = VALUE_ENCLOSING_TYPE (v);
3172 CHECK_TYPEDEF (known_type);
3173 if ((TYPE_CODE (known_type) != TYPE_CODE_CLASS) ||
3174 !TYPE_HAS_VTABLE (known_type))
3175 return NULL; /* No RTTI, or not HP-compiled types */
3176 CHECK_TYPEDEF (known_type);
3177 using_enclosing = 1;
3180 if (using_enclosing && using_enc)
3183 /* First get the virtual table address */
3184 coreptr = *(CORE_ADDR *) ((VALUE_CONTENTS_ALL (v))
3186 + (using_enclosing ? 0 : VALUE_EMBEDDED_OFFSET (v)));
3188 return NULL; /* return silently -- maybe called on gdb-generated value */
3190 /* Fetch the top offset of the object */
3191 /* FIXME possible 32x64 problem with pointer size & arithmetic */
3192 vp = value_at (builtin_type_int,
3193 coreptr + 4 * HP_ACC_TOP_OFFSET_OFFSET,
3194 VALUE_BFD_SECTION (v));
3195 top_offset = value_as_long (vp);
3199 /* Fetch the typeinfo pointer */
3200 /* FIXME possible 32x64 problem with pointer size & arithmetic */
3201 vp = value_at (builtin_type_int, coreptr + 4 * HP_ACC_TYPEINFO_OFFSET, VALUE_BFD_SECTION (v));
3202 /* Indirect through the typeinfo pointer and retrieve the pointer
3203 * to the string name */
3204 coreptr = *(CORE_ADDR *) (VALUE_CONTENTS (vp));
3206 error ("Retrieved null typeinfo pointer in trying to determine run-time type");
3207 vp = value_at (builtin_type_int, coreptr + 4, VALUE_BFD_SECTION (v)); /* 4 -> offset of name field */
3208 /* FIXME possible 32x64 problem */
3210 coreptr = *(CORE_ADDR *) (VALUE_CONTENTS (vp));
3212 read_memory_string (coreptr, rtti_type_name, 256);
3214 if (strlen (rtti_type_name) == 0)
3215 error ("Retrieved null type name from typeinfo");
3217 /* search for type */
3218 rtti_type = lookup_typename (rtti_type_name, (struct block *) 0, 1);
3221 error ("Could not find run-time type: invalid type name %s in typeinfo??", rtti_type_name);
3222 CHECK_TYPEDEF (rtti_type);
3224 #if 0 /* debugging */
3225 printf ("RTTI type name %s, tag %s, full? %d\n", TYPE_NAME (rtti_type), TYPE_TAG_NAME (rtti_type), full ? *full : -1);
3228 /* Check whether we have the entire object */
3229 if (full /* Non-null pointer passed */
3232 /* Either we checked on the whole object in hand and found the
3233 top offset to be zero */
3234 (((top_offset == 0) &&
3236 TYPE_LENGTH (known_type) == TYPE_LENGTH (rtti_type))
3238 /* Or we checked on the embedded object and top offset was the
3239 same as the embedded offset */
3240 ((top_offset == VALUE_EMBEDDED_OFFSET (v)) &&
3242 TYPE_LENGTH (VALUE_ENCLOSING_TYPE (v)) == TYPE_LENGTH (rtti_type))))
3249 /* Given a pointer value V, find the real (RTTI) type
3250 of the object it points to.
3251 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
3252 and refer to the values computed for the object pointed to. */
3255 value_rtti_target_type (v, full, top, using_enc)
3263 target = value_ind (v);
3265 return value_rtti_type (target, full, top, using_enc);
3268 /* Given a value pointed to by ARGP, check its real run-time type, and
3269 if that is different from the enclosing type, create a new value
3270 using the real run-time type as the enclosing type (and of the same
3271 type as ARGP) and return it, with the embedded offset adjusted to
3272 be the correct offset to the enclosed object
3273 RTYPE is the type, and XFULL, XTOP, and XUSING_ENC are the other
3274 parameters, computed by value_rtti_type(). If these are available,
3275 they can be supplied and a second call to value_rtti_type() is avoided.
3276 (Pass RTYPE == NULL if they're not available */
3279 value_full_object (argp, rtype, xfull, xtop, xusing_enc)
3287 struct type *real_type;
3298 using_enc = xusing_enc;
3301 real_type = value_rtti_type (argp, &full, &top, &using_enc);
3303 /* If no RTTI data, or if object is already complete, do nothing */
3304 if (!real_type || real_type == VALUE_ENCLOSING_TYPE (argp))
3307 /* If we have the full object, but for some reason the enclosing
3308 type is wrong, set it *//* pai: FIXME -- sounds iffy */
3311 VALUE_ENCLOSING_TYPE (argp) = real_type;
3315 /* Check if object is in memory */
3316 if (VALUE_LVAL (argp) != lval_memory)
3318 warning ("Couldn't retrieve complete object of RTTI type %s; object may be in register(s).", TYPE_NAME (real_type));
3323 /* All other cases -- retrieve the complete object */
3324 /* Go back by the computed top_offset from the beginning of the object,
3325 adjusting for the embedded offset of argp if that's what value_rtti_type
3326 used for its computation. */
3327 new_val = value_at_lazy (real_type, VALUE_ADDRESS (argp) - top +
3328 (using_enc ? 0 : VALUE_EMBEDDED_OFFSET (argp)),
3329 VALUE_BFD_SECTION (argp));
3330 VALUE_TYPE (new_val) = VALUE_TYPE (argp);
3331 VALUE_EMBEDDED_OFFSET (new_val) = using_enc ? top + VALUE_EMBEDDED_OFFSET (argp) : top;
3338 /* C++: return the value of the class instance variable, if one exists.
3339 Flag COMPLAIN signals an error if the request is made in an
3340 inappropriate context. */
3343 value_of_this (complain)
3346 struct symbol *func, *sym;
3349 static const char funny_this[] = "this";
3352 if (selected_frame == 0)
3355 error ("no frame selected");
3360 func = get_frame_function (selected_frame);
3364 error ("no `this' in nameless context");
3369 b = SYMBOL_BLOCK_VALUE (func);
3370 i = BLOCK_NSYMS (b);
3374 error ("no args, no `this'");
3379 /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER
3380 symbol instead of the LOC_ARG one (if both exist). */
3381 sym = lookup_block_symbol (b, funny_this, VAR_NAMESPACE);
3385 error ("current stack frame not in method");
3390 this = read_var_value (sym, selected_frame);
3391 if (this == 0 && complain)
3392 error ("`this' argument at unknown address");
3396 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH elements
3397 long, starting at LOWBOUND. The result has the same lower bound as
3398 the original ARRAY. */
3401 value_slice (array, lowbound, length)
3403 int lowbound, length;
3405 struct type *slice_range_type, *slice_type, *range_type;
3406 LONGEST lowerbound, upperbound, offset;
3408 struct type *array_type;
3409 array_type = check_typedef (VALUE_TYPE (array));
3410 COERCE_VARYING_ARRAY (array, array_type);
3411 if (TYPE_CODE (array_type) != TYPE_CODE_ARRAY
3412 && TYPE_CODE (array_type) != TYPE_CODE_STRING
3413 && TYPE_CODE (array_type) != TYPE_CODE_BITSTRING)
3414 error ("cannot take slice of non-array");
3415 range_type = TYPE_INDEX_TYPE (array_type);
3416 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
3417 error ("slice from bad array or bitstring");
3418 if (lowbound < lowerbound || length < 0
3419 || lowbound + length - 1 > upperbound
3420 /* Chill allows zero-length strings but not arrays. */
3421 || (current_language->la_language == language_chill
3422 && length == 0 && TYPE_CODE (array_type) == TYPE_CODE_ARRAY))
3423 error ("slice out of range");
3424 /* FIXME-type-allocation: need a way to free this type when we are
3426 slice_range_type = create_range_type ((struct type *) NULL,
3427 TYPE_TARGET_TYPE (range_type),
3428 lowbound, lowbound + length - 1);
3429 if (TYPE_CODE (array_type) == TYPE_CODE_BITSTRING)
3432 slice_type = create_set_type ((struct type *) NULL, slice_range_type);
3433 TYPE_CODE (slice_type) = TYPE_CODE_BITSTRING;
3434 slice = value_zero (slice_type, not_lval);
3435 for (i = 0; i < length; i++)
3437 int element = value_bit_index (array_type,
3438 VALUE_CONTENTS (array),
3441 error ("internal error accessing bitstring");
3442 else if (element > 0)
3444 int j = i % TARGET_CHAR_BIT;
3445 if (BITS_BIG_ENDIAN)
3446 j = TARGET_CHAR_BIT - 1 - j;
3447 VALUE_CONTENTS_RAW (slice)[i / TARGET_CHAR_BIT] |= (1 << j);
3450 /* We should set the address, bitssize, and bitspos, so the clice
3451 can be used on the LHS, but that may require extensions to
3452 value_assign. For now, just leave as a non_lval. FIXME. */
3456 struct type *element_type = TYPE_TARGET_TYPE (array_type);
3458 = (lowbound - lowerbound) * TYPE_LENGTH (check_typedef (element_type));
3459 slice_type = create_array_type ((struct type *) NULL, element_type,
3461 TYPE_CODE (slice_type) = TYPE_CODE (array_type);
3462 slice = allocate_value (slice_type);
3463 if (VALUE_LAZY (array))
3464 VALUE_LAZY (slice) = 1;
3466 memcpy (VALUE_CONTENTS (slice), VALUE_CONTENTS (array) + offset,
3467 TYPE_LENGTH (slice_type));
3468 if (VALUE_LVAL (array) == lval_internalvar)
3469 VALUE_LVAL (slice) = lval_internalvar_component;
3471 VALUE_LVAL (slice) = VALUE_LVAL (array);
3472 VALUE_ADDRESS (slice) = VALUE_ADDRESS (array);
3473 VALUE_OFFSET (slice) = VALUE_OFFSET (array) + offset;
3478 /* Assuming chill_varying_type (VARRAY) is true, return an equivalent
3479 value as a fixed-length array. */
3482 varying_to_slice (varray)
3485 struct type *vtype = check_typedef (VALUE_TYPE (varray));
3486 LONGEST length = unpack_long (TYPE_FIELD_TYPE (vtype, 0),
3487 VALUE_CONTENTS (varray)
3488 + TYPE_FIELD_BITPOS (vtype, 0) / 8);
3489 return value_slice (value_primitive_field (varray, 0, 1, vtype), 0, length);
3492 /* Create a value for a FORTRAN complex number. Currently most of
3493 the time values are coerced to COMPLEX*16 (i.e. a complex number
3494 composed of 2 doubles. This really should be a smarter routine
3495 that figures out precision inteligently as opposed to assuming
3496 doubles. FIXME: fmb */
3499 value_literal_complex (arg1, arg2, type)
3504 register value_ptr val;
3505 struct type *real_type = TYPE_TARGET_TYPE (type);
3507 val = allocate_value (type);
3508 arg1 = value_cast (real_type, arg1);
3509 arg2 = value_cast (real_type, arg2);
3511 memcpy (VALUE_CONTENTS_RAW (val),
3512 VALUE_CONTENTS (arg1), TYPE_LENGTH (real_type));
3513 memcpy (VALUE_CONTENTS_RAW (val) + TYPE_LENGTH (real_type),
3514 VALUE_CONTENTS (arg2), TYPE_LENGTH (real_type));
3518 /* Cast a value into the appropriate complex data type. */
3521 cast_into_complex (type, val)
3523 register value_ptr val;
3525 struct type *real_type = TYPE_TARGET_TYPE (type);
3526 if (TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_COMPLEX)
3528 struct type *val_real_type = TYPE_TARGET_TYPE (VALUE_TYPE (val));
3529 value_ptr re_val = allocate_value (val_real_type);
3530 value_ptr im_val = allocate_value (val_real_type);
3532 memcpy (VALUE_CONTENTS_RAW (re_val),
3533 VALUE_CONTENTS (val), TYPE_LENGTH (val_real_type));
3534 memcpy (VALUE_CONTENTS_RAW (im_val),
3535 VALUE_CONTENTS (val) + TYPE_LENGTH (val_real_type),
3536 TYPE_LENGTH (val_real_type));
3538 return value_literal_complex (re_val, im_val, type);
3540 else if (TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_FLT
3541 || TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_INT)
3542 return value_literal_complex (val, value_zero (real_type, not_lval), type);
3544 error ("cannot cast non-number to complex");
3548 _initialize_valops ()
3552 (add_set_cmd ("abandon", class_support, var_boolean, (char *) &auto_abandon,
3553 "Set automatic abandonment of expressions upon failure.",
3559 (add_set_cmd ("overload-resolution", class_support, var_boolean, (char *) &overload_resolution,
3560 "Set overload resolution in evaluating C++ functions.",
3563 overload_resolution = 1;