2 * Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL project
5 /* ====================================================================
6 * Copyright (c) 2004 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).
59 #include <openssl/asn1.h>
60 #include <openssl/x509.h>
61 #include <openssl/x509v3.h>
65 static int node_cmp(const X509_POLICY_NODE *const *a,
66 const X509_POLICY_NODE *const *b)
68 return OBJ_cmp((*a)->data->valid_policy, (*b)->data->valid_policy);
71 STACK_OF(X509_POLICY_NODE) *policy_node_cmp_new(void)
73 return sk_X509_POLICY_NODE_new(node_cmp);
76 X509_POLICY_NODE *tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes,
77 const ASN1_OBJECT *id)
83 n.valid_policy = (ASN1_OBJECT *)id;
86 idx = sk_X509_POLICY_NODE_find(nodes, &l);
90 return sk_X509_POLICY_NODE_value(nodes, idx);
94 X509_POLICY_NODE *level_find_node(const X509_POLICY_LEVEL *level,
95 const X509_POLICY_NODE *parent,
96 const ASN1_OBJECT *id)
98 X509_POLICY_NODE *node;
100 for (i = 0; i < sk_X509_POLICY_NODE_num(level->nodes); i++) {
101 node = sk_X509_POLICY_NODE_value(level->nodes, i);
102 if (node->parent == parent) {
103 if (!OBJ_cmp(node->data->valid_policy, id))
110 X509_POLICY_NODE *level_add_node(X509_POLICY_LEVEL *level,
111 X509_POLICY_DATA *data,
112 X509_POLICY_NODE *parent,
113 X509_POLICY_TREE *tree)
115 X509_POLICY_NODE *node;
117 node = OPENSSL_zalloc(sizeof(*node));
121 node->parent = parent;
123 if (OBJ_obj2nid(data->valid_policy) == NID_any_policy) {
124 if (level->anyPolicy)
126 level->anyPolicy = node;
129 if (level->nodes == NULL)
130 level->nodes = policy_node_cmp_new();
131 if (level->nodes == NULL)
133 if (!sk_X509_POLICY_NODE_push(level->nodes, node))
139 if (tree->extra_data == NULL)
140 tree->extra_data = sk_X509_POLICY_DATA_new_null();
141 if (tree->extra_data == NULL)
143 if (!sk_X509_POLICY_DATA_push(tree->extra_data, data))
153 policy_node_free(node);
157 void policy_node_free(X509_POLICY_NODE *node)
163 * See if a policy node matches a policy OID. If mapping enabled look through
164 * expected policy set otherwise just valid policy.
167 int policy_node_match(const X509_POLICY_LEVEL *lvl,
168 const X509_POLICY_NODE *node, const ASN1_OBJECT *oid)
171 ASN1_OBJECT *policy_oid;
172 const X509_POLICY_DATA *x = node->data;
174 if ((lvl->flags & X509_V_FLAG_INHIBIT_MAP)
175 || !(x->flags & POLICY_DATA_FLAG_MAP_MASK)) {
176 if (!OBJ_cmp(x->valid_policy, oid))
181 for (i = 0; i < sk_ASN1_OBJECT_num(x->expected_policy_set); i++) {
182 policy_oid = sk_ASN1_OBJECT_value(x->expected_policy_set, i);
183 if (!OBJ_cmp(policy_oid, oid))