55 lines
		
	
	
		
			1.2 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			55 lines
		
	
	
		
			1.2 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
| #include "tommath_private.h"
 | |
| #ifdef BN_MP_AND_C
 | |
| /* LibTomMath, multiple-precision integer library -- Tom St Denis
 | |
|  *
 | |
|  * LibTomMath is a library that provides multiple-precision
 | |
|  * integer arithmetic as well as number theoretic functionality.
 | |
|  *
 | |
|  * The library was designed directly after the MPI library by
 | |
|  * Michael Fromberger but has been written from scratch with
 | |
|  * additional optimizations in place.
 | |
|  *
 | |
|  * SPDX-License-Identifier: Unlicense
 | |
|  */
 | |
| 
 | |
| /* AND two ints together */
 | |
| int mp_and(const mp_int *a, const mp_int *b, mp_int *c)
 | |
| {
 | |
|    int     res, ix, px;
 | |
|    mp_int  t;
 | |
|    const mp_int *x;
 | |
| 
 | |
|    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;
 | |
| }
 | |
| #endif
 | |
| 
 | |
| /* ref:         $Format:%D$ */
 | |
| /* git commit:  $Format:%H$ */
 | |
| /* commit time: $Format:%ai$ */
 |