2 * Unix SMB/CIFS implementation.
3 * Virtual Windows Registry Layer
4 * Copyright (C) Gerald Carter 2002.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 3 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, see <http://www.gnu.org/licenses/>.
20 /* Implementation of registry hook cache tree */
26 #define DBGC_CLASS DBGC_REGISTRY
28 static SORTED_TREE
*cache_tree
= NULL
;
29 extern REGISTRY_OPS regdb_ops
; /* these are the default */
30 static REGISTRY_HOOK default_hook
= { KEY_TREE_ROOT
, ®db_ops
};
32 /**********************************************************************
33 Initialize the cache tree if it has not been initialized yet.
34 *********************************************************************/
36 bool reghook_cache_init( void )
38 if (cache_tree
== NULL
) {
39 cache_tree
= pathtree_init(&default_hook
, NULL
);
41 DEBUG(10, ("reghook_cache_init: new tree with default "
42 "ops %p for key [%s]\n", (void *)®db_ops
,
47 return (cache_tree
!= NULL
);
50 /**********************************************************************
51 Add a new REGISTRY_HOOK to the cache. Note that the keyname
52 is not in the exact format that a SORTED_TREE expects.
53 *********************************************************************/
55 bool reghook_cache_add( REGISTRY_HOOK
*hook
)
57 TALLOC_CTX
*ctx
= talloc_tos();
64 key
= talloc_asprintf(ctx
, "\\%s", hook
->keyname
);
68 key
= talloc_string_sub(ctx
, key
, "\\", "/");
73 DEBUG(10, ("reghook_cache_add: Adding ops %p for key [%s]\n",
74 (void *)hook
->ops
, key
));
76 return pathtree_add( cache_tree
, key
, hook
);
79 /**********************************************************************
80 Initialize the cache tree
81 *********************************************************************/
83 REGISTRY_HOOK
* reghook_cache_find( const char *keyname
)
92 /* prepend the string with a '\' character */
94 len
= strlen( keyname
);
95 if ( !(key
= (char *)SMB_MALLOC( len
+ 2 )) ) {
96 DEBUG(0,("reghook_cache_find: malloc failed for string [%s] !?!?!\n",
102 strncpy( key
+1, keyname
, len
+1);
104 /* swap to a form understood by the SORTED_TREE */
106 string_sub( key
, "\\", "/", 0 );
108 DEBUG(10,("reghook_cache_find: Searching for keyname [%s]\n", key
));
110 hook
= (REGISTRY_HOOK
*)pathtree_find( cache_tree
, key
) ;
112 DEBUG(10, ("reghook_cache_find: found ops %p for key [%s]\n",
113 hook
? (void *)hook
->ops
: 0, key
));
120 /**********************************************************************
121 Initialize the cache tree
122 *********************************************************************/
124 void reghook_dump_cache( int debuglevel
)
126 DEBUG(debuglevel
,("reghook_dump_cache: Starting cache dump now...\n"));
128 pathtree_print_keys( cache_tree
, debuglevel
);