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
|
/*
Samba CIFS implementation
Registry backend for REGF files
Copyright (C) 2005 Jelmer Vernooij, jelmer@samba.org
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 2 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, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#include "includes.h"
#include "lib/registry/registry.h"
#include "system/filesys.h"
#include "system/time.h"
#include "lib/registry/tdr_regf.h"
#include "librpc/gen_ndr/ndr_security.h"
/* TODO:
* - Return error codes that make more sense
* - Locking
*/
/*
* Read HBIN blocks into memory
*/
struct regf_data {
int fd;
struct hbin_block **hbins;
struct regf_hdr *header;
};
static struct hbin_block *hbin_by_offset (const struct regf_data *data, uint32_t offset, uint32_t *rel_offset)
{
int i;
for (i = 0; data->hbins[i]; i++) {
if (offset >= data->hbins[i]->offset_from_first &&
offset < data->hbins[i]->offset_from_first+
data->hbins[i]->offset_to_next) {
if (rel_offset)
*rel_offset = offset - data->hbins[i]->offset_from_first - 0x20;
return data->hbins[i];
}
}
return NULL;
}
/*
* Validate a regf header
* For now, do nothing, but we should check the checksum
*/
static uint32_t regf_hdr_checksum(const uint8_t *buffer)
{
uint32_t checksum = 0, x;
int i;
for (i = 0; i < 0x01FB; i+= 4) {
x = IVAL(buffer, i);
checksum ^= x;
}
return checksum;
}
static DATA_BLOB hbin_get(const struct regf_data *data, uint32_t offset)
{
DATA_BLOB ret;
struct hbin_block *hbin;
uint32_t rel_offset;
ret.data = NULL;
ret.length = 0;
hbin = hbin_by_offset(data, offset, &rel_offset);
if (hbin == NULL) {
DEBUG(1, ("Can't find HBIN containing 0x%04x\n", offset));
return ret;
}
ret.length = IVAL(hbin->data, rel_offset);
if (!(ret.length & 0x80000000)) {
DEBUG(0, ("Trying to use dirty block at 0x%04x\n", offset));
return ret;
}
/* remove high bit */
ret.length = (ret.length ^ 0xffffffff) + 1;
ret.length -= 4; /* 4 bytes for the length... */
ret.data = hbin->data +
(offset - hbin->offset_from_first - 0x20) + 4;
return ret;
}
static BOOL hbin_get_tdr (struct regf_data *regf, uint32_t offset, TALLOC_CTX *ctx, tdr_pull_fn_t pull_fn, void *p)
{
struct tdr_pull pull;
ZERO_STRUCT(pull);
pull.data = hbin_get(regf, offset);
if (!pull.data.data) {
DEBUG(1, ("Unable to get data at 0x%04x\n", offset));
return False;
}
if (NT_STATUS_IS_ERR(pull_fn(&pull, ctx, p))) {
DEBUG(1, ("Error parsing record at 0x%04x using tdr\n", offset));
return False;
}
return True;
}
/* Allocate some new data */
static DATA_BLOB hbin_alloc (struct regf_data *data, uint32_t size, uint32_t *offset)
{
DATA_BLOB ret;
uint32_t rel_offset = -1; /* Relative offset ! */
struct hbin_block *hbin = NULL;
int i;
if (size == 0)
return data_blob(NULL, 0);
size += 4; /* Need to include uint32 for the length */
/* Allocate as a multiple of 8 */
size = (size + 7) & ~7;
ret.data = NULL;
ret.length = 0;
for (i = 0; (hbin = data->hbins[i]); i++) {
int j;
uint32_t my_size;
for (j = 0; j < hbin->offset_to_next-0x20; j+= my_size) {
uint32_t header = IVAL(hbin->data, j + 4);
my_size = IVAL(hbin->data, j);
if (my_size == 0x0) {
DEBUG(0, ("Invalid zero-length block! File is corrupt.\n"));
return ret;
}
if (my_size % 8 != 0) {
DEBUG(0, ("Encountered non-aligned block!\n"));
}
if (my_size & 0x80000000) { /* Used... */
my_size = (my_size ^ 0xffffffff) + 1;
} else if (my_size == size) { /* exact match */
rel_offset = j;
DEBUG(4, ("Found free block of exact size %d in middle of HBIN\n", size));
break;
} else if (my_size > size) { /* data will remain */
rel_offset = j;
SIVAL(hbin->data, rel_offset+size, my_size-size);
DEBUG(4, ("Found free block of size %d (needing %d) in middle of HBIN\n", my_size, size));
break;
}
if (header == 0xffffffff &&
hbin->offset_to_next-rel_offset >= size) {
rel_offset = j;
DEBUG(4, ("Found free block of size %d at end of HBIN\n", size));
/* Mark new free block size */
SIVAL(hbin->data, rel_offset+size,hbin->offset_to_next - rel_offset - size - 0x20);
SIVAL(hbin->data, rel_offset+size+0x4, 0xffffffff);
break;
}
if (header == 0xffffffff) {
break;
}
}
if (rel_offset != -1)
break;
}
/* No space available in previous hbins,
* allocate new one */
if (data->hbins[i] == NULL) {
DEBUG(4, ("No space available in other HBINs for block of size %d, allocating new HBIN\n", size));
data->hbins = talloc_realloc(data, data->hbins, struct hbin_block *, i+2);
hbin = talloc(data->hbins, struct hbin_block);
data->hbins[i] = hbin;
data->hbins[i+1] = NULL;
hbin->HBIN_ID = talloc_strdup(hbin, "hbin");
hbin->offset_from_first = (i == 0?0:data->hbins[i-1]->offset_from_first+data->hbins[i-1]->offset_to_next);
hbin->offset_to_next = 0x1000;
hbin->unknown[0] = 0;
hbin->unknown[0] = 0;
unix_to_nt_time(&hbin->last_change, time(NULL));
hbin->block_size = hbin->offset_to_next;
hbin->data = talloc_zero_array(hbin, uint8_t, hbin->block_size - 0x20);
rel_offset = 0x0;
SIVAL(hbin->data, size, hbin->block_size - size - 0x20);
SIVAL(hbin->data, size + 0x4, 0xffffffff);
}
/* Set size and mark as used */
SIVAL(hbin->data, rel_offset, size | 0x80000000);
ret.data = hbin->data + rel_offset + 0x4; /* Skip past length */
ret.length = size - 0x4;
if (offset) {
uint32_t new_rel_offset;
*offset = hbin->offset_from_first + rel_offset + 0x20;
SMB_ASSERT(hbin_by_offset(data, *offset, &new_rel_offset) == hbin);
SMB_ASSERT(new_rel_offset == rel_offset);
}
return ret;
}
/* Store a data blob. Return the offset at which it was stored */
static uint32_t hbin_store (struct regf_data *data, DATA_BLOB blob)
{
uint32_t ret;
DATA_BLOB dest = hbin_alloc(data, blob.length, &ret);
memcpy(dest.data, blob.data, blob.length);
return ret;
}
static uint32_t hbin_store_tdr (struct regf_data *data, tdr_push_fn_t push_fn, void *p)
{
struct tdr_push *push = talloc_zero(data, struct tdr_push);
uint32_t ret;
if (NT_STATUS_IS_ERR(push_fn(push, p))) {
DEBUG(0, ("Error during push\n"));
return -1;
}
ret = hbin_store(data, push->data);
talloc_free(push);
return ret;
}
/* Free existing data */
static void hbin_free (struct regf_data *data, uint32_t offset)
{
uint32_t size;
uint32_t rel_offset;
struct hbin_block *hbin;
SMB_ASSERT (offset > 0);
hbin = hbin_by_offset(data, offset, &rel_offset);
if (hbin == NULL)
return;
/* Get original size */
size = IVAL(hbin->data, rel_offset);
if (!(size & 0x80000000)) {
DEBUG(1, ("Trying to free already freed block at 0x%04x\n", offset));
return;
}
/* Mark block as free */
SIVAL(hbin->data, rel_offset, size &~ 0x80000000);
}
/* Store a data blob data was already stored, but hsa changed in size
* Will try to save it at the current location if possible, otherwise
* does a free + store */
static uint32_t hbin_store_resize (struct regf_data *data, uint32_t orig_offset, DATA_BLOB blob)
{
uint32_t rel_offset;
struct hbin_block *hbin = hbin_by_offset(data, orig_offset, &rel_offset);
uint32_t my_size;
uint32_t orig_size;
uint32_t needed_size;
uint32_t possible_size;
int i;
SMB_ASSERT(orig_offset > 0);
if (!hbin)
return hbin_store(data, blob);
/* Get original size */
orig_size = IVAL(hbin->data, rel_offset);
needed_size = blob.length + 4; /* Add uint32 containing length */
needed_size = (needed_size + 7) & ~7; /* Align */
/* Fits into current allocated block */
if (orig_size >= needed_size) {
memcpy(hbin->data + rel_offset + 0x4, blob.data, blob.length);
return orig_offset;
}
possible_size = orig_size;
/* Check if it can be combined with the next few free records */
for (i = rel_offset;
i < hbin->offset_to_next - 0x20;
i += my_size) {
uint32_t header;
if (IVAL(hbin->data, i) & 0x80000000) /* Used */
break;
my_size = IVAL(hbin->data, i);
header = IVAL(hbin->data, i + 4);
if (header == 0xffffffff) {
possible_size = hbin->offset_to_next - 0x20 - rel_offset;
} else if (my_size == 0x0) {
DEBUG(0, ("Invalid zero-length block! File is corrupt.\n"));
break;
} else {
possible_size += my_size;
}
if (possible_size >= blob.length) {
SIVAL(hbin->data, rel_offset, possible_size);
memcpy(hbin->data + rel_offset + 0x4, blob.data, blob.length);
return orig_offset;
}
if (header == 0xffffffff)
break;
}
hbin_free(data, orig_offset);
return hbin_store(data, blob);
}
static uint32_t hbin_store_tdr_resize (struct regf_data *regf, tdr_push_fn_t push_fn, uint32_t orig_offset, void *p)
{
struct tdr_push *push = talloc_zero(regf, struct tdr_push);
uint32_t ret;
if (NT_STATUS_IS_ERR(push_fn(push, p))) {
DEBUG(0, ("Error during push\n"));
return -1;
}
ret = hbin_store_resize(regf, orig_offset, push->data);
talloc_free(push);
return ret;
}
static WERROR regf_num_subkeys (const struct registry_key *key, uint32_t *count)
{
struct nk_block *nk = key->backend_data;
*count = nk->num_subkeys;
return WERR_OK;
}
static WERROR regf_num_values (const struct registry_key *key, uint32_t *count)
{
struct nk_block *nk = key->backend_data;
*count = nk->num_values;
return WERR_OK;
}
static struct registry_key *regf_get_key (TALLOC_CTX *ctx, struct regf_data *regf, uint32_t offset)
{
struct registry_key *ret;
struct nk_block *nk;
ret = talloc_zero(ctx, struct registry_key);
nk = talloc(ret, struct nk_block);
if (!hbin_get_tdr(regf, offset, nk, (tdr_pull_fn_t)tdr_pull_nk_block, nk)) {
DEBUG(0, ("Unable to find HBIN data for offset %d\n", offset));
return NULL;
}
if (strcmp(nk->header, "nk") != 0) {
DEBUG(0, ("Expected nk record, got %s\n", nk->header));
talloc_free(ret);
return NULL;
}
ret->name = talloc_steal(ret, nk->key_name);
ret->last_mod = nk->last_change;
if (nk->clsname_offset != -1) {
DATA_BLOB data = hbin_get(regf, nk->clsname_offset);
ret->class_name = talloc_strndup(ret, (char*)data.data, nk->clsname_length);
}
ret->backend_data = nk;
return ret;
}
static WERROR regf_get_value (TALLOC_CTX *ctx, const struct registry_key *key, int idx, struct registry_value **ret)
{
struct nk_block *nk = key->backend_data;
struct vk_block *vk;
struct regf_data *regf = key->hive->backend_data;
uint32_t vk_offset;
DATA_BLOB data;
if (idx >= nk->num_values)
return WERR_NO_MORE_ITEMS;
data = hbin_get(regf, nk->values_offset);
if (!data.data) {
DEBUG(0, ("Unable to find value list\n"));
return WERR_GENERAL_FAILURE;
}
if (data.length < nk->num_values * 4) {
DEBUG(1, ("Value counts mismatch\n"));
}
vk_offset = IVAL(data.data, idx * 4);
*ret = talloc_zero(ctx, struct registry_value);
if (!(*ret))
return WERR_NOMEM;
vk = talloc(*ret, struct vk_block);
if (!vk)
return WERR_NOMEM;
if (!hbin_get_tdr(regf, vk_offset, vk, (tdr_pull_fn_t)tdr_pull_vk_block, vk)) {
DEBUG(0, ("Unable to get VK block at %d\n", vk_offset));
return WERR_GENERAL_FAILURE;
}
(*ret)->name = talloc_steal(*ret, vk->data_name);
(*ret)->data_type = vk->data_type;
if (vk->data_length & 0x80000000) {
vk->data_length &=~0x80000000;
(*ret)->data.data = (uint8_t *)&vk->data_offset;
(*ret)->data.length = vk->data_length;
} else {
(*ret)->data = hbin_get(regf, vk->data_offset);
}
if ((*ret)->data.length < vk->data_length) {
DEBUG(1, ("Read data less then indicated data length!\n"));
}
return WERR_OK;
}
static WERROR regf_get_subkey (TALLOC_CTX *ctx, const struct registry_key *key, int idx, struct registry_key **ret)
{
DATA_BLOB data;
struct nk_block *nk = key->backend_data;
uint32_t key_off;
if (idx >= nk->num_subkeys)
return WERR_NO_MORE_ITEMS;
data = hbin_get(key->hive->backend_data, nk->subkeys_offset);
if (!data.data) {
DEBUG(0, ("Unable to find subkey list\n"));
return WERR_GENERAL_FAILURE;
}
if (!strncmp((char *)data.data, "li", 2)) {
DEBUG(4, ("Subkeys in LI list\n"));
SMB_ASSERT(0);
} else if (!strncmp((char *)data.data, "lf", 2)) {
struct lf_block lf;
struct tdr_pull pull;
DEBUG(10, ("Subkeys in LF list\n"));
ZERO_STRUCT(pull);
pull.data = data;
if (NT_STATUS_IS_ERR(tdr_pull_lf_block(&pull, nk, &lf))) {
DEBUG(0, ("Error parsing LF list\n"));
return WERR_GENERAL_FAILURE;
}
if (lf.key_count != nk->num_subkeys) {
DEBUG(0, ("Subkey counts don't match\n"));
return WERR_GENERAL_FAILURE;
}
key_off = lf.hr[idx].nk_off;
} else if (!strncmp((char *)data.data, "ri", 2)) {
DEBUG(4, ("Subkeys in RI list\n"));
SMB_ASSERT(0);
} else if (!strncmp((char *)data.data, "lh", 2)) {
DEBUG(4, ("Subkeys in LH list\n"));
SMB_ASSERT(0);
} else {
DEBUG(0, ("Unknown type for subkey list (0x%04x): %c%c\n", nk->subkeys_offset, data.data[0], data.data[1]));
return WERR_GENERAL_FAILURE;
}
*ret = regf_get_key (ctx, key->hive->backend_data, key_off);
return WERR_OK;
}
static WERROR regf_set_sec_desc (const struct registry_key *key, const struct security_descriptor *sec_desc)
{
/* FIXME */
return WERR_NOT_SUPPORTED;
}
static WERROR regf_get_sec_desc(TALLOC_CTX *ctx, const struct registry_key *key, struct security_descriptor **sd)
{
struct nk_block *nk = key->backend_data;
struct sk_block sk;
struct regf_data *regf = key->hive->backend_data;
DATA_BLOB data;
if (!hbin_get_tdr(regf, nk->sk_offset, ctx, (tdr_pull_fn_t) tdr_pull_sk_block, &sk)) {
DEBUG(0, ("Unable to find security descriptor\n"));
return WERR_GENERAL_FAILURE;
}
if (strcmp(sk.header, "sk") != 0) {
DEBUG(0, ("Expected 'sk', got '%s'\n", sk.header));
return WERR_GENERAL_FAILURE;
}
*sd = talloc(ctx, struct security_descriptor);
if (!*sd)
return WERR_NOMEM;
data.data = sk.sec_desc;
data.length = sk.rec_size;
if (NT_STATUS_IS_ERR(ndr_pull_struct_blob(&data, ctx, *sd, (ndr_pull_flags_fn_t)ndr_pull_security_descriptor))) {
DEBUG(0, ("Error parsing security descriptor\n"));
return WERR_GENERAL_FAILURE;
}
return WERR_OK;
}
static uint32_t lf_add_entry (struct regf_data *regf, uint32_t list_offset, const char *name, uint32_t key_offset)
{
uint32_t ret;
struct lf_block lf;
/* Add to subkeys list */
if (list_offset == -1) { /* Need to create subkeys list */
lf.header = "lf";
lf.key_count = 0;
lf.hr = NULL;
} else {
if (!hbin_get_tdr(regf, list_offset, regf, (tdr_pull_fn_t)tdr_pull_lf_block, &lf)) {
DEBUG(0, ("Can't get subkeys list\n"));
return -1;
}
}
lf.hr = talloc_realloc(regf, lf.hr, struct hash_record, lf.key_count+1);
lf.hr[lf.key_count].nk_off = key_offset;
lf.hr[lf.key_count].hash = talloc_strndup(regf, name, 4);
lf.key_count++;
ret = hbin_store_tdr_resize(regf, (tdr_push_fn_t)tdr_push_lf_block, list_offset, &lf);
talloc_free(lf.hr);
return ret;
}
static WERROR regf_del_value (const struct registry_key *parent, const char *name)
{
/* FIXME */
return WERR_NOT_SUPPORTED;
}
static WERROR regf_del_key (const struct registry_key *parent, const char *name)
{
struct nk_block *nk = parent->backend_data;
SMB_ASSERT(nk);
if (nk->subkeys_offset == -1)
return WERR_BADFILE;
/* FIXME */
return WERR_NOT_SUPPORTED;
}
static WERROR regf_add_key (TALLOC_CTX *ctx, const struct registry_key *parent, const char *name, uint32_t access_mask, struct security_descriptor *sec_desc, struct registry_key **ret)
{
struct nk_block *parent_nk = parent->backend_data, nk;
struct regf_data *regf = parent->hive->backend_data;
uint32_t offset;
nk.header = "nk";
nk.type = REG_SUB_KEY;
unix_to_nt_time(&nk.last_change, time(NULL));
nk.uk1 = 0;
nk.parent_offset = 0; /* FIXME */
nk.num_subkeys = 0;
nk.uk2 = 0;
nk.subkeys_offset = -1;
nk.unknown_offset = -1;
nk.num_values = 0;
nk.sk_offset = 0;
memset(nk.unk3, 0, 5);
nk.clsname_offset = -1;
nk.clsname_length = 0;
nk.key_name = name;
offset = hbin_store_tdr(regf, (tdr_push_fn_t) tdr_push_nk_block, &nk);
parent_nk->subkeys_offset = lf_add_entry(regf, parent_nk->subkeys_offset, name, nk.parent_offset);
parent_nk->num_subkeys++;
hbin_store_tdr_resize(regf, (tdr_push_fn_t) tdr_push_nk_block, nk.parent_offset, parent_nk);
*ret = regf_get_key(ctx, regf, offset);
/* FIXME: Set sec desc ! */
return WERR_OK;
}
static WERROR regf_set_value (const struct registry_key *key, const char *name, uint32_t type, const DATA_BLOB data)
{
/* FIXME */
return WERR_NOT_SUPPORTED;
}
#if 0 /* Unused */
static WERROR regf_save_hbin(struct registry_hive *hive, struct hbin_block *hbin)
{
struct regf_data *regf = hive->backend_data;
/* go to right offset */
if (lseek(regf->fd, SEEK_SET, regf->header->data_offset + hbin->offset_from_first) == -1) {
DEBUG(0, ("Error lseeking in regf file\n"));
return WERR_GENERAL_FAILURE;
}
if (NT_STATUS_IS_ERR(tdr_push_to_fd(regf->fd, (tdr_push_fn_t)tdr_push_hbin_block, hbin))) {
DEBUG(0, ("Error writing HBIN block\n"));
return WERR_GENERAL_FAILURE;
}
return WERR_OK;
}
#endif
static WERROR nt_open_hive (struct registry_hive *h, struct registry_key **key)
{
struct regf_data *regf;
struct regf_hdr *regf_hdr;
struct tdr_pull pull;
int i;
regf = (struct regf_data *)talloc_zero(h, struct regf_data);
h->backend_data = regf;
DEBUG(5, ("Attempting to load registry file\n"));
/* Get the header */
regf->fd = open(h->location, O_RDWR);
if (regf->fd == -1) {
DEBUG(0,("Could not load file: %s, %s\n", h->location,
strerror(errno)));
return WERR_GENERAL_FAILURE;
}
ZERO_STRUCT(pull);
pull.data.data = (uint8_t*)fd_load(regf->fd, &pull.data.length, regf);
if (pull.data.data == NULL) {
DEBUG(0, ("Error reading data\n"));
return WERR_GENERAL_FAILURE;
}
regf_hdr = talloc(regf, struct regf_hdr);
if (NT_STATUS_IS_ERR(tdr_pull_regf_hdr(&pull, regf_hdr, regf_hdr))) {
return WERR_GENERAL_FAILURE;
}
regf->header = regf_hdr;
if (strcmp(regf_hdr->REGF_ID, "regf") != 0) {
DEBUG(0, ("Unrecognized NT registry header id: %s, %s\n",
regf_hdr->REGF_ID, h->location));
}
DEBUG(1, ("Registry '%s' read. Version %d.%d.%d.%d\n",
regf_hdr->description, regf_hdr->version.major,
regf_hdr->version.minor, regf_hdr->version.release,
regf_hdr->version.build));
/*
* Validate the header ...
*/
if (regf_hdr_checksum(pull.data.data) != regf_hdr->chksum) {
DEBUG(0, ("Registry file checksum error: %s: %d,%d\n",
h->location, regf_hdr->chksum, regf_hdr_checksum(pull.data.data)));
return WERR_GENERAL_FAILURE;
}
pull.offset = 0x1000;
i = 0;
/* Read in all hbin blocks */
regf->hbins = talloc_array(regf, struct hbin_block *, 1);
regf->hbins[0] = NULL;
while (pull.offset < pull.data.length) {
struct hbin_block *hbin = talloc(regf->hbins, struct hbin_block);
if (NT_STATUS_IS_ERR(tdr_pull_hbin_block(&pull, hbin, hbin))) {
DEBUG(0, ("[%d] Error parsing HBIN block\n", i));
return WERR_FOOBAR;
}
if (strcmp(hbin->HBIN_ID, "hbin") != 0) {
DEBUG(0, ("[%d] Expected 'hbin', got '%s'\n", i, hbin->HBIN_ID));
return WERR_FOOBAR;
}
regf->hbins[i] = hbin;
i++;
regf->hbins = talloc_realloc(regf, regf->hbins, struct hbin_block *, i+2);
regf->hbins[i] = NULL;
}
DEBUG(1, ("%d HBIN blocks read\n", i));
*key = regf_get_key(h, regf, 0x20);
return WERR_OK;
}
static struct hive_operations reg_backend_nt4 = {
.name = "nt4",
.open_hive = nt_open_hive,
.num_subkeys = regf_num_subkeys,
.num_values = regf_num_values,
.get_subkey_by_index = regf_get_subkey,
.get_value_by_index = regf_get_value,
.key_get_sec_desc = regf_get_sec_desc,
.key_set_sec_desc = regf_set_sec_desc,
.add_key = regf_add_key,
.set_value = regf_set_value,
.del_key = regf_del_key,
.del_value = regf_del_value,
};
NTSTATUS registry_nt4_init(void)
{
return registry_register(®_backend_nt4);
}
|