Mercurial > dropbear

comparison libtommath/bn_mp_reduce_setup.c @ 1739:13d834efc376 fuzz

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
merge from main
author Matt Johnston <matt@ucc.asn.au>
date Thu, 15 Oct 2020 19:55:15 +0800
parents 1051e4eea25a
children
comparison
equal deleted inserted replaced
1562:768ebf737aa0 1739:13d834efc376
1 #include <tommath_private.h> 1 #include "tommath_private.h"
2 #ifdef BN_MP_REDUCE_SETUP_C 2 #ifdef BN_MP_REDUCE_SETUP_C
3 /* LibTomMath, multiple-precision integer library -- Tom St Denis 3 /* LibTomMath, multiple-precision integer library -- Tom St Denis */
4 * 4 /* SPDX-License-Identifier: Unlicense */
5 * LibTomMath is a library that provides multiple-precision
6 * integer arithmetic as well as number theoretic functionality.
7 *
8 * The library was designed directly after the MPI library by
9 * Michael Fromberger but has been written from scratch with
10 * additional optimizations in place.
11 *
12 * The library is free for all purposes without any express
13 * guarantee it works.
14 *
15 * Tom St Denis, [email protected], http://libtom.org
16 */
17 5
18 /* pre-calculate the value required for Barrett reduction 6 /* pre-calculate the value required for Barrett reduction
19 * For a given modulus "b" it calulates the value required in "a" 7 * For a given modulus "b" it calulates the value required in "a"
20 */ 8 */
21 int mp_reduce_setup (mp_int * a, mp_int * b) 9 mp_err mp_reduce_setup(mp_int *a, const mp_int *b)
22 { 10 {
23 int res; 11 mp_err err;
24 12 if ((err = mp_2expt(a, b->used * 2 * MP_DIGIT_BIT)) != MP_OKAY) {
25 if ((res = mp_2expt (a, b->used * 2 * DIGIT_BIT)) != MP_OKAY) { 13 return err;
26 return res; 14 }
27 } 15 return mp_div(a, b, a, NULL);
28 return mp_div (a, b, a, NULL);
29 } 16 }
30 #endif 17 #endif
31
32 /* ref: $Format:%D$ */
33 /* git commit: $Format:%H$ */
34 /* commit time: $Format:%ai$ */