2 * Unix SMB/CIFS implementation.
3 * Virtual Windows Registry Layer
4 * Copyright (C) Gerald Carter 2005
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 virtual views for printing information */
24 #include "reg_objects.h"
27 #define DBGC_CLASS DBGC_REGISTRY
29 /**********************************************************************
30 It is safe to assume that every registry path passed into one of
31 the exported functions here begins with KEY_SHARES else
32 these functions would have never been called. This is a small utility
33 function to strip the beginning of the path and make a copy that the
34 caller can modify. Note that the caller is responsible for releasing
35 the memory allocated here.
36 **********************************************************************/
38 static char* trim_reg_path( const char *path
)
41 uint16 key_len
= strlen(KEY_SHARES
);
44 * sanity check...this really should never be True.
45 * It is only here to prevent us from accessing outside
46 * the path buffer in the extreme case.
49 if ( strlen(path
) < key_len
) {
50 DEBUG(0,("trim_reg_path: Registry path too short! [%s]\n", path
));
54 p
= path
+ strlen( KEY_SHARES
);
65 /**********************************************************************
66 Enumerate registry subkey names given a registry path.
67 Caller is responsible for freeing memory to **subkeys
68 *********************************************************************/
70 static int shares_subkey_info( const char *key
, struct regsubkey_ctr
*subkey_ctr
)
73 bool top_level
= False
;
76 DEBUG(10, ("shares_subkey_info: key=>[%s]\n", key
));
78 path
= trim_reg_path( key
);
80 /* check to see if we are dealing with the top level key */
87 regsubkey_ctr_addkey( subkey_ctr
, "Security" );
91 num_subkeys
= handle_share_subpath( path
, subkey_ctr
, NULL
);
99 /**********************************************************************
100 Enumerate registry values given a registry path.
101 Caller is responsible for freeing memory
102 *********************************************************************/
104 static int shares_value_info(const char *key
, struct regval_ctr
*val
)
107 bool top_level
= False
;
110 DEBUG(10, ("shares_value_info: key=>[%s]\n", key
));
112 path
= trim_reg_path( key
);
114 /* check to see if we are dealing with the top level key */
119 /* fill in values from the getprinterdata_printer_server() */
124 num_values
= handle_printing_subpath( path
, NULL
, val
);
132 /**********************************************************************
133 Stub function which always returns failure since we don't want
134 people storing share information directly via registry calls
136 *********************************************************************/
138 static bool shares_store_subkey( const char *key
, struct regsubkey_ctr
*subkeys
)
143 /**********************************************************************
144 Stub function which always returns failure since we don't want
145 people storing share information directly via registry calls
147 *********************************************************************/
149 static bool shares_store_value(const char *key
, struct regval_ctr
*val
)
155 * Table of function pointers for accessing printing data
158 struct registry_ops shares_reg_ops
= {
159 .fetch_subkeys
= shares_subkey_info
,
160 .fetch_values
= shares_value_info
,
161 .store_subkeys
= shares_store_subkey
,
162 .store_values
= shares_store_value
,