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
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
|
/*
* Unix SMB/CIFS implementation.
* Virtual Windows Registry Layer
* Copyright (C) Volker Lendecke 2006
* Copyright (C) Michael Adam 2007-2010
*
* 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/>.
*/
/* Attempt to wrap the existing API in a more winreg.idl-like way */
/*
* Here is a list of winreg.idl functions and corresponding implementations
* provided here:
*
* 0x00 winreg_OpenHKCR
* 0x01 winreg_OpenHKCU
* 0x02 winreg_OpenHKLM
* 0x03 winreg_OpenHKPD
* 0x04 winreg_OpenHKU
* 0x05 winreg_CloseKey
* 0x06 winreg_CreateKey reg_createkey
* 0x07 winreg_DeleteKey reg_deletekey
* 0x08 winreg_DeleteValue reg_deletevalue
* 0x09 winreg_EnumKey reg_enumkey
* 0x0a winreg_EnumValue reg_enumvalue
* 0x0b winreg_FlushKey
* 0x0c winreg_GetKeySecurity reg_getkeysecurity
* 0x0d winreg_LoadKey
* 0x0e winreg_NotifyChangeKeyValue
* 0x0f winreg_OpenKey reg_openkey
* 0x10 winreg_QueryInfoKey reg_queryinfokey
* 0x11 winreg_QueryValue reg_queryvalue
* 0x12 winreg_ReplaceKey
* 0x13 winreg_RestoreKey reg_restorekey
* 0x14 winreg_SaveKey reg_savekey
* 0x15 winreg_SetKeySecurity reg_setkeysecurity
* 0x16 winreg_SetValue reg_setvalue
* 0x17 winreg_UnLoadKey
* 0x18 winreg_InitiateSystemShutdown
* 0x19 winreg_AbortSystemShutdown
* 0x1a winreg_GetVersion reg_getversion
* 0x1b winreg_OpenHKCC
* 0x1c winreg_OpenHKDD
* 0x1d winreg_QueryMultipleValues reg_querymultiplevalues
* 0x1e winreg_InitiateSystemShutdownEx
* 0x1f winreg_SaveKeyEx
* 0x20 winreg_OpenHKPT
* 0x21 winreg_OpenHKPN
* 0x22 winreg_QueryMultipleValues2 reg_querymultiplevalues
*
*/
#include "includes.h"
#include "registry.h"
#include "reg_api.h"
#include "reg_cachehook.h"
#include "reg_backend_db.h"
#include "reg_dispatcher.h"
#include "reg_objects.h"
#include "../librpc/gen_ndr/ndr_security.h"
#include "reg_parse_internal.h"
#undef DBGC_CLASS
#define DBGC_CLASS DBGC_REGISTRY
/**********************************************************************
* Helper functions
**********************************************************************/
static WERROR fill_value_cache(struct registry_key *key)
{
WERROR werr;
if (key->values != NULL) {
if (!reg_values_need_update(key->key, key->values)) {
return WERR_OK;
}
}
TALLOC_FREE(key->values);
werr = regval_ctr_init(key, &(key->values));
W_ERROR_NOT_OK_RETURN(werr);
if (fetch_reg_values(key->key, key->values) == -1) {
TALLOC_FREE(key->values);
return WERR_FILE_NOT_FOUND;
}
return WERR_OK;
}
static WERROR fill_subkey_cache(struct registry_key *key)
{
WERROR werr;
if (key->subkeys != NULL) {
if (!reg_subkeys_need_update(key->key, key->subkeys)) {
return WERR_OK;
}
}
TALLOC_FREE(key->subkeys);
werr = regsubkey_ctr_init(key, &(key->subkeys));
W_ERROR_NOT_OK_RETURN(werr);
if (fetch_reg_keys(key->key, key->subkeys) == -1) {
TALLOC_FREE(key->subkeys);
return WERR_FILE_NOT_FOUND;
}
return WERR_OK;
}
static int regkey_destructor(struct registry_key_handle *key)
{
return regdb_close();
}
static WERROR regkey_open_onelevel(TALLOC_CTX *mem_ctx,
struct registry_key *parent,
const char *name,
const struct security_token *token,
uint32_t access_desired,
struct registry_key **pregkey)
{
WERROR result;
struct registry_key *regkey;
struct registry_key_handle *key;
DEBUG(7,("regkey_open_onelevel: name = [%s]\n", name));
SMB_ASSERT(strchr(name, '\\') == NULL);
if (!(regkey = talloc_zero(mem_ctx, struct registry_key)) ||
!(regkey->token = dup_nt_token(regkey, token)) ||
!(regkey->key = talloc_zero(regkey, struct registry_key_handle)))
{
result = WERR_NOT_ENOUGH_MEMORY;
goto done;
}
result = regdb_open();
if (!(W_ERROR_IS_OK(result))) {
goto done;
}
key = regkey->key;
talloc_set_destructor(key, regkey_destructor);
/* initialization */
key->type = REG_KEY_GENERIC;
if (name[0] == '\0') {
/*
* Open a copy of the parent key
*/
if (!parent) {
result = WERR_FILE_NOT_FOUND;
goto done;
}
key->name = talloc_strdup(key, parent->key->name);
}
else {
/*
* Normal subkey open
*/
key->name = talloc_asprintf(key, "%s%s%s",
parent ? parent->key->name : "",
parent ? "\\": "",
name);
}
if (key->name == NULL) {
result = WERR_NOT_ENOUGH_MEMORY;
goto done;
}
/* Tag this as a Performance Counter Key */
if( strncasecmp_m(key->name, KEY_HKPD, strlen(KEY_HKPD)) == 0 )
key->type = REG_KEY_HKPD;
/* Look up the table of registry I/O operations */
key->ops = reghook_cache_find( key->name );
if (key->ops == NULL) {
DEBUG(0,("reg_open_onelevel: Failed to assign "
"registry_ops to [%s]\n", key->name ));
result = WERR_FILE_NOT_FOUND;
goto done;
}
/* FIXME: Existence is currently checked by fetching the subkeys */
result = fill_subkey_cache(regkey);
if (!W_ERROR_IS_OK(result)) {
goto done;
}
if ( !regkey_access_check( key, access_desired, &key->access_granted,
token ) ) {
result = WERR_ACCESS_DENIED;
goto done;
}
*pregkey = regkey;
result = WERR_OK;
done:
if ( !W_ERROR_IS_OK(result) ) {
TALLOC_FREE(regkey);
}
return result;
}
WERROR reg_openhive(TALLOC_CTX *mem_ctx, const char *hive,
uint32_t desired_access,
const struct security_token *token,
struct registry_key **pkey)
{
const struct hive_info *hi;
SMB_ASSERT(hive != NULL);
SMB_ASSERT(strchr(hive, '\\') == NULL);
hi = hive_info(hive);
if (hi == NULL) {
return WERR_FILE_NOT_FOUND;
}
return regkey_open_onelevel(mem_ctx, NULL, hi->short_name, token,
desired_access, pkey);
}
/**********************************************************************
* The API functions
**********************************************************************/
WERROR reg_openkey(TALLOC_CTX *mem_ctx, struct registry_key *parent,
const char *name, uint32_t desired_access,
struct registry_key **pkey)
{
struct registry_key *direct_parent = parent;
WERROR err;
char *p, *path;
size_t len;
TALLOC_CTX *frame = talloc_stackframe();
path = talloc_strdup(frame, name);
if (path == NULL) {
err = WERR_NOT_ENOUGH_MEMORY;
goto error;
}
len = strlen(path);
if ((len > 0) && (path[len-1] == '\\')) {
path[len-1] = '\0';
}
while ((p = strchr(path, '\\')) != NULL) {
char *name_component;
struct registry_key *tmp;
name_component = talloc_strndup(frame, path, (p - path));
if (name_component == NULL) {
err = WERR_NOT_ENOUGH_MEMORY;
goto error;
}
err = regkey_open_onelevel(frame, direct_parent,
name_component, parent->token,
KEY_ENUMERATE_SUB_KEYS, &tmp);
if (!W_ERROR_IS_OK(err)) {
goto error;
}
direct_parent = tmp;
path = p+1;
}
err = regkey_open_onelevel(mem_ctx, direct_parent, path, parent->token,
desired_access, pkey);
error:
talloc_free(frame);
return err;
}
WERROR reg_enumkey(TALLOC_CTX *mem_ctx, struct registry_key *key,
uint32_t idx, char **name, NTTIME *last_write_time)
{
WERROR err;
if (!(key->key->access_granted & KEY_ENUMERATE_SUB_KEYS)) {
return WERR_ACCESS_DENIED;
}
err = fill_subkey_cache(key);
if (!W_ERROR_IS_OK(err)) {
return err;
}
if (idx >= regsubkey_ctr_numkeys(key->subkeys)) {
return WERR_NO_MORE_ITEMS;
}
if (!(*name = talloc_strdup(mem_ctx,
regsubkey_ctr_specific_key(key->subkeys, idx))))
{
return WERR_NOT_ENOUGH_MEMORY;
}
if (last_write_time) {
*last_write_time = 0;
}
return WERR_OK;
}
WERROR reg_enumvalue(TALLOC_CTX *mem_ctx, struct registry_key *key,
uint32_t idx, char **pname, struct registry_value **pval)
{
struct registry_value *val;
struct regval_blob *blob;
WERROR err;
if (!(key->key->access_granted & KEY_QUERY_VALUE)) {
return WERR_ACCESS_DENIED;
}
err = fill_value_cache(key);
if (!(W_ERROR_IS_OK(err))) {
return err;
}
if (idx >= regval_ctr_numvals(key->values)) {
return WERR_NO_MORE_ITEMS;
}
blob = regval_ctr_specific_value(key->values, idx);
val = talloc_zero(mem_ctx, struct registry_value);
if (val == NULL) {
return WERR_NOT_ENOUGH_MEMORY;
}
val->type = regval_type(blob);
val->data = data_blob_talloc(mem_ctx, regval_data_p(blob), regval_size(blob));
if (pname
&& !(*pname = talloc_strdup(
mem_ctx, regval_name(blob)))) {
TALLOC_FREE(val);
return WERR_NOT_ENOUGH_MEMORY;
}
*pval = val;
return WERR_OK;
}
static WERROR reg_enumvalue_nocachefill(TALLOC_CTX *mem_ctx,
struct registry_key *key,
uint32_t idx, char **pname,
struct registry_value **pval)
{
struct registry_value *val;
struct regval_blob *blob;
if (!(key->key->access_granted & KEY_QUERY_VALUE)) {
return WERR_ACCESS_DENIED;
}
if (idx >= regval_ctr_numvals(key->values)) {
return WERR_NO_MORE_ITEMS;
}
blob = regval_ctr_specific_value(key->values, idx);
val = talloc_zero(mem_ctx, struct registry_value);
if (val == NULL) {
return WERR_NOT_ENOUGH_MEMORY;
}
val->type = regval_type(blob);
val->data = data_blob_talloc(mem_ctx, regval_data_p(blob), regval_size(blob));
if (pname
&& !(*pname = talloc_strdup(
mem_ctx, regval_name(blob)))) {
TALLOC_FREE(val);
return WERR_NOT_ENOUGH_MEMORY;
}
*pval = val;
return WERR_OK;
}
WERROR reg_queryvalue(TALLOC_CTX *mem_ctx, struct registry_key *key,
const char *name, struct registry_value **pval)
{
WERROR err;
uint32_t i;
if (!(key->key->access_granted & KEY_QUERY_VALUE)) {
return WERR_ACCESS_DENIED;
}
if (!(W_ERROR_IS_OK(err = fill_value_cache(key)))) {
return err;
}
for (i=0; i < regval_ctr_numvals(key->values); i++) {
struct regval_blob *blob;
blob = regval_ctr_specific_value(key->values, i);
if (strequal(regval_name(blob), name)) {
/*
* don't use reg_enumvalue here:
* re-reading the values from the disk
* would change the indexing and break
* this function.
*/
return reg_enumvalue_nocachefill(mem_ctx, key, i,
NULL, pval);
}
}
return WERR_FILE_NOT_FOUND;
}
WERROR reg_querymultiplevalues(TALLOC_CTX *mem_ctx,
struct registry_key *key,
uint32_t num_names,
const char **names,
uint32_t *pnum_vals,
struct registry_value **pvals)
{
WERROR err;
uint32_t i, n, found = 0;
struct registry_value *vals;
if (num_names == 0) {
return WERR_OK;
}
if (!(key->key->access_granted & KEY_QUERY_VALUE)) {
return WERR_ACCESS_DENIED;
}
if (!(W_ERROR_IS_OK(err = fill_value_cache(key)))) {
return err;
}
vals = talloc_zero_array(mem_ctx, struct registry_value, num_names);
if (vals == NULL) {
return WERR_NOT_ENOUGH_MEMORY;
}
for (n=0; n < num_names; n++) {
for (i=0; i < regval_ctr_numvals(key->values); i++) {
struct regval_blob *blob;
blob = regval_ctr_specific_value(key->values, i);
if (strequal(regval_name(blob), names[n])) {
struct registry_value *v;
err = reg_enumvalue(mem_ctx, key, i, NULL, &v);
if (!W_ERROR_IS_OK(err)) {
return err;
}
vals[n] = *v;
found++;
}
}
}
*pvals = vals;
*pnum_vals = found;
return WERR_OK;
}
WERROR reg_queryinfokey(struct registry_key *key, uint32_t *num_subkeys,
uint32_t *max_subkeylen, uint32_t *max_subkeysize,
uint32_t *num_values, uint32_t *max_valnamelen,
uint32_t *max_valbufsize, uint32_t *secdescsize,
NTTIME *last_changed_time)
{
uint32_t i, max_size;
size_t max_len;
TALLOC_CTX *mem_ctx;
WERROR err;
struct security_descriptor *secdesc;
if (!(key->key->access_granted & KEY_QUERY_VALUE)) {
return WERR_ACCESS_DENIED;
}
if (!W_ERROR_IS_OK(fill_subkey_cache(key)) ||
!W_ERROR_IS_OK(fill_value_cache(key))) {
return WERR_FILE_NOT_FOUND;
}
max_len = 0;
for (i=0; i< regsubkey_ctr_numkeys(key->subkeys); i++) {
max_len = MAX(max_len,
strlen(regsubkey_ctr_specific_key(key->subkeys, i)));
}
*num_subkeys = regsubkey_ctr_numkeys(key->subkeys);
*max_subkeylen = max_len;
*max_subkeysize = 0; /* Class length? */
max_len = 0;
max_size = 0;
for (i=0; i < regval_ctr_numvals(key->values); i++) {
struct regval_blob *blob;
blob = regval_ctr_specific_value(key->values, i);
max_len = MAX(max_len, strlen(regval_name(blob)));
max_size = MAX(max_size, regval_size(blob));
}
*num_values = regval_ctr_numvals(key->values);
*max_valnamelen = max_len;
*max_valbufsize = max_size;
if (!(mem_ctx = talloc_new(key))) {
return WERR_NOT_ENOUGH_MEMORY;
}
err = regkey_get_secdesc(mem_ctx, key->key, &secdesc);
if (!W_ERROR_IS_OK(err)) {
TALLOC_FREE(mem_ctx);
return err;
}
*secdescsize = ndr_size_security_descriptor(secdesc, 0);
TALLOC_FREE(mem_ctx);
*last_changed_time = 0;
return WERR_OK;
}
WERROR reg_createkey(TALLOC_CTX *ctx, struct registry_key *parent,
const char *subkeypath, uint32_t desired_access,
struct registry_key **pkey,
enum winreg_CreateAction *paction)
{
struct registry_key *key = parent;
TALLOC_CTX *mem_ctx;
char *path, *end;
WERROR err;
uint32_t access_granted;
mem_ctx = talloc_new(ctx);
if (mem_ctx == NULL) {
return WERR_NOT_ENOUGH_MEMORY;
}
path = talloc_strdup(mem_ctx, subkeypath);
if (path == NULL) {
err = WERR_NOT_ENOUGH_MEMORY;
goto done;
}
err = regdb_transaction_start();
if (!W_ERROR_IS_OK(err)) {
DEBUG(0, ("reg_createkey: failed to start transaction: %s\n",
win_errstr(err)));
goto done;
}
while ((end = strchr(path, '\\')) != NULL) {
struct registry_key *tmp;
enum winreg_CreateAction action;
*end = '\0';
err = reg_createkey(mem_ctx, key, path,
KEY_ENUMERATE_SUB_KEYS, &tmp, &action);
if (!W_ERROR_IS_OK(err)) {
goto trans_done;
}
if (key != parent) {
TALLOC_FREE(key);
}
key = tmp;
path = end+1;
}
/*
* At this point, "path" contains the one-element subkey of "key". We
* can try to open it.
*/
err = reg_openkey(ctx, key, path, desired_access, pkey);
if (W_ERROR_IS_OK(err)) {
if (paction != NULL) {
*paction = REG_OPENED_EXISTING_KEY;
}
goto trans_done;
}
if (!W_ERROR_EQUAL(err, WERR_FILE_NOT_FOUND)) {
/*
* Something but "notfound" has happened, so bail out
*/
goto trans_done;
}
/*
* We may (e.g. in the iteration) have opened the key with ENUM_SUBKEY.
* Instead of re-opening the key with CREATE_SUB_KEY, we simply
* duplicate the access check here and skip the expensive full open.
*/
if (!regkey_access_check(key->key, KEY_CREATE_SUB_KEY, &access_granted,
key->token))
{
err = WERR_ACCESS_DENIED;
goto trans_done;
}
/*
* Actually create the subkey
*/
err = create_reg_subkey(key->key, path);
if (!W_ERROR_IS_OK(err)) {
goto trans_done;
}
/*
* Now open the newly created key
*/
err = reg_openkey(ctx, key, path, desired_access, pkey);
if (W_ERROR_IS_OK(err) && (paction != NULL)) {
*paction = REG_CREATED_NEW_KEY;
}
trans_done:
if (W_ERROR_IS_OK(err)) {
err = regdb_transaction_commit();
if (!W_ERROR_IS_OK(err)) {
DEBUG(0, ("reg_createkey: Error committing transaction: %s\n", win_errstr(err)));
}
} else {
WERROR err1 = regdb_transaction_cancel();
if (!W_ERROR_IS_OK(err1)) {
DEBUG(0, ("reg_createkey: Error cancelling transaction: %s\n", win_errstr(err1)));
}
}
done:
TALLOC_FREE(mem_ctx);
return err;
}
static WERROR reg_deletekey_internal(TALLOC_CTX *mem_ctx,
struct registry_key *parent,
const char *path, bool lazy)
{
WERROR err;
char *name, *end;
struct registry_key *key;
name = talloc_strdup(mem_ctx, path);
if (name == NULL) {
err = WERR_NOT_ENOUGH_MEMORY;
goto done;
}
/* no subkeys - proceed with delete */
end = strrchr(name, '\\');
if (end != NULL) {
*end = '\0';
err = reg_openkey(mem_ctx, parent, name,
KEY_CREATE_SUB_KEY, &key);
W_ERROR_NOT_OK_GOTO_DONE(err);
parent = key;
name = end+1;
}
if (name[0] == '\0') {
err = WERR_INVALID_PARAMETER;
goto done;
}
err = delete_reg_subkey(parent->key, name, lazy);
done:
return err;
}
WERROR reg_deletekey(struct registry_key *parent, const char *path)
{
WERROR err;
struct registry_key *key;
TALLOC_CTX *mem_ctx = talloc_stackframe();
/* check if the key has subkeys */
err = reg_openkey(mem_ctx, parent, path, REG_KEY_READ, &key);
W_ERROR_NOT_OK_GOTO_DONE(err);
err = regdb_transaction_start();
if (!W_ERROR_IS_OK(err)) {
DEBUG(0, ("reg_deletekey: Error starting transaction: %s\n",
win_errstr(err)));
goto done;
}
err = fill_subkey_cache(key);
if (!W_ERROR_IS_OK(err)) {
goto trans_done;
}
if (regsubkey_ctr_numkeys(key->subkeys) > 0) {
err = WERR_ACCESS_DENIED;
goto trans_done;
}
err = reg_deletekey_internal(mem_ctx, parent, path, false);
trans_done:
if (W_ERROR_IS_OK(err)) {
err = regdb_transaction_commit();
if (!W_ERROR_IS_OK(err)) {
DEBUG(0, ("reg_deletekey: Error committing transaction: %s\n", win_errstr(err)));
}
} else {
WERROR err1 = regdb_transaction_cancel();
if (!W_ERROR_IS_OK(err1)) {
DEBUG(0, ("reg_deletekey: Error cancelling transaction: %s\n", win_errstr(err1)));
}
}
done:
TALLOC_FREE(mem_ctx);
return err;
}
WERROR reg_setvalue(struct registry_key *key, const char *name,
const struct registry_value *val)
{
struct regval_blob *existing;
WERROR err;
int res;
if (!(key->key->access_granted & KEY_SET_VALUE)) {
return WERR_ACCESS_DENIED;
}
err = regdb_transaction_start();
if (!W_ERROR_IS_OK(err)) {
DEBUG(0, ("reg_setvalue: Failed to start transaction: %s\n",
win_errstr(err)));
return err;
}
err = fill_value_cache(key);
if (!W_ERROR_IS_OK(err)) {
DEBUG(0, ("reg_setvalue: Error filling value cache: %s\n", win_errstr(err)));
goto done;
}
existing = regval_ctr_getvalue(key->values, name);
if ((existing != NULL) &&
(regval_size(existing) == val->data.length) &&
(memcmp(regval_data_p(existing), val->data.data,
val->data.length) == 0))
{
err = WERR_OK;
goto done;
}
res = regval_ctr_addvalue(key->values, name, val->type,
val->data.data, val->data.length);
if (res == 0) {
TALLOC_FREE(key->values);
err = WERR_NOT_ENOUGH_MEMORY;
goto done;
}
if (!store_reg_values(key->key, key->values)) {
TALLOC_FREE(key->values);
DEBUG(0, ("reg_setvalue: store_reg_values failed\n"));
err = WERR_REGISTRY_IO_FAILED;
goto done;
}
err = WERR_OK;
done:
if (W_ERROR_IS_OK(err)) {
err = regdb_transaction_commit();
if (!W_ERROR_IS_OK(err)) {
DEBUG(0, ("reg_setvalue: Error committing transaction: %s\n", win_errstr(err)));
}
} else {
WERROR err1 = regdb_transaction_cancel();
if (!W_ERROR_IS_OK(err1)) {
DEBUG(0, ("reg_setvalue: Error cancelling transaction: %s\n", win_errstr(err1)));
}
}
return err;
}
static WERROR reg_value_exists(struct registry_key *key, const char *name)
{
struct regval_blob *blob;
blob = regval_ctr_getvalue(key->values, name);
if (blob == NULL) {
return WERR_FILE_NOT_FOUND;
} else {
return WERR_OK;
}
}
WERROR reg_deletevalue(struct registry_key *key, const char *name)
{
WERROR err;
if (!(key->key->access_granted & KEY_SET_VALUE)) {
return WERR_ACCESS_DENIED;
}
err = regdb_transaction_start();
if (!W_ERROR_IS_OK(err)) {
DEBUG(0, ("reg_deletevalue: Failed to start transaction: %s\n",
win_errstr(err)));
return err;
}
err = fill_value_cache(key);
if (!W_ERROR_IS_OK(err)) {
DEBUG(0, ("reg_deletevalue; Error filling value cache: %s\n",
win_errstr(err)));
goto done;
}
err = reg_value_exists(key, name);
if (!W_ERROR_IS_OK(err)) {
goto done;
}
regval_ctr_delvalue(key->values, name);
if (!store_reg_values(key->key, key->values)) {
TALLOC_FREE(key->values);
err = WERR_REGISTRY_IO_FAILED;
DEBUG(0, ("reg_deletevalue: store_reg_values failed\n"));
goto done;
}
err = WERR_OK;
done:
if (W_ERROR_IS_OK(err)) {
err = regdb_transaction_commit();
if (!W_ERROR_IS_OK(err)) {
DEBUG(0, ("reg_deletevalue: Error committing transaction: %s\n", win_errstr(err)));
}
} else {
WERROR err1 = regdb_transaction_cancel();
if (!W_ERROR_IS_OK(err1)) {
DEBUG(0, ("reg_deletevalue: Error cancelling transaction: %s\n", win_errstr(err1)));
}
}
return err;
}
WERROR reg_getkeysecurity(TALLOC_CTX *mem_ctx, struct registry_key *key,
struct security_descriptor **psecdesc)
{
return regkey_get_secdesc(mem_ctx, key->key, psecdesc);
}
WERROR reg_setkeysecurity(struct registry_key *key,
struct security_descriptor *psecdesc)
{
return regkey_set_secdesc(key->key, psecdesc);
}
WERROR reg_getversion(uint32_t *version)
{
if (version == NULL) {
return WERR_INVALID_PARAMETER;
}
*version = 0x00000005; /* Windows 2000 registry API version */
return WERR_OK;
}
/**********************************************************************
* Higher level utility functions
**********************************************************************/
WERROR reg_deleteallvalues(struct registry_key *key)
{
WERROR err;
uint32_t i;
if (!(key->key->access_granted & KEY_SET_VALUE)) {
return WERR_ACCESS_DENIED;
}
if (!W_ERROR_IS_OK(err = fill_value_cache(key))) {
return err;
}
for (i=0; i < regval_ctr_numvals(key->values); i++) {
struct regval_blob *blob;
blob = regval_ctr_specific_value(key->values, i);
regval_ctr_delvalue(key->values, regval_name(blob));
}
if (!store_reg_values(key->key, key->values)) {
TALLOC_FREE(key->values);
return WERR_REGISTRY_IO_FAILED;
}
return WERR_OK;
}
/*
* Utility function to delete a registry key with all its subkeys.
* Note that reg_deletekey returns ACCESS_DENIED when called on a
* key that has subkeys.
*/
static WERROR reg_deletekey_recursive_internal(struct registry_key *parent,
const char *path,
bool del_key, bool lazy)
{
WERROR werr;
struct registry_key *key;
char *subkey_name = NULL;
uint32_t i;
TALLOC_CTX *mem_ctx = talloc_stackframe();
DEBUG(5, ("reg_deletekey_recursive_internal: deleting '%s' from '%s'\n",
path, parent->key->name));
/* recurse through subkeys first */
werr = reg_openkey(mem_ctx, parent, path, REG_KEY_ALL, &key);
if (!W_ERROR_IS_OK(werr)) {
DEBUG(3, ("reg_deletekey_recursive_internal: error opening "
"subkey '%s' of '%s': '%s'\n",
path, parent->key->name, win_errstr(werr)));
goto done;
}
werr = fill_subkey_cache(key);
W_ERROR_NOT_OK_GOTO_DONE(werr);
/*
* loop from top to bottom for performance:
* this way, we need to rehash the regsubkey containers less
*/
for (i = regsubkey_ctr_numkeys(key->subkeys) ; i > 0; i--) {
subkey_name = regsubkey_ctr_specific_key(key->subkeys, i-1);
werr = reg_deletekey_recursive_internal(key, subkey_name, true, del_key);
W_ERROR_NOT_OK_GOTO_DONE(werr);
}
if (del_key) {
/* now delete the actual key */
werr = reg_deletekey_internal(mem_ctx, parent, path, lazy);
}
done:
DEBUG(5, ("reg_deletekey_recursive_internal: done deleting '%s' from "
"'%s': %s\n",
path, parent->key->name, win_errstr(werr)));
TALLOC_FREE(mem_ctx);
return werr;
}
static WERROR reg_deletekey_recursive_trans(struct registry_key *parent,
const char *path,
bool del_key)
{
WERROR werr;
werr = regdb_transaction_start();
if (!W_ERROR_IS_OK(werr)) {
DEBUG(0, ("reg_deletekey_recursive_trans: "
"error starting transaction: %s\n",
win_errstr(werr)));
return werr;
}
werr = reg_deletekey_recursive_internal(parent, path, del_key, false);
if (!W_ERROR_IS_OK(werr)) {
WERROR werr2;
DEBUG(W_ERROR_EQUAL(werr, WERR_FILE_NOT_FOUND) ? 5 : 1,
(__location__ ": failed to delete key '%s' from key "
"'%s': %s\n", path, parent->key->name,
win_errstr(werr)));
werr2 = regdb_transaction_cancel();
if (!W_ERROR_IS_OK(werr2)) {
DEBUG(0, ("reg_deletekey_recursive_trans: "
"error cancelling transaction: %s\n",
win_errstr(werr2)));
/*
* return the original werr or the
* error from cancelling the transaction?
*/
}
} else {
werr = regdb_transaction_commit();
if (!W_ERROR_IS_OK(werr)) {
DEBUG(0, ("reg_deletekey_recursive_trans: "
"error committing transaction: %s\n",
win_errstr(werr)));
} else {
DEBUG(5, ("reg_deletekey_recursive_trans: deleted key '%s' from '%s'\n",
path, parent->key->name));
}
}
return werr;
}
WERROR reg_deletekey_recursive(struct registry_key *parent,
const char *path)
{
return reg_deletekey_recursive_trans(parent, path, true);
}
WERROR reg_deletesubkeys_recursive(struct registry_key *parent,
const char *path)
{
return reg_deletekey_recursive_trans(parent, path, false);
}
|