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 "internal/cryptlib.h"
60 #include <openssl/x509.h>
61 #include <openssl/x509v3.h>
66 * Enable this to print out the complete policy tree at various point during
71 * #define OPENSSL_POLICY_DEBUG
74 #ifdef OPENSSL_POLICY_DEBUG
76 static void expected_print(BIO *err, X509_POLICY_LEVEL *lev,
77 X509_POLICY_NODE *node, int indent)
79 if ((lev->flags & X509_V_FLAG_INHIBIT_MAP)
80 || !(node->data->flags & POLICY_DATA_FLAG_MAP_MASK))
81 BIO_puts(err, " Not Mapped\n");
84 STACK_OF(ASN1_OBJECT) *pset = node->data->expected_policy_set;
86 BIO_puts(err, " Expected: ");
87 for (i = 0; i < sk_ASN1_OBJECT_num(pset); i++) {
88 oid = sk_ASN1_OBJECT_value(pset, i);
91 i2a_ASN1_OBJECT(err, oid);
97 static void tree_print(char *str, X509_POLICY_TREE *tree,
98 X509_POLICY_LEVEL *curr)
100 X509_POLICY_LEVEL *plev;
101 X509_POLICY_NODE *node;
104 err = BIO_new_fp(stderr, BIO_NOCLOSE);
108 curr = tree->levels + tree->nlevel;
111 BIO_printf(err, "Level print after %s\n", str);
112 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels);
113 for (plev = tree->levels; plev != curr; plev++) {
114 BIO_printf(err, "Level %ld, flags = %x\n",
115 plev - tree->levels, plev->flags);
116 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++) {
117 node = sk_X509_POLICY_NODE_value(plev->nodes, i);
118 X509_POLICY_NODE_print(err, node, 2);
119 expected_print(err, plev, node, 2);
120 BIO_printf(err, " Flags: %x\n", node->data->flags);
123 X509_POLICY_NODE_print(err, plev->anyPolicy, 2);
131 # define tree_print(a,b,c) /* */
136 * Initialize policy tree. Return values:
137 * 0 Some internal error occurred.
138 * -1 Inconsistent or invalid extensions in certificates.
139 * 1 Tree initialized OK.
140 * 2 Policy tree is empty.
141 * 5 Tree OK and requireExplicitPolicy true.
142 * 6 Tree empty and requireExplicitPolicy true.
145 static int tree_init(X509_POLICY_TREE **ptree, STACK_OF(X509) *certs,
148 X509_POLICY_TREE *tree;
149 X509_POLICY_LEVEL *level;
150 const X509_POLICY_CACHE *cache;
151 X509_POLICY_DATA *data = NULL;
160 n = sk_X509_num(certs);
162 if (flags & X509_V_FLAG_EXPLICIT_POLICY)
165 explicit_policy = n + 1;
167 if (flags & X509_V_FLAG_INHIBIT_ANY)
172 if (flags & X509_V_FLAG_INHIBIT_MAP)
177 /* Can't do anything with just a trust anchor */
181 * First setup policy cache in all certificates apart from the trust
182 * anchor. Note any bad cache results on the way. Also can calculate
183 * explicit_policy value at this point.
185 for (i = n - 2; i >= 0; i--) {
187 x = sk_X509_value(certs, i);
188 ex_flags = X509_get_extension_flags(x);
189 cache = policy_cache_set(x);
190 /* If cache NULL something bad happened: return immediately */
194 * If inconsistent extensions keep a note of it but continue
196 if (ex_flags & EXFLAG_INVALID_POLICY)
199 * Otherwise if we have no data (hence no CertificatePolicies) and
200 * haven't already set an inconsistent code note it.
202 else if ((ret == 1) && !cache->data)
204 if (explicit_policy > 0) {
205 if (!(ex_flags & EXFLAG_SI))
207 if ((cache->explicit_skip != -1)
208 && (cache->explicit_skip < explicit_policy))
209 explicit_policy = cache->explicit_skip;
214 if (ret == 2 && !explicit_policy)
219 /* If we get this far initialize the tree */
220 tree = OPENSSL_zalloc(sizeof(*tree));
223 tree->levels = OPENSSL_zalloc(sizeof(*tree->levels) * n);
224 if (tree->levels == NULL) {
229 level = tree->levels;
231 /* Root data: initialize to anyPolicy */
232 data = policy_data_new(NULL, OBJ_nid2obj(NID_any_policy), 0);
234 if (data == NULL || !level_add_node(level, data, NULL, tree))
237 for (i = n - 2; i >= 0; i--) {
240 x = sk_X509_value(certs, i);
241 ex_flags = X509_get_extension_flags(x);
242 cache = policy_cache_set(x);
246 if (!cache->anyPolicy)
247 level->flags |= X509_V_FLAG_INHIBIT_ANY;
249 /* Determine inhibit any and inhibit map flags */
252 * Any matching allowed if certificate is self issued and not the
255 if (!(ex_flags & EXFLAG_SI) || (i == 0))
256 level->flags |= X509_V_FLAG_INHIBIT_ANY;
258 if (!(ex_flags & EXFLAG_SI))
260 if ((cache->any_skip >= 0)
261 && (cache->any_skip < any_skip))
262 any_skip = cache->any_skip;
266 level->flags |= X509_V_FLAG_INHIBIT_MAP;
268 if (!(ex_flags & EXFLAG_SI))
270 if ((cache->map_skip >= 0)
271 && (cache->map_skip < map_skip))
272 map_skip = cache->map_skip;
286 X509_policy_tree_free(tree);
292 static int tree_link_matching_nodes(X509_POLICY_LEVEL *curr,
293 X509_POLICY_DATA *data)
295 X509_POLICY_LEVEL *last = curr - 1;
296 X509_POLICY_NODE *node;
298 /* Iterate through all in nodes linking matches */
299 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) {
300 node = sk_X509_POLICY_NODE_value(last->nodes, i);
301 if (policy_node_match(last, node, data->valid_policy)) {
302 if (!level_add_node(curr, data, node, NULL))
307 if (!matched && last->anyPolicy) {
308 if (!level_add_node(curr, data, last->anyPolicy, NULL))
315 * This corresponds to RFC3280 6.1.3(d)(1): link any data from
316 * CertificatePolicies onto matching parent or anyPolicy if no match.
319 static int tree_link_nodes(X509_POLICY_LEVEL *curr,
320 const X509_POLICY_CACHE *cache)
323 X509_POLICY_DATA *data;
325 for (i = 0; i < sk_X509_POLICY_DATA_num(cache->data); i++) {
326 data = sk_X509_POLICY_DATA_value(cache->data, i);
327 /* Look for matching nodes in previous level */
328 if (!tree_link_matching_nodes(curr, data))
335 * This corresponds to RFC3280 6.1.3(d)(2): Create new data for any unmatched
336 * policies in the parent and link to anyPolicy.
339 static int tree_add_unmatched(X509_POLICY_LEVEL *curr,
340 const X509_POLICY_CACHE *cache,
341 const ASN1_OBJECT *id,
342 X509_POLICY_NODE *node, X509_POLICY_TREE *tree)
344 X509_POLICY_DATA *data;
346 id = node->data->valid_policy;
348 * Create a new node with qualifiers from anyPolicy and id from unmatched
351 data = policy_data_new(NULL, id, node_critical(node));
355 /* Curr may not have anyPolicy */
356 data->qualifier_set = cache->anyPolicy->qualifier_set;
357 data->flags |= POLICY_DATA_FLAG_SHARED_QUALIFIERS;
358 if (!level_add_node(curr, data, node, tree)) {
359 policy_data_free(data);
366 static int tree_link_unmatched(X509_POLICY_LEVEL *curr,
367 const X509_POLICY_CACHE *cache,
368 X509_POLICY_NODE *node, X509_POLICY_TREE *tree)
370 const X509_POLICY_LEVEL *last = curr - 1;
373 if ((last->flags & X509_V_FLAG_INHIBIT_MAP)
374 || !(node->data->flags & POLICY_DATA_FLAG_MAPPED)) {
375 /* If no policy mapping: matched if one child present */
378 if (!tree_add_unmatched(curr, cache, NULL, node, tree))
382 /* If mapping: matched if one child per expected policy set */
383 STACK_OF(ASN1_OBJECT) *expset = node->data->expected_policy_set;
384 if (node->nchild == sk_ASN1_OBJECT_num(expset))
386 /* Locate unmatched nodes */
387 for (i = 0; i < sk_ASN1_OBJECT_num(expset); i++) {
388 ASN1_OBJECT *oid = sk_ASN1_OBJECT_value(expset, i);
389 if (level_find_node(curr, node, oid))
391 if (!tree_add_unmatched(curr, cache, oid, node, tree))
401 static int tree_link_any(X509_POLICY_LEVEL *curr,
402 const X509_POLICY_CACHE *cache,
403 X509_POLICY_TREE *tree)
406 X509_POLICY_NODE *node;
407 X509_POLICY_LEVEL *last = curr - 1;
409 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) {
410 node = sk_X509_POLICY_NODE_value(last->nodes, i);
412 if (!tree_link_unmatched(curr, cache, node, tree))
415 /* Finally add link to anyPolicy */
416 if (last->anyPolicy) {
417 if (!level_add_node(curr, cache->anyPolicy, last->anyPolicy, NULL))
424 * Prune the tree: delete any child mapped child data on the current level
425 * then proceed up the tree deleting any data with no children. If we ever
426 * have no data on a level we can halt because the tree will be empty.
429 static int tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr)
431 STACK_OF(X509_POLICY_NODE) *nodes;
432 X509_POLICY_NODE *node;
435 if (curr->flags & X509_V_FLAG_INHIBIT_MAP) {
436 for (i = sk_X509_POLICY_NODE_num(nodes) - 1; i >= 0; i--) {
437 node = sk_X509_POLICY_NODE_value(nodes, i);
438 /* Delete any mapped data: see RFC3280 XXXX */
439 if (node->data->flags & POLICY_DATA_FLAG_MAP_MASK) {
440 node->parent->nchild--;
442 (void)sk_X509_POLICY_NODE_delete(nodes, i);
450 for (i = sk_X509_POLICY_NODE_num(nodes) - 1; i >= 0; i--) {
451 node = sk_X509_POLICY_NODE_value(nodes, i);
452 if (node->nchild == 0) {
453 node->parent->nchild--;
455 (void)sk_X509_POLICY_NODE_delete(nodes, i);
458 if (curr->anyPolicy && !curr->anyPolicy->nchild) {
459 if (curr->anyPolicy->parent)
460 curr->anyPolicy->parent->nchild--;
461 OPENSSL_free(curr->anyPolicy);
462 curr->anyPolicy = NULL;
464 if (curr == tree->levels) {
465 /* If we zapped anyPolicy at top then tree is empty */
466 if (!curr->anyPolicy)
476 static int tree_add_auth_node(STACK_OF(X509_POLICY_NODE) **pnodes,
477 X509_POLICY_NODE *pcy)
479 if (*pnodes == NULL) {
480 *pnodes = policy_node_cmp_new();
483 } else if (sk_X509_POLICY_NODE_find(*pnodes, pcy) != -1)
486 if (!sk_X509_POLICY_NODE_push(*pnodes, pcy))
494 * Calculate the authority set based on policy tree. The 'pnodes' parameter
495 * is used as a store for the set of policy nodes used to calculate the user
496 * set. If the authority set is not anyPolicy then pnodes will just point to
497 * the authority set. If however the authority set is anyPolicy then the set
498 * of valid policies (other than anyPolicy) is store in pnodes. The return
499 * value of '2' is used in this case to indicate that pnodes should be freed.
502 static int tree_calculate_authority_set(X509_POLICY_TREE *tree,
503 STACK_OF(X509_POLICY_NODE) **pnodes)
505 X509_POLICY_LEVEL *curr;
506 X509_POLICY_NODE *node, *anyptr;
507 STACK_OF(X509_POLICY_NODE) **addnodes;
509 curr = tree->levels + tree->nlevel - 1;
511 /* If last level contains anyPolicy set is anyPolicy */
512 if (curr->anyPolicy) {
513 if (!tree_add_auth_node(&tree->auth_policies, curr->anyPolicy))
517 /* Add policies to authority set */
518 addnodes = &tree->auth_policies;
521 for (i = 1; i < tree->nlevel; i++) {
523 * If no anyPolicy node on this this level it can't appear on lower
524 * levels so end search.
526 if ((anyptr = curr->anyPolicy) == NULL)
529 for (j = 0; j < sk_X509_POLICY_NODE_num(curr->nodes); j++) {
530 node = sk_X509_POLICY_NODE_value(curr->nodes, j);
531 if ((node->parent == anyptr)
532 && !tree_add_auth_node(addnodes, node))
537 if (addnodes == pnodes)
540 *pnodes = tree->auth_policies;
545 static int tree_calculate_user_set(X509_POLICY_TREE *tree,
546 STACK_OF(ASN1_OBJECT) *policy_oids,
547 STACK_OF(X509_POLICY_NODE) *auth_nodes)
550 X509_POLICY_NODE *node;
553 X509_POLICY_NODE *anyPolicy;
554 X509_POLICY_DATA *extra;
557 * Check if anyPolicy present in authority constrained policy set: this
558 * will happen if it is a leaf node.
561 if (sk_ASN1_OBJECT_num(policy_oids) <= 0)
564 anyPolicy = tree->levels[tree->nlevel - 1].anyPolicy;
566 for (i = 0; i < sk_ASN1_OBJECT_num(policy_oids); i++) {
567 oid = sk_ASN1_OBJECT_value(policy_oids, i);
568 if (OBJ_obj2nid(oid) == NID_any_policy) {
569 tree->flags |= POLICY_FLAG_ANY_POLICY;
574 for (i = 0; i < sk_ASN1_OBJECT_num(policy_oids); i++) {
575 oid = sk_ASN1_OBJECT_value(policy_oids, i);
576 node = tree_find_sk(auth_nodes, oid);
581 * Create a new node with policy ID from user set and qualifiers
584 extra = policy_data_new(NULL, oid, node_critical(anyPolicy));
587 extra->qualifier_set = anyPolicy->data->qualifier_set;
588 extra->flags = POLICY_DATA_FLAG_SHARED_QUALIFIERS
589 | POLICY_DATA_FLAG_EXTRA_NODE;
590 node = level_add_node(NULL, extra, anyPolicy->parent, tree);
592 if (!tree->user_policies) {
593 tree->user_policies = sk_X509_POLICY_NODE_new_null();
594 if (!tree->user_policies)
597 if (!sk_X509_POLICY_NODE_push(tree->user_policies, node))
604 static int tree_evaluate(X509_POLICY_TREE *tree)
607 X509_POLICY_LEVEL *curr = tree->levels + 1;
608 const X509_POLICY_CACHE *cache;
610 for (i = 1; i < tree->nlevel; i++, curr++) {
611 cache = policy_cache_set(curr->cert);
612 if (!tree_link_nodes(curr, cache))
615 if (!(curr->flags & X509_V_FLAG_INHIBIT_ANY)
616 && !tree_link_any(curr, cache, tree))
618 tree_print("before tree_prune()", tree, curr);
619 ret = tree_prune(tree, curr);
628 static void exnode_free(X509_POLICY_NODE *node)
630 if (node->data && (node->data->flags & POLICY_DATA_FLAG_EXTRA_NODE))
634 void X509_policy_tree_free(X509_POLICY_TREE *tree)
636 X509_POLICY_LEVEL *curr;
642 sk_X509_POLICY_NODE_free(tree->auth_policies);
643 sk_X509_POLICY_NODE_pop_free(tree->user_policies, exnode_free);
645 for (i = 0, curr = tree->levels; i < tree->nlevel; i++, curr++) {
646 X509_free(curr->cert);
647 sk_X509_POLICY_NODE_pop_free(curr->nodes, policy_node_free);
648 policy_node_free(curr->anyPolicy);
651 sk_X509_POLICY_DATA_pop_free(tree->extra_data, policy_data_free);
652 OPENSSL_free(tree->levels);
658 * Application policy checking function.
662 * -1 One or more certificates contain invalid or inconsistent extensions
663 * -2 User constrained policy set empty and requireExplicit true.
666 int X509_policy_check(X509_POLICY_TREE **ptree, int *pexplicit_policy,
667 STACK_OF(X509) *certs,
668 STACK_OF(ASN1_OBJECT) *policy_oids, unsigned int flags)
671 X509_POLICY_TREE *tree = NULL;
672 STACK_OF(X509_POLICY_NODE) *nodes, *auth_nodes = NULL;
675 *pexplicit_policy = 0;
676 ret = tree_init(&tree, certs, flags);
680 /* Tree empty requireExplicit False: OK */
684 /* Some internal error */
688 /* Some internal error */
692 /* Tree empty requireExplicit True: Error */
695 *pexplicit_policy = 1;
698 /* Tree OK requireExplicit True: OK and continue */
700 *pexplicit_policy = 1;
703 /* Tree OK: continue */
708 * tree_init() returns success and a null tree
709 * if it's just looking at a trust anchor.
710 * I'm not sure that returning success here is
711 * correct, but I'm sure that reporting this
712 * as an internal error which our caller
713 * interprets as a malloc failure is wrong.
721 ret = tree_evaluate(tree);
723 tree_print("tree_evaluate()", tree, NULL);
728 /* Return value 2 means tree empty */
730 X509_policy_tree_free(tree);
731 if (*pexplicit_policy)
737 /* Tree is not empty: continue */
739 ret = tree_calculate_authority_set(tree, &auth_nodes);
744 if (!tree_calculate_user_set(tree, policy_oids, auth_nodes))
748 sk_X509_POLICY_NODE_free(auth_nodes);
753 if (*pexplicit_policy) {
754 nodes = X509_policy_tree_get0_user_policies(tree);
755 if (sk_X509_POLICY_NODE_num(nodes) <= 0)
763 X509_policy_tree_free(tree);