1 /* hivex - Windows Registry "hive" extraction library.
2 * Copyright (C) 2009-2010 Red Hat Inc.
3 * Derived from code by Petter Nordahl-Hagen under a compatible license:
4 * Copyright (c) 1997-2007 Petter Nordahl-Hagen.
5 * Derived from code by Markus Stephany under a compatible license:
6 * Copyright (c) 2000-2004, Markus Stephany.
8 * This library is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License as published by the Free Software Foundation;
11 * version 2.1 of the License.
13 * This library is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Lesser General Public License for more details.
18 * See file LICENSE for the full license.
37 #include "full-read.h"
38 #include "full-write.h"
44 #define STREQ(a,b) (strcmp((a),(b)) == 0)
45 #define STRCASEEQ(a,b) (strcasecmp((a),(b)) == 0)
46 //#define STRNEQ(a,b) (strcmp((a),(b)) != 0)
47 //#define STRCASENEQ(a,b) (strcasecmp((a),(b)) != 0)
48 #define STREQLEN(a,b,n) (strncmp((a),(b),(n)) == 0)
49 //#define STRCASEEQLEN(a,b,n) (strncasecmp((a),(b),(n)) == 0)
50 //#define STRNEQLEN(a,b,n) (strncmp((a),(b),(n)) != 0)
51 //#define STRCASENEQLEN(a,b,n) (strncasecmp((a),(b),(n)) != 0)
52 //#define STRPREFIX(a,b) (strncmp((a),(b),strlen((b))) == 0)
55 #include "byte_conversions.h"
57 static char *windows_utf16_to_utf8 (/* const */ char *input, size_t len);
66 /* Registry file, memory mapped if read-only, or malloc'd if writing. */
69 struct ntreg_header *hdr;
72 /* Use a bitmap to store which file offsets are valid (point to a
73 * used block). We only need to store 1 bit per 32 bits of the file
74 * (because blocks are 4-byte aligned). We found that the average
75 * block size in a registry file is ~50 bytes. So roughly 1 in 12
76 * bits in the bitmap will be set, making it likely a more efficient
77 * structure than a hash table.
80 #define BITMAP_SET(bitmap,off) (bitmap[(off)>>5] |= 1 << (((off)>>2)&7))
81 #define BITMAP_CLR(bitmap,off) (bitmap[(off)>>5] &= ~ (1 << (((off)>>2)&7)))
82 #define BITMAP_TST(bitmap,off) (bitmap[(off)>>5] & (1 << (((off)>>2)&7)))
83 #define IS_VALID_BLOCK(h,off) \
84 (((off) & 3) == 0 && \
86 (off) < (h)->size && \
87 BITMAP_TST((h)->bitmap,(off)))
89 /* Fields from the header, extracted from little-endianness hell. */
90 size_t rootoffs; /* Root key offset (always an nk-block). */
91 size_t endpages; /* Offset of end of pages. */
94 size_t endblocks; /* Offset to next block allocation (0
95 if not allocated anything yet). */
98 /* NB. All fields are little endian. */
100 char magic[4]; /* "regf" */
103 char last_modified[8];
104 uint32_t major_ver; /* 1 */
105 uint32_t minor_ver; /* 3 */
106 uint32_t unknown5; /* 0 */
107 uint32_t unknown6; /* 1 */
108 uint32_t offset; /* offset of root key record - 4KB */
109 uint32_t blocks; /* pointer AFTER last hbin in file - 4KB */
110 uint32_t unknown7; /* 1 */
112 char name[64]; /* original file name of hive */
113 char unknown_guid1[16];
114 char unknown_guid2[16];
117 char unknown_guid3[16];
122 uint32_t csum; /* checksum: xor of dwords 0-0x1fb. */
124 char unknown11[3528];
126 char unknown_guid4[16];
127 char unknown_guid5[16];
128 char unknown_guid6[16];
132 } __attribute__((__packed__));
134 struct ntreg_hbin_page {
135 char magic[4]; /* "hbin" */
136 uint32_t offset_first; /* offset from 1st block */
137 uint32_t page_size; /* size of this page (multiple of 4KB) */
139 /* Linked list of blocks follows here. */
140 } __attribute__((__packed__));
142 struct ntreg_hbin_block {
143 int32_t seg_len; /* length of this block (-ve for used block) */
144 char id[2]; /* the block type (eg. "nk" for nk record) */
145 /* Block data follows here. */
146 } __attribute__((__packed__));
148 #define BLOCK_ID_EQ(h,offs,eqid) \
149 (STREQLEN (((struct ntreg_hbin_block *)((h)->addr + (offs)))->id, (eqid), 2))
152 block_len (hive_h *h, size_t blkoff, int *used)
154 struct ntreg_hbin_block *block;
155 block = (struct ntreg_hbin_block *) (h->addr + blkoff);
157 int32_t len = le32toh (block->seg_len);
168 struct ntreg_nk_record {
169 int32_t seg_len; /* length (always -ve because used) */
170 char id[2]; /* "nk" */
174 uint32_t parent; /* offset of owner/parent */
175 uint32_t nr_subkeys; /* number of subkeys */
176 uint32_t nr_subkeys_volatile;
177 uint32_t subkey_lf; /* lf record containing list of subkeys */
178 uint32_t subkey_lf_volatile;
179 uint32_t nr_values; /* number of values */
180 uint32_t vallist; /* value-list record */
181 uint32_t sk; /* offset of sk-record */
182 uint32_t classname; /* offset of classname record */
183 uint16_t max_subkey_name_len; /* maximum length of a subkey name in bytes
184 if the subkey was reencoded as UTF-16LE */
187 uint32_t max_vk_name_len; /* maximum length of any vk name in bytes
188 if the name was reencoded as UTF-16LE */
189 uint32_t max_vk_data_len; /* maximum length of any vk data in bytes */
191 uint16_t name_len; /* length of name */
192 uint16_t classname_len; /* length of classname */
193 char name[1]; /* name follows here */
194 } __attribute__((__packed__));
196 struct ntreg_lf_record {
198 char id[2]; /* "lf" */
199 uint16_t nr_keys; /* number of keys in this record */
201 uint32_t offset; /* offset of nk-record for this subkey */
202 char hash[4]; /* hash of subkey name */
204 } __attribute__((__packed__));
206 struct ntreg_ri_record {
208 char id[2]; /* "ri" */
209 uint16_t nr_offsets; /* number of pointers to lh records */
210 uint32_t offset[1]; /* list of pointers to lh records */
211 } __attribute__((__packed__));
213 /* This has no ID header. */
214 struct ntreg_value_list {
216 uint32_t offset[1]; /* list of pointers to vk records */
217 } __attribute__((__packed__));
219 struct ntreg_vk_record {
220 int32_t seg_len; /* length (always -ve because used) */
221 char id[2]; /* "vk" */
222 uint16_t name_len; /* length of name */
223 /* length of the data:
224 * If data_len is <= 4, then it's stored inline.
225 * If data_len is 0x80000000, then it's an inline dword.
226 * Top bit may be set or not set at random.
229 uint32_t data_offset; /* pointer to the data (or data if inline) */
230 uint32_t data_type; /* type of the data */
231 uint16_t flags; /* bit 0 set => key name ASCII,
232 bit 0 clr => key name UTF-16.
233 Only seen ASCII here in the wild.
234 NB: this is CLEAR for default key. */
236 char name[1]; /* key name follows here */
237 } __attribute__((__packed__));
240 header_checksum (const hive_h *h)
242 uint32_t *daddr = (uint32_t *) h->addr;
246 for (i = 0; i < 0x1fc / 4; ++i) {
247 sum ^= le32toh (*daddr);
255 hivex_open (const char *filename, int flags)
259 assert (sizeof (struct ntreg_header) == 0x1000);
260 assert (offsetof (struct ntreg_header, csum) == 0x1fc);
262 h = calloc (1, sizeof *h);
266 h->msglvl = flags & HIVEX_OPEN_MSGLVL_MASK;
268 const char *debug = getenv ("HIVEX_DEBUG");
269 if (debug && STREQ (debug, "1"))
273 fprintf (stderr, "hivex_open: created handle %p\n", h);
275 h->writable = !!(flags & HIVEX_OPEN_WRITE);
276 h->filename = strdup (filename);
277 if (h->filename == NULL)
280 h->fd = open (filename, O_RDONLY | O_CLOEXEC);
285 if (fstat (h->fd, &statbuf) == -1)
288 h->size = statbuf.st_size;
291 h->addr = mmap (NULL, h->size, PROT_READ, MAP_SHARED, h->fd, 0);
292 if (h->addr == MAP_FAILED)
296 fprintf (stderr, "hivex_open: mapped file at %p\n", h->addr);
298 h->addr = malloc (h->size);
302 if (full_read (h->fd, h->addr, h->size) < h->size)
307 if (h->hdr->magic[0] != 'r' ||
308 h->hdr->magic[1] != 'e' ||
309 h->hdr->magic[2] != 'g' ||
310 h->hdr->magic[3] != 'f') {
311 fprintf (stderr, "hivex: %s: not a Windows NT Registry hive file\n",
317 /* Check major version. */
318 uint32_t major_ver = le32toh (h->hdr->major_ver);
319 if (major_ver != 1) {
321 "hivex: %s: hive file major version %" PRIu32 " (expected 1)\n",
322 filename, major_ver);
327 h->bitmap = calloc (1 + h->size / 32, 1);
328 if (h->bitmap == NULL)
331 /* Header checksum. */
332 uint32_t sum = header_checksum (h);
333 if (sum != le32toh (h->hdr->csum)) {
334 fprintf (stderr, "hivex: %s: bad checksum in hive header\n", filename);
339 if (h->msglvl >= 2) {
340 char *name = windows_utf16_to_utf8 (h->hdr->name, 64);
343 "hivex_open: header fields:\n"
344 " file version %" PRIu32 ".%" PRIu32 "\n"
345 " sequence nos %" PRIu32 " %" PRIu32 "\n"
346 " (sequences nos should match if hive was synched at shutdown)\n"
347 " original file name %s\n"
348 " (only 32 chars are stored, name is probably truncated)\n"
349 " root offset 0x%x + 0x1000\n"
350 " end of last page 0x%x + 0x1000 (total file size 0x%zx)\n"
351 " checksum 0x%x (calculated 0x%x)\n",
352 major_ver, le32toh (h->hdr->minor_ver),
353 le32toh (h->hdr->sequence1), le32toh (h->hdr->sequence2),
354 name ? name : "(conversion failed)",
355 le32toh (h->hdr->offset),
356 le32toh (h->hdr->blocks), h->size,
357 le32toh (h->hdr->csum), sum);
361 h->rootoffs = le32toh (h->hdr->offset) + 0x1000;
362 h->endpages = le32toh (h->hdr->blocks) + 0x1000;
365 fprintf (stderr, "hivex_open: root offset = 0x%zx\n", h->rootoffs);
367 /* We'll set this flag when we see a block with the root offset (ie.
370 int seen_root_block = 0, bad_root_block = 0;
372 /* Collect some stats. */
373 size_t pages = 0; /* Number of hbin pages read. */
374 size_t smallest_page = SIZE_MAX, largest_page = 0;
375 size_t blocks = 0; /* Total number of blocks found. */
376 size_t smallest_block = SIZE_MAX, largest_block = 0, blocks_bytes = 0;
377 size_t used_blocks = 0; /* Total number of used blocks found. */
378 size_t used_size = 0; /* Total size (bytes) of used blocks. */
380 /* Read the pages and blocks. The aim here is to be robust against
381 * corrupt or malicious registries. So we make sure the loops
382 * always make forward progress. We add the address of each block
383 * we read to a hash table so pointers will only reference the start
387 struct ntreg_hbin_page *page;
388 for (off = 0x1000; off < h->size; off += le32toh (page->page_size)) {
389 if (off >= h->endpages)
392 page = (struct ntreg_hbin_page *) (h->addr + off);
393 if (page->magic[0] != 'h' ||
394 page->magic[1] != 'b' ||
395 page->magic[2] != 'i' ||
396 page->magic[3] != 'n') {
397 fprintf (stderr, "hivex: %s: trailing garbage at end of file (at 0x%zx, after %zu pages)\n",
398 filename, off, pages);
403 size_t page_size = le32toh (page->page_size);
405 fprintf (stderr, "hivex_open: page at 0x%zx, size %zu\n", off, page_size);
407 if (page_size < smallest_page) smallest_page = page_size;
408 if (page_size > largest_page) largest_page = page_size;
410 if (page_size <= sizeof (struct ntreg_hbin_page) ||
411 (page_size & 0x0fff) != 0) {
412 fprintf (stderr, "hivex: %s: page size %zu at 0x%zx, bad registry\n",
413 filename, page_size, off);
418 /* Read the blocks in this page. */
420 struct ntreg_hbin_block *block;
422 for (blkoff = off + 0x20;
423 blkoff < off + page_size;
427 int is_root = blkoff == h->rootoffs;
431 block = (struct ntreg_hbin_block *) (h->addr + blkoff);
433 seg_len = block_len (h, blkoff, &used);
434 if (seg_len <= 4 || (seg_len & 3) != 0) {
435 fprintf (stderr, "hivex: %s: block size %" PRIu32 " at 0x%zx, bad registry\n",
436 filename, le32toh (block->seg_len), blkoff);
442 fprintf (stderr, "hivex_open: %s block id %d,%d at 0x%zx size %zu%s\n",
443 used ? "used" : "free", block->id[0], block->id[1], blkoff,
444 seg_len, is_root ? " (root)" : "");
446 blocks_bytes += seg_len;
447 if (seg_len < smallest_block) smallest_block = seg_len;
448 if (seg_len > largest_block) largest_block = seg_len;
450 if (is_root && !used)
455 used_size += seg_len;
457 /* Root block must be an nk-block. */
458 if (is_root && (block->id[0] != 'n' || block->id[1] != 'k'))
461 /* Note this blkoff is a valid address. */
462 BITMAP_SET (h->bitmap, blkoff);
467 if (!seen_root_block) {
468 fprintf (stderr, "hivex: %s: no root block found\n", filename);
473 if (bad_root_block) {
474 fprintf (stderr, "hivex: %s: bad root block (free or not nk)\n", filename);
481 "hivex_open: successfully read Windows Registry hive file:\n"
482 " pages: %zu [sml: %zu, lge: %zu]\n"
483 " blocks: %zu [sml: %zu, avg: %zu, lge: %zu]\n"
484 " blocks used: %zu\n"
485 " bytes used: %zu\n",
486 pages, smallest_page, largest_page,
487 blocks, smallest_block, blocks_bytes / blocks, largest_block,
488 used_blocks, used_size);
496 if (h->addr && h->size && h->addr != MAP_FAILED) {
498 munmap (h->addr, h->size);
512 hivex_close (hive_h *h)
518 munmap (h->addr, h->size);
528 /*----------------------------------------------------------------------
533 hivex_root (hive_h *h)
535 hive_node_h ret = h->rootoffs;
536 if (!IS_VALID_BLOCK (h, ret)) {
544 hivex_node_name (hive_h *h, hive_node_h node)
546 if (!IS_VALID_BLOCK (h, node) || !BLOCK_ID_EQ (h, node, "nk")) {
551 struct ntreg_nk_record *nk = (struct ntreg_nk_record *) (h->addr + node);
553 /* AFAIK the node name is always plain ASCII, so no conversion
554 * to UTF-8 is necessary. However we do need to nul-terminate
558 /* nk->name_len is unsigned, 16 bit, so this is safe ... However
559 * we have to make sure the length doesn't exceed the block length.
561 size_t len = le16toh (nk->name_len);
562 size_t seg_len = block_len (h, node, NULL);
563 if (sizeof (struct ntreg_nk_record) + len - 1 > seg_len) {
565 fprintf (stderr, "hivex_node_name: returning EFAULT because node name is too long (%zu, %zu)\n",
571 char *ret = malloc (len + 1);
574 memcpy (ret, nk->name, len);
580 /* I think the documentation for the sk and classname fields in the nk
581 * record is wrong, or else the offset field is in the wrong place.
582 * Otherwise this makes no sense. Disabled this for now -- it's not
583 * useful for reading the registry anyway.
587 hivex_node_security (hive_h *h, hive_node_h node)
589 if (!IS_VALID_BLOCK (h, node) || !BLOCK_ID_EQ (h, node, "nk")) {
594 struct ntreg_nk_record *nk = (struct ntreg_nk_record *) (h->addr + node);
596 hive_node_h ret = le32toh (nk->sk);
598 if (!IS_VALID_BLOCK (h, ret)) {
606 hivex_node_classname (hive_h *h, hive_node_h node)
608 if (!IS_VALID_BLOCK (h, node) || !BLOCK_ID_EQ (h, node, "nk")) {
613 struct ntreg_nk_record *nk = (struct ntreg_nk_record *) (h->addr + node);
615 hive_node_h ret = le32toh (nk->classname);
617 if (!IS_VALID_BLOCK (h, ret)) {
625 /* Structure for returning 0-terminated lists of offsets (nodes,
635 init_offset_list (struct offset_list *list)
639 list->offsets = NULL;
642 #define INIT_OFFSET_LIST(name) \
643 struct offset_list name; \
644 init_offset_list (&name)
646 /* Preallocates the offset_list, but doesn't make the contents longer. */
648 grow_offset_list (struct offset_list *list, size_t alloc)
650 assert (alloc >= list->len);
651 size_t *p = realloc (list->offsets, alloc * sizeof (size_t));
660 add_to_offset_list (struct offset_list *list, size_t offset)
662 if (list->len >= list->alloc) {
663 if (grow_offset_list (list, list->alloc ? list->alloc * 2 : 4) == -1)
666 list->offsets[list->len] = offset;
672 free_offset_list (struct offset_list *list)
674 free (list->offsets);
678 return_offset_list (struct offset_list *list)
680 if (add_to_offset_list (list, 0) == -1)
682 return list->offsets; /* caller frees */
685 /* Iterate over children, returning child nodes and intermediate blocks. */
687 get_children (hive_h *h, hive_node_h node,
688 hive_node_h **children_ret, size_t **blocks_ret)
690 if (!IS_VALID_BLOCK (h, node) || !BLOCK_ID_EQ (h, node, "nk")) {
695 struct ntreg_nk_record *nk = (struct ntreg_nk_record *) (h->addr + node);
697 size_t nr_subkeys_in_nk = le32toh (nk->nr_subkeys);
699 INIT_OFFSET_LIST (children);
700 INIT_OFFSET_LIST (blocks);
702 /* Deal with the common "no subkeys" case quickly. */
703 if (nr_subkeys_in_nk == 0)
706 /* Arbitrarily limit the number of subkeys we will ever deal with. */
707 if (nr_subkeys_in_nk > 1000000) {
712 /* Preallocate space for the children. */
713 if (grow_offset_list (&children, nr_subkeys_in_nk) == -1)
716 /* The subkey_lf field can point either to an lf-record, which is
717 * the common case, or if there are lots of subkeys, to an
720 size_t subkey_lf = le32toh (nk->subkey_lf);
722 if (!IS_VALID_BLOCK (h, subkey_lf)) {
724 fprintf (stderr, "hivex_node_children: returning EFAULT because subkey_lf is not a valid block (%zu)\n",
730 if (add_to_offset_list (&blocks, subkey_lf) == -1)
733 struct ntreg_hbin_block *block =
734 (struct ntreg_hbin_block *) (h->addr + subkey_lf);
736 /* Points to lf-record? (Note, also "lh" but that is basically the
737 * same as "lf" as far as we are concerned here).
739 if (block->id[0] == 'l' && (block->id[1] == 'f' || block->id[1] == 'h')) {
740 struct ntreg_lf_record *lf = (struct ntreg_lf_record *) block;
742 /* Check number of subkeys in the nk-record matches number of subkeys
745 size_t nr_subkeys_in_lf = le16toh (lf->nr_keys);
748 fprintf (stderr, "hivex_node_children: nr_subkeys_in_nk = %zu, nr_subkeys_in_lf = %zu\n",
749 nr_subkeys_in_nk, nr_subkeys_in_lf);
751 if (nr_subkeys_in_nk != nr_subkeys_in_lf) {
756 size_t len = block_len (h, subkey_lf, NULL);
757 if (8 + nr_subkeys_in_lf * 8 > len) {
759 fprintf (stderr, "hivex_node_children: returning EFAULT because too many subkeys (%zu, %zu)\n",
760 nr_subkeys_in_lf, len);
766 for (i = 0; i < nr_subkeys_in_lf; ++i) {
767 hive_node_h subkey = le32toh (lf->keys[i].offset);
769 if (!IS_VALID_BLOCK (h, subkey)) {
771 fprintf (stderr, "hivex_node_children: returning EFAULT because subkey is not a valid block (0x%zx)\n",
776 if (add_to_offset_list (&children, subkey) == -1)
781 /* Points to ri-record? */
782 else if (block->id[0] == 'r' && block->id[1] == 'i') {
783 struct ntreg_ri_record *ri = (struct ntreg_ri_record *) block;
785 size_t nr_offsets = le16toh (ri->nr_offsets);
787 /* Count total number of children. */
789 for (i = 0; i < nr_offsets; ++i) {
790 hive_node_h offset = ri->offset[i];
792 if (!IS_VALID_BLOCK (h, offset)) {
794 fprintf (stderr, "hivex_node_children: returning EFAULT because ri-offset is not a valid block (0x%zx)\n",
799 if (!BLOCK_ID_EQ (h, offset, "lf") && !BLOCK_ID_EQ (h, offset, "lh")) {
804 if (add_to_offset_list (&blocks, offset) == -1)
807 struct ntreg_lf_record *lf =
808 (struct ntreg_lf_record *) (h->addr + offset);
810 count += le16toh (lf->nr_keys);
814 fprintf (stderr, "hivex_node_children: nr_subkeys_in_nk = %zu, counted = %zu\n",
815 nr_subkeys_in_nk, count);
817 if (nr_subkeys_in_nk != count) {
822 /* Copy list of children. Note nr_subkeys_in_nk is limited to
823 * something reasonable above.
825 for (i = 0; i < nr_offsets; ++i) {
826 hive_node_h offset = ri->offset[i];
828 if (!IS_VALID_BLOCK (h, offset)) {
830 fprintf (stderr, "hivex_node_children: returning EFAULT because ri-offset is not a valid block (0x%zx)\n",
835 if (!BLOCK_ID_EQ (h, offset, "lf") && !BLOCK_ID_EQ (h, offset, "lh")) {
840 struct ntreg_lf_record *lf =
841 (struct ntreg_lf_record *) (h->addr + offset);
844 for (j = 0; j < le16toh (lf->nr_keys); ++j) {
845 hive_node_h subkey = le32toh (lf->keys[j].offset);
847 if (!IS_VALID_BLOCK (h, subkey)) {
849 fprintf (stderr, "hivex_node_children: returning EFAULT because indirect subkey is not a valid block (0x%zx)\n",
854 if (add_to_offset_list (&children, subkey) == -1)
860 /* else not supported, set errno and fall through */
863 free_offset_list (&children);
864 free_offset_list (&blocks);
868 *children_ret = return_offset_list (&children);
869 *blocks_ret = return_offset_list (&blocks);
870 if (!*children_ret || !*blocks_ret)
876 hivex_node_children (hive_h *h, hive_node_h node)
878 hive_node_h *children;
881 if (get_children (h, node, &children, &blocks) == -1)
888 /* Very inefficient, but at least having a separate API call
889 * allows us to make it more efficient in future.
892 hivex_node_get_child (hive_h *h, hive_node_h node, const char *nname)
894 hive_node_h *children = NULL;
898 children = hivex_node_children (h, node);
899 if (!children) goto error;
902 for (i = 0; children[i] != 0; ++i) {
903 name = hivex_node_name (h, children[i]);
904 if (!name) goto error;
905 if (STRCASEEQ (name, nname)) {
909 free (name); name = NULL;
919 hivex_node_parent (hive_h *h, hive_node_h node)
921 if (!IS_VALID_BLOCK (h, node) || !BLOCK_ID_EQ (h, node, "nk")) {
926 struct ntreg_nk_record *nk = (struct ntreg_nk_record *) (h->addr + node);
928 hive_node_h ret = le32toh (nk->parent);
930 if (!IS_VALID_BLOCK (h, ret)) {
932 fprintf (stderr, "hivex_node_parent: returning EFAULT because parent is not a valid block (0x%zx)\n",
941 get_values (hive_h *h, hive_node_h node,
942 hive_value_h **values_ret, size_t **blocks_ret)
944 if (!IS_VALID_BLOCK (h, node) || !BLOCK_ID_EQ (h, node, "nk")) {
949 struct ntreg_nk_record *nk = (struct ntreg_nk_record *) (h->addr + node);
951 size_t nr_values = le32toh (nk->nr_values);
954 fprintf (stderr, "hivex_node_values: nr_values = %zu\n", nr_values);
956 INIT_OFFSET_LIST (values);
957 INIT_OFFSET_LIST (blocks);
959 /* Deal with the common "no values" case quickly. */
963 /* Arbitrarily limit the number of values we will ever deal with. */
964 if (nr_values > 100000) {
969 /* Preallocate space for the values. */
970 if (grow_offset_list (&values, nr_values) == -1)
973 /* Get the value list and check it looks reasonable. */
974 size_t vlist_offset = le32toh (nk->vallist);
975 vlist_offset += 0x1000;
976 if (!IS_VALID_BLOCK (h, vlist_offset)) {
978 fprintf (stderr, "hivex_node_values: returning EFAULT because value list is not a valid block (0x%zx)\n",
984 if (add_to_offset_list (&blocks, vlist_offset) == -1)
987 struct ntreg_value_list *vlist =
988 (struct ntreg_value_list *) (h->addr + vlist_offset);
990 size_t len = block_len (h, vlist_offset, NULL);
991 if (4 + nr_values * 4 > len) {
993 fprintf (stderr, "hivex_node_values: returning EFAULT because value list is too long (%zu, %zu)\n",
1000 for (i = 0; i < nr_values; ++i) {
1001 hive_node_h value = vlist->offset[i];
1003 if (!IS_VALID_BLOCK (h, value)) {
1005 fprintf (stderr, "hivex_node_values: returning EFAULT because value is not a valid block (0x%zx)\n",
1010 if (add_to_offset_list (&values, value) == -1)
1015 *values_ret = return_offset_list (&values);
1016 *blocks_ret = return_offset_list (&blocks);
1017 if (!*values_ret || !*blocks_ret)
1022 free_offset_list (&values);
1023 free_offset_list (&blocks);
1028 hivex_node_values (hive_h *h, hive_node_h node)
1030 hive_value_h *values;
1033 if (get_values (h, node, &values, &blocks) == -1)
1040 /* Very inefficient, but at least having a separate API call
1041 * allows us to make it more efficient in future.
1044 hivex_node_get_value (hive_h *h, hive_node_h node, const char *key)
1046 hive_value_h *values = NULL;
1048 hive_value_h ret = 0;
1050 values = hivex_node_values (h, node);
1051 if (!values) goto error;
1054 for (i = 0; values[i] != 0; ++i) {
1055 name = hivex_value_key (h, values[i]);
1056 if (!name) goto error;
1057 if (STRCASEEQ (name, key)) {
1061 free (name); name = NULL;
1071 hivex_value_key (hive_h *h, hive_value_h value)
1073 if (!IS_VALID_BLOCK (h, value) || !BLOCK_ID_EQ (h, value, "vk")) {
1078 struct ntreg_vk_record *vk = (struct ntreg_vk_record *) (h->addr + value);
1080 /* AFAIK the key is always plain ASCII, so no conversion to UTF-8 is
1081 * necessary. However we do need to nul-terminate the string.
1084 /* vk->name_len is unsigned, 16 bit, so this is safe ... However
1085 * we have to make sure the length doesn't exceed the block length.
1087 size_t len = le16toh (vk->name_len);
1088 size_t seg_len = block_len (h, value, NULL);
1089 if (sizeof (struct ntreg_vk_record) + len - 1 > seg_len) {
1091 fprintf (stderr, "hivex_value_key: returning EFAULT because key length is too long (%zu, %zu)\n",
1097 char *ret = malloc (len + 1);
1100 memcpy (ret, vk->name, len);
1106 hivex_value_type (hive_h *h, hive_value_h value, hive_type *t, size_t *len)
1108 if (!IS_VALID_BLOCK (h, value) || !BLOCK_ID_EQ (h, value, "vk")) {
1113 struct ntreg_vk_record *vk = (struct ntreg_vk_record *) (h->addr + value);
1116 *t = le32toh (vk->data_type);
1119 *len = le32toh (vk->data_len);
1120 if (*len == 0x80000000) { /* special case */
1122 if (t) *t = hive_t_dword;
1131 hivex_value_value (hive_h *h, hive_value_h value,
1132 hive_type *t_rtn, size_t *len_rtn)
1134 if (!IS_VALID_BLOCK (h, value) || !BLOCK_ID_EQ (h, value, "vk")) {
1139 struct ntreg_vk_record *vk = (struct ntreg_vk_record *) (h->addr + value);
1144 t = le32toh (vk->data_type);
1146 len = le32toh (vk->data_len);
1147 if (len == 0x80000000) { /* special case */
1154 fprintf (stderr, "hivex_value_value: value=0x%zx, t=%d, len=%zu\n",
1162 /* Arbitrarily limit the length that we will read. */
1163 if (len > 1000000) {
1168 char *ret = malloc (len);
1172 /* If length is <= 4 it's always stored inline. */
1174 memcpy (ret, (char *) &vk->data_offset, len);
1178 size_t data_offset = le32toh (vk->data_offset);
1179 data_offset += 0x1000;
1180 if (!IS_VALID_BLOCK (h, data_offset)) {
1182 fprintf (stderr, "hivex_value_value: returning EFAULT because data offset is not a valid block (0x%zx)\n",
1189 /* Check that the declared size isn't larger than the block its in. */
1190 size_t blen = block_len (h, data_offset, NULL);
1191 if (len > blen - 4 /* subtract 4 for block header */) {
1193 fprintf (stderr, "hivex_value_value: returning EFAULT because data is longer than its block (data 0x%zx, data len %zu, block len %zu)\n",
1194 data_offset, len, blen);
1200 char *data = h->addr + data_offset + 4;
1201 memcpy (ret, data, len);
1206 windows_utf16_to_utf8 (/* const */ char *input, size_t len)
1208 iconv_t ic = iconv_open ("UTF-8", "UTF-16");
1209 if (ic == (iconv_t) -1)
1212 /* iconv(3) has an insane interface ... */
1214 /* Mostly UTF-8 will be smaller, so this is a good initial guess. */
1215 size_t outalloc = len;
1219 size_t outlen = outalloc;
1220 char *out = malloc (outlen + 1);
1230 size_t r = iconv (ic, &inp, &inlen, &outp, &outlen);
1231 if (r == (size_t) -1) {
1232 if (errno == E2BIG) {
1233 size_t prev = outalloc;
1234 /* Try again with a larger output buffer. */
1237 if (outalloc < prev)
1242 /* Else some conversion failure, eg. EILSEQ, EINVAL. */
1258 hivex_value_string (hive_h *h, hive_value_h value)
1262 char *data = hivex_value_value (h, value, &t, &len);
1267 if (t != hive_t_string && t != hive_t_expand_string && t != hive_t_link) {
1273 char *ret = windows_utf16_to_utf8 (data, len);
1282 free_strings (char **argv)
1287 for (i = 0; argv[i] != NULL; ++i)
1293 /* Get the length of a UTF-16 format string. Handle the string as
1294 * pairs of bytes, looking for the first \0\0 pair.
1297 utf16_string_len_in_bytes (const char *str)
1301 while (str[0] || str[1]) {
1309 /* http://blogs.msdn.com/oldnewthing/archive/2009/10/08/9904646.aspx */
1311 hivex_value_multiple_strings (hive_h *h, hive_value_h value)
1315 char *data = hivex_value_value (h, value, &t, &len);
1320 if (t != hive_t_multiple_strings) {
1326 size_t nr_strings = 0;
1327 char **ret = malloc ((1 + nr_strings) * sizeof (char *));
1337 while (p < data + len && (plen = utf16_string_len_in_bytes (p)) > 0) {
1339 char **ret2 = realloc (ret, (1 + nr_strings) * sizeof (char *));
1347 ret[nr_strings-1] = windows_utf16_to_utf8 (p, plen);
1348 ret[nr_strings] = NULL;
1349 if (ret[nr_strings-1] == NULL) {
1355 p += plen + 2 /* skip over UTF-16 \0\0 at the end of this string */;
1363 hivex_value_dword (hive_h *h, hive_value_h value)
1367 char *data = hivex_value_value (h, value, &t, &len);
1372 if ((t != hive_t_dword && t != hive_t_dword_be) || len != 4) {
1378 int32_t ret = *(int32_t*)data;
1380 if (t == hive_t_dword) /* little endian */
1381 ret = le32toh (ret);
1383 ret = be32toh (ret);
1389 hivex_value_qword (hive_h *h, hive_value_h value)
1393 char *data = hivex_value_value (h, value, &t, &len);
1398 if (t != hive_t_qword || len != 8) {
1404 int64_t ret = *(int64_t*)data;
1406 ret = le64toh (ret); /* always little endian */
1411 /*----------------------------------------------------------------------
1416 hivex_visit (hive_h *h, const struct hivex_visitor *visitor, size_t len,
1417 void *opaque, int flags)
1419 return hivex_visit_node (h, hivex_root (h), visitor, len, opaque, flags);
1422 static int hivex__visit_node (hive_h *h, hive_node_h node, const struct hivex_visitor *vtor, char *unvisited, void *opaque, int flags);
1425 hivex_visit_node (hive_h *h, hive_node_h node,
1426 const struct hivex_visitor *visitor, size_t len, void *opaque,
1429 struct hivex_visitor vtor;
1430 memset (&vtor, 0, sizeof vtor);
1432 /* Note that len might be larger *or smaller* than the expected size. */
1433 size_t copysize = len <= sizeof vtor ? len : sizeof vtor;
1434 memcpy (&vtor, visitor, copysize);
1436 /* This bitmap records unvisited nodes, so we don't loop if the
1437 * registry contains cycles.
1439 char *unvisited = malloc (1 + h->size / 32);
1440 if (unvisited == NULL)
1442 memcpy (unvisited, h->bitmap, 1 + h->size / 32);
1444 int r = hivex__visit_node (h, node, &vtor, unvisited, opaque, flags);
1450 hivex__visit_node (hive_h *h, hive_node_h node,
1451 const struct hivex_visitor *vtor, char *unvisited,
1452 void *opaque, int flags)
1454 int skip_bad = flags & HIVEX_VISIT_SKIP_BAD;
1456 hive_value_h *values = NULL;
1457 hive_node_h *children = NULL;
1463 /* Return -1 on all callback errors. However on internal errors,
1464 * check if skip_bad is set and suppress those errors if so.
1468 if (!BITMAP_TST (unvisited, node)) {
1470 fprintf (stderr, "hivex__visit_node: contains cycle: visited node 0x%zx already\n",
1474 return skip_bad ? 0 : -1;
1476 BITMAP_CLR (unvisited, node);
1478 name = hivex_node_name (h, node);
1479 if (!name) return skip_bad ? 0 : -1;
1480 if (vtor->node_start && vtor->node_start (h, opaque, node, name) == -1)
1483 values = hivex_node_values (h, node);
1485 ret = skip_bad ? 0 : -1;
1489 for (i = 0; values[i] != 0; ++i) {
1493 if (hivex_value_type (h, values[i], &t, &len) == -1) {
1494 ret = skip_bad ? 0 : -1;
1498 key = hivex_value_key (h, values[i]);
1500 ret = skip_bad ? 0 : -1;
1504 if (vtor->value_any) {
1505 str = hivex_value_value (h, values[i], &t, &len);
1507 ret = skip_bad ? 0 : -1;
1510 if (vtor->value_any (h, opaque, node, values[i], t, len, key, str) == -1)
1512 free (str); str = NULL;
1517 str = hivex_value_value (h, values[i], &t, &len);
1519 ret = skip_bad ? 0 : -1;
1522 if (t != hive_t_none) {
1523 ret = skip_bad ? 0 : -1;
1526 if (vtor->value_none &&
1527 vtor->value_none (h, opaque, node, values[i], t, len, key, str) == -1)
1529 free (str); str = NULL;
1533 case hive_t_expand_string:
1535 str = hivex_value_string (h, values[i]);
1537 if (errno != EILSEQ && errno != EINVAL) {
1538 ret = skip_bad ? 0 : -1;
1541 if (vtor->value_string_invalid_utf16) {
1542 str = hivex_value_value (h, values[i], &t, &len);
1543 if (vtor->value_string_invalid_utf16 (h, opaque, node, values[i], t, len, key, str) == -1)
1545 free (str); str = NULL;
1549 if (vtor->value_string &&
1550 vtor->value_string (h, opaque, node, values[i], t, len, key, str) == -1)
1552 free (str); str = NULL;
1556 case hive_t_dword_be: {
1557 int32_t i32 = hivex_value_dword (h, values[i]);
1558 if (vtor->value_dword &&
1559 vtor->value_dword (h, opaque, node, values[i], t, len, key, i32) == -1)
1564 case hive_t_qword: {
1565 int64_t i64 = hivex_value_qword (h, values[i]);
1566 if (vtor->value_qword &&
1567 vtor->value_qword (h, opaque, node, values[i], t, len, key, i64) == -1)
1573 str = hivex_value_value (h, values[i], &t, &len);
1575 ret = skip_bad ? 0 : -1;
1578 if (t != hive_t_binary) {
1579 ret = skip_bad ? 0 : -1;
1582 if (vtor->value_binary &&
1583 vtor->value_binary (h, opaque, node, values[i], t, len, key, str) == -1)
1585 free (str); str = NULL;
1588 case hive_t_multiple_strings:
1589 strs = hivex_value_multiple_strings (h, values[i]);
1591 if (errno != EILSEQ && errno != EINVAL) {
1592 ret = skip_bad ? 0 : -1;
1595 if (vtor->value_string_invalid_utf16) {
1596 str = hivex_value_value (h, values[i], &t, &len);
1597 if (vtor->value_string_invalid_utf16 (h, opaque, node, values[i], t, len, key, str) == -1)
1599 free (str); str = NULL;
1603 if (vtor->value_multiple_strings &&
1604 vtor->value_multiple_strings (h, opaque, node, values[i], t, len, key, strs) == -1)
1606 free_strings (strs); strs = NULL;
1609 case hive_t_resource_list:
1610 case hive_t_full_resource_description:
1611 case hive_t_resource_requirements_list:
1613 str = hivex_value_value (h, values[i], &t, &len);
1615 ret = skip_bad ? 0 : -1;
1618 if (vtor->value_other &&
1619 vtor->value_other (h, opaque, node, values[i], t, len, key, str) == -1)
1621 free (str); str = NULL;
1626 free (key); key = NULL;
1629 children = hivex_node_children (h, node);
1630 if (children == NULL) {
1631 ret = skip_bad ? 0 : -1;
1635 for (i = 0; children[i] != 0; ++i) {
1637 fprintf (stderr, "hivex__visit_node: %s: visiting subkey %d (0x%zx)\n",
1638 name, i, children[i]);
1640 if (hivex__visit_node (h, children[i], vtor, unvisited, opaque, flags) == -1)
1644 if (vtor->node_end && vtor->node_end (h, opaque, node, name) == -1)
1655 free_strings (strs);
1659 /*----------------------------------------------------------------------
1663 /* Allocate an hbin (page), extending the malloc'd space if necessary,
1664 * and updating the hive handle fields (but NOT the hive disk header
1665 * -- the hive disk header is updated when we commit). This function
1666 * also extends the bitmap if necessary.
1668 * 'allocation_hint' is the size of the block allocation we would like
1669 * to make. Normally registry blocks are very small (avg 50 bytes)
1670 * and are contained in standard-sized pages (4KB), but the registry
1671 * can support blocks which are larger than a standard page, in which
1672 * case it creates a page of 8KB, 12KB etc.
1675 * > 0 : offset of first usable byte of new page (after page header)
1676 * 0 : error (errno set)
1679 allocate_page (hive_h *h, size_t allocation_hint)
1681 /* In almost all cases this will be 1. */
1682 size_t nr_4k_pages =
1683 1 + (allocation_hint + sizeof (struct ntreg_hbin_page) - 1) / 4096;
1684 assert (nr_4k_pages >= 1);
1686 /* 'extend' is the number of bytes to extend the file by. Note that
1687 * hives found in the wild often contain slack between 'endpages'
1688 * and the actual end of the file, so we don't always need to make
1691 ssize_t extend = h->endpages + nr_4k_pages * 4096 - h->size;
1693 if (h->msglvl >= 2) {
1694 fprintf (stderr, "allocate_page: current endpages = 0x%zx, current size = 0x%zx\n",
1695 h->endpages, h->size);
1696 fprintf (stderr, "allocate_page: extending file by %zd bytes (<= 0 if no extension)\n",
1701 size_t oldsize = h->size;
1702 size_t newsize = h->size + extend;
1703 char *newaddr = realloc (h->addr, newsize);
1704 if (newaddr == NULL)
1707 size_t oldbitmapsize = 1 + oldsize / 32;
1708 size_t newbitmapsize = 1 + newsize / 32;
1709 char *newbitmap = realloc (h->bitmap, newbitmapsize);
1710 if (newbitmap == NULL) {
1717 h->bitmap = newbitmap;
1719 memset (h->addr + oldsize, 0, newsize - oldsize);
1720 memset (h->bitmap + oldbitmapsize, 0, newbitmapsize - oldbitmapsize);
1723 size_t offset = h->endpages;
1724 h->endpages += nr_4k_pages * 4096;
1727 fprintf (stderr, "allocate_page: new endpages = 0x%zx, new size = 0x%zx\n",
1728 h->endpages, h->size);
1730 /* Write the hbin header. */
1731 struct ntreg_hbin_page *page =
1732 (struct ntreg_hbin_page *) (h->addr + offset);
1733 page->magic[0] = 'h';
1734 page->magic[1] = 'b';
1735 page->magic[2] = 'i';
1736 page->magic[3] = 'n';
1737 page->offset_first = htole32 (offset - 0x1000);
1738 page->page_size = htole32 (nr_4k_pages * 4096);
1739 memset (page->unknown, 0, sizeof (page->unknown));
1742 fprintf (stderr, "allocate_page: new page at 0x%zx\n", offset);
1744 /* Offset of first usable byte after the header. */
1745 return offset + sizeof (struct ntreg_hbin_page);
1748 /* Allocate a single block, first allocating an hbin (page) at the end
1749 * of the current file if necessary. NB. To keep the implementation
1750 * simple and more likely to be correct, we do not reuse existing free
1753 * seg_len is the size of the block (this INCLUDES the block header).
1754 * The header of the block is initialized to -seg_len (negative to
1755 * indicate used). id[2] is the block ID (type), eg. "nk" for nk-
1756 * record. The block bitmap is updated to show this block as valid.
1757 * The rest of the contents of the block will be zero.
1760 * > 0 : offset of new block
1761 * 0 : error (errno set)
1764 allocate_block (hive_h *h, size_t seg_len, const char id[2])
1772 /* The caller probably forgot to include the header. Note that
1773 * value lists have no ID field, so seg_len == 4 would be possible
1774 * for them, albeit unusual.
1777 fprintf (stderr, "allocate_block: refusing too small allocation (%zu), returning ERANGE\n",
1783 /* Refuse really large allocations. */
1784 if (seg_len > 1000000) {
1786 fprintf (stderr, "allocate_block: refusing large allocation (%zu), returning ERANGE\n",
1792 /* Round up allocation to multiple of 8 bytes. All blocks must be
1793 * on an 8 byte boundary.
1795 seg_len = (seg_len + 7) & ~7;
1797 /* Allocate a new page if necessary. */
1798 if (h->endblocks == 0 || h->endblocks + seg_len > h->endpages) {
1799 size_t newendblocks = allocate_page (h, seg_len);
1800 if (newendblocks == 0)
1802 h->endblocks = newendblocks;
1805 size_t offset = h->endblocks;
1808 fprintf (stderr, "allocate_block: new block at 0x%zx, size %zu\n",
1811 struct ntreg_hbin_block *blockhdr =
1812 (struct ntreg_hbin_block *) (h->addr + offset);
1814 blockhdr->seg_len = htole32 (- (int32_t) seg_len);
1815 if (id[0] && id[1] && seg_len >= 6) {
1816 blockhdr->id[0] = id[0];
1817 blockhdr->id[1] = id[1];
1820 h->endblocks += seg_len;
1822 /* If there is space after the last block in the last page, then we
1823 * have to put a dummy free block header here to mark the rest of
1826 ssize_t rem = h->endpages - h->endblocks;
1829 fprintf (stderr, "allocate_block: marking remainder of page free starting at 0x%zx, size %zd\n",
1834 blockhdr = (struct ntreg_hbin_block *) (h->addr + h->endblocks);
1835 blockhdr->seg_len = htole32 ((int32_t) rem);
1841 /* 'offset' must point to a valid, used block. This function marks
1842 * the block unused (by updating the seg_len field) and invalidates
1843 * the bitmap. It does NOT do this recursively, so to avoid creating
1844 * unreachable used blocks, callers may have to recurse over the hive
1845 * structures. Also callers must ensure there are no references to
1846 * this block from other parts of the hive.
1849 mark_block_unused (hive_h *h, size_t offset)
1851 assert (h->writable);
1852 assert (IS_VALID_BLOCK (h, offset));
1854 struct ntreg_hbin_block *blockhdr =
1855 (struct ntreg_hbin_block *) (h->addr + offset);
1857 size_t seg_len = block_len (h, offset, NULL);
1858 blockhdr->seg_len = htole32 (seg_len);
1860 BITMAP_CLR (h->bitmap, offset);
1863 /* Delete all existing values at this node. */
1865 delete_values (hive_h *h, hive_node_h node)
1867 assert (h->writable);
1869 hive_value_h *values;
1871 if (get_values (h, node, &values, &blocks) == -1)
1875 for (i = 0; blocks[i] != 0; ++i)
1876 mark_block_unused (h, blocks[i]);
1880 for (i = 0; values[i] != 0; ++i) {
1881 struct ntreg_vk_record *vk =
1882 (struct ntreg_vk_record *) (h->addr + values[i]);
1885 len = le32toh (vk->data_len);
1886 if (len == 0x80000000) /* special case */
1890 if (len > 4) { /* non-inline, so remove data block */
1891 size_t data_offset = le32toh (vk->data_offset);
1892 data_offset += 0x1000;
1893 mark_block_unused (h, data_offset);
1896 /* remove vk record */
1897 mark_block_unused (h, values[i]);
1902 struct ntreg_nk_record *nk = (struct ntreg_nk_record *) (h->addr + node);
1903 nk->nr_values = htole32 (0);
1904 nk->vallist = htole32 (0xffffffff);
1910 hivex_commit (hive_h *h, const char *filename, int flags)
1922 filename = filename ? : h->filename;
1923 int fd = open (filename, O_WRONLY|O_CREAT|O_TRUNC|O_NOCTTY, 0666);
1927 /* Update the header fields. */
1928 uint32_t sequence = le32toh (h->hdr->sequence1);
1930 h->hdr->sequence1 = htole32 (sequence);
1931 h->hdr->sequence2 = htole32 (sequence);
1932 /* XXX Ought to update h->hdr->last_modified. */
1933 h->hdr->blocks = htole32 (h->endpages - 0x1000);
1935 /* Recompute header checksum. */
1936 uint32_t sum = header_checksum (h);
1937 h->hdr->csum = htole32 (sum);
1940 fprintf (stderr, "hivex_commit: new header checksum: 0x%x\n", sum);
1942 if (full_write (fd, h->addr, h->size) != h->size) {
1949 if (close (fd) == -1)
1956 hivex_node_set_values (hive_h *h, hive_node_h node,
1957 size_t nr_values, const hive_set_value *values,
1965 if (!IS_VALID_BLOCK (h, node) || !BLOCK_ID_EQ (h, node, "nk")) {
1970 /* Delete all existing values. */
1971 if (delete_values (h, node) == -1)
1977 /* Allocate value list node. Value lists have no id field. */
1978 static const char nul_id[2] = { 0, 0 };
1980 sizeof (struct ntreg_value_list) + (nr_values - 1) * sizeof (uint32_t);
1981 size_t vallist_offs = allocate_block (h, seg_len, nul_id);
1982 if (vallist_offs == 0)
1985 struct ntreg_nk_record *nk = (struct ntreg_nk_record *) (h->addr + node);
1986 nk->nr_values = htole32 (nr_values);
1987 nk->vallist = htole32 (vallist_offs - 0x1000);
1989 struct ntreg_value_list *vallist =
1990 (struct ntreg_value_list *) (h->addr + vallist_offs);
1993 for (i = 0; i < nr_values; ++i) {
1994 /* Allocate vk record to store this (key, value) pair. */
1995 static const char vk_id[2] = { 'v', 'k' };
1996 seg_len = sizeof (struct ntreg_vk_record) + strlen (values[i].key);
1997 size_t vk_offs = allocate_block (h, seg_len, vk_id);
2001 vallist->offset[i] = htole32 (vk_offs - 0x1000);
2003 struct ntreg_vk_record *vk = (struct ntreg_vk_record *) (h->addr + vk_offs);
2004 size_t name_len = strlen (values[i].key);
2005 vk->name_len = htole16 (name_len);
2006 strcpy (vk->name, values[i].key);
2007 vk->data_type = htole32 (values[i].t);
2008 vk->data_len = htole16 (values[i].len);
2009 vk->flags = name_len == 0 ? 0 : 1;
2011 if (values[i].len <= 4) /* Store data inline. */
2012 memcpy (&vk->data_offset, values[i].value, values[i].len);
2014 size_t offs = allocate_block (h, values[i].len + 4, nul_id);
2017 memcpy (h->addr + offs + 4, values[i].value, values[i].len);
2018 vk->data_offset = htole32 (offs - 0x1000);
2021 if (name_len * 2 > le32toh (nk->max_vk_name_len))
2022 nk->max_vk_name_len = htole32 (name_len * 2);
2023 if (values[i].len > le32toh (nk->max_vk_data_len))
2024 nk->max_vk_data_len = htole32 (values[i].len);