static void add_reg_key(struct regedit *regedit, struct tree_node *node,
bool subkey)
{
char *name;
const char *msg;
if (!subkey && !node->parent) {
return;
}
msg = "Enter name of new key";
if (subkey) {
msg = "Enter name of new subkey";
}
dialog_input(regedit, &name, "New Key", msg);
if (name) {
WERROR rv;
struct registry_key *new_key;
struct tree_node *new_node;
struct tree_node *list;
struct tree_node *parent;
if (subkey) {
parent = node;
list = node->child_head;
} else {
parent = node->parent;
list = tree_node_first(node);
SMB_ASSERT(list != NULL);
}
rv = reg_key_add_name(regedit, parent->key, name,
NULL, NULL, &new_key);
if (W_ERROR_IS_OK(rv)) {
/* The list of subkeys may not be present in
cache yet, so if not, don't bother allocating
a new node for the key. */
if (list) {
new_node = tree_node_new(parent, parent,
name, new_key);
SMB_ASSERT(new_node);
tree_node_append_last(list, new_node);
}
list = tree_node_first(node);
tree_view_clear(regedit->keys);
tree_view_update(regedit->keys, list);
} else {
dialog_notice(regedit, DIA_ALERT, "New Key",
"Failed to create key.");
}
talloc_free(name);
}
}
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_main_input(struct regedit *regedit, int c)
{
switch (c) {
case 18: { /* CTRL-R */
struct tree_node *root, *node;
const char **path;
node = tree_view_get_current_node(regedit->keys);
path = tree_node_get_path(regedit, node);
SMB_ASSERT(path != NULL);
root = tree_node_new_root(regedit, regedit->registry_context);
SMB_ASSERT(root != NULL);
tree_view_set_root(regedit->keys, root);
tree_view_set_path(regedit->keys, path);
node = tree_view_get_current_node(regedit->keys);
value_list_load(regedit->vl, node->key);
tree_view_show(regedit->keys);
value_list_show(regedit->vl);
print_path(regedit, node);
talloc_free(discard_const(path));
break;
}
case 'f':
case 'F':
case '/': {
int rv;
struct regedit_search_opts *opts;
struct tree_node *node;
opts = ®edit->active_search;
rv = dialog_search_input(regedit, opts);
if (rv == DIALOG_OK) {
SMB_ASSERT(opts->query != NULL);
opts->match = find_substring_nocase;
node = regedit->keys->root->child_head;
if (opts->search_case) {
opts->match = find_substring;
}
if (!opts->search_recursive) {
node = tree_view_get_current_node(regedit->keys);
node = tree_node_first(node);
}
regedit_search(regedit, node, NULL, SEARCH_NEXT);
}
break;
}
case 'x':
regedit_search_repeat(regedit, SEARCH_NEXT);
break;
case 'X':
regedit_search_repeat(regedit, SEARCH_PREV);
break;
case '\t':
regedit->tree_input = !regedit->tree_input;
print_heading(regedit);
break;
default:
if (regedit->tree_input) {
handle_tree_input(regedit, c);
} else {
handle_value_input(regedit, c);
}
}
}
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);
}
static WERROR regedit_search(struct regedit *regedit, struct tree_node *node,
struct value_item *vitem, unsigned flags)
{
struct regedit_search_opts *opts;
struct tree_node *found;
struct value_item *found_value;
bool search_key, need_sync;
char *save_value_name;
WERROR rv;
bool (*iterate)(struct tree_node **, bool, WERROR *);
struct value_item *(*find_item)(struct value_list *,
struct value_item *,
const char *,
regedit_search_match_fn_t);
opts = ®edit->active_search;
if (!opts->query || !opts->match) {
return WERR_OK;
}
SMB_ASSERT(opts->search_key || opts->search_value);
rv = WERR_OK;
found = NULL;
found_value = NULL;
save_value_name = NULL;
search_key = opts->search_key;
need_sync = false;
iterate = tree_node_next;
find_item = value_list_find_next_item;
if (flags & SEARCH_PREV) {
iterate = tree_node_prev;
find_item = value_list_find_prev_item;
}
if (opts->search_value) {
struct value_item *it;
it = value_list_get_current_item(regedit->vl);
if (it) {
save_value_name = talloc_strdup(regedit,
it->value_name);
if (save_value_name == NULL) {
return WERR_NOMEM;
}
}
if (vitem) {
search_key = false;
}
}
if (!vitem && (flags & SEARCH_REPEAT)) {
if (opts->search_value) {
search_key = false;
} else if (!iterate(&node, opts->search_recursive, &rv)) {
beep();
return rv;
}
}
do {
if (search_key) {
SMB_ASSERT(opts->search_key == true);
if (opts->match(node->name, opts->query)) {
found = node;
} else if (opts->search_value) {
search_key = false;
}
}
if (!search_key) {
SMB_ASSERT(opts->search_value == true);
if (!vitem) {
rv = value_list_load_quick(regedit->vl,
node->key);
if (!W_ERROR_IS_OK(rv)) {
goto out;
}
need_sync = true;
}
found_value = find_item(regedit->vl, vitem, opts->query,
opts->match);
if (found_value) {
found = node;
} else {
vitem = NULL;
search_key = opts->search_key;
}
}
} while (!found && iterate(&node, opts->search_recursive, &rv));
if (!W_ERROR_IS_OK(rv)) {
goto out;
}
if (found) {
/* Put the cursor on the node that was found */
if (!tree_view_is_node_visible(regedit->keys, found)) {
tree_view_update(regedit->keys,
tree_node_first(found));
print_path(regedit, found);
}
tree_view_set_current_node(regedit->keys, found);
if (found_value) {
if (need_sync) {
value_list_sync(regedit->vl);
}
value_list_set_current_item(regedit->vl, found_value);
regedit->tree_input = false;
} else {
load_values(regedit);
regedit->tree_input = true;
}
tree_view_show(regedit->keys);
value_list_show(regedit->vl);
print_heading(regedit);
} else {
if (need_sync) {
load_values(regedit);
value_list_set_current_item_by_name(regedit->vl,
save_value_name);
}
beep();
}
out:
talloc_free(save_value_name);
return rv;
}
static void add_reg_key(struct regedit *regedit, struct tree_node *node,
bool subkey)
{
const char *name;
const char *msg;
if (!subkey && tree_node_is_top_level(node)) {
return;
}
msg = "Enter name of new key";
if (subkey) {
msg = "Enter name of new subkey";
}
dialog_input(regedit, &name, "New Key", msg);
if (name) {
WERROR rv;
struct registry_key *new_key;
struct tree_node *new_node;
struct tree_node *list;
struct tree_node *parent;
if (subkey) {
parent = node;
list = node->child_head;
} else {
parent = node->parent;
list = tree_node_first(node);
SMB_ASSERT(list != NULL);
}
rv = reg_key_add_name(regedit, parent->key, name,
NULL, NULL, &new_key);
if (W_ERROR_IS_OK(rv)) {
/* The list of subkeys may not be present in
cache yet, so if not, don't bother allocating
a new node for the key. */
if (list) {
new_node = tree_node_new(parent, parent,
name, new_key);
SMB_ASSERT(new_node);
tree_node_insert_sorted(list, new_node);
} else {
/* Reopen the parent key to make sure the
new subkey will be noticed. */
tree_node_reopen_key(regedit->registry_context,
parent);
}
list = tree_node_first(node);
tree_view_clear(regedit->keys);
tree_view_update(regedit->keys, list);
if (!subkey) {
node = new_node;
}
tree_view_set_current_node(regedit->keys, node);
load_values(regedit);
} else {
msg = get_friendly_werror_msg(rv);
dialog_notice(regedit, DIA_ALERT, "New Key",
"Failed to create key: %s", msg);
}
talloc_free(discard_const(name));
}
}