22#ifdef BN_DEPRECATED_C
33/* LibTomMath, multiple-precision integer library -- Tom St Denis */
44/* SPDX-License-Identifier: Unlicense */
5- /* LibTomMath, multiple-precision integer library -- Tom St Denis */
65
7- /* SPDX-License-Identifier: Unlicense */
8- #include <tommath_private.h>
96#ifdef BN_MP_GET_BIT_C
10- /* Checks the bit at position b and returns MP_YES
11- if the bit is 1, MP_NO if it is 0 and MP_VAL
12- in case of error */
137int mp_get_bit (const mp_int * a , int b )
148{
159 if (b < 0 ) {
@@ -18,7 +12,7 @@ int mp_get_bit(const mp_int *a, int b)
1812 return s_mp_get_bit (a , (unsigned int )b ) == MP_YES ? MP_YES : MP_NO ;
1913}
2014#endif
21- #ifdef BN_MP_JACOBI_C
15+ #ifdef BN_S_MP_JACOBI_C
2216mp_err s_mp_jacobi (const mp_int * a , const mp_int * n , int * c )
2317{
2418 if (a -> sign == MP_NEG ) {
@@ -29,6 +23,8 @@ mp_err s_mp_jacobi(const mp_int *a, const mp_int *n, int *c)
2923 }
3024 return mp_kronecker (a , n , c );
3125}
26+ #endif
27+ #ifdef BN_MP_JACOBI_C
3228mp_err mp_jacobi (const mp_int * a , const mp_int * n , int * c )
3329{
3430 return s_mp_jacobi (a , n , c );
@@ -120,7 +116,7 @@ mp_err mp_toom_sqr(const mp_int *a, mp_int *b)
120116 return s_mp_toom_sqr (a , b );
121117}
122118#endif
123- #ifdef BN_REVERSE_C
119+ #ifdef S_MP_REVERSE_C
124120void bn_reverse (unsigned char * s , int len )
125121{
126122 s_mp_reverse (s , len );
0 commit comments