diff options
Diffstat (limited to 'src/lib/libcrypto/objects/obj_dat.c')
-rw-r--r-- | src/lib/libcrypto/objects/obj_dat.c | 667 |
1 files changed, 667 insertions, 0 deletions
diff --git a/src/lib/libcrypto/objects/obj_dat.c b/src/lib/libcrypto/objects/obj_dat.c new file mode 100644 index 0000000000..202bd168ac --- /dev/null +++ b/src/lib/libcrypto/objects/obj_dat.c | |||
@@ -0,0 +1,667 @@ | |||
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 "cryptlib.h" | ||
62 | #include <openssl/lhash.h> | ||
63 | #include <openssl/asn1.h> | ||
64 | #include <openssl/objects.h> | ||
65 | |||
66 | /* obj_dat.h is generated from objects.h by obj_dat.pl */ | ||
67 | #ifndef OPENSSL_NO_OBJECT | ||
68 | #include "obj_dat.h" | ||
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 | ||
81 | |||
82 | static int sn_cmp(const void *a, const void *b); | ||
83 | static int ln_cmp(const void *a, const void *b); | ||
84 | static int obj_cmp(const void *a, const void *b); | ||
85 | #define ADDED_DATA 0 | ||
86 | #define ADDED_SNAME 1 | ||
87 | #define ADDED_LNAME 2 | ||
88 | #define ADDED_NID 3 | ||
89 | |||
90 | typedef struct added_obj_st | ||
91 | { | ||
92 | int type; | ||
93 | ASN1_OBJECT *obj; | ||
94 | } ADDED_OBJ; | ||
95 | |||
96 | static int new_nid=NUM_NID; | ||
97 | static LHASH *added=NULL; | ||
98 | |||
99 | static int sn_cmp(const void *a, const void *b) | ||
100 | { | ||
101 | const ASN1_OBJECT * const *ap = a, * const *bp = b; | ||
102 | return(strcmp((*ap)->sn,(*bp)->sn)); | ||
103 | } | ||
104 | |||
105 | static int ln_cmp(const void *a, const void *b) | ||
106 | { | ||
107 | const ASN1_OBJECT * const *ap = a, * const *bp = b; | ||
108 | return(strcmp((*ap)->ln,(*bp)->ln)); | ||
109 | } | ||
110 | |||
111 | /* static unsigned long add_hash(ADDED_OBJ *ca) */ | ||
112 | static unsigned long add_hash(const void *ca_void) | ||
113 | { | ||
114 | const ASN1_OBJECT *a; | ||
115 | int i; | ||
116 | unsigned long ret=0; | ||
117 | unsigned char *p; | ||
118 | ADDED_OBJ *ca = (ADDED_OBJ *)ca_void; | ||
119 | |||
120 | a=ca->obj; | ||
121 | switch (ca->type) | ||
122 | { | ||
123 | case ADDED_DATA: | ||
124 | ret=a->length<<20L; | ||
125 | p=(unsigned char *)a->data; | ||
126 | for (i=0; i<a->length; i++) | ||
127 | ret^=p[i]<<((i*3)%24); | ||
128 | break; | ||
129 | case ADDED_SNAME: | ||
130 | ret=lh_strhash(a->sn); | ||
131 | break; | ||
132 | case ADDED_LNAME: | ||
133 | ret=lh_strhash(a->ln); | ||
134 | break; | ||
135 | case ADDED_NID: | ||
136 | ret=a->nid; | ||
137 | break; | ||
138 | default: | ||
139 | /* abort(); */ | ||
140 | return 0; | ||
141 | } | ||
142 | ret&=0x3fffffffL; | ||
143 | ret|=ca->type<<30L; | ||
144 | return(ret); | ||
145 | } | ||
146 | |||
147 | /* static int add_cmp(ADDED_OBJ *ca, ADDED_OBJ *cb) */ | ||
148 | static int add_cmp(const void *ca_void, const void *cb_void) | ||
149 | { | ||
150 | ASN1_OBJECT *a,*b; | ||
151 | int i; | ||
152 | ADDED_OBJ *ca = (ADDED_OBJ *)ca_void; | ||
153 | ADDED_OBJ *cb = (ADDED_OBJ *)cb_void; | ||
154 | |||
155 | i=ca->type-cb->type; | ||
156 | if (i) return(i); | ||
157 | a=ca->obj; | ||
158 | b=cb->obj; | ||
159 | switch (ca->type) | ||
160 | { | ||
161 | case ADDED_DATA: | ||
162 | i=(a->length - b->length); | ||
163 | if (i) return(i); | ||
164 | return(memcmp(a->data,b->data,a->length)); | ||
165 | case ADDED_SNAME: | ||
166 | if (a->sn == NULL) return(-1); | ||
167 | else if (b->sn == NULL) return(1); | ||
168 | else return(strcmp(a->sn,b->sn)); | ||
169 | case ADDED_LNAME: | ||
170 | if (a->ln == NULL) return(-1); | ||
171 | else if (b->ln == NULL) return(1); | ||
172 | else return(strcmp(a->ln,b->ln)); | ||
173 | case ADDED_NID: | ||
174 | return(a->nid-b->nid); | ||
175 | default: | ||
176 | /* abort(); */ | ||
177 | return 0; | ||
178 | } | ||
179 | } | ||
180 | |||
181 | static int init_added(void) | ||
182 | { | ||
183 | if (added != NULL) return(1); | ||
184 | added=lh_new(add_hash,add_cmp); | ||
185 | return(added != NULL); | ||
186 | } | ||
187 | |||
188 | static void cleanup1(ADDED_OBJ *a) | ||
189 | { | ||
190 | a->obj->nid=0; | ||
191 | a->obj->flags|=ASN1_OBJECT_FLAG_DYNAMIC| | ||
192 | ASN1_OBJECT_FLAG_DYNAMIC_STRINGS| | ||
193 | ASN1_OBJECT_FLAG_DYNAMIC_DATA; | ||
194 | } | ||
195 | |||
196 | static void cleanup2(ADDED_OBJ *a) | ||
197 | { a->obj->nid++; } | ||
198 | |||
199 | static void cleanup3(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 | void OBJ_cleanup(void) | ||
211 | { | ||
212 | if (added == NULL) return; | ||
213 | added->down_load=0; | ||
214 | lh_doall(added,LHASH_DOALL_FN(cleanup1)); /* zero counters */ | ||
215 | lh_doall(added,LHASH_DOALL_FN(cleanup2)); /* set counters */ | ||
216 | lh_doall(added,LHASH_DOALL_FN(cleanup3)); /* free objects */ | ||
217 | lh_free(added); | ||
218 | added=NULL; | ||
219 | } | ||
220 | |||
221 | int OBJ_new_nid(int num) | ||
222 | { | ||
223 | int i; | ||
224 | |||
225 | i=new_nid; | ||
226 | new_nid+=num; | ||
227 | return(i); | ||
228 | } | ||
229 | |||
230 | int OBJ_add_object(const ASN1_OBJECT *obj) | ||
231 | { | ||
232 | ASN1_OBJECT *o; | ||
233 | ADDED_OBJ *ao[4]={NULL,NULL,NULL,NULL},*aop; | ||
234 | int i; | ||
235 | |||
236 | if (added == NULL) | ||
237 | if (!init_added()) return(0); | ||
238 | if ((o=OBJ_dup(obj)) == NULL) goto err; | ||
239 | if (!(ao[ADDED_NID]=(ADDED_OBJ *)OPENSSL_malloc(sizeof(ADDED_OBJ)))) goto err; | ||
240 | if ((o->length != 0) && (obj->data != NULL)) | ||
241 | ao[ADDED_DATA]=(ADDED_OBJ *)OPENSSL_malloc(sizeof(ADDED_OBJ)); | ||
242 | if (o->sn != NULL) | ||
243 | ao[ADDED_SNAME]=(ADDED_OBJ *)OPENSSL_malloc(sizeof(ADDED_OBJ)); | ||
244 | if (o->ln != NULL) | ||
245 | ao[ADDED_LNAME]=(ADDED_OBJ *)OPENSSL_malloc(sizeof(ADDED_OBJ)); | ||
246 | |||
247 | for (i=ADDED_DATA; i<=ADDED_NID; i++) | ||
248 | { | ||
249 | if (ao[i] != NULL) | ||
250 | { | ||
251 | ao[i]->type=i; | ||
252 | ao[i]->obj=o; | ||
253 | aop=(ADDED_OBJ *)lh_insert(added,ao[i]); | ||
254 | /* memory leak, buit should not normally matter */ | ||
255 | if (aop != NULL) | ||
256 | OPENSSL_free(aop); | ||
257 | } | ||
258 | } | ||
259 | o->flags&= ~(ASN1_OBJECT_FLAG_DYNAMIC|ASN1_OBJECT_FLAG_DYNAMIC_STRINGS| | ||
260 | ASN1_OBJECT_FLAG_DYNAMIC_DATA); | ||
261 | |||
262 | return(o->nid); | ||
263 | err: | ||
264 | for (i=ADDED_DATA; i<=ADDED_NID; i++) | ||
265 | if (ao[i] != NULL) OPENSSL_free(ao[i]); | ||
266 | if (o != NULL) OPENSSL_free(o); | ||
267 | return(NID_undef); | ||
268 | } | ||
269 | |||
270 | ASN1_OBJECT *OBJ_nid2obj(int n) | ||
271 | { | ||
272 | ADDED_OBJ ad,*adp; | ||
273 | ASN1_OBJECT ob; | ||
274 | |||
275 | if ((n >= 0) && (n < NUM_NID)) | ||
276 | { | ||
277 | if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) | ||
278 | { | ||
279 | OBJerr(OBJ_F_OBJ_NID2OBJ,OBJ_R_UNKNOWN_NID); | ||
280 | return(NULL); | ||
281 | } | ||
282 | return((ASN1_OBJECT *)&(nid_objs[n])); | ||
283 | } | ||
284 | else if (added == NULL) | ||
285 | return(NULL); | ||
286 | else | ||
287 | { | ||
288 | ad.type=ADDED_NID; | ||
289 | ad.obj= &ob; | ||
290 | ob.nid=n; | ||
291 | adp=(ADDED_OBJ *)lh_retrieve(added,&ad); | ||
292 | if (adp != NULL) | ||
293 | return(adp->obj); | ||
294 | else | ||
295 | { | ||
296 | OBJerr(OBJ_F_OBJ_NID2OBJ,OBJ_R_UNKNOWN_NID); | ||
297 | return(NULL); | ||
298 | } | ||
299 | } | ||
300 | } | ||
301 | |||
302 | const char *OBJ_nid2sn(int n) | ||
303 | { | ||
304 | ADDED_OBJ ad,*adp; | ||
305 | ASN1_OBJECT ob; | ||
306 | |||
307 | if ((n >= 0) && (n < NUM_NID)) | ||
308 | { | ||
309 | if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) | ||
310 | { | ||
311 | OBJerr(OBJ_F_OBJ_NID2SN,OBJ_R_UNKNOWN_NID); | ||
312 | return(NULL); | ||
313 | } | ||
314 | return(nid_objs[n].sn); | ||
315 | } | ||
316 | else if (added == NULL) | ||
317 | return(NULL); | ||
318 | else | ||
319 | { | ||
320 | ad.type=ADDED_NID; | ||
321 | ad.obj= &ob; | ||
322 | ob.nid=n; | ||
323 | adp=(ADDED_OBJ *)lh_retrieve(added,&ad); | ||
324 | if (adp != NULL) | ||
325 | return(adp->obj->sn); | ||
326 | else | ||
327 | { | ||
328 | OBJerr(OBJ_F_OBJ_NID2SN,OBJ_R_UNKNOWN_NID); | ||
329 | return(NULL); | ||
330 | } | ||
331 | } | ||
332 | } | ||
333 | |||
334 | const char *OBJ_nid2ln(int n) | ||
335 | { | ||
336 | ADDED_OBJ ad,*adp; | ||
337 | ASN1_OBJECT ob; | ||
338 | |||
339 | if ((n >= 0) && (n < NUM_NID)) | ||
340 | { | ||
341 | if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) | ||
342 | { | ||
343 | OBJerr(OBJ_F_OBJ_NID2LN,OBJ_R_UNKNOWN_NID); | ||
344 | return(NULL); | ||
345 | } | ||
346 | return(nid_objs[n].ln); | ||
347 | } | ||
348 | else if (added == NULL) | ||
349 | return(NULL); | ||
350 | else | ||
351 | { | ||
352 | ad.type=ADDED_NID; | ||
353 | ad.obj= &ob; | ||
354 | ob.nid=n; | ||
355 | adp=(ADDED_OBJ *)lh_retrieve(added,&ad); | ||
356 | if (adp != NULL) | ||
357 | return(adp->obj->ln); | ||
358 | else | ||
359 | { | ||
360 | OBJerr(OBJ_F_OBJ_NID2LN,OBJ_R_UNKNOWN_NID); | ||
361 | return(NULL); | ||
362 | } | ||
363 | } | ||
364 | } | ||
365 | |||
366 | int OBJ_obj2nid(const ASN1_OBJECT *a) | ||
367 | { | ||
368 | ASN1_OBJECT **op; | ||
369 | ADDED_OBJ ad,*adp; | ||
370 | |||
371 | if (a == NULL) | ||
372 | return(NID_undef); | ||
373 | if (a->nid != 0) | ||
374 | return(a->nid); | ||
375 | |||
376 | if (added != NULL) | ||
377 | { | ||
378 | ad.type=ADDED_DATA; | ||
379 | ad.obj=(ASN1_OBJECT *)a; /* XXX: ugly but harmless */ | ||
380 | adp=(ADDED_OBJ *)lh_retrieve(added,&ad); | ||
381 | if (adp != NULL) return (adp->obj->nid); | ||
382 | } | ||
383 | op=(ASN1_OBJECT **)OBJ_bsearch((char *)&a,(char *)obj_objs,NUM_OBJ, | ||
384 | sizeof(ASN1_OBJECT *),obj_cmp); | ||
385 | if (op == NULL) | ||
386 | return(NID_undef); | ||
387 | return((*op)->nid); | ||
388 | } | ||
389 | |||
390 | /* Convert an object name into an ASN1_OBJECT | ||
391 | * if "noname" is not set then search for short and long names first. | ||
392 | * This will convert the "dotted" form into an object: unlike OBJ_txt2nid | ||
393 | * it can be used with any objects, not just registered ones. | ||
394 | */ | ||
395 | |||
396 | ASN1_OBJECT *OBJ_txt2obj(const char *s, int no_name) | ||
397 | { | ||
398 | int nid = NID_undef; | ||
399 | ASN1_OBJECT *op=NULL; | ||
400 | unsigned char *buf,*p; | ||
401 | int i, j; | ||
402 | |||
403 | if(!no_name) { | ||
404 | if( ((nid = OBJ_sn2nid(s)) != NID_undef) || | ||
405 | ((nid = OBJ_ln2nid(s)) != NID_undef) ) | ||
406 | return OBJ_nid2obj(nid); | ||
407 | } | ||
408 | |||
409 | /* Work out size of content octets */ | ||
410 | i=a2d_ASN1_OBJECT(NULL,0,s,-1); | ||
411 | if (i <= 0) { | ||
412 | /* Clear the error */ | ||
413 | ERR_get_error(); | ||
414 | return NULL; | ||
415 | } | ||
416 | /* Work out total size */ | ||
417 | j = ASN1_object_size(0,i,V_ASN1_OBJECT); | ||
418 | |||
419 | if((buf=(unsigned char *)OPENSSL_malloc(j)) == NULL) return NULL; | ||
420 | |||
421 | p = buf; | ||
422 | /* Write out tag+length */ | ||
423 | ASN1_put_object(&p,0,i,V_ASN1_OBJECT,V_ASN1_UNIVERSAL); | ||
424 | /* Write out contents */ | ||
425 | a2d_ASN1_OBJECT(p,i,s,-1); | ||
426 | |||
427 | p=buf; | ||
428 | op=d2i_ASN1_OBJECT(NULL,&p,j); | ||
429 | OPENSSL_free(buf); | ||
430 | return op; | ||
431 | } | ||
432 | |||
433 | int OBJ_obj2txt(char *buf, int buf_len, const ASN1_OBJECT *a, int no_name) | ||
434 | { | ||
435 | int i,idx=0,n=0,len,nid; | ||
436 | unsigned long l; | ||
437 | unsigned char *p; | ||
438 | const char *s; | ||
439 | char tbuf[DECIMAL_SIZE(i)+DECIMAL_SIZE(l)+2]; | ||
440 | |||
441 | if (buf_len <= 0) return(0); | ||
442 | |||
443 | if ((a == NULL) || (a->data == NULL)) { | ||
444 | buf[0]='\0'; | ||
445 | return(0); | ||
446 | } | ||
447 | |||
448 | if (no_name || (nid=OBJ_obj2nid(a)) == NID_undef) { | ||
449 | len=a->length; | ||
450 | p=a->data; | ||
451 | |||
452 | idx=0; | ||
453 | l=0; | ||
454 | while (idx < a->length) { | ||
455 | l|=(p[idx]&0x7f); | ||
456 | if (!(p[idx] & 0x80)) break; | ||
457 | l<<=7L; | ||
458 | idx++; | ||
459 | } | ||
460 | idx++; | ||
461 | i=(int)(l/40); | ||
462 | if (i > 2) i=2; | ||
463 | l-=(long)(i*40); | ||
464 | |||
465 | snprintf(tbuf,sizeof tbuf,"%d.%lu",i,l); | ||
466 | i=strlen(tbuf); | ||
467 | strncpy(buf,tbuf,buf_len); | ||
468 | buf_len-=i; | ||
469 | buf+=i; | ||
470 | n+=i; | ||
471 | |||
472 | l=0; | ||
473 | for (; idx<len; idx++) { | ||
474 | l|=p[idx]&0x7f; | ||
475 | if (!(p[idx] & 0x80)) { | ||
476 | snprintf(tbuf,sizeof tbuf,".%lu",l); | ||
477 | i=strlen(tbuf); | ||
478 | if (buf_len > 0) | ||
479 | strncpy(buf,tbuf,buf_len); | ||
480 | buf_len-=i; | ||
481 | buf+=i; | ||
482 | n+=i; | ||
483 | l=0; | ||
484 | } | ||
485 | l<<=7L; | ||
486 | } | ||
487 | } else { | ||
488 | s=OBJ_nid2ln(nid); | ||
489 | if (s == NULL) | ||
490 | s=OBJ_nid2sn(nid); | ||
491 | strncpy(buf,s,buf_len); | ||
492 | n=strlen(s); | ||
493 | } | ||
494 | buf[buf_len-1]='\0'; | ||
495 | return(n); | ||
496 | } | ||
497 | |||
498 | int OBJ_txt2nid(const char *s) | ||
499 | { | ||
500 | ASN1_OBJECT *obj; | ||
501 | int nid; | ||
502 | obj = OBJ_txt2obj(s, 0); | ||
503 | nid = OBJ_obj2nid(obj); | ||
504 | ASN1_OBJECT_free(obj); | ||
505 | return nid; | ||
506 | } | ||
507 | |||
508 | int OBJ_ln2nid(const char *s) | ||
509 | { | ||
510 | ASN1_OBJECT o,*oo= &o,**op; | ||
511 | ADDED_OBJ ad,*adp; | ||
512 | |||
513 | o.ln=s; | ||
514 | if (added != NULL) | ||
515 | { | ||
516 | ad.type=ADDED_LNAME; | ||
517 | ad.obj= &o; | ||
518 | adp=(ADDED_OBJ *)lh_retrieve(added,&ad); | ||
519 | if (adp != NULL) return (adp->obj->nid); | ||
520 | } | ||
521 | op=(ASN1_OBJECT **)OBJ_bsearch((char *)&oo,(char *)ln_objs,NUM_LN, | ||
522 | sizeof(ASN1_OBJECT *),ln_cmp); | ||
523 | if (op == NULL) return(NID_undef); | ||
524 | return((*op)->nid); | ||
525 | } | ||
526 | |||
527 | int OBJ_sn2nid(const char *s) | ||
528 | { | ||
529 | ASN1_OBJECT o,*oo= &o,**op; | ||
530 | ADDED_OBJ ad,*adp; | ||
531 | |||
532 | o.sn=s; | ||
533 | if (added != NULL) | ||
534 | { | ||
535 | ad.type=ADDED_SNAME; | ||
536 | ad.obj= &o; | ||
537 | adp=(ADDED_OBJ *)lh_retrieve(added,&ad); | ||
538 | if (adp != NULL) return (adp->obj->nid); | ||
539 | } | ||
540 | op=(ASN1_OBJECT **)OBJ_bsearch((char *)&oo,(char *)sn_objs,NUM_SN, | ||
541 | sizeof(ASN1_OBJECT *),sn_cmp); | ||
542 | if (op == NULL) return(NID_undef); | ||
543 | return((*op)->nid); | ||
544 | } | ||
545 | |||
546 | static int obj_cmp(const void *ap, const void *bp) | ||
547 | { | ||
548 | int j; | ||
549 | ASN1_OBJECT *a= *(ASN1_OBJECT **)ap; | ||
550 | ASN1_OBJECT *b= *(ASN1_OBJECT **)bp; | ||
551 | |||
552 | j=(a->length - b->length); | ||
553 | if (j) return(j); | ||
554 | return(memcmp(a->data,b->data,a->length)); | ||
555 | } | ||
556 | |||
557 | const char *OBJ_bsearch(const char *key, const char *base, int num, int size, | ||
558 | int (*cmp)(const void *, const void *)) | ||
559 | { | ||
560 | int l,h,i,c; | ||
561 | const char *p; | ||
562 | |||
563 | if (num == 0) return(NULL); | ||
564 | l=0; | ||
565 | h=num; | ||
566 | while (l < h) | ||
567 | { | ||
568 | i=(l+h)/2; | ||
569 | p= &(base[i*size]); | ||
570 | c=(*cmp)(key,p); | ||
571 | if (c < 0) | ||
572 | h=i; | ||
573 | else if (c > 0) | ||
574 | l=i+1; | ||
575 | else | ||
576 | return(p); | ||
577 | } | ||
578 | #ifdef CHARSET_EBCDIC | ||
579 | /* THIS IS A KLUDGE - Because the *_obj is sorted in ASCII order, and | ||
580 | * I don't have perl (yet), we revert to a *LINEAR* search | ||
581 | * when the object wasn't found in the binary search. | ||
582 | */ | ||
583 | for (i=0; i<num; ++i) { | ||
584 | p= &(base[i*size]); | ||
585 | if ((*cmp)(key,p) == 0) | ||
586 | return p; | ||
587 | } | ||
588 | #endif | ||
589 | return(NULL); | ||
590 | } | ||
591 | |||
592 | int OBJ_create_objects(BIO *in) | ||
593 | { | ||
594 | MS_STATIC char buf[512]; | ||
595 | int i,num=0; | ||
596 | char *o,*s,*l=NULL; | ||
597 | |||
598 | for (;;) | ||
599 | { | ||
600 | s=o=NULL; | ||
601 | i=BIO_gets(in,buf,512); | ||
602 | if (i <= 0) return(num); | ||
603 | buf[i-1]='\0'; | ||
604 | if (!isalnum((unsigned char)buf[0])) return(num); | ||
605 | o=s=buf; | ||
606 | while (isdigit((unsigned char)*s) || (*s == '.')) | ||
607 | s++; | ||
608 | if (*s != '\0') | ||
609 | { | ||
610 | *(s++)='\0'; | ||
611 | while (isspace((unsigned char)*s)) | ||
612 | s++; | ||
613 | if (*s == '\0') | ||
614 | s=NULL; | ||
615 | else | ||
616 | { | ||
617 | l=s; | ||
618 | while ((*l != '\0') && !isspace((unsigned char)*l)) | ||
619 | l++; | ||
620 | if (*l != '\0') | ||
621 | { | ||
622 | *(l++)='\0'; | ||
623 | while (isspace((unsigned char)*l)) | ||
624 | l++; | ||
625 | if (*l == '\0') l=NULL; | ||
626 | } | ||
627 | else | ||
628 | l=NULL; | ||
629 | } | ||
630 | } | ||
631 | else | ||
632 | s=NULL; | ||
633 | if ((o == NULL) || (*o == '\0')) return(num); | ||
634 | if (!OBJ_create(o,s,l)) return(num); | ||
635 | num++; | ||
636 | } | ||
637 | /* return(num); */ | ||
638 | } | ||
639 | |||
640 | int OBJ_create(const char *oid, const char *sn, const char *ln) | ||
641 | { | ||
642 | int ok=0; | ||
643 | ASN1_OBJECT *op=NULL; | ||
644 | unsigned char *buf; | ||
645 | int i; | ||
646 | |||
647 | i=a2d_ASN1_OBJECT(NULL,0,oid,-1); | ||
648 | if (i <= 0) return(0); | ||
649 | |||
650 | if ((buf=(unsigned char *)OPENSSL_malloc(i)) == NULL) | ||
651 | { | ||
652 | OBJerr(OBJ_F_OBJ_CREATE,OBJ_R_MALLOC_FAILURE); | ||
653 | return(0); | ||
654 | } | ||
655 | i=a2d_ASN1_OBJECT(buf,i,oid,-1); | ||
656 | if (i == 0) | ||
657 | goto err; | ||
658 | op=(ASN1_OBJECT *)ASN1_OBJECT_create(OBJ_new_nid(1),buf,i,sn,ln); | ||
659 | if (op == NULL) | ||
660 | goto err; | ||
661 | ok=OBJ_add_object(op); | ||
662 | err: | ||
663 | ASN1_OBJECT_free(op); | ||
664 | OPENSSL_free(buf); | ||
665 | return(ok); | ||
666 | } | ||
667 | |||