diff options
Diffstat (limited to 'src/lib/libcrypto/asn1/asn1_par.c')
-rw-r--r-- | src/lib/libcrypto/asn1/asn1_par.c | 386 |
1 files changed, 0 insertions, 386 deletions
diff --git a/src/lib/libcrypto/asn1/asn1_par.c b/src/lib/libcrypto/asn1/asn1_par.c deleted file mode 100644 index 712bb5260e..0000000000 --- a/src/lib/libcrypto/asn1/asn1_par.c +++ /dev/null | |||
@@ -1,386 +0,0 @@ | |||
1 | /* $OpenBSD: asn1_par.c,v 1.35 2023/07/05 21:23:36 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 <stdio.h> | ||
60 | |||
61 | #include <openssl/asn1.h> | ||
62 | #include <openssl/buffer.h> | ||
63 | #include <openssl/objects.h> | ||
64 | |||
65 | static int asn1_print_info(BIO *bp, int tag, int xclass, int constructed, | ||
66 | int indent); | ||
67 | static int asn1_parse2(BIO *bp, const unsigned char **pp, long length, | ||
68 | int offset, int depth, int indent, int dump); | ||
69 | |||
70 | static int | ||
71 | asn1_print_info(BIO *bp, int tag, int xclass, int constructed, | ||
72 | int indent) | ||
73 | { | ||
74 | char str[128]; | ||
75 | const char *p; | ||
76 | |||
77 | if (constructed & V_ASN1_CONSTRUCTED) | ||
78 | p="cons: "; | ||
79 | else | ||
80 | p="prim: "; | ||
81 | if (BIO_write(bp, p, 6) < 6) | ||
82 | goto err; | ||
83 | if (!BIO_indent(bp, indent, 128)) | ||
84 | goto err; | ||
85 | |||
86 | p = str; | ||
87 | if ((xclass & V_ASN1_PRIVATE) == V_ASN1_PRIVATE) | ||
88 | snprintf(str, sizeof str, "priv [ %d ] ", tag); | ||
89 | else if ((xclass & V_ASN1_CONTEXT_SPECIFIC) == V_ASN1_CONTEXT_SPECIFIC) | ||
90 | snprintf(str, sizeof str, "cont [ %d ]", tag); | ||
91 | else if ((xclass & V_ASN1_APPLICATION) == V_ASN1_APPLICATION) | ||
92 | snprintf(str, sizeof str, "appl [ %d ]", tag); | ||
93 | else if (tag > 30) | ||
94 | snprintf(str, sizeof str, "<ASN1 %d>", tag); | ||
95 | else | ||
96 | p = ASN1_tag2str(tag); | ||
97 | |||
98 | if (BIO_printf(bp, "%-18s", p) <= 0) | ||
99 | goto err; | ||
100 | return (1); | ||
101 | err: | ||
102 | return (0); | ||
103 | } | ||
104 | |||
105 | int | ||
106 | ASN1_parse(BIO *bp, const unsigned char *pp, long len, int indent) | ||
107 | { | ||
108 | return (asn1_parse2(bp, &pp, len, 0, 0, indent, 0)); | ||
109 | } | ||
110 | LCRYPTO_ALIAS(ASN1_parse); | ||
111 | |||
112 | int | ||
113 | ASN1_parse_dump(BIO *bp, const unsigned char *pp, long len, int indent, int dump) | ||
114 | { | ||
115 | return (asn1_parse2(bp, &pp, len, 0, 0, indent, dump)); | ||
116 | } | ||
117 | LCRYPTO_ALIAS(ASN1_parse_dump); | ||
118 | |||
119 | static int | ||
120 | asn1_parse2(BIO *bp, const unsigned char **pp, long length, int offset, | ||
121 | int depth, int indent, int dump) | ||
122 | { | ||
123 | const unsigned char *p, *ep, *tot, *op, *opp; | ||
124 | long len; | ||
125 | int tag, xclass, ret = 0; | ||
126 | int nl, hl, j, r; | ||
127 | ASN1_OBJECT *o = NULL; | ||
128 | ASN1_OCTET_STRING *os = NULL; | ||
129 | ASN1_INTEGER *ai = NULL; | ||
130 | ASN1_ENUMERATED *ae = NULL; | ||
131 | /* ASN1_BMPSTRING *bmp=NULL;*/ | ||
132 | int dump_indent; | ||
133 | |||
134 | dump_indent = 6; /* Because we know BIO_dump_indent() */ | ||
135 | p = *pp; | ||
136 | tot = p + length; | ||
137 | op = p - 1; | ||
138 | if (depth > 128) { | ||
139 | BIO_printf(bp, "Max depth exceeded\n"); | ||
140 | goto end; | ||
141 | } | ||
142 | while ((p < tot) && (op < p)) { | ||
143 | op = p; | ||
144 | j = ASN1_get_object(&p, &len, &tag, &xclass, length); | ||
145 | |||
146 | if (j & 0x80) { | ||
147 | if (BIO_write(bp, "Error in encoding\n", 18) <= 0) | ||
148 | goto end; | ||
149 | ret = 0; | ||
150 | goto end; | ||
151 | } | ||
152 | hl = (p - op); | ||
153 | length -= hl; | ||
154 | /* if j == 0x21 it is a constructed indefinite length object */ | ||
155 | if (BIO_printf(bp, "%5ld:", (long)offset + | ||
156 | (long)(op - *pp)) <= 0) | ||
157 | goto end; | ||
158 | |||
159 | if (j != (V_ASN1_CONSTRUCTED | 1)) { | ||
160 | if (BIO_printf(bp, "d=%-2d hl=%ld l=%4ld ", | ||
161 | depth, (long)hl, len) <= 0) | ||
162 | goto end; | ||
163 | } else { | ||
164 | if (BIO_printf(bp, "d=%-2d hl=%ld l=inf ", | ||
165 | depth, (long)hl) <= 0) | ||
166 | goto end; | ||
167 | } | ||
168 | if (!asn1_print_info(bp, tag, xclass, j, (indent) ? depth : 0)) | ||
169 | goto end; | ||
170 | if (j & V_ASN1_CONSTRUCTED) { | ||
171 | ep = p + len; | ||
172 | if (BIO_write(bp, "\n", 1) <= 0) | ||
173 | goto end; | ||
174 | if (len > length) { | ||
175 | BIO_printf(bp, "length is greater than %ld\n", | ||
176 | length); | ||
177 | ret = 0; | ||
178 | goto end; | ||
179 | } | ||
180 | if ((j == 0x21) && (len == 0)) { | ||
181 | for (;;) { | ||
182 | r = asn1_parse2(bp, &p, (long)(tot - p), | ||
183 | offset + (p - *pp), depth + 1, | ||
184 | indent, dump); | ||
185 | if (r == 0) { | ||
186 | ret = 0; | ||
187 | goto end; | ||
188 | } | ||
189 | if ((r == 2) || (p >= tot)) { | ||
190 | len = (long)(p - ep); | ||
191 | break; | ||
192 | } | ||
193 | } | ||
194 | } else { | ||
195 | while (p < ep) { | ||
196 | r = asn1_parse2(bp, &p, (long)(ep - p), | ||
197 | offset + (p - *pp), depth + 1, | ||
198 | indent, dump); | ||
199 | if (r == 0) { | ||
200 | ret = 0; | ||
201 | goto end; | ||
202 | } | ||
203 | } | ||
204 | } | ||
205 | } else if (xclass != 0) { | ||
206 | p += len; | ||
207 | if (BIO_write(bp, "\n", 1) <= 0) | ||
208 | goto end; | ||
209 | } else { | ||
210 | nl = 0; | ||
211 | if ((tag == V_ASN1_PRINTABLESTRING) || | ||
212 | (tag == V_ASN1_T61STRING) || | ||
213 | (tag == V_ASN1_IA5STRING) || | ||
214 | (tag == V_ASN1_VISIBLESTRING) || | ||
215 | (tag == V_ASN1_NUMERICSTRING) || | ||
216 | (tag == V_ASN1_UTF8STRING) || | ||
217 | (tag == V_ASN1_UTCTIME) || | ||
218 | (tag == V_ASN1_GENERALIZEDTIME)) { | ||
219 | if (BIO_write(bp, ":", 1) <= 0) | ||
220 | goto end; | ||
221 | if ((len > 0) && | ||
222 | BIO_write(bp, (const char *)p, (int)len) != | ||
223 | (int)len) | ||
224 | goto end; | ||
225 | } else if (tag == V_ASN1_OBJECT) { | ||
226 | opp = op; | ||
227 | if (d2i_ASN1_OBJECT(&o, &opp, len + hl) != | ||
228 | NULL) { | ||
229 | if (BIO_write(bp, ":", 1) <= 0) | ||
230 | goto end; | ||
231 | i2a_ASN1_OBJECT(bp, o); | ||
232 | } else { | ||
233 | if (BIO_write(bp, ":BAD OBJECT", | ||
234 | 11) <= 0) | ||
235 | goto end; | ||
236 | } | ||
237 | } else if (tag == V_ASN1_BOOLEAN) { | ||
238 | if (len == 1 && p < tot) { | ||
239 | BIO_printf(bp, ":%u", p[0]); | ||
240 | } else { | ||
241 | if (BIO_write(bp, "Bad boolean\n", | ||
242 | 12) <= 0) | ||
243 | goto end; | ||
244 | } | ||
245 | } else if (tag == V_ASN1_BMPSTRING) { | ||
246 | /* do the BMP thang */ | ||
247 | } else if (tag == V_ASN1_OCTET_STRING) { | ||
248 | int i, printable = 1; | ||
249 | |||
250 | opp = op; | ||
251 | os = d2i_ASN1_OCTET_STRING(NULL, &opp, len + hl); | ||
252 | if (os != NULL && os->length > 0) { | ||
253 | opp = os->data; | ||
254 | /* testing whether the octet string is | ||
255 | * printable */ | ||
256 | for (i = 0; i < os->length; i++) { | ||
257 | if (((opp[i] < ' ') && | ||
258 | (opp[i] != '\n') && | ||
259 | (opp[i] != '\r') && | ||
260 | (opp[i] != '\t')) || | ||
261 | (opp[i] > '~')) { | ||
262 | printable = 0; | ||
263 | break; | ||
264 | } | ||
265 | } | ||
266 | if (printable) { | ||
267 | /* printable string */ | ||
268 | if (BIO_write(bp, ":", 1) <= 0) | ||
269 | goto end; | ||
270 | if (BIO_write(bp, (const char *)opp, | ||
271 | os->length) <= 0) | ||
272 | goto end; | ||
273 | } else if (!dump) { | ||
274 | /* not printable => print octet string | ||
275 | * as hex dump */ | ||
276 | if (BIO_write(bp, "[HEX DUMP]:", 11) <= 0) | ||
277 | goto end; | ||
278 | for (i = 0; i < os->length; i++) { | ||
279 | if (BIO_printf(bp, | ||
280 | "%02X", opp[i]) <= 0) | ||
281 | goto end; | ||
282 | } | ||
283 | } else { | ||
284 | /* print the normal dump */ | ||
285 | if (!nl) { | ||
286 | if (BIO_write(bp, "\n", 1) <= 0) | ||
287 | goto end; | ||
288 | } | ||
289 | if (BIO_dump_indent(bp, | ||
290 | (const char *)opp, | ||
291 | ((dump == -1 || dump > | ||
292 | os->length) ? os->length : dump), | ||
293 | dump_indent) <= 0) | ||
294 | goto end; | ||
295 | nl = 1; | ||
296 | } | ||
297 | } | ||
298 | ASN1_OCTET_STRING_free(os); | ||
299 | os = NULL; | ||
300 | } else if (tag == V_ASN1_INTEGER) { | ||
301 | int i; | ||
302 | |||
303 | opp = op; | ||
304 | ai = d2i_ASN1_INTEGER(NULL, &opp, len + hl); | ||
305 | if (ai != NULL) { | ||
306 | if (BIO_write(bp, ":", 1) <= 0) | ||
307 | goto end; | ||
308 | if (ai->type == V_ASN1_NEG_INTEGER) | ||
309 | if (BIO_write(bp, "-", 1) <= 0) | ||
310 | goto end; | ||
311 | for (i = 0; i < ai->length; i++) { | ||
312 | if (BIO_printf(bp, "%02X", | ||
313 | ai->data[i]) <= 0) | ||
314 | goto end; | ||
315 | } | ||
316 | if (ai->length == 0) { | ||
317 | if (BIO_write(bp, "00", 2) <= 0) | ||
318 | goto end; | ||
319 | } | ||
320 | } else { | ||
321 | if (BIO_write(bp, "BAD INTEGER", 11) <= 0) | ||
322 | goto end; | ||
323 | } | ||
324 | ASN1_INTEGER_free(ai); | ||
325 | ai = NULL; | ||
326 | } else if (tag == V_ASN1_ENUMERATED) { | ||
327 | int i; | ||
328 | |||
329 | opp = op; | ||
330 | ae = d2i_ASN1_ENUMERATED(NULL, &opp, len + hl); | ||
331 | if (ae != NULL) { | ||
332 | if (BIO_write(bp, ":", 1) <= 0) | ||
333 | goto end; | ||
334 | if (ae->type == V_ASN1_NEG_ENUMERATED) | ||
335 | if (BIO_write(bp, "-", 1) <= 0) | ||
336 | goto end; | ||
337 | for (i = 0; i < ae->length; i++) { | ||
338 | if (BIO_printf(bp, "%02X", | ||
339 | ae->data[i]) <= 0) | ||
340 | goto end; | ||
341 | } | ||
342 | if (ae->length == 0) { | ||
343 | if (BIO_write(bp, "00", 2) <= 0) | ||
344 | goto end; | ||
345 | } | ||
346 | } else { | ||
347 | if (BIO_write(bp, "BAD ENUMERATED", 14) <= 0) | ||
348 | goto end; | ||
349 | } | ||
350 | ASN1_ENUMERATED_free(ae); | ||
351 | ae = NULL; | ||
352 | } else if (len > 0 && dump) { | ||
353 | if (!nl) { | ||
354 | if (BIO_write(bp, "\n", 1) <= 0) | ||
355 | goto end; | ||
356 | } | ||
357 | if (BIO_dump_indent(bp, (const char *)p, | ||
358 | ((dump == -1 || dump > len) ? len : dump), | ||
359 | dump_indent) <= 0) | ||
360 | goto end; | ||
361 | nl = 1; | ||
362 | } | ||
363 | |||
364 | if (!nl) { | ||
365 | if (BIO_write(bp, "\n", 1) <= 0) | ||
366 | goto end; | ||
367 | } | ||
368 | p += len; | ||
369 | if ((tag == V_ASN1_EOC) && (xclass == 0)) { | ||
370 | ret = 2; /* End of sequence */ | ||
371 | goto end; | ||
372 | } | ||
373 | } | ||
374 | length -= len; | ||
375 | } | ||
376 | ret = 1; | ||
377 | |||
378 | end: | ||
379 | if (o != NULL) | ||
380 | ASN1_OBJECT_free(o); | ||
381 | ASN1_OCTET_STRING_free(os); | ||
382 | ASN1_INTEGER_free(ai); | ||
383 | ASN1_ENUMERATED_free(ae); | ||
384 | *pp = p; | ||
385 | return (ret); | ||
386 | } | ||