diff options
| author | Lucas De Marchi <lucas.demarchi@profusion.mobi> | 2011-03-30 21:57:33 -0400 |
|---|---|---|
| committer | Lucas De Marchi <lucas.demarchi@profusion.mobi> | 2011-03-31 10:26:23 -0400 |
| commit | 25985edcedea6396277003854657b5f3cb31a628 (patch) | |
| tree | f026e810210a2ee7290caeb737c23cb6472b7c38 /arch/parisc/math-emu | |
| parent | 6aba74f2791287ec407e0f92487a725a25908067 (diff) | |
Fix common misspellings
Fixes generated by 'codespell' and manually reviewed.
Signed-off-by: Lucas De Marchi <lucas.demarchi@profusion.mobi>
Diffstat (limited to 'arch/parisc/math-emu')
| -rw-r--r-- | arch/parisc/math-emu/dfadd.c | 2 | ||||
| -rw-r--r-- | arch/parisc/math-emu/dfsub.c | 2 | ||||
| -rw-r--r-- | arch/parisc/math-emu/fmpyfadd.c | 8 | ||||
| -rw-r--r-- | arch/parisc/math-emu/sfadd.c | 2 | ||||
| -rw-r--r-- | arch/parisc/math-emu/sfsub.c | 2 |
5 files changed, 8 insertions, 8 deletions
diff --git a/arch/parisc/math-emu/dfadd.c b/arch/parisc/math-emu/dfadd.c index e147d7d3b0f4..d37e2d2cb6fe 100644 --- a/arch/parisc/math-emu/dfadd.c +++ b/arch/parisc/math-emu/dfadd.c | |||
| @@ -303,7 +303,7 @@ dbl_fadd( | |||
| 303 | if(Dbl_iszero_hidden(resultp1)) | 303 | if(Dbl_iszero_hidden(resultp1)) |
| 304 | { | 304 | { |
| 305 | /* Handle normalization */ | 305 | /* Handle normalization */ |
| 306 | /* A straight foward algorithm would now shift the result | 306 | /* A straight forward algorithm would now shift the result |
| 307 | * and extension left until the hidden bit becomes one. Not | 307 | * and extension left until the hidden bit becomes one. Not |
| 308 | * all of the extension bits need participate in the shift. | 308 | * all of the extension bits need participate in the shift. |
| 309 | * Only the two most significant bits (round and guard) are | 309 | * Only the two most significant bits (round and guard) are |
diff --git a/arch/parisc/math-emu/dfsub.c b/arch/parisc/math-emu/dfsub.c index 87ebc60d465b..2e8b5a79bff7 100644 --- a/arch/parisc/math-emu/dfsub.c +++ b/arch/parisc/math-emu/dfsub.c | |||
| @@ -306,7 +306,7 @@ dbl_fsub( | |||
| 306 | if(Dbl_iszero_hidden(resultp1)) | 306 | if(Dbl_iszero_hidden(resultp1)) |
| 307 | { | 307 | { |
| 308 | /* Handle normalization */ | 308 | /* Handle normalization */ |
| 309 | /* A straight foward algorithm would now shift the result | 309 | /* A straight forward algorithm would now shift the result |
| 310 | * and extension left until the hidden bit becomes one. Not | 310 | * and extension left until the hidden bit becomes one. Not |
| 311 | * all of the extension bits need participate in the shift. | 311 | * all of the extension bits need participate in the shift. |
| 312 | * Only the two most significant bits (round and guard) are | 312 | * Only the two most significant bits (round and guard) are |
diff --git a/arch/parisc/math-emu/fmpyfadd.c b/arch/parisc/math-emu/fmpyfadd.c index 5dd7f93a89be..b067c45c872d 100644 --- a/arch/parisc/math-emu/fmpyfadd.c +++ b/arch/parisc/math-emu/fmpyfadd.c | |||
| @@ -531,7 +531,7 @@ dbl_fmpyfadd( | |||
| 531 | sign_save = Dbl_signextendedsign(resultp1); | 531 | sign_save = Dbl_signextendedsign(resultp1); |
| 532 | if (Dbl_iszero_hidden(resultp1)) { | 532 | if (Dbl_iszero_hidden(resultp1)) { |
| 533 | /* Handle normalization */ | 533 | /* Handle normalization */ |
| 534 | /* A straight foward algorithm would now shift the | 534 | /* A straightforward algorithm would now shift the |
| 535 | * result and extension left until the hidden bit | 535 | * result and extension left until the hidden bit |
| 536 | * becomes one. Not all of the extension bits need | 536 | * becomes one. Not all of the extension bits need |
| 537 | * participate in the shift. Only the two most | 537 | * participate in the shift. Only the two most |
| @@ -1191,7 +1191,7 @@ unsigned int *status; | |||
| 1191 | sign_save = Dbl_signextendedsign(resultp1); | 1191 | sign_save = Dbl_signextendedsign(resultp1); |
| 1192 | if (Dbl_iszero_hidden(resultp1)) { | 1192 | if (Dbl_iszero_hidden(resultp1)) { |
| 1193 | /* Handle normalization */ | 1193 | /* Handle normalization */ |
| 1194 | /* A straight foward algorithm would now shift the | 1194 | /* A straightforward algorithm would now shift the |
| 1195 | * result and extension left until the hidden bit | 1195 | * result and extension left until the hidden bit |
| 1196 | * becomes one. Not all of the extension bits need | 1196 | * becomes one. Not all of the extension bits need |
| 1197 | * participate in the shift. Only the two most | 1197 | * participate in the shift. Only the two most |
| @@ -1841,7 +1841,7 @@ unsigned int *status; | |||
| 1841 | sign_save = Sgl_signextendedsign(resultp1); | 1841 | sign_save = Sgl_signextendedsign(resultp1); |
| 1842 | if (Sgl_iszero_hidden(resultp1)) { | 1842 | if (Sgl_iszero_hidden(resultp1)) { |
| 1843 | /* Handle normalization */ | 1843 | /* Handle normalization */ |
| 1844 | /* A straight foward algorithm would now shift the | 1844 | /* A straightforward algorithm would now shift the |
| 1845 | * result and extension left until the hidden bit | 1845 | * result and extension left until the hidden bit |
| 1846 | * becomes one. Not all of the extension bits need | 1846 | * becomes one. Not all of the extension bits need |
| 1847 | * participate in the shift. Only the two most | 1847 | * participate in the shift. Only the two most |
| @@ -2483,7 +2483,7 @@ unsigned int *status; | |||
| 2483 | sign_save = Sgl_signextendedsign(resultp1); | 2483 | sign_save = Sgl_signextendedsign(resultp1); |
| 2484 | if (Sgl_iszero_hidden(resultp1)) { | 2484 | if (Sgl_iszero_hidden(resultp1)) { |
| 2485 | /* Handle normalization */ | 2485 | /* Handle normalization */ |
| 2486 | /* A straight foward algorithm would now shift the | 2486 | /* A straightforward algorithm would now shift the |
| 2487 | * result and extension left until the hidden bit | 2487 | * result and extension left until the hidden bit |
| 2488 | * becomes one. Not all of the extension bits need | 2488 | * becomes one. Not all of the extension bits need |
| 2489 | * participate in the shift. Only the two most | 2489 | * participate in the shift. Only the two most |
diff --git a/arch/parisc/math-emu/sfadd.c b/arch/parisc/math-emu/sfadd.c index 008d721b5d22..f802cd6c7869 100644 --- a/arch/parisc/math-emu/sfadd.c +++ b/arch/parisc/math-emu/sfadd.c | |||
| @@ -298,7 +298,7 @@ sgl_fadd( | |||
| 298 | if(Sgl_iszero_hidden(result)) | 298 | if(Sgl_iszero_hidden(result)) |
| 299 | { | 299 | { |
| 300 | /* Handle normalization */ | 300 | /* Handle normalization */ |
| 301 | /* A straight foward algorithm would now shift the result | 301 | /* A straightforward algorithm would now shift the result |
| 302 | * and extension left until the hidden bit becomes one. Not | 302 | * and extension left until the hidden bit becomes one. Not |
| 303 | * all of the extension bits need participate in the shift. | 303 | * all of the extension bits need participate in the shift. |
| 304 | * Only the two most significant bits (round and guard) are | 304 | * Only the two most significant bits (round and guard) are |
diff --git a/arch/parisc/math-emu/sfsub.c b/arch/parisc/math-emu/sfsub.c index 24eef61c8e3b..5f90d0f31a52 100644 --- a/arch/parisc/math-emu/sfsub.c +++ b/arch/parisc/math-emu/sfsub.c | |||
| @@ -301,7 +301,7 @@ sgl_fsub( | |||
| 301 | if(Sgl_iszero_hidden(result)) | 301 | if(Sgl_iszero_hidden(result)) |
| 302 | { | 302 | { |
| 303 | /* Handle normalization */ | 303 | /* Handle normalization */ |
| 304 | /* A straight foward algorithm would now shift the result | 304 | /* A straightforward algorithm would now shift the result |
| 305 | * and extension left until the hidden bit becomes one. Not | 305 | * and extension left until the hidden bit becomes one. Not |
| 306 | * all of the extension bits need participate in the shift. | 306 | * all of the extension bits need participate in the shift. |
| 307 | * Only the two most significant bits (round and guard) are | 307 | * Only the two most significant bits (round and guard) are |