OpenCoverage

bn_mul.c

Absolute File Name:/home/opencoverage/opencoverage/guest-scripts/openssl/src/crypto/bn/bn_mul.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 <assert.h>-
11#include "internal/cryptlib.h"-
12#include "bn_lcl.h"-
13-
14#if defined(OPENSSL_NO_ASM) || !defined(OPENSSL_BN_ASM_PART_WORDS)-
15/*-
16 * Here follows specialised variants of bn_add_words() and bn_sub_words().-
17 * They have the property performing operations on arrays of different sizes.-
18 * The sizes of those arrays is expressed through cl, which is the common-
19 * length ( basically, min(len(a),len(b)) ), and dl, which is the delta-
20 * between the two lengths, calculated as len(a)-len(b). All lengths are the-
21 * number of BN_ULONGs... For the operations that require a result array as-
22 * parameter, it must have the length cl+abs(dl). These functions should-
23 * probably end up in bn_asm.c as soon as there are assembler counterparts-
24 * for the systems that use assembler files.-
25 */-
26-
27BN_ULONG bn_sub_part_words(BN_ULONG *r,-
28 const BN_ULONG *a, const BN_ULONG *b,-
29 int cl, int dl)-
30{-
31 BN_ULONG c, t;-
32-
33 assert(cl >= 0);-
34 c = bn_sub_words(r, a, b, cl);-
35-
36 if (dl == 0)
dl == 0Description
TRUEevaluated 565727 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 78753 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
78753-565727
37 return c;
executed 565727 times by 1 test: return c;
Executed by:
  • libcrypto.so.1.1
565727
38-
39 r += cl;-
40 a += cl;-
41 b += cl;-
42-
43 if (dl < 0) {
dl < 0Description
TRUEevaluated 9582 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 69171 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
9582-69171
44 for (;;) {-
45 t = b[0];-
46 r[0] = (0 - t - c) & BN_MASK2;-
47 if (t != 0)
t != 0Description
TRUEnever evaluated
FALSEevaluated 28644 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-28644
48 c = 1;
never executed: c = 1;
0
49 if (++dl >= 0)
++dl >= 0Description
TRUEevaluated 1516 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 27128 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
1516-27128
50 break;
executed 1516 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
1516
51-
52 t = b[1];-
53 r[1] = (0 - t - c) & BN_MASK2;-
54 if (t != 0)
t != 0Description
TRUEnever evaluated
FALSEevaluated 27128 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-27128
55 c = 1;
never executed: c = 1;
0
56 if (++dl >= 0)
++dl >= 0Description
TRUEevaluated 892 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 26236 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
892-26236
57 break;
executed 892 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
892
58-
59 t = b[2];-
60 r[2] = (0 - t - c) & BN_MASK2;-
61 if (t != 0)
t != 0Description
TRUEnever evaluated
FALSEevaluated 26236 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-26236
62 c = 1;
never executed: c = 1;
0
63 if (++dl >= 0)
++dl >= 0Description
TRUEevaluated 4109 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 22127 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
4109-22127
64 break;
executed 4109 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
4109
65-
66 t = b[3];-
67 r[3] = (0 - t - c) & BN_MASK2;-
68 if (t != 0)
t != 0Description
TRUEnever evaluated
FALSEevaluated 22127 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-22127
69 c = 1;
never executed: c = 1;
0
70 if (++dl >= 0)
++dl >= 0Description
TRUEevaluated 3065 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 19062 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
3065-19062
71 break;
executed 3065 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
3065
72-
73 b += 4;-
74 r += 4;-
75 }
executed 19062 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
19062
76 } else {
executed 9582 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
9582
77 int save_dl = dl;-
78 while (c) {
cDescription
TRUEevaluated 26392 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 60860 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
26392-60860
79 t = a[0];-
80 r[0] = (t - c) & BN_MASK2;-
81 if (t != 0)
t != 0Description
TRUEevaluated 11118 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 15274 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
11118-15274
82 c = 0;
executed 11118 times by 1 test: c = 0;
Executed by:
  • libcrypto.so.1.1
11118
83 if (--dl <= 0)
--dl <= 0Description
TRUEevaluated 2849 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 23543 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
2849-23543
84 break;
executed 2849 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
2849
85-
86 t = a[1];-
87 r[1] = (t - c) & BN_MASK2;-
88 if (t != 0)
t != 0Description
TRUEevaluated 8763 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 14780 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
8763-14780
89 c = 0;
executed 8763 times by 1 test: c = 0;
Executed by:
  • libcrypto.so.1.1
8763
90 if (--dl <= 0)
--dl <= 0Description
TRUEevaluated 2455 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 21088 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
2455-21088
91 break;
executed 2455 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
2455
92-
93 t = a[2];-
94 r[2] = (t - c) & BN_MASK2;-
95 if (t != 0)
t != 0Description
TRUEevaluated 7522 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 13566 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
7522-13566
96 c = 0;
executed 7522 times by 1 test: c = 0;
Executed by:
  • libcrypto.so.1.1
7522
97 if (--dl <= 0)
--dl <= 0Description
TRUEevaluated 1242 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 19846 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
1242-19846
98 break;
executed 1242 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
1242
99-
100 t = a[3];-
101 r[3] = (t - c) & BN_MASK2;-
102 if (t != 0)
t != 0Description
TRUEevaluated 6476 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 13370 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
6476-13370
103 c = 0;
executed 6476 times by 1 test: c = 0;
Executed by:
  • libcrypto.so.1.1
6476
104 if (--dl <= 0)
--dl <= 0Description
TRUEevaluated 1765 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 18081 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
1765-18081
105 break;
executed 1765 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
1765
106-
107 save_dl = dl;-
108 a += 4;-
109 r += 4;-
110 }
executed 18081 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
18081
111 if (dl > 0) {
dl > 0Description
TRUEevaluated 60860 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 8311 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
8311-60860
112 if (save_dl > dl) {
save_dl > dlDescription
TRUEnever evaluated
FALSEevaluated 60860 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-60860
113 switch (save_dl - dl) {-
114 case 1:
never executed: case 1:
0
115 r[1] = a[1];-
116 if (--dl <= 0)
--dl <= 0Description
TRUEnever evaluated
FALSEnever evaluated
0
117 break;
never executed: break;
0
118 /* fall thru */-
119 case 2:
code before this statement never executed: case 2:
never executed: case 2:
0
120 r[2] = a[2];-
121 if (--dl <= 0)
--dl <= 0Description
TRUEnever evaluated
FALSEnever evaluated
0
122 break;
never executed: break;
0
123 /* fall thru */-
124 case 3:
code before this statement never executed: case 3:
never executed: case 3:
0
125 r[3] = a[3];-
126 if (--dl <= 0)
--dl <= 0Description
TRUEnever evaluated
FALSEnever evaluated
0
127 break;
never executed: break;
0
128 }
never executed: end of block
0
129 a += 4;-
130 r += 4;-
131 }
never executed: end of block
0
132 }
executed 60860 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
60860
133 if (dl > 0) {
dl > 0Description
TRUEevaluated 60860 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 8311 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
8311-60860
134 for (;;) {-
135 r[0] = a[0];-
136 if (--dl <= 0)
--dl <= 0Description
TRUEevaluated 17509 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 250859 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
17509-250859
137 break;
executed 17509 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
17509
138 r[1] = a[1];-
139 if (--dl <= 0)
--dl <= 0Description
TRUEevaluated 9171 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 241688 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
9171-241688
140 break;
executed 9171 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
9171
141 r[2] = a[2];-
142 if (--dl <= 0)
--dl <= 0Description
TRUEevaluated 18155 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 223533 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
18155-223533
143 break;
executed 18155 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
18155
144 r[3] = a[3];-
145 if (--dl <= 0)
--dl <= 0Description
TRUEevaluated 16025 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 207508 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
16025-207508
146 break;
executed 16025 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
16025
147-
148 a += 4;-
149 r += 4;-
150 }
executed 207508 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
207508
151 }
executed 60860 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
60860
152 }
executed 69171 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
69171
153 return c;
executed 78753 times by 1 test: return c;
Executed by:
  • libcrypto.so.1.1
78753
154}-
155#endif-
156-
157#ifdef BN_RECURSION-
158/*-
159 * Karatsuba recursive multiplication algorithm (cf. Knuth, The Art of-
160 * Computer Programming, Vol. 2)-
161 */-
162-
163/*--
164 * r is 2*n2 words in size,-
165 * a and b are both n2 words in size.-
166 * n2 must be a power of 2.-
167 * We multiply and return the result.-
168 * t must be 2*n2 words in size-
169 * We calculate-
170 * a[0]*b[0]-
171 * a[0]*b[0]+a[1]*b[1]+(a[0]-a[1])*(b[1]-b[0])-
172 * a[1]*b[1]-
173 */-
174/* dnX may not be positive, but n2/2+dnX has to be */-
175void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,-
176 int dna, int dnb, BN_ULONG *t)-
177{-
178 int n = n2 / 2, c1, c2;-
179 int tna = n + dna, tnb = n + dnb;-
180 unsigned int neg, zero;-
181 BN_ULONG ln, lo, *p;-
182-
183# ifdef BN_MUL_COMBA-
184# if 0-
185 if (n2 == 4) {-
186 bn_mul_comba4(r, a, b);-
187 return;-
188 }-
189# endif-
190 /*-
191 * Only call bn_mul_comba 8 if n2 == 8 and the two arrays are complete-
192 * [steve]-
193 */-
194 if (n2 == 8 && dna == 0 && dnb == 0) {
n2 == 8Description
TRUEevaluated 20495 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 323584 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
dna == 0Description
TRUEevaluated 17135 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 3360 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
dnb == 0Description
TRUEevaluated 13554 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 3581 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
3360-323584
195 bn_mul_comba8(r, a, b);-
196 return;
executed 13554 times by 1 test: return;
Executed by:
  • libcrypto.so.1.1
13554
197 }-
198# endif /* BN_MUL_COMBA */-
199 /* Else do normal multiply */-
200 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) {
n2 < (16)Description
TRUEevaluated 6941 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 323584 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
6941-323584
201 bn_mul_normal(r, a, n2 + dna, b, n2 + dnb);-
202 if ((dna + dnb) < 0)
(dna + dnb) < 0Description
TRUEevaluated 6941 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEnever evaluated
0-6941
203 memset(&r[2 * n2 + dna + dnb], 0,
executed 6941 times by 1 test: memset(&r[2 * n2 + dna + dnb], 0, sizeof(unsigned long) * -(dna + dnb));
Executed by:
  • libcrypto.so.1.1
6941
204 sizeof(BN_ULONG) * -(dna + dnb));
executed 6941 times by 1 test: memset(&r[2 * n2 + dna + dnb], 0, sizeof(unsigned long) * -(dna + dnb));
Executed by:
  • libcrypto.so.1.1
6941
205 return;
executed 6941 times by 1 test: return;
Executed by:
  • libcrypto.so.1.1
6941
206 }-
207 /* r=(a[0]-a[1])*(b[1]-b[0]) */-
208 c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);-
209 c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);-
210 zero = neg = 0;-
211 switch (c1 * 3 + c2) {-
212 case -4:
executed 58472 times by 1 test: case -4:
Executed by:
  • libcrypto.so.1.1
58472
213 bn_sub_part_words(t, &(a[n]), a, tna, tna - n); /* - */-
214 bn_sub_part_words(&(t[n]), b, &(b[n]), tnb, n - tnb); /* - */-
215 break;
executed 58472 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
58472
216 case -3:
executed 5972 times by 1 test: case -3:
Executed by:
  • libcrypto.so.1.1
5972
217 zero = 1;-
218 break;
executed 5972 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
5972
219 case -2:
executed 57836 times by 1 test: case -2:
Executed by:
  • libcrypto.so.1.1
57836
220 bn_sub_part_words(t, &(a[n]), a, tna, tna - n); /* - */-
221 bn_sub_part_words(&(t[n]), &(b[n]), b, tnb, tnb - n); /* + */-
222 neg = 1;-
223 break;
executed 57836 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
57836
224 case -1:
executed 8391 times by 1 test: case -1:
Executed by:
  • libcrypto.so.1.1
8391
225 case 0:
executed 6341 times by 1 test: case 0:
Executed by:
  • libcrypto.so.1.1
6341
226 case 1:
executed 9235 times by 1 test: case 1:
Executed by:
  • libcrypto.so.1.1
9235
227 zero = 1;-
228 break;
executed 23967 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
23967
229 case 2:
executed 94853 times by 1 test: case 2:
Executed by:
  • libcrypto.so.1.1
94853
230 bn_sub_part_words(t, a, &(a[n]), tna, n - tna); /* + */-
231 bn_sub_part_words(&(t[n]), b, &(b[n]), tnb, n - tnb); /* - */-
232 neg = 1;-
233 break;
executed 94853 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
94853
234 case 3:
executed 6759 times by 1 test: case 3:
Executed by:
  • libcrypto.so.1.1
6759
235 zero = 1;-
236 break;
executed 6759 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
6759
237 case 4:
executed 75725 times by 1 test: case 4:
Executed by:
  • libcrypto.so.1.1
75725
238 bn_sub_part_words(t, a, &(a[n]), tna, n - tna);-
239 bn_sub_part_words(&(t[n]), &(b[n]), b, tnb, tnb - n);-
240 break;
executed 75725 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
75725
241 }-
242-
243# ifdef BN_MUL_COMBA-
244 if (n == 4 && dna == 0 && dnb == 0) { /* XXX: bn_mul_comba4 could take
n == 4Description
TRUEnever evaluated
FALSEevaluated 323584 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
dna == 0Description
TRUEnever evaluated
FALSEnever evaluated
dnb == 0Description
TRUEnever evaluated
FALSEnever evaluated
0-323584
245 * extra args to do this well */-
246 if (!zero)
!zeroDescription
TRUEnever evaluated
FALSEnever evaluated
0
247 bn_mul_comba4(&(t[n2]), t, &(t[n]));
never executed: bn_mul_comba4(&(t[n2]), t, &(t[n]));
0
248 else-
249 memset(&t[n2], 0, sizeof(*t) * 8);
never executed: memset(&t[n2], 0, sizeof(*t) * 8);
0
250-
251 bn_mul_comba4(r, a, b);-
252 bn_mul_comba4(&(r[n2]), &(a[n]), &(b[n]));-
253 } else if (n == 8 && dna == 0 && dnb == 0) { /* XXX: bn_mul_comba8 could
never executed: end of block
n == 8Description
TRUEevaluated 239618 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 83966 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
dna == 0Description
TRUEevaluated 236508 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 3110 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
dnb == 0Description
TRUEevaluated 233028 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 3480 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-239618
254 * take extra args to do-
255 * this well */-
256 if (!zero)
!zeroDescription
TRUEevaluated 204044 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 28984 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
28984-204044
257 bn_mul_comba8(&(t[n2]), t, &(t[n]));
executed 204044 times by 1 test: bn_mul_comba8(&(t[n2]), t, &(t[n]));
Executed by:
  • libcrypto.so.1.1
204044
258 else-
259 memset(&t[n2], 0, sizeof(*t) * 16);
executed 28984 times by 1 test: memset(&t[n2], 0, sizeof(*t) * 16);
Executed by:
  • libcrypto.so.1.1
28984
260-
261 bn_mul_comba8(r, a, b);-
262 bn_mul_comba8(&(r[n2]), &(a[n]), &(b[n]));-
263 } else
executed 233028 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
233028
264# endif /* BN_MUL_COMBA */-
265 {-
266 p = &(t[n2 * 2]);-
267 if (!zero)
!zeroDescription
TRUEevaluated 82842 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 7714 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
7714-82842
268 bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
executed 82842 times by 1 test: bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
Executed by:
  • libcrypto.so.1.1
82842
269 else-
270 memset(&t[n2], 0, sizeof(*t) * n2);
executed 7714 times by 1 test: memset(&t[n2], 0, sizeof(*t) * n2);
Executed by:
  • libcrypto.so.1.1
7714
271 bn_mul_recursive(r, a, b, n, 0, 0, p);-
272 bn_mul_recursive(&(r[n2]), &(a[n]), &(b[n]), n, dna, dnb, p);-
273 }
executed 90556 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
90556
274-
275 /*--
276 * t[32] holds (a[0]-a[1])*(b[1]-b[0]), c1 is the sign-
277 * r[10] holds (a[0]*b[0])-
278 * r[32] holds (b[1]*b[1])-
279 */-
280-
281 c1 = (int)(bn_add_words(t, r, &(r[n2]), n2));-
282-
283 if (neg) { /* if t[32] is negative */
negDescription
TRUEevaluated 152689 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 170895 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
152689-170895
284 c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2));-
285 } else {
executed 152689 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
152689
286 /* Might have a carry */-
287 c1 += (int)(bn_add_words(&(t[n2]), &(t[n2]), t, n2));-
288 }
executed 170895 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
170895
289-
290 /*--
291 * t[32] holds (a[0]-a[1])*(b[1]-b[0])+(a[0]*b[0])+(a[1]*b[1])-
292 * r[10] holds (a[0]*b[0])-
293 * r[32] holds (b[1]*b[1])-
294 * c1 holds the carry bits-
295 */-
296 c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2));-
297 if (c1) {
c1Description
TRUEevaluated 104120 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 219464 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
104120-219464
298 p = &(r[n + n2]);-
299 lo = *p;-
300 ln = (lo + c1) & BN_MASK2;-
301 *p = ln;-
302-
303 /*-
304 * The overflow will stop before we over write words we should not-
305 * overwrite-
306 */-
307 if (ln < (BN_ULONG)c1) {
ln < (unsigned long)c1Description
TRUEevaluated 980 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 103140 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
980-103140
308 do {-
309 p++;-
310 lo = *p;-
311 ln = (lo + 1) & BN_MASK2;-
312 *p = ln;-
313 } while (ln == 0);
executed 4588 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
ln == 0Description
TRUEevaluated 3608 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 980 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
980-4588
314 }
executed 980 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
980
315 }
executed 104120 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
104120
316}
executed 323584 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
323584
317-
318/*-
319 * n+tn is the word length t needs to be n*4 is size, as does r-
320 */-
321/* tnX may not be negative but less than n */-
322void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,-
323 int tna, int tnb, BN_ULONG *t)-
324{-
325 int i, j, n2 = n * 2;-
326 int c1, c2, neg;-
327 BN_ULONG ln, lo, *p;-
328-
329 if (n < 8) {
n < 8Description
TRUEnever evaluated
FALSEevaluated 35354 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-35354
330 bn_mul_normal(r, a, n + tna, b, n + tnb);-
331 return;
never executed: return;
0
332 }-
333-
334 /* r=(a[0]-a[1])*(b[1]-b[0]) */-
335 c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);-
336 c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);-
337 neg = 0;-
338 switch (c1 * 3 + c2) {-
339 case -4:
executed 5260 times by 1 test: case -4:
Executed by:
  • libcrypto.so.1.1
5260
340 bn_sub_part_words(t, &(a[n]), a, tna, tna - n); /* - */-
341 bn_sub_part_words(&(t[n]), b, &(b[n]), tnb, n - tnb); /* - */-
342 break;
executed 5260 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
5260
343 case -3:
executed 304 times by 1 test: case -3:
Executed by:
  • libcrypto.so.1.1
304
344 case -2:
executed 1039 times by 1 test: case -2:
Executed by:
  • libcrypto.so.1.1
1039
345 bn_sub_part_words(t, &(a[n]), a, tna, tna - n); /* - */-
346 bn_sub_part_words(&(t[n]), &(b[n]), b, tnb, tnb - n); /* + */-
347 neg = 1;-
348 break;
executed 1343 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
1343
349 case -1:
executed 676 times by 1 test: case -1:
Executed by:
  • libcrypto.so.1.1
676
350 case 0:
executed 354 times by 1 test: case 0:
Executed by:
  • libcrypto.so.1.1
354
351 case 1:
executed 234 times by 1 test: case 1:
Executed by:
  • libcrypto.so.1.1
234
352 case 2:
executed 26345 times by 1 test: case 2:
Executed by:
  • libcrypto.so.1.1
26345
353 bn_sub_part_words(t, a, &(a[n]), tna, n - tna); /* + */-
354 bn_sub_part_words(&(t[n]), b, &(b[n]), tnb, n - tnb); /* - */-
355 neg = 1;-
356 break;
executed 27609 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
27609
357 case 3:
executed 407 times by 1 test: case 3:
Executed by:
  • libcrypto.so.1.1
407
358 case 4:
executed 735 times by 1 test: case 4:
Executed by:
  • libcrypto.so.1.1
735
359 bn_sub_part_words(t, a, &(a[n]), tna, n - tna);-
360 bn_sub_part_words(&(t[n]), &(b[n]), b, tnb, tnb - n);-
361 break;
executed 1142 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
1142
362 }-
363 /*-
364 * The zero case isn't yet implemented here. The speedup would probably-
365 * be negligible.-
366 */-
367# if 0-
368 if (n == 4) {-
369 bn_mul_comba4(&(t[n2]), t, &(t[n]));-
370 bn_mul_comba4(r, a, b);-
371 bn_mul_normal(&(r[n2]), &(a[n]), tn, &(b[n]), tn);-
372 memset(&r[n2 + tn * 2], 0, sizeof(*r) * (n2 - tn * 2));-
373 } else-
374# endif-
375 if (n == 8) {
n == 8Description
TRUEevaluated 6517 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 28837 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
6517-28837
376 bn_mul_comba8(&(t[n2]), t, &(t[n]));-
377 bn_mul_comba8(r, a, b);-
378 bn_mul_normal(&(r[n2]), &(a[n]), tna, &(b[n]), tnb);-
379 memset(&r[n2 + tna + tnb], 0, sizeof(*r) * (n2 - tna - tnb));-
380 } else {
executed 6517 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
6517
381 p = &(t[n2 * 2]);-
382 bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);-
383 bn_mul_recursive(r, a, b, n, 0, 0, p);-
384 i = n / 2;-
385 /*-
386 * If there is only a bottom half to the number, just do it-
387 */-
388 if (tna > tnb)
tna > tnbDescription
TRUEevaluated 5237 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 23600 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
5237-23600
389 j = tna - i;
executed 5237 times by 1 test: j = tna - i;
Executed by:
  • libcrypto.so.1.1
