Lines Matching full:nodes
119 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++)
121 node = sk_X509_POLICY_NODE_value(plev->nodes, i);
321 /* Iterate through all in nodes linking matches */
322 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++)
324 node = sk_X509_POLICY_NODE_value(last->nodes, i);
367 /* Look for matching nodes in previous level */
431 /* Locate unmatched nodes */
456 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++)
458 node = sk_X509_POLICY_NODE_value(last->nodes, i);
466 * nodes.
511 STACK_OF(X509_POLICY_NODE) *nodes;
514 nodes = curr->nodes;
517 for (i = sk_X509_POLICY_NODE_num(nodes) - 1; i >= 0; i--)
519 node = sk_X509_POLICY_NODE_value(nodes, i);
525 (void)sk_X509_POLICY_NODE_delete(nodes,i);
532 nodes = curr->nodes;
533 for (i = sk_X509_POLICY_NODE_num(nodes) - 1; i >= 0; i--)
535 node = sk_X509_POLICY_NODE_value(nodes, i);
540 (void)sk_X509_POLICY_NODE_delete(nodes, i);
581 * The 'pnodes' parameter is used as a store for the set of policy nodes
619 for (j = 0; j < sk_X509_POLICY_NODE_num(curr->nodes); j++)
621 node = sk_X509_POLICY_NODE_value(curr->nodes, j);
747 if (curr->nodes)
748 sk_X509_POLICY_NODE_pop_free(curr->nodes,
778 STACK_OF(X509_POLICY_NODE) *nodes, *auth_nodes = NULL;
862 nodes = X509_policy_tree_get0_user_policies(tree);
863 if (sk_X509_POLICY_NODE_num(nodes) <= 0)
