mirror of
https://sourceware.org/git/glibc.git
synced 2025-08-08 17:42:12 +03:00
soft-fp: Fix comment formatting.
This patch fixes formatting of comments in soft-fp (in particular, the normal style in glibc does not have a leading '*' on each line, and comments should start with capital letters and end with ". */"). Tested for powerpc-nofpu that the disassembly of installed shared libraries is unchanged by this patch. * soft-fp/extended.h: Fix comment formatting. * soft-fp/op-1.h: Likewise. * soft-fp/op-2.h: Likewise. * soft-fp/op-4.h: Likewise. * soft-fp/op-8.h: Likewise. * soft-fp/op-common.h: Likewise. * soft-fp/soft-fp.h: Likewise.
This commit is contained in:
Joseph Myers
@@ -70,7 +70,7 @@
|
||||
} \
|
||||
while (0)
|
||||
|
||||
/* This one was broken too */
|
||||
/* This one was broken too. */
|
||||
#define _FP_FRAC_SRL_4(X, N) \
|
||||
do \
|
||||
{ \
|
||||
@@ -104,10 +104,9 @@
|
||||
|
||||
|
||||
/* Right shift with sticky-lsb.
|
||||
* What this actually means is that we do a standard right-shift,
|
||||
* but that if any of the bits that fall off the right hand side
|
||||
* were one then we always set the LSbit.
|
||||
*/
|
||||
What this actually means is that we do a standard right-shift,
|
||||
but that if any of the bits that fall off the right hand side
|
||||
were one then we always set the LSbit. */
|
||||
#define _FP_FRAC_SRST_4(X, S, N, size) \
|
||||
do \
|
||||
{ \
|
||||
@@ -290,9 +289,7 @@
|
||||
} \
|
||||
while (0)
|
||||
|
||||
/*
|
||||
* Multiplication algorithms:
|
||||
*/
|
||||
/* Multiplication algorithms: */
|
||||
|
||||
/* Given a 1W * 1W => 2W primitive, do the extended multiplication. */
|
||||
|
||||
@@ -467,10 +464,8 @@
|
||||
} \
|
||||
while (0)
|
||||
|
||||
/*
|
||||
* Helper utility for _FP_DIV_MEAT_4_udiv:
|
||||
* pppp = m * nnn
|
||||
*/
|
||||
/* Helper utility for _FP_DIV_MEAT_4_udiv:
|
||||
* pppp = m * nnn. */
|
||||
#define umul_ppppmnnn(p3, p2, p1, p0, m, n2, n1, n0) \
|
||||
do \
|
||||
{ \
|
||||
@@ -483,9 +478,7 @@
|
||||
} \
|
||||
while (0)
|
||||
|
||||
/*
|
||||
* Division algorithms:
|
||||
*/
|
||||
/* Division algorithms: */
|
||||
|
||||
#define _FP_DIV_MEAT_4_udiv(fs, R, X, Y) \
|
||||
do \
|
||||
@@ -504,7 +497,7 @@
|
||||
R##_e--; \
|
||||
\
|
||||
/* Normalize, i.e. make the most significant bit of the \
|
||||
denominator set. */ \
|
||||
denominator set. */ \
|
||||
_FP_FRAC_SLL_4 (Y, _FP_WFRACXBITS_##fs); \
|
||||
\
|
||||
for (_FP_DIV_MEAT_4_udiv_i = 3; ; _FP_DIV_MEAT_4_udiv_i--) \
|
||||
@@ -568,11 +561,9 @@
|
||||
while (0)
|
||||
|
||||
|
||||
/*
|
||||
* Square root algorithms:
|
||||
* We have just one right now, maybe Newton approximation
|
||||
* should be added for those machines where division is fast.
|
||||
*/
|
||||
/* Square root algorithms:
|
||||
We have just one right now, maybe Newton approximation
|
||||
should be added for those machines where division is fast. */
|
||||
|
||||
#define _FP_SQRT_MEAT_4(R, S, T, X, q) \
|
||||
do \
|
||||
@@ -657,9 +648,7 @@
|
||||
while (0)
|
||||
|
||||
|
||||
/*
|
||||
* Internals
|
||||
*/
|
||||
/* Internals. */
|
||||
|
||||
#define __FP_FRAC_SET_4(X, I3, I2, I1, I0) \
|
||||
(X##_f[3] = I3, X##_f[2] = I2, X##_f[1] = I1, X##_f[0] = I0)
|
||||
@@ -787,12 +776,11 @@
|
||||
#endif
|
||||
|
||||
/* Convert FP values between word sizes. This appears to be more
|
||||
* complicated than I'd have expected it to be, so these might be
|
||||
* wrong... These macros are in any case somewhat bogus because they
|
||||
* use information about what various FRAC_n variables look like
|
||||
* internally [eg, that 2 word vars are X_f0 and x_f1]. But so do
|
||||
* the ones in op-2.h and op-1.h.
|
||||
*/
|
||||
complicated than I'd have expected it to be, so these might be
|
||||
wrong... These macros are in any case somewhat bogus because they
|
||||
use information about what various FRAC_n variables look like
|
||||
internally [eg, that 2 word vars are X_f0 and x_f1]. But so do
|
||||
the ones in op-2.h and op-1.h. */
|
||||
#define _FP_FRAC_COPY_1_4(D, S) (D##_f = S##_f[0])
|
||||
|
||||
#define _FP_FRAC_COPY_2_4(D, S) \
|
||||
@@ -804,9 +792,8 @@
|
||||
while (0)
|
||||
|
||||
/* Assembly/disassembly for converting to/from integral types.
|
||||
* No shifting or overflow handled here.
|
||||
*/
|
||||
/* Put the FP value X into r, which is an integer of size rsize. */
|
||||
No shifting or overflow handled here. */
|
||||
/* Put the FP value X into r, which is an integer of size rsize. */
|
||||
#define _FP_FRAC_ASSEMBLE_4(r, X, rsize) \
|
||||
do \
|
||||
{ \
|
||||
@@ -820,8 +807,8 @@
|
||||
} \
|
||||
else \
|
||||
{ \
|
||||
/* I'm feeling lazy so we deal with int == 3words (implausible)*/ \
|
||||
/* and int == 4words as a single case. */ \
|
||||
/* I'm feeling lazy so we deal with int == 3words \
|
||||
(implausible) and int == 4words as a single case. */ \
|
||||
r = X##_f[3]; \
|
||||
r = (rsize <= _FP_W_TYPE_SIZE ? 0 : r << _FP_W_TYPE_SIZE); \
|
||||
r += X##_f[2]; \
|
||||
@@ -834,10 +821,9 @@
|
||||
while (0)
|
||||
|
||||
/* "No disassemble Number Five!" */
|
||||
/* move an integer of size rsize into X's fractional part. We rely on
|
||||
* the _f[] array consisting of words of size _FP_W_TYPE_SIZE to avoid
|
||||
* having to mask the values we store into it.
|
||||
*/
|
||||
/* Move an integer of size rsize into X's fractional part. We rely on
|
||||
the _f[] array consisting of words of size _FP_W_TYPE_SIZE to avoid
|
||||
having to mask the values we store into it. */
|
||||
#define _FP_FRAC_DISASSEMBLE_4(X, r, rsize) \
|
||||
do \
|
||||
{ \
|
||||
|
||||
Reference in New Issue
Block a user