2 Unix SMB/CIFS implementation.
3 Transparent registry backend handling
4 Copyright (C) Jelmer Vernooij 2003-2007.
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/>.
21 #include "lib/registry/registry.h"
22 #include "librpc/gen_ndr/winreg.h"
26 * @brief Registry utility functions
32 } reg_value_types
[] = {
33 { REG_NONE
, "REG_NONE" },
35 { REG_EXPAND_SZ
, "REG_EXPAND_SZ" },
36 { REG_BINARY
, "REG_BINARY" },
37 { REG_DWORD
, "REG_DWORD" },
38 { REG_DWORD_BIG_ENDIAN
, "REG_DWORD_BIG_ENDIAN" },
39 { REG_LINK
, "REG_LINK" },
40 { REG_MULTI_SZ
, "REG_MULTI_SZ" },
41 { REG_RESOURCE_LIST
, "REG_RESOURCE_LIST" },
42 { REG_FULL_RESOURCE_DESCRIPTOR
, "REG_FULL_RESOURCE_DESCRIPTOR" },
43 { REG_RESOURCE_REQUIREMENTS_LIST
, "REG_RESOURCE_REQUIREMENTS_LIST" },
44 { REG_QWORD
, "REG_QWORD" },
49 /** Return string description of registry value type */
50 _PUBLIC_
const char *str_regtype(int type
)
53 for (i
= 0; reg_value_types
[i
].name
; i
++) {
54 if (reg_value_types
[i
].id
== type
)
55 return reg_value_types
[i
].name
;
61 _PUBLIC_
char *reg_val_data_string(TALLOC_CTX
*mem_ctx
,
62 struct smb_iconv_convenience
*iconv_convenience
,
69 return talloc_strdup(mem_ctx
, "");
73 /* "NULL" is the right return value */
77 if (data
.length
% 2 == 0) {
78 convert_string_talloc_convenience(mem_ctx
,
88 case REG_DWORD_BIG_ENDIAN
:
89 if (data
.length
== sizeof(uint32_t)) {
90 ret
= talloc_asprintf(mem_ctx
, "0x%8.8x",
95 if (data
.length
== sizeof(uint64_t)) {
96 ret
= talloc_asprintf(mem_ctx
, "0x%16.16llx",
102 ret
= data_blob_hex_string_upper(mem_ctx
, &data
);
109 /** Generate a string that describes a registry value */
110 _PUBLIC_
char *reg_val_description(TALLOC_CTX
*mem_ctx
,
111 struct smb_iconv_convenience
*iconv_convenience
,
114 const DATA_BLOB data
)
116 return talloc_asprintf(mem_ctx
, "%s = %s : %s", name
?name
:"<No Name>",
117 str_regtype(data_type
),
118 reg_val_data_string(mem_ctx
, iconv_convenience
, data_type
, data
));
121 _PUBLIC_
bool reg_string_to_val(TALLOC_CTX
*mem_ctx
,
122 struct smb_iconv_convenience
*iconv_convenience
,
123 const char *type_str
,
124 const char *data_str
, uint32_t *type
,
130 /* Find the correct type */
131 for (i
= 0; reg_value_types
[i
].name
; i
++) {
132 if (!strcmp(reg_value_types
[i
].name
, type_str
)) {
133 *type
= reg_value_types
[i
].id
;
141 /* Convert data appropriately */
149 return convert_string_talloc_convenience(mem_ctx
,
154 (void **)&data
->data
,
155 &data
->length
, false);
158 case REG_DWORD_BIG_ENDIAN
: {
159 uint32_t tmp
= strtol(data_str
, NULL
, 0);
160 *data
= data_blob_talloc(mem_ctx
, NULL
, sizeof(uint32_t));
161 if (data
->data
== NULL
) return false;
162 SIVAL(data
->data
, 0, tmp
);
166 uint64_t tmp
= strtoll(data_str
, NULL
, 0);
167 *data
= data_blob_talloc(mem_ctx
, NULL
, sizeof(uint64_t));
168 if (data
->data
== NULL
) return false;
169 SBVAL(data
->data
, 0, tmp
);
174 *data
= strhex_to_data_blob(mem_ctx
, data_str
);
180 /** Open a key by name (including the predefined key name!) */
181 WERROR
reg_open_key_abs(TALLOC_CTX
*mem_ctx
, struct registry_context
*handle
,
182 const char *name
, struct registry_key
**result
)
184 struct registry_key
*predef
;
189 if (strchr(name
, '\\') != NULL
)
190 predeflength
= strchr(name
, '\\')-name
;
192 predeflength
= strlen(name
);
194 predefname
= talloc_strndup(mem_ctx
, name
, predeflength
);
195 W_ERROR_HAVE_NO_MEMORY(predefname
);
196 error
= reg_get_predefined_key_by_name(handle
, predefname
, &predef
);
197 talloc_free(predefname
);
199 if (!W_ERROR_IS_OK(error
)) {
203 if (strchr(name
, '\\')) {
204 return reg_open_key(mem_ctx
, predef
, strchr(name
, '\\')+1,
212 static WERROR
get_abs_parent(TALLOC_CTX
*mem_ctx
, struct registry_context
*ctx
,
213 const char *path
, struct registry_key
**parent
,
219 if (strchr(path
, '\\') == NULL
) {
223 parent_name
= talloc_strndup(mem_ctx
, path
, strrchr(path
, '\\')-path
);
224 W_ERROR_HAVE_NO_MEMORY(parent_name
);
225 error
= reg_open_key_abs(mem_ctx
, ctx
, parent_name
, parent
);
226 talloc_free(parent_name
);
227 if (!W_ERROR_IS_OK(error
)) {
231 *name
= talloc_strdup(mem_ctx
, strrchr(path
, '\\')+1);
232 W_ERROR_HAVE_NO_MEMORY(*name
);
237 WERROR
reg_key_del_abs(TALLOC_CTX
*mem_ctx
, struct registry_context
*ctx
,
240 struct registry_key
*parent
;
244 if (!strchr(path
, '\\')) {
248 error
= get_abs_parent(mem_ctx
, ctx
, path
, &parent
, &n
);
249 if (W_ERROR_IS_OK(error
)) {
250 error
= reg_key_del(mem_ctx
, parent
, n
);
259 WERROR
reg_key_add_abs(TALLOC_CTX
*mem_ctx
, struct registry_context
*ctx
,
260 const char *path
, uint32_t access_mask
,
261 struct security_descriptor
*sec_desc
,
262 struct registry_key
**result
)
264 struct registry_key
*parent
;
268 if (!strchr(path
, '\\')) {
269 return WERR_ALREADY_EXISTS
;
272 error
= get_abs_parent(mem_ctx
, ctx
, path
, &parent
, &n
);
273 if (W_ERROR_IS_OK(error
)) {
274 error
= reg_key_add_name(mem_ctx
, parent
, n
, NULL
, sec_desc
,