30  *   - R^2 mod p (R = 2^(15k) for the smallest k such that R >= p)
55 	uint16_t y[18];
121 	for (i = 0; i < 18; i ++) {  in cswap()
136 	uint16_t t[18];  in c255_add()
148 	uint16_t t[18];  in c255_sub()
158 	uint16_t t[18];  in c255_mul()
182 #define ILEN   (18 * sizeof(uint16_t))  in api_mul()
188 	uint16_t x1[18], x2[18], x3[18], z2[18], z3[18];  in api_mul()
189 	uint16_t a[19], aa[18], b[19], bb[18];  in api_mul()
190 	uint16_t c[18], d[18], e[18], da[18], cb[18];  in api_mul()
191 	unsigned char k[32];  in api_mul()  local
226 	b[18] = 1;  in api_mul()
242 	memset(k, 0, (sizeof k) - kblen);  in api_mul()
243 	memcpy(k + (sizeof k) - kblen, kb, kblen);  in api_mul()
244 	k[31] &= 0xF8;  in api_mul()
245 	k[0] &= 0x7F;  in api_mul()
246 	k[0] |= 0x40;  in api_mul()
256 		kt = (k[31 - (i >> 3)] >> (i & 7)) & 1;  in api_mul()