Coverage Report

Created: 2023-09-25 06:41

/src/openssl111/crypto/bn/bn_add.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.
3
 *
4
 * Licensed under the OpenSSL license (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
40.0k
{
16
40.0k
    int ret, r_neg, cmp_res;
17
18
40.0k
    bn_check_top(a);
19
40.0k
    bn_check_top(b);
20
21
40.0k
    if (a->neg == b->neg) {
22
0
        r_neg = a->neg;
23
0
        ret = BN_uadd(r, a, b);
24
40.0k
    } else {
25
40.0k
        cmp_res = BN_ucmp(a, b);
26
40.0k
        if (cmp_res > 0) {
27
0
            r_neg = a->neg;
28
0
            ret = BN_usub(r, a, b);
29
40.0k
        } else if (cmp_res < 0) {
30
40.0k
            r_neg = b->neg;
31
40.0k
            ret = BN_usub(r, b, a);
32
40.0k
        } else {
33
0
            r_neg = 0;
34
0
            BN_zero(r);
35
0
            ret = 1;
36
0
        }
37
40.0k
    }
38
39
40.0k
    r->neg = r_neg;
40
40.0k
    bn_check_top(r);
41
40.0k
    return ret;
42
40.0k
}
43
44
/* signed sub of b from a. */
45
int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
46
47.7k
{
47
47.7k
    int ret, r_neg, cmp_res;
48
49
47.7k
    bn_check_top(a);
50
47.7k
    bn_check_top(b);
51
52
47.7k
    if (a->neg != b->neg) {
53
0
        r_neg = a->neg;
54
0
        ret = BN_uadd(r, a, b);
55
47.7k
    } else {
56
47.7k
        cmp_res = BN_ucmp(a, b);
57
47.7k
        if (cmp_res > 0) {
58
7.62k
            r_neg = a->neg;
59
7.62k
            ret = BN_usub(r, a, b);
60
40.1k
        } else if (cmp_res < 0) {
61
40.0k
            r_neg = !b->neg;
62
40.0k
            ret = BN_usub(r, b, a);
63
40.0k
        } else {
64
39
            r_neg = 0;
65
39
            BN_zero(r);
66
39
            ret = 1;
67
39
        }
68
47.7k
    }
69
70
47.7k
    r->neg = r_neg;
71
47.7k
    bn_check_top(r);
72
47.7k
    return ret;
73
47.7k
}
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
3.67M
{
78
3.67M
    int max, min, dif;
79
3.67M
    const BN_ULONG *ap, *bp;
80
3.67M
    BN_ULONG *rp, carry, t1, t2;
81
82
3.67M
    bn_check_top(a);
83
3.67M
    bn_check_top(b);
84
85
3.67M
    if (a->top < b->top) {
86
88.7k
        const BIGNUM *tmp;
87
88
88.7k
        tmp = a;
89
88.7k
        a = b;
90
88.7k
        b = tmp;
91
88.7k
    }
92
3.67M
    max = a->top;
93
3.67M
    min = b->top;
94
3.67M
    dif = max - min;
95
96
3.67M
    if (bn_wexpand(r, max + 1) == NULL)
97
0
        return 0;
98
99
3.67M
    r->top = max;
100
101
3.67M
    ap = a->d;
102
3.67M
    bp = b->d;
103
3.67M
    rp = r->d;
104
105
3.67M
    carry = bn_add_words(rp, ap, bp, min);
106
3.67M
    rp += min;
107
3.67M
    ap += min;
108
109
4.49M
    while (dif) {
110
824k
        dif--;
111
824k
        t1 = *(ap++);
112
824k
        t2 = (t1 + carry) & BN_MASK2;
113
824k
        *(rp++) = t2;
114
824k
        carry &= (t2 == 0);
115
824k
    }
116
3.67M
    *rp = carry;
117
3.67M
    r->top += carry;
118
119
3.67M
    r->neg = 0;
120
3.67M
    bn_check_top(r);
121
3.67M
    return 1;
122
3.67M
}
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
2.47M
{
127
2.47M
    int max, min, dif;
128
2.47M
    BN_ULONG t1, t2, borrow, *rp;
129
2.47M
    const BN_ULONG *ap, *bp;
130
131
2.47M
    bn_check_top(a);
132
2.47M
    bn_check_top(b);
133
134
2.47M
    max = a->top;
135
2.47M
    min = b->top;
136
2.47M
    dif = max - min;
137
138
2.47M
    if (dif < 0) {              /* hmm... should not be happening */
139
0
        BNerr(BN_F_BN_USUB, BN_R_ARG2_LT_ARG3);
140
0
        return 0;
141
0
    }
142
143
2.47M
    if (bn_wexpand(r, max) == NULL)
144
0
        return 0;
145
146
2.47M
    ap = a->d;
147
2.47M
    bp = b->d;
148
2.47M
    rp = r->d;
149
150
2.47M
    borrow = bn_sub_words(rp, ap, bp, min);
151
2.47M
    ap += min;
152
2.47M
    rp += min;
153
154
2.50M
    while (dif) {
155
29.1k
        dif--;
156
29.1k
        t1 = *(ap++);
157
29.1k
        t2 = (t1 - borrow) & BN_MASK2;
158
29.1k
        *(rp++) = t2;
159
29.1k
        borrow &= (t1 == 0);
160
29.1k
    }
161
162
2.51M
    while (max && *--rp == 0)
163
43.7k
        max--;
164
165
2.47M
    r->top = max;
166
2.47M
    r->neg = 0;
167
2.47M
    bn_pollute(r);
168
169
2.47M
    return 1;
170
2.47M
}
171