Lines Matching defs:binExp
476 int binExp;
491 binExp = (int)( (dBits&expMask) >> expShift );
493 if ( binExp == (int)(expMask>>expShift) ) {
509 if ( binExp == 0 ){
519 binExp -= 1;
521 nSignificantBits = expShift + binExp +1; // recall binExp is - shift count.
522 binExp += 1;
527 binExp -= expBias;
529 dtoa( binExp, fractBits, nSignificantBits );
543 int binExp;
558 binExp = (int)( (fBits&singleExpMask) >> singleExpShift );
560 if ( binExp == (int)(singleExpMask>>singleExpShift) ) {
576 if ( binExp == 0 ){
586 binExp -= 1;
588 nSignificantBits = singleExpShift + binExp +1; // recall binExp is - shift count.
589 binExp += 1;
594 binExp -= singleExpBias;
596 dtoa( binExp, ((long)fractBits)<<(expShift-singleExpShift), nSignificantBits );
600 dtoa( int binExp, long fractBits, int nSignificantBits )
610 nTinyBits = Math.max( 0, nFractBits - binExp - 1 );
611 if ( binExp <= maxSmallBinExp && binExp >= minSmallBinExp ){
633 if ( binExp > nSignificantBits ){
634 halfULP = 1L << ( binExp-nSignificantBits-1);
638 if ( binExp >= expShift ){
639 fractBits <<= (binExp-expShift);
641 fractBits >>>= (expShift-binExp) ;
691 * log10(d) ~=~ log10(d2) + binExp * log10(2)
698 (d2-1.5D)*0.289529654D + 0.176091259 + (double)binExp * 0.301029995663981 );
707 B2 = B5 + nTinyBits + binExp;
721 * d * 2^(nFractBits-1-binExp).