Lines Matching +full:- +full:z
72 * A field element is encoded as four 64-bit integers, in basis 2^63.
77 #define MASK63 (((uint64_t)1 << 63) - (uint64_t)1)
87 m = -(uint64_t)ctl; in f255_cswap()
103 unsigned __int128 z; in f255_add() local
105 z = (unsigned __int128)a[0] + (unsigned __int128)b[0]; in f255_add()
106 t0 = (uint64_t)z; in f255_add()
107 z = (unsigned __int128)a[1] + (unsigned __int128)b[1] + (z >> 64); in f255_add()
108 t1 = (uint64_t)z; in f255_add()
109 z = (unsigned __int128)a[2] + (unsigned __int128)b[2] + (z >> 64); in f255_add()
110 t2 = (uint64_t)z; in f255_add()
111 z = (unsigned __int128)a[3] + (unsigned __int128)b[3] + (z >> 64); in f255_add()
112 t3 = (uint64_t)z & MASK63; in f255_add()
113 cc = (uint64_t)(z >> 63); in f255_add()
123 z = (unsigned __int128)t0 + (unsigned __int128)(19 * cc); in f255_add()
124 d[0] = (uint64_t)z; in f255_add()
125 z = (unsigned __int128)t1 + (z >> 64); in f255_add()
126 d[1] = (uint64_t)z; in f255_add()
127 z = (unsigned __int128)t2 + (z >> 64); in f255_add()
128 d[2] = (uint64_t)z; in f255_add()
129 d[3] = t3 + (uint64_t)(z >> 64); in f255_add()
168 * We compute t = 2^256 - 38 + a - b, which is necessarily in f255_sub()
175 unsigned __int128 z; in f255_sub() local
177 z = (unsigned __int128)a[0] - (unsigned __int128)b[0] - 38; in f255_sub()
178 t0 = (uint64_t)z; in f255_sub()
179 cc = -(uint64_t)(z >> 64); in f255_sub()
180 z = (unsigned __int128)a[1] - (unsigned __int128)b[1] in f255_sub()
181 - (unsigned __int128)cc; in f255_sub()
182 t1 = (uint64_t)z; in f255_sub()
183 cc = -(uint64_t)(z >> 64); in f255_sub()
184 z = (unsigned __int128)a[2] - (unsigned __int128)b[2] in f255_sub()
185 - (unsigned __int128)cc; in f255_sub()
186 t2 = (uint64_t)z; in f255_sub()
187 cc = -(uint64_t)(z >> 64); in f255_sub()
188 z = (unsigned __int128)a[3] - (unsigned __int128)b[3] in f255_sub()
189 - (unsigned __int128)cc; in f255_sub()
190 t3 = (uint64_t)z; in f255_sub()
191 t4 = 1 + (uint64_t)(z >> 64); in f255_sub()
194 * We have a 257-bit result. The two top bits can be 00, 01 or 10, in f255_sub()
195 * but not 11 (value t <= 2^256 - 38 + 2^255 + 37 = 2^256 + 2^255 - 1). in f255_sub()
199 cc = (38 & -t4) + (19 & -(t3 >> 63)); in f255_sub()
201 z = (unsigned __int128)t0 + (unsigned __int128)cc; in f255_sub()
202 d[0] = (uint64_t)z; in f255_sub()
203 z = (unsigned __int128)t1 + (z >> 64); in f255_sub()
204 d[1] = (uint64_t)z; in f255_sub()
205 z = (unsigned __int128)t2 + (z >> 64); in f255_sub()
206 d[2] = (uint64_t)z; in f255_sub()
207 d[3] = t3 + (uint64_t)(z >> 64); in f255_sub()
212 * We compute t = 2^256 - 38 + a - b, which is necessarily in f255_sub()
234 * We have a 257-bit result. The two top bits can be 00, 01 or 10, in f255_sub()
235 * but not 11 (value t <= 2^256 - 38 + 2^255 + 37 = 2^256 + 2^255 - 1). in f255_sub()
239 t4 = (38 & -t4) + (19 & -(t3 >> 63)); in f255_sub()
257 unsigned __int128 z; in f255_mul() local
263 z = (unsigned __int128)a[0] * (unsigned __int128)b[0]; in f255_mul()
264 t0 = (uint64_t)z; in f255_mul()
265 z = (unsigned __int128)a[0] * (unsigned __int128)b[1] + (z >> 64); in f255_mul()
266 t1 = (uint64_t)z; in f255_mul()
267 z = (unsigned __int128)a[0] * (unsigned __int128)b[2] + (z >> 64); in f255_mul()
268 t2 = (uint64_t)z; in f255_mul()
269 z = (unsigned __int128)a[0] * (unsigned __int128)b[3] + (z >> 64); in f255_mul()
270 t3 = (uint64_t)z; in f255_mul()
271 t4 = (uint64_t)(z >> 64); in f255_mul()
273 z = (unsigned __int128)a[1] * (unsigned __int128)b[0] in f255_mul()
275 t1 = (uint64_t)z; in f255_mul()
276 z = (unsigned __int128)a[1] * (unsigned __int128)b[1] in f255_mul()
277 + (unsigned __int128)t2 + (z >> 64); in f255_mul()
278 t2 = (uint64_t)z; in f255_mul()
279 z = (unsigned __int128)a[1] * (unsigned __int128)b[2] in f255_mul()
280 + (unsigned __int128)t3 + (z >> 64); in f255_mul()
281 t3 = (uint64_t)z; in f255_mul()
282 z = (unsigned __int128)a[1] * (unsigned __int128)b[3] in f255_mul()
283 + (unsigned __int128)t4 + (z >> 64); in f255_mul()
284 t4 = (uint64_t)z; in f255_mul()
285 t5 = (uint64_t)(z >> 64); in f255_mul()
287 z = (unsigned __int128)a[2] * (unsigned __int128)b[0] in f255_mul()
289 t2 = (uint64_t)z; in f255_mul()
290 z = (unsigned __int128)a[2] * (unsigned __int128)b[1] in f255_mul()
291 + (unsigned __int128)t3 + (z >> 64); in f255_mul()
292 t3 = (uint64_t)z; in f255_mul()
293 z = (unsigned __int128)a[2] * (unsigned __int128)b[2] in f255_mul()
294 + (unsigned __int128)t4 + (z >> 64); in f255_mul()
295 t4 = (uint64_t)z; in f255_mul()
296 z = (unsigned __int128)a[2] * (unsigned __int128)b[3] in f255_mul()
297 + (unsigned __int128)t5 + (z >> 64); in f255_mul()
298 t5 = (uint64_t)z; in f255_mul()
299 t6 = (uint64_t)(z >> 64); in f255_mul()
301 z = (unsigned __int128)a[3] * (unsigned __int128)b[0] in f255_mul()
303 t3 = (uint64_t)z; in f255_mul()
304 z = (unsigned __int128)a[3] * (unsigned __int128)b[1] in f255_mul()
305 + (unsigned __int128)t4 + (z >> 64); in f255_mul()
306 t4 = (uint64_t)z; in f255_mul()
307 z = (unsigned __int128)a[3] * (unsigned __int128)b[2] in f255_mul()
308 + (unsigned __int128)t5 + (z >> 64); in f255_mul()
309 t5 = (uint64_t)z; in f255_mul()
310 z = (unsigned __int128)a[3] * (unsigned __int128)b[3] in f255_mul()
311 + (unsigned __int128)t6 + (z >> 64); in f255_mul()
312 t6 = (uint64_t)z; in f255_mul()
313 t7 = (uint64_t)(z >> 64); in f255_mul()
337 z = (unsigned __int128)t4 * 19; in f255_mul()
338 t4 = (uint64_t)z; in f255_mul()
339 z = (unsigned __int128)t5 * 19 + (z >> 64); in f255_mul()
340 t5 = (uint64_t)z; in f255_mul()
341 z = (unsigned __int128)t6 * 19 + (z >> 64); in f255_mul()
342 t6 = (uint64_t)z; in f255_mul()
343 z = (unsigned __int128)t7 * 19 + (z >> 64); in f255_mul()
344 t7 = (uint64_t)z & MASK63; in f255_mul()
346 th = (361 & -th) + (19 * (uint64_t)(z >> 63)); in f255_mul()
355 z = (unsigned __int128)t0 + (unsigned __int128)t4 in f255_mul()
357 t0 = (uint64_t)z; in f255_mul()
358 z = (unsigned __int128)t1 + (unsigned __int128)t5 + (z >> 64); in f255_mul()
359 t1 = (uint64_t)z; in f255_mul()
360 z = (unsigned __int128)t2 + (unsigned __int128)t6 + (z >> 64); in f255_mul()
361 t2 = (uint64_t)z; in f255_mul()
362 z = (unsigned __int128)t3 + (unsigned __int128)t7 + (z >> 64); in f255_mul()
363 t3 = (uint64_t)z & MASK63; in f255_mul()
364 th = (uint64_t)(z >> 63); in f255_mul()
371 z = (unsigned __int128)t0 + (19 * th); in f255_mul()
372 d[0] = (uint64_t)z; in f255_mul()
373 z = (unsigned __int128)t1 + (z >> 64); in f255_mul()
374 d[1] = (uint64_t)z; in f255_mul()
375 z = (unsigned __int128)t2 + (z >> 64); in f255_mul()
376 d[2] = (uint64_t)z; in f255_mul()
377 d[3] = t3 + (uint64_t)(z >> 64); in f255_mul()
457 th = (361 & -th) + (19 * ((h3 << 1) + (t7 >> 63))); in f255_mul()
503 unsigned __int128 z; in f255_mul_a24() local
505 z = (unsigned __int128)a[0] * 121665; in f255_mul_a24()
506 t0 = (uint64_t)z; in f255_mul_a24()
507 z = (unsigned __int128)a[1] * 121665 + (z >> 64); in f255_mul_a24()
508 t1 = (uint64_t)z; in f255_mul_a24()
509 z = (unsigned __int128)a[2] * 121665 + (z >> 64); in f255_mul_a24()
510 t2 = (uint64_t)z; in f255_mul_a24()
511 z = (unsigned __int128)a[3] * 121665 + (z >> 64); in f255_mul_a24()
512 t3 = (uint64_t)z & MASK63; in f255_mul_a24()
514 z = (unsigned __int128)t0 + (19 * (uint64_t)(z >> 63)); in f255_mul_a24()
515 t0 = (uint64_t)z; in f255_mul_a24()
516 z = (unsigned __int128)t1 + (z >> 64); in f255_mul_a24()
517 t1 = (uint64_t)z; in f255_mul_a24()
518 z = (unsigned __int128)t2 + (z >> 64); in f255_mul_a24()
519 t2 = (uint64_t)z; in f255_mul_a24()
520 t3 = t3 + (uint64_t)(z >> 64); in f255_mul_a24()
522 z = (unsigned __int128)t0 + (19 & -(t3 >> 63)); in f255_mul_a24()
523 d[0] = (uint64_t)z; in f255_mul_a24()
524 z = (unsigned __int128)t1 + (z >> 64); in f255_mul_a24()
525 d[1] = (uint64_t)z; in f255_mul_a24()
526 z = (unsigned __int128)t2 + (z >> 64); in f255_mul_a24()
527 d[2] = (uint64_t)z; in f255_mul_a24()
528 d[3] = (t3 & MASK63) + (uint64_t)(z >> 64); in f255_mul_a24()
551 t4 = 19 & -(t3 >> 63); in f255_mul_a24()
570 unsigned __int128 z; in f255_final_reduce() local
574 * is already less than 2^255-19, thus already reduced. in f255_final_reduce()
576 * have t = a - (2^255-19), and that's our result. in f255_final_reduce()
578 z = (unsigned __int128)a[0] + 19; in f255_final_reduce()
579 t0 = (uint64_t)z; in f255_final_reduce()
580 z = (unsigned __int128)a[1] + (z >> 64); in f255_final_reduce()
581 t1 = (uint64_t)z; in f255_final_reduce()
582 z = (unsigned __int128)a[2] + (z >> 64); in f255_final_reduce()
583 t2 = (uint64_t)z; in f255_final_reduce()
584 t3 = a[3] + (uint64_t)(z >> 64); in f255_final_reduce()
586 m = -(t3 >> 63); in f255_final_reduce()
600 * is already less than 2^255-19, thus already reduced. in f255_final_reduce()
602 * have t = a - (2^255-19), and that's our result. in f255_final_reduce()
609 m = -(t3 >> 63); in f255_final_reduce()
648 * We can use memset() to clear values, because exact-width types in api_mul()
659 * The multiplier is provided in big-endian notation, and in api_mul()
662 memset(k, 0, (sizeof k) - kblen); in api_mul()
663 memcpy(k + (sizeof k) - kblen, kb, kblen); in api_mul()
670 for (i = 254; i >= 0; i --) { in api_mul()
675 kt = (k[31 - (i >> 3)] >> (i & 7)) & 1; in api_mul()
687 /* B = x_2 - z_2 */ in api_mul()
693 /* E = AA - BB */ in api_mul()
699 /* D = x_3 - z_3 */ in api_mul()
712 /* z_3 = x_1 * (DA - CB)^2 */ in api_mul()
730 * Compute 1/z2 = z2^(p-2). Since p = 2^255-19, we can mutualize in api_mul()
731 * most non-squarings. We use x1 and x3, now useless, as temporaries. in api_mul()
747 for (i = 14; i >= 0; i --) { in api_mul()
761 * Encode the final x2 value in little-endian. in api_mul()