Lines Matching refs:fractBits
408 long fractBits;
422 fractBits = dBits&fractMask;
425 if ( fractBits == 0L ){
440 if ( fractBits == 0L ){
447 while ( (fractBits&fractHOB) == 0L ){
448 fractBits <<= 1;
454 fractBits |= fractHOB;
459 dtoa( binExp, fractBits, nSignificantBits );
468 int fractBits;
482 fractBits = fBits&singleFractMask;
485 if ( fractBits == 0L ){
500 if ( fractBits == 0 ){
507 while ( (fractBits&singleFractHOB) == 0 ){
508 fractBits <<= 1;
514 fractBits |= singleFractHOB;
519 dtoa( binExp, ((long)fractBits)<<(expShift-singleExpShift), nSignificantBits );
523 dtoa( int binExp, long fractBits, int nSignificantBits )
525 int nFractBits; // number of significant bits of fractBits;
532 nFractBits = countBits( fractBits );
562 fractBits <<= (binExp-expShift);
564 fractBits >>>= (expShift-binExp) ;
566 developLongDigits( 0, fractBits, halfULP );
577 * fractBits >>>= expShift+1-nFractBits;
578 * fractBits *= long5pow[ nTinyBits ];
580 * developLongDigits( -nTinyBits, fractBits, halfULP );
619 expOne | ( fractBits &~ fractHOB ) );
639 * the long integer fractBits contains the (nFractBits) interesting
642 * I will shift out those zeros before turning fractBits into a
646 fractBits >>>= (expShift+1-nFractBits);
704 int b = ((int)fractBits * small5pow[B5] ) << B2;
757 long b = (fractBits * long5pow[B5] ) << B2;
817 Bval = multPow52( new FDBigInt( fractBits ), B5, B2 );