Rev | Line | |
---|
[25] | 1 | #include <tommath.h> |
---|
| 2 | #ifdef BN_MP_OR_C |
---|
| 3 | /* LibTomMath, multiple-precision integer library -- Tom St Denis |
---|
| 4 | * |
---|
| 5 | * LibTomMath is a library that provides multiple-precision |
---|
| 6 | * integer arithmetic as well as number theoretic functionality. |
---|
| 7 | * |
---|
| 8 | * The library was designed directly after the MPI library by |
---|
| 9 | * Michael Fromberger but has been written from scratch with |
---|
| 10 | * additional optimizations in place. |
---|
| 11 | * |
---|
| 12 | * The library is free for all purposes without any express |
---|
| 13 | * guarantee it works. |
---|
| 14 | * |
---|
| 15 | * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com |
---|
| 16 | */ |
---|
| 17 | |
---|
| 18 | /* OR two ints together */ |
---|
| 19 | int mp_or (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 | mp_clamp (&t); |
---|
| 42 | mp_exch (c, &t); |
---|
| 43 | mp_clear (&t); |
---|
| 44 | return MP_OKAY; |
---|
| 45 | } |
---|
| 46 | #endif |
---|
| 47 | |
---|
| 48 | /* $Source: /cvsroot/tcl/libtommath/bn_mp_or.c,v $ */ |
---|
| 49 | /* $Revision: 1.1.1.3 $ */ |
---|
| 50 | /* $Date: 2006/12/01 00:08:11 $ */ |
---|
Note: See
TracBrowser
for help on using the repository browser.