/src/openssl/crypto/bn/bn_print.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* crypto/bn/bn_print.c */ |
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 <stdio.h> |
60 | | #include <ctype.h> |
61 | | #include <limits.h> |
62 | | #include "cryptlib.h" |
63 | | #include <openssl/buffer.h> |
64 | | #include "bn_lcl.h" |
65 | | |
66 | | static const char Hex[] = "0123456789ABCDEF"; |
67 | | |
68 | | /* Must 'OPENSSL_free' the returned data */ |
69 | | char *BN_bn2hex(const BIGNUM *a) |
70 | 0 | { |
71 | 0 | int i, j, v, z = 0; |
72 | 0 | char *buf; |
73 | 0 | char *p; |
74 | |
|
75 | 0 | if (BN_is_zero(a)) |
76 | 0 | return OPENSSL_strdup("0"); |
77 | 0 | buf = OPENSSL_malloc(a->top * BN_BYTES * 2 + 2); |
78 | 0 | if (buf == NULL) { |
79 | 0 | BNerr(BN_F_BN_BN2HEX, ERR_R_MALLOC_FAILURE); |
80 | 0 | goto err; |
81 | 0 | } |
82 | 0 | p = buf; |
83 | 0 | if (a->neg) |
84 | 0 | *(p++) = '-'; |
85 | 0 | for (i = a->top - 1; i >= 0; i--) { |
86 | 0 | for (j = BN_BITS2 - 8; j >= 0; j -= 8) { |
87 | | /* strip leading zeros */ |
88 | 0 | v = ((int)(a->d[i] >> (long)j)) & 0xff; |
89 | 0 | if (z || (v != 0)) { |
90 | 0 | *(p++) = Hex[v >> 4]; |
91 | 0 | *(p++) = Hex[v & 0x0f]; |
92 | 0 | z = 1; |
93 | 0 | } |
94 | 0 | } |
95 | 0 | } |
96 | 0 | *p = '\0'; |
97 | 0 | err: |
98 | 0 | return (buf); |
99 | 0 | } |
100 | | |
101 | | /* Must 'OPENSSL_free' the returned data */ |
102 | | char *BN_bn2dec(const BIGNUM *a) |
103 | 0 | { |
104 | 0 | int i = 0, num, ok = 0; |
105 | 0 | char *buf = NULL; |
106 | 0 | char *p; |
107 | 0 | BIGNUM *t = NULL; |
108 | 0 | BN_ULONG *bn_data = NULL, *lp; |
109 | 0 | int bn_data_num; |
110 | | |
111 | | /*- |
112 | | * get an upper bound for the length of the decimal integer |
113 | | * num <= (BN_num_bits(a) + 1) * log(2) |
114 | | * <= 3 * BN_num_bits(a) * 0.1001 + log(2) + 1 (rounding error) |
115 | | * <= BN_num_bits(a)/10 + BN_num_bits/1000 + 1 + 1 |
116 | | */ |
117 | 0 | i = BN_num_bits(a) * 3; |
118 | 0 | num = (i / 10 + i / 1000 + 1) + 1; |
119 | 0 | bn_data_num = num / BN_DEC_NUM + 1; |
120 | 0 | bn_data = OPENSSL_malloc(bn_data_num * sizeof(BN_ULONG)); |
121 | 0 | buf = OPENSSL_malloc(num + 3); |
122 | 0 | if ((buf == NULL) || (bn_data == NULL)) { |
123 | 0 | BNerr(BN_F_BN_BN2DEC, ERR_R_MALLOC_FAILURE); |
124 | 0 | goto err; |
125 | 0 | } |
126 | 0 | if ((t = BN_dup(a)) == NULL) |
127 | 0 | goto err; |
128 | | |
129 | 0 | #define BUF_REMAIN (num+3 - (size_t)(p - buf)) |
130 | 0 | p = buf; |
131 | 0 | lp = bn_data; |
132 | 0 | if (BN_is_zero(t)) { |
133 | 0 | *(p++) = '0'; |
134 | 0 | *(p++) = '\0'; |
135 | 0 | } else { |
136 | 0 | if (BN_is_negative(t)) |
137 | 0 | *p++ = '-'; |
138 | |
|
139 | 0 | while (!BN_is_zero(t)) { |
140 | 0 | if (lp - bn_data >= bn_data_num) |
141 | 0 | goto err; |
142 | 0 | *lp = BN_div_word(t, BN_DEC_CONV); |
143 | 0 | if (*lp == (BN_ULONG)-1) |
144 | 0 | goto err; |
145 | 0 | lp++; |
146 | 0 | } |
147 | 0 | lp--; |
148 | | /* |
149 | | * We now have a series of blocks, BN_DEC_NUM chars in length, where |
150 | | * the last one needs truncation. The blocks need to be reversed in |
151 | | * order. |
152 | | */ |
153 | 0 | BIO_snprintf(p, BUF_REMAIN, BN_DEC_FMT1, *lp); |
154 | 0 | while (*p) |
155 | 0 | p++; |
156 | 0 | while (lp != bn_data) { |
157 | 0 | lp--; |
158 | 0 | BIO_snprintf(p, BUF_REMAIN, BN_DEC_FMT2, *lp); |
159 | 0 | while (*p) |
160 | 0 | p++; |
161 | 0 | } |
162 | 0 | } |
163 | 0 | ok = 1; |
164 | 0 | err: |
165 | 0 | if (bn_data != NULL) |
166 | 0 | OPENSSL_free(bn_data); |
167 | 0 | if (t != NULL) |
168 | 0 | BN_free(t); |
169 | 0 | if (!ok && buf) { |
170 | 0 | OPENSSL_free(buf); |
171 | 0 | buf = NULL; |
172 | 0 | } |
173 | |
|
174 | 0 | return (buf); |
175 | 0 | } |
176 | | |
177 | | int BN_hex2bn(BIGNUM **bn, const char *a) |
178 | 0 | { |
179 | 0 | BIGNUM *ret = NULL; |
180 | 0 | BN_ULONG l = 0; |
181 | 0 | int neg = 0, h, m, i, j, k, c; |
182 | 0 | int num; |
183 | |
|
184 | 0 | if ((a == NULL) || (*a == '\0')) |
185 | 0 | return (0); |
186 | | |
187 | 0 | if (*a == '-') { |
188 | 0 | neg = 1; |
189 | 0 | a++; |
190 | 0 | } |
191 | |
|
192 | 0 | for (i = 0; i <= (INT_MAX/4) && isxdigit((unsigned char)a[i]); i++) |
193 | 0 | continue; |
194 | |
|
195 | 0 | if (i > INT_MAX/4) |
196 | 0 | goto err; |
197 | | |
198 | 0 | num = i + neg; |
199 | 0 | if (bn == NULL) |
200 | 0 | return (num); |
201 | | |
202 | | /* a is the start of the hex digits, and it is 'i' long */ |
203 | 0 | if (*bn == NULL) { |
204 | 0 | if ((ret = BN_new()) == NULL) |
205 | 0 | return (0); |
206 | 0 | } else { |
207 | 0 | ret = *bn; |
208 | 0 | BN_zero(ret); |
209 | 0 | } |
210 | | |
211 | | /* i is the number of hex digits */ |
212 | 0 | if (bn_expand(ret, i * 4) == NULL) |
213 | 0 | goto err; |
214 | | |
215 | 0 | j = i; /* least significant 'hex' */ |
216 | 0 | m = 0; |
217 | 0 | h = 0; |
218 | 0 | while (j > 0) { |
219 | 0 | m = ((BN_BYTES * 2) <= j) ? (BN_BYTES * 2) : j; |
220 | 0 | l = 0; |
221 | 0 | for (;;) { |
222 | 0 | c = a[j - m]; |
223 | 0 | if ((c >= '0') && (c <= '9')) |
224 | 0 | k = c - '0'; |
225 | 0 | else if ((c >= 'a') && (c <= 'f')) |
226 | 0 | k = c - 'a' + 10; |
227 | 0 | else if ((c >= 'A') && (c <= 'F')) |
228 | 0 | k = c - 'A' + 10; |
229 | 0 | else |
230 | 0 | k = 0; /* paranoia */ |
231 | 0 | l = (l << 4) | k; |
232 | |
|
233 | 0 | if (--m <= 0) { |
234 | 0 | ret->d[h++] = l; |
235 | 0 | break; |
236 | 0 | } |
237 | 0 | } |
238 | 0 | j -= (BN_BYTES * 2); |
239 | 0 | } |
240 | 0 | ret->top = h; |
241 | 0 | bn_correct_top(ret); |
242 | |
|
243 | 0 | *bn = ret; |
244 | 0 | bn_check_top(ret); |
245 | | /* Don't set the negative flag if it's zero. */ |
246 | 0 | if (ret->top != 0) |
247 | 0 | ret->neg = neg; |
248 | 0 | return (num); |
249 | 0 | err: |
250 | 0 | if (*bn == NULL) |
251 | 0 | BN_free(ret); |
252 | 0 | return (0); |
253 | 0 | } |
254 | | |
255 | | int BN_dec2bn(BIGNUM **bn, const char *a) |
256 | 0 | { |
257 | 0 | BIGNUM *ret = NULL; |
258 | 0 | BN_ULONG l = 0; |
259 | 0 | int neg = 0, i, j; |
260 | 0 | int num; |
261 | |
|
262 | 0 | if ((a == NULL) || (*a == '\0')) |
263 | 0 | return (0); |
264 | 0 | if (*a == '-') { |
265 | 0 | neg = 1; |
266 | 0 | a++; |
267 | 0 | } |
268 | |
|
269 | 0 | for (i = 0; i <= (INT_MAX/4) && isdigit((unsigned char)a[i]); i++) |
270 | 0 | continue; |
271 | |
|
272 | 0 | if (i > INT_MAX/4) |
273 | 0 | goto err; |
274 | | |
275 | 0 | num = i + neg; |
276 | 0 | if (bn == NULL) |
277 | 0 | return (num); |
278 | | |
279 | | /* |
280 | | * a is the start of the digits, and it is 'i' long. We chop it into |
281 | | * BN_DEC_NUM digits at a time |
282 | | */ |
283 | 0 | if (*bn == NULL) { |
284 | 0 | if ((ret = BN_new()) == NULL) |
285 | 0 | return (0); |
286 | 0 | } else { |
287 | 0 | ret = *bn; |
288 | 0 | BN_zero(ret); |
289 | 0 | } |
290 | | |
291 | | /* i is the number of digits, a bit of an over expand */ |
292 | 0 | if (bn_expand(ret, i * 4) == NULL) |
293 | 0 | goto err; |
294 | | |
295 | 0 | j = BN_DEC_NUM - (i % BN_DEC_NUM); |
296 | 0 | if (j == BN_DEC_NUM) |
297 | 0 | j = 0; |
298 | 0 | l = 0; |
299 | 0 | while (--i >= 0) { |
300 | 0 | l *= 10; |
301 | 0 | l += *a - '0'; |
302 | 0 | a++; |
303 | 0 | if (++j == BN_DEC_NUM) { |
304 | 0 | BN_mul_word(ret, BN_DEC_CONV); |
305 | 0 | BN_add_word(ret, l); |
306 | 0 | l = 0; |
307 | 0 | j = 0; |
308 | 0 | } |
309 | 0 | } |
310 | |
|
311 | 0 | bn_correct_top(ret); |
312 | 0 | *bn = ret; |
313 | 0 | bn_check_top(ret); |
314 | | /* Don't set the negative flag if it's zero. */ |
315 | 0 | if (ret->top != 0) |
316 | 0 | ret->neg = neg; |
317 | 0 | return (num); |
318 | 0 | err: |
319 | 0 | if (*bn == NULL) |
320 | 0 | BN_free(ret); |
321 | 0 | return (0); |
322 | 0 | } |
323 | | |
324 | | int BN_asc2bn(BIGNUM **bn, const char *a) |
325 | 0 | { |
326 | 0 | const char *p = a; |
327 | |
|
328 | 0 | if (*p == '-') |
329 | 0 | p++; |
330 | |
|
331 | 0 | if (p[0] == '0' && (p[1] == 'X' || p[1] == 'x')) { |
332 | 0 | if (!BN_hex2bn(bn, p + 2)) |
333 | 0 | return 0; |
334 | 0 | } else { |
335 | 0 | if (!BN_dec2bn(bn, p)) |
336 | 0 | return 0; |
337 | 0 | } |
338 | | /* Don't set the negative flag if it's zero. */ |
339 | 0 | if (*a == '-' && (*bn)->top != 0) |
340 | 0 | (*bn)->neg = 1; |
341 | 0 | return 1; |
342 | 0 | } |
343 | | |
344 | | #ifndef OPENSSL_NO_BIO |
345 | | # ifndef OPENSSL_NO_FP_API |
346 | | int BN_print_fp(FILE *fp, const BIGNUM *a) |
347 | 0 | { |
348 | 0 | BIO *b; |
349 | 0 | int ret; |
350 | |
|
351 | 0 | if ((b = BIO_new(BIO_s_file())) == NULL) |
352 | 0 | return (0); |
353 | 0 | BIO_set_fp(b, fp, BIO_NOCLOSE); |
354 | 0 | ret = BN_print(b, a); |
355 | 0 | BIO_free(b); |
356 | 0 | return (ret); |
357 | 0 | } |
358 | | # endif |
359 | | |
360 | | int BN_print(BIO *bp, const BIGNUM *a) |
361 | 0 | { |
362 | 0 | int i, j, v, z = 0; |
363 | 0 | int ret = 0; |
364 | |
|
365 | 0 | if ((a->neg) && (BIO_write(bp, "-", 1) != 1)) |
366 | 0 | goto end; |
367 | 0 | if (BN_is_zero(a) && (BIO_write(bp, "0", 1) != 1)) |
368 | 0 | goto end; |
369 | 0 | for (i = a->top - 1; i >= 0; i--) { |
370 | 0 | for (j = BN_BITS2 - 4; j >= 0; j -= 4) { |
371 | | /* strip leading zeros */ |
372 | 0 | v = ((int)(a->d[i] >> (long)j)) & 0x0f; |
373 | 0 | if (z || (v != 0)) { |
374 | 0 | if (BIO_write(bp, &(Hex[v]), 1) != 1) |
375 | 0 | goto end; |
376 | 0 | z = 1; |
377 | 0 | } |
378 | 0 | } |
379 | 0 | } |
380 | 0 | ret = 1; |
381 | 0 | end: |
382 | 0 | return (ret); |
383 | 0 | } |
384 | | #endif |
385 | | |
386 | | char *BN_options(void) |
387 | 0 | { |
388 | 0 | static int init = 0; |
389 | 0 | static char data[16]; |
390 | |
|
391 | 0 | if (!init) { |
392 | 0 | init++; |
393 | | #ifdef BN_LLONG |
394 | | BIO_snprintf(data, sizeof data, "bn(%d,%d)", |
395 | | (int)sizeof(BN_ULLONG) * 8, (int)sizeof(BN_ULONG) * 8); |
396 | | #else |
397 | 0 | BIO_snprintf(data, sizeof data, "bn(%d,%d)", |
398 | 0 | (int)sizeof(BN_ULONG) * 8, (int)sizeof(BN_ULONG) * 8); |
399 | 0 | #endif |
400 | 0 | } |
401 | 0 | return (data); |
402 | 0 | } |