/src/openssl111/crypto/asn1/tasn_dec.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | * Copyright 2000-2020 The OpenSSL Project Authors. All Rights Reserved. |
3 | | * |
4 | | * Licensed under the OpenSSL license (the "License"). You may not use |
5 | | * this file except in compliance with the License. You can obtain a copy |
6 | | * in the file LICENSE in the source distribution or at |
7 | | * https://www.openssl.org/source/license.html |
8 | | */ |
9 | | |
10 | | #include <stddef.h> |
11 | | #include <string.h> |
12 | | #include <openssl/asn1.h> |
13 | | #include <openssl/asn1t.h> |
14 | | #include <openssl/objects.h> |
15 | | #include <openssl/buffer.h> |
16 | | #include <openssl/err.h> |
17 | | #include "internal/numbers.h" |
18 | | #include "asn1_local.h" |
19 | | |
20 | | |
21 | | /* |
22 | | * Constructed types with a recursive definition (such as can be found in PKCS7) |
23 | | * could eventually exceed the stack given malicious input with excessive |
24 | | * recursion. Therefore we limit the stack depth. This is the maximum number of |
25 | | * recursive invocations of asn1_item_embed_d2i(). |
26 | | */ |
27 | 0 | #define ASN1_MAX_CONSTRUCTED_NEST 30 |
28 | | |
29 | | static int asn1_item_embed_d2i(ASN1_VALUE **pval, const unsigned char **in, |
30 | | long len, const ASN1_ITEM *it, |
31 | | int tag, int aclass, char opt, ASN1_TLC *ctx, |
32 | | int depth); |
33 | | |
34 | | static int asn1_check_eoc(const unsigned char **in, long len); |
35 | | static int asn1_find_end(const unsigned char **in, long len, char inf); |
36 | | |
37 | | static int asn1_collect(BUF_MEM *buf, const unsigned char **in, long len, |
38 | | char inf, int tag, int aclass, int depth); |
39 | | |
40 | | static int collect_data(BUF_MEM *buf, const unsigned char **p, long plen); |
41 | | |
42 | | static int asn1_check_tlen(long *olen, int *otag, unsigned char *oclass, |
43 | | char *inf, char *cst, |
44 | | const unsigned char **in, long len, |
45 | | int exptag, int expclass, char opt, ASN1_TLC *ctx); |
46 | | |
47 | | static int asn1_template_ex_d2i(ASN1_VALUE **pval, |
48 | | const unsigned char **in, long len, |
49 | | const ASN1_TEMPLATE *tt, char opt, |
50 | | ASN1_TLC *ctx, int depth); |
51 | | static int asn1_template_noexp_d2i(ASN1_VALUE **val, |
52 | | const unsigned char **in, long len, |
53 | | const ASN1_TEMPLATE *tt, char opt, |
54 | | ASN1_TLC *ctx, int depth); |
55 | | static int asn1_d2i_ex_primitive(ASN1_VALUE **pval, |
56 | | const unsigned char **in, long len, |
57 | | const ASN1_ITEM *it, |
58 | | int tag, int aclass, char opt, |
59 | | ASN1_TLC *ctx); |
60 | | static int asn1_ex_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, |
61 | | int utype, char *free_cont, const ASN1_ITEM *it); |
62 | | |
63 | | /* Table to convert tags to bit values, used for MSTRING type */ |
64 | | static const unsigned long tag2bit[32] = { |
65 | | /* tags 0 - 3 */ |
66 | | 0, 0, 0, B_ASN1_BIT_STRING, |
67 | | /* tags 4- 7 */ |
68 | | B_ASN1_OCTET_STRING, 0, 0, B_ASN1_UNKNOWN, |
69 | | /* tags 8-11 */ |
70 | | B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, |
71 | | /* tags 12-15 */ |
72 | | B_ASN1_UTF8STRING, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, |
73 | | /* tags 16-19 */ |
74 | | B_ASN1_SEQUENCE, 0, B_ASN1_NUMERICSTRING, B_ASN1_PRINTABLESTRING, |
75 | | /* tags 20-22 */ |
76 | | B_ASN1_T61STRING, B_ASN1_VIDEOTEXSTRING, B_ASN1_IA5STRING, |
77 | | /* tags 23-24 */ |
78 | | B_ASN1_UTCTIME, B_ASN1_GENERALIZEDTIME, |
79 | | /* tags 25-27 */ |
80 | | B_ASN1_GRAPHICSTRING, B_ASN1_ISO64STRING, B_ASN1_GENERALSTRING, |
81 | | /* tags 28-31 */ |
82 | | B_ASN1_UNIVERSALSTRING, B_ASN1_UNKNOWN, B_ASN1_BMPSTRING, B_ASN1_UNKNOWN, |
83 | | }; |
84 | | |
85 | | unsigned long ASN1_tag2bit(int tag) |
86 | 0 | { |
87 | 0 | if ((tag < 0) || (tag > 30)) |
88 | 0 | return 0; |
89 | 0 | return tag2bit[tag]; |
90 | 0 | } |
91 | | |
92 | | /* Macro to initialize and invalidate the cache */ |
93 | | |
94 | 0 | #define asn1_tlc_clear(c) if (c) (c)->valid = 0 |
95 | | /* Version to avoid compiler warning about 'c' always non-NULL */ |
96 | 0 | #define asn1_tlc_clear_nc(c) (c)->valid = 0 |
97 | | |
98 | | /* |
99 | | * Decode an ASN1 item, this currently behaves just like a standard 'd2i' |
100 | | * function. 'in' points to a buffer to read the data from, in future we |
101 | | * will have more advanced versions that can input data a piece at a time and |
102 | | * this will simply be a special case. |
103 | | */ |
104 | | |
105 | | ASN1_VALUE *ASN1_item_d2i(ASN1_VALUE **pval, |
106 | | const unsigned char **in, long len, |
107 | | const ASN1_ITEM *it) |
108 | 0 | { |
109 | 0 | ASN1_TLC c; |
110 | 0 | ASN1_VALUE *ptmpval = NULL; |
111 | 0 | if (!pval) |
112 | 0 | pval = &ptmpval; |
113 | 0 | asn1_tlc_clear_nc(&c); |
114 | 0 | if (ASN1_item_ex_d2i(pval, in, len, it, -1, 0, 0, &c) > 0) |
115 | 0 | return *pval; |
116 | 0 | return NULL; |
117 | 0 | } |
118 | | |
119 | | int ASN1_item_ex_d2i(ASN1_VALUE **pval, const unsigned char **in, long len, |
120 | | const ASN1_ITEM *it, |
121 | | int tag, int aclass, char opt, ASN1_TLC *ctx) |
122 | 0 | { |
123 | 0 | int rv; |
124 | 0 | rv = asn1_item_embed_d2i(pval, in, len, it, tag, aclass, opt, ctx, 0); |
125 | 0 | if (rv <= 0) |
126 | 0 | ASN1_item_ex_free(pval, it); |
127 | 0 | return rv; |
128 | 0 | } |
129 | | |
130 | | /* |
131 | | * Decode an item, taking care of IMPLICIT tagging, if any. If 'opt' set and |
132 | | * tag mismatch return -1 to handle OPTIONAL |
133 | | */ |
134 | | |
135 | | static int asn1_item_embed_d2i(ASN1_VALUE **pval, const unsigned char **in, |
136 | | long len, const ASN1_ITEM *it, |
137 | | int tag, int aclass, char opt, ASN1_TLC *ctx, |
138 | | int depth) |
139 | 0 | { |
140 | 0 | const ASN1_TEMPLATE *tt, *errtt = NULL; |
141 | 0 | const ASN1_EXTERN_FUNCS *ef; |
142 | 0 | const ASN1_AUX *aux = it->funcs; |
143 | 0 | ASN1_aux_cb *asn1_cb; |
144 | 0 | const unsigned char *p = NULL, *q; |
145 | 0 | unsigned char oclass; |
146 | 0 | char seq_eoc, seq_nolen, cst, isopt; |
147 | 0 | long tmplen; |
148 | 0 | int i; |
149 | 0 | int otag; |
150 | 0 | int ret = 0; |
151 | 0 | ASN1_VALUE **pchptr; |
152 | 0 | if (!pval) |
153 | 0 | return 0; |
154 | 0 | if (aux && aux->asn1_cb) |
155 | 0 | asn1_cb = aux->asn1_cb; |
156 | 0 | else |
157 | 0 | asn1_cb = 0; |
158 | |
|
159 | 0 | if (++depth > ASN1_MAX_CONSTRUCTED_NEST) { |
160 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_NESTED_TOO_DEEP); |
161 | 0 | goto err; |
162 | 0 | } |
163 | | |
164 | 0 | switch (it->itype) { |
165 | 0 | case ASN1_ITYPE_PRIMITIVE: |
166 | 0 | if (it->templates) { |
167 | | /* |
168 | | * tagging or OPTIONAL is currently illegal on an item template |
169 | | * because the flags can't get passed down. In practice this |
170 | | * isn't a problem: we include the relevant flags from the item |
171 | | * template in the template itself. |
172 | | */ |
173 | 0 | if ((tag != -1) || opt) { |
174 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, |
175 | 0 | ASN1_R_ILLEGAL_OPTIONS_ON_ITEM_TEMPLATE); |
176 | 0 | goto err; |
177 | 0 | } |
178 | 0 | return asn1_template_ex_d2i(pval, in, len, |
179 | 0 | it->templates, opt, ctx, depth); |
180 | 0 | } |
181 | 0 | return asn1_d2i_ex_primitive(pval, in, len, it, |
182 | 0 | tag, aclass, opt, ctx); |
183 | | |
184 | 0 | case ASN1_ITYPE_MSTRING: |
185 | | /* |
186 | | * It never makes sense for multi-strings to have implicit tagging, so |
187 | | * if tag != -1, then this looks like an error in the template. |
188 | | */ |
189 | 0 | if (tag != -1) { |
190 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_BAD_TEMPLATE); |
191 | 0 | goto err; |
192 | 0 | } |
193 | | |
194 | 0 | p = *in; |
195 | | /* Just read in tag and class */ |
196 | 0 | ret = asn1_check_tlen(NULL, &otag, &oclass, NULL, NULL, |
197 | 0 | &p, len, -1, 0, 1, ctx); |
198 | 0 | if (!ret) { |
199 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ERR_R_NESTED_ASN1_ERROR); |
200 | 0 | goto err; |
201 | 0 | } |
202 | | |
203 | | /* Must be UNIVERSAL class */ |
204 | 0 | if (oclass != V_ASN1_UNIVERSAL) { |
205 | | /* If OPTIONAL, assume this is OK */ |
206 | 0 | if (opt) |
207 | 0 | return -1; |
208 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_MSTRING_NOT_UNIVERSAL); |
209 | 0 | goto err; |
210 | 0 | } |
211 | | |
212 | | /* Check tag matches bit map */ |
213 | 0 | if (!(ASN1_tag2bit(otag) & it->utype)) { |
214 | | /* If OPTIONAL, assume this is OK */ |
215 | 0 | if (opt) |
216 | 0 | return -1; |
217 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_MSTRING_WRONG_TAG); |
218 | 0 | goto err; |
219 | 0 | } |
220 | 0 | return asn1_d2i_ex_primitive(pval, in, len, it, otag, 0, 0, ctx); |
221 | | |
222 | 0 | case ASN1_ITYPE_EXTERN: |
223 | | /* Use new style d2i */ |
224 | 0 | ef = it->funcs; |
225 | 0 | return ef->asn1_ex_d2i(pval, in, len, it, tag, aclass, opt, ctx); |
226 | | |
227 | 0 | case ASN1_ITYPE_CHOICE: |
228 | | /* |
229 | | * It never makes sense for CHOICE types to have implicit tagging, so |
230 | | * if tag != -1, then this looks like an error in the template. |
231 | | */ |
232 | 0 | if (tag != -1) { |
233 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_BAD_TEMPLATE); |
234 | 0 | goto err; |
235 | 0 | } |
236 | | |
237 | 0 | if (asn1_cb && !asn1_cb(ASN1_OP_D2I_PRE, pval, it, NULL)) |
238 | 0 | goto auxerr; |
239 | 0 | if (*pval) { |
240 | | /* Free up and zero CHOICE value if initialised */ |
241 | 0 | i = asn1_get_choice_selector(pval, it); |
242 | 0 | if ((i >= 0) && (i < it->tcount)) { |
243 | 0 | tt = it->templates + i; |
244 | 0 | pchptr = asn1_get_field_ptr(pval, tt); |
245 | 0 | asn1_template_free(pchptr, tt); |
246 | 0 | asn1_set_choice_selector(pval, -1, it); |
247 | 0 | } |
248 | 0 | } else if (!ASN1_item_ex_new(pval, it)) { |
249 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ERR_R_NESTED_ASN1_ERROR); |
250 | 0 | goto err; |
251 | 0 | } |
252 | | /* CHOICE type, try each possibility in turn */ |
253 | 0 | p = *in; |
254 | 0 | for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) { |
255 | 0 | pchptr = asn1_get_field_ptr(pval, tt); |
256 | | /* |
257 | | * We mark field as OPTIONAL so its absence can be recognised. |
258 | | */ |
259 | 0 | ret = asn1_template_ex_d2i(pchptr, &p, len, tt, 1, ctx, depth); |
260 | | /* If field not present, try the next one */ |
261 | 0 | if (ret == -1) |
262 | 0 | continue; |
263 | | /* If positive return, read OK, break loop */ |
264 | 0 | if (ret > 0) |
265 | 0 | break; |
266 | | /* |
267 | | * Must be an ASN1 parsing error. |
268 | | * Free up any partial choice value |
269 | | */ |
270 | 0 | asn1_template_free(pchptr, tt); |
271 | 0 | errtt = tt; |
272 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ERR_R_NESTED_ASN1_ERROR); |
273 | 0 | goto err; |
274 | 0 | } |
275 | | |
276 | | /* Did we fall off the end without reading anything? */ |
277 | 0 | if (i == it->tcount) { |
278 | | /* If OPTIONAL, this is OK */ |
279 | 0 | if (opt) { |
280 | | /* Free and zero it */ |
281 | 0 | ASN1_item_ex_free(pval, it); |
282 | 0 | return -1; |
283 | 0 | } |
284 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_NO_MATCHING_CHOICE_TYPE); |
285 | 0 | goto err; |
286 | 0 | } |
287 | | |
288 | 0 | asn1_set_choice_selector(pval, i, it); |
289 | |
|
290 | 0 | if (asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it, NULL)) |
291 | 0 | goto auxerr; |
292 | 0 | *in = p; |
293 | 0 | return 1; |
294 | | |
295 | 0 | case ASN1_ITYPE_NDEF_SEQUENCE: |
296 | 0 | case ASN1_ITYPE_SEQUENCE: |
297 | 0 | p = *in; |
298 | 0 | tmplen = len; |
299 | | |
300 | | /* If no IMPLICIT tagging set to SEQUENCE, UNIVERSAL */ |
301 | 0 | if (tag == -1) { |
302 | 0 | tag = V_ASN1_SEQUENCE; |
303 | 0 | aclass = V_ASN1_UNIVERSAL; |
304 | 0 | } |
305 | | /* Get SEQUENCE length and update len, p */ |
306 | 0 | ret = asn1_check_tlen(&len, NULL, NULL, &seq_eoc, &cst, |
307 | 0 | &p, len, tag, aclass, opt, ctx); |
308 | 0 | if (!ret) { |
309 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ERR_R_NESTED_ASN1_ERROR); |
310 | 0 | goto err; |
311 | 0 | } else if (ret == -1) |
312 | 0 | return -1; |
313 | 0 | if (aux && (aux->flags & ASN1_AFLG_BROKEN)) { |
314 | 0 | len = tmplen - (p - *in); |
315 | 0 | seq_nolen = 1; |
316 | 0 | } |
317 | | /* If indefinite we don't do a length check */ |
318 | 0 | else |
319 | 0 | seq_nolen = seq_eoc; |
320 | 0 | if (!cst) { |
321 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_SEQUENCE_NOT_CONSTRUCTED); |
322 | 0 | goto err; |
323 | 0 | } |
324 | | |
325 | 0 | if (!*pval && !ASN1_item_ex_new(pval, it)) { |
326 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ERR_R_NESTED_ASN1_ERROR); |
327 | 0 | goto err; |
328 | 0 | } |
329 | | |
330 | 0 | if (asn1_cb && !asn1_cb(ASN1_OP_D2I_PRE, pval, it, NULL)) |
331 | 0 | goto auxerr; |
332 | | |
333 | | /* Free up and zero any ADB found */ |
334 | 0 | for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) { |
335 | 0 | if (tt->flags & ASN1_TFLG_ADB_MASK) { |
336 | 0 | const ASN1_TEMPLATE *seqtt; |
337 | 0 | ASN1_VALUE **pseqval; |
338 | 0 | seqtt = asn1_do_adb(pval, tt, 0); |
339 | 0 | if (seqtt == NULL) |
340 | 0 | continue; |
341 | 0 | pseqval = asn1_get_field_ptr(pval, seqtt); |
342 | 0 | asn1_template_free(pseqval, seqtt); |
343 | 0 | } |
344 | 0 | } |
345 | | |
346 | | /* Get each field entry */ |
347 | 0 | for (i = 0, tt = it->templates; i < it->tcount; i++, tt++) { |
348 | 0 | const ASN1_TEMPLATE *seqtt; |
349 | 0 | ASN1_VALUE **pseqval; |
350 | 0 | seqtt = asn1_do_adb(pval, tt, 1); |
351 | 0 | if (seqtt == NULL) |
352 | 0 | goto err; |
353 | 0 | pseqval = asn1_get_field_ptr(pval, seqtt); |
354 | | /* Have we ran out of data? */ |
355 | 0 | if (!len) |
356 | 0 | break; |
357 | 0 | q = p; |
358 | 0 | if (asn1_check_eoc(&p, len)) { |
359 | 0 | if (!seq_eoc) { |
360 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_UNEXPECTED_EOC); |
361 | 0 | goto err; |
362 | 0 | } |
363 | 0 | len -= p - q; |
364 | 0 | seq_eoc = 0; |
365 | 0 | q = p; |
366 | 0 | break; |
367 | 0 | } |
368 | | /* |
369 | | * This determines the OPTIONAL flag value. The field cannot be |
370 | | * omitted if it is the last of a SEQUENCE and there is still |
371 | | * data to be read. This isn't strictly necessary but it |
372 | | * increases efficiency in some cases. |
373 | | */ |
374 | 0 | if (i == (it->tcount - 1)) |
375 | 0 | isopt = 0; |
376 | 0 | else |
377 | 0 | isopt = (char)(seqtt->flags & ASN1_TFLG_OPTIONAL); |
378 | | /* |
379 | | * attempt to read in field, allowing each to be OPTIONAL |
380 | | */ |
381 | |
|
382 | 0 | ret = asn1_template_ex_d2i(pseqval, &p, len, seqtt, isopt, ctx, |
383 | 0 | depth); |
384 | 0 | if (!ret) { |
385 | 0 | errtt = seqtt; |
386 | 0 | goto err; |
387 | 0 | } else if (ret == -1) { |
388 | | /* |
389 | | * OPTIONAL component absent. Free and zero the field. |
390 | | */ |
391 | 0 | asn1_template_free(pseqval, seqtt); |
392 | 0 | continue; |
393 | 0 | } |
394 | | /* Update length */ |
395 | 0 | len -= p - q; |
396 | 0 | } |
397 | | |
398 | | /* Check for EOC if expecting one */ |
399 | 0 | if (seq_eoc && !asn1_check_eoc(&p, len)) { |
400 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_MISSING_EOC); |
401 | 0 | goto err; |
402 | 0 | } |
403 | | /* Check all data read */ |
404 | 0 | if (!seq_nolen && len) { |
405 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_SEQUENCE_LENGTH_MISMATCH); |
406 | 0 | goto err; |
407 | 0 | } |
408 | | |
409 | | /* |
410 | | * If we get here we've got no more data in the SEQUENCE, however we |
411 | | * may not have read all fields so check all remaining are OPTIONAL |
412 | | * and clear any that are. |
413 | | */ |
414 | 0 | for (; i < it->tcount; tt++, i++) { |
415 | 0 | const ASN1_TEMPLATE *seqtt; |
416 | 0 | seqtt = asn1_do_adb(pval, tt, 1); |
417 | 0 | if (seqtt == NULL) |
418 | 0 | goto err; |
419 | 0 | if (seqtt->flags & ASN1_TFLG_OPTIONAL) { |
420 | 0 | ASN1_VALUE **pseqval; |
421 | 0 | pseqval = asn1_get_field_ptr(pval, seqtt); |
422 | 0 | asn1_template_free(pseqval, seqtt); |
423 | 0 | } else { |
424 | 0 | errtt = seqtt; |
425 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_FIELD_MISSING); |
426 | 0 | goto err; |
427 | 0 | } |
428 | 0 | } |
429 | | /* Save encoding */ |
430 | 0 | if (!asn1_enc_save(pval, *in, p - *in, it)) |
431 | 0 | goto auxerr; |
432 | 0 | if (asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it, NULL)) |
433 | 0 | goto auxerr; |
434 | 0 | *in = p; |
435 | 0 | return 1; |
436 | | |
437 | 0 | default: |
438 | 0 | return 0; |
439 | 0 | } |
440 | 0 | auxerr: |
441 | 0 | ASN1err(ASN1_F_ASN1_ITEM_EMBED_D2I, ASN1_R_AUX_ERROR); |
442 | 0 | err: |
443 | 0 | if (errtt) |
444 | 0 | ERR_add_error_data(4, "Field=", errtt->field_name, |
445 | 0 | ", Type=", it->sname); |
446 | 0 | else |
447 | 0 | ERR_add_error_data(2, "Type=", it->sname); |
448 | 0 | return 0; |
449 | 0 | } |
450 | | |
451 | | /* |
452 | | * Templates are handled with two separate functions. One handles any |
453 | | * EXPLICIT tag and the other handles the rest. |
454 | | */ |
455 | | |
456 | | static int asn1_template_ex_d2i(ASN1_VALUE **val, |
457 | | const unsigned char **in, long inlen, |
458 | | const ASN1_TEMPLATE *tt, char opt, |
459 | | ASN1_TLC *ctx, int depth) |
460 | 0 | { |
461 | 0 | int flags, aclass; |
462 | 0 | int ret; |
463 | 0 | long len; |
464 | 0 | const unsigned char *p, *q; |
465 | 0 | char exp_eoc; |
466 | 0 | if (!val) |
467 | 0 | return 0; |
468 | 0 | flags = tt->flags; |
469 | 0 | aclass = flags & ASN1_TFLG_TAG_CLASS; |
470 | |
|
471 | 0 | p = *in; |
472 | | |
473 | | /* Check if EXPLICIT tag expected */ |
474 | 0 | if (flags & ASN1_TFLG_EXPTAG) { |
475 | 0 | char cst; |
476 | | /* |
477 | | * Need to work out amount of data available to the inner content and |
478 | | * where it starts: so read in EXPLICIT header to get the info. |
479 | | */ |
480 | 0 | ret = asn1_check_tlen(&len, NULL, NULL, &exp_eoc, &cst, |
481 | 0 | &p, inlen, tt->tag, aclass, opt, ctx); |
482 | 0 | q = p; |
483 | 0 | if (!ret) { |
484 | 0 | ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_NESTED_ASN1_ERROR); |
485 | 0 | return 0; |
486 | 0 | } else if (ret == -1) |
487 | 0 | return -1; |
488 | 0 | if (!cst) { |
489 | 0 | ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, |
490 | 0 | ASN1_R_EXPLICIT_TAG_NOT_CONSTRUCTED); |
491 | 0 | return 0; |
492 | 0 | } |
493 | | /* We've found the field so it can't be OPTIONAL now */ |
494 | 0 | ret = asn1_template_noexp_d2i(val, &p, len, tt, 0, ctx, depth); |
495 | 0 | if (!ret) { |
496 | 0 | ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ERR_R_NESTED_ASN1_ERROR); |
497 | 0 | return 0; |
498 | 0 | } |
499 | | /* We read the field in OK so update length */ |
500 | 0 | len -= p - q; |
501 | 0 | if (exp_eoc) { |
502 | | /* If NDEF we must have an EOC here */ |
503 | 0 | if (!asn1_check_eoc(&p, len)) { |
504 | 0 | ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, ASN1_R_MISSING_EOC); |
505 | 0 | goto err; |
506 | 0 | } |
507 | 0 | } else { |
508 | | /* |
509 | | * Otherwise we must hit the EXPLICIT tag end or its an error |
510 | | */ |
511 | 0 | if (len) { |
512 | 0 | ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I, |
513 | 0 | ASN1_R_EXPLICIT_LENGTH_MISMATCH); |
514 | 0 | goto err; |
515 | 0 | } |
516 | 0 | } |
517 | 0 | } else |
518 | 0 | return asn1_template_noexp_d2i(val, in, inlen, tt, opt, ctx, depth); |
519 | | |
520 | 0 | *in = p; |
521 | 0 | return 1; |
522 | | |
523 | 0 | err: |
524 | 0 | return 0; |
525 | 0 | } |
526 | | |
527 | | static int asn1_template_noexp_d2i(ASN1_VALUE **val, |
528 | | const unsigned char **in, long len, |
529 | | const ASN1_TEMPLATE *tt, char opt, |
530 | | ASN1_TLC *ctx, int depth) |
531 | 0 | { |
532 | 0 | int flags, aclass; |
533 | 0 | int ret; |
534 | 0 | ASN1_VALUE *tval; |
535 | 0 | const unsigned char *p, *q; |
536 | 0 | if (!val) |
537 | 0 | return 0; |
538 | 0 | flags = tt->flags; |
539 | 0 | aclass = flags & ASN1_TFLG_TAG_CLASS; |
540 | |
|
541 | 0 | p = *in; |
542 | 0 | q = p; |
543 | | |
544 | | /* |
545 | | * If field is embedded then val needs fixing so it is a pointer to |
546 | | * a pointer to a field. |
547 | | */ |
548 | 0 | if (tt->flags & ASN1_TFLG_EMBED) { |
549 | 0 | tval = (ASN1_VALUE *)val; |
550 | 0 | val = &tval; |
551 | 0 | } |
552 | |
|
553 | 0 | if (flags & ASN1_TFLG_SK_MASK) { |
554 | | /* SET OF, SEQUENCE OF */ |
555 | 0 | int sktag, skaclass; |
556 | 0 | char sk_eoc; |
557 | | /* First work out expected inner tag value */ |
558 | 0 | if (flags & ASN1_TFLG_IMPTAG) { |
559 | 0 | sktag = tt->tag; |
560 | 0 | skaclass = aclass; |
561 | 0 | } else { |
562 | 0 | skaclass = V_ASN1_UNIVERSAL; |
563 | 0 | if (flags & ASN1_TFLG_SET_OF) |
564 | 0 | sktag = V_ASN1_SET; |
565 | 0 | else |
566 | 0 | sktag = V_ASN1_SEQUENCE; |
567 | 0 | } |
568 | | /* Get the tag */ |
569 | 0 | ret = asn1_check_tlen(&len, NULL, NULL, &sk_eoc, NULL, |
570 | 0 | &p, len, sktag, skaclass, opt, ctx); |
571 | 0 | if (!ret) { |
572 | 0 | ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR); |
573 | 0 | return 0; |
574 | 0 | } else if (ret == -1) |
575 | 0 | return -1; |
576 | 0 | if (!*val) |
577 | 0 | *val = (ASN1_VALUE *)sk_ASN1_VALUE_new_null(); |
578 | 0 | else { |
579 | | /* |
580 | | * We've got a valid STACK: free up any items present |
581 | | */ |
582 | 0 | STACK_OF(ASN1_VALUE) *sktmp = (STACK_OF(ASN1_VALUE) *)*val; |
583 | 0 | ASN1_VALUE *vtmp; |
584 | 0 | while (sk_ASN1_VALUE_num(sktmp) > 0) { |
585 | 0 | vtmp = sk_ASN1_VALUE_pop(sktmp); |
586 | 0 | ASN1_item_ex_free(&vtmp, ASN1_ITEM_ptr(tt->item)); |
587 | 0 | } |
588 | 0 | } |
589 | |
|
590 | 0 | if (!*val) { |
591 | 0 | ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_MALLOC_FAILURE); |
592 | 0 | goto err; |
593 | 0 | } |
594 | | |
595 | | /* Read as many items as we can */ |
596 | 0 | while (len > 0) { |
597 | 0 | ASN1_VALUE *skfield; |
598 | 0 | q = p; |
599 | | /* See if EOC found */ |
600 | 0 | if (asn1_check_eoc(&p, len)) { |
601 | 0 | if (!sk_eoc) { |
602 | 0 | ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, |
603 | 0 | ASN1_R_UNEXPECTED_EOC); |
604 | 0 | goto err; |
605 | 0 | } |
606 | 0 | len -= p - q; |
607 | 0 | sk_eoc = 0; |
608 | 0 | break; |
609 | 0 | } |
610 | 0 | skfield = NULL; |
611 | 0 | if (!asn1_item_embed_d2i(&skfield, &p, len, |
612 | 0 | ASN1_ITEM_ptr(tt->item), -1, 0, 0, ctx, |
613 | 0 | depth)) { |
614 | 0 | ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, |
615 | 0 | ERR_R_NESTED_ASN1_ERROR); |
616 | | /* |skfield| may be partially allocated despite failure. */ |
617 | 0 | ASN1_item_free(skfield, ASN1_ITEM_ptr(tt->item)); |
618 | 0 | goto err; |
619 | 0 | } |
620 | 0 | len -= p - q; |
621 | 0 | if (!sk_ASN1_VALUE_push((STACK_OF(ASN1_VALUE) *)*val, skfield)) { |
622 | 0 | ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_MALLOC_FAILURE); |
623 | 0 | ASN1_item_free(skfield, ASN1_ITEM_ptr(tt->item)); |
624 | 0 | goto err; |
625 | 0 | } |
626 | 0 | } |
627 | 0 | if (sk_eoc) { |
628 | 0 | ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ASN1_R_MISSING_EOC); |
629 | 0 | goto err; |
630 | 0 | } |
631 | 0 | } else if (flags & ASN1_TFLG_IMPTAG) { |
632 | | /* IMPLICIT tagging */ |
633 | 0 | ret = asn1_item_embed_d2i(val, &p, len, |
634 | 0 | ASN1_ITEM_ptr(tt->item), tt->tag, aclass, opt, |
635 | 0 | ctx, depth); |
636 | 0 | if (!ret) { |
637 | 0 | ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR); |
638 | 0 | goto err; |
639 | 0 | } else if (ret == -1) |
640 | 0 | return -1; |
641 | 0 | } else { |
642 | | /* Nothing special */ |
643 | 0 | ret = asn1_item_embed_d2i(val, &p, len, ASN1_ITEM_ptr(tt->item), |
644 | 0 | -1, 0, opt, ctx, depth); |
645 | 0 | if (!ret) { |
646 | 0 | ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ERR_R_NESTED_ASN1_ERROR); |
647 | 0 | goto err; |
648 | 0 | } else if (ret == -1) |
649 | 0 | return -1; |
650 | 0 | } |
651 | | |
652 | 0 | *in = p; |
653 | 0 | return 1; |
654 | | |
655 | 0 | err: |
656 | 0 | return 0; |
657 | 0 | } |
658 | | |
659 | | static int asn1_d2i_ex_primitive(ASN1_VALUE **pval, |
660 | | const unsigned char **in, long inlen, |
661 | | const ASN1_ITEM *it, |
662 | | int tag, int aclass, char opt, ASN1_TLC *ctx) |
663 | 0 | { |
664 | 0 | int ret = 0, utype; |
665 | 0 | long plen; |
666 | 0 | char cst, inf, free_cont = 0; |
667 | 0 | const unsigned char *p; |
668 | 0 | BUF_MEM buf = { 0, NULL, 0, 0 }; |
669 | 0 | const unsigned char *cont = NULL; |
670 | 0 | long len; |
671 | 0 | if (!pval) { |
672 | 0 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_NULL); |
673 | 0 | return 0; /* Should never happen */ |
674 | 0 | } |
675 | | |
676 | 0 | if (it->itype == ASN1_ITYPE_MSTRING) { |
677 | 0 | utype = tag; |
678 | 0 | tag = -1; |
679 | 0 | } else |
680 | 0 | utype = it->utype; |
681 | |
|
682 | 0 | if (utype == V_ASN1_ANY) { |
683 | | /* If type is ANY need to figure out type from tag */ |
684 | 0 | unsigned char oclass; |
685 | 0 | if (tag >= 0) { |
686 | 0 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_TAGGED_ANY); |
687 | 0 | return 0; |
688 | 0 | } |
689 | 0 | if (opt) { |
690 | 0 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, |
691 | 0 | ASN1_R_ILLEGAL_OPTIONAL_ANY); |
692 | 0 | return 0; |
693 | 0 | } |
694 | 0 | p = *in; |
695 | 0 | ret = asn1_check_tlen(NULL, &utype, &oclass, NULL, NULL, |
696 | 0 | &p, inlen, -1, 0, 0, ctx); |
697 | 0 | if (!ret) { |
698 | 0 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_NESTED_ASN1_ERROR); |
699 | 0 | return 0; |
700 | 0 | } |
701 | 0 | if (oclass != V_ASN1_UNIVERSAL) |
702 | 0 | utype = V_ASN1_OTHER; |
703 | 0 | } |
704 | 0 | if (tag == -1) { |
705 | 0 | tag = utype; |
706 | 0 | aclass = V_ASN1_UNIVERSAL; |
707 | 0 | } |
708 | 0 | p = *in; |
709 | | /* Check header */ |
710 | 0 | ret = asn1_check_tlen(&plen, NULL, NULL, &inf, &cst, |
711 | 0 | &p, inlen, tag, aclass, opt, ctx); |
712 | 0 | if (!ret) { |
713 | 0 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_NESTED_ASN1_ERROR); |
714 | 0 | return 0; |
715 | 0 | } else if (ret == -1) |
716 | 0 | return -1; |
717 | 0 | ret = 0; |
718 | | /* SEQUENCE, SET and "OTHER" are left in encoded form */ |
719 | 0 | if ((utype == V_ASN1_SEQUENCE) |
720 | 0 | || (utype == V_ASN1_SET) || (utype == V_ASN1_OTHER)) { |
721 | | /* |
722 | | * Clear context cache for type OTHER because the auto clear when we |
723 | | * have a exact match won't work |
724 | | */ |
725 | 0 | if (utype == V_ASN1_OTHER) { |
726 | 0 | asn1_tlc_clear(ctx); |
727 | 0 | } |
728 | | /* SEQUENCE and SET must be constructed */ |
729 | 0 | else if (!cst) { |
730 | 0 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, |
731 | 0 | ASN1_R_TYPE_NOT_CONSTRUCTED); |
732 | 0 | return 0; |
733 | 0 | } |
734 | | |
735 | 0 | cont = *in; |
736 | | /* If indefinite length constructed find the real end */ |
737 | 0 | if (inf) { |
738 | 0 | if (!asn1_find_end(&p, plen, inf)) |
739 | 0 | goto err; |
740 | 0 | len = p - cont; |
741 | 0 | } else { |
742 | 0 | len = p - cont + plen; |
743 | 0 | p += plen; |
744 | 0 | } |
745 | 0 | } else if (cst) { |
746 | 0 | if (utype == V_ASN1_NULL || utype == V_ASN1_BOOLEAN |
747 | 0 | || utype == V_ASN1_OBJECT || utype == V_ASN1_INTEGER |
748 | 0 | || utype == V_ASN1_ENUMERATED) { |
749 | 0 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_TYPE_NOT_PRIMITIVE); |
750 | 0 | return 0; |
751 | 0 | } |
752 | | |
753 | | /* Free any returned 'buf' content */ |
754 | 0 | free_cont = 1; |
755 | | /* |
756 | | * Should really check the internal tags are correct but some things |
757 | | * may get this wrong. The relevant specs say that constructed string |
758 | | * types should be OCTET STRINGs internally irrespective of the type. |
759 | | * So instead just check for UNIVERSAL class and ignore the tag. |
760 | | */ |
761 | 0 | if (!asn1_collect(&buf, &p, plen, inf, -1, V_ASN1_UNIVERSAL, 0)) { |
762 | 0 | goto err; |
763 | 0 | } |
764 | 0 | len = buf.length; |
765 | | /* Append a final null to string */ |
766 | 0 | if (!BUF_MEM_grow_clean(&buf, len + 1)) { |
767 | 0 | ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_MALLOC_FAILURE); |
768 | 0 | goto err; |
769 | 0 | } |
770 | 0 | buf.data[len] = 0; |
771 | 0 | cont = (const unsigned char *)buf.data; |
772 | 0 | } else { |
773 | 0 | cont = p; |
774 | 0 | len = plen; |
775 | 0 | p += plen; |
776 | 0 | } |
777 | | |
778 | | /* We now have content length and type: translate into a structure */ |
779 | | /* asn1_ex_c2i may reuse allocated buffer, and so sets free_cont to 0 */ |
780 | 0 | if (!asn1_ex_c2i(pval, cont, len, utype, &free_cont, it)) |
781 | 0 | goto err; |
782 | | |
783 | 0 | *in = p; |
784 | 0 | ret = 1; |
785 | 0 | err: |
786 | 0 | if (free_cont) |
787 | 0 | OPENSSL_free(buf.data); |
788 | 0 | return ret; |
789 | 0 | } |
790 | | |
791 | | /* Translate ASN1 content octets into a structure */ |
792 | | |
793 | | static int asn1_ex_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, |
794 | | int utype, char *free_cont, const ASN1_ITEM *it) |
795 | 0 | { |
796 | 0 | ASN1_VALUE **opval = NULL; |
797 | 0 | ASN1_STRING *stmp; |
798 | 0 | ASN1_TYPE *typ = NULL; |
799 | 0 | int ret = 0; |
800 | 0 | const ASN1_PRIMITIVE_FUNCS *pf; |
801 | 0 | ASN1_INTEGER **tint; |
802 | 0 | pf = it->funcs; |
803 | |
|
804 | 0 | if (pf && pf->prim_c2i) |
805 | 0 | return pf->prim_c2i(pval, cont, len, utype, free_cont, it); |
806 | | /* If ANY type clear type and set pointer to internal value */ |
807 | 0 | if (it->utype == V_ASN1_ANY) { |
808 | 0 | if (!*pval) { |
809 | 0 | typ = ASN1_TYPE_new(); |
810 | 0 | if (typ == NULL) |
811 | 0 | goto err; |
812 | 0 | *pval = (ASN1_VALUE *)typ; |
813 | 0 | } else |
814 | 0 | typ = (ASN1_TYPE *)*pval; |
815 | | |
816 | 0 | if (utype != typ->type) |
817 | 0 | ASN1_TYPE_set(typ, utype, NULL); |
818 | 0 | opval = pval; |
819 | 0 | pval = &typ->value.asn1_value; |
820 | 0 | } |
821 | 0 | switch (utype) { |
822 | 0 | case V_ASN1_OBJECT: |
823 | 0 | if (!c2i_ASN1_OBJECT((ASN1_OBJECT **)pval, &cont, len)) |
824 | 0 | goto err; |
825 | 0 | break; |
826 | | |
827 | 0 | case V_ASN1_NULL: |
828 | 0 | if (len) { |
829 | 0 | ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_NULL_IS_WRONG_LENGTH); |
830 | 0 | goto err; |
831 | 0 | } |
832 | 0 | *pval = (ASN1_VALUE *)1; |
833 | 0 | break; |
834 | | |
835 | 0 | case V_ASN1_BOOLEAN: |
836 | 0 | if (len != 1) { |
837 | 0 | ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_BOOLEAN_IS_WRONG_LENGTH); |
838 | 0 | goto err; |
839 | 0 | } else { |
840 | 0 | ASN1_BOOLEAN *tbool; |
841 | 0 | tbool = (ASN1_BOOLEAN *)pval; |
842 | 0 | *tbool = *cont; |
843 | 0 | } |
844 | 0 | break; |
845 | | |
846 | 0 | case V_ASN1_BIT_STRING: |
847 | 0 | if (!c2i_ASN1_BIT_STRING((ASN1_BIT_STRING **)pval, &cont, len)) |
848 | 0 | goto err; |
849 | 0 | break; |
850 | | |
851 | 0 | case V_ASN1_INTEGER: |
852 | 0 | case V_ASN1_ENUMERATED: |
853 | 0 | tint = (ASN1_INTEGER **)pval; |
854 | 0 | if (!c2i_ASN1_INTEGER(tint, &cont, len)) |
855 | 0 | goto err; |
856 | | /* Fixup type to match the expected form */ |
857 | 0 | (*tint)->type = utype | ((*tint)->type & V_ASN1_NEG); |
858 | 0 | break; |
859 | | |
860 | 0 | case V_ASN1_OCTET_STRING: |
861 | 0 | case V_ASN1_NUMERICSTRING: |
862 | 0 | case V_ASN1_PRINTABLESTRING: |
863 | 0 | case V_ASN1_T61STRING: |
864 | 0 | case V_ASN1_VIDEOTEXSTRING: |
865 | 0 | case V_ASN1_IA5STRING: |
866 | 0 | case V_ASN1_UTCTIME: |
867 | 0 | case V_ASN1_GENERALIZEDTIME: |
868 | 0 | case V_ASN1_GRAPHICSTRING: |
869 | 0 | case V_ASN1_VISIBLESTRING: |
870 | 0 | case V_ASN1_GENERALSTRING: |
871 | 0 | case V_ASN1_UNIVERSALSTRING: |
872 | 0 | case V_ASN1_BMPSTRING: |
873 | 0 | case V_ASN1_UTF8STRING: |
874 | 0 | case V_ASN1_OTHER: |
875 | 0 | case V_ASN1_SET: |
876 | 0 | case V_ASN1_SEQUENCE: |
877 | 0 | default: |
878 | 0 | if (utype == V_ASN1_BMPSTRING && (len & 1)) { |
879 | 0 | ASN1err(ASN1_F_ASN1_EX_C2I, ASN1_R_BMPSTRING_IS_WRONG_LENGTH); |
880 | 0 | goto err; |
881 | 0 | } |
882 | 0 | if (utype == V_ASN1_UNIVERSALSTRING && (len & 3)) { |
883 | 0 | ASN1err(ASN1_F_ASN1_EX_C2I, |
884 | 0 | ASN1_R_UNIVERSALSTRING_IS_WRONG_LENGTH); |
885 | 0 | goto err; |
886 | 0 | } |
887 | | /* All based on ASN1_STRING and handled the same */ |
888 | 0 | if (!*pval) { |
889 | 0 | stmp = ASN1_STRING_type_new(utype); |
890 | 0 | if (stmp == NULL) { |
891 | 0 | ASN1err(ASN1_F_ASN1_EX_C2I, ERR_R_MALLOC_FAILURE); |
892 | 0 | goto err; |
893 | 0 | } |
894 | 0 | *pval = (ASN1_VALUE *)stmp; |
895 | 0 | } else { |
896 | 0 | stmp = (ASN1_STRING *)*pval; |
897 | 0 | stmp->type = utype; |
898 | 0 | } |
899 | | /* If we've already allocated a buffer use it */ |
900 | 0 | if (*free_cont) { |
901 | 0 | OPENSSL_free(stmp->data); |
902 | 0 | stmp->data = (unsigned char *)cont; /* UGLY CAST! RL */ |
903 | 0 | stmp->length = len; |
904 | 0 | *free_cont = 0; |
905 | 0 | } else { |
906 | 0 | if (!ASN1_STRING_set(stmp, cont, len)) { |
907 | 0 | ASN1err(ASN1_F_ASN1_EX_C2I, ERR_R_MALLOC_FAILURE); |
908 | 0 | ASN1_STRING_free(stmp); |
909 | 0 | *pval = NULL; |
910 | 0 | goto err; |
911 | 0 | } |
912 | 0 | } |
913 | 0 | break; |
914 | 0 | } |
915 | | /* If ASN1_ANY and NULL type fix up value */ |
916 | 0 | if (typ && (utype == V_ASN1_NULL)) |
917 | 0 | typ->value.ptr = NULL; |
918 | |
|
919 | 0 | ret = 1; |
920 | 0 | err: |
921 | 0 | if (!ret) { |
922 | 0 | ASN1_TYPE_free(typ); |
923 | 0 | if (opval) |
924 | 0 | *opval = NULL; |
925 | 0 | } |
926 | 0 | return ret; |
927 | 0 | } |
928 | | |
929 | | /* |
930 | | * This function finds the end of an ASN1 structure when passed its maximum |
931 | | * length, whether it is indefinite length and a pointer to the content. This |
932 | | * is more efficient than calling asn1_collect because it does not recurse on |
933 | | * each indefinite length header. |
934 | | */ |
935 | | |
936 | | static int asn1_find_end(const unsigned char **in, long len, char inf) |
937 | 0 | { |
938 | 0 | uint32_t expected_eoc; |
939 | 0 | long plen; |
940 | 0 | const unsigned char *p = *in, *q; |
941 | | /* If not indefinite length constructed just add length */ |
942 | 0 | if (inf == 0) { |
943 | 0 | *in += len; |
944 | 0 | return 1; |
945 | 0 | } |
946 | 0 | expected_eoc = 1; |
947 | | /* |
948 | | * Indefinite length constructed form. Find the end when enough EOCs are |
949 | | * found. If more indefinite length constructed headers are encountered |
950 | | * increment the expected eoc count otherwise just skip to the end of the |
951 | | * data. |
952 | | */ |
953 | 0 | while (len > 0) { |
954 | 0 | if (asn1_check_eoc(&p, len)) { |
955 | 0 | expected_eoc--; |
956 | 0 | if (expected_eoc == 0) |
957 | 0 | break; |
958 | 0 | len -= 2; |
959 | 0 | continue; |
960 | 0 | } |
961 | 0 | q = p; |
962 | | /* Just read in a header: only care about the length */ |
963 | 0 | if (!asn1_check_tlen(&plen, NULL, NULL, &inf, NULL, &p, len, |
964 | 0 | -1, 0, 0, NULL)) { |
965 | 0 | ASN1err(ASN1_F_ASN1_FIND_END, ERR_R_NESTED_ASN1_ERROR); |
966 | 0 | return 0; |
967 | 0 | } |
968 | 0 | if (inf) { |
969 | 0 | if (expected_eoc == UINT32_MAX) { |
970 | 0 | ASN1err(ASN1_F_ASN1_FIND_END, ERR_R_NESTED_ASN1_ERROR); |
971 | 0 | return 0; |
972 | 0 | } |
973 | 0 | expected_eoc++; |
974 | 0 | } else { |
975 | 0 | p += plen; |
976 | 0 | } |
977 | 0 | len -= p - q; |
978 | 0 | } |
979 | 0 | if (expected_eoc) { |
980 | 0 | ASN1err(ASN1_F_ASN1_FIND_END, ASN1_R_MISSING_EOC); |
981 | 0 | return 0; |
982 | 0 | } |
983 | 0 | *in = p; |
984 | 0 | return 1; |
985 | 0 | } |
986 | | |
987 | | /* |
988 | | * This function collects the asn1 data from a constructed string type into |
989 | | * a buffer. The values of 'in' and 'len' should refer to the contents of the |
990 | | * constructed type and 'inf' should be set if it is indefinite length. |
991 | | */ |
992 | | |
993 | | #ifndef ASN1_MAX_STRING_NEST |
994 | | /* |
995 | | * This determines how many levels of recursion are permitted in ASN1 string |
996 | | * types. If it is not limited stack overflows can occur. If set to zero no |
997 | | * recursion is allowed at all. Although zero should be adequate examples |
998 | | * exist that require a value of 1. So 5 should be more than enough. |
999 | | */ |
1000 | 0 | # define ASN1_MAX_STRING_NEST 5 |
1001 | | #endif |
1002 | | |
1003 | | static int asn1_collect(BUF_MEM *buf, const unsigned char **in, long len, |
1004 | | char inf, int tag, int aclass, int depth) |
1005 | 0 | { |
1006 | 0 | const unsigned char *p, *q; |
1007 | 0 | long plen; |
1008 | 0 | char cst, ininf; |
1009 | 0 | p = *in; |
1010 | 0 | inf &= 1; |
1011 | | /* |
1012 | | * If no buffer and not indefinite length constructed just pass over the |
1013 | | * encoded data |
1014 | | */ |
1015 | 0 | if (!buf && !inf) { |
1016 | 0 | *in += len; |
1017 | 0 | return 1; |
1018 | 0 | } |
1019 | 0 | while (len > 0) { |
1020 | 0 | q = p; |
1021 | | /* Check for EOC */ |
1022 | 0 | if (asn1_check_eoc(&p, len)) { |
1023 | | /* |
1024 | | * EOC is illegal outside indefinite length constructed form |
1025 | | */ |
1026 | 0 | if (!inf) { |
1027 | 0 | ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_UNEXPECTED_EOC); |
1028 | 0 | return 0; |
1029 | 0 | } |
1030 | 0 | inf = 0; |
1031 | 0 | break; |
1032 | 0 | } |
1033 | | |
1034 | 0 | if (!asn1_check_tlen(&plen, NULL, NULL, &ininf, &cst, &p, |
1035 | 0 | len, tag, aclass, 0, NULL)) { |
1036 | 0 | ASN1err(ASN1_F_ASN1_COLLECT, ERR_R_NESTED_ASN1_ERROR); |
1037 | 0 | return 0; |
1038 | 0 | } |
1039 | | |
1040 | | /* If indefinite length constructed update max length */ |
1041 | 0 | if (cst) { |
1042 | 0 | if (depth >= ASN1_MAX_STRING_NEST) { |
1043 | 0 | ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_NESTED_ASN1_STRING); |
1044 | 0 | return 0; |
1045 | 0 | } |
1046 | 0 | if (!asn1_collect(buf, &p, plen, ininf, tag, aclass, depth + 1)) |
1047 | 0 | return 0; |
1048 | 0 | } else if (plen && !collect_data(buf, &p, plen)) |
1049 | 0 | return 0; |
1050 | 0 | len -= p - q; |
1051 | 0 | } |
1052 | 0 | if (inf) { |
1053 | 0 | ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_MISSING_EOC); |
1054 | 0 | return 0; |
1055 | 0 | } |
1056 | 0 | *in = p; |
1057 | 0 | return 1; |
1058 | 0 | } |
1059 | | |
1060 | | static int collect_data(BUF_MEM *buf, const unsigned char **p, long plen) |
1061 | 0 | { |
1062 | 0 | int len; |
1063 | 0 | if (buf) { |
1064 | 0 | len = buf->length; |
1065 | 0 | if (!BUF_MEM_grow_clean(buf, len + plen)) { |
1066 | 0 | ASN1err(ASN1_F_COLLECT_DATA, ERR_R_MALLOC_FAILURE); |
1067 | 0 | return 0; |
1068 | 0 | } |
1069 | 0 | memcpy(buf->data + len, *p, plen); |
1070 | 0 | } |
1071 | 0 | *p += plen; |
1072 | 0 | return 1; |
1073 | 0 | } |
1074 | | |
1075 | | /* Check for ASN1 EOC and swallow it if found */ |
1076 | | |
1077 | | static int asn1_check_eoc(const unsigned char **in, long len) |
1078 | 0 | { |
1079 | 0 | const unsigned char *p; |
1080 | 0 | if (len < 2) |
1081 | 0 | return 0; |
1082 | 0 | p = *in; |
1083 | 0 | if (!p[0] && !p[1]) { |
1084 | 0 | *in += 2; |
1085 | 0 | return 1; |
1086 | 0 | } |
1087 | 0 | return 0; |
1088 | 0 | } |
1089 | | |
1090 | | /* |
1091 | | * Check an ASN1 tag and length: a bit like ASN1_get_object but it sets the |
1092 | | * length for indefinite length constructed form, we don't know the exact |
1093 | | * length but we can set an upper bound to the amount of data available minus |
1094 | | * the header length just read. |
1095 | | */ |
1096 | | |
1097 | | static int asn1_check_tlen(long *olen, int *otag, unsigned char *oclass, |
1098 | | char *inf, char *cst, |
1099 | | const unsigned char **in, long len, |
1100 | | int exptag, int expclass, char opt, ASN1_TLC *ctx) |
1101 | 0 | { |
1102 | 0 | int i; |
1103 | 0 | int ptag, pclass; |
1104 | 0 | long plen; |
1105 | 0 | const unsigned char *p, *q; |
1106 | 0 | p = *in; |
1107 | 0 | q = p; |
1108 | |
|
1109 | 0 | if (ctx && ctx->valid) { |
1110 | 0 | i = ctx->ret; |
1111 | 0 | plen = ctx->plen; |
1112 | 0 | pclass = ctx->pclass; |
1113 | 0 | ptag = ctx->ptag; |
1114 | 0 | p += ctx->hdrlen; |
1115 | 0 | } else { |
1116 | 0 | i = ASN1_get_object(&p, &plen, &ptag, &pclass, len); |
1117 | 0 | if (ctx) { |
1118 | 0 | ctx->ret = i; |
1119 | 0 | ctx->plen = plen; |
1120 | 0 | ctx->pclass = pclass; |
1121 | 0 | ctx->ptag = ptag; |
1122 | 0 | ctx->hdrlen = p - q; |
1123 | 0 | ctx->valid = 1; |
1124 | | /* |
1125 | | * If definite length, and no error, length + header can't exceed |
1126 | | * total amount of data available. |
1127 | | */ |
1128 | 0 | if (!(i & 0x81) && ((plen + ctx->hdrlen) > len)) { |
1129 | 0 | ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_TOO_LONG); |
1130 | 0 | asn1_tlc_clear(ctx); |
1131 | 0 | return 0; |
1132 | 0 | } |
1133 | 0 | } |
1134 | 0 | } |
1135 | | |
1136 | 0 | if (i & 0x80) { |
1137 | 0 | ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_BAD_OBJECT_HEADER); |
1138 | 0 | asn1_tlc_clear(ctx); |
1139 | 0 | return 0; |
1140 | 0 | } |
1141 | 0 | if (exptag >= 0) { |
1142 | 0 | if ((exptag != ptag) || (expclass != pclass)) { |
1143 | | /* |
1144 | | * If type is OPTIONAL, not an error: indicate missing type. |
1145 | | */ |
1146 | 0 | if (opt) |
1147 | 0 | return -1; |
1148 | 0 | asn1_tlc_clear(ctx); |
1149 | 0 | ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_WRONG_TAG); |
1150 | 0 | return 0; |
1151 | 0 | } |
1152 | | /* |
1153 | | * We have a tag and class match: assume we are going to do something |
1154 | | * with it |
1155 | | */ |
1156 | 0 | asn1_tlc_clear(ctx); |
1157 | 0 | } |
1158 | | |
1159 | 0 | if (i & 1) |
1160 | 0 | plen = len - (p - q); |
1161 | |
|
1162 | 0 | if (inf) |
1163 | 0 | *inf = i & 1; |
1164 | |
|
1165 | 0 | if (cst) |
1166 | 0 | *cst = i & V_ASN1_CONSTRUCTED; |
1167 | |
|
1168 | 0 | if (olen) |
1169 | 0 | *olen = plen; |
1170 | |
|
1171 | 0 | if (oclass) |
1172 | 0 | *oclass = pclass; |
1173 | |
|
1174 | 0 | if (otag) |
1175 | 0 | *otag = ptag; |
1176 | |
|
1177 | 0 | *in = p; |
1178 | 0 | return 1; |
1179 | 0 | } |