Lines Matching defs:is
50 * which is very efficient as bit twiddling is all that is needed. All
51 * other machines can use this code but the code is inefficient as
57 * e.g. the exponent is too big/small.
110 struct ieee_single is;
127 is.exp = 0;
128 is.mantissa = (vs.mantissa1 << 16) | vs.mantissa2;
130 is.mantissa >>= 3 - vs.exp;
131 is.mantissa += (1 << (20 + vs.exp));
141 is = lim->ieee;
145 is.exp = vs.exp - VAX_SNG_BIAS + IEEE_SNG_BIAS;
146 is.mantissa = (vs.mantissa1 << 16) | vs.mantissa2;
148 is.sign = vs.sign;
149 return (XDR_PUTINT32(xdrs, (int32_t *)&is));
185 val += 127 + exp; /* 127 is the bias */
200 if (!XDR_GETINT32(xdrs, (int32_t *)&is))
207 if ((is.exp == lim->ieee.exp) &&
208 (is.mantissa == lim->ieee.mantissa)) {
211 } else if ((is.exp == 0) && (lim->ieee.exp == 0)) {
213 unsigned tmp = is.mantissa >> 20;
222 tmp = is.mantissa - (1 << (20 + vsp->exp));
228 vsp->exp = is.exp - IEEE_SNG_BIAS + VAX_SNG_BIAS;
229 vsp->mantissa2 = is.mantissa;
230 vsp->mantissa1 = (is.mantissa >> 16);
232 vsp->sign = is.sign;
407 val[0] += 1023 + exp; /* 1023 is the bias */