Subversion Repositories HelenOS-historic

Rev

Rev 534 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
230 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 <arch/fmath.h>
30 
#include <print.h>
31 
 
32 
    //TODO:
33 
#define FMATH_MANTISA_MASK ( 0x000fffffffffffffLL )
34 
 
35 
signed short fmath_get_binary_exponent(double num)
36 
{   //TODO:
37 
/*  fmath_ld_union_t fmath_ld_union;
38 
    fmath_ld_union.bf = num;
39 
    return (signed short)((((fmath_ld_union.ldd[7])&0x7f)<<4) + (((fmath_ld_union.ldd[6])&0xf0)>>4)) -FMATH_EXPONENT_BIAS; // exponent is 11 bits lenght, so sevent bits is in 8th byte and 4 bits in 7th
40 
*/
41 
    return 0;
42 
}
43 
 
44 
double fmath_get_decimal_exponent(double num)
45 
{   //TODO:
659 jermar 46 
    return 0;  
230 cejka 47 
}
48 
 
49 
__u64 fmath_get_binary_mantisa(double num)
50 
{   //TODO:
51 
/*  union { __u64 _u; double _d;} un = { _d : num };
52 
    un._u=un._u &(FMATH_MANTISA_MASK); // mask 52 bits of mantisa
53 
    return un._u;
54 
    */
55 
    return 0;
56 
}
57 
 
58 
double fmath_fint(double num, double *intp)
59 
{   //TODO:
60 
/*  fmath_ld_union_t fmath_ld_union_num;
61 
    fmath_ld_union_t fmath_ld_union_int;
62 
    signed short exp;
63 
    __u64 mask,mantisa;
64 
    int i;
65 
 
66 
    exp=fmath_get_binary_exponent(num);
67 
 
68 
    if (exp<0) {
69 
        *intp = 0.0;
70 
        *intp = fmath_set_sign(0.0L,fmath_is_negative(num));
71 
        return num;
72 
        }
73 
 
74 
 
75 
    if (exp>51) {
76 
        *intp=num;
77 
        num=0.0;
78 
        num= fmath_set_sign(0.0L,fmath_is_negative(*intp));
79 
        return num;
80 
    }
81 
 
82 
    fmath_ld_union_num.bf = num;
83 
 
84 
    mask = FMATH_MANTISA_MASK>>exp;
85 
    //mantisa = (fmath_get-binary_mantisa(num))&(~mask);
86 
 
87 
    for (i=0;i<7;i++) {
88 
        // Ugly construction for obtain sign, exponent and integer part from num
89 
        fmath_ld_union_int.ldd[i]=fmath_ld_union_num.ldd[i]&(((~mask)>>(i*8))&0xff);
90 
    }
91 
 
92 
    fmath_ld_union_int.ldd[6]|=((fmath_ld_union_num.ldd[6])&(0xf0));
93 
    fmath_ld_union_int.ldd[7]=fmath_ld_union_num.ldd[7];
94 
 
95 
    *intp=fmath_ld_union_int.bf;
96 
    return fmath_ld_union_num.bf-fmath_ld_union_int.bf;
97 
*/
98 
 
99 
    return 0.0;
100 
};
101 
 
102 
 
103 
double fmath_dpow(double base, double exponent)
104 
{   //TODO:
105 
/*  double value=1.0;
106 
    if (base<=0.0) return base;
107 
 
108 
    //2^(x*log2(10)) = 2^y = 10^x
109 
 
110 
    __asm__ __volatile__ (      \
111 
        "fyl2x # ST(1):=ST(1)*log2(ST(0)), pop st(0) \n\t "     \
112 
        "fld    %%st(0) \n\t"   \
113 
        "frndint \n\t"      \
114 
        "fxch %%st(1) \n\t"     \
115 
        "fsub %%st(1),%%st(0) \n\t" \
116 
        "f2xm1  # ST := 2^ST -1\n\t"            \
117 
        "fld1 \n\t"         \
118 
        "faddp %%st(0),%%st(1) \n\t"    \
119 
        "fscale #ST:=ST*2^(ST(1))\n\t"      \
120 
        "fstp %%st(1) \n\t"     \
121 
    "" : "=t" (value) :  "0" (base), "u" (exponent) );
122 
    return value;
123 
*/
124 
    return 1.0;
125 
}
126 
 
266 cejka 127 
 
128 
int fmath_is_nan(double num)
129 
{
130 
/*  __u16 exp;
131 
    fmath_ld_union_t fmath_ld_union;
132 
    fmath_ld_union.bf = num;
133 
    exp=(((fmath_ld_union.ldd[7])&0x7f)<<4) + (((fmath_ld_union.ldd[6])&0xf0)>>4); // exponent is 11 bits lenght, so sevent bits is in 8th byte and 4 bits in 7th
134 
 
135 
    if (exp!=0x07ff) return 0;
136 
    if (fmath_get_binary_mantisa(num)>=FMATH_NAN) return 1;
137 
 
138 
*/     
139 
    return 0;
140 
}
141 
 
142 
int fmath_is_infinity(double num)
143 
{
144 
/*  __u16 exp;
145 
    fmath_ld_union_t fmath_ld_union;
146 
    fmath_ld_union.bf = num;
147 
    exp=(((fmath_ld_union.ldd[7])&0x7f)<<4) + (((fmath_ld_union.ldd[6])&0xf0)>>4); // exponent is 11 bits lenght, so sevent bits is in 8th byte and 4 bits in 7th
148 
 
149 
    if (exp!=0x07ff) return 0;
150 
    if (fmath_get_binary_mantisa(num)==0x0) return 1;
151 
*/  return 0;
152 
}
153