1
0
mirror of https://github.com/samba-team/samba.git synced 2025-01-04 05:18:06 +03:00
samba-mirror/source/registry/reg_api.c

499 lines
11 KiB
C

/*
* Unix SMB/CIFS implementation.
* Virtual Windows Registry Layer
* Copyright (C) Volker Lendecke 2006
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
/* Attempt to wrap the existing API in a more winreg.idl-like way */
#include "includes.h"
static WERROR fill_value_cache(struct registry_key *key)
{
if (key->values != NULL) {
return WERR_OK;
}
if (!(key->values = TALLOC_ZERO_P(key, REGVAL_CTR))) {
return WERR_NOMEM;
}
if (fetch_reg_values(key->key, key->values) == -1) {
TALLOC_FREE(key->values);
return WERR_BADFILE;
}
return WERR_OK;
}
static WERROR fill_subkey_cache(struct registry_key *key)
{
if (key->subkeys != NULL) {
return WERR_OK;
}
if (!(key->subkeys = TALLOC_ZERO_P(key, REGSUBKEY_CTR))) {
return WERR_NOMEM;
}
if (fetch_reg_keys(key->key, key->subkeys) == -1) {
TALLOC_FREE(key->subkeys);
return WERR_NO_MORE_ITEMS;
}
return WERR_OK;
}
WERROR reg_openhive(TALLOC_CTX *mem_ctx, const char *hive,
uint32 desired_access,
const struct nt_user_token *token,
struct registry_key **pkey)
{
SMB_ASSERT(hive != NULL);
SMB_ASSERT(hive[0] != '\0');
SMB_ASSERT(strchr(hive, '\\') == NULL);
return regkey_open_onelevel(mem_ctx, NULL, hive, token, desired_access,
pkey);
}
WERROR reg_openkey(TALLOC_CTX *mem_ctx, struct registry_key *parent,
const char *name, uint32 desired_access,
struct registry_key **pkey)
{
struct registry_key *direct_parent = parent;
WERROR err;
char *p, *path, *to_free;
size_t len;
if (!(path = SMB_STRDUP(name))) {
return WERR_NOMEM;
}
to_free = path;
len = strlen(path);
if ((len > 0) && (path[len-1] == '\\')) {
path[len-1] = '\0';
}
while ((p = strchr(path, '\\')) != NULL) {
char *name_component;
struct registry_key *tmp;
if (!(name_component = SMB_STRNDUP(path, (p - path)))) {
err = WERR_NOMEM;
goto error;
}
err = regkey_open_onelevel(mem_ctx, direct_parent,
name_component, parent->token,
SEC_RIGHTS_ENUM_SUBKEYS, &tmp);
SAFE_FREE(name_component);
if (!W_ERROR_IS_OK(err)) {
goto error;
}
if (direct_parent != parent) {
TALLOC_FREE(direct_parent);
}
direct_parent = tmp;
path = p+1;
}
err = regkey_open_onelevel(mem_ctx, direct_parent, path, parent->token,
desired_access, pkey);
error:
if (direct_parent != parent) {
TALLOC_FREE(direct_parent);
}
SAFE_FREE(to_free);
return err;
}
WERROR reg_enumkey(TALLOC_CTX *mem_ctx, struct registry_key *key,
uint32 idx, char **name, NTTIME *last_write_time)
{
WERROR err;
if (!(key->key->access_granted & SEC_RIGHTS_ENUM_SUBKEYS)) {
return WERR_ACCESS_DENIED;
}
if (!W_ERROR_IS_OK(err = fill_subkey_cache(key))) {
return err;
}
if (idx >= key->subkeys->num_subkeys) {
return WERR_NO_MORE_ITEMS;
}
if (!(*name = talloc_strdup(mem_ctx, key->subkeys->subkeys[idx]))) {
return WERR_NOMEM;
}
if (last_write_time) {
*last_write_time = 0;
}
return WERR_OK;
}
WERROR reg_enumvalue(TALLOC_CTX *mem_ctx, struct registry_key *key,
uint32 idx, char **pname, struct registry_value **pval)
{
struct registry_value *val;
WERROR err;
if (!(key->key->access_granted & SEC_RIGHTS_QUERY_VALUE)) {
return WERR_ACCESS_DENIED;
}
if (!(W_ERROR_IS_OK(err = fill_value_cache(key)))) {
return err;
}
if (idx >= key->values->num_values) {
return WERR_BADFILE;
}
err = registry_pull_value(mem_ctx, &val,
key->values->values[idx]->type,
key->values->values[idx]->data_p,
key->values->values[idx]->size,
key->values->values[idx]->size);
if (!W_ERROR_IS_OK(err)) {
return err;
}
if (pname
&& !(*pname = talloc_strdup(
mem_ctx, key->values->values[idx]->valuename))) {
SAFE_FREE(val);
return WERR_NOMEM;
}
*pval = val;
return WERR_OK;
}
WERROR reg_queryvalue(TALLOC_CTX *mem_ctx, struct registry_key *key,
const char *name, struct registry_value **pval)
{
WERROR err;
uint32 i;
if (!(key->key->access_granted & SEC_RIGHTS_QUERY_VALUE)) {
return WERR_ACCESS_DENIED;
}
if (!(W_ERROR_IS_OK(err = fill_value_cache(key)))) {
return err;
}
for (i=0; i<key->values->num_values; i++) {
if (strequal(key->values->values[i]->valuename, name)) {
return reg_enumvalue(mem_ctx, key, i, NULL, pval);
}
}
return WERR_BADFILE;
}
WERROR reg_queryinfokey(struct registry_key *key, uint32_t *num_subkeys,
uint32_t *max_subkeylen, uint32_t *max_subkeysize,
uint32_t *num_values, uint32_t *max_valnamelen,
uint32_t *max_valbufsize, uint32_t *secdescsize,
NTTIME *last_changed_time)
{
uint32 i, max_size;
size_t max_len;
TALLOC_CTX *mem_ctx;
WERROR err;
struct security_descriptor *secdesc;
if (!(key->key->access_granted & SEC_RIGHTS_QUERY_VALUE)) {
return WERR_ACCESS_DENIED;
}
if (!W_ERROR_IS_OK(fill_subkey_cache(key)) ||
!W_ERROR_IS_OK(fill_value_cache(key))) {
return WERR_BADFILE;
}
max_len = 0;
for (i=0; i<key->subkeys->num_subkeys; i++) {
max_len = MAX(max_len, strlen(key->subkeys->subkeys[i]));
}
*num_subkeys = key->subkeys->num_subkeys;
*max_subkeylen = max_len;
*max_subkeysize = 0; /* Class length? */
max_len = 0;
max_size = 0;
for (i=0; i<key->values->num_values; i++) {
max_len = MAX(max_len,
strlen(key->values->values[i]->valuename));
max_size = MAX(max_size, key->values->values[i]->size);
}
*num_values = key->values->num_values;
*max_valnamelen = max_len;
*max_valbufsize = max_size;
if (!(mem_ctx = talloc_new(key))) {
return WERR_NOMEM;
}
err = regkey_get_secdesc(mem_ctx, key->key, &secdesc);
if (!W_ERROR_IS_OK(err)) {
TALLOC_FREE(mem_ctx);
return err;
}
*secdescsize = sec_desc_size(secdesc);
TALLOC_FREE(mem_ctx);
*last_changed_time = 0;
return WERR_OK;
}
WERROR reg_createkey(TALLOC_CTX *ctx, struct registry_key *parent,
const char *subkeypath, uint32 desired_access,
struct registry_key **pkey,
enum winreg_CreateAction *paction)
{
struct registry_key *key = parent;
struct registry_key *create_parent;
TALLOC_CTX *mem_ctx;
char *path, *end;
WERROR err;
REGSUBKEY_CTR *subkeys;
if (!(mem_ctx = talloc_new(ctx))) return WERR_NOMEM;
if (!(path = talloc_strdup(mem_ctx, subkeypath))) {
err = WERR_NOMEM;
goto done;
}
while ((end = strchr(path, '\\')) != NULL) {
struct registry_key *tmp;
enum winreg_CreateAction action;
*end = '\0';
err = reg_createkey(mem_ctx, key, path,
SEC_RIGHTS_ENUM_SUBKEYS, &tmp, &action);
if (!W_ERROR_IS_OK(err)) {
goto done;
}
if (key != parent) {
TALLOC_FREE(key);
}
key = tmp;
path = end+1;
}
/*
* At this point, "path" contains the one-element subkey of "key". We
* can try to open it.
*/
err = reg_openkey(ctx, key, path, desired_access, pkey);
if (W_ERROR_IS_OK(err)) {
if (paction != NULL) {
*paction = REG_OPENED_EXISTING_KEY;
}
goto done;
}
if (!W_ERROR_EQUAL(err, WERR_BADFILE)) {
/*
* Something but "notfound" has happened, so bail out
*/
goto done;
}
/*
* We have to make a copy of the current key, as we opened it only
* with ENUM_SUBKEY access.
*/
err = reg_openkey(mem_ctx, key, "", SEC_RIGHTS_CREATE_SUBKEY,
&create_parent);
if (!W_ERROR_IS_OK(err)) {
goto done;
}
/*
* Actually create the subkey
*/
if (!(subkeys = TALLOC_ZERO_P(mem_ctx, REGSUBKEY_CTR))) {
err = WERR_NOMEM;
goto done;
}
err = fill_subkey_cache(create_parent);
if (!W_ERROR_IS_OK(err)) goto done;
err = regsubkey_ctr_addkey(create_parent->subkeys, path);
if (!W_ERROR_IS_OK(err)) goto done;
if (!store_reg_keys(create_parent->key, create_parent->subkeys)) {
TALLOC_FREE(create_parent->subkeys);
err = WERR_REG_IO_FAILURE;
goto done;
}
/*
* Now open the newly created key
*/
err = reg_openkey(ctx, create_parent, path, desired_access, pkey);
if (W_ERROR_IS_OK(err) && (paction != NULL)) {
*paction = REG_CREATED_NEW_KEY;
}
done:
TALLOC_FREE(mem_ctx);
return err;
}
WERROR reg_deletekey(struct registry_key *parent, const char *path)
{
WERROR err;
TALLOC_CTX *mem_ctx;
char *name, *end;
int num_subkeys;
if (!(mem_ctx = talloc_init("reg_createkey"))) return WERR_NOMEM;
if (!(name = talloc_strdup(mem_ctx, path))) {
err = WERR_NOMEM;
goto error;
}
if ((end = strrchr(name, '\\')) != NULL) {
struct registry_key *tmp;
*end = '\0';
err = reg_openkey(mem_ctx, parent, name,
SEC_RIGHTS_CREATE_SUBKEY, &tmp);
if (!W_ERROR_IS_OK(err)) {
goto error;
}
parent = tmp;
name = end+1;
}
if (name[0] == '\0') {
err = WERR_INVALID_PARAM;
goto error;
}
if (!W_ERROR_IS_OK(err = fill_subkey_cache(parent))) {
goto error;
}
num_subkeys = parent->subkeys->num_subkeys;
if (regsubkey_ctr_delkey(parent->subkeys, name) == num_subkeys) {
err = WERR_BADFILE;
goto error;
}
if (!store_reg_keys(parent->key, parent->subkeys)) {
TALLOC_FREE(parent->subkeys);
err = WERR_REG_IO_FAILURE;
goto error;
}
err = WERR_OK;
error:
TALLOC_FREE(mem_ctx);
return err;
}
WERROR reg_setvalue(struct registry_key *key, const char *name,
const struct registry_value *val)
{
WERROR err;
DATA_BLOB value_data;
int res;
if (!(key->key->access_granted & SEC_RIGHTS_SET_VALUE)) {
return WERR_ACCESS_DENIED;
}
if (!W_ERROR_IS_OK(err = fill_value_cache(key))) {
return err;
}
err = registry_push_value(key, val, &value_data);
if (!W_ERROR_IS_OK(err)) {
return err;
}
res = regval_ctr_addvalue(key->values, name, val->type,
(char *)value_data.data, value_data.length);
TALLOC_FREE(value_data.data);
if (res == 0) {
TALLOC_FREE(key->values);
return WERR_NOMEM;
}
if (!store_reg_values(key->key, key->values)) {
TALLOC_FREE(key->values);
return WERR_REG_IO_FAILURE;
}
return WERR_OK;
}
WERROR reg_deletevalue(struct registry_key *key, const char *name)
{
WERROR err;
if (!(key->key->access_granted & SEC_RIGHTS_SET_VALUE)) {
return WERR_ACCESS_DENIED;
}
if (!W_ERROR_IS_OK(err = fill_value_cache(key))) {
return err;
}
regval_ctr_delvalue(key->values, name);
if (!store_reg_values(key->key, key->values)) {
TALLOC_FREE(key->values);
return WERR_REG_IO_FAILURE;
}
return WERR_OK;
}