2018-05-02 19:43:17 +00:00
|
|
|
#include "tommath_private.h"
|
2004-10-29 22:07:18 +00:00
|
|
|
#ifdef BN_MP_SUB_D_C
|
2003-02-28 16:08:34 +00:00
|
|
|
/* LibTomMath, multiple-precision integer library -- Tom St Denis
|
|
|
|
*
|
2003-08-05 01:24:44 +00:00
|
|
|
* LibTomMath is a library that provides multiple-precision
|
2003-02-28 16:08:34 +00:00
|
|
|
* integer arithmetic as well as number theoretic functionality.
|
|
|
|
*
|
2003-08-05 01:24:44 +00:00
|
|
|
* The library was designed directly after the MPI library by
|
2003-02-28 16:08:34 +00:00
|
|
|
* Michael Fromberger but has been written from scratch with
|
|
|
|
* additional optimizations in place.
|
|
|
|
*
|
2018-12-29 16:56:20 +00:00
|
|
|
* SPDX-License-Identifier: Unlicense
|
2003-02-28 16:08:34 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
/* single digit subtraction */
|
2017-09-20 14:59:43 +00:00
|
|
|
int mp_sub_d(const mp_int *a, mp_digit b, mp_int *c)
|
2003-02-28 16:08:34 +00:00
|
|
|
{
|
2017-08-30 17:13:53 +00:00
|
|
|
mp_digit *tmpa, *tmpc, mu;
|
|
|
|
int res, ix, oldused;
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-30 17:13:53 +00:00
|
|
|
/* grow c as required */
|
|
|
|
if (c->alloc < (a->used + 1)) {
|
|
|
|
if ((res = mp_grow(c, a->used + 1)) != MP_OKAY) {
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
}
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-30 17:13:53 +00:00
|
|
|
/* if a is negative just do an unsigned
|
|
|
|
* addition [with fudged signs]
|
|
|
|
*/
|
|
|
|
if (a->sign == MP_NEG) {
|
2017-09-20 14:59:43 +00:00
|
|
|
mp_int a_ = *a;
|
|
|
|
a_.sign = MP_ZPOS;
|
|
|
|
res = mp_add_d(&a_, b, c);
|
|
|
|
c->sign = MP_NEG;
|
2005-11-18 05:16:19 +00:00
|
|
|
|
2017-08-30 17:13:53 +00:00
|
|
|
/* clamp */
|
|
|
|
mp_clamp(c);
|
2005-11-18 05:16:19 +00:00
|
|
|
|
2017-08-30 17:13:53 +00:00
|
|
|
return res;
|
|
|
|
}
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-30 17:13:53 +00:00
|
|
|
/* setup regs */
|
|
|
|
oldused = c->used;
|
|
|
|
tmpa = a->dp;
|
|
|
|
tmpc = c->dp;
|
2003-07-16 00:26:58 +00:00
|
|
|
|
2017-08-30 17:13:53 +00:00
|
|
|
/* if a <= b simply fix the single digit */
|
|
|
|
if (((a->used == 1) && (a->dp[0] <= b)) || (a->used == 0)) {
|
|
|
|
if (a->used == 1) {
|
|
|
|
*tmpc++ = b - *tmpa;
|
|
|
|
} else {
|
|
|
|
*tmpc++ = b;
|
|
|
|
}
|
|
|
|
ix = 1;
|
2003-07-16 00:26:58 +00:00
|
|
|
|
2017-08-30 17:13:53 +00:00
|
|
|
/* negative/1digit */
|
|
|
|
c->sign = MP_NEG;
|
|
|
|
c->used = 1;
|
|
|
|
} else {
|
|
|
|
/* positive/size */
|
|
|
|
c->sign = MP_ZPOS;
|
|
|
|
c->used = a->used;
|
2003-07-16 00:26:58 +00:00
|
|
|
|
2017-08-30 17:13:53 +00:00
|
|
|
/* subtract first digit */
|
|
|
|
*tmpc = *tmpa++ - b;
|
2017-10-15 17:57:12 +00:00
|
|
|
mu = *tmpc >> ((sizeof(mp_digit) * (size_t)CHAR_BIT) - 1u);
|
2017-08-30 17:13:53 +00:00
|
|
|
*tmpc++ &= MP_MASK;
|
2003-07-16 00:26:58 +00:00
|
|
|
|
2017-08-30 17:13:53 +00:00
|
|
|
/* handle rest of the digits */
|
|
|
|
for (ix = 1; ix < a->used; ix++) {
|
|
|
|
*tmpc = *tmpa++ - mu;
|
2017-10-15 17:57:12 +00:00
|
|
|
mu = *tmpc >> ((sizeof(mp_digit) * (size_t)CHAR_BIT) - 1u);
|
2017-08-30 17:13:53 +00:00
|
|
|
*tmpc++ &= MP_MASK;
|
|
|
|
}
|
|
|
|
}
|
2003-07-16 00:26:58 +00:00
|
|
|
|
2017-08-30 17:13:53 +00:00
|
|
|
/* zero excess digits */
|
|
|
|
while (ix++ < oldused) {
|
|
|
|
*tmpc++ = 0;
|
|
|
|
}
|
|
|
|
mp_clamp(c);
|
|
|
|
return MP_OKAY;
|
2003-02-28 16:08:34 +00:00
|
|
|
}
|
2003-07-16 00:26:58 +00:00
|
|
|
|
2004-10-29 22:07:18 +00:00
|
|
|
#endif
|
2005-08-01 16:37:28 +00:00
|
|
|
|
2017-08-28 14:27:26 +00:00
|
|
|
/* ref: $Format:%D$ */
|
|
|
|
/* git commit: $Format:%H$ */
|
|
|
|
/* commit time: $Format:%ai$ */
|