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