Searched refs:node_t (Results 1 - 10 of 10) sorted by relevance
/freebsd-10-stable/lib/libc/stdlib/ |
H A D | tsearch.c | 7 * The node_t structure is for internal use only, lint doesn't grok it. 31 node_t *q; 32 node_t **rootp = (node_t **)vrootp; 48 q = malloc(sizeof(node_t)); /* T5: key not found */
|
H A D | tfind.c | 7 * The node_t structure is for internal use only, lint doesn't grok it. 33 node_t **rootp = (node_t **)vrootp;
|
H A D | tdelete.c | 7 * The node_t structure is for internal use only, lint doesn't grok it. 38 node_t **rootp = (node_t **)vrootp; 39 node_t *p, *q, *r;
|
H A D | twalk.c | 7 * The node_t structure is for internal use only, lint doesn't grok it. 30 trecurse(const node_t *root, /* Root of the tree to be walked */
|
/freebsd-10-stable/contrib/subversion/subversion/libsvn_subr/ |
H A D | prefix_string.c | 43 typedef struct node_t node_t; typedef in typeref:struct:node_t 50 node_t *prefix; 62 struct node_t struct 75 /* The sub-nodes, ordered by first char. node_t and svn_prefix_string__t 79 struct node_t **sub_nodes; 86 node_t *root; 95 is_leaf(node_t *node) 105 node_t *node) 116 node_t **sub_node [all...] |
/freebsd-10-stable/crypto/heimdal/lib/roken/ |
H A D | tsearch.c | 5 * The node_t structure is for internal use only, lint doesn't grok it. 25 } node_t; typedef in typeref:struct:node 43 node_t *q; 44 node_t **rootp = (node_t **)vrootp; 60 q = malloc(sizeof(node_t)); /* T5: key not found */ 77 trecurse(const node_t *root, void (*action)(const void *, VISIT, int), 119 node_t **rootp = (node_t **)vrootp; 120 node_t * [all...] |
/freebsd-10-stable/contrib/ofed/management/opensm/osmtest/include/ |
H A D | osmtest_subnet.h | 74 /****s* Subnet Database/node_t 76 * node_t 89 } node_t; typedef in typeref:struct:_node 112 static inline node_t *node_new(void) 114 node_t *p_obj; 122 static inline void node_delete(IN node_t * p_obj) 214 * node_t
|
/freebsd-10-stable/include/ |
H A D | search.h | 40 } node_t; typedef in typeref:struct:node
|
/freebsd-10-stable/contrib/ofed/management/opensm/osmtest/ |
H A D | osmt_slvl_vl_arb.c | 392 node_t *p_node; 431 (node_t *) cl_qmap_get(p_node_tbl, 433 if (p_node == (node_t *) cl_qmap_end(p_node_tbl)) {
|
H A D | osmtest.c | 515 POOL_MIN_ITEMS, sizeof(node_t), NULL, NULL, 1419 node_t *p_src_node, *p_dst_node; 1430 p_src_node = (node_t *) cl_qmap_head(p_tbl); 1436 while (p_src_node != (node_t *) cl_qmap_end(p_tbl)) { 1437 p_dst_node = (node_t *) cl_qmap_head(p_tbl); 1439 while (p_dst_node != (node_t *) cl_qmap_end(p_tbl)) { 1508 (node_t *) cl_qmap_next(&p_dst_node->map_item); 1511 p_src_node = (node_t *) cl_qmap_next(&p_src_node->map_item); 2292 node_t *p_node; 2293 node_t *p_guid_nod [all...] |
Completed in 65 milliseconds