sl@0: /* v3_ncons.c */
sl@0: /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL
sl@0:  * project.
sl@0:  */
sl@0: /* ====================================================================
sl@0:  * Copyright (c) 2003 The OpenSSL Project.  All rights reserved.
sl@0:  *
sl@0:  * Redistribution and use in source and binary forms, with or without
sl@0:  * modification, are permitted provided that the following conditions
sl@0:  * are met:
sl@0:  *
sl@0:  * 1. Redistributions of source code must retain the above copyright
sl@0:  *    notice, this list of conditions and the following disclaimer. 
sl@0:  *
sl@0:  * 2. Redistributions in binary form must reproduce the above copyright
sl@0:  *    notice, this list of conditions and the following disclaimer in
sl@0:  *    the documentation and/or other materials provided with the
sl@0:  *    distribution.
sl@0:  *
sl@0:  * 3. All advertising materials mentioning features or use of this
sl@0:  *    software must display the following acknowledgment:
sl@0:  *    "This product includes software developed by the OpenSSL Project
sl@0:  *    for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
sl@0:  *
sl@0:  * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
sl@0:  *    endorse or promote products derived from this software without
sl@0:  *    prior written permission. For written permission, please contact
sl@0:  *    licensing@OpenSSL.org.
sl@0:  *
sl@0:  * 5. Products derived from this software may not be called "OpenSSL"
sl@0:  *    nor may "OpenSSL" appear in their names without prior written
sl@0:  *    permission of the OpenSSL Project.
sl@0:  *
sl@0:  * 6. Redistributions of any form whatsoever must retain the following
sl@0:  *    acknowledgment:
sl@0:  *    "This product includes software developed by the OpenSSL Project
sl@0:  *    for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
sl@0:  *
sl@0:  * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
sl@0:  * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
sl@0:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
sl@0:  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
sl@0:  * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
sl@0:  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
sl@0:  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
sl@0:  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
sl@0:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
sl@0:  * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
sl@0:  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
sl@0:  * OF THE POSSIBILITY OF SUCH DAMAGE.
sl@0:  * ====================================================================
sl@0:  *
sl@0:  * This product includes cryptographic software written by Eric Young
sl@0:  * (eay@cryptsoft.com).  This product includes software written by Tim
sl@0:  * Hudson (tjh@cryptsoft.com).
sl@0:  *
sl@0:  */
sl@0:  /*
sl@0:  © Portions copyright (c) 2006 Nokia Corporation.  All rights reserved.
sl@0:  */
sl@0: 
sl@0: 
sl@0: 
sl@0: 
sl@0: #include <stdio.h>
sl@0: #include "cryptlib.h"
sl@0: #include <openssl/asn1t.h>
sl@0: #include <openssl/conf.h>
sl@0: #include <openssl/x509v3.h>
sl@0: #if (defined(SYMBIAN) && (defined(__WINSCW__) || defined(__WINS__)))
sl@0: #include "libcrypto_wsd_macros.h"
sl@0: #include "libcrypto_wsd.h"
sl@0: #endif
sl@0: 
sl@0: static void *v2i_NAME_CONSTRAINTS(X509V3_EXT_METHOD *method,
sl@0: 				X509V3_CTX *ctx, STACK_OF(CONF_VALUE) *nval);
sl@0: static int i2r_NAME_CONSTRAINTS(X509V3_EXT_METHOD *method, 
sl@0: 				void *a, BIO *bp, int ind);
sl@0: static int do_i2r_name_constraints(X509V3_EXT_METHOD *method,
sl@0: 				STACK_OF(GENERAL_SUBTREE) *trees,
sl@0: 					BIO *bp, int ind, char *name);
sl@0: static int print_nc_ipadd(BIO *bp, ASN1_OCTET_STRING *ip);
sl@0: 
sl@0: #ifndef EMULATOR
sl@0: X509V3_EXT_METHOD v3_name_constraints = {
sl@0: 	NID_name_constraints, 0,
sl@0: 	ASN1_ITEM_ref(NAME_CONSTRAINTS),
sl@0: 	0,0,0,0,
sl@0: 	0,0,
sl@0: 	0, v2i_NAME_CONSTRAINTS,
sl@0: 	i2r_NAME_CONSTRAINTS,0,
sl@0: 	NULL
sl@0: };
sl@0: #else
sl@0: const X509V3_EXT_METHOD v3_name_constraints = {
sl@0: 	NID_name_constraints, 0,
sl@0: 	ASN1_ITEM_ref(NAME_CONSTRAINTS),
sl@0: 	0,0,0,0,
sl@0: 	0,0,
sl@0: 	0, v2i_NAME_CONSTRAINTS,
sl@0: 	i2r_NAME_CONSTRAINTS,0,
sl@0: 	NULL
sl@0: };
sl@0: #endif
sl@0: ASN1_SEQUENCE(GENERAL_SUBTREE) = {
sl@0: 	ASN1_SIMPLE(GENERAL_SUBTREE, base, GENERAL_NAME),
sl@0: 	ASN1_IMP_OPT(GENERAL_SUBTREE, minimum, ASN1_INTEGER, 0),
sl@0: 	ASN1_IMP_OPT(GENERAL_SUBTREE, maximum, ASN1_INTEGER, 1)
sl@0: } ASN1_SEQUENCE_END(GENERAL_SUBTREE)
sl@0: 
sl@0: ASN1_SEQUENCE(NAME_CONSTRAINTS) = {
sl@0: 	ASN1_IMP_SEQUENCE_OF_OPT(NAME_CONSTRAINTS, permittedSubtrees,
sl@0: 							GENERAL_SUBTREE, 0),
sl@0: 	ASN1_IMP_SEQUENCE_OF_OPT(NAME_CONSTRAINTS, excludedSubtrees,
sl@0: 							GENERAL_SUBTREE, 1),
sl@0: } ASN1_SEQUENCE_END(NAME_CONSTRAINTS)
sl@0: 	
sl@0: 
sl@0: IMPLEMENT_ASN1_ALLOC_FUNCTIONS(GENERAL_SUBTREE)
sl@0: IMPLEMENT_ASN1_ALLOC_FUNCTIONS(NAME_CONSTRAINTS)
sl@0: 
sl@0: static void *v2i_NAME_CONSTRAINTS(X509V3_EXT_METHOD *method,
sl@0: 				X509V3_CTX *ctx, STACK_OF(CONF_VALUE) *nval)
sl@0: 	{
sl@0: 	int i;
sl@0: 	CONF_VALUE tval, *val;
sl@0: 	STACK_OF(GENERAL_SUBTREE) **ptree = NULL;
sl@0: 	NAME_CONSTRAINTS *ncons = NULL;
sl@0: 	GENERAL_SUBTREE *sub = NULL;
sl@0: 	ncons = NAME_CONSTRAINTS_new();
sl@0: 	if (!ncons)
sl@0: 		goto memerr;
sl@0: 	for(i = 0; i < sk_CONF_VALUE_num(nval); i++)
sl@0: 		{
sl@0: 		val = sk_CONF_VALUE_value(nval, i);
sl@0: 		if (!strncmp(val->name, "permitted", 9) && val->name[9])
sl@0: 			{
sl@0: 			ptree = &ncons->permittedSubtrees;
sl@0: 			tval.name = val->name + 10;
sl@0: 			}
sl@0: 		else if (!strncmp(val->name, "excluded", 8) && val->name[8])
sl@0: 			{
sl@0: 			ptree = &ncons->excludedSubtrees;
sl@0: 			tval.name = val->name + 9;
sl@0: 			}
sl@0: 		else
sl@0: 			{
sl@0: 			X509V3err(X509V3_F_V2I_NAME_CONSTRAINTS, X509V3_R_INVALID_SYNTAX);
sl@0: 			goto err;
sl@0: 			}
sl@0: 		tval.value = val->value;
sl@0: 		sub = GENERAL_SUBTREE_new();
sl@0: 		if (!v2i_GENERAL_NAME_ex(sub->base, method, ctx, &tval, 1))
sl@0: 			goto err;
sl@0: 		if (!*ptree)
sl@0: 			*ptree = sk_GENERAL_SUBTREE_new_null();
sl@0: 		if (!*ptree || !sk_GENERAL_SUBTREE_push(*ptree, sub))
sl@0: 			goto memerr;
sl@0: 		sub = NULL;
sl@0: 		}
sl@0: 
sl@0: 	return ncons;
sl@0: 
sl@0: 	memerr:
sl@0: 	X509V3err(X509V3_F_V2I_NAME_CONSTRAINTS, ERR_R_MALLOC_FAILURE);
sl@0: 	err:
sl@0: 	if (ncons)
sl@0: 		NAME_CONSTRAINTS_free(ncons);
sl@0: 	if (sub)
sl@0: 		GENERAL_SUBTREE_free(sub);
sl@0: 
sl@0: 	return NULL;
sl@0: 	}
sl@0: 			
sl@0: 
sl@0: 	
sl@0: 
sl@0: static int i2r_NAME_CONSTRAINTS(X509V3_EXT_METHOD *method,
sl@0: 				void *a, BIO *bp, int ind)
sl@0: 	{
sl@0: 	NAME_CONSTRAINTS *ncons = a;
sl@0: 	do_i2r_name_constraints(method, ncons->permittedSubtrees,
sl@0: 					bp, ind, "Permitted");
sl@0: 	do_i2r_name_constraints(method, ncons->excludedSubtrees,
sl@0: 					bp, ind, "Excluded");
sl@0: 	return 1;
sl@0: 	}
sl@0: 
sl@0: static int do_i2r_name_constraints(X509V3_EXT_METHOD *method,
sl@0: 				STACK_OF(GENERAL_SUBTREE) *trees,
sl@0: 					BIO *bp, int ind, char *name)
sl@0: 	{
sl@0: 	GENERAL_SUBTREE *tree;
sl@0: 	int i;
sl@0: 	if (sk_GENERAL_SUBTREE_num(trees) > 0)
sl@0: 		BIO_printf(bp, "%*s%s:\n", ind, "", name);
sl@0: 	for(i = 0; i < sk_GENERAL_SUBTREE_num(trees); i++)
sl@0: 		{
sl@0: 		tree = sk_GENERAL_SUBTREE_value(trees, i);
sl@0: 		BIO_printf(bp, "%*s", ind + 2, "");
sl@0: 		if (tree->base->type == GEN_IPADD)
sl@0: 			print_nc_ipadd(bp, tree->base->d.ip);
sl@0: 		else
sl@0: 			GENERAL_NAME_print(bp, tree->base);
sl@0: 		tree = sk_GENERAL_SUBTREE_value(trees, i);
sl@0: 		BIO_puts(bp, "\n");
sl@0: 		}
sl@0: 	return 1;
sl@0: 	}
sl@0: 
sl@0: static int print_nc_ipadd(BIO *bp, ASN1_OCTET_STRING *ip)
sl@0: 	{
sl@0: 	int i, len;
sl@0: 	unsigned char *p;
sl@0: 	p = ip->data;
sl@0: 	len = ip->length;
sl@0: 	BIO_puts(bp, "IP:");
sl@0: 	if(len == 8)
sl@0: 		{
sl@0: 		BIO_printf(bp, "%d.%d.%d.%d/%d.%d.%d.%d",
sl@0: 				p[0], p[1], p[2], p[3],
sl@0: 				p[4], p[5], p[6], p[7]);
sl@0: 		}
sl@0: 	else if(len == 32)
sl@0: 		{
sl@0: 		for (i = 0; i < 16; i++)
sl@0: 			{
sl@0: 			BIO_printf(bp, "%X", p[0] << 8 | p[1]);
sl@0: 			p += 2;
sl@0: 			if (i == 7)
sl@0: 				BIO_puts(bp, "/");
sl@0: 			else if (i != 15)
sl@0: 				BIO_puts(bp, ":");
sl@0: 			}
sl@0: 		}
sl@0: 	else
sl@0: 		BIO_printf(bp, "IP Address:<invalid>");
sl@0: 	return 1;
sl@0: 	}
sl@0: