Lines Matching defs:qp

1325     //     Set qp = (u[j+n]*b + u[j+n-1]) / v[n-1]. (qp=qprime=q')
1327     // Now test if qp == b or qp*v[n-2] > b*rp + u[j+n-2]; if so, decrease
1328     // qp by 1, increase rp by v[n-1], and repeat this test if rp < b. The test
1330     // value qp is one too large, and it eliminates all cases where qp is two
1334     uint64_t qp = dividend / v[n-1];
1336     if (qp == b || qp*v[n-2] > b*rp + u[j+n-2]) {
1337       qp--;
1339       if (rp < b && (qp == b || qp*v[n-2] > b*rp + u[j+n-2]))
1340         qp--;
1342     DEBUG_KNUTH(dbgs() << "KnuthDiv: qp == " << qp << ", rp == " << rp << '\n');
1345     // (u[j+n]u[j+n-1]..u[j]) - qp * (v[n-1]...v[1]v[0]). This computation
1354       uint64_t p = uint64_t(qp) * uint64_t(v[i]);
1368     // D5. [Test remainder.] Set q[j] = qp. If the result of step D4 was
1370     q[j] = Lo_32(qp);