Lines Matching refs:fs
1614 opStatus fs;
1616 fs = addOrSubtractSpecials(rhs, subtract);
1619 if (fs == opDivByZero) {
1623 fs = normalize(rounding_mode, lost_fraction);
1637 return fs;
1658 opStatus fs;
1661 fs = multiplySpecials(rhs);
1665 fs = normalize(rounding_mode, lost_fraction);
1667 fs = (opStatus) (fs | opInexact);
1670 return fs;
1677 opStatus fs;
1680 fs = divideSpecials(rhs);
1684 fs = normalize(rounding_mode, lost_fraction);
1686 fs = (opStatus) (fs | opInexact);
1689 return fs;
1696 opStatus fs;
1700 fs = V.divide(rhs, rmNearestTiesToEven);
1701 if (fs == opDivByZero)
1702 return fs;
1707 fs = V.convertToInteger(x, parts * integerPartWidth, true,
1709 if (fs==opInvalidOp)
1710 return fs;
1712 fs = V.convertFromZeroExtendedInteger(x, parts * integerPartWidth, true,
1714 assert(fs==opOK); // should always work
1716 fs = V.multiply(rhs, rmNearestTiesToEven);
1717 assert(fs==opOK || fs==opInexact); // should not overflow or underflow
1719 fs = subtract(V, rmNearestTiesToEven);
1720 assert(fs==opOK || fs==opInexact); // likewise
1725 return fs;
1733 opStatus fs;
1734 fs = modSpecials(rhs);
1740 fs = V.divide(rhs, rmNearestTiesToEven);
1741 if (fs == opDivByZero)
1742 return fs;
1747 fs = V.convertToInteger(x, parts * integerPartWidth, true,
1749 if (fs==opInvalidOp)
1750 return fs;
1752 fs = V.convertFromZeroExtendedInteger(x, parts * integerPartWidth, true,
1754 assert(fs==opOK); // should always work
1756 fs = V.multiply(rhs, rounding_mode);
1757 assert(fs==opOK || fs==opInexact); // should not overflow or underflow
1759 fs
1760 assert(fs==opOK || fs==opInexact); // likewise
1766 return fs;
1775 opStatus fs;
1788 fs = normalize(rounding_mode, lost_fraction);
1790 fs = (opStatus) (fs | opInexact);
1798 fs = multiplySpecials(multiplicand);
1800 /* FS can only be opOK or opInvalidOp. There is no more work
1807 if (fs == opOK)
1808 fs = addOrSubtract(addend, rounding_mode, false);
1811 return fs;
1816 opStatus fs;
1833 fs = MagicConstant.convertFromAPInt(IntegerConstant, false,
1837 if (fs != opOK)
1838 return fs;
1843 fs = add(MagicConstant, rounding_mode);
1844 if (fs != opOK && fs != opInexact)
1845 return fs;
1847 fs = subtract(MagicConstant, rounding_mode);
1853 return fs;
1943 opStatus fs;
2011 fs = normalize(rounding_mode, lostFraction);
2012 *losesInfo = (fs != opOK);
2025 fs = opOK;
2028 fs = opOK;
2031 return fs;
2161 opStatus fs;
2163 fs = convertToSignExtendedInteger(parts, width, isSigned, rounding_mode,
2166 if (fs == opInvalidOp) {
2183 return fs;
2471 opStatus fs;
2503 fs = opOK;
2508 fs = handleOverflow(rounding_mode);
2520 fs = normalize(rounding_mode, lfLessThanHalf);
2526 fs = handleOverflow(rounding_mode);
2576 fs = roundSignificandWithExponent(decSignificand, partCount,
2582 return fs;
2877 opStatus fs;
2889 fs = extended.convert(extendedSemantics, rmNearestTiesToEven, &losesInfo);
2890 assert(fs == opOK && !losesInfo);
2891 (void)fs;
2894 fs = u.convert(IEEEdouble, rmNearestTiesToEven, &losesInfo);
2895 assert(fs == opOK || fs == opInexact);
2896 (void)fs;
2904 fs = u.convert(extendedSemantics, rmNearestTiesToEven, &losesInfo);
2905 assert(fs == opOK && !losesInfo);
2906 (void)fs;
2910 fs = v.convert(IEEEdouble, rmNearestTiesToEven, &losesInfo);
2911 assert(fs == opOK && !losesInfo);
2912 (void)fs;
3137 opStatus fs;
3142 fs = convert(PPCDoubleDouble, rmNearestTiesToEven, &losesInfo);
3143 assert(fs == opOK && !losesInfo);
3144 (void)fs;
3149 fs = v.convert(PPCDoubleDouble, rmNearestTiesToEven, &losesInfo);
3150 assert(fs == opOK && !losesInfo);
3151 (void)fs;
