diff options
| author | Joseph Myers <joseph@codesourcery.com> | 2014-09-17 22:20:45 +0000 |
|---|---|---|
| committer | Joseph Myers <joseph@codesourcery.com> | 2014-09-17 22:20:45 +0000 |
| commit | c4fe3ea7cf2e9f261006ab7ea65bd20c60fe270c (patch) | |
| tree | 1b898f900d6bdc26949fbb940828958f5c129116 /soft-fp/extended.h | |
| parent | 4e8afe69e119e6a4b148e9a6e07e5894c7f6528e (diff) | |
| download | glibc-c4fe3ea7cf2e9f261006ab7ea65bd20c60fe270c.tar.gz glibc-c4fe3ea7cf2e9f261006ab7ea65bd20c60fe270c.tar.xz glibc-c4fe3ea7cf2e9f261006ab7ea65bd20c60fe270c.zip | |
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.
Diffstat (limited to 'soft-fp/extended.h')
| -rw-r--r-- | soft-fp/extended.h | 32 |
1 files changed, 14 insertions, 18 deletions
diff --git a/soft-fp/extended.h b/soft-fp/extended.h index 940bdf1a1a..989b056974 100644 --- a/soft-fp/extended.h +++ b/soft-fp/extended.h @@ -232,16 +232,14 @@ union _FP_UNION_E # define FP_SQRT_E(R, X) _FP_SQRT (E, 4, R, X) # define FP_FMA_E(R, X, Y, Z) _FP_FMA (E, 4, 8, R, X, Y, Z) -/* - * Square root algorithms: - * We have just one right now, maybe Newton approximation - * should be added for those machines where division is fast. - * This has special _E version because standard _4 square - * root would not work (it has to start normally with the - * second word and not the first), but as we have to do it - * anyway, we optimize it by doing most of the calculations - * in two UWtype registers instead of four. - */ +/* Square root algorithms: + We have just one right now, maybe Newton approximation + should be added for those machines where division is fast. + This has special _E version because standard _4 square + root would not work (it has to start normally with the + second word and not the first), but as we have to do it + anyway, we optimize it by doing most of the calculations + in two UWtype registers instead of four. */ # define _FP_SQRT_MEAT_E(R, S, T, X, q) \ do \ @@ -458,14 +456,12 @@ union _FP_UNION_E # define FP_SQRT_E(R, X) _FP_SQRT (E, 2, R, X) # define FP_FMA_E(R, X, Y, Z) _FP_FMA (E, 2, 4, R, X, Y, Z) -/* - * Square root algorithms: - * We have just one right now, maybe Newton approximation - * should be added for those machines where division is fast. - * We optimize it by doing most of the calculations - * in one UWtype registers instead of two, although we don't - * have to. - */ +/* Square root algorithms: + We have just one right now, maybe Newton approximation + should be added for those machines where division is fast. + We optimize it by doing most of the calculations + in one UWtype registers instead of two, although we don't + have to. */ # define _FP_SQRT_MEAT_E(R, S, T, X, q) \ do \ { \ |