source3/utils/regedit_treeview.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 "regedit_treeview.h"
  21 #include "lib/registry/registry.h"
  22
  23 struct tree_node *tree_node_new(TALLOC_CTX *ctx, struct tree_node *parent,
  24                                 const char *name, struct registry_key *key)
  25 {
  26         struct tree_node *node;
  27
  28         node = talloc_zero(ctx, struct tree_node);
  29         if (!node) {
  30                 return NULL;
  31         }
  32
  33         node->name = talloc_strdup(node, name);
  34         if (!node->name) {
  35                 talloc_free(node);
  36                 return NULL;
  37         }
  38
  39         node->key = talloc_steal(node, key);
  40
  41         if (parent) {
  42                 /* Check if this node is the first descendant of parent. */
  43                 if (!parent->child_head) {
  44                         parent->child_head = node;
  45                 }
  46                 node->parent = parent;
  47         }
  48
  49         return node;
  50 }
  51
  52 void tree_node_append(struct tree_node *left, struct tree_node *right)
  53 {
  54         if (left->next) {
  55                 right->next = left->next;
  56                 left->next->previous = right;
  57         }
  58         left->next = right;
  59         right->previous = left;
  60 }
  61
  62 void tree_node_append_last(struct tree_node *list, struct tree_node *node)
  63 {
  64         tree_node_append(tree_node_last(list), node);
  65 }
  66
  67 struct tree_node *tree_node_pop(struct tree_node **plist)
  68 {
  69         struct tree_node *node;
  70
  71         node = *plist;
  72
  73         if (node == NULL)
  74                 return NULL;
  75
  76         *plist = node->previous;
  77         if (*plist == NULL) {
  78                 *plist = node->next;
  79         }
  80         if (node->previous) {
  81                 node->previous->next = node->next;
  82         }
  83         if (node->next) {
  84                 node->next->previous = node->previous;
  85         }
  86         if (node->parent && node->parent->child_head == node) {
  87                 node->parent->child_head = node->next;
  88         }
  89         node->next = NULL;
  90         node->previous = NULL;
  91
  92         return node;
  93 }
  94
  95 struct tree_node *tree_node_first(struct tree_node *list)
  96 {
  97         /* Grab the first node in this list from the parent if available. */
  98         if (list->parent) {
  99                 return list->parent->child_head;
 100         }
 101
 102         while (list && list->previous) {
 103                 list = list->previous;
 104         }
 105
 106         return list;
 107 }
 108
 109 struct tree_node *tree_node_last(struct tree_node *list)
 110 {
 111         while (list && list->next) {
 112                 list = list->next;
 113         }
 114
 115         return list;
 116 }
 117
 118 bool tree_node_has_children(struct tree_node *node)
 119 {
 120         const char *classname;
 121         uint32_t num_subkeys;
 122         uint32_t num_values;
 123         NTTIME last_change_time;
 124         uint32_t max_subkeynamelen;
 125         uint32_t max_valnamelen;
 126         uint32_t max_valbufsize;
 127         WERROR rv;
 128
 129         if (node->child_head) {
 130                 return true;
 131         }
 132
 133         rv = reg_key_get_info(node, node->key, &classname, &num_subkeys,
 134                               &num_values, &last_change_time,
 135                               &max_subkeynamelen, &max_valnamelen,
 136                               &max_valbufsize);
 137
 138         if (W_ERROR_IS_OK(rv)) {
 139                 return num_subkeys != 0;
 140         }
 141
 142         return false;
 143 }
 144
 145 WERROR tree_node_load_children(struct tree_node *node)
 146 {
 147         struct registry_key *key;
 148         const char *key_name, *klass;
 149         NTTIME modified;
 150         uint32_t i;
 151         WERROR rv;
 152         struct tree_node *new_node, *prev;
 153
 154         /* does this node already have it's children loaded? */
 155         if (node->child_head)
 156                 return WERR_OK;
 157
 158         for (prev = NULL, i = 0; ; ++i) {
 159                 rv = reg_key_get_subkey_by_index(node, node->key, i,
 160                                                  &key_name, &klass,
 161                                                  &modified);
 162                 if (!W_ERROR_IS_OK(rv)) {
 163                         if (W_ERROR_EQUAL(rv, WERR_NO_MORE_ITEMS)) {
 164                                 break;
 165                         }
 166
 167                         return rv;
 168                 }
 169
 170                 rv = reg_open_key(node, node->key, key_name, &key);
 171                 if (!W_ERROR_IS_OK(rv)) {
 172                         return rv;
 173                 }
 174
 175                 new_node = tree_node_new(node, node, key_name, key);
 176                 if (new_node == NULL) {
 177                         return WERR_NOMEM;
 178                 }
 179
 180                 if (prev) {
 181                         tree_node_append(prev, new_node);
 182                 }
 183                 prev = new_node;
 184         }
 185
 186         return WERR_OK;
 187 }
 188
 189 void tree_node_free_recursive(struct tree_node *list)
 190 {
 191         struct tree_node *node;
 192
 193         if (list == NULL) {
 194                 return;
 195         }
 196
 197         while ((node = tree_node_pop(&list)) != NULL) {
 198                 if (node->child_head) {
 199                         tree_node_free_recursive(node->child_head);
 200                 }
 201                 node->child_head = NULL;
 202                 talloc_free(node);
 203         }
 204 }
 205
 206 static void tree_view_free_current_items(ITEM **items)
 207 {
 208         size_t i;
 209         struct tree_node *node;
 210         ITEM *item;
 211
 212         if (items == NULL) {
 213                 return;
 214         }
 215
 216         for (i = 0; items[i] != NULL; ++i) {
 217                 item = items[i];
 218                 node = item_userptr(item);
 219                 if (node && node->label) {
 220                         talloc_free(node->label);
 221                         node->label = NULL;
 222                 }
 223                 free_item(item);
 224         }
 225
 226         talloc_free(items);
 227 }
 228
 229 void tree_view_clear(struct tree_view *view)
 230 {
 231         unpost_menu(view->menu);
 232         set_menu_items(view->menu, view->empty);
 233         tree_view_free_current_items(view->current_items);
 234         view->current_items = NULL;
 235 }
 236
 237 WERROR tree_view_update(struct tree_view *view, struct tree_node *list)
 238 {
 239         ITEM **items;
 240         struct tree_node *node;
 241         size_t i, n_items;
 242
 243         if (list == NULL) {
 244                 list = view->root;
 245         }
 246         for (n_items = 0, node = list; node != NULL; node = node->next) {
 247                 n_items++;
 248         }
 249
 250         items = talloc_zero_array(view, ITEM *, n_items + 1);
 251         if (items == NULL) {
 252                 return WERR_NOMEM;
 253         }
 254
 255         for (i = 0, node = list; node != NULL; ++i, node = node->next) {
 256                 const char *label = node->name;
 257
 258                 /* Add a '+' marker to indicate that the item has
 259                    descendants. */
 260                 if (tree_node_has_children(node)) {
 261                         SMB_ASSERT(node->label == NULL);
 262                         node->label = talloc_asprintf(node, "+%s", node->name);
 263                         if (node->label == NULL) {
 264                                 goto fail;
 265                         }
 266                         label = node->label;
 267                 }
 268
 269                 items[i] = new_item(label, node->name);
 270                 set_item_userptr(items[i], node);
 271         }
 272
 273         unpost_menu(view->menu);
 274         set_menu_items(view->menu, items);
 275         tree_view_free_current_items(view->current_items);
 276         view->current_items = items;
 277
 278         return WERR_OK;
 279
 280 fail:
 281         tree_view_free_current_items(items);
 282
 283         return WERR_NOMEM;
 284 }
 285
 286 void tree_view_show(struct tree_view *view)
 287 {
 288         post_menu(view->menu);
 289 }
 290
 291 static int tree_view_free(struct tree_view *view)
 292 {
 293         if (view->menu) {
 294                 unpost_menu(view->menu);
 295                 free_menu(view->menu);
 296         }
 297         if (view->empty[0]) {
 298                 free_item(view->empty[0]);
 299         }
 300         if (view->panel) {
 301                 del_panel(view->panel);
 302         }
 303         if (view->window) {
 304                 delwin(view->window);
 305         }
 306         tree_view_free_current_items(view->current_items);
 307         tree_node_free_recursive(view->root);
 308
 309         return 0;
 310 }
 311
 312 struct tree_view *tree_view_new(TALLOC_CTX *ctx, struct tree_node *root,
 313                                 int nlines, int ncols, int begin_y,
 314                                 int begin_x)
 315 {
 316         struct tree_view *view;
 317         static const char *dummy = "(empty)";
 318
 319         view = talloc_zero(ctx, struct tree_view);
 320         if (view == NULL) {
 321                 return NULL;
 322         }
 323
 324         talloc_set_destructor(view, tree_view_free);
 325
 326         view->empty[0] = new_item(dummy, dummy);
 327         if (view->empty[0] == NULL) {
 328                 goto fail;
 329         }
 330         view->window = newwin(nlines, ncols, begin_y, begin_x);
 331         if (view->window == NULL) {
 332                 goto fail;
 333         }
 334         view->panel = new_panel(view->window);
 335         if (view->panel == NULL) {
 336                 goto fail;
 337         }
 338         view->root = root;
 339
 340         view->menu = new_menu(view->empty);
 341         if (view->menu == NULL) {
 342                 goto fail;
 343         }
 344         set_menu_format(view->menu, nlines, 1);
 345         set_menu_win(view->menu, view->window);
 346         menu_opts_off(view->menu, O_SHOWDESC);
 347         set_menu_mark(view->menu, "* ");
 348
 349         tree_view_update(view, root);
 350
 351         return view;
 352
 353 fail:
 354         talloc_free(view);
 355
 356         return NULL;
 357 }
 358
 359 void tree_view_resize(struct tree_view *view, int nlines, int ncols,
 360                              int begin_y, int begin_x)
 361 {
 362         WINDOW *nwin;
 363
 364         unpost_menu(view->menu);
 365         nwin = newwin(nlines, ncols, begin_y, begin_x);
 366         replace_panel(view->panel, nwin);
 367         delwin(view->window);
 368         view->window = nwin;
 369         set_menu_format(view->menu, nlines, 1);
 370         set_menu_win(view->menu, view->window);
 371         post_menu(view->menu);
 372 }
 373
 374 static void print_path_recursive(WINDOW *label, struct tree_node *node, size_t *len)
 375 {
 376         if (node->parent)
 377                 print_path_recursive(label, node->parent, len);
 378
 379         wprintw(label, "%s/", node->name);
 380         *len += 1 + strlen(node->name);
 381 }
 382
 383 /* print the path of node to label */
 384 size_t tree_node_print_path(WINDOW *label, struct tree_node *node)
 385 {
 386         size_t len = 1;
 387
 388         if (node == NULL)
 389                 return 0;
 390
 391         werase(label);
 392         wprintw(label, "/");
 393
 394         if (node->parent)
 395                 print_path_recursive(label, node->parent, &len);
 396
 397         return len;
 398 }