Rev 660 | Rev 697 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 660 | Rev 688 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2005 Josef Cejka |
2 | * Copyright (C) 2005 Josef Cejka |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
13 | * documentation and/or other materials provided with the distribution. |
14 | * - The name of the author may not be used to endorse or promote products |
14 | * - The name of the author may not be used to endorse or promote products |
15 | * derived from this software without specific prior written permission. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | #include<sftypes.h> |
29 | #include<sftypes.h> |
30 | #include<comparison.h> |
30 | #include<comparison.h> |
31 | 31 | ||
32 | inline int isFloat32NaN(float32 f) |
32 | inline int isFloat32NaN(float32 f) |
33 | { /* NaN : exp = 0xff and nonzero mantisa */ |
33 | { /* NaN : exp = 0xff and nonzero mantisa */ |
34 | return ((f.parts.exp==0xFF)&&(f.parts.mantisa)); |
34 | return ((f.parts.exp==0xFF)&&(f.parts.mantisa)); |
35 | }; |
35 | }; |
36 | 36 | ||
37 | inline int isFloat32SigNaN(float32 f) |
37 | inline int isFloat32SigNaN(float32 f) |
38 | { /* SigNaN : exp = 0xff mantisa = 1xxxxx..x (binary), where at least one x is nonzero */ |
38 | { /* SigNaN : exp = 0xff mantisa = 1xxxxx..x (binary), where at least one x is nonzero */ |
39 | return ((f.parts.exp==0xFF)&&(f.parts.mantisa>0x400000)); |
39 | return ((f.parts.exp==0xFF)&&(f.parts.mantisa>0x400000)); |
40 | }; |
40 | }; |
41 | 41 | ||
42 | inline int isFloat32Infinity(float32 f) |
42 | inline int isFloat32Infinity(float32 f) |
43 | { |
43 | { |
44 | return ((f.parts.exp==0xFF)&&(f.parts.mantisa==0x0)); |
44 | return ((f.parts.exp==0xFF)&&(f.parts.mantisa==0x0)); |
45 | }; |
45 | }; |
46 | 46 | ||
- | 47 | inline int isFloat32Zero(float32 f) |
|
- | 48 | { |
|
- | 49 | return (((f.binary) & 0x7FFFFFFF) == 0); |
|
- | 50 | } |
|
- | 51 | ||
47 | /** |
52 | /** |
48 | * @return 1, if both floats are equal - but NaNs are not recognized |
53 | * @return 1, if both floats are equal - but NaNs are not recognized |
49 | */ |
54 | */ |
50 | inline int isFloat32eq(float32 a, float32 b) |
55 | inline int isFloat32eq(float32 a, float32 b) |
51 | { |
56 | { |
52 | return ((a.binary==b.binary)||(((a.binary| b.binary)&0x7FFFFFFF)==0)); /* a equals to b or both are zeros (with any sign) */ |
57 | return ((a.binary==b.binary)||(((a.binary| b.binary)&0x7FFFFFFF)==0)); /* a equals to b or both are zeros (with any sign) */ |
53 | } |
58 | } |
54 | 59 | ||
55 | /** |
60 | /** |
56 | * @return 1, if a<b - but NaNs are not recognized |
61 | * @return 1, if a<b - but NaNs are not recognized |
57 | */ |
62 | */ |
58 | inline int isFloat32lt(float32 a, float32 b) |
63 | inline int isFloat32lt(float32 a, float32 b) |
59 | { |
64 | { |
60 | if (((a.binary| b.binary)&0x7FFFFFFF)==0) { |
65 | if (((a.binary| b.binary)&0x7FFFFFFF)==0) { |
61 | return 0; /* +- zeroes */ |
66 | return 0; /* +- zeroes */ |
62 | }; |
67 | }; |
63 | 68 | ||
64 | if ((a.parts.sign)&&(b.parts.sign)) { |
69 | if ((a.parts.sign)&&(b.parts.sign)) { |
65 | /*if both are negative, smaller is that with greater binary value*/ |
70 | /*if both are negative, smaller is that with greater binary value*/ |
66 | return (a.binary>b.binary); |
71 | return (a.binary>b.binary); |
67 | }; |
72 | }; |
68 | 73 | ||
69 | /* lets negate signs - now will be positive numbers allways bigger than negative (first bit will be set for unsigned integer comparison)*/ |
74 | /* lets negate signs - now will be positive numbers allways bigger than negative (first bit will be set for unsigned integer comparison)*/ |
70 | a.parts.sign=!a.parts.sign; |
75 | a.parts.sign=!a.parts.sign; |
71 | b.parts.sign=!b.parts.sign; |
76 | b.parts.sign=!b.parts.sign; |
72 | return (a.binary<b.binary); |
77 | return (a.binary<b.binary); |
73 | 78 | ||
74 | } |
79 | } |
75 | 80 | ||
76 | /** |
81 | /** |
77 | * @return 1, if a>b - but NaNs are not recognized |
82 | * @return 1, if a>b - but NaNs are not recognized |
78 | */ |
83 | */ |
79 | inline int isFloat32gt(float32 a, float32 b) |
84 | inline int isFloat32gt(float32 a, float32 b) |
80 | { |
85 | { |
81 | if (((a.binary| b.binary)&0x7FFFFFFF)==0) { |
86 | if (((a.binary| b.binary)&0x7FFFFFFF)==0) { |
82 | return 0; /* zeroes are equal with any sign */ |
87 | return 0; /* zeroes are equal with any sign */ |
83 | }; |
88 | }; |
84 | 89 | ||
85 | if ((a.parts.sign)&&(b.parts.sign)) { |
90 | if ((a.parts.sign)&&(b.parts.sign)) { |
86 | /*if both are negative, greater is that with smaller binary value*/ |
91 | /*if both are negative, greater is that with smaller binary value*/ |
87 | return (a.binary<b.binary); |
92 | return (a.binary<b.binary); |
88 | }; |
93 | }; |
89 | 94 | ||
90 | /* lets negate signs - now will be positive numbers allways bigger than negative (first bit will be set for unsigned integer comparison)*/ |
95 | /* lets negate signs - now will be positive numbers allways bigger than negative (first bit will be set for unsigned integer comparison)*/ |
91 | a.parts.sign=!a.parts.sign; |
96 | a.parts.sign=!a.parts.sign; |
92 | b.parts.sign=!b.parts.sign; |
97 | b.parts.sign=!b.parts.sign; |
93 | return (a.binary>b.binary); |
98 | return (a.binary>b.binary); |
94 | 99 | ||
95 | } |
100 | } |
96 | 101 | ||
97 | 102 | ||
98 | 103 |