Searched refs:node_t (Results 1 - 3 of 3) sorted by relevance

/freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/
H A Dprefix_string.c43 typedef struct node_t node_t; typedef in typeref:struct:node_t
50 node_t *prefix;
55 * within node_t for inner tree nodes, too. There, DATA[7] is not NUL,
57 * provided by the node_t.length field (minus parent node length). */
67 struct node_t struct
80 /* The sub-nodes, ordered by first char. node_t and svn_prefix_string__t
84 struct node_t **sub_nodes;
91 node_t *root;
100 is_leaf(node_t *nod
[all...]
/freebsd-11-stable/crypto/heimdal/lib/roken/
H A Dtsearch.c5 * 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-11-stable/contrib/subversion/subversion/libsvn_repos/
H A Dauthz.c229 struct node_t *node;
235 /* Substructure of node_t. It contains all sub-node that use patterns
242 struct node_t *any;
245 struct node_t *any_var;
270 typedef struct node_t
280 /* Map of sub-segment(const char *) to respective node (node_t) for all
287 } node_t;
292 static node_t *
296 node_t *result = apr_pcalloc(result_pool, sizeof(*result));
309 static node_t *
266 typedef struct node_t struct
283 } node_t; typedef in typeref:struct:node_t
[all...]

Completed in 134 milliseconds