Rev 1035 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1035 | Rev 1657 | ||
---|---|---|---|
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 | /** @addtogroup softfloat |
|
- | 30 | * @{ |
|
- | 31 | */ |
|
- | 32 | /** @file |
|
- | 33 | */ |
|
- | 34 | ||
29 | #include<sftypes.h> |
35 | #include<sftypes.h> |
30 | #include<comparison.h> |
36 | #include<comparison.h> |
31 | 37 | ||
32 | inline int isFloat32NaN(float32 f) |
38 | inline int isFloat32NaN(float32 f) |
33 | { /* NaN : exp = 0xff and nonzero fraction */ |
39 | { /* NaN : exp = 0xff and nonzero fraction */ |
34 | return ((f.parts.exp==0xFF)&&(f.parts.fraction)); |
40 | return ((f.parts.exp==0xFF)&&(f.parts.fraction)); |
35 | } |
41 | } |
36 | 42 | ||
37 | inline int isFloat64NaN(float64 d) |
43 | inline int isFloat64NaN(float64 d) |
38 | { /* NaN : exp = 0x7ff and nonzero fraction */ |
44 | { /* NaN : exp = 0x7ff and nonzero fraction */ |
39 | return ((d.parts.exp==0x7FF)&&(d.parts.fraction)); |
45 | return ((d.parts.exp==0x7FF)&&(d.parts.fraction)); |
40 | } |
46 | } |
41 | 47 | ||
42 | inline int isFloat32SigNaN(float32 f) |
48 | inline int isFloat32SigNaN(float32 f) |
43 | { /* SigNaN : exp = 0xff fraction = 0xxxxx..x (binary), where at least one x is nonzero */ |
49 | { /* SigNaN : exp = 0xff fraction = 0xxxxx..x (binary), where at least one x is nonzero */ |
44 | return ((f.parts.exp==0xFF)&&(f.parts.fraction<0x400000)&&(f.parts.fraction)); |
50 | return ((f.parts.exp==0xFF)&&(f.parts.fraction<0x400000)&&(f.parts.fraction)); |
45 | } |
51 | } |
46 | 52 | ||
47 | inline int isFloat64SigNaN(float64 d) |
53 | inline int isFloat64SigNaN(float64 d) |
48 | { /* SigNaN : exp = 0x7ff fraction = 0xxxxx..x (binary), where at least one x is nonzero */ |
54 | { /* SigNaN : exp = 0x7ff fraction = 0xxxxx..x (binary), where at least one x is nonzero */ |
49 | return ((d.parts.exp==0x7FF)&&(d.parts.fraction)&&(d.parts.fraction<0x8000000000000ll)); |
55 | return ((d.parts.exp==0x7FF)&&(d.parts.fraction)&&(d.parts.fraction<0x8000000000000ll)); |
50 | } |
56 | } |
51 | 57 | ||
52 | inline int isFloat32Infinity(float32 f) |
58 | inline int isFloat32Infinity(float32 f) |
53 | { |
59 | { |
54 | return ((f.parts.exp==0xFF)&&(f.parts.fraction==0x0)); |
60 | return ((f.parts.exp==0xFF)&&(f.parts.fraction==0x0)); |
55 | } |
61 | } |
56 | 62 | ||
57 | inline int isFloat64Infinity(float64 d) |
63 | inline int isFloat64Infinity(float64 d) |
58 | { |
64 | { |
59 | return ((d.parts.exp==0x7FF)&&(d.parts.fraction==0x0)); |
65 | return ((d.parts.exp==0x7FF)&&(d.parts.fraction==0x0)); |
60 | } |
66 | } |
61 | 67 | ||
62 | inline int isFloat32Zero(float32 f) |
68 | inline int isFloat32Zero(float32 f) |
63 | { |
69 | { |
64 | return (((f.binary) & 0x7FFFFFFF) == 0); |
70 | return (((f.binary) & 0x7FFFFFFF) == 0); |
65 | } |
71 | } |
66 | 72 | ||
67 | inline int isFloat64Zero(float64 d) |
73 | inline int isFloat64Zero(float64 d) |
68 | { |
74 | { |
69 | return (((d.binary) & 0x7FFFFFFFFFFFFFFFll) == 0); |
75 | return (((d.binary) & 0x7FFFFFFFFFFFFFFFll) == 0); |
70 | } |
76 | } |
71 | 77 | ||
72 | /** |
78 | /** |
73 | * @return 1, if both floats are equal - but NaNs are not recognized |
79 | * @return 1, if both floats are equal - but NaNs are not recognized |
74 | */ |
80 | */ |
75 | inline int isFloat32eq(float32 a, float32 b) |
81 | inline int isFloat32eq(float32 a, float32 b) |
76 | { |
82 | { |
77 | return ((a.binary==b.binary)||(((a.binary| b.binary)&0x7FFFFFFF)==0)); /* a equals to b or both are zeros (with any sign) */ |
83 | return ((a.binary==b.binary)||(((a.binary| b.binary)&0x7FFFFFFF)==0)); /* a equals to b or both are zeros (with any sign) */ |
78 | } |
84 | } |
79 | 85 | ||
80 | /** |
86 | /** |
81 | * @return 1, if a<b - but NaNs are not recognized |
87 | * @return 1, if a<b - but NaNs are not recognized |
82 | */ |
88 | */ |
83 | inline int isFloat32lt(float32 a, float32 b) |
89 | inline int isFloat32lt(float32 a, float32 b) |
84 | { |
90 | { |
85 | if (((a.binary| b.binary)&0x7FFFFFFF)==0) { |
91 | if (((a.binary| b.binary)&0x7FFFFFFF)==0) { |
86 | return 0; /* +- zeroes */ |
92 | return 0; /* +- zeroes */ |
87 | }; |
93 | }; |
88 | 94 | ||
89 | if ((a.parts.sign)&&(b.parts.sign)) { |
95 | if ((a.parts.sign)&&(b.parts.sign)) { |
90 | /*if both are negative, smaller is that with greater binary value*/ |
96 | /*if both are negative, smaller is that with greater binary value*/ |
91 | return (a.binary>b.binary); |
97 | return (a.binary>b.binary); |
92 | }; |
98 | }; |
93 | 99 | ||
94 | /* lets negate signs - now will be positive numbers allways bigger than negative (first bit will be set for unsigned integer comparison)*/ |
100 | /* lets negate signs - now will be positive numbers allways bigger than negative (first bit will be set for unsigned integer comparison)*/ |
95 | a.parts.sign=!a.parts.sign; |
101 | a.parts.sign=!a.parts.sign; |
96 | b.parts.sign=!b.parts.sign; |
102 | b.parts.sign=!b.parts.sign; |
97 | return (a.binary<b.binary); |
103 | return (a.binary<b.binary); |
98 | 104 | ||
99 | } |
105 | } |
100 | 106 | ||
101 | /** |
107 | /** |
102 | * @return 1, if a>b - but NaNs are not recognized |
108 | * @return 1, if a>b - but NaNs are not recognized |
103 | */ |
109 | */ |
104 | inline int isFloat32gt(float32 a, float32 b) |
110 | inline int isFloat32gt(float32 a, float32 b) |
105 | { |
111 | { |
106 | if (((a.binary| b.binary)&0x7FFFFFFF)==0) { |
112 | if (((a.binary| b.binary)&0x7FFFFFFF)==0) { |
107 | return 0; /* zeroes are equal with any sign */ |
113 | return 0; /* zeroes are equal with any sign */ |
108 | }; |
114 | }; |
109 | 115 | ||
110 | if ((a.parts.sign)&&(b.parts.sign)) { |
116 | if ((a.parts.sign)&&(b.parts.sign)) { |
111 | /*if both are negative, greater is that with smaller binary value*/ |
117 | /*if both are negative, greater is that with smaller binary value*/ |
112 | return (a.binary<b.binary); |
118 | return (a.binary<b.binary); |
113 | }; |
119 | }; |
114 | 120 | ||
115 | /* lets negate signs - now will be positive numbers allways bigger than negative (first bit will be set for unsigned integer comparison)*/ |
121 | /* lets negate signs - now will be positive numbers allways bigger than negative (first bit will be set for unsigned integer comparison)*/ |
116 | a.parts.sign=!a.parts.sign; |
122 | a.parts.sign=!a.parts.sign; |
117 | b.parts.sign=!b.parts.sign; |
123 | b.parts.sign=!b.parts.sign; |
118 | return (a.binary>b.binary); |
124 | return (a.binary>b.binary); |
119 | 125 | ||
120 | } |
126 | } |
121 | 127 | ||
122 | 128 | ||
123 | 129 | ||
- | 130 | ||
- | 131 | /** @} |
|
- | 132 | */ |
|
- | 133 | ||
124 | 134 |