1 /* Perform non-arithmetic operations on values, for GDB.
2 Copyright 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995,
3 1996, 1997, 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
37 #include "gdb_string.h"
39 /* Flag indicating HP compilers were used; needed to correctly handle some
40 value operations with HP aCC code/runtime. */
41 extern int hp_som_som_object_present;
43 extern int overload_debug;
44 /* Local functions. */
46 static int typecmp (int staticp, struct type *t1[], value_ptr t2[]);
48 static CORE_ADDR find_function_addr (value_ptr, struct type **);
49 static value_ptr value_arg_coerce (value_ptr, struct type *, int);
52 static CORE_ADDR value_push (CORE_ADDR, value_ptr);
54 static value_ptr search_struct_field (char *, value_ptr, int,
57 static value_ptr search_struct_method (char *, value_ptr *,
59 int, int *, struct type *);
61 static int check_field_in (struct type *, const char *);
63 static CORE_ADDR allocate_space_in_inferior (int);
65 static value_ptr cast_into_complex (struct type *, value_ptr);
67 static struct fn_field *find_method_list (value_ptr * argp, char *method,
68 int offset, int *static_memfuncp,
69 struct type *type, int *num_fns,
70 struct type **basetype,
73 void _initialize_valops (void);
75 /* Flag for whether we want to abandon failed expression evals by default. */
78 static int auto_abandon = 0;
81 int overload_resolution = 0;
83 /* This boolean tells what gdb should do if a signal is received while in
84 a function called from gdb (call dummy). If set, gdb unwinds the stack
85 and restore the context to what as it was before the call.
86 The default is to stop in the frame where the signal was received. */
88 int unwind_on_signal_p = 0;
92 /* Find the address of function name NAME in the inferior. */
95 find_function_in_inferior (char *name)
97 register struct symbol *sym;
98 sym = lookup_symbol (name, 0, VAR_NAMESPACE, 0, NULL);
101 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
103 error ("\"%s\" exists in this program but is not a function.",
106 return value_of_variable (sym, NULL);
110 struct minimal_symbol *msymbol = lookup_minimal_symbol (name, NULL, NULL);
115 type = lookup_pointer_type (builtin_type_char);
116 type = lookup_function_type (type);
117 type = lookup_pointer_type (type);
118 maddr = SYMBOL_VALUE_ADDRESS (msymbol);
119 return value_from_pointer (type, maddr);
123 if (!target_has_execution)
124 error ("evaluation of this expression requires the target program to be active");
126 error ("evaluation of this expression requires the program to have a function \"%s\".", name);
131 /* Allocate NBYTES of space in the inferior using the inferior's malloc
132 and return a value that is a pointer to the allocated space. */
135 value_allocate_space_in_inferior (int len)
138 register value_ptr val = find_function_in_inferior ("malloc");
140 blocklen = value_from_longest (builtin_type_int, (LONGEST) len);
141 val = call_function_by_hand (val, 1, &blocklen);
142 if (value_logical_not (val))
144 if (!target_has_execution)
145 error ("No memory available to program now: you need to start the target first");
147 error ("No memory available to program: call to malloc failed");
153 allocate_space_in_inferior (int len)
155 return value_as_long (value_allocate_space_in_inferior (len));
158 /* Cast value ARG2 to type TYPE and return as a value.
159 More general than a C cast: accepts any two types of the same length,
160 and if ARG2 is an lvalue it can be cast into anything at all. */
161 /* In C++, casts may change pointer or object representations. */
164 value_cast (struct type *type, register value_ptr arg2)
166 register enum type_code code1;
167 register enum type_code code2;
171 int convert_to_boolean = 0;
173 if (VALUE_TYPE (arg2) == type)
176 CHECK_TYPEDEF (type);
177 code1 = TYPE_CODE (type);
179 type2 = check_typedef (VALUE_TYPE (arg2));
181 /* A cast to an undetermined-length array_type, such as (TYPE [])OBJECT,
182 is treated like a cast to (TYPE [N])OBJECT,
183 where N is sizeof(OBJECT)/sizeof(TYPE). */
184 if (code1 == TYPE_CODE_ARRAY)
186 struct type *element_type = TYPE_TARGET_TYPE (type);
187 unsigned element_length = TYPE_LENGTH (check_typedef (element_type));
188 if (element_length > 0
189 && TYPE_ARRAY_UPPER_BOUND_TYPE (type) == BOUND_CANNOT_BE_DETERMINED)
191 struct type *range_type = TYPE_INDEX_TYPE (type);
192 int val_length = TYPE_LENGTH (type2);
193 LONGEST low_bound, high_bound, new_length;
194 if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0)
195 low_bound = 0, high_bound = 0;
196 new_length = val_length / element_length;
197 if (val_length % element_length != 0)
198 warning ("array element type size does not divide object size in cast");
199 /* FIXME-type-allocation: need a way to free this type when we are
201 range_type = create_range_type ((struct type *) NULL,
202 TYPE_TARGET_TYPE (range_type),
204 new_length + low_bound - 1);
205 VALUE_TYPE (arg2) = create_array_type ((struct type *) NULL,
206 element_type, range_type);
211 if (current_language->c_style_arrays
212 && TYPE_CODE (type2) == TYPE_CODE_ARRAY)
213 arg2 = value_coerce_array (arg2);
215 if (TYPE_CODE (type2) == TYPE_CODE_FUNC)
216 arg2 = value_coerce_function (arg2);
218 type2 = check_typedef (VALUE_TYPE (arg2));
219 COERCE_VARYING_ARRAY (arg2, type2);
220 code2 = TYPE_CODE (type2);
222 if (code1 == TYPE_CODE_COMPLEX)
223 return cast_into_complex (type, arg2);
224 if (code1 == TYPE_CODE_BOOL)
226 code1 = TYPE_CODE_INT;
227 convert_to_boolean = 1;
229 if (code1 == TYPE_CODE_CHAR)
230 code1 = TYPE_CODE_INT;
231 if (code2 == TYPE_CODE_BOOL || code2 == TYPE_CODE_CHAR)
232 code2 = TYPE_CODE_INT;
234 scalar = (code2 == TYPE_CODE_INT || code2 == TYPE_CODE_FLT
235 || code2 == TYPE_CODE_ENUM || code2 == TYPE_CODE_RANGE);
237 if (code1 == TYPE_CODE_STRUCT
238 && code2 == TYPE_CODE_STRUCT
239 && TYPE_NAME (type) != 0)
241 /* Look in the type of the source to see if it contains the
242 type of the target as a superclass. If so, we'll need to
243 offset the object in addition to changing its type. */
244 value_ptr v = search_struct_field (type_name_no_tag (type),
248 VALUE_TYPE (v) = type;
252 if (code1 == TYPE_CODE_FLT && scalar)
253 return value_from_double (type, value_as_double (arg2));
254 else if ((code1 == TYPE_CODE_INT || code1 == TYPE_CODE_ENUM
255 || code1 == TYPE_CODE_RANGE)
256 && (scalar || code2 == TYPE_CODE_PTR))
260 if (hp_som_som_object_present && /* if target compiled by HP aCC */
261 (code2 == TYPE_CODE_PTR))
266 switch (TYPE_CODE (TYPE_TARGET_TYPE (type2)))
268 /* With HP aCC, pointers to data members have a bias */
269 case TYPE_CODE_MEMBER:
270 retvalp = value_from_longest (type, value_as_long (arg2));
271 /* force evaluation */
272 ptr = (unsigned int *) VALUE_CONTENTS (retvalp);
273 *ptr &= ~0x20000000; /* zap 29th bit to remove bias */
276 /* While pointers to methods don't really point to a function */
277 case TYPE_CODE_METHOD:
278 error ("Pointers to methods not supported with HP aCC");
281 break; /* fall out and go to normal handling */
285 /* When we cast pointers to integers, we mustn't use
286 POINTER_TO_ADDRESS to find the address the pointer
287 represents, as value_as_long would. GDB should evaluate
288 expressions just as the compiler would --- and the compiler
289 sees a cast as a simple reinterpretation of the pointer's
291 if (code2 == TYPE_CODE_PTR)
292 longest = extract_unsigned_integer (VALUE_CONTENTS (arg2),
293 TYPE_LENGTH (type2));
295 longest = value_as_long (arg2);
296 return value_from_longest (type, convert_to_boolean ?
297 (LONGEST) (longest ? 1 : 0) : longest);
299 else if (code1 == TYPE_CODE_PTR && (code2 == TYPE_CODE_INT ||
300 code2 == TYPE_CODE_ENUM ||
301 code2 == TYPE_CODE_RANGE))
303 /* TYPE_LENGTH (type) is the length of a pointer, but we really
304 want the length of an address! -- we are really dealing with
305 addresses (i.e., gdb representations) not pointers (i.e.,
306 target representations) here.
308 This allows things like "print *(int *)0x01000234" to work
309 without printing a misleading message -- which would
310 otherwise occur when dealing with a target having two byte
311 pointers and four byte addresses. */
313 int addr_bit = TARGET_ADDR_BIT;
315 LONGEST longest = value_as_long (arg2);
316 if (addr_bit < sizeof (LONGEST) * HOST_CHAR_BIT)
318 if (longest >= ((LONGEST) 1 << addr_bit)
319 || longest <= -((LONGEST) 1 << addr_bit))
320 warning ("value truncated");
322 return value_from_longest (type, longest);
324 else if (TYPE_LENGTH (type) == TYPE_LENGTH (type2))
326 if (code1 == TYPE_CODE_PTR && code2 == TYPE_CODE_PTR)
328 struct type *t1 = check_typedef (TYPE_TARGET_TYPE (type));
329 struct type *t2 = check_typedef (TYPE_TARGET_TYPE (type2));
330 if (TYPE_CODE (t1) == TYPE_CODE_STRUCT
331 && TYPE_CODE (t2) == TYPE_CODE_STRUCT
332 && !value_logical_not (arg2))
336 /* Look in the type of the source to see if it contains the
337 type of the target as a superclass. If so, we'll need to
338 offset the pointer rather than just change its type. */
339 if (TYPE_NAME (t1) != NULL)
341 v = search_struct_field (type_name_no_tag (t1),
342 value_ind (arg2), 0, t2, 1);
346 VALUE_TYPE (v) = type;
351 /* Look in the type of the target to see if it contains the
352 type of the source as a superclass. If so, we'll need to
353 offset the pointer rather than just change its type.
354 FIXME: This fails silently with virtual inheritance. */
355 if (TYPE_NAME (t2) != NULL)
357 v = search_struct_field (type_name_no_tag (t2),
358 value_zero (t1, not_lval), 0, t1, 1);
361 value_ptr v2 = value_ind (arg2);
362 VALUE_ADDRESS (v2) -= VALUE_ADDRESS (v)
365 /* JYG: adjust the new pointer value and
367 v2->aligner.contents[0] -= VALUE_EMBEDDED_OFFSET (v);
368 VALUE_EMBEDDED_OFFSET (v2) = 0;
370 v2 = value_addr (v2);
371 VALUE_TYPE (v2) = type;
376 /* No superclass found, just fall through to change ptr type. */
378 VALUE_TYPE (arg2) = type;
379 arg2 = value_change_enclosing_type (arg2, type);
380 VALUE_POINTED_TO_OFFSET (arg2) = 0; /* pai: chk_val */
383 else if (chill_varying_type (type))
385 struct type *range1, *range2, *eltype1, *eltype2;
388 LONGEST low_bound, high_bound;
389 char *valaddr, *valaddr_data;
390 /* For lint warning about eltype2 possibly uninitialized: */
392 if (code2 == TYPE_CODE_BITSTRING)
393 error ("not implemented: converting bitstring to varying type");
394 if ((code2 != TYPE_CODE_ARRAY && code2 != TYPE_CODE_STRING)
395 || (eltype1 = check_typedef (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, 1))),
396 eltype2 = check_typedef (TYPE_TARGET_TYPE (type2)),
397 (TYPE_LENGTH (eltype1) != TYPE_LENGTH (eltype2)
398 /* || TYPE_CODE (eltype1) != TYPE_CODE (eltype2) */ )))
399 error ("Invalid conversion to varying type");
400 range1 = TYPE_FIELD_TYPE (TYPE_FIELD_TYPE (type, 1), 0);
401 range2 = TYPE_FIELD_TYPE (type2, 0);
402 if (get_discrete_bounds (range1, &low_bound, &high_bound) < 0)
405 count1 = high_bound - low_bound + 1;
406 if (get_discrete_bounds (range2, &low_bound, &high_bound) < 0)
407 count1 = -1, count2 = 0; /* To force error before */
409 count2 = high_bound - low_bound + 1;
411 error ("target varying type is too small");
412 val = allocate_value (type);
413 valaddr = VALUE_CONTENTS_RAW (val);
414 valaddr_data = valaddr + TYPE_FIELD_BITPOS (type, 1) / 8;
415 /* Set val's __var_length field to count2. */
416 store_signed_integer (valaddr, TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0)),
418 /* Set the __var_data field to count2 elements copied from arg2. */
419 memcpy (valaddr_data, VALUE_CONTENTS (arg2),
420 count2 * TYPE_LENGTH (eltype2));
421 /* Zero the rest of the __var_data field of val. */
422 memset (valaddr_data + count2 * TYPE_LENGTH (eltype2), '\0',
423 (count1 - count2) * TYPE_LENGTH (eltype2));
426 else if (VALUE_LVAL (arg2) == lval_memory)
428 return value_at_lazy (type, VALUE_ADDRESS (arg2) + VALUE_OFFSET (arg2),
429 VALUE_BFD_SECTION (arg2));
431 else if (code1 == TYPE_CODE_VOID)
433 return value_zero (builtin_type_void, not_lval);
437 error ("Invalid cast.");
442 /* Create a value of type TYPE that is zero, and return it. */
445 value_zero (struct type *type, enum lval_type lv)
447 register value_ptr val = allocate_value (type);
449 memset (VALUE_CONTENTS (val), 0, TYPE_LENGTH (check_typedef (type)));
450 VALUE_LVAL (val) = lv;
455 /* Return a value with type TYPE located at ADDR.
457 Call value_at only if the data needs to be fetched immediately;
458 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
459 value_at_lazy instead. value_at_lazy simply records the address of
460 the data and sets the lazy-evaluation-required flag. The lazy flag
461 is tested in the VALUE_CONTENTS macro, which is used if and when
462 the contents are actually required.
464 Note: value_at does *NOT* handle embedded offsets; perform such
465 adjustments before or after calling it. */
468 value_at (struct type *type, CORE_ADDR addr, asection *sect)
470 register value_ptr val;
472 if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
473 error ("Attempt to dereference a generic pointer.");
475 val = allocate_value (type);
477 read_memory (addr, VALUE_CONTENTS_ALL_RAW (val), TYPE_LENGTH (type));
479 VALUE_LVAL (val) = lval_memory;
480 VALUE_ADDRESS (val) = addr;
481 VALUE_BFD_SECTION (val) = sect;
486 /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
489 value_at_lazy (struct type *type, CORE_ADDR addr, asection *sect)
491 register value_ptr val;
493 if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
494 error ("Attempt to dereference a generic pointer.");
496 val = allocate_value (type);
498 VALUE_LVAL (val) = lval_memory;
499 VALUE_ADDRESS (val) = addr;
500 VALUE_LAZY (val) = 1;
501 VALUE_BFD_SECTION (val) = sect;
506 /* Called only from the VALUE_CONTENTS and VALUE_CONTENTS_ALL macros,
507 if the current data for a variable needs to be loaded into
508 VALUE_CONTENTS(VAL). Fetches the data from the user's process, and
509 clears the lazy flag to indicate that the data in the buffer is valid.
511 If the value is zero-length, we avoid calling read_memory, which would
512 abort. We mark the value as fetched anyway -- all 0 bytes of it.
514 This function returns a value because it is used in the VALUE_CONTENTS
515 macro as part of an expression, where a void would not work. The
519 value_fetch_lazy (register value_ptr val)
521 CORE_ADDR addr = VALUE_ADDRESS (val) + VALUE_OFFSET (val);
522 int length = TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val));
524 struct type *type = VALUE_TYPE (val);
526 read_memory (addr, VALUE_CONTENTS_ALL_RAW (val), length);
528 VALUE_LAZY (val) = 0;
533 /* Store the contents of FROMVAL into the location of TOVAL.
534 Return a new value with the location of TOVAL and contents of FROMVAL. */
537 value_assign (register value_ptr toval, register value_ptr fromval)
539 register struct type *type;
540 register value_ptr val;
541 char *raw_buffer = (char*) alloca (MAX_REGISTER_RAW_SIZE);
544 if (!toval->modifiable)
545 error ("Left operand of assignment is not a modifiable lvalue.");
549 type = VALUE_TYPE (toval);
550 if (VALUE_LVAL (toval) != lval_internalvar)
551 fromval = value_cast (type, fromval);
553 COERCE_ARRAY (fromval);
554 CHECK_TYPEDEF (type);
556 /* If TOVAL is a special machine register requiring conversion
557 of program values to a special raw format,
558 convert FROMVAL's contents now, with result in `raw_buffer',
559 and set USE_BUFFER to the number of bytes to write. */
561 if (VALUE_REGNO (toval) >= 0)
563 int regno = VALUE_REGNO (toval);
564 if (REGISTER_CONVERTIBLE (regno))
566 struct type *fromtype = check_typedef (VALUE_TYPE (fromval));
567 REGISTER_CONVERT_TO_RAW (fromtype, regno,
568 VALUE_CONTENTS (fromval), raw_buffer);
569 use_buffer = REGISTER_RAW_SIZE (regno);
573 switch (VALUE_LVAL (toval))
575 case lval_internalvar:
576 set_internalvar (VALUE_INTERNALVAR (toval), fromval);
577 val = value_copy (VALUE_INTERNALVAR (toval)->value);
578 val = value_change_enclosing_type (val, VALUE_ENCLOSING_TYPE (fromval));
579 VALUE_EMBEDDED_OFFSET (val) = VALUE_EMBEDDED_OFFSET (fromval);
580 VALUE_POINTED_TO_OFFSET (val) = VALUE_POINTED_TO_OFFSET (fromval);
583 case lval_internalvar_component:
584 set_internalvar_component (VALUE_INTERNALVAR (toval),
585 VALUE_OFFSET (toval),
586 VALUE_BITPOS (toval),
587 VALUE_BITSIZE (toval),
594 CORE_ADDR changed_addr;
597 if (VALUE_BITSIZE (toval))
599 char buffer[sizeof (LONGEST)];
600 /* We assume that the argument to read_memory is in units of
601 host chars. FIXME: Is that correct? */
602 changed_len = (VALUE_BITPOS (toval)
603 + VALUE_BITSIZE (toval)
607 if (changed_len > (int) sizeof (LONGEST))
608 error ("Can't handle bitfields which don't fit in a %d bit word.",
609 sizeof (LONGEST) * HOST_CHAR_BIT);
611 read_memory (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
612 buffer, changed_len);
613 modify_field (buffer, value_as_long (fromval),
614 VALUE_BITPOS (toval), VALUE_BITSIZE (toval));
615 changed_addr = VALUE_ADDRESS (toval) + VALUE_OFFSET (toval);
616 dest_buffer = buffer;
620 changed_addr = VALUE_ADDRESS (toval) + VALUE_OFFSET (toval);
621 changed_len = use_buffer;
622 dest_buffer = raw_buffer;
626 changed_addr = VALUE_ADDRESS (toval) + VALUE_OFFSET (toval);
627 changed_len = TYPE_LENGTH (type);
628 dest_buffer = VALUE_CONTENTS (fromval);
631 write_memory (changed_addr, dest_buffer, changed_len);
632 if (memory_changed_hook)
633 memory_changed_hook (changed_addr, changed_len);
638 if (VALUE_BITSIZE (toval))
640 char buffer[sizeof (LONGEST)];
642 REGISTER_RAW_SIZE (VALUE_REGNO (toval)) - VALUE_OFFSET (toval);
644 if (len > (int) sizeof (LONGEST))
645 error ("Can't handle bitfields in registers larger than %d bits.",
646 sizeof (LONGEST) * HOST_CHAR_BIT);
648 if (VALUE_BITPOS (toval) + VALUE_BITSIZE (toval)
649 > len * HOST_CHAR_BIT)
650 /* Getting this right would involve being very careful about
652 error ("Can't assign to bitfields that cross register "
655 read_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
657 modify_field (buffer, value_as_long (fromval),
658 VALUE_BITPOS (toval), VALUE_BITSIZE (toval));
659 write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
663 write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
664 raw_buffer, use_buffer);
667 /* Do any conversion necessary when storing this type to more
668 than one register. */
669 #ifdef REGISTER_CONVERT_FROM_TYPE
670 memcpy (raw_buffer, VALUE_CONTENTS (fromval), TYPE_LENGTH (type));
671 REGISTER_CONVERT_FROM_TYPE (VALUE_REGNO (toval), type, raw_buffer);
672 write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
673 raw_buffer, TYPE_LENGTH (type));
675 write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
676 VALUE_CONTENTS (fromval), TYPE_LENGTH (type));
679 /* Assigning to the stack pointer, frame pointer, and other
680 (architecture and calling convention specific) registers may
681 cause the frame cache to be out of date. We just do this
682 on all assignments to registers for simplicity; I doubt the slowdown
684 reinit_frame_cache ();
687 case lval_reg_frame_relative:
689 /* value is stored in a series of registers in the frame
690 specified by the structure. Copy that value out, modify
691 it, and copy it back in. */
692 int amount_to_copy = (VALUE_BITSIZE (toval) ? 1 : TYPE_LENGTH (type));
693 int reg_size = REGISTER_RAW_SIZE (VALUE_FRAME_REGNUM (toval));
694 int byte_offset = VALUE_OFFSET (toval) % reg_size;
695 int reg_offset = VALUE_OFFSET (toval) / reg_size;
698 /* Make the buffer large enough in all cases. */
699 char *buffer = (char *) alloca (amount_to_copy
701 + MAX_REGISTER_RAW_SIZE);
704 struct frame_info *frame;
706 /* Figure out which frame this is in currently. */
707 for (frame = get_current_frame ();
708 frame && FRAME_FP (frame) != VALUE_FRAME (toval);
709 frame = get_prev_frame (frame))
713 error ("Value being assigned to is no longer active.");
715 amount_to_copy += (reg_size - amount_to_copy % reg_size);
718 for ((regno = VALUE_FRAME_REGNUM (toval) + reg_offset,
720 amount_copied < amount_to_copy;
721 amount_copied += reg_size, regno++)
723 get_saved_register (buffer + amount_copied,
724 (int *) NULL, (CORE_ADDR *) NULL,
725 frame, regno, (enum lval_type *) NULL);
728 /* Modify what needs to be modified. */
729 if (VALUE_BITSIZE (toval))
730 modify_field (buffer + byte_offset,
731 value_as_long (fromval),
732 VALUE_BITPOS (toval), VALUE_BITSIZE (toval));
734 memcpy (buffer + byte_offset, raw_buffer, use_buffer);
736 memcpy (buffer + byte_offset, VALUE_CONTENTS (fromval),
740 for ((regno = VALUE_FRAME_REGNUM (toval) + reg_offset,
742 amount_copied < amount_to_copy;
743 amount_copied += reg_size, regno++)
749 /* Just find out where to put it. */
750 get_saved_register ((char *) NULL,
751 &optim, &addr, frame, regno, &lval);
754 error ("Attempt to assign to a value that was optimized out.");
755 if (lval == lval_memory)
756 write_memory (addr, buffer + amount_copied, reg_size);
757 else if (lval == lval_register)
758 write_register_bytes (addr, buffer + amount_copied, reg_size);
760 error ("Attempt to assign to an unmodifiable value.");
763 if (register_changed_hook)
764 register_changed_hook (-1);
770 error ("Left operand of assignment is not an lvalue.");
773 /* If the field does not entirely fill a LONGEST, then zero the sign bits.
774 If the field is signed, and is negative, then sign extend. */
775 if ((VALUE_BITSIZE (toval) > 0)
776 && (VALUE_BITSIZE (toval) < 8 * (int) sizeof (LONGEST)))
778 LONGEST fieldval = value_as_long (fromval);
779 LONGEST valmask = (((ULONGEST) 1) << VALUE_BITSIZE (toval)) - 1;
782 if (!TYPE_UNSIGNED (type) && (fieldval & (valmask ^ (valmask >> 1))))
783 fieldval |= ~valmask;
785 fromval = value_from_longest (type, fieldval);
788 val = value_copy (toval);
789 memcpy (VALUE_CONTENTS_RAW (val), VALUE_CONTENTS (fromval),
791 VALUE_TYPE (val) = type;
792 val = value_change_enclosing_type (val, VALUE_ENCLOSING_TYPE (fromval));
793 VALUE_EMBEDDED_OFFSET (val) = VALUE_EMBEDDED_OFFSET (fromval);
794 VALUE_POINTED_TO_OFFSET (val) = VALUE_POINTED_TO_OFFSET (fromval);
799 /* Extend a value VAL to COUNT repetitions of its type. */
802 value_repeat (value_ptr arg1, int count)
804 register value_ptr val;
806 if (VALUE_LVAL (arg1) != lval_memory)
807 error ("Only values in memory can be extended with '@'.");
809 error ("Invalid number %d of repetitions.", count);
811 val = allocate_repeat_value (VALUE_ENCLOSING_TYPE (arg1), count);
813 read_memory (VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1),
814 VALUE_CONTENTS_ALL_RAW (val),
815 TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val)));
816 VALUE_LVAL (val) = lval_memory;
817 VALUE_ADDRESS (val) = VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1);
823 value_of_variable (struct symbol *var, struct block *b)
826 struct frame_info *frame = NULL;
829 frame = NULL; /* Use selected frame. */
830 else if (symbol_read_needs_frame (var))
832 frame = block_innermost_frame (b);
835 if (BLOCK_FUNCTION (b)
836 && SYMBOL_SOURCE_NAME (BLOCK_FUNCTION (b)))
837 error ("No frame is currently executing in block %s.",
838 SYMBOL_SOURCE_NAME (BLOCK_FUNCTION (b)));
840 error ("No frame is currently executing in specified block");
844 val = read_var_value (var, frame);
846 error ("Address of symbol \"%s\" is unknown.", SYMBOL_SOURCE_NAME (var));
851 /* Given a value which is an array, return a value which is a pointer to its
852 first element, regardless of whether or not the array has a nonzero lower
855 FIXME: A previous comment here indicated that this routine should be
856 substracting the array's lower bound. It's not clear to me that this
857 is correct. Given an array subscripting operation, it would certainly
858 work to do the adjustment here, essentially computing:
860 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
862 However I believe a more appropriate and logical place to account for
863 the lower bound is to do so in value_subscript, essentially computing:
865 (&array[0] + ((index - lowerbound) * sizeof array[0]))
867 As further evidence consider what would happen with operations other
868 than array subscripting, where the caller would get back a value that
869 had an address somewhere before the actual first element of the array,
870 and the information about the lower bound would be lost because of
871 the coercion to pointer type.
875 value_coerce_array (value_ptr arg1)
877 register struct type *type = check_typedef (VALUE_TYPE (arg1));
879 if (VALUE_LVAL (arg1) != lval_memory)
880 error ("Attempt to take address of value not located in memory.");
882 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
883 (VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1)));
886 /* Given a value which is a function, return a value which is a pointer
890 value_coerce_function (value_ptr arg1)
894 if (VALUE_LVAL (arg1) != lval_memory)
895 error ("Attempt to take address of value not located in memory.");
897 retval = value_from_pointer (lookup_pointer_type (VALUE_TYPE (arg1)),
898 (VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1)));
899 VALUE_BFD_SECTION (retval) = VALUE_BFD_SECTION (arg1);
903 /* Return a pointer value for the object for which ARG1 is the contents. */
906 value_addr (value_ptr arg1)
910 struct type *type = check_typedef (VALUE_TYPE (arg1));
911 if (TYPE_CODE (type) == TYPE_CODE_REF)
913 /* Copy the value, but change the type from (T&) to (T*).
914 We keep the same location information, which is efficient,
915 and allows &(&X) to get the location containing the reference. */
916 arg2 = value_copy (arg1);
917 VALUE_TYPE (arg2) = lookup_pointer_type (TYPE_TARGET_TYPE (type));
920 if (TYPE_CODE (type) == TYPE_CODE_FUNC)
921 return value_coerce_function (arg1);
923 if (VALUE_LVAL (arg1) != lval_memory)
924 error ("Attempt to take address of value not located in memory.");
926 /* Get target memory address */
927 arg2 = value_from_pointer (lookup_pointer_type (VALUE_TYPE (arg1)),
928 (VALUE_ADDRESS (arg1)
929 + VALUE_OFFSET (arg1)
930 + VALUE_EMBEDDED_OFFSET (arg1)));
932 /* This may be a pointer to a base subobject; so remember the
933 full derived object's type ... */
934 arg2 = value_change_enclosing_type (arg2, lookup_pointer_type (VALUE_ENCLOSING_TYPE (arg1)));
935 /* ... and also the relative position of the subobject in the full object */
936 VALUE_POINTED_TO_OFFSET (arg2) = VALUE_EMBEDDED_OFFSET (arg1);
937 VALUE_BFD_SECTION (arg2) = VALUE_BFD_SECTION (arg1);
941 /* Given a value of a pointer type, apply the C unary * operator to it. */
944 value_ind (value_ptr arg1)
946 struct type *base_type;
951 base_type = check_typedef (VALUE_TYPE (arg1));
953 if (TYPE_CODE (base_type) == TYPE_CODE_MEMBER)
954 error ("not implemented: member types in value_ind");
956 /* Allow * on an integer so we can cast it to whatever we want.
957 This returns an int, which seems like the most C-like thing
958 to do. "long long" variables are rare enough that
959 BUILTIN_TYPE_LONGEST would seem to be a mistake. */
960 if (TYPE_CODE (base_type) == TYPE_CODE_INT)
961 return value_at (builtin_type_int,
962 (CORE_ADDR) value_as_long (arg1),
963 VALUE_BFD_SECTION (arg1));
964 else if (TYPE_CODE (base_type) == TYPE_CODE_PTR)
966 struct type *enc_type;
967 /* We may be pointing to something embedded in a larger object */
968 /* Get the real type of the enclosing object */
969 enc_type = check_typedef (VALUE_ENCLOSING_TYPE (arg1));
970 enc_type = TYPE_TARGET_TYPE (enc_type);
971 /* Retrieve the enclosing object pointed to */
972 arg2 = value_at_lazy (enc_type,
973 value_as_address (arg1) - VALUE_POINTED_TO_OFFSET (arg1),
974 VALUE_BFD_SECTION (arg1));
976 VALUE_TYPE (arg2) = TYPE_TARGET_TYPE (base_type);
977 /* Add embedding info */
978 arg2 = value_change_enclosing_type (arg2, enc_type);
979 VALUE_EMBEDDED_OFFSET (arg2) = VALUE_POINTED_TO_OFFSET (arg1);
981 /* We may be pointing to an object of some derived type */
982 arg2 = value_full_object (arg2, NULL, 0, 0, 0);
986 error ("Attempt to take contents of a non-pointer value.");
987 return 0; /* For lint -- never reached */
990 /* Pushing small parts of stack frames. */
992 /* Push one word (the size of object that a register holds). */
995 push_word (CORE_ADDR sp, ULONGEST word)
997 register int len = REGISTER_SIZE;
998 char *buffer = alloca (MAX_REGISTER_RAW_SIZE);
1000 store_unsigned_integer (buffer, len, word);
1001 if (INNER_THAN (1, 2))
1003 /* stack grows downward */
1005 write_memory (sp, buffer, len);
1009 /* stack grows upward */
1010 write_memory (sp, buffer, len);
1017 /* Push LEN bytes with data at BUFFER. */
1020 push_bytes (CORE_ADDR sp, char *buffer, int len)
1022 if (INNER_THAN (1, 2))
1024 /* stack grows downward */
1026 write_memory (sp, buffer, len);
1030 /* stack grows upward */
1031 write_memory (sp, buffer, len);
1038 #ifndef PARM_BOUNDARY
1039 #define PARM_BOUNDARY (0)
1042 /* Push onto the stack the specified value VALUE. Pad it correctly for
1043 it to be an argument to a function. */
1046 value_push (register CORE_ADDR sp, value_ptr arg)
1048 register int len = TYPE_LENGTH (VALUE_ENCLOSING_TYPE (arg));
1049 register int container_len = len;
1050 register int offset;
1052 /* How big is the container we're going to put this value in? */
1054 container_len = ((len + PARM_BOUNDARY / TARGET_CHAR_BIT - 1)
1055 & ~(PARM_BOUNDARY / TARGET_CHAR_BIT - 1));
1057 /* Are we going to put it at the high or low end of the container? */
1058 if (TARGET_BYTE_ORDER == BIG_ENDIAN)
1059 offset = container_len - len;
1063 if (INNER_THAN (1, 2))
1065 /* stack grows downward */
1066 sp -= container_len;
1067 write_memory (sp + offset, VALUE_CONTENTS_ALL (arg), len);
1071 /* stack grows upward */
1072 write_memory (sp + offset, VALUE_CONTENTS_ALL (arg), len);
1073 sp += container_len;
1079 #ifndef PUSH_ARGUMENTS
1080 #define PUSH_ARGUMENTS default_push_arguments
1084 default_push_arguments (int nargs, value_ptr *args, CORE_ADDR sp,
1085 int struct_return, CORE_ADDR struct_addr)
1087 /* ASSERT ( !struct_return); */
1089 for (i = nargs - 1; i >= 0; i--)
1090 sp = value_push (sp, args[i]);
1095 /* A default function for COERCE_FLOAT_TO_DOUBLE: do the coercion only
1096 when we don't have any type for the argument at hand. This occurs
1097 when we have no debug info, or when passing varargs.
1099 This is an annoying default: the rule the compiler follows is to do
1100 the standard promotions whenever there is no prototype in scope,
1101 and almost all targets want this behavior. But there are some old
1102 architectures which want this odd behavior. If you want to go
1103 through them all and fix them, please do. Modern gdbarch-style
1104 targets may find it convenient to use standard_coerce_float_to_double. */
1106 default_coerce_float_to_double (struct type *formal, struct type *actual)
1108 return formal == NULL;
1112 /* Always coerce floats to doubles when there is no prototype in scope.
1113 If your architecture follows the standard type promotion rules for
1114 calling unprototyped functions, your gdbarch init function can pass
1115 this function to set_gdbarch_coerce_float_to_double to use its logic. */
1117 standard_coerce_float_to_double (struct type *formal, struct type *actual)
1123 /* Perform the standard coercions that are specified
1124 for arguments to be passed to C functions.
1126 If PARAM_TYPE is non-NULL, it is the expected parameter type.
1127 IS_PROTOTYPED is non-zero if the function declaration is prototyped. */
1130 value_arg_coerce (value_ptr arg, struct type *param_type, int is_prototyped)
1132 register struct type *arg_type = check_typedef (VALUE_TYPE (arg));
1133 register struct type *type
1134 = param_type ? check_typedef (param_type) : arg_type;
1136 switch (TYPE_CODE (type))
1139 if (TYPE_CODE (arg_type) != TYPE_CODE_REF)
1141 arg = value_addr (arg);
1142 VALUE_TYPE (arg) = param_type;
1147 case TYPE_CODE_CHAR:
1148 case TYPE_CODE_BOOL:
1149 case TYPE_CODE_ENUM:
1150 /* If we don't have a prototype, coerce to integer type if necessary. */
1153 if (TYPE_LENGTH (type) < TYPE_LENGTH (builtin_type_int))
1154 type = builtin_type_int;
1156 /* Currently all target ABIs require at least the width of an integer
1157 type for an argument. We may have to conditionalize the following
1158 type coercion for future targets. */
1159 if (TYPE_LENGTH (type) < TYPE_LENGTH (builtin_type_int))
1160 type = builtin_type_int;
1163 /* FIXME: We should always convert floats to doubles in the
1164 non-prototyped case. As many debugging formats include
1165 no information about prototyping, we have to live with
1166 COERCE_FLOAT_TO_DOUBLE for now. */
1167 if (!is_prototyped && COERCE_FLOAT_TO_DOUBLE (param_type, arg_type))
1169 if (TYPE_LENGTH (type) < TYPE_LENGTH (builtin_type_double))
1170 type = builtin_type_double;
1171 else if (TYPE_LENGTH (type) > TYPE_LENGTH (builtin_type_double))
1172 type = builtin_type_long_double;
1175 case TYPE_CODE_FUNC:
1176 type = lookup_pointer_type (type);
1178 case TYPE_CODE_ARRAY:
1179 if (current_language->c_style_arrays)
1180 type = lookup_pointer_type (TYPE_TARGET_TYPE (type));
1182 case TYPE_CODE_UNDEF:
1184 case TYPE_CODE_STRUCT:
1185 case TYPE_CODE_UNION:
1186 case TYPE_CODE_VOID:
1188 case TYPE_CODE_RANGE:
1189 case TYPE_CODE_STRING:
1190 case TYPE_CODE_BITSTRING:
1191 case TYPE_CODE_ERROR:
1192 case TYPE_CODE_MEMBER:
1193 case TYPE_CODE_METHOD:
1194 case TYPE_CODE_COMPLEX:
1199 return value_cast (type, arg);
1202 /* Determine a function's address and its return type from its value.
1203 Calls error() if the function is not valid for calling. */
1206 find_function_addr (value_ptr function, struct type **retval_type)
1208 register struct type *ftype = check_typedef (VALUE_TYPE (function));
1209 register enum type_code code = TYPE_CODE (ftype);
1210 struct type *value_type;
1213 /* If it's a member function, just look at the function
1216 /* Determine address to call. */
1217 if (code == TYPE_CODE_FUNC || code == TYPE_CODE_METHOD)
1219 funaddr = VALUE_ADDRESS (function);
1220 value_type = TYPE_TARGET_TYPE (ftype);
1222 else if (code == TYPE_CODE_PTR)
1224 funaddr = value_as_address (function);
1225 ftype = check_typedef (TYPE_TARGET_TYPE (ftype));
1226 if (TYPE_CODE (ftype) == TYPE_CODE_FUNC
1227 || TYPE_CODE (ftype) == TYPE_CODE_METHOD)
1229 funaddr = CONVERT_FROM_FUNC_PTR_ADDR (funaddr);
1230 value_type = TYPE_TARGET_TYPE (ftype);
1233 value_type = builtin_type_int;
1235 else if (code == TYPE_CODE_INT)
1237 /* Handle the case of functions lacking debugging info.
1238 Their values are characters since their addresses are char */
1239 if (TYPE_LENGTH (ftype) == 1)
1240 funaddr = value_as_address (value_addr (function));
1242 /* Handle integer used as address of a function. */
1243 funaddr = (CORE_ADDR) value_as_long (function);
1245 value_type = builtin_type_int;
1248 error ("Invalid data type for function to be called.");
1250 *retval_type = value_type;
1254 /* All this stuff with a dummy frame may seem unnecessarily complicated
1255 (why not just save registers in GDB?). The purpose of pushing a dummy
1256 frame which looks just like a real frame is so that if you call a
1257 function and then hit a breakpoint (get a signal, etc), "backtrace"
1258 will look right. Whether the backtrace needs to actually show the
1259 stack at the time the inferior function was called is debatable, but
1260 it certainly needs to not display garbage. So if you are contemplating
1261 making dummy frames be different from normal frames, consider that. */
1263 /* Perform a function call in the inferior.
1264 ARGS is a vector of values of arguments (NARGS of them).
1265 FUNCTION is a value, the function to be called.
1266 Returns a value representing what the function returned.
1267 May fail to return, if a breakpoint or signal is hit
1268 during the execution of the function.
1270 ARGS is modified to contain coerced values. */
1272 static value_ptr hand_function_call (value_ptr function, int nargs,
1275 hand_function_call (value_ptr function, int nargs, value_ptr *args)
1277 register CORE_ADDR sp;
1281 /* CALL_DUMMY is an array of words (REGISTER_SIZE), but each word
1282 is in host byte order. Before calling FIX_CALL_DUMMY, we byteswap it
1283 and remove any extra bytes which might exist because ULONGEST is
1284 bigger than REGISTER_SIZE.
1286 NOTE: This is pretty wierd, as the call dummy is actually a
1287 sequence of instructions. But CISC machines will have
1288 to pack the instructions into REGISTER_SIZE units (and
1289 so will RISC machines for which INSTRUCTION_SIZE is not
1292 NOTE: This is pretty stupid. CALL_DUMMY should be in strict
1293 target byte order. */
1295 static ULONGEST *dummy;
1299 struct type *value_type;
1300 unsigned char struct_return;
1301 CORE_ADDR struct_addr = 0;
1302 struct inferior_status *inf_status;
1303 struct cleanup *old_chain;
1305 int using_gcc; /* Set to version of gcc in use, or zero if not gcc */
1307 struct type *param_type = NULL;
1308 struct type *ftype = check_typedef (SYMBOL_TYPE (function));
1310 dummy = alloca (SIZEOF_CALL_DUMMY_WORDS);
1311 sizeof_dummy1 = REGISTER_SIZE * SIZEOF_CALL_DUMMY_WORDS / sizeof (ULONGEST);
1312 dummy1 = alloca (sizeof_dummy1);
1313 memcpy (dummy, CALL_DUMMY_WORDS, SIZEOF_CALL_DUMMY_WORDS);
1315 if (!target_has_execution)
1318 inf_status = save_inferior_status (1);
1319 old_chain = make_cleanup_restore_inferior_status (inf_status);
1321 /* PUSH_DUMMY_FRAME is responsible for saving the inferior registers
1322 (and POP_FRAME for restoring them). (At least on most machines)
1323 they are saved on the stack in the inferior. */
1326 old_sp = sp = read_sp ();
1328 if (INNER_THAN (1, 2))
1330 /* Stack grows down */
1331 sp -= sizeof_dummy1;
1336 /* Stack grows up */
1338 sp += sizeof_dummy1;
1341 funaddr = find_function_addr (function, &value_type);
1342 CHECK_TYPEDEF (value_type);
1345 struct block *b = block_for_pc (funaddr);
1346 /* If compiled without -g, assume GCC 2. */
1347 using_gcc = (b == NULL ? 2 : BLOCK_GCC_COMPILED (b));
1350 /* Are we returning a value using a structure return or a normal
1353 struct_return = using_struct_return (function, funaddr, value_type,
1356 /* Create a call sequence customized for this function
1357 and the number of arguments for it. */
1358 for (i = 0; i < (int) (SIZEOF_CALL_DUMMY_WORDS / sizeof (dummy[0])); i++)
1359 store_unsigned_integer (&dummy1[i * REGISTER_SIZE],
1361 (ULONGEST) dummy[i]);
1363 #ifdef GDB_TARGET_IS_HPPA
1364 real_pc = FIX_CALL_DUMMY (dummy1, start_sp, funaddr, nargs, args,
1365 value_type, using_gcc);
1367 FIX_CALL_DUMMY (dummy1, start_sp, funaddr, nargs, args,
1368 value_type, using_gcc);
1372 if (CALL_DUMMY_LOCATION == ON_STACK)
1374 write_memory (start_sp, (char *) dummy1, sizeof_dummy1);
1377 if (CALL_DUMMY_LOCATION == BEFORE_TEXT_END)
1379 /* Convex Unix prohibits executing in the stack segment. */
1380 /* Hope there is empty room at the top of the text segment. */
1381 extern CORE_ADDR text_end;
1382 static int checked = 0;
1384 for (start_sp = text_end - sizeof_dummy1; start_sp < text_end; ++start_sp)
1385 if (read_memory_integer (start_sp, 1) != 0)
1386 error ("text segment full -- no place to put call");
1389 real_pc = text_end - sizeof_dummy1;
1390 write_memory (real_pc, (char *) dummy1, sizeof_dummy1);
1393 if (CALL_DUMMY_LOCATION == AFTER_TEXT_END)
1395 extern CORE_ADDR text_end;
1399 errcode = target_write_memory (real_pc, (char *) dummy1, sizeof_dummy1);
1401 error ("Cannot write text segment -- call_function failed");
1404 if (CALL_DUMMY_LOCATION == AT_ENTRY_POINT)
1410 sp = old_sp; /* It really is used, for some ifdef's... */
1413 if (nargs < TYPE_NFIELDS (ftype))
1414 error ("too few arguments in function call");
1416 for (i = nargs - 1; i >= 0; i--)
1418 /* If we're off the end of the known arguments, do the standard
1419 promotions. FIXME: if we had a prototype, this should only
1420 be allowed if ... were present. */
1421 if (i >= TYPE_NFIELDS (ftype))
1422 args[i] = value_arg_coerce (args[i], NULL, 0);
1426 int is_prototyped = TYPE_FLAGS (ftype) & TYPE_FLAG_PROTOTYPED;
1427 param_type = TYPE_FIELD_TYPE (ftype, i);
1429 args[i] = value_arg_coerce (args[i], param_type, is_prototyped);
1432 /*elz: this code is to handle the case in which the function to be called
1433 has a pointer to function as parameter and the corresponding actual argument
1434 is the address of a function and not a pointer to function variable.
1435 In aCC compiled code, the calls through pointers to functions (in the body
1436 of the function called by hand) are made via $$dyncall_external which
1437 requires some registers setting, this is taken care of if we call
1438 via a function pointer variable, but not via a function address.
1439 In cc this is not a problem. */
1443 /* if this parameter is a pointer to function */
1444 if (TYPE_CODE (param_type) == TYPE_CODE_PTR)
1445 if (TYPE_CODE (param_type->target_type) == TYPE_CODE_FUNC)
1446 /* elz: FIXME here should go the test about the compiler used
1447 to compile the target. We want to issue the error
1448 message only if the compiler used was HP's aCC.
1449 If we used HP's cc, then there is no problem and no need
1450 to return at this point */
1451 if (using_gcc == 0) /* && compiler == aCC */
1452 /* go see if the actual parameter is a variable of type
1453 pointer to function or just a function */
1454 if (args[i]->lval == not_lval)
1457 if (find_pc_partial_function ((CORE_ADDR) args[i]->aligner.contents[0], &arg_name, NULL, NULL))
1459 You cannot use function <%s> as argument. \n\
1460 You must use a pointer to function type variable. Command ignored.", arg_name);
1464 if (REG_STRUCT_HAS_ADDR_P ())
1466 /* This is a machine like the sparc, where we may need to pass a
1467 pointer to the structure, not the structure itself. */
1468 for (i = nargs - 1; i >= 0; i--)
1470 struct type *arg_type = check_typedef (VALUE_TYPE (args[i]));
1471 if ((TYPE_CODE (arg_type) == TYPE_CODE_STRUCT
1472 || TYPE_CODE (arg_type) == TYPE_CODE_UNION
1473 || TYPE_CODE (arg_type) == TYPE_CODE_ARRAY
1474 || TYPE_CODE (arg_type) == TYPE_CODE_STRING
1475 || TYPE_CODE (arg_type) == TYPE_CODE_BITSTRING
1476 || TYPE_CODE (arg_type) == TYPE_CODE_SET
1477 || (TYPE_CODE (arg_type) == TYPE_CODE_FLT
1478 && TYPE_LENGTH (arg_type) > 8)
1480 && REG_STRUCT_HAS_ADDR (using_gcc, arg_type))
1483 int len; /* = TYPE_LENGTH (arg_type); */
1485 arg_type = check_typedef (VALUE_ENCLOSING_TYPE (args[i]));
1486 len = TYPE_LENGTH (arg_type);
1488 if (STACK_ALIGN_P ())
1489 /* MVS 11/22/96: I think at least some of this
1490 stack_align code is really broken. Better to let
1491 PUSH_ARGUMENTS adjust the stack in a target-defined
1493 aligned_len = STACK_ALIGN (len);
1496 if (INNER_THAN (1, 2))
1498 /* stack grows downward */
1500 /* ... so the address of the thing we push is the
1501 stack pointer after we push it. */
1506 /* The stack grows up, so the address of the thing
1507 we push is the stack pointer before we push it. */
1511 /* Push the structure. */
1512 write_memory (addr, VALUE_CONTENTS_ALL (args[i]), len);
1513 /* The value we're going to pass is the address of the
1514 thing we just pushed. */
1515 /*args[i] = value_from_longest (lookup_pointer_type (value_type),
1517 args[i] = value_from_pointer (lookup_pointer_type (arg_type),
1524 /* Reserve space for the return structure to be written on the
1525 stack, if necessary */
1529 int len = TYPE_LENGTH (value_type);
1530 if (STACK_ALIGN_P ())
1531 /* MVS 11/22/96: I think at least some of this stack_align
1532 code is really broken. Better to let PUSH_ARGUMENTS adjust
1533 the stack in a target-defined manner. */
1534 len = STACK_ALIGN (len);
1535 if (INNER_THAN (1, 2))
1537 /* stack grows downward */
1543 /* stack grows upward */
1549 /* elz: on HPPA no need for this extra alignment, maybe it is needed
1550 on other architectures. This is because all the alignment is
1551 taken care of in the above code (ifdef REG_STRUCT_HAS_ADDR) and
1552 in hppa_push_arguments */
1553 if (EXTRA_STACK_ALIGNMENT_NEEDED)
1555 /* MVS 11/22/96: I think at least some of this stack_align code
1556 is really broken. Better to let PUSH_ARGUMENTS adjust the
1557 stack in a target-defined manner. */
1558 if (STACK_ALIGN_P () && INNER_THAN (1, 2))
1560 /* If stack grows down, we must leave a hole at the top. */
1563 for (i = nargs - 1; i >= 0; i--)
1564 len += TYPE_LENGTH (VALUE_ENCLOSING_TYPE (args[i]));
1565 if (CALL_DUMMY_STACK_ADJUST_P)
1566 len += CALL_DUMMY_STACK_ADJUST;
1567 sp -= STACK_ALIGN (len) - len;
1571 sp = PUSH_ARGUMENTS (nargs, args, sp, struct_return, struct_addr);
1573 if (PUSH_RETURN_ADDRESS_P ())
1574 /* for targets that use no CALL_DUMMY */
1575 /* There are a number of targets now which actually don't write
1576 any CALL_DUMMY instructions into the target, but instead just
1577 save the machine state, push the arguments, and jump directly
1578 to the callee function. Since this doesn't actually involve
1579 executing a JSR/BSR instruction, the return address must be set
1580 up by hand, either by pushing onto the stack or copying into a
1581 return-address register as appropriate. Formerly this has been
1582 done in PUSH_ARGUMENTS, but that's overloading its
1583 functionality a bit, so I'm making it explicit to do it here. */
1584 sp = PUSH_RETURN_ADDRESS (real_pc, sp);
1586 if (STACK_ALIGN_P () && !INNER_THAN (1, 2))
1588 /* If stack grows up, we must leave a hole at the bottom, note
1589 that sp already has been advanced for the arguments! */
1590 if (CALL_DUMMY_STACK_ADJUST_P)
1591 sp += CALL_DUMMY_STACK_ADJUST;
1592 sp = STACK_ALIGN (sp);
1595 /* XXX This seems wrong. For stacks that grow down we shouldn't do
1597 /* MVS 11/22/96: I think at least some of this stack_align code is
1598 really broken. Better to let PUSH_ARGUMENTS adjust the stack in
1599 a target-defined manner. */
1600 if (CALL_DUMMY_STACK_ADJUST_P)
1601 if (INNER_THAN (1, 2))
1603 /* stack grows downward */
1604 sp -= CALL_DUMMY_STACK_ADJUST;
1607 /* Store the address at which the structure is supposed to be
1608 written. Note that this (and the code which reserved the space
1609 above) assumes that gcc was used to compile this function. Since
1610 it doesn't cost us anything but space and if the function is pcc
1611 it will ignore this value, we will make that assumption.
1613 Also note that on some machines (like the sparc) pcc uses a
1614 convention like gcc's. */
1617 STORE_STRUCT_RETURN (struct_addr, sp);
1619 /* Write the stack pointer. This is here because the statements above
1620 might fool with it. On SPARC, this write also stores the register
1621 window into the right place in the new stack frame, which otherwise
1622 wouldn't happen. (See store_inferior_registers in sparc-nat.c.) */
1625 if (SAVE_DUMMY_FRAME_TOS_P ())
1626 SAVE_DUMMY_FRAME_TOS (sp);
1629 char *retbuf = (char*) alloca (REGISTER_BYTES);
1631 struct symbol *symbol;
1634 symbol = find_pc_function (funaddr);
1637 name = SYMBOL_SOURCE_NAME (symbol);
1641 /* Try the minimal symbols. */
1642 struct minimal_symbol *msymbol = lookup_minimal_symbol_by_pc (funaddr);
1646 name = SYMBOL_SOURCE_NAME (msymbol);
1652 sprintf (format, "at %s", local_hex_format ());
1654 /* FIXME-32x64: assumes funaddr fits in a long. */
1655 sprintf (name, format, (unsigned long) funaddr);
1658 /* Execute the stack dummy routine, calling FUNCTION.
1659 When it is done, discard the empty frame
1660 after storing the contents of all regs into retbuf. */
1661 rc = run_stack_dummy (real_pc + CALL_DUMMY_START_OFFSET, retbuf);
1665 /* We stopped inside the FUNCTION because of a random signal.
1666 Further execution of the FUNCTION is not allowed. */
1668 if (unwind_on_signal_p)
1670 /* The user wants the context restored. */
1672 /* We must get back to the frame we were before the dummy call. */
1675 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1676 a C++ name with arguments and stuff. */
1678 The program being debugged was signaled while in a function called from GDB.\n\
1679 GDB has restored the context to what it was before the call.\n\
1680 To change this behavior use \"set unwindonsignal off\"\n\
1681 Evaluation of the expression containing the function (%s) will be abandoned.",
1686 /* The user wants to stay in the frame where we stopped (default).*/
1688 /* If we did the cleanups, we would print a spurious error
1689 message (Unable to restore previously selected frame),
1690 would write the registers from the inf_status (which is
1691 wrong), and would do other wrong things. */
1692 discard_cleanups (old_chain);
1693 discard_inferior_status (inf_status);
1695 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1696 a C++ name with arguments and stuff. */
1698 The program being debugged was signaled while in a function called from GDB.\n\
1699 GDB remains in the frame where the signal was received.\n\
1700 To change this behavior use \"set unwindonsignal on\"\n\
1701 Evaluation of the expression containing the function (%s) will be abandoned.",
1708 /* We hit a breakpoint inside the FUNCTION. */
1710 /* If we did the cleanups, we would print a spurious error
1711 message (Unable to restore previously selected frame),
1712 would write the registers from the inf_status (which is
1713 wrong), and would do other wrong things. */
1714 discard_cleanups (old_chain);
1715 discard_inferior_status (inf_status);
1717 /* The following error message used to say "The expression
1718 which contained the function call has been discarded." It
1719 is a hard concept to explain in a few words. Ideally, GDB
1720 would be able to resume evaluation of the expression when
1721 the function finally is done executing. Perhaps someday
1722 this will be implemented (it would not be easy). */
1724 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1725 a C++ name with arguments and stuff. */
1727 The program being debugged stopped while in a function called from GDB.\n\
1728 When the function (%s) is done executing, GDB will silently\n\
1729 stop (instead of continuing to evaluate the expression containing\n\
1730 the function call).", name);
1733 /* If we get here the called FUNCTION run to completion. */
1734 do_cleanups (old_chain);
1736 /* Figure out the value returned by the function. */
1737 /* elz: I defined this new macro for the hppa architecture only.
1738 this gives us a way to get the value returned by the function from the stack,
1739 at the same address we told the function to put it.
1740 We cannot assume on the pa that r28 still contains the address of the returned
1741 structure. Usually this will be overwritten by the callee.
1742 I don't know about other architectures, so I defined this macro
1745 #ifdef VALUE_RETURNED_FROM_STACK
1747 return (value_ptr) VALUE_RETURNED_FROM_STACK (value_type, struct_addr);
1750 return value_being_returned (value_type, retbuf, struct_return);
1755 call_function_by_hand (value_ptr function, int nargs, value_ptr *args)
1759 return hand_function_call (function, nargs, args);
1763 error ("Cannot invoke functions on this machine.");
1769 /* Create a value for an array by allocating space in the inferior, copying
1770 the data into that space, and then setting up an array value.
1772 The array bounds are set from LOWBOUND and HIGHBOUND, and the array is
1773 populated from the values passed in ELEMVEC.
1775 The element type of the array is inherited from the type of the
1776 first element, and all elements must have the same size (though we
1777 don't currently enforce any restriction on their types). */
1780 value_array (int lowbound, int highbound, value_ptr *elemvec)
1784 unsigned int typelength;
1786 struct type *rangetype;
1787 struct type *arraytype;
1790 /* Validate that the bounds are reasonable and that each of the elements
1791 have the same size. */
1793 nelem = highbound - lowbound + 1;
1796 error ("bad array bounds (%d, %d)", lowbound, highbound);
1798 typelength = TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec[0]));
1799 for (idx = 1; idx < nelem; idx++)
1801 if (TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec[idx])) != typelength)
1803 error ("array elements must all be the same size");
1807 rangetype = create_range_type ((struct type *) NULL, builtin_type_int,
1808 lowbound, highbound);
1809 arraytype = create_array_type ((struct type *) NULL,
1810 VALUE_ENCLOSING_TYPE (elemvec[0]), rangetype);
1812 if (!current_language->c_style_arrays)
1814 val = allocate_value (arraytype);
1815 for (idx = 0; idx < nelem; idx++)
1817 memcpy (VALUE_CONTENTS_ALL_RAW (val) + (idx * typelength),
1818 VALUE_CONTENTS_ALL (elemvec[idx]),
1821 VALUE_BFD_SECTION (val) = VALUE_BFD_SECTION (elemvec[0]);
1825 /* Allocate space to store the array in the inferior, and then initialize
1826 it by copying in each element. FIXME: Is it worth it to create a
1827 local buffer in which to collect each value and then write all the
1828 bytes in one operation? */
1830 addr = allocate_space_in_inferior (nelem * typelength);
1831 for (idx = 0; idx < nelem; idx++)
1833 write_memory (addr + (idx * typelength), VALUE_CONTENTS_ALL (elemvec[idx]),
1837 /* Create the array type and set up an array value to be evaluated lazily. */
1839 val = value_at_lazy (arraytype, addr, VALUE_BFD_SECTION (elemvec[0]));
1843 /* Create a value for a string constant by allocating space in the inferior,
1844 copying the data into that space, and returning the address with type
1845 TYPE_CODE_STRING. PTR points to the string constant data; LEN is number
1847 Note that string types are like array of char types with a lower bound of
1848 zero and an upper bound of LEN - 1. Also note that the string may contain
1849 embedded null bytes. */
1852 value_string (char *ptr, int len)
1855 int lowbound = current_language->string_lower_bound;
1856 struct type *rangetype = create_range_type ((struct type *) NULL,
1858 lowbound, len + lowbound - 1);
1859 struct type *stringtype
1860 = create_string_type ((struct type *) NULL, rangetype);
1863 if (current_language->c_style_arrays == 0)
1865 val = allocate_value (stringtype);
1866 memcpy (VALUE_CONTENTS_RAW (val), ptr, len);
1871 /* Allocate space to store the string in the inferior, and then
1872 copy LEN bytes from PTR in gdb to that address in the inferior. */
1874 addr = allocate_space_in_inferior (len);
1875 write_memory (addr, ptr, len);
1877 val = value_at_lazy (stringtype, addr, NULL);
1882 value_bitstring (char *ptr, int len)
1885 struct type *domain_type = create_range_type (NULL, builtin_type_int,
1887 struct type *type = create_set_type ((struct type *) NULL, domain_type);
1888 TYPE_CODE (type) = TYPE_CODE_BITSTRING;
1889 val = allocate_value (type);
1890 memcpy (VALUE_CONTENTS_RAW (val), ptr, TYPE_LENGTH (type));
1894 /* See if we can pass arguments in T2 to a function which takes arguments
1895 of types T1. Both t1 and t2 are NULL-terminated vectors. If some
1896 arguments need coercion of some sort, then the coerced values are written
1897 into T2. Return value is 0 if the arguments could be matched, or the
1898 position at which they differ if not.
1900 STATICP is nonzero if the T1 argument list came from a
1901 static member function.
1903 For non-static member functions, we ignore the first argument,
1904 which is the type of the instance variable. This is because we want
1905 to handle calls with objects from derived classes. This is not
1906 entirely correct: we should actually check to make sure that a
1907 requested operation is type secure, shouldn't we? FIXME. */
1910 typecmp (int staticp, struct type *t1[], value_ptr t2[])
1916 if (staticp && t1 == 0)
1920 if (TYPE_CODE (t1[0]) == TYPE_CODE_VOID)
1922 if (t1[!staticp] == 0)
1924 for (i = !staticp; t1[i] && TYPE_CODE (t1[i]) != TYPE_CODE_VOID; i++)
1926 struct type *tt1, *tt2;
1929 tt1 = check_typedef (t1[i]);
1930 tt2 = check_typedef (VALUE_TYPE (t2[i]));
1931 if (TYPE_CODE (tt1) == TYPE_CODE_REF
1932 /* We should be doing hairy argument matching, as below. */
1933 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1))) == TYPE_CODE (tt2)))
1935 if (TYPE_CODE (tt2) == TYPE_CODE_ARRAY)
1936 t2[i] = value_coerce_array (t2[i]);
1938 t2[i] = value_addr (t2[i]);
1942 /* djb - 20000715 - Until the new type structure is in the
1943 place, and we can attempt things like implicit conversions,
1944 we need to do this so you can take something like a map<const
1945 char *>, and properly access map["hello"], because the
1946 argument to [] will be a reference to a pointer to a char,
1947 and the argument will be a pointer to a char. */
1948 while ( TYPE_CODE(tt1) == TYPE_CODE_REF ||
1949 TYPE_CODE (tt1) == TYPE_CODE_PTR)
1951 tt1 = check_typedef( TYPE_TARGET_TYPE(tt1) );
1953 while ( TYPE_CODE(tt2) == TYPE_CODE_ARRAY ||
1954 TYPE_CODE(tt2) == TYPE_CODE_PTR ||
1955 TYPE_CODE(tt2) == TYPE_CODE_REF)
1957 tt2 = check_typedef( TYPE_TARGET_TYPE(tt2) );
1959 if (TYPE_CODE (tt1) == TYPE_CODE (tt2))
1961 /* Array to pointer is a `trivial conversion' according to the ARM. */
1963 /* We should be doing much hairier argument matching (see section 13.2
1964 of the ARM), but as a quick kludge, just check for the same type
1966 if (TYPE_CODE (t1[i]) != TYPE_CODE (VALUE_TYPE (t2[i])))
1971 return t2[i] ? i + 1 : 0;
1974 /* Helper function used by value_struct_elt to recurse through baseclasses.
1975 Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
1976 and search in it assuming it has (class) type TYPE.
1977 If found, return value, else return NULL.
1979 If LOOKING_FOR_BASECLASS, then instead of looking for struct fields,
1980 look for a baseclass named NAME. */
1983 search_struct_field (char *name, register value_ptr arg1, int offset,
1984 register struct type *type, int looking_for_baseclass)
1987 int nbases = TYPE_N_BASECLASSES (type);
1989 CHECK_TYPEDEF (type);
1991 if (!looking_for_baseclass)
1992 for (i = TYPE_NFIELDS (type) - 1; i >= nbases; i--)
1994 char *t_field_name = TYPE_FIELD_NAME (type, i);
1996 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
1999 if (TYPE_FIELD_STATIC (type, i))
2000 v = value_static_field (type, i);
2002 v = value_primitive_field (arg1, offset, i, type);
2004 error ("there is no field named %s", name);
2009 && (t_field_name[0] == '\0'
2010 || (TYPE_CODE (type) == TYPE_CODE_UNION
2011 && (strcmp_iw (t_field_name, "else") == 0))))
2013 struct type *field_type = TYPE_FIELD_TYPE (type, i);
2014 if (TYPE_CODE (field_type) == TYPE_CODE_UNION
2015 || TYPE_CODE (field_type) == TYPE_CODE_STRUCT)
2017 /* Look for a match through the fields of an anonymous union,
2018 or anonymous struct. C++ provides anonymous unions.
2020 In the GNU Chill implementation of variant record types,
2021 each <alternative field> has an (anonymous) union type,
2022 each member of the union represents a <variant alternative>.
2023 Each <variant alternative> is represented as a struct,
2024 with a member for each <variant field>. */
2027 int new_offset = offset;
2029 /* This is pretty gross. In G++, the offset in an anonymous
2030 union is relative to the beginning of the enclosing struct.
2031 In the GNU Chill implementation of variant records,
2032 the bitpos is zero in an anonymous union field, so we
2033 have to add the offset of the union here. */
2034 if (TYPE_CODE (field_type) == TYPE_CODE_STRUCT
2035 || (TYPE_NFIELDS (field_type) > 0
2036 && TYPE_FIELD_BITPOS (field_type, 0) == 0))
2037 new_offset += TYPE_FIELD_BITPOS (type, i) / 8;
2039 v = search_struct_field (name, arg1, new_offset, field_type,
2040 looking_for_baseclass);
2047 for (i = 0; i < nbases; i++)
2050 struct type *basetype = check_typedef (TYPE_BASECLASS (type, i));
2051 /* If we are looking for baseclasses, this is what we get when we
2052 hit them. But it could happen that the base part's member name
2053 is not yet filled in. */
2054 int found_baseclass = (looking_for_baseclass
2055 && TYPE_BASECLASS_NAME (type, i) != NULL
2056 && (strcmp_iw (name, TYPE_BASECLASS_NAME (type, i)) == 0));
2058 if (BASETYPE_VIA_VIRTUAL (type, i))
2061 value_ptr v2 = allocate_value (basetype);
2063 boffset = baseclass_offset (type, i,
2064 VALUE_CONTENTS (arg1) + offset,
2065 VALUE_ADDRESS (arg1)
2066 + VALUE_OFFSET (arg1) + offset);
2068 error ("virtual baseclass botch");
2070 /* The virtual base class pointer might have been clobbered by the
2071 user program. Make sure that it still points to a valid memory
2075 if (boffset < 0 || boffset >= TYPE_LENGTH (type))
2077 CORE_ADDR base_addr;
2079 base_addr = VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1) + boffset;
2080 if (target_read_memory (base_addr, VALUE_CONTENTS_RAW (v2),
2081 TYPE_LENGTH (basetype)) != 0)
2082 error ("virtual baseclass botch");
2083 VALUE_LVAL (v2) = lval_memory;
2084 VALUE_ADDRESS (v2) = base_addr;
2088 VALUE_LVAL (v2) = VALUE_LVAL (arg1);
2089 VALUE_ADDRESS (v2) = VALUE_ADDRESS (arg1);
2090 VALUE_OFFSET (v2) = VALUE_OFFSET (arg1) + boffset;
2091 if (VALUE_LAZY (arg1))
2092 VALUE_LAZY (v2) = 1;
2094 memcpy (VALUE_CONTENTS_RAW (v2),
2095 VALUE_CONTENTS_RAW (arg1) + boffset,
2096 TYPE_LENGTH (basetype));
2099 if (found_baseclass)
2101 v = search_struct_field (name, v2, 0, TYPE_BASECLASS (type, i),
2102 looking_for_baseclass);
2104 else if (found_baseclass)
2105 v = value_primitive_field (arg1, offset, i, type);
2107 v = search_struct_field (name, arg1,
2108 offset + TYPE_BASECLASS_BITPOS (type, i) / 8,
2109 basetype, looking_for_baseclass);
2117 /* Return the offset (in bytes) of the virtual base of type BASETYPE
2118 * in an object pointed to by VALADDR (on the host), assumed to be of
2119 * type TYPE. OFFSET is number of bytes beyond start of ARG to start
2120 * looking (in case VALADDR is the contents of an enclosing object).
2122 * This routine recurses on the primary base of the derived class because
2123 * the virtual base entries of the primary base appear before the other
2124 * virtual base entries.
2126 * If the virtual base is not found, a negative integer is returned.
2127 * The magnitude of the negative integer is the number of entries in
2128 * the virtual table to skip over (entries corresponding to various
2129 * ancestral classes in the chain of primary bases).
2131 * Important: This assumes the HP / Taligent C++ runtime
2132 * conventions. Use baseclass_offset() instead to deal with g++
2136 find_rt_vbase_offset (struct type *type, struct type *basetype, char *valaddr,
2137 int offset, int *boffset_p, int *skip_p)
2139 int boffset; /* offset of virtual base */
2140 int index; /* displacement to use in virtual table */
2144 CORE_ADDR vtbl; /* the virtual table pointer */
2145 struct type *pbc; /* the primary base class */
2147 /* Look for the virtual base recursively in the primary base, first.
2148 * This is because the derived class object and its primary base
2149 * subobject share the primary virtual table. */
2152 pbc = TYPE_PRIMARY_BASE (type);
2155 find_rt_vbase_offset (pbc, basetype, valaddr, offset, &boffset, &skip);
2158 *boffset_p = boffset;
2167 /* Find the index of the virtual base according to HP/Taligent
2168 runtime spec. (Depth-first, left-to-right.) */
2169 index = virtual_base_index_skip_primaries (basetype, type);
2173 *skip_p = skip + virtual_base_list_length_skip_primaries (type);
2178 /* pai: FIXME -- 32x64 possible problem */
2179 /* First word (4 bytes) in object layout is the vtable pointer */
2180 vtbl = *(CORE_ADDR *) (valaddr + offset);
2182 /* Before the constructor is invoked, things are usually zero'd out. */
2184 error ("Couldn't find virtual table -- object may not be constructed yet.");
2187 /* Find virtual base's offset -- jump over entries for primary base
2188 * ancestors, then use the index computed above. But also adjust by
2189 * HP_ACC_VBASE_START for the vtable slots before the start of the
2190 * virtual base entries. Offset is negative -- virtual base entries
2191 * appear _before_ the address point of the virtual table. */
2193 /* pai: FIXME -- 32x64 problem, if word = 8 bytes, change multiplier
2196 /* epstein : FIXME -- added param for overlay section. May not be correct */
2197 vp = value_at (builtin_type_int, vtbl + 4 * (-skip - index - HP_ACC_VBASE_START), NULL);
2198 boffset = value_as_long (vp);
2200 *boffset_p = boffset;
2205 /* Helper function used by value_struct_elt to recurse through baseclasses.
2206 Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
2207 and search in it assuming it has (class) type TYPE.
2208 If found, return value, else if name matched and args not return (value)-1,
2209 else return NULL. */
2212 search_struct_method (char *name, register value_ptr *arg1p,
2213 register value_ptr *args, int offset,
2214 int *static_memfuncp, register struct type *type)
2218 int name_matched = 0;
2219 char dem_opname[64];
2221 CHECK_TYPEDEF (type);
2222 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
2224 char *t_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
2225 /* FIXME! May need to check for ARM demangling here */
2226 if (strncmp (t_field_name, "__", 2) == 0 ||
2227 strncmp (t_field_name, "op", 2) == 0 ||
2228 strncmp (t_field_name, "type", 4) == 0)
2230 if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI))
2231 t_field_name = dem_opname;
2232 else if (cplus_demangle_opname (t_field_name, dem_opname, 0))
2233 t_field_name = dem_opname;
2235 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
2237 int j = TYPE_FN_FIELDLIST_LENGTH (type, i) - 1;
2238 struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i);
2241 if (j > 0 && args == 0)
2242 error ("cannot resolve overloaded method `%s': no arguments supplied", name);
2245 if (TYPE_FN_FIELD_STUB (f, j))
2246 check_stub_method (type, i, j);
2247 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f, j),
2248 TYPE_FN_FIELD_ARGS (f, j), args))
2250 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
2251 return value_virtual_fn_field (arg1p, f, j, type, offset);
2252 if (TYPE_FN_FIELD_STATIC_P (f, j) && static_memfuncp)
2253 *static_memfuncp = 1;
2254 v = value_fn_field (arg1p, f, j, type, offset);
2263 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2267 if (BASETYPE_VIA_VIRTUAL (type, i))
2269 if (TYPE_HAS_VTABLE (type))
2271 /* HP aCC compiled type, search for virtual base offset
2272 according to HP/Taligent runtime spec. */
2274 find_rt_vbase_offset (type, TYPE_BASECLASS (type, i),
2275 VALUE_CONTENTS_ALL (*arg1p),
2276 offset + VALUE_EMBEDDED_OFFSET (*arg1p),
2277 &base_offset, &skip);
2279 error ("Virtual base class offset not found in vtable");
2283 struct type *baseclass = check_typedef (TYPE_BASECLASS (type, i));
2286 /* The virtual base class pointer might have been clobbered by the
2287 user program. Make sure that it still points to a valid memory
2290 if (offset < 0 || offset >= TYPE_LENGTH (type))
2292 base_valaddr = (char *) alloca (TYPE_LENGTH (baseclass));
2293 if (target_read_memory (VALUE_ADDRESS (*arg1p)
2294 + VALUE_OFFSET (*arg1p) + offset,
2296 TYPE_LENGTH (baseclass)) != 0)
2297 error ("virtual baseclass botch");
2300 base_valaddr = VALUE_CONTENTS (*arg1p) + offset;
2303 baseclass_offset (type, i, base_valaddr,
2304 VALUE_ADDRESS (*arg1p)
2305 + VALUE_OFFSET (*arg1p) + offset);
2306 if (base_offset == -1)
2307 error ("virtual baseclass botch");
2312 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
2314 v = search_struct_method (name, arg1p, args, base_offset + offset,
2315 static_memfuncp, TYPE_BASECLASS (type, i));
2316 if (v == (value_ptr) - 1)
2322 /* FIXME-bothner: Why is this commented out? Why is it here? */
2323 /* *arg1p = arg1_tmp; */
2328 return (value_ptr) - 1;
2333 /* Given *ARGP, a value of type (pointer to a)* structure/union,
2334 extract the component named NAME from the ultimate target structure/union
2335 and return it as a value with its appropriate type.
2336 ERR is used in the error message if *ARGP's type is wrong.
2338 C++: ARGS is a list of argument types to aid in the selection of
2339 an appropriate method. Also, handle derived types.
2341 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
2342 where the truthvalue of whether the function that was resolved was
2343 a static member function or not is stored.
2345 ERR is an error message to be printed in case the field is not found. */
2348 value_struct_elt (register value_ptr *argp, register value_ptr *args,
2349 char *name, int *static_memfuncp, char *err)
2351 register struct type *t;
2354 COERCE_ARRAY (*argp);
2356 t = check_typedef (VALUE_TYPE (*argp));
2358 /* Follow pointers until we get to a non-pointer. */
2360 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
2362 *argp = value_ind (*argp);
2363 /* Don't coerce fn pointer to fn and then back again! */
2364 if (TYPE_CODE (VALUE_TYPE (*argp)) != TYPE_CODE_FUNC)
2365 COERCE_ARRAY (*argp);
2366 t = check_typedef (VALUE_TYPE (*argp));
2369 if (TYPE_CODE (t) == TYPE_CODE_MEMBER)
2370 error ("not implemented: member type in value_struct_elt");
2372 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2373 && TYPE_CODE (t) != TYPE_CODE_UNION)
2374 error ("Attempt to extract a component of a value that is not a %s.", err);
2376 /* Assume it's not, unless we see that it is. */
2377 if (static_memfuncp)
2378 *static_memfuncp = 0;
2382 /* if there are no arguments ...do this... */
2384 /* Try as a field first, because if we succeed, there
2385 is less work to be done. */
2386 v = search_struct_field (name, *argp, 0, t, 0);
2390 /* C++: If it was not found as a data field, then try to
2391 return it as a pointer to a method. */
2393 if (destructor_name_p (name, t))
2394 error ("Cannot get value of destructor");
2396 v = search_struct_method (name, argp, args, 0, static_memfuncp, t);
2398 if (v == (value_ptr) - 1)
2399 error ("Cannot take address of a method");
2402 if (TYPE_NFN_FIELDS (t))
2403 error ("There is no member or method named %s.", name);
2405 error ("There is no member named %s.", name);
2410 if (destructor_name_p (name, t))
2414 /* Destructors are a special case. */
2415 int m_index, f_index;
2418 if (get_destructor_fn_field (t, &m_index, &f_index))
2420 v = value_fn_field (NULL, TYPE_FN_FIELDLIST1 (t, m_index),
2424 error ("could not find destructor function named %s.", name);
2430 error ("destructor should not have any argument");
2434 v = search_struct_method (name, argp, args, 0, static_memfuncp, t);
2436 if (v == (value_ptr) - 1)
2438 error ("One of the arguments you tried to pass to %s could not be converted to what the function wants.", name);
2442 /* See if user tried to invoke data as function. If so,
2443 hand it back. If it's not callable (i.e., a pointer to function),
2444 gdb should give an error. */
2445 v = search_struct_field (name, *argp, 0, t, 0);
2449 error ("Structure has no component named %s.", name);
2453 /* Search through the methods of an object (and its bases)
2454 * to find a specified method. Return the pointer to the
2455 * fn_field list of overloaded instances.
2456 * Helper function for value_find_oload_list.
2457 * ARGP is a pointer to a pointer to a value (the object)
2458 * METHOD is a string containing the method name
2459 * OFFSET is the offset within the value
2460 * STATIC_MEMFUNCP is set if the method is static
2461 * TYPE is the assumed type of the object
2462 * NUM_FNS is the number of overloaded instances
2463 * BASETYPE is set to the actual type of the subobject where the method is found
2464 * BOFFSET is the offset of the base subobject where the method is found */
2466 static struct fn_field *
2467 find_method_list (value_ptr *argp, char *method, int offset,
2468 int *static_memfuncp, struct type *type, int *num_fns,
2469 struct type **basetype, int *boffset)
2473 CHECK_TYPEDEF (type);
2477 /* First check in object itself */
2478 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
2480 /* pai: FIXME What about operators and type conversions? */
2481 char *fn_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
2482 if (fn_field_name && (strcmp_iw (fn_field_name, method) == 0))
2484 *num_fns = TYPE_FN_FIELDLIST_LENGTH (type, i);
2487 return TYPE_FN_FIELDLIST1 (type, i);
2491 /* Not found in object, check in base subobjects */
2492 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2495 if (BASETYPE_VIA_VIRTUAL (type, i))
2497 if (TYPE_HAS_VTABLE (type))
2499 /* HP aCC compiled type, search for virtual base offset
2500 * according to HP/Taligent runtime spec. */
2502 find_rt_vbase_offset (type, TYPE_BASECLASS (type, i),
2503 VALUE_CONTENTS_ALL (*argp),
2504 offset + VALUE_EMBEDDED_OFFSET (*argp),
2505 &base_offset, &skip);
2507 error ("Virtual base class offset not found in vtable");
2511 /* probably g++ runtime model */
2512 base_offset = VALUE_OFFSET (*argp) + offset;
2514 baseclass_offset (type, i,
2515 VALUE_CONTENTS (*argp) + base_offset,
2516 VALUE_ADDRESS (*argp) + base_offset);
2517 if (base_offset == -1)
2518 error ("virtual baseclass botch");
2522 /* non-virtual base, simply use bit position from debug info */
2524 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
2526 f = find_method_list (argp, method, base_offset + offset,
2527 static_memfuncp, TYPE_BASECLASS (type, i), num_fns, basetype, boffset);
2534 /* Return the list of overloaded methods of a specified name.
2535 * ARGP is a pointer to a pointer to a value (the object)
2536 * METHOD is the method name
2537 * OFFSET is the offset within the value contents
2538 * STATIC_MEMFUNCP is set if the method is static
2539 * NUM_FNS is the number of overloaded instances
2540 * BASETYPE is set to the type of the base subobject that defines the method
2541 * BOFFSET is the offset of the base subobject which defines the method */
2544 value_find_oload_method_list (value_ptr *argp, char *method, int offset,
2545 int *static_memfuncp, int *num_fns,
2546 struct type **basetype, int *boffset)
2550 t = check_typedef (VALUE_TYPE (*argp));
2552 /* code snarfed from value_struct_elt */
2553 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
2555 *argp = value_ind (*argp);
2556 /* Don't coerce fn pointer to fn and then back again! */
2557 if (TYPE_CODE (VALUE_TYPE (*argp)) != TYPE_CODE_FUNC)
2558 COERCE_ARRAY (*argp);
2559 t = check_typedef (VALUE_TYPE (*argp));
2562 if (TYPE_CODE (t) == TYPE_CODE_MEMBER)
2563 error ("Not implemented: member type in value_find_oload_lis");
2565 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2566 && TYPE_CODE (t) != TYPE_CODE_UNION)
2567 error ("Attempt to extract a component of a value that is not a struct or union");
2569 /* Assume it's not static, unless we see that it is. */
2570 if (static_memfuncp)
2571 *static_memfuncp = 0;
2573 return find_method_list (argp, method, 0, static_memfuncp, t, num_fns, basetype, boffset);
2577 /* Given an array of argument types (ARGTYPES) (which includes an
2578 entry for "this" in the case of C++ methods), the number of
2579 arguments NARGS, the NAME of a function whether it's a method or
2580 not (METHOD), and the degree of laxness (LAX) in conforming to
2581 overload resolution rules in ANSI C++, find the best function that
2582 matches on the argument types according to the overload resolution
2585 In the case of class methods, the parameter OBJ is an object value
2586 in which to search for overloaded methods.
2588 In the case of non-method functions, the parameter FSYM is a symbol
2589 corresponding to one of the overloaded functions.
2591 Return value is an integer: 0 -> good match, 10 -> debugger applied
2592 non-standard coercions, 100 -> incompatible.
2594 If a method is being searched for, VALP will hold the value.
2595 If a non-method is being searched for, SYMP will hold the symbol for it.
2597 If a method is being searched for, and it is a static method,
2598 then STATICP will point to a non-zero value.
2600 Note: This function does *not* check the value of
2601 overload_resolution. Caller must check it to see whether overload
2602 resolution is permitted.
2606 find_overload_match (struct type **arg_types, int nargs, char *name, int method,
2607 int lax, value_ptr obj, struct symbol *fsym,
2608 value_ptr *valp, struct symbol **symp, int *staticp)
2611 struct type **parm_types;
2612 int champ_nparms = 0;
2614 short oload_champ = -1; /* Index of best overloaded function */
2615 short oload_ambiguous = 0; /* Current ambiguity state for overload resolution */
2616 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs */
2617 short oload_ambig_champ = -1; /* 2nd contender for best match */
2618 short oload_non_standard = 0; /* did we have to use non-standard conversions? */
2619 short oload_incompatible = 0; /* are args supplied incompatible with any function? */
2621 struct badness_vector *bv; /* A measure of how good an overloaded instance is */
2622 struct badness_vector *oload_champ_bv = NULL; /* The measure for the current best match */
2624 value_ptr temp = obj;
2625 struct fn_field *fns_ptr = NULL; /* For methods, the list of overloaded methods */
2626 struct symbol **oload_syms = NULL; /* For non-methods, the list of overloaded function symbols */
2627 int num_fns = 0; /* Number of overloaded instances being considered */
2628 struct type *basetype = NULL;
2633 char *obj_type_name = NULL;
2634 char *func_name = NULL;
2636 /* Get the list of overloaded methods or functions */
2641 struct type *domain;
2642 obj_type_name = TYPE_NAME (VALUE_TYPE (obj));
2643 /* Hack: evaluate_subexp_standard often passes in a pointer
2644 value rather than the object itself, so try again */
2645 if ((!obj_type_name || !*obj_type_name) &&
2646 (TYPE_CODE (VALUE_TYPE (obj)) == TYPE_CODE_PTR))
2647 obj_type_name = TYPE_NAME (TYPE_TARGET_TYPE (VALUE_TYPE (obj)));
2649 fns_ptr = value_find_oload_method_list (&temp, name, 0,
2652 &basetype, &boffset);
2653 if (!fns_ptr || !num_fns)
2654 error ("Couldn't find method %s%s%s",
2656 (obj_type_name && *obj_type_name) ? "::" : "",
2658 domain = TYPE_DOMAIN_TYPE (fns_ptr[0].type);
2659 len = TYPE_NFN_FIELDS (domain);
2660 /* NOTE: dan/2000-03-10: This stuff is for STABS, which won't
2661 give us the info we need directly in the types. We have to
2662 use the method stub conversion to get it. Be aware that this
2663 is by no means perfect, and if you use STABS, please move to
2664 DWARF-2, or something like it, because trying to improve
2665 overloading using STABS is really a waste of time. */
2666 for (i = 0; i < len; i++)
2669 struct fn_field *f = TYPE_FN_FIELDLIST1 (domain, i);
2670 int len2 = TYPE_FN_FIELDLIST_LENGTH (domain, i);
2672 for (j = 0; j < len2; j++)
2674 if (TYPE_FN_FIELD_STUB (f, j) && (!strcmp_iw (TYPE_FN_FIELDLIST_NAME (domain,i),name)))
2675 check_stub_method (domain, i, j);
2682 func_name = cplus_demangle (SYMBOL_NAME (fsym), DMGL_NO_OPTS);
2684 /* If the name is NULL this must be a C-style function.
2685 Just return the same symbol. */
2692 oload_syms = make_symbol_overload_list (fsym);
2693 while (oload_syms[++i])
2696 error ("Couldn't find function %s", func_name);
2699 oload_champ_bv = NULL;
2701 /* Consider each candidate in turn */
2702 for (ix = 0; ix < num_fns; ix++)
2706 /* For static member functions, we won't have a this pointer, but nothing
2707 else seems to handle them right now, so we just pretend ourselves */
2710 if (TYPE_FN_FIELD_ARGS(fns_ptr,ix))
2712 while (TYPE_CODE(TYPE_FN_FIELD_ARGS(fns_ptr,ix)[nparms]) != TYPE_CODE_VOID)
2718 /* If it's not a method, this is the proper place */
2719 nparms=TYPE_NFIELDS(SYMBOL_TYPE(oload_syms[ix]));
2722 /* Prepare array of parameter types */
2723 parm_types = (struct type **) xmalloc (nparms * (sizeof (struct type *)));
2724 for (jj = 0; jj < nparms; jj++)
2725 parm_types[jj] = (method
2726 ? (TYPE_FN_FIELD_ARGS (fns_ptr, ix)[jj])
2727 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms[ix]), jj));
2729 /* Compare parameter types to supplied argument types */
2730 bv = rank_function (parm_types, nparms, arg_types, nargs);
2732 if (!oload_champ_bv)
2734 oload_champ_bv = bv;
2736 champ_nparms = nparms;
2739 /* See whether current candidate is better or worse than previous best */
2740 switch (compare_badness (bv, oload_champ_bv))
2743 oload_ambiguous = 1; /* top two contenders are equally good */
2744 oload_ambig_champ = ix;
2747 oload_ambiguous = 2; /* incomparable top contenders */
2748 oload_ambig_champ = ix;
2751 oload_champ_bv = bv; /* new champion, record details */
2752 oload_ambiguous = 0;
2754 oload_ambig_champ = -1;
2755 champ_nparms = nparms;
2765 fprintf_filtered (gdb_stderr,"Overloaded method instance %s, # of parms %d\n", fns_ptr[ix].physname, nparms);
2767 fprintf_filtered (gdb_stderr,"Overloaded function instance %s # of parms %d\n", SYMBOL_DEMANGLED_NAME (oload_syms[ix]), nparms);
2768 for (jj = 0; jj < nargs; jj++)
2769 fprintf_filtered (gdb_stderr,"...Badness @ %d : %d\n", jj, bv->rank[jj]);
2770 fprintf_filtered (gdb_stderr,"Overload resolution champion is %d, ambiguous? %d\n", oload_champ, oload_ambiguous);
2772 } /* end loop over all candidates */
2773 /* NOTE: dan/2000-03-10: Seems to be a better idea to just pick one
2774 if they have the exact same goodness. This is because there is no
2775 way to differentiate based on return type, which we need to in
2776 cases like overloads of .begin() <It's both const and non-const> */
2778 if (oload_ambiguous)
2781 error ("Cannot resolve overloaded method %s%s%s to unique instance; disambiguate by specifying function signature",
2783 (obj_type_name && *obj_type_name) ? "::" : "",
2786 error ("Cannot resolve overloaded function %s to unique instance; disambiguate by specifying function signature",
2791 /* Check how bad the best match is */
2792 for (ix = 1; ix <= nargs; ix++)
2794 if (oload_champ_bv->rank[ix] >= 100)
2795 oload_incompatible = 1; /* truly mismatched types */
2797 else if (oload_champ_bv->rank[ix] >= 10)
2798 oload_non_standard = 1; /* non-standard type conversions needed */
2800 if (oload_incompatible)
2803 error ("Cannot resolve method %s%s%s to any overloaded instance",
2805 (obj_type_name && *obj_type_name) ? "::" : "",
2808 error ("Cannot resolve function %s to any overloaded instance",
2811 else if (oload_non_standard)
2814 warning ("Using non-standard conversion to match method %s%s%s to supplied arguments",
2816 (obj_type_name && *obj_type_name) ? "::" : "",
2819 warning ("Using non-standard conversion to match function %s to supplied arguments",
2825 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr, oload_champ))
2826 *valp = value_virtual_fn_field (&temp, fns_ptr, oload_champ, basetype, boffset);
2828 *valp = value_fn_field (&temp, fns_ptr, oload_champ, basetype, boffset);
2832 *symp = oload_syms[oload_champ];
2836 return oload_incompatible ? 100 : (oload_non_standard ? 10 : 0);
2839 /* C++: return 1 is NAME is a legitimate name for the destructor
2840 of type TYPE. If TYPE does not have a destructor, or
2841 if NAME is inappropriate for TYPE, an error is signaled. */
2843 destructor_name_p (const char *name, const struct type *type)
2845 /* destructors are a special case. */
2849 char *dname = type_name_no_tag (type);
2850 char *cp = strchr (dname, '<');
2853 /* Do not compare the template part for template classes. */
2855 len = strlen (dname);
2858 if (strlen (name + 1) != len || !STREQN (dname, name + 1, len))
2859 error ("name of destructor must equal name of class");
2866 /* Helper function for check_field: Given TYPE, a structure/union,
2867 return 1 if the component named NAME from the ultimate
2868 target structure/union is defined, otherwise, return 0. */
2871 check_field_in (register struct type *type, const char *name)
2875 for (i = TYPE_NFIELDS (type) - 1; i >= TYPE_N_BASECLASSES (type); i--)
2877 char *t_field_name = TYPE_FIELD_NAME (type, i);
2878 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
2882 /* C++: If it was not found as a data field, then try to
2883 return it as a pointer to a method. */
2885 /* Destructors are a special case. */
2886 if (destructor_name_p (name, type))
2888 int m_index, f_index;
2890 return get_destructor_fn_field (type, &m_index, &f_index);
2893 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; --i)
2895 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type, i), name) == 0)
2899 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2900 if (check_field_in (TYPE_BASECLASS (type, i), name))
2907 /* C++: Given ARG1, a value of type (pointer to a)* structure/union,
2908 return 1 if the component named NAME from the ultimate
2909 target structure/union is defined, otherwise, return 0. */
2912 check_field (register value_ptr arg1, const char *name)
2914 register struct type *t;
2916 COERCE_ARRAY (arg1);
2918 t = VALUE_TYPE (arg1);
2920 /* Follow pointers until we get to a non-pointer. */
2925 if (TYPE_CODE (t) != TYPE_CODE_PTR && TYPE_CODE (t) != TYPE_CODE_REF)
2927 t = TYPE_TARGET_TYPE (t);
2930 if (TYPE_CODE (t) == TYPE_CODE_MEMBER)
2931 error ("not implemented: member type in check_field");
2933 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2934 && TYPE_CODE (t) != TYPE_CODE_UNION)
2935 error ("Internal error: `this' is not an aggregate");
2937 return check_field_in (t, name);
2940 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
2941 return the address of this member as a "pointer to member"
2942 type. If INTYPE is non-null, then it will be the type
2943 of the member we are looking for. This will help us resolve
2944 "pointers to member functions". This function is used
2945 to resolve user expressions of the form "DOMAIN::NAME". */
2948 value_struct_elt_for_reference (struct type *domain, int offset,
2949 struct type *curtype, char *name,
2950 struct type *intype)
2952 register struct type *t = curtype;
2956 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2957 && TYPE_CODE (t) != TYPE_CODE_UNION)
2958 error ("Internal error: non-aggregate type to value_struct_elt_for_reference");
2960 for (i = TYPE_NFIELDS (t) - 1; i >= TYPE_N_BASECLASSES (t); i--)
2962 char *t_field_name = TYPE_FIELD_NAME (t, i);
2964 if (t_field_name && STREQ (t_field_name, name))
2966 if (TYPE_FIELD_STATIC (t, i))
2968 v = value_static_field (t, i);
2970 error ("Internal error: could not find static variable %s",
2974 if (TYPE_FIELD_PACKED (t, i))
2975 error ("pointers to bitfield members not allowed");
2977 return value_from_longest
2978 (lookup_reference_type (lookup_member_type (TYPE_FIELD_TYPE (t, i),
2980 offset + (LONGEST) (TYPE_FIELD_BITPOS (t, i) >> 3));
2984 /* C++: If it was not found as a data field, then try to
2985 return it as a pointer to a method. */
2987 /* Destructors are a special case. */
2988 if (destructor_name_p (name, t))
2990 error ("member pointers to destructors not implemented yet");
2993 /* Perform all necessary dereferencing. */
2994 while (intype && TYPE_CODE (intype) == TYPE_CODE_PTR)
2995 intype = TYPE_TARGET_TYPE (intype);
2997 for (i = TYPE_NFN_FIELDS (t) - 1; i >= 0; --i)
2999 char *t_field_name = TYPE_FN_FIELDLIST_NAME (t, i);
3000 char dem_opname[64];
3002 if (strncmp (t_field_name, "__", 2) == 0 ||
3003 strncmp (t_field_name, "op", 2) == 0 ||
3004 strncmp (t_field_name, "type", 4) == 0)
3006 if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI))
3007 t_field_name = dem_opname;
3008 else if (cplus_demangle_opname (t_field_name, dem_opname, 0))
3009 t_field_name = dem_opname;
3011 if (t_field_name && STREQ (t_field_name, name))
3013 int j = TYPE_FN_FIELDLIST_LENGTH (t, i);
3014 struct fn_field *f = TYPE_FN_FIELDLIST1 (t, i);
3016 if (intype == 0 && j > 1)
3017 error ("non-unique member `%s' requires type instantiation", name);
3021 if (TYPE_FN_FIELD_TYPE (f, j) == intype)
3024 error ("no member function matches that type instantiation");
3029 if (TYPE_FN_FIELD_STUB (f, j))
3030 check_stub_method (t, i, j);
3031 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
3033 return value_from_longest
3034 (lookup_reference_type
3035 (lookup_member_type (TYPE_FN_FIELD_TYPE (f, j),
3037 (LONGEST) METHOD_PTR_FROM_VOFFSET (TYPE_FN_FIELD_VOFFSET (f, j)));
3041 struct symbol *s = lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j),
3042 0, VAR_NAMESPACE, 0, NULL);
3049 v = read_var_value (s, 0);
3051 VALUE_TYPE (v) = lookup_reference_type
3052 (lookup_member_type (TYPE_FN_FIELD_TYPE (f, j),
3060 for (i = TYPE_N_BASECLASSES (t) - 1; i >= 0; i--)
3065 if (BASETYPE_VIA_VIRTUAL (t, i))
3068 base_offset = TYPE_BASECLASS_BITPOS (t, i) / 8;
3069 v = value_struct_elt_for_reference (domain,
3070 offset + base_offset,
3071 TYPE_BASECLASS (t, i),
3081 /* Given a pointer value V, find the real (RTTI) type
3082 of the object it points to.
3083 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
3084 and refer to the values computed for the object pointed to. */
3087 value_rtti_target_type (value_ptr v, int *full, int *top, int *using_enc)
3091 target = value_ind (v);
3093 return value_rtti_type (target, full, top, using_enc);
3096 /* Given a value pointed to by ARGP, check its real run-time type, and
3097 if that is different from the enclosing type, create a new value
3098 using the real run-time type as the enclosing type (and of the same
3099 type as ARGP) and return it, with the embedded offset adjusted to
3100 be the correct offset to the enclosed object
3101 RTYPE is the type, and XFULL, XTOP, and XUSING_ENC are the other
3102 parameters, computed by value_rtti_type(). If these are available,
3103 they can be supplied and a second call to value_rtti_type() is avoided.
3104 (Pass RTYPE == NULL if they're not available */
3107 value_full_object (value_ptr argp, struct type *rtype, int xfull, int xtop,
3110 struct type *real_type;
3121 using_enc = xusing_enc;
3124 real_type = value_rtti_type (argp, &full, &top, &using_enc);
3126 /* If no RTTI data, or if object is already complete, do nothing */
3127 if (!real_type || real_type == VALUE_ENCLOSING_TYPE (argp))
3130 /* If we have the full object, but for some reason the enclosing
3131 type is wrong, set it *//* pai: FIXME -- sounds iffy */
3134 argp = value_change_enclosing_type (argp, real_type);
3138 /* Check if object is in memory */
3139 if (VALUE_LVAL (argp) != lval_memory)
3141 warning ("Couldn't retrieve complete object of RTTI type %s; object may be in register(s).", TYPE_NAME (real_type));
3146 /* All other cases -- retrieve the complete object */
3147 /* Go back by the computed top_offset from the beginning of the object,
3148 adjusting for the embedded offset of argp if that's what value_rtti_type
3149 used for its computation. */
3150 new_val = value_at_lazy (real_type, VALUE_ADDRESS (argp) - top +
3151 (using_enc ? 0 : VALUE_EMBEDDED_OFFSET (argp)),
3152 VALUE_BFD_SECTION (argp));
3153 VALUE_TYPE (new_val) = VALUE_TYPE (argp);
3154 VALUE_EMBEDDED_OFFSET (new_val) = using_enc ? top + VALUE_EMBEDDED_OFFSET (argp) : top;
3161 /* C++: return the value of the class instance variable, if one exists.
3162 Flag COMPLAIN signals an error if the request is made in an
3163 inappropriate context. */
3166 value_of_this (int complain)
3168 struct symbol *func, *sym;
3171 static const char funny_this[] = "this";
3174 if (selected_frame == 0)
3177 error ("no frame selected");
3182 func = get_frame_function (selected_frame);
3186 error ("no `this' in nameless context");
3191 b = SYMBOL_BLOCK_VALUE (func);
3192 i = BLOCK_NSYMS (b);
3196 error ("no args, no `this'");
3201 /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER
3202 symbol instead of the LOC_ARG one (if both exist). */
3203 sym = lookup_block_symbol (b, funny_this, VAR_NAMESPACE);
3207 error ("current stack frame not in method");
3212 this = read_var_value (sym, selected_frame);
3213 if (this == 0 && complain)
3214 error ("`this' argument at unknown address");
3218 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH elements
3219 long, starting at LOWBOUND. The result has the same lower bound as
3220 the original ARRAY. */
3223 value_slice (value_ptr array, int lowbound, int length)
3225 struct type *slice_range_type, *slice_type, *range_type;
3226 LONGEST lowerbound, upperbound, offset;
3228 struct type *array_type;
3229 array_type = check_typedef (VALUE_TYPE (array));
3230 COERCE_VARYING_ARRAY (array, array_type);
3231 if (TYPE_CODE (array_type) != TYPE_CODE_ARRAY
3232 && TYPE_CODE (array_type) != TYPE_CODE_STRING
3233 && TYPE_CODE (array_type) != TYPE_CODE_BITSTRING)
3234 error ("cannot take slice of non-array");
3235 range_type = TYPE_INDEX_TYPE (array_type);
3236 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
3237 error ("slice from bad array or bitstring");
3238 if (lowbound < lowerbound || length < 0
3239 || lowbound + length - 1 > upperbound
3240 /* Chill allows zero-length strings but not arrays. */
3241 || (current_language->la_language == language_chill
3242 && length == 0 && TYPE_CODE (array_type) == TYPE_CODE_ARRAY))
3243 error ("slice out of range");
3244 /* FIXME-type-allocation: need a way to free this type when we are
3246 slice_range_type = create_range_type ((struct type *) NULL,
3247 TYPE_TARGET_TYPE (range_type),
3248 lowbound, lowbound + length - 1);
3249 if (TYPE_CODE (array_type) == TYPE_CODE_BITSTRING)
3252 slice_type = create_set_type ((struct type *) NULL, slice_range_type);
3253 TYPE_CODE (slice_type) = TYPE_CODE_BITSTRING;
3254 slice = value_zero (slice_type, not_lval);
3255 for (i = 0; i < length; i++)
3257 int element = value_bit_index (array_type,
3258 VALUE_CONTENTS (array),
3261 error ("internal error accessing bitstring");
3262 else if (element > 0)
3264 int j = i % TARGET_CHAR_BIT;
3265 if (BITS_BIG_ENDIAN)
3266 j = TARGET_CHAR_BIT - 1 - j;
3267 VALUE_CONTENTS_RAW (slice)[i / TARGET_CHAR_BIT] |= (1 << j);
3270 /* We should set the address, bitssize, and bitspos, so the clice
3271 can be used on the LHS, but that may require extensions to
3272 value_assign. For now, just leave as a non_lval. FIXME. */
3276 struct type *element_type = TYPE_TARGET_TYPE (array_type);
3278 = (lowbound - lowerbound) * TYPE_LENGTH (check_typedef (element_type));
3279 slice_type = create_array_type ((struct type *) NULL, element_type,
3281 TYPE_CODE (slice_type) = TYPE_CODE (array_type);
3282 slice = allocate_value (slice_type);
3283 if (VALUE_LAZY (array))
3284 VALUE_LAZY (slice) = 1;
3286 memcpy (VALUE_CONTENTS (slice), VALUE_CONTENTS (array) + offset,
3287 TYPE_LENGTH (slice_type));
3288 if (VALUE_LVAL (array) == lval_internalvar)
3289 VALUE_LVAL (slice) = lval_internalvar_component;
3291 VALUE_LVAL (slice) = VALUE_LVAL (array);
3292 VALUE_ADDRESS (slice) = VALUE_ADDRESS (array);
3293 VALUE_OFFSET (slice) = VALUE_OFFSET (array) + offset;
3298 /* Assuming chill_varying_type (VARRAY) is true, return an equivalent
3299 value as a fixed-length array. */
3302 varying_to_slice (value_ptr varray)
3304 struct type *vtype = check_typedef (VALUE_TYPE (varray));
3305 LONGEST length = unpack_long (TYPE_FIELD_TYPE (vtype, 0),
3306 VALUE_CONTENTS (varray)
3307 + TYPE_FIELD_BITPOS (vtype, 0) / 8);
3308 return value_slice (value_primitive_field (varray, 0, 1, vtype), 0, length);
3311 /* Create a value for a FORTRAN complex number. Currently most of
3312 the time values are coerced to COMPLEX*16 (i.e. a complex number
3313 composed of 2 doubles. This really should be a smarter routine
3314 that figures out precision inteligently as opposed to assuming
3315 doubles. FIXME: fmb */
3318 value_literal_complex (value_ptr arg1, value_ptr arg2, struct type *type)
3320 register value_ptr val;
3321 struct type *real_type = TYPE_TARGET_TYPE (type);
3323 val = allocate_value (type);
3324 arg1 = value_cast (real_type, arg1);
3325 arg2 = value_cast (real_type, arg2);
3327 memcpy (VALUE_CONTENTS_RAW (val),
3328 VALUE_CONTENTS (arg1), TYPE_LENGTH (real_type));
3329 memcpy (VALUE_CONTENTS_RAW (val) + TYPE_LENGTH (real_type),
3330 VALUE_CONTENTS (arg2), TYPE_LENGTH (real_type));
3334 /* Cast a value into the appropriate complex data type. */
3337 cast_into_complex (struct type *type, register value_ptr val)
3339 struct type *real_type = TYPE_TARGET_TYPE (type);
3340 if (TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_COMPLEX)
3342 struct type *val_real_type = TYPE_TARGET_TYPE (VALUE_TYPE (val));
3343 value_ptr re_val = allocate_value (val_real_type);
3344 value_ptr im_val = allocate_value (val_real_type);
3346 memcpy (VALUE_CONTENTS_RAW (re_val),
3347 VALUE_CONTENTS (val), TYPE_LENGTH (val_real_type));
3348 memcpy (VALUE_CONTENTS_RAW (im_val),
3349 VALUE_CONTENTS (val) + TYPE_LENGTH (val_real_type),
3350 TYPE_LENGTH (val_real_type));
3352 return value_literal_complex (re_val, im_val, type);
3354 else if (TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_FLT
3355 || TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_INT)
3356 return value_literal_complex (val, value_zero (real_type, not_lval), type);
3358 error ("cannot cast non-number to complex");
3362 _initialize_valops (void)
3366 (add_set_cmd ("abandon", class_support, var_boolean, (char *) &auto_abandon,
3367 "Set automatic abandonment of expressions upon failure.",
3373 (add_set_cmd ("overload-resolution", class_support, var_boolean, (char *) &overload_resolution,
3374 "Set overload resolution in evaluating C++ functions.",
3377 overload_resolution = 1;
3380 add_set_cmd ("unwindonsignal", no_class, var_boolean,
3381 (char *) &unwind_on_signal_p,
3382 "Set unwinding of stack if a signal is received while in a call dummy.\n\
3383 The unwindonsignal lets the user determine what gdb should do if a signal\n\
3384 is received while in a function called from gdb (call dummy). If set, gdb\n\
3385 unwinds the stack and restore the context to what as it was before the call.\n\
3386 The default is to stop in the frame where the signal was received.", &setlist),