Lines Matching defs:expShift
70 static final int expShift = 52;
72 static final long fractHOB = ( 1L<<expShift ); // assumed High-Order bit
73 static final long expOne = ((long)expBias)<<expShift; // exponent of 1.0
218 int binexp = (int)(lbits >>> expShift);
236 int lowOrderZeros = expShift+1-nbits;
252 int binexp = (int)(lbits >>> expShift);
254 if ( subtracting && ( binexp >= expShift ) && ((lbits&fractMask) == 0L) ){
259 if ( binexp > expShift ){
260 ulpval = Double.longBitsToDouble( ((long)(binexp-expShift))<<expShift );
491 binExp = (int)( (dBits&expMask) >> expShift );
493 if ( binExp == (int)(expMask>>expShift) ) {
521 nSignificantBits = expShift + binExp +1; // recall binExp is - shift count.
525 nSignificantBits = expShift+1;
596 dtoa( binExp, ((long)fractBits)<<(expShift-singleExpShift), nSignificantBits );
623 * (b) nTinyBits > 0: Shift right by expShift-nFractBits,
638 if ( binExp >= expShift ){
639 fractBits <<= (binExp-expShift);
641 fractBits >>>= (expShift-binExp) ;
654 * fractBits >>>= expShift+1-nFractBits;
718 * by (expShift+1-nFractBits) zeros. In the interest of compactness,
723 fractBits >>>= (expShift+1-nFractBits);
1418 // half an ULP is at 2^-(expBias+expShift+1)
1419 hulpbias = bigIntExp+ expBias + expShift;
1421 hulpbias = expShift + 2 - bigIntNBits;