Lines Matching +full:no +full:- +full:high +full:- +full:z

18  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
28  * Constant-time division. The divisor must not be larger than 16 bits,
39 	for (i = 16; i >= 0; i --) {  in divrem16()
44 		x -= (-ctl) & d;  in divrem16()
55 br_i15_muladd_small(uint16_t *x, uint16_t z, const uint16_t *m)  in br_i15_muladd_small()  argument
58 	 * Constant-time: we accept to leak the exact bit length of the  in br_i15_muladd_small()
76 		divrem16(((uint32_t)x[1] << 15) | z, m[1], &rem);  in br_i15_muladd_small()
84 	 * Principle: we estimate the quotient (x*2^15+z)/m by  in br_i15_muladd_small()
85 	 * doing a 30/15 division with the high words.  in br_i15_muladd_small()
99 	 * b0, we ensured that b0 is "full" (high bit set), and a is  in br_i15_muladd_small()
107 	 *   u-2 <= q <= u  in br_i15_muladd_small()
112 		memmove(x + 2, x + 1, (mlen - 1) * sizeof *x);  in br_i15_muladd_small()
113 		x[1] = z;  in br_i15_muladd_small()
117 		a0 = (x[mlen] << (15 - mblr)) | (x[mlen - 1] >> mblr);  in br_i15_muladd_small()
118 		memmove(x + 2, x + 1, (mlen - 1) * sizeof *x);  in br_i15_muladd_small()
119 		x[1] = z;  in br_i15_muladd_small()
120 		a = (a0 << 15) | (((x[mlen] << (15 - mblr))  in br_i15_muladd_small()
121 			| (x[mlen - 1] >> mblr)) & 0x7FFF);  in br_i15_muladd_small()
122 		b = (m[mlen] << (15 - mblr)) | (m[mlen - 1] >> mblr);  in br_i15_muladd_small()
128 	 * q-1 or q-2; moreover, the division may have returned a value  in br_i15_muladd_small()
129 	 * 8000 or even 8001 if the two high words were identical, and  in br_i15_muladd_small()
131 	 * that the "true" multiplier will be q+1, q or q-1, and q is  in br_i15_muladd_small()
134 	q = MUX(EQ(b, a0), 0x7FFF, q - 1 + ((q - 1) >> 31));  in br_i15_muladd_small()
137 	 * We subtract q*m from x (x has an extra high word of value 'hi').  in br_i15_muladd_small()
155 		nxw = xw - zl;  in br_i15_muladd_small()
164 	 * beyond the top array word), or cc == hi and tb is true (no  in br_i15_muladd_small()