Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	lib/libcrypto/bn/bn_print.c	Lines:	119	161	73.9 %
Date:	2017-11-07	Branches:	83	142	58.5 %


/* $OpenBSD: bn_print.c,v 1.31 2017/01/29 17:49:22 beck Exp $ */
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
 * All rights reserved.
 *
 * This package is an SSL implementation written
 * by Eric Young (eay@cryptsoft.com).
 * The implementation was written so as to conform with Netscapes SSL.
 *
 * This library is free for commercial and non-commercial use as long as
 * the following conditions are aheared to.  The following conditions
 * apply to all code found in this distribution, be it the RC4, RSA,
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
 * included with this distribution is covered by the same copyright terms
 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
 *
 * Copyright remains Eric Young's, and as such any Copyright notices in
 * the code are not to be removed.
 * If this package is used in a product, Eric Young should be given attribution
 * as the author of the parts of the library used.
 * This can be in the form of a textual message at program startup or
 * in documentation (online or textual) provided with the package.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *    "This product includes cryptographic software written by
 *     Eric Young (eay@cryptsoft.com)"
 *    The word 'cryptographic' can be left out if the rouines from the library
 *    being used are not cryptographic related :-).
 * 4. If you include any Windows specific code (or a derivative thereof) from
 *    the apps directory (application code) you must include an acknowledgement:
 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
 *
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 * The licence and distribution terms for any publically available version or
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
 * copied and put under another distribution licence
 * [including the GNU Public Licence.]
 */

#include <ctype.h>
#include <limits.h>
#include <stdio.h>

#include <openssl/opensslconf.h>

#include <openssl/bio.h>
#include <openssl/buffer.h>
#include <openssl/err.h>

#include "bn_lcl.h"

static const char Hex[]="0123456789ABCDEF";

/* Must 'free' the returned data */
char *
BN_bn2hex(const BIGNUM *a)
{
	int i, j, v, z = 0;
	char *buf;
	char *p;

	buf = malloc(BN_is_negative(a) + a->top * BN_BYTES * 2 + 2);
	if (buf == NULL) {
		BNerror(ERR_R_MALLOC_FAILURE);
		goto err;
	}
	p = buf;
	if (BN_is_negative(a))
		*p++ = '-';
	if (BN_is_zero(a))
		*p++ = '0';
	for (i = a->top - 1; i >=0; i--) {
		for (j = BN_BITS2 - 8; j >= 0; j -= 8) {
			/* strip leading zeros */
			v = ((int)(a->d[i] >> (long)j)) & 0xff;
			if (z || (v != 0)) {
				*p++ = Hex[v >> 4];
				*p++ = Hex[v & 0x0f];
				z = 1;
			}
		}
	}
	*p = '\0';

err:
	return (buf);
}

/* Must 'free' the returned data */
char *
BN_bn2dec(const BIGNUM *a)
{
	int i = 0, num, bn_data_num, ok = 0;
	char *buf = NULL;
	char *p;
	BIGNUM *t = NULL;
	BN_ULONG *bn_data = NULL, *lp;

	if (BN_is_zero(a)) {
		buf = malloc(BN_is_negative(a) + 2);
		if (buf == NULL) {
			BNerror(ERR_R_MALLOC_FAILURE);
			goto err;
		}
		p = buf;
		if (BN_is_negative(a))
			*p++ = '-';
		*p++ = '0';
		*p++ = '\0';
		return (buf);
	}

	/* get an upper bound for the length of the decimal integer
	 * num <= (BN_num_bits(a) + 1) * log(2)
	 *     <= 3 * BN_num_bits(a) * 0.1001 + log(2) + 1     (rounding error)
	 *     <= BN_num_bits(a)/10 + BN_num_bits/1000 + 1 + 1
	 */
	i = BN_num_bits(a) * 3;
	num = (i / 10 + i / 1000 + 1) + 1;
	bn_data_num = num / BN_DEC_NUM + 1;
	bn_data = reallocarray(NULL, bn_data_num, sizeof(BN_ULONG));
	buf = malloc(num + 3);
	if ((buf == NULL) || (bn_data == NULL)) {
		BNerror(ERR_R_MALLOC_FAILURE);
		goto err;
	}
	if ((t = BN_dup(a)) == NULL)
		goto err;

#define BUF_REMAIN (num+3 - (size_t)(p - buf))
	p = buf;
	lp = bn_data;
	if (BN_is_negative(t))
		*p++ = '-';

	while (!BN_is_zero(t)) {
		if (lp - bn_data >= bn_data_num)
			goto err;
		*lp = BN_div_word(t, BN_DEC_CONV);
		if (*lp == (BN_ULONG)-1)
			goto err;
		lp++;
	}
	lp--;
	/* We now have a series of blocks, BN_DEC_NUM chars
	 * in length, where the last one needs truncation.
	 * The blocks need to be reversed in order. */
	snprintf(p, BUF_REMAIN, BN_DEC_FMT1, *lp);
	while (*p)
		p++;
	while (lp != bn_data) {
		lp--;
		snprintf(p, BUF_REMAIN, BN_DEC_FMT2, *lp);
		while (*p)
			p++;
	}
	ok = 1;

err:
	free(bn_data);
	BN_free(t);
	if (!ok && buf) {
		free(buf);
		buf = NULL;
	}

	return (buf);
}

