Home
last modified time | relevance | path

Searched refs:node (Results 1 – 11 of 11) sorted by relevance

/crypto/x509/
A Dpcy_node.c47 X509_POLICY_NODE *node; in ossl_policy_level_find_node() local
51 if (node->parent == parent) { in ossl_policy_level_find_node()
53 return node; in ossl_policy_level_find_node()
65 X509_POLICY_NODE *node; in ossl_policy_level_add_node() local
71 node = OPENSSL_zalloc(sizeof(*node)); in ossl_policy_level_add_node()
72 if (node == NULL) in ossl_policy_level_add_node()
74 node->data = data; in ossl_policy_level_add_node()
75 node->parent = parent; in ossl_policy_level_add_node()
113 return node; in ossl_policy_level_add_node()
124 ossl_policy_node_free(node); in ossl_policy_level_add_node()
[all …]
A Dpcy_tree.c73 X509_POLICY_NODE *node = in tree_print() local
349 if (node->nchild) in tree_link_unmatched()
380 X509_POLICY_NODE *node; in tree_link_any() local
410 X509_POLICY_NODE *node; in tree_prune() local
536 X509_POLICY_NODE *node; in tree_calculate_user_set() local
561 if (!node) { in tree_calculate_user_set()
576 if (node == NULL) { in tree_calculate_user_set()
584 exnode_free(node); in tree_calculate_user_set()
589 exnode_free(node); in tree_calculate_user_set()
626 if (node->data && (node->data->flags & POLICY_DATA_FLAG_EXTRA_NODE)) in exnode_free()
[all …]
A Dpcy_lib.c86 const ASN1_OBJECT *X509_policy_node_get0_policy(const X509_POLICY_NODE *node) in X509_policy_node_get0_policy() argument
88 if (!node) in X509_policy_node_get0_policy()
90 return node->data->valid_policy; in X509_policy_node_get0_policy()
95 *node) in STACK_OF()
97 if (!node) in STACK_OF()
99 return node->data->qualifier_set; in STACK_OF()
103 *node) in X509_policy_node_get0_parent() argument
105 if (!node) in X509_policy_node_get0_parent()
107 return node->parent; in X509_policy_node_get0_parent()
A Dpcy_local.h139 #define node_critical(node) node_data_critical(node->data) argument
167 void ossl_policy_node_free(X509_POLICY_NODE *node);
169 const X509_POLICY_NODE *node, const ASN1_OBJECT *oid);
A Dv3_cpols.c502 void X509_POLICY_NODE_print(BIO *out, X509_POLICY_NODE *node, int indent) in X509_POLICY_NODE_print() argument
504 const X509_POLICY_DATA *dat = node->data; in X509_POLICY_NODE_print()
/crypto/slh_dsa/
A Dslh_hypertree.c114 uint8_t node[SLH_MAX_N]; in ossl_slh_ht_verify() local
123 memcpy(node, msg, n); in ossl_slh_ht_verify()
128 if (!ossl_slh_xmss_pk_from_sig(ctx, leaf_id, sig_pkt, node, in ossl_slh_ht_verify()
129 pk_seed, adrs, node, sizeof(node))) in ossl_slh_ht_verify()
134 return (memcmp(node, pk_root, n) == 0); in ossl_slh_ht_verify()
A Dslh_xmss.c153 uint8_t *node = pk_out; in ossl_slh_xmss_pk_from_sig() local
159 node, pk_out_len)) in ossl_slh_xmss_pk_from_sig()
171 if (!H(ctx, pk_seed, adrs, node, auth_path, node, pk_out_len)) in ossl_slh_xmss_pk_from_sig()
176 if (!H(ctx, pk_seed, adrs, auth_path, node, node, pk_out_len)) in ossl_slh_xmss_pk_from_sig()
A Dslh_fors.c79 uint32_t height, uint8_t *node, size_t node_len) in slh_fors_node() argument
94 ret = key->hash_func->F(ctx, pk_seed, adrs, sk, n, node, node_len); in slh_fors_node()
105 if (!key->hash_func->H(ctx, pk_seed, adrs, lnode, rnode, node, node_len)) in slh_fors_node()
/crypto/
A DREADME-sparse_array.md7 The sparse array is represented using a tree structure. Each node in the
9 to another node.
48 index 0 results in the allocation of a top level node full of null pointers
74 Inserting at element 2N+1 creates a new root node and pushes down the old root
75 node. It then creates a second second level node to hold the pointer to the
A Dsparse_array.c65 static void sa_doall(const OPENSSL_SA *sa, void (*node)(void **), in sa_doall()
80 if (p != NULL && node != NULL) in sa_doall()
81 (*node)(p); in sa_doall()
/crypto/dso/
A Ddso_win32.c189 const char *node; member
225 result->node = start; in win32_splitter()
288 result->node = NULL; in win32_splitter()
309 if (file_split->node) { in win32_joiner()
335 if (file_split->node) { in win32_joiner()
338 strncpy(&result[offset], file_split->node, file_split->nodelen); in win32_joiner()
416 if (!filespec1_split->node && !filespec1_split->device) { in win32_merger()
417 filespec1_split->node = filespec2_split->node; in win32_merger()

Completed in 36 milliseconds