2018-05-02 19:43:17 +00:00
|
|
|
#include "tommath_private.h"
|
2004-10-29 22:07:18 +00:00
|
|
|
#ifdef BN_MP_AND_C
|
2003-02-28 16:08:34 +00:00
|
|
|
/* LibTomMath, multiple-precision integer library -- Tom St Denis
|
|
|
|
*
|
2003-08-05 01:24:44 +00:00
|
|
|
* LibTomMath is a library that provides multiple-precision
|
2003-02-28 16:08:34 +00:00
|
|
|
* integer arithmetic as well as number theoretic functionality.
|
|
|
|
*
|
2003-08-05 01:24:44 +00:00
|
|
|
* The library was designed directly after the MPI library by
|
2003-02-28 16:08:34 +00:00
|
|
|
* Michael Fromberger but has been written from scratch with
|
|
|
|
* additional optimizations in place.
|
|
|
|
*
|
2018-12-29 16:56:20 +00:00
|
|
|
* SPDX-License-Identifier: Unlicense
|
2003-02-28 16:08:34 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
/* AND two ints together */
|
2017-09-20 14:59:43 +00:00
|
|
|
int mp_and(const mp_int *a, const mp_int *b, mp_int *c)
|
2003-02-28 16:08:34 +00:00
|
|
|
{
|
2017-08-29 20:23:48 +00:00
|
|
|
int res, ix, px;
|
2017-09-20 14:59:43 +00:00
|
|
|
mp_int t;
|
|
|
|
const mp_int *x;
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-29 20:23:48 +00:00
|
|
|
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;
|
|
|
|
}
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-29 20:23:48 +00:00
|
|
|
for (ix = 0; ix < px; ix++) {
|
|
|
|
t.dp[ix] &= x->dp[ix];
|
|
|
|
}
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-29 20:23:48 +00:00
|
|
|
/* zero digits above the last from the smallest mp_int */
|
|
|
|
for (; ix < t.used; ix++) {
|
|
|
|
t.dp[ix] = 0;
|
|
|
|
}
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-29 20:23:48 +00:00
|
|
|
mp_clamp(&t);
|
|
|
|
mp_exch(c, &t);
|
|
|
|
mp_clear(&t);
|
|
|
|
return MP_OKAY;
|
2003-02-28 16:08:34 +00:00
|
|
|
}
|
2004-10-29 22:07:18 +00:00
|
|
|
#endif
|