2 /* Written by Dr Stephen N Henson (shenson@bigfoot.com) for the OpenSSL
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).
60 #include <openssl/x509.h>
61 #include <openssl/x509v3.h>
65 /* Initialize policy tree. Return values:
66 * 0 Some internal error occured.
67 * -1 Inconsistent or invalid extensions in certificates.
68 * 1 Tree initialized OK.
69 * 2 Policy tree is empty.
70 * 5 Tree OK and requireExplicitPolicy true.
71 * 6 Tree empty and requireExplicitPolicy true.
74 static int tree_init(X509_POLICY_TREE
**ptree
, STACK_OF(X509
) *certs
,
77 X509_POLICY_TREE
*tree
;
78 X509_POLICY_LEVEL
*level
;
79 const X509_POLICY_CACHE
*cache
;
80 X509_POLICY_DATA
*data
= NULL
;
85 n
= sk_X509_num(certs
);
90 /* Disable policy mapping for now... */
91 flags
|= X509_V_FLAG_INHIBIT_MAP
;
93 if (flags
& X509_V_FLAG_EXPLICIT_POLICY
)
96 explicit_policy
= n
+ 1;
98 if (flags
& X509_V_FLAG_INHIBIT_ANY
)
103 if (flags
& X509_V_FLAG_INHIBIT_MAP
)
108 /* Can't do anything with just a trust anchor */
111 /* First setup policy cache in all certificates apart from the
112 * trust anchor. Note any bad cache results on the way. Also can
113 * calculate explicit_policy value at this point.
115 for (i
= n
- 2; i
>= 0; i
--)
117 x
= sk_X509_value(certs
, i
);
118 X509_check_purpose(x
, -1, -1);
119 cache
= policy_cache_set(x
);
120 /* If cache NULL something bad happened: return immediately */
123 /* If inconsistent extensions keep a note of it but continue */
124 if (x
->ex_flags
& EXFLAG_INVALID_POLICY
)
126 /* Otherwise if we have no data (hence no CertificatePolicies)
127 * and haven't already set an inconsistent code note it.
129 else if ((ret
== 1) && !cache
->data
)
131 if (explicit_policy
> 0)
134 if (!(x
->ex_flags
& EXFLAG_SS
)
135 && (cache
->explicit_skip
!= -1)
136 && (cache
->explicit_skip
< explicit_policy
))
137 explicit_policy
= cache
->explicit_skip
;
143 if (ret
== 2 && !explicit_policy
)
149 /* If we get this far initialize the tree */
151 tree
= OPENSSL_malloc(sizeof(X509_POLICY_TREE
));
157 tree
->levels
= OPENSSL_malloc(sizeof(X509_POLICY_LEVEL
) * n
);
159 tree
->extra_data
= NULL
;
160 tree
->auth_policies
= NULL
;
161 tree
->user_policies
= NULL
;
169 memset(tree
->levels
, 0, n
* sizeof(X509_POLICY_LEVEL
));
173 level
= tree
->levels
;
175 /* Root data: initialize to anyPolicy */
177 data
= policy_data_new(NULL
, OBJ_nid2obj(NID_any_policy
), 0);
179 if (!data
|| !level_add_node(level
, data
, NULL
, tree
))
182 for (i
= n
- 2; i
>= 0; i
--)
185 x
= sk_X509_value(certs
, i
);
186 cache
= policy_cache_set(x
);
188 CRYPTO_add(&x
->references
, 1, CRYPTO_LOCK_X509
);
191 if (!cache
->anyPolicy
)
192 level
->flags
|= X509_V_FLAG_INHIBIT_ANY
;
194 /* Determine inhibit any and inhibit map flags */
197 /* Any matching allowed if certificate is self
198 * issued and not the last in the chain.
200 if (!(x
->ex_flags
&& EXFLAG_SS
) || (i
== 0))
201 level
->flags
|= X509_V_FLAG_INHIBIT_ANY
;
206 if ((cache
->any_skip
> 0)
207 && (cache
->any_skip
< any_skip
))
208 any_skip
= cache
->any_skip
;
212 level
->flags
|= X509_V_FLAG_INHIBIT_MAP
;
216 if ((cache
->map_skip
> 0)
217 && (cache
->map_skip
< map_skip
))
218 map_skip
= cache
->map_skip
;
233 X509_policy_tree_free(tree
);
239 /* This corresponds to RFC3280 XXXX XXXXX:
240 * link any data from CertificatePolicies onto matching parent
241 * or anyPolicy if no match.
244 static int tree_link_nodes(X509_POLICY_LEVEL
*curr
,
245 const X509_POLICY_CACHE
*cache
)
248 X509_POLICY_LEVEL
*last
;
249 X509_POLICY_DATA
*data
;
250 X509_POLICY_NODE
*parent
;
252 for (i
= 0; i
< sk_X509_POLICY_DATA_num(cache
->data
); i
++)
254 data
= sk_X509_POLICY_DATA_value(cache
->data
, i
);
255 /* If a node is mapped any it doesn't have a corresponding
256 * CertificatePolicies entry.
257 * However such an identical node would be created
258 * if anyPolicy matching is enabled because there would be
259 * no match with the parent valid_policy_set. So we create
260 * link because then it will have the mapping flags
261 * right and we can prune it later.
263 if ((data
->flags
& POLICY_DATA_FLAG_MAPPED_ANY
)
264 && !(curr
->flags
& X509_V_FLAG_INHIBIT_ANY
))
266 /* Look for matching node in parent */
267 parent
= level_find_node(last
, data
->valid_policy
);
268 /* If no match link to anyPolicy */
270 parent
= last
->anyPolicy
;
271 if (parent
&& !level_add_node(curr
, data
, parent
, NULL
))
277 /* This corresponds to RFC3280 XXXX XXXXX:
278 * Create new data for any unmatched policies in the parent and link
282 static int tree_link_any(X509_POLICY_LEVEL
*curr
,
283 const X509_POLICY_CACHE
*cache
,
284 X509_POLICY_TREE
*tree
)
287 X509_POLICY_DATA
*data
;
288 X509_POLICY_NODE
*node
;
289 X509_POLICY_LEVEL
*last
;
293 for (i
= 0; i
< sk_X509_POLICY_NODE_num(last
->nodes
); i
++)
295 node
= sk_X509_POLICY_NODE_value(last
->nodes
, i
);
297 /* Skip any node with any children: we only want unmathced
300 * Note: need something better for policy mapping
301 * because each node may have multiple children
305 /* Create a new node with qualifiers from anyPolicy and
306 * id from unmatched node.
308 data
= policy_data_new(NULL
, node
->data
->valid_policy
,
309 node_critical(node
));
313 data
->qualifier_set
= curr
->anyPolicy
->data
->qualifier_set
;
314 data
->flags
|= POLICY_DATA_FLAG_SHARED_QUALIFIERS
;
315 if (!level_add_node(curr
, data
, node
, tree
))
317 policy_data_free(data
);
321 /* Finally add link to anyPolicy */
324 if (!level_add_node(curr
, cache
->anyPolicy
,
325 last
->anyPolicy
, NULL
))
331 /* Prune the tree: delete any child mapped child data on the current level
332 * then proceed up the tree deleting any data with no children. If we ever
333 * have no data on a level we can halt because the tree will be empty.
336 static int tree_prune(X509_POLICY_TREE
*tree
, X509_POLICY_LEVEL
*curr
)
338 X509_POLICY_NODE
*node
;
340 for (i
= sk_X509_POLICY_NODE_num(curr
->nodes
) - 1; i
>= 0; i
--)
342 node
= sk_X509_POLICY_NODE_value(curr
->nodes
, i
);
343 /* Delete any mapped data: see RFC3280 XXXX */
344 if (node
->data
->flags
& POLICY_DATA_FLAG_MAP_MASK
)
346 node
->parent
->nchild
--;
348 sk_X509_POLICY_NODE_delete(curr
->nodes
, i
);
354 for (i
= sk_X509_POLICY_NODE_num(curr
->nodes
) - 1; i
>= 0; i
--)
356 node
= sk_X509_POLICY_NODE_value(curr
->nodes
, i
);
357 if (node
->nchild
== 0)
359 node
->parent
->nchild
--;
361 sk_X509_POLICY_NODE_delete(curr
->nodes
, i
);
364 if (curr
->anyPolicy
&& !curr
->anyPolicy
->nchild
)
366 if (curr
->anyPolicy
->parent
)
367 curr
->anyPolicy
->parent
->nchild
--;
368 OPENSSL_free(curr
->anyPolicy
);
369 curr
->anyPolicy
= NULL
;
371 if (curr
== tree
->levels
)
373 /* If we zapped anyPolicy at top then tree is empty */
374 if (!curr
->anyPolicy
)
384 static int tree_add_auth_node(STACK_OF(X509_POLICY_NODE
) **pnodes
,
385 X509_POLICY_NODE
*pcy
)
389 *pnodes
= policy_node_cmp_new();
393 else if (sk_X509_POLICY_NODE_find(*pnodes
, pcy
) != -1)
396 if (!sk_X509_POLICY_NODE_push(*pnodes
, pcy
))
403 /* Calculate the authority set based on policy tree.
404 * The 'pnodes' parameter is used as a store for the set of policy nodes
405 * used to calculate the user set. If the authority set is not anyPolicy
406 * then pnodes will just point to the authority set. If however the authority
407 * set is anyPolicy then the set of valid policies (other than anyPolicy)
408 * is store in pnodes. The return value of '2' is used in this case to indicate
409 * that pnodes should be freed.
412 static int tree_calculate_authority_set(X509_POLICY_TREE
*tree
,
413 STACK_OF(X509_POLICY_NODES
) **pnodes
)
415 X509_POLICY_LEVEL
*curr
;
416 X509_POLICY_NODE
*node
, *anyptr
;
417 STACK_OF(X509_POLICY_NODES
) **addnodes
;
419 curr
= tree
->levels
+ tree
->nlevel
- 1;
421 /* If last level contains anyPolicy set is anyPolicy */
424 if (!tree_add_auth_node(&tree
->auth_policies
, curr
->anyPolicy
))
429 /* Add policies to authority set */
430 addnodes
= &tree
->auth_policies
;
433 for (i
= 1; i
< tree
->nlevel
; i
++)
435 /* If no anyPolicy node on this this level it can't
436 * appear on lower levels so end search.
438 if (!(anyptr
= curr
->anyPolicy
))
441 for (j
= 0; j
< sk_X509_POLICY_NODE_num(curr
->nodes
); j
++)
443 node
= sk_X509_POLICY_NODE_value(curr
->nodes
, j
);
444 if ((node
->parent
== anyptr
)
445 && !tree_add_auth_node(addnodes
, node
))
450 if (addnodes
== pnodes
)
453 *pnodes
= tree
->auth_policies
;
458 static int tree_calculate_user_set(X509_POLICY_TREE
*tree
,
459 STACK_OF(ASN1_OBJECT
) *policy_oids
,
460 STACK_OF(X509_POLICY_NODE
) *auth_nodes
)
463 X509_POLICY_NODE
*node
;
466 X509_POLICY_NODE
*anyPolicy
;
467 X509_POLICY_DATA
*extra
;
469 /* Check if anyPolicy present in authority constrained policy set:
470 * this will happen if it is a leaf node.
473 if (sk_ASN1_OBJECT_num(policy_oids
) <= 0)
476 anyPolicy
= tree
->levels
[tree
->nlevel
- 1].anyPolicy
;
478 for (i
= 0; i
< sk_ASN1_OBJECT_num(policy_oids
); i
++)
480 oid
= sk_ASN1_OBJECT_value(policy_oids
, i
);
481 if (OBJ_obj2nid(oid
) == NID_any_policy
)
483 tree
->flags
|= POLICY_FLAG_ANY_POLICY
;
488 for (i
= 0; i
< sk_ASN1_OBJECT_num(policy_oids
); i
++)
490 oid
= sk_ASN1_OBJECT_value(policy_oids
, i
);
491 node
= tree_find_sk(auth_nodes
, oid
);
496 /* Create a new node with policy ID from user set
497 * and qualifiers from anyPolicy.
499 extra
= policy_data_new(NULL
, oid
,
500 node_critical(anyPolicy
));
503 extra
->qualifier_set
= anyPolicy
->data
->qualifier_set
;
504 extra
->flags
= POLICY_DATA_FLAG_SHARED_QUALIFIERS
505 | POLICY_DATA_FLAG_EXTRA_NODE
;
506 node
= level_add_node(NULL
, extra
, anyPolicy
->parent
,
509 if (!tree
->user_policies
)
511 tree
->user_policies
= sk_X509_POLICY_NODE_new_null();
512 if (!tree
->user_policies
)
515 if (!sk_X509_POLICY_NODE_push(tree
->user_policies
, node
))
522 static int tree_evaluate(X509_POLICY_TREE
*tree
)
525 X509_POLICY_LEVEL
*curr
= tree
->levels
+ 1;
526 const X509_POLICY_CACHE
*cache
;
528 for(i
= 1; i
< tree
->nlevel
; i
++, curr
++)
530 cache
= policy_cache_set(curr
->cert
);
531 if (!tree_link_nodes(curr
, cache
))
534 if (!(curr
->flags
& X509_V_FLAG_INHIBIT_ANY
)
535 && !tree_link_any(curr
, cache
, tree
))
537 ret
= tree_prune(tree
, curr
);
546 static void exnode_free(X509_POLICY_NODE
*node
)
548 if (node
->data
&& (node
->data
->flags
& POLICY_DATA_FLAG_EXTRA_NODE
))
553 void X509_policy_tree_free(X509_POLICY_TREE
*tree
)
555 X509_POLICY_LEVEL
*curr
;
561 sk_X509_POLICY_NODE_free(tree
->auth_policies
);
562 sk_X509_POLICY_NODE_pop_free(tree
->user_policies
, exnode_free
);
564 for(i
= 0, curr
= tree
->levels
; i
< tree
->nlevel
; i
++, curr
++)
567 X509_free(curr
->cert
);
569 sk_X509_POLICY_NODE_pop_free(curr
->nodes
,
572 policy_node_free(curr
->anyPolicy
);
575 if (tree
->extra_data
)
576 sk_X509_POLICY_DATA_pop_free(tree
->extra_data
,
579 OPENSSL_free(tree
->levels
);
584 /* Application policy checking function.
588 * -1 One or more certificates contain invalid or inconsistent extensions
589 * -2 User constrained policy set empty and requireExplicit true.
592 int X509_policy_check(X509_POLICY_TREE
**ptree
, int *explicit,
593 STACK_OF(X509
) *certs
,
594 STACK_OF(ASN1_OBJECT
) *policy_oids
,
598 X509_POLICY_TREE
*tree
= NULL
;
599 STACK_OF(X509_NODE
) *nodes
, *auth_nodes
= NULL
;
603 ret
= tree_init(&tree
, certs
, flags
);
609 /* Tree empty requireExplicit False: OK */
613 /* Some internal error */
617 /* Tree empty requireExplicit True: Error */
623 /* Tree OK requireExplicit True: OK and continue */
628 /* Tree OK: continue */
634 ret
= tree_evaluate(tree
);
639 /* Return value 2 means tree empty */
642 X509_policy_tree_free(tree
);
649 /* Tree is not empty: continue */
651 ret
= tree_calculate_authority_set(tree
, &auth_nodes
);
656 if (!tree_calculate_user_set(tree
, policy_oids
, auth_nodes
))
660 sk_X509_POLICY_NODE_free(auth_nodes
);
667 nodes
= X509_policy_tree_get0_user_policies(tree
);
668 if (sk_X509_POLICY_NODE_num(nodes
) <= 0)
676 X509_policy_tree_free(tree
);