|
sl@0
|
1 |
/* tasn_dec.c */
|
|
sl@0
|
2 |
/* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL
|
|
sl@0
|
3 |
* project 2000.
|
|
sl@0
|
4 |
*/
|
|
sl@0
|
5 |
/* ====================================================================
|
|
sl@0
|
6 |
* Copyright (c) 2000-2005 The OpenSSL Project. All rights reserved.
|
|
sl@0
|
7 |
*
|
|
sl@0
|
8 |
* Redistribution and use in source and binary forms, with or without
|
|
sl@0
|
9 |
* modification, are permitted provided that the following conditions
|
|
sl@0
|
10 |
* are met:
|
|
sl@0
|
11 |
*
|
|
sl@0
|
12 |
* 1. Redistributions of source code must retain the above copyright
|
|
sl@0
|
13 |
* notice, this list of conditions and the following disclaimer.
|
|
sl@0
|
14 |
*
|
|
sl@0
|
15 |
* 2. Redistributions in binary form must reproduce the above copyright
|
|
sl@0
|
16 |
* notice, this list of conditions and the following disclaimer in
|
|
sl@0
|
17 |
* the documentation and/or other materials provided with the
|
|
sl@0
|
18 |
* distribution.
|
|
sl@0
|
19 |
*
|
|
sl@0
|
20 |
* 3. All advertising materials mentioning features or use of this
|
|
sl@0
|
21 |
* software must display the following acknowledgment:
|
|
sl@0
|
22 |
* "This product includes software developed by the OpenSSL Project
|
|
sl@0
|
23 |
* for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
|
|
sl@0
|
24 |
*
|
|
sl@0
|
25 |
* 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
|
|
sl@0
|
26 |
* endorse or promote products derived from this software without
|
|
sl@0
|
27 |
* prior written permission. For written permission, please contact
|
|
sl@0
|
28 |
* licensing@OpenSSL.org.
|
|
sl@0
|
29 |
*
|
|
sl@0
|
30 |
* 5. Products derived from this software may not be called "OpenSSL"
|
|
sl@0
|
31 |
* nor may "OpenSSL" appear in their names without prior written
|
|
sl@0
|
32 |
* permission of the OpenSSL Project.
|
|
sl@0
|
33 |
*
|
|
sl@0
|
34 |
* 6. Redistributions of any form whatsoever must retain the following
|
|
sl@0
|
35 |
* acknowledgment:
|
|
sl@0
|
36 |
* "This product includes software developed by the OpenSSL Project
|
|
sl@0
|
37 |
* for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
|
|
sl@0
|
38 |
*
|
|
sl@0
|
39 |
* THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
|
|
sl@0
|
40 |
* EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
sl@0
|
41 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
sl@0
|
42 |
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
|
|
sl@0
|
43 |
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
sl@0
|
44 |
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
sl@0
|
45 |
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
sl@0
|
46 |
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
sl@0
|
47 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
sl@0
|
48 |
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
sl@0
|
49 |
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
|
|
sl@0
|
50 |
* OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
sl@0
|
51 |
* ====================================================================
|
|
sl@0
|
52 |
*
|
|
sl@0
|
53 |
* This product includes cryptographic software written by Eric Young
|
|
sl@0
|
54 |
* (eay@cryptsoft.com). This product includes software written by Tim
|
|
sl@0
|
55 |
* Hudson (tjh@cryptsoft.com).
|
|
sl@0
|
56 |
*
|
|
sl@0
|
57 |
*/
|
|
sl@0
|
58 |
/*
|
|
sl@0
|
59 |
© Portions copyright (c) 2006 Nokia Corporation. All rights reserved.
|
|
sl@0
|
60 |
*/
|
|
sl@0
|
61 |
|
|
sl@0
|
62 |
|
|
sl@0
|
63 |
#include <stddef.h>
|
|
sl@0
|
64 |
#include <string.h>
|
|
sl@0
|
65 |
#include <openssl/asn1.h>
|
|
sl@0
|
66 |
#include <openssl/asn1t.h>
|
|
sl@0
|
67 |
#include <openssl/objects.h>
|
|
sl@0
|
68 |
#include <openssl/buffer.h>
|
|
sl@0
|
69 |
#include <openssl/err.h>
|
|
sl@0
|
70 |
#if (defined(SYMBIAN) && (defined(__WINSCW__) || defined(__WINS__)))
|
|
sl@0
|
71 |
#include "libcrypto_wsd_macros.h"
|
|
sl@0
|
72 |
#include "libcrypto_wsd.h"
|
|
sl@0
|
73 |
#endif
|
|
sl@0
|
74 |
|
|
sl@0
|
75 |
|
|
sl@0
|
76 |
|
|
sl@0
|
77 |
static int asn1_check_eoc(const unsigned char **in, long len);
|
|
sl@0
|
78 |
static int asn1_find_end(const unsigned char **in, long len, char inf);
|
|
sl@0
|
79 |
|
|
sl@0
|
80 |
static int asn1_collect(BUF_MEM *buf, const unsigned char **in, long len,
|
|
sl@0
|
81 |
char inf, int tag, int aclass);
|
|
sl@0
|
82 |
|
|
sl@0
|
83 |
static int collect_data(BUF_MEM *buf, const unsigned char **p, long plen);
|
|
sl@0
|
84 |
|
|
sl@0
|
85 |
static int asn1_check_tlen(long *olen, int *otag, unsigned char *oclass,
|
|
sl@0
|
86 |
char *inf, char *cst,
|
|
sl@0
|
87 |
const unsigned char **in, long len,
|
|
sl@0
|
88 |
int exptag, int expclass, char opt,
|
|
sl@0
|
89 |
ASN1_TLC *ctx);
|
|
sl@0
|
90 |
|
|
sl@0
|
91 |
static int asn1_template_ex_d2i(ASN1_VALUE **pval,
|
|
sl@0
|
92 |
const unsigned char **in, long len,
|
|
sl@0
|
93 |
const ASN1_TEMPLATE *tt, char opt,
|
|
sl@0
|
94 |
ASN1_TLC *ctx);
|
|
sl@0
|
95 |
static int asn1_template_noexp_d2i(ASN1_VALUE **val,
|
|
sl@0
|
96 |
const unsigned char **in, long len,
|
|
sl@0
|
97 |
const ASN1_TEMPLATE *tt, char opt,
|
|
sl@0
|
98 |
ASN1_TLC *ctx);
|
|
sl@0
|
99 |
static int asn1_d2i_ex_primitive(ASN1_VALUE **pval,
|
|
sl@0
|
100 |
const unsigned char **in, long len,
|
|
sl@0
|
101 |
const ASN1_ITEM *it,
|
|
sl@0
|
102 |
int tag, int aclass, char opt, ASN1_TLC *ctx);
|
|
sl@0
|
103 |
|
|
sl@0
|
104 |
/* Table to convert tags to bit values, used for MSTRING type */
|
|
sl@0
|
105 |
#ifndef EMULATOR
|
|
sl@0
|
106 |
static unsigned long tag2bit[32] = {
|
|
sl@0
|
107 |
0, 0, 0, B_ASN1_BIT_STRING, /* tags 0 - 3 */
|
|
sl@0
|
108 |
B_ASN1_OCTET_STRING, 0, 0, B_ASN1_UNKNOWN,/* tags 4- 7 */
|
|
sl@0
|
109 |
B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN,/* tags 8-11 */
|
|
sl@0
|
110 |
B_ASN1_UTF8STRING,B_ASN1_UNKNOWN,B_ASN1_UNKNOWN,B_ASN1_UNKNOWN,/* tags 12-15 */
|
|
sl@0
|
111 |
B_ASN1_SEQUENCE,0,B_ASN1_NUMERICSTRING,B_ASN1_PRINTABLESTRING, /* tags 16-19 */
|
|
sl@0
|
112 |
B_ASN1_T61STRING,B_ASN1_VIDEOTEXSTRING,B_ASN1_IA5STRING, /* tags 20-22 */
|
|
sl@0
|
113 |
B_ASN1_UTCTIME, B_ASN1_GENERALIZEDTIME, /* tags 23-24 */
|
|
sl@0
|
114 |
B_ASN1_GRAPHICSTRING,B_ASN1_ISO64STRING,B_ASN1_GENERALSTRING, /* tags 25-27 */
|
|
sl@0
|
115 |
B_ASN1_UNIVERSALSTRING,B_ASN1_UNKNOWN,B_ASN1_BMPSTRING,B_ASN1_UNKNOWN, /* tags 28-31 */
|
|
sl@0
|
116 |
};
|
|
sl@0
|
117 |
#else
|
|
sl@0
|
118 |
static const unsigned long tag2bit[32] = {
|
|
sl@0
|
119 |
0, 0, 0, B_ASN1_BIT_STRING, /* tags 0 - 3 */
|
|
sl@0
|
120 |
B_ASN1_OCTET_STRING, 0, 0, B_ASN1_UNKNOWN,/* tags 4- 7 */
|
|
sl@0
|
121 |
B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN,/* tags 8-11 */
|
|
sl@0
|
122 |
B_ASN1_UTF8STRING,B_ASN1_UNKNOWN,B_ASN1_UNKNOWN,B_ASN1_UNKNOWN,/* tags 12-15 */
|
|
sl@0
|
123 |
B_ASN1_SEQUENCE,0,B_ASN1_NUMERICSTRING,B_ASN1_PRINTABLESTRING, /* tags 16-19 */
|
|
sl@0
|
124 |
B_ASN1_T61STRING,B_ASN1_VIDEOTEXSTRING,B_ASN1_IA5STRING, /* tags 20-22 */
|
|
sl@0
|
125 |
B_ASN1_UTCTIME, B_ASN1_GENERALIZEDTIME, /* tags 23-24 */
|
|
sl@0
|
126 |
B_ASN1_GRAPHICSTRING,B_ASN1_ISO64STRING,B_ASN1_GENERALSTRING, /* tags 25-27 */
|
|
sl@0
|
127 |
B_ASN1_UNIVERSALSTRING,B_ASN1_UNKNOWN,B_ASN1_BMPSTRING,B_ASN1_UNKNOWN, /* tags 28-31 */
|
|
sl@0
|
128 |
};
|
|
sl@0
|
129 |
#endif
|
|
sl@0
|
130 |
EXPORT_C unsigned long ASN1_tag2bit(int tag)
|
|
sl@0
|
131 |
{
|
|
sl@0
|
132 |
if ((tag < 0) || (tag > 30)) return 0;
|
|
sl@0
|
133 |
return tag2bit[tag];
|
|
sl@0
|
134 |
}
|
|
sl@0
|
135 |
|
|
sl@0
|
136 |
/* Macro to initialize and invalidate the cache */
|
|
sl@0
|
137 |
|
|
sl@0
|
138 |
#define asn1_tlc_clear(c) if (c) (c)->valid = 0
|
|
sl@0
|
139 |
|
|
sl@0
|
140 |
/* Decode an ASN1 item, this currently behaves just
|
|
sl@0
|
141 |
* like a standard 'd2i' function. 'in' points to
|
|
sl@0
|
142 |
* a buffer to read the data from, in future we will
|
|
sl@0
|
143 |
* have more advanced versions that can input data
|
|
sl@0
|
144 |
* a piece at a time and this will simply be a special
|
|
sl@0
|
145 |
* case.
|
|
sl@0
|
146 |
*/
|
|
sl@0
|
147 |
|
|
sl@0
|
148 |
EXPORT_C ASN1_VALUE *ASN1_item_d2i(ASN1_VALUE **pval,
|
|
sl@0
|
149 |
const unsigned char **in, long len, const ASN1_ITEM *it)
|
|
sl@0
|
150 |
{
|
|
sl@0
|
151 |
ASN1_TLC c;
|
|
sl@0
|
152 |
ASN1_VALUE *ptmpval = NULL;
|
|
sl@0
|
153 |
if (!pval)
|
|
sl@0
|
154 |
pval = &ptmpval;
|
|
sl@0
|
155 |
c.valid = 0;
|
|
sl@0
|
156 |
if (ASN1_item_ex_d2i(pval, in, len, it, -1, 0, 0, &c) > 0)
|
|
sl@0
|
157 |
return *pval;
|
|
sl@0
|
158 |
return NULL;
|
|
sl@0
|
159 |
}
|
|
sl@0
|
160 |
|
|
sl@0
|
161 |
EXPORT_C int ASN1_template_d2i(ASN1_VALUE **pval,
|
|
sl@0
|
162 |
const unsigned char **in, long len, const ASN1_TEMPLATE *tt)
|
|
sl@0
|
163 |
{
|
|
sl@0
|
164 |
ASN1_TLC c;
|
|
sl@0
|
165 |
c.valid = 0;
|
|
sl@0
|
166 |
return asn1_template_ex_d2i(pval, in, len, tt, 0, &c);
|
|
sl@0
|
167 |
}
|
|
sl@0
|
168 |
|
|
sl@0
|
169 |
|
|
sl@0
|
170 |
/* Decode an item, taking care of IMPLICIT tagging, if any.
|
|
sl@0
|
171 |
* If 'opt' set and tag mismatch return -1 to handle OPTIONAL
|
|
sl@0
|
172 |
*/
|
|
sl@0
|
173 |
|
|
sl@0
|
174 |
EXPORT_C int ASN1_item_ex_d2i(ASN1_VALUE **pval, const unsigned char **in, long len,
|
|
sl@0
|
175 |
const ASN1_ITEM *it,
|
|
sl@0
|
176 |
int tag, int aclass, char opt, ASN1_TLC *ctx)
|
|
sl@0
|
177 |
{
|
|
sl@0
|
178 |
const ASN1_TEMPLATE *tt, *errtt = NULL;
|
|
sl@0
|
179 |
const ASN1_COMPAT_FUNCS *cf;
|
|
sl@0
|
180 |
const ASN1_EXTERN_FUNCS *ef;
|
|
sl@0
|
181 |
const ASN1_AUX *aux = it->funcs;
|
|
sl@0
|
182 |
ASN1_aux_cb *asn1_cb;
|
|
sl@0
|
183 |
const unsigned char *p=NULL, *q;
|
|
sl@0
|
184 |
unsigned char *wp=NULL; /* BIG FAT WARNING! BREAKS CONST WHERE USED */
|
|
sl@0
|
185 |
unsigned char imphack = 0, oclass;
|
|
sl@0
|
186 |
char seq_eoc, seq_nolen, cst, isopt;
|
|
sl@0
|
187 |
long tmplen;
|
|
sl@0
|
188 |
int i;
|
|
sl@0
|
189 |
int otag;
|
|
sl@0
|
190 |
int ret = 0;
|
|
sl@0
|
191 |
ASN1_VALUE *pchval, **pchptr, *ptmpval;
|
|
sl@0
|
192 |
if (!pval)
|
|
sl@0
|
193 |
return 0;
|
|
sl@0
|
194 |
if (aux && aux->asn1_cb)
|
|
sl@0
|
195 |
asn1_cb = aux->asn1_cb;
|
|
sl@0
|
196 |
else asn1_cb = 0;
|
|
sl@0
|
197 |
|
|
sl@0
|
198 |
switch(it->itype)
|
|
sl@0
|
199 |
{
|
|
sl@0
|
200 |
case ASN1_ITYPE_PRIMITIVE:
|
|
sl@0
|
201 |
if (it->templates)
|
|
sl@0
|
202 |
{
|
|
sl@0
|
203 |
/* tagging or OPTIONAL is currently illegal on an item
|
|
sl@0
|
204 |
* template because the flags can't get passed down.
|
|
sl@0
|
205 |
* In practice this isn't a problem: we include the
|
|
sl@0
|
206 |
* relevant flags from the item template in the
|
|
sl@0
|
207 |
* template itself.
|
|
sl@0
|
208 |
*/
|
|
sl@0
|
209 |
if ((tag != -1) || opt)
|
|
sl@0
|
210 |
{
|
|
sl@0
|
211 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
|
|
sl@0
|
212 |
ASN1_R_ILLEGAL_OPTIONS_ON_ITEM_TEMPLATE);
|
|
sl@0
|
213 |
goto err;
|
|
sl@0
|
214 |
}
|
|
sl@0
|
215 |
return asn1_template_ex_d2i(pval, in, len,
|
|
sl@0
|
216 |
it->templates, opt, ctx);
|
|
sl@0
|
217 |
}
|
|
sl@0
|
218 |
return asn1_d2i_ex_primitive(pval, in, len, it,
|
|
sl@0
|
219 |
tag, aclass, opt, ctx);
|
|
sl@0
|
220 |
break;
|
|
sl@0
|
221 |
|
|
sl@0
|
222 |
case ASN1_ITYPE_MSTRING:
|
|
sl@0
|
223 |
p = *in;
|
|
sl@0
|
224 |
/* Just read in tag and class */
|
|
sl@0
|
225 |
ret = asn1_check_tlen(NULL, &otag, &oclass, NULL, NULL,
|
|
sl@0
|
226 |
&p, len, -1, 0, 1, ctx);
|
|
sl@0
|
227 |
if (!ret)
|
|
sl@0
|
228 |
{
|
|
sl@0
|
229 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
|
|
sl@0
|
230 |
ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
231 |
goto err;
|
|
sl@0
|
232 |
}
|
|
sl@0
|
233 |
|
|
sl@0
|
234 |
/* Must be UNIVERSAL class */
|
|
sl@0
|
235 |
if (oclass != V_ASN1_UNIVERSAL)
|
|
sl@0
|
236 |
{
|
|
sl@0
|
237 |
/* If OPTIONAL, assume this is OK */
|
|
sl@0
|
238 |
if (opt) return -1;
|
|
sl@0
|
239 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
|
|
sl@0
|
240 |
ASN1_R_MSTRING_NOT_UNIVERSAL);
|
|
sl@0
|
241 |
goto err;
|
|
sl@0
|
242 |
}
|
|
sl@0
|
243 |
/* Check tag matches bit map */
|
|
sl@0
|
244 |
if (!(ASN1_tag2bit(otag) & it->utype))
|
|
sl@0
|
245 |
{
|
|
sl@0
|
246 |
/* If OPTIONAL, assume this is OK */
|
|
sl@0
|
247 |
if (opt)
|
|
sl@0
|
248 |
return -1;
|
|
sl@0
|
249 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
|
|
sl@0
|
250 |
ASN1_R_MSTRING_WRONG_TAG);
|
|
sl@0
|
251 |
goto err;
|
|
sl@0
|
252 |
}
|
|
sl@0
|
253 |
return asn1_d2i_ex_primitive(pval, in, len,
|
|
sl@0
|
254 |
it, otag, 0, 0, ctx);
|
|
sl@0
|
255 |
|
|
sl@0
|
256 |
case ASN1_ITYPE_EXTERN:
|
|
sl@0
|
257 |
/* Use new style d2i */
|
|
sl@0
|
258 |
ef = it->funcs;
|
|
sl@0
|
259 |
return ef->asn1_ex_d2i(pval, in, len,
|
|
sl@0
|
260 |
it, tag, aclass, opt, ctx);
|
|
sl@0
|
261 |
|
|
sl@0
|
262 |
case ASN1_ITYPE_COMPAT:
|
|
sl@0
|
263 |
/* we must resort to old style evil hackery */
|
|
sl@0
|
264 |
cf = it->funcs;
|
|
sl@0
|
265 |
|
|
sl@0
|
266 |
/* If OPTIONAL see if it is there */
|
|
sl@0
|
267 |
if (opt)
|
|
sl@0
|
268 |
{
|
|
sl@0
|
269 |
int exptag;
|
|
sl@0
|
270 |
p = *in;
|
|
sl@0
|
271 |
if (tag == -1)
|
|
sl@0
|
272 |
exptag = it->utype;
|
|
sl@0
|
273 |
else exptag = tag;
|
|
sl@0
|
274 |
/* Don't care about anything other than presence
|
|
sl@0
|
275 |
* of expected tag */
|
|
sl@0
|
276 |
|
|
sl@0
|
277 |
ret = asn1_check_tlen(NULL, NULL, NULL, NULL, NULL,
|
|
sl@0
|
278 |
&p, len, exptag, aclass, 1, ctx);
|
|
sl@0
|
279 |
if (!ret)
|
|
sl@0
|
280 |
{
|
|
sl@0
|
281 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
|
|
sl@0
|
282 |
ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
283 |
goto err;
|
|
sl@0
|
284 |
}
|
|
sl@0
|
285 |
if (ret == -1)
|
|
sl@0
|
286 |
return -1;
|
|
sl@0
|
287 |
}
|
|
sl@0
|
288 |
|
|
sl@0
|
289 |
/* This is the old style evil hack IMPLICIT handling:
|
|
sl@0
|
290 |
* since the underlying code is expecting a tag and
|
|
sl@0
|
291 |
* class other than the one present we change the
|
|
sl@0
|
292 |
* buffer temporarily then change it back afterwards.
|
|
sl@0
|
293 |
* This doesn't and never did work for tags > 30.
|
|
sl@0
|
294 |
*
|
|
sl@0
|
295 |
* Yes this is *horrible* but it is only needed for
|
|
sl@0
|
296 |
* old style d2i which will hopefully not be around
|
|
sl@0
|
297 |
* for much longer.
|
|
sl@0
|
298 |
* FIXME: should copy the buffer then modify it so
|
|
sl@0
|
299 |
* the input buffer can be const: we should *always*
|
|
sl@0
|
300 |
* copy because the old style d2i might modify the
|
|
sl@0
|
301 |
* buffer.
|
|
sl@0
|
302 |
*/
|
|
sl@0
|
303 |
|
|
sl@0
|
304 |
if (tag != -1)
|
|
sl@0
|
305 |
{
|
|
sl@0
|
306 |
wp = *(unsigned char **)in;
|
|
sl@0
|
307 |
imphack = *wp;
|
|
sl@0
|
308 |
if (p == NULL)
|
|
sl@0
|
309 |
{
|
|
sl@0
|
310 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
|
|
sl@0
|
311 |
ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
312 |
goto err;
|
|
sl@0
|
313 |
}
|
|
sl@0
|
314 |
|
|
sl@0
|
315 |
*wp = (unsigned char)((*p & V_ASN1_CONSTRUCTED)
|
|
sl@0
|
316 |
| it->utype);
|
|
sl@0
|
317 |
}
|
|
sl@0
|
318 |
|
|
sl@0
|
319 |
ptmpval = cf->asn1_d2i(pval, in, len);
|
|
sl@0
|
320 |
|
|
sl@0
|
321 |
if (tag != -1)
|
|
sl@0
|
322 |
*wp = imphack;
|
|
sl@0
|
323 |
|
|
sl@0
|
324 |
if (ptmpval)
|
|
sl@0
|
325 |
return 1;
|
|
sl@0
|
326 |
|
|
sl@0
|
327 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
328 |
goto err;
|
|
sl@0
|
329 |
|
|
sl@0
|
330 |
|
|
sl@0
|
331 |
case ASN1_ITYPE_CHOICE:
|
|
sl@0
|
332 |
if (asn1_cb && !asn1_cb(ASN1_OP_D2I_PRE, pval, it))
|
|
sl@0
|
333 |
goto auxerr;
|
|
sl@0
|
334 |
|
|
sl@0
|
335 |
/* Allocate structure */
|
|
sl@0
|
336 |
if (!*pval && !ASN1_item_ex_new(pval, it))
|
|
sl@0
|
337 |
{
|
|
sl@0
|
338 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
|
|
sl@0
|
339 |
ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
340 |
goto err;
|
|
sl@0
|
341 |
}
|
|
sl@0
|
342 |
/* CHOICE type, try each possibility in turn */
|
|
sl@0
|
343 |
pchval = NULL;
|
|
sl@0
|
344 |
p = *in;
|
|
sl@0
|
345 |
for (i = 0, tt=it->templates; i < it->tcount; i++, tt++)
|
|
sl@0
|
346 |
{
|
|
sl@0
|
347 |
pchptr = asn1_get_field_ptr(pval, tt);
|
|
sl@0
|
348 |
/* We mark field as OPTIONAL so its absence
|
|
sl@0
|
349 |
* can be recognised.
|
|
sl@0
|
350 |
*/
|
|
sl@0
|
351 |
ret = asn1_template_ex_d2i(pchptr, &p, len, tt, 1, ctx);
|
|
sl@0
|
352 |
/* If field not present, try the next one */
|
|
sl@0
|
353 |
if (ret == -1)
|
|
sl@0
|
354 |
continue;
|
|
sl@0
|
355 |
/* If positive return, read OK, break loop */
|
|
sl@0
|
356 |
if (ret > 0)
|
|
sl@0
|
357 |
break;
|
|
sl@0
|
358 |
/* Otherwise must be an ASN1 parsing error */
|
|
sl@0
|
359 |
errtt = tt;
|
|
sl@0
|
360 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
|
|
sl@0
|
361 |
ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
362 |
goto err;
|
|
sl@0
|
363 |
}
|
|
sl@0
|
364 |
|
|
sl@0
|
365 |
/* Did we fall off the end without reading anything? */
|
|
sl@0
|
366 |
if (i == it->tcount)
|
|
sl@0
|
367 |
{
|
|
sl@0
|
368 |
/* If OPTIONAL, this is OK */
|
|
sl@0
|
369 |
if (opt)
|
|
sl@0
|
370 |
{
|
|
sl@0
|
371 |
/* Free and zero it */
|
|
sl@0
|
372 |
ASN1_item_ex_free(pval, it);
|
|
sl@0
|
373 |
return -1;
|
|
sl@0
|
374 |
}
|
|
sl@0
|
375 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
|
|
sl@0
|
376 |
ASN1_R_NO_MATCHING_CHOICE_TYPE);
|
|
sl@0
|
377 |
goto err;
|
|
sl@0
|
378 |
}
|
|
sl@0
|
379 |
|
|
sl@0
|
380 |
asn1_set_choice_selector(pval, i, it);
|
|
sl@0
|
381 |
*in = p;
|
|
sl@0
|
382 |
if (asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it))
|
|
sl@0
|
383 |
goto auxerr;
|
|
sl@0
|
384 |
return 1;
|
|
sl@0
|
385 |
|
|
sl@0
|
386 |
case ASN1_ITYPE_NDEF_SEQUENCE:
|
|
sl@0
|
387 |
case ASN1_ITYPE_SEQUENCE:
|
|
sl@0
|
388 |
p = *in;
|
|
sl@0
|
389 |
tmplen = len;
|
|
sl@0
|
390 |
|
|
sl@0
|
391 |
/* If no IMPLICIT tagging set to SEQUENCE, UNIVERSAL */
|
|
sl@0
|
392 |
if (tag == -1)
|
|
sl@0
|
393 |
{
|
|
sl@0
|
394 |
tag = V_ASN1_SEQUENCE;
|
|
sl@0
|
395 |
aclass = V_ASN1_UNIVERSAL;
|
|
sl@0
|
396 |
}
|
|
sl@0
|
397 |
/* Get SEQUENCE length and update len, p */
|
|
sl@0
|
398 |
ret = asn1_check_tlen(&len, NULL, NULL, &seq_eoc, &cst,
|
|
sl@0
|
399 |
&p, len, tag, aclass, opt, ctx);
|
|
sl@0
|
400 |
if (!ret)
|
|
sl@0
|
401 |
{
|
|
sl@0
|
402 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
|
|
sl@0
|
403 |
ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
404 |
goto err;
|
|
sl@0
|
405 |
}
|
|
sl@0
|
406 |
else if (ret == -1)
|
|
sl@0
|
407 |
return -1;
|
|
sl@0
|
408 |
if (aux && (aux->flags & ASN1_AFLG_BROKEN))
|
|
sl@0
|
409 |
{
|
|
sl@0
|
410 |
len = tmplen - (p - *in);
|
|
sl@0
|
411 |
seq_nolen = 1;
|
|
sl@0
|
412 |
}
|
|
sl@0
|
413 |
/* If indefinite we don't do a length check */
|
|
sl@0
|
414 |
else seq_nolen = seq_eoc;
|
|
sl@0
|
415 |
if (!cst)
|
|
sl@0
|
416 |
{
|
|
sl@0
|
417 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
|
|
sl@0
|
418 |
ASN1_R_SEQUENCE_NOT_CONSTRUCTED);
|
|
sl@0
|
419 |
goto err;
|
|
sl@0
|
420 |
}
|
|
sl@0
|
421 |
|
|
sl@0
|
422 |
if (!*pval && !ASN1_item_ex_new(pval, it))
|
|
sl@0
|
423 |
{
|
|
sl@0
|
424 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
|
|
sl@0
|
425 |
ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
426 |
goto err;
|
|
sl@0
|
427 |
}
|
|
sl@0
|
428 |
|
|
sl@0
|
429 |
if (asn1_cb && !asn1_cb(ASN1_OP_D2I_PRE, pval, it))
|
|
sl@0
|
430 |
goto auxerr;
|
|
sl@0
|
431 |
|
|
sl@0
|
432 |
/* Get each field entry */
|
|
sl@0
|
433 |
for (i = 0, tt = it->templates; i < it->tcount; i++, tt++)
|
|
sl@0
|
434 |
{
|
|
sl@0
|
435 |
const ASN1_TEMPLATE *seqtt;
|
|
sl@0
|
436 |
ASN1_VALUE **pseqval;
|
|
sl@0
|
437 |
seqtt = asn1_do_adb(pval, tt, 1);
|
|
sl@0
|
438 |
if (!seqtt)
|
|
sl@0
|
439 |
goto err;
|
|
sl@0
|
440 |
pseqval = asn1_get_field_ptr(pval, seqtt);
|
|
sl@0
|
441 |
/* Have we ran out of data? */
|
|
sl@0
|
442 |
if (!len)
|
|
sl@0
|
443 |
break;
|
|
sl@0
|
444 |
q = p;
|
|
sl@0
|
445 |
if (asn1_check_eoc(&p, len))
|
|
sl@0
|
446 |
{
|
|
sl@0
|
447 |
if (!seq_eoc)
|
|
sl@0
|
448 |
{
|
|
sl@0
|
449 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
|
|
sl@0
|
450 |
ASN1_R_UNEXPECTED_EOC);
|
|
sl@0
|
451 |
goto err;
|
|
sl@0
|
452 |
}
|
|
sl@0
|
453 |
len -= p - q;
|
|
sl@0
|
454 |
seq_eoc = 0;
|
|
sl@0
|
455 |
q = p;
|
|
sl@0
|
456 |
break;
|
|
sl@0
|
457 |
}
|
|
sl@0
|
458 |
/* This determines the OPTIONAL flag value. The field
|
|
sl@0
|
459 |
* cannot be omitted if it is the last of a SEQUENCE
|
|
sl@0
|
460 |
* and there is still data to be read. This isn't
|
|
sl@0
|
461 |
* strictly necessary but it increases efficiency in
|
|
sl@0
|
462 |
* some cases.
|
|
sl@0
|
463 |
*/
|
|
sl@0
|
464 |
if (i == (it->tcount - 1))
|
|
sl@0
|
465 |
isopt = 0;
|
|
sl@0
|
466 |
else isopt = (char)(seqtt->flags & ASN1_TFLG_OPTIONAL);
|
|
sl@0
|
467 |
/* attempt to read in field, allowing each to be
|
|
sl@0
|
468 |
* OPTIONAL */
|
|
sl@0
|
469 |
|
|
sl@0
|
470 |
ret = asn1_template_ex_d2i(pseqval, &p, len,
|
|
sl@0
|
471 |
seqtt, isopt, ctx);
|
|
sl@0
|
472 |
if (!ret)
|
|
sl@0
|
473 |
{
|
|
sl@0
|
474 |
errtt = seqtt;
|
|
sl@0
|
475 |
goto err;
|
|
sl@0
|
476 |
}
|
|
sl@0
|
477 |
else if (ret == -1)
|
|
sl@0
|
478 |
{
|
|
sl@0
|
479 |
/* OPTIONAL component absent.
|
|
sl@0
|
480 |
* Free and zero the field.
|
|
sl@0
|
481 |
*/
|
|
sl@0
|
482 |
ASN1_template_free(pseqval, seqtt);
|
|
sl@0
|
483 |
continue;
|
|
sl@0
|
484 |
}
|
|
sl@0
|
485 |
/* Update length */
|
|
sl@0
|
486 |
len -= p - q;
|
|
sl@0
|
487 |
}
|
|
sl@0
|
488 |
|
|
sl@0
|
489 |
/* Check for EOC if expecting one */
|
|
sl@0
|
490 |
if (seq_eoc && !asn1_check_eoc(&p, len))
|
|
sl@0
|
491 |
{
|
|
sl@0
|
492 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_MISSING_EOC);
|
|
sl@0
|
493 |
goto err;
|
|
sl@0
|
494 |
}
|
|
sl@0
|
495 |
/* Check all data read */
|
|
sl@0
|
496 |
if (!seq_nolen && len)
|
|
sl@0
|
497 |
{
|
|
sl@0
|
498 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
|
|
sl@0
|
499 |
ASN1_R_SEQUENCE_LENGTH_MISMATCH);
|
|
sl@0
|
500 |
goto err;
|
|
sl@0
|
501 |
}
|
|
sl@0
|
502 |
|
|
sl@0
|
503 |
/* If we get here we've got no more data in the SEQUENCE,
|
|
sl@0
|
504 |
* however we may not have read all fields so check all
|
|
sl@0
|
505 |
* remaining are OPTIONAL and clear any that are.
|
|
sl@0
|
506 |
*/
|
|
sl@0
|
507 |
for (; i < it->tcount; tt++, i++)
|
|
sl@0
|
508 |
{
|
|
sl@0
|
509 |
const ASN1_TEMPLATE *seqtt;
|
|
sl@0
|
510 |
seqtt = asn1_do_adb(pval, tt, 1);
|
|
sl@0
|
511 |
if (!seqtt)
|
|
sl@0
|
512 |
goto err;
|
|
sl@0
|
513 |
if (seqtt->flags & ASN1_TFLG_OPTIONAL)
|
|
sl@0
|
514 |
{
|
|
sl@0
|
515 |
ASN1_VALUE **pseqval;
|
|
sl@0
|
516 |
pseqval = asn1_get_field_ptr(pval, seqtt);
|
|
sl@0
|
517 |
ASN1_template_free(pseqval, seqtt);
|
|
sl@0
|
518 |
}
|
|
sl@0
|
519 |
else
|
|
sl@0
|
520 |
{
|
|
sl@0
|
521 |
errtt = seqtt;
|
|
sl@0
|
522 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I,
|
|
sl@0
|
523 |
ASN1_R_FIELD_MISSING);
|
|
sl@0
|
524 |
goto err;
|
|
sl@0
|
525 |
}
|
|
sl@0
|
526 |
}
|
|
sl@0
|
527 |
/* Save encoding */
|
|
sl@0
|
528 |
if (!asn1_enc_save(pval, *in, p - *in, it))
|
|
sl@0
|
529 |
goto auxerr;
|
|
sl@0
|
530 |
*in = p;
|
|
sl@0
|
531 |
if (asn1_cb && !asn1_cb(ASN1_OP_D2I_POST, pval, it))
|
|
sl@0
|
532 |
goto auxerr;
|
|
sl@0
|
533 |
return 1;
|
|
sl@0
|
534 |
|
|
sl@0
|
535 |
default:
|
|
sl@0
|
536 |
return 0;
|
|
sl@0
|
537 |
}
|
|
sl@0
|
538 |
auxerr:
|
|
sl@0
|
539 |
ASN1err(ASN1_F_ASN1_ITEM_EX_D2I, ASN1_R_AUX_ERROR);
|
|
sl@0
|
540 |
err:
|
|
sl@0
|
541 |
ASN1_item_ex_free(pval, it);
|
|
sl@0
|
542 |
if (errtt)
|
|
sl@0
|
543 |
ERR_add_error_data(4, "Field=", errtt->field_name,
|
|
sl@0
|
544 |
", Type=", it->sname);
|
|
sl@0
|
545 |
else
|
|
sl@0
|
546 |
ERR_add_error_data(2, "Type=", it->sname);
|
|
sl@0
|
547 |
return 0;
|
|
sl@0
|
548 |
}
|
|
sl@0
|
549 |
|
|
sl@0
|
550 |
/* Templates are handled with two separate functions.
|
|
sl@0
|
551 |
* One handles any EXPLICIT tag and the other handles the rest.
|
|
sl@0
|
552 |
*/
|
|
sl@0
|
553 |
|
|
sl@0
|
554 |
static int asn1_template_ex_d2i(ASN1_VALUE **val,
|
|
sl@0
|
555 |
const unsigned char **in, long inlen,
|
|
sl@0
|
556 |
const ASN1_TEMPLATE *tt, char opt,
|
|
sl@0
|
557 |
ASN1_TLC *ctx)
|
|
sl@0
|
558 |
{
|
|
sl@0
|
559 |
int flags, aclass;
|
|
sl@0
|
560 |
int ret;
|
|
sl@0
|
561 |
long len;
|
|
sl@0
|
562 |
const unsigned char *p, *q;
|
|
sl@0
|
563 |
char exp_eoc;
|
|
sl@0
|
564 |
if (!val)
|
|
sl@0
|
565 |
return 0;
|
|
sl@0
|
566 |
flags = tt->flags;
|
|
sl@0
|
567 |
aclass = flags & ASN1_TFLG_TAG_CLASS;
|
|
sl@0
|
568 |
|
|
sl@0
|
569 |
p = *in;
|
|
sl@0
|
570 |
|
|
sl@0
|
571 |
/* Check if EXPLICIT tag expected */
|
|
sl@0
|
572 |
if (flags & ASN1_TFLG_EXPTAG)
|
|
sl@0
|
573 |
{
|
|
sl@0
|
574 |
char cst;
|
|
sl@0
|
575 |
/* Need to work out amount of data available to the inner
|
|
sl@0
|
576 |
* content and where it starts: so read in EXPLICIT header to
|
|
sl@0
|
577 |
* get the info.
|
|
sl@0
|
578 |
*/
|
|
sl@0
|
579 |
ret = asn1_check_tlen(&len, NULL, NULL, &exp_eoc, &cst,
|
|
sl@0
|
580 |
&p, inlen, tt->tag, aclass, opt, ctx);
|
|
sl@0
|
581 |
q = p;
|
|
sl@0
|
582 |
if (!ret)
|
|
sl@0
|
583 |
{
|
|
sl@0
|
584 |
ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I,
|
|
sl@0
|
585 |
ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
586 |
return 0;
|
|
sl@0
|
587 |
}
|
|
sl@0
|
588 |
else if (ret == -1)
|
|
sl@0
|
589 |
return -1;
|
|
sl@0
|
590 |
if (!cst)
|
|
sl@0
|
591 |
{
|
|
sl@0
|
592 |
ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I,
|
|
sl@0
|
593 |
ASN1_R_EXPLICIT_TAG_NOT_CONSTRUCTED);
|
|
sl@0
|
594 |
return 0;
|
|
sl@0
|
595 |
}
|
|
sl@0
|
596 |
/* We've found the field so it can't be OPTIONAL now */
|
|
sl@0
|
597 |
ret = asn1_template_noexp_d2i(val, &p, len, tt, 0, ctx);
|
|
sl@0
|
598 |
if (!ret)
|
|
sl@0
|
599 |
{
|
|
sl@0
|
600 |
ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I,
|
|
sl@0
|
601 |
ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
602 |
return 0;
|
|
sl@0
|
603 |
}
|
|
sl@0
|
604 |
/* We read the field in OK so update length */
|
|
sl@0
|
605 |
len -= p - q;
|
|
sl@0
|
606 |
if (exp_eoc)
|
|
sl@0
|
607 |
{
|
|
sl@0
|
608 |
/* If NDEF we must have an EOC here */
|
|
sl@0
|
609 |
if (!asn1_check_eoc(&p, len))
|
|
sl@0
|
610 |
{
|
|
sl@0
|
611 |
ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I,
|
|
sl@0
|
612 |
ASN1_R_MISSING_EOC);
|
|
sl@0
|
613 |
goto err;
|
|
sl@0
|
614 |
}
|
|
sl@0
|
615 |
}
|
|
sl@0
|
616 |
else
|
|
sl@0
|
617 |
{
|
|
sl@0
|
618 |
/* Otherwise we must hit the EXPLICIT tag end or its
|
|
sl@0
|
619 |
* an error */
|
|
sl@0
|
620 |
if (len)
|
|
sl@0
|
621 |
{
|
|
sl@0
|
622 |
ASN1err(ASN1_F_ASN1_TEMPLATE_EX_D2I,
|
|
sl@0
|
623 |
ASN1_R_EXPLICIT_LENGTH_MISMATCH);
|
|
sl@0
|
624 |
goto err;
|
|
sl@0
|
625 |
}
|
|
sl@0
|
626 |
}
|
|
sl@0
|
627 |
}
|
|
sl@0
|
628 |
else
|
|
sl@0
|
629 |
return asn1_template_noexp_d2i(val, in, inlen,
|
|
sl@0
|
630 |
tt, opt, ctx);
|
|
sl@0
|
631 |
|
|
sl@0
|
632 |
*in = p;
|
|
sl@0
|
633 |
return 1;
|
|
sl@0
|
634 |
|
|
sl@0
|
635 |
err:
|
|
sl@0
|
636 |
ASN1_template_free(val, tt);
|
|
sl@0
|
637 |
*val = NULL;
|
|
sl@0
|
638 |
return 0;
|
|
sl@0
|
639 |
}
|
|
sl@0
|
640 |
|
|
sl@0
|
641 |
static int asn1_template_noexp_d2i(ASN1_VALUE **val,
|
|
sl@0
|
642 |
const unsigned char **in, long len,
|
|
sl@0
|
643 |
const ASN1_TEMPLATE *tt, char opt,
|
|
sl@0
|
644 |
ASN1_TLC *ctx)
|
|
sl@0
|
645 |
{
|
|
sl@0
|
646 |
int flags, aclass;
|
|
sl@0
|
647 |
int ret;
|
|
sl@0
|
648 |
const unsigned char *p, *q;
|
|
sl@0
|
649 |
if (!val)
|
|
sl@0
|
650 |
return 0;
|
|
sl@0
|
651 |
flags = tt->flags;
|
|
sl@0
|
652 |
aclass = flags & ASN1_TFLG_TAG_CLASS;
|
|
sl@0
|
653 |
|
|
sl@0
|
654 |
p = *in;
|
|
sl@0
|
655 |
q = p;
|
|
sl@0
|
656 |
|
|
sl@0
|
657 |
if (flags & ASN1_TFLG_SK_MASK)
|
|
sl@0
|
658 |
{
|
|
sl@0
|
659 |
/* SET OF, SEQUENCE OF */
|
|
sl@0
|
660 |
int sktag, skaclass;
|
|
sl@0
|
661 |
char sk_eoc;
|
|
sl@0
|
662 |
/* First work out expected inner tag value */
|
|
sl@0
|
663 |
if (flags & ASN1_TFLG_IMPTAG)
|
|
sl@0
|
664 |
{
|
|
sl@0
|
665 |
sktag = tt->tag;
|
|
sl@0
|
666 |
skaclass = aclass;
|
|
sl@0
|
667 |
}
|
|
sl@0
|
668 |
else
|
|
sl@0
|
669 |
{
|
|
sl@0
|
670 |
skaclass = V_ASN1_UNIVERSAL;
|
|
sl@0
|
671 |
if (flags & ASN1_TFLG_SET_OF)
|
|
sl@0
|
672 |
sktag = V_ASN1_SET;
|
|
sl@0
|
673 |
else
|
|
sl@0
|
674 |
sktag = V_ASN1_SEQUENCE;
|
|
sl@0
|
675 |
}
|
|
sl@0
|
676 |
/* Get the tag */
|
|
sl@0
|
677 |
ret = asn1_check_tlen(&len, NULL, NULL, &sk_eoc, NULL,
|
|
sl@0
|
678 |
&p, len, sktag, skaclass, opt, ctx);
|
|
sl@0
|
679 |
if (!ret)
|
|
sl@0
|
680 |
{
|
|
sl@0
|
681 |
ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I,
|
|
sl@0
|
682 |
ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
683 |
return 0;
|
|
sl@0
|
684 |
}
|
|
sl@0
|
685 |
else if (ret == -1)
|
|
sl@0
|
686 |
return -1;
|
|
sl@0
|
687 |
if (!*val)
|
|
sl@0
|
688 |
*val = (ASN1_VALUE *)sk_new_null();
|
|
sl@0
|
689 |
else
|
|
sl@0
|
690 |
{
|
|
sl@0
|
691 |
/* We've got a valid STACK: free up any items present */
|
|
sl@0
|
692 |
STACK *sktmp = (STACK *)*val;
|
|
sl@0
|
693 |
ASN1_VALUE *vtmp;
|
|
sl@0
|
694 |
while(sk_num(sktmp) > 0)
|
|
sl@0
|
695 |
{
|
|
sl@0
|
696 |
vtmp = (ASN1_VALUE *)sk_pop(sktmp);
|
|
sl@0
|
697 |
ASN1_item_ex_free(&vtmp,
|
|
sl@0
|
698 |
ASN1_ITEM_ptr(tt->item));
|
|
sl@0
|
699 |
}
|
|
sl@0
|
700 |
}
|
|
sl@0
|
701 |
|
|
sl@0
|
702 |
if (!*val)
|
|
sl@0
|
703 |
{
|
|
sl@0
|
704 |
ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I,
|
|
sl@0
|
705 |
ERR_R_MALLOC_FAILURE);
|
|
sl@0
|
706 |
goto err;
|
|
sl@0
|
707 |
}
|
|
sl@0
|
708 |
|
|
sl@0
|
709 |
/* Read as many items as we can */
|
|
sl@0
|
710 |
while(len > 0)
|
|
sl@0
|
711 |
{
|
|
sl@0
|
712 |
ASN1_VALUE *skfield;
|
|
sl@0
|
713 |
q = p;
|
|
sl@0
|
714 |
/* See if EOC found */
|
|
sl@0
|
715 |
if (asn1_check_eoc(&p, len))
|
|
sl@0
|
716 |
{
|
|
sl@0
|
717 |
if (!sk_eoc)
|
|
sl@0
|
718 |
{
|
|
sl@0
|
719 |
ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I,
|
|
sl@0
|
720 |
ASN1_R_UNEXPECTED_EOC);
|
|
sl@0
|
721 |
goto err;
|
|
sl@0
|
722 |
}
|
|
sl@0
|
723 |
len -= p - q;
|
|
sl@0
|
724 |
sk_eoc = 0;
|
|
sl@0
|
725 |
break;
|
|
sl@0
|
726 |
}
|
|
sl@0
|
727 |
skfield = NULL;
|
|
sl@0
|
728 |
if (!ASN1_item_ex_d2i(&skfield, &p, len,
|
|
sl@0
|
729 |
ASN1_ITEM_ptr(tt->item),
|
|
sl@0
|
730 |
-1, 0, 0, ctx))
|
|
sl@0
|
731 |
{
|
|
sl@0
|
732 |
ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I,
|
|
sl@0
|
733 |
ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
734 |
goto err;
|
|
sl@0
|
735 |
}
|
|
sl@0
|
736 |
len -= p - q;
|
|
sl@0
|
737 |
if (!sk_push((STACK *)*val, (char *)skfield))
|
|
sl@0
|
738 |
{
|
|
sl@0
|
739 |
ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I,
|
|
sl@0
|
740 |
ERR_R_MALLOC_FAILURE);
|
|
sl@0
|
741 |
goto err;
|
|
sl@0
|
742 |
}
|
|
sl@0
|
743 |
}
|
|
sl@0
|
744 |
if (sk_eoc)
|
|
sl@0
|
745 |
{
|
|
sl@0
|
746 |
ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I, ASN1_R_MISSING_EOC);
|
|
sl@0
|
747 |
goto err;
|
|
sl@0
|
748 |
}
|
|
sl@0
|
749 |
}
|
|
sl@0
|
750 |
else if (flags & ASN1_TFLG_IMPTAG)
|
|
sl@0
|
751 |
{
|
|
sl@0
|
752 |
/* IMPLICIT tagging */
|
|
sl@0
|
753 |
ret = ASN1_item_ex_d2i(val, &p, len,
|
|
sl@0
|
754 |
ASN1_ITEM_ptr(tt->item), tt->tag, aclass, opt, ctx);
|
|
sl@0
|
755 |
if (!ret)
|
|
sl@0
|
756 |
{
|
|
sl@0
|
757 |
ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I,
|
|
sl@0
|
758 |
ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
759 |
goto err;
|
|
sl@0
|
760 |
}
|
|
sl@0
|
761 |
else if (ret == -1)
|
|
sl@0
|
762 |
return -1;
|
|
sl@0
|
763 |
}
|
|
sl@0
|
764 |
else
|
|
sl@0
|
765 |
{
|
|
sl@0
|
766 |
/* Nothing special */
|
|
sl@0
|
767 |
ret = ASN1_item_ex_d2i(val, &p, len, ASN1_ITEM_ptr(tt->item),
|
|
sl@0
|
768 |
-1, 0, opt, ctx);
|
|
sl@0
|
769 |
if (!ret)
|
|
sl@0
|
770 |
{
|
|
sl@0
|
771 |
ASN1err(ASN1_F_ASN1_TEMPLATE_NOEXP_D2I,
|
|
sl@0
|
772 |
ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
773 |
goto err;
|
|
sl@0
|
774 |
}
|
|
sl@0
|
775 |
else if (ret == -1)
|
|
sl@0
|
776 |
return -1;
|
|
sl@0
|
777 |
}
|
|
sl@0
|
778 |
|
|
sl@0
|
779 |
*in = p;
|
|
sl@0
|
780 |
return 1;
|
|
sl@0
|
781 |
|
|
sl@0
|
782 |
err:
|
|
sl@0
|
783 |
ASN1_template_free(val, tt);
|
|
sl@0
|
784 |
*val = NULL;
|
|
sl@0
|
785 |
return 0;
|
|
sl@0
|
786 |
}
|
|
sl@0
|
787 |
|
|
sl@0
|
788 |
static int asn1_d2i_ex_primitive(ASN1_VALUE **pval,
|
|
sl@0
|
789 |
const unsigned char **in, long inlen,
|
|
sl@0
|
790 |
const ASN1_ITEM *it,
|
|
sl@0
|
791 |
int tag, int aclass, char opt, ASN1_TLC *ctx)
|
|
sl@0
|
792 |
{
|
|
sl@0
|
793 |
int ret = 0, utype;
|
|
sl@0
|
794 |
long plen;
|
|
sl@0
|
795 |
char cst, inf, free_cont = 0;
|
|
sl@0
|
796 |
const unsigned char *p;
|
|
sl@0
|
797 |
BUF_MEM buf;
|
|
sl@0
|
798 |
const unsigned char *cont = NULL;
|
|
sl@0
|
799 |
long len;
|
|
sl@0
|
800 |
if (!pval)
|
|
sl@0
|
801 |
{
|
|
sl@0
|
802 |
ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ASN1_R_ILLEGAL_NULL);
|
|
sl@0
|
803 |
return 0; /* Should never happen */
|
|
sl@0
|
804 |
}
|
|
sl@0
|
805 |
|
|
sl@0
|
806 |
if (it->itype == ASN1_ITYPE_MSTRING)
|
|
sl@0
|
807 |
{
|
|
sl@0
|
808 |
utype = tag;
|
|
sl@0
|
809 |
tag = -1;
|
|
sl@0
|
810 |
}
|
|
sl@0
|
811 |
else
|
|
sl@0
|
812 |
utype = it->utype;
|
|
sl@0
|
813 |
|
|
sl@0
|
814 |
if (utype == V_ASN1_ANY)
|
|
sl@0
|
815 |
{
|
|
sl@0
|
816 |
/* If type is ANY need to figure out type from tag */
|
|
sl@0
|
817 |
unsigned char oclass;
|
|
sl@0
|
818 |
if (tag >= 0)
|
|
sl@0
|
819 |
{
|
|
sl@0
|
820 |
ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE,
|
|
sl@0
|
821 |
ASN1_R_ILLEGAL_TAGGED_ANY);
|
|
sl@0
|
822 |
return 0;
|
|
sl@0
|
823 |
}
|
|
sl@0
|
824 |
if (opt)
|
|
sl@0
|
825 |
{
|
|
sl@0
|
826 |
ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE,
|
|
sl@0
|
827 |
ASN1_R_ILLEGAL_OPTIONAL_ANY);
|
|
sl@0
|
828 |
return 0;
|
|
sl@0
|
829 |
}
|
|
sl@0
|
830 |
p = *in;
|
|
sl@0
|
831 |
ret = asn1_check_tlen(NULL, &utype, &oclass, NULL, NULL,
|
|
sl@0
|
832 |
&p, inlen, -1, 0, 0, ctx);
|
|
sl@0
|
833 |
if (!ret)
|
|
sl@0
|
834 |
{
|
|
sl@0
|
835 |
ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE,
|
|
sl@0
|
836 |
ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
837 |
return 0;
|
|
sl@0
|
838 |
}
|
|
sl@0
|
839 |
if (oclass != V_ASN1_UNIVERSAL)
|
|
sl@0
|
840 |
utype = V_ASN1_OTHER;
|
|
sl@0
|
841 |
}
|
|
sl@0
|
842 |
if (tag == -1)
|
|
sl@0
|
843 |
{
|
|
sl@0
|
844 |
tag = utype;
|
|
sl@0
|
845 |
aclass = V_ASN1_UNIVERSAL;
|
|
sl@0
|
846 |
}
|
|
sl@0
|
847 |
p = *in;
|
|
sl@0
|
848 |
/* Check header */
|
|
sl@0
|
849 |
ret = asn1_check_tlen(&plen, NULL, NULL, &inf, &cst,
|
|
sl@0
|
850 |
&p, inlen, tag, aclass, opt, ctx);
|
|
sl@0
|
851 |
if (!ret)
|
|
sl@0
|
852 |
{
|
|
sl@0
|
853 |
ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE, ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
854 |
return 0;
|
|
sl@0
|
855 |
}
|
|
sl@0
|
856 |
else if (ret == -1)
|
|
sl@0
|
857 |
return -1;
|
|
sl@0
|
858 |
ret = 0;
|
|
sl@0
|
859 |
/* SEQUENCE, SET and "OTHER" are left in encoded form */
|
|
sl@0
|
860 |
if ((utype == V_ASN1_SEQUENCE)
|
|
sl@0
|
861 |
|| (utype == V_ASN1_SET) || (utype == V_ASN1_OTHER))
|
|
sl@0
|
862 |
{
|
|
sl@0
|
863 |
/* Clear context cache for type OTHER because the auto clear
|
|
sl@0
|
864 |
* when we have a exact match wont work
|
|
sl@0
|
865 |
*/
|
|
sl@0
|
866 |
if (utype == V_ASN1_OTHER)
|
|
sl@0
|
867 |
{
|
|
sl@0
|
868 |
asn1_tlc_clear(ctx);
|
|
sl@0
|
869 |
}
|
|
sl@0
|
870 |
/* SEQUENCE and SET must be constructed */
|
|
sl@0
|
871 |
else if (!cst)
|
|
sl@0
|
872 |
{
|
|
sl@0
|
873 |
ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE,
|
|
sl@0
|
874 |
ASN1_R_TYPE_NOT_CONSTRUCTED);
|
|
sl@0
|
875 |
return 0;
|
|
sl@0
|
876 |
}
|
|
sl@0
|
877 |
|
|
sl@0
|
878 |
cont = *in;
|
|
sl@0
|
879 |
/* If indefinite length constructed find the real end */
|
|
sl@0
|
880 |
if (inf)
|
|
sl@0
|
881 |
{
|
|
sl@0
|
882 |
if (!asn1_find_end(&p, plen, inf))
|
|
sl@0
|
883 |
goto err;
|
|
sl@0
|
884 |
len = p - cont;
|
|
sl@0
|
885 |
}
|
|
sl@0
|
886 |
else
|
|
sl@0
|
887 |
{
|
|
sl@0
|
888 |
len = p - cont + plen;
|
|
sl@0
|
889 |
p += plen;
|
|
sl@0
|
890 |
buf.data = NULL;
|
|
sl@0
|
891 |
}
|
|
sl@0
|
892 |
}
|
|
sl@0
|
893 |
else if (cst)
|
|
sl@0
|
894 |
{
|
|
sl@0
|
895 |
buf.length = 0;
|
|
sl@0
|
896 |
buf.max = 0;
|
|
sl@0
|
897 |
buf.data = NULL;
|
|
sl@0
|
898 |
/* Should really check the internal tags are correct but
|
|
sl@0
|
899 |
* some things may get this wrong. The relevant specs
|
|
sl@0
|
900 |
* say that constructed string types should be OCTET STRINGs
|
|
sl@0
|
901 |
* internally irrespective of the type. So instead just check
|
|
sl@0
|
902 |
* for UNIVERSAL class and ignore the tag.
|
|
sl@0
|
903 |
*/
|
|
sl@0
|
904 |
if (!asn1_collect(&buf, &p, plen, inf, -1, V_ASN1_UNIVERSAL))
|
|
sl@0
|
905 |
{
|
|
sl@0
|
906 |
free_cont = 1;
|
|
sl@0
|
907 |
goto err;
|
|
sl@0
|
908 |
|
|
sl@0
|
909 |
}
|
|
sl@0
|
910 |
len = buf.length;
|
|
sl@0
|
911 |
/* Append a final null to string */
|
|
sl@0
|
912 |
if (!BUF_MEM_grow_clean(&buf, len + 1))
|
|
sl@0
|
913 |
{
|
|
sl@0
|
914 |
ASN1err(ASN1_F_ASN1_D2I_EX_PRIMITIVE,
|
|
sl@0
|
915 |
ERR_R_MALLOC_FAILURE);
|
|
sl@0
|
916 |
return 0;
|
|
sl@0
|
917 |
}
|
|
sl@0
|
918 |
buf.data[len] = 0;
|
|
sl@0
|
919 |
cont = (const unsigned char *)buf.data;
|
|
sl@0
|
920 |
free_cont = 1;
|
|
sl@0
|
921 |
}
|
|
sl@0
|
922 |
else
|
|
sl@0
|
923 |
{
|
|
sl@0
|
924 |
cont = p;
|
|
sl@0
|
925 |
len = plen;
|
|
sl@0
|
926 |
p += plen;
|
|
sl@0
|
927 |
}
|
|
sl@0
|
928 |
|
|
sl@0
|
929 |
/* We now have content length and type: translate into a structure */
|
|
sl@0
|
930 |
if (!asn1_ex_c2i(pval, cont, len, utype, &free_cont, it))
|
|
sl@0
|
931 |
goto err;
|
|
sl@0
|
932 |
|
|
sl@0
|
933 |
*in = p;
|
|
sl@0
|
934 |
ret = 1;
|
|
sl@0
|
935 |
err:
|
|
sl@0
|
936 |
if (free_cont && buf.data) OPENSSL_free(buf.data);
|
|
sl@0
|
937 |
return ret;
|
|
sl@0
|
938 |
}
|
|
sl@0
|
939 |
|
|
sl@0
|
940 |
/* Translate ASN1 content octets into a structure */
|
|
sl@0
|
941 |
|
|
sl@0
|
942 |
EXPORT_C int asn1_ex_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len,
|
|
sl@0
|
943 |
int utype, char *free_cont, const ASN1_ITEM *it)
|
|
sl@0
|
944 |
{
|
|
sl@0
|
945 |
ASN1_VALUE **opval = NULL;
|
|
sl@0
|
946 |
ASN1_STRING *stmp;
|
|
sl@0
|
947 |
ASN1_TYPE *typ = NULL;
|
|
sl@0
|
948 |
int ret = 0;
|
|
sl@0
|
949 |
const ASN1_PRIMITIVE_FUNCS *pf;
|
|
sl@0
|
950 |
ASN1_INTEGER **tint;
|
|
sl@0
|
951 |
pf = it->funcs;
|
|
sl@0
|
952 |
|
|
sl@0
|
953 |
if (pf && pf->prim_c2i)
|
|
sl@0
|
954 |
return pf->prim_c2i(pval, cont, len, utype, free_cont, it);
|
|
sl@0
|
955 |
/* If ANY type clear type and set pointer to internal value */
|
|
sl@0
|
956 |
if (it->utype == V_ASN1_ANY)
|
|
sl@0
|
957 |
{
|
|
sl@0
|
958 |
if (!*pval)
|
|
sl@0
|
959 |
{
|
|
sl@0
|
960 |
typ = ASN1_TYPE_new();
|
|
sl@0
|
961 |
if (typ == NULL)
|
|
sl@0
|
962 |
goto err;
|
|
sl@0
|
963 |
*pval = (ASN1_VALUE *)typ;
|
|
sl@0
|
964 |
}
|
|
sl@0
|
965 |
else
|
|
sl@0
|
966 |
typ = (ASN1_TYPE *)*pval;
|
|
sl@0
|
967 |
|
|
sl@0
|
968 |
if (utype != typ->type)
|
|
sl@0
|
969 |
ASN1_TYPE_set(typ, utype, NULL);
|
|
sl@0
|
970 |
opval = pval;
|
|
sl@0
|
971 |
pval = (ASN1_VALUE **)&typ->value.ptr;
|
|
sl@0
|
972 |
}
|
|
sl@0
|
973 |
switch(utype)
|
|
sl@0
|
974 |
{
|
|
sl@0
|
975 |
case V_ASN1_OBJECT:
|
|
sl@0
|
976 |
if (!c2i_ASN1_OBJECT((ASN1_OBJECT **)pval, &cont, len))
|
|
sl@0
|
977 |
goto err;
|
|
sl@0
|
978 |
break;
|
|
sl@0
|
979 |
|
|
sl@0
|
980 |
case V_ASN1_NULL:
|
|
sl@0
|
981 |
if (len)
|
|
sl@0
|
982 |
{
|
|
sl@0
|
983 |
ASN1err(ASN1_F_ASN1_EX_C2I,
|
|
sl@0
|
984 |
ASN1_R_NULL_IS_WRONG_LENGTH);
|
|
sl@0
|
985 |
goto err;
|
|
sl@0
|
986 |
}
|
|
sl@0
|
987 |
*pval = (ASN1_VALUE *)1;
|
|
sl@0
|
988 |
break;
|
|
sl@0
|
989 |
|
|
sl@0
|
990 |
case V_ASN1_BOOLEAN:
|
|
sl@0
|
991 |
if (len != 1)
|
|
sl@0
|
992 |
{
|
|
sl@0
|
993 |
ASN1err(ASN1_F_ASN1_EX_C2I,
|
|
sl@0
|
994 |
ASN1_R_BOOLEAN_IS_WRONG_LENGTH);
|
|
sl@0
|
995 |
goto err;
|
|
sl@0
|
996 |
}
|
|
sl@0
|
997 |
else
|
|
sl@0
|
998 |
{
|
|
sl@0
|
999 |
ASN1_BOOLEAN *tbool;
|
|
sl@0
|
1000 |
tbool = (ASN1_BOOLEAN *)pval;
|
|
sl@0
|
1001 |
*tbool = *cont;
|
|
sl@0
|
1002 |
}
|
|
sl@0
|
1003 |
break;
|
|
sl@0
|
1004 |
|
|
sl@0
|
1005 |
case V_ASN1_BIT_STRING:
|
|
sl@0
|
1006 |
if (!c2i_ASN1_BIT_STRING((ASN1_BIT_STRING **)pval, &cont, len))
|
|
sl@0
|
1007 |
goto err;
|
|
sl@0
|
1008 |
break;
|
|
sl@0
|
1009 |
|
|
sl@0
|
1010 |
case V_ASN1_INTEGER:
|
|
sl@0
|
1011 |
case V_ASN1_NEG_INTEGER:
|
|
sl@0
|
1012 |
case V_ASN1_ENUMERATED:
|
|
sl@0
|
1013 |
case V_ASN1_NEG_ENUMERATED:
|
|
sl@0
|
1014 |
tint = (ASN1_INTEGER **)pval;
|
|
sl@0
|
1015 |
if (!c2i_ASN1_INTEGER(tint, &cont, len))
|
|
sl@0
|
1016 |
goto err;
|
|
sl@0
|
1017 |
/* Fixup type to match the expected form */
|
|
sl@0
|
1018 |
(*tint)->type = utype | ((*tint)->type & V_ASN1_NEG);
|
|
sl@0
|
1019 |
break;
|
|
sl@0
|
1020 |
|
|
sl@0
|
1021 |
case V_ASN1_OCTET_STRING:
|
|
sl@0
|
1022 |
case V_ASN1_NUMERICSTRING:
|
|
sl@0
|
1023 |
case V_ASN1_PRINTABLESTRING:
|
|
sl@0
|
1024 |
case V_ASN1_T61STRING:
|
|
sl@0
|
1025 |
case V_ASN1_VIDEOTEXSTRING:
|
|
sl@0
|
1026 |
case V_ASN1_IA5STRING:
|
|
sl@0
|
1027 |
case V_ASN1_UTCTIME:
|
|
sl@0
|
1028 |
case V_ASN1_GENERALIZEDTIME:
|
|
sl@0
|
1029 |
case V_ASN1_GRAPHICSTRING:
|
|
sl@0
|
1030 |
case V_ASN1_VISIBLESTRING:
|
|
sl@0
|
1031 |
case V_ASN1_GENERALSTRING:
|
|
sl@0
|
1032 |
case V_ASN1_UNIVERSALSTRING:
|
|
sl@0
|
1033 |
case V_ASN1_BMPSTRING:
|
|
sl@0
|
1034 |
case V_ASN1_UTF8STRING:
|
|
sl@0
|
1035 |
case V_ASN1_OTHER:
|
|
sl@0
|
1036 |
case V_ASN1_SET:
|
|
sl@0
|
1037 |
case V_ASN1_SEQUENCE:
|
|
sl@0
|
1038 |
default:
|
|
sl@0
|
1039 |
/* All based on ASN1_STRING and handled the same */
|
|
sl@0
|
1040 |
if (!*pval)
|
|
sl@0
|
1041 |
{
|
|
sl@0
|
1042 |
stmp = ASN1_STRING_type_new(utype);
|
|
sl@0
|
1043 |
if (!stmp)
|
|
sl@0
|
1044 |
{
|
|
sl@0
|
1045 |
ASN1err(ASN1_F_ASN1_EX_C2I,
|
|
sl@0
|
1046 |
ERR_R_MALLOC_FAILURE);
|
|
sl@0
|
1047 |
goto err;
|
|
sl@0
|
1048 |
}
|
|
sl@0
|
1049 |
*pval = (ASN1_VALUE *)stmp;
|
|
sl@0
|
1050 |
}
|
|
sl@0
|
1051 |
else
|
|
sl@0
|
1052 |
{
|
|
sl@0
|
1053 |
stmp = (ASN1_STRING *)*pval;
|
|
sl@0
|
1054 |
stmp->type = utype;
|
|
sl@0
|
1055 |
}
|
|
sl@0
|
1056 |
/* If we've already allocated a buffer use it */
|
|
sl@0
|
1057 |
if (*free_cont)
|
|
sl@0
|
1058 |
{
|
|
sl@0
|
1059 |
if (stmp->data)
|
|
sl@0
|
1060 |
OPENSSL_free(stmp->data);
|
|
sl@0
|
1061 |
stmp->data = (unsigned char *)cont; /* UGLY CAST! RL */
|
|
sl@0
|
1062 |
stmp->length = len;
|
|
sl@0
|
1063 |
*free_cont = 0;
|
|
sl@0
|
1064 |
}
|
|
sl@0
|
1065 |
else
|
|
sl@0
|
1066 |
{
|
|
sl@0
|
1067 |
if (!ASN1_STRING_set(stmp, cont, len))
|
|
sl@0
|
1068 |
{
|
|
sl@0
|
1069 |
ASN1err(ASN1_F_ASN1_EX_C2I,
|
|
sl@0
|
1070 |
ERR_R_MALLOC_FAILURE);
|
|
sl@0
|
1071 |
ASN1_STRING_free(stmp);
|
|
sl@0
|
1072 |
*pval = NULL;
|
|
sl@0
|
1073 |
goto err;
|
|
sl@0
|
1074 |
}
|
|
sl@0
|
1075 |
}
|
|
sl@0
|
1076 |
break;
|
|
sl@0
|
1077 |
}
|
|
sl@0
|
1078 |
/* If ASN1_ANY and NULL type fix up value */
|
|
sl@0
|
1079 |
if (typ && (utype == V_ASN1_NULL))
|
|
sl@0
|
1080 |
typ->value.ptr = NULL;
|
|
sl@0
|
1081 |
|
|
sl@0
|
1082 |
ret = 1;
|
|
sl@0
|
1083 |
err:
|
|
sl@0
|
1084 |
if (!ret)
|
|
sl@0
|
1085 |
{
|
|
sl@0
|
1086 |
ASN1_TYPE_free(typ);
|
|
sl@0
|
1087 |
if (opval)
|
|
sl@0
|
1088 |
*opval = NULL;
|
|
sl@0
|
1089 |
}
|
|
sl@0
|
1090 |
return ret;
|
|
sl@0
|
1091 |
}
|
|
sl@0
|
1092 |
|
|
sl@0
|
1093 |
|
|
sl@0
|
1094 |
/* This function finds the end of an ASN1 structure when passed its maximum
|
|
sl@0
|
1095 |
* length, whether it is indefinite length and a pointer to the content.
|
|
sl@0
|
1096 |
* This is more efficient than calling asn1_collect because it does not
|
|
sl@0
|
1097 |
* recurse on each indefinite length header.
|
|
sl@0
|
1098 |
*/
|
|
sl@0
|
1099 |
|
|
sl@0
|
1100 |
static int asn1_find_end(const unsigned char **in, long len, char inf)
|
|
sl@0
|
1101 |
{
|
|
sl@0
|
1102 |
int expected_eoc;
|
|
sl@0
|
1103 |
long plen;
|
|
sl@0
|
1104 |
const unsigned char *p = *in, *q;
|
|
sl@0
|
1105 |
/* If not indefinite length constructed just add length */
|
|
sl@0
|
1106 |
if (inf == 0)
|
|
sl@0
|
1107 |
{
|
|
sl@0
|
1108 |
*in += len;
|
|
sl@0
|
1109 |
return 1;
|
|
sl@0
|
1110 |
}
|
|
sl@0
|
1111 |
expected_eoc = 1;
|
|
sl@0
|
1112 |
/* Indefinite length constructed form. Find the end when enough EOCs
|
|
sl@0
|
1113 |
* are found. If more indefinite length constructed headers
|
|
sl@0
|
1114 |
* are encountered increment the expected eoc count otherwise just
|
|
sl@0
|
1115 |
* skip to the end of the data.
|
|
sl@0
|
1116 |
*/
|
|
sl@0
|
1117 |
while (len > 0)
|
|
sl@0
|
1118 |
{
|
|
sl@0
|
1119 |
if(asn1_check_eoc(&p, len))
|
|
sl@0
|
1120 |
{
|
|
sl@0
|
1121 |
expected_eoc--;
|
|
sl@0
|
1122 |
if (expected_eoc == 0)
|
|
sl@0
|
1123 |
break;
|
|
sl@0
|
1124 |
len -= 2;
|
|
sl@0
|
1125 |
continue;
|
|
sl@0
|
1126 |
}
|
|
sl@0
|
1127 |
q = p;
|
|
sl@0
|
1128 |
/* Just read in a header: only care about the length */
|
|
sl@0
|
1129 |
if(!asn1_check_tlen(&plen, NULL, NULL, &inf, NULL, &p, len,
|
|
sl@0
|
1130 |
-1, 0, 0, NULL))
|
|
sl@0
|
1131 |
{
|
|
sl@0
|
1132 |
ASN1err(ASN1_F_ASN1_FIND_END, ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
1133 |
return 0;
|
|
sl@0
|
1134 |
}
|
|
sl@0
|
1135 |
if (inf)
|
|
sl@0
|
1136 |
expected_eoc++;
|
|
sl@0
|
1137 |
else
|
|
sl@0
|
1138 |
p += plen;
|
|
sl@0
|
1139 |
len -= p - q;
|
|
sl@0
|
1140 |
}
|
|
sl@0
|
1141 |
if (expected_eoc)
|
|
sl@0
|
1142 |
{
|
|
sl@0
|
1143 |
ASN1err(ASN1_F_ASN1_FIND_END, ASN1_R_MISSING_EOC);
|
|
sl@0
|
1144 |
return 0;
|
|
sl@0
|
1145 |
}
|
|
sl@0
|
1146 |
*in = p;
|
|
sl@0
|
1147 |
return 1;
|
|
sl@0
|
1148 |
}
|
|
sl@0
|
1149 |
/* This function collects the asn1 data from a constructred string
|
|
sl@0
|
1150 |
* type into a buffer. The values of 'in' and 'len' should refer
|
|
sl@0
|
1151 |
* to the contents of the constructed type and 'inf' should be set
|
|
sl@0
|
1152 |
* if it is indefinite length.
|
|
sl@0
|
1153 |
*/
|
|
sl@0
|
1154 |
|
|
sl@0
|
1155 |
static int asn1_collect(BUF_MEM *buf, const unsigned char **in, long len,
|
|
sl@0
|
1156 |
char inf, int tag, int aclass)
|
|
sl@0
|
1157 |
{
|
|
sl@0
|
1158 |
const unsigned char *p, *q;
|
|
sl@0
|
1159 |
long plen;
|
|
sl@0
|
1160 |
char cst, ininf;
|
|
sl@0
|
1161 |
p = *in;
|
|
sl@0
|
1162 |
inf &= 1;
|
|
sl@0
|
1163 |
/* If no buffer and not indefinite length constructed just pass over
|
|
sl@0
|
1164 |
* the encoded data */
|
|
sl@0
|
1165 |
if (!buf && !inf)
|
|
sl@0
|
1166 |
{
|
|
sl@0
|
1167 |
*in += len;
|
|
sl@0
|
1168 |
return 1;
|
|
sl@0
|
1169 |
}
|
|
sl@0
|
1170 |
while(len > 0)
|
|
sl@0
|
1171 |
{
|
|
sl@0
|
1172 |
q = p;
|
|
sl@0
|
1173 |
/* Check for EOC */
|
|
sl@0
|
1174 |
if (asn1_check_eoc(&p, len))
|
|
sl@0
|
1175 |
{
|
|
sl@0
|
1176 |
/* EOC is illegal outside indefinite length
|
|
sl@0
|
1177 |
* constructed form */
|
|
sl@0
|
1178 |
if (!inf)
|
|
sl@0
|
1179 |
{
|
|
sl@0
|
1180 |
ASN1err(ASN1_F_ASN1_COLLECT,
|
|
sl@0
|
1181 |
ASN1_R_UNEXPECTED_EOC);
|
|
sl@0
|
1182 |
return 0;
|
|
sl@0
|
1183 |
}
|
|
sl@0
|
1184 |
inf = 0;
|
|
sl@0
|
1185 |
break;
|
|
sl@0
|
1186 |
}
|
|
sl@0
|
1187 |
|
|
sl@0
|
1188 |
if (!asn1_check_tlen(&plen, NULL, NULL, &ininf, &cst, &p,
|
|
sl@0
|
1189 |
len, tag, aclass, 0, NULL))
|
|
sl@0
|
1190 |
{
|
|
sl@0
|
1191 |
ASN1err(ASN1_F_ASN1_COLLECT, ERR_R_NESTED_ASN1_ERROR);
|
|
sl@0
|
1192 |
return 0;
|
|
sl@0
|
1193 |
}
|
|
sl@0
|
1194 |
|
|
sl@0
|
1195 |
/* If indefinite length constructed update max length */
|
|
sl@0
|
1196 |
if (cst)
|
|
sl@0
|
1197 |
{
|
|
sl@0
|
1198 |
#ifdef OPENSSL_ALLOW_NESTED_ASN1_STRINGS
|
|
sl@0
|
1199 |
if (!asn1_collect(buf, &p, plen, ininf, tag, aclass))
|
|
sl@0
|
1200 |
return 0;
|
|
sl@0
|
1201 |
#else
|
|
sl@0
|
1202 |
ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_NESTED_ASN1_STRING);
|
|
sl@0
|
1203 |
return 0;
|
|
sl@0
|
1204 |
#endif
|
|
sl@0
|
1205 |
}
|
|
sl@0
|
1206 |
else if (plen && !collect_data(buf, &p, plen))
|
|
sl@0
|
1207 |
return 0;
|
|
sl@0
|
1208 |
len -= p - q;
|
|
sl@0
|
1209 |
}
|
|
sl@0
|
1210 |
if (inf)
|
|
sl@0
|
1211 |
{
|
|
sl@0
|
1212 |
ASN1err(ASN1_F_ASN1_COLLECT, ASN1_R_MISSING_EOC);
|
|
sl@0
|
1213 |
return 0;
|
|
sl@0
|
1214 |
}
|
|
sl@0
|
1215 |
*in = p;
|
|
sl@0
|
1216 |
return 1;
|
|
sl@0
|
1217 |
}
|
|
sl@0
|
1218 |
|
|
sl@0
|
1219 |
static int collect_data(BUF_MEM *buf, const unsigned char **p, long plen)
|
|
sl@0
|
1220 |
{
|
|
sl@0
|
1221 |
int len;
|
|
sl@0
|
1222 |
if (buf)
|
|
sl@0
|
1223 |
{
|
|
sl@0
|
1224 |
len = buf->length;
|
|
sl@0
|
1225 |
if (!BUF_MEM_grow_clean(buf, len + plen))
|
|
sl@0
|
1226 |
{
|
|
sl@0
|
1227 |
ASN1err(ASN1_F_COLLECT_DATA, ERR_R_MALLOC_FAILURE);
|
|
sl@0
|
1228 |
return 0;
|
|
sl@0
|
1229 |
}
|
|
sl@0
|
1230 |
memcpy(buf->data + len, *p, plen);
|
|
sl@0
|
1231 |
}
|
|
sl@0
|
1232 |
*p += plen;
|
|
sl@0
|
1233 |
return 1;
|
|
sl@0
|
1234 |
}
|
|
sl@0
|
1235 |
|
|
sl@0
|
1236 |
/* Check for ASN1 EOC and swallow it if found */
|
|
sl@0
|
1237 |
|
|
sl@0
|
1238 |
static int asn1_check_eoc(const unsigned char **in, long len)
|
|
sl@0
|
1239 |
{
|
|
sl@0
|
1240 |
const unsigned char *p;
|
|
sl@0
|
1241 |
if (len < 2) return 0;
|
|
sl@0
|
1242 |
p = *in;
|
|
sl@0
|
1243 |
if (!p[0] && !p[1])
|
|
sl@0
|
1244 |
{
|
|
sl@0
|
1245 |
*in += 2;
|
|
sl@0
|
1246 |
return 1;
|
|
sl@0
|
1247 |
}
|
|
sl@0
|
1248 |
return 0;
|
|
sl@0
|
1249 |
}
|
|
sl@0
|
1250 |
|
|
sl@0
|
1251 |
/* Check an ASN1 tag and length: a bit like ASN1_get_object
|
|
sl@0
|
1252 |
* but it sets the length for indefinite length constructed
|
|
sl@0
|
1253 |
* form, we don't know the exact length but we can set an
|
|
sl@0
|
1254 |
* upper bound to the amount of data available minus the
|
|
sl@0
|
1255 |
* header length just read.
|
|
sl@0
|
1256 |
*/
|
|
sl@0
|
1257 |
|
|
sl@0
|
1258 |
static int asn1_check_tlen(long *olen, int *otag, unsigned char *oclass,
|
|
sl@0
|
1259 |
char *inf, char *cst,
|
|
sl@0
|
1260 |
const unsigned char **in, long len,
|
|
sl@0
|
1261 |
int exptag, int expclass, char opt,
|
|
sl@0
|
1262 |
ASN1_TLC *ctx)
|
|
sl@0
|
1263 |
{
|
|
sl@0
|
1264 |
int i;
|
|
sl@0
|
1265 |
int ptag, pclass;
|
|
sl@0
|
1266 |
long plen;
|
|
sl@0
|
1267 |
const unsigned char *p, *q;
|
|
sl@0
|
1268 |
p = *in;
|
|
sl@0
|
1269 |
q = p;
|
|
sl@0
|
1270 |
|
|
sl@0
|
1271 |
if (ctx && ctx->valid)
|
|
sl@0
|
1272 |
{
|
|
sl@0
|
1273 |
i = ctx->ret;
|
|
sl@0
|
1274 |
plen = ctx->plen;
|
|
sl@0
|
1275 |
pclass = ctx->pclass;
|
|
sl@0
|
1276 |
ptag = ctx->ptag;
|
|
sl@0
|
1277 |
p += ctx->hdrlen;
|
|
sl@0
|
1278 |
}
|
|
sl@0
|
1279 |
else
|
|
sl@0
|
1280 |
{
|
|
sl@0
|
1281 |
i = ASN1_get_object(&p, &plen, &ptag, &pclass, len);
|
|
sl@0
|
1282 |
if (ctx)
|
|
sl@0
|
1283 |
{
|
|
sl@0
|
1284 |
ctx->ret = i;
|
|
sl@0
|
1285 |
ctx->plen = plen;
|
|
sl@0
|
1286 |
ctx->pclass = pclass;
|
|
sl@0
|
1287 |
ctx->ptag = ptag;
|
|
sl@0
|
1288 |
ctx->hdrlen = p - q;
|
|
sl@0
|
1289 |
ctx->valid = 1;
|
|
sl@0
|
1290 |
/* If definite length, and no error, length +
|
|
sl@0
|
1291 |
* header can't exceed total amount of data available.
|
|
sl@0
|
1292 |
*/
|
|
sl@0
|
1293 |
if (!(i & 0x81) && ((plen + ctx->hdrlen) > len))
|
|
sl@0
|
1294 |
{
|
|
sl@0
|
1295 |
ASN1err(ASN1_F_ASN1_CHECK_TLEN,
|
|
sl@0
|
1296 |
ASN1_R_TOO_LONG);
|
|
sl@0
|
1297 |
asn1_tlc_clear(ctx);
|
|
sl@0
|
1298 |
return 0;
|
|
sl@0
|
1299 |
}
|
|
sl@0
|
1300 |
}
|
|
sl@0
|
1301 |
}
|
|
sl@0
|
1302 |
|
|
sl@0
|
1303 |
if (i & 0x80)
|
|
sl@0
|
1304 |
{
|
|
sl@0
|
1305 |
ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_BAD_OBJECT_HEADER);
|
|
sl@0
|
1306 |
asn1_tlc_clear(ctx);
|
|
sl@0
|
1307 |
return 0;
|
|
sl@0
|
1308 |
}
|
|
sl@0
|
1309 |
if (exptag >= 0)
|
|
sl@0
|
1310 |
{
|
|
sl@0
|
1311 |
if ((exptag != ptag) || (expclass != pclass))
|
|
sl@0
|
1312 |
{
|
|
sl@0
|
1313 |
/* If type is OPTIONAL, not an error:
|
|
sl@0
|
1314 |
* indicate missing type.
|
|
sl@0
|
1315 |
*/
|
|
sl@0
|
1316 |
if (opt) return -1;
|
|
sl@0
|
1317 |
asn1_tlc_clear(ctx);
|
|
sl@0
|
1318 |
ASN1err(ASN1_F_ASN1_CHECK_TLEN, ASN1_R_WRONG_TAG);
|
|
sl@0
|
1319 |
return 0;
|
|
sl@0
|
1320 |
}
|
|
sl@0
|
1321 |
/* We have a tag and class match:
|
|
sl@0
|
1322 |
* assume we are going to do something with it */
|
|
sl@0
|
1323 |
asn1_tlc_clear(ctx);
|
|
sl@0
|
1324 |
}
|
|
sl@0
|
1325 |
|
|
sl@0
|
1326 |
if (i & 1)
|
|
sl@0
|
1327 |
plen = len - (p - q);
|
|
sl@0
|
1328 |
|
|
sl@0
|
1329 |
if (inf)
|
|
sl@0
|
1330 |
*inf = i & 1;
|
|
sl@0
|
1331 |
|
|
sl@0
|
1332 |
if (cst)
|
|
sl@0
|
1333 |
*cst = i & V_ASN1_CONSTRUCTED;
|
|
sl@0
|
1334 |
|
|
sl@0
|
1335 |
if (olen)
|
|
sl@0
|
1336 |
*olen = plen;
|
|
sl@0
|
1337 |
|
|
sl@0
|
1338 |
if (oclass)
|
|
sl@0
|
1339 |
*oclass = pclass;
|
|
sl@0
|
1340 |
|
|
sl@0
|
1341 |
if (otag)
|
|
sl@0
|
1342 |
*otag = ptag;
|
|
sl@0
|
1343 |
|
|
sl@0
|
1344 |
*in = p;
|
|
sl@0
|
1345 |
return 1;
|
|
sl@0
|
1346 |
}
|