1 /* crypto/bn/bn_print.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
65 static char *Hex="0123456789ABCDEF";
67 /* Must 'Free' the returned data */
75 buf=(char *)Malloc(a->top*BN_BYTES*2+2);
78 BNerr(BN_F_BN_BN2HEX,ERR_R_MALLOC_FAILURE);
82 if (a->neg) *(p++)='-';
83 if (a->top == 0) *(p++)='0';
84 for (i=a->top-1; i >=0; i--)
86 for (j=BN_BITS2-8; j >= 0; j-=8)
88 /* strip leading zeros */
89 v=((int)(a->d[i]>>(long)j))&0xff;
103 /* Must 'Free' the returned data */
111 BN_ULONG *bn_data=NULL,*lp;
114 num=(i/10+i/1000+3)+1;
115 bn_data=(BN_ULONG *)Malloc((num/BN_DEC_NUM+1)*sizeof(BN_ULONG));
116 buf=(char *)Malloc(num+3);
117 if ((buf == NULL) || (bn_data == NULL))
119 BNerr(BN_F_BN_BN2DEC,ERR_R_MALLOC_FAILURE);
122 if ((t=BN_dup(a)) == NULL) goto err;
126 if (t->neg) *(p++)='-';
135 while (!BN_is_zero(t))
137 *lp=BN_div_word(t,BN_DEC_CONV);
141 /* We now have a series of blocks, BN_DEC_NUM chars
142 * in length, where the last one needs trucation.
143 * The blocks need to be reversed in order. */
144 sprintf(p,BN_DEC_FMT1,*lp);
146 while (lp != bn_data)
149 sprintf(p,BN_DEC_FMT2,*lp);
154 if (bn_data != NULL) Free(bn_data);
155 if (t != NULL) BN_free(t);
165 int neg=0,h,m,i,j,k,c;
168 if ((a == NULL) || (*a == '\0')) return(0);
170 if (*a == '-') { neg=1; a++; }
172 for (i=0; isxdigit(a[i]); i++)
176 if (bn == NULL) return(num);
178 /* a is the start of the hex digets, and it is 'i' long */
181 if ((ret=BN_new()) == NULL) return(0);
189 /* i is the number of hex digests; */
190 if (bn_expand(ret,i*4) == NULL) goto err;
192 j=i; /* least significate 'hex' */
197 m=((BN_BYTES*2) <= j)?(BN_BYTES*2):j;
202 if ((c >= '0') && (c <= '9')) k=c-'0';
203 else if ((c >= 'a') && (c <= 'f')) k=c-'a'+10;
204 else if ((c >= 'A') && (c <= 'F')) k=c-'A'+10;
205 else k=0; /* paranoia */
223 if (*bn == NULL) BN_free(ret);
236 if ((a == NULL) || (*a == '\0')) return(0);
237 if (*a == '-') { neg=1; a++; }
239 for (i=0; isdigit(a[i]); i++)
243 if (bn == NULL) return(num);
245 /* a is the start of the digets, and it is 'i' long.
246 * We chop it into BN_DEC_NUM digets at a time */
249 if ((ret=BN_new()) == NULL) return(0);
257 /* i is the number of digests, a bit of an over expand; */
258 if (bn_expand(ret,i*4) == NULL) goto err;
260 j=BN_DEC_NUM-(i%BN_DEC_NUM);
261 if (j == BN_DEC_NUM) j=0;
268 if (++j == BN_DEC_NUM)
270 BN_mul_word(ret,BN_DEC_CONV);
282 if (*bn == NULL) BN_free(ret);
289 int BN_print_fp(fp, a)
296 if ((b=BIO_new(BIO_s_file())) == NULL)
298 BIO_set_fp(b,fp,BIO_NOCLOSE);
312 if ((a->neg) && (BIO_write(bp,"-",1) != 1)) goto end;
313 if ((a->top == 0) && (BIO_write(bp,"0",1) != 1)) goto end;
314 for (i=a->top-1; i >=0; i--)
316 for (j=BN_BITS2-4; j >= 0; j-=4)
318 /* strip leading zeros */
319 v=((int)(a->d[i]>>(long)j))&0x0f;
322 if (BIO_write(bp,&(Hex[v]),1) != 1)