1 /* $OpenBSD: obj_dat.c,v 1.41 2018/09/08 13:49:26 tb Exp $ */
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.]
64 #include <openssl/opensslconf.h>
66 #include <openssl/asn1.h>
67 #include <openssl/bn.h>
68 #include <openssl/err.h>
69 #include <openssl/lhash.h>
70 #include <openssl/objects.h>
72 /* obj_dat.h is generated from objects.h by obj_dat.pl */
75 static int sn_cmp_BSEARCH_CMP_FN(const void *, const void *);
76 static int sn_cmp(const ASN1_OBJECT * const *, unsigned int const *);
77 static unsigned int *OBJ_bsearch_sn(const ASN1_OBJECT * *key, unsigned int const *base, int num);
78 static int ln_cmp_BSEARCH_CMP_FN(const void *, const void *);
79 static int ln_cmp(const ASN1_OBJECT * const *, unsigned int const *);
80 static unsigned int *OBJ_bsearch_ln(const ASN1_OBJECT * *key, unsigned int const *base, int num);
81 static int obj_cmp_BSEARCH_CMP_FN(const void *, const void *);
82 static int obj_cmp(const ASN1_OBJECT * const *, unsigned int const *);
83 static unsigned int *OBJ_bsearch_obj(const ASN1_OBJECT * *key, unsigned int const *base, int num);
90 typedef struct added_obj_st {
94 DECLARE_LHASH_OF(ADDED_OBJ);
96 static int new_nid = NUM_NID;
97 static LHASH_OF(ADDED_OBJ) *added = NULL;
99 static int sn_cmp(const ASN1_OBJECT * const *a, const unsigned int *b)
101 return (strcmp((*a)->sn, nid_objs[*b].sn));
106 sn_cmp_BSEARCH_CMP_FN(const void *a_, const void *b_)
108 const ASN1_OBJECT * const *a = a_;
109 unsigned int const *b = b_;
113 static unsigned int *
114 OBJ_bsearch_sn(const ASN1_OBJECT * *key, unsigned int const *base, int num)
116 return (unsigned int *)OBJ_bsearch_(key, base, num, sizeof(unsigned int),
117 sn_cmp_BSEARCH_CMP_FN);
120 static int ln_cmp(const ASN1_OBJECT * const *a, const unsigned int *b)
122 return (strcmp((*a)->ln, nid_objs[*b].ln));
127 ln_cmp_BSEARCH_CMP_FN(const void *a_, const void *b_)
129 const ASN1_OBJECT * const *a = a_;
130 unsigned int const *b = b_;
134 static unsigned int *
135 OBJ_bsearch_ln(const ASN1_OBJECT * *key, unsigned int const *base, int num)
137 return (unsigned int *)OBJ_bsearch_(key, base, num, sizeof(unsigned int),
138 ln_cmp_BSEARCH_CMP_FN);
142 added_obj_hash(const ADDED_OBJ *ca)
144 const ASN1_OBJECT *a;
146 unsigned long ret = 0;
152 ret = a->length << 20L;
153 p = (unsigned char *)a->data;
154 for (i = 0; i < a->length; i++)
155 ret ^= p[i] << ((i * 3) % 24);
158 ret = lh_strhash(a->sn);
161 ret = lh_strhash(a->ln);
171 ret |= ca->type << 30L;
174 static IMPLEMENT_LHASH_HASH_FN(added_obj, ADDED_OBJ)
177 added_obj_cmp(const ADDED_OBJ *ca, const ADDED_OBJ *cb)
182 i = ca->type - cb->type;
189 i = (a->length - b->length);
192 return (memcmp(a->data, b->data, (size_t)a->length));
196 else if (b->sn == NULL)
199 return (strcmp(a->sn, b->sn));
203 else if (b->ln == NULL)
206 return (strcmp(a->ln, b->ln));
208 return (a->nid - b->nid);
214 static IMPLEMENT_LHASH_COMP_FN(added_obj, ADDED_OBJ)
221 added = lh_ADDED_OBJ_new();
222 return (added != NULL);
226 cleanup1_doall(ADDED_OBJ *a)
229 a->obj->flags |= ASN1_OBJECT_FLAG_DYNAMIC |
230 ASN1_OBJECT_FLAG_DYNAMIC_STRINGS |
231 ASN1_OBJECT_FLAG_DYNAMIC_DATA;
234 static void cleanup2_doall(ADDED_OBJ *a)
240 cleanup3_doall(ADDED_OBJ *a)
242 if (--a->obj->nid == 0)
243 ASN1_OBJECT_free(a->obj);
247 static IMPLEMENT_LHASH_DOALL_FN(cleanup1, ADDED_OBJ)
248 static IMPLEMENT_LHASH_DOALL_FN(cleanup2, ADDED_OBJ)
249 static IMPLEMENT_LHASH_DOALL_FN(cleanup3, ADDED_OBJ)
251 /* The purpose of obj_cleanup_defer is to avoid EVP_cleanup() attempting
252 * to use freed up OIDs. If neccessary the actual freeing up of OIDs is
256 int obj_cleanup_defer = 0;
261 if (!obj_cleanup_defer && nid >= NUM_NID)
262 obj_cleanup_defer = 1;
268 if (obj_cleanup_defer) {
269 obj_cleanup_defer = 2;
274 lh_ADDED_OBJ_down_load(added) = 0;
275 lh_ADDED_OBJ_doall(added, LHASH_DOALL_FN(cleanup1)); /* zero counters */
276 lh_ADDED_OBJ_doall(added, LHASH_DOALL_FN(cleanup2)); /* set counters */
277 lh_ADDED_OBJ_doall(added, LHASH_DOALL_FN(cleanup3)); /* free objects */
278 lh_ADDED_OBJ_free(added);
293 OBJ_add_object(const ASN1_OBJECT *obj)
296 ADDED_OBJ *ao[4] = {NULL, NULL, NULL, NULL}, *aop;
302 if ((o = OBJ_dup(obj)) == NULL)
304 if (!(ao[ADDED_NID] = malloc(sizeof(ADDED_OBJ))))
306 if ((o->length != 0) && (obj->data != NULL))
307 if (!(ao[ADDED_DATA] = malloc(sizeof(ADDED_OBJ))))
310 if (!(ao[ADDED_SNAME] = malloc(sizeof(ADDED_OBJ))))
313 if (!(ao[ADDED_LNAME] = malloc(sizeof(ADDED_OBJ))))
316 for (i = ADDED_DATA; i <= ADDED_NID; i++) {
320 aop = lh_ADDED_OBJ_insert(added, ao[i]);
321 /* memory leak, buit should not normally matter */
325 o->flags &= ~(ASN1_OBJECT_FLAG_DYNAMIC |
326 ASN1_OBJECT_FLAG_DYNAMIC_STRINGS |
327 ASN1_OBJECT_FLAG_DYNAMIC_DATA);
332 OBJerror(ERR_R_MALLOC_FAILURE);
334 for (i = ADDED_DATA; i <= ADDED_NID; i++)
346 if ((n >= 0) && (n < NUM_NID)) {
347 if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) {
348 OBJerror(OBJ_R_UNKNOWN_NID);
351 return ((ASN1_OBJECT *)&(nid_objs[n]));
352 } else if (added == NULL)
358 adp = lh_ADDED_OBJ_retrieve(added, &ad);
362 OBJerror(OBJ_R_UNKNOWN_NID);
374 if ((n >= 0) && (n < NUM_NID)) {
375 if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) {
376 OBJerror(OBJ_R_UNKNOWN_NID);
379 return (nid_objs[n].sn);
380 } else if (added == NULL)
386 adp = lh_ADDED_OBJ_retrieve(added, &ad);
388 return (adp->obj->sn);
390 OBJerror(OBJ_R_UNKNOWN_NID);
402 if ((n >= 0) && (n < NUM_NID)) {
403 if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) {
404 OBJerror(OBJ_R_UNKNOWN_NID);
407 return (nid_objs[n].ln);
408 } else if (added == NULL)
414 adp = lh_ADDED_OBJ_retrieve(added, &ad);
416 return (adp->obj->ln);
418 OBJerror(OBJ_R_UNKNOWN_NID);
425 obj_cmp(const ASN1_OBJECT * const *ap, const unsigned int *bp)
428 const ASN1_OBJECT *a= *ap;
429 const ASN1_OBJECT *b = &nid_objs[*bp];
431 j = (a->length - b->length);
434 return (memcmp(a->data, b->data, a->length));
439 obj_cmp_BSEARCH_CMP_FN(const void *a_, const void *b_)
441 const ASN1_OBJECT * const *a = a_;
442 unsigned int const *b = b_;
443 return obj_cmp(a, b);
446 static unsigned int *
447 OBJ_bsearch_obj(const ASN1_OBJECT * *key, unsigned int const *base, int num)
449 return (unsigned int *)OBJ_bsearch_(key, base, num, sizeof(unsigned int),
450 obj_cmp_BSEARCH_CMP_FN);
454 OBJ_obj2nid(const ASN1_OBJECT *a)
456 const unsigned int *op;
465 ad.type = ADDED_DATA;
466 ad.obj=(ASN1_OBJECT *)a; /* XXX: ugly but harmless */
467 adp = lh_ADDED_OBJ_retrieve(added, &ad);
469 return (adp->obj->nid);
471 op = OBJ_bsearch_obj(&a, obj_objs, NUM_OBJ);
474 return (nid_objs[*op].nid);
477 /* Convert an object name into an ASN1_OBJECT
478 * if "noname" is not set then search for short and long names first.
479 * This will convert the "dotted" form into an object: unlike OBJ_txt2nid
480 * it can be used with any objects, not just registered ones.
484 OBJ_txt2obj(const char *s, int no_name)
487 ASN1_OBJECT *op = NULL;
490 const unsigned char *cp;
494 if (((nid = OBJ_sn2nid(s)) != NID_undef) ||
495 ((nid = OBJ_ln2nid(s)) != NID_undef) )
496 return OBJ_nid2obj(nid);
499 /* Work out size of content octets */
500 i = a2d_ASN1_OBJECT(NULL, 0, s, -1);
502 /* Don't clear the error */
503 /*ERR_clear_error();*/
506 /* Work out total size */
507 j = ASN1_object_size(0, i, V_ASN1_OBJECT);
509 if ((buf = malloc(j)) == NULL)
513 /* Write out tag+length */
514 ASN1_put_object(&p, 0, i, V_ASN1_OBJECT, V_ASN1_UNIVERSAL);
515 /* Write out contents */
516 a2d_ASN1_OBJECT(p, i, s, -1);
519 op = d2i_ASN1_OBJECT(NULL, &cp, j);
525 OBJ_obj2txt(char *buf, int buf_len, const ASN1_OBJECT *a, int no_name)
527 int i, ret = 0, len, nid, first = 1, use_bn;
530 const unsigned char *p;
532 /* Ensure that, at every state, |buf| is NUL-terminated. */
536 if ((a == NULL) || (a->data == NULL))
539 if (!no_name && (nid = OBJ_obj2nid(a)) != NID_undef) {
545 ret = strlcpy(buf, s, buf_len);
557 unsigned char c = *p++;
559 if ((len == 0) && (c & 0x80))
562 if (!BN_add_word(bl, c & 0x7f))
568 if (!use_bn && (l > (ULONG_MAX >> 7L))) {
569 if (!bl && !(bl = BN_new()))
571 if (!BN_set_word(bl, l))
576 if (!BN_lshift(bl, bl, 7))
587 if (!BN_sub_word(bl, 80))
606 bndec = BN_bn2dec(bl);
609 i = snprintf(buf, buf_len, ".%s", bndec);
621 i = snprintf(buf, buf_len, ".%lu", l);
645 OBJ_txt2nid(const char *s)
650 obj = OBJ_txt2obj(s, 0);
651 nid = OBJ_obj2nid(obj);
652 ASN1_OBJECT_free(obj);
657 OBJ_ln2nid(const char *s)
660 const ASN1_OBJECT *oo = &o;
662 const unsigned int *op;
666 ad.type = ADDED_LNAME;
668 adp = lh_ADDED_OBJ_retrieve(added, &ad);
670 return (adp->obj->nid);
672 op = OBJ_bsearch_ln(&oo, ln_objs, NUM_LN);
675 return (nid_objs[*op].nid);
679 OBJ_sn2nid(const char *s)
682 const ASN1_OBJECT *oo = &o;
684 const unsigned int *op;
688 ad.type = ADDED_SNAME;
690 adp = lh_ADDED_OBJ_retrieve(added, &ad);
692 return (adp->obj->nid);
694 op = OBJ_bsearch_sn(&oo, sn_objs, NUM_SN);
697 return (nid_objs[*op].nid);
701 OBJ_bsearch_(const void *key, const void *base, int num, int size,
702 int (*cmp)(const void *, const void *))
704 return OBJ_bsearch_ex_(key, base, num, size, cmp, 0);
708 OBJ_bsearch_ex_(const void *key, const void *base_, int num, int size,
709 int (*cmp)(const void *, const void *), int flags)
711 const char *base = base_;
712 int l, h, i = 0, c = 0;
713 const char *p = NULL;
721 p = &(base[i * size]);
730 if (c != 0 && !(flags & OBJ_BSEARCH_VALUE_ON_NOMATCH))
732 else if (c == 0 && (flags & OBJ_BSEARCH_FIRST_VALUE_ON_MATCH)) {
733 while (i > 0 && (*cmp)(key, &(base[(i - 1) * size])) == 0)
735 p = &(base[i * size]);
741 OBJ_create_objects(BIO *in)
745 char *o, *s, *l = NULL;
749 i = BIO_gets(in, buf, 512);
753 if (!isalnum((unsigned char)buf[0]))
756 while (isdigit((unsigned char)*s) || (*s == '.'))
760 while (isspace((unsigned char)*s))
766 while ((*l != '\0') &&
767 !isspace((unsigned char)*l))
771 while (isspace((unsigned char)*l))
780 if ((o == NULL) || (*o == '\0'))
782 if (!OBJ_create(o, s, l))
790 OBJ_create(const char *oid, const char *sn, const char *ln)
793 ASN1_OBJECT *op = NULL;
797 i = a2d_ASN1_OBJECT(NULL, 0, oid, -1);
801 if ((buf = malloc(i)) == NULL) {
802 OBJerror(ERR_R_MALLOC_FAILURE);
805 i = a2d_ASN1_OBJECT(buf, i, oid, -1);
808 op = (ASN1_OBJECT *)ASN1_OBJECT_create(OBJ_new_nid(1), buf, i, sn, ln);
811 ok = OBJ_add_object(op);
814 ASN1_OBJECT_free(op);