1 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
4 * This package is an SSL implementation written
5 * by Eric Young (eay@cryptsoft.com).
6 * The implementation was written so as to conform with Netscapes SSL.
8 * This library is free for commercial and non-commercial use as long as
9 * the following conditions are aheared to. The following conditions
10 * apply to all code found in this distribution, be it the RC4, RSA,
11 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
12 * included with this distribution is covered by the same copyright terms
13 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
15 * Copyright remains Eric Young's, and as such any Copyright notices in
16 * the code are not to be removed.
17 * If this package is used in a product, Eric Young should be given attribution
18 * as the author of the parts of the library used.
19 * This can be in the form of a textual message at program startup or
20 * in documentation (online or textual) provided with the package.
22 * Redistribution and use in source and binary forms, with or without
23 * modification, are permitted provided that the following conditions
25 * 1. Redistributions of source code must retain the copyright
26 * notice, this list of conditions and the following disclaimer.
27 * 2. Redistributions in binary form must reproduce the above copyright
28 * notice, this list of conditions and the following disclaimer in the
29 * documentation and/or other materials provided with the distribution.
30 * 3. All advertising materials mentioning features or use of this software
31 * must display the following acknowledgement:
32 * "This product includes cryptographic software written by
33 * Eric Young (eay@cryptsoft.com)"
34 * The word 'cryptographic' can be left out if the rouines from the library
35 * being used are not cryptographic related :-).
36 * 4. If you include any Windows specific code (or a derivative thereof) from
37 * the apps directory (application code) you must include an acknowledgement:
38 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
41 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
43 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
44 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
45 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
46 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
48 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
49 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
52 * The licence and distribution terms for any publically available version or
53 * derivative of this code cannot be changed. i.e. this code cannot simply be
54 * copied and put under another distribution licence
55 * [including the GNU Public Licence.]
58 #include "internal/cryptlib.h"
62 int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
65 int a_neg = a->neg, ret;
77 /* only one is negative */
84 /* we are now a - b */
86 if (BN_ucmp(a, b) < 0) {
87 if (!BN_usub(r, b, a))
91 if (!BN_usub(r, a, b))
98 ret = BN_uadd(r, a, b);
104 /* unsigned add of b to a */
105 int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
108 const BN_ULONG *ap, *bp;
109 BN_ULONG *rp, carry, t1, t2;
115 if (a->top < b->top) {
124 if (bn_wexpand(r, max + 1) == NULL)
133 carry = bn_add_words(rp, ap, bp, min);
142 t2 = (t1 + 1) & BN_MASK2;
150 /* carry != 0 => dif == 0 */
157 /* copy remaining words if ap != rp */
164 /* unsigned subtraction of b from a, a must be larger than b. */
165 int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
168 register BN_ULONG t1, t2, *rp;
169 register const BN_ULONG *ap, *bp;
179 if (dif < 0) { /* hmm... should not be happening */
180 BNerr(BN_F_BN_USUB, BN_R_ARG2_LT_ARG3);
184 if (bn_wexpand(r, max) == NULL)
193 for (i = min; i != 0; i--) {
198 t1 = (t1 - t2 - 1) & BN_MASK2;
201 t1 = (t1 - t2) & BN_MASK2;
203 *(rp++) = t1 & BN_MASK2;
206 carry = bn_sub_words(rp, ap, bp, min);
211 if (carry) { /* subtracted */
218 t2 = (t1 - 1) & BN_MASK2;
225 memcpy(rp, ap, sizeof(*rp) * dif);
233 int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
236 int add = 0, neg = 0;
265 if (!BN_uadd(r, a, b))
271 /* We are actually doing a - b :-) */
273 max = (a->top > b->top) ? a->top : b->top;
274 if (bn_wexpand(r, max) == NULL)
276 if (BN_ucmp(a, b) < 0) {
277 if (!BN_usub(r, b, a))
281 if (!BN_usub(r, a, b))