diff options
Diffstat (limited to 'src/lib/libcrypto/asn1/asn1_lib.c')
-rw-r--r-- | src/lib/libcrypto/asn1/asn1_lib.c | 424 |
1 files changed, 0 insertions, 424 deletions
diff --git a/src/lib/libcrypto/asn1/asn1_lib.c b/src/lib/libcrypto/asn1/asn1_lib.c deleted file mode 100644 index be8daa8688..0000000000 --- a/src/lib/libcrypto/asn1/asn1_lib.c +++ /dev/null | |||
@@ -1,424 +0,0 @@ | |||
1 | /* crypto/asn1/asn1_lib.c */ | ||
2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | ||
3 | * All rights reserved. | ||
4 | * | ||
5 | * This package is an SSL implementation written | ||
6 | * by Eric Young (eay@cryptsoft.com). | ||
7 | * The implementation was written so as to conform with Netscapes SSL. | ||
8 | * | ||
9 | * This library is free for commercial and non-commercial use as long as | ||
10 | * the following conditions are aheared to. The following conditions | ||
11 | * apply to all code found in this distribution, be it the RC4, RSA, | ||
12 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | ||
13 | * included with this distribution is covered by the same copyright terms | ||
14 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | ||
15 | * | ||
16 | * Copyright remains Eric Young's, and as such any Copyright notices in | ||
17 | * the code are not to be removed. | ||
18 | * If this package is used in a product, Eric Young should be given attribution | ||
19 | * as the author of the parts of the library used. | ||
20 | * This can be in the form of a textual message at program startup or | ||
21 | * in documentation (online or textual) provided with the package. | ||
22 | * | ||
23 | * Redistribution and use in source and binary forms, with or without | ||
24 | * modification, are permitted provided that the following conditions | ||
25 | * are met: | ||
26 | * 1. Redistributions of source code must retain the copyright | ||
27 | * notice, this list of conditions and the following disclaimer. | ||
28 | * 2. Redistributions in binary form must reproduce the above copyright | ||
29 | * notice, this list of conditions and the following disclaimer in the | ||
30 | * documentation and/or other materials provided with the distribution. | ||
31 | * 3. All advertising materials mentioning features or use of this software | ||
32 | * must display the following acknowledgement: | ||
33 | * "This product includes cryptographic software written by | ||
34 | * Eric Young (eay@cryptsoft.com)" | ||
35 | * The word 'cryptographic' can be left out if the rouines from the library | ||
36 | * being used are not cryptographic related :-). | ||
37 | * 4. If you include any Windows specific code (or a derivative thereof) from | ||
38 | * the apps directory (application code) you must include an acknowledgement: | ||
39 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | ||
40 | * | ||
41 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND | ||
42 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
43 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | ||
44 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | ||
45 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | ||
46 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | ||
47 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | ||
49 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | ||
50 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | ||
51 | * SUCH DAMAGE. | ||
52 | * | ||
53 | * The licence and distribution terms for any publically available version or | ||
54 | * derivative of this code cannot be changed. i.e. this code cannot simply be | ||
55 | * copied and put under another distribution licence | ||
56 | * [including the GNU Public Licence.] | ||
57 | */ | ||
58 | |||
59 | #include <stdio.h> | ||
60 | #include "cryptlib.h" | ||
61 | #include <openssl/asn1.h> | ||
62 | #include <openssl/asn1_mac.h> | ||
63 | |||
64 | static int asn1_get_length(unsigned char **pp,int *inf,long *rl,int max); | ||
65 | static void asn1_put_length(unsigned char **pp, int length); | ||
66 | const char *ASN1_version="ASN.1" OPENSSL_VERSION_PTEXT; | ||
67 | |||
68 | int ASN1_check_infinite_end(unsigned char **p, long len) | ||
69 | { | ||
70 | /* If there is 0 or 1 byte left, the length check should pick | ||
71 | * things up */ | ||
72 | if (len <= 0) | ||
73 | return(1); | ||
74 | else if ((len >= 2) && ((*p)[0] == 0) && ((*p)[1] == 0)) | ||
75 | { | ||
76 | (*p)+=2; | ||
77 | return(1); | ||
78 | } | ||
79 | return(0); | ||
80 | } | ||
81 | |||
82 | |||
83 | int ASN1_get_object(unsigned char **pp, long *plength, int *ptag, int *pclass, | ||
84 | long omax) | ||
85 | { | ||
86 | int i,ret; | ||
87 | long l; | ||
88 | unsigned char *p= *pp; | ||
89 | int tag,xclass,inf; | ||
90 | long max=omax; | ||
91 | |||
92 | if (!max) goto err; | ||
93 | ret=(*p&V_ASN1_CONSTRUCTED); | ||
94 | xclass=(*p&V_ASN1_PRIVATE); | ||
95 | i= *p&V_ASN1_PRIMITIVE_TAG; | ||
96 | if (i == V_ASN1_PRIMITIVE_TAG) | ||
97 | { /* high-tag */ | ||
98 | p++; | ||
99 | if (--max == 0) goto err; | ||
100 | l=0; | ||
101 | while (*p&0x80) | ||
102 | { | ||
103 | l<<=7L; | ||
104 | l|= *(p++)&0x7f; | ||
105 | if (--max == 0) goto err; | ||
106 | } | ||
107 | l<<=7L; | ||
108 | l|= *(p++)&0x7f; | ||
109 | tag=(int)l; | ||
110 | } | ||
111 | else | ||
112 | { | ||
113 | tag=i; | ||
114 | p++; | ||
115 | if (--max == 0) goto err; | ||
116 | } | ||
117 | *ptag=tag; | ||
118 | *pclass=xclass; | ||
119 | if (!asn1_get_length(&p,&inf,plength,(int)max)) goto err; | ||
120 | |||
121 | #if 0 | ||
122 | fprintf(stderr,"p=%d + *plength=%ld > omax=%ld + *pp=%d (%d > %d)\n", | ||
123 | (int)p,*plength,omax,(int)*pp,(int)(p+ *plength), | ||
124 | (int)(omax+ *pp)); | ||
125 | |||
126 | #endif | ||
127 | #if 0 | ||
128 | if ((p+ *plength) > (omax+ *pp)) | ||
129 | { | ||
130 | ASN1err(ASN1_F_ASN1_GET_OBJECT,ASN1_R_TOO_LONG); | ||
131 | /* Set this so that even if things are not long enough | ||
132 | * the values are set correctly */ | ||
133 | ret|=0x80; | ||
134 | } | ||
135 | #endif | ||
136 | *pp=p; | ||
137 | return(ret|inf); | ||
138 | err: | ||
139 | ASN1err(ASN1_F_ASN1_GET_OBJECT,ASN1_R_HEADER_TOO_LONG); | ||
140 | return(0x80); | ||
141 | } | ||
142 | |||
143 | static int asn1_get_length(unsigned char **pp, int *inf, long *rl, int max) | ||
144 | { | ||
145 | unsigned char *p= *pp; | ||
146 | long ret=0; | ||
147 | int i; | ||
148 | |||
149 | if (max-- < 1) return(0); | ||
150 | if (*p == 0x80) | ||
151 | { | ||
152 | *inf=1; | ||
153 | ret=0; | ||
154 | p++; | ||
155 | } | ||
156 | else | ||
157 | { | ||
158 | *inf=0; | ||
159 | i= *p&0x7f; | ||
160 | if (*(p++) & 0x80) | ||
161 | { | ||
162 | if (max-- == 0) return(0); | ||
163 | while (i-- > 0) | ||
164 | { | ||
165 | ret<<=8L; | ||
166 | ret|= *(p++); | ||
167 | if (max-- == 0) return(0); | ||
168 | } | ||
169 | } | ||
170 | else | ||
171 | ret=i; | ||
172 | } | ||
173 | *pp=p; | ||
174 | *rl=ret; | ||
175 | return(1); | ||
176 | } | ||
177 | |||
178 | /* class 0 is constructed | ||
179 | * constructed == 2 for indefinite length constructed */ | ||
180 | void ASN1_put_object(unsigned char **pp, int constructed, int length, int tag, | ||
181 | int xclass) | ||
182 | { | ||
183 | unsigned char *p= *pp; | ||
184 | int i; | ||
185 | |||
186 | i=(constructed)?V_ASN1_CONSTRUCTED:0; | ||
187 | i|=(xclass&V_ASN1_PRIVATE); | ||
188 | if (tag < 31) | ||
189 | *(p++)=i|(tag&V_ASN1_PRIMITIVE_TAG); | ||
190 | else | ||
191 | { | ||
192 | *(p++)=i|V_ASN1_PRIMITIVE_TAG; | ||
193 | while (tag > 0x7f) | ||
194 | { | ||
195 | *(p++)=(tag&0x7f)|0x80; | ||
196 | tag>>=7; | ||
197 | } | ||
198 | *(p++)=(tag&0x7f); | ||
199 | } | ||
200 | if ((constructed == 2) && (length == 0)) | ||
201 | *(p++)=0x80; /* der_put_length would output 0 instead */ | ||
202 | else | ||
203 | asn1_put_length(&p,length); | ||
204 | *pp=p; | ||
205 | } | ||
206 | |||
207 | static void asn1_put_length(unsigned char **pp, int length) | ||
208 | { | ||
209 | unsigned char *p= *pp; | ||
210 | int i,l; | ||
211 | if (length <= 127) | ||
212 | *(p++)=(unsigned char)length; | ||
213 | else | ||
214 | { | ||
215 | l=length; | ||
216 | for (i=0; l > 0; i++) | ||
217 | l>>=8; | ||
218 | *(p++)=i|0x80; | ||
219 | l=i; | ||
220 | while (i-- > 0) | ||
221 | { | ||
222 | p[i]=length&0xff; | ||
223 | length>>=8; | ||
224 | } | ||
225 | p+=l; | ||
226 | } | ||
227 | *pp=p; | ||
228 | } | ||
229 | |||
230 | int ASN1_object_size(int constructed, int length, int tag) | ||
231 | { | ||
232 | int ret; | ||
233 | |||
234 | ret=length; | ||
235 | ret++; | ||
236 | if (tag >= 31) | ||
237 | { | ||
238 | while (tag > 0) | ||
239 | { | ||
240 | tag>>=7; | ||
241 | ret++; | ||
242 | } | ||
243 | } | ||
244 | if ((length == 0) && (constructed == 2)) | ||
245 | ret+=2; | ||
246 | ret++; | ||
247 | if (length > 127) | ||
248 | { | ||
249 | while (length > 0) | ||
250 | { | ||
251 | length>>=8; | ||
252 | ret++; | ||
253 | } | ||
254 | } | ||
255 | return(ret); | ||
256 | } | ||
257 | |||
258 | int asn1_Finish(ASN1_CTX *c) | ||
259 | { | ||
260 | if ((c->inf == (1|V_ASN1_CONSTRUCTED)) && (!c->eos)) | ||
261 | { | ||
262 | if (!ASN1_check_infinite_end(&c->p,c->slen)) | ||
263 | { | ||
264 | c->error=ERR_R_MISSING_ASN1_EOS; | ||
265 | return(0); | ||
266 | } | ||
267 | } | ||
268 | if ( ((c->slen != 0) && !(c->inf & 1)) || | ||
269 | ((c->slen < 0) && (c->inf & 1))) | ||
270 | { | ||
271 | c->error=ERR_R_ASN1_LENGTH_MISMATCH; | ||
272 | return(0); | ||
273 | } | ||
274 | return(1); | ||
275 | } | ||
276 | |||
277 | int asn1_GetSequence(ASN1_CTX *c, long *length) | ||
278 | { | ||
279 | unsigned char *q; | ||
280 | |||
281 | q=c->p; | ||
282 | c->inf=ASN1_get_object(&(c->p),&(c->slen),&(c->tag),&(c->xclass), | ||
283 | *length); | ||
284 | if (c->inf & 0x80) | ||
285 | { | ||
286 | c->error=ERR_R_BAD_GET_ASN1_OBJECT_CALL; | ||
287 | return(0); | ||
288 | } | ||
289 | if (c->tag != V_ASN1_SEQUENCE) | ||
290 | { | ||
291 | c->error=ERR_R_EXPECTING_AN_ASN1_SEQUENCE; | ||
292 | return(0); | ||
293 | } | ||
294 | (*length)-=(c->p-q); | ||
295 | if (c->max && (*length < 0)) | ||
296 | { | ||
297 | c->error=ERR_R_ASN1_LENGTH_MISMATCH; | ||
298 | return(0); | ||
299 | } | ||
300 | if (c->inf == (1|V_ASN1_CONSTRUCTED)) | ||
301 | c->slen= *length+ *(c->pp)-c->p; | ||
302 | c->eos=0; | ||
303 | return(1); | ||
304 | } | ||
305 | |||
306 | ASN1_STRING *ASN1_STRING_dup(ASN1_STRING *str) | ||
307 | { | ||
308 | ASN1_STRING *ret; | ||
309 | |||
310 | if (str == NULL) return(NULL); | ||
311 | if ((ret=ASN1_STRING_type_new(str->type)) == NULL) | ||
312 | return(NULL); | ||
313 | if (!ASN1_STRING_set(ret,str->data,str->length)) | ||
314 | { | ||
315 | ASN1_STRING_free(ret); | ||
316 | return(NULL); | ||
317 | } | ||
318 | ret->flags = str->flags; | ||
319 | return(ret); | ||
320 | } | ||
321 | |||
322 | int ASN1_STRING_set(ASN1_STRING *str, const void *_data, int len) | ||
323 | { | ||
324 | unsigned char *c; | ||
325 | const char *data=_data; | ||
326 | |||
327 | if (len < 0) | ||
328 | { | ||
329 | if (data == NULL) | ||
330 | return(0); | ||
331 | else | ||
332 | len=strlen(data); | ||
333 | } | ||
334 | if ((str->length < len) || (str->data == NULL)) | ||
335 | { | ||
336 | c=str->data; | ||
337 | if (c == NULL) | ||
338 | str->data=Malloc(len+1); | ||
339 | else | ||
340 | str->data=Realloc(c,len+1); | ||
341 | |||
342 | if (str->data == NULL) | ||
343 | { | ||
344 | str->data=c; | ||
345 | return(0); | ||
346 | } | ||
347 | } | ||
348 | str->length=len; | ||
349 | if (data != NULL) | ||
350 | { | ||
351 | memcpy(str->data,data,len); | ||
352 | /* an allowance for strings :-) */ | ||
353 | str->data[len]='\0'; | ||
354 | } | ||
355 | return(1); | ||
356 | } | ||
357 | |||
358 | ASN1_STRING *ASN1_STRING_new(void) | ||
359 | { | ||
360 | return(ASN1_STRING_type_new(V_ASN1_OCTET_STRING)); | ||
361 | } | ||
362 | |||
363 | |||
364 | ASN1_STRING *ASN1_STRING_type_new(int type) | ||
365 | { | ||
366 | ASN1_STRING *ret; | ||
367 | |||
368 | ret=(ASN1_STRING *)Malloc(sizeof(ASN1_STRING)); | ||
369 | if (ret == NULL) | ||
370 | { | ||
371 | ASN1err(ASN1_F_ASN1_STRING_TYPE_NEW,ERR_R_MALLOC_FAILURE); | ||
372 | return(NULL); | ||
373 | } | ||
374 | ret->length=0; | ||
375 | ret->type=type; | ||
376 | ret->data=NULL; | ||
377 | ret->flags=0; | ||
378 | return(ret); | ||
379 | } | ||
380 | |||
381 | void ASN1_STRING_free(ASN1_STRING *a) | ||
382 | { | ||
383 | if (a == NULL) return; | ||
384 | if (a->data != NULL) Free(a->data); | ||
385 | Free(a); | ||
386 | } | ||
387 | |||
388 | int ASN1_STRING_cmp(ASN1_STRING *a, ASN1_STRING *b) | ||
389 | { | ||
390 | int i; | ||
391 | |||
392 | i=(a->length-b->length); | ||
393 | if (i == 0) | ||
394 | { | ||
395 | i=memcmp(a->data,b->data,a->length); | ||
396 | if (i == 0) | ||
397 | return(a->type-b->type); | ||
398 | else | ||
399 | return(i); | ||
400 | } | ||
401 | else | ||
402 | return(i); | ||
403 | } | ||
404 | |||
405 | void asn1_add_error(unsigned char *address, int offset) | ||
406 | { | ||
407 | char buf1[16],buf2[16]; | ||
408 | |||
409 | sprintf(buf1,"%lu",(unsigned long)address); | ||
410 | sprintf(buf2,"%d",offset); | ||
411 | ERR_add_error_data(4,"address=",buf1," offset=",buf2); | ||
412 | } | ||
413 | |||
414 | int ASN1_STRING_length(ASN1_STRING *x) | ||
415 | { return M_ASN1_STRING_length(x); } | ||
416 | |||
417 | void ASN1_STRING_length_set(ASN1_STRING *x, int len) | ||
418 | { M_ASN1_STRING_length_set(x, len); return; } | ||
419 | |||
420 | int ASN1_STRING_type(ASN1_STRING *x) | ||
421 | { return M_ASN1_STRING_type(x); } | ||
422 | |||
423 | unsigned char * ASN1_STRING_data(ASN1_STRING *x) | ||
424 | { return M_ASN1_STRING_data(x); } | ||