2 * Copyright 2004-2023 The OpenSSL Project Authors. All Rights Reserved.
4 * Licensed under the Apache License 2.0 (the "License"). You may not use
5 * this file except in compliance with the License. You can obtain a copy
6 * in the file LICENSE in the source distribution or at
7 * https://www.openssl.org/source/license.html
10 #include "internal/cryptlib.h"
11 #include <openssl/trace.h>
12 #include <openssl/x509.h>
13 #include <openssl/x509v3.h>
15 #include "pcy_local.h"
18 * If the maximum number of nodes in the policy tree isn't defined, set it to
19 * a generous default of 1000 nodes.
21 * Defining this to be zero means unlimited policy tree growth which opens the
22 * door on CVE-2023-0464.
24 #ifndef OPENSSL_POLICY_TREE_NODES_MAX
25 # define OPENSSL_POLICY_TREE_NODES_MAX 1000
28 static void exnode_free(X509_POLICY_NODE
*node
);
30 static void expected_print(BIO
*channel
,
31 X509_POLICY_LEVEL
*lev
, X509_POLICY_NODE
*node
,
34 if ((lev
->flags
& X509_V_FLAG_INHIBIT_MAP
)
35 || !(node
->data
->flags
& POLICY_DATA_FLAG_MAP_MASK
))
36 BIO_puts(channel
, " Not Mapped\n");
40 STACK_OF(ASN1_OBJECT
) *pset
= node
->data
->expected_policy_set
;
42 BIO_puts(channel
, " Expected: ");
43 for (i
= 0; i
< sk_ASN1_OBJECT_num(pset
); i
++) {
44 oid
= sk_ASN1_OBJECT_value(pset
, i
);
46 BIO_puts(channel
, ", ");
47 i2a_ASN1_OBJECT(channel
, oid
);
49 BIO_puts(channel
, "\n");
53 static void tree_print(BIO
*channel
,
54 char *str
, X509_POLICY_TREE
*tree
,
55 X509_POLICY_LEVEL
*curr
)
57 X509_POLICY_LEVEL
*plev
;
60 curr
= tree
->levels
+ tree
->nlevel
;
64 BIO_printf(channel
, "Level print after %s\n", str
);
65 BIO_printf(channel
, "Printing Up to Level %ld\n",
66 (long)(curr
- tree
->levels
));
67 for (plev
= tree
->levels
; plev
!= curr
; plev
++) {
70 BIO_printf(channel
, "Level %ld, flags = %x\n",
71 (long)(plev
- tree
->levels
), plev
->flags
);
72 for (i
= 0; i
< sk_X509_POLICY_NODE_num(plev
->nodes
); i
++) {
73 X509_POLICY_NODE
*node
=
74 sk_X509_POLICY_NODE_value(plev
->nodes
, i
);
76 X509_POLICY_NODE_print(channel
, node
, 2);
77 expected_print(channel
, plev
, node
, 2);
78 BIO_printf(channel
, " Flags: %x\n", node
->data
->flags
);
81 X509_POLICY_NODE_print(channel
, plev
->anyPolicy
, 2);
85 #define TREE_PRINT(str, tree, curr) \
86 OSSL_TRACE_BEGIN(X509V3_POLICY) { \
87 tree_print(trc_out, "before tree_prune()", tree, curr); \
88 } OSSL_TRACE_END(X509V3_POLICY)
91 * Return value: <= 0 on error, or positive bit mask:
93 * X509_PCY_TREE_VALID: valid tree
94 * X509_PCY_TREE_EMPTY: empty tree (including bare TA case)
95 * X509_PCY_TREE_EXPLICIT: explicit policy required
97 static int tree_init(X509_POLICY_TREE
**ptree
, STACK_OF(X509
) *certs
,
100 X509_POLICY_TREE
*tree
;
101 X509_POLICY_LEVEL
*level
;
102 const X509_POLICY_CACHE
*cache
;
103 X509_POLICY_DATA
*data
= NULL
;
104 int ret
= X509_PCY_TREE_VALID
;
105 int n
= sk_X509_num(certs
) - 1; /* RFC5280 paths omit the TA */
106 int explicit_policy
= (flags
& X509_V_FLAG_EXPLICIT_POLICY
) ? 0 : n
+1;
107 int any_skip
= (flags
& X509_V_FLAG_INHIBIT_ANY
) ? 0 : n
+1;
108 int map_skip
= (flags
& X509_V_FLAG_INHIBIT_MAP
) ? 0 : n
+1;
113 /* Can't do anything with just a trust anchor */
115 return X509_PCY_TREE_EMPTY
;
118 * First setup the policy cache in all n non-TA certificates, this will be
119 * used in X509_verify_cert() which will invoke the verify callback for all
120 * certificates with invalid policy extensions.
122 for (i
= n
- 1; i
>= 0; i
--) {
123 X509
*x
= sk_X509_value(certs
, i
);
125 /* Call for side-effect of computing hash and caching extensions */
126 X509_check_purpose(x
, -1, 0);
128 /* If cache is NULL, likely ENOMEM: return immediately */
129 if (ossl_policy_cache_set(x
) == NULL
)
130 return X509_PCY_TREE_INTERNAL
;
134 * At this point check for invalid policies and required explicit policy.
135 * Note that the explicit_policy counter is a count-down to zero, with the
136 * requirement kicking in if and once it does that. The counter is
137 * decremented for every non-self-issued certificate in the path, but may
138 * be further reduced by policy constraints in a non-leaf certificate.
140 * The ultimate policy set is the intersection of all the policies along
141 * the path, if we hit a certificate with an empty policy set, and explicit
142 * policy is required we're done.
145 i
>= 0 && (explicit_policy
> 0 || (ret
& X509_PCY_TREE_EMPTY
) == 0);
147 X509
*x
= sk_X509_value(certs
, i
);
148 uint32_t ex_flags
= X509_get_extension_flags(x
);
150 /* All the policies are already cached, we can return early */
151 if (ex_flags
& EXFLAG_INVALID_POLICY
)
152 return X509_PCY_TREE_INVALID
;
154 /* Access the cache which we now know exists */
155 cache
= ossl_policy_cache_set(x
);
157 if ((ret
& X509_PCY_TREE_VALID
) && cache
->data
== NULL
)
158 ret
= X509_PCY_TREE_EMPTY
;
159 if (explicit_policy
> 0) {
160 if (!(ex_flags
& EXFLAG_SI
))
162 if ((cache
->explicit_skip
>= 0)
163 && (cache
->explicit_skip
< explicit_policy
))
164 explicit_policy
= cache
->explicit_skip
;
168 if (explicit_policy
== 0)
169 ret
|= X509_PCY_TREE_EXPLICIT
;
170 if ((ret
& X509_PCY_TREE_VALID
) == 0)
173 /* If we get this far initialize the tree */
174 if ((tree
= OPENSSL_zalloc(sizeof(*tree
))) == NULL
)
175 return X509_PCY_TREE_INTERNAL
;
177 /* Limit the growth of the tree to mitigate CVE-2023-0464 */
178 tree
->node_maximum
= OPENSSL_POLICY_TREE_NODES_MAX
;
181 * http://tools.ietf.org/html/rfc5280#section-6.1.2, figure 3.
183 * The top level is implicitly for the trust anchor with valid expected
184 * policies of anyPolicy. (RFC 5280 has the TA at depth 0 and the leaf at
185 * depth n, we have the leaf at depth 0 and the TA at depth n).
187 if ((tree
->levels
= OPENSSL_zalloc(sizeof(*tree
->levels
)*(n
+1))) == NULL
) {
189 return X509_PCY_TREE_INTERNAL
;
192 level
= tree
->levels
;
193 if ((data
= ossl_policy_data_new(NULL
,
194 OBJ_nid2obj(NID_any_policy
), 0)) == NULL
)
196 if (ossl_policy_level_add_node(level
, data
, NULL
, tree
, 1) == NULL
) {
197 ossl_policy_data_free(data
);
202 * In this pass initialize all the tree levels and whether anyPolicy and
203 * policy mapping are inhibited at each level.
205 for (i
= n
- 1; i
>= 0; i
--) {
206 X509
*x
= sk_X509_value(certs
, i
);
207 uint32_t ex_flags
= X509_get_extension_flags(x
);
209 /* Access the cache which we now know exists */
210 cache
= ossl_policy_cache_set(x
);
215 if (!cache
->anyPolicy
)
216 level
->flags
|= X509_V_FLAG_INHIBIT_ANY
;
218 /* Determine inhibit any and inhibit map flags */
221 * Any matching allowed only if certificate is self issued and not
222 * the last in the chain.
224 if (!(ex_flags
& EXFLAG_SI
) || (i
== 0))
225 level
->flags
|= X509_V_FLAG_INHIBIT_ANY
;
227 if (!(ex_flags
& EXFLAG_SI
))
229 if ((cache
->any_skip
>= 0) && (cache
->any_skip
< any_skip
))
230 any_skip
= cache
->any_skip
;
234 level
->flags
|= X509_V_FLAG_INHIBIT_MAP
;
236 if (!(ex_flags
& EXFLAG_SI
))
238 if ((cache
->map_skip
>= 0) && (cache
->map_skip
< map_skip
))
239 map_skip
= cache
->map_skip
;
247 X509_policy_tree_free(tree
);
248 return X509_PCY_TREE_INTERNAL
;
252 * Return value: 1 on success, 0 otherwise
254 static int tree_link_matching_nodes(X509_POLICY_LEVEL
*curr
,
255 X509_POLICY_DATA
*data
,
256 X509_POLICY_TREE
*tree
)
258 X509_POLICY_LEVEL
*last
= curr
- 1;
261 /* Iterate through all in nodes linking matches */
262 for (i
= 0; i
< sk_X509_POLICY_NODE_num(last
->nodes
); i
++) {
263 X509_POLICY_NODE
*node
= sk_X509_POLICY_NODE_value(last
->nodes
, i
);
265 if (ossl_policy_node_match(last
, node
, data
->valid_policy
)) {
266 if (ossl_policy_level_add_node(curr
, data
, node
, tree
, 0) == NULL
)
271 if (!matched
&& last
->anyPolicy
) {
272 if (ossl_policy_level_add_node(curr
, data
, last
->anyPolicy
, tree
, 0) == NULL
)
279 * This corresponds to RFC3280 6.1.3(d)(1): link any data from
280 * CertificatePolicies onto matching parent or anyPolicy if no match.
282 * Return value: 1 on success, 0 otherwise.
284 static int tree_link_nodes(X509_POLICY_LEVEL
*curr
,
285 const X509_POLICY_CACHE
*cache
,
286 X509_POLICY_TREE
*tree
)
290 for (i
= 0; i
< sk_X509_POLICY_DATA_num(cache
->data
); i
++) {
291 X509_POLICY_DATA
*data
= sk_X509_POLICY_DATA_value(cache
->data
, i
);
293 /* Look for matching nodes in previous level */
294 if (!tree_link_matching_nodes(curr
, data
, tree
))
301 * This corresponds to RFC3280 6.1.3(d)(2): Create new data for any unmatched
302 * policies in the parent and link to anyPolicy.
304 * Return value: 1 on success, 0 otherwise.
306 static int tree_add_unmatched(X509_POLICY_LEVEL
*curr
,
307 const X509_POLICY_CACHE
*cache
,
308 const ASN1_OBJECT
*id
,
309 X509_POLICY_NODE
*node
, X509_POLICY_TREE
*tree
)
311 X509_POLICY_DATA
*data
;
314 id
= node
->data
->valid_policy
;
316 * Create a new node with qualifiers from anyPolicy and id from unmatched
319 if ((data
= ossl_policy_data_new(NULL
, id
, node_critical(node
))) == NULL
)
322 /* Curr may not have anyPolicy */
323 data
->qualifier_set
= cache
->anyPolicy
->qualifier_set
;
324 data
->flags
|= POLICY_DATA_FLAG_SHARED_QUALIFIERS
;
325 if (ossl_policy_level_add_node(curr
, data
, node
, tree
, 1) == NULL
) {
326 ossl_policy_data_free(data
);
333 * Return value: 1 on success, 0 otherwise.
335 static int tree_link_unmatched(X509_POLICY_LEVEL
*curr
,
336 const X509_POLICY_CACHE
*cache
,
337 X509_POLICY_NODE
*node
, X509_POLICY_TREE
*tree
)
339 const X509_POLICY_LEVEL
*last
= curr
- 1;
342 if ((last
->flags
& X509_V_FLAG_INHIBIT_MAP
)
343 || !(node
->data
->flags
& POLICY_DATA_FLAG_MAPPED
)) {
344 /* If no policy mapping: matched if one child present */
347 if (!tree_add_unmatched(curr
, cache
, NULL
, node
, tree
))
351 /* If mapping: matched if one child per expected policy set */
352 STACK_OF(ASN1_OBJECT
) *expset
= node
->data
->expected_policy_set
;
353 if (node
->nchild
== sk_ASN1_OBJECT_num(expset
))
355 /* Locate unmatched nodes */
356 for (i
= 0; i
< sk_ASN1_OBJECT_num(expset
); i
++) {
357 ASN1_OBJECT
*oid
= sk_ASN1_OBJECT_value(expset
, i
);
358 if (ossl_policy_level_find_node(curr
, node
, oid
))
360 if (!tree_add_unmatched(curr
, cache
, oid
, node
, tree
))
369 * Return value: 1 on success, 0 otherwise
371 static int tree_link_any(X509_POLICY_LEVEL
*curr
,
372 const X509_POLICY_CACHE
*cache
,
373 X509_POLICY_TREE
*tree
)
376 X509_POLICY_NODE
*node
;
377 X509_POLICY_LEVEL
*last
= curr
- 1;
379 for (i
= 0; i
< sk_X509_POLICY_NODE_num(last
->nodes
); i
++) {
380 node
= sk_X509_POLICY_NODE_value(last
->nodes
, i
);
382 if (!tree_link_unmatched(curr
, cache
, node
, tree
))
385 /* Finally add link to anyPolicy */
386 if (last
->anyPolicy
&&
387 ossl_policy_level_add_node(curr
, cache
->anyPolicy
,
388 last
->anyPolicy
, tree
, 0) == NULL
)
394 * Prune the tree: delete any child mapped child data on the current level then
395 * proceed up the tree deleting any data with no children. If we ever have no
396 * data on a level we can halt because the tree will be empty.
398 * Return value: <= 0 error, otherwise one of:
400 * X509_PCY_TREE_VALID: valid tree
401 * X509_PCY_TREE_EMPTY: empty tree
403 static int tree_prune(X509_POLICY_TREE
*tree
, X509_POLICY_LEVEL
*curr
)
405 STACK_OF(X509_POLICY_NODE
) *nodes
;
406 X509_POLICY_NODE
*node
;
409 if (curr
->flags
& X509_V_FLAG_INHIBIT_MAP
) {
410 for (i
= sk_X509_POLICY_NODE_num(nodes
) - 1; i
>= 0; i
--) {
411 node
= sk_X509_POLICY_NODE_value(nodes
, i
);
412 /* Delete any mapped data: see RFC3280 XXXX */
413 if (node
->data
->flags
& POLICY_DATA_FLAG_MAP_MASK
) {
414 node
->parent
->nchild
--;
416 (void)sk_X509_POLICY_NODE_delete(nodes
, i
);
424 for (i
= sk_X509_POLICY_NODE_num(nodes
) - 1; i
>= 0; i
--) {
425 node
= sk_X509_POLICY_NODE_value(nodes
, i
);
426 if (node
->nchild
== 0) {
427 node
->parent
->nchild
--;
429 (void)sk_X509_POLICY_NODE_delete(nodes
, i
);
432 if (curr
->anyPolicy
&& !curr
->anyPolicy
->nchild
) {
433 if (curr
->anyPolicy
->parent
)
434 curr
->anyPolicy
->parent
->nchild
--;
435 OPENSSL_free(curr
->anyPolicy
);
436 curr
->anyPolicy
= NULL
;
438 if (curr
== tree
->levels
) {
439 /* If we zapped anyPolicy at top then tree is empty */
440 if (!curr
->anyPolicy
)
441 return X509_PCY_TREE_EMPTY
;
445 return X509_PCY_TREE_VALID
;
449 * Return value: 1 on success, 0 otherwise.
451 static int tree_add_auth_node(STACK_OF(X509_POLICY_NODE
) **pnodes
,
452 X509_POLICY_NODE
*pcy
)
454 if (*pnodes
== NULL
&&
455 (*pnodes
= ossl_policy_node_cmp_new()) == NULL
)
457 if (sk_X509_POLICY_NODE_find(*pnodes
, pcy
) >= 0)
459 return sk_X509_POLICY_NODE_push(*pnodes
, pcy
) != 0;
462 #define TREE_CALC_FAILURE 0
463 #define TREE_CALC_OK_NOFREE 1
464 #define TREE_CALC_OK_DOFREE 2
467 * Calculate the authority set based on policy tree. The 'pnodes' parameter is
468 * used as a store for the set of policy nodes used to calculate the user set.
469 * If the authority set is not anyPolicy then pnodes will just point to the
470 * authority set. If however the authority set is anyPolicy then the set of
471 * valid policies (other than anyPolicy) is store in pnodes.
474 * TREE_CALC_FAILURE on failure,
475 * TREE_CALC_OK_NOFREE on success and pnodes need not be freed,
476 * TREE_CALC_OK_DOFREE on success and pnodes needs to be freed
478 static int tree_calculate_authority_set(X509_POLICY_TREE
*tree
,
479 STACK_OF(X509_POLICY_NODE
) **pnodes
)
481 X509_POLICY_LEVEL
*curr
;
482 X509_POLICY_NODE
*node
, *anyptr
;
483 STACK_OF(X509_POLICY_NODE
) **addnodes
;
485 curr
= tree
->levels
+ tree
->nlevel
- 1;
487 /* If last level contains anyPolicy set is anyPolicy */
488 if (curr
->anyPolicy
) {
489 if (!tree_add_auth_node(&tree
->auth_policies
, curr
->anyPolicy
))
490 return TREE_CALC_FAILURE
;
493 /* Add policies to authority set */
494 addnodes
= &tree
->auth_policies
;
497 for (i
= 1; i
< tree
->nlevel
; i
++) {
499 * If no anyPolicy node on this level it can't appear on lower
500 * levels so end search.
502 if ((anyptr
= curr
->anyPolicy
) == NULL
)
505 for (j
= 0; j
< sk_X509_POLICY_NODE_num(curr
->nodes
); j
++) {
506 node
= sk_X509_POLICY_NODE_value(curr
->nodes
, j
);
507 if ((node
->parent
== anyptr
)
508 && !tree_add_auth_node(addnodes
, node
)) {
509 if (addnodes
== pnodes
) {
510 sk_X509_POLICY_NODE_free(*pnodes
);
513 return TREE_CALC_FAILURE
;
517 if (addnodes
== pnodes
)
518 return TREE_CALC_OK_DOFREE
;
520 *pnodes
= tree
->auth_policies
;
521 return TREE_CALC_OK_NOFREE
;
525 * Return value: 1 on success, 0 otherwise.
527 static int tree_calculate_user_set(X509_POLICY_TREE
*tree
,
528 STACK_OF(ASN1_OBJECT
) *policy_oids
,
529 STACK_OF(X509_POLICY_NODE
) *auth_nodes
)
532 X509_POLICY_NODE
*node
;
534 X509_POLICY_NODE
*anyPolicy
;
535 X509_POLICY_DATA
*extra
;
538 * Check if anyPolicy present in authority constrained policy set: this
539 * will happen if it is a leaf node.
541 if (sk_ASN1_OBJECT_num(policy_oids
) <= 0)
544 anyPolicy
= tree
->levels
[tree
->nlevel
- 1].anyPolicy
;
546 for (i
= 0; i
< sk_ASN1_OBJECT_num(policy_oids
); i
++) {
547 oid
= sk_ASN1_OBJECT_value(policy_oids
, i
);
548 if (OBJ_obj2nid(oid
) == NID_any_policy
) {
549 tree
->flags
|= POLICY_FLAG_ANY_POLICY
;
554 for (i
= 0; i
< sk_ASN1_OBJECT_num(policy_oids
); i
++) {
555 oid
= sk_ASN1_OBJECT_value(policy_oids
, i
);
556 node
= ossl_policy_tree_find_sk(auth_nodes
, oid
);
561 * Create a new node with policy ID from user set and qualifiers
564 extra
= ossl_policy_data_new(NULL
, oid
, node_critical(anyPolicy
));
567 extra
->qualifier_set
= anyPolicy
->data
->qualifier_set
;
568 extra
->flags
= POLICY_DATA_FLAG_SHARED_QUALIFIERS
569 | POLICY_DATA_FLAG_EXTRA_NODE
;
570 node
= ossl_policy_level_add_node(NULL
, extra
, anyPolicy
->parent
,
573 ossl_policy_data_free(extra
);
577 if (!tree
->user_policies
) {
578 tree
->user_policies
= sk_X509_POLICY_NODE_new_null();
579 if (!tree
->user_policies
) {
584 if (!sk_X509_POLICY_NODE_push(tree
->user_policies
, node
)) {
593 * Return value: <= 0 error, otherwise one of:
594 * X509_PCY_TREE_VALID: valid tree
595 * X509_PCY_TREE_EMPTY: empty tree
596 * (see tree_prune()).
598 static int tree_evaluate(X509_POLICY_TREE
*tree
)
601 X509_POLICY_LEVEL
*curr
= tree
->levels
+ 1;
602 const X509_POLICY_CACHE
*cache
;
604 for (i
= 1; i
< tree
->nlevel
; i
++, curr
++) {
605 cache
= ossl_policy_cache_set(curr
->cert
);
606 if (!tree_link_nodes(curr
, cache
, tree
))
607 return X509_PCY_TREE_INTERNAL
;
609 if (!(curr
->flags
& X509_V_FLAG_INHIBIT_ANY
)
610 && !tree_link_any(curr
, cache
, tree
))
611 return X509_PCY_TREE_INTERNAL
;
612 TREE_PRINT("before tree_prune()", tree
, curr
);
613 ret
= tree_prune(tree
, curr
);
614 if (ret
!= X509_PCY_TREE_VALID
)
617 return X509_PCY_TREE_VALID
;
620 static void exnode_free(X509_POLICY_NODE
*node
)
622 if (node
->data
&& (node
->data
->flags
& POLICY_DATA_FLAG_EXTRA_NODE
))
626 void X509_policy_tree_free(X509_POLICY_TREE
*tree
)
628 X509_POLICY_LEVEL
*curr
;
634 sk_X509_POLICY_NODE_free(tree
->auth_policies
);
635 sk_X509_POLICY_NODE_pop_free(tree
->user_policies
, exnode_free
);
637 for (i
= 0, curr
= tree
->levels
; i
< tree
->nlevel
; i
++, curr
++) {
638 X509_free(curr
->cert
);
639 sk_X509_POLICY_NODE_pop_free(curr
->nodes
, ossl_policy_node_free
);
640 ossl_policy_node_free(curr
->anyPolicy
);
643 sk_X509_POLICY_DATA_pop_free(tree
->extra_data
, ossl_policy_data_free
);
644 OPENSSL_free(tree
->levels
);
650 * Application policy checking function.
652 * X509_PCY_TREE_FAILURE: Failure to satisfy explicit policy
653 * X509_PCY_TREE_INVALID: Inconsistent or invalid extensions
654 * X509_PCY_TREE_INTERNAL: Internal error, most likely malloc
655 * X509_PCY_TREE_VALID: Success (null tree if empty or bare TA)
657 int X509_policy_check(X509_POLICY_TREE
**ptree
, int *pexplicit_policy
,
658 STACK_OF(X509
) *certs
,
659 STACK_OF(ASN1_OBJECT
) *policy_oids
, unsigned int flags
)
664 X509_POLICY_TREE
*tree
= NULL
;
665 STACK_OF(X509_POLICY_NODE
) *nodes
, *auth_nodes
= NULL
;
668 *pexplicit_policy
= 0;
669 init_ret
= tree_init(&tree
, certs
, flags
);
674 if ((init_ret
& X509_PCY_TREE_EXPLICIT
) == 0) {
675 if (init_ret
& X509_PCY_TREE_EMPTY
) {
676 X509_policy_tree_free(tree
);
677 return X509_PCY_TREE_VALID
;
680 *pexplicit_policy
= 1;
681 /* Tree empty and requireExplicit True: Error */
682 if (init_ret
& X509_PCY_TREE_EMPTY
)
683 return X509_PCY_TREE_FAILURE
;
686 ret
= tree_evaluate(tree
);
687 TREE_PRINT("tree_evaluate()", tree
, NULL
);
691 if (ret
== X509_PCY_TREE_EMPTY
) {
692 X509_policy_tree_free(tree
);
693 if (init_ret
& X509_PCY_TREE_EXPLICIT
)
694 return X509_PCY_TREE_FAILURE
;
695 return X509_PCY_TREE_VALID
;
698 /* Tree is not empty: continue */
700 if ((calc_ret
= tree_calculate_authority_set(tree
, &auth_nodes
)) == 0)
702 sk_X509_POLICY_NODE_sort(auth_nodes
);
703 ret
= tree_calculate_user_set(tree
, policy_oids
, auth_nodes
);
704 if (calc_ret
== TREE_CALC_OK_DOFREE
)
705 sk_X509_POLICY_NODE_free(auth_nodes
);
711 if (init_ret
& X509_PCY_TREE_EXPLICIT
) {
712 nodes
= X509_policy_tree_get0_user_policies(tree
);
713 if (sk_X509_POLICY_NODE_num(nodes
) <= 0)
714 return X509_PCY_TREE_FAILURE
;
716 return X509_PCY_TREE_VALID
;
719 X509_policy_tree_free(tree
);
720 return X509_PCY_TREE_INTERNAL
;