5237
390 else-
391 j = tnb - i;
executed 23600 times by 1 test: j = tnb - i;
Executed by:
  • libcrypto.so.1.1
23600
392 if (j == 0) {
j == 0Description
TRUEevaluated 5516 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 23321 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
5516-23321
393 bn_mul_recursive(&(r[n2]), &(a[n]), &(b[n]),-
394 i, tna - i, tnb - i, p);-
395 memset(&r[n2 + i * 2], 0, sizeof(*r) * (n2 - i * 2));-
396 } else if (j > 0) { /* eg, n == 16, i == 8 and tn == 11 */
executed 5516 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
j > 0Description
TRUEevaluated 7072 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 16249 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
5516-16249
397 bn_mul_part_recursive(&(r[n2]), &(a[n]), &(b[n]),-
398 i, tna - i, tnb - i, p);-
399 memset(&(r[n2 + tna + tnb]), 0,-
400 sizeof(BN_ULONG) * (n2 - tna - tnb));-
401 } else { /* (j < 0) eg, n == 16, i == 8 and tn == 5 */
executed 7072 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
7072
402-
403 memset(&r[n2], 0, sizeof(*r) * n2);-
404 if (tna < BN_MUL_RECURSIVE_SIZE_NORMAL
tna < (16)Description
TRUEevaluated 14729 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 1520 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
1520-14729
405 && tnb < BN_MUL_RECURSIVE_SIZE_NORMAL) {
tnb < (16)Description
TRUEevaluated 14413 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 316 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
316-14413
406 bn_mul_normal(&(r[n2]), &(a[n]), tna, &(b[n]), tnb);-
407 } else {
executed 14413 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
14413
408 for (;;) {-
409 i /= 2;-
410 /*-
411 * these simplified conditions work exclusively because-
412 * difference between tna and tnb is 1 or 0-
413 */-
414 if (i < tna || i < tnb) {
i < tnaDescription
TRUEevaluated 700 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 1873 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
i < tnbDescription
TRUEevaluated 282 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 1591 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
282-1873
415 bn_mul_part_recursive(&(r[n2]),-
416 &(a[n]), &(b[n]),-
417 i, tna - i, tnb - i, p);-
418 break;
executed 982 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
982
419 } else if (i == tna || i == tnb) {
i == tnaDescription
TRUEevaluated 538 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 1053 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
i == tnbDescription
TRUEevaluated 316 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 737 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
316-1053
420 bn_mul_recursive(&(r[n2]),-
421 &(a[n]), &(b[n]),-
422 i, tna - i, tnb - i, p);-
423 break;
executed 854 times by 1 test: break;
Executed by:
  • libcrypto.so.1.1
854
424 }-
425 }
executed 737 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
737
426 }
executed 1836 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
1836
427 }-
428 }-
429-
430 /*--
431 * t[32] holds (a[0]-a[1])*(b[1]-b[0]), c1 is the sign-
432 * r[10] holds (a[0]*b[0])-
433 * r[32] holds (b[1]*b[1])-
434 */-
435-
436 c1 = (int)(bn_add_words(t, r, &(r[n2]), n2));-
437-
438 if (neg) { /* if t[32] is negative */
negDescription
TRUEevaluated 28952 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 6402 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
6402-28952
439 c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2));-
440 } else {
executed 28952 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
28952
441 /* Might have a carry */-
442 c1 += (int)(bn_add_words(&(t[n2]), &(t[n2]), t, n2));-
443 }
executed 6402 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
6402
444-
445 /*--
446 * t[32] holds (a[0]-a[1])*(b[1]-b[0])+(a[0]*b[0])+(a[1]*b[1])-
447 * r[10] holds (a[0]*b[0])-
448 * r[32] holds (b[1]*b[1])-
449 * c1 holds the carry bits-
450 */-
451 c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2));-
452 if (c1) {
c1Description
TRUEevaluated 651 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 34703 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
651-34703
453 p = &(r[n + n2]);-
454 lo = *p;-
455 ln = (lo + c1) & BN_MASK2;-
456 *p = ln;-
457-
458 /*-
459 * The overflow will stop before we over write words we should not-
460 * overwrite-
461 */-
462 if (ln < (BN_ULONG)c1) {
ln < (unsigned long)c1Description
TRUEevaluated 359 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 292 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
292-359
463 do {-
464 p++;-
465 lo = *p;-
466 ln = (lo + 1) & BN_MASK2;-
467 *p = ln;-
468 } while (ln == 0);
executed 1491 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
ln == 0Description
TRUEevaluated 1132 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 359 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
359-1491
469 }
executed 359 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
359
470 }
executed 651 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
651
471}
executed 35354 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
35354
472-
473/*--
474 * a and b must be the same size, which is n2.-
475 * r needs to be n2 words and t needs to be n2*2-
476 */-
477void bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,-
478 BN_ULONG *t)-
479{-
480 int n = n2 / 2;-
481-
482 bn_mul_recursive(r, a, b, n, 0, 0, &(t[0]));-
483 if (n >= BN_MUL_LOW_RECURSIVE_SIZE_NORMAL) {
n >= (32)Description
TRUEnever evaluated
FALSEnever evaluated
0
484 bn_mul_low_recursive(&(t[0]), &(a[0]), &(b[n]), n, &(t[n2]));-
485 bn_add_words(&(r[n]), &(r[n]), &(t[0]), n);-
486 bn_mul_low_recursive(&(t[0]), &(a[n]), &(b[0]), n, &(t[n2]));-
487 bn_add_words(&(r[n]), &(r[n]), &(t[0]), n);-
488 } else {
never executed: end of block
0
489 bn_mul_low_normal(&(t[0]), &(a[0]), &(b[n]), n);-
490 bn_mul_low_normal(&(t[n]), &(a[n]), &(b[0]), n);-
491 bn_add_words(&(r[n]), &(r[n]), &(t[0]), n);-
492 bn_add_words(&(r[n]), &(r[n]), &(t[n]), n);-
493 }
never executed: end of block
0
494}-
495#endif /* BN_RECURSION */-
496-
497int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)-
498{-
499 int ret = bn_mul_fixed_top(r, a, b, ctx);-
500-
501 bn_correct_top(r);-
502 bn_check_top(r);-
503-
504 return ret;
executed 2968993 times by 2 tests: return ret;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
2968993
505}-
506-
507int bn_mul_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)-
508{-
509 int ret = 0;-
510 int top, al, bl;-
511 BIGNUM *rr;-
512#if defined(BN_MUL_COMBA) || defined(BN_RECURSION)-
513 int i;-
514#endif-
515#ifdef BN_RECURSION-
516 BIGNUM *t = NULL;-
517 int j = 0, k;-
518#endif-
519-
520 bn_check_top(a);-
521 bn_check_top(b);-
522 bn_check_top(r);-
523-
524 al = a->top;-
525 bl = b->top;-
526-
527 if ((al == 0) || (bl == 0)) {
(al == 0)Description
TRUEevaluated 45622 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 3214734 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
(bl == 0)Description
TRUEevaluated 57395 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 3157339 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
45622-3214734
528 BN_zero(r);-
529 return 1;
executed 103017 times by 1 test: return 1;
Executed by:
  • libcrypto.so.1.1
103017
530 }-
531 top = al + bl;-
532-
533 BN_CTX_start(ctx);-
534 if ((r == a) || (r == b)) {
(r == a)Description
TRUEevaluated 482 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 3156857 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
(r == b)Description
TRUEevaluated 196 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 3156661 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
196-3156857
535 if ((rr = BN_CTX_get(ctx)) == NULL)
(rr = BN_CTX_g...== ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 678 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-678
536 goto err;
never executed: goto err;
0
537 } else
executed 678 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
678
538 rr = r;
executed 3156661 times by 2 tests: rr = r;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
3156661
539-
540#if defined(BN_MUL_COMBA) || defined(BN_RECURSION)-
541 i = al - bl;-
542#endif-
543#ifdef BN_MUL_COMBA-
544 if (i == 0) {
i == 0Description
TRUEevaluated 842610 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 2314729 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
842610-2314729
545# if 0-
546 if (al == 4) {-
547 if (bn_wexpand(rr, 8) == NULL)-
548 goto err;-
549 rr->top = 8;-
550 bn_mul_comba4(rr->d, a->d, b->d);-
551 goto end;-
552 }-
553# endif-
554 if (al == 8) {
al == 8Description
TRUEevaluated 161685 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 680925 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
161685-680925
555 if (bn_wexpand(rr, 16) == NULL)
bn_wexpand(rr,...== ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 161685 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-161685
556 goto err;
never executed: goto err;
0
557 rr->top = 16;-
558 bn_mul_comba8(rr->d, a->d, b->d);-
559 goto end;
executed 161685 times by 1 test: goto end;
Executed by:
  • libcrypto.so.1.1
161685
560 }-
561 }
executed 680925 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
680925
562#endif /* BN_MUL_COMBA */-
563#ifdef BN_RECURSION-
564 if ((al >= BN_MULL_SIZE_NORMAL) && (bl >= BN_MULL_SIZE_NORMAL)) {
(al >= (16))Description
TRUEevaluated 55086 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 2940568 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
(bl >= (16))Description
TRUEevaluated 47811 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 7275 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
7275-2940568
565 if (i >= -1 && i <= 1) {
i >= -1Description
TRUEevaluated 47126 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 685 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
i <= 1Description
TRUEevaluated 43381 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 3745 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
685-47126
566 /*-
567 * Find out the power of two lower or equal to the longest of the-
568 * two numbers-
569 */-
570 if (i >= 0) {
i >= 0Description
TRUEevaluated 34581 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 8800 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
8800-34581
571 j = BN_num_bits_word((BN_ULONG)al);-
572 }
executed 34581 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
34581
573 if (i == -1) {
i == -1Description
TRUEevaluated 8800 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 34581 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
8800-34581
574 j = BN_num_bits_word((BN_ULONG)bl);-
575 }
executed 8800 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
8800
576 j = 1 << (j - 1);-
577 assert(j <= al || j <= bl);-
578 k = j + j;-
579 t = BN_CTX_get(ctx);-
580 if (t == NULL)
t == ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 43381 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-43381
581 goto err;
never executed: goto err;
0
582 if (al > j || bl > j) {
al > jDescription
TRUEevaluated 24246 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 19135 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
bl > jDescription
TRUEevaluated 3054 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 16081 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
3054-24246
583 if (bn_wexpand(t, k * 4) == NULL)
bn_wexpand(t, ...== ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 27300 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-27300
584 goto err;
never executed: goto err;
0
585 if (bn_wexpand(rr, k * 4) == NULL)
bn_wexpand(rr,...== ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 27300 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-27300
586 goto err;
never executed: goto err;
0
587 bn_mul_part_recursive(rr->d, a->d, b->d,-
588 j, al - j, bl - j, t->d);-
589 } else { /* al <= j || bl <= j */
executed 27300 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
27300
590-
591 if (bn_wexpand(t, k * 2) == NULL)
bn_wexpand(t, ...== ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 16081 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-16081
592 goto err;
never executed: goto err;
0
593 if (bn_wexpand(rr, k * 2) == NULL)
bn_wexpand(rr,...== ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 16081 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-16081
594 goto err;
never executed: goto err;
0
595 bn_mul_recursive(rr->d, a->d, b->d, j, al - j, bl - j, t->d);-
596 }
executed 16081 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
16081
597 rr->top = top;-
598 goto end;
executed 43381 times by 1 test: goto end;
Executed by:
  • libcrypto.so.1.1
43381
599 }-
600 }
executed 4430 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
4430
601#endif /* BN_RECURSION */-
602 if (bn_wexpand(rr, top) == NULL)
bn_wexpand(rr,...== ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 2952273 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
0-2952273
603 goto err;
never executed: goto err;
0
604 rr->top = top;-
605 bn_mul_normal(rr->d, a->d, al, b->d, bl);-
606-
607#if defined(BN_MUL_COMBA) || defined(BN_RECURSION)-
608 end:
code before this statement executed 2952273 times by 2 tests: end:
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
2952273
609#endif-
610 rr->neg = a->neg ^ b->neg;-
611 rr->flags |= BN_FLG_FIXED_TOP;-
612 if (r != rr && BN_copy(r, rr) == NULL)
r != rrDescription
TRUEevaluated 678 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 3156661 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
BN_copy(r, rr) == ((void *)0)Description
TRUEnever evaluated
FALSEevaluated 678 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
0-3156661
613 goto err;
never executed: goto err;
0
614-
615 ret = 1;-
616 err:
code before this statement executed 3157339 times by 2 tests: err:
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
3157339
617 bn_check_top(r);-
618 BN_CTX_end(ctx);-
619 return ret;
executed 3157339 times by 2 tests: return ret;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
3157339
620}-
621-
622void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)-
623{-
624 BN_ULONG *rr;-
625-
626 if (na < nb) {
na < nbDescription
TRUEevaluated 2235019 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 745125 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
745125-2235019
627 int itmp;-
628 BN_ULONG *ltmp;-
629-
630 itmp = na;-
631 na = nb;-
632 nb = itmp;-
633 ltmp = a;-
634 a = b;-
635 b = ltmp;-
636-
637 }
executed 2235019 times by 2 tests: end of block
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
2235019
638 rr = &(r[na]);-
639 if (nb <= 0) {
nb <= 0Description
TRUEevaluated 5119 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 2975025 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
5119-2975025
640 (void)bn_mul_words(r, a, na, 0);-
641 return;
executed 5119 times by 1 test: return;
Executed by:
  • libcrypto.so.1.1
5119
642 } else-
643 rr[0] = bn_mul_words(r, a, na, b[0]);
executed 2975025 times by 2 tests: rr[0] = bn_mul_words(r, a, na, b[0]);
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
2975025
644-
645 for (;;) {-
646 if (--nb <= 0)
--nb <= 0Description
TRUEevaluated 2657449 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 542715 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
542715-2657449
647 return;
executed 2657449 times by 2 tests: return;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
2657449
648 rr[1] = bn_mul_add_words(&(r[1]), a, na, b[1]);-
649 if (--nb <= 0)
--nb <= 0Description
TRUEevaluated 53479 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 489236 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
53479-489236
650 return;
executed 53479 times by 1 test: return;
Executed by:
  • libcrypto.so.1.1
53479
651 rr[2] = bn_mul_add_words(&(r[2]), a, na, b[2]);-
652 if (--nb <= 0)
--nb <= 0Description
TRUEevaluated 26815 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
FALSEevaluated 462421 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
26815-462421
653 return;
executed 26815 times by 1 test: return;
Executed by:
  • libcrypto.so.1.1
26815
654 rr[3] = bn_mul_add_words(&(r[3]), a, na, b[3]);-
655 if (--nb <= 0)
--nb <= 0Description
TRUEevaluated 237282 times by 2 tests
Evaluated by:
  • libcrypto.so.1.1
  • sm2_internal_test
FALSEevaluated 225139 times by 1 test
Evaluated by:
  • libcrypto.so.1.1
225139-237282
656 return;
executed 237282 times by 2 tests: return;
Executed by:
  • libcrypto.so.1.1
  • sm2_internal_test
237282
657 rr[4] = bn_mul_add_words(&(r[4]), a, na, b[4]);-
658 rr += 4;-
659 r += 4;-
660 b += 4;-
661 }
executed 225139 times by 1 test: end of block
Executed by:
  • libcrypto.so.1.1
225139
662}
never executed: end of block
0
663-
664void bn_mul_low_normal(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)-
665{-
666 bn_mul_words(r, a, n, b[0]);-
667-
668 for (;;) {-
669 if (--n <= 0)
--n <= 0Description
TRUEnever evaluated
FALSEnever evaluated
0
670 return;
never executed: return;
0
671 bn_mul_add_words(&(r[1]), a, n, b[1]);-
672 if (--n <= 0)
--n <= 0Description
TRUEnever evaluated
FALSEnever evaluated
0
673 return;
never executed: return;
0
674 bn_mul_add_words(&(r[2]), a, n, b[2]);-
675 if (--n <= 0)
--n <= 0Description
TRUEnever evaluated
FALSEnever evaluated
0
676 return;
never executed: return;
0
677 bn_mul_add_words(&(r[3]), a, n, b[3]);-
678 if (--n <= 0)
--n <= 0Description
TRUEnever evaluated
FALSEnever evaluated
0
679 return;
never executed: return;
0
680 bn_mul_add_words(&(r[4]), a, n, b[4]);-
681 r += 4;-
682 b += 4;-
683 }
never executed: end of block
0
684}
never executed: end of block
0
Source codeSwitch to Preprocessed file
Generated by Squish Coco 4.2.2