X-Git-Url: http://git.efficios.com/?a=blobdiff_plain;f=gdb%2Fvalarith.c;h=6447b48d3b09121eb2a37cccaa305f5d2af31ea5;hb=f5cf64a7277fc62fa3243371962c81fe198db64d;hp=0a3aa4d8e360f0308ed2d92118dfcddecfc9a94f;hpb=1996fae84682e8ddd146215dd2959ad1ec924c09;p=deliverable%2Fbinutils-gdb.git diff --git a/gdb/valarith.c b/gdb/valarith.c index 0a3aa4d8e3..6447b48d3b 100644 --- a/gdb/valarith.c +++ b/gdb/valarith.c @@ -1,22 +1,25 @@ /* Perform arithmetic and other operations on values, for GDB. - Copyright 1986, 89, 91, 92, 93, 94, 95, 96, 97, 1998 - Free Software Foundation, Inc. -This file is part of GDB. + Copyright 1986, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, + 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 Free + Software Foundation, Inc. -This program is free software; you can redistribute it and/or modify -it under the terms of the GNU General Public License as published by -the Free Software Foundation; either version 2 of the License, or -(at your option) any later version. + This file is part of GDB. -This program is distributed in the hope that it will be useful, -but WITHOUT ANY WARRANTY; without even the implied warranty of -MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -GNU General Public License for more details. + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. -You should have received a copy of the GNU General Public License -along with this program; if not, write to the Free Software -Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 59 Temple Place - Suite 330, + Boston, MA 02111-1307, USA. */ #include "defs.h" #include "value.h" @@ -25,8 +28,10 @@ Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ #include "expression.h" #include "target.h" #include "language.h" -#include "demangle.h" #include "gdb_string.h" +#include "doublest.h" +#include +#include "infcall.h" /* Define whether or not the C operator '/' truncates towards zero for differently signed operands (truncation direction is undefined in C). */ @@ -35,32 +40,69 @@ Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2) #endif -static value_ptr value_subscripted_rvalue PARAMS ((value_ptr, value_ptr, int)); - -void _initialize_valarith PARAMS ((void)); +static struct value *value_subscripted_rvalue (struct value *, struct value *, int); +void _initialize_valarith (void); -value_ptr -value_add (arg1, arg2) - value_ptr arg1, arg2; + +/* Given a pointer, return the size of its target. + If the pointer type is void *, then return 1. + If the target type is incomplete, then error out. + This isn't a general purpose function, but just a + helper for value_sub & value_add. +*/ + +static LONGEST +find_size_for_pointer_math (struct type *ptr_type) +{ + LONGEST sz = -1; + struct type *ptr_target; + + ptr_target = check_typedef (TYPE_TARGET_TYPE (ptr_type)); + + sz = TYPE_LENGTH (ptr_target); + if (sz == 0) + { + if (TYPE_CODE (ptr_type) == TYPE_CODE_VOID) + sz = 1; + else + { + char *name; + + name = TYPE_NAME (ptr_target); + if (name == NULL) + name = TYPE_TAG_NAME (ptr_target); + if (name == NULL) + error ("Cannot perform pointer math on incomplete types, " + "try casting to a known type, or void *."); + else + error ("Cannot perform pointer math on incomplete type \"%s\", " + "try casting to a known type, or void *.", name); + } + } + return sz; +} + +struct value * +value_add (struct value *arg1, struct value *arg2) { - register value_ptr valint, valptr; - register int len; + struct value *valint; + struct value *valptr; + LONGEST sz; struct type *type1, *type2, *valptrtype; - COERCE_NUMBER (arg1); - COERCE_NUMBER (arg2); - type1 = check_typedef (VALUE_TYPE (arg1)); - type2 = check_typedef (VALUE_TYPE (arg2)); + arg1 = coerce_array (arg1); + arg2 = coerce_array (arg2); + type1 = check_typedef (value_type (arg1)); + type2 = check_typedef (value_type (arg2)); if ((TYPE_CODE (type1) == TYPE_CODE_PTR || TYPE_CODE (type2) == TYPE_CODE_PTR) && - (TYPE_CODE (type1) == TYPE_CODE_INT - || TYPE_CODE (type2) == TYPE_CODE_INT)) + (is_integral_type (type1) || is_integral_type (type2))) /* Exactly one argument is a pointer, and one is an integer. */ { - value_ptr retval; + struct value *retval; if (TYPE_CODE (type1) == TYPE_CODE_PTR) { @@ -74,47 +116,46 @@ value_add (arg1, arg2) valint = arg1; valptrtype = type2; } - len = TYPE_LENGTH (check_typedef (TYPE_TARGET_TYPE (valptrtype))); - if (len == 0) - len = 1; /* For (void *) */ - retval = value_from_longest (valptrtype, - value_as_long (valptr) - + (len * value_as_long (valint))); - VALUE_BFD_SECTION (retval) = VALUE_BFD_SECTION (valptr); + + sz = find_size_for_pointer_math (valptrtype); + + retval = value_from_pointer (valptrtype, + value_as_address (valptr) + + (sz * value_as_long (valint))); return retval; } return value_binop (arg1, arg2, BINOP_ADD); } -value_ptr -value_sub (arg1, arg2) - value_ptr arg1, arg2; +struct value * +value_sub (struct value *arg1, struct value *arg2) { struct type *type1, *type2; - COERCE_NUMBER (arg1); - COERCE_NUMBER (arg2); - type1 = check_typedef (VALUE_TYPE (arg1)); - type2 = check_typedef (VALUE_TYPE (arg2)); + arg1 = coerce_array (arg1); + arg2 = coerce_array (arg2); + type1 = check_typedef (value_type (arg1)); + type2 = check_typedef (value_type (arg2)); if (TYPE_CODE (type1) == TYPE_CODE_PTR) { - if (TYPE_CODE (type2) == TYPE_CODE_INT) + if (is_integral_type (type2)) { /* pointer - integer. */ - LONGEST sz = TYPE_LENGTH (check_typedef (TYPE_TARGET_TYPE (type1))); - return value_from_longest - (VALUE_TYPE (arg1), - value_as_long (arg1) - (sz * value_as_long (arg2))); + LONGEST sz = find_size_for_pointer_math (type1); + + return value_from_pointer (type1, + (value_as_address (arg1) + - (sz * value_as_long (arg2)))); } else if (TYPE_CODE (type2) == TYPE_CODE_PTR - && TYPE_LENGTH (TYPE_TARGET_TYPE (type1)) - == TYPE_LENGTH (TYPE_TARGET_TYPE (type2))) + && TYPE_LENGTH (check_typedef (TYPE_TARGET_TYPE (type1))) + == TYPE_LENGTH (check_typedef (TYPE_TARGET_TYPE (type2)))) { /* pointer to - pointer to . */ LONGEST sz = TYPE_LENGTH (check_typedef (TYPE_TARGET_TYPE (type1))); return value_from_longest - (builtin_type_long, /* FIXME -- should be ptrdiff_t */ + (builtin_type_long, /* FIXME -- should be ptrdiff_t */ (value_as_long (arg1) - value_as_long (arg2)) / sz); } else @@ -134,17 +175,15 @@ an integer nor a pointer of the same type."); FIXME: Perhaps we should validate that the index is valid and if verbosity is set, warn about invalid indices (but still use them). */ -value_ptr -value_subscript (array, idx) - value_ptr array, idx; +struct value * +value_subscript (struct value *array, struct value *idx) { - value_ptr bound; + struct value *bound; int c_style = current_language->c_style_arrays; struct type *tarray; - COERCE_REF (array); - tarray = check_typedef (VALUE_TYPE (array)); - COERCE_VARYING_ARRAY (array, tarray); + array = coerce_ref (array); + tarray = check_typedef (value_type (array)); if (TYPE_CODE (tarray) == TYPE_CODE_ARRAY || TYPE_CODE (tarray) == TYPE_CODE_STRING) @@ -161,7 +200,10 @@ value_subscript (array, idx) LONGEST index = value_as_long (idx); if (index >= lowerbound && index <= upperbound) return value_subscripted_rvalue (array, idx, lowerbound); - warning ("array or string index out of range"); + /* Emit warning unless we have an array of unknown size. + An array of unknown size has lowerbound 0 and upperbound -1. */ + if (upperbound > -1) + warning ("array or string index out of range"); /* fall doing C stuff */ c_style = 1; } @@ -179,7 +221,7 @@ value_subscript (array, idx) { struct type *range_type = TYPE_INDEX_TYPE (tarray); LONGEST index = value_as_long (idx); - value_ptr v; + struct value *v; int offset, byte, bit_index; LONGEST lowerbound, upperbound; get_discrete_bounds (range_type, &lowerbound, &upperbound); @@ -187,17 +229,18 @@ value_subscript (array, idx) error ("bitstring index out of range"); index -= lowerbound; offset = index / TARGET_CHAR_BIT; - byte = *((char*)VALUE_CONTENTS (array) + offset); + byte = *((char *) value_contents (array) + offset); bit_index = index % TARGET_CHAR_BIT; byte >>= (BITS_BIG_ENDIAN ? TARGET_CHAR_BIT - 1 - bit_index : bit_index); v = value_from_longest (LA_BOOL_TYPE, byte & 1); - VALUE_BITPOS (v) = bit_index; - VALUE_BITSIZE (v) = 1; + v->bitpos = bit_index; + v->bitsize = 1; VALUE_LVAL (v) = VALUE_LVAL (array); if (VALUE_LVAL (array) == lval_internalvar) VALUE_LVAL (v) = lval_internalvar_component; VALUE_ADDRESS (v) = VALUE_ADDRESS (array); - VALUE_OFFSET (v) = offset + VALUE_OFFSET (array); + VALUE_FRAME_ID (v) = VALUE_FRAME_ID (array); + set_value_offset (v, offset + value_offset (array)); return v; } @@ -211,33 +254,34 @@ value_subscript (array, idx) (eg, a vector register). This routine used to promote floats to doubles, but no longer does. */ -static value_ptr -value_subscripted_rvalue (array, idx, lowerbound) - value_ptr array, idx; - int lowerbound; +static struct value * +value_subscripted_rvalue (struct value *array, struct value *idx, int lowerbound) { - struct type *array_type = check_typedef (VALUE_TYPE (array)); + struct type *array_type = check_typedef (value_type (array)); struct type *elt_type = check_typedef (TYPE_TARGET_TYPE (array_type)); unsigned int elt_size = TYPE_LENGTH (elt_type); LONGEST index = value_as_long (idx); unsigned int elt_offs = elt_size * longest_to_int (index - lowerbound); - value_ptr v; + struct value *v; if (index < lowerbound || elt_offs >= TYPE_LENGTH (array_type)) error ("no such vector element"); v = allocate_value (elt_type); - if (VALUE_LAZY (array)) - VALUE_LAZY (v) = 1; + if (value_lazy (array)) + set_value_lazy (v, 1); else - memcpy (VALUE_CONTENTS (v), VALUE_CONTENTS (array) + elt_offs, elt_size); + memcpy (value_contents_writeable (v), + value_contents (array) + elt_offs, elt_size); if (VALUE_LVAL (array) == lval_internalvar) VALUE_LVAL (v) = lval_internalvar_component; else VALUE_LVAL (v) = VALUE_LVAL (array); VALUE_ADDRESS (v) = VALUE_ADDRESS (array); - VALUE_OFFSET (v) = VALUE_OFFSET (array) + elt_offs; + VALUE_REGNUM (v) = VALUE_REGNUM (array); + VALUE_FRAME_ID (v) = VALUE_FRAME_ID (array); + set_value_offset (v, value_offset (array) + elt_offs); return v; } @@ -248,15 +292,13 @@ value_subscripted_rvalue (array, idx, lowerbound) For now, we do not overload the `=' operator. */ int -binop_user_defined_p (op, arg1, arg2) - enum exp_opcode op; - value_ptr arg1, arg2; +binop_user_defined_p (enum exp_opcode op, struct value *arg1, struct value *arg2) { struct type *type1, *type2; if (op == BINOP_ASSIGN || op == BINOP_CONCAT) return 0; - type1 = check_typedef (VALUE_TYPE (arg1)); - type2 = check_typedef (VALUE_TYPE (arg2)); + type1 = check_typedef (value_type (arg1)); + type2 = check_typedef (value_type (arg2)); return (TYPE_CODE (type1) == TYPE_CODE_STRUCT || TYPE_CODE (type2) == TYPE_CODE_STRUCT || (TYPE_CODE (type1) == TYPE_CODE_REF @@ -271,14 +313,13 @@ binop_user_defined_p (op, arg1, arg2) For now, we do not overload the `&' operator. */ -int unop_user_defined_p (op, arg1) - enum exp_opcode op; - value_ptr arg1; +int +unop_user_defined_p (enum exp_opcode op, struct value *arg1) { struct type *type1; if (op == UNOP_ADDR) return 0; - type1 = check_typedef (VALUE_TYPE (arg1)); + type1 = check_typedef (value_type (arg1)); for (;;) { if (TYPE_CODE (type1) == TYPE_CODE_STRUCT) @@ -299,83 +340,141 @@ int unop_user_defined_p (op, arg1) is the opcode saying how to modify it. Otherwise, OTHEROP is unused. */ -value_ptr -value_x_binop (arg1, arg2, op, otherop, noside) - value_ptr arg1, arg2; - enum exp_opcode op, otherop; - enum noside noside; +struct value * +value_x_binop (struct value *arg1, struct value *arg2, enum exp_opcode op, + enum exp_opcode otherop, enum noside noside) { - value_ptr * argvec; + struct value **argvec; char *ptr; char tstr[13]; int static_memfuncp; - COERCE_REF (arg1); - COERCE_REF (arg2); - COERCE_ENUM (arg1); - COERCE_ENUM (arg2); + arg1 = coerce_ref (arg1); + arg2 = coerce_ref (arg2); + arg1 = coerce_enum (arg1); + arg2 = coerce_enum (arg2); /* now we know that what we have to do is construct our arg vector and find the right function to call it with. */ - if (TYPE_CODE (check_typedef (VALUE_TYPE (arg1))) != TYPE_CODE_STRUCT) - error ("Can't do that binary op on that type"); /* FIXME be explicit */ + if (TYPE_CODE (check_typedef (value_type (arg1))) != TYPE_CODE_STRUCT) + error ("Can't do that binary op on that type"); /* FIXME be explicit */ - argvec = (value_ptr *) alloca (sizeof (value_ptr) * 4); + argvec = (struct value **) alloca (sizeof (struct value *) * 4); argvec[1] = value_addr (arg1); argvec[2] = arg2; argvec[3] = 0; - /* make the right function name up */ - strcpy(tstr, "operator__"); - ptr = tstr+8; + /* make the right function name up */ + strcpy (tstr, "operator__"); + ptr = tstr + 8; switch (op) { - case BINOP_ADD: strcpy(ptr,"+"); break; - case BINOP_SUB: strcpy(ptr,"-"); break; - case BINOP_MUL: strcpy(ptr,"*"); break; - case BINOP_DIV: strcpy(ptr,"/"); break; - case BINOP_REM: strcpy(ptr,"%"); break; - case BINOP_LSH: strcpy(ptr,"<<"); break; - case BINOP_RSH: strcpy(ptr,">>"); break; - case BINOP_BITWISE_AND: strcpy(ptr,"&"); break; - case BINOP_BITWISE_IOR: strcpy(ptr,"|"); break; - case BINOP_BITWISE_XOR: strcpy(ptr,"^"); break; - case BINOP_LOGICAL_AND: strcpy(ptr,"&&"); break; - case BINOP_LOGICAL_OR: strcpy(ptr,"||"); break; - case BINOP_MIN: strcpy(ptr,"?"); break; - case BINOP_ASSIGN: strcpy(ptr,"="); break; - case BINOP_ASSIGN_MODIFY: + case BINOP_ADD: + strcpy (ptr, "+"); + break; + case BINOP_SUB: + strcpy (ptr, "-"); + break; + case BINOP_MUL: + strcpy (ptr, "*"); + break; + case BINOP_DIV: + strcpy (ptr, "/"); + break; + case BINOP_REM: + strcpy (ptr, "%"); + break; + case BINOP_LSH: + strcpy (ptr, "<<"); + break; + case BINOP_RSH: + strcpy (ptr, ">>"); + break; + case BINOP_BITWISE_AND: + strcpy (ptr, "&"); + break; + case BINOP_BITWISE_IOR: + strcpy (ptr, "|"); + break; + case BINOP_BITWISE_XOR: + strcpy (ptr, "^"); + break; + case BINOP_LOGICAL_AND: + strcpy (ptr, "&&"); + break; + case BINOP_LOGICAL_OR: + strcpy (ptr, "||"); + break; + case BINOP_MIN: + strcpy (ptr, "?"); + break; + case BINOP_ASSIGN: + strcpy (ptr, "="); + break; + case BINOP_ASSIGN_MODIFY: switch (otherop) { - case BINOP_ADD: strcpy(ptr,"+="); break; - case BINOP_SUB: strcpy(ptr,"-="); break; - case BINOP_MUL: strcpy(ptr,"*="); break; - case BINOP_DIV: strcpy(ptr,"/="); break; - case BINOP_REM: strcpy(ptr,"%="); break; - case BINOP_BITWISE_AND: strcpy(ptr,"&="); break; - case BINOP_BITWISE_IOR: strcpy(ptr,"|="); break; - case BINOP_BITWISE_XOR: strcpy(ptr,"^="); break; - case BINOP_MOD: /* invalid */ + case BINOP_ADD: + strcpy (ptr, "+="); + break; + case BINOP_SUB: + strcpy (ptr, "-="); + break; + case BINOP_MUL: + strcpy (ptr, "*="); + break; + case BINOP_DIV: + strcpy (ptr, "/="); + break; + case BINOP_REM: + strcpy (ptr, "%="); + break; + case BINOP_BITWISE_AND: + strcpy (ptr, "&="); + break; + case BINOP_BITWISE_IOR: + strcpy (ptr, "|="); + break; + case BINOP_BITWISE_XOR: + strcpy (ptr, "^="); + break; + case BINOP_MOD: /* invalid */ default: error ("Invalid binary operation specified."); } break; - case BINOP_SUBSCRIPT: strcpy(ptr,"[]"); break; - case BINOP_EQUAL: strcpy(ptr,"=="); break; - case BINOP_NOTEQUAL: strcpy(ptr,"!="); break; - case BINOP_LESS: strcpy(ptr,"<"); break; - case BINOP_GTR: strcpy(ptr,">"); break; - case BINOP_GEQ: strcpy(ptr,">="); break; - case BINOP_LEQ: strcpy(ptr,"<="); break; - case BINOP_MOD: /* invalid */ + case BINOP_SUBSCRIPT: + strcpy (ptr, "[]"); + break; + case BINOP_EQUAL: + strcpy (ptr, "=="); + break; + case BINOP_NOTEQUAL: + strcpy (ptr, "!="); + break; + case BINOP_LESS: + strcpy (ptr, "<"); + break; + case BINOP_GTR: + strcpy (ptr, ">"); + break; + case BINOP_GEQ: + strcpy (ptr, ">="); + break; + case BINOP_LEQ: + strcpy (ptr, "<="); + break; + case BINOP_MOD: /* invalid */ default: error ("Invalid binary operation specified."); } - argvec[0] = value_struct_elt (&arg1, argvec+1, tstr, &static_memfuncp, "structure"); - + argvec[0] = value_struct_elt (&arg1, argvec + 1, tstr, &static_memfuncp, "structure"); + if (argvec[0]) { if (static_memfuncp) @@ -387,7 +486,7 @@ value_x_binop (arg1, arg2, op, otherop, noside) { struct type *return_type; return_type - = TYPE_TARGET_TYPE (check_typedef (VALUE_TYPE (argvec[0]))); + = TYPE_TARGET_TYPE (check_typedef (value_type (argvec[0]))); return value_zero (return_type, VALUE_LVAL (arg1)); } return call_function_by_hand (argvec[0], 2 - static_memfuncp, argvec + 1); @@ -404,107 +503,127 @@ value_x_binop (arg1, arg2, op, otherop, noside) and return that value (where '@' is (almost) any unary operator which is legal for GNU C++). */ -value_ptr -value_x_unop (arg1, op, noside) - value_ptr arg1; - enum exp_opcode op; - enum noside noside; +struct value * +value_x_unop (struct value *arg1, enum exp_opcode op, enum noside noside) { - value_ptr * argvec; + struct value **argvec; char *ptr, *mangle_ptr; char tstr[13], mangle_tstr[13]; - int static_memfuncp; + int static_memfuncp, nargs; - COERCE_REF (arg1); - COERCE_ENUM (arg1); + arg1 = coerce_ref (arg1); + arg1 = coerce_enum (arg1); /* now we know that what we have to do is construct our arg vector and find the right function to call it with. */ - if (TYPE_CODE (check_typedef (VALUE_TYPE (arg1))) != TYPE_CODE_STRUCT) - error ("Can't do that unary op on that type"); /* FIXME be explicit */ + if (TYPE_CODE (check_typedef (value_type (arg1))) != TYPE_CODE_STRUCT) + error ("Can't do that unary op on that type"); /* FIXME be explicit */ - argvec = (value_ptr *) alloca (sizeof (value_ptr) * 3); + argvec = (struct value **) alloca (sizeof (struct value *) * 4); argvec[1] = value_addr (arg1); argvec[2] = 0; - /* make the right function name up */ - strcpy(tstr,"operator__"); - ptr = tstr+8; - strcpy(mangle_tstr, "__"); - mangle_ptr = mangle_tstr+2; + nargs = 1; + + /* make the right function name up */ + strcpy (tstr, "operator__"); + ptr = tstr + 8; + strcpy (mangle_tstr, "__"); + mangle_ptr = mangle_tstr + 2; switch (op) { - case UNOP_PREINCREMENT: strcpy(ptr,"++"); break; - case UNOP_PREDECREMENT: strcpy(ptr,"++"); break; - case UNOP_POSTINCREMENT: strcpy(ptr,"++"); break; - case UNOP_POSTDECREMENT: strcpy(ptr,"++"); break; - case UNOP_LOGICAL_NOT: strcpy(ptr,"!"); break; - case UNOP_COMPLEMENT: strcpy(ptr,"~"); break; - case UNOP_NEG: strcpy(ptr,"-"); break; - case UNOP_IND: strcpy(ptr,"*"); break; + case UNOP_PREINCREMENT: + strcpy (ptr, "++"); + break; + case UNOP_PREDECREMENT: + strcpy (ptr, "--"); + break; + case UNOP_POSTINCREMENT: + strcpy (ptr, "++"); + argvec[2] = value_from_longest (builtin_type_int, 0); + argvec[3] = 0; + nargs ++; + break; + case UNOP_POSTDECREMENT: + strcpy (ptr, "--"); + argvec[2] = value_from_longest (builtin_type_int, 0); + argvec[3] = 0; + nargs ++; + break; + case UNOP_LOGICAL_NOT: + strcpy (ptr, "!"); + break; + case UNOP_COMPLEMENT: + strcpy (ptr, "~"); + break; + case UNOP_NEG: + strcpy (ptr, "-"); + break; + case UNOP_IND: + strcpy (ptr, "*"); + break; default: error ("Invalid unary operation specified."); } - argvec[0] = value_struct_elt (&arg1, argvec+1, tstr, &static_memfuncp, "structure"); + argvec[0] = value_struct_elt (&arg1, argvec + 1, tstr, &static_memfuncp, "structure"); if (argvec[0]) { if (static_memfuncp) { argvec[1] = argvec[0]; + nargs --; argvec++; } if (noside == EVAL_AVOID_SIDE_EFFECTS) { struct type *return_type; return_type - = TYPE_TARGET_TYPE (check_typedef (VALUE_TYPE (argvec[0]))); + = TYPE_TARGET_TYPE (check_typedef (value_type (argvec[0]))); return value_zero (return_type, VALUE_LVAL (arg1)); } - return call_function_by_hand (argvec[0], 1 - static_memfuncp, argvec + 1); + return call_function_by_hand (argvec[0], nargs, argvec + 1); } error ("member function %s not found", tstr); - return 0; /* For lint -- never reached */ + return 0; /* For lint -- never reached */ } - + /* Concatenate two values with the following conditions: - (1) Both values must be either bitstring values or character string - values and the resulting value consists of the concatenation of - ARG1 followed by ARG2. + (1) Both values must be either bitstring values or character string + values and the resulting value consists of the concatenation of + ARG1 followed by ARG2. - or + or - One value must be an integer value and the other value must be - either a bitstring value or character string value, which is - to be repeated by the number of times specified by the integer - value. + One value must be an integer value and the other value must be + either a bitstring value or character string value, which is + to be repeated by the number of times specified by the integer + value. - (2) Boolean values are also allowed and are treated as bit string - values of length 1. + (2) Boolean values are also allowed and are treated as bit string + values of length 1. - (3) Character values are also allowed and are treated as character - string values of length 1. -*/ + (3) Character values are also allowed and are treated as character + string values of length 1. + */ -value_ptr -value_concat (arg1, arg2) - value_ptr arg1, arg2; +struct value * +value_concat (struct value *arg1, struct value *arg2) { - register value_ptr inval1, inval2, outval; + struct value *inval1; + struct value *inval2; + struct value *outval = NULL; int inval1len, inval2len; int count, idx; char *ptr; char inchar; - struct type *type1 = check_typedef (VALUE_TYPE (arg1)); - struct type *type2 = check_typedef (VALUE_TYPE (arg2)); - - COERCE_VARYING_ARRAY (arg1, type1); - COERCE_VARYING_ARRAY (arg2, type2); + struct type *type1 = check_typedef (value_type (arg1)); + struct type *type2 = check_typedef (value_type (arg2)); /* First figure out if we are dealing with two values to be concatenated or a repeat count and a value to be repeated. INVAL1 is set to the @@ -531,7 +650,7 @@ value_concat (arg1, arg2) if (TYPE_CODE (type1) == TYPE_CODE_INT) { /* We have a repeat count. Validate the second value and then - construct a value repeated that many times. */ + construct a value repeated that many times. */ if (TYPE_CODE (type2) == TYPE_CODE_STRING || TYPE_CODE (type2) == TYPE_CODE_CHAR) { @@ -541,7 +660,7 @@ value_concat (arg1, arg2) if (TYPE_CODE (type2) == TYPE_CODE_CHAR) { inchar = (char) unpack_long (type2, - VALUE_CONTENTS (inval2)); + value_contents (inval2)); for (idx = 0; idx < count; idx++) { *(ptr + idx) = inchar; @@ -551,7 +670,7 @@ value_concat (arg1, arg2) { for (idx = 0; idx < count; idx++) { - memcpy (ptr + (idx * inval2len), VALUE_CONTENTS (inval2), + memcpy (ptr + (idx * inval2len), value_contents (inval2), inval2len); } } @@ -568,7 +687,7 @@ value_concat (arg1, arg2) } } else if (TYPE_CODE (type1) == TYPE_CODE_STRING - || TYPE_CODE (type1) == TYPE_CODE_CHAR) + || TYPE_CODE (type1) == TYPE_CODE_CHAR) { /* We have two character strings to concatenate. */ if (TYPE_CODE (type2) != TYPE_CODE_STRING @@ -581,20 +700,20 @@ value_concat (arg1, arg2) ptr = (char *) alloca (inval1len + inval2len); if (TYPE_CODE (type1) == TYPE_CODE_CHAR) { - *ptr = (char) unpack_long (type1, VALUE_CONTENTS (inval1)); + *ptr = (char) unpack_long (type1, value_contents (inval1)); } else { - memcpy (ptr, VALUE_CONTENTS (inval1), inval1len); + memcpy (ptr, value_contents (inval1), inval1len); } if (TYPE_CODE (type2) == TYPE_CODE_CHAR) { - *(ptr + inval1len) = - (char) unpack_long (type2, VALUE_CONTENTS (inval2)); + *(ptr + inval1len) = + (char) unpack_long (type2, value_contents (inval2)); } else { - memcpy (ptr + inval1len, VALUE_CONTENTS (inval2), inval2len); + memcpy (ptr + inval1len, value_contents (inval2), inval2len); } outval = value_string (ptr, inval1len + inval2len); } @@ -608,7 +727,7 @@ value_concat (arg1, arg2) error ("Bitstrings or booleans can only be concatenated with other bitstrings or booleans."); } error ("unimplemented support for bitstring/boolean concatenation."); - } + } else { /* We don't know how to concatenate these operands. */ @@ -616,41 +735,29 @@ value_concat (arg1, arg2) } return (outval); } - + /* Perform a binary operation on two operands which have reasonable representations as integers or floats. This includes booleans, characters, integers, or floats. Does not support addition and subtraction on pointers; use value_add or value_sub if you want to handle those possibilities. */ -value_ptr -value_binop (arg1, arg2, op) - value_ptr arg1, arg2; - enum exp_opcode op; +struct value * +value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op) { - register value_ptr val; + struct value *val; struct type *type1, *type2; - COERCE_REF (arg1); - COERCE_REF (arg2); - COERCE_ENUM (arg1); - COERCE_ENUM (arg2); - type1 = check_typedef (VALUE_TYPE (arg1)); - type2 = check_typedef (VALUE_TYPE (arg2)); - - if ((TYPE_CODE (type1) != TYPE_CODE_FLT - && TYPE_CODE (type1) != TYPE_CODE_CHAR - && TYPE_CODE (type1) != TYPE_CODE_INT - && TYPE_CODE (type1) != TYPE_CODE_BOOL - && TYPE_CODE (type1) != TYPE_CODE_RANGE) + arg1 = coerce_ref (arg1); + arg2 = coerce_ref (arg2); + type1 = check_typedef (value_type (arg1)); + type2 = check_typedef (value_type (arg2)); + + if ((TYPE_CODE (type1) != TYPE_CODE_FLT && !is_integral_type (type1)) || - (TYPE_CODE (type2) != TYPE_CODE_FLT - && TYPE_CODE (type2) != TYPE_CODE_CHAR - && TYPE_CODE (type2) != TYPE_CODE_INT - && TYPE_CODE (type2) != TYPE_CODE_BOOL - && TYPE_CODE (type2) != TYPE_CODE_RANGE)) + (TYPE_CODE (type2) != TYPE_CODE_FLT && !is_integral_type (type2))) error ("Argument to arithmetic operation not a number or boolean."); if (TYPE_CODE (type1) == TYPE_CODE_FLT @@ -658,9 +765,9 @@ value_binop (arg1, arg2, op) TYPE_CODE (type2) == TYPE_CODE_FLT) { /* FIXME-if-picky-about-floating-accuracy: Should be doing this - in target format. real.c in GCC probably has the necessary - code. */ - DOUBLEST v1, v2, v; + in target format. real.c in GCC probably has the necessary + code. */ + DOUBLEST v1, v2, v = 0; v1 = value_as_double (arg1); v2 = value_as_double (arg2); switch (op) @@ -681,58 +788,71 @@ value_binop (arg1, arg2, op) v = v1 / v2; break; + case BINOP_EXP: + v = pow (v1, v2); + if (errno) + error ("Cannot perform exponentiation: %s", safe_strerror (errno)); + break; + default: error ("Integer-only operation on floating point number."); } /* If either arg was long double, make sure that value is also long - double. */ + double. */ - if (TYPE_LENGTH(type1) * 8 > TARGET_DOUBLE_BIT - || TYPE_LENGTH(type2) * 8 > TARGET_DOUBLE_BIT) + if (TYPE_LENGTH (type1) * 8 > TARGET_DOUBLE_BIT + || TYPE_LENGTH (type2) * 8 > TARGET_DOUBLE_BIT) val = allocate_value (builtin_type_long_double); else val = allocate_value (builtin_type_double); - store_floating (VALUE_CONTENTS_RAW (val), TYPE_LENGTH (VALUE_TYPE (val)), - v); + store_typed_floating (value_contents_raw (val), value_type (val), v); } else if (TYPE_CODE (type1) == TYPE_CODE_BOOL && TYPE_CODE (type2) == TYPE_CODE_BOOL) - { - LONGEST v1, v2, v; - v1 = value_as_long (arg1); - v2 = value_as_long (arg2); - - switch (op) - { - case BINOP_BITWISE_AND: - v = v1 & v2; - break; - - case BINOP_BITWISE_IOR: - v = v1 | v2; - break; - - case BINOP_BITWISE_XOR: - v = v1 ^ v2; - break; - - default: - error ("Invalid operation on booleans."); - } - - val = allocate_value (type1); - store_signed_integer (VALUE_CONTENTS_RAW (val), - TYPE_LENGTH (type1), - v); - } + { + LONGEST v1, v2, v = 0; + v1 = value_as_long (arg1); + v2 = value_as_long (arg2); + + switch (op) + { + case BINOP_BITWISE_AND: + v = v1 & v2; + break; + + case BINOP_BITWISE_IOR: + v = v1 | v2; + break; + + case BINOP_BITWISE_XOR: + v = v1 ^ v2; + break; + + case BINOP_EQUAL: + v = v1 == v2; + break; + + case BINOP_NOTEQUAL: + v = v1 != v2; + break; + + default: + error ("Invalid operation on booleans."); + } + + val = allocate_value (type1); + store_signed_integer (value_contents_raw (val), + TYPE_LENGTH (type1), + v); + } else /* Integral operations here. */ /* FIXME: Also mixed integral/booleans, with result an integer. */ /* FIXME: This implements ANSI C rules (also correct for C++). - What about FORTRAN and chill? */ + What about FORTRAN and (the deleted) chill ? */ { unsigned int promoted_len1 = TYPE_LENGTH (type1); unsigned int promoted_len2 = TYPE_LENGTH (type2); @@ -742,7 +862,7 @@ value_binop (arg1, arg2, op) int unsigned_operation; /* Determine type length and signedness after promotion for - both operands. */ + both operands. */ if (promoted_len1 < TYPE_LENGTH (builtin_type_int)) { is_unsigned1 = 0; @@ -755,10 +875,10 @@ value_binop (arg1, arg2, op) } /* Determine type length of the result, and if the operation should - be done unsigned. - Use the signedness of the operand with the greater length. - If both operands are of equal length, use unsigned operation - if one of the operands is unsigned. */ + be done unsigned. + Use the signedness of the operand with the greater length. + If both operands are of equal length, use unsigned operation + if one of the operands is unsigned. */ if (promoted_len1 > promoted_len2) { unsigned_operation = is_unsigned1; @@ -777,7 +897,7 @@ value_binop (arg1, arg2, op) if (unsigned_operation) { - ULONGEST v1, v2, v; + ULONGEST v1, v2, v = 0; v1 = (ULONGEST) value_as_long (arg1); v2 = (ULONGEST) value_as_long (arg2); @@ -787,82 +907,82 @@ value_binop (arg1, arg2, op) v1 &= ((LONGEST) 1 << HOST_CHAR_BIT * result_len) - 1; v2 &= ((LONGEST) 1 << HOST_CHAR_BIT * result_len) - 1; } - + switch (op) { case BINOP_ADD: v = v1 + v2; break; - + case BINOP_SUB: v = v1 - v2; break; - + case BINOP_MUL: v = v1 * v2; break; - + case BINOP_DIV: v = v1 / v2; break; - + + case BINOP_EXP: + v = pow (v1, v2); + if (errno) + error ("Cannot perform exponentiation: %s", safe_strerror (errno)); + break; + case BINOP_REM: v = v1 % v2; break; - + case BINOP_MOD: /* Knuth 1.2.4, integer only. Note that unlike the C '%' op, v1 mod 0 has a defined value, v1. */ - /* Chill specifies that v2 must be > 0, so check for that. */ - if (current_language -> la_language == language_chill - && value_as_long (arg2) <= 0) - { - error ("Second operand of MOD must be greater than zero."); - } if (v2 == 0) { v = v1; } else { - v = v1/v2; + v = v1 / v2; /* Note floor(v1/v2) == v1/v2 for unsigned. */ v = v1 - (v2 * v); } break; - + case BINOP_LSH: v = v1 << v2; break; - + case BINOP_RSH: v = v1 >> v2; break; - + case BINOP_BITWISE_AND: v = v1 & v2; break; - + case BINOP_BITWISE_IOR: v = v1 | v2; break; - + case BINOP_BITWISE_XOR: v = v1 ^ v2; break; - + case BINOP_LOGICAL_AND: v = v1 && v2; break; - + case BINOP_LOGICAL_OR: v = v1 || v2; break; - + case BINOP_MIN: v = v1 < v2 ? v1 : v2; break; - + case BINOP_MAX: v = v1 > v2 ? v1 : v2; break; @@ -871,10 +991,14 @@ value_binop (arg1, arg2, op) v = v1 == v2; break; + case BINOP_NOTEQUAL: + v = v1 != v2; + break; + case BINOP_LESS: v = v1 < v2; break; - + default: error ("Invalid binary operation on numbers."); } @@ -892,54 +1016,60 @@ value_binop (arg1, arg2, op) (result_len > TARGET_LONG_BIT / HOST_CHAR_BIT ? builtin_type_unsigned_long_long : builtin_type_unsigned_long); - store_unsigned_integer (VALUE_CONTENTS_RAW (val), - TYPE_LENGTH (VALUE_TYPE (val)), + store_unsigned_integer (value_contents_raw (val), + TYPE_LENGTH (value_type (val)), v); } else { - LONGEST v1, v2, v; + LONGEST v1, v2, v = 0; v1 = value_as_long (arg1); v2 = value_as_long (arg2); - + switch (op) { case BINOP_ADD: v = v1 + v2; break; - + case BINOP_SUB: v = v1 - v2; break; - + case BINOP_MUL: v = v1 * v2; break; - + case BINOP_DIV: - v = v1 / v2; + if (v2 != 0) + v = v1 / v2; + else + error ("Division by zero"); + break; + + case BINOP_EXP: + v = pow (v1, v2); + if (errno) + error ("Cannot perform exponentiation: %s", safe_strerror (errno)); break; - + case BINOP_REM: - v = v1 % v2; + if (v2 != 0) + v = v1 % v2; + else + error ("Division by zero"); break; - + case BINOP_MOD: /* Knuth 1.2.4, integer only. Note that unlike the C '%' op, X mod 0 has a defined value, X. */ - /* Chill specifies that v2 must be > 0, so check for that. */ - if (current_language -> la_language == language_chill - && v2 <= 0) - { - error ("Second operand of MOD must be greater than zero."); - } if (v2 == 0) { v = v1; } else { - v = v1/v2; + v = v1 / v2; /* Compute floor. */ if (TRUNCATION_TOWARDS_ZERO && (v < 0) && ((v1 % v2) != 0)) { @@ -948,39 +1078,39 @@ value_binop (arg1, arg2, op) v = v1 - (v2 * v); } break; - + case BINOP_LSH: v = v1 << v2; break; - + case BINOP_RSH: v = v1 >> v2; break; - + case BINOP_BITWISE_AND: v = v1 & v2; break; - + case BINOP_BITWISE_IOR: v = v1 | v2; break; - + case BINOP_BITWISE_XOR: v = v1 ^ v2; break; - + case BINOP_LOGICAL_AND: v = v1 && v2; break; - + case BINOP_LOGICAL_OR: v = v1 || v2; break; - + case BINOP_MIN: v = v1 < v2 ? v1 : v2; break; - + case BINOP_MAX: v = v1 > v2 ? v1 : v2; break; @@ -992,7 +1122,7 @@ value_binop (arg1, arg2, op) case BINOP_LESS: v = v1 < v2; break; - + default: error ("Invalid binary operation on numbers."); } @@ -1010,8 +1140,8 @@ value_binop (arg1, arg2, op) (result_len > TARGET_LONG_BIT / HOST_CHAR_BIT ? builtin_type_long_long : builtin_type_long); - store_signed_integer (VALUE_CONTENTS_RAW (val), - TYPE_LENGTH (VALUE_TYPE (val)), + store_signed_integer (value_contents_raw (val), + TYPE_LENGTH (value_type (val)), v); } } @@ -1022,21 +1152,20 @@ value_binop (arg1, arg2, op) /* Simulate the C operator ! -- return 1 if ARG1 contains zero. */ int -value_logical_not (arg1) - value_ptr arg1; +value_logical_not (struct value *arg1) { - register int len; - register char *p; + int len; + const bfd_byte *p; struct type *type1; - COERCE_NUMBER (arg1); - type1 = check_typedef (VALUE_TYPE (arg1)); + arg1 = coerce_number (arg1); + type1 = check_typedef (value_type (arg1)); if (TYPE_CODE (type1) == TYPE_CODE_FLT) return 0 == value_as_double (arg1); len = TYPE_LENGTH (type1); - p = VALUE_CONTENTS (arg1); + p = value_contents (arg1); while (--len >= 0) { @@ -1047,49 +1176,80 @@ value_logical_not (arg1) return len < 0; } +/* Perform a comparison on two string values (whose content are not + necessarily null terminated) based on their length */ + +static int +value_strcmp (struct value *arg1, struct value *arg2) +{ + int len1 = TYPE_LENGTH (value_type (arg1)); + int len2 = TYPE_LENGTH (value_type (arg2)); + const bfd_byte *s1 = value_contents (arg1); + const bfd_byte *s2 = value_contents (arg2); + int i, len = len1 < len2 ? len1 : len2; + + for (i = 0; i < len; i++) + { + if (s1[i] < s2[i]) + return -1; + else if (s1[i] > s2[i]) + return 1; + else + continue; + } + + if (len1 < len2) + return -1; + else if (len1 > len2) + return 1; + else + return 0; +} + /* Simulate the C operator == by returning a 1 iff ARG1 and ARG2 have equal contents. */ int -value_equal (arg1, arg2) - register value_ptr arg1, arg2; - +value_equal (struct value *arg1, struct value *arg2) { - register int len; - register char *p1, *p2; + int len; + const bfd_byte *p1; + const bfd_byte *p2; struct type *type1, *type2; enum type_code code1; enum type_code code2; + int is_int1, is_int2; - COERCE_NUMBER (arg1); - COERCE_NUMBER (arg2); + arg1 = coerce_array (arg1); + arg2 = coerce_array (arg2); - type1 = check_typedef (VALUE_TYPE (arg1)); - type2 = check_typedef (VALUE_TYPE (arg2)); + type1 = check_typedef (value_type (arg1)); + type2 = check_typedef (value_type (arg2)); code1 = TYPE_CODE (type1); code2 = TYPE_CODE (type2); + is_int1 = is_integral_type (type1); + is_int2 = is_integral_type (type2); - if ((code1 == TYPE_CODE_INT || code1 == TYPE_CODE_BOOL) && - (code2 == TYPE_CODE_INT || code2 == TYPE_CODE_BOOL)) + if (is_int1 && is_int2) return longest_to_int (value_as_long (value_binop (arg1, arg2, BINOP_EQUAL))); - else if ((code1 == TYPE_CODE_FLT || code1 == TYPE_CODE_INT || code1 == TYPE_CODE_BOOL) - && (code2 == TYPE_CODE_FLT || code2 == TYPE_CODE_INT || code2 == TYPE_CODE_BOOL)) + else if ((code1 == TYPE_CODE_FLT || is_int1) + && (code2 == TYPE_CODE_FLT || is_int2)) return value_as_double (arg1) == value_as_double (arg2); /* FIXME: Need to promote to either CORE_ADDR or LONGEST, whichever is bigger. */ - else if (code1 == TYPE_CODE_PTR && (code2 == TYPE_CODE_INT || code2 == TYPE_CODE_BOOL)) - return value_as_pointer (arg1) == (CORE_ADDR) value_as_long (arg2); - else if (code2 == TYPE_CODE_PTR && (code1 == TYPE_CODE_INT || code1 == TYPE_CODE_BOOL)) - return (CORE_ADDR) value_as_long (arg1) == value_as_pointer (arg2); + else if (code1 == TYPE_CODE_PTR && is_int2) + return value_as_address (arg1) == (CORE_ADDR) value_as_long (arg2); + else if (code2 == TYPE_CODE_PTR && is_int1) + return (CORE_ADDR) value_as_long (arg1) == value_as_address (arg2); else if (code1 == code2 && ((len = (int) TYPE_LENGTH (type1)) == (int) TYPE_LENGTH (type2))) { - p1 = VALUE_CONTENTS (arg1); - p2 = VALUE_CONTENTS (arg2); + p1 = value_contents (arg1); + p2 = value_contents (arg2); while (--len >= 0) { if (*p1++ != *p2++) @@ -1097,10 +1257,14 @@ value_equal (arg1, arg2) } return len < 0; } + else if (code1 == TYPE_CODE_STRING && code2 == TYPE_CODE_STRING) + { + return value_strcmp (arg1, arg2) == 0; + } else { error ("Invalid type combination in equality test."); - return 0; /* For lint -- never reached */ + return 0; /* For lint -- never reached */ } } @@ -1108,38 +1272,40 @@ value_equal (arg1, arg2) iff ARG1's contents are less than ARG2's. */ int -value_less (arg1, arg2) - register value_ptr arg1, arg2; +value_less (struct value *arg1, struct value *arg2) { - register enum type_code code1; - register enum type_code code2; + enum type_code code1; + enum type_code code2; struct type *type1, *type2; + int is_int1, is_int2; - COERCE_NUMBER (arg1); - COERCE_NUMBER (arg2); + arg1 = coerce_array (arg1); + arg2 = coerce_array (arg2); - type1 = check_typedef (VALUE_TYPE (arg1)); - type2 = check_typedef (VALUE_TYPE (arg2)); + type1 = check_typedef (value_type (arg1)); + type2 = check_typedef (value_type (arg2)); code1 = TYPE_CODE (type1); code2 = TYPE_CODE (type2); + is_int1 = is_integral_type (type1); + is_int2 = is_integral_type (type2); - if ((code1 == TYPE_CODE_INT || code1 == TYPE_CODE_BOOL) && - (code2 == TYPE_CODE_INT || code2 == TYPE_CODE_BOOL)) + if (is_int1 && is_int2) return longest_to_int (value_as_long (value_binop (arg1, arg2, BINOP_LESS))); - else if ((code1 == TYPE_CODE_FLT || code1 == TYPE_CODE_INT || code1 == TYPE_CODE_BOOL) - && (code2 == TYPE_CODE_FLT || code2 == TYPE_CODE_INT || code2 == TYPE_CODE_BOOL)) + else if ((code1 == TYPE_CODE_FLT || is_int1) + && (code2 == TYPE_CODE_FLT || is_int2)) return value_as_double (arg1) < value_as_double (arg2); else if (code1 == TYPE_CODE_PTR && code2 == TYPE_CODE_PTR) - return value_as_pointer (arg1) < value_as_pointer (arg2); + return value_as_address (arg1) < value_as_address (arg2); /* FIXME: Need to promote to either CORE_ADDR or LONGEST, whichever is bigger. */ - else if (code1 == TYPE_CODE_PTR && (code2 == TYPE_CODE_INT || code2 == TYPE_CODE_BOOL)) - return value_as_pointer (arg1) < (CORE_ADDR) value_as_long (arg2); - else if (code2 == TYPE_CODE_PTR && (code1 == TYPE_CODE_INT || code1 == TYPE_CODE_BOOL)) - return (CORE_ADDR) value_as_long (arg1) < value_as_pointer (arg2); - + else if (code1 == TYPE_CODE_PTR && is_int2) + return value_as_address (arg1) < (CORE_ADDR) value_as_long (arg2); + else if (code2 == TYPE_CODE_PTR && is_int1) + return (CORE_ADDR) value_as_long (arg1) < value_as_address (arg2); + else if (code1 == TYPE_CODE_STRING && code2 == TYPE_CODE_STRING) + return value_strcmp (arg1, arg2) < 0; else { error ("Invalid type combination in ordering comparison."); @@ -1149,50 +1315,45 @@ value_less (arg1, arg2) /* The unary operators - and ~. Both free the argument ARG1. */ -value_ptr -value_neg (arg1) - register value_ptr arg1; +struct value * +value_neg (struct value *arg1) { - register struct type *type; - register struct type *result_type = VALUE_TYPE (arg1); + struct type *type; + struct type *result_type = value_type (arg1); - COERCE_REF (arg1); - COERCE_ENUM (arg1); + arg1 = coerce_ref (arg1); - type = check_typedef (VALUE_TYPE (arg1)); + type = check_typedef (value_type (arg1)); if (TYPE_CODE (type) == TYPE_CODE_FLT) - return value_from_double (result_type, - value_as_double (arg1)); - else if (TYPE_CODE (type) == TYPE_CODE_INT || TYPE_CODE (type) == TYPE_CODE_BOOL) + return value_from_double (result_type, -value_as_double (arg1)); + else if (is_integral_type (type)) { - /* Perform integral promotion for ANSI C/C++. - FIXME: What about FORTRAN and chill ? */ + /* Perform integral promotion for ANSI C/C++. FIXME: What about + FORTRAN and (the deleted) chill ? */ if (TYPE_LENGTH (type) < TYPE_LENGTH (builtin_type_int)) result_type = builtin_type_int; - return value_from_longest (result_type, - value_as_long (arg1)); + return value_from_longest (result_type, -value_as_long (arg1)); + } + else + { + error ("Argument to negate operation not a number."); + return 0; /* For lint -- never reached */ } - else { - error ("Argument to negate operation not a number."); - return 0; /* For lint -- never reached */ - } } -value_ptr -value_complement (arg1) - register value_ptr arg1; +struct value * +value_complement (struct value *arg1) { - register struct type *type; - register struct type *result_type = VALUE_TYPE (arg1); - int typecode; + struct type *type; + struct type *result_type = value_type (arg1); - COERCE_REF (arg1); - COERCE_ENUM (arg1); + arg1 = coerce_ref (arg1); - type = check_typedef (VALUE_TYPE (arg1)); + type = check_typedef (value_type (arg1)); - typecode = TYPE_CODE (type); - if ((typecode != TYPE_CODE_INT) && (typecode != TYPE_CODE_BOOL)) + if (!is_integral_type (type)) error ("Argument to complement operation not an integer or boolean."); /* Perform integral promotion for ANSI C/C++. @@ -1200,18 +1361,15 @@ value_complement (arg1) if (TYPE_LENGTH (type) < TYPE_LENGTH (builtin_type_int)) result_type = builtin_type_int; - return value_from_longest (result_type, ~ value_as_long (arg1)); + return value_from_longest (result_type, ~value_as_long (arg1)); } -/* The INDEX'th bit of SET value whose VALUE_TYPE is TYPE, - and whose VALUE_CONTENTS is valaddr. +/* The INDEX'th bit of SET value whose value_type is TYPE, + and whose value_contents is valaddr. Return -1 if out of range, -2 other error. */ int -value_bit_index (type, valaddr, index) - struct type *type; - char *valaddr; - int index; +value_bit_index (struct type *type, const bfd_byte *valaddr, int index) { LONGEST low_bound, high_bound; LONGEST word; @@ -1230,13 +1388,12 @@ value_bit_index (type, valaddr, index) return (word >> rel_index) & 1; } -value_ptr -value_in (element, set) - value_ptr element, set; +struct value * +value_in (struct value *element, struct value *set) { int member; - struct type *settype = check_typedef (VALUE_TYPE (set)); - struct type *eltype = check_typedef (VALUE_TYPE (element)); + struct type *settype = check_typedef (value_type (set)); + struct type *eltype = check_typedef (value_type (element)); if (TYPE_CODE (eltype) == TYPE_CODE_RANGE) eltype = TYPE_TARGET_TYPE (eltype); if (TYPE_CODE (settype) != TYPE_CODE_SET) @@ -1246,7 +1403,7 @@ value_in (element, set) && TYPE_CODE (eltype) != TYPE_CODE_ENUM && TYPE_CODE (eltype) != TYPE_CODE_BOOL) error ("First argument of 'IN' has wrong type"); - member = value_bit_index (settype, VALUE_CONTENTS (set), + member = value_bit_index (settype, value_contents (set), value_as_long (element)); if (member < 0) error ("First argument of 'IN' not in range"); @@ -1254,6 +1411,6 @@ value_in (element, set) } void -_initialize_valarith () +_initialize_valarith (void) { }