OpenCoverage

bn_div.c

Absolute File Name:/home/opencoverage/opencoverage/guest-scripts/openssl/src/crypto/bn/bn_div.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#include <openssl/bn.h>-
11#include "internal/cryptlib.h"-
12#include "bn_lcl.h"-
13-
14/* The old slow way */-
15#if 0-
16int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m, const BIGNUM *d,-
17 BN_CTX *ctx)-
18{-
19 int i, nm, nd;-
20 int ret = 0;-
21 BIGNUM *D;-
22-
23 bn_check_top(m);-
24 bn_check_top(d);-
25 if (BN_is_zero(d)) {-
26 BNerr(BN_F_BN_DIV, BN_R_DIV_BY_ZERO);-
27 return 0;-
28 }-
29-
30 if (BN_ucmp(m, d) < 0) {-
31 if (rem != NULL) {-
32 if (BN_copy(rem, m) == NULL)-
33 return 0;-
34 }-
35 if (dv != NULL)-
36 BN_zero(dv);-
37 return 1;-
38 }-
39-
40 BN_CTX_start(ctx);-
41 D = BN_CTX_get(ctx);-
42 if (dv == NULL)-
43 dv = BN_CTX_get(ctx);-
44 if (rem == NULL)-
45 rem = BN_CTX_get(ctx);-
46 if (D == NULL || dv == NULL || rem == NULL)-
47 goto end;-
48-
49 nd = BN_num_bits(d);-
50 nm = BN_num_bits(m);-
51 if (BN_copy(D, d) == NULL)-
52 goto end;-
53 if (BN_copy(rem, m) == NULL)-
54 goto end;-
55-
56 /*-
57 * The next 2 are needed so we can do a dv->d[0]|=1 later since-
58 * BN_lshift1 will only work once there is a value :-)-
59 */-
60 BN_zero(dv);-
61 if (bn_wexpand(dv, 1) == NULL)-
62 goto end;-
63 dv->top = 1;-
64-
65 if (!BN_lshift(D, D, nm - nd))-
66 goto end;-
67 for (i = nm - nd; i >= 0; i--) {-
68 if (!BN_lshift1(dv, dv))-
69 goto end;-
70 if (BN_ucmp(rem, D) >= 0) {-
71 dv->d[0] |= 1;-
72 if (!BN_usub(rem, rem, D))-
73 goto end;-
74 }-
75/* CAN IMPROVE (and have now :=) */-
76 if (!BN_rshift1(D, D))-
77 goto end;-
78 }-
79 rem->neg = BN_is_zero(rem) ? 0 : m->neg;-
80 dv->neg = m->neg ^ d->neg;-
81 ret = 1;-
82 end:-
83 BN_CTX_end(ctx);-
84 return ret;-
85}-
86-
87#else-
88-
89# if !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM) \-
90 && !defined(PEDANTIC) && !defined(BN_DIV3W)-
91# if defined(__GNUC__) && __GNUC__>=2-
92# if defined(__i386) || defined (__i386__)-
93 /*--
94 * There were two reasons for implementing this template:-
95 * - GNU C generates a call to a function (__udivdi3 to be exact)-
96 * in reply to ((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0 (I fail to-
97 * understand why...);-
98 * - divl doesn't only calculate quotient, but also leaves-
99 * remainder in %edx which we can definitely use here:-)-
100 */-
101# undef bn_div_words-
102# define bn_div_words(n0,n1,d0) \-
103 ({ asm volatile ( \-
104 "divl %4" \-
105 : "=a"(q), "=d"(rem) \-
106 : "a"(n1), "d"(n0), "r"(d0) \-
107 : "cc"); \-
108 q; \-
109 })-
110# define REMAINDER_IS_ALREADY_CALCULATED-
111# elif defined(__x86_64) && defined(SIXTY_FOUR_BIT_LONG)-
112 /*-
113 * Same story here, but it's 128-bit by 64-bit division. Wow!-
114 */-
115# undef bn_div_words-
116# define bn_div_words(n0,n1,d0) \-
117 ({ asm volatile ( \-
118 "divq %4" \-
119 : "=a"(q), "=d"(rem) \-
120 : "a"(n1), "d"(n0), "r"(d0) \-
121 : "cc"); \-
122 q; \-
123 })-
124# define REMAINDER_IS_ALREADY_CALCULATED-
125# endif /* __<cpu> */-
126# endif /* __GNUC__ */-
127# endif /* OPENSSL_NO_ASM */-
128-
129/*--
130 * BN_div computes dv := num / divisor, rounding towards-
131 * zero, and sets up rm such that dv*divisor + rm = num holds.-
132 * Thus:-
133 * dv->neg == num->neg ^ divisor->neg (unless the result is zero)-
134 * rm->neg == num->neg (unless the remainder is zero)-
135 * If 'dv' or 'rm' is NULL, the respective value is not returned.-
136 */-
137int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,-
138 BN_CTX *ctx)-
139{-
140 int norm_shift, i, loop;-
141 BIGNUM *tmp, wnum, *snum, *sdiv, *res;-
142 BN_ULONG *resp, *wnump;-
143 BN_ULONG d0, d1;-
144 int num_n, div_n;-
145 int no_branch = 0;-
146-
147 /*-
148 * Invalid zero-padding would have particularly bad consequences so don't-
149 * just rely on bn_check_top() here (bn_check_top() works only for-
150 * BN_DEBUG builds)-
151 */-
152 if ((num->top > 0 && num->d[num->top - 1] == 0) ||
num->top > 0Description
TRUEevaluated 7089159 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 9339 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
num->d[num->top - 1] == 0Description
TRUEnever evaluated
FALSEevaluated 7089159 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-7089159
153 (divisor->top > 0 && divisor->d[divisor->top - 1] == 0)) {
divisor->top > 0Description
TRUEevaluated 7098495 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 3 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
divisor->d[div...>top - 1] == 0Description
TRUEnever evaluated
FALSEevaluated 7098495 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-7098495
154 BNerr(BN_F_BN_DIV, BN_R_NOT_INITIALIZED);-
155 return 0;
never executed: return 0;
0
156 }-
157-
158 bn_check_top(num);-
159 bn_check_top(divisor);-
160-
161 if ((BN_get_flags(num, BN_FLG_CONSTTIME) != 0)
(BN_get_flags(num, 0x04) != 0)Description
TRUEevaluated 2422072 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 4676426 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
2422072-4676426
162 || (BN_get_flags(divisor, BN_FLG_CONSTTIME) != 0)) {
(BN_get_flags(...r, 0x04) != 0)Description
TRUEevaluated 24686 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 4651740 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
24686-4651740
163 no_branch = 1;-
164 }
executed 2446758 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
2446758
165-
166 bn_check_top(dv);-
167 bn_check_top(rm);-
168 /*- bn_check_top(num); *//*-
169 * 'num' has been checked already-
170 */-
171 /*- bn_check_top(divisor); *//*-
172 * 'divisor' has been checked already-
173 */-
174-
175 if (BN_is_zero(divisor)) {
BN_is_zero(divisor)Description
TRUEevaluated 3 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 7098495 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
3-7098495
176 BNerr(BN_F_BN_DIV, BN_R_DIV_BY_ZERO);-
177 return 0;
executed 3 times by 1 test: return 0;
Executed by:
  • libcrypto.so.1.1
3
178 }-
179-
180 if (!no_branch && BN_ucmp(num, divisor) < 0) {
!no_branchDescription
TRUEevaluated 4651737 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 2446758 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
BN_ucmp(num, divisor) < 0Description
TRUEevaluated 230043 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 4421694 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
230043-4651737
181 if (rm != NULL) {
rm != ((void *)0)Description
TRUEevaluated 230042 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 1 time by 1 test
Evaluated by:
  • libcrypto.so.1.1
1-230042
182 if (BN_copy(rm, num) == NULL)
BN_copy(rm, nu...== ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 230042 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-230042
183 return 0;
never executed: return 0;
0
184 }
executed 230042 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
230042
185 if (dv != NULL)
dv != ((void *)0)Description
TRUEevaluated 96 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 229947 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
96-229947
186 BN_zero(dv);
executed 96 times by 1 test: (BN_set_word((dv),0));
Executed by:
  • libcrypto.so.1.1
96
187 return 1;
executed 230043 times by 2 tests: return 1;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
230043
188 }-
189-
190 BN_CTX_start(ctx);-
191 res = (dv == NULL) ? BN_CTX_get(ctx) : dv;
(dv == ((void *)0) )Description
TRUEevaluated 4360715 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 2507737 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
2507737-4360715
192 tmp = BN_CTX_get(ctx);-
193 snum = BN_CTX_get(ctx);-
194 sdiv = BN_CTX_get(ctx);-
195 if (sdiv == NULL)
sdiv == ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 6868452 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-6868452
196 goto err;
never executed: goto err;
0
197-
198 /* First we normalise the numbers */-
199 norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);-
200 if (!(BN_lshift(sdiv, divisor, norm_shift)))
!(BN_lshift(sd..., norm_shift))Description
TRUEnever evaluated
FALSEevaluated 6868452 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-6868452
201 goto err;
never executed: goto err;
0
202 sdiv->neg = 0;-
203 norm_shift += BN_BITS2;-
204 if (!(BN_lshift(snum, num, norm_shift)))
!(BN_lshift(sn..., norm_shift))Description
TRUEnever evaluated
FALSEevaluated 6868452 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-6868452
205 goto err;
never executed: goto err;
0
206 snum->neg = 0;-
207-
208 if (no_branch) {
no_branchDescription
TRUEevaluated 2446758 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 4421694 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
2446758-4421694
209 /*-
210 * Since we don't know whether snum is larger than sdiv, we pad snum-
211 * with enough zeroes without changing its value.-
212 */-
213 if (snum->top <= sdiv->top + 1) {
snum->top <= sdiv->top + 1Description
TRUEevaluated 532746 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 1914012 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
532746-1914012
214 if (bn_wexpand(snum, sdiv->top + 2) == NULL)
bn_wexpand(snu...== ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 532746 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-532746
215 goto err;
never executed: goto err;
0
216 for (i = snum->top; i < sdiv->top + 2; i++)
i < sdiv->top + 2Description
TRUEevaluated 532814 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 532746 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
532746-532814
217 snum->d[i] = 0;
executed 532814 times by 1 test: snum->d[i] = 0;
Executed by:
  • libcrypto.so.1.1
532814
218 snum->top = sdiv->top + 2;-
219 } else {
executed 532746 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
532746
220 if (bn_wexpand(snum, snum->top + 1) == NULL)
bn_wexpand(snu...== ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 1914012 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-1914012
221 goto err;
never executed: goto err;
0
222 snum->d[snum->top] = 0;-
223 snum->top++;-
224 }
executed 1914012 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
1914012
225 }-
226-
227 div_n = sdiv->top;-
228 num_n = snum->top;-
229 loop = num_n - div_n;-
230 /*-
231 * Lets setup a 'window' into snum This is the part that corresponds to-
232 * the current 'area' being divided-
233 */-
234 wnum.neg = 0;-
235 wnum.d = &(snum->d[loop]);-
236 wnum.top = div_n;-
237 wnum.flags = BN_FLG_STATIC_DATA;-
238 /*-
239 * only needed when BN_ucmp messes up the values between top and max-
240 */-
241 wnum.dmax = snum->dmax - loop; /* so we don't step out of bounds */-
242-
243 /* Get the top 2 words of sdiv */-
244 /* div_n=sdiv->top; */-
245 d0 = sdiv->d[div_n - 1];-
246 d1 = (div_n == 1) ? 0 : sdiv->d[div_n - 2];
(div_n == 1)Description
TRUEevaluated 534748 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 6333704 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
534748-6333704
247-
248 /* pointer to the 'top' of snum */-
249 wnump = &(snum->d[num_n - 1]);-
250-
251 /* Setup to 'res' */-
252 if (!bn_wexpand(res, (loop + 1)))
!bn_wexpand(res, (loop + 1))Description
TRUEnever evaluated
FALSEevaluated 6868452 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-6868452
253 goto err;
never executed: goto err;
0
254 res->neg = (num->neg ^ divisor->neg);-
255 res->top = loop - no_branch;-
256 resp = &(res->d[loop - 1]);-
257-
258 /* space for temp */-
259 if (!bn_wexpand(tmp, (div_n + 1)))
!bn_wexpand(tmp, (div_n + 1))Description
TRUEnever evaluated
FALSEevaluated 6868452 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-6868452
260 goto err;
never executed: goto err;
0
261-
262 if (!no_branch) {
!no_branchDescription
TRUEevaluated 4421694 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 2446758 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
2446758-4421694
263 if (BN_ucmp(&wnum, sdiv) >= 0) {
BN_ucmp(&wnum, sdiv) >= 0Description
TRUEevaluated 32266 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 4389428 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
32266-4389428
264 /*-
265 * If BN_DEBUG_RAND is defined BN_ucmp changes (via bn_pollute)-
266 * the const bignum arguments => clean the values between top and-
267 * max again-
268 */-
269 bn_clear_top2max(&wnum);-
270 bn_sub_words(wnum.d, wnum.d, sdiv->d, div_n);-
271 *resp = 1;-
272 } else
executed 32266 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
32266
273 res->top--;
executed 4389428 times by 2 tests: res->top--;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
4389428
274 }-
275-
276 /* Increase the resp pointer so that we never create an invalid pointer. */-
277 resp++;-
278-
279 /*-
280 * if res->top == 0 then clear the neg value otherwise decrease the resp-
281 * pointer-
282 */-
283 if (res->top == 0)
res->top == 0Description
TRUEnever evaluated
FALSEevaluated 6868452 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-6868452
284 res->neg = 0;
never executed: res->neg = 0;
0
285 else-
286 resp--;
executed 6868452 times by 2 tests: resp--;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
6868452
287-
288 for (i = 0; i < loop - 1; i++, wnump--) {
i < loop - 1Description
TRUEevaluated 22741823 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 6868452 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
6868452-22741823
289 BN_ULONG q, l0;-
290 /*-
291 * the first part of the loop uses the top two words of snum and sdiv-
292 * to calculate a BN_ULONG q such that | wnum - sdiv * q | < sdiv-
293 */-
294# if defined(BN_DIV3W) && !defined(OPENSSL_NO_ASM)-
295 BN_ULONG bn_div_3_words(BN_ULONG *, BN_ULONG, BN_ULONG);-
296 q = bn_div_3_words(wnump, d1, d0);-
297# else-
298 BN_ULONG n0, n1, rem = 0;-
299-
300 n0 = wnump[0];-
301 n1 = wnump[-1];-
302 if (n0 == d0)
n0 == d0Description
TRUEevaluated 90174 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 22651649 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
90174-22651649
303 q = BN_MASK2;
executed 90174 times by 1 test: q = (0xffffffffffffffffL);
Executed by:
  • libcrypto.so.1.1
90174
304 else { /* n0 < d0 */-
305-
306# ifdef BN_LLONG-
307 BN_ULLONG t2;-
308-
309# if defined(BN_LLONG) && defined(BN_DIV2W) && !defined(bn_div_words)-
310 q = (BN_ULONG)(((((BN_ULLONG) n0) << BN_BITS2) | n1) / d0);-
311# else-
312 q = bn_div_words(n0, n1, d0);-
313# endif-
314-
315# ifndef REMAINDER_IS_ALREADY_CALCULATED-
316 /*-
317 * rem doesn't have to be BN_ULLONG. The least we-
318 * know it's less that d0, isn't it?-
319 */-
320 rem = (n1 - q * d0) & BN_MASK2;-
321# endif-
322 t2 = (BN_ULLONG) d1 *q;-
323-
324 for (;;) {-
325 if (t2 <= ((((BN_ULLONG) rem) << BN_BITS2) | wnump[-2]))-
326 break;-
327 q--;-
328 rem += d0;-
329 if (rem < d0)-
330 break; /* don't let rem overflow */-
331 t2 -= d1;-
332 }-
333# else /* !BN_LLONG */-
334 BN_ULONG t2l, t2h;-
335-
336 q = bn_div_words(n0, n1, d0);-
337# ifndef REMAINDER_IS_ALREADY_CALCULATED-
338 rem = (n1 - q * d0) & BN_MASK2;-
339# endif-
340-
341# if defined(BN_UMULT_LOHI)-
342 BN_UMULT_LOHI(t2l, t2h, d1, q);-
343# elif defined(BN_UMULT_HIGH)-
344 t2l = d1 * q;-
345 t2h = BN_UMULT_HIGH(d1, q);-
346# else-
347 {-
348 BN_ULONG ql, qh;-
349 t2l = LBITS(d1);-
350 t2h = HBITS(d1);-
351 ql = LBITS(q);-
352 qh = HBITS(q);-
353 mul64(t2l, t2h, ql, qh); /* t2=(BN_ULLONG)d1*q; */-
354 }-
355# endif-
356-
357 for (;;) {-
358 if ((t2h < rem) || ((t2h == rem) && (t2l <= wnump[-2])))
(t2h < rem)Description
TRUEevaluated 16235308 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 6886873 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
(t2h == rem)Description
TRUEevaluated 412094 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 6474779 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
(t2l <= wnump[-2])Description
TRUEevaluated 333437 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 78657 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
78657-16235308
359 break;
executed 16568745 times by 2 tests: break;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
16568745
360 q--;-
361 rem += d0;-
362 if (rem < d0)
rem < d0Description
TRUEevaluated 6082904 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 470532 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
470532-6082904
363 break; /* don't let rem overflow */
executed 6082904 times by 2 tests: break;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
6082904
364 if (t2l < d1)
t2l < d1Description
TRUEevaluated 302015 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 168517 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
168517-302015
365 t2h--;
executed 302015 times by 2 tests: t2h--;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
302015
366 t2l -= d1;-
367 }
executed 470532 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
470532
368# endif /* !BN_LLONG */-
369 }
executed 22651649 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
22651649
370# endif /* !BN_DIV3W */-
371-
372 l0 = bn_mul_words(tmp->d, sdiv->d, div_n, q);-
373 tmp->d[div_n] = l0;-
374 wnum.d--;-
375 /*-
376 * ingore top values of the bignums just sub the two BN_ULONG arrays-
377 * with bn_sub_words-
378 */-
379 if (bn_sub_words(wnum.d, wnum.d, tmp->d, div_n + 1)) {
bn_sub_words(w...>d, div_n + 1)Description
TRUEevaluated 78007 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 22663816 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
78007-22663816
380 /*-
381 * Note: As we have considered only the leading two BN_ULONGs in-
382 * the calculation of q, sdiv * q might be greater than wnum (but-
383 * then (q-1) * sdiv is less or equal than wnum)-
384 */-
385 q--;-
386 if (bn_add_words(wnum.d, wnum.d, sdiv->d, div_n))
bn_add_words(w...div->d, div_n)Description
TRUEevaluated 78007 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEnever evaluated
0-78007
387 /*-
388 * we can't have an overflow here (assuming that q != 0, but-
389 * if q == 0 then tmp is zero anyway)-
390 */-
391 (*wnump)++;
executed 78007 times by 1 test: (*wnump)++;
Executed by:
  • libcrypto.so.1.1
78007
392 }
executed 78007 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
78007
393 /* store part of the result */-
394 resp--;-
395 *resp = q;-
396 }
executed 22741823 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
22741823
397 bn_correct_top(snum);-
398 if (rm != NULL) {
rm != ((void *)0)Description
TRUEevaluated 6784165 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 84287 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
84287-6784165
399 /*-
400 * Keep a copy of the neg flag in num because if rm==num BN_rshift()-
401 * will overwrite it.-
402 */-
403 int neg = num->neg;-
404 BN_rshift(rm, snum, norm_shift);-
405 if (!BN_is_zero(rm))
!BN_is_zero(rm)Description
TRUEevaluated 6751259 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 32906 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
32906-6751259
406 rm->neg = neg;
executed 6751259 times by 2 tests: rm->neg = neg;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
6751259
407 bn_check_top(rm);-
408 }
executed 6784165 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
6784165
409 if (no_branch)
no_branchDescription
TRUEevaluated 2446758 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 4421694 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
2446758-4421694
410 bn_correct_top(res);
executed 2446758 times by 2 tests: bn_correct_top(res);
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
2446758
411 BN_CTX_end(ctx);-
412 return 1;
executed 6868452 times by 2 tests: return 1;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
6868452
413 err:-
414 bn_check_top(rm);-
415 BN_CTX_end(ctx);-
416 return 0;
never executed: return 0;
0
417}-
418#endif-
Source codeSwitch to Preprocessed file
Generated by Squish Coco 4.2.2