Lines Matching refs:opOK
971 assert(status == opOK);
1238 return opOK;
1265 return opOK;
1294 return opOK;
1352 return opOK;
1360 return opOK;
1366 return opOK;
1371 return opOK;
1375 return opOK;
1385 return opOK;
1477 return opOK;
1485 return opOK;
1491 return opOK;
1497 return opOK;
1505 return opOK;
1530 return opOK;
1534 return opOK;
1546 return opOK;
1564 return opOK;
1572 return opOK;
1583 return opOK;
1714 assert(fs==opOK); // should always work
1717 assert(fs==opOK || fs==opInexact); // should not overflow or underflow
1720 assert(fs==opOK || fs==opInexact); // likewise
1754 assert(fs==opOK); // should always work
1757 assert(fs==opOK || fs==opInexact); // should not overflow or underflow
1760 assert(fs==opOK || fs==opInexact); // likewise
1800 /* FS can only be opOK or opInvalidOp. There is no more work
1807 if (fs == opOK)
1822 return opOK;
1837 if (fs != opOK)
1844 if (fs != opOK && fs != opInexact)
2012 *losesInfo = (fs != opOK);
2025 fs = opOK;
2028 fs = opOK;
2066 return opOK;
2142 return opOK;
2153 the original value. This is almost equivalent to result==opOK,
2425 powHUerr = powStatus != opOK;
2436 powHUerr = (powStatus == opOK && calcLostFraction == lfExactlyZero) ? 0:2;
2444 HUerr = HUerrBound(calcLostFraction != lfExactlyZero, sigStatus != opOK,
2503 fs = opOK;
2617 return opOK;
2890 assert(fs == opOK && !losesInfo);
2895 assert(fs == opOK || fs == opInexact);
2905 assert(fs == opOK && !losesInfo);
2911 assert(fs == opOK && !losesInfo);
3143 assert(fs == opOK && !losesInfo);
3150 assert(fs == opOK && !losesInfo);
3723 if (reciprocal.divide(*this, rmNearestTiesToEven) != opOK)
3759 opStatus result = opOK;
