2 /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL
5 /* ====================================================================
6 * Copyright (c) 1999 The OpenSSL Project. All rights reserved.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in
17 * the documentation and/or other materials provided with the
20 * 3. All advertising materials mentioning features or use of this
21 * software must display the following acknowledgment:
22 * "This product includes software developed by the OpenSSL Project
23 * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
25 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
26 * endorse or promote products derived from this software without
27 * prior written permission. For written permission, please contact
28 * licensing@OpenSSL.org.
30 * 5. Products derived from this software may not be called "OpenSSL"
31 * nor may "OpenSSL" appear in their names without prior written
32 * permission of the OpenSSL Project.
34 * 6. Redistributions of any form whatsoever must retain the following
36 * "This product includes software developed by the OpenSSL Project
37 * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
39 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
40 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
41 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
42 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
43 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
44 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
45 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
46 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
48 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
49 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
50 * OF THE POSSIBILITY OF SUCH DAMAGE.
51 * ====================================================================
53 * This product includes cryptographic software written by Eric Young
54 * (eay@cryptsoft.com). This product includes software written by Tim
55 * Hudson (tjh@cryptsoft.com).
66 /* Certificate policies extension support: this one is a bit complex... */
68 static int i2r_certpol(X509V3_EXT_METHOD *method, STACK_OF(POLICYINFO) *pol, BIO *out, int indent);
69 static STACK_OF(POLICYINFO) *r2i_certpol(X509V3_EXT_METHOD *method, X509V3_CTX *ctx, char *value);
70 static void print_qualifiers(BIO *out, STACK_OF(POLICYQUALINFO) *quals, int indent);
71 static void print_notice(BIO *out, USERNOTICE *notice, int indent);
72 static POLICYINFO *policy_section(X509V3_CTX *ctx, STACK *polstrs);
74 X509V3_EXT_METHOD v3_cpols = {
75 NID_certificate_policies, 0,
76 (X509V3_EXT_NEW)CERTIFICATEPOLICIES_new,
77 CERTIFICATEPOLICIES_free,
78 (X509V3_EXT_D2I)d2i_CERTIFICATEPOLICIES,
79 i2d_CERTIFICATEPOLICIES,
82 (X509V3_EXT_I2R)i2r_certpol,
83 (X509V3_EXT_R2I)r2i_certpol,
89 * ASN1err(ASN1_F_POLICYINFO_NEW,ERR_R_MALLOC_FAILURE);
90 * ASN1err(ASN1_F_D2I_POLICYINFO,ERR_R_MALLOC_FAILURE);
91 * ASN1err(ASN1_F_POLICYQUALINFO_NEW,ERR_R_MALLOC_FAILURE);
92 * ASN1err(ASN1_F_D2I_POLICYQUALINFO,ERR_R_MALLOC_FAILURE);
93 * ASN1err(ASN1_F_USERNOTICE_NEW,ERR_R_MALLOC_FAILURE);
94 * ASN1err(ASN1_F_D2I_USERNOTICE,ERR_R_MALLOC_FAILURE);
95 * ASN1err(ASN1_F_NOTICEREF_NEW,ERR_R_MALLOC_FAILURE);
96 * ASN1err(ASN1_F_D2I_NOTICEREF,ERR_R_MALLOC_FAILURE);
99 static STACK_OF(POLICYINFO) *r2i_certpol(method, ctx, value)
100 X509V3_EXT_METHOD *method;
104 STACK_OF(POLICYINFO) *pols = NULL;
111 pols = sk_POLICYINFO_new_null();
112 vals = X509V3_parse_list(value);
113 for(i = 0; i < sk_num(vals); i++) {
114 cnf = (CONF_VALUE *)sk_value(vals, i);
115 if(cnf->value || !cnf->name ) {
116 X509V3err(X509V3_F_R2I_CERTPOL,X509V3_R_INVALID_POLICY_IDENTIFIER);
117 X509V3_conf_err(cnf);
123 polsect = X509V3_get_section(ctx, pstr + 1);
125 X509V3err(X509V3_F_R2I_CERTPOL,X509V3_R_INVALID_SECTION);
127 X509V3_conf_err(cnf);
130 pol = policy_section(ctx, polsect);
131 X509V3_section_free(ctx, polsect);
134 if(!(pobj = OBJ_txt2obj(cnf->name, 0))) {
135 X509V3err(X509V3_F_R2I_CERTPOL,X509V3_R_INVALID_OBJECT_IDENTIFIER);
136 X509V3_conf_err(cnf);
139 pol = POLICYINFO_new();
140 pol->policyid = pobj;
142 sk_POLICYINFO_push(pols, pol);
144 sk_pop_free(vals, X509V3_conf_free);
147 sk_POLICYINFO_pop_free(pols, POLICYINFO_free);
151 static POLICYINFO *policy_section(ctx, polstrs)
157 for(i = 0; i < sk_num(polstrs); i++) {
158 cnf = (CONF_VALUE *)sk_value(polstrs, i);
164 static int i2r_certpol(method, pol, out, indent)
165 X509V3_EXT_METHOD *method;
166 STACK_OF(POLICYINFO) *pol;
172 /* First print out the policy OIDs */
173 for(i = 0; i < sk_POLICYINFO_num(pol); i++) {
174 pinfo = sk_POLICYINFO_value(pol, i);
175 BIO_printf(out, "%*sPolicy: ", indent, "");
176 i2a_ASN1_OBJECT(out, pinfo->policyid);
178 if(pinfo->qualifiers)
179 print_qualifiers(out, pinfo->qualifiers, indent + 2);
185 int i2d_CERTIFICATEPOLICIES(a, pp)
186 STACK_OF(POLICYINFO) *a;
190 return i2d_ASN1_SET_OF_POLICYINFO(a, pp, i2d_POLICYINFO, V_ASN1_SEQUENCE,
191 V_ASN1_UNIVERSAL, IS_SEQUENCE);}
193 STACK_OF(POLICYINFO) *CERTIFICATEPOLICIES_new()
195 return sk_POLICYINFO_new_null();
198 void CERTIFICATEPOLICIES_free(a)
199 STACK_OF(POLICYINFO) *a;
201 sk_POLICYINFO_pop_free(a, POLICYINFO_free);
204 STACK_OF(POLICYINFO) *d2i_CERTIFICATEPOLICIES(a,pp,length)
205 STACK_OF(POLICYINFO) **a;
209 return d2i_ASN1_SET_OF_POLICYINFO(a, pp, length, d2i_POLICYINFO,
210 POLICYINFO_free, V_ASN1_SEQUENCE, V_ASN1_UNIVERSAL);
214 IMPLEMENT_STACK_OF(POLICYINFO)
215 IMPLEMENT_ASN1_SET_OF(POLICYINFO)
217 int i2d_POLICYINFO(a,pp)
223 M_ASN1_I2D_len (a->policyid, i2d_ASN1_OBJECT);
224 M_ASN1_I2D_len_SEQUENCE_type(POLICYQUALINFO, a->qualifiers,
227 M_ASN1_I2D_seq_total();
229 M_ASN1_I2D_put (a->policyid, i2d_ASN1_OBJECT);
230 M_ASN1_I2D_put_SEQUENCE_type(POLICYQUALINFO, a->qualifiers,
236 POLICYINFO *POLICYINFO_new()
238 POLICYINFO *ret=NULL;
240 M_ASN1_New_Malloc(ret, POLICYINFO);
241 ret->policyid = NULL;
242 ret->qualifiers = NULL;
244 M_ASN1_New_Error(ASN1_F_POLICYINFO_NEW);
247 POLICYINFO *d2i_POLICYINFO(a,pp,length)
252 M_ASN1_D2I_vars(a,POLICYINFO *,POLICYINFO_new);
254 M_ASN1_D2I_start_sequence();
255 M_ASN1_D2I_get(ret->policyid, d2i_ASN1_OBJECT);
256 if(!M_ASN1_D2I_end_sequence()) {
257 M_ASN1_D2I_get_seq_type (POLICYQUALINFO, ret->qualifiers,
258 d2i_POLICYQUALINFO, POLICYQUALINFO_free);
260 M_ASN1_D2I_Finish(a, POLICYINFO_free, ASN1_F_D2I_POLICYINFO);
263 void POLICYINFO_free(a)
266 if (a == NULL) return;
267 ASN1_OBJECT_free(a->policyid);
268 sk_POLICYQUALINFO_pop_free(a->qualifiers, POLICYQUALINFO_free);
272 static void print_qualifiers(out, quals, indent)
274 STACK_OF(POLICYQUALINFO) *quals;
277 POLICYQUALINFO *qualinfo;
279 for(i = 0; i < sk_POLICYQUALINFO_num(quals); i++) {
280 qualinfo = sk_POLICYQUALINFO_value(quals, i);
281 switch(OBJ_obj2nid(qualinfo->pqualid))
284 BIO_printf(out, "%*sCPS: %s\n", indent, "",
285 qualinfo->d.cpsuri->data);
288 case NID_id_qt_unotice:
289 BIO_printf(out, "%*sUser Notice:\n", indent, "");
290 print_notice(out, qualinfo->d.usernotice, indent + 2);
294 BIO_printf(out, "%*sUnknown Qualifier: ",
297 i2a_ASN1_OBJECT(out, qualinfo->pqualid);
304 static void print_notice(out, notice, indent)
310 if(notice->noticeref) {
312 ref = notice->noticeref;
313 BIO_printf(out, "%*sOrganization: %s\n", indent, "",
314 ref->organization->data);
315 BIO_printf(out, "%*sNumber%s: ", indent, "",
316 (sk_num(ref->noticenos) > 1) ? "s" : "");
317 for(i = 0; i < sk_num(ref->noticenos); i++) {
320 num = (ASN1_INTEGER *)sk_value(ref->noticenos, i);
321 if(i) BIO_puts(out, ", ");
322 tmp = i2s_ASN1_INTEGER(NULL, num);
329 BIO_printf(out, "%*sNotice Reference: %s\n", indent, "",
330 notice->exptext->data);
335 int i2d_POLICYQUALINFO(a,pp)
341 M_ASN1_I2D_len (a->pqualid, i2d_ASN1_OBJECT);
342 switch(OBJ_obj2nid(a->pqualid)) {
344 M_ASN1_I2D_len(a->d.cpsuri, i2d_ASN1_IA5STRING);
347 case NID_id_qt_unotice:
348 M_ASN1_I2D_len(a->d.usernotice, i2d_USERNOTICE);
352 M_ASN1_I2D_len(a->d.other, i2d_ASN1_TYPE);
356 M_ASN1_I2D_seq_total();
358 M_ASN1_I2D_put (a->pqualid, i2d_ASN1_OBJECT);
359 switch(OBJ_obj2nid(a->pqualid)) {
361 M_ASN1_I2D_put(a->d.cpsuri, i2d_ASN1_IA5STRING);
364 case NID_id_qt_unotice:
365 M_ASN1_I2D_put(a->d.usernotice, i2d_USERNOTICE);
369 M_ASN1_I2D_put(a->d.other, i2d_ASN1_TYPE);
376 POLICYQUALINFO *POLICYQUALINFO_new()
378 POLICYQUALINFO *ret=NULL;
380 M_ASN1_New_Malloc(ret, POLICYQUALINFO);
384 M_ASN1_New_Error(ASN1_F_POLICYQUALINFO_NEW);
387 POLICYQUALINFO *d2i_POLICYQUALINFO(a,pp,length)
392 M_ASN1_D2I_vars(a,POLICYQUALINFO *,POLICYQUALINFO_new);
394 M_ASN1_D2I_start_sequence();
395 M_ASN1_D2I_get (ret->pqualid, d2i_ASN1_OBJECT);
396 switch(OBJ_obj2nid(ret->pqualid)) {
398 M_ASN1_D2I_get(ret->d.cpsuri, d2i_ASN1_IA5STRING);
401 case NID_id_qt_unotice:
402 M_ASN1_D2I_get(ret->d.usernotice, d2i_USERNOTICE);
406 M_ASN1_D2I_get(ret->d.other, d2i_ASN1_TYPE);
409 M_ASN1_D2I_Finish(a, POLICYQUALINFO_free, ASN1_F_D2I_POLICYQUALINFO);
412 void POLICYQUALINFO_free(a)
415 if (a == NULL) return;
416 switch(OBJ_obj2nid(a->pqualid)) {
418 ASN1_IA5STRING_free(a->d.cpsuri);
421 case NID_id_qt_unotice:
422 USERNOTICE_free(a->d.usernotice);
426 ASN1_TYPE_free(a->d.other);
430 ASN1_OBJECT_free(a->pqualid);
434 int i2d_USERNOTICE(a,pp)
440 M_ASN1_I2D_len (a->noticeref, i2d_NOTICEREF);
441 M_ASN1_I2D_len (a->exptext, i2d_DISPLAYTEXT);
443 M_ASN1_I2D_seq_total();
445 M_ASN1_I2D_put (a->noticeref, i2d_NOTICEREF);
446 M_ASN1_I2D_put (a->exptext, i2d_DISPLAYTEXT);
451 USERNOTICE *USERNOTICE_new()
453 USERNOTICE *ret=NULL;
455 M_ASN1_New_Malloc(ret, USERNOTICE);
456 ret->noticeref = NULL;
459 M_ASN1_New_Error(ASN1_F_USERNOTICE_NEW);
462 USERNOTICE *d2i_USERNOTICE(a,pp,length)
467 M_ASN1_D2I_vars(a,USERNOTICE *,USERNOTICE_new);
469 M_ASN1_D2I_start_sequence();
470 M_ASN1_D2I_get_opt(ret->noticeref, d2i_NOTICEREF, V_ASN1_SEQUENCE);
471 if (!M_ASN1_D2I_end_sequence()) {
472 M_ASN1_D2I_get(ret->exptext, d2i_DISPLAYTEXT);
474 M_ASN1_D2I_Finish(a, USERNOTICE_free, ASN1_F_D2I_USERNOTICE);
477 void USERNOTICE_free(a)
480 if (a == NULL) return;
481 NOTICEREF_free(a->noticeref);
482 DISPLAYTEXT_free(a->exptext);
486 int i2d_NOTICEREF(a,pp)
492 M_ASN1_I2D_len (a->organization, i2d_DISPLAYTEXT);
493 M_ASN1_I2D_len_SEQUENCE(a->noticenos, i2d_ASN1_INTEGER);
495 M_ASN1_I2D_seq_total();
497 M_ASN1_I2D_put (a->organization, i2d_DISPLAYTEXT);
498 M_ASN1_I2D_put_SEQUENCE(a->noticenos, i2d_ASN1_INTEGER);
503 NOTICEREF *NOTICEREF_new()
507 M_ASN1_New_Malloc(ret, NOTICEREF);
508 ret->organization = NULL;
509 ret->noticenos = NULL;
511 M_ASN1_New_Error(ASN1_F_NOTICEREF_NEW);
514 NOTICEREF *d2i_NOTICEREF(a,pp,length)
519 M_ASN1_D2I_vars(a,NOTICEREF *,NOTICEREF_new);
521 M_ASN1_D2I_start_sequence();
522 /* This is to cope with some broken encodings that use IA5STRING for
523 * the organization field
525 M_ASN1_D2I_get_opt(ret->organization, d2i_ASN1_IA5STRING,
527 if(!ret->organization) {
528 M_ASN1_D2I_get(ret->organization, d2i_DISPLAYTEXT);
530 M_ASN1_D2I_get_seq(ret->noticenos, d2i_ASN1_INTEGER, ASN1_STRING_free);
531 M_ASN1_D2I_Finish(a, NOTICEREF_free, ASN1_F_D2I_NOTICEREF);
534 void NOTICEREF_free(a)
537 if (a == NULL) return;
538 DISPLAYTEXT_free(a->organization);
539 sk_pop_free(a->noticenos, ASN1_STRING_free);
543 IMPLEMENT_STACK_OF(POLICYQUALINFO)
544 IMPLEMENT_ASN1_SET_OF(POLICYQUALINFO)