Rev 660 | Rev 734 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
647 | cejka | 1 | /* |
2 | * Copyright (C) 2005 Josef 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 | |||
29 | #include<sftypes.h> |
||
30 | #include<comparison.h> |
||
31 | |||
32 | inline int isFloat32NaN(float32 f) |
||
33 | { /* NaN : exp = 0xff and nonzero mantisa */ |
||
34 | return ((f.parts.exp==0xFF)&&(f.parts.mantisa)); |
||
35 | }; |
||
36 | |||
37 | inline int isFloat32SigNaN(float32 f) |
||
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)); |
||
40 | }; |
||
41 | |||
652 | cejka | 42 | inline int isFloat32Infinity(float32 f) |
43 | { |
||
44 | return ((f.parts.exp==0xFF)&&(f.parts.mantisa==0x0)); |
||
45 | }; |
||
46 | |||
688 | cejka | 47 | inline int isFloat32Zero(float32 f) |
48 | { |
||
49 | return (((f.binary) & 0x7FFFFFFF) == 0); |
||
50 | } |
||
51 | |||
652 | cejka | 52 | /** |
53 | * @return 1, if both floats are equal - but NaNs are not recognized |
||
54 | */ |
||
55 | inline int isFloat32eq(float32 a, float32 b) |
||
56 | { |
||
660 | cejka | 57 | return ((a.binary==b.binary)||(((a.binary| b.binary)&0x7FFFFFFF)==0)); /* a equals to b or both are zeros (with any sign) */ |
652 | cejka | 58 | } |
59 | |||
60 | /** |
||
653 | cejka | 61 | * @return 1, if a<b - but NaNs are not recognized |
652 | cejka | 62 | */ |
63 | inline int isFloat32lt(float32 a, float32 b) |
||
64 | { |
||
65 | if (((a.binary| b.binary)&0x7FFFFFFF)==0) { |
||
660 | cejka | 66 | return 0; /* +- zeroes */ |
652 | cejka | 67 | }; |
660 | cejka | 68 | |
69 | if ((a.parts.sign)&&(b.parts.sign)) { |
||
70 | /*if both are negative, smaller is that with greater binary value*/ |
||
71 | return (a.binary>b.binary); |
||
72 | }; |
||
73 | |||
74 | /* lets negate signs - now will be positive numbers allways bigger than negative (first bit will be set for unsigned integer comparison)*/ |
||
75 | a.parts.sign=!a.parts.sign; |
||
76 | b.parts.sign=!b.parts.sign; |
||
652 | cejka | 77 | return (a.binary<b.binary); |
78 | |||
79 | } |
||
80 | |||
653 | cejka | 81 | /** |
82 | * @return 1, if a>b - but NaNs are not recognized |
||
83 | */ |
||
84 | inline int isFloat32gt(float32 a, float32 b) |
||
85 | { |
||
86 | if (((a.binary| b.binary)&0x7FFFFFFF)==0) { |
||
660 | cejka | 87 | return 0; /* zeroes are equal with any sign */ |
653 | cejka | 88 | }; |
660 | cejka | 89 | |
90 | if ((a.parts.sign)&&(b.parts.sign)) { |
||
91 | /*if both are negative, greater is that with smaller binary value*/ |
||
92 | return (a.binary<b.binary); |
||
93 | }; |
||
94 | |||
95 | /* lets negate signs - now will be positive numbers allways bigger than negative (first bit will be set for unsigned integer comparison)*/ |
||
96 | a.parts.sign=!a.parts.sign; |
||
97 | b.parts.sign=!b.parts.sign; |
||
653 | cejka | 98 | return (a.binary>b.binary); |
99 | |||
100 | } |
||
652 | cejka | 101 | |
653 | cejka | 102 |