[thirdparty/openssl.git] / crypto / bn / bn_print.c

/* crypto/bn/bn_print.c */
/* 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 <stdio.h>
#include <ctype.h>
#include "cryptlib.h"
#include <openssl/buffer.h>
#include "bn_lcl.h"

const static char *Hex="0123456789ABCDEF";

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

	buf=(char *)Malloc(a->top*BN_BYTES*2+2);
	if (buf == NULL)
		{
		BNerr(BN_F_BN_BN2HEX,ERR_R_MALLOC_FAILURE);
		goto err;
		}
	p=buf;
	if (a->neg) *(p++)='-';
	if (a->top == 0) *(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(BIGNUM *a)
	{
	int i=0,num;
	char *buf=NULL;
	char *p;
	BIGNUM *t=NULL;
	BN_ULONG *bn_data=NULL,*lp;

	i=BN_num_bits(a)*3;
	num=(i/10+i/1000+3)+1;
	bn_data=(BN_ULONG *)Malloc((num/BN_DEC_NUM+1)*sizeof(BN_ULONG));
	buf=(char *)Malloc(num+3);
	if ((buf == NULL) || (bn_data == NULL))
		{
		BNerr(BN_F_BN_BN2DEC,ERR_R_MALLOC_FAILURE);
		goto err;
		}
	if ((t=BN_dup(a)) == NULL) goto err;

	p=buf;
	lp=bn_data;
	if (t->neg) *(p++)='-';
	if (t->top == 0)
		{
		*(p++)='0';
		*(p++)='\0';
		}
	else
		{
		i=0;
		while (!BN_is_zero(t))
			{
			*lp=BN_div_word(t,BN_DEC_CONV);
			lp++;
			}
		lp--;
		/* We now have a series of blocks, BN_DEC_NUM chars
		 * in length, where the last one needs trucation.
		 * The blocks need to be reversed in order. */
		sprintf(p,BN_DEC_FMT1,*lp);
		while (*p) p++;
		while (lp != bn_data)
			{
			lp--;
			sprintf(p,BN_DEC_FMT2,*lp);
			while (*p) p++;
			}
		}
err:
	if (bn_data != NULL) Free(bn_data);
	if (t != NULL) BN_free(t);
	return(buf);
	}

int BN_hex2bn(BIGNUM **bn, 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; isxdigit(a[i]); i++)
		;

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

	/* a is the start of the hex digets, 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 digests; */
	if (bn_expand(ret,i*4) == NULL) goto err;

	j=i; /* least significate '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_fix_top(ret);
	ret->neg=neg;

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

int BN_dec2bn(BIGNUM **bn, 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; isdigit(a[i]); i++)
		;

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

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

	/* i is the number of digests, 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_fix_top(ret);
	*bn=ret;
	return(num);
err:
	if (*bn == NULL) BN_free(ret);
	return(0);
	}

#ifndef NO_BIO

#ifndef NO_FP_API
int BN_print_fp(FILE *fp, 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);
	}
#endif

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

	if ((a->neg) && (BIO_write(bp,"-",1) != 1)) goto end;
	if ((a->top == 0) && (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
Commit	Line	Data
d02b48c6	1	/* crypto/bn/bn_print.c */
58964a49	2	/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
d02b48c6 RE	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 <stdio.h>
	60	#include <ctype.h>
	61	#include "cryptlib.h"
