Lines Matching refs:nodes
115 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++) {
116 node = sk_X509_POLICY_NODE_value(plev->nodes, i);
312 /* Iterate through all in nodes linking matches */
313 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) {
314 node = sk_X509_POLICY_NODE_value(last->nodes, i);
354 /* Look for matching nodes in previous level */
413 /* Locate unmatched nodes */
439 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) {
440 node = sk_X509_POLICY_NODE_value(last->nodes, i);
448 * Skip any node with any children: we only want unmathced nodes.
490 STACK_OF(X509_POLICY_NODE) *nodes;
493 nodes = curr->nodes;
495 for (i = sk_X509_POLICY_NODE_num(nodes) - 1; i >= 0; i--) {
496 node = sk_X509_POLICY_NODE_value(nodes, i);
501 (void)sk_X509_POLICY_NODE_delete(nodes, i);
508 nodes = curr->nodes;
509 for (i = sk_X509_POLICY_NODE_num(nodes) - 1; i >= 0; i--) {
510 node = sk_X509_POLICY_NODE_value(nodes, i);
514 (void)sk_X509_POLICY_NODE_delete(nodes, i);
554 * is used as a store for the set of policy nodes used to calculate the user
588 for (j = 0; j < sk_X509_POLICY_NODE_num(curr->nodes); j++) {
589 node = sk_X509_POLICY_NODE_value(curr->nodes, j);
707 if (curr->nodes)
708 sk_X509_POLICY_NODE_pop_free(curr->nodes, policy_node_free);
737 STACK_OF(X509_POLICY_NODE) *nodes, *auth_nodes = NULL;
822 nodes = X509_policy_tree_get0_user_policies(tree);
823 if (sk_X509_POLICY_NODE_num(nodes) <= 0)