int
BN_hex2bn(BIGNUM **bn, const char *a)
{
	BIGNUM *ret = NULL;
	BN_ULONG l = 0;
	int neg = 0, h, m, i,j, k, c;
	int num;

	if ((a == NULL) || (*a == '\0'))
		return (0);

	if (*a == '-') {
		neg = 1;
		a++;
	}

	for (i = 0; i <= (INT_MAX / 4) && isxdigit((unsigned char)a[i]); i++)
		;
	if (i > INT_MAX / 4)
		goto err;

	num = i + neg;
	if (bn == NULL)
		return (num);

	/* a is the start of the hex digits, and it is 'i' long */
	if (*bn == NULL) {
		if ((ret = BN_new()) == NULL)
			return (0);
	} else {
		ret= *bn;
		BN_zero(ret);
	}

	/* i is the number of hex digits */
	if (bn_expand(ret, i * 4) == NULL)
		goto err;

	j = i; /* least significant 'hex' */
	m = 0;
	h = 0;
	while (j > 0) {
		m = ((BN_BYTES*2) <= j) ? (BN_BYTES * 2) : j;
		l = 0;
		for (;;) {
			c = a[j - m];
			if ((c >= '0') && (c <= '9'))
				k = c - '0';
			else if ((c >= 'a') && (c <= 'f'))
				k = c - 'a' + 10;
			else if ((c >= 'A') && (c <= 'F'))
				k = c - 'A' + 10;
			else
				k = 0; /* paranoia */
			l = (l << 4) | k;

			if (--m <= 0) {
				ret->d[h++] = l;
				break;
			}
		}
		j -= (BN_BYTES * 2);
	}
	ret->top = h;
	bn_correct_top(ret);
	ret->neg = neg;

	*bn = ret;
	bn_check_top(ret);
	return (num);

err:
	if (*bn == NULL)
		BN_free(ret);
	return (0);
}

int
BN_dec2bn(BIGNUM **bn, const char *a)
{
	BIGNUM *ret = NULL;
	BN_ULONG l = 0;
	int neg = 0, i, j;
	int num;

	if ((a == NULL) || (*a == '\0'))
		return (0);
	if (*a == '-') {
		neg = 1;
		a++;
	}

	for (i = 0; i <= (INT_MAX / 4) && isdigit((unsigned char)a[i]); i++)
		;
	if (i > INT_MAX / 4)
		goto err;

	num = i + neg;
	if (bn == NULL)
		return (num);

	/* a is the start of the digits, and it is 'i' long.
	 * We chop it into BN_DEC_NUM digits at a time */
	if (*bn == NULL) {
		if ((ret = BN_new()) == NULL)
			return (0);
	} else {
		ret = *bn;
		BN_zero(ret);
	}

	/* i is the number of digits, a bit of an over expand */
	if (bn_expand(ret, i * 4) == NULL)
		goto err;

	j = BN_DEC_NUM - (i % BN_DEC_NUM);
	if (j == BN_DEC_NUM)
		j = 0;
	l = 0;
	while (*a) {
		l *= 10;
		l += *a - '0';
		a++;
		if (++j == BN_DEC_NUM) {
			BN_mul_word(ret, BN_DEC_CONV);
			BN_add_word(ret, l);
			l = 0;
			j = 0;
		}
	}
	ret->neg = neg;

	bn_correct_top(ret);
	*bn = ret;
	bn_check_top(ret);
	return (num);

err:
	if (*bn == NULL)
		BN_free(ret);
	return (0);
}

