Mercurial > dropbear
comparison bn_mp_and.c @ 1:22d5cf7d4b1a libtommath
Renaming branch
author | Matt Johnston <matt@ucc.asn.au> |
---|---|
date | Mon, 31 May 2004 18:23:46 +0000 |
parents | |
children | d29b64170cf0 |
comparison
equal
deleted
inserted
replaced
-1:000000000000 | 1:22d5cf7d4b1a |
---|---|
1 /* LibTomMath, multiple-precision integer library -- Tom St Denis | |
2 * | |
3 * LibTomMath is a library that provides multiple-precision | |
4 * integer arithmetic as well as number theoretic functionality. | |
5 * | |
6 * The library was designed directly after the MPI library by | |
7 * Michael Fromberger but has been written from scratch with | |
8 * additional optimizations in place. | |
9 * | |
10 * The library is free for all purposes without any express | |
11 * guarantee it works. | |
12 * | |
13 * Tom St Denis, [email protected], http://math.libtomcrypt.org | |
14 */ | |
15 #include <tommath.h> | |
16 | |
17 /* AND two ints together */ | |
18 int | |
19 mp_and (mp_int * a, mp_int * b, mp_int * c) | |
20 { | |
21 int res, ix, px; | |
22 mp_int t, *x; | |
23 | |
24 if (a->used > b->used) { | |
25 if ((res = mp_init_copy (&t, a)) != MP_OKAY) { | |
26 return res; | |
27 } | |
28 px = b->used; | |
29 x = b; | |
30 } else { | |
31 if ((res = mp_init_copy (&t, b)) != MP_OKAY) { | |
32 return res; | |
33 } | |
34 px = a->used; | |
35 x = a; | |
36 } | |
37 | |
38 for (ix = 0; ix < px; ix++) { | |
39 t.dp[ix] &= x->dp[ix]; | |
40 } | |
41 | |
42 /* zero digits above the last from the smallest mp_int */ | |
43 for (; ix < t.used; ix++) { | |
44 t.dp[ix] = 0; | |
45 } | |
46 | |
47 mp_clamp (&t); | |
48 mp_exch (c, &t); | |
49 mp_clear (&t); | |
50 return MP_OKAY; | |
51 } |