bn_mp_and.c 1.4 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
  1. #include "tommath_private.h"
  2. #ifdef BN_MP_AND_C
  3. /* LibTomMath, multiple-precision integer library -- Tom St Denis */
  4. /* SPDX-License-Identifier: Unlicense */
  5. /* two complement and */
  6. mp_err mp_and(const mp_int *a, const mp_int *b, mp_int *c)
  7. {
  8. int used = MP_MAX(a->used, b->used) + 1, i;
  9. mp_err err;
  10. mp_digit ac = 1, bc = 1, cc = 1;
  11. mp_sign csign = ((a->sign == MP_NEG) && (b->sign == MP_NEG)) ? MP_NEG : MP_ZPOS;
  12. if (c->alloc < used) {
  13. if ((err = mp_grow(c, used)) != MP_OKAY) {
  14. return err;
  15. }
  16. }
  17. for (i = 0; i < used; i++) {
  18. mp_digit x, y;
  19. /* convert to two complement if negative */
  20. if (a->sign == MP_NEG) {
  21. ac += (i >= a->used) ? MP_MASK : (~a->dp[i] & MP_MASK);
  22. x = ac & MP_MASK;
  23. ac >>= MP_DIGIT_BIT;
  24. } else {
  25. x = (i >= a->used) ? 0uL : a->dp[i];
  26. }
  27. /* convert to two complement if negative */
  28. if (b->sign == MP_NEG) {
  29. bc += (i >= b->used) ? MP_MASK : (~b->dp[i] & MP_MASK);
  30. y = bc & MP_MASK;
  31. bc >>= MP_DIGIT_BIT;
  32. } else {
  33. y = (i >= b->used) ? 0uL : b->dp[i];
  34. }
  35. c->dp[i] = x & y;
  36. /* convert to to sign-magnitude if negative */
  37. if (csign == MP_NEG) {
  38. cc += ~c->dp[i] & MP_MASK;
  39. c->dp[i] = cc & MP_MASK;
  40. cc >>= MP_DIGIT_BIT;
  41. }
  42. }
  43. c->used = used;
  44. c->sign = csign;
  45. mp_clamp(c);
  46. return MP_OKAY;
  47. }
  48. #endif