1 /* Perform non-arithmetic operations on values, for GDB.
2 Copyright 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994,
3 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002
4 Free Software Foundation, Inc.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
38 #include "gdb_string.h"
40 /* Flag indicating HP compilers were used; needed to correctly handle some
41 value operations with HP aCC code/runtime. */
42 extern int hp_som_som_object_present;
44 extern int overload_debug;
45 /* Local functions. */
47 static int typecmp (int staticp, struct type *t1[], struct value *t2[]);
49 static CORE_ADDR find_function_addr (struct value *, struct type **);
50 static struct value *value_arg_coerce (struct value *, struct type *, int);
53 static CORE_ADDR value_push (CORE_ADDR, struct value *);
55 static struct value *search_struct_field (char *, struct value *, int,
58 static struct value *search_struct_method (char *, struct value **,
60 int, int *, struct type *);
62 static int check_field_in (struct type *, const char *);
64 static CORE_ADDR allocate_space_in_inferior (int);
66 static struct value *cast_into_complex (struct type *, struct value *);
68 static struct fn_field *find_method_list (struct value ** argp, char *method,
69 int offset, int *static_memfuncp,
70 struct type *type, int *num_fns,
71 struct type **basetype,
74 void _initialize_valops (void);
76 /* Flag for whether we want to abandon failed expression evals by default. */
79 static int auto_abandon = 0;
82 int overload_resolution = 0;
84 /* This boolean tells what gdb should do if a signal is received while in
85 a function called from gdb (call dummy). If set, gdb unwinds the stack
86 and restore the context to what as it was before the call.
87 The default is to stop in the frame where the signal was received. */
89 int unwind_on_signal_p = 0;
93 /* Find the address of function name NAME in the inferior. */
96 find_function_in_inferior (char *name)
98 register struct symbol *sym;
99 sym = lookup_symbol (name, 0, VAR_NAMESPACE, 0, NULL);
102 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
104 error ("\"%s\" exists in this program but is not a function.",
107 return value_of_variable (sym, NULL);
111 struct minimal_symbol *msymbol = lookup_minimal_symbol (name, NULL, NULL);
116 type = lookup_pointer_type (builtin_type_char);
117 type = lookup_function_type (type);
118 type = lookup_pointer_type (type);
119 maddr = SYMBOL_VALUE_ADDRESS (msymbol);
120 return value_from_pointer (type, maddr);
124 if (!target_has_execution)
125 error ("evaluation of this expression requires the target program to be active");
127 error ("evaluation of this expression requires the program to have a function \"%s\".", name);
132 /* Allocate NBYTES of space in the inferior using the inferior's malloc
133 and return a value that is a pointer to the allocated space. */
136 value_allocate_space_in_inferior (int len)
138 struct value *blocklen;
139 struct value *val = find_function_in_inferior ("malloc");
141 blocklen = value_from_longest (builtin_type_int, (LONGEST) len);
142 val = call_function_by_hand (val, 1, &blocklen);
143 if (value_logical_not (val))
145 if (!target_has_execution)
146 error ("No memory available to program now: you need to start the target first");
148 error ("No memory available to program: call to malloc failed");
154 allocate_space_in_inferior (int len)
156 return value_as_long (value_allocate_space_in_inferior (len));
159 /* Cast value ARG2 to type TYPE and return as a value.
160 More general than a C cast: accepts any two types of the same length,
161 and if ARG2 is an lvalue it can be cast into anything at all. */
162 /* In C++, casts may change pointer or object representations. */
165 value_cast (struct type *type, struct value *arg2)
167 register enum type_code code1;
168 register enum type_code code2;
172 int convert_to_boolean = 0;
174 if (VALUE_TYPE (arg2) == type)
177 CHECK_TYPEDEF (type);
178 code1 = TYPE_CODE (type);
180 type2 = check_typedef (VALUE_TYPE (arg2));
182 /* A cast to an undetermined-length array_type, such as (TYPE [])OBJECT,
183 is treated like a cast to (TYPE [N])OBJECT,
184 where N is sizeof(OBJECT)/sizeof(TYPE). */
185 if (code1 == TYPE_CODE_ARRAY)
187 struct type *element_type = TYPE_TARGET_TYPE (type);
188 unsigned element_length = TYPE_LENGTH (check_typedef (element_type));
189 if (element_length > 0
190 && TYPE_ARRAY_UPPER_BOUND_TYPE (type) == BOUND_CANNOT_BE_DETERMINED)
192 struct type *range_type = TYPE_INDEX_TYPE (type);
193 int val_length = TYPE_LENGTH (type2);
194 LONGEST low_bound, high_bound, new_length;
195 if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0)
196 low_bound = 0, high_bound = 0;
197 new_length = val_length / element_length;
198 if (val_length % element_length != 0)
199 warning ("array element type size does not divide object size in cast");
200 /* FIXME-type-allocation: need a way to free this type when we are
202 range_type = create_range_type ((struct type *) NULL,
203 TYPE_TARGET_TYPE (range_type),
205 new_length + low_bound - 1);
206 VALUE_TYPE (arg2) = create_array_type ((struct type *) NULL,
207 element_type, range_type);
212 if (current_language->c_style_arrays
213 && TYPE_CODE (type2) == TYPE_CODE_ARRAY)
214 arg2 = value_coerce_array (arg2);
216 if (TYPE_CODE (type2) == TYPE_CODE_FUNC)
217 arg2 = value_coerce_function (arg2);
219 type2 = check_typedef (VALUE_TYPE (arg2));
220 COERCE_VARYING_ARRAY (arg2, type2);
221 code2 = TYPE_CODE (type2);
223 if (code1 == TYPE_CODE_COMPLEX)
224 return cast_into_complex (type, arg2);
225 if (code1 == TYPE_CODE_BOOL)
227 code1 = TYPE_CODE_INT;
228 convert_to_boolean = 1;
230 if (code1 == TYPE_CODE_CHAR)
231 code1 = TYPE_CODE_INT;
232 if (code2 == TYPE_CODE_BOOL || code2 == TYPE_CODE_CHAR)
233 code2 = TYPE_CODE_INT;
235 scalar = (code2 == TYPE_CODE_INT || code2 == TYPE_CODE_FLT
236 || code2 == TYPE_CODE_ENUM || code2 == TYPE_CODE_RANGE);
238 if (code1 == TYPE_CODE_STRUCT
239 && code2 == TYPE_CODE_STRUCT
240 && TYPE_NAME (type) != 0)
242 /* Look in the type of the source to see if it contains the
243 type of the target as a superclass. If so, we'll need to
244 offset the object in addition to changing its type. */
245 struct value *v = search_struct_field (type_name_no_tag (type),
249 VALUE_TYPE (v) = type;
253 if (code1 == TYPE_CODE_FLT && scalar)
254 return value_from_double (type, value_as_double (arg2));
255 else if ((code1 == TYPE_CODE_INT || code1 == TYPE_CODE_ENUM
256 || code1 == TYPE_CODE_RANGE)
257 && (scalar || code2 == TYPE_CODE_PTR))
261 if (hp_som_som_object_present && /* if target compiled by HP aCC */
262 (code2 == TYPE_CODE_PTR))
265 struct value *retvalp;
267 switch (TYPE_CODE (TYPE_TARGET_TYPE (type2)))
269 /* With HP aCC, pointers to data members have a bias */
270 case TYPE_CODE_MEMBER:
271 retvalp = value_from_longest (type, value_as_long (arg2));
272 /* force evaluation */
273 ptr = (unsigned int *) VALUE_CONTENTS (retvalp);
274 *ptr &= ~0x20000000; /* zap 29th bit to remove bias */
277 /* While pointers to methods don't really point to a function */
278 case TYPE_CODE_METHOD:
279 error ("Pointers to methods not supported with HP aCC");
282 break; /* fall out and go to normal handling */
286 /* When we cast pointers to integers, we mustn't use
287 POINTER_TO_ADDRESS to find the address the pointer
288 represents, as value_as_long would. GDB should evaluate
289 expressions just as the compiler would --- and the compiler
290 sees a cast as a simple reinterpretation of the pointer's
292 if (code2 == TYPE_CODE_PTR)
293 longest = extract_unsigned_integer (VALUE_CONTENTS (arg2),
294 TYPE_LENGTH (type2));
296 longest = value_as_long (arg2);
297 return value_from_longest (type, convert_to_boolean ?
298 (LONGEST) (longest ? 1 : 0) : longest);
300 else if (code1 == TYPE_CODE_PTR && (code2 == TYPE_CODE_INT ||
301 code2 == TYPE_CODE_ENUM ||
302 code2 == TYPE_CODE_RANGE))
304 /* TYPE_LENGTH (type) is the length of a pointer, but we really
305 want the length of an address! -- we are really dealing with
306 addresses (i.e., gdb representations) not pointers (i.e.,
307 target representations) here.
309 This allows things like "print *(int *)0x01000234" to work
310 without printing a misleading message -- which would
311 otherwise occur when dealing with a target having two byte
312 pointers and four byte addresses. */
314 int addr_bit = TARGET_ADDR_BIT;
316 LONGEST longest = value_as_long (arg2);
317 if (addr_bit < sizeof (LONGEST) * HOST_CHAR_BIT)
319 if (longest >= ((LONGEST) 1 << addr_bit)
320 || longest <= -((LONGEST) 1 << addr_bit))
321 warning ("value truncated");
323 return value_from_longest (type, longest);
325 else if (TYPE_LENGTH (type) == TYPE_LENGTH (type2))
327 if (code1 == TYPE_CODE_PTR && code2 == TYPE_CODE_PTR)
329 struct type *t1 = check_typedef (TYPE_TARGET_TYPE (type));
330 struct type *t2 = check_typedef (TYPE_TARGET_TYPE (type2));
331 if (TYPE_CODE (t1) == TYPE_CODE_STRUCT
332 && TYPE_CODE (t2) == TYPE_CODE_STRUCT
333 && !value_logical_not (arg2))
337 /* Look in the type of the source to see if it contains the
338 type of the target as a superclass. If so, we'll need to
339 offset the pointer rather than just change its type. */
340 if (TYPE_NAME (t1) != NULL)
342 v = search_struct_field (type_name_no_tag (t1),
343 value_ind (arg2), 0, t2, 1);
347 VALUE_TYPE (v) = type;
352 /* Look in the type of the target to see if it contains the
353 type of the source as a superclass. If so, we'll need to
354 offset the pointer rather than just change its type.
355 FIXME: This fails silently with virtual inheritance. */
356 if (TYPE_NAME (t2) != NULL)
358 v = search_struct_field (type_name_no_tag (t2),
359 value_zero (t1, not_lval), 0, t1, 1);
362 struct value *v2 = value_ind (arg2);
363 VALUE_ADDRESS (v2) -= VALUE_ADDRESS (v)
366 /* JYG: adjust the new pointer value and
368 v2->aligner.contents[0] -= VALUE_EMBEDDED_OFFSET (v);
369 VALUE_EMBEDDED_OFFSET (v2) = 0;
371 v2 = value_addr (v2);
372 VALUE_TYPE (v2) = type;
377 /* No superclass found, just fall through to change ptr type. */
379 VALUE_TYPE (arg2) = type;
380 arg2 = value_change_enclosing_type (arg2, type);
381 VALUE_POINTED_TO_OFFSET (arg2) = 0; /* pai: chk_val */
384 else if (chill_varying_type (type))
386 struct type *range1, *range2, *eltype1, *eltype2;
389 LONGEST low_bound, high_bound;
390 char *valaddr, *valaddr_data;
391 /* For lint warning about eltype2 possibly uninitialized: */
393 if (code2 == TYPE_CODE_BITSTRING)
394 error ("not implemented: converting bitstring to varying type");
395 if ((code2 != TYPE_CODE_ARRAY && code2 != TYPE_CODE_STRING)
396 || (eltype1 = check_typedef (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, 1))),
397 eltype2 = check_typedef (TYPE_TARGET_TYPE (type2)),
398 (TYPE_LENGTH (eltype1) != TYPE_LENGTH (eltype2)
399 /* || TYPE_CODE (eltype1) != TYPE_CODE (eltype2) */ )))
400 error ("Invalid conversion to varying type");
401 range1 = TYPE_FIELD_TYPE (TYPE_FIELD_TYPE (type, 1), 0);
402 range2 = TYPE_FIELD_TYPE (type2, 0);
403 if (get_discrete_bounds (range1, &low_bound, &high_bound) < 0)
406 count1 = high_bound - low_bound + 1;
407 if (get_discrete_bounds (range2, &low_bound, &high_bound) < 0)
408 count1 = -1, count2 = 0; /* To force error before */
410 count2 = high_bound - low_bound + 1;
412 error ("target varying type is too small");
413 val = allocate_value (type);
414 valaddr = VALUE_CONTENTS_RAW (val);
415 valaddr_data = valaddr + TYPE_FIELD_BITPOS (type, 1) / 8;
416 /* Set val's __var_length field to count2. */
417 store_signed_integer (valaddr, TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0)),
419 /* Set the __var_data field to count2 elements copied from arg2. */
420 memcpy (valaddr_data, VALUE_CONTENTS (arg2),
421 count2 * TYPE_LENGTH (eltype2));
422 /* Zero the rest of the __var_data field of val. */
423 memset (valaddr_data + count2 * TYPE_LENGTH (eltype2), '\0',
424 (count1 - count2) * TYPE_LENGTH (eltype2));
427 else if (VALUE_LVAL (arg2) == lval_memory)
429 return value_at_lazy (type, VALUE_ADDRESS (arg2) + VALUE_OFFSET (arg2),
430 VALUE_BFD_SECTION (arg2));
432 else if (code1 == TYPE_CODE_VOID)
434 return value_zero (builtin_type_void, not_lval);
438 error ("Invalid cast.");
443 /* Create a value of type TYPE that is zero, and return it. */
446 value_zero (struct type *type, enum lval_type lv)
448 struct value *val = allocate_value (type);
450 memset (VALUE_CONTENTS (val), 0, TYPE_LENGTH (check_typedef (type)));
451 VALUE_LVAL (val) = lv;
456 /* Return a value with type TYPE located at ADDR.
458 Call value_at only if the data needs to be fetched immediately;
459 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
460 value_at_lazy instead. value_at_lazy simply records the address of
461 the data and sets the lazy-evaluation-required flag. The lazy flag
462 is tested in the VALUE_CONTENTS macro, which is used if and when
463 the contents are actually required.
465 Note: value_at does *NOT* handle embedded offsets; perform such
466 adjustments before or after calling it. */
469 value_at (struct type *type, CORE_ADDR addr, asection *sect)
473 if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
474 error ("Attempt to dereference a generic pointer.");
476 val = allocate_value (type);
478 read_memory (addr, VALUE_CONTENTS_ALL_RAW (val), TYPE_LENGTH (type));
480 VALUE_LVAL (val) = lval_memory;
481 VALUE_ADDRESS (val) = addr;
482 VALUE_BFD_SECTION (val) = sect;
487 /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
490 value_at_lazy (struct type *type, CORE_ADDR addr, asection *sect)
494 if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
495 error ("Attempt to dereference a generic pointer.");
497 val = allocate_value (type);
499 VALUE_LVAL (val) = lval_memory;
500 VALUE_ADDRESS (val) = addr;
501 VALUE_LAZY (val) = 1;
502 VALUE_BFD_SECTION (val) = sect;
507 /* Called only from the VALUE_CONTENTS and VALUE_CONTENTS_ALL macros,
508 if the current data for a variable needs to be loaded into
509 VALUE_CONTENTS(VAL). Fetches the data from the user's process, and
510 clears the lazy flag to indicate that the data in the buffer is valid.
512 If the value is zero-length, we avoid calling read_memory, which would
513 abort. We mark the value as fetched anyway -- all 0 bytes of it.
515 This function returns a value because it is used in the VALUE_CONTENTS
516 macro as part of an expression, where a void would not work. The
520 value_fetch_lazy (struct value *val)
522 CORE_ADDR addr = VALUE_ADDRESS (val) + VALUE_OFFSET (val);
523 int length = TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val));
525 struct type *type = VALUE_TYPE (val);
527 read_memory (addr, VALUE_CONTENTS_ALL_RAW (val), length);
529 VALUE_LAZY (val) = 0;
534 /* Store the contents of FROMVAL into the location of TOVAL.
535 Return a new value with the location of TOVAL and contents of FROMVAL. */
538 value_assign (struct value *toval, struct value *fromval)
540 register struct type *type;
542 char *raw_buffer = (char*) alloca (MAX_REGISTER_RAW_SIZE);
545 if (!toval->modifiable)
546 error ("Left operand of assignment is not a modifiable lvalue.");
550 type = VALUE_TYPE (toval);
551 if (VALUE_LVAL (toval) != lval_internalvar)
552 fromval = value_cast (type, fromval);
554 COERCE_ARRAY (fromval);
555 CHECK_TYPEDEF (type);
557 /* If TOVAL is a special machine register requiring conversion
558 of program values to a special raw format,
559 convert FROMVAL's contents now, with result in `raw_buffer',
560 and set USE_BUFFER to the number of bytes to write. */
562 if (VALUE_REGNO (toval) >= 0)
564 int regno = VALUE_REGNO (toval);
565 if (REGISTER_CONVERTIBLE (regno))
567 struct type *fromtype = check_typedef (VALUE_TYPE (fromval));
568 REGISTER_CONVERT_TO_RAW (fromtype, regno,
569 VALUE_CONTENTS (fromval), raw_buffer);
570 use_buffer = REGISTER_RAW_SIZE (regno);
574 switch (VALUE_LVAL (toval))
576 case lval_internalvar:
577 set_internalvar (VALUE_INTERNALVAR (toval), fromval);
578 val = value_copy (VALUE_INTERNALVAR (toval)->value);
579 val = value_change_enclosing_type (val, VALUE_ENCLOSING_TYPE (fromval));
580 VALUE_EMBEDDED_OFFSET (val) = VALUE_EMBEDDED_OFFSET (fromval);
581 VALUE_POINTED_TO_OFFSET (val) = VALUE_POINTED_TO_OFFSET (fromval);
584 case lval_internalvar_component:
585 set_internalvar_component (VALUE_INTERNALVAR (toval),
586 VALUE_OFFSET (toval),
587 VALUE_BITPOS (toval),
588 VALUE_BITSIZE (toval),
595 CORE_ADDR changed_addr;
598 if (VALUE_BITSIZE (toval))
600 char buffer[sizeof (LONGEST)];
601 /* We assume that the argument to read_memory is in units of
602 host chars. FIXME: Is that correct? */
603 changed_len = (VALUE_BITPOS (toval)
604 + VALUE_BITSIZE (toval)
608 if (changed_len > (int) sizeof (LONGEST))
609 error ("Can't handle bitfields which don't fit in a %d bit word.",
610 sizeof (LONGEST) * HOST_CHAR_BIT);
612 read_memory (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
613 buffer, changed_len);
614 modify_field (buffer, value_as_long (fromval),
615 VALUE_BITPOS (toval), VALUE_BITSIZE (toval));
616 changed_addr = VALUE_ADDRESS (toval) + VALUE_OFFSET (toval);
617 dest_buffer = buffer;
621 changed_addr = VALUE_ADDRESS (toval) + VALUE_OFFSET (toval);
622 changed_len = use_buffer;
623 dest_buffer = raw_buffer;
627 changed_addr = VALUE_ADDRESS (toval) + VALUE_OFFSET (toval);
628 changed_len = TYPE_LENGTH (type);
629 dest_buffer = VALUE_CONTENTS (fromval);
632 write_memory (changed_addr, dest_buffer, changed_len);
633 if (memory_changed_hook)
634 memory_changed_hook (changed_addr, changed_len);
639 if (VALUE_BITSIZE (toval))
641 char buffer[sizeof (LONGEST)];
643 REGISTER_RAW_SIZE (VALUE_REGNO (toval)) - VALUE_OFFSET (toval);
645 if (len > (int) sizeof (LONGEST))
646 error ("Can't handle bitfields in registers larger than %d bits.",
647 sizeof (LONGEST) * HOST_CHAR_BIT);
649 if (VALUE_BITPOS (toval) + VALUE_BITSIZE (toval)
650 > len * HOST_CHAR_BIT)
651 /* Getting this right would involve being very careful about
653 error ("Can't assign to bitfields that cross register "
656 read_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
658 modify_field (buffer, value_as_long (fromval),
659 VALUE_BITPOS (toval), VALUE_BITSIZE (toval));
660 write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
664 write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
665 raw_buffer, use_buffer);
668 /* Do any conversion necessary when storing this type to more
669 than one register. */
670 #ifdef REGISTER_CONVERT_FROM_TYPE
671 memcpy (raw_buffer, VALUE_CONTENTS (fromval), TYPE_LENGTH (type));
672 REGISTER_CONVERT_FROM_TYPE (VALUE_REGNO (toval), type, raw_buffer);
673 write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
674 raw_buffer, TYPE_LENGTH (type));
676 write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
677 VALUE_CONTENTS (fromval), TYPE_LENGTH (type));
680 /* Assigning to the stack pointer, frame pointer, and other
681 (architecture and calling convention specific) registers may
682 cause the frame cache to be out of date. We just do this
683 on all assignments to registers for simplicity; I doubt the slowdown
685 reinit_frame_cache ();
688 case lval_reg_frame_relative:
690 /* value is stored in a series of registers in the frame
691 specified by the structure. Copy that value out, modify
692 it, and copy it back in. */
693 int amount_to_copy = (VALUE_BITSIZE (toval) ? 1 : TYPE_LENGTH (type));
694 int reg_size = REGISTER_RAW_SIZE (VALUE_FRAME_REGNUM (toval));
695 int byte_offset = VALUE_OFFSET (toval) % reg_size;
696 int reg_offset = VALUE_OFFSET (toval) / reg_size;
699 /* Make the buffer large enough in all cases. */
700 char *buffer = (char *) alloca (amount_to_copy
702 + MAX_REGISTER_RAW_SIZE);
705 struct frame_info *frame;
707 /* Figure out which frame this is in currently. */
708 for (frame = get_current_frame ();
709 frame && FRAME_FP (frame) != VALUE_FRAME (toval);
710 frame = get_prev_frame (frame))
714 error ("Value being assigned to is no longer active.");
716 amount_to_copy += (reg_size - amount_to_copy % reg_size);
719 for ((regno = VALUE_FRAME_REGNUM (toval) + reg_offset,
721 amount_copied < amount_to_copy;
722 amount_copied += reg_size, regno++)
724 get_saved_register (buffer + amount_copied,
725 (int *) NULL, (CORE_ADDR *) NULL,
726 frame, regno, (enum lval_type *) NULL);
729 /* Modify what needs to be modified. */
730 if (VALUE_BITSIZE (toval))
731 modify_field (buffer + byte_offset,
732 value_as_long (fromval),
733 VALUE_BITPOS (toval), VALUE_BITSIZE (toval));
735 memcpy (buffer + byte_offset, raw_buffer, use_buffer);
737 memcpy (buffer + byte_offset, VALUE_CONTENTS (fromval),
741 for ((regno = VALUE_FRAME_REGNUM (toval) + reg_offset,
743 amount_copied < amount_to_copy;
744 amount_copied += reg_size, regno++)
750 /* Just find out where to put it. */
751 get_saved_register ((char *) NULL,
752 &optim, &addr, frame, regno, &lval);
755 error ("Attempt to assign to a value that was optimized out.");
756 if (lval == lval_memory)
757 write_memory (addr, buffer + amount_copied, reg_size);
758 else if (lval == lval_register)
759 write_register_bytes (addr, buffer + amount_copied, reg_size);
761 error ("Attempt to assign to an unmodifiable value.");
764 if (register_changed_hook)
765 register_changed_hook (-1);
771 error ("Left operand of assignment is not an lvalue.");
774 /* If the field does not entirely fill a LONGEST, then zero the sign bits.
775 If the field is signed, and is negative, then sign extend. */
776 if ((VALUE_BITSIZE (toval) > 0)
777 && (VALUE_BITSIZE (toval) < 8 * (int) sizeof (LONGEST)))
779 LONGEST fieldval = value_as_long (fromval);
780 LONGEST valmask = (((ULONGEST) 1) << VALUE_BITSIZE (toval)) - 1;
783 if (!TYPE_UNSIGNED (type) && (fieldval & (valmask ^ (valmask >> 1))))
784 fieldval |= ~valmask;
786 fromval = value_from_longest (type, fieldval);
789 val = value_copy (toval);
790 memcpy (VALUE_CONTENTS_RAW (val), VALUE_CONTENTS (fromval),
792 VALUE_TYPE (val) = type;
793 val = value_change_enclosing_type (val, VALUE_ENCLOSING_TYPE (fromval));
794 VALUE_EMBEDDED_OFFSET (val) = VALUE_EMBEDDED_OFFSET (fromval);
795 VALUE_POINTED_TO_OFFSET (val) = VALUE_POINTED_TO_OFFSET (fromval);
800 /* Extend a value VAL to COUNT repetitions of its type. */
803 value_repeat (struct value *arg1, int count)
807 if (VALUE_LVAL (arg1) != lval_memory)
808 error ("Only values in memory can be extended with '@'.");
810 error ("Invalid number %d of repetitions.", count);
812 val = allocate_repeat_value (VALUE_ENCLOSING_TYPE (arg1), count);
814 read_memory (VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1),
815 VALUE_CONTENTS_ALL_RAW (val),
816 TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val)));
817 VALUE_LVAL (val) = lval_memory;
818 VALUE_ADDRESS (val) = VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1);
824 value_of_variable (struct symbol *var, struct block *b)
827 struct frame_info *frame = NULL;
830 frame = NULL; /* Use selected frame. */
831 else if (symbol_read_needs_frame (var))
833 frame = block_innermost_frame (b);
836 if (BLOCK_FUNCTION (b)
837 && SYMBOL_SOURCE_NAME (BLOCK_FUNCTION (b)))
838 error ("No frame is currently executing in block %s.",
839 SYMBOL_SOURCE_NAME (BLOCK_FUNCTION (b)));
841 error ("No frame is currently executing in specified block");
845 val = read_var_value (var, frame);
847 error ("Address of symbol \"%s\" is unknown.", SYMBOL_SOURCE_NAME (var));
852 /* Given a value which is an array, return a value which is a pointer to its
853 first element, regardless of whether or not the array has a nonzero lower
856 FIXME: A previous comment here indicated that this routine should be
857 substracting the array's lower bound. It's not clear to me that this
858 is correct. Given an array subscripting operation, it would certainly
859 work to do the adjustment here, essentially computing:
861 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
863 However I believe a more appropriate and logical place to account for
864 the lower bound is to do so in value_subscript, essentially computing:
866 (&array[0] + ((index - lowerbound) * sizeof array[0]))
868 As further evidence consider what would happen with operations other
869 than array subscripting, where the caller would get back a value that
870 had an address somewhere before the actual first element of the array,
871 and the information about the lower bound would be lost because of
872 the coercion to pointer type.
876 value_coerce_array (struct value *arg1)
878 register struct type *type = check_typedef (VALUE_TYPE (arg1));
880 if (VALUE_LVAL (arg1) != lval_memory)
881 error ("Attempt to take address of value not located in memory.");
883 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
884 (VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1)));
887 /* Given a value which is a function, return a value which is a pointer
891 value_coerce_function (struct value *arg1)
893 struct value *retval;
895 if (VALUE_LVAL (arg1) != lval_memory)
896 error ("Attempt to take address of value not located in memory.");
898 retval = value_from_pointer (lookup_pointer_type (VALUE_TYPE (arg1)),
899 (VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1)));
900 VALUE_BFD_SECTION (retval) = VALUE_BFD_SECTION (arg1);
904 /* Return a pointer value for the object for which ARG1 is the contents. */
907 value_addr (struct value *arg1)
911 struct type *type = check_typedef (VALUE_TYPE (arg1));
912 if (TYPE_CODE (type) == TYPE_CODE_REF)
914 /* Copy the value, but change the type from (T&) to (T*).
915 We keep the same location information, which is efficient,
916 and allows &(&X) to get the location containing the reference. */
917 arg2 = value_copy (arg1);
918 VALUE_TYPE (arg2) = lookup_pointer_type (TYPE_TARGET_TYPE (type));
921 if (TYPE_CODE (type) == TYPE_CODE_FUNC)
922 return value_coerce_function (arg1);
924 if (VALUE_LVAL (arg1) != lval_memory)
925 error ("Attempt to take address of value not located in memory.");
927 /* Get target memory address */
928 arg2 = value_from_pointer (lookup_pointer_type (VALUE_TYPE (arg1)),
929 (VALUE_ADDRESS (arg1)
930 + VALUE_OFFSET (arg1)
931 + VALUE_EMBEDDED_OFFSET (arg1)));
933 /* This may be a pointer to a base subobject; so remember the
934 full derived object's type ... */
935 arg2 = value_change_enclosing_type (arg2, lookup_pointer_type (VALUE_ENCLOSING_TYPE (arg1)));
936 /* ... and also the relative position of the subobject in the full object */
937 VALUE_POINTED_TO_OFFSET (arg2) = VALUE_EMBEDDED_OFFSET (arg1);
938 VALUE_BFD_SECTION (arg2) = VALUE_BFD_SECTION (arg1);
942 /* Given a value of a pointer type, apply the C unary * operator to it. */
945 value_ind (struct value *arg1)
947 struct type *base_type;
952 base_type = check_typedef (VALUE_TYPE (arg1));
954 if (TYPE_CODE (base_type) == TYPE_CODE_MEMBER)
955 error ("not implemented: member types in value_ind");
957 /* Allow * on an integer so we can cast it to whatever we want.
958 This returns an int, which seems like the most C-like thing
959 to do. "long long" variables are rare enough that
960 BUILTIN_TYPE_LONGEST would seem to be a mistake. */
961 if (TYPE_CODE (base_type) == TYPE_CODE_INT)
962 return value_at (builtin_type_int,
963 (CORE_ADDR) value_as_long (arg1),
964 VALUE_BFD_SECTION (arg1));
965 else if (TYPE_CODE (base_type) == TYPE_CODE_PTR)
967 struct type *enc_type;
968 /* We may be pointing to something embedded in a larger object */
969 /* Get the real type of the enclosing object */
970 enc_type = check_typedef (VALUE_ENCLOSING_TYPE (arg1));
971 enc_type = TYPE_TARGET_TYPE (enc_type);
972 /* Retrieve the enclosing object pointed to */
973 arg2 = value_at_lazy (enc_type,
974 value_as_address (arg1) - VALUE_POINTED_TO_OFFSET (arg1),
975 VALUE_BFD_SECTION (arg1));
977 VALUE_TYPE (arg2) = TYPE_TARGET_TYPE (base_type);
978 /* Add embedding info */
979 arg2 = value_change_enclosing_type (arg2, enc_type);
980 VALUE_EMBEDDED_OFFSET (arg2) = VALUE_POINTED_TO_OFFSET (arg1);
982 /* We may be pointing to an object of some derived type */
983 arg2 = value_full_object (arg2, NULL, 0, 0, 0);
987 error ("Attempt to take contents of a non-pointer value.");
988 return 0; /* For lint -- never reached */
991 /* Pushing small parts of stack frames. */
993 /* Push one word (the size of object that a register holds). */
996 push_word (CORE_ADDR sp, ULONGEST word)
998 register int len = REGISTER_SIZE;
999 char *buffer = alloca (MAX_REGISTER_RAW_SIZE);
1001 store_unsigned_integer (buffer, len, word);
1002 if (INNER_THAN (1, 2))
1004 /* stack grows downward */
1006 write_memory (sp, buffer, len);
1010 /* stack grows upward */
1011 write_memory (sp, buffer, len);
1018 /* Push LEN bytes with data at BUFFER. */
1021 push_bytes (CORE_ADDR sp, char *buffer, int len)
1023 if (INNER_THAN (1, 2))
1025 /* stack grows downward */
1027 write_memory (sp, buffer, len);
1031 /* stack grows upward */
1032 write_memory (sp, buffer, len);
1039 #ifndef PARM_BOUNDARY
1040 #define PARM_BOUNDARY (0)
1043 /* Push onto the stack the specified value VALUE. Pad it correctly for
1044 it to be an argument to a function. */
1047 value_push (register CORE_ADDR sp, struct value *arg)
1049 register int len = TYPE_LENGTH (VALUE_ENCLOSING_TYPE (arg));
1050 register int container_len = len;
1051 register int offset;
1053 /* How big is the container we're going to put this value in? */
1055 container_len = ((len + PARM_BOUNDARY / TARGET_CHAR_BIT - 1)
1056 & ~(PARM_BOUNDARY / TARGET_CHAR_BIT - 1));
1058 /* Are we going to put it at the high or low end of the container? */
1059 if (TARGET_BYTE_ORDER == BIG_ENDIAN)
1060 offset = container_len - len;
1064 if (INNER_THAN (1, 2))
1066 /* stack grows downward */
1067 sp -= container_len;
1068 write_memory (sp + offset, VALUE_CONTENTS_ALL (arg), len);
1072 /* stack grows upward */
1073 write_memory (sp + offset, VALUE_CONTENTS_ALL (arg), len);
1074 sp += container_len;
1080 #ifndef PUSH_ARGUMENTS
1081 #define PUSH_ARGUMENTS default_push_arguments
1085 default_push_arguments (int nargs, struct value **args, CORE_ADDR sp,
1086 int struct_return, CORE_ADDR struct_addr)
1088 /* ASSERT ( !struct_return); */
1090 for (i = nargs - 1; i >= 0; i--)
1091 sp = value_push (sp, args[i]);
1096 /* Functions to use for the COERCE_FLOAT_TO_DOUBLE gdbarch method.
1098 How you should pass arguments to a function depends on whether it
1099 was defined in K&R style or prototype style. If you define a
1100 function using the K&R syntax that takes a `float' argument, then
1101 callers must pass that argument as a `double'. If you define the
1102 function using the prototype syntax, then you must pass the
1103 argument as a `float', with no promotion.
1105 Unfortunately, on certain older platforms, the debug info doesn't
1106 indicate reliably how each function was defined. A function type's
1107 TYPE_FLAG_PROTOTYPED flag may be clear, even if the function was
1108 defined in prototype style. When calling a function whose
1109 TYPE_FLAG_PROTOTYPED flag is clear, GDB consults the
1110 COERCE_FLOAT_TO_DOUBLE gdbarch method to decide what to do.
1112 For modern targets, it is proper to assume that, if the prototype
1113 flag is clear, that can be trusted: `float' arguments should be
1114 promoted to `double'. You should register the function
1115 `standard_coerce_float_to_double' to get this behavior.
1117 For some older targets, if the prototype flag is clear, that
1118 doesn't tell us anything. So we guess that, if we don't have a
1119 type for the formal parameter (i.e., the first argument to
1120 COERCE_FLOAT_TO_DOUBLE is null), then we should promote it;
1121 otherwise, we should leave it alone. The function
1122 `default_coerce_float_to_double' provides this behavior; it is the
1123 default value, for compatibility with older configurations. */
1125 default_coerce_float_to_double (struct type *formal, struct type *actual)
1127 return formal == NULL;
1132 standard_coerce_float_to_double (struct type *formal, struct type *actual)
1138 /* Perform the standard coercions that are specified
1139 for arguments to be passed to C functions.
1141 If PARAM_TYPE is non-NULL, it is the expected parameter type.
1142 IS_PROTOTYPED is non-zero if the function declaration is prototyped. */
1144 static struct value *
1145 value_arg_coerce (struct value *arg, struct type *param_type, int is_prototyped)
1147 register struct type *arg_type = check_typedef (VALUE_TYPE (arg));
1148 register struct type *type
1149 = param_type ? check_typedef (param_type) : arg_type;
1151 switch (TYPE_CODE (type))
1154 if (TYPE_CODE (arg_type) != TYPE_CODE_REF)
1156 arg = value_addr (arg);
1157 VALUE_TYPE (arg) = param_type;
1162 case TYPE_CODE_CHAR:
1163 case TYPE_CODE_BOOL:
1164 case TYPE_CODE_ENUM:
1165 /* If we don't have a prototype, coerce to integer type if necessary. */
1168 if (TYPE_LENGTH (type) < TYPE_LENGTH (builtin_type_int))
1169 type = builtin_type_int;
1171 /* Currently all target ABIs require at least the width of an integer
1172 type for an argument. We may have to conditionalize the following
1173 type coercion for future targets. */
1174 if (TYPE_LENGTH (type) < TYPE_LENGTH (builtin_type_int))
1175 type = builtin_type_int;
1178 /* FIXME: We should always convert floats to doubles in the
1179 non-prototyped case. As many debugging formats include
1180 no information about prototyping, we have to live with
1181 COERCE_FLOAT_TO_DOUBLE for now. */
1182 if (!is_prototyped && COERCE_FLOAT_TO_DOUBLE (param_type, arg_type))
1184 if (TYPE_LENGTH (type) < TYPE_LENGTH (builtin_type_double))
1185 type = builtin_type_double;
1186 else if (TYPE_LENGTH (type) > TYPE_LENGTH (builtin_type_double))
1187 type = builtin_type_long_double;
1190 case TYPE_CODE_FUNC:
1191 type = lookup_pointer_type (type);
1193 case TYPE_CODE_ARRAY:
1194 if (current_language->c_style_arrays)
1195 type = lookup_pointer_type (TYPE_TARGET_TYPE (type));
1197 case TYPE_CODE_UNDEF:
1199 case TYPE_CODE_STRUCT:
1200 case TYPE_CODE_UNION:
1201 case TYPE_CODE_VOID:
1203 case TYPE_CODE_RANGE:
1204 case TYPE_CODE_STRING:
1205 case TYPE_CODE_BITSTRING:
1206 case TYPE_CODE_ERROR:
1207 case TYPE_CODE_MEMBER:
1208 case TYPE_CODE_METHOD:
1209 case TYPE_CODE_COMPLEX:
1214 return value_cast (type, arg);
1217 /* Determine a function's address and its return type from its value.
1218 Calls error() if the function is not valid for calling. */
1221 find_function_addr (struct value *function, struct type **retval_type)
1223 register struct type *ftype = check_typedef (VALUE_TYPE (function));
1224 register enum type_code code = TYPE_CODE (ftype);
1225 struct type *value_type;
1228 /* If it's a member function, just look at the function
1231 /* Determine address to call. */
1232 if (code == TYPE_CODE_FUNC || code == TYPE_CODE_METHOD)
1234 funaddr = VALUE_ADDRESS (function);
1235 value_type = TYPE_TARGET_TYPE (ftype);
1237 else if (code == TYPE_CODE_PTR)
1239 funaddr = value_as_address (function);
1240 ftype = check_typedef (TYPE_TARGET_TYPE (ftype));
1241 if (TYPE_CODE (ftype) == TYPE_CODE_FUNC
1242 || TYPE_CODE (ftype) == TYPE_CODE_METHOD)
1244 funaddr = CONVERT_FROM_FUNC_PTR_ADDR (funaddr);
1245 value_type = TYPE_TARGET_TYPE (ftype);
1248 value_type = builtin_type_int;
1250 else if (code == TYPE_CODE_INT)
1252 /* Handle the case of functions lacking debugging info.
1253 Their values are characters since their addresses are char */
1254 if (TYPE_LENGTH (ftype) == 1)
1255 funaddr = value_as_address (value_addr (function));
1257 /* Handle integer used as address of a function. */
1258 funaddr = (CORE_ADDR) value_as_long (function);
1260 value_type = builtin_type_int;
1263 error ("Invalid data type for function to be called.");
1265 *retval_type = value_type;
1269 /* All this stuff with a dummy frame may seem unnecessarily complicated
1270 (why not just save registers in GDB?). The purpose of pushing a dummy
1271 frame which looks just like a real frame is so that if you call a
1272 function and then hit a breakpoint (get a signal, etc), "backtrace"
1273 will look right. Whether the backtrace needs to actually show the
1274 stack at the time the inferior function was called is debatable, but
1275 it certainly needs to not display garbage. So if you are contemplating
1276 making dummy frames be different from normal frames, consider that. */
1278 /* Perform a function call in the inferior.
1279 ARGS is a vector of values of arguments (NARGS of them).
1280 FUNCTION is a value, the function to be called.
1281 Returns a value representing what the function returned.
1282 May fail to return, if a breakpoint or signal is hit
1283 during the execution of the function.
1285 ARGS is modified to contain coerced values. */
1287 static struct value *
1288 hand_function_call (struct value *function, int nargs, struct value **args)
1290 register CORE_ADDR sp;
1294 /* CALL_DUMMY is an array of words (REGISTER_SIZE), but each word
1295 is in host byte order. Before calling FIX_CALL_DUMMY, we byteswap it
1296 and remove any extra bytes which might exist because ULONGEST is
1297 bigger than REGISTER_SIZE.
1299 NOTE: This is pretty wierd, as the call dummy is actually a
1300 sequence of instructions. But CISC machines will have
1301 to pack the instructions into REGISTER_SIZE units (and
1302 so will RISC machines for which INSTRUCTION_SIZE is not
1305 NOTE: This is pretty stupid. CALL_DUMMY should be in strict
1306 target byte order. */
1308 static ULONGEST *dummy;
1312 struct type *value_type;
1313 unsigned char struct_return;
1314 CORE_ADDR struct_addr = 0;
1315 struct inferior_status *inf_status;
1316 struct cleanup *old_chain;
1318 int using_gcc; /* Set to version of gcc in use, or zero if not gcc */
1320 struct type *param_type = NULL;
1321 struct type *ftype = check_typedef (SYMBOL_TYPE (function));
1322 int n_method_args = 0;
1324 dummy = alloca (SIZEOF_CALL_DUMMY_WORDS);
1325 sizeof_dummy1 = REGISTER_SIZE * SIZEOF_CALL_DUMMY_WORDS / sizeof (ULONGEST);
1326 dummy1 = alloca (sizeof_dummy1);
1327 memcpy (dummy, CALL_DUMMY_WORDS, SIZEOF_CALL_DUMMY_WORDS);
1329 if (!target_has_execution)
1332 inf_status = save_inferior_status (1);
1333 old_chain = make_cleanup_restore_inferior_status (inf_status);
1335 /* PUSH_DUMMY_FRAME is responsible for saving the inferior registers
1336 (and POP_FRAME for restoring them). (At least on most machines)
1337 they are saved on the stack in the inferior. */
1340 old_sp = sp = read_sp ();
1342 if (INNER_THAN (1, 2))
1344 /* Stack grows down */
1345 sp -= sizeof_dummy1;
1350 /* Stack grows up */
1352 sp += sizeof_dummy1;
1355 funaddr = find_function_addr (function, &value_type);
1356 CHECK_TYPEDEF (value_type);
1359 struct block *b = block_for_pc (funaddr);
1360 /* If compiled without -g, assume GCC 2. */
1361 using_gcc = (b == NULL ? 2 : BLOCK_GCC_COMPILED (b));
1364 /* Are we returning a value using a structure return or a normal
1367 struct_return = using_struct_return (function, funaddr, value_type,
1370 /* Create a call sequence customized for this function
1371 and the number of arguments for it. */
1372 for (i = 0; i < (int) (SIZEOF_CALL_DUMMY_WORDS / sizeof (dummy[0])); i++)
1373 store_unsigned_integer (&dummy1[i * REGISTER_SIZE],
1375 (ULONGEST) dummy[i]);
1377 #ifdef GDB_TARGET_IS_HPPA
1378 real_pc = FIX_CALL_DUMMY (dummy1, start_sp, funaddr, nargs, args,
1379 value_type, using_gcc);
1381 FIX_CALL_DUMMY (dummy1, start_sp, funaddr, nargs, args,
1382 value_type, using_gcc);
1386 if (CALL_DUMMY_LOCATION == ON_STACK)
1388 write_memory (start_sp, (char *) dummy1, sizeof_dummy1);
1391 if (CALL_DUMMY_LOCATION == BEFORE_TEXT_END)
1393 /* Convex Unix prohibits executing in the stack segment. */
1394 /* Hope there is empty room at the top of the text segment. */
1395 extern CORE_ADDR text_end;
1396 static int checked = 0;
1398 for (start_sp = text_end - sizeof_dummy1; start_sp < text_end; ++start_sp)
1399 if (read_memory_integer (start_sp, 1) != 0)
1400 error ("text segment full -- no place to put call");
1403 real_pc = text_end - sizeof_dummy1;
1404 write_memory (real_pc, (char *) dummy1, sizeof_dummy1);
1407 if (CALL_DUMMY_LOCATION == AFTER_TEXT_END)
1409 extern CORE_ADDR text_end;
1413 errcode = target_write_memory (real_pc, (char *) dummy1, sizeof_dummy1);
1415 error ("Cannot write text segment -- call_function failed");
1418 if (CALL_DUMMY_LOCATION == AT_ENTRY_POINT)
1424 sp = old_sp; /* It really is used, for some ifdef's... */
1427 if (TYPE_CODE (ftype) == TYPE_CODE_METHOD)
1430 while (TYPE_CODE (TYPE_ARG_TYPES (ftype)[i]) != TYPE_CODE_VOID)
1434 error ("too few arguments in method call");
1436 else if (nargs < TYPE_NFIELDS (ftype))
1437 error ("too few arguments in function call");
1439 for (i = nargs - 1; i >= 0; i--)
1441 /* Assume that methods are always prototyped, unless they are off the
1442 end (which we should only be allowing if there is a ``...'').
1444 if (TYPE_CODE (ftype) == TYPE_CODE_METHOD)
1446 if (i < n_method_args)
1447 args[i] = value_arg_coerce (args[i], TYPE_ARG_TYPES (ftype)[i], 1);
1449 args[i] = value_arg_coerce (args[i], NULL, 0);
1452 /* If we're off the end of the known arguments, do the standard
1453 promotions. FIXME: if we had a prototype, this should only
1454 be allowed if ... were present. */
1455 if (i >= TYPE_NFIELDS (ftype))
1456 args[i] = value_arg_coerce (args[i], NULL, 0);
1460 param_type = TYPE_FIELD_TYPE (ftype, i);
1461 args[i] = value_arg_coerce (args[i], param_type, TYPE_PROTOTYPED (ftype));
1464 /*elz: this code is to handle the case in which the function to be called
1465 has a pointer to function as parameter and the corresponding actual argument
1466 is the address of a function and not a pointer to function variable.
1467 In aCC compiled code, the calls through pointers to functions (in the body
1468 of the function called by hand) are made via $$dyncall_external which
1469 requires some registers setting, this is taken care of if we call
1470 via a function pointer variable, but not via a function address.
1471 In cc this is not a problem. */
1475 /* if this parameter is a pointer to function */
1476 if (TYPE_CODE (param_type) == TYPE_CODE_PTR)
1477 if (TYPE_CODE (param_type->target_type) == TYPE_CODE_FUNC)
1478 /* elz: FIXME here should go the test about the compiler used
1479 to compile the target. We want to issue the error
1480 message only if the compiler used was HP's aCC.
1481 If we used HP's cc, then there is no problem and no need
1482 to return at this point */
1483 if (using_gcc == 0) /* && compiler == aCC */
1484 /* go see if the actual parameter is a variable of type
1485 pointer to function or just a function */
1486 if (args[i]->lval == not_lval)
1489 if (find_pc_partial_function ((CORE_ADDR) args[i]->aligner.contents[0], &arg_name, NULL, NULL))
1491 You cannot use function <%s> as argument. \n\
1492 You must use a pointer to function type variable. Command ignored.", arg_name);
1496 if (REG_STRUCT_HAS_ADDR_P ())
1498 /* This is a machine like the sparc, where we may need to pass a
1499 pointer to the structure, not the structure itself. */
1500 for (i = nargs - 1; i >= 0; i--)
1502 struct type *arg_type = check_typedef (VALUE_TYPE (args[i]));
1503 if ((TYPE_CODE (arg_type) == TYPE_CODE_STRUCT
1504 || TYPE_CODE (arg_type) == TYPE_CODE_UNION
1505 || TYPE_CODE (arg_type) == TYPE_CODE_ARRAY
1506 || TYPE_CODE (arg_type) == TYPE_CODE_STRING
1507 || TYPE_CODE (arg_type) == TYPE_CODE_BITSTRING
1508 || TYPE_CODE (arg_type) == TYPE_CODE_SET
1509 || (TYPE_CODE (arg_type) == TYPE_CODE_FLT
1510 && TYPE_LENGTH (arg_type) > 8)
1512 && REG_STRUCT_HAS_ADDR (using_gcc, arg_type))
1515 int len; /* = TYPE_LENGTH (arg_type); */
1517 arg_type = check_typedef (VALUE_ENCLOSING_TYPE (args[i]));
1518 len = TYPE_LENGTH (arg_type);
1520 if (STACK_ALIGN_P ())
1521 /* MVS 11/22/96: I think at least some of this
1522 stack_align code is really broken. Better to let
1523 PUSH_ARGUMENTS adjust the stack in a target-defined
1525 aligned_len = STACK_ALIGN (len);
1528 if (INNER_THAN (1, 2))
1530 /* stack grows downward */
1532 /* ... so the address of the thing we push is the
1533 stack pointer after we push it. */
1538 /* The stack grows up, so the address of the thing
1539 we push is the stack pointer before we push it. */
1543 /* Push the structure. */
1544 write_memory (addr, VALUE_CONTENTS_ALL (args[i]), len);
1545 /* The value we're going to pass is the address of the
1546 thing we just pushed. */
1547 /*args[i] = value_from_longest (lookup_pointer_type (value_type),
1549 args[i] = value_from_pointer (lookup_pointer_type (arg_type),
1556 /* Reserve space for the return structure to be written on the
1557 stack, if necessary */
1561 int len = TYPE_LENGTH (value_type);
1562 if (STACK_ALIGN_P ())
1563 /* MVS 11/22/96: I think at least some of this stack_align
1564 code is really broken. Better to let PUSH_ARGUMENTS adjust
1565 the stack in a target-defined manner. */
1566 len = STACK_ALIGN (len);
1567 if (INNER_THAN (1, 2))
1569 /* stack grows downward */
1575 /* stack grows upward */
1581 /* elz: on HPPA no need for this extra alignment, maybe it is needed
1582 on other architectures. This is because all the alignment is
1583 taken care of in the above code (ifdef REG_STRUCT_HAS_ADDR) and
1584 in hppa_push_arguments */
1585 if (EXTRA_STACK_ALIGNMENT_NEEDED)
1587 /* MVS 11/22/96: I think at least some of this stack_align code
1588 is really broken. Better to let PUSH_ARGUMENTS adjust the
1589 stack in a target-defined manner. */
1590 if (STACK_ALIGN_P () && INNER_THAN (1, 2))
1592 /* If stack grows down, we must leave a hole at the top. */
1595 for (i = nargs - 1; i >= 0; i--)
1596 len += TYPE_LENGTH (VALUE_ENCLOSING_TYPE (args[i]));
1597 if (CALL_DUMMY_STACK_ADJUST_P)
1598 len += CALL_DUMMY_STACK_ADJUST;
1599 sp -= STACK_ALIGN (len) - len;
1603 sp = PUSH_ARGUMENTS (nargs, args, sp, struct_return, struct_addr);
1605 if (PUSH_RETURN_ADDRESS_P ())
1606 /* for targets that use no CALL_DUMMY */
1607 /* There are a number of targets now which actually don't write
1608 any CALL_DUMMY instructions into the target, but instead just
1609 save the machine state, push the arguments, and jump directly
1610 to the callee function. Since this doesn't actually involve
1611 executing a JSR/BSR instruction, the return address must be set
1612 up by hand, either by pushing onto the stack or copying into a
1613 return-address register as appropriate. Formerly this has been
1614 done in PUSH_ARGUMENTS, but that's overloading its
1615 functionality a bit, so I'm making it explicit to do it here. */
1616 sp = PUSH_RETURN_ADDRESS (real_pc, sp);
1618 if (STACK_ALIGN_P () && !INNER_THAN (1, 2))
1620 /* If stack grows up, we must leave a hole at the bottom, note
1621 that sp already has been advanced for the arguments! */
1622 if (CALL_DUMMY_STACK_ADJUST_P)
1623 sp += CALL_DUMMY_STACK_ADJUST;
1624 sp = STACK_ALIGN (sp);
1627 /* XXX This seems wrong. For stacks that grow down we shouldn't do
1629 /* MVS 11/22/96: I think at least some of this stack_align code is
1630 really broken. Better to let PUSH_ARGUMENTS adjust the stack in
1631 a target-defined manner. */
1632 if (CALL_DUMMY_STACK_ADJUST_P)
1633 if (INNER_THAN (1, 2))
1635 /* stack grows downward */
1636 sp -= CALL_DUMMY_STACK_ADJUST;
1639 /* Store the address at which the structure is supposed to be
1640 written. Note that this (and the code which reserved the space
1641 above) assumes that gcc was used to compile this function. Since
1642 it doesn't cost us anything but space and if the function is pcc
1643 it will ignore this value, we will make that assumption.
1645 Also note that on some machines (like the sparc) pcc uses a
1646 convention like gcc's. */
1649 STORE_STRUCT_RETURN (struct_addr, sp);
1651 /* Write the stack pointer. This is here because the statements above
1652 might fool with it. On SPARC, this write also stores the register
1653 window into the right place in the new stack frame, which otherwise
1654 wouldn't happen. (See store_inferior_registers in sparc-nat.c.) */
1657 if (SAVE_DUMMY_FRAME_TOS_P ())
1658 SAVE_DUMMY_FRAME_TOS (sp);
1661 char *retbuf = (char*) alloca (REGISTER_BYTES);
1663 struct symbol *symbol;
1666 symbol = find_pc_function (funaddr);
1669 name = SYMBOL_SOURCE_NAME (symbol);
1673 /* Try the minimal symbols. */
1674 struct minimal_symbol *msymbol = lookup_minimal_symbol_by_pc (funaddr);
1678 name = SYMBOL_SOURCE_NAME (msymbol);
1684 sprintf (format, "at %s", local_hex_format ());
1686 /* FIXME-32x64: assumes funaddr fits in a long. */
1687 sprintf (name, format, (unsigned long) funaddr);
1690 /* Execute the stack dummy routine, calling FUNCTION.
1691 When it is done, discard the empty frame
1692 after storing the contents of all regs into retbuf. */
1693 rc = run_stack_dummy (real_pc + CALL_DUMMY_START_OFFSET, retbuf);
1697 /* We stopped inside the FUNCTION because of a random signal.
1698 Further execution of the FUNCTION is not allowed. */
1700 if (unwind_on_signal_p)
1702 /* The user wants the context restored. */
1704 /* We must get back to the frame we were before the dummy call. */
1707 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1708 a C++ name with arguments and stuff. */
1710 The program being debugged was signaled while in a function called from GDB.\n\
1711 GDB has restored the context to what it was before the call.\n\
1712 To change this behavior use \"set unwindonsignal off\"\n\
1713 Evaluation of the expression containing the function (%s) will be abandoned.",
1718 /* The user wants to stay in the frame where we stopped (default).*/
1720 /* If we did the cleanups, we would print a spurious error
1721 message (Unable to restore previously selected frame),
1722 would write the registers from the inf_status (which is
1723 wrong), and would do other wrong things. */
1724 discard_cleanups (old_chain);
1725 discard_inferior_status (inf_status);
1727 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1728 a C++ name with arguments and stuff. */
1730 The program being debugged was signaled while in a function called from GDB.\n\
1731 GDB remains in the frame where the signal was received.\n\
1732 To change this behavior use \"set unwindonsignal on\"\n\
1733 Evaluation of the expression containing the function (%s) will be abandoned.",
1740 /* We hit a breakpoint inside the FUNCTION. */
1742 /* If we did the cleanups, we would print a spurious error
1743 message (Unable to restore previously selected frame),
1744 would write the registers from the inf_status (which is
1745 wrong), and would do other wrong things. */
1746 discard_cleanups (old_chain);
1747 discard_inferior_status (inf_status);
1749 /* The following error message used to say "The expression
1750 which contained the function call has been discarded." It
1751 is a hard concept to explain in a few words. Ideally, GDB
1752 would be able to resume evaluation of the expression when
1753 the function finally is done executing. Perhaps someday
1754 this will be implemented (it would not be easy). */
1756 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1757 a C++ name with arguments and stuff. */
1759 The program being debugged stopped while in a function called from GDB.\n\
1760 When the function (%s) is done executing, GDB will silently\n\
1761 stop (instead of continuing to evaluate the expression containing\n\
1762 the function call).", name);
1765 /* If we get here the called FUNCTION run to completion. */
1766 do_cleanups (old_chain);
1768 /* Figure out the value returned by the function. */
1769 /* elz: I defined this new macro for the hppa architecture only.
1770 this gives us a way to get the value returned by the function from the stack,
1771 at the same address we told the function to put it.
1772 We cannot assume on the pa that r28 still contains the address of the returned
1773 structure. Usually this will be overwritten by the callee.
1774 I don't know about other architectures, so I defined this macro
1777 #ifdef VALUE_RETURNED_FROM_STACK
1779 return (struct value *) VALUE_RETURNED_FROM_STACK (value_type, struct_addr);
1782 return value_being_returned (value_type, retbuf, struct_return);
1787 call_function_by_hand (struct value *function, int nargs, struct value **args)
1791 return hand_function_call (function, nargs, args);
1795 error ("Cannot invoke functions on this machine.");
1801 /* Create a value for an array by allocating space in the inferior, copying
1802 the data into that space, and then setting up an array value.
1804 The array bounds are set from LOWBOUND and HIGHBOUND, and the array is
1805 populated from the values passed in ELEMVEC.
1807 The element type of the array is inherited from the type of the
1808 first element, and all elements must have the same size (though we
1809 don't currently enforce any restriction on their types). */
1812 value_array (int lowbound, int highbound, struct value **elemvec)
1816 unsigned int typelength;
1818 struct type *rangetype;
1819 struct type *arraytype;
1822 /* Validate that the bounds are reasonable and that each of the elements
1823 have the same size. */
1825 nelem = highbound - lowbound + 1;
1828 error ("bad array bounds (%d, %d)", lowbound, highbound);
1830 typelength = TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec[0]));
1831 for (idx = 1; idx < nelem; idx++)
1833 if (TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec[idx])) != typelength)
1835 error ("array elements must all be the same size");
1839 rangetype = create_range_type ((struct type *) NULL, builtin_type_int,
1840 lowbound, highbound);
1841 arraytype = create_array_type ((struct type *) NULL,
1842 VALUE_ENCLOSING_TYPE (elemvec[0]), rangetype);
1844 if (!current_language->c_style_arrays)
1846 val = allocate_value (arraytype);
1847 for (idx = 0; idx < nelem; idx++)
1849 memcpy (VALUE_CONTENTS_ALL_RAW (val) + (idx * typelength),
1850 VALUE_CONTENTS_ALL (elemvec[idx]),
1853 VALUE_BFD_SECTION (val) = VALUE_BFD_SECTION (elemvec[0]);
1857 /* Allocate space to store the array in the inferior, and then initialize
1858 it by copying in each element. FIXME: Is it worth it to create a
1859 local buffer in which to collect each value and then write all the
1860 bytes in one operation? */
1862 addr = allocate_space_in_inferior (nelem * typelength);
1863 for (idx = 0; idx < nelem; idx++)
1865 write_memory (addr + (idx * typelength), VALUE_CONTENTS_ALL (elemvec[idx]),
1869 /* Create the array type and set up an array value to be evaluated lazily. */
1871 val = value_at_lazy (arraytype, addr, VALUE_BFD_SECTION (elemvec[0]));
1875 /* Create a value for a string constant by allocating space in the inferior,
1876 copying the data into that space, and returning the address with type
1877 TYPE_CODE_STRING. PTR points to the string constant data; LEN is number
1879 Note that string types are like array of char types with a lower bound of
1880 zero and an upper bound of LEN - 1. Also note that the string may contain
1881 embedded null bytes. */
1884 value_string (char *ptr, int len)
1887 int lowbound = current_language->string_lower_bound;
1888 struct type *rangetype = create_range_type ((struct type *) NULL,
1890 lowbound, len + lowbound - 1);
1891 struct type *stringtype
1892 = create_string_type ((struct type *) NULL, rangetype);
1895 if (current_language->c_style_arrays == 0)
1897 val = allocate_value (stringtype);
1898 memcpy (VALUE_CONTENTS_RAW (val), ptr, len);
1903 /* Allocate space to store the string in the inferior, and then
1904 copy LEN bytes from PTR in gdb to that address in the inferior. */
1906 addr = allocate_space_in_inferior (len);
1907 write_memory (addr, ptr, len);
1909 val = value_at_lazy (stringtype, addr, NULL);
1914 value_bitstring (char *ptr, int len)
1917 struct type *domain_type = create_range_type (NULL, builtin_type_int,
1919 struct type *type = create_set_type ((struct type *) NULL, domain_type);
1920 TYPE_CODE (type) = TYPE_CODE_BITSTRING;
1921 val = allocate_value (type);
1922 memcpy (VALUE_CONTENTS_RAW (val), ptr, TYPE_LENGTH (type));
1926 /* See if we can pass arguments in T2 to a function which takes arguments
1927 of types T1. Both t1 and t2 are NULL-terminated vectors. If some
1928 arguments need coercion of some sort, then the coerced values are written
1929 into T2. Return value is 0 if the arguments could be matched, or the
1930 position at which they differ if not.
1932 STATICP is nonzero if the T1 argument list came from a
1933 static member function.
1935 For non-static member functions, we ignore the first argument,
1936 which is the type of the instance variable. This is because we want
1937 to handle calls with objects from derived classes. This is not
1938 entirely correct: we should actually check to make sure that a
1939 requested operation is type secure, shouldn't we? FIXME. */
1942 typecmp (int staticp, struct type *t1[], struct value *t2[])
1948 if (staticp && t1 == 0)
1952 if (TYPE_CODE (t1[0]) == TYPE_CODE_VOID)
1954 if (t1[!staticp] == 0)
1956 for (i = !staticp; t1[i] && TYPE_CODE (t1[i]) != TYPE_CODE_VOID; i++)
1958 struct type *tt1, *tt2;
1961 tt1 = check_typedef (t1[i]);
1962 tt2 = check_typedef (VALUE_TYPE (t2[i]));
1963 if (TYPE_CODE (tt1) == TYPE_CODE_REF
1964 /* We should be doing hairy argument matching, as below. */
1965 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1))) == TYPE_CODE (tt2)))
1967 if (TYPE_CODE (tt2) == TYPE_CODE_ARRAY)
1968 t2[i] = value_coerce_array (t2[i]);
1970 t2[i] = value_addr (t2[i]);
1974 /* djb - 20000715 - Until the new type structure is in the
1975 place, and we can attempt things like implicit conversions,
1976 we need to do this so you can take something like a map<const
1977 char *>, and properly access map["hello"], because the
1978 argument to [] will be a reference to a pointer to a char,
1979 and the argument will be a pointer to a char. */
1980 while ( TYPE_CODE(tt1) == TYPE_CODE_REF ||
1981 TYPE_CODE (tt1) == TYPE_CODE_PTR)
1983 tt1 = check_typedef( TYPE_TARGET_TYPE(tt1) );
1985 while ( TYPE_CODE(tt2) == TYPE_CODE_ARRAY ||
1986 TYPE_CODE(tt2) == TYPE_CODE_PTR ||
1987 TYPE_CODE(tt2) == TYPE_CODE_REF)
1989 tt2 = check_typedef( TYPE_TARGET_TYPE(tt2) );
1991 if (TYPE_CODE (tt1) == TYPE_CODE (tt2))
1993 /* Array to pointer is a `trivial conversion' according to the ARM. */
1995 /* We should be doing much hairier argument matching (see section 13.2
1996 of the ARM), but as a quick kludge, just check for the same type
1998 if (TYPE_CODE (t1[i]) != TYPE_CODE (VALUE_TYPE (t2[i])))
2003 return t2[i] ? i + 1 : 0;
2006 /* Helper function used by value_struct_elt to recurse through baseclasses.
2007 Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
2008 and search in it assuming it has (class) type TYPE.
2009 If found, return value, else return NULL.
2011 If LOOKING_FOR_BASECLASS, then instead of looking for struct fields,
2012 look for a baseclass named NAME. */
2014 static struct value *
2015 search_struct_field (char *name, struct value *arg1, int offset,
2016 register struct type *type, int looking_for_baseclass)
2019 int nbases = TYPE_N_BASECLASSES (type);
2021 CHECK_TYPEDEF (type);
2023 if (!looking_for_baseclass)
2024 for (i = TYPE_NFIELDS (type) - 1; i >= nbases; i--)
2026 char *t_field_name = TYPE_FIELD_NAME (type, i);
2028 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
2031 if (TYPE_FIELD_STATIC (type, i))
2032 v = value_static_field (type, i);
2034 v = value_primitive_field (arg1, offset, i, type);
2036 error ("there is no field named %s", name);
2041 && (t_field_name[0] == '\0'
2042 || (TYPE_CODE (type) == TYPE_CODE_UNION
2043 && (strcmp_iw (t_field_name, "else") == 0))))
2045 struct type *field_type = TYPE_FIELD_TYPE (type, i);
2046 if (TYPE_CODE (field_type) == TYPE_CODE_UNION
2047 || TYPE_CODE (field_type) == TYPE_CODE_STRUCT)
2049 /* Look for a match through the fields of an anonymous union,
2050 or anonymous struct. C++ provides anonymous unions.
2052 In the GNU Chill implementation of variant record types,
2053 each <alternative field> has an (anonymous) union type,
2054 each member of the union represents a <variant alternative>.
2055 Each <variant alternative> is represented as a struct,
2056 with a member for each <variant field>. */
2059 int new_offset = offset;
2061 /* This is pretty gross. In G++, the offset in an anonymous
2062 union is relative to the beginning of the enclosing struct.
2063 In the GNU Chill implementation of variant records,
2064 the bitpos is zero in an anonymous union field, so we
2065 have to add the offset of the union here. */
2066 if (TYPE_CODE (field_type) == TYPE_CODE_STRUCT
2067 || (TYPE_NFIELDS (field_type) > 0
2068 && TYPE_FIELD_BITPOS (field_type, 0) == 0))
2069 new_offset += TYPE_FIELD_BITPOS (type, i) / 8;
2071 v = search_struct_field (name, arg1, new_offset, field_type,
2072 looking_for_baseclass);
2079 for (i = 0; i < nbases; i++)
2082 struct type *basetype = check_typedef (TYPE_BASECLASS (type, i));
2083 /* If we are looking for baseclasses, this is what we get when we
2084 hit them. But it could happen that the base part's member name
2085 is not yet filled in. */
2086 int found_baseclass = (looking_for_baseclass
2087 && TYPE_BASECLASS_NAME (type, i) != NULL
2088 && (strcmp_iw (name, TYPE_BASECLASS_NAME (type, i)) == 0));
2090 if (BASETYPE_VIA_VIRTUAL (type, i))
2093 struct value *v2 = allocate_value (basetype);
2095 boffset = baseclass_offset (type, i,
2096 VALUE_CONTENTS (arg1) + offset,
2097 VALUE_ADDRESS (arg1)
2098 + VALUE_OFFSET (arg1) + offset);
2100 error ("virtual baseclass botch");
2102 /* The virtual base class pointer might have been clobbered by the
2103 user program. Make sure that it still points to a valid memory
2107 if (boffset < 0 || boffset >= TYPE_LENGTH (type))
2109 CORE_ADDR base_addr;
2111 base_addr = VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1) + boffset;
2112 if (target_read_memory (base_addr, VALUE_CONTENTS_RAW (v2),
2113 TYPE_LENGTH (basetype)) != 0)
2114 error ("virtual baseclass botch");
2115 VALUE_LVAL (v2) = lval_memory;
2116 VALUE_ADDRESS (v2) = base_addr;
2120 VALUE_LVAL (v2) = VALUE_LVAL (arg1);
2121 VALUE_ADDRESS (v2) = VALUE_ADDRESS (arg1);
2122 VALUE_OFFSET (v2) = VALUE_OFFSET (arg1) + boffset;
2123 if (VALUE_LAZY (arg1))
2124 VALUE_LAZY (v2) = 1;
2126 memcpy (VALUE_CONTENTS_RAW (v2),
2127 VALUE_CONTENTS_RAW (arg1) + boffset,
2128 TYPE_LENGTH (basetype));
2131 if (found_baseclass)
2133 v = search_struct_field (name, v2, 0, TYPE_BASECLASS (type, i),
2134 looking_for_baseclass);
2136 else if (found_baseclass)
2137 v = value_primitive_field (arg1, offset, i, type);
2139 v = search_struct_field (name, arg1,
2140 offset + TYPE_BASECLASS_BITPOS (type, i) / 8,
2141 basetype, looking_for_baseclass);
2149 /* Return the offset (in bytes) of the virtual base of type BASETYPE
2150 * in an object pointed to by VALADDR (on the host), assumed to be of
2151 * type TYPE. OFFSET is number of bytes beyond start of ARG to start
2152 * looking (in case VALADDR is the contents of an enclosing object).
2154 * This routine recurses on the primary base of the derived class because
2155 * the virtual base entries of the primary base appear before the other
2156 * virtual base entries.
2158 * If the virtual base is not found, a negative integer is returned.
2159 * The magnitude of the negative integer is the number of entries in
2160 * the virtual table to skip over (entries corresponding to various
2161 * ancestral classes in the chain of primary bases).
2163 * Important: This assumes the HP / Taligent C++ runtime
2164 * conventions. Use baseclass_offset() instead to deal with g++
2168 find_rt_vbase_offset (struct type *type, struct type *basetype, char *valaddr,
2169 int offset, int *boffset_p, int *skip_p)
2171 int boffset; /* offset of virtual base */
2172 int index; /* displacement to use in virtual table */
2176 CORE_ADDR vtbl; /* the virtual table pointer */
2177 struct type *pbc; /* the primary base class */
2179 /* Look for the virtual base recursively in the primary base, first.
2180 * This is because the derived class object and its primary base
2181 * subobject share the primary virtual table. */
2184 pbc = TYPE_PRIMARY_BASE (type);
2187 find_rt_vbase_offset (pbc, basetype, valaddr, offset, &boffset, &skip);
2190 *boffset_p = boffset;
2199 /* Find the index of the virtual base according to HP/Taligent
2200 runtime spec. (Depth-first, left-to-right.) */
2201 index = virtual_base_index_skip_primaries (basetype, type);
2205 *skip_p = skip + virtual_base_list_length_skip_primaries (type);
2210 /* pai: FIXME -- 32x64 possible problem */
2211 /* First word (4 bytes) in object layout is the vtable pointer */
2212 vtbl = *(CORE_ADDR *) (valaddr + offset);
2214 /* Before the constructor is invoked, things are usually zero'd out. */
2216 error ("Couldn't find virtual table -- object may not be constructed yet.");
2219 /* Find virtual base's offset -- jump over entries for primary base
2220 * ancestors, then use the index computed above. But also adjust by
2221 * HP_ACC_VBASE_START for the vtable slots before the start of the
2222 * virtual base entries. Offset is negative -- virtual base entries
2223 * appear _before_ the address point of the virtual table. */
2225 /* pai: FIXME -- 32x64 problem, if word = 8 bytes, change multiplier
2228 /* epstein : FIXME -- added param for overlay section. May not be correct */
2229 vp = value_at (builtin_type_int, vtbl + 4 * (-skip - index - HP_ACC_VBASE_START), NULL);
2230 boffset = value_as_long (vp);
2232 *boffset_p = boffset;
2237 /* Helper function used by value_struct_elt to recurse through baseclasses.
2238 Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
2239 and search in it assuming it has (class) type TYPE.
2240 If found, return value, else if name matched and args not return (value)-1,
2241 else return NULL. */
2243 static struct value *
2244 search_struct_method (char *name, struct value **arg1p,
2245 struct value **args, int offset,
2246 int *static_memfuncp, register struct type *type)
2250 int name_matched = 0;
2251 char dem_opname[64];
2253 CHECK_TYPEDEF (type);
2254 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
2256 char *t_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
2257 /* FIXME! May need to check for ARM demangling here */
2258 if (strncmp (t_field_name, "__", 2) == 0 ||
2259 strncmp (t_field_name, "op", 2) == 0 ||
2260 strncmp (t_field_name, "type", 4) == 0)
2262 if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI))
2263 t_field_name = dem_opname;
2264 else if (cplus_demangle_opname (t_field_name, dem_opname, 0))
2265 t_field_name = dem_opname;
2267 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
2269 int j = TYPE_FN_FIELDLIST_LENGTH (type, i) - 1;
2270 struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i);
2273 if (j > 0 && args == 0)
2274 error ("cannot resolve overloaded method `%s': no arguments supplied", name);
2277 if (TYPE_FN_FIELD_STUB (f, j))
2278 check_stub_method (type, i, j);
2279 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f, j),
2280 TYPE_FN_FIELD_ARGS (f, j), args))
2282 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
2283 return value_virtual_fn_field (arg1p, f, j, type, offset);
2284 if (TYPE_FN_FIELD_STATIC_P (f, j) && static_memfuncp)
2285 *static_memfuncp = 1;
2286 v = value_fn_field (arg1p, f, j, type, offset);
2295 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2299 if (BASETYPE_VIA_VIRTUAL (type, i))
2301 if (TYPE_HAS_VTABLE (type))
2303 /* HP aCC compiled type, search for virtual base offset
2304 according to HP/Taligent runtime spec. */
2306 find_rt_vbase_offset (type, TYPE_BASECLASS (type, i),
2307 VALUE_CONTENTS_ALL (*arg1p),
2308 offset + VALUE_EMBEDDED_OFFSET (*arg1p),
2309 &base_offset, &skip);
2311 error ("Virtual base class offset not found in vtable");
2315 struct type *baseclass = check_typedef (TYPE_BASECLASS (type, i));
2318 /* The virtual base class pointer might have been clobbered by the
2319 user program. Make sure that it still points to a valid memory
2322 if (offset < 0 || offset >= TYPE_LENGTH (type))
2324 base_valaddr = (char *) alloca (TYPE_LENGTH (baseclass));
2325 if (target_read_memory (VALUE_ADDRESS (*arg1p)
2326 + VALUE_OFFSET (*arg1p) + offset,
2328 TYPE_LENGTH (baseclass)) != 0)
2329 error ("virtual baseclass botch");
2332 base_valaddr = VALUE_CONTENTS (*arg1p) + offset;
2335 baseclass_offset (type, i, base_valaddr,
2336 VALUE_ADDRESS (*arg1p)
2337 + VALUE_OFFSET (*arg1p) + offset);
2338 if (base_offset == -1)
2339 error ("virtual baseclass botch");
2344 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
2346 v = search_struct_method (name, arg1p, args, base_offset + offset,
2347 static_memfuncp, TYPE_BASECLASS (type, i));
2348 if (v == (struct value *) - 1)
2354 /* FIXME-bothner: Why is this commented out? Why is it here? */
2355 /* *arg1p = arg1_tmp; */
2360 return (struct value *) - 1;
2365 /* Given *ARGP, a value of type (pointer to a)* structure/union,
2366 extract the component named NAME from the ultimate target structure/union
2367 and return it as a value with its appropriate type.
2368 ERR is used in the error message if *ARGP's type is wrong.
2370 C++: ARGS is a list of argument types to aid in the selection of
2371 an appropriate method. Also, handle derived types.
2373 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
2374 where the truthvalue of whether the function that was resolved was
2375 a static member function or not is stored.
2377 ERR is an error message to be printed in case the field is not found. */
2380 value_struct_elt (struct value **argp, struct value **args,
2381 char *name, int *static_memfuncp, char *err)
2383 register struct type *t;
2386 COERCE_ARRAY (*argp);
2388 t = check_typedef (VALUE_TYPE (*argp));
2390 /* Follow pointers until we get to a non-pointer. */
2392 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
2394 *argp = value_ind (*argp);
2395 /* Don't coerce fn pointer to fn and then back again! */
2396 if (TYPE_CODE (VALUE_TYPE (*argp)) != TYPE_CODE_FUNC)
2397 COERCE_ARRAY (*argp);
2398 t = check_typedef (VALUE_TYPE (*argp));
2401 if (TYPE_CODE (t) == TYPE_CODE_MEMBER)
2402 error ("not implemented: member type in value_struct_elt");
2404 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2405 && TYPE_CODE (t) != TYPE_CODE_UNION)
2406 error ("Attempt to extract a component of a value that is not a %s.", err);
2408 /* Assume it's not, unless we see that it is. */
2409 if (static_memfuncp)
2410 *static_memfuncp = 0;
2414 /* if there are no arguments ...do this... */
2416 /* Try as a field first, because if we succeed, there
2417 is less work to be done. */
2418 v = search_struct_field (name, *argp, 0, t, 0);
2422 /* C++: If it was not found as a data field, then try to
2423 return it as a pointer to a method. */
2425 if (destructor_name_p (name, t))
2426 error ("Cannot get value of destructor");
2428 v = search_struct_method (name, argp, args, 0, static_memfuncp, t);
2430 if (v == (struct value *) - 1)
2431 error ("Cannot take address of a method");
2434 if (TYPE_NFN_FIELDS (t))
2435 error ("There is no member or method named %s.", name);
2437 error ("There is no member named %s.", name);
2442 if (destructor_name_p (name, t))
2446 /* Destructors are a special case. */
2447 int m_index, f_index;
2450 if (get_destructor_fn_field (t, &m_index, &f_index))
2452 v = value_fn_field (NULL, TYPE_FN_FIELDLIST1 (t, m_index),
2456 error ("could not find destructor function named %s.", name);
2462 error ("destructor should not have any argument");
2466 v = search_struct_method (name, argp, args, 0, static_memfuncp, t);
2468 if (v == (struct value *) - 1)
2470 error ("One of the arguments you tried to pass to %s could not be converted to what the function wants.", name);
2474 /* See if user tried to invoke data as function. If so,
2475 hand it back. If it's not callable (i.e., a pointer to function),
2476 gdb should give an error. */
2477 v = search_struct_field (name, *argp, 0, t, 0);
2481 error ("Structure has no component named %s.", name);
2485 /* Search through the methods of an object (and its bases)
2486 * to find a specified method. Return the pointer to the
2487 * fn_field list of overloaded instances.
2488 * Helper function for value_find_oload_list.
2489 * ARGP is a pointer to a pointer to a value (the object)
2490 * METHOD is a string containing the method name
2491 * OFFSET is the offset within the value
2492 * STATIC_MEMFUNCP is set if the method is static
2493 * TYPE is the assumed type of the object
2494 * NUM_FNS is the number of overloaded instances
2495 * BASETYPE is set to the actual type of the subobject where the method is found
2496 * BOFFSET is the offset of the base subobject where the method is found */
2498 static struct fn_field *
2499 find_method_list (struct value **argp, char *method, int offset,
2500 int *static_memfuncp, struct type *type, int *num_fns,
2501 struct type **basetype, int *boffset)
2505 CHECK_TYPEDEF (type);
2509 /* First check in object itself */
2510 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
2512 /* pai: FIXME What about operators and type conversions? */
2513 char *fn_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
2514 if (fn_field_name && (strcmp_iw (fn_field_name, method) == 0))
2516 *num_fns = TYPE_FN_FIELDLIST_LENGTH (type, i);
2519 return TYPE_FN_FIELDLIST1 (type, i);
2523 /* Not found in object, check in base subobjects */
2524 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2527 if (BASETYPE_VIA_VIRTUAL (type, i))
2529 if (TYPE_HAS_VTABLE (type))
2531 /* HP aCC compiled type, search for virtual base offset
2532 * according to HP/Taligent runtime spec. */
2534 find_rt_vbase_offset (type, TYPE_BASECLASS (type, i),
2535 VALUE_CONTENTS_ALL (*argp),
2536 offset + VALUE_EMBEDDED_OFFSET (*argp),
2537 &base_offset, &skip);
2539 error ("Virtual base class offset not found in vtable");
2543 /* probably g++ runtime model */
2544 base_offset = VALUE_OFFSET (*argp) + offset;
2546 baseclass_offset (type, i,
2547 VALUE_CONTENTS (*argp) + base_offset,
2548 VALUE_ADDRESS (*argp) + base_offset);
2549 if (base_offset == -1)
2550 error ("virtual baseclass botch");
2554 /* non-virtual base, simply use bit position from debug info */
2556 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
2558 f = find_method_list (argp, method, base_offset + offset,
2559 static_memfuncp, TYPE_BASECLASS (type, i), num_fns, basetype, boffset);
2566 /* Return the list of overloaded methods of a specified name.
2567 * ARGP is a pointer to a pointer to a value (the object)
2568 * METHOD is the method name
2569 * OFFSET is the offset within the value contents
2570 * STATIC_MEMFUNCP is set if the method is static
2571 * NUM_FNS is the number of overloaded instances
2572 * BASETYPE is set to the type of the base subobject that defines the method
2573 * BOFFSET is the offset of the base subobject which defines the method */
2576 value_find_oload_method_list (struct value **argp, char *method, int offset,
2577 int *static_memfuncp, int *num_fns,
2578 struct type **basetype, int *boffset)
2582 t = check_typedef (VALUE_TYPE (*argp));
2584 /* code snarfed from value_struct_elt */
2585 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
2587 *argp = value_ind (*argp);
2588 /* Don't coerce fn pointer to fn and then back again! */
2589 if (TYPE_CODE (VALUE_TYPE (*argp)) != TYPE_CODE_FUNC)
2590 COERCE_ARRAY (*argp);
2591 t = check_typedef (VALUE_TYPE (*argp));
2594 if (TYPE_CODE (t) == TYPE_CODE_MEMBER)
2595 error ("Not implemented: member type in value_find_oload_lis");
2597 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2598 && TYPE_CODE (t) != TYPE_CODE_UNION)
2599 error ("Attempt to extract a component of a value that is not a struct or union");
2601 /* Assume it's not static, unless we see that it is. */
2602 if (static_memfuncp)
2603 *static_memfuncp = 0;
2605 return find_method_list (argp, method, 0, static_memfuncp, t, num_fns, basetype, boffset);
2609 /* Given an array of argument types (ARGTYPES) (which includes an
2610 entry for "this" in the case of C++ methods), the number of
2611 arguments NARGS, the NAME of a function whether it's a method or
2612 not (METHOD), and the degree of laxness (LAX) in conforming to
2613 overload resolution rules in ANSI C++, find the best function that
2614 matches on the argument types according to the overload resolution
2617 In the case of class methods, the parameter OBJ is an object value
2618 in which to search for overloaded methods.
2620 In the case of non-method functions, the parameter FSYM is a symbol
2621 corresponding to one of the overloaded functions.
2623 Return value is an integer: 0 -> good match, 10 -> debugger applied
2624 non-standard coercions, 100 -> incompatible.
2626 If a method is being searched for, VALP will hold the value.
2627 If a non-method is being searched for, SYMP will hold the symbol for it.
2629 If a method is being searched for, and it is a static method,
2630 then STATICP will point to a non-zero value.
2632 Note: This function does *not* check the value of
2633 overload_resolution. Caller must check it to see whether overload
2634 resolution is permitted.
2638 find_overload_match (struct type **arg_types, int nargs, char *name, int method,
2639 int lax, struct value *obj, struct symbol *fsym,
2640 struct value **valp, struct symbol **symp, int *staticp)
2643 struct type **parm_types;
2644 int champ_nparms = 0;
2646 short oload_champ = -1; /* Index of best overloaded function */
2647 short oload_ambiguous = 0; /* Current ambiguity state for overload resolution */
2648 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs */
2649 short oload_ambig_champ = -1; /* 2nd contender for best match */
2650 short oload_non_standard = 0; /* did we have to use non-standard conversions? */
2651 short oload_incompatible = 0; /* are args supplied incompatible with any function? */
2653 struct badness_vector *bv; /* A measure of how good an overloaded instance is */
2654 struct badness_vector *oload_champ_bv = NULL; /* The measure for the current best match */
2656 struct value *temp = obj;
2657 struct fn_field *fns_ptr = NULL; /* For methods, the list of overloaded methods */
2658 struct symbol **oload_syms = NULL; /* For non-methods, the list of overloaded function symbols */
2659 int num_fns = 0; /* Number of overloaded instances being considered */
2660 struct type *basetype = NULL;
2665 char *obj_type_name = NULL;
2666 char *func_name = NULL;
2668 /* Get the list of overloaded methods or functions */
2673 struct type *domain;
2674 obj_type_name = TYPE_NAME (VALUE_TYPE (obj));
2675 /* Hack: evaluate_subexp_standard often passes in a pointer
2676 value rather than the object itself, so try again */
2677 if ((!obj_type_name || !*obj_type_name) &&
2678 (TYPE_CODE (VALUE_TYPE (obj)) == TYPE_CODE_PTR))
2679 obj_type_name = TYPE_NAME (TYPE_TARGET_TYPE (VALUE_TYPE (obj)));
2681 fns_ptr = value_find_oload_method_list (&temp, name, 0,
2684 &basetype, &boffset);
2685 if (!fns_ptr || !num_fns)
2686 error ("Couldn't find method %s%s%s",
2688 (obj_type_name && *obj_type_name) ? "::" : "",
2690 domain = TYPE_DOMAIN_TYPE (fns_ptr[0].type);
2691 len = TYPE_NFN_FIELDS (domain);
2692 /* NOTE: dan/2000-03-10: This stuff is for STABS, which won't
2693 give us the info we need directly in the types. We have to
2694 use the method stub conversion to get it. Be aware that this
2695 is by no means perfect, and if you use STABS, please move to
2696 DWARF-2, or something like it, because trying to improve
2697 overloading using STABS is really a waste of time. */
2698 for (i = 0; i < len; i++)
2701 struct fn_field *f = TYPE_FN_FIELDLIST1 (domain, i);
2702 int len2 = TYPE_FN_FIELDLIST_LENGTH (domain, i);
2704 for (j = 0; j < len2; j++)
2706 if (TYPE_FN_FIELD_STUB (f, j) && (!strcmp_iw (TYPE_FN_FIELDLIST_NAME (domain,i),name)))
2707 check_stub_method (domain, i, j);
2714 func_name = cplus_demangle (SYMBOL_NAME (fsym), DMGL_NO_OPTS);
2716 /* If the name is NULL this must be a C-style function.
2717 Just return the same symbol. */
2724 oload_syms = make_symbol_overload_list (fsym);
2725 while (oload_syms[++i])
2728 error ("Couldn't find function %s", func_name);
2731 oload_champ_bv = NULL;
2733 /* Consider each candidate in turn */
2734 for (ix = 0; ix < num_fns; ix++)
2738 /* For static member functions, we won't have a this pointer, but nothing
2739 else seems to handle them right now, so we just pretend ourselves */
2742 if (TYPE_FN_FIELD_ARGS(fns_ptr,ix))
2744 while (TYPE_CODE(TYPE_FN_FIELD_ARGS(fns_ptr,ix)[nparms]) != TYPE_CODE_VOID)
2750 /* If it's not a method, this is the proper place */
2751 nparms=TYPE_NFIELDS(SYMBOL_TYPE(oload_syms[ix]));
2754 /* Prepare array of parameter types */
2755 parm_types = (struct type **) xmalloc (nparms * (sizeof (struct type *)));
2756 for (jj = 0; jj < nparms; jj++)
2757 parm_types[jj] = (method
2758 ? (TYPE_FN_FIELD_ARGS (fns_ptr, ix)[jj])
2759 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms[ix]), jj));
2761 /* Compare parameter types to supplied argument types */
2762 bv = rank_function (parm_types, nparms, arg_types, nargs);
2764 if (!oload_champ_bv)
2766 oload_champ_bv = bv;
2768 champ_nparms = nparms;
2771 /* See whether current candidate is better or worse than previous best */
2772 switch (compare_badness (bv, oload_champ_bv))
2775 oload_ambiguous = 1; /* top two contenders are equally good */
2776 oload_ambig_champ = ix;
2779 oload_ambiguous = 2; /* incomparable top contenders */
2780 oload_ambig_champ = ix;
2783 oload_champ_bv = bv; /* new champion, record details */
2784 oload_ambiguous = 0;
2786 oload_ambig_champ = -1;
2787 champ_nparms = nparms;
2797 fprintf_filtered (gdb_stderr,"Overloaded method instance %s, # of parms %d\n", fns_ptr[ix].physname, nparms);
2799 fprintf_filtered (gdb_stderr,"Overloaded function instance %s # of parms %d\n", SYMBOL_DEMANGLED_NAME (oload_syms[ix]), nparms);
2800 for (jj = 0; jj < nargs; jj++)
2801 fprintf_filtered (gdb_stderr,"...Badness @ %d : %d\n", jj, bv->rank[jj]);
2802 fprintf_filtered (gdb_stderr,"Overload resolution champion is %d, ambiguous? %d\n", oload_champ, oload_ambiguous);
2804 } /* end loop over all candidates */
2805 /* NOTE: dan/2000-03-10: Seems to be a better idea to just pick one
2806 if they have the exact same goodness. This is because there is no
2807 way to differentiate based on return type, which we need to in
2808 cases like overloads of .begin() <It's both const and non-const> */
2810 if (oload_ambiguous)
2813 error ("Cannot resolve overloaded method %s%s%s to unique instance; disambiguate by specifying function signature",
2815 (obj_type_name && *obj_type_name) ? "::" : "",
2818 error ("Cannot resolve overloaded function %s to unique instance; disambiguate by specifying function signature",
2823 /* Check how bad the best match is */
2824 for (ix = 1; ix <= nargs; ix++)
2826 if (oload_champ_bv->rank[ix] >= 100)
2827 oload_incompatible = 1; /* truly mismatched types */
2829 else if (oload_champ_bv->rank[ix] >= 10)
2830 oload_non_standard = 1; /* non-standard type conversions needed */
2832 if (oload_incompatible)
2835 error ("Cannot resolve method %s%s%s to any overloaded instance",
2837 (obj_type_name && *obj_type_name) ? "::" : "",
2840 error ("Cannot resolve function %s to any overloaded instance",
2843 else if (oload_non_standard)
2846 warning ("Using non-standard conversion to match method %s%s%s to supplied arguments",
2848 (obj_type_name && *obj_type_name) ? "::" : "",
2851 warning ("Using non-standard conversion to match function %s to supplied arguments",
2857 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr, oload_champ))
2858 *valp = value_virtual_fn_field (&temp, fns_ptr, oload_champ, basetype, boffset);
2860 *valp = value_fn_field (&temp, fns_ptr, oload_champ, basetype, boffset);
2864 *symp = oload_syms[oload_champ];
2868 return oload_incompatible ? 100 : (oload_non_standard ? 10 : 0);
2871 /* C++: return 1 is NAME is a legitimate name for the destructor
2872 of type TYPE. If TYPE does not have a destructor, or
2873 if NAME is inappropriate for TYPE, an error is signaled. */
2875 destructor_name_p (const char *name, const struct type *type)
2877 /* destructors are a special case. */
2881 char *dname = type_name_no_tag (type);
2882 char *cp = strchr (dname, '<');
2885 /* Do not compare the template part for template classes. */
2887 len = strlen (dname);
2890 if (strlen (name + 1) != len || !STREQN (dname, name + 1, len))
2891 error ("name of destructor must equal name of class");
2898 /* Helper function for check_field: Given TYPE, a structure/union,
2899 return 1 if the component named NAME from the ultimate
2900 target structure/union is defined, otherwise, return 0. */
2903 check_field_in (register struct type *type, const char *name)
2907 for (i = TYPE_NFIELDS (type) - 1; i >= TYPE_N_BASECLASSES (type); i--)
2909 char *t_field_name = TYPE_FIELD_NAME (type, i);
2910 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
2914 /* C++: If it was not found as a data field, then try to
2915 return it as a pointer to a method. */
2917 /* Destructors are a special case. */
2918 if (destructor_name_p (name, type))
2920 int m_index, f_index;
2922 return get_destructor_fn_field (type, &m_index, &f_index);
2925 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; --i)
2927 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type, i), name) == 0)
2931 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2932 if (check_field_in (TYPE_BASECLASS (type, i), name))
2939 /* C++: Given ARG1, a value of type (pointer to a)* structure/union,
2940 return 1 if the component named NAME from the ultimate
2941 target structure/union is defined, otherwise, return 0. */
2944 check_field (struct value *arg1, const char *name)
2946 register struct type *t;
2948 COERCE_ARRAY (arg1);
2950 t = VALUE_TYPE (arg1);
2952 /* Follow pointers until we get to a non-pointer. */
2957 if (TYPE_CODE (t) != TYPE_CODE_PTR && TYPE_CODE (t) != TYPE_CODE_REF)
2959 t = TYPE_TARGET_TYPE (t);
2962 if (TYPE_CODE (t) == TYPE_CODE_MEMBER)
2963 error ("not implemented: member type in check_field");
2965 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2966 && TYPE_CODE (t) != TYPE_CODE_UNION)
2967 error ("Internal error: `this' is not an aggregate");
2969 return check_field_in (t, name);
2972 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
2973 return the address of this member as a "pointer to member"
2974 type. If INTYPE is non-null, then it will be the type
2975 of the member we are looking for. This will help us resolve
2976 "pointers to member functions". This function is used
2977 to resolve user expressions of the form "DOMAIN::NAME". */
2980 value_struct_elt_for_reference (struct type *domain, int offset,
2981 struct type *curtype, char *name,
2982 struct type *intype)
2984 register struct type *t = curtype;
2988 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2989 && TYPE_CODE (t) != TYPE_CODE_UNION)
2990 error ("Internal error: non-aggregate type to value_struct_elt_for_reference");
2992 for (i = TYPE_NFIELDS (t) - 1; i >= TYPE_N_BASECLASSES (t); i--)
2994 char *t_field_name = TYPE_FIELD_NAME (t, i);
2996 if (t_field_name && STREQ (t_field_name, name))
2998 if (TYPE_FIELD_STATIC (t, i))
3000 v = value_static_field (t, i);
3002 error ("Internal error: could not find static variable %s",
3006 if (TYPE_FIELD_PACKED (t, i))
3007 error ("pointers to bitfield members not allowed");
3009 return value_from_longest
3010 (lookup_reference_type (lookup_member_type (TYPE_FIELD_TYPE (t, i),
3012 offset + (LONGEST) (TYPE_FIELD_BITPOS (t, i) >> 3));
3016 /* C++: If it was not found as a data field, then try to
3017 return it as a pointer to a method. */
3019 /* Destructors are a special case. */
3020 if (destructor_name_p (name, t))
3022 error ("member pointers to destructors not implemented yet");
3025 /* Perform all necessary dereferencing. */
3026 while (intype && TYPE_CODE (intype) == TYPE_CODE_PTR)
3027 intype = TYPE_TARGET_TYPE (intype);
3029 for (i = TYPE_NFN_FIELDS (t) - 1; i >= 0; --i)
3031 char *t_field_name = TYPE_FN_FIELDLIST_NAME (t, i);
3032 char dem_opname[64];
3034 if (strncmp (t_field_name, "__", 2) == 0 ||
3035 strncmp (t_field_name, "op", 2) == 0 ||
3036 strncmp (t_field_name, "type", 4) == 0)
3038 if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI))
3039 t_field_name = dem_opname;
3040 else if (cplus_demangle_opname (t_field_name, dem_opname, 0))
3041 t_field_name = dem_opname;
3043 if (t_field_name && STREQ (t_field_name, name))
3045 int j = TYPE_FN_FIELDLIST_LENGTH (t, i);
3046 struct fn_field *f = TYPE_FN_FIELDLIST1 (t, i);
3048 if (intype == 0 && j > 1)
3049 error ("non-unique member `%s' requires type instantiation", name);
3053 if (TYPE_FN_FIELD_TYPE (f, j) == intype)
3056 error ("no member function matches that type instantiation");
3061 if (TYPE_FN_FIELD_STUB (f, j))
3062 check_stub_method (t, i, j);
3063 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
3065 return value_from_longest
3066 (lookup_reference_type
3067 (lookup_member_type (TYPE_FN_FIELD_TYPE (f, j),
3069 (LONGEST) METHOD_PTR_FROM_VOFFSET (TYPE_FN_FIELD_VOFFSET (f, j)));
3073 struct symbol *s = lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j),
3074 0, VAR_NAMESPACE, 0, NULL);
3081 v = read_var_value (s, 0);
3083 VALUE_TYPE (v) = lookup_reference_type
3084 (lookup_member_type (TYPE_FN_FIELD_TYPE (f, j),
3092 for (i = TYPE_N_BASECLASSES (t) - 1; i >= 0; i--)
3097 if (BASETYPE_VIA_VIRTUAL (t, i))
3100 base_offset = TYPE_BASECLASS_BITPOS (t, i) / 8;
3101 v = value_struct_elt_for_reference (domain,
3102 offset + base_offset,
3103 TYPE_BASECLASS (t, i),
3113 /* Given a pointer value V, find the real (RTTI) type
3114 of the object it points to.
3115 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
3116 and refer to the values computed for the object pointed to. */
3119 value_rtti_target_type (struct value *v, int *full, int *top, int *using_enc)
3121 struct value *target;
3123 target = value_ind (v);
3125 return value_rtti_type (target, full, top, using_enc);
3128 /* Given a value pointed to by ARGP, check its real run-time type, and
3129 if that is different from the enclosing type, create a new value
3130 using the real run-time type as the enclosing type (and of the same
3131 type as ARGP) and return it, with the embedded offset adjusted to
3132 be the correct offset to the enclosed object
3133 RTYPE is the type, and XFULL, XTOP, and XUSING_ENC are the other
3134 parameters, computed by value_rtti_type(). If these are available,
3135 they can be supplied and a second call to value_rtti_type() is avoided.
3136 (Pass RTYPE == NULL if they're not available */
3139 value_full_object (struct value *argp, struct type *rtype, int xfull, int xtop,
3142 struct type *real_type;
3146 struct value *new_val;
3153 using_enc = xusing_enc;
3156 real_type = value_rtti_type (argp, &full, &top, &using_enc);
3158 /* If no RTTI data, or if object is already complete, do nothing */
3159 if (!real_type || real_type == VALUE_ENCLOSING_TYPE (argp))
3162 /* If we have the full object, but for some reason the enclosing
3163 type is wrong, set it *//* pai: FIXME -- sounds iffy */
3166 argp = value_change_enclosing_type (argp, real_type);
3170 /* Check if object is in memory */
3171 if (VALUE_LVAL (argp) != lval_memory)
3173 warning ("Couldn't retrieve complete object of RTTI type %s; object may be in register(s).", TYPE_NAME (real_type));
3178 /* All other cases -- retrieve the complete object */
3179 /* Go back by the computed top_offset from the beginning of the object,
3180 adjusting for the embedded offset of argp if that's what value_rtti_type
3181 used for its computation. */
3182 new_val = value_at_lazy (real_type, VALUE_ADDRESS (argp) - top +
3183 (using_enc ? 0 : VALUE_EMBEDDED_OFFSET (argp)),
3184 VALUE_BFD_SECTION (argp));
3185 VALUE_TYPE (new_val) = VALUE_TYPE (argp);
3186 VALUE_EMBEDDED_OFFSET (new_val) = using_enc ? top + VALUE_EMBEDDED_OFFSET (argp) : top;
3193 /* C++: return the value of the class instance variable, if one exists.
3194 Flag COMPLAIN signals an error if the request is made in an
3195 inappropriate context. */
3198 value_of_this (int complain)
3200 struct symbol *func, *sym;
3203 static const char funny_this[] = "this";
3206 if (selected_frame == 0)
3209 error ("no frame selected");
3214 func = get_frame_function (selected_frame);
3218 error ("no `this' in nameless context");
3223 b = SYMBOL_BLOCK_VALUE (func);
3224 i = BLOCK_NSYMS (b);
3228 error ("no args, no `this'");
3233 /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER
3234 symbol instead of the LOC_ARG one (if both exist). */
3235 sym = lookup_block_symbol (b, funny_this, VAR_NAMESPACE);
3239 error ("current stack frame not in method");
3244 this = read_var_value (sym, selected_frame);
3245 if (this == 0 && complain)
3246 error ("`this' argument at unknown address");
3250 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH elements
3251 long, starting at LOWBOUND. The result has the same lower bound as
3252 the original ARRAY. */
3255 value_slice (struct value *array, int lowbound, int length)
3257 struct type *slice_range_type, *slice_type, *range_type;
3258 LONGEST lowerbound, upperbound, offset;
3259 struct value *slice;
3260 struct type *array_type;
3261 array_type = check_typedef (VALUE_TYPE (array));
3262 COERCE_VARYING_ARRAY (array, array_type);
3263 if (TYPE_CODE (array_type) != TYPE_CODE_ARRAY
3264 && TYPE_CODE (array_type) != TYPE_CODE_STRING
3265 && TYPE_CODE (array_type) != TYPE_CODE_BITSTRING)
3266 error ("cannot take slice of non-array");
3267 range_type = TYPE_INDEX_TYPE (array_type);
3268 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
3269 error ("slice from bad array or bitstring");
3270 if (lowbound < lowerbound || length < 0
3271 || lowbound + length - 1 > upperbound
3272 /* Chill allows zero-length strings but not arrays. */
3273 || (current_language->la_language == language_chill
3274 && length == 0 && TYPE_CODE (array_type) == TYPE_CODE_ARRAY))
3275 error ("slice out of range");
3276 /* FIXME-type-allocation: need a way to free this type when we are
3278 slice_range_type = create_range_type ((struct type *) NULL,
3279 TYPE_TARGET_TYPE (range_type),
3280 lowbound, lowbound + length - 1);
3281 if (TYPE_CODE (array_type) == TYPE_CODE_BITSTRING)
3284 slice_type = create_set_type ((struct type *) NULL, slice_range_type);
3285 TYPE_CODE (slice_type) = TYPE_CODE_BITSTRING;
3286 slice = value_zero (slice_type, not_lval);
3287 for (i = 0; i < length; i++)
3289 int element = value_bit_index (array_type,
3290 VALUE_CONTENTS (array),
3293 error ("internal error accessing bitstring");
3294 else if (element > 0)
3296 int j = i % TARGET_CHAR_BIT;
3297 if (BITS_BIG_ENDIAN)
3298 j = TARGET_CHAR_BIT - 1 - j;
3299 VALUE_CONTENTS_RAW (slice)[i / TARGET_CHAR_BIT] |= (1 << j);
3302 /* We should set the address, bitssize, and bitspos, so the clice
3303 can be used on the LHS, but that may require extensions to
3304 value_assign. For now, just leave as a non_lval. FIXME. */
3308 struct type *element_type = TYPE_TARGET_TYPE (array_type);
3310 = (lowbound - lowerbound) * TYPE_LENGTH (check_typedef (element_type));
3311 slice_type = create_array_type ((struct type *) NULL, element_type,
3313 TYPE_CODE (slice_type) = TYPE_CODE (array_type);
3314 slice = allocate_value (slice_type);
3315 if (VALUE_LAZY (array))
3316 VALUE_LAZY (slice) = 1;
3318 memcpy (VALUE_CONTENTS (slice), VALUE_CONTENTS (array) + offset,
3319 TYPE_LENGTH (slice_type));
3320 if (VALUE_LVAL (array) == lval_internalvar)
3321 VALUE_LVAL (slice) = lval_internalvar_component;
3323 VALUE_LVAL (slice) = VALUE_LVAL (array);
3324 VALUE_ADDRESS (slice) = VALUE_ADDRESS (array);
3325 VALUE_OFFSET (slice) = VALUE_OFFSET (array) + offset;
3330 /* Assuming chill_varying_type (VARRAY) is true, return an equivalent
3331 value as a fixed-length array. */
3334 varying_to_slice (struct value *varray)
3336 struct type *vtype = check_typedef (VALUE_TYPE (varray));
3337 LONGEST length = unpack_long (TYPE_FIELD_TYPE (vtype, 0),
3338 VALUE_CONTENTS (varray)
3339 + TYPE_FIELD_BITPOS (vtype, 0) / 8);
3340 return value_slice (value_primitive_field (varray, 0, 1, vtype), 0, length);
3343 /* Create a value for a FORTRAN complex number. Currently most of
3344 the time values are coerced to COMPLEX*16 (i.e. a complex number
3345 composed of 2 doubles. This really should be a smarter routine
3346 that figures out precision inteligently as opposed to assuming
3347 doubles. FIXME: fmb */
3350 value_literal_complex (struct value *arg1, struct value *arg2, struct type *type)
3353 struct type *real_type = TYPE_TARGET_TYPE (type);
3355 val = allocate_value (type);
3356 arg1 = value_cast (real_type, arg1);
3357 arg2 = value_cast (real_type, arg2);
3359 memcpy (VALUE_CONTENTS_RAW (val),
3360 VALUE_CONTENTS (arg1), TYPE_LENGTH (real_type));
3361 memcpy (VALUE_CONTENTS_RAW (val) + TYPE_LENGTH (real_type),
3362 VALUE_CONTENTS (arg2), TYPE_LENGTH (real_type));
3366 /* Cast a value into the appropriate complex data type. */
3368 static struct value *
3369 cast_into_complex (struct type *type, struct value *val)
3371 struct type *real_type = TYPE_TARGET_TYPE (type);
3372 if (TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_COMPLEX)
3374 struct type *val_real_type = TYPE_TARGET_TYPE (VALUE_TYPE (val));
3375 struct value *re_val = allocate_value (val_real_type);
3376 struct value *im_val = allocate_value (val_real_type);
3378 memcpy (VALUE_CONTENTS_RAW (re_val),
3379 VALUE_CONTENTS (val), TYPE_LENGTH (val_real_type));
3380 memcpy (VALUE_CONTENTS_RAW (im_val),
3381 VALUE_CONTENTS (val) + TYPE_LENGTH (val_real_type),
3382 TYPE_LENGTH (val_real_type));
3384 return value_literal_complex (re_val, im_val, type);
3386 else if (TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_FLT
3387 || TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_INT)
3388 return value_literal_complex (val, value_zero (real_type, not_lval), type);
3390 error ("cannot cast non-number to complex");
3394 _initialize_valops (void)
3398 (add_set_cmd ("abandon", class_support, var_boolean, (char *) &auto_abandon,
3399 "Set automatic abandonment of expressions upon failure.",
3405 (add_set_cmd ("overload-resolution", class_support, var_boolean, (char *) &overload_resolution,
3406 "Set overload resolution in evaluating C++ functions.",
3409 overload_resolution = 1;
3412 add_set_cmd ("unwindonsignal", no_class, var_boolean,
3413 (char *) &unwind_on_signal_p,
3414 "Set unwinding of stack if a signal is received while in a call dummy.\n\
3415 The unwindonsignal lets the user determine what gdb should do if a signal\n\
3416 is received while in a function called from gdb (call dummy). If set, gdb\n\
3417 unwinds the stack and restore the context to what as it was before the call.\n\
3418 The default is to stop in the frame where the signal was received.", &setlist),