Coverage Report

Created: 2023-09-25 06:41

/src/openssl30/crypto/bn/bn_add.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.
3
 *
4
 * Licensed under the Apache License 2.0 (the "License").  You may not use
5
 * this file except in compliance with the License.  You can obtain a copy
6
 * in the file LICENSE in the source distribution or at
7
 * https://www.openssl.org/source/license.html
8
 */
9
10
#include "internal/cryptlib.h"
11
#include "bn_local.h"
12
13
/* signed add of b to a. */
14
int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
15
9.61k
{
16
9.61k
    int ret, r_neg, cmp_res;
17
18
9.61k
    bn_check_top(a);
19
9.61k
    bn_check_top(b);
20
21
9.61k
    if (a->neg == b->neg) {
22
5.17k
        r_neg = a->neg;
23
5.17k
        ret = BN_uadd(r, a, b);
24
5.17k
    } else {
25
4.43k
        cmp_res = BN_ucmp(a, b);
26
4.43k
        if (cmp_res > 0) {
27
0
            r_neg = a->neg;
28
0
            ret = BN_usub(r, a, b);
29
4.43k
        } else if (cmp_res < 0) {
30
4.43k
            r_neg = b->neg;
31
4.43k
            ret = BN_usub(r, b, a);
32
4.43k
        } else {
33
0
            r_neg = 0;
34
0
            BN_zero(r);
35
0
            ret = 1;
36
0
        }
37
4.43k
    }
38
39
9.61k
    r->neg = r_neg;
40
9.61k
    bn_check_top(r);
41
9.61k
    return ret;
42
9.61k
}
43
44
/* signed sub of b from a. */
45
int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
46
8.27k
{
47
8.27k
    int ret, r_neg, cmp_res;
48
49
8.27k
    bn_check_top(a);
50
8.27k
    bn_check_top(b);
51
52
8.27k
    if (a->neg != b->neg) {
53
0
        r_neg = a->neg;
54
0
        ret = BN_uadd(r, a, b);
55
8.27k
    } else {
56
8.27k
        cmp_res = BN_ucmp(a, b);
57
8.27k
        if (cmp_res > 0) {
58
3.73k
            r_neg = a->neg;
59
3.73k
            ret = BN_usub(r, a, b);
60
4.54k
        } else if (cmp_res < 0) {
61
4.43k
            r_neg = !b->neg;
62
4.43k
            ret = BN_usub(r, b, a);
63
4.43k
        } else {
64
107
            r_neg = 0;
65
107
            BN_zero(r);
66
107
            ret = 1;
67
107
        }
68
8.27k
    }
69
70
8.27k
    r->neg = r_neg;
71
8.27k
    bn_check_top(r);
72
8.27k
    return ret;
73
8.27k
}
74
75
/* unsigned add of b to a, r can be equal to a or b. */
76
int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
77
481k
{
78
481k
    int max, min, dif;
79
481k
    const BN_ULONG *ap, *bp;
80
481k
    BN_ULONG *rp, carry, t1, t2;
81
82
481k
    bn_check_top(a);
83
481k
    bn_check_top(b);
84
85
481k
    if (a->top < b->top) {
86
9.95k
        const BIGNUM *tmp;
87
88
9.95k
        tmp = a;
89
9.95k
        a = b;
90
9.95k
        b = tmp;
91
9.95k
    }
92
481k
    max = a->top;
93
481k
    min = b->top;
94
481k
    dif = max - min;
95
96
481k
    if (bn_wexpand(r, max + 1) == NULL)
97
0
        return 0;
98
99
481k
    r->top = max;
100
101
481k
    ap = a->d;
102
481k
    bp = b->d;
103
481k
    rp = r->d;
104
105
481k
    carry = bn_add_words(rp, ap, bp, min);
106
481k
    rp += min;
107
481k
    ap += min;
108
109
569k
    while (dif) {
110
88.1k
        dif--;
111
88.1k
        t1 = *(ap++);
112
88.1k
        t2 = (t1 + carry) & BN_MASK2;
113
88.1k
        *(rp++) = t2;
114
88.1k
        carry &= (t2 == 0);
115
88.1k
    }
116
481k
    *rp = carry;
117
481k
    r->top += carry;
118
119
481k
    r->neg = 0;
120
481k
    bn_check_top(r);
121
481k
    return 1;
122
481k
}
123
124
/* unsigned subtraction of b from a, a must be larger than b. */
125
int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
126
310k
{
127
310k
    int max, min, dif;
128
310k
    BN_ULONG t1, t2, borrow, *rp;
129
310k
    const BN_ULONG *ap, *bp;
130
131
310k
    bn_check_top(a);
132
310k
    bn_check_top(b);
133
134
310k
    max = a->top;
135
310k
    min = b->top;
136
310k
    dif = max - min;
137
138
310k
    if (dif < 0) {              /* hmm... should not be happening */
139
0
        ERR_raise(ERR_LIB_BN, BN_R_ARG2_LT_ARG3);
140
0
        return 0;
141
0
    }
142
143
310k
    if (bn_wexpand(r, max) == NULL)
144
0
        return 0;
145
146
310k
    ap = a->d;
147
310k
    bp = b->d;
148
310k
    rp = r->d;
149
150
310k
    borrow = bn_sub_words(rp, ap, bp, min);
151
310k
    ap += min;
152
310k
    rp += min;
153
154
314k
    while (dif) {
155
3.36k
        dif--;
156
3.36k
        t1 = *(ap++);
157
3.36k
        t2 = (t1 - borrow) & BN_MASK2;
158
3.36k
        *(rp++) = t2;
159
3.36k
        borrow &= (t1 == 0);
160
3.36k
    }
161
162
316k
    while (max && *--rp == 0)
163
5.80k
        max--;
164
165
310k
    r->top = max;
166
310k
    r->neg = 0;
167
310k
    bn_pollute(r);
168
169
310k
    return 1;
170
310k
}
171