]> git.ipfire.org Git - thirdparty/openssl.git/blob - crypto/objects/obj_dat.c
27d61b3a43a866b6bd599595fe6d35b069fd3b56
[thirdparty/openssl.git] / crypto / objects / obj_dat.c
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 <limits.h>
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"
68
69 /* obj_dat.h is generated from objects.h by obj_dat.pl */
70 #include "obj_dat.h"
71
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);
75
76 #define ADDED_DATA 0
77 #define ADDED_SNAME 1
78 #define ADDED_LNAME 2
79 #define ADDED_NID 3
80
81 typedef struct added_obj_st {
82 int type;
83 ASN1_OBJECT *obj;
84 } ADDED_OBJ;
85 DECLARE_LHASH_OF(ADDED_OBJ);
86
87 static int new_nid = NUM_NID;
88 static LHASH_OF(ADDED_OBJ) *added = NULL;
89
90 static int sn_cmp(const ASN1_OBJECT *const *a, const unsigned int *b)
91 {
92 return (strcmp((*a)->sn, nid_objs[*b].sn));
93 }
94
95 IMPLEMENT_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT *, unsigned int, sn);
96
97 static int ln_cmp(const ASN1_OBJECT *const *a, const unsigned int *b)
98 {
99 return (strcmp((*a)->ln, nid_objs[*b].ln));
100 }
101
102 IMPLEMENT_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT *, unsigned int, ln);
103
104 static unsigned long added_obj_hash(const ADDED_OBJ *ca)
105 {
106 const ASN1_OBJECT *a;
107 int i;
108 unsigned long ret = 0;
109 unsigned char *p;
110
111 a = ca->obj;
112 switch (ca->type) {
113 case ADDED_DATA:
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);
118 break;
119 case ADDED_SNAME:
120 ret = lh_strhash(a->sn);
121 break;
122 case ADDED_LNAME:
123 ret = lh_strhash(a->ln);
124 break;
125 case ADDED_NID:
126 ret = a->nid;
127 break;
128 default:
129 /* abort(); */
130 return 0;
131 }
132 ret &= 0x3fffffffL;
133 ret |= ((unsigned long)ca->type) << 30L;
134 return (ret);
135 }
136
137 static IMPLEMENT_LHASH_HASH_FN(added_obj, ADDED_OBJ)
138
139 static int added_obj_cmp(const ADDED_OBJ *ca, const ADDED_OBJ *cb)
140 {
141 ASN1_OBJECT *a, *b;
142 int i;
143
144 i = ca->type - cb->type;
145 if (i)
146 return (i);
147 a = ca->obj;
148 b = cb->obj;
149 switch (ca->type) {
150 case ADDED_DATA:
151 i = (a->length - b->length);
152 if (i)
153 return (i);
154 return (memcmp(a->data, b->data, (size_t)a->length));
155 case ADDED_SNAME:
156 if (a->sn == NULL)
157 return (-1);
158 else if (b->sn == NULL)
159 return (1);
160 else
161 return (strcmp(a->sn, b->sn));
162 case ADDED_LNAME:
163 if (a->ln == NULL)
164 return (-1);
165 else if (b->ln == NULL)
166 return (1);
167 else
168 return (strcmp(a->ln, b->ln));
169 case ADDED_NID:
170 return (a->nid - b->nid);
171 default:
172 /* abort(); */
173 return 0;
174 }
175 }
176
177 static IMPLEMENT_LHASH_COMP_FN(added_obj, ADDED_OBJ)
178
179 static int init_added(void)
180 {
181 if (added != NULL)
182 return (1);
183 added = lh_ADDED_OBJ_new();
184 return (added != NULL);
185 }
186
187 static void cleanup1_doall(ADDED_OBJ *a)
188 {
189 a->obj->nid = 0;
190 a->obj->flags |= ASN1_OBJECT_FLAG_DYNAMIC |
191 ASN1_OBJECT_FLAG_DYNAMIC_STRINGS | ASN1_OBJECT_FLAG_DYNAMIC_DATA;
192 }
193
194 static void cleanup2_doall(ADDED_OBJ *a)
195 {
196 a->obj->nid++;
197 }
198
199 static void cleanup3_doall(ADDED_OBJ *a)
200 {
201 if (--a->obj->nid == 0)
202 ASN1_OBJECT_free(a->obj);
203 OPENSSL_free(a);
204 }
205
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)
209
210 /*
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.
213 */
214 int obj_cleanup_defer = 0;
215
216 void check_defer(int nid)
217 {
218 if (!obj_cleanup_defer && nid >= NUM_NID)
219 obj_cleanup_defer = 1;
220 }
221
222 void OBJ_cleanup(void)
223 {
224 if (obj_cleanup_defer) {
225 obj_cleanup_defer = 2;
226 return;
227 }
228 if (added == NULL)
229 return;
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);
235 added = NULL;
236 }
237
238 int OBJ_new_nid(int num)
239 {
240 int i;
241
242 i = new_nid;
243 new_nid += num;
244 return (i);
245 }
246
247 int OBJ_add_object(const ASN1_OBJECT *obj)
248 {
249 ASN1_OBJECT *o;
250 ADDED_OBJ *ao[4] = { NULL, NULL, NULL, NULL }, *aop;
251 int i;
252
253 if (added == NULL)
254 if (!init_added())
255 return (0);
256 if ((o = OBJ_dup(obj)) == NULL)
257 goto err;
258 if ((ao[ADDED_NID] = OPENSSL_malloc(sizeof(*ao[0]))) == NULL)
259 goto err2;
260 if ((o->length != 0) && (obj->data != NULL))
261 if ((ao[ADDED_DATA] = OPENSSL_malloc(sizeof(*ao[0]))) == NULL)
262 goto err2;
263 if (o->sn != NULL)
264 if ((ao[ADDED_SNAME] = OPENSSL_malloc(sizeof(*ao[0]))) == NULL)
265 goto err2;
266 if (o->ln != NULL)
267 if ((ao[ADDED_LNAME] = OPENSSL_malloc(sizeof(*ao[0]))) == NULL)
268 goto err2;
269
270 for (i = ADDED_DATA; i <= ADDED_NID; i++) {
271 if (ao[i] != NULL) {
272 ao[i]->type = i;
273 ao[i]->obj = o;
274 aop = lh_ADDED_OBJ_insert(added, ao[i]);
275 /* memory leak, buit should not normally matter */
276 OPENSSL_free(aop);
277 }
278 }
279 o->flags &=
280 ~(ASN1_OBJECT_FLAG_DYNAMIC | ASN1_OBJECT_FLAG_DYNAMIC_STRINGS |
281 ASN1_OBJECT_FLAG_DYNAMIC_DATA);
282
283 return (o->nid);
284 err2:
285 OBJerr(OBJ_F_OBJ_ADD_OBJECT, ERR_R_MALLOC_FAILURE);
286 err:
287 for (i = ADDED_DATA; i <= ADDED_NID; i++)
288 OPENSSL_free(ao[i]);
289 OPENSSL_free(o);
290 return (NID_undef);
291 }
292
293 ASN1_OBJECT *OBJ_nid2obj(int n)
294 {
295 ADDED_OBJ ad, *adp;
296 ASN1_OBJECT ob;
297
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);
301 return (NULL);
302 }
303 return ((ASN1_OBJECT *)&(nid_objs[n]));
304 } else if (added == NULL)
305 return (NULL);
306 else {
307 ad.type = ADDED_NID;
308 ad.obj = &ob;
309 ob.nid = n;
310 adp = lh_ADDED_OBJ_retrieve(added, &ad);
311 if (adp != NULL)
312 return (adp->obj);
313 else {
314 OBJerr(OBJ_F_OBJ_NID2OBJ, OBJ_R_UNKNOWN_NID);
315 return (NULL);
316 }
317 }
318 }
319
320 const char *OBJ_nid2sn(int n)
321 {
322 ADDED_OBJ ad, *adp;
323 ASN1_OBJECT ob;
324
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);
328 return (NULL);
329 }
330 return (nid_objs[n].sn);
331 } else if (added == NULL)
332 return (NULL);
333 else {
334 ad.type = ADDED_NID;
335 ad.obj = &ob;
336 ob.nid = n;
337 adp = lh_ADDED_OBJ_retrieve(added, &ad);
338 if (adp != NULL)
339 return (adp->obj->sn);
340 else {
341 OBJerr(OBJ_F_OBJ_NID2SN, OBJ_R_UNKNOWN_NID);
342 return (NULL);
343 }
344 }
345 }
346
347 const char *OBJ_nid2ln(int n)
348 {
349 ADDED_OBJ ad, *adp;
350 ASN1_OBJECT ob;
351
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);
355 return (NULL);
356 }
357 return (nid_objs[n].ln);
358 } else if (added == NULL)
359 return (NULL);
360 else {
361 ad.type = ADDED_NID;
362 ad.obj = &ob;
363 ob.nid = n;
364 adp = lh_ADDED_OBJ_retrieve(added, &ad);
365 if (adp != NULL)
366 return (adp->obj->ln);
367 else {
368 OBJerr(OBJ_F_OBJ_NID2LN, OBJ_R_UNKNOWN_NID);
369 return (NULL);
370 }
371 }
372 }
373
374 static int obj_cmp(const ASN1_OBJECT *const *ap, const unsigned int *bp)
375 {
376 int j;
377 const ASN1_OBJECT *a = *ap;
378 const ASN1_OBJECT *b = &nid_objs[*bp];
379
380 j = (a->length - b->length);
381 if (j)
382 return (j);
383 if (a->length == 0)
384 return 0;
385 return (memcmp(a->data, b->data, a->length));
386 }
387
388 IMPLEMENT_OBJ_BSEARCH_CMP_FN(const ASN1_OBJECT *, unsigned int, obj);
389
390 int OBJ_obj2nid(const ASN1_OBJECT *a)
391 {
392 const unsigned int *op;
393 ADDED_OBJ ad, *adp;
394
395 if (a == NULL)
396 return (NID_undef);
397 if (a->nid != 0)
398 return (a->nid);
399
400 if (added != NULL) {
401 ad.type = ADDED_DATA;
402 ad.obj = (ASN1_OBJECT *)a; /* XXX: ugly but harmless */
403 adp = lh_ADDED_OBJ_retrieve(added, &ad);
404 if (adp != NULL)
405 return (adp->obj->nid);
406 }
407 op = OBJ_bsearch_obj(&a, obj_objs, NUM_OBJ);
408 if (op == NULL)
409 return (NID_undef);
410 return (nid_objs[*op].nid);
411 }
412
413 /*
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.
418 */
419
420 ASN1_OBJECT *OBJ_txt2obj(const char *s, int no_name)
421 {
422 int nid = NID_undef;
423 ASN1_OBJECT *op = NULL;
424 unsigned char *buf;
425 unsigned char *p;
426 const unsigned char *cp;
427 int i, j;
428
429 if (!no_name) {
430 if (((nid = OBJ_sn2nid(s)) != NID_undef) ||
431 ((nid = OBJ_ln2nid(s)) != NID_undef))
432 return OBJ_nid2obj(nid);
433 }
434
435 /* Work out size of content octets */
436 i = a2d_ASN1_OBJECT(NULL, 0, s, -1);
437 if (i <= 0) {
438 /* Don't clear the error */
439 /*
440 * ERR_clear_error();
441 */
442 return NULL;
443 }
444 /* Work out total size */
445 j = ASN1_object_size(0, i, V_ASN1_OBJECT);
446
447 if ((buf = OPENSSL_malloc(j)) == NULL)
448 return NULL;
449
450 p = buf;
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);
455
456 cp = buf;
457 op = d2i_ASN1_OBJECT(NULL, &cp, j);
458 OPENSSL_free(buf);
459 return op;
460 }
461
462 int OBJ_obj2txt(char *buf, int buf_len, const ASN1_OBJECT *a, int no_name)
463 {
464 int i, n = 0, len, nid, first, use_bn;
465 BIGNUM *bl;
466 unsigned long l;
467 const unsigned char *p;
468 char tbuf[DECIMAL_SIZE(i) + DECIMAL_SIZE(l) + 2];
469
470 /* Ensure that, at every state, |buf| is NUL-terminated. */
471 if (buf && buf_len > 0)
472 buf[0] = '\0';
473
474 if ((a == NULL) || (a->data == NULL))
475 return (0);
476
477 if (!no_name && (nid = OBJ_obj2nid(a)) != NID_undef) {
478 const char *s;
479 s = OBJ_nid2ln(nid);
480 if (s == NULL)
481 s = OBJ_nid2sn(nid);
482 if (s) {
483 if (buf)
484 BUF_strlcpy(buf, s, buf_len);
485 n = strlen(s);
486 return n;
487 }
488 }
489
490 len = a->length;
491 p = a->data;
492
493 first = 1;
494 bl = NULL;
495
496 while (len > 0) {
497 l = 0;
498 use_bn = 0;
499 for (;;) {
500 unsigned char c = *p++;
501 len--;
502 if ((len == 0) && (c & 0x80))
503 goto err;
504 if (use_bn) {
505 if (!BN_add_word(bl, c & 0x7f))
506 goto err;
507 } else
508 l |= c & 0x7f;
509 if (!(c & 0x80))
510 break;
511 if (!use_bn && (l > (ULONG_MAX >> 7L))) {
512 if (bl == NULL && (bl = BN_new()) == NULL)
513 goto err;
514 if (!BN_set_word(bl, l))
515 goto err;
516 use_bn = 1;
517 }
518 if (use_bn) {
519 if (!BN_lshift(bl, bl, 7))
520 goto err;
521 } else
522 l <<= 7L;
523 }
524
525 if (first) {
526 first = 0;
527 if (l >= 80) {
528 i = 2;
529 if (use_bn) {
530 if (!BN_sub_word(bl, 80))
531 goto err;
532 } else
533 l -= 80;
534 } else {
535 i = (int)(l / 40);
536 l -= (long)(i * 40);
537 }
538 if (buf && (buf_len > 1)) {
539 *buf++ = i + '0';
540 *buf = '\0';
541 buf_len--;
542 }
543 n++;
544 }
545
546 if (use_bn) {
547 char *bndec;
548 bndec = BN_bn2dec(bl);
549 if (!bndec)
550 goto err;
551 i = strlen(bndec);
552 if (buf) {
553 if (buf_len > 1) {
554 *buf++ = '.';
555 *buf = '\0';
556 buf_len--;
557 }
558 BUF_strlcpy(buf, bndec, buf_len);
559 if (i > buf_len) {
560 buf += buf_len;
561 buf_len = 0;
562 } else {
563 buf += i;
564 buf_len -= i;
565 }
566 }
567 n++;
568 n += i;
569 OPENSSL_free(bndec);
570 } else {
571 BIO_snprintf(tbuf, sizeof tbuf, ".%lu", l);
572 i = strlen(tbuf);
573 if (buf && (buf_len > 0)) {
574 BUF_strlcpy(buf, tbuf, buf_len);
575 if (i > buf_len) {
576 buf += buf_len;
577 buf_len = 0;
578 } else {
579 buf += i;
580 buf_len -= i;
581 }
582 }
583 n += i;
584 l = 0;
585 }
586 }
587
588 BN_free(bl);
589 return n;
590
591 err:
592 BN_free(bl);
593 return -1;
594 }
595
596 int OBJ_txt2nid(const char *s)
597 {
598 ASN1_OBJECT *obj;
599 int nid;
600 obj = OBJ_txt2obj(s, 0);
601 nid = OBJ_obj2nid(obj);
602 ASN1_OBJECT_free(obj);
603 return nid;
604 }
605
606 int OBJ_ln2nid(const char *s)
607 {
608 ASN1_OBJECT o;
609 const ASN1_OBJECT *oo = &o;
610 ADDED_OBJ ad, *adp;
611 const unsigned int *op;
612
613 o.ln = s;
614 if (added != NULL) {
615 ad.type = ADDED_LNAME;
616 ad.obj = &o;
617 adp = lh_ADDED_OBJ_retrieve(added, &ad);
618 if (adp != NULL)
619 return (adp->obj->nid);
620 }
621 op = OBJ_bsearch_ln(&oo, ln_objs, NUM_LN);
622 if (op == NULL)
623 return (NID_undef);
624 return (nid_objs[*op].nid);
625 }
626
627 int OBJ_sn2nid(const char *s)
628 {
629 ASN1_OBJECT o;
630 const ASN1_OBJECT *oo = &o;
631 ADDED_OBJ ad, *adp;
632 const unsigned int *op;
633
634 o.sn = s;
635 if (added != NULL) {
636 ad.type = ADDED_SNAME;
637 ad.obj = &o;
638 adp = lh_ADDED_OBJ_retrieve(added, &ad);
639 if (adp != NULL)
640 return (adp->obj->nid);
641 }
642 op = OBJ_bsearch_sn(&oo, sn_objs, NUM_SN);
643 if (op == NULL)
644 return (NID_undef);
645 return (nid_objs[*op].nid);
646 }
647
648 const void *OBJ_bsearch_(const void *key, const void *base, int num, int size,
649 int (*cmp) (const void *, const void *))
650 {
651 return OBJ_bsearch_ex_(key, base, num, size, cmp, 0);
652 }
653
654 const void *OBJ_bsearch_ex_(const void *key, const void *base_, int num,
655 int size,
656 int (*cmp) (const void *, const void *),
657 int flags)
658 {
659 const char *base = base_;
660 int l, h, i = 0, c = 0;
661 const char *p = NULL;
662
663 if (num == 0)
664 return (NULL);
665 l = 0;
666 h = num;
667 while (l < h) {
668 i = (l + h) / 2;
669 p = &(base[i * size]);
670 c = (*cmp) (key, p);
671 if (c < 0)
672 h = i;
673 else if (c > 0)
674 l = i + 1;
675 else
676 break;
677 }
678 #ifdef CHARSET_EBCDIC
679 /*
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.
683 */
684 if (c != 0) {
685 for (i = 0; i < num; ++i) {
686 p = &(base[i * size]);
687 c = (*cmp) (key, p);
688 if (c == 0 || (c < 0 && (flags & OBJ_BSEARCH_VALUE_ON_NOMATCH)))
689 return p;
690 }
691 }
692 #endif
693 if (c != 0 && !(flags & OBJ_BSEARCH_VALUE_ON_NOMATCH))
694 p = NULL;
695 else if (c == 0 && (flags & OBJ_BSEARCH_FIRST_VALUE_ON_MATCH)) {
696 while (i > 0 && (*cmp) (key, &(base[(i - 1) * size])) == 0)
697 i--;
698 p = &(base[i * size]);
699 }
700 return (p);
701 }
702
703 int OBJ_create_objects(BIO *in)
704 {
705 char buf[512];
706 int i, num = 0;
707 char *o, *s, *l = NULL;
708
709 for (;;) {
710 s = o = NULL;
711 i = BIO_gets(in, buf, 512);
712 if (i <= 0)
713 return (num);
714 buf[i - 1] = '\0';
715 if (!isalnum((unsigned char)buf[0]))
716 return (num);
717 o = s = buf;
718 while (isdigit((unsigned char)*s) || (*s == '.'))
719 s++;
720 if (*s != '\0') {
721 *(s++) = '\0';
722 while (isspace((unsigned char)*s))
723 s++;
724 if (*s == '\0')
725 s = NULL;
726 else {
727 l = s;
728 while ((*l != '\0') && !isspace((unsigned char)*l))
729 l++;
730 if (*l != '\0') {
731 *(l++) = '\0';
732 while (isspace((unsigned char)*l))
733 l++;
734 if (*l == '\0')
735 l = NULL;
736 } else
737 l = NULL;
738 }
739 } else
740 s = NULL;
741 if ((o == NULL) || (*o == '\0'))
742 return (num);
743 if (!OBJ_create(o, s, l))
744 return (num);
745 num++;
746 }
747 /* return(num); */
748 }
749
750 int OBJ_create(const char *oid, const char *sn, const char *ln)
751 {
752 int ok = 0;
753 ASN1_OBJECT *op = NULL;
754 unsigned char *buf;
755 int i;
756
757 i = a2d_ASN1_OBJECT(NULL, 0, oid, -1);
758 if (i <= 0)
759 return (0);
760
761 if ((buf = OPENSSL_malloc(i)) == NULL) {
762 OBJerr(OBJ_F_OBJ_CREATE, ERR_R_MALLOC_FAILURE);
763 return (0);
764 }
765 i = a2d_ASN1_OBJECT(buf, i, oid, -1);
766 if (i == 0)
767 goto err;
768 op = (ASN1_OBJECT *)ASN1_OBJECT_create(OBJ_new_nid(1), buf, i, sn, ln);
769 if (op == NULL)
770 goto err;
771 ok = OBJ_add_object(op);
772 err:
773 ASN1_OBJECT_free(op);
774 OPENSSL_free(buf);
775 return (ok);
776 }
777
778 size_t OBJ_length(const ASN1_OBJECT *obj)
779 {
780 if (obj == NULL)
781 return 0;
782 return obj->length;
783 }
784
785 const unsigned char *OBJ_get0_data(const ASN1_OBJECT *obj)
786 {
787 if (obj == NULL)
788 return NULL;
789 return obj->data;
790 }