Lines Matching defs:fractBits
475 long fractBits;
492 fractBits = dBits&fractMask;
495 if ( fractBits == 0L ){
510 if ( fractBits == 0L ){
517 while ( (fractBits&fractHOB) == 0L ){
518 fractBits <<= 1;
524 fractBits |= fractHOB;
529 dtoa( binExp, fractBits, nSignificantBits );
542 int fractBits;
559 fractBits = fBits&singleFractMask;
562 if ( fractBits == 0L ){
577 if ( fractBits == 0 ){
584 while ( (fractBits&singleFractHOB) == 0 ){
585 fractBits <<= 1;
591 fractBits |= singleFractHOB;
596 dtoa( binExp, ((long)fractBits)<<(expShift-singleExpShift), nSignificantBits );
600 dtoa( int binExp, long fractBits, int nSignificantBits )
602 int nFractBits; // number of significant bits of fractBits;
609 nFractBits = countBits( fractBits );
639 fractBits <<= (binExp-expShift);
641 fractBits >>>= (expShift-binExp) ;
643 developLongDigits( 0, fractBits, halfULP );
654 * fractBits >>>= expShift+1-nFractBits;
655 * fractBits *= long5pow[ nTinyBits ];
657 * developLongDigits( -nTinyBits, fractBits, halfULP );
696 expOne | ( fractBits &~ fractHOB ) );
716 * the long integer fractBits contains the (nFractBits) interesting
719 * I will shift out those zeros before turning fractBits into a
723 fractBits >>>= (expShift+1-nFractBits);
781 int b = ((int)fractBits * small5pow[B5] ) << B2;
834 long b = (fractBits * long5pow[B5] ) << B2;
894 Bval = multPow52( new FDBigInt( fractBits ), B5, B2 );