summaryrefslogtreecommitdiff
path: root/native/fdlibm
diff options
context:
space:
mode:
authorTom Tromey <tromey@redhat.com>2005-05-22 01:44:18 +0000
committerTom Tromey <tromey@redhat.com>2005-05-22 01:44:18 +0000
commitdbda121fb0a8893f03b2095ce755b2967aad36c0 (patch)
tree7cf28e1db86bba14f80c06320ba56309b4d112ca /native/fdlibm
parent1110dcddbaf74330d686e92fbfa988e9ad5a4a1c (diff)
downloadclasspath-dbda121fb0a8893f03b2095ce755b2967aad36c0.tar.gz
2005-05-21 Andreas Jaeger <aj@suse.de>
* java/lang/mprec.c (mult, lshift, b2d, d2b): Add parenthesis to avoid warnings.
Diffstat (limited to 'native/fdlibm')
-rw-r--r--native/fdlibm/mprec.c26
1 files changed, 13 insertions, 13 deletions
diff --git a/native/fdlibm/mprec.c b/native/fdlibm/mprec.c
index b7ec99f35..00679ed39 100644
--- a/native/fdlibm/mprec.c
+++ b/native/fdlibm/mprec.c
@@ -385,7 +385,7 @@ _DEFUN (mult, (ptr, a, b), struct _Jv_reent * ptr _AND _Jv_Bigint * a _AND _Jv_B
#else
for (; xb < xbe; xc0++)
{
- if (y = *xb++)
+ if ((y = *xb++))
{
x = xa;
xc = xc0;
@@ -488,11 +488,11 @@ _DEFUN (lshift, (ptr, b, k), struct _Jv_reent * ptr _AND _Jv_Bigint * b _AND int
z = 0;
do
{
- *x1++ = *x << k & 0xffff | z;
+ *x1++ = (*x << k & 0xffff) | z;
z = *x++ >> k1;
}
while (x < xe);
- if (*x1 = z)
+ if ((*x1 = z))
++n1;
}
#endif
@@ -718,18 +718,18 @@ _DEFUN (b2d, (a, e),
if (k < Ebits + 16)
{
z = xa > xa0 ? *--xa : 0;
- d0 = Exp_1 | y << k - Ebits | z >> Ebits + 16 - k;
+ d0 = Exp_1 | y << (k - Ebits) | z >> (Ebits + 16 - k);
w = xa > xa0 ? *--xa : 0;
y = xa > xa0 ? *--xa : 0;
- d1 = z << k + 16 - Ebits | w << k - Ebits | y >> 16 + Ebits - k;
+ d1 = z << (k + 16 - Ebits) | w << (k - Ebits) | y >> (16 + Ebits - k);
goto ret_d;
}
z = xa > xa0 ? *--xa : 0;
w = xa > xa0 ? *--xa : 0;
k -= Ebits + 16;
- d0 = Exp_1 | y << k + 16 | z << k | w >> 16 - k;
+ d0 = Exp_1 | y << (k + 16) | z << k | w >> (16 - k);
y = xa > xa0 ? *--xa : 0;
- d1 = w << k + 16 | y << k;
+ d1 = w << (k + 16) | y << k;
#endif
ret_d:
#ifdef VAX
@@ -812,22 +812,22 @@ _DEFUN (d2b,
#endif
}
#else
- if (y = d1)
+ if ((y = d1))
{
- if (k = lo0bits (&y))
+ if ((k = lo0bits (&y)))
if (k >= 16)
{
- x[0] = y | z << 32 - k & 0xffff;
- x[1] = z >> k - 16 & 0xffff;
+ x[0] = y | (z << (32 - k) & 0xffff);
+ x[1] = z >> (k - 16) & 0xffff;
x[2] = z >> k;
i = 2;
}
else
{
x[0] = y & 0xffff;
- x[1] = y >> 16 | z << 16 - k & 0xffff;
+ x[1] = (y >> 16 | z << (16 - k)) & 0xffff;
x[2] = z >> k & 0xffff;
- x[3] = z >> k + 16;
+ x[3] = z >> (k + 16);
i = 3;
}
else