/* * Samba Unix/Linux SMB client library * Registry Editor * Copyright (C) Christopher Davis 2012 * * 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 3 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, see . */ #include "includes.h" #include "popt_common.h" #include "lib/util/data_blob.h" #include "lib/registry/registry.h" #include "regedit.h" #include "regedit_treeview.h" #include "regedit_valuelist.h" #include "regedit_dialog.h" #include #include #include #define KEY_START_X 0 #define KEY_START_Y 3 #define KEY_WIDTH (COLS / 4) #define KEY_HEIGHT (LINES - KEY_START_Y - 2) #define VAL_START_X KEY_WIDTH #define VAL_START_Y 3 #define VAL_WIDTH (COLS - KEY_WIDTH) #define VAL_HEIGHT (LINES - VAL_START_Y - 2) #define HEADING_START_Y (KEY_START_Y - 1) #define HELP1_START_Y (LINES - 2) #define HELP1_START_X 0 #define HELP1_WIDTH (LINES) #define HELP2_START_Y (LINES - 1) #define HELP2_START_X 0 #define HELP2_WIDTH (LINES) #define PATH_START_Y 0 #define PATH_START_X 6 #define PATH_MAX_Y (COLS - 1) #define PATH_WIDTH (COLS - 6) #define PATH_WIDTH_MAX 1024 struct regedit { WINDOW *main_window; WINDOW *path_label; size_t path_len; struct value_list *vl; struct tree_view *keys; bool tree_input; }; static struct regedit *regedit_main = NULL; static void show_path(struct regedit *regedit) { int start_pad = 0; int start_win = PATH_START_X; if (PATH_START_X + regedit->path_len > COLS) { start_pad = 3 + PATH_START_X + regedit->path_len - COLS; mvprintw(PATH_START_Y, start_win, "..."); start_win += 3; } copywin(regedit->path_label, regedit->main_window, 0, start_pad, PATH_START_Y, start_win, PATH_START_Y, PATH_MAX_Y, false); } static void print_path(struct regedit *regedit, struct tree_node *node) { regedit->path_len = tree_node_print_path(regedit->path_label, node); show_path(regedit); } /* load all available hives */ static struct tree_node *load_hives(TALLOC_CTX *mem_ctx, struct registry_context *ctx) { const char *hives[] = { "HKEY_CLASSES_ROOT", "HKEY_CURRENT_USER", "HKEY_LOCAL_MACHINE", "HKEY_PERFORMANCE_DATA", "HKEY_USERS", "HKEY_CURRENT_CONFIG", "HKEY_DYN_DATA", "HKEY_PERFORMANCE_TEXT", "HKEY_PERFORMANCE_NLSTEXT", NULL }; struct tree_node *root, *prev, *node; struct registry_key *key; WERROR rv; size_t i; root = NULL; prev = NULL; for (i = 0; hives[i] != NULL; ++i) { rv = reg_get_predefined_key_by_name(ctx, hives[i], &key); if (!W_ERROR_IS_OK(rv)) { continue; } node = tree_node_new(mem_ctx, NULL, hives[i], key); if (node == NULL) { return NULL; } if (root == NULL) { root = node; } if (prev) { tree_node_append(prev, node); } prev = node; } return root; } static void print_help(struct regedit *regedit) { const char *khelp = "[n] New Key [s] New Subkey [d] Del Key " "[LEFT] Ascend [RIGHT] Descend"; const char *vhelp = "[n] New Value [d] Del Value [ENTER] Edit " "[b] Edit binary"; const char *msg = "KEYS"; const char *help = khelp; const char *genhelp = "[TAB] Switch sections [q] Quit regedit " "[UP] List up [DOWN] List down"; int i, pad; if (!regedit->tree_input) { msg = "VALUES"; help = vhelp; } move(HELP1_START_Y, HELP1_START_X); clrtoeol(); attron(A_REVERSE); mvaddstr(HELP1_START_Y, HELP1_START_X, help); pad = COLS - strlen(msg) - strlen(help); for (i = 0; i < pad; ++i) { addch(' '); } attron(A_BOLD); addstr(msg); attroff(A_REVERSE | A_BOLD); move(HELP2_START_Y, HELP2_START_X); clrtoeol(); mvaddstr(HELP2_START_Y, HELP2_START_X, genhelp); } static void print_heading(struct regedit *regedit) { move(HEADING_START_Y, 0); clrtoeol(); if (regedit->tree_input) { attron(A_REVERSE); } else { attroff(A_REVERSE); } mvprintw(HEADING_START_Y, KEY_START_X, "Key"); attroff(A_REVERSE); if (!regedit->tree_input) { attron(A_REVERSE); } else { attroff(A_REVERSE); } mvprintw(HEADING_START_Y, VAL_START_X, "Value"); attroff(A_REVERSE); print_help(regedit); } static void load_values(struct regedit *regedit) { struct tree_node *node; node = item_userptr(current_item(regedit->keys->menu)); value_list_load(regedit->vl, node->key); } 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_value_input(struct regedit *regedit, int c) { struct value_item *vitem; bool binmode = false; switch (c) { case KEY_DOWN: menu_driver(regedit->vl->menu, REQ_DOWN_ITEM); break; case KEY_UP: menu_driver(regedit->vl->menu, REQ_UP_ITEM); break; case 'b': case 'B': binmode = true; /* Falthrough... */ case '\n': case KEY_ENTER: vitem = item_userptr(current_item(regedit->vl->menu)); if (vitem) { struct tree_node *node; node = item_userptr(current_item(regedit->keys->menu)); dialog_edit_value(regedit, node->key, vitem->type, vitem, binmode); value_list_load(regedit->vl, node->key); } break; case 'n': case 'N': { int new_type; int sel; sel = dialog_select_type(regedit, &new_type); if (sel == DIALOG_OK) { struct tree_node *node; node = item_userptr(current_item(regedit->keys->menu)); dialog_edit_value(regedit, node->key, new_type, NULL, false); value_list_load(regedit->vl, node->key); } break; } case 'd': case 'D': vitem = item_userptr(current_item(regedit->vl->menu)); if (vitem) { int sel; sel = dialog_notice(regedit, DIA_CONFIRM, "Delete Value", "Really delete value \"%s\"?", vitem->value_name); if (sel == DIALOG_OK) { ITEM *it = current_item(regedit->keys->menu); struct tree_node *node = item_userptr(it); reg_del_value(regedit, node->key, vitem->value_name); value_list_load(regedit->vl, node->key); } } break; } value_list_show(regedit->vl); } static void handle_main_input(struct regedit *regedit, int c) { switch (c) { 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); } } } int regedit_getch(void) { int c; SMB_ASSERT(regedit_main); c = getch(); if (c == KEY_RESIZE) { tree_view_resize(regedit_main->keys, KEY_HEIGHT, KEY_WIDTH, KEY_START_Y, KEY_START_X); value_list_resize(regedit_main->vl, VAL_HEIGHT, VAL_WIDTH, VAL_START_Y, VAL_START_X); print_heading(regedit_main); show_path(regedit_main); } return c; } static void display_window(TALLOC_CTX *mem_ctx, struct registry_context *ctx) { struct regedit *regedit; struct tree_node *root; bool colors; int key; initscr(); cbreak(); noecho(); colors = has_colors(); if (colors) { start_color(); use_default_colors(); } regedit = talloc_zero(mem_ctx, struct regedit); SMB_ASSERT(regedit != NULL); regedit_main = regedit; regedit->main_window = stdscr; keypad(regedit->main_window, TRUE); mvwprintw(regedit->main_window, 0, 0, "Path: "); regedit->path_label = newpad(1, PATH_WIDTH_MAX); SMB_ASSERT(regedit->path_label); wprintw(regedit->path_label, "/"); show_path(regedit_main); root = load_hives(regedit, ctx); SMB_ASSERT(root != NULL); regedit->keys = tree_view_new(regedit, root, KEY_HEIGHT, KEY_WIDTH, KEY_START_Y, KEY_START_X); SMB_ASSERT(regedit->keys != NULL); regedit->vl = value_list_new(regedit, VAL_HEIGHT, VAL_WIDTH, VAL_START_Y, VAL_START_X); SMB_ASSERT(regedit->vl != NULL); regedit->tree_input = true; print_heading(regedit); tree_view_show(regedit->keys); menu_driver(regedit->keys->menu, REQ_FIRST_ITEM); load_values(regedit); value_list_show(regedit->vl); update_panels(); doupdate(); do { key = regedit_getch(); handle_main_input(regedit, key); update_panels(); doupdate(); } while (key != 'q' || key == 'Q'); endwin(); } int main(int argc, char **argv) { struct poptOption long_options[] = { POPT_AUTOHELP /* ... */ POPT_COMMON_SAMBA POPT_COMMON_CONNECTION POPT_COMMON_CREDENTIALS POPT_TABLEEND }; int opt; poptContext pc; struct user_auth_info *auth_info; TALLOC_CTX *frame; struct registry_context *ctx; WERROR rv; frame = talloc_stackframe(); setup_logging("regedit", DEBUG_DEFAULT_STDERR); lp_set_cmdline("log level", "0"); /* process options */ auth_info = user_auth_info_init(frame); if (auth_info == NULL) { exit(1); } popt_common_set_auth_info(auth_info); pc = poptGetContext("regedit", argc, (const char **)argv, long_options, 0); while ((opt = poptGetNextOpt(pc)) != -1) { /* TODO */ } if (!lp_load_global(get_dyn_CONFIGFILE())) { DEBUG(0, ("ERROR loading config file...\n")); exit(1); } /* some simple tests */ rv = reg_open_samba3(frame, &ctx); if (!W_ERROR_IS_OK(rv)) { TALLOC_FREE(frame); return 1; } display_window(frame, ctx); TALLOC_FREE(frame); return 0; }