OpenCoverage

bn_mont.c

Absolute File Name:/home/opencoverage/opencoverage/guest-scripts/openssl/src/crypto/bn/bn_mont.c
Source codeSwitch to Preprocessed file
LineSourceCount
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/*-
11 * Details about Montgomery multiplication algorithms can be found at-
12 * http://security.ece.orst.edu/publications.html, e.g.-
13 * http://security.ece.orst.edu/koc/papers/j37acmon.pdf and-
14 * sections 3.8 and 4.2 in http://security.ece.orst.edu/koc/papers/r01rsasw.pdf-
15 */-
16-
17#include "internal/cryptlib.h"-
18#include "bn_lcl.h"-
19-
20#define MONT_WORD /* use the faster word-based algorithm */-
21-
22#ifdef MONT_WORD-
23static int bn_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont);-
24#endif-
25-
26int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,-
27 BN_MONT_CTX *mont, BN_CTX *ctx)-
28{-
29 int ret = bn_mul_mont_fixed_top(r, a, b, mont, ctx);-
30-
31 bn_correct_top(r);-
32 bn_check_top(r);-
33-
34 return ret;
executed 16868843 times by 2 tests: return ret;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
16868843
35}-
36-
37int bn_mul_mont_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,-
38 BN_MONT_CTX *mont, BN_CTX *ctx)-
39{-
40 BIGNUM *tmp;-
41 int ret = 0;-
42 int num = mont->N.top;-
43-
44#if defined(OPENSSL_BN_ASM_MONT) && defined(MONT_WORD)-
45 if (num > 1 && a->top == num && b->top == num) {
num > 1Description
TRUEevaluated 19372441 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 56138 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
a->top == numDescription
TRUEevaluated 19180355 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 192086 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
b->top == numDescription
TRUEevaluated 19072833 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 107522 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
56138-19372441
46 if (bn_wexpand(r, num) == NULL)
bn_wexpand(r, ...== ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 19072833 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-19072833
47 return 0;
never executed: return 0;
0
48 if (bn_mul_mont(r->d, a->d, b->d, mont->N.d, mont->n0, num)) {
bn_mul_mont(r-...mont->n0, num)Description
TRUEevaluated 19072833 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEnever evaluated
0-19072833
49 r->neg = a->neg ^ b->neg;-
50 r->top = num;-
51 r->flags |= BN_FLG_FIXED_TOP;-
52 return 1;
executed 19072833 times by 2 tests: return 1;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
19072833
53 }-
54 }
never executed: end of block
0
55#endif-
56-
57 if ((a->top + b->top) > 2 * num)
(a->top + b->top) > 2 * numDescription
TRUEevaluated 1 time by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 355745 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
1-355745
58 return 0;
executed 1 time by 1 test: return 0;
Executed by:
  • libcrypto.so.1.1
1
59-
60 BN_CTX_start(ctx);-
61 tmp = BN_CTX_get(ctx);-
62 if (tmp == NULL)
tmp == ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 355745 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-355745
63 goto err;
never executed: goto err;
0
64-
65 bn_check_top(tmp);-
66 if (a == b) {
a == bDescription
TRUEevaluated 66756 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 288989 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
66756-288989
67 if (!bn_sqr_fixed_top(tmp, a, ctx))
!bn_sqr_fixed_top(tmp, a, ctx)Description
TRUEnever evaluated
FALSEevaluated 66756 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-66756
68 goto err;
never executed: goto err;
0
69 } else {
executed 66756 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
66756
70 if (!bn_mul_fixed_top(tmp, a, b, ctx))
!bn_mul_fixed_...mp, a, b, ctx)Description
TRUEnever evaluated
FALSEevaluated 288989 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-288989
71 goto err;
never executed: goto err;
0
72 }
executed 288989 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
288989
73 /* reduce from aRR to aR */-
74#ifdef MONT_WORD-
75 if (!bn_from_montgomery_word(r, tmp, mont))
!bn_from_montg...(r, tmp, mont)Description
TRUEnever evaluated
FALSEevaluated 355745 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-355745
76 goto err;
never executed: goto err;
0
77#else-
78 if (!BN_from_montgomery(r, tmp, mont, ctx))-
79 goto err;-
80#endif-
81 ret = 1;-
82 err:
code before this statement executed 355745 times by 2 tests: err:
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
355745
83 BN_CTX_end(ctx);-
84 return ret;
executed 355745 times by 2 tests: return ret;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
355745
85}-
86-
87#ifdef MONT_WORD-
88static int bn_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)-
89{-
90 BIGNUM *n;-
91 BN_ULONG *ap, *np, *rp, n0, v, carry;-
92 int nl, max, i;-
93 unsigned int rtop;-
94-
95 n = &(mont->N);-
96 nl = n->top;-
97 if (nl == 0) {
nl == 0Description
TRUEnever evaluated
FALSEevaluated 407757 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-407757
98 ret->top = 0;-
99 return 1;
never executed: return 1;
0
100 }-
101-
102 max = (2 * nl); /* carry is stored separately */-
103 if (bn_wexpand(r, max) == NULL)
bn_wexpand(r, ...== ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 407757 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-407757
104 return 0;
never executed: return 0;
0
105-
106 r->neg ^= n->neg;-
107 np = n->d;-
108 rp = r->d;-
109-
110 /* clear the top words of T */-
111 for (rtop = r->top, i = 0; i < max; i++) {
i < maxDescription
TRUEevaluated 4633356 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 407757 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
407757-4633356
112 v = (BN_ULONG)0 - ((i - rtop) >> (8 * sizeof(rtop) - 1));-
113 rp[i] &= v;-
114 }
executed 4633356 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
4633356
115-
116 r->top = max;-
117 r->flags |= BN_FLG_FIXED_TOP;-
118 n0 = mont->n0[0];-
119-
120 /*-
121 * Add multiples of |n| to |r| until R = 2^(nl * BN_BITS2) divides it. On-
122 * input, we had |r| < |n| * R, so now |r| < 2 * |n| * R. Note that |r|-
123 * includes |carry| which is stored separately.-
124 */-
125 for (carry = 0, i = 0; i < nl; i++, rp++) {
i < nlDescription
TRUEevaluated 2316678 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 407757 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
407757-2316678
126 v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);-
127 v = (v + carry + rp[nl]) & BN_MASK2;-
128 carry |= (v != rp[nl]);-
129 carry &= (v <= rp[nl]);-
130 rp[nl] = v;-
131 }
executed 2316678 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
2316678
132-
133 if (bn_wexpand(ret, nl) == NULL)
bn_wexpand(ret...== ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 407757 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-407757
134 return 0;
never executed: return 0;
0
135 ret->top = nl;-
136 ret->flags |= BN_FLG_FIXED_TOP;-
137 ret->neg = r->neg;-
138-
139 rp = ret->d;-
140-
141 /*-
142 * Shift |nl| words to divide by R. We have |ap| < 2 * |n|. Note that |ap|-
143 * includes |carry| which is stored separately.-
144 */-
145 ap = &(r->d[nl]);-
146-
147 carry -= bn_sub_words(rp, ap, np, nl);-
148 /*-
149 * |carry| is -1 if |ap| - |np| underflowed or zero if it did not. Note-
150 * |carry| cannot be 1. That would imply the subtraction did not fit in-
151 * |nl| words, and we know at most one subtraction is needed.-
152 */-
153 for (i = 0; i < nl; i++) {
i < nlDescription
TRUEevaluated 2316678 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 407757 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
407757-2316678
154 rp[i] = (carry & ap[i]) | (~carry & rp[i]);-
155 ap[i] = 0;-
156 }
executed 2316678 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
2316678
157-
158 return 1;
executed 407757 times by 2 tests: return 1;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
407757
159}-
160#endif /* MONT_WORD */-
161-
162int BN_from_montgomery(BIGNUM *ret, const BIGNUM *a, BN_MONT_CTX *mont,-
163 BN_CTX *ctx)-
164{-
165 int retn;-
166-
167 retn = bn_from_mont_fixed_top(ret, a, mont, ctx);-
168 bn_correct_top(ret);-
169 bn_check_top(ret);-
170-
171 return retn;
executed 47264 times by 2 tests: return retn;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
47264
172}-
173-
174int bn_from_mont_fixed_top(BIGNUM *ret, const BIGNUM *a, BN_MONT_CTX *mont,-
175 BN_CTX *ctx)-
176{-
177 int retn = 0;-
178#ifdef MONT_WORD-
179 BIGNUM *t;-
180-
181 BN_CTX_start(ctx);-
182 if ((t = BN_CTX_get(ctx)) && BN_copy(t, a)) {
(t = BN_CTX_get(ctx))Description
TRUEevaluated 52012 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEnever evaluated
BN_copy(t, a)Description
TRUEevaluated 52012 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEnever evaluated
0-52012
183 retn = bn_from_montgomery_word(ret, t, mont);-
184 }
executed 52012 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
52012
185 BN_CTX_end(ctx);-
186#else /* !MONT_WORD */-
187 BIGNUM *t1, *t2;-
188-
189 BN_CTX_start(ctx);-
190 t1 = BN_CTX_get(ctx);-
191 t2 = BN_CTX_get(ctx);-
192 if (t2 == NULL)-
193 goto err;-
194-
195 if (!BN_copy(t1, a))-
196 goto err;-
197 BN_mask_bits(t1, mont->ri);-
198-
199 if (!BN_mul(t2, t1, &mont->Ni, ctx))-
200 goto err;-
201 BN_mask_bits(t2, mont->ri);-
202-
203 if (!BN_mul(t1, t2, &mont->N, ctx))-
204 goto err;-
205 if (!BN_add(t2, a, t1))-
206 goto err;-
207 if (!BN_rshift(ret, t2, mont->ri))-
208 goto err;-
209-
210 if (BN_ucmp(ret, &(mont->N)) >= 0) {-
211 if (!BN_usub(ret, ret, &(mont->N)))-
212 goto err;-
213 }-
214 retn = 1;-
215 bn_check_top(ret);-
216 err:-
217 BN_CTX_end(ctx);-
218#endif /* MONT_WORD */-
219 return retn;
executed 52012 times by 2 tests: return retn;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
52012
220}-
221-
222int bn_to_mont_fixed_top(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,-
223 BN_CTX *ctx)-
224{-
225 return bn_mul_mont_fixed_top(r, a, &(mont->RR), mont, ctx);
executed 37581 times by 2 tests: return bn_mul_mont_fixed_top(r, a, &(mont->RR), mont, ctx);
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
37581
226}-
227-
228BN_MONT_CTX *BN_MONT_CTX_new(void)-
229{-
230 BN_MONT_CTX *ret;-
231-
232 if ((ret = OPENSSL_malloc(sizeof(*ret))) == NULL) {
(ret = CRYPTO_...== ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 141614 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-141614
233 BNerr(BN_F_BN_MONT_CTX_NEW, ERR_R_MALLOC_FAILURE);-
234 return NULL;
never executed: return ((void *)0) ;
0
235 }-
236-
237 BN_MONT_CTX_init(ret);-
238 ret->flags = BN_FLG_MALLOCED;-
239 return ret;
executed 141614 times by 2 tests: return ret;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
141614
240}-
241-
242void BN_MONT_CTX_init(BN_MONT_CTX *ctx)-
243{-
244 ctx->ri = 0;-
245 bn_init(&ctx->RR);-
246 bn_init(&ctx->N);-
247 bn_init(&ctx->Ni);-
248 ctx->n0[0] = ctx->n0[1] = 0;-
249 ctx->flags = 0;-
250}
executed 141614 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
141614
251-
252void BN_MONT_CTX_free(BN_MONT_CTX *mont)-
253{-
254 if (mont == NULL)
mont == ((void *)0)Description
TRUEevaluated 218062 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 141614 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
141614-218062
255 return;
executed 218062 times by 2 tests: return;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
218062
256 BN_clear_free(&mont->RR);-
257 BN_clear_free(&mont->N);-
258 BN_clear_free(&mont->Ni);-
259 if (mont->flags & BN_FLG_MALLOCED)
mont->flags & 0x01Description
TRUEevaluated 141614 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEnever evaluated
0-141614
260 OPENSSL_free(mont);
executed 141614 times by 2 tests: CRYPTO_free(mont, __FILE__, 260);
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
141614
261}
executed 141614 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
141614
262-
263int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx)-
264{-
265 int i, ret = 0;-
266 BIGNUM *Ri, *R;-
267-
268 if (BN_is_zero(mod))
BN_is_zero(mod)Description
TRUEevaluated 1 time by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 83602 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
1-83602
269 return 0;
executed 1 time by 1 test: return 0;
Executed by:
  • libcrypto.so.1.1
1
270-
271 BN_CTX_start(ctx);-
272 if ((Ri = BN_CTX_get(ctx)) == NULL)
(Ri = BN_CTX_g...== ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 83602 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-83602
273 goto err;
never executed: goto err;
0
274 R = &(mont->RR); /* grab RR as a temp */-
275 if (!BN_copy(&(mont->N), mod))
!BN_copy(&(mont->N), mod)Description
TRUEnever evaluated
FALSEevaluated 83602 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-83602
276 goto err; /* Set N */
never executed: goto err;
0
277 if (BN_get_flags(mod, BN_FLG_CONSTTIME) != 0)
BN_get_flags(mod, 0x04) != 0Description
TRUEevaluated 8536 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 75066 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
8536-75066
278 BN_set_flags(&(mont->N), BN_FLG_CONSTTIME);
executed 8536 times by 1 test: BN_set_flags(&(mont->N), 0x04);
Executed by:
  • libcrypto.so.1.1
8536
279 mont->N.neg = 0;-
280-
281#ifdef MONT_WORD-
282 {-
283 BIGNUM tmod;-
284 BN_ULONG buf[2];-
285-
286 bn_init(&tmod);-
287 tmod.d = buf;-
288 tmod.dmax = 2;-
289 tmod.neg = 0;-
290-
291 if (BN_get_flags(mod, BN_FLG_CONSTTIME) != 0)
BN_get_flags(mod, 0x04) != 0Description
TRUEevaluated 8536 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 75066 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
8536-75066
292 BN_set_flags(&tmod, BN_FLG_CONSTTIME);
executed 8536 times by 1 test: BN_set_flags(&tmod, 0x04);
Executed by:
  • libcrypto.so.1.1
8536
293-
294 mont->ri = (BN_num_bits(mod) + (BN_BITS2 - 1)) / BN_BITS2 * BN_BITS2;-
295-
296# if defined(OPENSSL_BN_ASM_MONT) && (BN_BITS2<=32)-
297 /*-
298 * Only certain BN_BITS2<=32 platforms actually make use of n0[1],-
299 * and we could use the #else case (with a shorter R value) for the-
300 * others. However, currently only the assembler files do know which-
301 * is which.-
302 */-
303-
304 BN_zero(R);-
305 if (!(BN_set_bit(R, 2 * BN_BITS2)))-
306 goto err;-
307-
308 tmod.top = 0;-
309 if ((buf[0] = mod->d[0]))-
310 tmod.top = 1;-
311 if ((buf[1] = mod->top > 1 ? mod->d[1] : 0))-
312 tmod.top = 2;-
313-
314 if (BN_is_one(&tmod))-
315 BN_zero(Ri);-
316 else if ((BN_mod_inverse(Ri, R, &tmod, ctx)) == NULL)-
317 goto err;-
318 if (!BN_lshift(Ri, Ri, 2 * BN_BITS2))-
319 goto err; /* R*Ri */-
320 if (!BN_is_zero(Ri)) {-
321 if (!BN_sub_word(Ri, 1))-
322 goto err;-
323 } else { /* if N mod word size == 1 */-
324-
325 if (bn_expand(Ri, (int)sizeof(BN_ULONG) * 2) == NULL)-
326 goto err;-
327 /* Ri-- (mod double word size) */-
328 Ri->neg = 0;-
329 Ri->d[0] = BN_MASK2;-
330 Ri->d[1] = BN_MASK2;-
331 Ri->top = 2;-
332 }-
333 if (!BN_div(Ri, NULL, Ri, &tmod, ctx))-
334 goto err;-
335 /*-
336 * Ni = (R*Ri-1)/N, keep only couple of least significant words:-
337 */-
338 mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0;-
339 mont->n0[1] = (Ri->top > 1) ? Ri->d[1] : 0;-
340# else-
341 BN_zero(R);-
342 if (!(BN_set_bit(R, BN_BITS2)))
!(BN_set_bit(R, (8 * 8)))Description
TRUEnever evaluated
FALSEevaluated 83602 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-83602
343 goto err; /* R */
never executed: goto err;
0
344-
345 buf[0] = mod->d[0]; /* tmod = N mod word size */-
346 buf[1] = 0;-
347 tmod.top = buf[0] != 0 ? 1 : 0;
buf[0] != 0Description
TRUEevaluated 83563 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 39 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
39-83563
348 /* Ri = R^-1 mod N */-
349 if (BN_is_one(&tmod))
BN_is_one(&tmod)Description
TRUEevaluated 6654 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 76948 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
6654-76948
350 BN_zero(Ri);
executed 6654 times by 1 test: (BN_set_word((Ri),0));
Executed by:
  • libcrypto.so.1.1
6654
351 else if ((BN_mod_inverse(Ri, R, &tmod, ctx)) == NULL)
(BN_mod_invers...== ((void *)0)Description
TRUEevaluated 445 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 76503 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
445-76503
352 goto err;
executed 445 times by 1 test: goto err;
Executed by:
  • libcrypto.so.1.1
445
353 if (!BN_lshift(Ri, Ri, BN_BITS2))
!BN_lshift(Ri, Ri, (8 * 8))Description
TRUEnever evaluated
FALSEevaluated 83157 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-83157
354 goto err; /* R*Ri */
never executed: goto err;
0
355 if (!BN_is_zero(Ri)) {
!BN_is_zero(Ri)Description
TRUEevaluated 76503 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 6654 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
6654-76503
356 if (!BN_sub_word(Ri, 1))
!BN_sub_word(Ri, 1)Description
TRUEnever evaluated
FALSEevaluated 76503 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-76503
357 goto err;
never executed: goto err;
0
358 } else { /* if N mod word size == 1 */
executed 76503 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
76503
359-
360 if (!BN_set_word(Ri, BN_MASK2))
!BN_set_word(R...fffffffffffL))Description
TRUEnever evaluated
FALSEevaluated 6654 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-6654
361 goto err; /* Ri-- (mod word size) */
never executed: goto err;
0
362 }
executed 6654 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
6654
363 if (!BN_div(Ri, NULL, Ri, &tmod, ctx))
!BN_div(Ri, ((...i, &tmod, ctx)Description
TRUEnever evaluated
FALSEevaluated 83157 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-83157
364 goto err;
never executed: goto err;
0
365 /*-
366 * Ni = (R*Ri-1)/N, keep only least significant word:-
367 */-
368 mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0;
(Ri->top > 0)Description
TRUEevaluated 83157 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEnever evaluated
0-83157
369 mont->n0[1] = 0;-
370# endif-
371 }-
372#else /* !MONT_WORD */-
373 { /* bignum version */-
374 mont->ri = BN_num_bits(&mont->N);-
375 BN_zero(R);-
376 if (!BN_set_bit(R, mont->ri))-
377 goto err; /* R = 2^ri */-
378 /* Ri = R^-1 mod N */-
379 if ((BN_mod_inverse(Ri, R, &mont->N, ctx)) == NULL)-
380 goto err;-
381 if (!BN_lshift(Ri, Ri, mont->ri))-
382 goto err; /* R*Ri */-
383 if (!BN_sub_word(Ri, 1))-
384 goto err;-
385 /*-
386 * Ni = (R*Ri-1) / N-
387 */-
388 if (!BN_div(&(mont->Ni), NULL, Ri, &mont->N, ctx))-
389 goto err;-
390 }-
391#endif-
392-
393 /* setup RR for conversions */-
394 BN_zero(&(mont->RR));-
395 if (!BN_set_bit(&(mont->RR), mont->ri * 2))
!BN_set_bit(&(... mont->ri * 2)Description
TRUEnever evaluated
FALSEevaluated 83157 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-83157
396 goto err;
never executed: goto err;
0
397 if (!BN_mod(&(mont->RR), &(mont->RR), &(mont->N), ctx))
!BN_div( ((voi...nt->N)),(ctx))Description
TRUEnever evaluated
FALSEevaluated 83157 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-83157
398 goto err;
never executed: goto err;
0
399-
400 for (i = mont->RR.top, ret = mont->N.top; i < ret; i++)
i < retDescription
TRUEevaluated 22425 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 83157 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
22425-83157
401 mont->RR.d[i] = 0;
executed 22425 times by 1 test: mont->RR.d[i] = 0;
Executed by:
  • libcrypto.so.1.1
22425
402 mont->RR.top = ret;-
403 mont->RR.flags |= BN_FLG_FIXED_TOP;-
404-
405 ret = 1;-
406 err:
code before this statement executed 83157 times by 2 tests: err:
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
83157
407 BN_CTX_end(ctx);-
408 return ret;
executed 83602 times by 2 tests: return ret;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
83602
409}-
410-
411BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to, BN_MONT_CTX *from)-
412{-
413 if (to == from)
to == fromDescription
TRUEnever evaluated
FALSEevaluated 58017 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-58017
414 return to;
never executed: return to;
0
415-
416 if (!BN_copy(&(to->RR), &(from->RR)))
!BN_copy(&(to-..., &(from->RR))Description
TRUEnever evaluated
FALSEevaluated 58017 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-58017
417 return NULL;
never executed: return ((void *)0) ;
0
418 if (!BN_copy(&(to->N), &(from->N)))
!BN_copy(&(to->N), &(from->N))Description
TRUEnever evaluated
FALSEevaluated 58017 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-58017
419 return NULL;
never executed: return ((void *)0) ;
0
420 if (!BN_copy(&(to->Ni), &(from->Ni)))
!BN_copy(&(to-..., &(from->Ni))Description
TRUEnever evaluated
FALSEevaluated 58017 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-58017
421 return NULL;
never executed: return ((void *)0) ;
0
422 to->ri = from->ri;-
423 to->n0[0] = from->n0[0];-
424 to->n0[1] = from->n0[1];-
425 return to;
executed 58017 times by 2 tests: return to;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
58017
426}-
427-
428BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, CRYPTO_RWLOCK *lock,-
429 const BIGNUM *mod, BN_CTX *ctx)-
430{-
431 BN_MONT_CTX *ret;-
432-
433 CRYPTO_THREAD_read_lock(lock);-
434 ret = *pmont;-
435 CRYPTO_THREAD_unlock(lock);-
436 if (ret)
retDescription
TRUEevaluated 2376 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 8871 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
2376-8871
437 return ret;
executed 2376 times by 1 test: return ret;
Executed by:
  • libcrypto.so.1.1
2376
438-
439 /*-
440 * We don't want to serialise globally while doing our lazy-init math in-
441 * BN_MONT_CTX_set. That punishes threads that are doing independent-
442 * things. Instead, punish the case where more than one thread tries to-
443 * lazy-init the same 'pmont', by having each do the lazy-init math work-
444 * independently and only use the one from the thread that wins the race-
445 * (the losers throw away the work they've done).-
446 */-
447 ret = BN_MONT_CTX_new();-
448 if (ret == NULL)
ret == ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 8871 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-8871
449 return NULL;
never executed: return ((void *)0) ;
0
450 if (!BN_MONT_CTX_set(ret, mod, ctx)) {
!BN_MONT_CTX_s...ret, mod, ctx)Description
TRUEevaluated 22 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 8849 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
22-8849
451 BN_MONT_CTX_free(ret);-
452 return NULL;
executed 22 times by 1 test: return ((void *)0) ;
Executed by:
  • libcrypto.so.1.1
22
453 }-
454-
455 /* The locked compare-and-set, after the local work is done. */-
456 CRYPTO_THREAD_write_lock(lock);-
457 if (*pmont) {
*pmontDescription
TRUEnever evaluated
FALSEevaluated 8849 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-8849
458 BN_MONT_CTX_free(ret);-
459 ret = *pmont;-
460 } else
never executed: end of block
0
461 *pmont = ret;
executed 8849 times by 1 test: *pmont = ret;
Executed by:
  • libcrypto.so.1.1
8849
462 CRYPTO_THREAD_unlock(lock);-
463 return ret;
executed 8849 times by 1 test: return ret;
Executed by:
  • libcrypto.so.1.1
8849
464}-
Source codeSwitch to Preprocessed file
Generated by Squish Coco 4.2.2