30  *   - R^2 mod p (R = 2^(31k) for the smallest k such that R >= p)
59 	uint32_t y[10];
118 	for (i = 0; i < 10; i ++) {  in cswap()
133 	uint32_t t[10];  in c255_add()
145 	uint32_t t[10];  in c255_sub()
155 	uint32_t t[10];  in c255_mul()
179 	uint32_t x1[10], x2[10], x3[10], z2[10], z3[10];  in api_mul()
180 	uint32_t a[10], aa[10], b[10], bb[10];  in api_mul()
181 	uint32_t c[10], d[10], e[10], da[10], cb[10];  in api_mul()
182 	unsigned char k[32];  in api_mul()  local
234 	 * kb[] is in big-endian notation, but possibly shorter than k[].  in api_mul()
236 	memset(k, 0, (sizeof k) - kblen);  in api_mul()
237 	memcpy(k + (sizeof k) - kblen, kb, kblen);  in api_mul()
238 	k[31] &= 0xF8;  in api_mul()
239 	k[0] &= 0x7F;  in api_mul()
240 	k[0] |= 0x40;  in api_mul()
250 		kt = (k[31 - (i >> 3)] >> (i & 7)) & 1;  in api_mul()