/src/openssl/crypto/asn1/f_string.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* crypto/asn1/f_string.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 "cryptlib.h" |
61 | | #include <openssl/buffer.h> |
62 | | #include <openssl/asn1.h> |
63 | | |
64 | | int i2a_ASN1_STRING(BIO *bp, ASN1_STRING *a, int type) |
65 | 0 | { |
66 | 0 | int i, n = 0; |
67 | 0 | static const char *h = "0123456789ABCDEF"; |
68 | 0 | char buf[2]; |
69 | |
|
70 | 0 | if (a == NULL) |
71 | 0 | return (0); |
72 | | |
73 | 0 | if (a->length == 0) { |
74 | 0 | if (BIO_write(bp, "0", 1) != 1) |
75 | 0 | goto err; |
76 | 0 | n = 1; |
77 | 0 | } else { |
78 | 0 | for (i = 0; i < a->length; i++) { |
79 | 0 | if ((i != 0) && (i % 35 == 0)) { |
80 | 0 | if (BIO_write(bp, "\\\n", 2) != 2) |
81 | 0 | goto err; |
82 | 0 | n += 2; |
83 | 0 | } |
84 | 0 | buf[0] = h[((unsigned char)a->data[i] >> 4) & 0x0f]; |
85 | 0 | buf[1] = h[((unsigned char)a->data[i]) & 0x0f]; |
86 | 0 | if (BIO_write(bp, buf, 2) != 2) |
87 | 0 | goto err; |
88 | 0 | n += 2; |
89 | 0 | } |
90 | 0 | } |
91 | 0 | return (n); |
92 | 0 | err: |
93 | 0 | return (-1); |
94 | 0 | } |
95 | | |
96 | | int a2i_ASN1_STRING(BIO *bp, ASN1_STRING *bs, char *buf, int size) |
97 | 0 | { |
98 | 0 | int ret = 0; |
99 | 0 | int i, j, k, m, n, again, bufsize; |
100 | 0 | unsigned char *s = NULL, *sp; |
101 | 0 | unsigned char *bufp; |
102 | 0 | int num = 0, slen = 0, first = 1; |
103 | |
|
104 | 0 | bufsize = BIO_gets(bp, buf, size); |
105 | 0 | for (;;) { |
106 | 0 | if (bufsize < 1) { |
107 | 0 | if (first) |
108 | 0 | break; |
109 | 0 | else |
110 | 0 | goto err_sl; |
111 | 0 | } |
112 | 0 | first = 0; |
113 | |
|
114 | 0 | i = bufsize; |
115 | 0 | if (buf[i - 1] == '\n') |
116 | 0 | buf[--i] = '\0'; |
117 | 0 | if (i == 0) |
118 | 0 | goto err_sl; |
119 | 0 | if (buf[i - 1] == '\r') |
120 | 0 | buf[--i] = '\0'; |
121 | 0 | if (i == 0) |
122 | 0 | goto err_sl; |
123 | 0 | again = (buf[i - 1] == '\\'); |
124 | |
|
125 | 0 | for (j = i - 1; j > 0; j--) { |
126 | 0 | #ifndef CHARSET_EBCDIC |
127 | 0 | if (!(((buf[j] >= '0') && (buf[j] <= '9')) || |
128 | 0 | ((buf[j] >= 'a') && (buf[j] <= 'f')) || |
129 | 0 | ((buf[j] >= 'A') && (buf[j] <= 'F')))) |
130 | | #else |
131 | | /* |
132 | | * This #ifdef is not strictly necessary, since the characters |
133 | | * A...F a...f 0...9 are contiguous (yes, even in EBCDIC - but |
134 | | * not the whole alphabet). Nevertheless, isxdigit() is faster. |
135 | | */ |
136 | | if (!isxdigit(buf[j])) |
137 | | #endif |
138 | 0 | { |
139 | 0 | i = j; |
140 | 0 | break; |
141 | 0 | } |
142 | 0 | } |
143 | 0 | buf[i] = '\0'; |
144 | | /* |
145 | | * We have now cleared all the crap off the end of the line |
146 | | */ |
147 | 0 | if (i < 2) |
148 | 0 | goto err_sl; |
149 | | |
150 | 0 | bufp = (unsigned char *)buf; |
151 | |
|
152 | 0 | k = 0; |
153 | 0 | i -= again; |
154 | 0 | if (i % 2 != 0) { |
155 | 0 | ASN1err(ASN1_F_A2I_ASN1_STRING, ASN1_R_ODD_NUMBER_OF_CHARS); |
156 | 0 | goto err; |
157 | 0 | } |
158 | 0 | i /= 2; |
159 | 0 | if (num + i > slen) { |
160 | 0 | if (s == NULL) |
161 | 0 | sp = (unsigned char *)OPENSSL_malloc((unsigned int)num + |
162 | 0 | i * 2); |
163 | 0 | else |
164 | 0 | sp = (unsigned char *)OPENSSL_realloc(s, |
165 | 0 | (unsigned int)num + |
166 | 0 | i * 2); |
167 | 0 | if (sp == NULL) { |
168 | 0 | ASN1err(ASN1_F_A2I_ASN1_STRING, ERR_R_MALLOC_FAILURE); |
169 | 0 | goto err; |
170 | 0 | } |
171 | 0 | s = sp; |
172 | 0 | slen = num + i * 2; |
173 | 0 | } |
174 | 0 | for (j = 0; j < i; j++, k += 2) { |
175 | 0 | for (n = 0; n < 2; n++) { |
176 | 0 | m = bufp[k + n]; |
177 | 0 | if ((m >= '0') && (m <= '9')) |
178 | 0 | m -= '0'; |
179 | 0 | else if ((m >= 'a') && (m <= 'f')) |
180 | 0 | m = m - 'a' + 10; |
181 | 0 | else if ((m >= 'A') && (m <= 'F')) |
182 | 0 | m = m - 'A' + 10; |
183 | 0 | else { |
184 | 0 | ASN1err(ASN1_F_A2I_ASN1_STRING, |
185 | 0 | ASN1_R_NON_HEX_CHARACTERS); |
186 | 0 | goto err; |
187 | 0 | } |
188 | 0 | s[num + j] <<= 4; |
189 | 0 | s[num + j] |= m; |
190 | 0 | } |
191 | 0 | } |
192 | 0 | num += i; |
193 | 0 | if (again) |
194 | 0 | bufsize = BIO_gets(bp, buf, size); |
195 | 0 | else |
196 | 0 | break; |
197 | 0 | } |
198 | 0 | bs->length = num; |
199 | 0 | bs->data = s; |
200 | 0 | ret = 1; |
201 | 0 | err: |
202 | 0 | if (0) { |
203 | 0 | err_sl: |
204 | 0 | ASN1err(ASN1_F_A2I_ASN1_STRING, ASN1_R_SHORT_LINE); |
205 | 0 | } |
206 | 0 | if (ret != 1) |
207 | 0 | OPENSSL_free(s); |
208 | 0 | return (ret); |
209 | 0 | } |