Lines Matching refs:expShift
62 static final int expShift = 52;
64 static final long fractHOB = ( 1L<<expShift ); // assumed High-Order bit
65 static final long expOne = ((long)expBias)<<expShift; // exponent of 1.0
210 int binexp = (int)(lbits >>> expShift);
228 int lowOrderZeros = expShift+1-nbits;
244 int binexp = (int)(lbits >>> expShift);
246 if ( subtracting && ( binexp >= expShift ) && ((lbits&fractMask) == 0L) ){
251 if ( binexp > expShift ){
252 ulpval = Double.longBitsToDouble( ((long)(binexp-expShift))<<expShift );
421 binExp = (int)( (dBits&expMask) >> expShift );
423 if ( binExp == (int)(expMask>>expShift) ) {
451 nSignificantBits = expShift + binExp +1; // recall binExp is - shift count.
455 nSignificantBits = expShift+1;
519 dtoa( binExp, ((long)fractBits)<<(expShift-singleExpShift), nSignificantBits );
546 * (b) nTinyBits > 0: Shift right by expShift-nFractBits,
561 if ( binExp >= expShift ){
562 fractBits <<= (binExp-expShift);
564 fractBits >>>= (expShift-binExp) ;
577 * fractBits >>>= expShift+1-nFractBits;
641 * by (expShift+1-nFractBits) zeros. In the interest of compactness,
646 fractBits >>>= (expShift+1-nFractBits);
1512 // half an ULP is at 2^-(expBias+expShift+1)
1513 hulpbias = bigIntExp+ expBias + expShift;
1515 hulpbias = expShift + 2 - bigIntNBits;