1 /* Perform arithmetic and other operations on values, for GDB.
3 Copyright (C) 1986-2021 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include "expression.h"
27 #include "target-float.h"
29 #include "gdbsupport/byte-vector.h"
32 /* Define whether or not the C operator '/' truncates towards zero for
33 differently signed operands (truncation direction is undefined in C). */
35 #ifndef TRUNCATION_TOWARDS_ZERO
36 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
39 /* Given a pointer, return the size of its target.
40 If the pointer type is void *, then return 1.
41 If the target type is incomplete, then error out.
42 This isn't a general purpose function, but just a
43 helper for value_ptradd. */
46 find_size_for_pointer_math (struct type
*ptr_type
)
49 struct type
*ptr_target
;
51 gdb_assert (ptr_type
->code () == TYPE_CODE_PTR
);
52 ptr_target
= check_typedef (TYPE_TARGET_TYPE (ptr_type
));
54 sz
= type_length_units (ptr_target
);
57 if (ptr_type
->code () == TYPE_CODE_VOID
)
63 name
= ptr_target
->name ();
65 error (_("Cannot perform pointer math on incomplete types, "
66 "try casting to a known type, or void *."));
68 error (_("Cannot perform pointer math on incomplete type \"%s\", "
69 "try casting to a known type, or void *."), name
);
75 /* Given a pointer ARG1 and an integral value ARG2, return the
76 result of C-style pointer arithmetic ARG1 + ARG2. */
79 value_ptradd (struct value
*arg1
, LONGEST arg2
)
81 struct type
*valptrtype
;
85 arg1
= coerce_array (arg1
);
86 valptrtype
= check_typedef (value_type (arg1
));
87 sz
= find_size_for_pointer_math (valptrtype
);
89 result
= value_from_pointer (valptrtype
,
90 value_as_address (arg1
) + sz
* arg2
);
91 if (VALUE_LVAL (result
) != lval_internalvar
)
92 set_value_component_location (result
, arg1
);
96 /* Given two compatible pointer values ARG1 and ARG2, return the
97 result of C-style pointer arithmetic ARG1 - ARG2. */
100 value_ptrdiff (struct value
*arg1
, struct value
*arg2
)
102 struct type
*type1
, *type2
;
105 arg1
= coerce_array (arg1
);
106 arg2
= coerce_array (arg2
);
107 type1
= check_typedef (value_type (arg1
));
108 type2
= check_typedef (value_type (arg2
));
110 gdb_assert (type1
->code () == TYPE_CODE_PTR
);
111 gdb_assert (type2
->code () == TYPE_CODE_PTR
);
113 if (TYPE_LENGTH (check_typedef (TYPE_TARGET_TYPE (type1
)))
114 != TYPE_LENGTH (check_typedef (TYPE_TARGET_TYPE (type2
))))
115 error (_("First argument of `-' is a pointer and "
116 "second argument is neither\n"
117 "an integer nor a pointer of the same type."));
119 sz
= type_length_units (check_typedef (TYPE_TARGET_TYPE (type1
)));
122 warning (_("Type size unknown, assuming 1. "
123 "Try casting to a known type, or void *."));
127 return (value_as_long (arg1
) - value_as_long (arg2
)) / sz
;
130 /* Return the value of ARRAY[IDX].
132 ARRAY may be of type TYPE_CODE_ARRAY or TYPE_CODE_STRING. If the
133 current language supports C-style arrays, it may also be TYPE_CODE_PTR.
135 See comments in value_coerce_array() for rationale for reason for
136 doing lower bounds adjustment here rather than there.
137 FIXME: Perhaps we should validate that the index is valid and if
138 verbosity is set, warn about invalid indices (but still use them). */
141 value_subscript (struct value
*array
, LONGEST index
)
143 bool c_style
= current_language
->c_style_arrays_p ();
146 array
= coerce_ref (array
);
147 tarray
= check_typedef (value_type (array
));
149 if (tarray
->code () == TYPE_CODE_ARRAY
150 || tarray
->code () == TYPE_CODE_STRING
)
152 struct type
*range_type
= tarray
->index_type ();
153 gdb::optional
<LONGEST
> lowerbound
= get_discrete_low_bound (range_type
);
154 if (!lowerbound
.has_value ())
157 if (VALUE_LVAL (array
) != lval_memory
)
158 return value_subscripted_rvalue (array
, index
, *lowerbound
);
162 gdb::optional
<LONGEST
> upperbound
163 = get_discrete_high_bound (range_type
);
165 if (!upperbound
.has_value ())
168 if (index
>= *lowerbound
&& index
<= *upperbound
)
169 return value_subscripted_rvalue (array
, index
, *lowerbound
);
171 /* Emit warning unless we have an array of unknown size.
172 An array of unknown size has lowerbound 0 and upperbound -1. */
173 if (*upperbound
> -1)
174 warning (_("array or string index out of range"));
175 /* fall doing C stuff */
179 index
-= *lowerbound
;
180 array
= value_coerce_array (array
);
184 return value_ind (value_ptradd (array
, index
));
186 error (_("not an array or string"));
189 /* Return the value of EXPR[IDX], expr an aggregate rvalue
190 (eg, a vector register). This routine used to promote floats
191 to doubles, but no longer does. */
194 value_subscripted_rvalue (struct value
*array
, LONGEST index
, LONGEST lowerbound
)
196 struct type
*array_type
= check_typedef (value_type (array
));
197 struct type
*elt_type
= check_typedef (TYPE_TARGET_TYPE (array_type
));
198 LONGEST elt_size
= type_length_units (elt_type
);
200 /* Fetch the bit stride and convert it to a byte stride, assuming 8 bits
202 LONGEST stride
= array_type
->bit_stride ();
205 struct gdbarch
*arch
= get_type_arch (elt_type
);
206 int unit_size
= gdbarch_addressable_memory_unit_size (arch
);
207 elt_size
= stride
/ (unit_size
* 8);
210 LONGEST elt_offs
= elt_size
* (index
- lowerbound
);
211 bool array_upper_bound_undefined
212 = array_type
->bounds ()->high
.kind () == PROP_UNDEFINED
;
214 if (index
< lowerbound
215 || (!array_upper_bound_undefined
216 && elt_offs
>= type_length_units (array_type
))
217 || (VALUE_LVAL (array
) != lval_memory
&& array_upper_bound_undefined
))
219 if (type_not_associated (array_type
))
220 error (_("no such vector element (vector not associated)"));
221 else if (type_not_allocated (array_type
))
222 error (_("no such vector element (vector not allocated)"));
224 error (_("no such vector element"));
227 if (is_dynamic_type (elt_type
))
231 address
= value_address (array
) + elt_offs
;
232 elt_type
= resolve_dynamic_type (elt_type
, {}, address
);
235 return value_from_component (array
, elt_type
, elt_offs
);
239 /* Check to see if either argument is a structure, or a reference to
240 one. This is called so we know whether to go ahead with the normal
241 binop or look for a user defined function instead.
243 For now, we do not overload the `=' operator. */
246 binop_types_user_defined_p (enum exp_opcode op
,
247 struct type
*type1
, struct type
*type2
)
249 if (op
== BINOP_ASSIGN
|| op
== BINOP_CONCAT
)
252 type1
= check_typedef (type1
);
253 if (TYPE_IS_REFERENCE (type1
))
254 type1
= check_typedef (TYPE_TARGET_TYPE (type1
));
256 type2
= check_typedef (type2
);
257 if (TYPE_IS_REFERENCE (type2
))
258 type2
= check_typedef (TYPE_TARGET_TYPE (type2
));
260 return (type1
->code () == TYPE_CODE_STRUCT
261 || type2
->code () == TYPE_CODE_STRUCT
);
264 /* Check to see if either argument is a structure, or a reference to
265 one. This is called so we know whether to go ahead with the normal
266 binop or look for a user defined function instead.
268 For now, we do not overload the `=' operator. */
271 binop_user_defined_p (enum exp_opcode op
,
272 struct value
*arg1
, struct value
*arg2
)
274 return binop_types_user_defined_p (op
, value_type (arg1
), value_type (arg2
));
277 /* Check to see if argument is a structure. This is called so
278 we know whether to go ahead with the normal unop or look for a
279 user defined function instead.
281 For now, we do not overload the `&' operator. */
284 unop_user_defined_p (enum exp_opcode op
, struct value
*arg1
)
290 type1
= check_typedef (value_type (arg1
));
291 if (TYPE_IS_REFERENCE (type1
))
292 type1
= check_typedef (TYPE_TARGET_TYPE (type1
));
293 return type1
->code () == TYPE_CODE_STRUCT
;
296 /* Try to find an operator named OPERATOR which takes NARGS arguments
297 specified in ARGS. If the operator found is a static member operator
298 *STATIC_MEMFUNP will be set to 1, and otherwise 0.
299 The search if performed through find_overload_match which will handle
300 member operators, non member operators, operators imported implicitly or
301 explicitly, and perform correct overload resolution in all of the above
302 situations or combinations thereof. */
304 static struct value
*
305 value_user_defined_cpp_op (gdb::array_view
<value
*> args
, char *oper
,
306 int *static_memfuncp
, enum noside noside
)
309 struct symbol
*symp
= NULL
;
310 struct value
*valp
= NULL
;
312 find_overload_match (args
, oper
, BOTH
/* could be method */,
314 NULL
/* pass NULL symbol since symbol is unknown */,
315 &valp
, &symp
, static_memfuncp
, 0, noside
);
322 /* This is a non member function and does not
323 expect a reference as its first argument
324 rather the explicit structure. */
325 args
[0] = value_ind (args
[0]);
326 return value_of_variable (symp
, 0);
329 error (_("Could not find %s."), oper
);
332 /* Lookup user defined operator NAME. Return a value representing the
333 function, otherwise return NULL. */
335 static struct value
*
336 value_user_defined_op (struct value
**argp
, gdb::array_view
<value
*> args
,
337 char *name
, int *static_memfuncp
, enum noside noside
)
339 struct value
*result
= NULL
;
341 if (current_language
->la_language
== language_cplus
)
343 result
= value_user_defined_cpp_op (args
, name
, static_memfuncp
,
347 result
= value_struct_elt (argp
, args
.data (), name
, static_memfuncp
,
353 /* We know either arg1 or arg2 is a structure, so try to find the right
354 user defined function. Create an argument vector that calls
355 arg1.operator @ (arg1,arg2) and return that value (where '@' is any
356 binary operator which is legal for GNU C++).
358 OP is the operator, and if it is BINOP_ASSIGN_MODIFY, then OTHEROP
359 is the opcode saying how to modify it. Otherwise, OTHEROP is
363 value_x_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
,
364 enum exp_opcode otherop
, enum noside noside
)
370 arg1
= coerce_ref (arg1
);
371 arg2
= coerce_ref (arg2
);
373 /* now we know that what we have to do is construct our
374 arg vector and find the right function to call it with. */
376 if (check_typedef (value_type (arg1
))->code () != TYPE_CODE_STRUCT
)
377 error (_("Can't do that binary op on that type")); /* FIXME be explicit */
379 value
*argvec_storage
[3];
380 gdb::array_view
<value
*> argvec
= argvec_storage
;
382 argvec
[1] = value_addr (arg1
);
385 /* Make the right function name up. */
386 strcpy (tstr
, "operator__");
411 case BINOP_BITWISE_AND
:
414 case BINOP_BITWISE_IOR
:
417 case BINOP_BITWISE_XOR
:
420 case BINOP_LOGICAL_AND
:
423 case BINOP_LOGICAL_OR
:
435 case BINOP_ASSIGN_MODIFY
:
453 case BINOP_BITWISE_AND
:
456 case BINOP_BITWISE_IOR
:
459 case BINOP_BITWISE_XOR
:
462 case BINOP_MOD
: /* invalid */
464 error (_("Invalid binary operation specified."));
467 case BINOP_SUBSCRIPT
:
488 case BINOP_MOD
: /* invalid */
490 error (_("Invalid binary operation specified."));
493 argvec
[0] = value_user_defined_op (&arg1
, argvec
.slice (1), tstr
,
494 &static_memfuncp
, noside
);
500 argvec
[1] = argvec
[0];
501 argvec
= argvec
.slice (1);
503 if (value_type (argvec
[0])->code () == TYPE_CODE_XMETHOD
)
505 /* Static xmethods are not supported yet. */
506 gdb_assert (static_memfuncp
== 0);
507 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
509 struct type
*return_type
510 = result_type_of_xmethod (argvec
[0], argvec
.slice (1));
512 if (return_type
== NULL
)
513 error (_("Xmethod is missing return type."));
514 return value_zero (return_type
, VALUE_LVAL (arg1
));
516 return call_xmethod (argvec
[0], argvec
.slice (1));
518 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
520 struct type
*return_type
;
523 = TYPE_TARGET_TYPE (check_typedef (value_type (argvec
[0])));
524 return value_zero (return_type
, VALUE_LVAL (arg1
));
526 return call_function_by_hand (argvec
[0], NULL
,
527 argvec
.slice (1, 2 - static_memfuncp
));
529 throw_error (NOT_FOUND_ERROR
,
530 _("member function %s not found"), tstr
);
533 /* We know that arg1 is a structure, so try to find a unary user
534 defined operator that matches the operator in question.
535 Create an argument vector that calls arg1.operator @ (arg1)
536 and return that value (where '@' is (almost) any unary operator which
537 is legal for GNU C++). */
540 value_x_unop (struct value
*arg1
, enum exp_opcode op
, enum noside noside
)
542 struct gdbarch
*gdbarch
= get_type_arch (value_type (arg1
));
544 char tstr
[13], mangle_tstr
[13];
545 int static_memfuncp
, nargs
;
547 arg1
= coerce_ref (arg1
);
549 /* now we know that what we have to do is construct our
550 arg vector and find the right function to call it with. */
552 if (check_typedef (value_type (arg1
))->code () != TYPE_CODE_STRUCT
)
553 error (_("Can't do that unary op on that type")); /* FIXME be explicit */
555 value
*argvec_storage
[3];
556 gdb::array_view
<value
*> argvec
= argvec_storage
;
558 argvec
[1] = value_addr (arg1
);
563 /* Make the right function name up. */
564 strcpy (tstr
, "operator__");
566 strcpy (mangle_tstr
, "__");
569 case UNOP_PREINCREMENT
:
572 case UNOP_PREDECREMENT
:
575 case UNOP_POSTINCREMENT
:
577 argvec
[2] = value_from_longest (builtin_type (gdbarch
)->builtin_int
, 0);
580 case UNOP_POSTDECREMENT
:
582 argvec
[2] = value_from_longest (builtin_type (gdbarch
)->builtin_int
, 0);
585 case UNOP_LOGICAL_NOT
:
588 case UNOP_COMPLEMENT
:
604 error (_("Invalid unary operation specified."));
607 argvec
[0] = value_user_defined_op (&arg1
, argvec
.slice (1, nargs
), tstr
,
608 &static_memfuncp
, noside
);
614 argvec
[1] = argvec
[0];
615 argvec
= argvec
.slice (1);
617 if (value_type (argvec
[0])->code () == TYPE_CODE_XMETHOD
)
619 /* Static xmethods are not supported yet. */
620 gdb_assert (static_memfuncp
== 0);
621 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
623 struct type
*return_type
624 = result_type_of_xmethod (argvec
[0], argvec
[1]);
626 if (return_type
== NULL
)
627 error (_("Xmethod is missing return type."));
628 return value_zero (return_type
, VALUE_LVAL (arg1
));
630 return call_xmethod (argvec
[0], argvec
[1]);
632 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
634 struct type
*return_type
;
637 = TYPE_TARGET_TYPE (check_typedef (value_type (argvec
[0])));
638 return value_zero (return_type
, VALUE_LVAL (arg1
));
640 return call_function_by_hand (argvec
[0], NULL
,
641 argvec
.slice (1, nargs
));
643 throw_error (NOT_FOUND_ERROR
,
644 _("member function %s not found"), tstr
);
648 /* Concatenate two values with the following conditions:
650 (1) Both values must be either bitstring values or character string
651 values and the resulting value consists of the concatenation of
652 ARG1 followed by ARG2.
656 One value must be an integer value and the other value must be
657 either a bitstring value or character string value, which is
658 to be repeated by the number of times specified by the integer
662 (2) Boolean values are also allowed and are treated as bit string
665 (3) Character values are also allowed and are treated as character
666 string values of length 1. */
669 value_concat (struct value
*arg1
, struct value
*arg2
)
671 struct value
*inval1
;
672 struct value
*inval2
;
673 struct value
*outval
= NULL
;
674 int inval1len
, inval2len
;
677 struct type
*type1
= check_typedef (value_type (arg1
));
678 struct type
*type2
= check_typedef (value_type (arg2
));
679 struct type
*char_type
;
681 /* First figure out if we are dealing with two values to be concatenated
682 or a repeat count and a value to be repeated. INVAL1 is set to the
683 first of two concatenated values, or the repeat count. INVAL2 is set
684 to the second of the two concatenated values or the value to be
687 if (type2
->code () == TYPE_CODE_INT
)
689 struct type
*tmp
= type1
;
702 /* Now process the input values. */
704 if (type1
->code () == TYPE_CODE_INT
)
706 /* We have a repeat count. Validate the second value and then
707 construct a value repeated that many times. */
708 if (type2
->code () == TYPE_CODE_STRING
709 || type2
->code () == TYPE_CODE_CHAR
)
711 count
= longest_to_int (value_as_long (inval1
));
712 inval2len
= TYPE_LENGTH (type2
);
713 std::vector
<char> ptr (count
* inval2len
);
714 if (type2
->code () == TYPE_CODE_CHAR
)
718 inchar
= (char) unpack_long (type2
,
719 value_contents (inval2
));
720 for (idx
= 0; idx
< count
; idx
++)
727 char_type
= TYPE_TARGET_TYPE (type2
);
729 for (idx
= 0; idx
< count
; idx
++)
731 memcpy (&ptr
[idx
* inval2len
], value_contents (inval2
),
735 outval
= value_string (ptr
.data (), count
* inval2len
, char_type
);
737 else if (type2
->code () == TYPE_CODE_BOOL
)
739 error (_("unimplemented support for boolean repeats"));
743 error (_("can't repeat values of that type"));
746 else if (type1
->code () == TYPE_CODE_STRING
747 || type1
->code () == TYPE_CODE_CHAR
)
749 /* We have two character strings to concatenate. */
750 if (type2
->code () != TYPE_CODE_STRING
751 && type2
->code () != TYPE_CODE_CHAR
)
753 error (_("Strings can only be concatenated with other strings."));
755 inval1len
= TYPE_LENGTH (type1
);
756 inval2len
= TYPE_LENGTH (type2
);
757 std::vector
<char> ptr (inval1len
+ inval2len
);
758 if (type1
->code () == TYPE_CODE_CHAR
)
762 ptr
[0] = (char) unpack_long (type1
, value_contents (inval1
));
766 char_type
= TYPE_TARGET_TYPE (type1
);
768 memcpy (ptr
.data (), value_contents (inval1
), inval1len
);
770 if (type2
->code () == TYPE_CODE_CHAR
)
773 (char) unpack_long (type2
, value_contents (inval2
));
777 memcpy (&ptr
[inval1len
], value_contents (inval2
), inval2len
);
779 outval
= value_string (ptr
.data (), inval1len
+ inval2len
, char_type
);
781 else if (type1
->code () == TYPE_CODE_BOOL
)
783 /* We have two bitstrings to concatenate. */
784 if (type2
->code () != TYPE_CODE_BOOL
)
786 error (_("Booleans can only be concatenated "
787 "with other bitstrings or booleans."));
789 error (_("unimplemented support for boolean concatenation."));
793 /* We don't know how to concatenate these operands. */
794 error (_("illegal operands for concatenation."));
799 /* Integer exponentiation: V1**V2, where both arguments are
800 integers. Requires V1 != 0 if V2 < 0. Returns 1 for 0 ** 0. */
803 integer_pow (LONGEST v1
, LONGEST v2
)
808 error (_("Attempt to raise 0 to negative power."));
814 /* The Russian Peasant's Algorithm. */
830 /* Obtain argument values for binary operation, converting from
831 other types if one of them is not floating point. */
833 value_args_as_target_float (struct value
*arg1
, struct value
*arg2
,
834 gdb_byte
*x
, struct type
**eff_type_x
,
835 gdb_byte
*y
, struct type
**eff_type_y
)
837 struct type
*type1
, *type2
;
839 type1
= check_typedef (value_type (arg1
));
840 type2
= check_typedef (value_type (arg2
));
842 /* At least one of the arguments must be of floating-point type. */
843 gdb_assert (is_floating_type (type1
) || is_floating_type (type2
));
845 if (is_floating_type (type1
) && is_floating_type (type2
)
846 && type1
->code () != type2
->code ())
847 /* The DFP extension to the C language does not allow mixing of
848 * decimal float types with other float types in expressions
849 * (see WDTR 24732, page 12). */
850 error (_("Mixing decimal floating types with "
851 "other floating types is not allowed."));
853 /* Obtain value of arg1, converting from other types if necessary. */
855 if (is_floating_type (type1
))
858 memcpy (x
, value_contents (arg1
), TYPE_LENGTH (type1
));
860 else if (is_integral_type (type1
))
863 if (type1
->is_unsigned ())
864 target_float_from_ulongest (x
, *eff_type_x
, value_as_long (arg1
));
866 target_float_from_longest (x
, *eff_type_x
, value_as_long (arg1
));
869 error (_("Don't know how to convert from %s to %s."), type1
->name (),
872 /* Obtain value of arg2, converting from other types if necessary. */
874 if (is_floating_type (type2
))
877 memcpy (y
, value_contents (arg2
), TYPE_LENGTH (type2
));
879 else if (is_integral_type (type2
))
882 if (type2
->is_unsigned ())
883 target_float_from_ulongest (y
, *eff_type_y
, value_as_long (arg2
));
885 target_float_from_longest (y
, *eff_type_y
, value_as_long (arg2
));
888 error (_("Don't know how to convert from %s to %s."), type1
->name (),
892 /* Assuming at last one of ARG1 or ARG2 is a fixed point value,
893 perform the binary operation OP on these two operands, and return
894 the resulting value (also as a fixed point). */
896 static struct value
*
897 fixed_point_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
899 struct type
*type1
= check_typedef (value_type (arg1
));
900 struct type
*type2
= check_typedef (value_type (arg2
));
901 const struct language_defn
*language
= current_language
;
903 struct gdbarch
*gdbarch
= get_type_arch (type1
);
908 gdb_assert (is_fixed_point_type (type1
) || is_fixed_point_type (type2
));
909 if (op
== BINOP_MUL
|| op
== BINOP_DIV
)
911 v1
= value_to_gdb_mpq (arg1
);
912 v2
= value_to_gdb_mpq (arg2
);
914 /* The code below uses TYPE1 for the result type, so make sure
915 it is set properly. */
916 if (!is_fixed_point_type (type1
))
921 if (!is_fixed_point_type (type1
))
923 arg1
= value_cast (type2
, arg1
);
926 if (!is_fixed_point_type (type2
))
928 arg2
= value_cast (type1
, arg2
);
932 v1
.read_fixed_point (gdb::make_array_view (value_contents (arg1
),
933 TYPE_LENGTH (type1
)),
934 type_byte_order (type1
), type1
->is_unsigned (),
935 type1
->fixed_point_scaling_factor ());
936 v2
.read_fixed_point (gdb::make_array_view (value_contents (arg2
),
937 TYPE_LENGTH (type2
)),
938 type_byte_order (type2
), type2
->is_unsigned (),
939 type2
->fixed_point_scaling_factor ());
942 auto fixed_point_to_value
= [type1
] (const gdb_mpq
&fp
)
944 value
*fp_val
= allocate_value (type1
);
947 (gdb::make_array_view (value_contents_raw (fp_val
),
948 TYPE_LENGTH (type1
)),
949 type_byte_order (type1
),
950 type1
->is_unsigned (),
951 type1
->fixed_point_scaling_factor ());
959 mpq_add (res
.val
, v1
.val
, v2
.val
);
960 val
= fixed_point_to_value (res
);
964 mpq_sub (res
.val
, v1
.val
, v2
.val
);
965 val
= fixed_point_to_value (res
);
969 val
= fixed_point_to_value (mpq_cmp (v1
.val
, v2
.val
) < 0 ? v1
: v2
);
973 val
= fixed_point_to_value (mpq_cmp (v1
.val
, v2
.val
) > 0 ? v1
: v2
);
977 mpq_mul (res
.val
, v1
.val
, v2
.val
);
978 val
= fixed_point_to_value (res
);
982 if (mpq_sgn (v2
.val
) == 0)
983 error (_("Division by zero"));
984 mpq_div (res
.val
, v1
.val
, v2
.val
);
985 val
= fixed_point_to_value (res
);
989 val
= value_from_ulongest (language_bool_type (language
, gdbarch
),
990 mpq_cmp (v1
.val
, v2
.val
) == 0 ? 1 : 0);
994 val
= value_from_ulongest (language_bool_type (language
, gdbarch
),
995 mpq_cmp (v1
.val
, v2
.val
) < 0 ? 1 : 0);
999 error (_("Integer-only operation on fixed point number."));
1005 /* A helper function that finds the type to use for a binary operation
1006 involving TYPE1 and TYPE2. */
1008 static struct type
*
1009 promotion_type (struct type
*type1
, struct type
*type2
)
1011 struct type
*result_type
;
1013 if (is_floating_type (type1
) || is_floating_type (type2
))
1015 /* If only one type is floating-point, use its type.
1016 Otherwise use the bigger type. */
1017 if (!is_floating_type (type1
))
1018 result_type
= type2
;
1019 else if (!is_floating_type (type2
))
1020 result_type
= type1
;
1021 else if (TYPE_LENGTH (type2
) > TYPE_LENGTH (type1
))
1022 result_type
= type2
;
1024 result_type
= type1
;
1028 /* Integer types. */
1029 if (TYPE_LENGTH (type1
) > TYPE_LENGTH (type2
))
1030 result_type
= type1
;
1031 else if (TYPE_LENGTH (type2
) > TYPE_LENGTH (type1
))
1032 result_type
= type2
;
1033 else if (type1
->is_unsigned ())
1034 result_type
= type1
;
1035 else if (type2
->is_unsigned ())
1036 result_type
= type2
;
1038 result_type
= type1
;
1044 static struct value
*scalar_binop (struct value
*arg1
, struct value
*arg2
,
1045 enum exp_opcode op
);
1047 /* Perform a binary operation on complex operands. */
1049 static struct value
*
1050 complex_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
1052 struct type
*arg1_type
= check_typedef (value_type (arg1
));
1053 struct type
*arg2_type
= check_typedef (value_type (arg2
));
1055 struct value
*arg1_real
, *arg1_imag
, *arg2_real
, *arg2_imag
;
1056 if (arg1_type
->code () == TYPE_CODE_COMPLEX
)
1058 arg1_real
= value_real_part (arg1
);
1059 arg1_imag
= value_imaginary_part (arg1
);
1064 arg1_imag
= value_zero (arg1_type
, not_lval
);
1066 if (arg2_type
->code () == TYPE_CODE_COMPLEX
)
1068 arg2_real
= value_real_part (arg2
);
1069 arg2_imag
= value_imaginary_part (arg2
);
1074 arg2_imag
= value_zero (arg2_type
, not_lval
);
1077 struct type
*comp_type
= promotion_type (value_type (arg1_real
),
1078 value_type (arg2_real
));
1079 arg1_real
= value_cast (comp_type
, arg1_real
);
1080 arg1_imag
= value_cast (comp_type
, arg1_imag
);
1081 arg2_real
= value_cast (comp_type
, arg2_real
);
1082 arg2_imag
= value_cast (comp_type
, arg2_imag
);
1084 struct type
*result_type
= init_complex_type (nullptr, comp_type
);
1086 struct value
*result_real
, *result_imag
;
1091 result_real
= scalar_binop (arg1_real
, arg2_real
, op
);
1092 result_imag
= scalar_binop (arg1_imag
, arg2_imag
, op
);
1097 struct value
*x1
= scalar_binop (arg1_real
, arg2_real
, op
);
1098 struct value
*x2
= scalar_binop (arg1_imag
, arg2_imag
, op
);
1099 result_real
= scalar_binop (x1
, x2
, BINOP_SUB
);
1101 x1
= scalar_binop (arg1_real
, arg2_imag
, op
);
1102 x2
= scalar_binop (arg1_imag
, arg2_real
, op
);
1103 result_imag
= scalar_binop (x1
, x2
, BINOP_ADD
);
1109 if (arg2_type
->code () == TYPE_CODE_COMPLEX
)
1111 struct value
*conjugate
= value_complement (arg2
);
1112 /* We have to reconstruct ARG1, in case the type was
1114 arg1
= value_literal_complex (arg1_real
, arg1_imag
, result_type
);
1116 struct value
*numerator
= scalar_binop (arg1
, conjugate
,
1118 arg1_real
= value_real_part (numerator
);
1119 arg1_imag
= value_imaginary_part (numerator
);
1121 struct value
*x1
= scalar_binop (arg2_real
, arg2_real
, BINOP_MUL
);
1122 struct value
*x2
= scalar_binop (arg2_imag
, arg2_imag
, BINOP_MUL
);
1123 arg2_real
= scalar_binop (x1
, x2
, BINOP_ADD
);
1126 result_real
= scalar_binop (arg1_real
, arg2_real
, op
);
1127 result_imag
= scalar_binop (arg1_imag
, arg2_real
, op
);
1132 case BINOP_NOTEQUAL
:
1134 struct value
*x1
= scalar_binop (arg1_real
, arg2_real
, op
);
1135 struct value
*x2
= scalar_binop (arg1_imag
, arg2_imag
, op
);
1137 LONGEST v1
= value_as_long (x1
);
1138 LONGEST v2
= value_as_long (x2
);
1140 if (op
== BINOP_EQUAL
)
1145 return value_from_longest (value_type (x1
), v1
);
1150 error (_("Invalid binary operation on numbers."));
1153 return value_literal_complex (result_real
, result_imag
, result_type
);
1156 /* Perform a binary operation on two operands which have reasonable
1157 representations as integers or floats. This includes booleans,
1158 characters, integers, or floats.
1159 Does not support addition and subtraction on pointers;
1160 use value_ptradd, value_ptrsub or value_ptrdiff for those operations. */
1162 static struct value
*
1163 scalar_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
1166 struct type
*type1
, *type2
, *result_type
;
1168 arg1
= coerce_ref (arg1
);
1169 arg2
= coerce_ref (arg2
);
1171 type1
= check_typedef (value_type (arg1
));
1172 type2
= check_typedef (value_type (arg2
));
1174 if (type1
->code () == TYPE_CODE_COMPLEX
1175 || type2
->code () == TYPE_CODE_COMPLEX
)
1176 return complex_binop (arg1
, arg2
, op
);
1178 if ((!is_floating_value (arg1
)
1179 && !is_integral_type (type1
)
1180 && !is_fixed_point_type (type1
))
1181 || (!is_floating_value (arg2
)
1182 && !is_integral_type (type2
)
1183 && !is_fixed_point_type (type2
)))
1184 error (_("Argument to arithmetic operation not a number or boolean."));
1186 if (is_fixed_point_type (type1
) || is_fixed_point_type (type2
))
1187 return fixed_point_binop (arg1
, arg2
, op
);
1189 if (is_floating_type (type1
) || is_floating_type (type2
))
1191 result_type
= promotion_type (type1
, type2
);
1192 val
= allocate_value (result_type
);
1194 struct type
*eff_type_v1
, *eff_type_v2
;
1195 gdb::byte_vector v1
, v2
;
1196 v1
.resize (TYPE_LENGTH (result_type
));
1197 v2
.resize (TYPE_LENGTH (result_type
));
1199 value_args_as_target_float (arg1
, arg2
,
1200 v1
.data (), &eff_type_v1
,
1201 v2
.data (), &eff_type_v2
);
1202 target_float_binop (op
, v1
.data (), eff_type_v1
,
1203 v2
.data (), eff_type_v2
,
1204 value_contents_raw (val
), result_type
);
1206 else if (type1
->code () == TYPE_CODE_BOOL
1207 || type2
->code () == TYPE_CODE_BOOL
)
1209 LONGEST v1
, v2
, v
= 0;
1211 v1
= value_as_long (arg1
);
1212 v2
= value_as_long (arg2
);
1216 case BINOP_BITWISE_AND
:
1220 case BINOP_BITWISE_IOR
:
1224 case BINOP_BITWISE_XOR
:
1232 case BINOP_NOTEQUAL
:
1237 error (_("Invalid operation on booleans."));
1240 result_type
= type1
;
1242 val
= allocate_value (result_type
);
1243 store_signed_integer (value_contents_raw (val
),
1244 TYPE_LENGTH (result_type
),
1245 type_byte_order (result_type
),
1249 /* Integral operations here. */
1251 /* Determine type length of the result, and if the operation should
1252 be done unsigned. For exponentiation and shift operators,
1253 use the length and type of the left operand. Otherwise,
1254 use the signedness of the operand with the greater length.
1255 If both operands are of equal length, use unsigned operation
1256 if one of the operands is unsigned. */
1257 if (op
== BINOP_RSH
|| op
== BINOP_LSH
|| op
== BINOP_EXP
)
1258 result_type
= type1
;
1260 result_type
= promotion_type (type1
, type2
);
1262 if (result_type
->is_unsigned ())
1264 LONGEST v2_signed
= value_as_long (arg2
);
1265 ULONGEST v1
, v2
, v
= 0;
1267 v1
= (ULONGEST
) value_as_long (arg1
);
1268 v2
= (ULONGEST
) v2_signed
;
1289 error (_("Division by zero"));
1293 v
= uinteger_pow (v1
, v2_signed
);
1300 error (_("Division by zero"));
1304 /* Knuth 1.2.4, integer only. Note that unlike the C '%' op,
1305 v1 mod 0 has a defined value, v1. */
1313 /* Note floor(v1/v2) == v1/v2 for unsigned. */
1326 case BINOP_BITWISE_AND
:
1330 case BINOP_BITWISE_IOR
:
1334 case BINOP_BITWISE_XOR
:
1338 case BINOP_LOGICAL_AND
:
1342 case BINOP_LOGICAL_OR
:
1347 v
= v1
< v2
? v1
: v2
;
1351 v
= v1
> v2
? v1
: v2
;
1358 case BINOP_NOTEQUAL
:
1379 error (_("Invalid binary operation on numbers."));
1382 val
= allocate_value (result_type
);
1383 store_unsigned_integer (value_contents_raw (val
),
1384 TYPE_LENGTH (value_type (val
)),
1385 type_byte_order (result_type
),
1390 LONGEST v1
, v2
, v
= 0;
1392 v1
= value_as_long (arg1
);
1393 v2
= value_as_long (arg2
);
1414 error (_("Division by zero"));
1418 v
= integer_pow (v1
, v2
);
1425 error (_("Division by zero"));
1429 /* Knuth 1.2.4, integer only. Note that unlike the C '%' op,
1430 X mod 0 has a defined value, X. */
1438 /* Compute floor. */
1439 if (TRUNCATION_TOWARDS_ZERO
&& (v
< 0) && ((v1
% v2
) != 0))
1455 case BINOP_BITWISE_AND
:
1459 case BINOP_BITWISE_IOR
:
1463 case BINOP_BITWISE_XOR
:
1467 case BINOP_LOGICAL_AND
:
1471 case BINOP_LOGICAL_OR
:
1476 v
= v1
< v2
? v1
: v2
;
1480 v
= v1
> v2
? v1
: v2
;
1487 case BINOP_NOTEQUAL
:
1508 error (_("Invalid binary operation on numbers."));
1511 val
= allocate_value (result_type
);
1512 store_signed_integer (value_contents_raw (val
),
1513 TYPE_LENGTH (value_type (val
)),
1514 type_byte_order (result_type
),
1522 /* Widen a scalar value SCALAR_VALUE to vector type VECTOR_TYPE by
1523 replicating SCALAR_VALUE for each element of the vector. Only scalar
1524 types that can be cast to the type of one element of the vector are
1525 acceptable. The newly created vector value is returned upon success,
1526 otherwise an error is thrown. */
1529 value_vector_widen (struct value
*scalar_value
, struct type
*vector_type
)
1531 /* Widen the scalar to a vector. */
1532 struct type
*eltype
, *scalar_type
;
1533 struct value
*val
, *elval
;
1534 LONGEST low_bound
, high_bound
;
1537 vector_type
= check_typedef (vector_type
);
1539 gdb_assert (vector_type
->code () == TYPE_CODE_ARRAY
1540 && vector_type
->is_vector ());
1542 if (!get_array_bounds (vector_type
, &low_bound
, &high_bound
))
1543 error (_("Could not determine the vector bounds"));
1545 eltype
= check_typedef (TYPE_TARGET_TYPE (vector_type
));
1546 elval
= value_cast (eltype
, scalar_value
);
1548 scalar_type
= check_typedef (value_type (scalar_value
));
1550 /* If we reduced the length of the scalar then check we didn't loose any
1552 if (TYPE_LENGTH (eltype
) < TYPE_LENGTH (scalar_type
)
1553 && !value_equal (elval
, scalar_value
))
1554 error (_("conversion of scalar to vector involves truncation"));
1556 val
= allocate_value (vector_type
);
1557 for (i
= 0; i
< high_bound
- low_bound
+ 1; i
++)
1558 /* Duplicate the contents of elval into the destination vector. */
1559 memcpy (value_contents_writeable (val
) + (i
* TYPE_LENGTH (eltype
)),
1560 value_contents_all (elval
), TYPE_LENGTH (eltype
));
1565 /* Performs a binary operation on two vector operands by calling scalar_binop
1566 for each pair of vector components. */
1568 static struct value
*
1569 vector_binop (struct value
*val1
, struct value
*val2
, enum exp_opcode op
)
1571 struct value
*val
, *tmp
, *mark
;
1572 struct type
*type1
, *type2
, *eltype1
, *eltype2
;
1573 int t1_is_vec
, t2_is_vec
, elsize
, i
;
1574 LONGEST low_bound1
, high_bound1
, low_bound2
, high_bound2
;
1576 type1
= check_typedef (value_type (val1
));
1577 type2
= check_typedef (value_type (val2
));
1579 t1_is_vec
= (type1
->code () == TYPE_CODE_ARRAY
1580 && type1
->is_vector ()) ? 1 : 0;
1581 t2_is_vec
= (type2
->code () == TYPE_CODE_ARRAY
1582 && type2
->is_vector ()) ? 1 : 0;
1584 if (!t1_is_vec
|| !t2_is_vec
)
1585 error (_("Vector operations are only supported among vectors"));
1587 if (!get_array_bounds (type1
, &low_bound1
, &high_bound1
)
1588 || !get_array_bounds (type2
, &low_bound2
, &high_bound2
))
1589 error (_("Could not determine the vector bounds"));
1591 eltype1
= check_typedef (TYPE_TARGET_TYPE (type1
));
1592 eltype2
= check_typedef (TYPE_TARGET_TYPE (type2
));
1593 elsize
= TYPE_LENGTH (eltype1
);
1595 if (eltype1
->code () != eltype2
->code ()
1596 || elsize
!= TYPE_LENGTH (eltype2
)
1597 || eltype1
->is_unsigned () != eltype2
->is_unsigned ()
1598 || low_bound1
!= low_bound2
|| high_bound1
!= high_bound2
)
1599 error (_("Cannot perform operation on vectors with different types"));
1601 val
= allocate_value (type1
);
1602 mark
= value_mark ();
1603 for (i
= 0; i
< high_bound1
- low_bound1
+ 1; i
++)
1605 tmp
= value_binop (value_subscript (val1
, i
),
1606 value_subscript (val2
, i
), op
);
1607 memcpy (value_contents_writeable (val
) + i
* elsize
,
1608 value_contents_all (tmp
),
1611 value_free_to_mark (mark
);
1616 /* Perform a binary operation on two operands. */
1619 value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
1622 struct type
*type1
= check_typedef (value_type (arg1
));
1623 struct type
*type2
= check_typedef (value_type (arg2
));
1624 int t1_is_vec
= (type1
->code () == TYPE_CODE_ARRAY
1625 && type1
->is_vector ());
1626 int t2_is_vec
= (type2
->code () == TYPE_CODE_ARRAY
1627 && type2
->is_vector ());
1629 if (!t1_is_vec
&& !t2_is_vec
)
1630 val
= scalar_binop (arg1
, arg2
, op
);
1631 else if (t1_is_vec
&& t2_is_vec
)
1632 val
= vector_binop (arg1
, arg2
, op
);
1635 /* Widen the scalar operand to a vector. */
1636 struct value
**v
= t1_is_vec
? &arg2
: &arg1
;
1637 struct type
*t
= t1_is_vec
? type2
: type1
;
1639 if (t
->code () != TYPE_CODE_FLT
1640 && t
->code () != TYPE_CODE_DECFLOAT
1641 && !is_integral_type (t
))
1642 error (_("Argument to operation not a number or boolean."));
1644 /* Replicate the scalar value to make a vector value. */
1645 *v
= value_vector_widen (*v
, t1_is_vec
? type1
: type2
);
1647 val
= vector_binop (arg1
, arg2
, op
);
1653 /* Simulate the C operator ! -- return 1 if ARG1 contains zero. */
1656 value_logical_not (struct value
*arg1
)
1662 arg1
= coerce_array (arg1
);
1663 type1
= check_typedef (value_type (arg1
));
1665 if (is_floating_value (arg1
))
1666 return target_float_is_zero (value_contents (arg1
), type1
);
1668 len
= TYPE_LENGTH (type1
);
1669 p
= value_contents (arg1
);
1680 /* Perform a comparison on two string values (whose content are not
1681 necessarily null terminated) based on their length. */
1684 value_strcmp (struct value
*arg1
, struct value
*arg2
)
1686 int len1
= TYPE_LENGTH (value_type (arg1
));
1687 int len2
= TYPE_LENGTH (value_type (arg2
));
1688 const gdb_byte
*s1
= value_contents (arg1
);
1689 const gdb_byte
*s2
= value_contents (arg2
);
1690 int i
, len
= len1
< len2
? len1
: len2
;
1692 for (i
= 0; i
< len
; i
++)
1696 else if (s1
[i
] > s2
[i
])
1704 else if (len1
> len2
)
1710 /* Simulate the C operator == by returning a 1
1711 iff ARG1 and ARG2 have equal contents. */
1714 value_equal (struct value
*arg1
, struct value
*arg2
)
1719 struct type
*type1
, *type2
;
1720 enum type_code code1
;
1721 enum type_code code2
;
1722 int is_int1
, is_int2
;
1724 arg1
= coerce_array (arg1
);
1725 arg2
= coerce_array (arg2
);
1727 type1
= check_typedef (value_type (arg1
));
1728 type2
= check_typedef (value_type (arg2
));
1729 code1
= type1
->code ();
1730 code2
= type2
->code ();
1731 is_int1
= is_integral_type (type1
);
1732 is_int2
= is_integral_type (type2
);
1734 if (is_int1
&& is_int2
)
1735 return longest_to_int (value_as_long (value_binop (arg1
, arg2
,
1737 else if ((is_floating_value (arg1
) || is_int1
)
1738 && (is_floating_value (arg2
) || is_int2
))
1740 struct type
*eff_type_v1
, *eff_type_v2
;
1741 gdb::byte_vector v1
, v2
;
1742 v1
.resize (std::max (TYPE_LENGTH (type1
), TYPE_LENGTH (type2
)));
1743 v2
.resize (std::max (TYPE_LENGTH (type1
), TYPE_LENGTH (type2
)));
1745 value_args_as_target_float (arg1
, arg2
,
1746 v1
.data (), &eff_type_v1
,
1747 v2
.data (), &eff_type_v2
);
1749 return target_float_compare (v1
.data (), eff_type_v1
,
1750 v2
.data (), eff_type_v2
) == 0;
1753 /* FIXME: Need to promote to either CORE_ADDR or LONGEST, whichever
1755 else if (code1
== TYPE_CODE_PTR
&& is_int2
)
1756 return value_as_address (arg1
) == (CORE_ADDR
) value_as_long (arg2
);
1757 else if (code2
== TYPE_CODE_PTR
&& is_int1
)
1758 return (CORE_ADDR
) value_as_long (arg1
) == value_as_address (arg2
);
1760 else if (code1
== code2
1761 && ((len
= (int) TYPE_LENGTH (type1
))
1762 == (int) TYPE_LENGTH (type2
)))
1764 p1
= value_contents (arg1
);
1765 p2
= value_contents (arg2
);
1773 else if (code1
== TYPE_CODE_STRING
&& code2
== TYPE_CODE_STRING
)
1775 return value_strcmp (arg1
, arg2
) == 0;
1778 error (_("Invalid type combination in equality test."));
1781 /* Compare values based on their raw contents. Useful for arrays since
1782 value_equal coerces them to pointers, thus comparing just the address
1783 of the array instead of its contents. */
1786 value_equal_contents (struct value
*arg1
, struct value
*arg2
)
1788 struct type
*type1
, *type2
;
1790 type1
= check_typedef (value_type (arg1
));
1791 type2
= check_typedef (value_type (arg2
));
1793 return (type1
->code () == type2
->code ()
1794 && TYPE_LENGTH (type1
) == TYPE_LENGTH (type2
)
1795 && memcmp (value_contents (arg1
), value_contents (arg2
),
1796 TYPE_LENGTH (type1
)) == 0);
1799 /* Simulate the C operator < by returning 1
1800 iff ARG1's contents are less than ARG2's. */
1803 value_less (struct value
*arg1
, struct value
*arg2
)
1805 enum type_code code1
;
1806 enum type_code code2
;
1807 struct type
*type1
, *type2
;
1808 int is_int1
, is_int2
;
1810 arg1
= coerce_array (arg1
);
1811 arg2
= coerce_array (arg2
);
1813 type1
= check_typedef (value_type (arg1
));
1814 type2
= check_typedef (value_type (arg2
));
1815 code1
= type1
->code ();
1816 code2
= type2
->code ();
1817 is_int1
= is_integral_type (type1
);
1818 is_int2
= is_integral_type (type2
);
1820 if ((is_int1
&& is_int2
)
1821 || (is_fixed_point_type (type1
) && is_fixed_point_type (type2
)))
1822 return longest_to_int (value_as_long (value_binop (arg1
, arg2
,
1824 else if ((is_floating_value (arg1
) || is_int1
)
1825 && (is_floating_value (arg2
) || is_int2
))
1827 struct type
*eff_type_v1
, *eff_type_v2
;
1828 gdb::byte_vector v1
, v2
;
1829 v1
.resize (std::max (TYPE_LENGTH (type1
), TYPE_LENGTH (type2
)));
1830 v2
.resize (std::max (TYPE_LENGTH (type1
), TYPE_LENGTH (type2
)));
1832 value_args_as_target_float (arg1
, arg2
,
1833 v1
.data (), &eff_type_v1
,
1834 v2
.data (), &eff_type_v2
);
1836 return target_float_compare (v1
.data (), eff_type_v1
,
1837 v2
.data (), eff_type_v2
) == -1;
1839 else if (code1
== TYPE_CODE_PTR
&& code2
== TYPE_CODE_PTR
)
1840 return value_as_address (arg1
) < value_as_address (arg2
);
1842 /* FIXME: Need to promote to either CORE_ADDR or LONGEST, whichever
1844 else if (code1
== TYPE_CODE_PTR
&& is_int2
)
1845 return value_as_address (arg1
) < (CORE_ADDR
) value_as_long (arg2
);
1846 else if (code2
== TYPE_CODE_PTR
&& is_int1
)
1847 return (CORE_ADDR
) value_as_long (arg1
) < value_as_address (arg2
);
1848 else if (code1
== TYPE_CODE_STRING
&& code2
== TYPE_CODE_STRING
)
1849 return value_strcmp (arg1
, arg2
) < 0;
1852 error (_("Invalid type combination in ordering comparison."));
1857 /* The unary operators +, - and ~. They free the argument ARG1. */
1860 value_pos (struct value
*arg1
)
1864 arg1
= coerce_ref (arg1
);
1865 type
= check_typedef (value_type (arg1
));
1867 if (is_integral_type (type
) || is_floating_value (arg1
)
1868 || (type
->code () == TYPE_CODE_ARRAY
&& type
->is_vector ())
1869 || type
->code () == TYPE_CODE_COMPLEX
)
1870 return value_from_contents (type
, value_contents (arg1
));
1872 error (_("Argument to positive operation not a number."));
1876 value_neg (struct value
*arg1
)
1880 arg1
= coerce_ref (arg1
);
1881 type
= check_typedef (value_type (arg1
));
1883 if (is_integral_type (type
) || is_floating_type (type
))
1884 return value_binop (value_from_longest (type
, 0), arg1
, BINOP_SUB
);
1885 else if (is_fixed_point_type (type
))
1886 return value_binop (value_zero (type
, not_lval
), arg1
, BINOP_SUB
);
1887 else if (type
->code () == TYPE_CODE_ARRAY
&& type
->is_vector ())
1889 struct value
*tmp
, *val
= allocate_value (type
);
1890 struct type
*eltype
= check_typedef (TYPE_TARGET_TYPE (type
));
1892 LONGEST low_bound
, high_bound
;
1894 if (!get_array_bounds (type
, &low_bound
, &high_bound
))
1895 error (_("Could not determine the vector bounds"));
1897 for (i
= 0; i
< high_bound
- low_bound
+ 1; i
++)
1899 tmp
= value_neg (value_subscript (arg1
, i
));
1900 memcpy (value_contents_writeable (val
) + i
* TYPE_LENGTH (eltype
),
1901 value_contents_all (tmp
), TYPE_LENGTH (eltype
));
1905 else if (type
->code () == TYPE_CODE_COMPLEX
)
1907 struct value
*real
= value_real_part (arg1
);
1908 struct value
*imag
= value_imaginary_part (arg1
);
1910 real
= value_neg (real
);
1911 imag
= value_neg (imag
);
1912 return value_literal_complex (real
, imag
, type
);
1915 error (_("Argument to negate operation not a number."));
1919 value_complement (struct value
*arg1
)
1924 arg1
= coerce_ref (arg1
);
1925 type
= check_typedef (value_type (arg1
));
1927 if (is_integral_type (type
))
1928 val
= value_from_longest (type
, ~value_as_long (arg1
));
1929 else if (type
->code () == TYPE_CODE_ARRAY
&& type
->is_vector ())
1932 struct type
*eltype
= check_typedef (TYPE_TARGET_TYPE (type
));
1934 LONGEST low_bound
, high_bound
;
1936 if (!get_array_bounds (type
, &low_bound
, &high_bound
))
1937 error (_("Could not determine the vector bounds"));
1939 val
= allocate_value (type
);
1940 for (i
= 0; i
< high_bound
- low_bound
+ 1; i
++)
1942 tmp
= value_complement (value_subscript (arg1
, i
));
1943 memcpy (value_contents_writeable (val
) + i
* TYPE_LENGTH (eltype
),
1944 value_contents_all (tmp
), TYPE_LENGTH (eltype
));
1947 else if (type
->code () == TYPE_CODE_COMPLEX
)
1949 /* GCC has an extension that treats ~complex as the complex
1951 struct value
*real
= value_real_part (arg1
);
1952 struct value
*imag
= value_imaginary_part (arg1
);
1954 imag
= value_neg (imag
);
1955 return value_literal_complex (real
, imag
, type
);
1958 error (_("Argument to complement operation not an integer, boolean."));
1963 /* The INDEX'th bit of SET value whose value_type is TYPE,
1964 and whose value_contents is valaddr.
1965 Return -1 if out of range, -2 other error. */
1968 value_bit_index (struct type
*type
, const gdb_byte
*valaddr
, int index
)
1970 struct gdbarch
*gdbarch
= get_type_arch (type
);
1971 LONGEST low_bound
, high_bound
;
1974 struct type
*range
= type
->index_type ();
1976 if (!get_discrete_bounds (range
, &low_bound
, &high_bound
))
1978 if (index
< low_bound
|| index
> high_bound
)
1980 rel_index
= index
- low_bound
;
1981 word
= extract_unsigned_integer (valaddr
+ (rel_index
/ TARGET_CHAR_BIT
), 1,
1982 type_byte_order (type
));
1983 rel_index
%= TARGET_CHAR_BIT
;
1984 if (gdbarch_byte_order (gdbarch
) == BFD_ENDIAN_BIG
)
1985 rel_index
= TARGET_CHAR_BIT
- 1 - rel_index
;
1986 return (word
>> rel_index
) & 1;
1990 value_in (struct value
*element
, struct value
*set
)
1993 struct type
*settype
= check_typedef (value_type (set
));
1994 struct type
*eltype
= check_typedef (value_type (element
));
1996 if (eltype
->code () == TYPE_CODE_RANGE
)
1997 eltype
= TYPE_TARGET_TYPE (eltype
);
1998 if (settype
->code () != TYPE_CODE_SET
)
1999 error (_("Second argument of 'IN' has wrong type"));
2000 if (eltype
->code () != TYPE_CODE_INT
2001 && eltype
->code () != TYPE_CODE_CHAR
2002 && eltype
->code () != TYPE_CODE_ENUM
2003 && eltype
->code () != TYPE_CODE_BOOL
)
2004 error (_("First argument of 'IN' has wrong type"));
2005 member
= value_bit_index (settype
, value_contents (set
),
2006 value_as_long (element
));
2008 error (_("First argument of 'IN' not in range"));