Lines Matching refs:nodes
59 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++) { in tree_print()
61 sk_X509_POLICY_NODE_value(plev->nodes, i); in tree_print()
248 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) { in tree_link_matching_nodes()
249 X509_POLICY_NODE *node = sk_X509_POLICY_NODE_value(last->nodes, i); in tree_link_matching_nodes()
364 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) { in tree_link_any()
365 node = sk_X509_POLICY_NODE_value(last->nodes, i); in tree_link_any()
390 STACK_OF(X509_POLICY_NODE) *nodes; in tree_prune()
393 nodes = curr->nodes; in tree_prune()
395 for (i = sk_X509_POLICY_NODE_num(nodes) - 1; i >= 0; i--) { in tree_prune()
396 node = sk_X509_POLICY_NODE_value(nodes, i); in tree_prune()
401 (void)sk_X509_POLICY_NODE_delete(nodes, i); in tree_prune()
408 nodes = curr->nodes; in tree_prune()
409 for (i = sk_X509_POLICY_NODE_num(nodes) - 1; i >= 0; i--) { in tree_prune()
410 node = sk_X509_POLICY_NODE_value(nodes, i); in tree_prune()
414 (void)sk_X509_POLICY_NODE_delete(nodes, i); in tree_prune()
490 for (j = 0; j < sk_X509_POLICY_NODE_num(curr->nodes); j++) { in tree_calculate_authority_set()
491 node = sk_X509_POLICY_NODE_value(curr->nodes, j); in tree_calculate_authority_set()
616 sk_X509_POLICY_NODE_pop_free(curr->nodes, ossl_policy_node_free); in X509_policy_tree_free()
642 STACK_OF(X509_POLICY_NODE) *nodes, *auth_nodes = NULL; in X509_policy_check()
688 nodes = X509_policy_tree_get0_user_policies(tree); in X509_policy_check()
689 if (sk_X509_POLICY_NODE_num(nodes) <= 0) in X509_policy_check()