1 /* crypto/objects/obj_dat.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
63 #include <openssl/lhash.h>
64 #include <openssl/asn1.h>
65 #include <openssl/objects.h>
66 #include <openssl/bn.h>
68 /* obj_dat.h is generated from objects.h by obj_dat.pl */
71 DECLARE_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT
*, unsigned int, sn
);
72 DECLARE_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT
*, unsigned int, ln
);
73 DECLARE_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT
*, unsigned int, obj
);
80 typedef struct added_obj_st
{
84 DECLARE_LHASH_OF(ADDED_OBJ
);
86 static int new_nid
= NUM_NID
;
87 static LHASH_OF(ADDED_OBJ
) *added
= NULL
;
89 static int sn_cmp(const ASN1_OBJECT
*const *a
, const unsigned int *b
)
91 return (strcmp((*a
)->sn
, nid_objs
[*b
].sn
));
94 IMPLEMENT_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT
*, unsigned int, sn
);
96 static int ln_cmp(const ASN1_OBJECT
*const *a
, const unsigned int *b
)
98 return (strcmp((*a
)->ln
, nid_objs
[*b
].ln
));
101 IMPLEMENT_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT
*, unsigned int, ln
);
103 static unsigned long added_obj_hash(const ADDED_OBJ
*ca
)
105 const ASN1_OBJECT
*a
;
107 unsigned long ret
= 0;
113 ret
= a
->length
<< 20L;
114 p
= (unsigned char *)a
->data
;
115 for (i
= 0; i
< a
->length
; i
++)
116 ret
^= p
[i
] << ((i
* 3) % 24);
119 ret
= lh_strhash(a
->sn
);
122 ret
= lh_strhash(a
->ln
);
132 ret
|= ((unsigned long)ca
->type
) << 30L;
136 static IMPLEMENT_LHASH_HASH_FN(added_obj
, ADDED_OBJ
)
138 static int added_obj_cmp(const ADDED_OBJ
*ca
, const ADDED_OBJ
*cb
)
143 i
= ca
->type
- cb
->type
;
150 i
= (a
->length
- b
->length
);
153 return (memcmp(a
->data
, b
->data
, (size_t)a
->length
));
157 else if (b
->sn
== NULL
)
160 return (strcmp(a
->sn
, b
->sn
));
164 else if (b
->ln
== NULL
)
167 return (strcmp(a
->ln
, b
->ln
));
169 return (a
->nid
- b
->nid
);
176 static IMPLEMENT_LHASH_COMP_FN(added_obj
, ADDED_OBJ
)
178 static int init_added(void)
182 added
= lh_ADDED_OBJ_new();
183 return (added
!= NULL
);
186 static void cleanup1_doall(ADDED_OBJ
*a
)
189 a
->obj
->flags
|= ASN1_OBJECT_FLAG_DYNAMIC
|
190 ASN1_OBJECT_FLAG_DYNAMIC_STRINGS
| ASN1_OBJECT_FLAG_DYNAMIC_DATA
;
193 static void cleanup2_doall(ADDED_OBJ
*a
)
198 static void cleanup3_doall(ADDED_OBJ
*a
)
200 if (--a
->obj
->nid
== 0)
201 ASN1_OBJECT_free(a
->obj
);
205 static IMPLEMENT_LHASH_DOALL_FN(cleanup1
, ADDED_OBJ
)
206 static IMPLEMENT_LHASH_DOALL_FN(cleanup2
, ADDED_OBJ
)
207 static IMPLEMENT_LHASH_DOALL_FN(cleanup3
, ADDED_OBJ
)
210 * The purpose of obj_cleanup_defer is to avoid EVP_cleanup() attempting to
211 * use freed up OIDs. If necessary the actual freeing up of OIDs is delayed.
213 int obj_cleanup_defer
= 0;
215 void check_defer(int nid
)
217 if (!obj_cleanup_defer
&& nid
>= NUM_NID
)
218 obj_cleanup_defer
= 1;
221 void OBJ_cleanup(void)
223 if (obj_cleanup_defer
) {
224 obj_cleanup_defer
= 2;
229 lh_ADDED_OBJ_down_load(added
) = 0;
230 lh_ADDED_OBJ_doall(added
, LHASH_DOALL_FN(cleanup1
)); /* zero counters */
231 lh_ADDED_OBJ_doall(added
, LHASH_DOALL_FN(cleanup2
)); /* set counters */
232 lh_ADDED_OBJ_doall(added
, LHASH_DOALL_FN(cleanup3
)); /* free objects */
233 lh_ADDED_OBJ_free(added
);
237 int OBJ_new_nid(int num
)
246 int OBJ_add_object(const ASN1_OBJECT
*obj
)
249 ADDED_OBJ
*ao
[4] = { NULL
, NULL
, NULL
, NULL
}, *aop
;
255 if ((o
= OBJ_dup(obj
)) == NULL
)
257 if (!(ao
[ADDED_NID
] = (ADDED_OBJ
*)OPENSSL_malloc(sizeof(ADDED_OBJ
))))
259 if ((o
->length
!= 0) && (obj
->data
!= NULL
))
261 (ao
[ADDED_DATA
] = (ADDED_OBJ
*)OPENSSL_malloc(sizeof(ADDED_OBJ
))))
266 (ADDED_OBJ
*)OPENSSL_malloc(sizeof(ADDED_OBJ
))))
271 (ADDED_OBJ
*)OPENSSL_malloc(sizeof(ADDED_OBJ
))))
274 for (i
= ADDED_DATA
; i
<= ADDED_NID
; i
++) {
278 aop
= lh_ADDED_OBJ_insert(added
, ao
[i
]);
279 /* memory leak, buit should not normally matter */
285 ~(ASN1_OBJECT_FLAG_DYNAMIC
| ASN1_OBJECT_FLAG_DYNAMIC_STRINGS
|
286 ASN1_OBJECT_FLAG_DYNAMIC_DATA
);
290 OBJerr(OBJ_F_OBJ_ADD_OBJECT
, ERR_R_MALLOC_FAILURE
);
292 for (i
= ADDED_DATA
; i
<= ADDED_NID
; i
++)
300 ASN1_OBJECT
*OBJ_nid2obj(int n
)
305 if ((n
>= 0) && (n
< NUM_NID
)) {
306 if ((n
!= NID_undef
) && (nid_objs
[n
].nid
== NID_undef
)) {
307 OBJerr(OBJ_F_OBJ_NID2OBJ
, OBJ_R_UNKNOWN_NID
);
310 return ((ASN1_OBJECT
*)&(nid_objs
[n
]));
311 } else if (added
== NULL
)
317 adp
= lh_ADDED_OBJ_retrieve(added
, &ad
);
321 OBJerr(OBJ_F_OBJ_NID2OBJ
, OBJ_R_UNKNOWN_NID
);
327 const char *OBJ_nid2sn(int n
)
332 if ((n
>= 0) && (n
< NUM_NID
)) {
333 if ((n
!= NID_undef
) && (nid_objs
[n
].nid
== NID_undef
)) {
334 OBJerr(OBJ_F_OBJ_NID2SN
, OBJ_R_UNKNOWN_NID
);
337 return (nid_objs
[n
].sn
);
338 } else if (added
== NULL
)
344 adp
= lh_ADDED_OBJ_retrieve(added
, &ad
);
346 return (adp
->obj
->sn
);
348 OBJerr(OBJ_F_OBJ_NID2SN
, OBJ_R_UNKNOWN_NID
);
354 const char *OBJ_nid2ln(int n
)
359 if ((n
>= 0) && (n
< NUM_NID
)) {
360 if ((n
!= NID_undef
) && (nid_objs
[n
].nid
== NID_undef
)) {
361 OBJerr(OBJ_F_OBJ_NID2LN
, OBJ_R_UNKNOWN_NID
);
364 return (nid_objs
[n
].ln
);
365 } else if (added
== NULL
)
371 adp
= lh_ADDED_OBJ_retrieve(added
, &ad
);
373 return (adp
->obj
->ln
);
375 OBJerr(OBJ_F_OBJ_NID2LN
, OBJ_R_UNKNOWN_NID
);
381 static int obj_cmp(const ASN1_OBJECT
*const *ap
, const unsigned int *bp
)
384 const ASN1_OBJECT
*a
= *ap
;
385 const ASN1_OBJECT
*b
= &nid_objs
[*bp
];
387 j
= (a
->length
- b
->length
);
390 return (memcmp(a
->data
, b
->data
, a
->length
));
393 IMPLEMENT_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT
*, unsigned int, obj
);
395 int OBJ_obj2nid(const ASN1_OBJECT
*a
)
397 const unsigned int *op
;
406 ad
.type
= ADDED_DATA
;
407 ad
.obj
= (ASN1_OBJECT
*)a
; /* XXX: ugly but harmless */
408 adp
= lh_ADDED_OBJ_retrieve(added
, &ad
);
410 return (adp
->obj
->nid
);
412 op
= OBJ_bsearch_obj(&a
, obj_objs
, NUM_OBJ
);
415 return (nid_objs
[*op
].nid
);
419 * Convert an object name into an ASN1_OBJECT if "noname" is not set then
420 * search for short and long names first. This will convert the "dotted" form
421 * into an object: unlike OBJ_txt2nid it can be used with any objects, not
422 * just registered ones.
425 ASN1_OBJECT
*OBJ_txt2obj(const char *s
, int no_name
)
428 ASN1_OBJECT
*op
= NULL
;
431 const unsigned char *cp
;
435 if (((nid
= OBJ_sn2nid(s
)) != NID_undef
) ||
436 ((nid
= OBJ_ln2nid(s
)) != NID_undef
))
437 return OBJ_nid2obj(nid
);
440 /* Work out size of content octets */
441 i
= a2d_ASN1_OBJECT(NULL
, 0, s
, -1);
443 /* Don't clear the error */
449 /* Work out total size */
450 j
= ASN1_object_size(0, i
, V_ASN1_OBJECT
);
452 if ((buf
= (unsigned char *)OPENSSL_malloc(j
)) == NULL
)
456 /* Write out tag+length */
457 ASN1_put_object(&p
, 0, i
, V_ASN1_OBJECT
, V_ASN1_UNIVERSAL
);
458 /* Write out contents */
459 a2d_ASN1_OBJECT(p
, i
, s
, -1);
462 op
= d2i_ASN1_OBJECT(NULL
, &cp
, j
);
467 int OBJ_obj2txt(char *buf
, int buf_len
, const ASN1_OBJECT
*a
, int no_name
)
469 int i
, n
= 0, len
, nid
, first
, use_bn
;
472 const unsigned char *p
;
473 char tbuf
[DECIMAL_SIZE(i
) + DECIMAL_SIZE(l
) + 2];
475 /* Ensure that, at every state, |buf| is NUL-terminated. */
476 if (buf
&& buf_len
> 0)
479 if ((a
== NULL
) || (a
->data
== NULL
))
482 if (!no_name
&& (nid
= OBJ_obj2nid(a
)) != NID_undef
) {
489 BUF_strlcpy(buf
, s
, buf_len
);
505 unsigned char c
= *p
++;
507 if ((len
== 0) && (c
& 0x80))
510 if (!BN_add_word(bl
, c
& 0x7f))
516 if (!use_bn
&& (l
> (ULONG_MAX
>> 7L))) {
517 if (!bl
&& !(bl
= BN_new()))
519 if (!BN_set_word(bl
, l
))
524 if (!BN_lshift(bl
, bl
, 7))
535 if (!BN_sub_word(bl
, 80))
543 if (buf
&& (buf_len
> 1)) {
553 bndec
= BN_bn2dec(bl
);
563 BUF_strlcpy(buf
, bndec
, buf_len
);
576 BIO_snprintf(tbuf
, sizeof tbuf
, ".%lu", l
);
578 if (buf
&& (buf_len
> 0)) {
579 BUF_strlcpy(buf
, tbuf
, buf_len
);
603 int OBJ_txt2nid(const char *s
)
607 obj
= OBJ_txt2obj(s
, 0);
608 nid
= OBJ_obj2nid(obj
);
609 ASN1_OBJECT_free(obj
);
613 int OBJ_ln2nid(const char *s
)
616 const ASN1_OBJECT
*oo
= &o
;
618 const unsigned int *op
;
622 ad
.type
= ADDED_LNAME
;
624 adp
= lh_ADDED_OBJ_retrieve(added
, &ad
);
626 return (adp
->obj
->nid
);
628 op
= OBJ_bsearch_ln(&oo
, ln_objs
, NUM_LN
);
631 return (nid_objs
[*op
].nid
);
634 int OBJ_sn2nid(const char *s
)
637 const ASN1_OBJECT
*oo
= &o
;
639 const unsigned int *op
;
643 ad
.type
= ADDED_SNAME
;
645 adp
= lh_ADDED_OBJ_retrieve(added
, &ad
);
647 return (adp
->obj
->nid
);
649 op
= OBJ_bsearch_sn(&oo
, sn_objs
, NUM_SN
);
652 return (nid_objs
[*op
].nid
);
655 const void *OBJ_bsearch_(const void *key
, const void *base
, int num
, int size
,
656 int (*cmp
) (const void *, const void *))
658 return OBJ_bsearch_ex_(key
, base
, num
, size
, cmp
, 0);
661 const void *OBJ_bsearch_ex_(const void *key
, const void *base_
, int num
,
663 int (*cmp
) (const void *, const void *),
666 const char *base
= base_
;
667 int l
, h
, i
= 0, c
= 0;
668 const char *p
= NULL
;
676 p
= &(base
[i
* size
]);
685 #ifdef CHARSET_EBCDIC
687 * THIS IS A KLUDGE - Because the *_obj is sorted in ASCII order, and I
688 * don't have perl (yet), we revert to a *LINEAR* search when the object
689 * wasn't found in the binary search.
692 for (i
= 0; i
< num
; ++i
) {
693 p
= &(base
[i
* size
]);
695 if (c
== 0 || (c
< 0 && (flags
& OBJ_BSEARCH_VALUE_ON_NOMATCH
)))
700 if (c
!= 0 && !(flags
& OBJ_BSEARCH_VALUE_ON_NOMATCH
))
702 else if (c
== 0 && (flags
& OBJ_BSEARCH_FIRST_VALUE_ON_MATCH
)) {
703 while (i
> 0 && (*cmp
) (key
, &(base
[(i
- 1) * size
])) == 0)
705 p
= &(base
[i
* size
]);
710 int OBJ_create_objects(BIO
*in
)
714 char *o
, *s
, *l
= NULL
;
718 i
= BIO_gets(in
, buf
, 512);
722 if (!isalnum((unsigned char)buf
[0]))
725 while (isdigit((unsigned char)*s
) || (*s
== '.'))
729 while (isspace((unsigned char)*s
))
735 while ((*l
!= '\0') && !isspace((unsigned char)*l
))
739 while (isspace((unsigned char)*l
))
748 if ((o
== NULL
) || (*o
== '\0'))
750 if (!OBJ_create(o
, s
, l
))
757 int OBJ_create(const char *oid
, const char *sn
, const char *ln
)
760 ASN1_OBJECT
*op
= NULL
;
764 i
= a2d_ASN1_OBJECT(NULL
, 0, oid
, -1);
768 if ((buf
= (unsigned char *)OPENSSL_malloc(i
)) == NULL
) {
769 OBJerr(OBJ_F_OBJ_CREATE
, ERR_R_MALLOC_FAILURE
);
772 i
= a2d_ASN1_OBJECT(buf
, i
, oid
, -1);
775 op
= (ASN1_OBJECT
*)ASN1_OBJECT_create(OBJ_new_nid(1), buf
, i
, sn
, ln
);
778 ok
= OBJ_add_object(op
);
780 ASN1_OBJECT_free(op
);