qr
protostr, header.qr ? 'R' : 'C');
if (header.qr) {
if (header.qr) {
if (header.qr || ancount > 0) {
if (header.qr || nscount > 0) {
if (header.qr || arcount > 0) {
ficl2IntegerQR qr;
qr = FICL_2UNSIGNEDQR_TO_2INTEGERQR(uqr);
qr.quotient = ficl2IntegerNegate(qr.quotient);
if (qr.remainder != 0) {
qr.quotient = ficl2IntegerDecrement(qr.quotient);
qr.remainder = den - qr.remainder;
qr.remainder = -qr.remainder;
return (qr);
ficl2IntegerQR qr;
qr = FICL_2UNSIGNEDQR_TO_2INTEGERQR(uqr);
qr.remainder = -qr.remainder;
qr.quotient = ficl2IntegerNegate(qr.quotient);
return (qr);
ficl2IntegerQR qr;
qr = ficl2IntegerDivideFloored(d1, n1);
ficlStackPushInteger(vm->dataStack, qr.remainder);
FICL_2UNSIGNED_GET_LOW(qr.quotient));
ficl2IntegerQR qr;
qr = ficl2IntegerDivideSymmetric(d1, n1);
ficlStackPushInteger(vm->dataStack, qr.remainder);
FICL_2UNSIGNED_GET_LOW(qr.quotient));
ficl2IntegerQR qr;
qr = ficl2IntegerDivideSymmetric(d1, n1);
ficlStackPushInteger(vm->dataStack, qr.remainder);
ficl2IntegerQR qr;
qr = ficl2IntegerDivideSymmetric(n1, n2);
dataTop[-1].i = qr.remainder;
dataTop[0].i = FICL_2UNSIGNED_GET_LOW(qr.quotient);
ficl2IntegerQR qr;
qr = ficl2IntegerDivideSymmetric(prod, z);
dataTop[-1].i = qr.remainder;
dataTop[0].i = FICL_2UNSIGNED_GET_LOW(qr.quotient);
unsigned qr: 1; /* response flag */
unsigned qr :1; /* response flag */
static const GENERIC qr[7] = { /* [8 -- inf] qzero 6950 */
r = qr[5]+z*qr[6];
r = r*z + qr[i];
q0 = ((qr[0] + z * (qr[1] + z * (qr[2] + z * (qr[3] +
z * (qr[4] + z * (qr[5] + z * qr[6])))))) /
q0 = ((qr[0] + z * (qr[1] + z * (qr[2] + z * (qr[3] +
z * (qr[4] + z * (qr[5] + z * qr[6])))))) /
u_char qr:1; /* response flag */
u_char qr:1; /* response flag */
if (hp->qr)
_RAIDZ_REC_WRAP(qr, impl); \