SORTED_TREE 46 source3/include/adt_tree.h SORTED_TREE* pathtree_init( void *data_p, int (cmp_fn)(void*, void*) ); SORTED_TREE 50 source3/include/adt_tree.h WERROR pathtree_add( SORTED_TREE *tree, const char *path, void *data_p ); SORTED_TREE 54 source3/include/adt_tree.h void* pathtree_find( SORTED_TREE *tree, char *key ); SORTED_TREE 58 source3/include/adt_tree.h void pathtree_print_keys( SORTED_TREE *tree, int debug ); SORTED_TREE 54 source3/lib/adt_tree.c SORTED_TREE* pathtree_init( void *data_p, int (cmp_fn)(void*, void*) ) SORTED_TREE 56 source3/lib/adt_tree.c SORTED_TREE *tree = NULL; SORTED_TREE 58 source3/lib/adt_tree.c if ( !(tree = TALLOC_ZERO_P(NULL, SORTED_TREE)) ) SORTED_TREE 194 source3/lib/adt_tree.c WERROR pathtree_add( SORTED_TREE *tree, const char *path, void *data_p ) SORTED_TREE 322 source3/lib/adt_tree.c void pathtree_print_keys( SORTED_TREE *tree, int debug ) SORTED_TREE 346 source3/lib/adt_tree.c void* pathtree_find( SORTED_TREE *tree, char *key ) SORTED_TREE 28 source3/registry/reg_cachehook.c static SORTED_TREE *cache_tree = NULL;