TREE_NODE          34 source3/include/adt_tree.h 	TREE_NODE	*root;
TREE_NODE          63 source3/lib/adt_tree.c 	if ( !(tree->root = TALLOC_ZERO_P(tree, TREE_NODE)) ) {
TREE_NODE          78 source3/lib/adt_tree.c static TREE_NODE* pathtree_birth_child( TREE_NODE *node, char* key )
TREE_NODE          80 source3/lib/adt_tree.c 	TREE_NODE *infant = NULL;
TREE_NODE          81 source3/lib/adt_tree.c 	TREE_NODE **siblings;
TREE_NODE          84 source3/lib/adt_tree.c 	if ( !(infant = TALLOC_ZERO_P( node, TREE_NODE)) )
TREE_NODE          90 source3/lib/adt_tree.c 	siblings = TALLOC_REALLOC_ARRAY( node, node->children, TREE_NODE *, node->num_children+1 );
TREE_NODE         151 source3/lib/adt_tree.c static TREE_NODE* pathtree_find_child( TREE_NODE *node, char* key )
TREE_NODE         153 source3/lib/adt_tree.c 	TREE_NODE *next = NULL;
TREE_NODE         197 source3/lib/adt_tree.c 	TREE_NODE *current, *next;
TREE_NODE         282 source3/lib/adt_tree.c 				TREE_NODE *node,
TREE_NODE         349 source3/lib/adt_tree.c 	TREE_NODE *current;