libtommath/mp_sub.c

41 lines
1.2 KiB
C
Raw Normal View History

#include "tommath_private.h"
#ifdef MP_SUB_C
2019-04-07 13:29:11 +00:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
/* SPDX-License-Identifier: Unlicense */
2003-02-28 16:08:34 +00:00
/* high level subtraction (handles signs) */
mp_err mp_sub(const mp_int *a, const mp_int *b, mp_int *c)
2003-02-28 16:08:34 +00:00
{
mp_sign sa = a->sign, sb = b->sign;
2019-05-19 15:16:13 +00:00
mp_err err;
2003-02-28 16:08:34 +00:00
2017-08-30 18:23:46 +00:00
if (sa != sb) {
/* subtract a negative from a positive, OR */
/* subtract a positive from a negative. */
/* In either case, ADD their magnitudes, */
/* and use the sign of the first number. */
2003-05-17 12:33:54 +00:00
c->sign = sa;
2019-05-19 15:16:13 +00:00
err = s_mp_add(a, b, c);
2017-08-30 18:23:46 +00:00
} else {
/* subtract a positive from a positive, OR */
/* subtract a negative from a negative. */
/* First, take the difference between their */
/* magnitudes, then... */
if (mp_cmp_mag(a, b) != MP_LT) {
/* Copy the sign from the first */
c->sign = sa;
/* The first has a larger or equal magnitude */
2019-05-19 15:16:13 +00:00
err = s_mp_sub(a, b, c);
2017-08-30 18:23:46 +00:00
} else {
/* The result has the *opposite* sign from */
/* the first number. */
c->sign = (sa == MP_ZPOS) ? MP_NEG : MP_ZPOS;
/* The second has a larger magnitude */
2019-05-19 15:16:13 +00:00
err = s_mp_sub(b, a, c);
2017-08-30 18:23:46 +00:00
}
}
2019-05-19 15:16:13 +00:00
return err;
2003-02-28 16:08:34 +00:00
}
2003-05-17 12:33:54 +00:00
2004-10-29 22:07:18 +00:00
#endif