Lines Matching defs:binExp
409 int binExp;
421 binExp = (int)( (dBits&expMask) >> expShift );
423 if ( binExp == (int)(expMask>>expShift) ) {
439 if ( binExp == 0 ){
449 binExp -= 1;
451 nSignificantBits = expShift + binExp +1; // recall binExp is - shift count.
452 binExp += 1;
457 binExp -= expBias;
459 dtoa( binExp, fractBits, nSignificantBits );
469 int binExp;
481 binExp = (int)( (fBits&singleExpMask) >> singleExpShift );
483 if ( binExp == (int)(singleExpMask>>singleExpShift) ) {
499 if ( binExp == 0 ){
509 binExp -= 1;
511 nSignificantBits = singleExpShift + binExp +1; // recall binExp is - shift count.
512 binExp += 1;
517 binExp -= singleExpBias;
519 dtoa( binExp, ((long)fractBits)<<(expShift-singleExpShift), nSignificantBits );
523 dtoa( int binExp, long fractBits, int nSignificantBits )
533 nTinyBits = Math.max( 0, nFractBits - binExp - 1 );
534 if ( binExp <= maxSmallBinExp && binExp >= minSmallBinExp ){
556 if ( binExp > nSignificantBits ){
557 halfULP = 1L << ( binExp-nSignificantBits-1);
561 if ( binExp >= expShift ){
562 fractBits <<= (binExp-expShift);
564 fractBits >>>= (expShift-binExp) ;
614 * log10(d) ~=~ log10(d2) + binExp * log10(2)
621 (d2-1.5D)*0.289529654D + 0.176091259 + (double)binExp * 0.301029995663981 );
630 B2 = B5 + nTinyBits + binExp;
644 * d * 2^(nFractBits-1-binExp).