Coverage Report

Created: 2025-12-31 06:58

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/openssl33/crypto/bn/bn_add.c
Line
Count
Source
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
80.4M
{
16
80.4M
    int ret, r_neg, cmp_res;
17
18
80.4M
    bn_check_top(a);
19
80.4M
    bn_check_top(b);
20
21
80.4M
    if (a->neg == b->neg) {
22
46.4M
        r_neg = a->neg;
23
46.4M
        ret = BN_uadd(r, a, b);
24
46.4M
    } else {
25
34.0M
        cmp_res = BN_ucmp(a, b);
26
34.0M
        if (cmp_res > 0) {
27
10.7M
            r_neg = a->neg;
28
10.7M
            ret = BN_usub(r, a, b);
29
23.3M
        } else if (cmp_res < 0) {
30
23.3M
            r_neg = b->neg;
31
23.3M
            ret = BN_usub(r, b, a);
32
23.3M
        } else {
33
7.62k
            r_neg = 0;
34
7.62k
            BN_zero(r);
35
7.62k
            ret = 1;
36
7.62k
        }
37
34.0M
    }
38
39
80.4M
    r->neg = r_neg;
40
80.4M
    bn_check_top(r);
41
80.4M
    return ret;
42
80.4M
}
43
44
/* signed sub of b from a. */
45
int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
46
25.2M
{
47
25.2M
    int ret, r_neg, cmp_res;
48
49
25.2M
    bn_check_top(a);
50
25.2M
    bn_check_top(b);
51
52
25.2M
    if (a->neg != b->neg) {
53
0
        r_neg = a->neg;
54
0
        ret = BN_uadd(r, a, b);
55
25.2M
    } else {
56
25.2M
        cmp_res = BN_ucmp(a, b);
57
25.2M
        if (cmp_res > 0) {
58
16.1M
            r_neg = a->neg;
59
16.1M
            ret = BN_usub(r, a, b);
60
16.1M
        } else if (cmp_res < 0) {
61
8.92M
            r_neg = !b->neg;
62
8.92M
            ret = BN_usub(r, b, a);
63
8.92M
        } else {
64
195k
            r_neg = 0;
65
195k
            BN_zero(r);
66
195k
            ret = 1;
67
195k
        }
68
25.2M
    }
69
70
25.2M
    r->neg = r_neg;
71
25.2M
    bn_check_top(r);
72
25.2M
    return ret;
73
25.2M
}
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
141M
{
78
141M
    int max, min, dif;
79
141M
    const BN_ULONG *ap, *bp;
80
141M
    BN_ULONG *rp, carry, t1, t2;
81
82
141M
    bn_check_top(a);
83
141M
    bn_check_top(b);
84
85
141M
    if (a->top < b->top) {
86
9.89M
        const BIGNUM *tmp;
87
88
9.89M
        tmp = a;
89
9.89M
        a = b;
90
9.89M
        b = tmp;
91
9.89M
    }
92
141M
    max = a->top;
93
141M
    min = b->top;
94
141M
    dif = max - min;
95
96
141M
    if (bn_wexpand(r, max + 1) == NULL)
97
0
        return 0;
98
99
141M
    r->top = max;
100
101
141M
    ap = a->d;
102
141M
    bp = b->d;
103
141M
    rp = r->d;
104
105
141M
    carry = bn_add_words(rp, ap, bp, min);
106
141M
    rp += min;
107
141M
    ap += min;
108
109
192M
    while (dif) {
110
50.3M
        dif--;
111
50.3M
        t1 = *(ap++);
112
50.3M
        t2 = (t1 + carry) & BN_MASK2;
113
50.3M
        *(rp++) = t2;
114
50.3M
        carry &= (t2 == 0);
115
50.3M
    }
116
141M
    *rp = carry;
117
141M
    r->top += carry;
118
119
141M
    r->neg = 0;
120
141M
    bn_check_top(r);
121
141M
    return 1;
122
141M
}
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
120M
{
127
120M
    int max, min, dif;
128
120M
    BN_ULONG t1, t2, borrow, *rp;
129
120M
    const BN_ULONG *ap, *bp;
130
131
120M
    bn_check_top(a);
132
120M
    bn_check_top(b);
133
134
120M
    max = a->top;
135
120M
    min = b->top;
136
120M
    dif = max - min;
137
138
120M
    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
120M
    if (bn_wexpand(r, max) == NULL)
144
0
        return 0;
145
146
120M
    ap = a->d;
147
120M
    bp = b->d;
148
120M
    rp = r->d;
149
150
120M
    borrow = bn_sub_words(rp, ap, bp, min);
151
120M
    ap += min;
152
120M
    rp += min;
153
154
150M
    while (dif) {
155
29.1M
        dif--;
156
29.1M
        t1 = *(ap++);
157
29.1M
        t2 = (t1 - borrow) & BN_MASK2;
158
29.1M
        *(rp++) = t2;
159
29.1M
        borrow &= (t1 == 0);
160
29.1M
    }
161
162
159M
    while (max && *--rp == 0)
163
38.1M
        max--;
164
165
120M
    r->top = max;
166
120M
    r->neg = 0;
167
120M
    bn_pollute(r);
168
169
120M
    return 1;
170
120M
}