int
BN_asc2bn(BIGNUM **bn, const char *a)
{
	const char *p = a;
	if (*p == '-')
		p++;

	if (p[0] == '0' && (p[1] == 'X' || p[1] == 'x')) {
		if (!BN_hex2bn(bn, p + 2))
			return 0;
	} else {
		if (!BN_dec2bn(bn, p))
			return 0;
	}
	if (*a == '-')
		(*bn)->neg = 1;
	return 1;
}

#ifndef OPENSSL_NO_BIO
int
BN_print_fp(FILE *fp, const BIGNUM *a)
{
	BIO *b;
	int ret;

	if ((b = BIO_new(BIO_s_file())) == NULL)
		return (0);
	BIO_set_fp(b, fp, BIO_NOCLOSE);
	ret = BN_print(b, a);
	BIO_free(b);
	return (ret);
}

int
BN_print(BIO *bp, const BIGNUM *a)
{
	int i, j, v, z = 0;
	int ret = 0;

	if ((a->neg) && (BIO_write(bp, "-", 1) != 1))
		goto end;
	if (BN_is_zero(a) && (BIO_write(bp, "0", 1) != 1))
		goto end;
	for (i = a->top - 1; i >= 0; i--) {
		for (j = BN_BITS2 - 4; j >= 0; j -= 4) {
			/* strip leading zeros */
			v = ((int)(a->d[i] >> (long)j)) & 0x0f;
			if (z || (v != 0)) {
				if (BIO_write(bp, &(Hex[v]), 1) != 1)
					goto end;
				z = 1;
			}
		}
	}
	ret = 1;

end:
	return (ret);
}
#endif

