Rev 2479 | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
647 | cejka | 1 | /* |
2071 | jermar | 2 | * Copyright (c) 2005 Josef Cejka |
647 | cejka | 3 | * All rights reserved. |
4 | * |
||
5 | * Redistribution and use in source and binary forms, with or without |
||
6 | * modification, are permitted provided that the following conditions |
||
7 | * are met: |
||
8 | * |
||
9 | * - Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * - Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
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 |
||
15 | * derived from this software without specific prior written permission. |
||
16 | * |
||
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 |
||
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
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 |
||
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 |
||
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
27 | */ |
||
28 | |||
1740 | jermar | 29 | /** @addtogroup softfloat |
1657 | cejka | 30 | * @{ |
31 | */ |
||
32 | /** @file |
||
33 | */ |
||
34 | |||
647 | cejka | 35 | #include<sftypes.h> |
36 | #include<comparison.h> |
||
37 | |||
38 | inline int isFloat32NaN(float32 f) |
||
804 | cejka | 39 | { /* NaN : exp = 0xff and nonzero fraction */ |
40 | return ((f.parts.exp==0xFF)&&(f.parts.fraction)); |
||
1035 | cejka | 41 | } |
647 | cejka | 42 | |
697 | cejka | 43 | inline int isFloat64NaN(float64 d) |
804 | cejka | 44 | { /* NaN : exp = 0x7ff and nonzero fraction */ |
45 | return ((d.parts.exp==0x7FF)&&(d.parts.fraction)); |
||
1035 | cejka | 46 | } |
697 | cejka | 47 | |
647 | cejka | 48 | inline int isFloat32SigNaN(float32 f) |
804 | cejka | 49 | { /* SigNaN : exp = 0xff fraction = 0xxxxx..x (binary), where at least one x is nonzero */ |
50 | return ((f.parts.exp==0xFF)&&(f.parts.fraction<0x400000)&&(f.parts.fraction)); |
||
1035 | cejka | 51 | } |
647 | cejka | 52 | |
697 | cejka | 53 | inline int isFloat64SigNaN(float64 d) |
804 | cejka | 54 | { /* SigNaN : exp = 0x7ff fraction = 0xxxxx..x (binary), where at least one x is nonzero */ |
55 | return ((d.parts.exp==0x7FF)&&(d.parts.fraction)&&(d.parts.fraction<0x8000000000000ll)); |
||
1035 | cejka | 56 | } |
697 | cejka | 57 | |
652 | cejka | 58 | inline int isFloat32Infinity(float32 f) |
59 | { |
||
804 | cejka | 60 | return ((f.parts.exp==0xFF)&&(f.parts.fraction==0x0)); |
1035 | cejka | 61 | } |
652 | cejka | 62 | |
697 | cejka | 63 | inline int isFloat64Infinity(float64 d) |
64 | { |
||
804 | cejka | 65 | return ((d.parts.exp==0x7FF)&&(d.parts.fraction==0x0)); |
1035 | cejka | 66 | } |
697 | cejka | 67 | |
688 | cejka | 68 | inline int isFloat32Zero(float32 f) |
69 | { |
||
70 | return (((f.binary) & 0x7FFFFFFF) == 0); |
||
71 | } |
||
72 | |||
697 | cejka | 73 | inline int isFloat64Zero(float64 d) |
74 | { |
||
75 | return (((d.binary) & 0x7FFFFFFFFFFFFFFFll) == 0); |
||
76 | } |
||
77 | |||
652 | cejka | 78 | /** |
79 | * @return 1, if both floats are equal - but NaNs are not recognized |
||
80 | */ |
||
81 | inline int isFloat32eq(float32 a, float32 b) |
||
82 | { |
||
660 | cejka | 83 | return ((a.binary==b.binary)||(((a.binary| b.binary)&0x7FFFFFFF)==0)); /* a equals to b or both are zeros (with any sign) */ |
652 | cejka | 84 | } |
85 | |||
86 | /** |
||
653 | cejka | 87 | * @return 1, if a<b - but NaNs are not recognized |
652 | cejka | 88 | */ |
89 | inline int isFloat32lt(float32 a, float32 b) |
||
90 | { |
||
91 | if (((a.binary| b.binary)&0x7FFFFFFF)==0) { |
||
660 | cejka | 92 | return 0; /* +- zeroes */ |
652 | cejka | 93 | }; |
660 | cejka | 94 | |
95 | if ((a.parts.sign)&&(b.parts.sign)) { |
||
96 | /*if both are negative, smaller is that with greater binary value*/ |
||
97 | return (a.binary>b.binary); |
||
98 | }; |
||
99 | |||
100 | /* lets negate signs - now will be positive numbers allways bigger than negative (first bit will be set for unsigned integer comparison)*/ |
||
101 | a.parts.sign=!a.parts.sign; |
||
102 | b.parts.sign=!b.parts.sign; |
||
652 | cejka | 103 | return (a.binary<b.binary); |
104 | |||
105 | } |
||
106 | |||
653 | cejka | 107 | /** |
108 | * @return 1, if a>b - but NaNs are not recognized |
||
109 | */ |
||
110 | inline int isFloat32gt(float32 a, float32 b) |
||
111 | { |
||
112 | if (((a.binary| b.binary)&0x7FFFFFFF)==0) { |
||
660 | cejka | 113 | return 0; /* zeroes are equal with any sign */ |
653 | cejka | 114 | }; |
660 | cejka | 115 | |
116 | if ((a.parts.sign)&&(b.parts.sign)) { |
||
117 | /*if both are negative, greater is that with smaller binary value*/ |
||
118 | return (a.binary<b.binary); |
||
119 | }; |
||
120 | |||
121 | /* lets negate signs - now will be positive numbers allways bigger than negative (first bit will be set for unsigned integer comparison)*/ |
||
122 | a.parts.sign=!a.parts.sign; |
||
123 | b.parts.sign=!b.parts.sign; |
||
653 | cejka | 124 | return (a.binary>b.binary); |
125 | |||
126 | } |
||
652 | cejka | 127 | |
1740 | jermar | 128 | /** @} |
1657 | cejka | 129 | */ |