summaryrefslogtreecommitdiff
path: root/source3/utils/regedit_treeview.c
blob: c74f052c5951ad99348ad82c32ee9d10e5586dfb (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
/*
 * 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_treeview.h"
#include "lib/registry/registry.h"

struct tree_node *tree_node_new(TALLOC_CTX *ctx, struct tree_node *parent,
				const char *name, struct registry_key *key)
{
	struct tree_node *node;

	node = talloc_zero(ctx, struct tree_node);
	if (!node) {
		return NULL;
	}

	node->name = talloc_strdup(node, name);
	if (!node->name) {
		talloc_free(node);
		return NULL;
	}

	node->key = talloc_steal(node, key);

	if (parent) {
		/* Check if this node is the first descendant of parent. */
		if (!parent->child_head) {
			parent->child_head = node;
		}
		node->parent = parent;
	}

	return node;
}

void tree_node_append(struct tree_node *left, struct tree_node *right)
{
	if (left->next) {
		right->next = left->next;
		left->next->previous = right;
	}
	left->next = right;
	right->previous = left;
}

void tree_node_append_last(struct tree_node *list, struct tree_node *node)
{
	tree_node_append(tree_node_last(list), node);
}

struct tree_node *tree_node_pop(struct tree_node **plist)
{
	struct tree_node *node;

	node = *plist;

	if (node == NULL)
		return NULL;

	*plist = node->previous;
	if (*plist == NULL) {
		*plist = node->next;
	}
	if (node->previous) {
		node->previous->next = node->next;
	}
	if (node->next) {
		node->next->previous = node->previous;
	}
	if (node->parent && node->parent->child_head == node) {
		node->parent->child_head = node->next;
	}
	node->next = NULL;
	node->previous = NULL;

	return node;
}

struct tree_node *tree_node_first(struct tree_node *list)
{
	/* Grab the first node in this list from the parent if available. */
	if (list->parent) {
		return list->parent->child_head;
	}

	while (list && list->previous) {
		list = list->previous;
	}

	return list;
}

struct tree_node *tree_node_last(struct tree_node *list)
{
	while (list && list->next) {
		list = list->next;
	}

	return list;
}

bool tree_node_has_children(struct tree_node *node)
{
	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;

	if (node->child_head) {
		return true;
	}

	rv = reg_key_get_info(node, node->key, &classname, &num_subkeys,
			      &num_values, &last_change_time,
			      &max_subkeynamelen, &max_valnamelen,
			      &max_valbufsize);

	if (W_ERROR_IS_OK(rv)) {
		return num_subkeys != 0;
	}

	return false;
}

WERROR tree_node_load_children(struct tree_node *node)
{
	struct registry_key *key;
	const char *key_name, *klass;
	NTTIME modified;
	uint32_t i;
	WERROR rv;
	struct tree_node *new_node, *prev;

	/* does this node already have it's children loaded? */
	if (node->child_head)
		return WERR_OK;

	for (prev = NULL, i = 0; ; ++i) {
		rv = reg_key_get_subkey_by_index(node, node->key, i,
						 &key_name, &klass,
						 &modified);
		if (!W_ERROR_IS_OK(rv)) {
			if (W_ERROR_EQUAL(rv, WERR_NO_MORE_ITEMS)) {
				break;
			}

			return rv;
		}

		rv = reg_open_key(node, node->key, key_name, &key);
		if (!W_ERROR_IS_OK(rv)) {
			return rv;
		}

		new_node = tree_node_new(node, node, key_name, key);
		if (new_node == NULL) {
			return WERR_NOMEM;
		}

		if (prev) {
			tree_node_append(prev, new_node);
		}
		prev = new_node;
	}

	return WERR_OK;
}

void tree_node_free_recursive(struct tree_node *list)
{
	struct tree_node *node;

	if (list == NULL) {
		return;
	}

	while ((node = tree_node_pop(&list)) != NULL) {
		if (node->child_head) {
			tree_node_free_recursive(node->child_head);
		}
		node->child_head = NULL;
		talloc_free(node);
	}
}

static void tree_view_free_current_items(ITEM **items)
{
	size_t i;
	struct tree_node *node;
	ITEM *item;

	if (items == NULL) {
		return;
	}

	for (i = 0; items[i] != NULL; ++i) {
		item = items[i];
		node = item_userptr(item);
		if (node && node->label) {
			talloc_free(node->label);
			node->label = NULL;
		}
		free_item(item);
	}

	talloc_free(items);
}

