mirror of
https://sourceware.org/git/glibc.git
synced 2024-11-25 22:40:05 +00:00
Remove redundant return keyword
This commit is contained in:
parent
f414520d3c
commit
cb57ce6031
22
ChangeLog
22
ChangeLog
@ -1,5 +1,27 @@
|
||||
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.
|
||||
|
@ -105,8 +105,6 @@ __cpy (const mp_no *x, mp_no *y, int p)
|
||||
EY = EX;
|
||||
for (i = 0; i <= p; i++)
|
||||
Y[i] = X[i];
|
||||
|
||||
return;
|
||||
}
|
||||
|
||||
/* Convert a multiple precision number *X into a double precision
|
||||
@ -181,7 +179,6 @@ norm (const mp_no *x, double *y, int p)
|
||||
c *= RADIXI;
|
||||
|
||||
*y = c;
|
||||
return;
|
||||
#undef R
|
||||
}
|
||||
|
||||
@ -293,8 +290,6 @@ denorm (const mp_no *x, double *y, int p)
|
||||
c = X[0] * ((z[1] + R * (z[2] + R * z[3])) - TWO10);
|
||||
|
||||
*y = c * TWOM1032;
|
||||
return;
|
||||
|
||||
#undef R
|
||||
}
|
||||
|
||||
@ -359,7 +354,6 @@ __dbl_mp (double x, mp_no *y, int p)
|
||||
}
|
||||
for (; i <= p2; i++)
|
||||
Y[i] = ZERO;
|
||||
return;
|
||||
}
|
||||
|
||||
/* Add magnitudes of *X and *Y assuming that abs (*X) >= abs (*Y) > 0. The
|
||||
@ -493,8 +487,6 @@ sub_magnitudes (const mp_no *x, const mp_no *y, mp_no *z, int p)
|
||||
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
|
||||
@ -544,7 +536,6 @@ __add (const mp_no *x, const mp_no *y, mp_no *z, int p)
|
||||
else
|
||||
Z[0] = ZERO;
|
||||
}
|
||||
return;
|
||||
}
|
||||
|
||||
/* Subtract *Y from *X and return the result in *Z. X and Y may overlap but
|
||||
@ -595,7 +586,6 @@ __sub (const mp_no *x, const mp_no *y, mp_no *z, int p)
|
||||
else
|
||||
Z[0] = ZERO;
|
||||
}
|
||||
return;
|
||||
}
|
||||
|
||||
/* Multiply *X and *Y and store result in *Z. X and Y may overlap but not X
|
||||
@ -684,7 +674,6 @@ __mul (const mp_no *x, const mp_no *y, mp_no *z, int p)
|
||||
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
|
||||
@ -818,7 +807,6 @@ __inv (const mp_no *x, mp_no *y, int p)
|
||||
__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
|
||||
@ -840,5 +828,4 @@ __dvd (const mp_no *x, const mp_no *y, mp_no *z, int p)
|
||||
__inv (y, &w, p);
|
||||
__mul (x, &w, z, p);
|
||||
}
|
||||
return;
|
||||
}
|
||||
|
@ -105,8 +105,6 @@ __cpy (const mp_no *x, mp_no *y, int p)
|
||||
EY = EX;
|
||||
for (i = 0; i <= p; i++)
|
||||
Y[i] = X[i];
|
||||
|
||||
return;
|
||||
}
|
||||
|
||||
/* Convert a multiple precision number *X into a double precision
|
||||
@ -181,7 +179,6 @@ norm (const mp_no *x, double *y, int p)
|
||||
c *= RADIXI;
|
||||
|
||||
*y = c;
|
||||
return;
|
||||
#undef R
|
||||
}
|
||||
|
||||
@ -293,8 +290,6 @@ denorm (const mp_no *x, double *y, int p)
|
||||
c = X[0] * ((z[1] + R * (z[2] + R * z[3])) - TWO10);
|
||||
|
||||
*y = c * TWOM1032;
|
||||
return;
|
||||
|
||||
#undef R
|
||||
}
|
||||
|
||||
@ -359,7 +354,6 @@ __dbl_mp (double x, mp_no *y, int p)
|
||||
}
|
||||
for (; i <= p2; i++)
|
||||
Y[i] = ZERO;
|
||||
return;
|
||||
}
|
||||
|
||||
/* Add magnitudes of *X and *Y assuming that abs (*X) >= abs (*Y) > 0. The
|
||||
@ -493,8 +487,6 @@ sub_magnitudes (const mp_no *x, const mp_no *y, mp_no *z, int p)
|
||||
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
|
||||
@ -544,7 +536,6 @@ __add (const mp_no *x, const mp_no *y, mp_no *z, int p)
|
||||
else
|
||||
Z[0] = ZERO;
|
||||
}
|
||||
return;
|
||||
}
|
||||
|
||||
/* Subtract *Y from *X and return the result in *Z. X and Y may overlap but
|
||||
@ -595,7 +586,6 @@ __sub (const mp_no *x, const mp_no *y, mp_no *z, int p)
|
||||
else
|
||||
Z[0] = ZERO;
|
||||
}
|
||||
return;
|
||||
}
|
||||
|
||||
/* Multiply *X and *Y and store result in *Z. X and Y may overlap but not X
|
||||
@ -684,7 +674,6 @@ __mul (const mp_no *x, const mp_no *y, mp_no *z, int p)
|
||||
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
|
||||
@ -818,7 +807,6 @@ __inv (const mp_no *x, mp_no *y, int p)
|
||||
__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
|
||||
@ -840,5 +828,4 @@ __dvd (const mp_no *x, const mp_no *y, mp_no *z, int p)
|
||||
__inv (y, &w, p);
|
||||
__mul (x, &w, z, p);
|
||||
}
|
||||
return;
|
||||
}
|
||||
|
Loading…
Reference in New Issue
Block a user