30  * each stored in a 32-bit slot (top bit is zero) in little-endian
33  * some cases, the top word is allowed to have a 32th bit.
45 	size_t k;  in cond_negate()  local
50 	for (k = 0; k < len; k ++) {  in cond_negate()
53 		aw = a[k];  in cond_negate()
55 		a[k] = aw & 0x7FFFFFFF;  in cond_negate()
66  * If neg = 0, then the top word of a[] may use 32 bits.
73 	size_t k;  in finish_mod()  local
83 	for (k = 0; k < len; k ++) {  in finish_mod()
86 		aw = a[k];  in finish_mod()
87 		mw = m[k];  in finish_mod()
100 	for (k = 0; k < len; k ++) {  in finish_mod()
103 		aw = a[k];  in finish_mod()
104 		mw = (m[k] ^ xm) & ym;  in finish_mod()
106 		a[k] = aw & 0x7FFFFFFF;  in finish_mod()
123  * to contain an extra 32th bit.
129 	size_t k;  in co_reduce()  local
135 	for (k = 0; k < len; k ++) {  in co_reduce()
146 		 *   |cca| <= 2^32 - 1  in co_reduce()
148 		 *   |za| <= (2^31-1)*(2^32) + (2^32-1) = 2^63 - 1  in co_reduce()
150 		 * Thus, the new value of cca is such that |cca| <= 2^32 - 1.  in co_reduce()
153 		wa = a[k];  in co_reduce()
154 		wb = b[k];  in co_reduce()
157 		if (k > 0) {  in co_reduce()
158 			a[k - 1] = za & 0x7FFFFFFF;  in co_reduce()
159 			b[k - 1] = zb & 0x7FFFFFFF;  in co_reduce()
168 #define M   ((uint64_t)1 << 32)  in co_reduce()
196  * to contain an extra 32th bit.
203 	size_t k;  in co_reduce_mod()  local
211 	for (k = 0; k < len; k ++) {  in co_reduce_mod()
220 		wa = a[k];  in co_reduce_mod()
221 		wb = b[k];  in co_reduce_mod()
223 			+ m[k] * (uint64_t)fa + (uint64_t)cca;  in co_reduce_mod()
225 			+ m[k] * (uint64_t)fb + (uint64_t)ccb;  in co_reduce_mod()
226 		if (k > 0) {  in co_reduce_mod()
227 			a[k - 1] = (uint32_t)za & 0x7FFFFFFF;  in co_reduce_mod()
228 			b[k - 1] = (uint32_t)zb & 0x7FFFFFFF;  in co_reduce_mod()
231 #define M   ((uint64_t)1 << 32)  in co_reduce_mod()
248 	 * The top word of 'a' and 'b' may have a 32-th bit set.  in co_reduce_mod()
287 	 * if m has bit length k bits, then 2k-2 steps are sufficient.  in br_i31_moddiv()
317 	size_t len, k;  in br_i31_moddiv()  local
483 	for (k = 1; k < len; k ++) {  in br_i31_moddiv()
484 		r |= a[k] | b[k];  in br_i31_moddiv()
485 		u[k] |= v[k];  in br_i31_moddiv()