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
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
|
/*
* Unix SMB/CIFS implementation.
* Virtual Windows Registry Layer
* Copyright (C) Gerald Carter 2002-2005
*
* 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/>.
*/
/* Implementation of registry frontend view functions. */
#include "includes.h"
#undef DBGC_CLASS
#define DBGC_CLASS DBGC_REGISTRY
struct regsubkey_ctr {
uint32_t num_subkeys;
char **subkeys;
struct db_context *subkeys_hash;
int seqnum;
};
/**********************************************************************
Note that the struct regsubkey_ctr and struct regval_ctr objects *must* be
talloc()'d since the methods use the object pointer as the talloc
context for internal private data.
There is no longer a regval_ctr_intit() and regval_ctr_destroy()
pair of functions. Simply TALLOC_ZERO_P() and TALLOC_FREE() the
object.
**********************************************************************/
WERROR regsubkey_ctr_init(TALLOC_CTX *mem_ctx, struct regsubkey_ctr **ctr)
{
if (ctr == NULL) {
return WERR_INVALID_PARAM;
}
*ctr = talloc_zero(mem_ctx, struct regsubkey_ctr);
if (*ctr == NULL) {
return WERR_NOMEM;
}
(*ctr)->subkeys_hash = db_open_rbt(*ctr);
if ((*ctr)->subkeys_hash == NULL) {
talloc_free(*ctr);
return WERR_NOMEM;
}
return WERR_OK;
}
/**
* re-initialize the list of subkeys (to the emtpy list)
* in an already allocated regsubkey_ctr
*/
WERROR regsubkey_ctr_reinit(struct regsubkey_ctr *ctr)
{
if (ctr == NULL) {
return WERR_INVALID_PARAM;
}
talloc_free(ctr->subkeys_hash);
ctr->subkeys_hash = db_open_rbt(ctr);
W_ERROR_HAVE_NO_MEMORY(ctr->subkeys_hash);
TALLOC_FREE(ctr->subkeys);
ctr->num_subkeys = 0;
ctr->seqnum = 0;
return WERR_OK;
}
WERROR regsubkey_ctr_set_seqnum(struct regsubkey_ctr *ctr, int seqnum)
{
if (ctr == NULL) {
return WERR_INVALID_PARAM;
}
ctr->seqnum = seqnum;
return WERR_OK;
}
int regsubkey_ctr_get_seqnum(struct regsubkey_ctr *ctr)
{
if (ctr == NULL) {
return -1;
}
return ctr->seqnum;
}
static WERROR regsubkey_ctr_hash_keyname(struct regsubkey_ctr *ctr,
const char *keyname,
uint32 idx)
{
WERROR werr;
werr = ntstatus_to_werror(dbwrap_store_bystring_upper(ctr->subkeys_hash,
keyname,
make_tdb_data((uint8 *)&idx,
sizeof(idx)),
TDB_REPLACE));
if (!W_ERROR_IS_OK(werr)) {
DEBUG(1, ("error hashing new key '%s' in container: %s\n",
keyname, win_errstr(werr)));
}
return werr;
}
static WERROR regsubkey_ctr_unhash_keyname(struct regsubkey_ctr *ctr,
const char *keyname)
{
WERROR werr;
werr = ntstatus_to_werror(dbwrap_delete_bystring_upper(ctr->subkeys_hash,
keyname));
if (!W_ERROR_IS_OK(werr)) {
DEBUG(1, ("error unhashing key '%s' in container: %s\n",
keyname, win_errstr(werr)));
}
return werr;
}
static WERROR regsubkey_ctr_index_for_keyname(struct regsubkey_ctr *ctr,
const char *keyname,
uint32 *idx)
{
TDB_DATA data;
if ((ctr == NULL) || (keyname == NULL)) {
return WERR_INVALID_PARAM;
}
data = dbwrap_fetch_bystring_upper(ctr->subkeys_hash, ctr, keyname);
if (data.dptr == NULL) {
return WERR_NOT_FOUND;
}
if (data.dsize != sizeof(*idx)) {
talloc_free(data.dptr);
return WERR_INVALID_DATATYPE;
}
if (idx != NULL) {
*idx = *(uint32 *)data.dptr;
}
talloc_free(data.dptr);
return WERR_OK;
}
/***********************************************************************
Add a new key to the array
**********************************************************************/
WERROR regsubkey_ctr_addkey( struct regsubkey_ctr *ctr, const char *keyname )
{
char **newkeys;
WERROR werr;
if ( !keyname ) {
return WERR_OK;
}
/* make sure the keyname is not already there */
if ( regsubkey_ctr_key_exists( ctr, keyname ) ) {
return WERR_OK;
}
if (!(newkeys = TALLOC_REALLOC_ARRAY(ctr, ctr->subkeys, char *,
ctr->num_subkeys+1))) {
return WERR_NOMEM;
}
ctr->subkeys = newkeys;
if (!(ctr->subkeys[ctr->num_subkeys] = talloc_strdup(ctr->subkeys,
keyname ))) {
/*
* Don't shrink the new array again, this wastes a pointer
*/
return WERR_NOMEM;
}
werr = regsubkey_ctr_hash_keyname(ctr, keyname, ctr->num_subkeys);
W_ERROR_NOT_OK_RETURN(werr);
ctr->num_subkeys++;
return WERR_OK;
}
/***********************************************************************
Delete a key from the array
**********************************************************************/
WERROR regsubkey_ctr_delkey( struct regsubkey_ctr *ctr, const char *keyname )
{
WERROR werr;
uint32 idx, j;
if (keyname == NULL) {
return WERR_INVALID_PARAM;
}
/* make sure the keyname is actually already there */
werr = regsubkey_ctr_index_for_keyname(ctr, keyname, &idx);
W_ERROR_NOT_OK_RETURN(werr);
werr = regsubkey_ctr_unhash_keyname(ctr, keyname);
W_ERROR_NOT_OK_RETURN(werr);
/* update if we have any keys left */
ctr->num_subkeys--;
if (idx < ctr->num_subkeys) {
memmove(&ctr->subkeys[idx], &ctr->subkeys[idx+1],
sizeof(char *) * (ctr->num_subkeys - idx));
/* we have to re-hash rest of the array... :-( */
for (j = idx; j < ctr->num_subkeys; j++) {
werr = regsubkey_ctr_hash_keyname(ctr, ctr->subkeys[j], j);
W_ERROR_NOT_OK_RETURN(werr);
}
}
return WERR_OK;
}
/***********************************************************************
Check for the existance of a key
**********************************************************************/
bool regsubkey_ctr_key_exists( struct regsubkey_ctr *ctr, const char *keyname )
{
WERROR werr;
if (!ctr->subkeys) {
return False;
}
werr = regsubkey_ctr_index_for_keyname(ctr, keyname, NULL);
if (!W_ERROR_IS_OK(werr)) {
return false;
}
return true;
}
/***********************************************************************
How many keys does the container hold ?
**********************************************************************/
int regsubkey_ctr_numkeys( struct regsubkey_ctr *ctr )
{
return ctr->num_subkeys;
}
/***********************************************************************
Retreive a specific key string
**********************************************************************/
char* regsubkey_ctr_specific_key( struct regsubkey_ctr *ctr, uint32_t key_index )
{
if ( ! (key_index < ctr->num_subkeys) )
return NULL;
return ctr->subkeys[key_index];
}
/*
* Utility functions for struct regval_ctr
*/
/***********************************************************************
How many keys does the container hold ?
**********************************************************************/
int regval_ctr_numvals(struct regval_ctr *ctr)
{
return ctr->num_values;
}
/***********************************************************************
allocate memory for and duplicate a struct regval_blob.
This is malloc'd memory so the caller should free it when done
**********************************************************************/
struct regval_blob* dup_registry_value(struct regval_blob *val)
{
struct regval_blob *copy = NULL;
if ( !val )
return NULL;
if ( !(copy = SMB_MALLOC_P( struct regval_blob)) ) {
DEBUG(0,("dup_registry_value: malloc() failed!\n"));
return NULL;
}
/* copy all the non-pointer initial data */
memcpy( copy, val, sizeof(struct regval_blob) );
copy->size = 0;
copy->data_p = NULL;
if ( val->data_p && val->size )
{
if ( !(copy->data_p = (uint8 *)memdup( val->data_p,
val->size )) ) {
DEBUG(0,("dup_registry_value: memdup() failed for [%d] "
"bytes!\n", val->size));
SAFE_FREE( copy );
return NULL;
}
copy->size = val->size;
}
return copy;
}
/**********************************************************************
free the memory allocated to a struct regval_blob
*********************************************************************/
void free_registry_value(struct regval_blob *val)
{
if ( !val )
return;
SAFE_FREE( val->data_p );
SAFE_FREE( val );
return;
}
/**********************************************************************
*********************************************************************/
uint8* regval_data_p(struct regval_blob *val)
{
return val->data_p;
}
/**********************************************************************
*********************************************************************/
uint32 regval_size(struct regval_blob *val)
{
return val->size;
}
/**********************************************************************
*********************************************************************/
char* regval_name(struct regval_blob *val)
{
return val->valuename;
}
/**********************************************************************
*********************************************************************/
uint32 regval_type(struct regval_blob *val)
{
return val->type;
}
/***********************************************************************
Retreive a pointer to a specific value. Caller shoud dup the structure
since this memory will go away when the ctr is free()'d
**********************************************************************/
struct regval_blob *regval_ctr_specific_value(struct regval_ctr *ctr,
uint32 idx)
{
if ( !(idx < ctr->num_values) )
return NULL;
return ctr->values[idx];
}
/***********************************************************************
Check for the existance of a value
**********************************************************************/
bool regval_ctr_key_exists(struct regval_ctr *ctr, const char *value)
{
int i;
for ( i=0; i<ctr->num_values; i++ ) {
if ( strequal( ctr->values[i]->valuename, value) )
return True;
}
return False;
}
/***********************************************************************
* compose a struct regval_blob from input data
**********************************************************************/
struct regval_blob *regval_compose(TALLOC_CTX *ctx, const char *name,
uint16 type,
const char *data_p, size_t size)
{
struct regval_blob *regval = TALLOC_P(ctx, struct regval_blob);
if (regval == NULL) {
return NULL;
}
fstrcpy(regval->valuename, name);
regval->type = type;
if (size) {
regval->data_p = (uint8 *)TALLOC_MEMDUP(regval, data_p, size);
if (!regval->data_p) {
TALLOC_FREE(regval);
return NULL;
}
} else {
regval->data_p = NULL;
}
regval->size = size;
return regval;
}
/***********************************************************************
Add a new registry value to the array
**********************************************************************/
int regval_ctr_addvalue(struct regval_ctr *ctr, const char *name, uint16 type,
const char *data_p, size_t size)
{
if ( !name )
return ctr->num_values;
/* Delete the current value (if it exists) and add the new one */
regval_ctr_delvalue( ctr, name );
/* allocate a slot in the array of pointers */
if ( ctr->num_values == 0 ) {
ctr->values = TALLOC_P( ctr, struct regval_blob *);
} else {
ctr->values = TALLOC_REALLOC_ARRAY(ctr, ctr->values,
struct regval_blob *,
ctr->num_values+1);
}
if (!ctr->values) {
ctr->num_values = 0;
return 0;
}
/* allocate a new value and store the pointer in the arrya */
ctr->values[ctr->num_values] = regval_compose(ctr, name, type, data_p,
size);
if (ctr->values[ctr->num_values] == NULL) {
ctr->num_values = 0;
return 0;
}
ctr->num_values++;
return ctr->num_values;
}
/***********************************************************************
Add a new registry SZ value to the array
**********************************************************************/
int regval_ctr_addvalue_sz(struct regval_ctr *ctr, const char *name, const char *data)
{
DATA_BLOB blob;
if (!push_reg_sz(ctr, &blob, data)) {
return -1;
}
return regval_ctr_addvalue(ctr, name, REG_SZ,
(const char *)blob.data,
blob.length);
}
/***********************************************************************
Add a new registry value to the array
**********************************************************************/
int regval_ctr_copyvalue(struct regval_ctr *ctr, struct regval_blob *val)
{
if ( val ) {
regval_ctr_addvalue(ctr, val->valuename, val->type,
(char *)val->data_p, val->size);
}
return ctr->num_values;
}
/***********************************************************************
Delete a single value from the registry container.
No need to free memory since it is talloc'd.
**********************************************************************/
int regval_ctr_delvalue(struct regval_ctr *ctr, const char *name)
{
int i;
for ( i=0; i<ctr->num_values; i++ ) {
if ( strequal( ctr->values[i]->valuename, name ) )
break;
}
/* just return if we don't find it */
if ( i == ctr->num_values )
return ctr->num_values;
/* If 'i' was not the last element, just shift everything down one */
ctr->num_values--;
if ( i < ctr->num_values )
memmove(&ctr->values[i], &ctr->values[i+1],
sizeof(struct regval_blob*)*(ctr->num_values-i));
return ctr->num_values;
}
/***********************************************************************
Retrieve single value from the registry container.
No need to free memory since it is talloc'd.
**********************************************************************/
struct regval_blob* regval_ctr_getvalue(struct regval_ctr *ctr,
const char *name)
{
int i;
/* search for the value */
for ( i=0; i<ctr->num_values; i++ ) {
if ( strequal( ctr->values[i]->valuename, name ) )
return ctr->values[i];
}
return NULL;
}
/***********************************************************************
return the data_p as a uint32
**********************************************************************/
uint32 regval_dword(struct regval_blob *val)
{
uint32 data;
data = IVAL( regval_data_p(val), 0 );
return data;
}
/***********************************************************************
return the data_p as a character string
**********************************************************************/
char *regval_sz(struct regval_blob *val)
{
char *data = NULL;
rpcstr_pull_talloc(talloc_tos(), &data,
regval_data_p(val), regval_size(val),0);
return data;
}
|