/*
winreg_DeleteKey
*/
static WERROR dcesrv_winreg_DeleteKey(struct dcesrv_call_state *dce_call,
TALLOC_CTX *mem_ctx,
struct winreg_DeleteKey *r)
{
struct dcesrv_handle *h;
struct registry_key *key;
DCESRV_PULL_HANDLE_FAULT(h, r->in.handle, HTYPE_REGKEY);
key = h->data;
switch (security_session_user_level(dce_call->conn->auth_state.session_info))
{
case SECURITY_SYSTEM:
case SECURITY_ADMINISTRATOR:
return reg_key_del(key, r->in.key.name);
default:
return WERR_ACCESS_DENIED;
}
}
static WERROR cmd_rmkey(struct regshell_context *ctx,
int argc, char **argv)
{
WERROR error;
if(argc < 2) {
fprintf(stderr, "Usage: rmkey <name>\n");
return WERR_INVALID_PARAM;
}
error = reg_key_del(ctx, ctx->current, argv[1]);
if(!W_ERROR_IS_OK(error)) {
fprintf(stderr, "Error deleting '%s'\n", argv[1]);
return error;
} else {
fprintf(stderr, "Successfully deleted '%s'\n", argv[1]);
}
return WERR_OK;
}
WERROR reg_key_del_abs(struct registry_context *ctx, const char *path)
{
struct registry_key *parent;
const char *n;
TALLOC_CTX *mem_ctx = talloc_init("reg_key_del_abs");
WERROR error;
if (!strchr(path, '\\')) {
return WERR_FOOBAR;
}
error = get_abs_parent(mem_ctx, ctx, path, &parent, &n);
if (W_ERROR_IS_OK(error)) {
error = reg_key_del(parent, n);
}
talloc_free(mem_ctx);
return error;
}
static void handle_tree_input(struct regedit *regedit, int c)
{
struct tree_node *node;
switch (c) {
case KEY_DOWN:
menu_driver(regedit->keys->menu, REQ_DOWN_ITEM);
load_values(regedit);
break;
case KEY_UP:
menu_driver(regedit->keys->menu, REQ_UP_ITEM);
load_values(regedit);
break;
case '\n':
case KEY_ENTER:
case KEY_RIGHT:
node = item_userptr(current_item(regedit->keys->menu));
if (node && tree_node_has_children(node)) {
tree_node_load_children(node);
print_path(regedit, node->child_head);
tree_view_update(regedit->keys, node->child_head);
value_list_load(regedit->vl, node->child_head->key);
}
break;
case KEY_LEFT:
node = item_userptr(current_item(regedit->keys->menu));
if (node && node->parent) {
print_path(regedit, node->parent);
node = tree_node_first(node->parent);
tree_view_update(regedit->keys, node);
value_list_load(regedit->vl, node->key);
}
break;
case 'n':
case 'N':
node = item_userptr(current_item(regedit->keys->menu));
add_reg_key(regedit, node, false);
break;
case 's':
case 'S':
node = item_userptr(current_item(regedit->keys->menu));
add_reg_key(regedit, node, true);
break;
case 'd':
case 'D': {
int sel;
node = item_userptr(current_item(regedit->keys->menu));
if (!node->parent) {
break;
}
sel = dialog_notice(regedit, DIA_CONFIRM,
"Delete Key",
"Really delete key \"%s\"?",
node->name);
if (sel == DIALOG_OK) {
WERROR rv;
struct tree_node *pop;
struct tree_node *parent = node->parent;
rv = reg_key_del(node, parent->key, node->name);
if (W_ERROR_IS_OK(rv)) {
tree_view_clear(regedit->keys);
pop = tree_node_pop(&node);
tree_node_free_recursive(pop);
node = parent->child_head;
if (node == NULL) {
node = tree_node_first(parent);
print_path(regedit, node);
}
tree_view_update(regedit->keys, node);
value_list_load(regedit->vl, node->key);
} else {
dialog_notice(regedit, DIA_ALERT, "Delete Key",
"Failed to delete key.");
}
}
break;
}
}
tree_view_show(regedit->keys);
value_list_show(regedit->vl);
}
static void handle_tree_input(struct regedit *regedit, int c)
{
struct tree_node *node;
switch (c) {
case KEY_DOWN:
tree_view_driver(regedit->keys, ML_CURSOR_DOWN);
load_values(regedit);
break;
case KEY_UP:
tree_view_driver(regedit->keys, ML_CURSOR_UP);
load_values(regedit);
break;
case KEY_NPAGE:
tree_view_driver(regedit->keys, ML_CURSOR_PGDN);
load_values(regedit);
break;
case KEY_PPAGE:
tree_view_driver(regedit->keys, ML_CURSOR_PGUP);
load_values(regedit);
break;
case KEY_HOME:
tree_view_driver(regedit->keys, ML_CURSOR_HOME);
load_values(regedit);
break;
case KEY_END:
tree_view_driver(regedit->keys, ML_CURSOR_END);
load_values(regedit);
break;
case '\n':
case KEY_ENTER:
case KEY_RIGHT:
node = tree_view_get_current_node(regedit->keys);
if (node && tree_node_has_children(node)) {
WERROR rv;
rv = tree_node_load_children(node);
if (W_ERROR_IS_OK(rv)) {
print_path(regedit, node->child_head);
tree_view_update(regedit->keys, node->child_head);
value_list_load(regedit->vl, node->child_head->key);
} else {
const char *msg = get_friendly_werror_msg(rv);
dialog_notice(regedit, DIA_ALERT, "Loading Subkeys",
"Failed to load subkeys: %s", msg);
}
}
break;
case KEY_LEFT:
node = tree_view_get_current_node(regedit->keys);
if (node && !tree_node_is_top_level(node)) {
print_path(regedit, node->parent);
node = node->parent;
tree_view_update(regedit->keys, tree_node_first(node));
tree_view_set_current_node(regedit->keys, node);
value_list_load(regedit->vl, node->key);
}
break;
case 'n':
case 'N':
node = tree_view_get_current_node(regedit->keys);
add_reg_key(regedit, node, false);
break;
case 's':
case 'S':
node = tree_view_get_current_node(regedit->keys);
add_reg_key(regedit, node, true);
break;
case 'd':
case 'D': {
int sel;
node = tree_view_get_current_node(regedit->keys);
if (tree_node_is_top_level(node)) {
break;
}
sel = dialog_notice(regedit, DIA_CONFIRM,
"Delete Key",
"Really delete key \"%s\"?",
node->name);
if (sel == DIALOG_OK) {
WERROR rv;
struct tree_node *pop;
struct tree_node *parent = node->parent;
rv = reg_key_del(node, parent->key, node->name);
if (W_ERROR_IS_OK(rv)) {
tree_node_reopen_key(regedit->registry_context,
parent);
tree_view_clear(regedit->keys);
pop = tree_node_pop(&node);
talloc_free(pop);
node = parent->child_head;
if (node == NULL) {
node = tree_node_first(parent);
print_path(regedit, node);
}
tree_view_update(regedit->keys, node);
value_list_load(regedit->vl, node->key);
} else {
const char *msg = get_friendly_werror_msg(rv);
dialog_notice(regedit, DIA_ALERT, "Delete Key",
"Failed to delete key: %s", msg);
}
}
break;
}
}
tree_view_show(regedit->keys);
value_list_show(regedit->vl);
}
