Home | History | Annotate | Download | only in quad

Lines Matching defs:qhat

80 	u_int qhat, rhat, t;
192 		 * D3: Calculate qhat (\^q, in TeX notation).
193 		 * Let qhat = min((u[j]*B + u[j+1])/v[1], B-1), and
195 		 * While rhat < B and v[2]*qhat > rhat*B+u[j+2],
196 		 * decrement qhat and increase rhat correspondingly.
197 		 * Note that if rhat >= B, v[2]*qhat < rhat*B.
203 			qhat = B;
208 			qhat = nn / v1;
211 		while (v2 * qhat > COMBINE(rhat, uj2)) {
213 			qhat--;
224 			t = u[i + j] - v[i] * qhat - t;
233 		 * in that (rare) case, qhat was too large (by exactly 1).
237 			qhat--;
245 		q[j] = (digit)qhat;