char *
BN_options(void)
{
	static int init = 0;
	static char data[16];

	if (!init) {
		init++;
#ifdef BN_LLONG
		snprintf(data,sizeof data, "bn(%d,%d)",
		    (int)sizeof(BN_ULLONG) * 8, (int)sizeof(BN_ULONG) * 8);
#else
		snprintf(data,sizeof data, "bn(%d,%d)",
		    (int)sizeof(BN_ULONG) * 8, (int)sizeof(BN_ULONG) * 8);
#endif
	}
	return (data);
}


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: bn_print.c,v 1.31 2017/01/29 17:49:22 beck Exp $ */
2			/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3			* All rights reserved.
4			*
5			* This package is an SSL implementation written
6			* by Eric Young (eay@cryptsoft.com).
7			* The implementation was written so as to conform with Netscapes SSL.
8			*
9			* This library is free for commercial and non-commercial use as long as
10			* the following conditions are aheared to. The following conditions
11			* apply to all code found in this distribution, be it the RC4, RSA,
12			* lhash, DES, etc., code; not just the SSL code. The SSL documentation
13			* included with this distribution is covered by the same copyright terms
14			* except that the holder is Tim Hudson (tjh@cryptsoft.com).
15			*
16			* Copyright remains Eric Young's, and as such any Copyright notices in
17			* the code are not to be removed.
18			* If this package is used in a product, Eric Young should be given attribution
19			* as the author of the parts of the library used.
20			* This can be in the form of a textual message at program startup or
21			* in documentation (online or textual) provided with the package.
22			*
23			* Redistribution and use in source and binary forms, with or without
24			* modification, are permitted provided that the following conditions
25			* are met:
26			* 1. Redistributions of source code must retain the copyright
27			* notice, this list of conditions and the following disclaimer.
28			* 2. Redistributions in binary form must reproduce the above copyright
29			* notice, this list of conditions and the following disclaimer in the
30			* documentation and/or other materials provided with the distribution.
31			* 3. All advertising materials mentioning features or use of this software
32			* must display the following acknowledgement:
33			* "This product includes cryptographic software written by
34			* Eric Young (eay@cryptsoft.com)"
35			* The word 'cryptographic' can be left out if the rouines from the library
36			* being used are not cryptographic related :-).
37			* 4. If you include any Windows specific code (or a derivative thereof) from
38			* the apps directory (application code) you must include an acknowledgement:
39			* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40			*
41			* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42			* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43			* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44			* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45			* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46			* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47			* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48			* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49			* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50			* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
51			* SUCH DAMAGE.
52			*
53			* The licence and distribution terms for any publically available version or
54			* derivative of this code cannot be changed. i.e. this code cannot simply be
55			* copied and put under another distribution licence
56			* [including the GNU Public Licence.]
57			*/
58
59			#include <ctype.h>
60			#include <limits.h>
61			#include <stdio.h>
62
63			#include <openssl/opensslconf.h>
64
65			#include <openssl/bio.h>
66			#include <openssl/buffer.h>
67			#include <openssl/err.h>
68
69			#include "bn_lcl.h"
70
71			static const char Hex[]="0123456789ABCDEF";
72
73			/* Must 'free' the returned data */
74			char *
75			BN_bn2hex(const BIGNUM *a)
76			{
77			int i, j, v, z = 0;
78			char *buf;
79			char *p;
80
81		48	buf = malloc(BN_is_negative(a) + a->top * BN_BYTES * 2 + 2);
82	✗✓	24	if (buf == NULL) {
83			BNerror(ERR_R_MALLOC_FAILURE);
84			goto err;
85			}
86			p = buf;
87	✗✓	24	if (BN_is_negative(a))
88			*p++ = '-';
89	✗✓	24	if (BN_is_zero(a))
90			*p++ = '0';
91	✓✓	96	for (i = a->top - 1; i >=0; i--) {
92	✓✓	432	for (j = BN_BITS2 - 8; j >= 0; j -= 8) {
93			/* strip leading zeros */
94		192	v = ((int)(a->d[i] >> (long)j)) & 0xff;
95	✓✓	192	if (z \|\| (v != 0)) {
96		94	*p++ = Hex[v >> 4];
97		94	*p++ = Hex[v & 0x0f];
98			z = 1;
99		94	}
100			}
101			}
102		24	*p = '\0';
103
104			err:
105		24	return (buf);
106			}
107
108			/* Must 'free' the returned data */
109			char *
110			BN_bn2dec(const BIGNUM *a)
111			{
112			int i = 0, num, bn_data_num, ok = 0;
113			char *buf = NULL;
114			char *p;
115			BIGNUM *t = NULL;
116			BN_ULONG bn_data = NULL, lp;
117
118	✗✓	4	if (BN_is_zero(a)) {
119			buf = malloc(BN_is_negative(a) + 2);
120			if (buf == NULL) {
121			BNerror(ERR_R_MALLOC_FAILURE);
122			goto err;
123			}
124			p = buf;
125			if (BN_is_negative(a))
126			*p++ = '-';
127			*p++ = '0';
128			*p++ = '\0';
129			return (buf);
130			}
131
132			/* get an upper bound for the length of the decimal integer
133			* num <= (BN_num_bits(a) + 1) * log(2)
134			* <= 3 * BN_num_bits(a) * 0.1001 + log(2) + 1 (rounding error)
135			* <= BN_num_bits(a)/10 + BN_num_bits/1000 + 1 + 1
136			*/
137		2	i = BN_num_bits(a) * 3;
138		2	num = (i / 10 + i / 1000 + 1) + 1;
139		2	bn_data_num = num / BN_DEC_NUM + 1;
140		2	bn_data = reallocarray(NULL, bn_data_num, sizeof(BN_ULONG));
141		2	buf = malloc(num + 3);
142	✗✓	2	if ((buf == NULL) \|\| (bn_data == NULL)) {
143			BNerror(ERR_R_MALLOC_FAILURE);
144			goto err;
145			}
146	✓✗	2	if ((t = BN_dup(a)) == NULL)
147			goto err;
148
149			#define BUF_REMAIN (num+3 - (size_t)(p - buf))
150			p = buf;
151			lp = bn_data;
152	✗✓	2	if (BN_is_negative(t))
153			*p++ = '-';
154
155	✓✓	6	while (!BN_is_zero(t)) {
156	✓✗	2	if (lp - bn_data >= bn_data_num)
157			goto err;
158		2	*lp = BN_div_word(t, BN_DEC_CONV);
159	✓✗	2	if (*lp == (BN_ULONG)-1)
160			goto err;
161		2	lp++;
162			}
163		2	lp--;
164			/* We now have a series of blocks, BN_DEC_NUM chars
165			* in length, where the last one needs truncation.
166			* The blocks need to be reversed in order. */
167		2	snprintf(p, BUF_REMAIN, BN_DEC_FMT1, *lp);
168	✓✓	8	while (*p)
169		2	p++;
170	✗✓	2	while (lp != bn_data) {
171			lp--;
172			snprintf(p, BUF_REMAIN, BN_DEC_FMT2, *lp);
173			while (*p)
174			p++;
175			}
176		2	ok = 1;
177
178			err:
179		2	free(bn_data);
180		2	BN_free(t);
181	✗✓	2	if (!ok && buf) {
182			free(buf);
183			buf = NULL;
184			}
185
186		2	return (buf);
187		2	}
188
189			int
190			BN_hex2bn(BIGNUM *bn, const char a)
191			{
192			BIGNUM *ret = NULL;
193			BN_ULONG l = 0;
194			int neg = 0, h, m, i,j, k, c;
195			int num;
196
197	✓✗✗✓	2694	if ((a == NULL) \|\| (*a == '\0'))
198			return (0);
199
200	✗✓	898	if (*a == '-') {
201			neg = 1;
202			a++;
203			}
204
205	✓✗✓✓	381228	for (i = 0; i <= (INT_MAX / 4) && isxdigit((unsigned char)a[i]); i++)
206			;
207	✓✗	898	if (i > INT_MAX / 4)
208			goto err;
209
210		898	num = i + neg;
211	✗✓	898	if (bn == NULL)
212			return (num);
213
214			/* a is the start of the hex digits, and it is 'i' long */
215	✓✓	898	if (*bn == NULL) {
216	✗✓	160	if ((ret = BN_new()) == NULL)
217			return (0);
218			} else {
219			ret= *bn;
220		738	BN_zero(ret);
221			}
222
223			/* i is the number of hex digits */
224	✓✗	898	if (bn_expand(ret, i * 4) == NULL)
225			goto err;
226
227			j = i; /* least significant 'hex' */
228			m = 0;
229			h = 0;
230	✓✓	18372	while (j > 0) {
231		8288	m = ((BN_BYTES2) <= j) ? (BN_BYTES 2) : j;
232			l = 0;
233		8288	for (;;) {
234		126178	c = a[j - m];
235	✓✓	126178	if ((c >= '0') && (c <= '9'))
236		76244	k = c - '0';
237	✓✓	49934	else if ((c >= 'a') && (c <= 'f'))
238		108	k = c - 'a' + 10;
239	✓✗	49826	else if ((c >= 'A') && (c <= 'F'))
240		49826	k = c - 'A' + 10;
241			else
242			k = 0; /* paranoia */
243		126178	l = (l << 4) \| k;
244
245	✓✓	126178	if (--m <= 0) {
246		8288	ret->d[h++] = l;
247			break;
248			}
249			}
250		8288	j -= (BN_BYTES * 2);
251			}
252		898	ret->top = h;
253	✓✗✓✓ ✓✓	4916	bn_correct_top(ret);
254		898	ret->neg = neg;
255
256		898	*bn = ret;
257			bn_check_top(ret);
258		898	return (num);
259
260			err:
261			if (*bn == NULL)
262			BN_free(ret);
263			return (0);
264		898	}
265
266			int
267			BN_dec2bn(BIGNUM *bn, const char a)
268			{
269			BIGNUM *ret = NULL;
270			BN_ULONG l = 0;
271			int neg = 0, i, j;
272			int num;
273
274	✓✗✗✓	18	if ((a == NULL) \|\| (*a == '\0'))
275			return (0);
276	✗✓	6	if (*a == '-') {
277			neg = 1;
278			a++;
279			}
280
281	✓✗✓✓	36	for (i = 0; i <= (INT_MAX / 4) && isdigit((unsigned char)a[i]); i++)
282			;
283	✓✗	6	if (i > INT_MAX / 4)
284			goto err;
285
286		6	num = i + neg;
287	✗✓	6	if (bn == NULL)
288			return (num);
289
290			/* a is the start of the digits, and it is 'i' long.
291			* We chop it into BN_DEC_NUM digits at a time */
292	✓✗	6	if (*bn == NULL) {
293	✗✓	6	if ((ret = BN_new()) == NULL)
294			return (0);
295			} else {
296			ret = *bn;
297			BN_zero(ret);
298			}
299
300			/* i is the number of digits, a bit of an over expand */
301	✓✗	6	if (bn_expand(ret, i * 4) == NULL)
302			goto err;
303
304		6	j = BN_DEC_NUM - (i % BN_DEC_NUM);
305		6	if (j == BN_DEC_NUM)
306			j = 0;
307			l = 0;
308	✓✓	18	while (*a) {
309		6	l *= 10;
310		6	l += *a - '0';
311		6	a++;
312	✗✓	6	if (++j == BN_DEC_NUM) {
313		6	BN_mul_word(ret, BN_DEC_CONV);
314		6	BN_add_word(ret, l);
315			l = 0;
316			j = 0;
317		6	}
318			}
319		6	ret->neg = neg;
320
321	✓✗✓✗ ✗✓	30	bn_correct_top(ret);
322		6	*bn = ret;
323			bn_check_top(ret);
324		6	return (num);
325
326			err:
327			if (*bn == NULL)
328			BN_free(ret);
329			return (0);
330		6	}
331
332			int
333			BN_asc2bn(BIGNUM *bn, const char a)
334			{
335			const char *p = a;
336	✗✓	4	if (*p == '-')
337			p++;
338
339	✗✓✗✗ ✗✗	2	if (p[0] == '0' && (p[1] == 'X' \|\| p[1] == 'x')) {
340			if (!BN_hex2bn(bn, p + 2))
341			return 0;
342			} else {
343	✗✓	2	if (!BN_dec2bn(bn, p))
344			return 0;
345			}
346	✗✓	2	if (*a == '-')
347			(*bn)->neg = 1;
348		2	return 1;
349		2	}
350
351			#ifndef OPENSSL_NO_BIO
352			int
353			BN_print_fp(FILE fp, const BIGNUM a)
354			{
355			BIO *b;
356			int ret;
357
358	✗✓	804	if ((b = BIO_new(BIO_s_file())) == NULL)
359			return (0);
360		402	BIO_set_fp(b, fp, BIO_NOCLOSE);
361		402	ret = BN_print(b, a);
362		402	BIO_free(b);
363		402	return (ret);
364		402	}
365
366			int
367			BN_print(BIO bp, const BIGNUM a)
368			{
369			int i, j, v, z = 0;
370			int ret = 0;
371
372	✓✓✓✗	94119	if ((a->neg) && (BIO_write(bp, "-", 1) != 1))
373			goto end;
374	✓✓✓✗	40473	if (BN_is_zero(a) && (BIO_write(bp, "0", 1) != 1))
375			goto end;
376	✓✓	708360	for (i = a->top - 1; i >= 0; i--) {
377	✓✓	10666684	for (j = BN_BITS2 - 4; j >= 0; j -= 4) {
378			/* strip leading zeros */
379		5019616	v = ((int)(a->d[i] >> (long)j)) & 0x0f;
380	✓✓	5019616	if (z \|\| (v != 0)) {
381	✓✗	4737339	if (BIO_write(bp, &(Hex[v]), 1) != 1)
382			goto end;
383			z = 1;
384		4737339	}
385			}
386			}
387		40454	ret = 1;
388
389			end:
390		40454	return (ret);
391			}
392			#endif
393
394			char *
395			BN_options(void)
396			{
397			static int init = 0;
398			static char data[16];
399
400	✓✗	8	if (!init) {
401		4	init++;
402			#ifdef BN_LLONG
403			snprintf(data,sizeof data, "bn(%d,%d)",
404			(int)sizeof(BN_ULLONG) * 8, (int)sizeof(BN_ULONG) * 8);
405			#else
406		4	snprintf(data,sizeof data, "bn(%d,%d)",
407			(int)sizeof(BN_ULONG) * 8, (int)sizeof(BN_ULONG) * 8);
408			#endif
409		4	}
410		4	return (data);
411			}