Lines Matching refs:rp
1545 // Set rp = (u[j+n]*b + u[j+n-1]) % v[n-1]. (rp=rprime=r')
1546 // Now test if qp == b or qp*v[n-2] > b*rp + u[j+n-2]; if so, decrease
1547 // qp by 1, inrease rp by v[n-1], and repeat this test if rp < b. The test
1554 uint64_t rp = dividend % v[n-1];
1555 if (qp == b || qp*v[n-2] > b*rp + u[j+n-2]) {
1557 rp += v[n-1];
1558 if (rp < b && (qp == b || qp*v[n-2] > b*rp + u[j+n-2]))
1561 DEBUG(dbgs() << "KnuthDiv: qp == " << qp << ", rp == " << rp << '\n');