]>
Commit | Line | Data |
---|---|---|
d02b48c6 | 1 | /* crypto/objects/obj_dat.c */ |
58964a49 | 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
d02b48c6 RE |
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> | |
58964a49 | 60 | #include <ctype.h> |
d02b48c6 RE |
61 | #include "cryptlib.h" |
62 | #include "lhash.h" | |
63 | #include "asn1.h" | |
64 | #include "objects.h" | |
65 | ||
66 | /* obj_dat.h is generated from objects.h by obj_dat.pl */ | |
dfeab068 | 67 | #ifndef NO_OBJECT |
d02b48c6 | 68 | #include "obj_dat.h" |
dfeab068 RE |
69 | #else |
70 | /* You will have to load all the objects needed manually in the application */ | |
71 | #define NUM_NID 0 | |
72 | #define NUM_SN 0 | |
73 | #define NUM_LN 0 | |
74 | #define NUM_OBJ 0 | |
75 | static unsigned char lvalues[1]; | |
76 | static ASN1_OBJECT nid_objs[1]; | |
77 | static ASN1_OBJECT *sn_objs[1]; | |
78 | static ASN1_OBJECT *ln_objs[1]; | |
79 | static ASN1_OBJECT *obj_objs[1]; | |
80 | #endif | |
d02b48c6 RE |
81 | |
82 | #ifndef NOPROTO | |
83 | static int sn_cmp(ASN1_OBJECT **a, ASN1_OBJECT **b); | |
84 | static int ln_cmp(ASN1_OBJECT **a, ASN1_OBJECT **b); | |
85 | static int obj_cmp(ASN1_OBJECT **a, ASN1_OBJECT **b); | |
86 | #else | |
87 | static int sn_cmp(); | |
88 | static int ln_cmp(); | |
89 | static int obj_cmp(); | |
90 | #endif | |
91 | ||
92 | #define ADDED_DATA 0 | |
93 | #define ADDED_SNAME 1 | |
94 | #define ADDED_LNAME 2 | |
95 | #define ADDED_NID 3 | |
96 | ||
97 | typedef struct added_obj_st | |
98 | { | |
99 | int type; | |
100 | ASN1_OBJECT *obj; | |
101 | } ADDED_OBJ; | |
102 | ||
103 | static int new_nid=NUM_NID; | |
104 | static LHASH *added=NULL; | |
105 | ||
106 | static int sn_cmp(ap,bp) | |
107 | ASN1_OBJECT **ap; | |
108 | ASN1_OBJECT **bp; | |
109 | { return(strcmp((*ap)->sn,(*bp)->sn)); } | |
110 | ||
111 | static int ln_cmp(ap,bp) | |
112 | ASN1_OBJECT **ap; | |
113 | ASN1_OBJECT **bp; | |
114 | { return(strcmp((*ap)->ln,(*bp)->ln)); } | |
115 | ||
116 | static unsigned long add_hash(ca) | |
117 | ADDED_OBJ *ca; | |
118 | { | |
119 | ASN1_OBJECT *a; | |
120 | int i; | |
121 | unsigned long ret=0; | |
122 | unsigned char *p; | |
123 | ||
124 | a=ca->obj; | |
125 | switch (ca->type) | |
126 | { | |
127 | case ADDED_DATA: | |
128 | ret=a->length<<20L; | |
129 | p=(unsigned char *)a->data; | |
130 | for (i=0; i<a->length; i++) | |
131 | ret^=p[i]<<((i*3)%24); | |
132 | break; | |
133 | case ADDED_SNAME: | |
134 | ret=lh_strhash(a->sn); | |
135 | break; | |
136 | case ADDED_LNAME: | |
137 | ret=lh_strhash(a->ln); | |
138 | break; | |
139 | case ADDED_NID: | |
140 | ret=a->nid; | |
141 | break; | |
142 | default: | |
143 | abort(); | |
144 | } | |
58964a49 | 145 | ret&=0x3fffffffL; |
d02b48c6 RE |
146 | ret|=ca->type<<30L; |
147 | return(ret); | |
148 | } | |
149 | ||
150 | static int add_cmp(ca,cb) | |
151 | ADDED_OBJ *ca,*cb; | |
152 | { | |
153 | ASN1_OBJECT *a,*b; | |
154 | int i; | |
155 | ||
156 | i=ca->type-cb->type; | |
157 | if (i) return(i); | |
158 | a=ca->obj; | |
159 | b=cb->obj; | |
160 | switch (ca->type) | |
161 | { | |
162 | case ADDED_DATA: | |
163 | i=(a->length - b->length); | |
164 | if (i) return(i); | |
165 | return(memcmp(a->data,b->data,a->length)); | |
166 | case ADDED_SNAME: | |
167 | if (a->sn == NULL) return(-1); | |
168 | else if (b->sn == NULL) return(1); | |
169 | else return(strcmp(a->sn,b->sn)); | |
170 | case ADDED_LNAME: | |
171 | if (a->ln == NULL) return(-1); | |
172 | else if (b->ln == NULL) return(1); | |
173 | else return(strcmp(a->ln,b->ln)); | |
174 | case ADDED_NID: | |
175 | return(a->nid-b->nid); | |
176 | default: | |
177 | abort(); | |
178 | } | |
dfeab068 | 179 | return(1); /* should not get here */ |
d02b48c6 RE |
180 | } |
181 | ||
182 | static int init_added() | |
183 | { | |
184 | if (added != NULL) return(1); | |
185 | added=lh_new(add_hash,add_cmp); | |
186 | return(added != NULL); | |
187 | } | |
188 | ||
189 | static void cleanup1(a) | |
190 | ADDED_OBJ *a; | |
191 | { | |
192 | a->obj->nid=0; | |
193 | a->obj->flags|=ASN1_OBJECT_FLAG_DYNAMIC| | |
dfeab068 RE |
194 | ASN1_OBJECT_FLAG_DYNAMIC_STRINGS| |
195 | ASN1_OBJECT_FLAG_DYNAMIC_DATA; | |
d02b48c6 RE |
196 | } |
197 | ||
198 | static void cleanup2(a) | |
199 | ADDED_OBJ *a; | |
200 | { a->obj->nid++; } | |
201 | ||
202 | static void cleanup3(a) | |
203 | ADDED_OBJ *a; | |
204 | { | |
205 | if (--a->obj->nid == 0) | |
206 | ASN1_OBJECT_free(a->obj); | |
207 | Free(a); | |
208 | } | |
209 | ||
210 | void OBJ_cleanup() | |
211 | { | |
212 | if (added == NULL) return; | |
213 | added->down_load=0; | |
214 | lh_doall(added,cleanup1); /* zero counters */ | |
215 | lh_doall(added,cleanup2); /* set counters */ | |
216 | lh_doall(added,cleanup3); /* free objects */ | |
217 | lh_free(added); | |
58964a49 | 218 | added=NULL; |
d02b48c6 RE |
219 | } |
220 | ||
221 | int OBJ_new_nid(num) | |
222 | int num; | |
223 | { | |
224 | int i; | |
225 | ||
226 | i=new_nid; | |
227 | new_nid+=num; | |
228 | return(i); | |
229 | } | |
230 | ||
231 | int OBJ_add_object(obj) | |
232 | ASN1_OBJECT *obj; | |
233 | { | |
234 | ASN1_OBJECT *o; | |
235 | ADDED_OBJ *ao[4],*aop; | |
236 | int i; | |
237 | ||
238 | if (added == NULL) | |
239 | if (!init_added()) return(0); | |
240 | if ((o=OBJ_dup(obj)) == NULL) goto err; | |
241 | ao[ADDED_DATA]=NULL; | |
242 | ao[ADDED_SNAME]=NULL; | |
243 | ao[ADDED_LNAME]=NULL; | |
244 | ao[ADDED_NID]=NULL; | |
245 | ao[ADDED_NID]=(ADDED_OBJ *)Malloc(sizeof(ADDED_OBJ)); | |
246 | if ((o->length != 0) && (obj->data != NULL)) | |
247 | ao[ADDED_DATA]=(ADDED_OBJ *)Malloc(sizeof(ADDED_OBJ)); | |
248 | if (o->sn != NULL) | |
249 | ao[ADDED_SNAME]=(ADDED_OBJ *)Malloc(sizeof(ADDED_OBJ)); | |
250 | if (o->ln != NULL) | |
251 | ao[ADDED_LNAME]=(ADDED_OBJ *)Malloc(sizeof(ADDED_OBJ)); | |
252 | ||
253 | for (i=ADDED_DATA; i<=ADDED_NID; i++) | |
254 | { | |
255 | if (ao[i] != NULL) | |
256 | { | |
257 | ao[i]->type=i; | |
258 | ao[i]->obj=o; | |
259 | aop=(ADDED_OBJ *)lh_insert(added,(char *)ao[i]); | |
260 | /* memory leak, buit should not normally matter */ | |
261 | if (aop != NULL) | |
262 | Free(aop); | |
263 | } | |
264 | } | |
dfeab068 RE |
265 | o->flags&= ~(ASN1_OBJECT_FLAG_DYNAMIC|ASN1_OBJECT_FLAG_DYNAMIC_STRINGS| |
266 | ASN1_OBJECT_FLAG_DYNAMIC_DATA); | |
267 | ||
d02b48c6 RE |
268 | return(o->nid); |
269 | err: | |
270 | for (i=ADDED_DATA; i<=ADDED_NID; i++) | |
271 | if (ao[i] != NULL) Free(ao[i]); | |
272 | if (o != NULL) Free(o); | |
58964a49 | 273 | return(NID_undef); |
d02b48c6 RE |
274 | } |
275 | ||
276 | ASN1_OBJECT *OBJ_nid2obj(n) | |
277 | int n; | |
278 | { | |
279 | ADDED_OBJ ad,*adp; | |
280 | ASN1_OBJECT ob; | |
281 | ||
282 | if ((n >= 0) && (n < NUM_NID)) | |
283 | { | |
284 | if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) | |
285 | { | |
286 | OBJerr(OBJ_F_OBJ_NID2OBJ,OBJ_R_UNKNOWN_NID); | |
287 | return(NULL); | |
288 | } | |
289 | return((ASN1_OBJECT *)&(nid_objs[n])); | |
290 | } | |
291 | else if (added == NULL) | |
292 | return(NULL); | |
293 | else | |
294 | { | |
295 | ad.type=ADDED_NID; | |
296 | ad.obj= &ob; | |
297 | ob.nid=n; | |
298 | adp=(ADDED_OBJ *)lh_retrieve(added,(char *)&ad); | |
299 | if (adp != NULL) | |
300 | return(adp->obj); | |
301 | else | |
302 | { | |
303 | OBJerr(OBJ_F_OBJ_NID2OBJ,OBJ_R_UNKNOWN_NID); | |
304 | return(NULL); | |
305 | } | |
306 | } | |
307 | } | |
308 | ||
309 | char *OBJ_nid2sn(n) | |
310 | int n; | |
311 | { | |
312 | ADDED_OBJ ad,*adp; | |
313 | ASN1_OBJECT ob; | |
314 | ||
315 | if ((n >= 0) && (n < NUM_NID)) | |
316 | { | |
317 | if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) | |
318 | { | |
319 | OBJerr(OBJ_F_OBJ_NID2SN,OBJ_R_UNKNOWN_NID); | |
320 | return(NULL); | |
321 | } | |
322 | return(nid_objs[n].sn); | |
323 | } | |
324 | else if (added == NULL) | |
325 | return(NULL); | |
326 | else | |
327 | { | |
328 | ad.type=ADDED_NID; | |
329 | ad.obj= &ob; | |
330 | ob.nid=n; | |
331 | adp=(ADDED_OBJ *)lh_retrieve(added,(char *)&ad); | |
332 | if (adp != NULL) | |
333 | return(adp->obj->sn); | |
334 | else | |
335 | { | |
336 | OBJerr(OBJ_F_OBJ_NID2SN,OBJ_R_UNKNOWN_NID); | |
337 | return(NULL); | |
338 | } | |
339 | } | |
340 | } | |
341 | ||
342 | char *OBJ_nid2ln(n) | |
343 | int n; | |
344 | { | |
345 | ADDED_OBJ ad,*adp; | |
346 | ASN1_OBJECT ob; | |
347 | ||
348 | if ((n >= 0) && (n < NUM_NID)) | |
349 | { | |
350 | if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) | |
351 | { | |
352 | OBJerr(OBJ_F_OBJ_NID2LN,OBJ_R_UNKNOWN_NID); | |
353 | return(NULL); | |
354 | } | |
355 | return(nid_objs[n].ln); | |
356 | } | |
357 | else if (added == NULL) | |
358 | return(NULL); | |
359 | else | |
360 | { | |
361 | ad.type=ADDED_NID; | |
362 | ad.obj= &ob; | |
363 | ob.nid=n; | |
364 | adp=(ADDED_OBJ *)lh_retrieve(added,(char *)&ad); | |
365 | if (adp != NULL) | |
366 | return(adp->obj->ln); | |
367 | else | |
368 | { | |
369 | OBJerr(OBJ_F_OBJ_NID2LN,OBJ_R_UNKNOWN_NID); | |
370 | return(NULL); | |
371 | } | |
372 | } | |
373 | } | |
374 | ||
375 | int OBJ_obj2nid(a) | |
376 | ASN1_OBJECT *a; | |
377 | { | |
378 | ASN1_OBJECT **op; | |
379 | ADDED_OBJ ad,*adp; | |
380 | ||
381 | if (a == NULL) | |
382 | return(NID_undef); | |
383 | if (a->nid != 0) | |
384 | return(a->nid); | |
385 | ||
386 | if (added != NULL) | |
387 | { | |
388 | ad.type=ADDED_DATA; | |
389 | ad.obj=a; | |
390 | adp=(ADDED_OBJ *)lh_retrieve(added,(char *)&ad); | |
391 | if (adp != NULL) return (adp->obj->nid); | |
392 | } | |
393 | op=(ASN1_OBJECT **)OBJ_bsearch((char *)&a,(char *)obj_objs,NUM_OBJ, | |
394 | sizeof(ASN1_OBJECT *),(int (*)())obj_cmp); | |
395 | if (op == NULL) | |
396 | return(NID_undef); | |
397 | return((*op)->nid); | |
398 | } | |
399 | ||
400 | int OBJ_txt2nid(s) | |
401 | char *s; | |
402 | { | |
403 | int ret; | |
404 | ||
405 | ret=OBJ_sn2nid(s); | |
406 | if (ret == NID_undef) | |
58964a49 RE |
407 | { |
408 | ret=OBJ_ln2nid(s); | |
409 | if (ret == NID_undef) | |
410 | { | |
411 | ASN1_OBJECT *op=NULL; | |
412 | unsigned char *buf,*p; | |
413 | int i; | |
414 | ||
415 | i=a2d_ASN1_OBJECT(NULL,0,s,-1); | |
416 | if (i <= 0) | |
417 | { | |
418 | /* clear the error */ | |
419 | ERR_get_error(); | |
420 | return(0); | |
421 | } | |
422 | ||
423 | if ((buf=(unsigned char *)Malloc(i)) == NULL) | |
424 | return(NID_undef); | |
425 | a2d_ASN1_OBJECT(buf,i,s,-1); | |
426 | p=buf; | |
427 | op=d2i_ASN1_OBJECT(NULL,&p,i); | |
428 | if (op == NULL) return(NID_undef); | |
429 | ret=OBJ_obj2nid(op); | |
430 | ASN1_OBJECT_free(op); | |
431 | Free(buf); | |
432 | } | |
433 | } | |
434 | return(ret); | |
d02b48c6 RE |
435 | } |
436 | ||
437 | int OBJ_ln2nid(s) | |
438 | char *s; | |
439 | { | |
440 | ASN1_OBJECT o,*oo= &o,**op; | |
441 | ADDED_OBJ ad,*adp; | |
442 | ||
443 | o.ln=s; | |
444 | if (added != NULL) | |
445 | { | |
446 | ad.type=ADDED_LNAME; | |
447 | ad.obj= &o; | |
448 | adp=(ADDED_OBJ *)lh_retrieve(added,(char *)&ad); | |
449 | if (adp != NULL) return (adp->obj->nid); | |
450 | } | |
451 | op=(ASN1_OBJECT **)OBJ_bsearch((char *)&oo,(char *)ln_objs,NUM_LN, | |
452 | sizeof(ASN1_OBJECT *),(int (*)())ln_cmp); | |
453 | if (op == NULL) return(NID_undef); | |
454 | return((*op)->nid); | |
455 | } | |
456 | ||
457 | int OBJ_sn2nid(s) | |
458 | char *s; | |
459 | { | |
460 | ASN1_OBJECT o,*oo= &o,**op; | |
461 | ADDED_OBJ ad,*adp; | |
462 | ||
463 | o.sn=s; | |
464 | if (added != NULL) | |
465 | { | |
466 | ad.type=ADDED_SNAME; | |
467 | ad.obj= &o; | |
468 | adp=(ADDED_OBJ *)lh_retrieve(added,(char *)&ad); | |
469 | if (adp != NULL) return (adp->obj->nid); | |
470 | } | |
471 | op=(ASN1_OBJECT **)OBJ_bsearch((char *)&oo,(char *)sn_objs,NUM_SN, | |
472 | sizeof(ASN1_OBJECT *),(int (*)())sn_cmp); | |
473 | if (op == NULL) return(NID_undef); | |
474 | return((*op)->nid); | |
475 | } | |
476 | ||
477 | static int obj_cmp(ap, bp) | |
478 | ASN1_OBJECT **ap; | |
479 | ASN1_OBJECT **bp; | |
480 | { | |
481 | int j; | |
482 | ASN1_OBJECT *a= *ap; | |
483 | ASN1_OBJECT *b= *bp; | |
484 | ||
485 | j=(a->length - b->length); | |
486 | if (j) return(j); | |
487 | return(memcmp(a->data,b->data,a->length)); | |
488 | } | |
489 | ||
490 | char *OBJ_bsearch(key,base,num,size,cmp) | |
491 | char *key; | |
492 | char *base; | |
493 | int num; | |
494 | int size; | |
495 | int (*cmp)(); | |
496 | { | |
497 | int l,h,i,c; | |
498 | char *p; | |
499 | ||
500 | if (num == 0) return(NULL); | |
501 | l=0; | |
502 | h=num; | |
503 | while (l < h) | |
504 | { | |
505 | i=(l+h)/2; | |
506 | p= &(base[i*size]); | |
507 | c=(*cmp)(key,p); | |
508 | if (c < 0) | |
509 | h=i; | |
510 | else if (c > 0) | |
511 | l=i+1; | |
512 | else | |
513 | return(p); | |
514 | } | |
515 | return(NULL); | |
516 | } | |
517 | ||
58964a49 RE |
518 | int OBJ_create_objects(in) |
519 | BIO *in; | |
520 | { | |
521 | MS_STATIC char buf[512]; | |
dfeab068 | 522 | int i,num=0; |
58964a49 RE |
523 | char *o,*s,*l=NULL; |
524 | ||
525 | for (;;) | |
526 | { | |
527 | s=o=NULL; | |
528 | i=BIO_gets(in,buf,512); | |
529 | if (i <= 0) return(num); | |
530 | buf[i-1]='\0'; | |
531 | if (!isalnum(buf[0])) return(num); | |
532 | o=s=buf; | |
533 | while (isdigit(*s) || (*s == '.')) | |
534 | s++; | |
535 | if (*s != '\0') | |
536 | { | |
537 | *(s++)='\0'; | |
538 | while (isspace(*s)) | |
539 | s++; | |
540 | if (*s == '\0') | |
541 | s=NULL; | |
542 | else | |
543 | { | |
544 | l=s; | |
545 | while ((*l != '\0') && !isspace(*l)) | |
546 | l++; | |
547 | if (*l != '\0') | |
548 | { | |
549 | *(l++)='\0'; | |
550 | while (isspace(*l)) | |
551 | l++; | |
552 | if (*l == '\0') l=NULL; | |
553 | } | |
554 | else | |
555 | l=NULL; | |
556 | } | |
557 | } | |
558 | else | |
559 | s=NULL; | |
560 | if ((o == NULL) || (*o == '\0')) return(num); | |
561 | if (!OBJ_create(o,s,l)) return(num); | |
562 | num++; | |
563 | } | |
dfeab068 | 564 | /* return(num); */ |
58964a49 RE |
565 | } |
566 | ||
567 | int OBJ_create(oid,sn,ln) | |
d02b48c6 RE |
568 | char *oid; |
569 | char *sn; | |
570 | char *ln; | |
571 | { | |
572 | int ok=0; | |
573 | ASN1_OBJECT *op=NULL; | |
574 | unsigned char *buf; | |
575 | int i; | |
576 | ||
577 | i=a2d_ASN1_OBJECT(NULL,0,oid,-1); | |
578 | if (i <= 0) return(0); | |
579 | ||
580 | if ((buf=(unsigned char *)Malloc(i)) == NULL) | |
581 | { | |
58964a49 | 582 | OBJerr(OBJ_F_OBJ_CREATE,OBJ_R_MALLOC_FAILURE); |
d02b48c6 RE |
583 | return(0); |
584 | } | |
585 | i=a2d_ASN1_OBJECT(buf,i,oid,-1); | |
586 | op=(ASN1_OBJECT *)ASN1_OBJECT_create(OBJ_new_nid(1),buf,i,sn,ln); | |
587 | if (op == NULL) | |
588 | goto err; | |
589 | ok=OBJ_add_object(op); | |
590 | err: | |
591 | ASN1_OBJECT_free(op); | |
592 | Free((char *)buf); | |
593 | return(ok); | |
594 | } | |
58964a49 | 595 |