1 /* Perform arithmetic and other operations on values, for GDB.
3 Copyright (C) 1986-2022 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 /* Forward declarations. */
33 static struct value
*value_subscripted_rvalue (struct value
*array
,
37 /* Define whether or not the C operator '/' truncates towards zero for
38 differently signed operands (truncation direction is undefined in C). */
40 #ifndef TRUNCATION_TOWARDS_ZERO
41 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
44 /* Given a pointer, return the size of its target.
45 If the pointer type is void *, then return 1.
46 If the target type is incomplete, then error out.
47 This isn't a general purpose function, but just a
48 helper for value_ptradd. */
51 find_size_for_pointer_math (struct type
*ptr_type
)
54 struct type
*ptr_target
;
56 gdb_assert (ptr_type
->code () == TYPE_CODE_PTR
);
57 ptr_target
= check_typedef (TYPE_TARGET_TYPE (ptr_type
));
59 sz
= type_length_units (ptr_target
);
62 if (ptr_type
->code () == TYPE_CODE_VOID
)
68 name
= ptr_target
->name ();
70 error (_("Cannot perform pointer math on incomplete types, "
71 "try casting to a known type, or void *."));
73 error (_("Cannot perform pointer math on incomplete type \"%s\", "
74 "try casting to a known type, or void *."), name
);
80 /* Given a pointer ARG1 and an integral value ARG2, return the
81 result of C-style pointer arithmetic ARG1 + ARG2. */
84 value_ptradd (struct value
*arg1
, LONGEST arg2
)
86 struct type
*valptrtype
;
90 arg1
= coerce_array (arg1
);
91 valptrtype
= check_typedef (value_type (arg1
));
92 sz
= find_size_for_pointer_math (valptrtype
);
94 result
= value_from_pointer (valptrtype
,
95 value_as_address (arg1
) + sz
* arg2
);
96 if (VALUE_LVAL (result
) != lval_internalvar
)
97 set_value_component_location (result
, arg1
);
101 /* Given two compatible pointer values ARG1 and ARG2, return the
102 result of C-style pointer arithmetic ARG1 - ARG2. */
105 value_ptrdiff (struct value
*arg1
, struct value
*arg2
)
107 struct type
*type1
, *type2
;
110 arg1
= coerce_array (arg1
);
111 arg2
= coerce_array (arg2
);
112 type1
= check_typedef (value_type (arg1
));
113 type2
= check_typedef (value_type (arg2
));
115 gdb_assert (type1
->code () == TYPE_CODE_PTR
);
116 gdb_assert (type2
->code () == TYPE_CODE_PTR
);
118 if (TYPE_LENGTH (check_typedef (TYPE_TARGET_TYPE (type1
)))
119 != TYPE_LENGTH (check_typedef (TYPE_TARGET_TYPE (type2
))))
120 error (_("First argument of `-' is a pointer and "
121 "second argument is neither\n"
122 "an integer nor a pointer of the same type."));
124 sz
= type_length_units (check_typedef (TYPE_TARGET_TYPE (type1
)));
127 warning (_("Type size unknown, assuming 1. "
128 "Try casting to a known type, or void *."));
132 return (value_as_long (arg1
) - value_as_long (arg2
)) / sz
;
135 /* Return the value of ARRAY[IDX].
137 ARRAY may be of type TYPE_CODE_ARRAY or TYPE_CODE_STRING. If the
138 current language supports C-style arrays, it may also be TYPE_CODE_PTR.
140 See comments in value_coerce_array() for rationale for reason for
141 doing lower bounds adjustment here rather than there.
142 FIXME: Perhaps we should validate that the index is valid and if
143 verbosity is set, warn about invalid indices (but still use them). */
146 value_subscript (struct value
*array
, LONGEST index
)
148 bool c_style
= current_language
->c_style_arrays_p ();
151 array
= coerce_ref (array
);
152 tarray
= check_typedef (value_type (array
));
154 if (tarray
->code () == TYPE_CODE_ARRAY
155 || tarray
->code () == TYPE_CODE_STRING
)
157 struct type
*range_type
= tarray
->index_type ();
158 gdb::optional
<LONGEST
> lowerbound
= get_discrete_low_bound (range_type
);
159 if (!lowerbound
.has_value ())
162 if (VALUE_LVAL (array
) != lval_memory
)
163 return value_subscripted_rvalue (array
, index
, *lowerbound
);
165 gdb::optional
<LONGEST
> upperbound
166 = get_discrete_high_bound (range_type
);
168 if (!upperbound
.has_value ())
171 if (index
>= *lowerbound
&& index
<= *upperbound
)
172 return value_subscripted_rvalue (array
, index
, *lowerbound
);
176 /* Emit warning unless we have an array of unknown size.
177 An array of unknown size has lowerbound 0 and upperbound -1. */
178 if (*upperbound
> -1)
179 warning (_("array or string index out of range"));
180 /* fall doing C stuff */
184 index
-= *lowerbound
;
185 array
= value_coerce_array (array
);
189 return value_ind (value_ptradd (array
, index
));
191 error (_("not an array or string"));
194 /* Return the value of EXPR[IDX], expr an aggregate rvalue
195 (eg, a vector register). This routine used to promote floats
196 to doubles, but no longer does. */
198 static struct value
*
199 value_subscripted_rvalue (struct value
*array
, LONGEST index
,
202 struct type
*array_type
= check_typedef (value_type (array
));
203 struct type
*elt_type
= TYPE_TARGET_TYPE (array_type
);
204 LONGEST elt_size
= type_length_units (elt_type
);
206 /* Fetch the bit stride and convert it to a byte stride, assuming 8 bits
208 LONGEST stride
= array_type
->bit_stride ();
211 struct gdbarch
*arch
= elt_type
->arch ();
212 int unit_size
= gdbarch_addressable_memory_unit_size (arch
);
213 elt_size
= stride
/ (unit_size
* 8);
216 LONGEST elt_offs
= elt_size
* (index
- lowerbound
);
217 bool array_upper_bound_undefined
218 = array_type
->bounds ()->high
.kind () == PROP_UNDEFINED
;
220 if (index
< lowerbound
221 || (!array_upper_bound_undefined
222 && elt_offs
>= type_length_units (array_type
))
223 || (VALUE_LVAL (array
) != lval_memory
&& array_upper_bound_undefined
))
225 if (type_not_associated (array_type
))
226 error (_("no such vector element (vector not associated)"));
227 else if (type_not_allocated (array_type
))
228 error (_("no such vector element (vector not allocated)"));
230 error (_("no such vector element"));
233 if (is_dynamic_type (elt_type
))
237 address
= value_address (array
) + elt_offs
;
238 elt_type
= resolve_dynamic_type (elt_type
, {}, address
);
241 return value_from_component (array
, elt_type
, elt_offs
);
245 /* Check to see if either argument is a structure, or a reference to
246 one. This is called so we know whether to go ahead with the normal
247 binop or look for a user defined function instead.
249 For now, we do not overload the `=' operator. */
252 binop_types_user_defined_p (enum exp_opcode op
,
253 struct type
*type1
, struct type
*type2
)
255 if (op
== BINOP_ASSIGN
)
258 type1
= check_typedef (type1
);
259 if (TYPE_IS_REFERENCE (type1
))
260 type1
= check_typedef (TYPE_TARGET_TYPE (type1
));
262 type2
= check_typedef (type2
);
263 if (TYPE_IS_REFERENCE (type2
))
264 type2
= check_typedef (TYPE_TARGET_TYPE (type2
));
266 return (type1
->code () == TYPE_CODE_STRUCT
267 || type2
->code () == TYPE_CODE_STRUCT
);
270 /* Check to see if either argument is a structure, or a reference to
271 one. This is called so we know whether to go ahead with the normal
272 binop or look for a user defined function instead.
274 For now, we do not overload the `=' operator. */
277 binop_user_defined_p (enum exp_opcode op
,
278 struct value
*arg1
, struct value
*arg2
)
280 return binop_types_user_defined_p (op
, value_type (arg1
), value_type (arg2
));
283 /* Check to see if argument is a structure. This is called so
284 we know whether to go ahead with the normal unop or look for a
285 user defined function instead.
287 For now, we do not overload the `&' operator. */
290 unop_user_defined_p (enum exp_opcode op
, struct value
*arg1
)
296 type1
= check_typedef (value_type (arg1
));
297 if (TYPE_IS_REFERENCE (type1
))
298 type1
= check_typedef (TYPE_TARGET_TYPE (type1
));
299 return type1
->code () == TYPE_CODE_STRUCT
;
302 /* Try to find an operator named OPERATOR which takes NARGS arguments
303 specified in ARGS. If the operator found is a static member operator
304 *STATIC_MEMFUNP will be set to 1, and otherwise 0.
305 The search if performed through find_overload_match which will handle
306 member operators, non member operators, operators imported implicitly or
307 explicitly, and perform correct overload resolution in all of the above
308 situations or combinations thereof. */
310 static struct value
*
311 value_user_defined_cpp_op (gdb::array_view
<value
*> args
, char *oper
,
312 int *static_memfuncp
, enum noside noside
)
315 struct symbol
*symp
= NULL
;
316 struct value
*valp
= NULL
;
318 find_overload_match (args
, oper
, BOTH
/* could be method */,
320 NULL
/* pass NULL symbol since symbol is unknown */,
321 &valp
, &symp
, static_memfuncp
, 0, noside
);
328 /* This is a non member function and does not
329 expect a reference as its first argument
330 rather the explicit structure. */
331 args
[0] = value_ind (args
[0]);
332 return value_of_variable (symp
, 0);
335 error (_("Could not find %s."), oper
);
338 /* Lookup user defined operator NAME. Return a value representing the
339 function, otherwise return NULL. */
341 static struct value
*
342 value_user_defined_op (struct value
**argp
, gdb::array_view
<value
*> args
,
343 char *name
, int *static_memfuncp
, enum noside noside
)
345 struct value
*result
= NULL
;
347 if (current_language
->la_language
== language_cplus
)
349 result
= value_user_defined_cpp_op (args
, name
, static_memfuncp
,
353 result
= value_struct_elt (argp
, args
, name
, static_memfuncp
,
359 /* We know either arg1 or arg2 is a structure, so try to find the right
360 user defined function. Create an argument vector that calls
361 arg1.operator @ (arg1,arg2) and return that value (where '@' is any
362 binary operator which is legal for GNU C++).
364 OP is the operator, and if it is BINOP_ASSIGN_MODIFY, then OTHEROP
365 is the opcode saying how to modify it. Otherwise, OTHEROP is
369 value_x_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
,
370 enum exp_opcode otherop
, enum noside noside
)
376 arg1
= coerce_ref (arg1
);
377 arg2
= coerce_ref (arg2
);
379 /* now we know that what we have to do is construct our
380 arg vector and find the right function to call it with. */
382 if (check_typedef (value_type (arg1
))->code () != TYPE_CODE_STRUCT
)
383 error (_("Can't do that binary op on that type")); /* FIXME be explicit */
385 value
*argvec_storage
[3];
386 gdb::array_view
<value
*> argvec
= argvec_storage
;
388 argvec
[1] = value_addr (arg1
);
391 /* Make the right function name up. */
392 strcpy (tstr
, "operator__");
417 case BINOP_BITWISE_AND
:
420 case BINOP_BITWISE_IOR
:
423 case BINOP_BITWISE_XOR
:
426 case BINOP_LOGICAL_AND
:
429 case BINOP_LOGICAL_OR
:
441 case BINOP_ASSIGN_MODIFY
:
459 case BINOP_BITWISE_AND
:
462 case BINOP_BITWISE_IOR
:
465 case BINOP_BITWISE_XOR
:
468 case BINOP_MOD
: /* invalid */
470 error (_("Invalid binary operation specified."));
473 case BINOP_SUBSCRIPT
:
494 case BINOP_MOD
: /* invalid */
496 error (_("Invalid binary operation specified."));
499 argvec
[0] = value_user_defined_op (&arg1
, argvec
.slice (1), tstr
,
500 &static_memfuncp
, noside
);
506 argvec
[1] = argvec
[0];
507 argvec
= argvec
.slice (1);
509 if (value_type (argvec
[0])->code () == TYPE_CODE_XMETHOD
)
511 /* Static xmethods are not supported yet. */
512 gdb_assert (static_memfuncp
== 0);
513 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
515 struct type
*return_type
516 = result_type_of_xmethod (argvec
[0], argvec
.slice (1));
518 if (return_type
== NULL
)
519 error (_("Xmethod is missing return type."));
520 return value_zero (return_type
, VALUE_LVAL (arg1
));
522 return call_xmethod (argvec
[0], argvec
.slice (1));
524 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
526 struct type
*return_type
;
529 = TYPE_TARGET_TYPE (check_typedef (value_type (argvec
[0])));
530 return value_zero (return_type
, VALUE_LVAL (arg1
));
532 return call_function_by_hand (argvec
[0], NULL
,
533 argvec
.slice (1, 2 - static_memfuncp
));
535 throw_error (NOT_FOUND_ERROR
,
536 _("member function %s not found"), tstr
);
539 /* We know that arg1 is a structure, so try to find a unary user
540 defined operator that matches the operator in question.
541 Create an argument vector that calls arg1.operator @ (arg1)
542 and return that value (where '@' is (almost) any unary operator which
543 is legal for GNU C++). */
546 value_x_unop (struct value
*arg1
, enum exp_opcode op
, enum noside noside
)
548 struct gdbarch
*gdbarch
= value_type (arg1
)->arch ();
550 char tstr
[13], mangle_tstr
[13];
551 int static_memfuncp
, nargs
;
553 arg1
= coerce_ref (arg1
);
555 /* now we know that what we have to do is construct our
556 arg vector and find the right function to call it with. */
558 if (check_typedef (value_type (arg1
))->code () != TYPE_CODE_STRUCT
)
559 error (_("Can't do that unary op on that type")); /* FIXME be explicit */
561 value
*argvec_storage
[3];
562 gdb::array_view
<value
*> argvec
= argvec_storage
;
564 argvec
[1] = value_addr (arg1
);
569 /* Make the right function name up. */
570 strcpy (tstr
, "operator__");
572 strcpy (mangle_tstr
, "__");
575 case UNOP_PREINCREMENT
:
578 case UNOP_PREDECREMENT
:
581 case UNOP_POSTINCREMENT
:
583 argvec
[2] = value_from_longest (builtin_type (gdbarch
)->builtin_int
, 0);
586 case UNOP_POSTDECREMENT
:
588 argvec
[2] = value_from_longest (builtin_type (gdbarch
)->builtin_int
, 0);
591 case UNOP_LOGICAL_NOT
:
594 case UNOP_COMPLEMENT
:
610 error (_("Invalid unary operation specified."));
613 argvec
[0] = value_user_defined_op (&arg1
, argvec
.slice (1, nargs
), tstr
,
614 &static_memfuncp
, noside
);
620 argvec
[1] = argvec
[0];
621 argvec
= argvec
.slice (1);
623 if (value_type (argvec
[0])->code () == TYPE_CODE_XMETHOD
)
625 /* Static xmethods are not supported yet. */
626 gdb_assert (static_memfuncp
== 0);
627 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
629 struct type
*return_type
630 = result_type_of_xmethod (argvec
[0], argvec
[1]);
632 if (return_type
== NULL
)
633 error (_("Xmethod is missing return type."));
634 return value_zero (return_type
, VALUE_LVAL (arg1
));
636 return call_xmethod (argvec
[0], argvec
[1]);
638 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
640 struct type
*return_type
;
643 = TYPE_TARGET_TYPE (check_typedef (value_type (argvec
[0])));
644 return value_zero (return_type
, VALUE_LVAL (arg1
));
646 return call_function_by_hand (argvec
[0], NULL
,
647 argvec
.slice (1, nargs
));
649 throw_error (NOT_FOUND_ERROR
,
650 _("member function %s not found"), tstr
);
654 /* Concatenate two values with the following conditions:
656 (1) Both values must be either bitstring values or character string
657 values and the resulting value consists of the concatenation of
658 ARG1 followed by ARG2.
662 One value must be an integer value and the other value must be
663 either a bitstring value or character string value, which is
664 to be repeated by the number of times specified by the integer
668 (2) Boolean values are also allowed and are treated as bit string
671 (3) Character values are also allowed and are treated as character
672 string values of length 1. */
675 value_concat (struct value
*arg1
, struct value
*arg2
)
677 struct value
*inval1
;
678 struct value
*inval2
;
679 struct value
*outval
= NULL
;
680 int inval1len
, inval2len
;
683 struct type
*type1
= check_typedef (value_type (arg1
));
684 struct type
*type2
= check_typedef (value_type (arg2
));
685 struct type
*char_type
;
687 /* First figure out if we are dealing with two values to be concatenated
688 or a repeat count and a value to be repeated. INVAL1 is set to the
689 first of two concatenated values, or the repeat count. INVAL2 is set
690 to the second of the two concatenated values or the value to be
693 if (type2
->code () == TYPE_CODE_INT
)
695 struct type
*tmp
= type1
;
708 /* Now process the input values. */
710 if (type1
->code () == TYPE_CODE_INT
)
712 /* We have a repeat count. Validate the second value and then
713 construct a value repeated that many times. */
714 if (type2
->code () == TYPE_CODE_STRING
715 || type2
->code () == TYPE_CODE_CHAR
)
717 count
= longest_to_int (value_as_long (inval1
));
718 inval2len
= TYPE_LENGTH (type2
);
719 std::vector
<char> ptr (count
* inval2len
);
720 if (type2
->code () == TYPE_CODE_CHAR
)
724 inchar
= (char) unpack_long (type2
,
725 value_contents (inval2
).data ());
726 for (idx
= 0; idx
< count
; idx
++)
733 char_type
= TYPE_TARGET_TYPE (type2
);
735 for (idx
= 0; idx
< count
; idx
++)
736 memcpy (&ptr
[idx
* inval2len
], value_contents (inval2
).data (),
739 outval
= value_string (ptr
.data (), count
* inval2len
, char_type
);
741 else if (type2
->code () == TYPE_CODE_BOOL
)
743 error (_("unimplemented support for boolean repeats"));
747 error (_("can't repeat values of that type"));
750 else if (type1
->code () == TYPE_CODE_STRING
751 || type1
->code () == TYPE_CODE_CHAR
)
753 /* We have two character strings to concatenate. */
754 if (type2
->code () != TYPE_CODE_STRING
755 && type2
->code () != TYPE_CODE_CHAR
)
757 error (_("Strings can only be concatenated with other strings."));
759 inval1len
= TYPE_LENGTH (type1
);
760 inval2len
= TYPE_LENGTH (type2
);
761 std::vector
<char> ptr (inval1len
+ inval2len
);
762 if (type1
->code () == TYPE_CODE_CHAR
)
766 ptr
[0] = (char) unpack_long (type1
, value_contents (inval1
).data ());
770 char_type
= TYPE_TARGET_TYPE (type1
);
772 memcpy (ptr
.data (), value_contents (inval1
).data (), inval1len
);
774 if (type2
->code () == TYPE_CODE_CHAR
)
777 (char) unpack_long (type2
, value_contents (inval2
).data ());
781 memcpy (&ptr
[inval1len
], value_contents (inval2
).data (), inval2len
);
783 outval
= value_string (ptr
.data (), inval1len
+ inval2len
, char_type
);
785 else if (type1
->code () == TYPE_CODE_BOOL
)
787 /* We have two bitstrings to concatenate. */
788 if (type2
->code () != TYPE_CODE_BOOL
)
790 error (_("Booleans can only be concatenated "
791 "with other bitstrings or booleans."));
793 error (_("unimplemented support for boolean concatenation."));
797 /* We don't know how to concatenate these operands. */
798 error (_("illegal operands for concatenation."));
803 /* Integer exponentiation: V1**V2, where both arguments are
804 integers. Requires V1 != 0 if V2 < 0. Returns 1 for 0 ** 0. */
807 integer_pow (LONGEST v1
, LONGEST v2
)
812 error (_("Attempt to raise 0 to negative power."));
818 /* The Russian Peasant's Algorithm. */
834 /* Obtain argument values for binary operation, converting from
835 other types if one of them is not floating point. */
837 value_args_as_target_float (struct value
*arg1
, struct value
*arg2
,
838 gdb_byte
*x
, struct type
**eff_type_x
,
839 gdb_byte
*y
, struct type
**eff_type_y
)
841 struct type
*type1
, *type2
;
843 type1
= check_typedef (value_type (arg1
));
844 type2
= check_typedef (value_type (arg2
));
846 /* At least one of the arguments must be of floating-point type. */
847 gdb_assert (is_floating_type (type1
) || is_floating_type (type2
));
849 if (is_floating_type (type1
) && is_floating_type (type2
)
850 && type1
->code () != type2
->code ())
851 /* The DFP extension to the C language does not allow mixing of
852 * decimal float types with other float types in expressions
853 * (see WDTR 24732, page 12). */
854 error (_("Mixing decimal floating types with "
855 "other floating types is not allowed."));
857 /* Obtain value of arg1, converting from other types if necessary. */
859 if (is_floating_type (type1
))
862 memcpy (x
, value_contents (arg1
).data (), TYPE_LENGTH (type1
));
864 else if (is_integral_type (type1
))
867 if (type1
->is_unsigned ())
868 target_float_from_ulongest (x
, *eff_type_x
, value_as_long (arg1
));
870 target_float_from_longest (x
, *eff_type_x
, value_as_long (arg1
));
873 error (_("Don't know how to convert from %s to %s."), type1
->name (),
876 /* Obtain value of arg2, converting from other types if necessary. */
878 if (is_floating_type (type2
))
881 memcpy (y
, value_contents (arg2
).data (), TYPE_LENGTH (type2
));
883 else if (is_integral_type (type2
))
886 if (type2
->is_unsigned ())
887 target_float_from_ulongest (y
, *eff_type_y
, value_as_long (arg2
));
889 target_float_from_longest (y
, *eff_type_y
, value_as_long (arg2
));
892 error (_("Don't know how to convert from %s to %s."), type1
->name (),
896 /* Assuming at last one of ARG1 or ARG2 is a fixed point value,
897 perform the binary operation OP on these two operands, and return
898 the resulting value (also as a fixed point). */
900 static struct value
*
901 fixed_point_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
903 struct type
*type1
= check_typedef (value_type (arg1
));
904 struct type
*type2
= check_typedef (value_type (arg2
));
905 const struct language_defn
*language
= current_language
;
907 struct gdbarch
*gdbarch
= type1
->arch ();
912 gdb_assert (is_fixed_point_type (type1
) || is_fixed_point_type (type2
));
913 if (op
== BINOP_MUL
|| op
== BINOP_DIV
)
915 v1
= value_to_gdb_mpq (arg1
);
916 v2
= value_to_gdb_mpq (arg2
);
918 /* The code below uses TYPE1 for the result type, so make sure
919 it is set properly. */
920 if (!is_fixed_point_type (type1
))
925 if (!is_fixed_point_type (type1
))
927 arg1
= value_cast (type2
, arg1
);
930 if (!is_fixed_point_type (type2
))
932 arg2
= value_cast (type1
, arg2
);
936 v1
.read_fixed_point (value_contents (arg1
),
937 type_byte_order (type1
), type1
->is_unsigned (),
938 type1
->fixed_point_scaling_factor ());
939 v2
.read_fixed_point (value_contents (arg2
),
940 type_byte_order (type2
), type2
->is_unsigned (),
941 type2
->fixed_point_scaling_factor ());
944 auto fixed_point_to_value
= [type1
] (const gdb_mpq
&fp
)
946 value
*fp_val
= allocate_value (type1
);
949 (value_contents_raw (fp_val
),
950 type_byte_order (type1
),
951 type1
->is_unsigned (),
952 type1
->fixed_point_scaling_factor ());
960 mpq_add (res
.val
, v1
.val
, v2
.val
);
961 val
= fixed_point_to_value (res
);
965 mpq_sub (res
.val
, v1
.val
, v2
.val
);
966 val
= fixed_point_to_value (res
);
970 val
= fixed_point_to_value (mpq_cmp (v1
.val
, v2
.val
) < 0 ? v1
: v2
);
974 val
= fixed_point_to_value (mpq_cmp (v1
.val
, v2
.val
) > 0 ? v1
: v2
);
978 mpq_mul (res
.val
, v1
.val
, v2
.val
);
979 val
= fixed_point_to_value (res
);
983 if (mpq_sgn (v2
.val
) == 0)
984 error (_("Division by zero"));
985 mpq_div (res
.val
, v1
.val
, v2
.val
);
986 val
= fixed_point_to_value (res
);
990 val
= value_from_ulongest (language_bool_type (language
, gdbarch
),
991 mpq_cmp (v1
.val
, v2
.val
) == 0 ? 1 : 0);
995 val
= value_from_ulongest (language_bool_type (language
, gdbarch
),
996 mpq_cmp (v1
.val
, v2
.val
) < 0 ? 1 : 0);
1000 error (_("Integer-only operation on fixed point number."));
1006 /* A helper function that finds the type to use for a binary operation
1007 involving TYPE1 and TYPE2. */
1009 static struct type
*
1010 promotion_type (struct type
*type1
, struct type
*type2
)
1012 struct type
*result_type
;
1014 if (is_floating_type (type1
) || is_floating_type (type2
))
1016 /* If only one type is floating-point, use its type.
1017 Otherwise use the bigger type. */
1018 if (!is_floating_type (type1
))
1019 result_type
= type2
;
1020 else if (!is_floating_type (type2
))
1021 result_type
= type1
;
1022 else if (TYPE_LENGTH (type2
) > TYPE_LENGTH (type1
))
1023 result_type
= type2
;
1025 result_type
= type1
;
1029 /* Integer types. */
1030 if (TYPE_LENGTH (type1
) > TYPE_LENGTH (type2
))
1031 result_type
= type1
;
1032 else if (TYPE_LENGTH (type2
) > TYPE_LENGTH (type1
))
1033 result_type
= type2
;
1034 else if (type1
->is_unsigned ())
1035 result_type
= type1
;
1036 else if (type2
->is_unsigned ())
1037 result_type
= type2
;
1039 result_type
= type1
;
1045 static struct value
*scalar_binop (struct value
*arg1
, struct value
*arg2
,
1046 enum exp_opcode op
);
1048 /* Perform a binary operation on complex operands. */
1050 static struct value
*
1051 complex_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
1053 struct type
*arg1_type
= check_typedef (value_type (arg1
));
1054 struct type
*arg2_type
= check_typedef (value_type (arg2
));
1056 struct value
*arg1_real
, *arg1_imag
, *arg2_real
, *arg2_imag
;
1057 if (arg1_type
->code () == TYPE_CODE_COMPLEX
)
1059 arg1_real
= value_real_part (arg1
);
1060 arg1_imag
= value_imaginary_part (arg1
);
1065 arg1_imag
= value_zero (arg1_type
, not_lval
);
1067 if (arg2_type
->code () == TYPE_CODE_COMPLEX
)
1069 arg2_real
= value_real_part (arg2
);
1070 arg2_imag
= value_imaginary_part (arg2
);
1075 arg2_imag
= value_zero (arg2_type
, not_lval
);
1078 struct type
*comp_type
= promotion_type (value_type (arg1_real
),
1079 value_type (arg2_real
));
1080 if (!can_create_complex_type (comp_type
))
1081 error (_("Argument to complex arithmetic operation not supported."));
1083 arg1_real
= value_cast (comp_type
, arg1_real
);
1084 arg1_imag
= value_cast (comp_type
, arg1_imag
);
1085 arg2_real
= value_cast (comp_type
, arg2_real
);
1086 arg2_imag
= value_cast (comp_type
, arg2_imag
);
1088 struct type
*result_type
= init_complex_type (nullptr, comp_type
);
1090 struct value
*result_real
, *result_imag
;
1095 result_real
= scalar_binop (arg1_real
, arg2_real
, op
);
1096 result_imag
= scalar_binop (arg1_imag
, arg2_imag
, op
);
1101 struct value
*x1
= scalar_binop (arg1_real
, arg2_real
, op
);
1102 struct value
*x2
= scalar_binop (arg1_imag
, arg2_imag
, op
);
1103 result_real
= scalar_binop (x1
, x2
, BINOP_SUB
);
1105 x1
= scalar_binop (arg1_real
, arg2_imag
, op
);
1106 x2
= scalar_binop (arg1_imag
, arg2_real
, op
);
1107 result_imag
= scalar_binop (x1
, x2
, BINOP_ADD
);
1113 if (arg2_type
->code () == TYPE_CODE_COMPLEX
)
1115 struct value
*conjugate
= value_complement (arg2
);
1116 /* We have to reconstruct ARG1, in case the type was
1118 arg1
= value_literal_complex (arg1_real
, arg1_imag
, result_type
);
1120 struct value
*numerator
= scalar_binop (arg1
, conjugate
,
1122 arg1_real
= value_real_part (numerator
);
1123 arg1_imag
= value_imaginary_part (numerator
);
1125 struct value
*x1
= scalar_binop (arg2_real
, arg2_real
, BINOP_MUL
);
1126 struct value
*x2
= scalar_binop (arg2_imag
, arg2_imag
, BINOP_MUL
);
1127 arg2_real
= scalar_binop (x1
, x2
, BINOP_ADD
);
1130 result_real
= scalar_binop (arg1_real
, arg2_real
, op
);
1131 result_imag
= scalar_binop (arg1_imag
, arg2_real
, op
);
1136 case BINOP_NOTEQUAL
:
1138 struct value
*x1
= scalar_binop (arg1_real
, arg2_real
, op
);
1139 struct value
*x2
= scalar_binop (arg1_imag
, arg2_imag
, op
);
1141 LONGEST v1
= value_as_long (x1
);
1142 LONGEST v2
= value_as_long (x2
);
1144 if (op
== BINOP_EQUAL
)
1149 return value_from_longest (value_type (x1
), v1
);
1154 error (_("Invalid binary operation on numbers."));
1157 return value_literal_complex (result_real
, result_imag
, result_type
);
1160 /* Perform a binary operation on two operands which have reasonable
1161 representations as integers or floats. This includes booleans,
1162 characters, integers, or floats.
1163 Does not support addition and subtraction on pointers;
1164 use value_ptradd, value_ptrsub or value_ptrdiff for those operations. */
1166 static struct value
*
1167 scalar_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
1170 struct type
*type1
, *type2
, *result_type
;
1172 arg1
= coerce_ref (arg1
);
1173 arg2
= coerce_ref (arg2
);
1175 type1
= check_typedef (value_type (arg1
));
1176 type2
= check_typedef (value_type (arg2
));
1178 if (type1
->code () == TYPE_CODE_COMPLEX
1179 || type2
->code () == TYPE_CODE_COMPLEX
)
1180 return complex_binop (arg1
, arg2
, op
);
1182 if ((!is_floating_value (arg1
)
1183 && !is_integral_type (type1
)
1184 && !is_fixed_point_type (type1
))
1185 || (!is_floating_value (arg2
)
1186 && !is_integral_type (type2
)
1187 && !is_fixed_point_type (type2
)))
1188 error (_("Argument to arithmetic operation not a number or boolean."));
1190 if (is_fixed_point_type (type1
) || is_fixed_point_type (type2
))
1191 return fixed_point_binop (arg1
, arg2
, op
);
1193 if (is_floating_type (type1
) || is_floating_type (type2
))
1195 result_type
= promotion_type (type1
, type2
);
1196 val
= allocate_value (result_type
);
1198 struct type
*eff_type_v1
, *eff_type_v2
;
1199 gdb::byte_vector v1
, v2
;
1200 v1
.resize (TYPE_LENGTH (result_type
));
1201 v2
.resize (TYPE_LENGTH (result_type
));
1203 value_args_as_target_float (arg1
, arg2
,
1204 v1
.data (), &eff_type_v1
,
1205 v2
.data (), &eff_type_v2
);
1206 target_float_binop (op
, v1
.data (), eff_type_v1
,
1207 v2
.data (), eff_type_v2
,
1208 value_contents_raw (val
).data (), result_type
);
1210 else if (type1
->code () == TYPE_CODE_BOOL
1211 || type2
->code () == TYPE_CODE_BOOL
)
1213 LONGEST v1
, v2
, v
= 0;
1215 v1
= value_as_long (arg1
);
1216 v2
= value_as_long (arg2
);
1220 case BINOP_BITWISE_AND
:
1224 case BINOP_BITWISE_IOR
:
1228 case BINOP_BITWISE_XOR
:
1236 case BINOP_NOTEQUAL
:
1241 error (_("Invalid operation on booleans."));
1244 result_type
= type1
;
1246 val
= allocate_value (result_type
);
1247 store_signed_integer (value_contents_raw (val
).data (),
1248 TYPE_LENGTH (result_type
),
1249 type_byte_order (result_type
),
1253 /* Integral operations here. */
1255 /* Determine type length of the result, and if the operation should
1256 be done unsigned. For exponentiation and shift operators,
1257 use the length and type of the left operand. Otherwise,
1258 use the signedness of the operand with the greater length.
1259 If both operands are of equal length, use unsigned operation
1260 if one of the operands is unsigned. */
1261 if (op
== BINOP_RSH
|| op
== BINOP_LSH
|| op
== BINOP_EXP
)
1262 result_type
= type1
;
1264 result_type
= promotion_type (type1
, type2
);
1266 if (result_type
->is_unsigned ())
1268 LONGEST v2_signed
= value_as_long (arg2
);
1269 ULONGEST v1
, v2
, v
= 0;
1271 v1
= (ULONGEST
) value_as_long (arg1
);
1272 v2
= (ULONGEST
) v2_signed
;
1293 error (_("Division by zero"));
1297 v
= uinteger_pow (v1
, v2_signed
);
1304 error (_("Division by zero"));
1308 /* Knuth 1.2.4, integer only. Note that unlike the C '%' op,
1309 v1 mod 0 has a defined value, v1. */
1317 /* Note floor(v1/v2) == v1/v2 for unsigned. */
1330 case BINOP_BITWISE_AND
:
1334 case BINOP_BITWISE_IOR
:
1338 case BINOP_BITWISE_XOR
:
1342 case BINOP_LOGICAL_AND
:
1346 case BINOP_LOGICAL_OR
:
1351 v
= v1
< v2
? v1
: v2
;
1355 v
= v1
> v2
? v1
: v2
;
1362 case BINOP_NOTEQUAL
:
1383 error (_("Invalid binary operation on numbers."));
1386 val
= allocate_value (result_type
);
1387 store_unsigned_integer (value_contents_raw (val
).data (),
1388 TYPE_LENGTH (value_type (val
)),
1389 type_byte_order (result_type
),
1394 LONGEST v1
, v2
, v
= 0;
1396 v1
= value_as_long (arg1
);
1397 v2
= value_as_long (arg2
);
1418 error (_("Division by zero"));
1422 v
= integer_pow (v1
, v2
);
1429 error (_("Division by zero"));
1433 /* Knuth 1.2.4, integer only. Note that unlike the C '%' op,
1434 X mod 0 has a defined value, X. */
1442 /* Compute floor. */
1443 if (TRUNCATION_TOWARDS_ZERO
&& (v
< 0) && ((v1
% v2
) != 0))
1459 case BINOP_BITWISE_AND
:
1463 case BINOP_BITWISE_IOR
:
1467 case BINOP_BITWISE_XOR
:
1471 case BINOP_LOGICAL_AND
:
1475 case BINOP_LOGICAL_OR
:
1480 v
= v1
< v2
? v1
: v2
;
1484 v
= v1
> v2
? v1
: v2
;
1491 case BINOP_NOTEQUAL
:
1512 error (_("Invalid binary operation on numbers."));
1515 val
= allocate_value (result_type
);
1516 store_signed_integer (value_contents_raw (val
).data (),
1517 TYPE_LENGTH (value_type (val
)),
1518 type_byte_order (result_type
),
1526 /* Widen a scalar value SCALAR_VALUE to vector type VECTOR_TYPE by
1527 replicating SCALAR_VALUE for each element of the vector. Only scalar
1528 types that can be cast to the type of one element of the vector are
1529 acceptable. The newly created vector value is returned upon success,
1530 otherwise an error is thrown. */
1533 value_vector_widen (struct value
*scalar_value
, struct type
*vector_type
)
1535 /* Widen the scalar to a vector. */
1536 struct type
*eltype
, *scalar_type
;
1537 struct value
*elval
;
1538 LONGEST low_bound
, high_bound
;
1541 vector_type
= check_typedef (vector_type
);
1543 gdb_assert (vector_type
->code () == TYPE_CODE_ARRAY
1544 && vector_type
->is_vector ());
1546 if (!get_array_bounds (vector_type
, &low_bound
, &high_bound
))
1547 error (_("Could not determine the vector bounds"));
1549 eltype
= check_typedef (TYPE_TARGET_TYPE (vector_type
));
1550 elval
= value_cast (eltype
, scalar_value
);
1552 scalar_type
= check_typedef (value_type (scalar_value
));
1554 /* If we reduced the length of the scalar then check we didn't loose any
1556 if (TYPE_LENGTH (eltype
) < TYPE_LENGTH (scalar_type
)
1557 && !value_equal (elval
, scalar_value
))
1558 error (_("conversion of scalar to vector involves truncation"));
1560 value
*val
= allocate_value (vector_type
);
1561 gdb::array_view
<gdb_byte
> val_contents
= value_contents_writeable (val
);
1562 int elt_len
= TYPE_LENGTH (eltype
);
1564 for (i
= 0; i
< high_bound
- low_bound
+ 1; i
++)
1565 /* Duplicate the contents of elval into the destination vector. */
1566 copy (value_contents_all (elval
),
1567 val_contents
.slice (i
* elt_len
, elt_len
));
1572 /* Performs a binary operation on two vector operands by calling scalar_binop
1573 for each pair of vector components. */
1575 static struct value
*
1576 vector_binop (struct value
*val1
, struct value
*val2
, enum exp_opcode op
)
1578 struct type
*type1
, *type2
, *eltype1
, *eltype2
;
1579 int t1_is_vec
, t2_is_vec
, elsize
, i
;
1580 LONGEST low_bound1
, high_bound1
, low_bound2
, high_bound2
;
1582 type1
= check_typedef (value_type (val1
));
1583 type2
= check_typedef (value_type (val2
));
1585 t1_is_vec
= (type1
->code () == TYPE_CODE_ARRAY
1586 && type1
->is_vector ()) ? 1 : 0;
1587 t2_is_vec
= (type2
->code () == TYPE_CODE_ARRAY
1588 && type2
->is_vector ()) ? 1 : 0;
1590 if (!t1_is_vec
|| !t2_is_vec
)
1591 error (_("Vector operations are only supported among vectors"));
1593 if (!get_array_bounds (type1
, &low_bound1
, &high_bound1
)
1594 || !get_array_bounds (type2
, &low_bound2
, &high_bound2
))
1595 error (_("Could not determine the vector bounds"));
1597 eltype1
= check_typedef (TYPE_TARGET_TYPE (type1
));
1598 eltype2
= check_typedef (TYPE_TARGET_TYPE (type2
));
1599 elsize
= TYPE_LENGTH (eltype1
);
1601 if (eltype1
->code () != eltype2
->code ()
1602 || elsize
!= TYPE_LENGTH (eltype2
)
1603 || eltype1
->is_unsigned () != eltype2
->is_unsigned ()
1604 || low_bound1
!= low_bound2
|| high_bound1
!= high_bound2
)
1605 error (_("Cannot perform operation on vectors with different types"));
1607 value
*val
= allocate_value (type1
);
1608 gdb::array_view
<gdb_byte
> val_contents
= value_contents_writeable (val
);
1609 value
*mark
= value_mark ();
1610 for (i
= 0; i
< high_bound1
- low_bound1
+ 1; i
++)
1612 value
*tmp
= value_binop (value_subscript (val1
, i
),
1613 value_subscript (val2
, i
), op
);
1614 copy (value_contents_all (tmp
),
1615 val_contents
.slice (i
* elsize
, elsize
));
1617 value_free_to_mark (mark
);
1622 /* Perform a binary operation on two operands. */
1625 value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
1628 struct type
*type1
= check_typedef (value_type (arg1
));
1629 struct type
*type2
= check_typedef (value_type (arg2
));
1630 int t1_is_vec
= (type1
->code () == TYPE_CODE_ARRAY
1631 && type1
->is_vector ());
1632 int t2_is_vec
= (type2
->code () == TYPE_CODE_ARRAY
1633 && type2
->is_vector ());
1635 if (!t1_is_vec
&& !t2_is_vec
)
1636 val
= scalar_binop (arg1
, arg2
, op
);
1637 else if (t1_is_vec
&& t2_is_vec
)
1638 val
= vector_binop (arg1
, arg2
, op
);
1641 /* Widen the scalar operand to a vector. */
1642 struct value
**v
= t1_is_vec
? &arg2
: &arg1
;
1643 struct type
*t
= t1_is_vec
? type2
: type1
;
1645 if (t
->code () != TYPE_CODE_FLT
1646 && t
->code () != TYPE_CODE_DECFLOAT
1647 && !is_integral_type (t
))
1648 error (_("Argument to operation not a number or boolean."));
1650 /* Replicate the scalar value to make a vector value. */
1651 *v
= value_vector_widen (*v
, t1_is_vec
? type1
: type2
);
1653 val
= vector_binop (arg1
, arg2
, op
);
1662 value_logical_not (struct value
*arg1
)
1668 arg1
= coerce_array (arg1
);
1669 type1
= check_typedef (value_type (arg1
));
1671 if (is_floating_value (arg1
))
1672 return target_float_is_zero (value_contents (arg1
).data (), type1
);
1674 len
= TYPE_LENGTH (type1
);
1675 p
= value_contents (arg1
).data ();
1686 /* Perform a comparison on two string values (whose content are not
1687 necessarily null terminated) based on their length. */
1690 value_strcmp (struct value
*arg1
, struct value
*arg2
)
1692 int len1
= TYPE_LENGTH (value_type (arg1
));
1693 int len2
= TYPE_LENGTH (value_type (arg2
));
1694 const gdb_byte
*s1
= value_contents (arg1
).data ();
1695 const gdb_byte
*s2
= value_contents (arg2
).data ();
1696 int i
, len
= len1
< len2
? len1
: len2
;
1698 for (i
= 0; i
< len
; i
++)
1702 else if (s1
[i
] > s2
[i
])
1710 else if (len1
> len2
)
1716 /* Simulate the C operator == by returning a 1
1717 iff ARG1 and ARG2 have equal contents. */
1720 value_equal (struct value
*arg1
, struct value
*arg2
)
1725 struct type
*type1
, *type2
;
1726 enum type_code code1
;
1727 enum type_code code2
;
1728 int is_int1
, is_int2
;
1730 arg1
= coerce_array (arg1
);
1731 arg2
= coerce_array (arg2
);
1733 type1
= check_typedef (value_type (arg1
));
1734 type2
= check_typedef (value_type (arg2
));
1735 code1
= type1
->code ();
1736 code2
= type2
->code ();
1737 is_int1
= is_integral_type (type1
);
1738 is_int2
= is_integral_type (type2
);
1740 if (is_int1
&& is_int2
)
1741 return longest_to_int (value_as_long (value_binop (arg1
, arg2
,
1743 else if ((is_floating_value (arg1
) || is_int1
)
1744 && (is_floating_value (arg2
) || is_int2
))
1746 struct type
*eff_type_v1
, *eff_type_v2
;
1747 gdb::byte_vector v1
, v2
;
1748 v1
.resize (std::max (TYPE_LENGTH (type1
), TYPE_LENGTH (type2
)));
1749 v2
.resize (std::max (TYPE_LENGTH (type1
), TYPE_LENGTH (type2
)));
1751 value_args_as_target_float (arg1
, arg2
,
1752 v1
.data (), &eff_type_v1
,
1753 v2
.data (), &eff_type_v2
);
1755 return target_float_compare (v1
.data (), eff_type_v1
,
1756 v2
.data (), eff_type_v2
) == 0;
1759 /* FIXME: Need to promote to either CORE_ADDR or LONGEST, whichever
1761 else if (code1
== TYPE_CODE_PTR
&& is_int2
)
1762 return value_as_address (arg1
) == (CORE_ADDR
) value_as_long (arg2
);
1763 else if (code2
== TYPE_CODE_PTR
&& is_int1
)
1764 return (CORE_ADDR
) value_as_long (arg1
) == value_as_address (arg2
);
1766 else if (code1
== code2
1767 && ((len
= (int) TYPE_LENGTH (type1
))
1768 == (int) TYPE_LENGTH (type2
)))
1770 p1
= value_contents (arg1
).data ();
1771 p2
= value_contents (arg2
).data ();
1779 else if (code1
== TYPE_CODE_STRING
&& code2
== TYPE_CODE_STRING
)
1781 return value_strcmp (arg1
, arg2
) == 0;
1784 error (_("Invalid type combination in equality test."));
1787 /* Compare values based on their raw contents. Useful for arrays since
1788 value_equal coerces them to pointers, thus comparing just the address
1789 of the array instead of its contents. */
1792 value_equal_contents (struct value
*arg1
, struct value
*arg2
)
1794 struct type
*type1
, *type2
;
1796 type1
= check_typedef (value_type (arg1
));
1797 type2
= check_typedef (value_type (arg2
));
1799 return (type1
->code () == type2
->code ()
1800 && TYPE_LENGTH (type1
) == TYPE_LENGTH (type2
)
1801 && memcmp (value_contents (arg1
).data (),
1802 value_contents (arg2
).data (),
1803 TYPE_LENGTH (type1
)) == 0);
1806 /* Simulate the C operator < by returning 1
1807 iff ARG1's contents are less than ARG2's. */
1810 value_less (struct value
*arg1
, struct value
*arg2
)
1812 enum type_code code1
;
1813 enum type_code code2
;
1814 struct type
*type1
, *type2
;
1815 int is_int1
, is_int2
;
1817 arg1
= coerce_array (arg1
);
1818 arg2
= coerce_array (arg2
);
1820 type1
= check_typedef (value_type (arg1
));
1821 type2
= check_typedef (value_type (arg2
));
1822 code1
= type1
->code ();
1823 code2
= type2
->code ();
1824 is_int1
= is_integral_type (type1
);
1825 is_int2
= is_integral_type (type2
);
1827 if ((is_int1
&& is_int2
)
1828 || (is_fixed_point_type (type1
) && is_fixed_point_type (type2
)))
1829 return longest_to_int (value_as_long (value_binop (arg1
, arg2
,
1831 else if ((is_floating_value (arg1
) || is_int1
)
1832 && (is_floating_value (arg2
) || is_int2
))
1834 struct type
*eff_type_v1
, *eff_type_v2
;
1835 gdb::byte_vector v1
, v2
;
1836 v1
.resize (std::max (TYPE_LENGTH (type1
), TYPE_LENGTH (type2
)));
1837 v2
.resize (std::max (TYPE_LENGTH (type1
), TYPE_LENGTH (type2
)));
1839 value_args_as_target_float (arg1
, arg2
,
1840 v1
.data (), &eff_type_v1
,
1841 v2
.data (), &eff_type_v2
);
1843 return target_float_compare (v1
.data (), eff_type_v1
,
1844 v2
.data (), eff_type_v2
) == -1;
1846 else if (code1
== TYPE_CODE_PTR
&& code2
== TYPE_CODE_PTR
)
1847 return value_as_address (arg1
) < value_as_address (arg2
);
1849 /* FIXME: Need to promote to either CORE_ADDR or LONGEST, whichever
1851 else if (code1
== TYPE_CODE_PTR
&& is_int2
)
1852 return value_as_address (arg1
) < (CORE_ADDR
) value_as_long (arg2
);
1853 else if (code2
== TYPE_CODE_PTR
&& is_int1
)
1854 return (CORE_ADDR
) value_as_long (arg1
) < value_as_address (arg2
);
1855 else if (code1
== TYPE_CODE_STRING
&& code2
== TYPE_CODE_STRING
)
1856 return value_strcmp (arg1
, arg2
) < 0;
1859 error (_("Invalid type combination in ordering comparison."));
1864 /* The unary operators +, - and ~. They free the argument ARG1. */
1867 value_pos (struct value
*arg1
)
1871 arg1
= coerce_ref (arg1
);
1872 type
= check_typedef (value_type (arg1
));
1874 if (is_integral_type (type
) || is_floating_value (arg1
)
1875 || (type
->code () == TYPE_CODE_ARRAY
&& type
->is_vector ())
1876 || type
->code () == TYPE_CODE_COMPLEX
)
1877 return value_from_contents (type
, value_contents (arg1
).data ());
1879 error (_("Argument to positive operation not a number."));
1883 value_neg (struct value
*arg1
)
1887 arg1
= coerce_ref (arg1
);
1888 type
= check_typedef (value_type (arg1
));
1890 if (is_integral_type (type
) || is_floating_type (type
))
1891 return value_binop (value_from_longest (type
, 0), arg1
, BINOP_SUB
);
1892 else if (is_fixed_point_type (type
))
1893 return value_binop (value_zero (type
, not_lval
), arg1
, BINOP_SUB
);
1894 else if (type
->code () == TYPE_CODE_ARRAY
&& type
->is_vector ())
1896 struct value
*val
= allocate_value (type
);
1897 struct type
*eltype
= check_typedef (TYPE_TARGET_TYPE (type
));
1899 LONGEST low_bound
, high_bound
;
1901 if (!get_array_bounds (type
, &low_bound
, &high_bound
))
1902 error (_("Could not determine the vector bounds"));
1904 gdb::array_view
<gdb_byte
> val_contents
= value_contents_writeable (val
);
1905 int elt_len
= TYPE_LENGTH (eltype
);
1907 for (i
= 0; i
< high_bound
- low_bound
+ 1; i
++)
1909 value
*tmp
= value_neg (value_subscript (arg1
, i
));
1910 copy (value_contents_all (tmp
),
1911 val_contents
.slice (i
* elt_len
, elt_len
));
1915 else if (type
->code () == TYPE_CODE_COMPLEX
)
1917 struct value
*real
= value_real_part (arg1
);
1918 struct value
*imag
= value_imaginary_part (arg1
);
1920 real
= value_neg (real
);
1921 imag
= value_neg (imag
);
1922 return value_literal_complex (real
, imag
, type
);
1925 error (_("Argument to negate operation not a number."));
1929 value_complement (struct value
*arg1
)
1934 arg1
= coerce_ref (arg1
);
1935 type
= check_typedef (value_type (arg1
));
1937 if (is_integral_type (type
))
1938 val
= value_from_longest (type
, ~value_as_long (arg1
));
1939 else if (type
->code () == TYPE_CODE_ARRAY
&& type
->is_vector ())
1941 struct type
*eltype
= check_typedef (TYPE_TARGET_TYPE (type
));
1943 LONGEST low_bound
, high_bound
;
1945 if (!get_array_bounds (type
, &low_bound
, &high_bound
))
1946 error (_("Could not determine the vector bounds"));
1948 val
= allocate_value (type
);
1949 gdb::array_view
<gdb_byte
> val_contents
= value_contents_writeable (val
);
1950 int elt_len
= TYPE_LENGTH (eltype
);
1952 for (i
= 0; i
< high_bound
- low_bound
+ 1; i
++)
1954 value
*tmp
= value_complement (value_subscript (arg1
, i
));
1955 copy (value_contents_all (tmp
),
1956 val_contents
.slice (i
* elt_len
, elt_len
));
1959 else if (type
->code () == TYPE_CODE_COMPLEX
)
1961 /* GCC has an extension that treats ~complex as the complex
1963 struct value
*real
= value_real_part (arg1
);
1964 struct value
*imag
= value_imaginary_part (arg1
);
1966 imag
= value_neg (imag
);
1967 return value_literal_complex (real
, imag
, type
);
1970 error (_("Argument to complement operation not an integer, boolean."));
1975 /* The INDEX'th bit of SET value whose value_type is TYPE,
1976 and whose value_contents is valaddr.
1977 Return -1 if out of range, -2 other error. */
1980 value_bit_index (struct type
*type
, const gdb_byte
*valaddr
, int index
)
1982 struct gdbarch
*gdbarch
= type
->arch ();
1983 LONGEST low_bound
, high_bound
;
1986 struct type
*range
= type
->index_type ();
1988 if (!get_discrete_bounds (range
, &low_bound
, &high_bound
))
1990 if (index
< low_bound
|| index
> high_bound
)
1992 rel_index
= index
- low_bound
;
1993 word
= extract_unsigned_integer (valaddr
+ (rel_index
/ TARGET_CHAR_BIT
), 1,
1994 type_byte_order (type
));
1995 rel_index
%= TARGET_CHAR_BIT
;
1996 if (gdbarch_byte_order (gdbarch
) == BFD_ENDIAN_BIG
)
1997 rel_index
= TARGET_CHAR_BIT
- 1 - rel_index
;
1998 return (word
>> rel_index
) & 1;
2002 value_in (struct value
*element
, struct value
*set
)
2005 struct type
*settype
= check_typedef (value_type (set
));
2006 struct type
*eltype
= check_typedef (value_type (element
));
2008 if (eltype
->code () == TYPE_CODE_RANGE
)
2009 eltype
= TYPE_TARGET_TYPE (eltype
);
2010 if (settype
->code () != TYPE_CODE_SET
)
2011 error (_("Second argument of 'IN' has wrong type"));
2012 if (eltype
->code () != TYPE_CODE_INT
2013 && eltype
->code () != TYPE_CODE_CHAR
2014 && eltype
->code () != TYPE_CODE_ENUM
2015 && eltype
->code () != TYPE_CODE_BOOL
)
2016 error (_("First argument of 'IN' has wrong type"));
2017 member
= value_bit_index (settype
, value_contents (set
).data (),
2018 value_as_long (element
));
2020 error (_("First argument of 'IN' not in range"));