diff options
Diffstat (limited to 'src/lib/libcrypto/asn1/a_bytes.c')
-rw-r--r-- | src/lib/libcrypto/asn1/a_bytes.c | 346 |
1 files changed, 346 insertions, 0 deletions
diff --git a/src/lib/libcrypto/asn1/a_bytes.c b/src/lib/libcrypto/asn1/a_bytes.c new file mode 100644 index 0000000000..14168d61ad --- /dev/null +++ b/src/lib/libcrypto/asn1/a_bytes.c | |||
@@ -0,0 +1,346 @@ | |||
1 | /* crypto/asn1/a_bytes.c */ | ||
2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | ||
3 | * All rights reserved. | ||
4 | * | ||
5 | * This package is an SSL implementation written | ||
6 | * by Eric Young (eay@cryptsoft.com). | ||
7 | * The implementation was written so as to conform with Netscapes SSL. | ||
8 | * | ||
9 | * This library is free for commercial and non-commercial use as long as | ||
10 | * the following conditions are aheared to. The following conditions | ||
11 | * apply to all code found in this distribution, be it the RC4, RSA, | ||
12 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | ||
13 | * included with this distribution is covered by the same copyright terms | ||
14 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | ||
15 | * | ||
16 | * Copyright remains Eric Young's, and as such any Copyright notices in | ||
17 | * the code are not to be removed. | ||
18 | * If this package is used in a product, Eric Young should be given attribution | ||
19 | * as the author of the parts of the library used. | ||
20 | * This can be in the form of a textual message at program startup or | ||
21 | * in documentation (online or textual) provided with the package. | ||
22 | * | ||
23 | * Redistribution and use in source and binary forms, with or without | ||
24 | * modification, are permitted provided that the following conditions | ||
25 | * are met: | ||
26 | * 1. Redistributions of source code must retain the copyright | ||
27 | * notice, this list of conditions and the following disclaimer. | ||
28 | * 2. Redistributions in binary form must reproduce the above copyright | ||
29 | * notice, this list of conditions and the following disclaimer in the | ||
30 | * documentation and/or other materials provided with the distribution. | ||
31 | * 3. All advertising materials mentioning features or use of this software | ||
32 | * must display the following acknowledgement: | ||
33 | * "This product includes cryptographic software written by | ||
34 | * Eric Young (eay@cryptsoft.com)" | ||
35 | * The word 'cryptographic' can be left out if the rouines from the library | ||
36 | * being used are not cryptographic related :-). | ||
37 | * 4. If you include any Windows specific code (or a derivative thereof) from | ||
38 | * the apps directory (application code) you must include an acknowledgement: | ||
39 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | ||
40 | * | ||
41 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND | ||
42 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
43 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | ||
44 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | ||
45 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | ||
46 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | ||
47 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | ||
49 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | ||
50 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | ||
51 | * SUCH DAMAGE. | ||
52 | * | ||
53 | * The licence and distribution terms for any publically available version or | ||
54 | * derivative of this code cannot be changed. i.e. this code cannot simply be | ||
55 | * copied and put under another distribution licence | ||
56 | * [including the GNU Public Licence.] | ||
57 | */ | ||
58 | |||
59 | #include <stdio.h> | ||
60 | #include "cryptlib.h" | ||
61 | #include "asn1_mac.h" | ||
62 | |||
63 | /* ASN1err(ASN1_F_ASN1_TYPE_NEW,ASN1_R_ERROR_STACK); | ||
64 | * ASN1err(ASN1_F_D2I_ASN1_TYPE_BYTES,ASN1_R_ERROR_STACK); | ||
65 | * ASN1err(ASN1_F_D2I_ASN1_TYPE_BYTES,ASN1_R_WRONG_TYPE); | ||
66 | * ASN1err(ASN1_F_ASN1_COLLATE_PRIMATIVE,ASN1_R_WRONG_TAG); | ||
67 | */ | ||
68 | |||
69 | static unsigned long tag2bit[32]={ | ||
70 | 0, 0, 0, B_ASN1_BIT_STRING, /* tags 0 - 3 */ | ||
71 | B_ASN1_OCTET_STRING, 0, 0, B_ASN1_UNKNOWN,/* tags 4- 7 */ | ||
72 | B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN,/* tags 8-11 */ | ||
73 | B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN, B_ASN1_UNKNOWN,/* tags 12-15 */ | ||
74 | 0, 0, B_ASN1_NUMERICSTRING,B_ASN1_PRINTABLESTRING, | ||
75 | B_ASN1_T61STRING,B_ASN1_VIDEOTEXSTRING,B_ASN1_IA5STRING,0, | ||
76 | 0,B_ASN1_GRAPHICSTRING,B_ASN1_ISO64STRING,B_ASN1_GENERALSTRING, | ||
77 | B_ASN1_UNIVERSALSTRING,B_ASN1_UNKNOWN,B_ASN1_BMPSTRING,B_ASN1_UNKNOWN, | ||
78 | }; | ||
79 | |||
80 | #ifndef NOPROTO | ||
81 | static int asn1_collate_primative(ASN1_STRING *a, ASN1_CTX *c); | ||
82 | #else | ||
83 | static int asn1_collate_primative(); | ||
84 | #endif | ||
85 | |||
86 | /* type is a 'bitmap' of acceptable string types to be accepted. | ||
87 | */ | ||
88 | ASN1_STRING *d2i_ASN1_type_bytes(a, pp, length, type) | ||
89 | ASN1_STRING **a; | ||
90 | unsigned char **pp; | ||
91 | long length; | ||
92 | int type; | ||
93 | { | ||
94 | ASN1_STRING *ret=NULL; | ||
95 | unsigned char *p,*s; | ||
96 | long len; | ||
97 | int inf,tag,xclass; | ||
98 | int i=0; | ||
99 | |||
100 | p= *pp; | ||
101 | inf=ASN1_get_object(&p,&len,&tag,&xclass,length); | ||
102 | if (inf & 0x80) goto err; | ||
103 | |||
104 | if (tag >= 32) | ||
105 | { | ||
106 | i=ASN1_R_TAG_VALUE_TOO_HIGH;; | ||
107 | goto err; | ||
108 | } | ||
109 | if (!(tag2bit[tag] & type)) | ||
110 | { | ||
111 | i=ASN1_R_WRONG_TYPE; | ||
112 | goto err; | ||
113 | } | ||
114 | |||
115 | /* If a bit-string, exit early */ | ||
116 | if (tag == V_ASN1_BIT_STRING) | ||
117 | return(d2i_ASN1_BIT_STRING(a,pp,length)); | ||
118 | |||
119 | if ((a == NULL) || ((*a) == NULL)) | ||
120 | { | ||
121 | if ((ret=ASN1_STRING_new()) == NULL) return(NULL); | ||
122 | } | ||
123 | else | ||
124 | ret=(*a); | ||
125 | |||
126 | if (len != 0) | ||
127 | { | ||
128 | s=(unsigned char *)Malloc((int)len+1); | ||
129 | if (s == NULL) | ||
130 | { | ||
131 | i=ERR_R_MALLOC_FAILURE; | ||
132 | goto err; | ||
133 | } | ||
134 | memcpy(s,p,(int)len); | ||
135 | s[len]='\0'; | ||
136 | p+=len; | ||
137 | } | ||
138 | else | ||
139 | s=NULL; | ||
140 | |||
141 | if (ret->data != NULL) Free((char *)ret->data); | ||
142 | ret->length=(int)len; | ||
143 | ret->data=s; | ||
144 | ret->type=tag; | ||
145 | if (a != NULL) (*a)=ret; | ||
146 | *pp=p; | ||
147 | return(ret); | ||
148 | err: | ||
149 | ASN1err(ASN1_F_D2I_ASN1_TYPE_BYTES,i); | ||
150 | if ((ret != NULL) && ((a == NULL) || (*a != ret))) | ||
151 | ASN1_STRING_free(ret); | ||
152 | return(NULL); | ||
153 | } | ||
154 | |||
155 | int i2d_ASN1_bytes(a, pp, tag, xclass) | ||
156 | ASN1_STRING *a; | ||
157 | unsigned char **pp; | ||
158 | int tag; | ||
159 | int xclass; | ||
160 | { | ||
161 | int ret,r,constructed; | ||
162 | unsigned char *p; | ||
163 | |||
164 | if (a == NULL) return(0); | ||
165 | |||
166 | if (tag == V_ASN1_BIT_STRING) | ||
167 | return(i2d_ASN1_BIT_STRING(a,pp)); | ||
168 | |||
169 | ret=a->length; | ||
170 | r=ASN1_object_size(0,ret,tag); | ||
171 | if (pp == NULL) return(r); | ||
172 | p= *pp; | ||
173 | |||
174 | if ((tag == V_ASN1_SEQUENCE) || (tag == V_ASN1_SET)) | ||
175 | constructed=1; | ||
176 | else | ||
177 | constructed=0; | ||
178 | ASN1_put_object(&p,constructed,ret,tag,xclass); | ||
179 | memcpy(p,a->data,a->length); | ||
180 | p+=a->length; | ||
181 | *pp= p; | ||
182 | return(r); | ||
183 | } | ||
184 | |||
185 | ASN1_STRING *d2i_ASN1_bytes(a, pp, length, Ptag, Pclass) | ||
186 | ASN1_STRING **a; | ||
187 | unsigned char **pp; | ||
188 | long length; | ||
189 | int Ptag; | ||
190 | int Pclass; | ||
191 | { | ||
192 | ASN1_STRING *ret=NULL; | ||
193 | unsigned char *p,*s; | ||
194 | long len; | ||
195 | int inf,tag,xclass; | ||
196 | int i=0; | ||
197 | |||
198 | if ((a == NULL) || ((*a) == NULL)) | ||
199 | { | ||
200 | if ((ret=ASN1_STRING_new()) == NULL) return(NULL); | ||
201 | } | ||
202 | else | ||
203 | ret=(*a); | ||
204 | |||
205 | p= *pp; | ||
206 | inf=ASN1_get_object(&p,&len,&tag,&xclass,length); | ||
207 | if (inf & 0x80) | ||
208 | { | ||
209 | i=ASN1_R_BAD_OBJECT_HEADER; | ||
210 | goto err; | ||
211 | } | ||
212 | |||
213 | if (tag != Ptag) | ||
214 | { | ||
215 | i=ASN1_R_WRONG_TAG; | ||
216 | goto err; | ||
217 | } | ||
218 | |||
219 | if (inf & V_ASN1_CONSTRUCTED) | ||
220 | { | ||
221 | ASN1_CTX c; | ||
222 | |||
223 | c.pp=pp; | ||
224 | c.p=p; | ||
225 | c.inf=inf; | ||
226 | c.slen=len; | ||
227 | c.tag=Ptag; | ||
228 | c.xclass=Pclass; | ||
229 | c.max=(length == 0)?0:(p+length); | ||
230 | if (!asn1_collate_primative(ret,&c)) | ||
231 | goto err; | ||
232 | else | ||
233 | { | ||
234 | p=c.p; | ||
235 | } | ||
236 | } | ||
237 | else | ||
238 | { | ||
239 | if (len != 0) | ||
240 | { | ||
241 | if ((ret->length < len) || (ret->data == NULL)) | ||
242 | { | ||
243 | if (ret->data != NULL) Free((char *)ret->data); | ||
244 | s=(unsigned char *)Malloc((int)len); | ||
245 | if (s == NULL) | ||
246 | { | ||
247 | i=ERR_R_MALLOC_FAILURE; | ||
248 | goto err; | ||
249 | } | ||
250 | } | ||
251 | else | ||
252 | s=ret->data; | ||
253 | memcpy(s,p,(int)len); | ||
254 | p+=len; | ||
255 | } | ||
256 | else | ||
257 | { | ||
258 | s=NULL; | ||
259 | if (ret->data != NULL) Free((char *)ret->data); | ||
260 | } | ||
261 | |||
262 | ret->length=(int)len; | ||
263 | ret->data=s; | ||
264 | ret->type=Ptag; | ||
265 | } | ||
266 | |||
267 | if (a != NULL) (*a)=ret; | ||
268 | *pp=p; | ||
269 | return(ret); | ||
270 | err: | ||
271 | if ((ret != NULL) && ((a == NULL) || (*a != ret))) | ||
272 | ASN1_STRING_free(ret); | ||
273 | ASN1err(ASN1_F_D2I_ASN1_BYTES,i); | ||
274 | return(NULL); | ||
275 | } | ||
276 | |||
277 | |||
278 | /* We are about to parse 0..n d2i_ASN1_bytes objects, we are to collapes | ||
279 | * them into the one struture that is then returned */ | ||
280 | /* There have been a few bug fixes for this function from | ||
281 | * Paul Keogh <paul.keogh@sse.ie>, many thanks to him */ | ||
282 | static int asn1_collate_primative(a,c) | ||
283 | ASN1_STRING *a; | ||
284 | ASN1_CTX *c; | ||
285 | { | ||
286 | ASN1_STRING *os=NULL; | ||
287 | BUF_MEM b; | ||
288 | int num; | ||
289 | |||
290 | b.length=0; | ||
291 | b.max=0; | ||
292 | b.data=NULL; | ||
293 | |||
294 | if (a == NULL) | ||
295 | { | ||
296 | c->error=ERR_R_PASSED_NULL_PARAMETER; | ||
297 | goto err; | ||
298 | } | ||
299 | |||
300 | num=0; | ||
301 | for (;;) | ||
302 | { | ||
303 | if (c->inf & 1) | ||
304 | { | ||
305 | c->eos=ASN1_check_infinite_end(&c->p, | ||
306 | (long)(c->max-c->p)); | ||
307 | if (c->eos) break; | ||
308 | } | ||
309 | else | ||
310 | { | ||
311 | if (c->slen <= 0) break; | ||
312 | } | ||
313 | |||
314 | c->q=c->p; | ||
315 | if (d2i_ASN1_bytes(&os,&c->p,c->max-c->p,c->tag,c->xclass) | ||
316 | == NULL) | ||
317 | { | ||
318 | c->error=ERR_R_ASN1_LIB; | ||
319 | goto err; | ||
320 | } | ||
321 | |||
322 | if (!BUF_MEM_grow(&b,num+os->length)) | ||
323 | { | ||
324 | c->error=ERR_R_BUF_LIB; | ||
325 | goto err; | ||
326 | } | ||
327 | memcpy(&(b.data[num]),os->data,os->length); | ||
328 | if (!(c->inf & 1)) | ||
329 | c->slen-=(c->p-c->q); | ||
330 | num+=os->length; | ||
331 | } | ||
332 | |||
333 | if (!asn1_Finish(c)) goto err; | ||
334 | |||
335 | a->length=num; | ||
336 | if (a->data != NULL) Free(a->data); | ||
337 | a->data=(unsigned char *)b.data; | ||
338 | if (os != NULL) ASN1_STRING_free(os); | ||
339 | return(1); | ||
340 | err: | ||
341 | ASN1err(ASN1_F_ASN1_COLLATE_PRIMATIVE,c->error); | ||
342 | if (os != NULL) ASN1_STRING_free(os); | ||
343 | if (b.data != NULL) Free(b.data); | ||
344 | return(0); | ||
345 | } | ||
346 | |||