summaryrefslogtreecommitdiff
path: root/source3/utils/regedit_valuelist.c
diff options
context:
space:
mode:
authorC. Davis <cd.rattan@gmail.com>2012-07-18 02:31:41 -0700
committerMichael Adam <obnox@samba.org>2013-04-29 13:05:51 +0200
commite75057a906b6a7e275622ee1a97675d70ab61912 (patch)
tree424e08599f2e021d8d22cdde0365cfaf01d6f7e4 /source3/utils/regedit_valuelist.c
parentf751b36979aecca2189b1258fb8b454039c88cc6 (diff)
downloadsamba-e75057a906b6a7e275622ee1a97675d70ab61912.tar.gz
samba-e75057a906b6a7e275622ee1a97675d70ab61912.tar.bz2
samba-e75057a906b6a7e275622ee1a97675d70ab61912.zip
regedit: List values for the selected key.
Next step is to format a preview for the data and show that next to the data type. Reviewed-by: Andreas Schneider <asn@samba.org> Reviewed-by: Michael Adam <obnox@samba.org>
Diffstat (limited to 'source3/utils/regedit_valuelist.c')
-rw-r--r--source3/utils/regedit_valuelist.c182
1 files changed, 182 insertions, 0 deletions
diff --git a/source3/utils/regedit_valuelist.c b/source3/utils/regedit_valuelist.c
new file mode 100644
index 0000000000..44cafca8c5
--- /dev/null
+++ b/source3/utils/regedit_valuelist.c
@@ -0,0 +1,182 @@
+/*
+ * 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 <http://www.gnu.org/licenses/>.
+ */
+
+#include "regedit_valuelist.h"
+#include "lib/registry/registry.h"
+
+static void value_list_free_items(struct value_list *vl)
+{
+ size_t i;
+ ITEM *item;
+ struct value_item *vitem;
+
+ if (vl->items == NULL) {
+ return;
+ }
+
+ for (i = 0; vl->items[i] != NULL; ++i) {
+ item = vl->items[i];
+ vitem = item_userptr(item);
+ SMB_ASSERT(vitem != NULL);
+ free_item(item);
+ talloc_free(vitem);
+ }
+
+ talloc_free(vl->items);
+ vl->items = NULL;
+}
+
+static int value_list_free(struct value_list *vl)
+{
+ if (vl->menu) {
+ unpost_menu(vl->menu);
+ free_menu(vl->menu);
+ }
+ if (vl->empty && vl->empty[0]) {
+ free_item(vl->empty[0]);
+ }
+ value_list_free_items(vl);
+
+ return 0;
+}
+
+struct value_list *value_list_new(TALLOC_CTX *ctx, WINDOW *orig, int nlines,
+ int ncols, int begin_y, int begin_x)
+{
+ static const char *empty = "(no values)";
+ static const char *empty_desc = "";
+ struct value_list *vl;
+
+ vl = talloc_zero(ctx, struct value_list);
+ if (vl == NULL) {
+ return NULL;
+ }
+
+ talloc_set_destructor(vl, value_list_free);
+
+ vl->empty = talloc_zero_array(ctx, ITEM *, 2);
+ if (vl->empty == NULL) {
+ goto fail;
+ }
+ vl->empty[0] = new_item(empty, empty_desc);
+ if (vl->empty[0] == NULL) {
+ goto fail;
+ }
+
+ vl->window = orig;
+ vl->sub_window = derwin(orig, nlines, ncols, begin_y, begin_x);
+
+ vl->menu = new_menu(vl->empty);
+ if (vl->menu == NULL) {
+ goto fail;
+ }
+
+ set_menu_format(vl->menu, nlines, 1);
+ set_menu_win(vl->menu, vl->window);
+ set_menu_sub(vl->menu, vl->sub_window);
+ menu_opts_on(vl->menu, O_SHOWDESC);
+ set_menu_mark(vl->menu, "* ");
+
+ return vl;
+
+fail:
+ talloc_free(vl);
+
+ return NULL;
+}
+
+static uint32_t get_num_values(TALLOC_CTX *ctx, const struct registry_key *key)
+{
+ const char *classname;
+ uint32_t num_subkeys;
+ uint32_t num_values;
+ NTTIME last_change_time;
+ uint32_t max_subkeynamelen;
+ uint32_t max_valnamelen;
+ uint32_t max_valbufsize;
+ WERROR rv;
+
+ rv = reg_key_get_info(ctx, key, &classname, &num_subkeys,
+ &num_values, &last_change_time,
+ &max_subkeynamelen, &max_valnamelen,
+ &max_valbufsize);
+
+ if (W_ERROR_IS_OK(rv)) {
+ return num_values;
+ }
+
+ return 0;
+}
+
+void value_list_show(struct value_list *vl)
+{
+ post_menu(vl->menu);
+ wrefresh(vl->window);
+}
+
+WERROR value_list_load(struct value_list *vl, struct registry_key *key)
+{
+ uint32_t n_values;
+ uint32_t idx;
+ struct value_item *vitem;
+ WERROR rv;
+
+ value_list_free_items(vl);
+
+ unpost_menu(vl->menu);
+ set_menu_items(vl->menu, vl->empty);
+
+ n_values = get_num_values(vl, key);
+ if (n_values == 0) {
+ return WERR_OK;
+ }
+
+ vl->items = talloc_zero_array(vl, ITEM *, n_values + 1);
+ if (vl->items == NULL) {
+ return WERR_NOMEM;
+ }
+
+ for (idx = 0; idx < n_values; ++idx) {
+ vitem = talloc_zero(vl, struct value_item);
+ if (vitem == NULL) {
+ return WERR_NOMEM;
+ }
+
+ rv = reg_key_get_value_by_index(vitem, key, idx,
+ &vitem->value_name,
+ &vitem->type,
+ &vitem->data);
+
+ if (!W_ERROR_IS_OK(rv)) {
+ talloc_free(vitem);
+ return rv;
+ }
+
+ /* TODO: format a preview of the data blob and stick it
+ in the description */
+
+ vl->items[idx] = new_item(vitem->value_name,
+ str_regtype(vitem->type));
+ set_item_userptr(vl->items[idx], vitem);
+ }
+
+ set_menu_items(vl->menu, vl->items);
+
+ return WERR_OK;
+}