1 /* Perform arithmetic and other operations on values, for GDB.
3 Copyright 1986, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995,
4 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004 Free Software
7 This file is part of GDB.
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2 of the License, or
12 (at your option) any later version.
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with this program; if not, write to the Free Software
21 Foundation, Inc., 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA. */
28 #include "expression.h"
31 #include "gdb_string.h"
36 /* Define whether or not the C operator '/' truncates towards zero for
37 differently signed operands (truncation direction is undefined in C). */
39 #ifndef TRUNCATION_TOWARDS_ZERO
40 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
43 static struct value
*value_subscripted_rvalue (struct value
*, struct value
*, int);
45 void _initialize_valarith (void);
48 /* Given a pointer, return the size of its target.
49 If the pointer type is void *, then return 1.
50 If the target type is incomplete, then error out.
51 This isn't a general purpose function, but just a
52 helper for value_sub & value_add.
56 find_size_for_pointer_math (struct type
*ptr_type
)
59 struct type
*ptr_target
;
61 ptr_target
= check_typedef (TYPE_TARGET_TYPE (ptr_type
));
63 sz
= TYPE_LENGTH (ptr_target
);
66 if (TYPE_CODE (ptr_type
) == TYPE_CODE_VOID
)
72 name
= TYPE_NAME (ptr_target
);
74 name
= TYPE_TAG_NAME (ptr_target
);
76 error ("Cannot perform pointer math on incomplete types, "
77 "try casting to a known type, or void *.");
79 error ("Cannot perform pointer math on incomplete type \"%s\", "
80 "try casting to a known type, or void *.", name
);
87 value_add (struct value
*arg1
, struct value
*arg2
)
92 struct type
*type1
, *type2
, *valptrtype
;
94 arg1
= coerce_array (arg1
);
95 arg2
= coerce_array (arg2
);
96 type1
= check_typedef (value_type (arg1
));
97 type2
= check_typedef (value_type (arg2
));
99 if ((TYPE_CODE (type1
) == TYPE_CODE_PTR
100 || TYPE_CODE (type2
) == TYPE_CODE_PTR
)
102 (is_integral_type (type1
) || is_integral_type (type2
)))
103 /* Exactly one argument is a pointer, and one is an integer. */
105 struct value
*retval
;
107 if (TYPE_CODE (type1
) == TYPE_CODE_PTR
)
120 sz
= find_size_for_pointer_math (valptrtype
);
122 retval
= value_from_pointer (valptrtype
,
123 value_as_address (valptr
)
124 + (sz
* value_as_long (valint
)));
128 return value_binop (arg1
, arg2
, BINOP_ADD
);
132 value_sub (struct value
*arg1
, struct value
*arg2
)
134 struct type
*type1
, *type2
;
135 arg1
= coerce_array (arg1
);
136 arg2
= coerce_array (arg2
);
137 type1
= check_typedef (value_type (arg1
));
138 type2
= check_typedef (value_type (arg2
));
140 if (TYPE_CODE (type1
) == TYPE_CODE_PTR
)
142 if (is_integral_type (type2
))
144 /* pointer - integer. */
145 LONGEST sz
= find_size_for_pointer_math (type1
);
147 return value_from_pointer (type1
,
148 (value_as_address (arg1
)
149 - (sz
* value_as_long (arg2
))));
151 else if (TYPE_CODE (type2
) == TYPE_CODE_PTR
152 && TYPE_LENGTH (check_typedef (TYPE_TARGET_TYPE (type1
)))
153 == TYPE_LENGTH (check_typedef (TYPE_TARGET_TYPE (type2
))))
155 /* pointer to <type x> - pointer to <type x>. */
156 LONGEST sz
= TYPE_LENGTH (check_typedef (TYPE_TARGET_TYPE (type1
)));
157 return value_from_longest
158 (builtin_type_long
, /* FIXME -- should be ptrdiff_t */
159 (value_as_long (arg1
) - value_as_long (arg2
)) / sz
);
164 First argument of `-' is a pointer and second argument is neither\n\
165 an integer nor a pointer of the same type.");
169 return value_binop (arg1
, arg2
, BINOP_SUB
);
172 /* Return the value of ARRAY[IDX].
173 See comments in value_coerce_array() for rationale for reason for
174 doing lower bounds adjustment here rather than there.
175 FIXME: Perhaps we should validate that the index is valid and if
176 verbosity is set, warn about invalid indices (but still use them). */
179 value_subscript (struct value
*array
, struct value
*idx
)
182 int c_style
= current_language
->c_style_arrays
;
185 array
= coerce_ref (array
);
186 tarray
= check_typedef (value_type (array
));
188 if (TYPE_CODE (tarray
) == TYPE_CODE_ARRAY
189 || TYPE_CODE (tarray
) == TYPE_CODE_STRING
)
191 struct type
*range_type
= TYPE_INDEX_TYPE (tarray
);
192 LONGEST lowerbound
, upperbound
;
193 get_discrete_bounds (range_type
, &lowerbound
, &upperbound
);
195 if (VALUE_LVAL (array
) != lval_memory
)
196 return value_subscripted_rvalue (array
, idx
, lowerbound
);
200 LONGEST index
= value_as_long (idx
);
201 if (index
>= lowerbound
&& index
<= upperbound
)
202 return value_subscripted_rvalue (array
, idx
, lowerbound
);
203 /* Emit warning unless we have an array of unknown size.
204 An array of unknown size has lowerbound 0 and upperbound -1. */
206 warning ("array or string index out of range");
207 /* fall doing C stuff */
213 bound
= value_from_longest (builtin_type_int
, (LONGEST
) lowerbound
);
214 idx
= value_sub (idx
, bound
);
217 array
= value_coerce_array (array
);
220 if (TYPE_CODE (tarray
) == TYPE_CODE_BITSTRING
)
222 struct type
*range_type
= TYPE_INDEX_TYPE (tarray
);
223 LONGEST index
= value_as_long (idx
);
225 int offset
, byte
, bit_index
;
226 LONGEST lowerbound
, upperbound
;
227 get_discrete_bounds (range_type
, &lowerbound
, &upperbound
);
228 if (index
< lowerbound
|| index
> upperbound
)
229 error ("bitstring index out of range");
231 offset
= index
/ TARGET_CHAR_BIT
;
232 byte
= *((char *) VALUE_CONTENTS (array
) + offset
);
233 bit_index
= index
% TARGET_CHAR_BIT
;
234 byte
>>= (BITS_BIG_ENDIAN
? TARGET_CHAR_BIT
- 1 - bit_index
: bit_index
);
235 v
= value_from_longest (LA_BOOL_TYPE
, byte
& 1);
236 v
->bitpos
= bit_index
;
238 VALUE_LVAL (v
) = VALUE_LVAL (array
);
239 if (VALUE_LVAL (array
) == lval_internalvar
)
240 VALUE_LVAL (v
) = lval_internalvar_component
;
241 VALUE_ADDRESS (v
) = VALUE_ADDRESS (array
);
242 v
->offset
= offset
+ value_offset (array
);
247 return value_ind (value_add (array
, idx
));
249 error ("not an array or string");
252 /* Return the value of EXPR[IDX], expr an aggregate rvalue
253 (eg, a vector register). This routine used to promote floats
254 to doubles, but no longer does. */
256 static struct value
*
257 value_subscripted_rvalue (struct value
*array
, struct value
*idx
, int lowerbound
)
259 struct type
*array_type
= check_typedef (value_type (array
));
260 struct type
*elt_type
= check_typedef (TYPE_TARGET_TYPE (array_type
));
261 unsigned int elt_size
= TYPE_LENGTH (elt_type
);
262 LONGEST index
= value_as_long (idx
);
263 unsigned int elt_offs
= elt_size
* longest_to_int (index
- lowerbound
);
266 if (index
< lowerbound
|| elt_offs
>= TYPE_LENGTH (array_type
))
267 error ("no such vector element");
269 v
= allocate_value (elt_type
);
270 if (VALUE_LAZY (array
))
273 memcpy (VALUE_CONTENTS (v
), VALUE_CONTENTS (array
) + elt_offs
, elt_size
);
275 if (VALUE_LVAL (array
) == lval_internalvar
)
276 VALUE_LVAL (v
) = lval_internalvar_component
;
278 VALUE_LVAL (v
) = VALUE_LVAL (array
);
279 VALUE_ADDRESS (v
) = VALUE_ADDRESS (array
);
280 VALUE_REGNUM (v
) = VALUE_REGNUM (array
);
281 v
->offset
= value_offset (array
) + elt_offs
;
285 /* Check to see if either argument is a structure. This is called so
286 we know whether to go ahead with the normal binop or look for a
287 user defined function instead.
289 For now, we do not overload the `=' operator. */
292 binop_user_defined_p (enum exp_opcode op
, struct value
*arg1
, struct value
*arg2
)
294 struct type
*type1
, *type2
;
295 if (op
== BINOP_ASSIGN
|| op
== BINOP_CONCAT
)
297 type1
= check_typedef (value_type (arg1
));
298 type2
= check_typedef (value_type (arg2
));
299 return (TYPE_CODE (type1
) == TYPE_CODE_STRUCT
300 || TYPE_CODE (type2
) == TYPE_CODE_STRUCT
301 || (TYPE_CODE (type1
) == TYPE_CODE_REF
302 && TYPE_CODE (TYPE_TARGET_TYPE (type1
)) == TYPE_CODE_STRUCT
)
303 || (TYPE_CODE (type2
) == TYPE_CODE_REF
304 && TYPE_CODE (TYPE_TARGET_TYPE (type2
)) == TYPE_CODE_STRUCT
));
307 /* Check to see if argument is a structure. This is called so
308 we know whether to go ahead with the normal unop or look for a
309 user defined function instead.
311 For now, we do not overload the `&' operator. */
314 unop_user_defined_p (enum exp_opcode op
, struct value
*arg1
)
319 type1
= check_typedef (value_type (arg1
));
322 if (TYPE_CODE (type1
) == TYPE_CODE_STRUCT
)
324 else if (TYPE_CODE (type1
) == TYPE_CODE_REF
)
325 type1
= TYPE_TARGET_TYPE (type1
);
331 /* We know either arg1 or arg2 is a structure, so try to find the right
332 user defined function. Create an argument vector that calls
333 arg1.operator @ (arg1,arg2) and return that value (where '@' is any
334 binary operator which is legal for GNU C++).
336 OP is the operatore, and if it is BINOP_ASSIGN_MODIFY, then OTHEROP
337 is the opcode saying how to modify it. Otherwise, OTHEROP is
341 value_x_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
,
342 enum exp_opcode otherop
, enum noside noside
)
344 struct value
**argvec
;
349 arg1
= coerce_ref (arg1
);
350 arg2
= coerce_ref (arg2
);
351 arg1
= coerce_enum (arg1
);
352 arg2
= coerce_enum (arg2
);
354 /* now we know that what we have to do is construct our
355 arg vector and find the right function to call it with. */
357 if (TYPE_CODE (check_typedef (value_type (arg1
))) != TYPE_CODE_STRUCT
)
358 error ("Can't do that binary op on that type"); /* FIXME be explicit */
360 argvec
= (struct value
**) alloca (sizeof (struct value
*) * 4);
361 argvec
[1] = value_addr (arg1
);
365 /* make the right function name up */
366 strcpy (tstr
, "operator__");
391 case BINOP_BITWISE_AND
:
394 case BINOP_BITWISE_IOR
:
397 case BINOP_BITWISE_XOR
:
400 case BINOP_LOGICAL_AND
:
403 case BINOP_LOGICAL_OR
:
415 case BINOP_ASSIGN_MODIFY
:
433 case BINOP_BITWISE_AND
:
436 case BINOP_BITWISE_IOR
:
439 case BINOP_BITWISE_XOR
:
442 case BINOP_MOD
: /* invalid */
444 error ("Invalid binary operation specified.");
447 case BINOP_SUBSCRIPT
:
468 case BINOP_MOD
: /* invalid */
470 error ("Invalid binary operation specified.");
473 argvec
[0] = value_struct_elt (&arg1
, argvec
+ 1, tstr
, &static_memfuncp
, "structure");
479 argvec
[1] = argvec
[0];
482 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
484 struct type
*return_type
;
486 = TYPE_TARGET_TYPE (check_typedef (value_type (argvec
[0])));
487 return value_zero (return_type
, VALUE_LVAL (arg1
));
489 return call_function_by_hand (argvec
[0], 2 - static_memfuncp
, argvec
+ 1);
491 error ("member function %s not found", tstr
);
493 return call_function_by_hand (argvec
[0], 2 - static_memfuncp
, argvec
+ 1);
497 /* We know that arg1 is a structure, so try to find a unary user
498 defined operator that matches the operator in question.
499 Create an argument vector that calls arg1.operator @ (arg1)
500 and return that value (where '@' is (almost) any unary operator which
501 is legal for GNU C++). */
504 value_x_unop (struct value
*arg1
, enum exp_opcode op
, enum noside noside
)
506 struct value
**argvec
;
507 char *ptr
, *mangle_ptr
;
508 char tstr
[13], mangle_tstr
[13];
509 int static_memfuncp
, nargs
;
511 arg1
= coerce_ref (arg1
);
512 arg1
= coerce_enum (arg1
);
514 /* now we know that what we have to do is construct our
515 arg vector and find the right function to call it with. */
517 if (TYPE_CODE (check_typedef (value_type (arg1
))) != TYPE_CODE_STRUCT
)
518 error ("Can't do that unary op on that type"); /* FIXME be explicit */
520 argvec
= (struct value
**) alloca (sizeof (struct value
*) * 4);
521 argvec
[1] = value_addr (arg1
);
526 /* make the right function name up */
527 strcpy (tstr
, "operator__");
529 strcpy (mangle_tstr
, "__");
530 mangle_ptr
= mangle_tstr
+ 2;
533 case UNOP_PREINCREMENT
:
536 case UNOP_PREDECREMENT
:
539 case UNOP_POSTINCREMENT
:
541 argvec
[2] = value_from_longest (builtin_type_int
, 0);
545 case UNOP_POSTDECREMENT
:
547 argvec
[2] = value_from_longest (builtin_type_int
, 0);
551 case UNOP_LOGICAL_NOT
:
554 case UNOP_COMPLEMENT
:
564 error ("Invalid unary operation specified.");
567 argvec
[0] = value_struct_elt (&arg1
, argvec
+ 1, tstr
, &static_memfuncp
, "structure");
573 argvec
[1] = argvec
[0];
577 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
579 struct type
*return_type
;
581 = TYPE_TARGET_TYPE (check_typedef (value_type (argvec
[0])));
582 return value_zero (return_type
, VALUE_LVAL (arg1
));
584 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
586 error ("member function %s not found", tstr
);
587 return 0; /* For lint -- never reached */
591 /* Concatenate two values with the following conditions:
593 (1) Both values must be either bitstring values or character string
594 values and the resulting value consists of the concatenation of
595 ARG1 followed by ARG2.
599 One value must be an integer value and the other value must be
600 either a bitstring value or character string value, which is
601 to be repeated by the number of times specified by the integer
605 (2) Boolean values are also allowed and are treated as bit string
608 (3) Character values are also allowed and are treated as character
609 string values of length 1.
613 value_concat (struct value
*arg1
, struct value
*arg2
)
615 struct value
*inval1
;
616 struct value
*inval2
;
617 struct value
*outval
= NULL
;
618 int inval1len
, inval2len
;
622 struct type
*type1
= check_typedef (value_type (arg1
));
623 struct type
*type2
= check_typedef (value_type (arg2
));
625 /* First figure out if we are dealing with two values to be concatenated
626 or a repeat count and a value to be repeated. INVAL1 is set to the
627 first of two concatenated values, or the repeat count. INVAL2 is set
628 to the second of the two concatenated values or the value to be
631 if (TYPE_CODE (type2
) == TYPE_CODE_INT
)
633 struct type
*tmp
= type1
;
645 /* Now process the input values. */
647 if (TYPE_CODE (type1
) == TYPE_CODE_INT
)
649 /* We have a repeat count. Validate the second value and then
650 construct a value repeated that many times. */
651 if (TYPE_CODE (type2
) == TYPE_CODE_STRING
652 || TYPE_CODE (type2
) == TYPE_CODE_CHAR
)
654 count
= longest_to_int (value_as_long (inval1
));
655 inval2len
= TYPE_LENGTH (type2
);
656 ptr
= (char *) alloca (count
* inval2len
);
657 if (TYPE_CODE (type2
) == TYPE_CODE_CHAR
)
659 inchar
= (char) unpack_long (type2
,
660 VALUE_CONTENTS (inval2
));
661 for (idx
= 0; idx
< count
; idx
++)
663 *(ptr
+ idx
) = inchar
;
668 for (idx
= 0; idx
< count
; idx
++)
670 memcpy (ptr
+ (idx
* inval2len
), VALUE_CONTENTS (inval2
),
674 outval
= value_string (ptr
, count
* inval2len
);
676 else if (TYPE_CODE (type2
) == TYPE_CODE_BITSTRING
677 || TYPE_CODE (type2
) == TYPE_CODE_BOOL
)
679 error ("unimplemented support for bitstring/boolean repeats");
683 error ("can't repeat values of that type");
686 else if (TYPE_CODE (type1
) == TYPE_CODE_STRING
687 || TYPE_CODE (type1
) == TYPE_CODE_CHAR
)
689 /* We have two character strings to concatenate. */
690 if (TYPE_CODE (type2
) != TYPE_CODE_STRING
691 && TYPE_CODE (type2
) != TYPE_CODE_CHAR
)
693 error ("Strings can only be concatenated with other strings.");
695 inval1len
= TYPE_LENGTH (type1
);
696 inval2len
= TYPE_LENGTH (type2
);
697 ptr
= (char *) alloca (inval1len
+ inval2len
);
698 if (TYPE_CODE (type1
) == TYPE_CODE_CHAR
)
700 *ptr
= (char) unpack_long (type1
, VALUE_CONTENTS (inval1
));
704 memcpy (ptr
, VALUE_CONTENTS (inval1
), inval1len
);
706 if (TYPE_CODE (type2
) == TYPE_CODE_CHAR
)
709 (char) unpack_long (type2
, VALUE_CONTENTS (inval2
));
713 memcpy (ptr
+ inval1len
, VALUE_CONTENTS (inval2
), inval2len
);
715 outval
= value_string (ptr
, inval1len
+ inval2len
);
717 else if (TYPE_CODE (type1
) == TYPE_CODE_BITSTRING
718 || TYPE_CODE (type1
) == TYPE_CODE_BOOL
)
720 /* We have two bitstrings to concatenate. */
721 if (TYPE_CODE (type2
) != TYPE_CODE_BITSTRING
722 && TYPE_CODE (type2
) != TYPE_CODE_BOOL
)
724 error ("Bitstrings or booleans can only be concatenated with other bitstrings or booleans.");
726 error ("unimplemented support for bitstring/boolean concatenation.");
730 /* We don't know how to concatenate these operands. */
731 error ("illegal operands for concatenation.");
738 /* Perform a binary operation on two operands which have reasonable
739 representations as integers or floats. This includes booleans,
740 characters, integers, or floats.
741 Does not support addition and subtraction on pointers;
742 use value_add or value_sub if you want to handle those possibilities. */
745 value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
748 struct type
*type1
, *type2
;
750 arg1
= coerce_ref (arg1
);
751 arg2
= coerce_ref (arg2
);
752 type1
= check_typedef (value_type (arg1
));
753 type2
= check_typedef (value_type (arg2
));
755 if ((TYPE_CODE (type1
) != TYPE_CODE_FLT
&& !is_integral_type (type1
))
757 (TYPE_CODE (type2
) != TYPE_CODE_FLT
&& !is_integral_type (type2
)))
758 error ("Argument to arithmetic operation not a number or boolean.");
760 if (TYPE_CODE (type1
) == TYPE_CODE_FLT
762 TYPE_CODE (type2
) == TYPE_CODE_FLT
)
764 /* FIXME-if-picky-about-floating-accuracy: Should be doing this
765 in target format. real.c in GCC probably has the necessary
767 DOUBLEST v1
, v2
, v
= 0;
768 v1
= value_as_double (arg1
);
769 v2
= value_as_double (arg2
);
791 error ("Cannot perform exponentiation: %s", safe_strerror (errno
));
795 error ("Integer-only operation on floating point number.");
798 /* If either arg was long double, make sure that value is also long
801 if (TYPE_LENGTH (type1
) * 8 > TARGET_DOUBLE_BIT
802 || TYPE_LENGTH (type2
) * 8 > TARGET_DOUBLE_BIT
)
803 val
= allocate_value (builtin_type_long_double
);
805 val
= allocate_value (builtin_type_double
);
807 store_typed_floating (VALUE_CONTENTS_RAW (val
), value_type (val
), v
);
809 else if (TYPE_CODE (type1
) == TYPE_CODE_BOOL
811 TYPE_CODE (type2
) == TYPE_CODE_BOOL
)
813 LONGEST v1
, v2
, v
= 0;
814 v1
= value_as_long (arg1
);
815 v2
= value_as_long (arg2
);
819 case BINOP_BITWISE_AND
:
823 case BINOP_BITWISE_IOR
:
827 case BINOP_BITWISE_XOR
:
840 error ("Invalid operation on booleans.");
843 val
= allocate_value (type1
);
844 store_signed_integer (VALUE_CONTENTS_RAW (val
),
849 /* Integral operations here. */
850 /* FIXME: Also mixed integral/booleans, with result an integer. */
851 /* FIXME: This implements ANSI C rules (also correct for C++).
852 What about FORTRAN and (the deleted) chill ? */
854 unsigned int promoted_len1
= TYPE_LENGTH (type1
);
855 unsigned int promoted_len2
= TYPE_LENGTH (type2
);
856 int is_unsigned1
= TYPE_UNSIGNED (type1
);
857 int is_unsigned2
= TYPE_UNSIGNED (type2
);
858 unsigned int result_len
;
859 int unsigned_operation
;
861 /* Determine type length and signedness after promotion for
863 if (promoted_len1
< TYPE_LENGTH (builtin_type_int
))
866 promoted_len1
= TYPE_LENGTH (builtin_type_int
);
868 if (promoted_len2
< TYPE_LENGTH (builtin_type_int
))
871 promoted_len2
= TYPE_LENGTH (builtin_type_int
);
874 /* Determine type length of the result, and if the operation should
876 Use the signedness of the operand with the greater length.
877 If both operands are of equal length, use unsigned operation
878 if one of the operands is unsigned. */
879 if (promoted_len1
> promoted_len2
)
881 unsigned_operation
= is_unsigned1
;
882 result_len
= promoted_len1
;
884 else if (promoted_len2
> promoted_len1
)
886 unsigned_operation
= is_unsigned2
;
887 result_len
= promoted_len2
;
891 unsigned_operation
= is_unsigned1
|| is_unsigned2
;
892 result_len
= promoted_len1
;
895 if (unsigned_operation
)
897 ULONGEST v1
, v2
, v
= 0;
898 v1
= (ULONGEST
) value_as_long (arg1
);
899 v2
= (ULONGEST
) value_as_long (arg2
);
901 /* Truncate values to the type length of the result. */
902 if (result_len
< sizeof (ULONGEST
))
904 v1
&= ((LONGEST
) 1 << HOST_CHAR_BIT
* result_len
) - 1;
905 v2
&= ((LONGEST
) 1 << HOST_CHAR_BIT
* result_len
) - 1;
929 error ("Cannot perform exponentiation: %s", safe_strerror (errno
));
937 /* Knuth 1.2.4, integer only. Note that unlike the C '%' op,
938 v1 mod 0 has a defined value, v1. */
946 /* Note floor(v1/v2) == v1/v2 for unsigned. */
959 case BINOP_BITWISE_AND
:
963 case BINOP_BITWISE_IOR
:
967 case BINOP_BITWISE_XOR
:
971 case BINOP_LOGICAL_AND
:
975 case BINOP_LOGICAL_OR
:
980 v
= v1
< v2
? v1
: v2
;
984 v
= v1
> v2
? v1
: v2
;
1000 error ("Invalid binary operation on numbers.");
1003 /* This is a kludge to get around the fact that we don't
1004 know how to determine the result type from the types of
1005 the operands. (I'm not really sure how much we feel the
1006 need to duplicate the exact rules of the current
1007 language. They can get really hairy. But not to do so
1008 makes it hard to document just what we *do* do). */
1010 /* Can't just call init_type because we wouldn't know what
1011 name to give the type. */
1012 val
= allocate_value
1013 (result_len
> TARGET_LONG_BIT
/ HOST_CHAR_BIT
1014 ? builtin_type_unsigned_long_long
1015 : builtin_type_unsigned_long
);
1016 store_unsigned_integer (VALUE_CONTENTS_RAW (val
),
1017 TYPE_LENGTH (value_type (val
)),
1022 LONGEST v1
, v2
, v
= 0;
1023 v1
= value_as_long (arg1
);
1024 v2
= value_as_long (arg2
);
1044 error ("Division by zero");
1050 error ("Cannot perform exponentiation: %s", safe_strerror (errno
));
1057 error ("Division by zero");
1061 /* Knuth 1.2.4, integer only. Note that unlike the C '%' op,
1062 X mod 0 has a defined value, X. */
1070 /* Compute floor. */
1071 if (TRUNCATION_TOWARDS_ZERO
&& (v
< 0) && ((v1
% v2
) != 0))
1087 case BINOP_BITWISE_AND
:
1091 case BINOP_BITWISE_IOR
:
1095 case BINOP_BITWISE_XOR
:
1099 case BINOP_LOGICAL_AND
:
1103 case BINOP_LOGICAL_OR
:
1108 v
= v1
< v2
? v1
: v2
;
1112 v
= v1
> v2
? v1
: v2
;
1124 error ("Invalid binary operation on numbers.");
1127 /* This is a kludge to get around the fact that we don't
1128 know how to determine the result type from the types of
1129 the operands. (I'm not really sure how much we feel the
1130 need to duplicate the exact rules of the current
1131 language. They can get really hairy. But not to do so
1132 makes it hard to document just what we *do* do). */
1134 /* Can't just call init_type because we wouldn't know what
1135 name to give the type. */
1136 val
= allocate_value
1137 (result_len
> TARGET_LONG_BIT
/ HOST_CHAR_BIT
1138 ? builtin_type_long_long
1139 : builtin_type_long
);
1140 store_signed_integer (VALUE_CONTENTS_RAW (val
),
1141 TYPE_LENGTH (value_type (val
)),
1149 /* Simulate the C operator ! -- return 1 if ARG1 contains zero. */
1152 value_logical_not (struct value
*arg1
)
1158 arg1
= coerce_number (arg1
);
1159 type1
= check_typedef (value_type (arg1
));
1161 if (TYPE_CODE (type1
) == TYPE_CODE_FLT
)
1162 return 0 == value_as_double (arg1
);
1164 len
= TYPE_LENGTH (type1
);
1165 p
= VALUE_CONTENTS (arg1
);
1176 /* Perform a comparison on two string values (whose content are not
1177 necessarily null terminated) based on their length */
1180 value_strcmp (struct value
*arg1
, struct value
*arg2
)
1182 int len1
= TYPE_LENGTH (value_type (arg1
));
1183 int len2
= TYPE_LENGTH (value_type (arg2
));
1184 char *s1
= VALUE_CONTENTS (arg1
);
1185 char *s2
= VALUE_CONTENTS (arg2
);
1186 int i
, len
= len1
< len2
? len1
: len2
;
1188 for (i
= 0; i
< len
; i
++)
1192 else if (s1
[i
] > s2
[i
])
1200 else if (len1
> len2
)
1206 /* Simulate the C operator == by returning a 1
1207 iff ARG1 and ARG2 have equal contents. */
1210 value_equal (struct value
*arg1
, struct value
*arg2
)
1214 struct type
*type1
, *type2
;
1215 enum type_code code1
;
1216 enum type_code code2
;
1217 int is_int1
, is_int2
;
1219 arg1
= coerce_array (arg1
);
1220 arg2
= coerce_array (arg2
);
1222 type1
= check_typedef (value_type (arg1
));
1223 type2
= check_typedef (value_type (arg2
));
1224 code1
= TYPE_CODE (type1
);
1225 code2
= TYPE_CODE (type2
);
1226 is_int1
= is_integral_type (type1
);
1227 is_int2
= is_integral_type (type2
);
1229 if (is_int1
&& is_int2
)
1230 return longest_to_int (value_as_long (value_binop (arg1
, arg2
,
1232 else if ((code1
== TYPE_CODE_FLT
|| is_int1
)
1233 && (code2
== TYPE_CODE_FLT
|| is_int2
))
1234 return value_as_double (arg1
) == value_as_double (arg2
);
1236 /* FIXME: Need to promote to either CORE_ADDR or LONGEST, whichever
1238 else if (code1
== TYPE_CODE_PTR
&& is_int2
)
1239 return value_as_address (arg1
) == (CORE_ADDR
) value_as_long (arg2
);
1240 else if (code2
== TYPE_CODE_PTR
&& is_int1
)
1241 return (CORE_ADDR
) value_as_long (arg1
) == value_as_address (arg2
);
1243 else if (code1
== code2
1244 && ((len
= (int) TYPE_LENGTH (type1
))
1245 == (int) TYPE_LENGTH (type2
)))
1247 p1
= VALUE_CONTENTS (arg1
);
1248 p2
= VALUE_CONTENTS (arg2
);
1256 else if (code1
== TYPE_CODE_STRING
&& code2
== TYPE_CODE_STRING
)
1258 return value_strcmp (arg1
, arg2
) == 0;
1262 error ("Invalid type combination in equality test.");
1263 return 0; /* For lint -- never reached */
1267 /* Simulate the C operator < by returning 1
1268 iff ARG1's contents are less than ARG2's. */
1271 value_less (struct value
*arg1
, struct value
*arg2
)
1273 enum type_code code1
;
1274 enum type_code code2
;
1275 struct type
*type1
, *type2
;
1276 int is_int1
, is_int2
;
1278 arg1
= coerce_array (arg1
);
1279 arg2
= coerce_array (arg2
);
1281 type1
= check_typedef (value_type (arg1
));
1282 type2
= check_typedef (value_type (arg2
));
1283 code1
= TYPE_CODE (type1
);
1284 code2
= TYPE_CODE (type2
);
1285 is_int1
= is_integral_type (type1
);
1286 is_int2
= is_integral_type (type2
);
1288 if (is_int1
&& is_int2
)
1289 return longest_to_int (value_as_long (value_binop (arg1
, arg2
,
1291 else if ((code1
== TYPE_CODE_FLT
|| is_int1
)
1292 && (code2
== TYPE_CODE_FLT
|| is_int2
))
1293 return value_as_double (arg1
) < value_as_double (arg2
);
1294 else if (code1
== TYPE_CODE_PTR
&& code2
== TYPE_CODE_PTR
)
1295 return value_as_address (arg1
) < value_as_address (arg2
);
1297 /* FIXME: Need to promote to either CORE_ADDR or LONGEST, whichever
1299 else if (code1
== TYPE_CODE_PTR
&& is_int2
)
1300 return value_as_address (arg1
) < (CORE_ADDR
) value_as_long (arg2
);
1301 else if (code2
== TYPE_CODE_PTR
&& is_int1
)
1302 return (CORE_ADDR
) value_as_long (arg1
) < value_as_address (arg2
);
1303 else if (code1
== TYPE_CODE_STRING
&& code2
== TYPE_CODE_STRING
)
1304 return value_strcmp (arg1
, arg2
) < 0;
1307 error ("Invalid type combination in ordering comparison.");
1312 /* The unary operators - and ~. Both free the argument ARG1. */
1315 value_neg (struct value
*arg1
)
1318 struct type
*result_type
= value_type (arg1
);
1320 arg1
= coerce_ref (arg1
);
1322 type
= check_typedef (value_type (arg1
));
1324 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
1325 return value_from_double (result_type
, -value_as_double (arg1
));
1326 else if (is_integral_type (type
))
1328 /* Perform integral promotion for ANSI C/C++. FIXME: What about
1329 FORTRAN and (the deleted) chill ? */
1330 if (TYPE_LENGTH (type
) < TYPE_LENGTH (builtin_type_int
))
1331 result_type
= builtin_type_int
;
1333 return value_from_longest (result_type
, -value_as_long (arg1
));
1337 error ("Argument to negate operation not a number.");
1338 return 0; /* For lint -- never reached */
1343 value_complement (struct value
*arg1
)
1346 struct type
*result_type
= value_type (arg1
);
1348 arg1
= coerce_ref (arg1
);
1350 type
= check_typedef (value_type (arg1
));
1352 if (!is_integral_type (type
))
1353 error ("Argument to complement operation not an integer or boolean.");
1355 /* Perform integral promotion for ANSI C/C++.
1356 FIXME: What about FORTRAN ? */
1357 if (TYPE_LENGTH (type
) < TYPE_LENGTH (builtin_type_int
))
1358 result_type
= builtin_type_int
;
1360 return value_from_longest (result_type
, ~value_as_long (arg1
));
1363 /* The INDEX'th bit of SET value whose value_type is TYPE,
1364 and whose VALUE_CONTENTS is valaddr.
1365 Return -1 if out of range, -2 other error. */
1368 value_bit_index (struct type
*type
, char *valaddr
, int index
)
1370 LONGEST low_bound
, high_bound
;
1373 struct type
*range
= TYPE_FIELD_TYPE (type
, 0);
1374 if (get_discrete_bounds (range
, &low_bound
, &high_bound
) < 0)
1376 if (index
< low_bound
|| index
> high_bound
)
1378 rel_index
= index
- low_bound
;
1379 word
= unpack_long (builtin_type_unsigned_char
,
1380 valaddr
+ (rel_index
/ TARGET_CHAR_BIT
));
1381 rel_index
%= TARGET_CHAR_BIT
;
1382 if (BITS_BIG_ENDIAN
)
1383 rel_index
= TARGET_CHAR_BIT
- 1 - rel_index
;
1384 return (word
>> rel_index
) & 1;
1388 value_in (struct value
*element
, struct value
*set
)
1391 struct type
*settype
= check_typedef (value_type (set
));
1392 struct type
*eltype
= check_typedef (value_type (element
));
1393 if (TYPE_CODE (eltype
) == TYPE_CODE_RANGE
)
1394 eltype
= TYPE_TARGET_TYPE (eltype
);
1395 if (TYPE_CODE (settype
) != TYPE_CODE_SET
)
1396 error ("Second argument of 'IN' has wrong type");
1397 if (TYPE_CODE (eltype
) != TYPE_CODE_INT
1398 && TYPE_CODE (eltype
) != TYPE_CODE_CHAR
1399 && TYPE_CODE (eltype
) != TYPE_CODE_ENUM
1400 && TYPE_CODE (eltype
) != TYPE_CODE_BOOL
)
1401 error ("First argument of 'IN' has wrong type");
1402 member
= value_bit_index (settype
, VALUE_CONTENTS (set
),
1403 value_as_long (element
));
1405 error ("First argument of 'IN' not in range");
1406 return value_from_longest (LA_BOOL_TYPE
, member
);
1410 _initialize_valarith (void)