Coverage Report

Created: 2024-11-21 06:47

/src/openssl/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
52.9M
{
16
52.9M
    int ret, r_neg, cmp_res;
17
18
52.9M
    bn_check_top(a);
19
52.9M
    bn_check_top(b);
20
21
52.9M
    if (a->neg == b->neg) {
22
26.3M
        r_neg = a->neg;
23
26.3M
        ret = BN_uadd(r, a, b);
24
26.6M
    } else {
25
26.6M
        cmp_res = BN_ucmp(a, b);
26
26.6M
        if (cmp_res > 0) {
27
11.1M
            r_neg = a->neg;
28
11.1M
            ret = BN_usub(r, a, b);
29
15.4M
        } else if (cmp_res < 0) {
30
15.4M
            r_neg = b->neg;
31
15.4M
            ret = BN_usub(r, b, a);
32
15.4M
        } else {
33
5.86k
            r_neg = 0;
34
5.86k
            BN_zero(r);
35
5.86k
            ret = 1;
36
5.86k
        }
37
26.6M
    }
38
39
52.9M
    r->neg = r_neg;
40
52.9M
    bn_check_top(r);
41
52.9M
    return ret;
42
52.9M
}
43
44
/* signed sub of b from a. */
45
int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
46
227k
{
47
227k
    int ret, r_neg, cmp_res;
48
49
227k
    bn_check_top(a);
50
227k
    bn_check_top(b);
51
52
227k
    if (a->neg != b->neg) {
53
1.25k
        r_neg = a->neg;
54
1.25k
        ret = BN_uadd(r, a, b);
55
226k
    } else {
56
226k
        cmp_res = BN_ucmp(a, b);
57
226k
        if (cmp_res > 0) {
58
207k
            r_neg = a->neg;
59
207k
            ret = BN_usub(r, a, b);
60
207k
        } else if (cmp_res < 0) {
61
16.4k
            r_neg = !b->neg;
62
16.4k
            ret = BN_usub(r, b, a);
63
16.4k
        } else {
64
2.22k
            r_neg = 0;
65
2.22k
            BN_zero(r);
66
2.22k
            ret = 1;
67
2.22k
        }
68
226k
    }
69
70
227k
    r->neg = r_neg;
71
227k
    bn_check_top(r);
72
227k
    return ret;
73
227k
}
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
27.0M
{
78
27.0M
    int max, min, dif;
79
27.0M
    const BN_ULONG *ap, *bp;
80
27.0M
    BN_ULONG *rp, carry, t1, t2;
81
82
27.0M
    bn_check_top(a);
83
27.0M
    bn_check_top(b);
84
85
27.0M
    if (a->top < b->top) {
86
9.23M
        const BIGNUM *tmp;
87
88
9.23M
        tmp = a;
89
9.23M
        a = b;
90
9.23M
        b = tmp;
91
9.23M
    }
92
27.0M
    max = a->top;
93
27.0M
    min = b->top;
94
27.0M
    dif = max - min;
95
96
27.0M
    if (bn_wexpand(r, max + 1) == NULL)
97
0
        return 0;
98
99
27.0M
    r->top = max;
100
101
27.0M
    ap = a->d;
102
27.0M
    bp = b->d;
103
27.0M
    rp = r->d;
104
105
27.0M
    carry = bn_add_words(rp, ap, bp, min);
106
27.0M
    rp += min;
107
27.0M
    ap += min;
108
109
66.6M
    while (dif) {
110
39.5M
        dif--;
111
39.5M
        t1 = *(ap++);
112
39.5M
        t2 = (t1 + carry) & BN_MASK2;
113
39.5M
        *(rp++) = t2;
114
39.5M
        carry &= (t2 == 0);
115
39.5M
    }
116
27.0M
    *rp = carry;
117
27.0M
    r->top += carry;
118
119
27.0M
    r->neg = 0;
120
27.0M
    bn_check_top(r);
121
27.0M
    return 1;
122
27.0M
}
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
34.7M
{
127
34.7M
    int max, min, dif;
128
34.7M
    BN_ULONG t1, t2, borrow, *rp;
129
34.7M
    const BN_ULONG *ap, *bp;
130
131
34.7M
    bn_check_top(a);
132
34.7M
    bn_check_top(b);
133
134
34.7M
    max = a->top;
135
34.7M
    min = b->top;
136
34.7M
    dif = max - min;
137
138
34.7M
    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
34.7M
    if (bn_wexpand(r, max) == NULL)
144
0
        return 0;
145
146
34.7M
    ap = a->d;
147
34.7M
    bp = b->d;
148
34.7M
    rp = r->d;
149
150
34.7M
    borrow = bn_sub_words(rp, ap, bp, min);
151
34.7M
    ap += min;
152
34.7M
    rp += min;
153
154
60.1M
    while (dif) {
155
25.4M
        dif--;
156
25.4M
        t1 = *(ap++);
157
25.4M
        t2 = (t1 - borrow) & BN_MASK2;
158
25.4M
        *(rp++) = t2;
159
25.4M
        borrow &= (t1 == 0);
160
25.4M
    }
161
162
184M
    while (max && *--rp == 0)
163
150M
        max--;
164
165
34.7M
    r->top = max;
166
34.7M
    r->neg = 0;
167
34.7M
    bn_pollute(r);
168
169
34.7M
    return 1;
170
34.7M
}
171