3 * Written by Dr Stephen N Henson (steve@openssl.org) for the OpenSSL project
6 /* ====================================================================
7 * Copyright (c) 2004 The OpenSSL Project. All rights reserved.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in
18 * the documentation and/or other materials provided with the
21 * 3. All advertising materials mentioning features or use of this
22 * software must display the following acknowledgment:
23 * "This product includes software developed by the OpenSSL Project
24 * for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
26 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
27 * endorse or promote products derived from this software without
28 * prior written permission. For written permission, please contact
29 * licensing@OpenSSL.org.
31 * 5. Products derived from this software may not be called "OpenSSL"
32 * nor may "OpenSSL" appear in their names without prior written
33 * permission of the OpenSSL Project.
35 * 6. Redistributions of any form whatsoever must retain the following
37 * "This product includes software developed by the OpenSSL Project
38 * for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
40 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
41 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
43 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
44 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
45 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
46 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
47 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
49 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
50 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
51 * OF THE POSSIBILITY OF SUCH DAMAGE.
52 * ====================================================================
54 * This product includes cryptographic software written by Eric Young
55 * (eay@cryptsoft.com). This product includes software written by Tim
56 * Hudson (tjh@cryptsoft.com).
60 #include <openssl/asn1.h>
61 #include <openssl/x509.h>
62 #include <openssl/x509v3.h>
66 static int node_cmp(const X509_POLICY_NODE
*const *a
,
67 const X509_POLICY_NODE
*const *b
)
69 return OBJ_cmp((*a
)->data
->valid_policy
, (*b
)->data
->valid_policy
);
72 STACK_OF(X509_POLICY_NODE
) *policy_node_cmp_new(void)
74 return sk_X509_POLICY_NODE_new(node_cmp
);
77 X509_POLICY_NODE
*tree_find_sk(STACK_OF(X509_POLICY_NODE
) *nodes
,
78 const ASN1_OBJECT
*id
)
84 n
.valid_policy
= (ASN1_OBJECT
*)id
;
87 idx
= sk_X509_POLICY_NODE_find(nodes
, &l
);
91 return sk_X509_POLICY_NODE_value(nodes
, idx
);
95 X509_POLICY_NODE
*level_find_node(const X509_POLICY_LEVEL
*level
,
96 const X509_POLICY_NODE
*parent
,
97 const ASN1_OBJECT
*id
)
99 X509_POLICY_NODE
*node
;
101 for (i
= 0; i
< sk_X509_POLICY_NODE_num(level
->nodes
); i
++) {
102 node
= sk_X509_POLICY_NODE_value(level
->nodes
, i
);
103 if (node
->parent
== parent
) {
104 if (!OBJ_cmp(node
->data
->valid_policy
, id
))
111 X509_POLICY_NODE
*level_add_node(X509_POLICY_LEVEL
*level
,
112 const X509_POLICY_DATA
*data
,
113 X509_POLICY_NODE
*parent
,
114 X509_POLICY_TREE
*tree
)
116 X509_POLICY_NODE
*node
;
117 node
= OPENSSL_malloc(sizeof(X509_POLICY_NODE
));
121 node
->parent
= parent
;
124 if (OBJ_obj2nid(data
->valid_policy
) == NID_any_policy
) {
125 if (level
->anyPolicy
)
127 level
->anyPolicy
= node
;
131 level
->nodes
= policy_node_cmp_new();
134 if (!sk_X509_POLICY_NODE_push(level
->nodes
, node
))
140 if (!tree
->extra_data
)
141 tree
->extra_data
= sk_X509_POLICY_DATA_new_null();
142 if (!tree
->extra_data
)
144 if (!sk_X509_POLICY_DATA_push(tree
->extra_data
, data
))
154 policy_node_free(node
);
159 void policy_node_free(X509_POLICY_NODE
*node
)
165 * See if a policy node matches a policy OID. If mapping enabled look through
166 * expected policy set otherwise just valid policy.
169 int policy_node_match(const X509_POLICY_LEVEL
*lvl
,
170 const X509_POLICY_NODE
*node
, const ASN1_OBJECT
*oid
)
173 ASN1_OBJECT
*policy_oid
;
174 const X509_POLICY_DATA
*x
= node
->data
;
176 if ((lvl
->flags
& X509_V_FLAG_INHIBIT_MAP
)
177 || !(x
->flags
& POLICY_DATA_FLAG_MAP_MASK
)) {
178 if (!OBJ_cmp(x
->valid_policy
, oid
))
183 for (i
= 0; i
< sk_ASN1_OBJECT_num(x
->expected_policy_set
); i
++) {
184 policy_oid
= sk_ASN1_OBJECT_value(x
->expected_policy_set
, i
);
185 if (!OBJ_cmp(policy_oid
, oid
))