void tree_view_clear(struct tree_view *view)
{
	unpost_menu(view->menu);
	set_menu_items(view->menu, view->empty);
	tree_view_free_current_items(view->current_items);
	view->current_items = NULL;
}

WERROR tree_view_update(struct tree_view *view, struct tree_node *list)
{
	ITEM **items;
	struct tree_node *node;
	size_t i, n_items;

	if (list == NULL) {
		list = view->root;
	}
	for (n_items = 0, node = list; node != NULL; node = node->next) {
		n_items++;
	}

	items = talloc_zero_array(view, ITEM *, n_items + 1);
	if (items == NULL) {
		return WERR_NOMEM;
	}

	for (i = 0, node = list; node != NULL; ++i, node = node->next) {
		const char *label = node->name;

		/* Add a '+' marker to indicate that the item has
		   descendants. */
		if (tree_node_has_children(node)) {
			SMB_ASSERT(node->label == NULL);
			node->label = talloc_asprintf(node, "+%s", node->name);
			if (node->label == NULL) {
				goto fail;
			}
			label = node->label;
		}

		items[i] = new_item(label, node->name);
		set_item_userptr(items[i], node);
	}

	unpost_menu(view->menu);
	set_menu_items(view->menu, items);
	tree_view_free_current_items(view->current_items);
	view->current_items = items;

	return WERR_OK;

fail:
	tree_view_free_current_items(items);

	return WERR_NOMEM;
}

void tree_view_show(struct tree_view *view)
{
	post_menu(view->menu);
}

static int tree_view_free(struct tree_view *view)
{
	if (view->menu) {
		unpost_menu(view->menu);
		free_menu(view->menu);
	}
	if (view->empty[0]) {
		free_item(view->empty[0]);
	}
	if (view->panel) {
		del_panel(view->panel);
	}
	if (view->window) {
		delwin(view->window);
	}
	tree_view_free_current_items(view->current_items);
	tree_node_free_recursive(view->root);

	return 0;
}

struct tree_view *tree_view_new(TALLOC_CTX *ctx, struct tree_node *root,
				int nlines, int ncols, int begin_y,
				int begin_x)
{
	struct tree_view *view;
	static const char *dummy = "(empty)";

	view = talloc_zero(ctx, struct tree_view);
	if (view == NULL) {
		return NULL;
	}

	talloc_set_destructor(view, tree_view_free);

	view->empty[0] = new_item(dummy, dummy);
	if (view->empty[0] == NULL) {
		goto fail;
	}
	view->window = newwin(nlines, ncols, begin_y, begin_x);
	if (view->window == NULL) {
		goto fail;
	}
	view->panel = new_panel(view->window);
	if (view->panel == NULL) {
		goto fail;
	}
	view->root = root;

	view->menu = new_menu(view->empty);
	if (view->menu == NULL) {
		goto fail;
	}
	set_menu_format(view->menu, nlines, 1);
	set_menu_win(view->menu, view->window);
	menu_opts_off(view->menu, O_SHOWDESC);
	set_menu_mark(view->menu, "* ");

	tree_view_update(view, root);

	return view;

fail:
	talloc_free(view);

	return NULL;
}

void tree_view_resize(struct tree_view *view, int nlines, int ncols,
			     int begin_y, int begin_x)
{
	WINDOW *nwin;

	unpost_menu(view->menu);
	nwin = newwin(nlines, ncols, begin_y, begin_x);
	replace_panel(view->panel, nwin);
	delwin(view->window);
	view->window = nwin;
	set_menu_format(view->menu, nlines, 1);
	set_menu_win(view->menu, view->window);
	post_menu(view->menu);
}

static void print_path_recursive(WINDOW *label, struct tree_node *node,
				 size_t *len)
{
	if (node->parent)
		print_path_recursive(label, node->parent, len);

	wprintw(label, "%s/", node->name);
	*len += 1 + strlen(node->name);
}

/* print the path of node to label */
size_t tree_node_print_path(WINDOW *label, struct tree_node *node)
{
	size_t len = 1;

	if (node == NULL)
		return 0;

	werase(label);
	wprintw(label, "/");

	if (node->parent)
		print_path_recursive(label, node->parent, &len);

	return len;
}