summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/objects/obj_dat.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libcrypto/objects/obj_dat.c')
-rw-r--r--src/lib/libcrypto/objects/obj_dat.c668
1 files changed, 0 insertions, 668 deletions
diff --git a/src/lib/libcrypto/objects/obj_dat.c b/src/lib/libcrypto/objects/obj_dat.c
deleted file mode 100644
index f549d078ef..0000000000
--- a/src/lib/libcrypto/objects/obj_dat.c
+++ /dev/null
@@ -1,668 +0,0 @@
1/* crypto/objects/obj_dat.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 <ctype.h>
61#include "cryptlib.h"
62#include <openssl/lhash.h>
63#include <openssl/asn1.h>
64#include <openssl/objects.h>
65
66/* obj_dat.h is generated from objects.h by obj_dat.pl */
67#ifndef OPENSSL_NO_OBJECT
68#include "obj_dat.h"
69#else
70/* You will have to load all the objects needed manually in the application */
71#define NUM_NID 0
72#define NUM_SN 0
73#define NUM_LN 0
74#define NUM_OBJ 0
75static unsigned char lvalues[1];
76static ASN1_OBJECT nid_objs[1];
77static ASN1_OBJECT *sn_objs[1];
78static ASN1_OBJECT *ln_objs[1];
79static ASN1_OBJECT *obj_objs[1];
80#endif
81
82static int sn_cmp(const void *a, const void *b);
83static int ln_cmp(const void *a, const void *b);
84static int obj_cmp(const void *a, const void *b);
85#define ADDED_DATA 0
86#define ADDED_SNAME 1
87#define ADDED_LNAME 2
88#define ADDED_NID 3
89
90typedef struct added_obj_st
91 {
92 int type;
93 ASN1_OBJECT *obj;
94 } ADDED_OBJ;
95
96static int new_nid=NUM_NID;
97static LHASH *added=NULL;
98
99static int sn_cmp(const void *a, const void *b)
100 {
101 const ASN1_OBJECT * const *ap = a, * const *bp = b;
102 return(strcmp((*ap)->sn,(*bp)->sn));
103 }
104
105static int ln_cmp(const void *a, const void *b)
106 {
107 const ASN1_OBJECT * const *ap = a, * const *bp = b;
108 return(strcmp((*ap)->ln,(*bp)->ln));
109 }
110
111/* static unsigned long add_hash(ADDED_OBJ *ca) */
112static unsigned long add_hash(const void *ca_void)
113 {
114 const ASN1_OBJECT *a;
115 int i;
116 unsigned long ret=0;
117 unsigned char *p;
118 ADDED_OBJ *ca = (ADDED_OBJ *)ca_void;
119
120 a=ca->obj;
121 switch (ca->type)
122 {
123 case ADDED_DATA:
124 ret=a->length<<20L;
125 p=(unsigned char *)a->data;
126 for (i=0; i<a->length; i++)
127 ret^=p[i]<<((i*3)%24);
128 break;
129 case ADDED_SNAME:
130 ret=lh_strhash(a->sn);
131 break;
132 case ADDED_LNAME:
133 ret=lh_strhash(a->ln);
134 break;
135 case ADDED_NID:
136 ret=a->nid;
137 break;
138 default:
139 /* abort(); */
140 return 0;
141 }
142 ret&=0x3fffffffL;
143 ret|=ca->type<<30L;
144 return(ret);
145 }
146
147/* static int add_cmp(ADDED_OBJ *ca, ADDED_OBJ *cb) */
148static int add_cmp(const void *ca_void, const void *cb_void)
149 {
150 ASN1_OBJECT *a,*b;
151 int i;
152 ADDED_OBJ *ca = (ADDED_OBJ *)ca_void;
153 ADDED_OBJ *cb = (ADDED_OBJ *)cb_void;
154
155 i=ca->type-cb->type;
156 if (i) return(i);
157 a=ca->obj;
158 b=cb->obj;
159 switch (ca->type)
160 {
161 case ADDED_DATA:
162 i=(a->length - b->length);
163 if (i) return(i);
164 return(memcmp(a->data,b->data,a->length));
165 case ADDED_SNAME:
166 if (a->sn == NULL) return(-1);
167 else if (b->sn == NULL) return(1);
168 else return(strcmp(a->sn,b->sn));
169 case ADDED_LNAME:
170 if (a->ln == NULL) return(-1);
171 else if (b->ln == NULL) return(1);
172 else return(strcmp(a->ln,b->ln));
173 case ADDED_NID:
174 return(a->nid-b->nid);
175 default:
176 /* abort(); */
177 return 0;
178 }
179 }
180
181static int init_added(void)
182 {
183 if (added != NULL) return(1);
184 added=lh_new(add_hash,add_cmp);
185 return(added != NULL);
186 }
187
188static void cleanup1(ADDED_OBJ *a)
189 {
190 a->obj->nid=0;
191 a->obj->flags|=ASN1_OBJECT_FLAG_DYNAMIC|
192 ASN1_OBJECT_FLAG_DYNAMIC_STRINGS|
193 ASN1_OBJECT_FLAG_DYNAMIC_DATA;
194 }
195
196static void cleanup2(ADDED_OBJ *a)
197 { a->obj->nid++; }
198
199static void cleanup3(ADDED_OBJ *a)
200 {
201 if (--a->obj->nid == 0)
202 ASN1_OBJECT_free(a->obj);
203 OPENSSL_free(a);
204 }
205
206static IMPLEMENT_LHASH_DOALL_FN(cleanup1, ADDED_OBJ *)
207static IMPLEMENT_LHASH_DOALL_FN(cleanup2, ADDED_OBJ *)
208static IMPLEMENT_LHASH_DOALL_FN(cleanup3, ADDED_OBJ *)
209
210void OBJ_cleanup(void)
211 {
212 if (added == NULL) return;
213 added->down_load=0;
214 lh_doall(added,LHASH_DOALL_FN(cleanup1)); /* zero counters */
215 lh_doall(added,LHASH_DOALL_FN(cleanup2)); /* set counters */
216 lh_doall(added,LHASH_DOALL_FN(cleanup3)); /* free objects */
217 lh_free(added);
218 added=NULL;
219 }
220
221int OBJ_new_nid(int num)
222 {
223 int i;
224
225 i=new_nid;
226 new_nid+=num;
227 return(i);
228 }
229
230int OBJ_add_object(const ASN1_OBJECT *obj)
231 {
232 ASN1_OBJECT *o;
233 ADDED_OBJ *ao[4]={NULL,NULL,NULL,NULL},*aop;
234 int i;
235
236 if (added == NULL)
237 if (!init_added()) return(0);
238 if ((o=OBJ_dup(obj)) == NULL) goto err;
239 if (!(ao[ADDED_NID]=(ADDED_OBJ *)OPENSSL_malloc(sizeof(ADDED_OBJ)))) goto err2;
240 if ((o->length != 0) && (obj->data != NULL))
241 if (!(ao[ADDED_DATA]=(ADDED_OBJ *)OPENSSL_malloc(sizeof(ADDED_OBJ)))) goto err2;
242 if (o->sn != NULL)
243 if (!(ao[ADDED_SNAME]=(ADDED_OBJ *)OPENSSL_malloc(sizeof(ADDED_OBJ)))) goto err2;
244 if (o->ln != NULL)
245 if (!(ao[ADDED_LNAME]=(ADDED_OBJ *)OPENSSL_malloc(sizeof(ADDED_OBJ)))) goto err2;
246
247 for (i=ADDED_DATA; i<=ADDED_NID; i++)
248 {
249 if (ao[i] != NULL)
250 {
251 ao[i]->type=i;
252 ao[i]->obj=o;
253 aop=(ADDED_OBJ *)lh_insert(added,ao[i]);
254 /* memory leak, buit should not normally matter */
255 if (aop != NULL)
256 OPENSSL_free(aop);
257 }
258 }
259 o->flags&= ~(ASN1_OBJECT_FLAG_DYNAMIC|ASN1_OBJECT_FLAG_DYNAMIC_STRINGS|
260 ASN1_OBJECT_FLAG_DYNAMIC_DATA);
261
262 return(o->nid);
263err2:
264 OBJerr(OBJ_F_OBJ_ADD_OBJECT,ERR_R_MALLOC_FAILURE);
265err:
266 for (i=ADDED_DATA; i<=ADDED_NID; i++)
267 if (ao[i] != NULL) OPENSSL_free(ao[i]);
268 if (o != NULL) OPENSSL_free(o);
269 return(NID_undef);
270 }
271
272ASN1_OBJECT *OBJ_nid2obj(int n)
273 {
274 ADDED_OBJ ad,*adp;
275 ASN1_OBJECT ob;
276
277 if ((n >= 0) && (n < NUM_NID))
278 {
279 if ((n != NID_undef) && (nid_objs[n].nid == NID_undef))
280 {
281 OBJerr(OBJ_F_OBJ_NID2OBJ,OBJ_R_UNKNOWN_NID);
282 return(NULL);
283 }
284 return((ASN1_OBJECT *)&(nid_objs[n]));
285 }
286 else if (added == NULL)
287 return(NULL);
288 else
289 {
290 ad.type=ADDED_NID;
291 ad.obj= &ob;
292 ob.nid=n;
293 adp=(ADDED_OBJ *)lh_retrieve(added,&ad);
294 if (adp != NULL)
295 return(adp->obj);
296 else
297 {
298 OBJerr(OBJ_F_OBJ_NID2OBJ,OBJ_R_UNKNOWN_NID);
299 return(NULL);
300 }
301 }
302 }
303
304const char *OBJ_nid2sn(int n)
305 {
306 ADDED_OBJ ad,*adp;
307 ASN1_OBJECT ob;
308
309 if ((n >= 0) && (n < NUM_NID))
310 {
311 if ((n != NID_undef) && (nid_objs[n].nid == NID_undef))
312 {
313 OBJerr(OBJ_F_OBJ_NID2SN,OBJ_R_UNKNOWN_NID);
314 return(NULL);
315 }
316 return(nid_objs[n].sn);
317 }
318 else if (added == NULL)
319 return(NULL);
320 else
321 {
322 ad.type=ADDED_NID;
323 ad.obj= &ob;
324 ob.nid=n;
325 adp=(ADDED_OBJ *)lh_retrieve(added,&ad);
326 if (adp != NULL)
327 return(adp->obj->sn);
328 else
329 {
330 OBJerr(OBJ_F_OBJ_NID2SN,OBJ_R_UNKNOWN_NID);
331 return(NULL);
332 }
333 }
334 }
335
336const char *OBJ_nid2ln(int n)
337 {
338 ADDED_OBJ ad,*adp;
339 ASN1_OBJECT ob;
340
341 if ((n >= 0) && (n < NUM_NID))
342 {
343 if ((n != NID_undef) && (nid_objs[n].nid == NID_undef))
344 {
345 OBJerr(OBJ_F_OBJ_NID2LN,OBJ_R_UNKNOWN_NID);
346 return(NULL);
347 }
348 return(nid_objs[n].ln);
349 }
350 else if (added == NULL)
351 return(NULL);
352 else
353 {
354 ad.type=ADDED_NID;
355 ad.obj= &ob;
356 ob.nid=n;
357 adp=(ADDED_OBJ *)lh_retrieve(added,&ad);
358 if (adp != NULL)
359 return(adp->obj->ln);
360 else
361 {
362 OBJerr(OBJ_F_OBJ_NID2LN,OBJ_R_UNKNOWN_NID);
363 return(NULL);
364 }
365 }
366 }
367
368int OBJ_obj2nid(const ASN1_OBJECT *a)
369 {
370 ASN1_OBJECT **op;
371 ADDED_OBJ ad,*adp;
372
373 if (a == NULL)
374 return(NID_undef);
375 if (a->nid != 0)
376 return(a->nid);
377
378 if (added != NULL)
379 {
380 ad.type=ADDED_DATA;
381 ad.obj=(ASN1_OBJECT *)a; /* XXX: ugly but harmless */
382 adp=(ADDED_OBJ *)lh_retrieve(added,&ad);
383 if (adp != NULL) return (adp->obj->nid);
384 }
385 op=(ASN1_OBJECT **)OBJ_bsearch((char *)&a,(char *)obj_objs,NUM_OBJ,
386 sizeof(ASN1_OBJECT *),obj_cmp);
387 if (op == NULL)
388 return(NID_undef);
389 return((*op)->nid);
390 }
391
392/* Convert an object name into an ASN1_OBJECT
393 * if "noname" is not set then search for short and long names first.
394 * This will convert the "dotted" form into an object: unlike OBJ_txt2nid
395 * it can be used with any objects, not just registered ones.
396 */
397
398ASN1_OBJECT *OBJ_txt2obj(const char *s, int no_name)
399 {
400 int nid = NID_undef;
401 ASN1_OBJECT *op=NULL;
402 unsigned char *buf,*p;
403 int i, j;
404
405 if(!no_name) {
406 if( ((nid = OBJ_sn2nid(s)) != NID_undef) ||
407 ((nid = OBJ_ln2nid(s)) != NID_undef) )
408 return OBJ_nid2obj(nid);
409 }
410
411 /* Work out size of content octets */
412 i=a2d_ASN1_OBJECT(NULL,0,s,-1);
413 if (i <= 0) {
414 /* Clear the error */
415 ERR_get_error();
416 return NULL;
417 }
418 /* Work out total size */
419 j = ASN1_object_size(0,i,V_ASN1_OBJECT);
420
421 if((buf=(unsigned char *)OPENSSL_malloc(j)) == NULL) return NULL;
422
423 p = buf;
424 /* Write out tag+length */
425 ASN1_put_object(&p,0,i,V_ASN1_OBJECT,V_ASN1_UNIVERSAL);
426 /* Write out contents */
427 a2d_ASN1_OBJECT(p,i,s,-1);
428
429 p=buf;
430 op=d2i_ASN1_OBJECT(NULL,&p,j);
431 OPENSSL_free(buf);
432 return op;
433 }
434
435int OBJ_obj2txt(char *buf, int buf_len, const ASN1_OBJECT *a, int no_name)
436{
437 int i,idx=0,n=0,len,nid;
438 unsigned long l;
439 unsigned char *p;
440 const char *s;
441 char tbuf[DECIMAL_SIZE(i)+DECIMAL_SIZE(l)+2];
442
443 if (buf_len <= 0) return(0);
444
445 if ((a == NULL) || (a->data == NULL)) {
446 buf[0]='\0';
447 return(0);
448 }
449
450 if (no_name || (nid=OBJ_obj2nid(a)) == NID_undef) {
451 len=a->length;
452 p=a->data;
453
454 idx=0;
455 l=0;
456 while (idx < a->length) {
457 l|=(p[idx]&0x7f);
458 if (!(p[idx] & 0x80)) break;
459 l<<=7L;
460 idx++;
461 }
462 idx++;
463 i=(int)(l/40);
464 if (i > 2) i=2;
465 l-=(long)(i*40);
466
467 BIO_snprintf(tbuf,sizeof tbuf,"%d.%lu",i,l);
468 i=strlen(tbuf);
469 BUF_strlcpy(buf,tbuf,buf_len);
470 buf_len-=i;
471 buf+=i;
472 n+=i;
473
474 l=0;
475 for (; idx<len; idx++) {
476 l|=p[idx]&0x7f;
477 if (!(p[idx] & 0x80)) {
478 BIO_snprintf(tbuf,sizeof tbuf,".%lu",l);
479 i=strlen(tbuf);
480 if (buf_len > 0)
481 BUF_strlcpy(buf,tbuf,buf_len);
482 buf_len-=i;
483 buf+=i;
484 n+=i;
485 l=0;
486 }
487 l<<=7L;
488 }
489 } else {
490 s=OBJ_nid2ln(nid);
491 if (s == NULL)
492 s=OBJ_nid2sn(nid);
493 BUF_strlcpy(buf,s,buf_len);
494 n=strlen(s);
495 }
496 return(n);
497}
498
499int OBJ_txt2nid(const char *s)
500{
501 ASN1_OBJECT *obj;
502 int nid;
503 obj = OBJ_txt2obj(s, 0);
504 nid = OBJ_obj2nid(obj);
505 ASN1_OBJECT_free(obj);
506 return nid;
507}
508
509int OBJ_ln2nid(const char *s)
510 {
511 ASN1_OBJECT o,*oo= &o,**op;
512 ADDED_OBJ ad,*adp;
513
514 o.ln=s;
515 if (added != NULL)
516 {
517 ad.type=ADDED_LNAME;
518 ad.obj= &o;
519 adp=(ADDED_OBJ *)lh_retrieve(added,&ad);
520 if (adp != NULL) return (adp->obj->nid);
521 }
522 op=(ASN1_OBJECT **)OBJ_bsearch((char *)&oo,(char *)ln_objs,NUM_LN,
523 sizeof(ASN1_OBJECT *),ln_cmp);
524 if (op == NULL) return(NID_undef);
525 return((*op)->nid);
526 }
527
528int OBJ_sn2nid(const char *s)
529 {
530 ASN1_OBJECT o,*oo= &o,**op;
531 ADDED_OBJ ad,*adp;
532
533 o.sn=s;
534 if (added != NULL)
535 {
536 ad.type=ADDED_SNAME;
537 ad.obj= &o;
538 adp=(ADDED_OBJ *)lh_retrieve(added,&ad);
539 if (adp != NULL) return (adp->obj->nid);
540 }
541 op=(ASN1_OBJECT **)OBJ_bsearch((char *)&oo,(char *)sn_objs,NUM_SN,
542 sizeof(ASN1_OBJECT *),sn_cmp);
543 if (op == NULL) return(NID_undef);
544 return((*op)->nid);
545 }
546
547static int obj_cmp(const void *ap, const void *bp)
548 {
549 int j;
550 ASN1_OBJECT *a= *(ASN1_OBJECT **)ap;
551 ASN1_OBJECT *b= *(ASN1_OBJECT **)bp;
552
553 j=(a->length - b->length);
554 if (j) return(j);
555 return(memcmp(a->data,b->data,a->length));
556 }
557
558const char *OBJ_bsearch(const char *key, const char *base, int num, int size,
559 int (*cmp)(const void *, const void *))
560 {
561 int l,h,i,c;
562 const char *p;
563
564 if (num == 0) return(NULL);
565 l=0;
566 h=num;
567 while (l < h)
568 {
569 i=(l+h)/2;
570 p= &(base[i*size]);
571 c=(*cmp)(key,p);
572 if (c < 0)
573 h=i;
574 else if (c > 0)
575 l=i+1;
576 else
577 return(p);
578 }
579#ifdef CHARSET_EBCDIC
580/* THIS IS A KLUDGE - Because the *_obj is sorted in ASCII order, and
581 * I don't have perl (yet), we revert to a *LINEAR* search
582 * when the object wasn't found in the binary search.
583 */
584 for (i=0; i<num; ++i) {
585 p= &(base[i*size]);
586 if ((*cmp)(key,p) == 0)
587 return p;
588 }
589#endif
590 return(NULL);
591 }
592
593int OBJ_create_objects(BIO *in)
594 {
595 MS_STATIC char buf[512];
596 int i,num=0;
597 char *o,*s,*l=NULL;
598
599 for (;;)
600 {
601 s=o=NULL;
602 i=BIO_gets(in,buf,512);
603 if (i <= 0) return(num);
604 buf[i-1]='\0';
605 if (!isalnum((unsigned char)buf[0])) return(num);
606 o=s=buf;
607 while (isdigit((unsigned char)*s) || (*s == '.'))
608 s++;
609 if (*s != '\0')
610 {
611 *(s++)='\0';
612 while (isspace((unsigned char)*s))
613 s++;
614 if (*s == '\0')
615 s=NULL;
616 else
617 {
618 l=s;
619 while ((*l != '\0') && !isspace((unsigned char)*l))
620 l++;
621 if (*l != '\0')
622 {
623 *(l++)='\0';
624 while (isspace((unsigned char)*l))
625 l++;
626 if (*l == '\0') l=NULL;
627 }
628 else
629 l=NULL;
630 }
631 }
632 else
633 s=NULL;
634 if ((o == NULL) || (*o == '\0')) return(num);
635 if (!OBJ_create(o,s,l)) return(num);
636 num++;
637 }
638 /* return(num); */
639 }
640
641int OBJ_create(const char *oid, const char *sn, const char *ln)
642 {
643 int ok=0;
644 ASN1_OBJECT *op=NULL;
645 unsigned char *buf;
646 int i;
647
648 i=a2d_ASN1_OBJECT(NULL,0,oid,-1);
649 if (i <= 0) return(0);
650
651 if ((buf=(unsigned char *)OPENSSL_malloc(i)) == NULL)
652 {
653 OBJerr(OBJ_F_OBJ_CREATE,ERR_R_MALLOC_FAILURE);
654 return(0);
655 }
656 i=a2d_ASN1_OBJECT(buf,i,oid,-1);
657 if (i == 0)
658 goto err;
659 op=(ASN1_OBJECT *)ASN1_OBJECT_create(OBJ_new_nid(1),buf,i,sn,ln);
660 if (op == NULL)
661 goto err;
662 ok=OBJ_add_object(op);
663err:
664 ASN1_OBJECT_free(op);
665 OPENSSL_free(buf);
666 return(ok);
667 }
668
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-03-24 09:27:40 +0000