Line | Source | Count |
1 | | - |
2 | | - |
3 | | - |
4 | | - |
5 | static const char Hex[]="0123456789ABCDEF"; | - |
6 | | - |
7 | | - |
8 | char * | - |
9 | BN_bn2hex(const BIGNUM *a) | - |
10 | { | - |
11 | int i, j, v, z = 0; | - |
12 | char *buf; | - |
13 | char *p; | - |
14 | | - |
15 | buf = malloc(((a)->neg != 0) + a->top * 8 * 2 + 2); | - |
16 | if (buf == TRUE | never evaluated | FALSE | never evaluated |
| 0 |
17 | ((void *)0)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
18 | ) { | - |
19 | ERR_put_error(3,(0xfff),((1|64)),__FILE__,83); | - |
20 | goto never executed: goto err; err;never executed: goto err; | 0 |
21 | } | - |
22 | p = buf; | - |
23 | if (((TRUE | never evaluated | FALSE | never evaluated |
a)->neg != 0)TRUE | never evaluated | FALSE | never evaluated |
) | 0 |
24 | * never executed: *p++ = '-'; p++ = '-';never executed: *p++ = '-'; | 0 |
25 | if (((TRUE | never evaluated | FALSE | never evaluated |
a)->top == 0)TRUE | never evaluated | FALSE | never evaluated |
) | 0 |
26 | * never executed: *p++ = '0'; p++ = '0';never executed: *p++ = '0'; | 0 |
27 | for (i = a->top - 1; i >=0TRUE | never evaluated | FALSE | never evaluated |
; i--) { | 0 |
28 | for (j = 64 - 8; j >= 0TRUE | never evaluated | FALSE | never evaluated |
; j -= 8) { | 0 |
29 | | - |
30 | v = ((int)(a->d[i] >> (long)j)) & 0xff; | - |
31 | if (zTRUE | never evaluated | FALSE | never evaluated |
|| (TRUE | never evaluated | FALSE | never evaluated |
v != 0)TRUE | never evaluated | FALSE | never evaluated |
) { | 0 |
32 | *p++ = Hex[v >> 4]; | - |
33 | *p++ = Hex[v & 0x0f]; | - |
34 | z = 1; | - |
35 | } never executed: end of block | 0 |
36 | } never executed: end of block | 0 |
37 | } never executed: end of block | 0 |
38 | *p = '\0'; | - |
39 | | - |
40 | err: code before this statement never executed: err: | 0 |
41 | return never executed: return (buf); (buf);never executed: return (buf); | 0 |
42 | } | - |
43 | | - |
44 | | - |
45 | char * | - |
46 | BN_bn2dec(const BIGNUM *a) | - |
47 | { | - |
48 | int i = 0, num, bn_data_num, ok = 0; | - |
49 | char *buf = | - |
50 | ((void *)0) | - |
51 | ; | - |
52 | char *p; | - |
53 | BIGNUM *t = | - |
54 | ((void *)0) | - |
55 | ; | - |
56 | unsigned long *bn_data = | - |
57 | ((void *)0) | - |
58 | , *lp; | - |
59 | | - |
60 | if (((TRUE | never evaluated | FALSE | never evaluated |
a)->top == 0)TRUE | never evaluated | FALSE | never evaluated |
) { | 0 |
61 | buf = malloc(((a)->neg != 0) + 2); | - |
62 | if (buf == TRUE | never evaluated | FALSE | never evaluated |
| 0 |
63 | ((void *)0)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
64 | ) { | - |
65 | ERR_put_error(3,(0xfff),((1|64)),__FILE__,121); | - |
66 | goto never executed: goto err; err;never executed: goto err; | 0 |
67 | } | - |
68 | p = buf; | - |
69 | if (((TRUE | never evaluated | FALSE | never evaluated |
a)->neg != 0)TRUE | never evaluated | FALSE | never evaluated |
) | 0 |
70 | * never executed: *p++ = '-'; p++ = '-';never executed: *p++ = '-'; | 0 |
71 | *p++ = '0'; | - |
72 | *p++ = '\0'; | - |
73 | return never executed: return (buf); (buf);never executed: return (buf); | 0 |
74 | } | - |
75 | | - |
76 | | - |
77 | | - |
78 | | - |
79 | | - |
80 | | - |
81 | i = BN_num_bits(a) * 3; | - |
82 | num = (i / 10 + i / 1000 + 1) + 1; | - |
83 | bn_data_num = num / 19 + 1; | - |
84 | bn_data = reallocarray( | - |
85 | ((void *)0) | - |
86 | , bn_data_num, sizeof(unsigned long)); | - |
87 | buf = malloc(num + 3); | - |
88 | if ((TRUE | never evaluated | FALSE | never evaluated |
buf == TRUE | never evaluated | FALSE | never evaluated |
| 0 |
89 | ((void *)0)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
90 | )TRUE | never evaluated | FALSE | never evaluated |
|| (TRUE | never evaluated | FALSE | never evaluated |
bn_data == TRUE | never evaluated | FALSE | never evaluated |
| 0 |
91 | ((void *)0)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
92 | )TRUE | never evaluated | FALSE | never evaluated |
) { | 0 |
93 | ERR_put_error(3,(0xfff),((1|64)),__FILE__,143); | - |
94 | goto never executed: goto err; err;never executed: goto err; | 0 |
95 | } | - |
96 | if ((TRUE | never evaluated | FALSE | never evaluated |
t = BN_dup(a)) == TRUE | never evaluated | FALSE | never evaluated |
| 0 |
97 | ((void *)0)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
98 | ) | - |
99 | goto never executed: goto err; err;never executed: goto err; | 0 |
100 | | - |
101 | | - |
102 | p = buf; | - |
103 | lp = bn_data; | - |
104 | if (((TRUE | never evaluated | FALSE | never evaluated |
t)->neg != 0)TRUE | never evaluated | FALSE | never evaluated |
) | 0 |
105 | * never executed: *p++ = '-'; p++ = '-';never executed: *p++ = '-'; | 0 |
106 | | - |
107 | while (!((t)->top == 0)TRUE | never evaluated | FALSE | never evaluated |
) { | 0 |
108 | if (lp - bn_data >= bn_data_numTRUE | never evaluated | FALSE | never evaluated |
) | 0 |
109 | goto never executed: goto err; err;never executed: goto err; | 0 |
110 | *lp = BN_div_word(t, (10000000000000000000UL)); | - |
111 | if (*TRUE | never evaluated | FALSE | never evaluated |
lp == (unsigned long)-1TRUE | never evaluated | FALSE | never evaluated |
) | 0 |
112 | goto never executed: goto err; err;never executed: goto err; | 0 |
113 | lp++; | - |
114 | } never executed: end of block | 0 |
115 | lp--; | - |
116 | | - |
117 | | - |
118 | | - |
119 | snprintf(p, (num+3 - (size_t)(p - buf)), "%lu", *lp); | - |
120 | while (*TRUE | never evaluated | FALSE | never evaluated |
pTRUE | never evaluated | FALSE | never evaluated |
) | 0 |
121 | p++; never executed: p++; | 0 |
122 | while (lp != bn_dataTRUE | never evaluated | FALSE | never evaluated |
) { | 0 |
123 | lp--; | - |
124 | snprintf(p, (num+3 - (size_t)(p - buf)), "%019lu", *lp); | - |
125 | while (*TRUE | never evaluated | FALSE | never evaluated |
pTRUE | never evaluated | FALSE | never evaluated |
) | 0 |
126 | p++; never executed: p++; | 0 |
127 | } never executed: end of block | 0 |
128 | ok = 1; | - |
129 | | - |
130 | err: code before this statement never executed: err: | 0 |
131 | free(bn_data); | - |
132 | BN_free(t); | - |
133 | if (!okTRUE | never evaluated | FALSE | never evaluated |
&& bufTRUE | never evaluated | FALSE | never evaluated |
) { | 0 |
134 | free(buf); | - |
135 | buf = | - |
136 | ((void *)0) | - |
137 | ; | - |
138 | } never executed: end of block | 0 |
139 | | - |
140 | return never executed: return (buf); (buf);never executed: return (buf); | 0 |
141 | } | - |
142 | | - |
143 | int | - |
144 | BN_hex2bn(BIGNUM **bn, const char *a) | - |
145 | { | - |
146 | BIGNUM *ret = | - |
147 | ((void *)0) | - |
148 | ; | - |
149 | unsigned long l = 0; | - |
150 | int neg = 0, h, m, i,j, k, c; | - |
151 | int num; | - |
152 | | - |
153 | if ((TRUE | never evaluated | FALSE | evaluated 180 times by 3 tests |
a == TRUE | never evaluated | FALSE | evaluated 180 times by 3 tests |
| 0-180 |
154 | ((void *)0)TRUE | never evaluated | FALSE | evaluated 180 times by 3 tests |
| 0-180 |
155 | )TRUE | never evaluated | FALSE | evaluated 180 times by 3 tests |
|| (*TRUE | never evaluated | FALSE | evaluated 180 times by 3 tests |
a == '\0')TRUE | never evaluated | FALSE | evaluated 180 times by 3 tests |
) | 0-180 |
156 | return never executed: return (0); (0);never executed: return (0); | 0 |
157 | | - |
158 | if (*TRUE | evaluated 2 times by 1 test | FALSE | evaluated 178 times by 3 tests |
a == '-'TRUE | evaluated 2 times by 1 test | FALSE | evaluated 178 times by 3 tests |
) { | 2-178 |
159 | neg = 1; | - |
160 | a++; | - |
161 | }executed 2 times by 1 test: end of block | 2 |
162 | | - |
163 | for (i = 0; i <= (0x7fffffff / 4)TRUE | evaluated 10762 times by 3 tests | FALSE | never evaluated |
&& | 0-10762 |
164 | ((*TRUE | evaluated 10582 times by 3 tests | FALSE | evaluated 180 times by 3 tests |
__ctype_b_loc ())[(int) ((TRUE | evaluated 10582 times by 3 tests | FALSE | evaluated 180 times by 3 tests |
| 180-10582 |
165 | (unsigned char)a[i]TRUE | evaluated 10582 times by 3 tests | FALSE | evaluated 180 times by 3 tests |
| 180-10582 |
166 | ))] & (unsigned short int) _ISxdigit)TRUE | evaluated 10582 times by 3 tests | FALSE | evaluated 180 times by 3 tests |
| 180-10582 |
167 | ; i++) | - |
168 | ;executed 10582 times by 3 tests: ; | 10582 |
169 | if (i > 0x7fffffff / 4TRUE | never evaluated | FALSE | evaluated 180 times by 3 tests |
) | 0-180 |
170 | goto never executed: goto err; err;never executed: goto err; | 0 |
171 | | - |
172 | num = i + neg; | - |
173 | if (bn == TRUE | never evaluated | FALSE | evaluated 180 times by 3 tests |
| 0-180 |
174 | ((void *)0)TRUE | never evaluated | FALSE | evaluated 180 times by 3 tests |
| 0-180 |
175 | ) | - |
176 | return never executed: return (num); (num);never executed: return (num); | 0 |
177 | | - |
178 | | - |
179 | if (*TRUE | never evaluated | FALSE | evaluated 180 times by 3 tests |
bn == TRUE | never evaluated | FALSE | evaluated 180 times by 3 tests |
| 0-180 |
180 | ((void *)0)TRUE | never evaluated | FALSE | evaluated 180 times by 3 tests |
| 0-180 |
181 | ) { | - |
182 | if ((TRUE | never evaluated | FALSE | never evaluated |
ret = BN_new()) == TRUE | never evaluated | FALSE | never evaluated |
| 0 |
183 | ((void *)0)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
184 | ) | - |
185 | return never executed: return (0); (0);never executed: return (0); | 0 |
186 | } never executed: end of block else { | 0 |
187 | ret= *bn; | - |
188 | (BN_set_word((ret),0)); | - |
189 | }executed 180 times by 3 tests: end of block | 180 |
190 | | - |
191 | | - |
192 | if (bn_expand(ret, i * 4) == TRUE | never evaluated | FALSE | evaluated 180 times by 3 tests |
| 0-180 |
193 | ((void *)0)TRUE | never evaluated | FALSE | evaluated 180 times by 3 tests |
| 0-180 |
194 | ) | - |
195 | goto never executed: goto err; err;never executed: goto err; | 0 |
196 | | - |
197 | j = i; | - |
198 | m = 0; | - |
199 | h = 0; | - |
200 | while (j > 0TRUE | evaluated 753 times by 3 tests | FALSE | evaluated 180 times by 3 tests |
) { | 180-753 |
201 | m = ((TRUE | evaluated 620 times by 3 tests | FALSE | evaluated 133 times by 2 tests |
8*2) <= j)TRUE | evaluated 620 times by 3 tests | FALSE | evaluated 133 times by 2 tests |
? (8 * 2) : j; | 133-620 |
202 | l = 0; | - |
203 | for (;;) { | - |
204 | c = a[j - m]; | - |
205 | if ((TRUE | evaluated 10582 times by 3 tests | FALSE | never evaluated |
c >= '0')TRUE | evaluated 10582 times by 3 tests | FALSE | never evaluated |
&& (TRUE | evaluated 6408 times by 3 tests | FALSE | evaluated 4174 times by 3 tests |
c <= '9')TRUE | evaluated 6408 times by 3 tests | FALSE | evaluated 4174 times by 3 tests |
) | 0-10582 |
206 | k = c - '0';executed 6408 times by 3 tests: k = c - '0'; | 6408 |
207 | else if ((TRUE | evaluated 18 times by 1 test | FALSE | evaluated 4156 times by 3 tests |
c >= 'a')TRUE | evaluated 18 times by 1 test | FALSE | evaluated 4156 times by 3 tests |
&& (TRUE | evaluated 18 times by 1 test | FALSE | never evaluated |
c <= 'f')TRUE | evaluated 18 times by 1 test | FALSE | never evaluated |
) | 0-4156 |
208 | k = c - 'a' + 10;executed 18 times by 1 test: k = c - 'a' + 10; | 18 |
209 | else if ((TRUE | evaluated 4156 times by 3 tests | FALSE | never evaluated |
c >= 'A')TRUE | evaluated 4156 times by 3 tests | FALSE | never evaluated |
&& (TRUE | evaluated 4156 times by 3 tests | FALSE | never evaluated |
c <= 'F')TRUE | evaluated 4156 times by 3 tests | FALSE | never evaluated |
) | 0-4156 |
210 | k = c - 'A' + 10;executed 4156 times by 3 tests: k = c - 'A' + 10; | 4156 |
211 | else | - |
212 | k = 0; never executed: k = 0; | 0 |
213 | l = (l << 4) | k; | - |
214 | | - |
215 | if (--TRUE | evaluated 753 times by 3 tests | FALSE | evaluated 9829 times by 3 tests |
m <= 0TRUE | evaluated 753 times by 3 tests | FALSE | evaluated 9829 times by 3 tests |
) { | 753-9829 |
216 | ret->d[h++] = l; | - |
217 | break;executed 753 times by 3 tests: break; | 753 |
218 | } | - |
219 | }executed 9829 times by 3 tests: end of block | 9829 |
220 | j -= (8 * 2); | - |
221 | }executed 753 times by 3 tests: end of block | 753 |
222 | ret->top = h; | - |
223 | { unsigned long *ftl; int tmp_top = (ret)->top; if (tmp_top > 0TRUE | evaluated 180 times by 3 tests | FALSE | never evaluated |
) { for (ftl= &((ret)->d[tmp_top-1]); tmp_top > 0TRUE | evaluated 201 times by 3 tests | FALSE | evaluated 6 times by 2 tests |
; tmp_top--) if (*(TRUE | evaluated 174 times by 3 tests | FALSE | evaluated 27 times by 2 tests |
ftl--)TRUE | evaluated 174 times by 3 tests | FALSE | evaluated 27 times by 2 tests |
) break;executed 174 times by 3 tests: break; (ret)->top = tmp_top; }executed 180 times by 3 tests: end of block ; }; | 0-201 |
224 | ret->neg = neg; | - |
225 | | - |
226 | *bn = ret; | - |
227 | ; | - |
228 | returnexecuted 180 times by 3 tests: return (num); (num);executed 180 times by 3 tests: return (num); | 180 |
229 | | - |
230 | err: | - |
231 | if (*TRUE | never evaluated | FALSE | never evaluated |
bn == TRUE | never evaluated | FALSE | never evaluated |
| 0 |
232 | ((void *)0)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
233 | ) | - |
234 | BN_free(ret); never executed: BN_free(ret); | 0 |
235 | return never executed: return (0); (0);never executed: return (0); | 0 |
236 | } | - |
237 | | - |
238 | int | - |
239 | BN_dec2bn(BIGNUM **bn, const char *a) | - |
240 | { | - |
241 | BIGNUM *ret = | - |
242 | ((void *)0) | - |
243 | ; | - |
244 | unsigned long l = 0; | - |
245 | int neg = 0, i, j; | - |
246 | int num; | - |
247 | | - |
248 | if ((TRUE | never evaluated | FALSE | never evaluated |
a == TRUE | never evaluated | FALSE | never evaluated |
| 0 |
249 | ((void *)0)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
250 | )TRUE | never evaluated | FALSE | never evaluated |
|| (*TRUE | never evaluated | FALSE | never evaluated |
a == '\0')TRUE | never evaluated | FALSE | never evaluated |
) | 0 |
251 | return never executed: return (0); (0);never executed: return (0); | 0 |
252 | if (*TRUE | never evaluated | FALSE | never evaluated |
a == '-'TRUE | never evaluated | FALSE | never evaluated |
) { | 0 |
253 | neg = 1; | - |
254 | a++; | - |
255 | } never executed: end of block | 0 |
256 | | - |
257 | for (i = 0; i <= (0x7fffffff / 4)TRUE | never evaluated | FALSE | never evaluated |
&& | 0 |
258 | ((*TRUE | never evaluated | FALSE | never evaluated |
__ctype_b_loc ())[(int) ((TRUE | never evaluated | FALSE | never evaluated |
| 0 |
259 | (unsigned char)a[i]TRUE | never evaluated | FALSE | never evaluated |
| 0 |
260 | ))] & (unsigned short int) _ISdigit)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
261 | ; i++) | - |
262 | ; never executed: ; | 0 |
263 | if (i > 0x7fffffff / 4TRUE | never evaluated | FALSE | never evaluated |
) | 0 |
264 | goto never executed: goto err; err;never executed: goto err; | 0 |
265 | | - |
266 | num = i + neg; | - |
267 | if (bn == TRUE | never evaluated | FALSE | never evaluated |
| 0 |
268 | ((void *)0)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
269 | ) | - |
270 | return never executed: return (num); (num);never executed: return (num); | 0 |
271 | | - |
272 | | - |
273 | | - |
274 | if (*TRUE | never evaluated | FALSE | never evaluated |
bn == TRUE | never evaluated | FALSE | never evaluated |
| 0 |
275 | ((void *)0)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
276 | ) { | - |
277 | if ((TRUE | never evaluated | FALSE | never evaluated |
ret = BN_new()) == TRUE | never evaluated | FALSE | never evaluated |
| 0 |
278 | ((void *)0)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
279 | ) | - |
280 | return never executed: return (0); (0);never executed: return (0); | 0 |
281 | } never executed: end of block else { | 0 |
282 | ret = *bn; | - |
283 | (BN_set_word((ret),0)); | - |
284 | } never executed: end of block | 0 |
285 | | - |
286 | | - |
287 | if (bn_expand(ret, i * 4) == TRUE | never evaluated | FALSE | never evaluated |
| 0 |
288 | ((void *)0)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
289 | ) | - |
290 | goto never executed: goto err; err;never executed: goto err; | 0 |
291 | | - |
292 | j = 19 - (i % 19); | - |
293 | if (j == 19TRUE | never evaluated | FALSE | never evaluated |
) | 0 |
294 | j = 0; never executed: j = 0; | 0 |
295 | l = 0; | - |
296 | while (*TRUE | never evaluated | FALSE | never evaluated |
aTRUE | never evaluated | FALSE | never evaluated |
) { | 0 |
297 | l *= 10; | - |
298 | l += *a - '0'; | - |
299 | a++; | - |
300 | if (++TRUE | never evaluated | FALSE | never evaluated |
j == 19TRUE | never evaluated | FALSE | never evaluated |
) { | 0 |
301 | BN_mul_word(ret, (10000000000000000000UL)); | - |
302 | BN_add_word(ret, l); | - |
303 | l = 0; | - |
304 | j = 0; | - |
305 | } never executed: end of block | 0 |
306 | } never executed: end of block | 0 |
307 | ret->neg = neg; | - |
308 | | - |
309 | { unsigned long *ftl; int tmp_top = (ret)->top; if (tmp_top > 0TRUE | never evaluated | FALSE | never evaluated |
) { for (ftl= &((ret)->d[tmp_top-1]); tmp_top > 0TRUE | never evaluated | FALSE | never evaluated |
; tmp_top--) if (*(TRUE | never evaluated | FALSE | never evaluated |
ftl--)TRUE | never evaluated | FALSE | never evaluated |
) break;never executed: break; (ret)->top = tmp_top; }never executed: end of block ; }; | 0 |
310 | *bn = ret; | - |
311 | ; | - |
312 | return never executed: return (num); (num);never executed: return (num); | 0 |
313 | | - |
314 | err: | - |
315 | if (*TRUE | never evaluated | FALSE | never evaluated |
bn == TRUE | never evaluated | FALSE | never evaluated |
| 0 |
316 | ((void *)0)TRUE | never evaluated | FALSE | never evaluated |
| 0 |
317 | ) | - |
318 | BN_free(ret); never executed: BN_free(ret); | 0 |
319 | return never executed: return (0); (0);never executed: return (0); | 0 |
320 | } | - |
321 | | - |
322 | int | - |
323 | BN_asc2bn(BIGNUM **bn, const char *a) | - |
324 | { | - |
325 | const char *p = a; | - |
326 | if (*TRUE | never evaluated | FALSE | never evaluated |
p == '-'TRUE | never evaluated | FALSE | never evaluated |
) | 0 |
327 | p++; never executed: p++; | 0 |
328 | | - |
329 | if (p[0] == '0'TRUE | never evaluated | FALSE | never evaluated |
&& (p[1] == 'X'TRUE | never evaluated | FALSE | never evaluated |
|| p[1] == 'x'TRUE | never evaluated | FALSE | never evaluated |
)) { | 0 |
330 | if (!BN_hex2bn(bn, p + 2)TRUE | never evaluated | FALSE | never evaluated |
) | 0 |
331 | return never executed: return 0; 0;never executed: return 0; | 0 |
332 | } never executed: end of block else { | 0 |
333 | if (!BN_dec2bn(bn, p)TRUE | never evaluated | FALSE | never evaluated |
) | 0 |
334 | return never executed: return 0; 0;never executed: return 0; | 0 |
335 | } never executed: end of block | 0 |
336 | if (*TRUE | never evaluated | FALSE | never evaluated |
a == '-'TRUE | never evaluated | FALSE | never evaluated |
) | 0 |
337 | (* never executed: (*bn)->neg = 1; bn)->neg = 1;never executed: (*bn)->neg = 1; | 0 |
338 | return never executed: return 1; 1;never executed: return 1; | 0 |
339 | } | - |
340 | | - |
341 | | - |
342 | int | - |
343 | BN_print_fp(FILE *fp, const BIGNUM *a) | - |
344 | { | - |
345 | BIO *b; | - |
346 | int ret; | - |
347 | | - |
348 | if ((TRUE | never evaluated | FALSE | evaluated 67 times by 1 test |
b = BIO_new(BIO_s_file())) == TRUE | never evaluated | FALSE | evaluated 67 times by 1 test |
| 0-67 |
349 | ((void *)0)TRUE | never evaluated | FALSE | evaluated 67 times by 1 test |
| 0-67 |
350 | ) | - |
351 | return never executed: return (0); (0);never executed: return (0); | 0 |
352 | BIO_ctrl(b,106,0x00,(char *)fp); | - |
353 | ret = BN_print(b, a); | - |
354 | BIO_free(b); | - |
355 | returnexecuted 67 times by 1 test: return (ret); (ret);executed 67 times by 1 test: return (ret); | 67 |
356 | } | - |
357 | | - |
358 | int | - |
359 | BN_print(BIO *bp, const BIGNUM *a) | - |
360 | { | - |
361 | int i, j, v, z = 0; | - |
362 | int ret = 0; | - |
363 | | - |
364 | if ((TRUE | evaluated 2198 times by 1 test | FALSE | evaluated 4544 times by 3 tests |
a->neg)TRUE | evaluated 2198 times by 1 test | FALSE | evaluated 4544 times by 3 tests |
&& (TRUE | never evaluated | FALSE | evaluated 2198 times by 1 test |
BIO_write(bp, "-", 1) != 1)TRUE | never evaluated | FALSE | evaluated 2198 times by 1 test |
) | 0-4544 |
365 | goto never executed: goto end; end;never executed: goto end; | 0 |
366 | if (((TRUE | evaluated 4 times by 2 tests | FALSE | evaluated 6738 times by 3 tests |
a)->top == 0)TRUE | evaluated 4 times by 2 tests | FALSE | evaluated 6738 times by 3 tests |
&& (TRUE | never evaluated | FALSE | evaluated 4 times by 2 tests |
BIO_write(bp, "0", 1) != 1)TRUE | never evaluated | FALSE | evaluated 4 times by 2 tests |
) | 0-6738 |
367 | goto never executed: goto end; end;never executed: goto end; | 0 |
368 | for (i = a->top - 1; i >= 0TRUE | evaluated 52280 times by 3 tests | FALSE | evaluated 6742 times by 3 tests |
; i--) { | 6742-52280 |
369 | for (j = 64 - 4; j >= 0TRUE | evaluated 836480 times by 3 tests | FALSE | evaluated 52280 times by 3 tests |
; j -= 4) { | 52280-836480 |
370 | | - |
371 | v = ((int)(a->d[i] >> (long)j)) & 0x0f; | - |
372 | if (zTRUE | evaluated 782808 times by 3 tests | FALSE | evaluated 53672 times by 3 tests |
|| (TRUE | evaluated 6738 times by 3 tests | FALSE | evaluated 46934 times by 3 tests |
v != 0)TRUE | evaluated 6738 times by 3 tests | FALSE | evaluated 46934 times by 3 tests |
) { | 6738-782808 |
373 | if (BIO_write(bp, &(Hex[v]), 1) != 1TRUE | never evaluated | FALSE | evaluated 789546 times by 3 tests |
) | 0-789546 |
374 | goto never executed: goto end; end;never executed: goto end; | 0 |
375 | z = 1; | - |
376 | }executed 789546 times by 3 tests: end of block | 789546 |
377 | }executed 836480 times by 3 tests: end of block | 836480 |
378 | }executed 52280 times by 3 tests: end of block | 52280 |
379 | ret = 1; | - |
380 | | - |
381 | end:code before this statement executed 6742 times by 3 tests: end: | 6742 |
382 | returnexecuted 6742 times by 3 tests: return (ret); (ret);executed 6742 times by 3 tests: return (ret); | 6742 |
383 | } | - |
384 | | - |
385 | | - |
386 | char * | - |
387 | BN_options(void) | - |
388 | { | - |
389 | static int init = 0; | - |
390 | static char data[16]; | - |
391 | | - |
392 | if (!initTRUE | never evaluated | FALSE | never evaluated |
) { | 0 |
393 | init++; | - |
394 | | - |
395 | | - |
396 | | - |
397 | | - |
398 | snprintf(data,sizeof data, "bn(%d,%d)", | - |
399 | (int)sizeof(unsigned long) * 8, (int)sizeof(unsigned long) * 8); | - |
400 | | - |
401 | } never executed: end of block | 0 |
402 | return never executed: return (data); (data);never executed: return (data); | 0 |
403 | } | - |
| | |