source3/utils/regedit.c

   1 /*
   2  * Samba Unix/Linux SMB client library
   3  * Registry Editor
   4  * Copyright (C) Christopher Davis 2012
   5  *
   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.
  10  *
  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.
  15  *
  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/>.
  18  */
  19
  20 #include "includes.h"
  21 #include "popt_common.h"
  22 #include "lib/util/data_blob.h"
  23 #include "lib/registry/registry.h"
  24 #include "regedit.h"
  25 #include "regedit_treeview.h"
  26 #include "regedit_valuelist.h"
  27 #include "regedit_dialog.h"
  28 #include "regedit_list.h"
  29 #include <ncurses.h>
  30 #include <menu.h>
  31 #include <panel.h>
  32
  33 #define KEY_START_X     0
  34 #define KEY_START_Y     1
  35 #define KEY_WIDTH       (COLS / 4)
  36 #define KEY_HEIGHT      (LINES - KEY_START_Y - 2)
  37 #define VAL_START_X     KEY_WIDTH
  38 #define VAL_START_Y     1
  39 #define VAL_WIDTH       (COLS - KEY_WIDTH)
  40 #define VAL_HEIGHT      (LINES - VAL_START_Y - 2)
  41
  42 #define HELP1_START_Y   (LINES - 2)
  43 #define HELP1_START_X   0
  44 #define HELP1_WIDTH     (LINES)
  45 #define HELP2_START_Y   (LINES - 1)
  46 #define HELP2_START_X   0
  47 #define HELP2_WIDTH     (LINES)
  48 #define PATH_START_Y    0
  49 #define PATH_START_X    6
  50 #define PATH_MAX_Y      (COLS - 1)
  51 #define PATH_WIDTH      (COLS - 6)
  52 #define PATH_WIDTH_MAX  1024
  53
  54 struct regedit {
  55         struct registry_context *registry_context;
  56         WINDOW *main_window;
  57         WINDOW *path_label;
  58         size_t path_len;
  59         struct value_list *vl;
  60         struct tree_view *keys;
  61         bool tree_input;
  62         struct regedit_search_opts active_search;
  63 };
  64
  65 static struct regedit *regedit_main = NULL;
  66
  67 static void show_path(struct regedit *regedit)
  68 {
  69         int start_pad = 0;
  70         int start_win = PATH_START_X;
  71
  72         if (PATH_START_X + regedit->path_len > COLS) {
  73                 start_pad = 3 + PATH_START_X + regedit->path_len - COLS;
  74                 mvprintw(PATH_START_Y, start_win, "...");
  75                 start_win += 3;
  76         }
  77         copywin(regedit->path_label, regedit->main_window, 0, start_pad,
  78                 PATH_START_Y, start_win, PATH_START_Y, PATH_MAX_Y, false);
  79
  80         mvchgat(0, 0, COLS, A_BOLD, PAIR_YELLOW_CYAN, NULL);
  81 }
  82
  83 static void print_path(struct regedit *regedit, struct tree_node *node)
  84 {
  85         regedit->path_len = tree_node_print_path(regedit->path_label, node);
  86         show_path(regedit);
  87 }
  88
  89 static void print_help(struct regedit *regedit)
  90 {
  91         const char *khelp = "[n] New Key [s] New Subkey [d] Del Key "
  92                             "[LEFT] Ascend [RIGHT] Descend";
  93         const char *vhelp = "[n] New Value [d] Del Value [ENTER] Edit "
  94                             "[b] Edit binary";
  95         const char *msg = "KEYS";
  96         const char *help = khelp;
  97         const char *genhelp = "[TAB] Switch sections [q] Quit "
  98                               "[UP] List up [DOWN] List down "
  99                               "[/] Search [x] Next";
 100         int i, pad;
 101
 102         if (!regedit->tree_input) {
 103                 msg = "VALUES";
 104                 help = vhelp;
 105         }
 106
 107         move(HELP1_START_Y, HELP1_START_X);
 108         clrtoeol();
 109         attron(COLOR_PAIR(PAIR_BLACK_CYAN));
 110         mvaddstr(HELP1_START_Y, HELP1_START_X, help);
 111         pad = COLS - strlen(msg) - strlen(help);
 112         for (i = 0; i < pad; ++i) {
 113                 addch(' ');
 114         }
 115         attroff(COLOR_PAIR(PAIR_BLACK_CYAN));
 116         attron(COLOR_PAIR(PAIR_YELLOW_CYAN) | A_BOLD);
 117         addstr(msg);
 118         attroff(COLOR_PAIR(PAIR_YELLOW_CYAN) | A_BOLD);
 119
 120         move(HELP2_START_Y, HELP2_START_X);
 121         clrtoeol();
 122         mvaddstr(HELP2_START_Y, HELP2_START_X, genhelp);
 123 }
 124
 125 static void print_heading(struct regedit *regedit)
 126 {
 127         if (regedit->tree_input) {
 128                 tree_view_set_selected(regedit->keys, true);
 129                 value_list_set_selected(regedit->vl, false);
 130         } else {
 131                 tree_view_set_selected(regedit->keys, false);
 132                 value_list_set_selected(regedit->vl, true);
 133         }
 134
 135         print_help(regedit);
 136 }
 137
 138 static void load_values(struct regedit *regedit)
 139 {
 140         struct tree_node *node;
 141
 142         node = tree_view_get_current_node(regedit->keys);
 143         value_list_load(regedit->vl, node->key);
 144 }
 145
 146 static void add_reg_key(struct regedit *regedit, struct tree_node *node,
 147                         bool subkey)
 148 {
 149         const char *name;
 150         const char *msg;
 151
 152         if (!subkey && tree_node_is_top_level(node)) {
 153                 return;
 154         }
 155
 156         msg = "Enter name of new key";
 157         if (subkey) {
 158                 msg = "Enter name of new subkey";
 159         }
 160         dialog_input(regedit, &name, "New Key", msg);
 161         if (name) {
 162                 WERROR rv;
 163                 struct registry_key *new_key;
 164                 struct tree_node *new_node;
 165                 struct tree_node *list;
 166                 struct tree_node *parent;
 167
 168                 if (subkey) {
 169                         parent = node;
 170                         list = node->child_head;
 171                 } else {
 172                         parent = node->parent;
 173                         list = tree_node_first(node);
 174                         SMB_ASSERT(list != NULL);
 175                 }
 176                 rv = reg_key_add_name(regedit, parent->key, name,
 177                                       NULL, NULL, &new_key);
 178                 if (W_ERROR_IS_OK(rv)) {
 179                         /* The list of subkeys may not be present in
 180                            cache yet, so if not, don't bother allocating
 181                            a new node for the key. */
 182                         if (list) {
 183                                 new_node = tree_node_new(parent, parent,
 184                                                          name, new_key);
 185                                 SMB_ASSERT(new_node);
 186                                 tree_node_insert_sorted(list, new_node);
 187                         } else {
 188                                 /* Reopen the parent key to make sure the
 189                                    new subkey will be noticed. */
 190                                 tree_node_reopen_key(parent);
 191                         }
 192
 193                         list = tree_node_first(node);
 194                         tree_view_clear(regedit->keys);
 195                         tree_view_update(regedit->keys, list);
 196                         if (!subkey) {
 197                                 node = new_node;
 198                         }
 199                         tree_view_set_current_node(regedit->keys, node);
 200                 } else {
 201                         msg = get_friendly_werror_msg(rv);
 202                         dialog_notice(regedit, DIA_ALERT, "New Key",
 203                                       "Failed to create key: %s", msg);
 204                 }
 205                 talloc_free(discard_const(name));
 206         }
 207 }
 208
 209 static WERROR next_depth_first(struct tree_node **node)
 210 {
 211         WERROR rv = WERR_OK;
 212
 213         SMB_ASSERT(node != NULL && *node != NULL);
 214
 215         if (tree_node_has_children(*node)) {
 216                 /* 1. If the node has children, go to the first one. */
 217                 rv = tree_node_load_children(*node);
 218                 if (W_ERROR_IS_OK(rv)) {
 219                         SMB_ASSERT((*node)->child_head != NULL);
 220                         *node = (*node)->child_head;
 221                 }
 222         } else if ((*node)->next) {
 223                 /* 2. If there's a node directly after this one, go there */
 224                 *node = (*node)->next;
 225         } else {
 226                 /* 3. Otherwise, go up the hierarchy to find the next one */
 227                 do {
 228                         *node = (*node)->parent;
 229                         if (*node && (*node)->next) {
 230                                 *node = (*node)->next;
 231                                 break;
 232                         }
 233                 } while (*node);
 234         }
 235
 236         return rv;
 237 }
 238
 239 static WERROR regedit_search_next(struct regedit *regedit)
 240 {
 241         WERROR rv;
 242         struct regedit_search_opts *opts = &regedit->active_search;
 243
 244         if (opts->search_recursive) {
 245                 rv = next_depth_first(&opts->node);
 246                 if (!W_ERROR_IS_OK(rv)) {
 247                         return rv;
 248                 }
 249         } else {
 250                 opts->node = opts->node->next;
 251         }
 252
 253         return WERR_OK;
 254 }
 255
 256 static WERROR regedit_search(struct regedit *regedit)
 257 {
 258         struct regedit_search_opts *opts;
 259         struct tree_node *found;
 260         WERROR rv;
 261
 262         opts = &regedit->active_search;
 263
 264         if (!opts->query || !opts->match) {
 265                 return WERR_OK;
 266         }
 267
 268         SMB_ASSERT(opts->search_key || opts->search_value);
 269
 270         for (found = NULL; opts->node && !found; ) {
 271                 if (opts->search_key &&
 272                     opts->match(opts->node->name, opts->query)) {
 273                         found = opts->node;
 274                 }
 275                 if (opts->search_value) {
 276                         /* TODO
 277                         rv = regedit_search_value(regedit);
 278                         if (W_ERROR_IS_OK(rv)) {
 279                                 found = opts->node;
 280                         } else if (!W_ERROR_EQUAL(rv, WERR_NO_MORE_ITEMS)) {
 281                                 return rv;
 282                         }
 283                         */
 284                 }
 285                 rv = regedit_search_next(regedit);
 286                 if (!W_ERROR_IS_OK(rv)) {
 287                         return rv;
 288                 }
 289         }
 290
 291         if (found) {
 292                 /* Put the cursor on the node that was found */
 293                 if (!tree_view_is_node_visible(regedit->keys, found)) {
 294                         tree_view_update(regedit->keys,
 295                                          tree_node_first(found));
 296                         print_path(regedit, found);
 297                 }
 298                 tree_view_set_current_node(regedit->keys, found);
 299                 load_values(regedit);
 300                 tree_view_show(regedit->keys);
 301                 value_list_show(regedit->vl);
 302         } else {
 303                 beep();
 304         }
 305
 306         return WERR_OK;
 307 }
 308
 309 static void handle_tree_input(struct regedit *regedit, int c)
 310 {
 311         struct tree_node *node;
 312
 313         switch (c) {
 314         case KEY_DOWN:
 315                 tree_view_driver(regedit->keys, ML_CURSOR_DOWN);
 316                 load_values(regedit);
 317                 break;
 318         case KEY_UP:
 319                 tree_view_driver(regedit->keys, ML_CURSOR_UP);
 320                 load_values(regedit);
 321                 break;
 322         case '\n':
 323         case KEY_ENTER:
 324         case KEY_RIGHT:
 325                 node = tree_view_get_current_node(regedit->keys);
 326                 if (node && tree_node_has_children(node)) {
 327                         WERROR rv;
 328
 329                         rv = tree_node_load_children(node);
 330                         if (W_ERROR_IS_OK(rv)) {
 331                                 print_path(regedit, node->child_head);
 332                                 tree_view_update(regedit->keys, node->child_head);
 333                                 value_list_load(regedit->vl, node->child_head->key);
 334                         } else {
 335                                 const char *msg = get_friendly_werror_msg(rv);
 336                                 dialog_notice(regedit, DIA_ALERT, "Loading Subkeys",
 337                                               "Failed to load subkeys: %s", msg);
 338                         }
 339                 }
 340                 break;
 341         case KEY_LEFT:
 342                 node = tree_view_get_current_node(regedit->keys);
 343                 if (node && !tree_node_is_top_level(node)) {
 344                         print_path(regedit, node->parent);
 345                         node = node->parent;
 346                         tree_view_update(regedit->keys, tree_node_first(node));
 347                         tree_view_set_current_node(regedit->keys, node);
 348                         value_list_load(regedit->vl, node->key);
 349                 }
 350                 break;
 351         case 'n':
 352         case 'N':
 353                 node = tree_view_get_current_node(regedit->keys);
 354                 add_reg_key(regedit, node, false);
 355                 break;
 356         case 's':
 357         case 'S':
 358                 node = tree_view_get_current_node(regedit->keys);
 359                 add_reg_key(regedit, node, true);
 360                 break;
 361         case 'd':
 362         case 'D': {
 363                 int sel;
 364
 365                 node = tree_view_get_current_node(regedit->keys);
 366                 if (tree_node_is_top_level(node)) {
 367                         break;
 368                 }
 369                 sel = dialog_notice(regedit, DIA_CONFIRM,
 370                                     "Delete Key",
 371                                      "Really delete key \"%s\"?",
 372                                      node->name);
 373                 if (sel == DIALOG_OK) {
 374                         WERROR rv;
 375                         struct tree_node *pop;
 376                         struct tree_node *parent = node->parent;
 377
 378                         rv = reg_key_del(node, parent->key, node->name);
 379                         if (W_ERROR_IS_OK(rv)) {
 380                                 tree_node_reopen_key(parent);
 381                                 tree_view_clear(regedit->keys);
 382                                 pop = tree_node_pop(&node);
 383                                 talloc_free(pop);
 384                                 node = parent->child_head;
 385                                 if (node == NULL) {
 386                                         node = tree_node_first(parent);
 387                                         print_path(regedit, node);
 388                                 }
 389                                 tree_view_update(regedit->keys, node);
 390                                 value_list_load(regedit->vl, node->key);
 391                         } else {
 392                                 const char *msg = get_friendly_werror_msg(rv);
 393                                 dialog_notice(regedit, DIA_ALERT, "Delete Key",
 394                                               "Failed to delete key: %s", msg);
 395                         }
 396                 }
 397                 break;
 398         }
 399         }
 400
 401         tree_view_show(regedit->keys);
 402         value_list_show(regedit->vl);
 403 }
 404
 405 static void handle_value_input(struct regedit *regedit, int c)
 406 {
 407         struct value_item *vitem;
 408         bool binmode = false;
 409
 410         switch (c) {
 411         case KEY_DOWN:
 412                 value_list_driver(regedit->vl, ML_CURSOR_DOWN);
 413                 break;
 414         case KEY_UP:
 415                 value_list_driver(regedit->vl, ML_CURSOR_UP);
 416                 break;
 417         case 'b':
 418         case 'B':
 419                 binmode = true;
 420                 /* Falthrough... */
 421         case '\n':
 422         case KEY_ENTER:
 423                 vitem = value_list_get_current_item(regedit->vl);
 424                 if (vitem) {
 425                         struct tree_node *node;
 426                         node = tree_view_get_current_node(regedit->keys);
 427                         dialog_edit_value(regedit, node->key, vitem->type,
 428                                           vitem, binmode);
 429                         tree_node_reopen_key(node);
 430                         value_list_load(regedit->vl, node->key);
 431                 }
 432                 break;
 433         case 'n':
 434         case 'N': {
 435                 int new_type;
 436                 int sel;
 437
 438                 sel = dialog_select_type(regedit, &new_type);
 439                 if (sel == DIALOG_OK) {
 440                         struct tree_node *node;
 441                         node = tree_view_get_current_node(regedit->keys);
 442                         dialog_edit_value(regedit, node->key, new_type, NULL,
 443                                           false);
 444                         tree_node_reopen_key(node);
 445                         value_list_load(regedit->vl, node->key);
 446                 }
 447                 break;
 448         }
 449         case 'd':
 450         case 'D':
 451                 vitem = value_list_get_current_item(regedit->vl);
 452                 if (vitem) {
 453                         int sel;
 454
 455                         sel = dialog_notice(regedit, DIA_CONFIRM,
 456                                             "Delete Value",
 457                                              "Really delete value \"%s\"?",
 458                                              vitem->value_name);
 459                         if (sel == DIALOG_OK) {
 460                                 struct tree_node *node;
 461                                 node = tree_view_get_current_node(regedit->keys);
 462                                 reg_del_value(regedit, node->key,
 463                                               vitem->value_name);
 464                                 tree_node_reopen_key(node);
 465                                 value_list_load(regedit->vl, node->key);
 466                         }
 467                 }
 468                 break;
 469         }
 470
 471         value_list_show(regedit->vl);
 472 }
 473
 474 static bool find_substring(const char *haystack, const char *needle)
 475 {
 476         return strstr(haystack, needle) != NULL;
 477 }
 478
 479 static bool find_substring_nocase(const char *haystack, const char *needle)
 480 {
 481         return strcasestr(haystack, needle) != NULL;
 482 }
 483
 484 static void handle_main_input(struct regedit *regedit, int c)
 485 {
 486         switch (c) {
 487         case 18: { /* CTRL-R */
 488                 struct tree_node *root, *node;
 489                 const char **path;
 490
 491                 node = tree_view_get_current_node(regedit->keys);
 492                 path = tree_node_get_path(regedit, node);
 493                 SMB_ASSERT(path != NULL);
 494
 495                 root = tree_node_new_root(regedit, regedit->registry_context);
 496                 SMB_ASSERT(root != NULL);
 497
 498                 tree_view_set_root(regedit->keys, root);
 499                 tree_view_set_path(regedit->keys, path);
 500                 node = tree_view_get_current_node(regedit->keys);
 501                 value_list_load(regedit->vl, node->key);
 502                 tree_view_show(regedit->keys);
 503                 value_list_show(regedit->vl);
 504                 print_path(regedit, node);
 505                 talloc_free(discard_const(path));
 506                 break;
 507         }
 508         case 'f':
 509         case 'F':
 510         case '/': {
 511                 int rv;
 512                 struct regedit_search_opts *opts;
 513
 514                 opts = &regedit->active_search;
 515                 if (opts->query) {
 516                         talloc_free(discard_const(opts->query));
 517                 }
 518                 rv = dialog_search_input(regedit, opts);
 519                 if (rv == DIALOG_OK) {
 520                         SMB_ASSERT(opts->query != NULL);
 521                         opts->match = find_substring;
 522                         opts->node = regedit->keys->root;
 523                         if (opts->search_nocase) {
 524                                 opts->match = find_substring_nocase;
 525                         }
 526                         if (opts->search_relative) {
 527                                 opts->node =
 528                                      tree_view_get_current_node(regedit->keys);
 529                         }
 530                         regedit_search(regedit);
 531                 }
 532                 break;
 533         }
 534         case 'x':
 535         case 'X':
 536                 regedit_search(regedit);
 537                 break;
 538         case '\t':
 539                 regedit->tree_input = !regedit->tree_input;
 540                 print_heading(regedit);
 541                 break;
 542         default:
 543                 if (regedit->tree_input) {
 544                         handle_tree_input(regedit, c);
 545                 } else {
 546                         handle_value_input(regedit, c);
 547                 }
 548         }
 549 }
 550
 551 int regedit_getch(void)
 552 {
 553         int c;
 554
 555         SMB_ASSERT(regedit_main);
 556
 557         c = getch();
 558         if (c == KEY_RESIZE) {
 559                 tree_view_resize(regedit_main->keys, KEY_HEIGHT, KEY_WIDTH,
 560                                  KEY_START_Y, KEY_START_X);
 561                 value_list_resize(regedit_main->vl, VAL_HEIGHT, VAL_WIDTH,
 562                                   VAL_START_Y, VAL_START_X);
 563                 print_heading(regedit_main);
 564                 show_path(regedit_main);
 565         }
 566
 567         return c;
 568 }
 569
 570 static void display_window(TALLOC_CTX *mem_ctx, struct registry_context *ctx)
 571 {
 572         struct regedit *regedit;
 573         struct tree_node *root;
 574         bool colors;
 575         int key;
 576
 577         initscr();
 578
 579         cbreak();
 580         noecho();
 581
 582         colors = has_colors();
 583         if (colors) {
 584                 start_color();
 585                 use_default_colors();
 586                 assume_default_colors(COLOR_WHITE, COLOR_BLUE);
 587                 init_pair(PAIR_YELLOW_CYAN, COLOR_YELLOW, COLOR_CYAN);
 588                 init_pair(PAIR_BLACK_CYAN, COLOR_BLACK, COLOR_CYAN);
 589                 init_pair(PAIR_YELLOW_BLUE, COLOR_YELLOW, COLOR_BLUE);
 590         }
 591
 592         regedit = talloc_zero(mem_ctx, struct regedit);
 593         SMB_ASSERT(regedit != NULL);
 594         regedit_main = regedit;
 595
 596         regedit->registry_context = ctx;
 597         regedit->main_window = stdscr;
 598         keypad(regedit->main_window, TRUE);
 599
 600         mvwprintw(regedit->main_window, 0, 0, "Path: ");
 601         regedit->path_label = newpad(1, PATH_WIDTH_MAX);
 602         SMB_ASSERT(regedit->path_label);
 603         wprintw(regedit->path_label, "/");
 604         show_path(regedit_main);
 605
 606         root = tree_node_new_root(regedit, ctx);
 607         SMB_ASSERT(root != NULL);
 608
 609         regedit->keys = tree_view_new(regedit, root, KEY_HEIGHT, KEY_WIDTH,
 610                                       KEY_START_Y, KEY_START_X);
 611         SMB_ASSERT(regedit->keys != NULL);
 612
 613         regedit->vl = value_list_new(regedit, VAL_HEIGHT, VAL_WIDTH,
 614                                      VAL_START_Y, VAL_START_X);
 615         SMB_ASSERT(regedit->vl != NULL);
 616
 617         regedit->tree_input = true;
 618         print_heading(regedit);
 619
 620         tree_view_show(regedit->keys);
 621         load_values(regedit);
 622         value_list_show(regedit->vl);
 623
 624         update_panels();
 625         doupdate();
 626
 627         do {
 628                 key = regedit_getch();
 629
 630                 handle_main_input(regedit, key);
 631                 update_panels();
 632                 doupdate();
 633         } while (key != 'q' || key == 'Q');
 634
 635         endwin();
 636 }
 637
 638 int main(int argc, const char **argv)
 639 {
 640         struct poptOption long_options[] = {
 641                 POPT_AUTOHELP
 642                 /* ... */
 643                 POPT_COMMON_SAMBA
 644                 POPT_COMMON_CONNECTION
 645                 POPT_COMMON_CREDENTIALS
 646                 POPT_TABLEEND
 647         };
 648         int opt;
 649         poptContext pc;
 650         struct user_auth_info *auth_info;
 651         TALLOC_CTX *frame;
 652         struct registry_context *ctx;
 653         WERROR rv;
 654
 655         frame = talloc_stackframe();
 656
 657         setup_logging("regedit", DEBUG_DEFAULT_STDERR);
 658         lp_set_cmdline("log level", "0");
 659
 660         /* process options */
 661         auth_info = user_auth_info_init(frame);
 662         if (auth_info == NULL) {
 663                 exit(1);
 664         }
 665         popt_common_set_auth_info(auth_info);
 666         pc = poptGetContext("regedit", argc, argv, long_options, 0);
 667
 668         while ((opt = poptGetNextOpt(pc)) != -1) {
 669                 /* TODO */
 670         }
 671
 672         if (!lp_load_global(get_dyn_CONFIGFILE())) {
 673                 DEBUG(0, ("ERROR loading config file...\n"));
 674                 exit(1);
 675         }
 676
 677         /* some simple tests */
 678
 679         rv = reg_open_samba3(frame, &ctx);
 680         if (!W_ERROR_IS_OK(rv)) {
 681                 TALLOC_FREE(frame);
 682
 683                 return 1;
 684         }
 685
 686         display_window(frame, ctx);
 687
 688         TALLOC_FREE(frame);
 689
 690         return 0;
 691 }