1 /* Perform non-arithmetic operations on values, for GDB.
2 Copyright 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994,
3 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002
4 Free Software Foundation, Inc.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
38 #include "gdb_string.h"
39 #include "gdb_assert.h"
41 /* Flag indicating HP compilers were used; needed to correctly handle some
42 value operations with HP aCC code/runtime. */
43 extern int hp_som_som_object_present;
45 extern int overload_debug;
46 /* Local functions. */
48 static int typecmp (int staticp, struct type *t1[], struct value *t2[]);
50 static CORE_ADDR find_function_addr (struct value *, struct type **);
51 static struct value *value_arg_coerce (struct value *, struct type *, int);
54 static CORE_ADDR value_push (CORE_ADDR, struct value *);
56 static struct value *search_struct_field (char *, struct value *, int,
59 static struct value *search_struct_method (char *, struct value **,
61 int, int *, struct type *);
63 static int check_field_in (struct type *, const char *);
65 static CORE_ADDR allocate_space_in_inferior (int);
67 static struct value *cast_into_complex (struct type *, struct value *);
69 static struct fn_field *find_method_list (struct value ** argp, char *method,
71 struct type *type, int *num_fns,
72 struct type **basetype,
75 void _initialize_valops (void);
77 /* Flag for whether we want to abandon failed expression evals by default. */
80 static int auto_abandon = 0;
83 int overload_resolution = 0;
85 /* This boolean tells what gdb should do if a signal is received while in
86 a function called from gdb (call dummy). If set, gdb unwinds the stack
87 and restore the context to what as it was before the call.
88 The default is to stop in the frame where the signal was received. */
90 int unwind_on_signal_p = 0;
94 /* Find the address of function name NAME in the inferior. */
97 find_function_in_inferior (char *name)
99 register struct symbol *sym;
100 sym = lookup_symbol (name, 0, VAR_NAMESPACE, 0, NULL);
103 if (SYMBOL_CLASS (sym) != LOC_BLOCK)
105 error ("\"%s\" exists in this program but is not a function.",
108 return value_of_variable (sym, NULL);
112 struct minimal_symbol *msymbol = lookup_minimal_symbol (name, NULL, NULL);
117 type = lookup_pointer_type (builtin_type_char);
118 type = lookup_function_type (type);
119 type = lookup_pointer_type (type);
120 maddr = SYMBOL_VALUE_ADDRESS (msymbol);
121 return value_from_pointer (type, maddr);
125 if (!target_has_execution)
126 error ("evaluation of this expression requires the target program to be active");
128 error ("evaluation of this expression requires the program to have a function \"%s\".", name);
133 /* Allocate NBYTES of space in the inferior using the inferior's malloc
134 and return a value that is a pointer to the allocated space. */
137 value_allocate_space_in_inferior (int len)
139 struct value *blocklen;
140 struct value *val = find_function_in_inferior ("malloc");
142 blocklen = value_from_longest (builtin_type_int, (LONGEST) len);
143 val = call_function_by_hand (val, 1, &blocklen);
144 if (value_logical_not (val))
146 if (!target_has_execution)
147 error ("No memory available to program now: you need to start the target first");
149 error ("No memory available to program: call to malloc failed");
155 allocate_space_in_inferior (int len)
157 return value_as_long (value_allocate_space_in_inferior (len));
160 /* Cast value ARG2 to type TYPE and return as a value.
161 More general than a C cast: accepts any two types of the same length,
162 and if ARG2 is an lvalue it can be cast into anything at all. */
163 /* In C++, casts may change pointer or object representations. */
166 value_cast (struct type *type, struct value *arg2)
168 register enum type_code code1;
169 register enum type_code code2;
173 int convert_to_boolean = 0;
175 if (VALUE_TYPE (arg2) == type)
178 CHECK_TYPEDEF (type);
179 code1 = TYPE_CODE (type);
181 type2 = check_typedef (VALUE_TYPE (arg2));
183 /* A cast to an undetermined-length array_type, such as (TYPE [])OBJECT,
184 is treated like a cast to (TYPE [N])OBJECT,
185 where N is sizeof(OBJECT)/sizeof(TYPE). */
186 if (code1 == TYPE_CODE_ARRAY)
188 struct type *element_type = TYPE_TARGET_TYPE (type);
189 unsigned element_length = TYPE_LENGTH (check_typedef (element_type));
190 if (element_length > 0
191 && TYPE_ARRAY_UPPER_BOUND_TYPE (type) == BOUND_CANNOT_BE_DETERMINED)
193 struct type *range_type = TYPE_INDEX_TYPE (type);
194 int val_length = TYPE_LENGTH (type2);
195 LONGEST low_bound, high_bound, new_length;
196 if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0)
197 low_bound = 0, high_bound = 0;
198 new_length = val_length / element_length;
199 if (val_length % element_length != 0)
200 warning ("array element type size does not divide object size in cast");
201 /* FIXME-type-allocation: need a way to free this type when we are
203 range_type = create_range_type ((struct type *) NULL,
204 TYPE_TARGET_TYPE (range_type),
206 new_length + low_bound - 1);
207 VALUE_TYPE (arg2) = create_array_type ((struct type *) NULL,
208 element_type, range_type);
213 if (current_language->c_style_arrays
214 && TYPE_CODE (type2) == TYPE_CODE_ARRAY)
215 arg2 = value_coerce_array (arg2);
217 if (TYPE_CODE (type2) == TYPE_CODE_FUNC)
218 arg2 = value_coerce_function (arg2);
220 type2 = check_typedef (VALUE_TYPE (arg2));
221 COERCE_VARYING_ARRAY (arg2, type2);
222 code2 = TYPE_CODE (type2);
224 if (code1 == TYPE_CODE_COMPLEX)
225 return cast_into_complex (type, arg2);
226 if (code1 == TYPE_CODE_BOOL)
228 code1 = TYPE_CODE_INT;
229 convert_to_boolean = 1;
231 if (code1 == TYPE_CODE_CHAR)
232 code1 = TYPE_CODE_INT;
233 if (code2 == TYPE_CODE_BOOL || code2 == TYPE_CODE_CHAR)
234 code2 = TYPE_CODE_INT;
236 scalar = (code2 == TYPE_CODE_INT || code2 == TYPE_CODE_FLT
237 || code2 == TYPE_CODE_ENUM || code2 == TYPE_CODE_RANGE);
239 if (code1 == TYPE_CODE_STRUCT
240 && code2 == TYPE_CODE_STRUCT
241 && TYPE_NAME (type) != 0)
243 /* Look in the type of the source to see if it contains the
244 type of the target as a superclass. If so, we'll need to
245 offset the object in addition to changing its type. */
246 struct value *v = search_struct_field (type_name_no_tag (type),
250 VALUE_TYPE (v) = type;
254 if (code1 == TYPE_CODE_FLT && scalar)
255 return value_from_double (type, value_as_double (arg2));
256 else if ((code1 == TYPE_CODE_INT || code1 == TYPE_CODE_ENUM
257 || code1 == TYPE_CODE_RANGE)
258 && (scalar || code2 == TYPE_CODE_PTR))
262 if (hp_som_som_object_present && /* if target compiled by HP aCC */
263 (code2 == TYPE_CODE_PTR))
266 struct value *retvalp;
268 switch (TYPE_CODE (TYPE_TARGET_TYPE (type2)))
270 /* With HP aCC, pointers to data members have a bias */
271 case TYPE_CODE_MEMBER:
272 retvalp = value_from_longest (type, value_as_long (arg2));
273 /* force evaluation */
274 ptr = (unsigned int *) VALUE_CONTENTS (retvalp);
275 *ptr &= ~0x20000000; /* zap 29th bit to remove bias */
278 /* While pointers to methods don't really point to a function */
279 case TYPE_CODE_METHOD:
280 error ("Pointers to methods not supported with HP aCC");
283 break; /* fall out and go to normal handling */
287 /* When we cast pointers to integers, we mustn't use
288 POINTER_TO_ADDRESS to find the address the pointer
289 represents, as value_as_long would. GDB should evaluate
290 expressions just as the compiler would --- and the compiler
291 sees a cast as a simple reinterpretation of the pointer's
293 if (code2 == TYPE_CODE_PTR)
294 longest = extract_unsigned_integer (VALUE_CONTENTS (arg2),
295 TYPE_LENGTH (type2));
297 longest = value_as_long (arg2);
298 return value_from_longest (type, convert_to_boolean ?
299 (LONGEST) (longest ? 1 : 0) : longest);
301 else if (code1 == TYPE_CODE_PTR && (code2 == TYPE_CODE_INT ||
302 code2 == TYPE_CODE_ENUM ||
303 code2 == TYPE_CODE_RANGE))
305 /* TYPE_LENGTH (type) is the length of a pointer, but we really
306 want the length of an address! -- we are really dealing with
307 addresses (i.e., gdb representations) not pointers (i.e.,
308 target representations) here.
310 This allows things like "print *(int *)0x01000234" to work
311 without printing a misleading message -- which would
312 otherwise occur when dealing with a target having two byte
313 pointers and four byte addresses. */
315 int addr_bit = TARGET_ADDR_BIT;
317 LONGEST longest = value_as_long (arg2);
318 if (addr_bit < sizeof (LONGEST) * HOST_CHAR_BIT)
320 if (longest >= ((LONGEST) 1 << addr_bit)
321 || longest <= -((LONGEST) 1 << addr_bit))
322 warning ("value truncated");
324 return value_from_longest (type, longest);
326 else if (TYPE_LENGTH (type) == TYPE_LENGTH (type2))
328 if (code1 == TYPE_CODE_PTR && code2 == TYPE_CODE_PTR)
330 struct type *t1 = check_typedef (TYPE_TARGET_TYPE (type));
331 struct type *t2 = check_typedef (TYPE_TARGET_TYPE (type2));
332 if (TYPE_CODE (t1) == TYPE_CODE_STRUCT
333 && TYPE_CODE (t2) == TYPE_CODE_STRUCT
334 && !value_logical_not (arg2))
338 /* Look in the type of the source to see if it contains the
339 type of the target as a superclass. If so, we'll need to
340 offset the pointer rather than just change its type. */
341 if (TYPE_NAME (t1) != NULL)
343 v = search_struct_field (type_name_no_tag (t1),
344 value_ind (arg2), 0, t2, 1);
348 VALUE_TYPE (v) = type;
353 /* Look in the type of the target to see if it contains the
354 type of the source as a superclass. If so, we'll need to
355 offset the pointer rather than just change its type.
356 FIXME: This fails silently with virtual inheritance. */
357 if (TYPE_NAME (t2) != NULL)
359 v = search_struct_field (type_name_no_tag (t2),
360 value_zero (t1, not_lval), 0, t1, 1);
363 struct value *v2 = value_ind (arg2);
364 VALUE_ADDRESS (v2) -= VALUE_ADDRESS (v)
367 /* JYG: adjust the new pointer value and
369 v2->aligner.contents[0] -= VALUE_EMBEDDED_OFFSET (v);
370 VALUE_EMBEDDED_OFFSET (v2) = 0;
372 v2 = value_addr (v2);
373 VALUE_TYPE (v2) = type;
378 /* No superclass found, just fall through to change ptr type. */
380 VALUE_TYPE (arg2) = type;
381 arg2 = value_change_enclosing_type (arg2, type);
382 VALUE_POINTED_TO_OFFSET (arg2) = 0; /* pai: chk_val */
385 else if (chill_varying_type (type))
387 struct type *range1, *range2, *eltype1, *eltype2;
390 LONGEST low_bound, high_bound;
391 char *valaddr, *valaddr_data;
392 /* For lint warning about eltype2 possibly uninitialized: */
394 if (code2 == TYPE_CODE_BITSTRING)
395 error ("not implemented: converting bitstring to varying type");
396 if ((code2 != TYPE_CODE_ARRAY && code2 != TYPE_CODE_STRING)
397 || (eltype1 = check_typedef (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, 1))),
398 eltype2 = check_typedef (TYPE_TARGET_TYPE (type2)),
399 (TYPE_LENGTH (eltype1) != TYPE_LENGTH (eltype2)
400 /* || TYPE_CODE (eltype1) != TYPE_CODE (eltype2) */ )))
401 error ("Invalid conversion to varying type");
402 range1 = TYPE_FIELD_TYPE (TYPE_FIELD_TYPE (type, 1), 0);
403 range2 = TYPE_FIELD_TYPE (type2, 0);
404 if (get_discrete_bounds (range1, &low_bound, &high_bound) < 0)
407 count1 = high_bound - low_bound + 1;
408 if (get_discrete_bounds (range2, &low_bound, &high_bound) < 0)
409 count1 = -1, count2 = 0; /* To force error before */
411 count2 = high_bound - low_bound + 1;
413 error ("target varying type is too small");
414 val = allocate_value (type);
415 valaddr = VALUE_CONTENTS_RAW (val);
416 valaddr_data = valaddr + TYPE_FIELD_BITPOS (type, 1) / 8;
417 /* Set val's __var_length field to count2. */
418 store_signed_integer (valaddr, TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0)),
420 /* Set the __var_data field to count2 elements copied from arg2. */
421 memcpy (valaddr_data, VALUE_CONTENTS (arg2),
422 count2 * TYPE_LENGTH (eltype2));
423 /* Zero the rest of the __var_data field of val. */
424 memset (valaddr_data + count2 * TYPE_LENGTH (eltype2), '\0',
425 (count1 - count2) * TYPE_LENGTH (eltype2));
428 else if (VALUE_LVAL (arg2) == lval_memory)
430 return value_at_lazy (type, VALUE_ADDRESS (arg2) + VALUE_OFFSET (arg2),
431 VALUE_BFD_SECTION (arg2));
433 else if (code1 == TYPE_CODE_VOID)
435 return value_zero (builtin_type_void, not_lval);
439 error ("Invalid cast.");
444 /* Create a value of type TYPE that is zero, and return it. */
447 value_zero (struct type *type, enum lval_type lv)
449 struct value *val = allocate_value (type);
451 memset (VALUE_CONTENTS (val), 0, TYPE_LENGTH (check_typedef (type)));
452 VALUE_LVAL (val) = lv;
457 /* Return a value with type TYPE located at ADDR.
459 Call value_at only if the data needs to be fetched immediately;
460 if we can be 'lazy' and defer the fetch, perhaps indefinately, call
461 value_at_lazy instead. value_at_lazy simply records the address of
462 the data and sets the lazy-evaluation-required flag. The lazy flag
463 is tested in the VALUE_CONTENTS macro, which is used if and when
464 the contents are actually required.
466 Note: value_at does *NOT* handle embedded offsets; perform such
467 adjustments before or after calling it. */
470 value_at (struct type *type, CORE_ADDR addr, asection *sect)
474 if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
475 error ("Attempt to dereference a generic pointer.");
477 val = allocate_value (type);
479 read_memory (addr, VALUE_CONTENTS_ALL_RAW (val), TYPE_LENGTH (type));
481 VALUE_LVAL (val) = lval_memory;
482 VALUE_ADDRESS (val) = addr;
483 VALUE_BFD_SECTION (val) = sect;
488 /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */
491 value_at_lazy (struct type *type, CORE_ADDR addr, asection *sect)
495 if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
496 error ("Attempt to dereference a generic pointer.");
498 val = allocate_value (type);
500 VALUE_LVAL (val) = lval_memory;
501 VALUE_ADDRESS (val) = addr;
502 VALUE_LAZY (val) = 1;
503 VALUE_BFD_SECTION (val) = sect;
508 /* Called only from the VALUE_CONTENTS and VALUE_CONTENTS_ALL macros,
509 if the current data for a variable needs to be loaded into
510 VALUE_CONTENTS(VAL). Fetches the data from the user's process, and
511 clears the lazy flag to indicate that the data in the buffer is valid.
513 If the value is zero-length, we avoid calling read_memory, which would
514 abort. We mark the value as fetched anyway -- all 0 bytes of it.
516 This function returns a value because it is used in the VALUE_CONTENTS
517 macro as part of an expression, where a void would not work. The
521 value_fetch_lazy (struct value *val)
523 CORE_ADDR addr = VALUE_ADDRESS (val) + VALUE_OFFSET (val);
524 int length = TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val));
526 struct type *type = VALUE_TYPE (val);
528 read_memory (addr, VALUE_CONTENTS_ALL_RAW (val), length);
530 VALUE_LAZY (val) = 0;
535 /* Store the contents of FROMVAL into the location of TOVAL.
536 Return a new value with the location of TOVAL and contents of FROMVAL. */
539 value_assign (struct value *toval, struct value *fromval)
541 register struct type *type;
543 char *raw_buffer = (char*) alloca (MAX_REGISTER_RAW_SIZE);
546 if (!toval->modifiable)
547 error ("Left operand of assignment is not a modifiable lvalue.");
551 type = VALUE_TYPE (toval);
552 if (VALUE_LVAL (toval) != lval_internalvar)
553 fromval = value_cast (type, fromval);
555 COERCE_ARRAY (fromval);
556 CHECK_TYPEDEF (type);
558 /* If TOVAL is a special machine register requiring conversion
559 of program values to a special raw format,
560 convert FROMVAL's contents now, with result in `raw_buffer',
561 and set USE_BUFFER to the number of bytes to write. */
563 if (VALUE_REGNO (toval) >= 0)
565 int regno = VALUE_REGNO (toval);
566 if (CONVERT_REGISTER_P (regno))
568 struct type *fromtype = check_typedef (VALUE_TYPE (fromval));
569 VALUE_TO_REGISTER (fromtype, regno, VALUE_CONTENTS (fromval), raw_buffer);
570 use_buffer = REGISTER_RAW_SIZE (regno);
574 switch (VALUE_LVAL (toval))
576 case lval_internalvar:
577 set_internalvar (VALUE_INTERNALVAR (toval), fromval);
578 val = value_copy (VALUE_INTERNALVAR (toval)->value);
579 val = value_change_enclosing_type (val, VALUE_ENCLOSING_TYPE (fromval));
580 VALUE_EMBEDDED_OFFSET (val) = VALUE_EMBEDDED_OFFSET (fromval);
581 VALUE_POINTED_TO_OFFSET (val) = VALUE_POINTED_TO_OFFSET (fromval);
584 case lval_internalvar_component:
585 set_internalvar_component (VALUE_INTERNALVAR (toval),
586 VALUE_OFFSET (toval),
587 VALUE_BITPOS (toval),
588 VALUE_BITSIZE (toval),
595 CORE_ADDR changed_addr;
598 if (VALUE_BITSIZE (toval))
600 char buffer[sizeof (LONGEST)];
601 /* We assume that the argument to read_memory is in units of
602 host chars. FIXME: Is that correct? */
603 changed_len = (VALUE_BITPOS (toval)
604 + VALUE_BITSIZE (toval)
608 if (changed_len > (int) sizeof (LONGEST))
609 error ("Can't handle bitfields which don't fit in a %d bit word.",
610 (int) sizeof (LONGEST) * HOST_CHAR_BIT);
612 read_memory (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
613 buffer, changed_len);
614 modify_field (buffer, value_as_long (fromval),
615 VALUE_BITPOS (toval), VALUE_BITSIZE (toval));
616 changed_addr = VALUE_ADDRESS (toval) + VALUE_OFFSET (toval);
617 dest_buffer = buffer;
621 changed_addr = VALUE_ADDRESS (toval) + VALUE_OFFSET (toval);
622 changed_len = use_buffer;
623 dest_buffer = raw_buffer;
627 changed_addr = VALUE_ADDRESS (toval) + VALUE_OFFSET (toval);
628 changed_len = TYPE_LENGTH (type);
629 dest_buffer = VALUE_CONTENTS (fromval);
632 write_memory (changed_addr, dest_buffer, changed_len);
633 if (memory_changed_hook)
634 memory_changed_hook (changed_addr, changed_len);
639 if (VALUE_BITSIZE (toval))
641 char buffer[sizeof (LONGEST)];
643 REGISTER_RAW_SIZE (VALUE_REGNO (toval)) - VALUE_OFFSET (toval);
645 if (len > (int) sizeof (LONGEST))
646 error ("Can't handle bitfields in registers larger than %d bits.",
647 (int) sizeof (LONGEST) * HOST_CHAR_BIT);
649 if (VALUE_BITPOS (toval) + VALUE_BITSIZE (toval)
650 > len * HOST_CHAR_BIT)
651 /* Getting this right would involve being very careful about
653 error ("Can't assign to bitfields that cross register "
656 read_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
658 modify_field (buffer, value_as_long (fromval),
659 VALUE_BITPOS (toval), VALUE_BITSIZE (toval));
660 write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
664 write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
665 raw_buffer, use_buffer);
668 /* Do any conversion necessary when storing this type to more
669 than one register. */
670 #ifdef REGISTER_CONVERT_FROM_TYPE
671 memcpy (raw_buffer, VALUE_CONTENTS (fromval), TYPE_LENGTH (type));
672 REGISTER_CONVERT_FROM_TYPE (VALUE_REGNO (toval), type, raw_buffer);
673 write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
674 raw_buffer, TYPE_LENGTH (type));
676 write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval),
677 VALUE_CONTENTS (fromval), TYPE_LENGTH (type));
680 /* Assigning to the stack pointer, frame pointer, and other
681 (architecture and calling convention specific) registers may
682 cause the frame cache to be out of date. We just do this
683 on all assignments to registers for simplicity; I doubt the slowdown
685 reinit_frame_cache ();
688 case lval_reg_frame_relative:
690 /* value is stored in a series of registers in the frame
691 specified by the structure. Copy that value out, modify
692 it, and copy it back in. */
693 int amount_to_copy = (VALUE_BITSIZE (toval) ? 1 : TYPE_LENGTH (type));
694 int reg_size = REGISTER_RAW_SIZE (VALUE_FRAME_REGNUM (toval));
695 int byte_offset = VALUE_OFFSET (toval) % reg_size;
696 int reg_offset = VALUE_OFFSET (toval) / reg_size;
699 /* Make the buffer large enough in all cases. */
700 /* FIXME (alloca): Not safe for very large data types. */
701 char *buffer = (char *) alloca (amount_to_copy
703 + MAX_REGISTER_RAW_SIZE);
706 struct frame_info *frame;
708 /* Figure out which frame this is in currently. */
709 for (frame = get_current_frame ();
710 frame && FRAME_FP (frame) != VALUE_FRAME (toval);
711 frame = get_prev_frame (frame))
715 error ("Value being assigned to is no longer active.");
717 amount_to_copy += (reg_size - amount_to_copy % reg_size);
720 for ((regno = VALUE_FRAME_REGNUM (toval) + reg_offset,
722 amount_copied < amount_to_copy;
723 amount_copied += reg_size, regno++)
725 get_saved_register (buffer + amount_copied,
726 (int *) NULL, (CORE_ADDR *) NULL,
727 frame, regno, (enum lval_type *) NULL);
730 /* Modify what needs to be modified. */
731 if (VALUE_BITSIZE (toval))
732 modify_field (buffer + byte_offset,
733 value_as_long (fromval),
734 VALUE_BITPOS (toval), VALUE_BITSIZE (toval));
736 memcpy (buffer + byte_offset, raw_buffer, use_buffer);
738 memcpy (buffer + byte_offset, VALUE_CONTENTS (fromval),
742 for ((regno = VALUE_FRAME_REGNUM (toval) + reg_offset,
744 amount_copied < amount_to_copy;
745 amount_copied += reg_size, regno++)
751 /* Just find out where to put it. */
752 get_saved_register ((char *) NULL,
753 &optim, &addr, frame, regno, &lval);
756 error ("Attempt to assign to a value that was optimized out.");
757 if (lval == lval_memory)
758 write_memory (addr, buffer + amount_copied, reg_size);
759 else if (lval == lval_register)
760 write_register_bytes (addr, buffer + amount_copied, reg_size);
762 error ("Attempt to assign to an unmodifiable value.");
765 if (register_changed_hook)
766 register_changed_hook (-1);
772 error ("Left operand of assignment is not an lvalue.");
775 /* If the field does not entirely fill a LONGEST, then zero the sign bits.
776 If the field is signed, and is negative, then sign extend. */
777 if ((VALUE_BITSIZE (toval) > 0)
778 && (VALUE_BITSIZE (toval) < 8 * (int) sizeof (LONGEST)))
780 LONGEST fieldval = value_as_long (fromval);
781 LONGEST valmask = (((ULONGEST) 1) << VALUE_BITSIZE (toval)) - 1;
784 if (!TYPE_UNSIGNED (type) && (fieldval & (valmask ^ (valmask >> 1))))
785 fieldval |= ~valmask;
787 fromval = value_from_longest (type, fieldval);
790 val = value_copy (toval);
791 memcpy (VALUE_CONTENTS_RAW (val), VALUE_CONTENTS (fromval),
793 VALUE_TYPE (val) = type;
794 val = value_change_enclosing_type (val, VALUE_ENCLOSING_TYPE (fromval));
795 VALUE_EMBEDDED_OFFSET (val) = VALUE_EMBEDDED_OFFSET (fromval);
796 VALUE_POINTED_TO_OFFSET (val) = VALUE_POINTED_TO_OFFSET (fromval);
801 /* Extend a value VAL to COUNT repetitions of its type. */
804 value_repeat (struct value *arg1, int count)
808 if (VALUE_LVAL (arg1) != lval_memory)
809 error ("Only values in memory can be extended with '@'.");
811 error ("Invalid number %d of repetitions.", count);
813 val = allocate_repeat_value (VALUE_ENCLOSING_TYPE (arg1), count);
815 read_memory (VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1),
816 VALUE_CONTENTS_ALL_RAW (val),
817 TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val)));
818 VALUE_LVAL (val) = lval_memory;
819 VALUE_ADDRESS (val) = VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1);
825 value_of_variable (struct symbol *var, struct block *b)
828 struct frame_info *frame = NULL;
831 frame = NULL; /* Use selected frame. */
832 else if (symbol_read_needs_frame (var))
834 frame = block_innermost_frame (b);
837 if (BLOCK_FUNCTION (b)
838 && SYMBOL_SOURCE_NAME (BLOCK_FUNCTION (b)))
839 error ("No frame is currently executing in block %s.",
840 SYMBOL_SOURCE_NAME (BLOCK_FUNCTION (b)));
842 error ("No frame is currently executing in specified block");
846 val = read_var_value (var, frame);
848 error ("Address of symbol \"%s\" is unknown.", SYMBOL_SOURCE_NAME (var));
853 /* Given a value which is an array, return a value which is a pointer to its
854 first element, regardless of whether or not the array has a nonzero lower
857 FIXME: A previous comment here indicated that this routine should be
858 substracting the array's lower bound. It's not clear to me that this
859 is correct. Given an array subscripting operation, it would certainly
860 work to do the adjustment here, essentially computing:
862 (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0])
864 However I believe a more appropriate and logical place to account for
865 the lower bound is to do so in value_subscript, essentially computing:
867 (&array[0] + ((index - lowerbound) * sizeof array[0]))
869 As further evidence consider what would happen with operations other
870 than array subscripting, where the caller would get back a value that
871 had an address somewhere before the actual first element of the array,
872 and the information about the lower bound would be lost because of
873 the coercion to pointer type.
877 value_coerce_array (struct value *arg1)
879 register struct type *type = check_typedef (VALUE_TYPE (arg1));
881 if (VALUE_LVAL (arg1) != lval_memory)
882 error ("Attempt to take address of value not located in memory.");
884 return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type)),
885 (VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1)));
888 /* Given a value which is a function, return a value which is a pointer
892 value_coerce_function (struct value *arg1)
894 struct value *retval;
896 if (VALUE_LVAL (arg1) != lval_memory)
897 error ("Attempt to take address of value not located in memory.");
899 retval = value_from_pointer (lookup_pointer_type (VALUE_TYPE (arg1)),
900 (VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1)));
901 VALUE_BFD_SECTION (retval) = VALUE_BFD_SECTION (arg1);
905 /* Return a pointer value for the object for which ARG1 is the contents. */
908 value_addr (struct value *arg1)
912 struct type *type = check_typedef (VALUE_TYPE (arg1));
913 if (TYPE_CODE (type) == TYPE_CODE_REF)
915 /* Copy the value, but change the type from (T&) to (T*).
916 We keep the same location information, which is efficient,
917 and allows &(&X) to get the location containing the reference. */
918 arg2 = value_copy (arg1);
919 VALUE_TYPE (arg2) = lookup_pointer_type (TYPE_TARGET_TYPE (type));
922 if (TYPE_CODE (type) == TYPE_CODE_FUNC)
923 return value_coerce_function (arg1);
925 if (VALUE_LVAL (arg1) != lval_memory)
926 error ("Attempt to take address of value not located in memory.");
928 /* Get target memory address */
929 arg2 = value_from_pointer (lookup_pointer_type (VALUE_TYPE (arg1)),
930 (VALUE_ADDRESS (arg1)
931 + VALUE_OFFSET (arg1)
932 + VALUE_EMBEDDED_OFFSET (arg1)));
934 /* This may be a pointer to a base subobject; so remember the
935 full derived object's type ... */
936 arg2 = value_change_enclosing_type (arg2, lookup_pointer_type (VALUE_ENCLOSING_TYPE (arg1)));
937 /* ... and also the relative position of the subobject in the full object */
938 VALUE_POINTED_TO_OFFSET (arg2) = VALUE_EMBEDDED_OFFSET (arg1);
939 VALUE_BFD_SECTION (arg2) = VALUE_BFD_SECTION (arg1);
943 /* Given a value of a pointer type, apply the C unary * operator to it. */
946 value_ind (struct value *arg1)
948 struct type *base_type;
953 base_type = check_typedef (VALUE_TYPE (arg1));
955 if (TYPE_CODE (base_type) == TYPE_CODE_MEMBER)
956 error ("not implemented: member types in value_ind");
958 /* Allow * on an integer so we can cast it to whatever we want.
959 This returns an int, which seems like the most C-like thing
960 to do. "long long" variables are rare enough that
961 BUILTIN_TYPE_LONGEST would seem to be a mistake. */
962 if (TYPE_CODE (base_type) == TYPE_CODE_INT)
963 return value_at (builtin_type_int,
964 (CORE_ADDR) value_as_long (arg1),
965 VALUE_BFD_SECTION (arg1));
966 else if (TYPE_CODE (base_type) == TYPE_CODE_PTR)
968 struct type *enc_type;
969 /* We may be pointing to something embedded in a larger object */
970 /* Get the real type of the enclosing object */
971 enc_type = check_typedef (VALUE_ENCLOSING_TYPE (arg1));
972 enc_type = TYPE_TARGET_TYPE (enc_type);
973 /* Retrieve the enclosing object pointed to */
974 arg2 = value_at_lazy (enc_type,
975 value_as_address (arg1) - VALUE_POINTED_TO_OFFSET (arg1),
976 VALUE_BFD_SECTION (arg1));
978 VALUE_TYPE (arg2) = TYPE_TARGET_TYPE (base_type);
979 /* Add embedding info */
980 arg2 = value_change_enclosing_type (arg2, enc_type);
981 VALUE_EMBEDDED_OFFSET (arg2) = VALUE_POINTED_TO_OFFSET (arg1);
983 /* We may be pointing to an object of some derived type */
984 arg2 = value_full_object (arg2, NULL, 0, 0, 0);
988 error ("Attempt to take contents of a non-pointer value.");
989 return 0; /* For lint -- never reached */
992 /* Pushing small parts of stack frames. */
994 /* Push one word (the size of object that a register holds). */
997 push_word (CORE_ADDR sp, ULONGEST word)
999 register int len = REGISTER_SIZE;
1000 char *buffer = alloca (MAX_REGISTER_RAW_SIZE);
1002 store_unsigned_integer (buffer, len, word);
1003 if (INNER_THAN (1, 2))
1005 /* stack grows downward */
1007 write_memory (sp, buffer, len);
1011 /* stack grows upward */
1012 write_memory (sp, buffer, len);
1019 /* Push LEN bytes with data at BUFFER. */
1022 push_bytes (CORE_ADDR sp, char *buffer, int len)
1024 if (INNER_THAN (1, 2))
1026 /* stack grows downward */
1028 write_memory (sp, buffer, len);
1032 /* stack grows upward */
1033 write_memory (sp, buffer, len);
1040 #ifndef PARM_BOUNDARY
1041 #define PARM_BOUNDARY (0)
1044 /* Push onto the stack the specified value VALUE. Pad it correctly for
1045 it to be an argument to a function. */
1048 value_push (register CORE_ADDR sp, struct value *arg)
1050 register int len = TYPE_LENGTH (VALUE_ENCLOSING_TYPE (arg));
1051 register int container_len = len;
1052 register int offset;
1054 /* How big is the container we're going to put this value in? */
1056 container_len = ((len + PARM_BOUNDARY / TARGET_CHAR_BIT - 1)
1057 & ~(PARM_BOUNDARY / TARGET_CHAR_BIT - 1));
1059 /* Are we going to put it at the high or low end of the container? */
1060 if (TARGET_BYTE_ORDER == BFD_ENDIAN_BIG)
1061 offset = container_len - len;
1065 if (INNER_THAN (1, 2))
1067 /* stack grows downward */
1068 sp -= container_len;
1069 write_memory (sp + offset, VALUE_CONTENTS_ALL (arg), len);
1073 /* stack grows upward */
1074 write_memory (sp + offset, VALUE_CONTENTS_ALL (arg), len);
1075 sp += container_len;
1082 default_push_arguments (int nargs, struct value **args, CORE_ADDR sp,
1083 int struct_return, CORE_ADDR struct_addr)
1085 /* ASSERT ( !struct_return); */
1087 for (i = nargs - 1; i >= 0; i--)
1088 sp = value_push (sp, args[i]);
1093 /* Functions to use for the COERCE_FLOAT_TO_DOUBLE gdbarch method.
1095 How you should pass arguments to a function depends on whether it
1096 was defined in K&R style or prototype style. If you define a
1097 function using the K&R syntax that takes a `float' argument, then
1098 callers must pass that argument as a `double'. If you define the
1099 function using the prototype syntax, then you must pass the
1100 argument as a `float', with no promotion.
1102 Unfortunately, on certain older platforms, the debug info doesn't
1103 indicate reliably how each function was defined. A function type's
1104 TYPE_FLAG_PROTOTYPED flag may be clear, even if the function was
1105 defined in prototype style. When calling a function whose
1106 TYPE_FLAG_PROTOTYPED flag is clear, GDB consults the
1107 COERCE_FLOAT_TO_DOUBLE gdbarch method to decide what to do.
1109 For modern targets, it is proper to assume that, if the prototype
1110 flag is clear, that can be trusted: `float' arguments should be
1111 promoted to `double'. You should register the function
1112 `standard_coerce_float_to_double' to get this behavior.
1114 For some older targets, if the prototype flag is clear, that
1115 doesn't tell us anything. So we guess that, if we don't have a
1116 type for the formal parameter (i.e., the first argument to
1117 COERCE_FLOAT_TO_DOUBLE is null), then we should promote it;
1118 otherwise, we should leave it alone. The function
1119 `default_coerce_float_to_double' provides this behavior; it is the
1120 default value, for compatibility with older configurations. */
1122 default_coerce_float_to_double (struct type *formal, struct type *actual)
1124 return formal == NULL;
1129 standard_coerce_float_to_double (struct type *formal, struct type *actual)
1135 /* Perform the standard coercions that are specified
1136 for arguments to be passed to C functions.
1138 If PARAM_TYPE is non-NULL, it is the expected parameter type.
1139 IS_PROTOTYPED is non-zero if the function declaration is prototyped. */
1141 static struct value *
1142 value_arg_coerce (struct value *arg, struct type *param_type,
1145 register struct type *arg_type = check_typedef (VALUE_TYPE (arg));
1146 register struct type *type
1147 = param_type ? check_typedef (param_type) : arg_type;
1149 switch (TYPE_CODE (type))
1152 if (TYPE_CODE (arg_type) != TYPE_CODE_REF
1153 && TYPE_CODE (arg_type) != TYPE_CODE_PTR)
1155 arg = value_addr (arg);
1156 VALUE_TYPE (arg) = param_type;
1161 case TYPE_CODE_CHAR:
1162 case TYPE_CODE_BOOL:
1163 case TYPE_CODE_ENUM:
1164 /* If we don't have a prototype, coerce to integer type if necessary. */
1167 if (TYPE_LENGTH (type) < TYPE_LENGTH (builtin_type_int))
1168 type = builtin_type_int;
1170 /* Currently all target ABIs require at least the width of an integer
1171 type for an argument. We may have to conditionalize the following
1172 type coercion for future targets. */
1173 if (TYPE_LENGTH (type) < TYPE_LENGTH (builtin_type_int))
1174 type = builtin_type_int;
1177 /* FIXME: We should always convert floats to doubles in the
1178 non-prototyped case. As many debugging formats include
1179 no information about prototyping, we have to live with
1180 COERCE_FLOAT_TO_DOUBLE for now. */
1181 if (!is_prototyped && COERCE_FLOAT_TO_DOUBLE (param_type, arg_type))
1183 if (TYPE_LENGTH (type) < TYPE_LENGTH (builtin_type_double))
1184 type = builtin_type_double;
1185 else if (TYPE_LENGTH (type) > TYPE_LENGTH (builtin_type_double))
1186 type = builtin_type_long_double;
1189 case TYPE_CODE_FUNC:
1190 type = lookup_pointer_type (type);
1192 case TYPE_CODE_ARRAY:
1193 /* Arrays are coerced to pointers to their first element, unless
1194 they are vectors, in which case we want to leave them alone,
1195 because they are passed by value. */
1196 if (current_language->c_style_arrays)
1197 if (!TYPE_VECTOR (type))
1198 type = lookup_pointer_type (TYPE_TARGET_TYPE (type));
1200 case TYPE_CODE_UNDEF:
1202 case TYPE_CODE_STRUCT:
1203 case TYPE_CODE_UNION:
1204 case TYPE_CODE_VOID:
1206 case TYPE_CODE_RANGE:
1207 case TYPE_CODE_STRING:
1208 case TYPE_CODE_BITSTRING:
1209 case TYPE_CODE_ERROR:
1210 case TYPE_CODE_MEMBER:
1211 case TYPE_CODE_METHOD:
1212 case TYPE_CODE_COMPLEX:
1217 return value_cast (type, arg);
1220 /* Determine a function's address and its return type from its value.
1221 Calls error() if the function is not valid for calling. */
1224 find_function_addr (struct value *function, struct type **retval_type)
1226 register struct type *ftype = check_typedef (VALUE_TYPE (function));
1227 register enum type_code code = TYPE_CODE (ftype);
1228 struct type *value_type;
1231 /* If it's a member function, just look at the function
1234 /* Determine address to call. */
1235 if (code == TYPE_CODE_FUNC || code == TYPE_CODE_METHOD)
1237 funaddr = VALUE_ADDRESS (function);
1238 value_type = TYPE_TARGET_TYPE (ftype);
1240 else if (code == TYPE_CODE_PTR)
1242 funaddr = value_as_address (function);
1243 ftype = check_typedef (TYPE_TARGET_TYPE (ftype));
1244 if (TYPE_CODE (ftype) == TYPE_CODE_FUNC
1245 || TYPE_CODE (ftype) == TYPE_CODE_METHOD)
1247 funaddr = CONVERT_FROM_FUNC_PTR_ADDR (funaddr);
1248 value_type = TYPE_TARGET_TYPE (ftype);
1251 value_type = builtin_type_int;
1253 else if (code == TYPE_CODE_INT)
1255 /* Handle the case of functions lacking debugging info.
1256 Their values are characters since their addresses are char */
1257 if (TYPE_LENGTH (ftype) == 1)
1258 funaddr = value_as_address (value_addr (function));
1260 /* Handle integer used as address of a function. */
1261 funaddr = (CORE_ADDR) value_as_long (function);
1263 value_type = builtin_type_int;
1266 error ("Invalid data type for function to be called.");
1268 *retval_type = value_type;
1272 /* All this stuff with a dummy frame may seem unnecessarily complicated
1273 (why not just save registers in GDB?). The purpose of pushing a dummy
1274 frame which looks just like a real frame is so that if you call a
1275 function and then hit a breakpoint (get a signal, etc), "backtrace"
1276 will look right. Whether the backtrace needs to actually show the
1277 stack at the time the inferior function was called is debatable, but
1278 it certainly needs to not display garbage. So if you are contemplating
1279 making dummy frames be different from normal frames, consider that. */
1281 /* Perform a function call in the inferior.
1282 ARGS is a vector of values of arguments (NARGS of them).
1283 FUNCTION is a value, the function to be called.
1284 Returns a value representing what the function returned.
1285 May fail to return, if a breakpoint or signal is hit
1286 during the execution of the function.
1288 ARGS is modified to contain coerced values. */
1290 static struct value *
1291 hand_function_call (struct value *function, int nargs, struct value **args)
1293 register CORE_ADDR sp;
1297 /* CALL_DUMMY is an array of words (REGISTER_SIZE), but each word
1298 is in host byte order. Before calling FIX_CALL_DUMMY, we byteswap it
1299 and remove any extra bytes which might exist because ULONGEST is
1300 bigger than REGISTER_SIZE.
1302 NOTE: This is pretty wierd, as the call dummy is actually a
1303 sequence of instructions. But CISC machines will have
1304 to pack the instructions into REGISTER_SIZE units (and
1305 so will RISC machines for which INSTRUCTION_SIZE is not
1308 NOTE: This is pretty stupid. CALL_DUMMY should be in strict
1309 target byte order. */
1311 static ULONGEST *dummy;
1315 struct type *value_type;
1316 unsigned char struct_return;
1317 CORE_ADDR struct_addr = 0;
1318 struct inferior_status *inf_status;
1319 struct cleanup *old_chain;
1321 int using_gcc; /* Set to version of gcc in use, or zero if not gcc */
1323 struct type *param_type = NULL;
1324 struct type *ftype = check_typedef (SYMBOL_TYPE (function));
1325 int n_method_args = 0;
1327 dummy = alloca (SIZEOF_CALL_DUMMY_WORDS);
1328 sizeof_dummy1 = REGISTER_SIZE * SIZEOF_CALL_DUMMY_WORDS / sizeof (ULONGEST);
1329 dummy1 = alloca (sizeof_dummy1);
1330 memcpy (dummy, CALL_DUMMY_WORDS, SIZEOF_CALL_DUMMY_WORDS);
1332 if (!target_has_execution)
1335 inf_status = save_inferior_status (1);
1336 old_chain = make_cleanup_restore_inferior_status (inf_status);
1338 /* PUSH_DUMMY_FRAME is responsible for saving the inferior registers
1339 (and POP_FRAME for restoring them). (At least on most machines)
1340 they are saved on the stack in the inferior. */
1343 old_sp = sp = read_sp ();
1345 if (INNER_THAN (1, 2))
1347 /* Stack grows down */
1348 sp -= sizeof_dummy1;
1353 /* Stack grows up */
1355 sp += sizeof_dummy1;
1358 funaddr = find_function_addr (function, &value_type);
1359 CHECK_TYPEDEF (value_type);
1362 struct block *b = block_for_pc (funaddr);
1363 /* If compiled without -g, assume GCC 2. */
1364 using_gcc = (b == NULL ? 2 : BLOCK_GCC_COMPILED (b));
1367 /* Are we returning a value using a structure return or a normal
1370 struct_return = using_struct_return (function, funaddr, value_type,
1373 /* Create a call sequence customized for this function
1374 and the number of arguments for it. */
1375 for (i = 0; i < (int) (SIZEOF_CALL_DUMMY_WORDS / sizeof (dummy[0])); i++)
1376 store_unsigned_integer (&dummy1[i * REGISTER_SIZE],
1378 (ULONGEST) dummy[i]);
1380 #ifdef GDB_TARGET_IS_HPPA
1381 real_pc = FIX_CALL_DUMMY (dummy1, start_sp, funaddr, nargs, args,
1382 value_type, using_gcc);
1384 FIX_CALL_DUMMY (dummy1, start_sp, funaddr, nargs, args,
1385 value_type, using_gcc);
1389 if (CALL_DUMMY_LOCATION == ON_STACK)
1391 write_memory (start_sp, (char *) dummy1, sizeof_dummy1);
1392 if (USE_GENERIC_DUMMY_FRAMES)
1393 generic_save_call_dummy_addr (start_sp, start_sp + sizeof_dummy1);
1396 if (CALL_DUMMY_LOCATION == BEFORE_TEXT_END)
1398 /* Convex Unix prohibits executing in the stack segment. */
1399 /* Hope there is empty room at the top of the text segment. */
1400 extern CORE_ADDR text_end;
1401 static int checked = 0;
1403 for (start_sp = text_end - sizeof_dummy1; start_sp < text_end; ++start_sp)
1404 if (read_memory_integer (start_sp, 1) != 0)
1405 error ("text segment full -- no place to put call");
1408 real_pc = text_end - sizeof_dummy1;
1409 write_memory (real_pc, (char *) dummy1, sizeof_dummy1);
1410 if (USE_GENERIC_DUMMY_FRAMES)
1411 generic_save_call_dummy_addr (real_pc, real_pc + sizeof_dummy1);
1414 if (CALL_DUMMY_LOCATION == AFTER_TEXT_END)
1416 extern CORE_ADDR text_end;
1420 errcode = target_write_memory (real_pc, (char *) dummy1, sizeof_dummy1);
1422 error ("Cannot write text segment -- call_function failed");
1423 if (USE_GENERIC_DUMMY_FRAMES)
1424 generic_save_call_dummy_addr (real_pc, real_pc + sizeof_dummy1);
1427 if (CALL_DUMMY_LOCATION == AT_ENTRY_POINT)
1430 if (USE_GENERIC_DUMMY_FRAMES)
1431 /* NOTE: cagney/2002-04-13: The entry point is going to be
1432 modified with a single breakpoint. */
1433 generic_save_call_dummy_addr (CALL_DUMMY_ADDRESS (),
1434 CALL_DUMMY_ADDRESS () + 1);
1438 sp = old_sp; /* It really is used, for some ifdef's... */
1441 if (TYPE_CODE (ftype) == TYPE_CODE_METHOD)
1444 while (TYPE_CODE (TYPE_ARG_TYPES (ftype)[i]) != TYPE_CODE_VOID)
1448 error ("too few arguments in method call");
1450 else if (nargs < TYPE_NFIELDS (ftype))
1451 error ("too few arguments in function call");
1453 for (i = nargs - 1; i >= 0; i--)
1455 /* Assume that methods are always prototyped, unless they are off the
1456 end (which we should only be allowing if there is a ``...'').
1458 if (TYPE_CODE (ftype) == TYPE_CODE_METHOD)
1460 if (i < n_method_args)
1461 args[i] = value_arg_coerce (args[i], TYPE_ARG_TYPES (ftype)[i], 1);
1463 args[i] = value_arg_coerce (args[i], NULL, 0);
1466 /* If we're off the end of the known arguments, do the standard
1467 promotions. FIXME: if we had a prototype, this should only
1468 be allowed if ... were present. */
1469 if (i >= TYPE_NFIELDS (ftype))
1470 args[i] = value_arg_coerce (args[i], NULL, 0);
1474 param_type = TYPE_FIELD_TYPE (ftype, i);
1475 args[i] = value_arg_coerce (args[i], param_type, TYPE_PROTOTYPED (ftype));
1478 /*elz: this code is to handle the case in which the function to be called
1479 has a pointer to function as parameter and the corresponding actual argument
1480 is the address of a function and not a pointer to function variable.
1481 In aCC compiled code, the calls through pointers to functions (in the body
1482 of the function called by hand) are made via $$dyncall_external which
1483 requires some registers setting, this is taken care of if we call
1484 via a function pointer variable, but not via a function address.
1485 In cc this is not a problem. */
1489 /* if this parameter is a pointer to function */
1490 if (TYPE_CODE (param_type) == TYPE_CODE_PTR)
1491 if (TYPE_CODE (TYPE_TARGET_TYPE (param_type)) == TYPE_CODE_FUNC)
1492 /* elz: FIXME here should go the test about the compiler used
1493 to compile the target. We want to issue the error
1494 message only if the compiler used was HP's aCC.
1495 If we used HP's cc, then there is no problem and no need
1496 to return at this point */
1497 if (using_gcc == 0) /* && compiler == aCC */
1498 /* go see if the actual parameter is a variable of type
1499 pointer to function or just a function */
1500 if (args[i]->lval == not_lval)
1503 if (find_pc_partial_function ((CORE_ADDR) args[i]->aligner.contents[0], &arg_name, NULL, NULL))
1505 You cannot use function <%s> as argument. \n\
1506 You must use a pointer to function type variable. Command ignored.", arg_name);
1510 if (REG_STRUCT_HAS_ADDR_P ())
1512 /* This is a machine like the sparc, where we may need to pass a
1513 pointer to the structure, not the structure itself. */
1514 for (i = nargs - 1; i >= 0; i--)
1516 struct type *arg_type = check_typedef (VALUE_TYPE (args[i]));
1517 if ((TYPE_CODE (arg_type) == TYPE_CODE_STRUCT
1518 || TYPE_CODE (arg_type) == TYPE_CODE_UNION
1519 || TYPE_CODE (arg_type) == TYPE_CODE_ARRAY
1520 || TYPE_CODE (arg_type) == TYPE_CODE_STRING
1521 || TYPE_CODE (arg_type) == TYPE_CODE_BITSTRING
1522 || TYPE_CODE (arg_type) == TYPE_CODE_SET
1523 || (TYPE_CODE (arg_type) == TYPE_CODE_FLT
1524 && TYPE_LENGTH (arg_type) > 8)
1526 && REG_STRUCT_HAS_ADDR (using_gcc, arg_type))
1529 int len; /* = TYPE_LENGTH (arg_type); */
1531 arg_type = check_typedef (VALUE_ENCLOSING_TYPE (args[i]));
1532 len = TYPE_LENGTH (arg_type);
1534 if (STACK_ALIGN_P ())
1535 /* MVS 11/22/96: I think at least some of this
1536 stack_align code is really broken. Better to let
1537 PUSH_ARGUMENTS adjust the stack in a target-defined
1539 aligned_len = STACK_ALIGN (len);
1542 if (INNER_THAN (1, 2))
1544 /* stack grows downward */
1546 /* ... so the address of the thing we push is the
1547 stack pointer after we push it. */
1552 /* The stack grows up, so the address of the thing
1553 we push is the stack pointer before we push it. */
1557 /* Push the structure. */
1558 write_memory (addr, VALUE_CONTENTS_ALL (args[i]), len);
1559 /* The value we're going to pass is the address of the
1560 thing we just pushed. */
1561 /*args[i] = value_from_longest (lookup_pointer_type (value_type),
1563 args[i] = value_from_pointer (lookup_pointer_type (arg_type),
1570 /* Reserve space for the return structure to be written on the
1571 stack, if necessary */
1575 int len = TYPE_LENGTH (value_type);
1576 if (STACK_ALIGN_P ())
1577 /* MVS 11/22/96: I think at least some of this stack_align
1578 code is really broken. Better to let PUSH_ARGUMENTS adjust
1579 the stack in a target-defined manner. */
1580 len = STACK_ALIGN (len);
1581 if (INNER_THAN (1, 2))
1583 /* stack grows downward */
1589 /* stack grows upward */
1595 /* elz: on HPPA no need for this extra alignment, maybe it is needed
1596 on other architectures. This is because all the alignment is
1597 taken care of in the above code (ifdef REG_STRUCT_HAS_ADDR) and
1598 in hppa_push_arguments */
1599 if (EXTRA_STACK_ALIGNMENT_NEEDED)
1601 /* MVS 11/22/96: I think at least some of this stack_align code
1602 is really broken. Better to let PUSH_ARGUMENTS adjust the
1603 stack in a target-defined manner. */
1604 if (STACK_ALIGN_P () && INNER_THAN (1, 2))
1606 /* If stack grows down, we must leave a hole at the top. */
1609 for (i = nargs - 1; i >= 0; i--)
1610 len += TYPE_LENGTH (VALUE_ENCLOSING_TYPE (args[i]));
1611 if (CALL_DUMMY_STACK_ADJUST_P)
1612 len += CALL_DUMMY_STACK_ADJUST;
1613 sp -= STACK_ALIGN (len) - len;
1617 sp = PUSH_ARGUMENTS (nargs, args, sp, struct_return, struct_addr);
1619 if (PUSH_RETURN_ADDRESS_P ())
1620 /* for targets that use no CALL_DUMMY */
1621 /* There are a number of targets now which actually don't write
1622 any CALL_DUMMY instructions into the target, but instead just
1623 save the machine state, push the arguments, and jump directly
1624 to the callee function. Since this doesn't actually involve
1625 executing a JSR/BSR instruction, the return address must be set
1626 up by hand, either by pushing onto the stack or copying into a
1627 return-address register as appropriate. Formerly this has been
1628 done in PUSH_ARGUMENTS, but that's overloading its
1629 functionality a bit, so I'm making it explicit to do it here. */
1630 sp = PUSH_RETURN_ADDRESS (real_pc, sp);
1632 if (STACK_ALIGN_P () && !INNER_THAN (1, 2))
1634 /* If stack grows up, we must leave a hole at the bottom, note
1635 that sp already has been advanced for the arguments! */
1636 if (CALL_DUMMY_STACK_ADJUST_P)
1637 sp += CALL_DUMMY_STACK_ADJUST;
1638 sp = STACK_ALIGN (sp);
1641 /* XXX This seems wrong. For stacks that grow down we shouldn't do
1643 /* MVS 11/22/96: I think at least some of this stack_align code is
1644 really broken. Better to let PUSH_ARGUMENTS adjust the stack in
1645 a target-defined manner. */
1646 if (CALL_DUMMY_STACK_ADJUST_P)
1647 if (INNER_THAN (1, 2))
1649 /* stack grows downward */
1650 sp -= CALL_DUMMY_STACK_ADJUST;
1653 /* Store the address at which the structure is supposed to be
1654 written. Note that this (and the code which reserved the space
1655 above) assumes that gcc was used to compile this function. Since
1656 it doesn't cost us anything but space and if the function is pcc
1657 it will ignore this value, we will make that assumption.
1659 Also note that on some machines (like the sparc) pcc uses a
1660 convention like gcc's. */
1663 STORE_STRUCT_RETURN (struct_addr, sp);
1665 /* Write the stack pointer. This is here because the statements above
1666 might fool with it. On SPARC, this write also stores the register
1667 window into the right place in the new stack frame, which otherwise
1668 wouldn't happen. (See store_inferior_registers in sparc-nat.c.) */
1671 if (SAVE_DUMMY_FRAME_TOS_P ())
1672 SAVE_DUMMY_FRAME_TOS (sp);
1675 char *retbuf = (char*) alloca (REGISTER_BYTES);
1677 struct symbol *symbol;
1680 symbol = find_pc_function (funaddr);
1683 name = SYMBOL_SOURCE_NAME (symbol);
1687 /* Try the minimal symbols. */
1688 struct minimal_symbol *msymbol = lookup_minimal_symbol_by_pc (funaddr);
1692 name = SYMBOL_SOURCE_NAME (msymbol);
1698 sprintf (format, "at %s", local_hex_format ());
1700 /* FIXME-32x64: assumes funaddr fits in a long. */
1701 sprintf (name, format, (unsigned long) funaddr);
1704 /* Execute the stack dummy routine, calling FUNCTION.
1705 When it is done, discard the empty frame
1706 after storing the contents of all regs into retbuf. */
1707 rc = run_stack_dummy (real_pc + CALL_DUMMY_START_OFFSET, retbuf);
1711 /* We stopped inside the FUNCTION because of a random signal.
1712 Further execution of the FUNCTION is not allowed. */
1714 if (unwind_on_signal_p)
1716 /* The user wants the context restored. */
1718 /* We must get back to the frame we were before the dummy call. */
1721 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1722 a C++ name with arguments and stuff. */
1724 The program being debugged was signaled while in a function called from GDB.\n\
1725 GDB has restored the context to what it was before the call.\n\
1726 To change this behavior use \"set unwindonsignal off\"\n\
1727 Evaluation of the expression containing the function (%s) will be abandoned.",
1732 /* The user wants to stay in the frame where we stopped (default).*/
1734 /* If we did the cleanups, we would print a spurious error
1735 message (Unable to restore previously selected frame),
1736 would write the registers from the inf_status (which is
1737 wrong), and would do other wrong things. */
1738 discard_cleanups (old_chain);
1739 discard_inferior_status (inf_status);
1741 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1742 a C++ name with arguments and stuff. */
1744 The program being debugged was signaled while in a function called from GDB.\n\
1745 GDB remains in the frame where the signal was received.\n\
1746 To change this behavior use \"set unwindonsignal on\"\n\
1747 Evaluation of the expression containing the function (%s) will be abandoned.",
1754 /* We hit a breakpoint inside the FUNCTION. */
1756 /* If we did the cleanups, we would print a spurious error
1757 message (Unable to restore previously selected frame),
1758 would write the registers from the inf_status (which is
1759 wrong), and would do other wrong things. */
1760 discard_cleanups (old_chain);
1761 discard_inferior_status (inf_status);
1763 /* The following error message used to say "The expression
1764 which contained the function call has been discarded." It
1765 is a hard concept to explain in a few words. Ideally, GDB
1766 would be able to resume evaluation of the expression when
1767 the function finally is done executing. Perhaps someday
1768 this will be implemented (it would not be easy). */
1770 /* FIXME: Insert a bunch of wrap_here; name can be very long if it's
1771 a C++ name with arguments and stuff. */
1773 The program being debugged stopped while in a function called from GDB.\n\
1774 When the function (%s) is done executing, GDB will silently\n\
1775 stop (instead of continuing to evaluate the expression containing\n\
1776 the function call).", name);
1779 /* If we get here the called FUNCTION run to completion. */
1780 do_cleanups (old_chain);
1782 /* Figure out the value returned by the function. */
1783 /* elz: I defined this new macro for the hppa architecture only.
1784 this gives us a way to get the value returned by the function from the stack,
1785 at the same address we told the function to put it.
1786 We cannot assume on the pa that r28 still contains the address of the returned
1787 structure. Usually this will be overwritten by the callee.
1788 I don't know about other architectures, so I defined this macro
1791 #ifdef VALUE_RETURNED_FROM_STACK
1793 return (struct value *) VALUE_RETURNED_FROM_STACK (value_type, struct_addr);
1796 return value_being_returned (value_type, retbuf, struct_return);
1801 call_function_by_hand (struct value *function, int nargs, struct value **args)
1805 return hand_function_call (function, nargs, args);
1809 error ("Cannot invoke functions on this machine.");
1815 /* Create a value for an array by allocating space in the inferior, copying
1816 the data into that space, and then setting up an array value.
1818 The array bounds are set from LOWBOUND and HIGHBOUND, and the array is
1819 populated from the values passed in ELEMVEC.
1821 The element type of the array is inherited from the type of the
1822 first element, and all elements must have the same size (though we
1823 don't currently enforce any restriction on their types). */
1826 value_array (int lowbound, int highbound, struct value **elemvec)
1830 unsigned int typelength;
1832 struct type *rangetype;
1833 struct type *arraytype;
1836 /* Validate that the bounds are reasonable and that each of the elements
1837 have the same size. */
1839 nelem = highbound - lowbound + 1;
1842 error ("bad array bounds (%d, %d)", lowbound, highbound);
1844 typelength = TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec[0]));
1845 for (idx = 1; idx < nelem; idx++)
1847 if (TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec[idx])) != typelength)
1849 error ("array elements must all be the same size");
1853 rangetype = create_range_type ((struct type *) NULL, builtin_type_int,
1854 lowbound, highbound);
1855 arraytype = create_array_type ((struct type *) NULL,
1856 VALUE_ENCLOSING_TYPE (elemvec[0]), rangetype);
1858 if (!current_language->c_style_arrays)
1860 val = allocate_value (arraytype);
1861 for (idx = 0; idx < nelem; idx++)
1863 memcpy (VALUE_CONTENTS_ALL_RAW (val) + (idx * typelength),
1864 VALUE_CONTENTS_ALL (elemvec[idx]),
1867 VALUE_BFD_SECTION (val) = VALUE_BFD_SECTION (elemvec[0]);
1871 /* Allocate space to store the array in the inferior, and then initialize
1872 it by copying in each element. FIXME: Is it worth it to create a
1873 local buffer in which to collect each value and then write all the
1874 bytes in one operation? */
1876 addr = allocate_space_in_inferior (nelem * typelength);
1877 for (idx = 0; idx < nelem; idx++)
1879 write_memory (addr + (idx * typelength), VALUE_CONTENTS_ALL (elemvec[idx]),
1883 /* Create the array type and set up an array value to be evaluated lazily. */
1885 val = value_at_lazy (arraytype, addr, VALUE_BFD_SECTION (elemvec[0]));
1889 /* Create a value for a string constant by allocating space in the inferior,
1890 copying the data into that space, and returning the address with type
1891 TYPE_CODE_STRING. PTR points to the string constant data; LEN is number
1893 Note that string types are like array of char types with a lower bound of
1894 zero and an upper bound of LEN - 1. Also note that the string may contain
1895 embedded null bytes. */
1898 value_string (char *ptr, int len)
1901 int lowbound = current_language->string_lower_bound;
1902 struct type *rangetype = create_range_type ((struct type *) NULL,
1904 lowbound, len + lowbound - 1);
1905 struct type *stringtype
1906 = create_string_type ((struct type *) NULL, rangetype);
1909 if (current_language->c_style_arrays == 0)
1911 val = allocate_value (stringtype);
1912 memcpy (VALUE_CONTENTS_RAW (val), ptr, len);
1917 /* Allocate space to store the string in the inferior, and then
1918 copy LEN bytes from PTR in gdb to that address in the inferior. */
1920 addr = allocate_space_in_inferior (len);
1921 write_memory (addr, ptr, len);
1923 val = value_at_lazy (stringtype, addr, NULL);
1928 value_bitstring (char *ptr, int len)
1931 struct type *domain_type = create_range_type (NULL, builtin_type_int,
1933 struct type *type = create_set_type ((struct type *) NULL, domain_type);
1934 TYPE_CODE (type) = TYPE_CODE_BITSTRING;
1935 val = allocate_value (type);
1936 memcpy (VALUE_CONTENTS_RAW (val), ptr, TYPE_LENGTH (type));
1940 /* See if we can pass arguments in T2 to a function which takes arguments
1941 of types T1. Both t1 and t2 are NULL-terminated vectors. If some
1942 arguments need coercion of some sort, then the coerced values are written
1943 into T2. Return value is 0 if the arguments could be matched, or the
1944 position at which they differ if not.
1946 STATICP is nonzero if the T1 argument list came from a
1947 static member function.
1949 For non-static member functions, we ignore the first argument,
1950 which is the type of the instance variable. This is because we want
1951 to handle calls with objects from derived classes. This is not
1952 entirely correct: we should actually check to make sure that a
1953 requested operation is type secure, shouldn't we? FIXME. */
1956 typecmp (int staticp, struct type *t1[], struct value *t2[])
1962 if (staticp && t1 == 0)
1966 if (t1[!staticp] == 0)
1968 if (TYPE_CODE (t1[0]) == TYPE_CODE_VOID)
1970 /* Skip ``this'' argument if applicable. T2 will always include THIS. */
1973 for (i = !staticp; t1[i] && TYPE_CODE (t1[i]) != TYPE_CODE_VOID; i++)
1975 struct type *tt1, *tt2;
1978 tt1 = check_typedef (t1[i]);
1979 tt2 = check_typedef (VALUE_TYPE (t2[i]));
1980 if (TYPE_CODE (tt1) == TYPE_CODE_REF
1981 /* We should be doing hairy argument matching, as below. */
1982 && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1))) == TYPE_CODE (tt2)))
1984 if (TYPE_CODE (tt2) == TYPE_CODE_ARRAY)
1985 t2[i] = value_coerce_array (t2[i]);
1987 t2[i] = value_addr (t2[i]);
1991 /* djb - 20000715 - Until the new type structure is in the
1992 place, and we can attempt things like implicit conversions,
1993 we need to do this so you can take something like a map<const
1994 char *>, and properly access map["hello"], because the
1995 argument to [] will be a reference to a pointer to a char,
1996 and the argument will be a pointer to a char. */
1997 while ( TYPE_CODE(tt1) == TYPE_CODE_REF ||
1998 TYPE_CODE (tt1) == TYPE_CODE_PTR)
2000 tt1 = check_typedef( TYPE_TARGET_TYPE(tt1) );
2002 while ( TYPE_CODE(tt2) == TYPE_CODE_ARRAY ||
2003 TYPE_CODE(tt2) == TYPE_CODE_PTR ||
2004 TYPE_CODE(tt2) == TYPE_CODE_REF)
2006 tt2 = check_typedef( TYPE_TARGET_TYPE(tt2) );
2008 if (TYPE_CODE (tt1) == TYPE_CODE (tt2))
2010 /* Array to pointer is a `trivial conversion' according to the ARM. */
2012 /* We should be doing much hairier argument matching (see section 13.2
2013 of the ARM), but as a quick kludge, just check for the same type
2015 if (TYPE_CODE (t1[i]) != TYPE_CODE (VALUE_TYPE (t2[i])))
2020 return t2[i] ? i + 1 : 0;
2023 /* Helper function used by value_struct_elt to recurse through baseclasses.
2024 Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
2025 and search in it assuming it has (class) type TYPE.
2026 If found, return value, else return NULL.
2028 If LOOKING_FOR_BASECLASS, then instead of looking for struct fields,
2029 look for a baseclass named NAME. */
2031 static struct value *
2032 search_struct_field (char *name, struct value *arg1, int offset,
2033 register struct type *type, int looking_for_baseclass)
2036 int nbases = TYPE_N_BASECLASSES (type);
2038 CHECK_TYPEDEF (type);
2040 if (!looking_for_baseclass)
2041 for (i = TYPE_NFIELDS (type) - 1; i >= nbases; i--)
2043 char *t_field_name = TYPE_FIELD_NAME (type, i);
2045 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
2048 if (TYPE_FIELD_STATIC (type, i))
2049 v = value_static_field (type, i);
2051 v = value_primitive_field (arg1, offset, i, type);
2053 error ("there is no field named %s", name);
2058 && (t_field_name[0] == '\0'
2059 || (TYPE_CODE (type) == TYPE_CODE_UNION
2060 && (strcmp_iw (t_field_name, "else") == 0))))
2062 struct type *field_type = TYPE_FIELD_TYPE (type, i);
2063 if (TYPE_CODE (field_type) == TYPE_CODE_UNION
2064 || TYPE_CODE (field_type) == TYPE_CODE_STRUCT)
2066 /* Look for a match through the fields of an anonymous union,
2067 or anonymous struct. C++ provides anonymous unions.
2069 In the GNU Chill implementation of variant record types,
2070 each <alternative field> has an (anonymous) union type,
2071 each member of the union represents a <variant alternative>.
2072 Each <variant alternative> is represented as a struct,
2073 with a member for each <variant field>. */
2076 int new_offset = offset;
2078 /* This is pretty gross. In G++, the offset in an anonymous
2079 union is relative to the beginning of the enclosing struct.
2080 In the GNU Chill implementation of variant records,
2081 the bitpos is zero in an anonymous union field, so we
2082 have to add the offset of the union here. */
2083 if (TYPE_CODE (field_type) == TYPE_CODE_STRUCT
2084 || (TYPE_NFIELDS (field_type) > 0
2085 && TYPE_FIELD_BITPOS (field_type, 0) == 0))
2086 new_offset += TYPE_FIELD_BITPOS (type, i) / 8;
2088 v = search_struct_field (name, arg1, new_offset, field_type,
2089 looking_for_baseclass);
2096 for (i = 0; i < nbases; i++)
2099 struct type *basetype = check_typedef (TYPE_BASECLASS (type, i));
2100 /* If we are looking for baseclasses, this is what we get when we
2101 hit them. But it could happen that the base part's member name
2102 is not yet filled in. */
2103 int found_baseclass = (looking_for_baseclass
2104 && TYPE_BASECLASS_NAME (type, i) != NULL
2105 && (strcmp_iw (name, TYPE_BASECLASS_NAME (type, i)) == 0));
2107 if (BASETYPE_VIA_VIRTUAL (type, i))
2110 struct value *v2 = allocate_value (basetype);
2112 boffset = baseclass_offset (type, i,
2113 VALUE_CONTENTS (arg1) + offset,
2114 VALUE_ADDRESS (arg1)
2115 + VALUE_OFFSET (arg1) + offset);
2117 error ("virtual baseclass botch");
2119 /* The virtual base class pointer might have been clobbered by the
2120 user program. Make sure that it still points to a valid memory
2124 if (boffset < 0 || boffset >= TYPE_LENGTH (type))
2126 CORE_ADDR base_addr;
2128 base_addr = VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1) + boffset;
2129 if (target_read_memory (base_addr, VALUE_CONTENTS_RAW (v2),
2130 TYPE_LENGTH (basetype)) != 0)
2131 error ("virtual baseclass botch");
2132 VALUE_LVAL (v2) = lval_memory;
2133 VALUE_ADDRESS (v2) = base_addr;
2137 VALUE_LVAL (v2) = VALUE_LVAL (arg1);
2138 VALUE_ADDRESS (v2) = VALUE_ADDRESS (arg1);
2139 VALUE_OFFSET (v2) = VALUE_OFFSET (arg1) + boffset;
2140 if (VALUE_LAZY (arg1))
2141 VALUE_LAZY (v2) = 1;
2143 memcpy (VALUE_CONTENTS_RAW (v2),
2144 VALUE_CONTENTS_RAW (arg1) + boffset,
2145 TYPE_LENGTH (basetype));
2148 if (found_baseclass)
2150 v = search_struct_field (name, v2, 0, TYPE_BASECLASS (type, i),
2151 looking_for_baseclass);
2153 else if (found_baseclass)
2154 v = value_primitive_field (arg1, offset, i, type);
2156 v = search_struct_field (name, arg1,
2157 offset + TYPE_BASECLASS_BITPOS (type, i) / 8,
2158 basetype, looking_for_baseclass);
2166 /* Return the offset (in bytes) of the virtual base of type BASETYPE
2167 * in an object pointed to by VALADDR (on the host), assumed to be of
2168 * type TYPE. OFFSET is number of bytes beyond start of ARG to start
2169 * looking (in case VALADDR is the contents of an enclosing object).
2171 * This routine recurses on the primary base of the derived class because
2172 * the virtual base entries of the primary base appear before the other
2173 * virtual base entries.
2175 * If the virtual base is not found, a negative integer is returned.
2176 * The magnitude of the negative integer is the number of entries in
2177 * the virtual table to skip over (entries corresponding to various
2178 * ancestral classes in the chain of primary bases).
2180 * Important: This assumes the HP / Taligent C++ runtime
2181 * conventions. Use baseclass_offset() instead to deal with g++
2185 find_rt_vbase_offset (struct type *type, struct type *basetype, char *valaddr,
2186 int offset, int *boffset_p, int *skip_p)
2188 int boffset; /* offset of virtual base */
2189 int index; /* displacement to use in virtual table */
2193 CORE_ADDR vtbl; /* the virtual table pointer */
2194 struct type *pbc; /* the primary base class */
2196 /* Look for the virtual base recursively in the primary base, first.
2197 * This is because the derived class object and its primary base
2198 * subobject share the primary virtual table. */
2201 pbc = TYPE_PRIMARY_BASE (type);
2204 find_rt_vbase_offset (pbc, basetype, valaddr, offset, &boffset, &skip);
2207 *boffset_p = boffset;
2216 /* Find the index of the virtual base according to HP/Taligent
2217 runtime spec. (Depth-first, left-to-right.) */
2218 index = virtual_base_index_skip_primaries (basetype, type);
2222 *skip_p = skip + virtual_base_list_length_skip_primaries (type);
2227 /* pai: FIXME -- 32x64 possible problem */
2228 /* First word (4 bytes) in object layout is the vtable pointer */
2229 vtbl = *(CORE_ADDR *) (valaddr + offset);
2231 /* Before the constructor is invoked, things are usually zero'd out. */
2233 error ("Couldn't find virtual table -- object may not be constructed yet.");
2236 /* Find virtual base's offset -- jump over entries for primary base
2237 * ancestors, then use the index computed above. But also adjust by
2238 * HP_ACC_VBASE_START for the vtable slots before the start of the
2239 * virtual base entries. Offset is negative -- virtual base entries
2240 * appear _before_ the address point of the virtual table. */
2242 /* pai: FIXME -- 32x64 problem, if word = 8 bytes, change multiplier
2245 /* epstein : FIXME -- added param for overlay section. May not be correct */
2246 vp = value_at (builtin_type_int, vtbl + 4 * (-skip - index - HP_ACC_VBASE_START), NULL);
2247 boffset = value_as_long (vp);
2249 *boffset_p = boffset;
2254 /* Helper function used by value_struct_elt to recurse through baseclasses.
2255 Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes,
2256 and search in it assuming it has (class) type TYPE.
2257 If found, return value, else if name matched and args not return (value)-1,
2258 else return NULL. */
2260 static struct value *
2261 search_struct_method (char *name, struct value **arg1p,
2262 struct value **args, int offset,
2263 int *static_memfuncp, register struct type *type)
2267 int name_matched = 0;
2268 char dem_opname[64];
2270 CHECK_TYPEDEF (type);
2271 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
2273 char *t_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
2274 /* FIXME! May need to check for ARM demangling here */
2275 if (strncmp (t_field_name, "__", 2) == 0 ||
2276 strncmp (t_field_name, "op", 2) == 0 ||
2277 strncmp (t_field_name, "type", 4) == 0)
2279 if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI))
2280 t_field_name = dem_opname;
2281 else if (cplus_demangle_opname (t_field_name, dem_opname, 0))
2282 t_field_name = dem_opname;
2284 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
2286 int j = TYPE_FN_FIELDLIST_LENGTH (type, i) - 1;
2287 struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i);
2290 if (j > 0 && args == 0)
2291 error ("cannot resolve overloaded method `%s': no arguments supplied", name);
2292 else if (j == 0 && args == 0)
2294 if (TYPE_FN_FIELD_STUB (f, j))
2295 check_stub_method (type, i, j);
2296 v = value_fn_field (arg1p, f, j, type, offset);
2303 if (TYPE_FN_FIELD_STUB (f, j))
2304 check_stub_method (type, i, j);
2305 if (!typecmp (TYPE_FN_FIELD_STATIC_P (f, j),
2306 TYPE_FN_FIELD_ARGS (f, j), args))
2308 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
2309 return value_virtual_fn_field (arg1p, f, j, type, offset);
2310 if (TYPE_FN_FIELD_STATIC_P (f, j) && static_memfuncp)
2311 *static_memfuncp = 1;
2312 v = value_fn_field (arg1p, f, j, type, offset);
2321 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2325 if (BASETYPE_VIA_VIRTUAL (type, i))
2327 if (TYPE_HAS_VTABLE (type))
2329 /* HP aCC compiled type, search for virtual base offset
2330 according to HP/Taligent runtime spec. */
2332 find_rt_vbase_offset (type, TYPE_BASECLASS (type, i),
2333 VALUE_CONTENTS_ALL (*arg1p),
2334 offset + VALUE_EMBEDDED_OFFSET (*arg1p),
2335 &base_offset, &skip);
2337 error ("Virtual base class offset not found in vtable");
2341 struct type *baseclass = check_typedef (TYPE_BASECLASS (type, i));
2344 /* The virtual base class pointer might have been clobbered by the
2345 user program. Make sure that it still points to a valid memory
2348 if (offset < 0 || offset >= TYPE_LENGTH (type))
2350 base_valaddr = (char *) alloca (TYPE_LENGTH (baseclass));
2351 if (target_read_memory (VALUE_ADDRESS (*arg1p)
2352 + VALUE_OFFSET (*arg1p) + offset,
2354 TYPE_LENGTH (baseclass)) != 0)
2355 error ("virtual baseclass botch");
2358 base_valaddr = VALUE_CONTENTS (*arg1p) + offset;
2361 baseclass_offset (type, i, base_valaddr,
2362 VALUE_ADDRESS (*arg1p)
2363 + VALUE_OFFSET (*arg1p) + offset);
2364 if (base_offset == -1)
2365 error ("virtual baseclass botch");
2370 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
2372 v = search_struct_method (name, arg1p, args, base_offset + offset,
2373 static_memfuncp, TYPE_BASECLASS (type, i));
2374 if (v == (struct value *) - 1)
2380 /* FIXME-bothner: Why is this commented out? Why is it here? */
2381 /* *arg1p = arg1_tmp; */
2386 return (struct value *) - 1;
2391 /* Given *ARGP, a value of type (pointer to a)* structure/union,
2392 extract the component named NAME from the ultimate target structure/union
2393 and return it as a value with its appropriate type.
2394 ERR is used in the error message if *ARGP's type is wrong.
2396 C++: ARGS is a list of argument types to aid in the selection of
2397 an appropriate method. Also, handle derived types.
2399 STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location
2400 where the truthvalue of whether the function that was resolved was
2401 a static member function or not is stored.
2403 ERR is an error message to be printed in case the field is not found. */
2406 value_struct_elt (struct value **argp, struct value **args,
2407 char *name, int *static_memfuncp, char *err)
2409 register struct type *t;
2412 COERCE_ARRAY (*argp);
2414 t = check_typedef (VALUE_TYPE (*argp));
2416 /* Follow pointers until we get to a non-pointer. */
2418 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
2420 *argp = value_ind (*argp);
2421 /* Don't coerce fn pointer to fn and then back again! */
2422 if (TYPE_CODE (VALUE_TYPE (*argp)) != TYPE_CODE_FUNC)
2423 COERCE_ARRAY (*argp);
2424 t = check_typedef (VALUE_TYPE (*argp));
2427 if (TYPE_CODE (t) == TYPE_CODE_MEMBER)
2428 error ("not implemented: member type in value_struct_elt");
2430 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2431 && TYPE_CODE (t) != TYPE_CODE_UNION)
2432 error ("Attempt to extract a component of a value that is not a %s.", err);
2434 /* Assume it's not, unless we see that it is. */
2435 if (static_memfuncp)
2436 *static_memfuncp = 0;
2440 /* if there are no arguments ...do this... */
2442 /* Try as a field first, because if we succeed, there
2443 is less work to be done. */
2444 v = search_struct_field (name, *argp, 0, t, 0);
2448 /* C++: If it was not found as a data field, then try to
2449 return it as a pointer to a method. */
2451 if (destructor_name_p (name, t))
2452 error ("Cannot get value of destructor");
2454 v = search_struct_method (name, argp, args, 0, static_memfuncp, t);
2456 if (v == (struct value *) - 1)
2457 error ("Cannot take address of a method");
2460 if (TYPE_NFN_FIELDS (t))
2461 error ("There is no member or method named %s.", name);
2463 error ("There is no member named %s.", name);
2468 if (destructor_name_p (name, t))
2472 /* Destructors are a special case. */
2473 int m_index, f_index;
2476 if (get_destructor_fn_field (t, &m_index, &f_index))
2478 v = value_fn_field (NULL, TYPE_FN_FIELDLIST1 (t, m_index),
2482 error ("could not find destructor function named %s.", name);
2488 error ("destructor should not have any argument");
2492 v = search_struct_method (name, argp, args, 0, static_memfuncp, t);
2494 if (v == (struct value *) - 1)
2496 error ("One of the arguments you tried to pass to %s could not be converted to what the function wants.", name);
2500 /* See if user tried to invoke data as function. If so,
2501 hand it back. If it's not callable (i.e., a pointer to function),
2502 gdb should give an error. */
2503 v = search_struct_field (name, *argp, 0, t, 0);
2507 error ("Structure has no component named %s.", name);
2511 /* Search through the methods of an object (and its bases)
2512 * to find a specified method. Return the pointer to the
2513 * fn_field list of overloaded instances.
2514 * Helper function for value_find_oload_list.
2515 * ARGP is a pointer to a pointer to a value (the object)
2516 * METHOD is a string containing the method name
2517 * OFFSET is the offset within the value
2518 * STATIC_MEMFUNCP is set if the method is static
2519 * TYPE is the assumed type of the object
2520 * NUM_FNS is the number of overloaded instances
2521 * BASETYPE is set to the actual type of the subobject where the method is found
2522 * BOFFSET is the offset of the base subobject where the method is found */
2524 static struct fn_field *
2525 find_method_list (struct value **argp, char *method, int offset,
2526 struct type *type, int *num_fns,
2527 struct type **basetype, int *boffset)
2531 CHECK_TYPEDEF (type);
2535 /* First check in object itself */
2536 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--)
2538 /* pai: FIXME What about operators and type conversions? */
2539 char *fn_field_name = TYPE_FN_FIELDLIST_NAME (type, i);
2540 if (fn_field_name && (strcmp_iw (fn_field_name, method) == 0))
2542 /* Resolve any stub methods. */
2543 int len = TYPE_FN_FIELDLIST_LENGTH (type, i);
2544 struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i);
2551 for (j = 0; j < len; j++)
2553 if (TYPE_FN_FIELD_STUB (f, j))
2554 check_stub_method (type, i, j);
2561 /* Not found in object, check in base subobjects */
2562 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2565 if (BASETYPE_VIA_VIRTUAL (type, i))
2567 if (TYPE_HAS_VTABLE (type))
2569 /* HP aCC compiled type, search for virtual base offset
2570 * according to HP/Taligent runtime spec. */
2572 find_rt_vbase_offset (type, TYPE_BASECLASS (type, i),
2573 VALUE_CONTENTS_ALL (*argp),
2574 offset + VALUE_EMBEDDED_OFFSET (*argp),
2575 &base_offset, &skip);
2577 error ("Virtual base class offset not found in vtable");
2581 /* probably g++ runtime model */
2582 base_offset = VALUE_OFFSET (*argp) + offset;
2584 baseclass_offset (type, i,
2585 VALUE_CONTENTS (*argp) + base_offset,
2586 VALUE_ADDRESS (*argp) + base_offset);
2587 if (base_offset == -1)
2588 error ("virtual baseclass botch");
2592 /* non-virtual base, simply use bit position from debug info */
2594 base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8;
2596 f = find_method_list (argp, method, base_offset + offset,
2597 TYPE_BASECLASS (type, i), num_fns, basetype,
2605 /* Return the list of overloaded methods of a specified name.
2606 * ARGP is a pointer to a pointer to a value (the object)
2607 * METHOD is the method name
2608 * OFFSET is the offset within the value contents
2609 * STATIC_MEMFUNCP is set if the method is static
2610 * NUM_FNS is the number of overloaded instances
2611 * BASETYPE is set to the type of the base subobject that defines the method
2612 * BOFFSET is the offset of the base subobject which defines the method */
2615 value_find_oload_method_list (struct value **argp, char *method, int offset,
2616 int *num_fns, struct type **basetype,
2621 t = check_typedef (VALUE_TYPE (*argp));
2623 /* code snarfed from value_struct_elt */
2624 while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF)
2626 *argp = value_ind (*argp);
2627 /* Don't coerce fn pointer to fn and then back again! */
2628 if (TYPE_CODE (VALUE_TYPE (*argp)) != TYPE_CODE_FUNC)
2629 COERCE_ARRAY (*argp);
2630 t = check_typedef (VALUE_TYPE (*argp));
2633 if (TYPE_CODE (t) == TYPE_CODE_MEMBER)
2634 error ("Not implemented: member type in value_find_oload_lis");
2636 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
2637 && TYPE_CODE (t) != TYPE_CODE_UNION)
2638 error ("Attempt to extract a component of a value that is not a struct or union");
2640 return find_method_list (argp, method, 0, t, num_fns, basetype, boffset);
2643 /* Given an array of argument types (ARGTYPES) (which includes an
2644 entry for "this" in the case of C++ methods), the number of
2645 arguments NARGS, the NAME of a function whether it's a method or
2646 not (METHOD), and the degree of laxness (LAX) in conforming to
2647 overload resolution rules in ANSI C++, find the best function that
2648 matches on the argument types according to the overload resolution
2651 In the case of class methods, the parameter OBJ is an object value
2652 in which to search for overloaded methods.
2654 In the case of non-method functions, the parameter FSYM is a symbol
2655 corresponding to one of the overloaded functions.
2657 Return value is an integer: 0 -> good match, 10 -> debugger applied
2658 non-standard coercions, 100 -> incompatible.
2660 If a method is being searched for, VALP will hold the value.
2661 If a non-method is being searched for, SYMP will hold the symbol for it.
2663 If a method is being searched for, and it is a static method,
2664 then STATICP will point to a non-zero value.
2666 Note: This function does *not* check the value of
2667 overload_resolution. Caller must check it to see whether overload
2668 resolution is permitted.
2672 find_overload_match (struct type **arg_types, int nargs, char *name, int method,
2673 int lax, struct value **objp, struct symbol *fsym,
2674 struct value **valp, struct symbol **symp, int *staticp)
2677 struct type **parm_types;
2678 int champ_nparms = 0;
2679 struct value *obj = (objp ? *objp : NULL);
2681 short oload_champ = -1; /* Index of best overloaded function */
2682 short oload_ambiguous = 0; /* Current ambiguity state for overload resolution */
2683 /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs */
2684 short oload_ambig_champ = -1; /* 2nd contender for best match */
2685 short oload_non_standard = 0; /* did we have to use non-standard conversions? */
2686 short oload_incompatible = 0; /* are args supplied incompatible with any function? */
2688 struct badness_vector *bv; /* A measure of how good an overloaded instance is */
2689 struct badness_vector *oload_champ_bv = NULL; /* The measure for the current best match */
2691 struct value *temp = obj;
2692 struct fn_field *fns_ptr = NULL; /* For methods, the list of overloaded methods */
2693 struct symbol **oload_syms = NULL; /* For non-methods, the list of overloaded function symbols */
2694 int num_fns = 0; /* Number of overloaded instances being considered */
2695 struct type *basetype = NULL;
2701 char *obj_type_name = NULL;
2702 char *func_name = NULL;
2704 /* Get the list of overloaded methods or functions */
2707 obj_type_name = TYPE_NAME (VALUE_TYPE (obj));
2708 /* Hack: evaluate_subexp_standard often passes in a pointer
2709 value rather than the object itself, so try again */
2710 if ((!obj_type_name || !*obj_type_name) &&
2711 (TYPE_CODE (VALUE_TYPE (obj)) == TYPE_CODE_PTR))
2712 obj_type_name = TYPE_NAME (TYPE_TARGET_TYPE (VALUE_TYPE (obj)));
2714 fns_ptr = value_find_oload_method_list (&temp, name, 0,
2716 &basetype, &boffset);
2717 if (!fns_ptr || !num_fns)
2718 error ("Couldn't find method %s%s%s",
2720 (obj_type_name && *obj_type_name) ? "::" : "",
2722 /* If we are dealing with stub method types, they should have
2723 been resolved by find_method_list via value_find_oload_method_list
2725 gdb_assert (TYPE_DOMAIN_TYPE (fns_ptr[0].type) != NULL);
2730 func_name = cplus_demangle (SYMBOL_NAME (fsym), DMGL_NO_OPTS);
2732 /* If the name is NULL this must be a C-style function.
2733 Just return the same symbol. */
2740 oload_syms = make_symbol_overload_list (fsym);
2741 while (oload_syms[++i])
2744 error ("Couldn't find function %s", func_name);
2747 oload_champ_bv = NULL;
2749 /* Consider each candidate in turn */
2750 for (ix = 0; ix < num_fns; ix++)
2755 if (TYPE_FN_FIELD_STATIC_P (fns_ptr, ix))
2759 if (TYPE_FN_FIELD_ARGS(fns_ptr,ix))
2761 while (TYPE_CODE(TYPE_FN_FIELD_ARGS(fns_ptr,ix)[nparms]) != TYPE_CODE_VOID)
2767 /* If it's not a method, this is the proper place */
2768 nparms=TYPE_NFIELDS(SYMBOL_TYPE(oload_syms[ix]));
2771 /* Prepare array of parameter types */
2772 parm_types = (struct type **) xmalloc (nparms * (sizeof (struct type *)));
2773 for (jj = 0; jj < nparms; jj++)
2774 parm_types[jj] = (method
2775 ? (TYPE_FN_FIELD_ARGS (fns_ptr, ix)[jj])
2776 : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms[ix]), jj));
2778 /* Compare parameter types to supplied argument types. Skip THIS for
2780 bv = rank_function (parm_types, nparms, arg_types + static_offset,
2781 nargs - static_offset);
2783 if (!oload_champ_bv)
2785 oload_champ_bv = bv;
2787 champ_nparms = nparms;
2790 /* See whether current candidate is better or worse than previous best */
2791 switch (compare_badness (bv, oload_champ_bv))
2794 oload_ambiguous = 1; /* top two contenders are equally good */
2795 oload_ambig_champ = ix;
2798 oload_ambiguous = 2; /* incomparable top contenders */
2799 oload_ambig_champ = ix;
2802 oload_champ_bv = bv; /* new champion, record details */
2803 oload_ambiguous = 0;
2805 oload_ambig_champ = -1;
2806 champ_nparms = nparms;
2816 fprintf_filtered (gdb_stderr,"Overloaded method instance %s, # of parms %d\n", fns_ptr[ix].physname, nparms);
2818 fprintf_filtered (gdb_stderr,"Overloaded function instance %s # of parms %d\n", SYMBOL_DEMANGLED_NAME (oload_syms[ix]), nparms);
2819 for (jj = 0; jj < nargs - static_offset; jj++)
2820 fprintf_filtered (gdb_stderr,"...Badness @ %d : %d\n", jj, bv->rank[jj]);
2821 fprintf_filtered (gdb_stderr,"Overload resolution champion is %d, ambiguous? %d\n", oload_champ, oload_ambiguous);
2823 } /* end loop over all candidates */
2824 /* NOTE: dan/2000-03-10: Seems to be a better idea to just pick one
2825 if they have the exact same goodness. This is because there is no
2826 way to differentiate based on return type, which we need to in
2827 cases like overloads of .begin() <It's both const and non-const> */
2829 if (oload_ambiguous)
2832 error ("Cannot resolve overloaded method %s%s%s to unique instance; disambiguate by specifying function signature",
2834 (obj_type_name && *obj_type_name) ? "::" : "",
2837 error ("Cannot resolve overloaded function %s to unique instance; disambiguate by specifying function signature",
2842 /* Check how bad the best match is. */
2844 if (method && TYPE_FN_FIELD_STATIC_P (fns_ptr, oload_champ))
2846 for (ix = 1; ix <= nargs - static_offset; ix++)
2848 if (oload_champ_bv->rank[ix] >= 100)
2849 oload_incompatible = 1; /* truly mismatched types */
2851 else if (oload_champ_bv->rank[ix] >= 10)
2852 oload_non_standard = 1; /* non-standard type conversions needed */
2854 if (oload_incompatible)
2857 error ("Cannot resolve method %s%s%s to any overloaded instance",
2859 (obj_type_name && *obj_type_name) ? "::" : "",
2862 error ("Cannot resolve function %s to any overloaded instance",
2865 else if (oload_non_standard)
2868 warning ("Using non-standard conversion to match method %s%s%s to supplied arguments",
2870 (obj_type_name && *obj_type_name) ? "::" : "",
2873 warning ("Using non-standard conversion to match function %s to supplied arguments",
2879 if (staticp && TYPE_FN_FIELD_STATIC_P (fns_ptr, oload_champ))
2883 if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr, oload_champ))
2884 *valp = value_virtual_fn_field (&temp, fns_ptr, oload_champ, basetype, boffset);
2886 *valp = value_fn_field (&temp, fns_ptr, oload_champ, basetype, boffset);
2890 *symp = oload_syms[oload_champ];
2896 if (TYPE_CODE (VALUE_TYPE (temp)) != TYPE_CODE_PTR
2897 && TYPE_CODE (VALUE_TYPE (*objp)) == TYPE_CODE_PTR)
2899 temp = value_addr (temp);
2903 return oload_incompatible ? 100 : (oload_non_standard ? 10 : 0);
2906 /* C++: return 1 is NAME is a legitimate name for the destructor
2907 of type TYPE. If TYPE does not have a destructor, or
2908 if NAME is inappropriate for TYPE, an error is signaled. */
2910 destructor_name_p (const char *name, const struct type *type)
2912 /* destructors are a special case. */
2916 char *dname = type_name_no_tag (type);
2917 char *cp = strchr (dname, '<');
2920 /* Do not compare the template part for template classes. */
2922 len = strlen (dname);
2925 if (strlen (name + 1) != len || !STREQN (dname, name + 1, len))
2926 error ("name of destructor must equal name of class");
2933 /* Helper function for check_field: Given TYPE, a structure/union,
2934 return 1 if the component named NAME from the ultimate
2935 target structure/union is defined, otherwise, return 0. */
2938 check_field_in (register struct type *type, const char *name)
2942 for (i = TYPE_NFIELDS (type) - 1; i >= TYPE_N_BASECLASSES (type); i--)
2944 char *t_field_name = TYPE_FIELD_NAME (type, i);
2945 if (t_field_name && (strcmp_iw (t_field_name, name) == 0))
2949 /* C++: If it was not found as a data field, then try to
2950 return it as a pointer to a method. */
2952 /* Destructors are a special case. */
2953 if (destructor_name_p (name, type))
2955 int m_index, f_index;
2957 return get_destructor_fn_field (type, &m_index, &f_index);
2960 for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; --i)
2962 if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type, i), name) == 0)
2966 for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--)
2967 if (check_field_in (TYPE_BASECLASS (type, i), name))
2974 /* C++: Given ARG1, a value of type (pointer to a)* structure/union,
2975 return 1 if the component named NAME from the ultimate
2976 target structure/union is defined, otherwise, return 0. */
2979 check_field (struct value *arg1, const char *name)
2981 register struct type *t;
2983 COERCE_ARRAY (arg1);
2985 t = VALUE_TYPE (arg1);
2987 /* Follow pointers until we get to a non-pointer. */
2992 if (TYPE_CODE (t) != TYPE_CODE_PTR && TYPE_CODE (t) != TYPE_CODE_REF)
2994 t = TYPE_TARGET_TYPE (t);
2997 if (TYPE_CODE (t) == TYPE_CODE_MEMBER)
2998 error ("not implemented: member type in check_field");
3000 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
3001 && TYPE_CODE (t) != TYPE_CODE_UNION)
3002 error ("Internal error: `this' is not an aggregate");
3004 return check_field_in (t, name);
3007 /* C++: Given an aggregate type CURTYPE, and a member name NAME,
3008 return the address of this member as a "pointer to member"
3009 type. If INTYPE is non-null, then it will be the type
3010 of the member we are looking for. This will help us resolve
3011 "pointers to member functions". This function is used
3012 to resolve user expressions of the form "DOMAIN::NAME". */
3015 value_struct_elt_for_reference (struct type *domain, int offset,
3016 struct type *curtype, char *name,
3017 struct type *intype)
3019 register struct type *t = curtype;
3023 if (TYPE_CODE (t) != TYPE_CODE_STRUCT
3024 && TYPE_CODE (t) != TYPE_CODE_UNION)
3025 error ("Internal error: non-aggregate type to value_struct_elt_for_reference");
3027 for (i = TYPE_NFIELDS (t) - 1; i >= TYPE_N_BASECLASSES (t); i--)
3029 char *t_field_name = TYPE_FIELD_NAME (t, i);
3031 if (t_field_name && STREQ (t_field_name, name))
3033 if (TYPE_FIELD_STATIC (t, i))
3035 v = value_static_field (t, i);
3037 error ("Internal error: could not find static variable %s",
3041 if (TYPE_FIELD_PACKED (t, i))
3042 error ("pointers to bitfield members not allowed");
3044 return value_from_longest
3045 (lookup_reference_type (lookup_member_type (TYPE_FIELD_TYPE (t, i),
3047 offset + (LONGEST) (TYPE_FIELD_BITPOS (t, i) >> 3));
3051 /* C++: If it was not found as a data field, then try to
3052 return it as a pointer to a method. */
3054 /* Destructors are a special case. */
3055 if (destructor_name_p (name, t))
3057 error ("member pointers to destructors not implemented yet");
3060 /* Perform all necessary dereferencing. */
3061 while (intype && TYPE_CODE (intype) == TYPE_CODE_PTR)
3062 intype = TYPE_TARGET_TYPE (intype);
3064 for (i = TYPE_NFN_FIELDS (t) - 1; i >= 0; --i)
3066 char *t_field_name = TYPE_FN_FIELDLIST_NAME (t, i);
3067 char dem_opname[64];
3069 if (strncmp (t_field_name, "__", 2) == 0 ||
3070 strncmp (t_field_name, "op", 2) == 0 ||
3071 strncmp (t_field_name, "type", 4) == 0)
3073 if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI))
3074 t_field_name = dem_opname;
3075 else if (cplus_demangle_opname (t_field_name, dem_opname, 0))
3076 t_field_name = dem_opname;
3078 if (t_field_name && STREQ (t_field_name, name))
3080 int j = TYPE_FN_FIELDLIST_LENGTH (t, i);
3081 struct fn_field *f = TYPE_FN_FIELDLIST1 (t, i);
3083 if (intype == 0 && j > 1)
3084 error ("non-unique member `%s' requires type instantiation", name);
3088 if (TYPE_FN_FIELD_TYPE (f, j) == intype)
3091 error ("no member function matches that type instantiation");
3096 if (TYPE_FN_FIELD_STUB (f, j))
3097 check_stub_method (t, i, j);
3098 if (TYPE_FN_FIELD_VIRTUAL_P (f, j))
3100 return value_from_longest
3101 (lookup_reference_type
3102 (lookup_member_type (TYPE_FN_FIELD_TYPE (f, j),
3104 (LONGEST) METHOD_PTR_FROM_VOFFSET (TYPE_FN_FIELD_VOFFSET (f, j)));
3108 struct symbol *s = lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j),
3109 0, VAR_NAMESPACE, 0, NULL);
3116 v = read_var_value (s, 0);
3118 VALUE_TYPE (v) = lookup_reference_type
3119 (lookup_member_type (TYPE_FN_FIELD_TYPE (f, j),
3127 for (i = TYPE_N_BASECLASSES (t) - 1; i >= 0; i--)
3132 if (BASETYPE_VIA_VIRTUAL (t, i))
3135 base_offset = TYPE_BASECLASS_BITPOS (t, i) / 8;
3136 v = value_struct_elt_for_reference (domain,
3137 offset + base_offset,
3138 TYPE_BASECLASS (t, i),
3148 /* Given a pointer value V, find the real (RTTI) type
3149 of the object it points to.
3150 Other parameters FULL, TOP, USING_ENC as with value_rtti_type()
3151 and refer to the values computed for the object pointed to. */
3154 value_rtti_target_type (struct value *v, int *full, int *top, int *using_enc)
3156 struct value *target;
3158 target = value_ind (v);
3160 return value_rtti_type (target, full, top, using_enc);
3163 /* Given a value pointed to by ARGP, check its real run-time type, and
3164 if that is different from the enclosing type, create a new value
3165 using the real run-time type as the enclosing type (and of the same
3166 type as ARGP) and return it, with the embedded offset adjusted to
3167 be the correct offset to the enclosed object
3168 RTYPE is the type, and XFULL, XTOP, and XUSING_ENC are the other
3169 parameters, computed by value_rtti_type(). If these are available,
3170 they can be supplied and a second call to value_rtti_type() is avoided.
3171 (Pass RTYPE == NULL if they're not available */
3174 value_full_object (struct value *argp, struct type *rtype, int xfull, int xtop,
3177 struct type *real_type;
3181 struct value *new_val;
3188 using_enc = xusing_enc;
3191 real_type = value_rtti_type (argp, &full, &top, &using_enc);
3193 /* If no RTTI data, or if object is already complete, do nothing */
3194 if (!real_type || real_type == VALUE_ENCLOSING_TYPE (argp))
3197 /* If we have the full object, but for some reason the enclosing
3198 type is wrong, set it *//* pai: FIXME -- sounds iffy */
3201 argp = value_change_enclosing_type (argp, real_type);
3205 /* Check if object is in memory */
3206 if (VALUE_LVAL (argp) != lval_memory)
3208 warning ("Couldn't retrieve complete object of RTTI type %s; object may be in register(s).", TYPE_NAME (real_type));
3213 /* All other cases -- retrieve the complete object */
3214 /* Go back by the computed top_offset from the beginning of the object,
3215 adjusting for the embedded offset of argp if that's what value_rtti_type
3216 used for its computation. */
3217 new_val = value_at_lazy (real_type, VALUE_ADDRESS (argp) - top +
3218 (using_enc ? 0 : VALUE_EMBEDDED_OFFSET (argp)),
3219 VALUE_BFD_SECTION (argp));
3220 VALUE_TYPE (new_val) = VALUE_TYPE (argp);
3221 VALUE_EMBEDDED_OFFSET (new_val) = using_enc ? top + VALUE_EMBEDDED_OFFSET (argp) : top;
3228 /* C++: return the value of the class instance variable, if one exists.
3229 Flag COMPLAIN signals an error if the request is made in an
3230 inappropriate context. */
3233 value_of_this (int complain)
3235 struct symbol *func, *sym;
3238 static const char funny_this[] = "this";
3241 if (selected_frame == 0)
3244 error ("no frame selected");
3249 func = get_frame_function (selected_frame);
3253 error ("no `this' in nameless context");
3258 b = SYMBOL_BLOCK_VALUE (func);
3259 i = BLOCK_NSYMS (b);
3263 error ("no args, no `this'");
3268 /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER
3269 symbol instead of the LOC_ARG one (if both exist). */
3270 sym = lookup_block_symbol (b, funny_this, NULL, VAR_NAMESPACE);
3274 error ("current stack frame not in method");
3279 this = read_var_value (sym, selected_frame);
3280 if (this == 0 && complain)
3281 error ("`this' argument at unknown address");
3285 /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH elements
3286 long, starting at LOWBOUND. The result has the same lower bound as
3287 the original ARRAY. */
3290 value_slice (struct value *array, int lowbound, int length)
3292 struct type *slice_range_type, *slice_type, *range_type;
3293 LONGEST lowerbound, upperbound, offset;
3294 struct value *slice;
3295 struct type *array_type;
3296 array_type = check_typedef (VALUE_TYPE (array));
3297 COERCE_VARYING_ARRAY (array, array_type);
3298 if (TYPE_CODE (array_type) != TYPE_CODE_ARRAY
3299 && TYPE_CODE (array_type) != TYPE_CODE_STRING
3300 && TYPE_CODE (array_type) != TYPE_CODE_BITSTRING)
3301 error ("cannot take slice of non-array");
3302 range_type = TYPE_INDEX_TYPE (array_type);
3303 if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0)
3304 error ("slice from bad array or bitstring");
3305 if (lowbound < lowerbound || length < 0
3306 || lowbound + length - 1 > upperbound
3307 /* Chill allows zero-length strings but not arrays. */
3308 || (current_language->la_language == language_chill
3309 && length == 0 && TYPE_CODE (array_type) == TYPE_CODE_ARRAY))
3310 error ("slice out of range");
3311 /* FIXME-type-allocation: need a way to free this type when we are
3313 slice_range_type = create_range_type ((struct type *) NULL,
3314 TYPE_TARGET_TYPE (range_type),
3315 lowbound, lowbound + length - 1);
3316 if (TYPE_CODE (array_type) == TYPE_CODE_BITSTRING)
3319 slice_type = create_set_type ((struct type *) NULL, slice_range_type);
3320 TYPE_CODE (slice_type) = TYPE_CODE_BITSTRING;
3321 slice = value_zero (slice_type, not_lval);
3322 for (i = 0; i < length; i++)
3324 int element = value_bit_index (array_type,
3325 VALUE_CONTENTS (array),
3328 error ("internal error accessing bitstring");
3329 else if (element > 0)
3331 int j = i % TARGET_CHAR_BIT;
3332 if (BITS_BIG_ENDIAN)
3333 j = TARGET_CHAR_BIT - 1 - j;
3334 VALUE_CONTENTS_RAW (slice)[i / TARGET_CHAR_BIT] |= (1 << j);
3337 /* We should set the address, bitssize, and bitspos, so the clice
3338 can be used on the LHS, but that may require extensions to
3339 value_assign. For now, just leave as a non_lval. FIXME. */
3343 struct type *element_type = TYPE_TARGET_TYPE (array_type);
3345 = (lowbound - lowerbound) * TYPE_LENGTH (check_typedef (element_type));
3346 slice_type = create_array_type ((struct type *) NULL, element_type,
3348 TYPE_CODE (slice_type) = TYPE_CODE (array_type);
3349 slice = allocate_value (slice_type);
3350 if (VALUE_LAZY (array))
3351 VALUE_LAZY (slice) = 1;
3353 memcpy (VALUE_CONTENTS (slice), VALUE_CONTENTS (array) + offset,
3354 TYPE_LENGTH (slice_type));
3355 if (VALUE_LVAL (array) == lval_internalvar)
3356 VALUE_LVAL (slice) = lval_internalvar_component;
3358 VALUE_LVAL (slice) = VALUE_LVAL (array);
3359 VALUE_ADDRESS (slice) = VALUE_ADDRESS (array);
3360 VALUE_OFFSET (slice) = VALUE_OFFSET (array) + offset;
3365 /* Assuming chill_varying_type (VARRAY) is true, return an equivalent
3366 value as a fixed-length array. */
3369 varying_to_slice (struct value *varray)
3371 struct type *vtype = check_typedef (VALUE_TYPE (varray));
3372 LONGEST length = unpack_long (TYPE_FIELD_TYPE (vtype, 0),
3373 VALUE_CONTENTS (varray)
3374 + TYPE_FIELD_BITPOS (vtype, 0) / 8);
3375 return value_slice (value_primitive_field (varray, 0, 1, vtype), 0, length);
3378 /* Create a value for a FORTRAN complex number. Currently most of
3379 the time values are coerced to COMPLEX*16 (i.e. a complex number
3380 composed of 2 doubles. This really should be a smarter routine
3381 that figures out precision inteligently as opposed to assuming
3382 doubles. FIXME: fmb */
3385 value_literal_complex (struct value *arg1, struct value *arg2, struct type *type)
3388 struct type *real_type = TYPE_TARGET_TYPE (type);
3390 val = allocate_value (type);
3391 arg1 = value_cast (real_type, arg1);
3392 arg2 = value_cast (real_type, arg2);
3394 memcpy (VALUE_CONTENTS_RAW (val),
3395 VALUE_CONTENTS (arg1), TYPE_LENGTH (real_type));
3396 memcpy (VALUE_CONTENTS_RAW (val) + TYPE_LENGTH (real_type),
3397 VALUE_CONTENTS (arg2), TYPE_LENGTH (real_type));
3401 /* Cast a value into the appropriate complex data type. */
3403 static struct value *
3404 cast_into_complex (struct type *type, struct value *val)
3406 struct type *real_type = TYPE_TARGET_TYPE (type);
3407 if (TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_COMPLEX)
3409 struct type *val_real_type = TYPE_TARGET_TYPE (VALUE_TYPE (val));
3410 struct value *re_val = allocate_value (val_real_type);
3411 struct value *im_val = allocate_value (val_real_type);
3413 memcpy (VALUE_CONTENTS_RAW (re_val),
3414 VALUE_CONTENTS (val), TYPE_LENGTH (val_real_type));
3415 memcpy (VALUE_CONTENTS_RAW (im_val),
3416 VALUE_CONTENTS (val) + TYPE_LENGTH (val_real_type),
3417 TYPE_LENGTH (val_real_type));
3419 return value_literal_complex (re_val, im_val, type);
3421 else if (TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_FLT
3422 || TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_INT)
3423 return value_literal_complex (val, value_zero (real_type, not_lval), type);
3425 error ("cannot cast non-number to complex");
3429 _initialize_valops (void)
3433 (add_set_cmd ("abandon", class_support, var_boolean, (char *) &auto_abandon,
3434 "Set automatic abandonment of expressions upon failure.",
3440 (add_set_cmd ("overload-resolution", class_support, var_boolean, (char *) &overload_resolution,
3441 "Set overload resolution in evaluating C++ functions.",
3444 overload_resolution = 1;
3447 add_set_cmd ("unwindonsignal", no_class, var_boolean,
3448 (char *) &unwind_on_signal_p,
3449 "Set unwinding of stack if a signal is received while in a call dummy.\n\
3450 The unwindonsignal lets the user determine what gdb should do if a signal\n\
3451 is received while in a function called from gdb (call dummy). If set, gdb\n\
3452 unwinds the stack and restore the context to what as it was before the call.\n\
3453 The default is to stop in the frame where the signal was received.", &setlist),