pcy_node.c revision 267654 
1/* pcy_node.c */
2/* Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL
3 * project 2004.
4 */
5/* ====================================================================
6 * Copyright (c) 2004 The OpenSSL Project.  All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 *
12 * 1. Redistributions of source code must retain the above copyright
13 *    notice, this list of conditions and the following disclaimer.
14 *
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
18 *    distribution.
19 *
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/)"
24 *
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.
29 *
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.
33 *
34 * 6. Redistributions of any form whatsoever must retain the following
35 *    acknowledgment:
36 *    "This product includes software developed by the OpenSSL Project
37 *    for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
38 *
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 * ====================================================================
52 *
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).
56 *
57 */
58
59#include <openssl/asn1.h>
60#include <openssl/x509.h>
61#include <openssl/x509v3.h>
62
63#include "pcy_int.h"
64
65static int node_cmp(const X509_POLICY_NODE * const *a,
66			const X509_POLICY_NODE * const *b)
67	{
68	return OBJ_cmp((*a)->data->valid_policy, (*b)->data->valid_policy);
69	}
70
71STACK_OF(X509_POLICY_NODE) *policy_node_cmp_new(void)
72	{
73	return sk_X509_POLICY_NODE_new(node_cmp);
74	}
75
76X509_POLICY_NODE *tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes,
77					const ASN1_OBJECT *id)
78	{
79	X509_POLICY_DATA n;
80	X509_POLICY_NODE l;
81	int idx;
82
83	n.valid_policy = (ASN1_OBJECT *)id;
84	l.data = &n;
85
86	idx = sk_X509_POLICY_NODE_find(nodes, &l);
87	if (idx == -1)
88		return NULL;
89
90	return sk_X509_POLICY_NODE_value(nodes, idx);
91
92	}
93
94X509_POLICY_NODE *level_find_node(const X509_POLICY_LEVEL *level,
95					const ASN1_OBJECT *id)
96	{
97	return tree_find_sk(level->nodes, id);
98	}
99
100X509_POLICY_NODE *level_add_node(X509_POLICY_LEVEL *level,
101			X509_POLICY_DATA *data,
102			X509_POLICY_NODE *parent,
103			X509_POLICY_TREE *tree)
104	{
105	X509_POLICY_NODE *node;
106	node = OPENSSL_malloc(sizeof(X509_POLICY_NODE));
107	if (!node)
108		return NULL;
109	node->data = data;
110	node->parent = parent;
111	node->nchild = 0;
112	if (level)
113		{
114		if (OBJ_obj2nid(data->valid_policy) == NID_any_policy)
115			{
116			if (level->anyPolicy)
117				goto node_error;
118			level->anyPolicy = node;
119			}
120		else
121			{
122
123			if (!level->nodes)
124				level->nodes = policy_node_cmp_new();
125			if (!level->nodes)
126				goto node_error;
127			if (!sk_X509_POLICY_NODE_push(level->nodes, node))
128				goto node_error;
129			}
130		}
131
132	if (tree)
133		{
134		if (!tree->extra_data)
135			 tree->extra_data = sk_X509_POLICY_DATA_new_null();
136		if (!tree->extra_data)
137			goto node_error;
138		if (!sk_X509_POLICY_DATA_push(tree->extra_data, data))
139			goto node_error;
140		}
141
142	if (parent)
143		parent->nchild++;
144
145	return node;
146
147	node_error:
148	policy_node_free(node);
149	return 0;
150
151	}
152
153void policy_node_free(X509_POLICY_NODE *node)
154	{
155	OPENSSL_free(node);
156	}
157
158
159