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.]
62 #include "internal/cryptlib.h"
63 #include <openssl/lhash.h>
64 #include <openssl/asn1.h>
65 #include <openssl/objects.h>
66 #include <openssl/bn.h>
67 #include "internal/asn1_int.h"
69 /* obj_dat.h is generated from objects.h by obj_dat.pl */
72 DECLARE_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT
*, unsigned int, sn
);
73 DECLARE_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT
*, unsigned int, ln
);
74 DECLARE_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT
*, unsigned int, obj
);
81 typedef struct added_obj_st
{
85 DECLARE_LHASH_OF(ADDED_OBJ
);
87 static int new_nid
= NUM_NID
;
88 static LHASH_OF(ADDED_OBJ
) *added
= NULL
;
90 static int sn_cmp(const ASN1_OBJECT
*const *a
, const unsigned int *b
)
92 return (strcmp((*a
)->sn
, nid_objs
[*b
].sn
));
95 IMPLEMENT_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT
*, unsigned int, sn
);
97 static int ln_cmp(const ASN1_OBJECT
*const *a
, const unsigned int *b
)
99 return (strcmp((*a
)->ln
, nid_objs
[*b
].ln
));
102 IMPLEMENT_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT
*, unsigned int, ln
);
104 static unsigned long added_obj_hash(const ADDED_OBJ
*ca
)
106 const ASN1_OBJECT
*a
;
108 unsigned long ret
= 0;
114 ret
= a
->length
<< 20L;
115 p
= (unsigned char *)a
->data
;
116 for (i
= 0; i
< a
->length
; i
++)
117 ret
^= p
[i
] << ((i
* 3) % 24);
120 ret
= lh_strhash(a
->sn
);
123 ret
= lh_strhash(a
->ln
);
133 ret
|= ((unsigned long)ca
->type
) << 30L;
137 static IMPLEMENT_LHASH_HASH_FN(added_obj
, ADDED_OBJ
)
139 static int added_obj_cmp(const ADDED_OBJ
*ca
, const ADDED_OBJ
*cb
)
144 i
= ca
->type
- cb
->type
;
151 i
= (a
->length
- b
->length
);
154 return (memcmp(a
->data
, b
->data
, (size_t)a
->length
));
158 else if (b
->sn
== NULL
)
161 return (strcmp(a
->sn
, b
->sn
));
165 else if (b
->ln
== NULL
)
168 return (strcmp(a
->ln
, b
->ln
));
170 return (a
->nid
- b
->nid
);
177 static IMPLEMENT_LHASH_COMP_FN(added_obj
, ADDED_OBJ
)
179 static int init_added(void)
183 added
= lh_ADDED_OBJ_new();
184 return (added
!= NULL
);
187 static void cleanup1_doall(ADDED_OBJ
*a
)
190 a
->obj
->flags
|= ASN1_OBJECT_FLAG_DYNAMIC
|
191 ASN1_OBJECT_FLAG_DYNAMIC_STRINGS
| ASN1_OBJECT_FLAG_DYNAMIC_DATA
;
194 static void cleanup2_doall(ADDED_OBJ
*a
)
199 static void cleanup3_doall(ADDED_OBJ
*a
)
201 if (--a
->obj
->nid
== 0)
202 ASN1_OBJECT_free(a
->obj
);
206 static IMPLEMENT_LHASH_DOALL_FN(cleanup1
, ADDED_OBJ
)
207 static IMPLEMENT_LHASH_DOALL_FN(cleanup2
, ADDED_OBJ
)
208 static IMPLEMENT_LHASH_DOALL_FN(cleanup3
, ADDED_OBJ
)
211 * The purpose of obj_cleanup_defer is to avoid EVP_cleanup() attempting to
212 * use freed up OIDs. If necessary the actual freeing up of OIDs is delayed.
214 int obj_cleanup_defer
= 0;
216 void check_defer(int nid
)
218 if (!obj_cleanup_defer
&& nid
>= NUM_NID
)
219 obj_cleanup_defer
= 1;
222 void OBJ_cleanup(void)
224 if (obj_cleanup_defer
) {
225 obj_cleanup_defer
= 2;
230 lh_ADDED_OBJ_down_load(added
) = 0;
231 lh_ADDED_OBJ_doall(added
, LHASH_DOALL_FN(cleanup1
)); /* zero counters */
232 lh_ADDED_OBJ_doall(added
, LHASH_DOALL_FN(cleanup2
)); /* set counters */
233 lh_ADDED_OBJ_doall(added
, LHASH_DOALL_FN(cleanup3
)); /* free objects */
234 lh_ADDED_OBJ_free(added
);
238 int OBJ_new_nid(int num
)
247 int OBJ_add_object(const ASN1_OBJECT
*obj
)
250 ADDED_OBJ
*ao
[4] = { NULL
, NULL
, NULL
, NULL
}, *aop
;
256 if ((o
= OBJ_dup(obj
)) == NULL
)
258 if ((ao
[ADDED_NID
] = OPENSSL_malloc(sizeof(*ao
[0]))) == NULL
)
260 if ((o
->length
!= 0) && (obj
->data
!= NULL
))
261 if ((ao
[ADDED_DATA
] = OPENSSL_malloc(sizeof(*ao
[0]))) == NULL
)
264 if ((ao
[ADDED_SNAME
] = OPENSSL_malloc(sizeof(*ao
[0]))) == NULL
)
267 if ((ao
[ADDED_LNAME
] = OPENSSL_malloc(sizeof(*ao
[0]))) == NULL
)
270 for (i
= ADDED_DATA
; i
<= ADDED_NID
; i
++) {
274 aop
= lh_ADDED_OBJ_insert(added
, ao
[i
]);
275 /* memory leak, buit should not normally matter */
280 ~(ASN1_OBJECT_FLAG_DYNAMIC
| ASN1_OBJECT_FLAG_DYNAMIC_STRINGS
|
281 ASN1_OBJECT_FLAG_DYNAMIC_DATA
);
285 OBJerr(OBJ_F_OBJ_ADD_OBJECT
, ERR_R_MALLOC_FAILURE
);
287 for (i
= ADDED_DATA
; i
<= ADDED_NID
; i
++)
293 ASN1_OBJECT
*OBJ_nid2obj(int n
)
298 if ((n
>= 0) && (n
< NUM_NID
)) {
299 if ((n
!= NID_undef
) && (nid_objs
[n
].nid
== NID_undef
)) {
300 OBJerr(OBJ_F_OBJ_NID2OBJ
, OBJ_R_UNKNOWN_NID
);
303 return ((ASN1_OBJECT
*)&(nid_objs
[n
]));
304 } else if (added
== NULL
)
310 adp
= lh_ADDED_OBJ_retrieve(added
, &ad
);
314 OBJerr(OBJ_F_OBJ_NID2OBJ
, OBJ_R_UNKNOWN_NID
);
320 const char *OBJ_nid2sn(int n
)
325 if ((n
>= 0) && (n
< NUM_NID
)) {
326 if ((n
!= NID_undef
) && (nid_objs
[n
].nid
== NID_undef
)) {
327 OBJerr(OBJ_F_OBJ_NID2SN
, OBJ_R_UNKNOWN_NID
);
330 return (nid_objs
[n
].sn
);
331 } else if (added
== NULL
)
337 adp
= lh_ADDED_OBJ_retrieve(added
, &ad
);
339 return (adp
->obj
->sn
);
341 OBJerr(OBJ_F_OBJ_NID2SN
, OBJ_R_UNKNOWN_NID
);
347 const char *OBJ_nid2ln(int n
)
352 if ((n
>= 0) && (n
< NUM_NID
)) {
353 if ((n
!= NID_undef
) && (nid_objs
[n
].nid
== NID_undef
)) {
354 OBJerr(OBJ_F_OBJ_NID2LN
, OBJ_R_UNKNOWN_NID
);
357 return (nid_objs
[n
].ln
);
358 } else if (added
== NULL
)
364 adp
= lh_ADDED_OBJ_retrieve(added
, &ad
);
366 return (adp
->obj
->ln
);
368 OBJerr(OBJ_F_OBJ_NID2LN
, OBJ_R_UNKNOWN_NID
);
374 static int obj_cmp(const ASN1_OBJECT
*const *ap
, const unsigned int *bp
)
377 const ASN1_OBJECT
*a
= *ap
;
378 const ASN1_OBJECT
*b
= &nid_objs
[*bp
];
380 j
= (a
->length
- b
->length
);
385 return (memcmp(a
->data
, b
->data
, a
->length
));
388 IMPLEMENT_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT
*, unsigned int, obj
);
390 int OBJ_obj2nid(const ASN1_OBJECT
*a
)
392 const unsigned int *op
;
401 ad
.type
= ADDED_DATA
;
402 ad
.obj
= (ASN1_OBJECT
*)a
; /* XXX: ugly but harmless */
403 adp
= lh_ADDED_OBJ_retrieve(added
, &ad
);
405 return (adp
->obj
->nid
);
407 op
= OBJ_bsearch_obj(&a
, obj_objs
, NUM_OBJ
);
410 return (nid_objs
[*op
].nid
);
414 * Convert an object name into an ASN1_OBJECT if "noname" is not set then
415 * search for short and long names first. This will convert the "dotted" form
416 * into an object: unlike OBJ_txt2nid it can be used with any objects, not
417 * just registered ones.
420 ASN1_OBJECT
*OBJ_txt2obj(const char *s
, int no_name
)
423 ASN1_OBJECT
*op
= NULL
;
426 const unsigned char *cp
;
430 if (((nid
= OBJ_sn2nid(s
)) != NID_undef
) ||
431 ((nid
= OBJ_ln2nid(s
)) != NID_undef
))
432 return OBJ_nid2obj(nid
);
435 /* Work out size of content octets */
436 i
= a2d_ASN1_OBJECT(NULL
, 0, s
, -1);
438 /* Don't clear the error */
444 /* Work out total size */
445 j
= ASN1_object_size(0, i
, V_ASN1_OBJECT
);
447 if ((buf
= OPENSSL_malloc(j
)) == NULL
)
451 /* Write out tag+length */
452 ASN1_put_object(&p
, 0, i
, V_ASN1_OBJECT
, V_ASN1_UNIVERSAL
);
453 /* Write out contents */
454 a2d_ASN1_OBJECT(p
, i
, s
, -1);
457 op
= d2i_ASN1_OBJECT(NULL
, &cp
, j
);
462 int OBJ_obj2txt(char *buf
, int buf_len
, const ASN1_OBJECT
*a
, int no_name
)
464 int i
, n
= 0, len
, nid
, first
, use_bn
;
467 const unsigned char *p
;
468 char tbuf
[DECIMAL_SIZE(i
) + DECIMAL_SIZE(l
) + 2];
470 /* Ensure that, at every state, |buf| is NUL-terminated. */
471 if (buf
&& buf_len
> 0)
474 if ((a
== NULL
) || (a
->data
== NULL
))
477 if (!no_name
&& (nid
= OBJ_obj2nid(a
)) != NID_undef
) {
484 BUF_strlcpy(buf
, s
, buf_len
);
500 unsigned char c
= *p
++;
502 if ((len
== 0) && (c
& 0x80))
505 if (!BN_add_word(bl
, c
& 0x7f))
511 if (!use_bn
&& (l
> (ULONG_MAX
>> 7L))) {
512 if (bl
== NULL
&& (bl
= BN_new()) == NULL
)
514 if (!BN_set_word(bl
, l
))
519 if (!BN_lshift(bl
, bl
, 7))
530 if (!BN_sub_word(bl
, 80))
538 if (buf
&& (buf_len
> 1)) {
548 bndec
= BN_bn2dec(bl
);
558 BUF_strlcpy(buf
, bndec
, buf_len
);
571 BIO_snprintf(tbuf
, sizeof tbuf
, ".%lu", l
);
573 if (buf
&& (buf_len
> 0)) {
574 BUF_strlcpy(buf
, tbuf
, buf_len
);
596 int OBJ_txt2nid(const char *s
)
600 obj
= OBJ_txt2obj(s
, 0);
601 nid
= OBJ_obj2nid(obj
);
602 ASN1_OBJECT_free(obj
);
606 int OBJ_ln2nid(const char *s
)
609 const ASN1_OBJECT
*oo
= &o
;
611 const unsigned int *op
;
615 ad
.type
= ADDED_LNAME
;
617 adp
= lh_ADDED_OBJ_retrieve(added
, &ad
);
619 return (adp
->obj
->nid
);
621 op
= OBJ_bsearch_ln(&oo
, ln_objs
, NUM_LN
);
624 return (nid_objs
[*op
].nid
);
627 int OBJ_sn2nid(const char *s
)
630 const ASN1_OBJECT
*oo
= &o
;
632 const unsigned int *op
;
636 ad
.type
= ADDED_SNAME
;
638 adp
= lh_ADDED_OBJ_retrieve(added
, &ad
);
640 return (adp
->obj
->nid
);
642 op
= OBJ_bsearch_sn(&oo
, sn_objs
, NUM_SN
);
645 return (nid_objs
[*op
].nid
);
648 const void *OBJ_bsearch_(const void *key
, const void *base
, int num
, int size
,
649 int (*cmp
) (const void *, const void *))
651 return OBJ_bsearch_ex_(key
, base
, num
, size
, cmp
, 0);
654 const void *OBJ_bsearch_ex_(const void *key
, const void *base_
, int num
,
656 int (*cmp
) (const void *, const void *),
659 const char *base
= base_
;
660 int l
, h
, i
= 0, c
= 0;
661 const char *p
= NULL
;
669 p
= &(base
[i
* size
]);
678 #ifdef CHARSET_EBCDIC
680 * THIS IS A KLUDGE - Because the *_obj is sorted in ASCII order, and I
681 * don't have perl (yet), we revert to a *LINEAR* search when the object
682 * wasn't found in the binary search.
685 for (i
= 0; i
< num
; ++i
) {
686 p
= &(base
[i
* size
]);
688 if (c
== 0 || (c
< 0 && (flags
& OBJ_BSEARCH_VALUE_ON_NOMATCH
)))
693 if (c
!= 0 && !(flags
& OBJ_BSEARCH_VALUE_ON_NOMATCH
))
695 else if (c
== 0 && (flags
& OBJ_BSEARCH_FIRST_VALUE_ON_MATCH
)) {
696 while (i
> 0 && (*cmp
) (key
, &(base
[(i
- 1) * size
])) == 0)
698 p
= &(base
[i
* size
]);
703 int OBJ_create_objects(BIO
*in
)
707 char *o
, *s
, *l
= NULL
;
711 i
= BIO_gets(in
, buf
, 512);
715 if (!isalnum((unsigned char)buf
[0]))
718 while (isdigit((unsigned char)*s
) || (*s
== '.'))
722 while (isspace((unsigned char)*s
))
728 while ((*l
!= '\0') && !isspace((unsigned char)*l
))
732 while (isspace((unsigned char)*l
))
741 if ((o
== NULL
) || (*o
== '\0'))
743 if (!OBJ_create(o
, s
, l
))
750 int OBJ_create(const char *oid
, const char *sn
, const char *ln
)
753 ASN1_OBJECT
*op
= NULL
;
757 i
= a2d_ASN1_OBJECT(NULL
, 0, oid
, -1);
761 if ((buf
= OPENSSL_malloc(i
)) == NULL
) {
762 OBJerr(OBJ_F_OBJ_CREATE
, ERR_R_MALLOC_FAILURE
);
765 i
= a2d_ASN1_OBJECT(buf
, i
, oid
, -1);
768 op
= (ASN1_OBJECT
*)ASN1_OBJECT_create(OBJ_new_nid(1), buf
, i
, sn
, ln
);
771 ok
= OBJ_add_object(op
);
773 ASN1_OBJECT_free(op
);
778 size_t OBJ_length(const ASN1_OBJECT
*obj
)
785 const unsigned char *OBJ_get0_data(const ASN1_OBJECT
*obj
)