Coverage Report

Created: 2022-08-24 06:30

/src/libressl/crypto/bn/bn_add.c
Line
Count
Source (jump to first uncovered line)
1
/* $OpenBSD: bn_add.c,v 1.13 2018/07/23 18:07:21 tb Exp $ */
2
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3
 * All rights reserved.
4
 *
5
 * This package is an SSL implementation written
6
 * by Eric Young (eay@cryptsoft.com).
7
 * The implementation was written so as to conform with Netscapes SSL.
8
 *
9
 * This library is free for commercial and non-commercial use as long as
10
 * the following conditions are aheared to.  The following conditions
11
 * apply to all code found in this distribution, be it the RC4, RSA,
12
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
13
 * included with this distribution is covered by the same copyright terms
14
 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
15
 *
16
 * Copyright remains Eric Young's, and as such any Copyright notices in
17
 * the code are not to be removed.
18
 * If this package is used in a product, Eric Young should be given attribution
19
 * as the author of the parts of the library used.
20
 * This can be in the form of a textual message at program startup or
21
 * in documentation (online or textual) provided with the package.
22
 *
23
 * Redistribution and use in source and binary forms, with or without
24
 * modification, are permitted provided that the following conditions
25
 * are met:
26
 * 1. Redistributions of source code must retain the copyright
27
 *    notice, this list of conditions and the following disclaimer.
28
 * 2. Redistributions in binary form must reproduce the above copyright
29
 *    notice, this list of conditions and the following disclaimer in the
30
 *    documentation and/or other materials provided with the distribution.
31
 * 3. All advertising materials mentioning features or use of this software
32
 *    must display the following acknowledgement:
33
 *    "This product includes cryptographic software written by
34
 *     Eric Young (eay@cryptsoft.com)"
35
 *    The word 'cryptographic' can be left out if the rouines from the library
36
 *    being used are not cryptographic related :-).
37
 * 4. If you include any Windows specific code (or a derivative thereof) from
38
 *    the apps directory (application code) you must include an acknowledgement:
39
 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40
 *
41
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
51
 * SUCH DAMAGE.
52
 *
53
 * The licence and distribution terms for any publically available version or
54
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
55
 * copied and put under another distribution licence
56
 * [including the GNU Public Licence.]
57
 */
58
59
#include <stdio.h>
60
61
#include <openssl/err.h>
62
63
#include "bn_lcl.h"
64
65
int
66
BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
67
0
{
68
0
  int ret, r_neg;
69
70
0
  bn_check_top(a);
71
0
  bn_check_top(b);
72
73
0
  if (a->neg == b->neg) {
74
0
    r_neg = a->neg;
75
0
    ret = BN_uadd(r, a, b);
76
0
  } else {
77
0
    int cmp = BN_ucmp(a, b);
78
79
0
    if (cmp > 0) {
80
0
      r_neg = a->neg;
81
0
      ret = BN_usub(r, a, b);
82
0
    } else if (cmp < 0) {
83
0
      r_neg = b->neg;
84
0
      ret = BN_usub(r, b, a);
85
0
    } else {
86
0
      r_neg = 0;
87
0
      BN_zero(r);
88
0
      ret = 1;
89
0
    }
90
0
  }
91
92
0
  r->neg = r_neg;
93
0
  bn_check_top(r);
94
0
  return ret;
95
0
}
96
97
int
98
BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
99
0
{
100
0
  int max, min, dif;
101
0
  const BN_ULONG *ap, *bp;
102
0
  BN_ULONG *rp, carry, t1, t2;
103
104
0
  bn_check_top(a);
105
0
  bn_check_top(b);
106
107
0
  if (a->top < b->top) {
108
0
    const BIGNUM *tmp;
109
110
0
    tmp = a;
111
0
    a = b;
112
0
    b = tmp;
113
0
  }
114
0
  max = a->top;
115
0
  min = b->top;
116
0
  dif = max - min;
117
118
0
  if (bn_wexpand(r, max + 1) == NULL)
119
0
    return 0;
120
121
0
  r->top = max;
122
123
0
  ap = a->d;
124
0
  bp = b->d;
125
0
  rp = r->d;
126
127
0
  carry = bn_add_words(rp, ap, bp, min);
128
0
  rp += min;
129
0
  ap += min;
130
131
0
  while (dif) {
132
0
    dif--;
133
0
    t1 = *(ap++);
134
0
    t2 = (t1 + carry) & BN_MASK2;
135
0
    *(rp++) = t2;
136
0
    carry &= (t2 == 0);
137
0
  }
138
0
  *rp = carry;
139
0
  r->top += carry;
140
141
0
  r->neg = 0;
142
0
  bn_check_top(r);
143
0
  return 1;
144
0
}
145
146
int
147
BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
148
0
{
149
0
  int max, min, dif;
150
0
  const BN_ULONG *ap, *bp;
151
0
  BN_ULONG t1, t2, borrow, *rp;
152
153
0
  bn_check_top(a);
154
0
  bn_check_top(b);
155
156
0
  max = a->top;
157
0
  min = b->top;
158
0
  dif = max - min;
159
160
0
  if (dif < 0) {
161
0
    BNerror(BN_R_ARG2_LT_ARG3);
162
0
    return 0;
163
0
  }
164
165
0
  if (bn_wexpand(r, max) == NULL)
166
0
    return 0;
167
168
0
  ap = a->d;
169
0
  bp = b->d;
170
0
  rp = r->d;
171
172
0
  borrow = bn_sub_words(rp, ap, bp, min);
173
0
  ap += min;
174
0
  rp += min;
175
176
0
  while (dif) {
177
0
    dif--;
178
0
    t1 = *(ap++);
179
0
    t2 = (t1 - borrow) & BN_MASK2;
180
0
    *(rp++) = t2;
181
0
    borrow &= (t1 == 0);
182
0
  }
183
184
0
  while (max > 0 && *--rp == 0)
185
0
    max--;
186
187
0
  r->top = max;
188
0
  r->neg = 0;
189
0
  bn_correct_top(r);
190
0
  return 1;
191
0
}
192
193
int
194
BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
195
0
{
196
0
  int ret, r_neg;
197
198
0
  bn_check_top(a);
199
0
  bn_check_top(b);
200
201
0
  if (a->neg != b->neg) {
202
0
    r_neg = a->neg;
203
0
    ret = BN_uadd(r, a, b);
204
0
  } else {
205
0
    int cmp = BN_ucmp(a, b);
206
207
0
    if (cmp > 0) {
208
0
      r_neg = a->neg;
209
0
      ret = BN_usub(r, a, b);
210
0
    } else if (cmp < 0) {
211
0
      r_neg = !b->neg;
212
0
      ret = BN_usub(r, b, a);
213
0
    } else {
214
0
      r_neg = 0;
215
0
      BN_zero(r);
216
0
      ret = 1;
217
0
    }
218
0
  }
219
220
0
  r->neg = r_neg;
221
0
  bn_check_top(r);
222
0
  return ret;
223
0
}