linux-master/crypto/ecc.c

217 /* Returns sign of left - right. */
218 int vli_cmp(const u64 *left, const u64 *right, unsigned int ndigits)
223 		if (left[i] > right[i])
225 		else if (left[i] < right[i])
267 /* Computes result = left + right, returning carry. Can modify in place. */
268 static u64 vli_add(u64 *result, const u64 *left, const u64 *right,
277 		sum = left[i] + right[i] + carry;
287 /* Computes result = left + right, returning carry. Can modify in place. */
288 static u64 vli_uadd(u64 *result, const u64 *left, u64 right,
291 	u64 carry = right;
309 /* Computes result = left - right, returning borrow. Can modify in place. */
310 u64 vli_sub(u64 *result, const u64 *left, const u64 *right,
319 		diff = left[i] - right[i] - borrow;
330 /* Computes result = left - right, returning borrow. Can modify in place. */
331 static u64 vli_usub(u64 *result, const u64 *left, u64 right,
334 	u64 borrow = right;
350 static uint128_t mul_64_64(u64 left, u64 right)
354 	unsigned __int128 m = (unsigned __int128)left * right;
361 	u64 b0 = right & 0xffffffffull;
362 	u64 b1 = right >> 32;
391 static void vli_mult(u64 *result, const u64 *left, const u64 *right,
412 			product = mul_64_64(left[i], right[k - i]);
427 /* Compute product = left * right, for a small right value. */
428 static void vli_umult(u64 *result, const u64 *left, u32 right,
437 		product = mul_64_64(left[k], right);
488 /* Computes result = (left + right) % mod.
489  * Assumes that left < mod and right < mod, result != mod.
491 static void vli_mod_add(u64 *result, const u64 *left, const u64 *right,
496 	carry = vli_add(result, left, right, ndigits);
505 /* Computes result = (left - right) % mod.
506  * Assumes that left < mod and right < mod, result != mod.
508 static void vli_mod_sub(u64 *result, const u64 *left, const u64 *right,
511 	u64 borrow = vli_sub(result, left, right, ndigits);
952 /* Computes result = (left * right) % mod.
955 void vli_mod_mult_slow(u64 *result, const u64 *left, const u64 *right,
960 	vli_mult(product, left, right, ndigits);
965 /* Computes result = (left * right) % curve_prime. */
966 static void vli_mod_mult_fast(u64 *result, const u64 *left, const u64 *right,
971 	vli_mult(product, left, right, curve->g.ndigits);