1*1da177e4SLinus Torvalds /* Software floating-point emulation. 2*1da177e4SLinus Torvalds Definitions for IEEE Quad Precision. 3*1da177e4SLinus Torvalds Copyright (C) 1997,1998,1999 Free Software Foundation, Inc. 4*1da177e4SLinus Torvalds This file is part of the GNU C Library. 5*1da177e4SLinus Torvalds Contributed by Richard Henderson (rth@cygnus.com), 6*1da177e4SLinus Torvalds Jakub Jelinek (jj@ultra.linux.cz), 7*1da177e4SLinus Torvalds David S. Miller (davem@redhat.com) and 8*1da177e4SLinus Torvalds Peter Maydell (pmaydell@chiark.greenend.org.uk). 9*1da177e4SLinus Torvalds 10*1da177e4SLinus Torvalds The GNU C Library is free software; you can redistribute it and/or 11*1da177e4SLinus Torvalds modify it under the terms of the GNU Library General Public License as 12*1da177e4SLinus Torvalds published by the Free Software Foundation; either version 2 of the 13*1da177e4SLinus Torvalds License, or (at your option) any later version. 14*1da177e4SLinus Torvalds 15*1da177e4SLinus Torvalds The GNU C Library is distributed in the hope that it will be useful, 16*1da177e4SLinus Torvalds but WITHOUT ANY WARRANTY; without even the implied warranty of 17*1da177e4SLinus Torvalds MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 18*1da177e4SLinus Torvalds Library General Public License for more details. 19*1da177e4SLinus Torvalds 20*1da177e4SLinus Torvalds You should have received a copy of the GNU Library General Public 21*1da177e4SLinus Torvalds License along with the GNU C Library; see the file COPYING.LIB. If 22*1da177e4SLinus Torvalds not, write to the Free Software Foundation, Inc., 23*1da177e4SLinus Torvalds 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ 24*1da177e4SLinus Torvalds 25*1da177e4SLinus Torvalds #ifndef __MATH_EMU_QUAD_H__ 26*1da177e4SLinus Torvalds #define __MATH_EMU_QUAD_H__ 27*1da177e4SLinus Torvalds 28*1da177e4SLinus Torvalds #if _FP_W_TYPE_SIZE < 32 29*1da177e4SLinus Torvalds #error "Here's a nickel, kid. Go buy yourself a real computer." 30*1da177e4SLinus Torvalds #endif 31*1da177e4SLinus Torvalds 32*1da177e4SLinus Torvalds #if _FP_W_TYPE_SIZE < 64 33*1da177e4SLinus Torvalds #define _FP_FRACTBITS_Q (4*_FP_W_TYPE_SIZE) 34*1da177e4SLinus Torvalds #else 35*1da177e4SLinus Torvalds #define _FP_FRACTBITS_Q (2*_FP_W_TYPE_SIZE) 36*1da177e4SLinus Torvalds #endif 37*1da177e4SLinus Torvalds 38*1da177e4SLinus Torvalds #define _FP_FRACBITS_Q 113 39*1da177e4SLinus Torvalds #define _FP_FRACXBITS_Q (_FP_FRACTBITS_Q - _FP_FRACBITS_Q) 40*1da177e4SLinus Torvalds #define _FP_WFRACBITS_Q (_FP_WORKBITS + _FP_FRACBITS_Q) 41*1da177e4SLinus Torvalds #define _FP_WFRACXBITS_Q (_FP_FRACTBITS_Q - _FP_WFRACBITS_Q) 42*1da177e4SLinus Torvalds #define _FP_EXPBITS_Q 15 43*1da177e4SLinus Torvalds #define _FP_EXPBIAS_Q 16383 44*1da177e4SLinus Torvalds #define _FP_EXPMAX_Q 32767 45*1da177e4SLinus Torvalds 46*1da177e4SLinus Torvalds #define _FP_QNANBIT_Q \ 47*1da177e4SLinus Torvalds ((_FP_W_TYPE)1 << (_FP_FRACBITS_Q-2) % _FP_W_TYPE_SIZE) 48*1da177e4SLinus Torvalds #define _FP_IMPLBIT_Q \ 49*1da177e4SLinus Torvalds ((_FP_W_TYPE)1 << (_FP_FRACBITS_Q-1) % _FP_W_TYPE_SIZE) 50*1da177e4SLinus Torvalds #define _FP_OVERFLOW_Q \ 51*1da177e4SLinus Torvalds ((_FP_W_TYPE)1 << (_FP_WFRACBITS_Q % _FP_W_TYPE_SIZE)) 52*1da177e4SLinus Torvalds 53*1da177e4SLinus Torvalds #if _FP_W_TYPE_SIZE < 64 54*1da177e4SLinus Torvalds 55*1da177e4SLinus Torvalds union _FP_UNION_Q 56*1da177e4SLinus Torvalds { 57*1da177e4SLinus Torvalds long double flt; 58*1da177e4SLinus Torvalds struct 59*1da177e4SLinus Torvalds { 60*1da177e4SLinus Torvalds #if __BYTE_ORDER == __BIG_ENDIAN 61*1da177e4SLinus Torvalds unsigned sign : 1; 62*1da177e4SLinus Torvalds unsigned exp : _FP_EXPBITS_Q; 63*1da177e4SLinus Torvalds unsigned long frac3 : _FP_FRACBITS_Q - (_FP_IMPLBIT_Q != 0)-(_FP_W_TYPE_SIZE * 3); 64*1da177e4SLinus Torvalds unsigned long frac2 : _FP_W_TYPE_SIZE; 65*1da177e4SLinus Torvalds unsigned long frac1 : _FP_W_TYPE_SIZE; 66*1da177e4SLinus Torvalds unsigned long frac0 : _FP_W_TYPE_SIZE; 67*1da177e4SLinus Torvalds #else 68*1da177e4SLinus Torvalds unsigned long frac0 : _FP_W_TYPE_SIZE; 69*1da177e4SLinus Torvalds unsigned long frac1 : _FP_W_TYPE_SIZE; 70*1da177e4SLinus Torvalds unsigned long frac2 : _FP_W_TYPE_SIZE; 71*1da177e4SLinus Torvalds unsigned long frac3 : _FP_FRACBITS_Q - (_FP_IMPLBIT_Q != 0)-(_FP_W_TYPE_SIZE * 3); 72*1da177e4SLinus Torvalds unsigned exp : _FP_EXPBITS_Q; 73*1da177e4SLinus Torvalds unsigned sign : 1; 74*1da177e4SLinus Torvalds #endif /* not bigendian */ 75*1da177e4SLinus Torvalds } bits __attribute__((packed)); 76*1da177e4SLinus Torvalds }; 77*1da177e4SLinus Torvalds 78*1da177e4SLinus Torvalds 79*1da177e4SLinus Torvalds #define FP_DECL_Q(X) _FP_DECL(4,X) 80*1da177e4SLinus Torvalds #define FP_UNPACK_RAW_Q(X,val) _FP_UNPACK_RAW_4(Q,X,val) 81*1da177e4SLinus Torvalds #define FP_UNPACK_RAW_QP(X,val) _FP_UNPACK_RAW_4_P(Q,X,val) 82*1da177e4SLinus Torvalds #define FP_PACK_RAW_Q(val,X) _FP_PACK_RAW_4(Q,val,X) 83*1da177e4SLinus Torvalds #define FP_PACK_RAW_QP(val,X) \ 84*1da177e4SLinus Torvalds do { \ 85*1da177e4SLinus Torvalds if (!FP_INHIBIT_RESULTS) \ 86*1da177e4SLinus Torvalds _FP_PACK_RAW_4_P(Q,val,X); \ 87*1da177e4SLinus Torvalds } while (0) 88*1da177e4SLinus Torvalds 89*1da177e4SLinus Torvalds #define FP_UNPACK_Q(X,val) \ 90*1da177e4SLinus Torvalds do { \ 91*1da177e4SLinus Torvalds _FP_UNPACK_RAW_4(Q,X,val); \ 92*1da177e4SLinus Torvalds _FP_UNPACK_CANONICAL(Q,4,X); \ 93*1da177e4SLinus Torvalds } while (0) 94*1da177e4SLinus Torvalds 95*1da177e4SLinus Torvalds #define FP_UNPACK_QP(X,val) \ 96*1da177e4SLinus Torvalds do { \ 97*1da177e4SLinus Torvalds _FP_UNPACK_RAW_4_P(Q,X,val); \ 98*1da177e4SLinus Torvalds _FP_UNPACK_CANONICAL(Q,4,X); \ 99*1da177e4SLinus Torvalds } while (0) 100*1da177e4SLinus Torvalds 101*1da177e4SLinus Torvalds #define FP_PACK_Q(val,X) \ 102*1da177e4SLinus Torvalds do { \ 103*1da177e4SLinus Torvalds _FP_PACK_CANONICAL(Q,4,X); \ 104*1da177e4SLinus Torvalds _FP_PACK_RAW_4(Q,val,X); \ 105*1da177e4SLinus Torvalds } while (0) 106*1da177e4SLinus Torvalds 107*1da177e4SLinus Torvalds #define FP_PACK_QP(val,X) \ 108*1da177e4SLinus Torvalds do { \ 109*1da177e4SLinus Torvalds _FP_PACK_CANONICAL(Q,4,X); \ 110*1da177e4SLinus Torvalds if (!FP_INHIBIT_RESULTS) \ 111*1da177e4SLinus Torvalds _FP_PACK_RAW_4_P(Q,val,X); \ 112*1da177e4SLinus Torvalds } while (0) 113*1da177e4SLinus Torvalds 114*1da177e4SLinus Torvalds #define FP_ISSIGNAN_Q(X) _FP_ISSIGNAN(Q,4,X) 115*1da177e4SLinus Torvalds #define FP_NEG_Q(R,X) _FP_NEG(Q,4,R,X) 116*1da177e4SLinus Torvalds #define FP_ADD_Q(R,X,Y) _FP_ADD(Q,4,R,X,Y) 117*1da177e4SLinus Torvalds #define FP_SUB_Q(R,X,Y) _FP_SUB(Q,4,R,X,Y) 118*1da177e4SLinus Torvalds #define FP_MUL_Q(R,X,Y) _FP_MUL(Q,4,R,X,Y) 119*1da177e4SLinus Torvalds #define FP_DIV_Q(R,X,Y) _FP_DIV(Q,4,R,X,Y) 120*1da177e4SLinus Torvalds #define FP_SQRT_Q(R,X) _FP_SQRT(Q,4,R,X) 121*1da177e4SLinus Torvalds #define _FP_SQRT_MEAT_Q(R,S,T,X,Q) _FP_SQRT_MEAT_4(R,S,T,X,Q) 122*1da177e4SLinus Torvalds 123*1da177e4SLinus Torvalds #define FP_CMP_Q(r,X,Y,un) _FP_CMP(Q,4,r,X,Y,un) 124*1da177e4SLinus Torvalds #define FP_CMP_EQ_Q(r,X,Y) _FP_CMP_EQ(Q,4,r,X,Y) 125*1da177e4SLinus Torvalds 126*1da177e4SLinus Torvalds #define FP_TO_INT_Q(r,X,rsz,rsg) _FP_TO_INT(Q,4,r,X,rsz,rsg) 127*1da177e4SLinus Torvalds #define FP_TO_INT_ROUND_Q(r,X,rsz,rsg) _FP_TO_INT_ROUND(Q,4,r,X,rsz,rsg) 128*1da177e4SLinus Torvalds #define FP_FROM_INT_Q(X,r,rs,rt) _FP_FROM_INT(Q,4,X,r,rs,rt) 129*1da177e4SLinus Torvalds 130*1da177e4SLinus Torvalds #define _FP_FRAC_HIGH_Q(X) _FP_FRAC_HIGH_4(X) 131*1da177e4SLinus Torvalds #define _FP_FRAC_HIGH_RAW_Q(X) _FP_FRAC_HIGH_4(X) 132*1da177e4SLinus Torvalds 133*1da177e4SLinus Torvalds #else /* not _FP_W_TYPE_SIZE < 64 */ 134*1da177e4SLinus Torvalds union _FP_UNION_Q 135*1da177e4SLinus Torvalds { 136*1da177e4SLinus Torvalds long double flt /* __attribute__((mode(TF))) */ ; 137*1da177e4SLinus Torvalds struct { 138*1da177e4SLinus Torvalds #if __BYTE_ORDER == __BIG_ENDIAN 139*1da177e4SLinus Torvalds unsigned sign : 1; 140*1da177e4SLinus Torvalds unsigned exp : _FP_EXPBITS_Q; 141*1da177e4SLinus Torvalds unsigned long frac1 : _FP_FRACBITS_Q-(_FP_IMPLBIT_Q != 0)-_FP_W_TYPE_SIZE; 142*1da177e4SLinus Torvalds unsigned long frac0 : _FP_W_TYPE_SIZE; 143*1da177e4SLinus Torvalds #else 144*1da177e4SLinus Torvalds unsigned long frac0 : _FP_W_TYPE_SIZE; 145*1da177e4SLinus Torvalds unsigned long frac1 : _FP_FRACBITS_Q-(_FP_IMPLBIT_Q != 0)-_FP_W_TYPE_SIZE; 146*1da177e4SLinus Torvalds unsigned exp : _FP_EXPBITS_Q; 147*1da177e4SLinus Torvalds unsigned sign : 1; 148*1da177e4SLinus Torvalds #endif 149*1da177e4SLinus Torvalds } bits; 150*1da177e4SLinus Torvalds }; 151*1da177e4SLinus Torvalds 152*1da177e4SLinus Torvalds #define FP_DECL_Q(X) _FP_DECL(2,X) 153*1da177e4SLinus Torvalds #define FP_UNPACK_RAW_Q(X,val) _FP_UNPACK_RAW_2(Q,X,val) 154*1da177e4SLinus Torvalds #define FP_UNPACK_RAW_QP(X,val) _FP_UNPACK_RAW_2_P(Q,X,val) 155*1da177e4SLinus Torvalds #define FP_PACK_RAW_Q(val,X) _FP_PACK_RAW_2(Q,val,X) 156*1da177e4SLinus Torvalds #define FP_PACK_RAW_QP(val,X) \ 157*1da177e4SLinus Torvalds do { \ 158*1da177e4SLinus Torvalds if (!FP_INHIBIT_RESULTS) \ 159*1da177e4SLinus Torvalds _FP_PACK_RAW_2_P(Q,val,X); \ 160*1da177e4SLinus Torvalds } while (0) 161*1da177e4SLinus Torvalds 162*1da177e4SLinus Torvalds #define FP_UNPACK_Q(X,val) \ 163*1da177e4SLinus Torvalds do { \ 164*1da177e4SLinus Torvalds _FP_UNPACK_RAW_2(Q,X,val); \ 165*1da177e4SLinus Torvalds _FP_UNPACK_CANONICAL(Q,2,X); \ 166*1da177e4SLinus Torvalds } while (0) 167*1da177e4SLinus Torvalds 168*1da177e4SLinus Torvalds #define FP_UNPACK_QP(X,val) \ 169*1da177e4SLinus Torvalds do { \ 170*1da177e4SLinus Torvalds _FP_UNPACK_RAW_2_P(Q,X,val); \ 171*1da177e4SLinus Torvalds _FP_UNPACK_CANONICAL(Q,2,X); \ 172*1da177e4SLinus Torvalds } while (0) 173*1da177e4SLinus Torvalds 174*1da177e4SLinus Torvalds #define FP_PACK_Q(val,X) \ 175*1da177e4SLinus Torvalds do { \ 176*1da177e4SLinus Torvalds _FP_PACK_CANONICAL(Q,2,X); \ 177*1da177e4SLinus Torvalds _FP_PACK_RAW_2(Q,val,X); \ 178*1da177e4SLinus Torvalds } while (0) 179*1da177e4SLinus Torvalds 180*1da177e4SLinus Torvalds #define FP_PACK_QP(val,X) \ 181*1da177e4SLinus Torvalds do { \ 182*1da177e4SLinus Torvalds _FP_PACK_CANONICAL(Q,2,X); \ 183*1da177e4SLinus Torvalds if (!FP_INHIBIT_RESULTS) \ 184*1da177e4SLinus Torvalds _FP_PACK_RAW_2_P(Q,val,X); \ 185*1da177e4SLinus Torvalds } while (0) 186*1da177e4SLinus Torvalds 187*1da177e4SLinus Torvalds #define FP_ISSIGNAN_Q(X) _FP_ISSIGNAN(Q,2,X) 188*1da177e4SLinus Torvalds #define FP_NEG_Q(R,X) _FP_NEG(Q,2,R,X) 189*1da177e4SLinus Torvalds #define FP_ADD_Q(R,X,Y) _FP_ADD(Q,2,R,X,Y) 190*1da177e4SLinus Torvalds #define FP_SUB_Q(R,X,Y) _FP_SUB(Q,2,R,X,Y) 191*1da177e4SLinus Torvalds #define FP_MUL_Q(R,X,Y) _FP_MUL(Q,2,R,X,Y) 192*1da177e4SLinus Torvalds #define FP_DIV_Q(R,X,Y) _FP_DIV(Q,2,R,X,Y) 193*1da177e4SLinus Torvalds #define FP_SQRT_Q(R,X) _FP_SQRT(Q,2,R,X) 194*1da177e4SLinus Torvalds #define _FP_SQRT_MEAT_Q(R,S,T,X,Q) _FP_SQRT_MEAT_2(R,S,T,X,Q) 195*1da177e4SLinus Torvalds 196*1da177e4SLinus Torvalds #define FP_CMP_Q(r,X,Y,un) _FP_CMP(Q,2,r,X,Y,un) 197*1da177e4SLinus Torvalds #define FP_CMP_EQ_Q(r,X,Y) _FP_CMP_EQ(Q,2,r,X,Y) 198*1da177e4SLinus Torvalds 199*1da177e4SLinus Torvalds #define FP_TO_INT_Q(r,X,rsz,rsg) _FP_TO_INT(Q,2,r,X,rsz,rsg) 200*1da177e4SLinus Torvalds #define FP_TO_INT_ROUND_Q(r,X,rsz,rsg) _FP_TO_INT_ROUND(Q,2,r,X,rsz,rsg) 201*1da177e4SLinus Torvalds #define FP_FROM_INT_Q(X,r,rs,rt) _FP_FROM_INT(Q,2,X,r,rs,rt) 202*1da177e4SLinus Torvalds 203*1da177e4SLinus Torvalds #define _FP_FRAC_HIGH_Q(X) _FP_FRAC_HIGH_2(X) 204*1da177e4SLinus Torvalds #define _FP_FRAC_HIGH_RAW_Q(X) _FP_FRAC_HIGH_2(X) 205*1da177e4SLinus Torvalds 206*1da177e4SLinus Torvalds #endif /* not _FP_W_TYPE_SIZE < 64 */ 207*1da177e4SLinus Torvalds 208*1da177e4SLinus Torvalds #endif /* __MATH_EMU_QUAD_H__ */ 209