ec577822	62	#include <openssl/buffer.h>
d02b48c6 RE	63	#include "bn_lcl.h"
d02b48c6 RE	64
e778802f	65	const static char *Hex="0123456789ABCDEF";
d02b48c6 RE	66
d02b48c6 RE	67	/* Must 'Free' the returned data */
6b691a5c	68	char BN_bn2hex(BIGNUM a)
d02b48c6 RE	69	{
	70	int i,j,v,z=0;
	71	char *buf;
	72	char *p;
	73
	74	buf=(char )Malloc(a->topBN_BYTES*2+2);
	75	if (buf == NULL)
	76	{
58964a49	77	BNerr(BN_F_BN_BN2HEX,ERR_R_MALLOC_FAILURE);
d02b48c6 RE	78	goto err;
	79	}
	80	p=buf;
	81	if (a->neg) *(p++)='-';
	82	if (a->top == 0) *(p++)='0';
	83	for (i=a->top-1; i >=0; i--)
	84	{
	85	for (j=BN_BITS2-8; j >= 0; j-=8)
	86	{
	87	/* strip leading zeros */
	88	v=((int)(a->d[i]>>(long)j))&0xff;
	89	if (z \|\| (v != 0))
	90	{
	91	*(p++)=Hex[v>>4];
	92	*(p++)=Hex[v&0x0f];
	93	z=1;
	94	}
	95	}
	96	}
	97	*p='\0';
	98	err:
	99	return(buf);
	100	}
	101
58964a49	102	/* Must 'Free' the returned data */
6b691a5c	103	char BN_bn2dec(BIGNUM a)
58964a49 RE	104	{
	105	int i=0,num;
	106	char *buf=NULL;
	107	char *p;
	108	BIGNUM *t=NULL;
	109	BN_ULONG bn_data=NULL,lp;
	110
	111	i=BN_num_bits(a)*3;
	112	num=(i/10+i/1000+3)+1;
	113	bn_data=(BN_ULONG )Malloc((num/BN_DEC_NUM+1)sizeof(BN_ULONG));
	114	buf=(char *)Malloc(num+3);
	115	if ((buf == NULL) \|\| (bn_data == NULL))
	116	{
	117	BNerr(BN_F_BN_BN2DEC,ERR_R_MALLOC_FAILURE);
	118	goto err;
	119	}
	120	if ((t=BN_dup(a)) == NULL) goto err;
	121
	122	p=buf;
	123	lp=bn_data;
	124	if (t->neg) *(p++)='-';
	125	if (t->top == 0)
	126	{
	127	*(p++)='0';
	128	*(p++)='\0';
	129	}
	130	else
	131	{
	132	i=0;
	133	while (!BN_is_zero(t))
	134	{
	135	*lp=BN_div_word(t,BN_DEC_CONV);
	136	lp++;
	137	}
	138	lp--;
	139	/* We now have a series of blocks, BN_DEC_NUM chars
	140	* in length, where the last one needs trucation.
	141	* The blocks need to be reversed in order. */
	142	sprintf(p,BN_DEC_FMT1,*lp);
	143	while (*p) p++;
	144	while (lp != bn_data)
	145	{
	146	lp--;
	147	sprintf(p,BN_DEC_FMT2,*lp);
	148	while (*p) p++;
	149	}
	150	}
	151	err:
	152	if (bn_data != NULL) Free(bn_data);
	153	if (t != NULL) BN_free(t);
	154	return(buf);
	155	}
	156
6b691a5c	157	int BN_hex2bn(BIGNUM *bn, char a)
d02b48c6 RE	158	{
	159	BIGNUM *ret=NULL;
	160	BN_ULONG l=0;
	161	int neg=0,h,m,i,j,k,c;
	162	int num;
	163
	164	if ((a == NULL) \|\| (*a == '\0')) return(0);
	165
	166	if (*a == '-') { neg=1; a++; }
	167
	168	for (i=0; isxdigit(a[i]); i++)
	169	;
	170
	171	num=i+neg;
	172	if (bn == NULL) return(num);
	173
	174	/* a is the start of the hex digets, and it is 'i' long */
	175	if (*bn == NULL)
	176	{
	177	if ((ret=BN_new()) == NULL) return(0);
	178	}
	179	else
	180	{
	181	ret= *bn;
	182	BN_zero(ret);
	183	}
	184
	185	/* i is the number of hex digests; */
	186	if (bn_expand(ret,i*4) == NULL) goto err;
	187
	188	j=i; /* least significate 'hex' */
	189	m=0;
	190	h=0;
	191	while (j > 0)
	192	{
	193	m=((BN_BYTES2) <= j)?(BN_BYTES2):j;
	194	l=0;
	195	for (;;)
	196	{
	197	c=a[j-m];
	198	if ((c >= '0') && (c <= '9')) k=c-'0';
	199	else if ((c >= 'a') && (c <= 'f')) k=c-'a'+10;
	200	else if ((c >= 'A') && (c <= 'F')) k=c-'A'+10;
	201	else k=0; /* paranoia */
	202	l=(l<<4)\|k;
	203
	204	if (--m <= 0)
	205	{
	206	ret->d[h++]=l;
	207	break;
	208	}
	209	}
	210	j-=(BN_BYTES*2);
	211	}
	212	ret->top=h;
	213	bn_fix_top(ret);
	214	ret->neg=neg;
	215
	216	*bn=ret;
	217	return(num);
	218	err:
	219	if (*bn == NULL) BN_free(ret);
	220	return(0);
	221	}
