2013-02-14 Siddhesh Poyarekar <siddhesh@redhat.com>
+ * sysdeps/powerpc/powerpc32/power4/fpu/mpa.c (__cpy): Remove
+ redundant return line.
+ (norm): Likewise.
+ (denorm): Likewise.
+ (dbl_mp): Likewise.
+ (sub_magnitudes): Likewise.
+ (__add): Likewise.
+ (__sub): Likewise.
+ (__mul): Likewise.
+ (__inv): Likewise.
+ (__dvd): Likewise.
+ * sysdeps/powerpc/powerpc64/power4/fpu/mpa.c (__cpy): Likewise.
+ (norm): Likewise.
+ (denorm): Likewise.
+ (dbl_mp): Likewise.
+ (sub_magnitudes): Likewise.
+ (__add): Likewise.
+ (__sub): Likewise.
+ (__mul): Likewise.
+ (__inv): Likewise.
+ (__dvd): Likewise.
+
* sysdeps/ieee754/dbl-64/mpatan.c (__mpatan): Use __sqr
instead of __mul.
* sysdeps/ieee754/dbl-64/mpsqrt.c (__mpsqrt): Likewise.
EY = EX;
for (i = 0; i <= p; i++)
Y[i] = X[i];
-
- return;
}
/* Convert a multiple precision number *X into a double precision
c *= RADIXI;
*y = c;
- return;
#undef R
}
c = X[0] * ((z[1] + R * (z[2] + R * z[3])) - TWO10);
*y = c * TWOM1032;
- return;
-
#undef R
}
}
for (; i <= p2; i++)
Y[i] = ZERO;
- return;
}
/* Add magnitudes of *X and *Y assuming that abs (*X) >= abs (*Y) > 0. The
Z[k++] = Z[i++];
for (; k <= p2;)
Z[k++] = ZERO;
-
- return;
}
/* Add *X and *Y and store the result in *Z. X and Y may overlap, but not X
else
Z[0] = ZERO;
}
- return;
}
/* Subtract *Y from *X and return the result in *Z. X and Y may overlap but
else
Z[0] = ZERO;
}
- return;
}
/* Multiply *X and *Y and store result in *Z. X and Y may overlap but not X
EZ = EX + EY;
Z[0] = X[0] * Y[0];
- return;
}
/* Square *X and store result in *Y. X and Y may not overlap. For P in
__sub (&mptwo, y, &z, p);
__mul (&w, &z, y, p);
}
- return;
}
/* Divide *X by *Y and store result in *Z. X and Y may overlap but not X and Z
__inv (y, &w, p);
__mul (x, &w, z, p);
}
- return;
}
EY = EX;
for (i = 0; i <= p; i++)
Y[i] = X[i];
-
- return;
}
/* Convert a multiple precision number *X into a double precision
c *= RADIXI;
*y = c;
- return;
#undef R
}
c = X[0] * ((z[1] + R * (z[2] + R * z[3])) - TWO10);
*y = c * TWOM1032;
- return;
-
#undef R
}
}
for (; i <= p2; i++)
Y[i] = ZERO;
- return;
}
/* Add magnitudes of *X and *Y assuming that abs (*X) >= abs (*Y) > 0. The
Z[k++] = Z[i++];
for (; k <= p2;)
Z[k++] = ZERO;
-
- return;
}
/* Add *X and *Y and store the result in *Z. X and Y may overlap, but not X
else
Z[0] = ZERO;
}
- return;
}
/* Subtract *Y from *X and return the result in *Z. X and Y may overlap but
else
Z[0] = ZERO;
}
- return;
}
/* Multiply *X and *Y and store result in *Z. X and Y may overlap but not X
EZ = EX + EY;
Z[0] = X[0] * Y[0];
- return;
}
/* Square *X and store result in *Y. X and Y may not overlap. For P in
__sub (&mptwo, y, &z, p);
__mul (&w, &z, y, p);
}
- return;
}
/* Divide *X by *Y and store result in *Z. X and Y may overlap but not X and Z
__inv (y, &w, p);
__mul (x, &w, z, p);
}
- return;
}