mirror of
https://github.com/clearml/dropbear
synced 2025-01-31 10:57:01 +00:00
1c5fda515f
From ltm-0.35.tar.bz2 SHA1 of 3f193dbae9351e92d02530994fa18236f7fde01c --HG-- branch : libtommath-orig extra : convert_revision : 2b4b13ac88b2a81e5c86ba868c92c6a452630e02
54 lines
1.2 KiB
C
54 lines
1.2 KiB
C
#include <tommath.h>
|
|
#ifdef BN_MP_AND_C
|
|
/* LibTomMath, multiple-precision integer library -- Tom St Denis
|
|
*
|
|
* LibTomMath is a library that provides multiple-precision
|
|
* integer arithmetic as well as number theoretic functionality.
|
|
*
|
|
* The library was designed directly after the MPI library by
|
|
* Michael Fromberger but has been written from scratch with
|
|
* additional optimizations in place.
|
|
*
|
|
* The library is free for all purposes without any express
|
|
* guarantee it works.
|
|
*
|
|
* Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org
|
|
*/
|
|
|
|
/* AND two ints together */
|
|
int
|
|
mp_and (mp_int * a, mp_int * b, mp_int * c)
|
|
{
|
|
int res, ix, px;
|
|
mp_int t, *x;
|
|
|
|
if (a->used > b->used) {
|
|
if ((res = mp_init_copy (&t, a)) != MP_OKAY) {
|
|
return res;
|
|
}
|
|
px = b->used;
|
|
x = b;
|
|
} else {
|
|
if ((res = mp_init_copy (&t, b)) != MP_OKAY) {
|
|
return res;
|
|
}
|
|
px = a->used;
|
|
x = a;
|
|
}
|
|
|
|
for (ix = 0; ix < px; ix++) {
|
|
t.dp[ix] &= x->dp[ix];
|
|
}
|
|
|
|
/* zero digits above the last from the smallest mp_int */
|
|
for (; ix < t.used; ix++) {
|
|
t.dp[ix] = 0;
|
|
}
|
|
|
|
mp_clamp (&t);
|
|
mp_exch (c, &t);
|
|
mp_clear (&t);
|
|
return MP_OKAY;
|
|
}
|
|
#endif
|