222
6b691a5c	223	int BN_dec2bn(BIGNUM *bn, char a)
58964a49 RE	224	{
	225	BIGNUM *ret=NULL;
	226	BN_ULONG l=0;
	227	int neg=0,i,j;
	228	int num;
	229
	230	if ((a == NULL) \|\| (*a == '\0')) return(0);
	231	if (*a == '-') { neg=1; a++; }
	232
	233	for (i=0; isdigit(a[i]); i++)
	234	;
	235
	236	num=i+neg;
	237	if (bn == NULL) return(num);
	238
	239	/* a is the start of the digets, and it is 'i' long.
	240	* We chop it into BN_DEC_NUM digets at a time */
	241	if (*bn == NULL)
	242	{
	243	if ((ret=BN_new()) == NULL) return(0);
	244	}
	245	else
	246	{
	247	ret= *bn;
	248	BN_zero(ret);
	249	}
	250
	251	/* i is the number of digests, a bit of an over expand; */
	252	if (bn_expand(ret,i*4) == NULL) goto err;
	253
	254	j=BN_DEC_NUM-(i%BN_DEC_NUM);
	255	if (j == BN_DEC_NUM) j=0;
	256	l=0;
	257	while (*a)
	258	{
	259	l*=10;
	260	l+= *a-'0';
	261	a++;
	262	if (++j == BN_DEC_NUM)
	263	{
	264	BN_mul_word(ret,BN_DEC_CONV);
	265	BN_add_word(ret,l);
	266	l=0;
	267	j=0;
	268	}
	269	}
	270	ret->neg=neg;
	271
	272	bn_fix_top(ret);
	273	*bn=ret;
	274	return(num);
	275	err:
	276	if (*bn == NULL) BN_free(ret);
	277	return(0);
	278	}
	279
d02b48c6 RE	280	#ifndef NO_BIO
d02b48c6 RE	281
58964a49	282	#ifndef NO_FP_API
6b691a5c	283	int BN_print_fp(FILE fp, BIGNUM a)
d02b48c6 RE	284	{
	285	BIO *b;
	286	int ret;
	287
	288	if ((b=BIO_new(BIO_s_file())) == NULL)
	289	return(0);
	290	BIO_set_fp(b,fp,BIO_NOCLOSE);
	291	ret=BN_print(b,a);
	292	BIO_free(b);
	293	return(ret);
	294	}
	295	#endif
	296
6b691a5c	297	int BN_print(BIO bp, BIGNUM a)
d02b48c6 RE	298	{
	299	int i,j,v,z=0;
	300	int ret=0;
	301
	302	if ((a->neg) && (BIO_write(bp,"-",1) != 1)) goto end;
	303	if ((a->top == 0) && (BIO_write(bp,"0",1) != 1)) goto end;
	304	for (i=a->top-1; i >=0; i--)
	305	{
	306	for (j=BN_BITS2-4; j >= 0; j-=4)
	307	{
	308	/* strip leading zeros */
	309	v=((int)(a->d[i]>>(long)j))&0x0f;
	310	if (z \|\| (v != 0))
	311	{
	312	if (BIO_write(bp,&(Hex[v]),1) != 1)
	313	goto end;
	314	z=1;
	315	}
	316	}
	317	}
	318	ret=1;
	319	end:
	320	return(ret);
	321	}
	322
	323	#endif