2015-11-11 19:49:07 -05:00
|
|
|
#include <tommath_private.h>
|
2004-10-29 18:07:18 -04:00
|
|
|
#ifdef BN_MP_AND_C
|
2003-02-28 11:08:34 -05:00
|
|
|
/* LibTomMath, multiple-precision integer library -- Tom St Denis
|
|
|
|
*
|
2003-08-04 21:24:44 -04:00
|
|
|
* LibTomMath is a library that provides multiple-precision
|
2003-02-28 11:08:34 -05:00
|
|
|
* integer arithmetic as well as number theoretic functionality.
|
|
|
|
*
|
2003-08-04 21:24:44 -04:00
|
|
|
* The library was designed directly after the MPI library by
|
2003-02-28 11:08:34 -05:00
|
|
|
* 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.
|
|
|
|
*
|
2015-10-30 17:55:29 -04:00
|
|
|
* Tom St Denis, tstdenis82@gmail.com, http://libtom.org
|
2003-02-28 11:08:34 -05:00
|
|
|
*/
|
|
|
|
|
|
|
|
/* AND two ints together */
|
|
|
|
int
|
|
|
|
mp_and (mp_int * a, mp_int * b, mp_int * c)
|
|
|
|
{
|
2003-02-28 11:09:08 -05:00
|
|
|
int res, ix, px;
|
|
|
|
mp_int t, *x;
|
2003-02-28 11:08:34 -05: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;
|
|
|
|
}
|
|
|
|
|
|
|
|
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;
|
|
|
|
}
|
2004-10-29 18:07:18 -04:00
|
|
|
#endif
|
2005-08-01 12:37:28 -04:00
|
|
|
|
2017-08-28 10:27:26 -04:00
|
|
|
/* ref: $Format:%D$ */
|
|
|
|
/* git commit: $Format:%H$ */
|
|
|
|
/* commit time: $Format:%ai$ */
|