41 lines
841 B
C
41 lines
841 B
C
#include "tommath_private.h"
|
|
#ifdef BN_MP_AND_C
|
|
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
|
|
/* SPDX-License-Identifier: Unlicense */
|
|
|
|
/* AND two ints together */
|
|
mp_err mp_and(const mp_int *a, const mp_int *b, mp_int *c)
|
|
{
|
|
int ix, px;
|
|
mp_err err;
|
|
mp_int t;
|
|
const mp_int *x;
|
|
|
|
if (a->used > b->used) {
|
|
if ((err = mp_init_copy(&t, a)) != MP_OKAY) {
|
|
return err;
|
|
}
|
|
px = b->used;
|
|
x = b;
|
|
} else {
|
|
if ((err = mp_init_copy(&t, b)) != MP_OKAY) {
|
|
return err;
|
|
}
|
|
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 */
|
|
MP_ZERO_DIGITS(t.dp + ix, t.used - ix);
|
|
|
|
mp_clamp(&t);
|
|
mp_exch(c, &t);
|
|
mp_clear(&t);
|
|
return MP_OKAY;
|
|
}
|
|
#endif
|