source: trunk/include/regfi.h @ 249

Last change on this file since 249 was 249, checked in by tim, 13 years ago

reorganized iterator code for simpler locking and easier future key caching

  • Property svn:keywords set to Id
File size: 48.6 KB
RevLine 
[169]1/*
[168]2 * Copyright (C) 2005-2010 Timothy D. Morgan
[193]3 * Copyright (C) 2010 Michael Cohen
[30]4 * Copyright (C) 2005 Gerald (Jerry) Carter
5 *
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
[134]8 * the Free Software Foundation; version 3 of the License.
[30]9 *
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
13 * GNU General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
18 *
19 * $Id: regfi.h 249 2011-05-04 14:55:22Z tim $
20 */
21
[169]22/**
23 * @file
24 * Windows NT (and later) read-only registry library
25 *
26 * This library is intended for use in digital forensics investigations, but
27 * is likely useful in other applications.
28 *
29 * Branched from Samba project Subversion repository, version #6903:
30 *   http://viewcvs.samba.org/cgi-bin/viewcvs.cgi/trunk/source/include/regfio.h?rev=6903&view=auto
31 *
32 * Since then, it has been heavily rewritten, simplified, and improved.
33 */
[30]34
[168]35/**
36 * @mainpage Home
37 *
[169]38 * The regfi library is a read-only NT registry library which serves as the main
39 * engine behind the reglookup tool.  It is designed with digital forensic
40 * analysis in mind, but it should also be useful in other tools which need to
41 * efficiently traverse and query registry data structures.
42 *
43 * The library is broken down into four main parts, the
44 * @ref regfiBase "Base Layer", which any code dependent on the library will
45 * likely need to rely on, as well as three main functional layers:
46 * @li @ref regfiIteratorLayer
47 * @li @ref regfiGlueLayer
48 * @li @ref regfiParseLayer
49 *
50 * Most users will find that a combination of the Base Layer and the Iterator Layer
[185]51 * will be sufficient for accessing registry hive files.  Those who are willing
[169]52 * to dive deep into registry data structures, for instance to recover deleted
53 * data structures or to research Windows registry behavior in detail, will
54 * find the Parse Layer to be quite useful.
[168]55 */
56
[169]57
[78]58#ifndef _REGFI_H
59#define _REGFI_H
[30]60
[31]61#include <stdlib.h>
62#include <stdio.h>
[30]63#include <stdbool.h>
[31]64#include <string.h>
[30]65#include <errno.h>
[31]66#include <time.h>
[30]67#include <fcntl.h>
68#include <sys/stat.h>
69#include <sys/types.h>
70#include <unistd.h>
[159]71#include <iconv.h>
[180]72#include <pthread.h>
[201]73#include <talloc.h>
[30]74
[193]75/* regfi headers */
76#include <byteorder.h>
77#include <winsec.h>
78#include <void_stack.h>
79#include <range_list.h>
80#include <lru_cache.h>
[30]81
[201]82/* GCC-specific macro for library exports */
83#ifdef _EXPORT
84#undef _EXPORT
85#endif
[226]86#ifdef REGFI_WIN32
[238]87#define _EXPORT() __declspec(dllexport)
[226]88#else
[238]89#define _EXPORT() __attribute__((visibility("default")))
[226]90#endif
[184]91
[226]92#ifndef EOVERFLOW
93# define EOVERFLOW E2BIG
94#endif
[185]95
[30]96/******************************************************************************/
[184]97/* Constants for use while interacting with the library                       */
98/******************************************************************************/
[138]99
100/* regfi library error message types */
[182]101#define REGFI_LOG_INFO  0x0001
102#define REGFI_LOG_WARN  0x0004
103#define REGFI_LOG_ERROR 0x0010
[185]104#define REGFI_DEFAULT_LOG_MASK REGFI_LOG_ERROR|REGFI_LOG_WARN
[138]105
[161]106/* regfi library supported character encodings */
107/* UTF16LE is not supported for output */
[193]108typedef enum {
109  REGFI_ENCODING_DEFAULT  = 0,
110  REGFI_ENCODING_ASCII =   0,
111  REGFI_ENCODING_UTF8  =  1,
112  REGFI_ENCODING_UTF16LE = 2,
113  REGFI_NUM_ENCODINGS  =  3
114} REGFI_ENCODING;
[161]115
[32]116/* Registry data types */
[193]117typedef enum {
118  REG_NONE                   =    0,
119  REG_SZ                     =    1,
120  REG_EXPAND_SZ              =    2,
121  REG_BINARY                 =    3,
122  REG_DWORD                  =    4,
123  REG_DWORD_LE               =    4 , /* DWORD, little endian */
124  REG_DWORD_BE               =    5 , /* DWORD, big endian */
125  REG_LINK                   =    6,
126  REG_MULTI_SZ               =    7,
127  REG_RESOURCE_LIST          =    8,
128  REG_FULL_RESOURCE_DESCRIPTOR=   9,
129  REG_RESOURCE_REQUIREMENTS_LIST= 10,
130  REG_QWORD                     = 11, /* 64-bit little endian */
[72]131/* XXX: Has MS defined a REG_QWORD_BE? */
[32]132/* Not a real type in the registry */
[193]133  REG_KEY                 =   0x7FFFFFFF
134} REGFI_DATA_TYPE;
[135]135#define REGFI_OFFSET_NONE          0xffffffff
[30]136
[165]137
[184]138
139/******************************************************************************/
140/* Various resource limits and related constants                              */
141/******************************************************************************/
142
143/* Flags determining whether or not to cache various record types internally */
144#define REGFI_CACHE_SK             0
145
[165]146/* This maximum depth is described here:
147 * http://msdn.microsoft.com/en-us/library/ms724872%28VS.85%29.aspx
148 */
149#define REGFI_MAX_DEPTH            512
150
151/* This limit defines the maximum number of levels deep that ri subkey list
152 * trees can go.
153 */
154/* XXX: This is totally arbitrary right now.
155 *      The actual limit may need to be discovered by experimentation.
156 */
[149]157#define REGFI_MAX_SUBKEY_DEPTH     255
[139]158
[165]159
[184]160/******************************************************************************/
161/* Symbols for internal use                                                   */
162/******************************************************************************/
163
164/* Global thread-local storage key */
[185]165pthread_key_t regfi_log_key;
[184]166
[135]167/* Header sizes and magic number lengths for various records */
[147]168#define REGFI_HBIN_ALLOC           0x1000 /* Minimum allocation unit for HBINs */
169#define REGFI_REGF_SIZE            0x1000 /* "regf" header block size */
[135]170#define REGFI_REGF_MAGIC_SIZE      4
[151]171#define REGFI_REGF_NAME_SIZE       64
172#define REGFI_REGF_RESERVED1_SIZE  340
173#define REGFI_REGF_RESERVED2_SIZE  3528
[135]174#define REGFI_HBIN_MAGIC_SIZE      4
175#define REGFI_CELL_MAGIC_SIZE      2
176#define REGFI_HBIN_HEADER_SIZE     0x20
[116]177#define REGFI_NK_MIN_LENGTH        0x4C
178#define REGFI_VK_MIN_LENGTH        0x14
179#define REGFI_SK_MIN_LENGTH        0x14
[127]180#define REGFI_SUBKEY_LIST_MIN_LEN  0x4
[157]181#define REGFI_BIG_DATA_MIN_LENGTH  0xC
[30]182
[135]183
[116]184/* Constants used for validation */
[125]185/* XXX: Can we add clock resolution validation as well as range?  It has
186 *      been reported that Windows timestamps are never more than a
187 *      certain granularity (250ms?), which could be used to help
[147]188 *      eliminate false positives.  Would need to verify this and
[125]189 *      perhaps conservatively implement a check.
190 */
[116]191 /* Minimum time is Jan 1, 1990 00:00:00 */
192#define REGFI_MTIME_MIN_HIGH       0x01B41E6D
[178]193
[116]194 /* Maximum time is Jan 1, 2290 00:00:00
195  * (We hope no one is using Windows by then...)
196  */
197#define REGFI_MTIME_MAX_HIGH       0x03047543
[30]198
[116]199
[30]200/* Flags for the vk records */
[162]201#define REGFI_VK_FLAG_ASCIINAME    0x0001
[135]202#define REGFI_VK_DATA_IN_OFFSET    0x80000000
[152]203#define REGFI_VK_MAX_DATA_LENGTH   1024*1024  /* XXX: This is arbitrary */
[30]204
[137]205
[152]206/* Known key flags */
207/*******************/
[137]208/* These next two show up on normal-seeming keys in Vista and W2K3 registries */
209#define REGFI_NK_FLAG_UNKNOWN1     0x4000
210#define REGFI_NK_FLAG_UNKNOWN2     0x1000
[152]211
[167]212/* This next one shows up in some Vista "software" registries */
213/* XXX: This shows up in the following two SOFTWARE keys in Vista:
214 *   /Wow6432Node/Microsoft
215 *   /Wow6432Node/Microsoft/Cryptography
216 * 
217 * It comes along with UNKNOWN2 and ASCIINAME for a total flags value of 0x10A0
218 */
[137]219#define REGFI_NK_FLAG_UNKNOWN3     0x0080
[30]220
[152]221/* Predefined handle.  Rumor has it that the valuelist count for this key is
222 * where the handle is stored.
223 * http://msdn.microsoft.com/en-us/library/ms724836(VS.85).aspx
224 */
225#define REGFI_NK_FLAG_PREDEF_KEY   0x0040
[137]226
[152]227/* The name will be in ASCII if this next bit is set, otherwise UTF-16LE */
228#define REGFI_NK_FLAG_ASCIINAME    0x0020
229
230/* Symlink key. 
231 * See: http://www.codeproject.com/KB/system/regsymlink.aspx
232 */
233#define REGFI_NK_FLAG_LINK         0x0010
234
235/* This key cannot be deleted */
236#define REGFI_NK_FLAG_NO_RM        0x0008
237
238/* Root of a hive */
239#define REGFI_NK_FLAG_ROOT         0x0004
240
241/* Mount point of another hive.  NULL/(default) value indicates which hive
242 * and where in the hive it points to.
243 */
244#define REGFI_NK_FLAG_HIVE_LINK    0x0002
245
246/* These keys shouldn't be stored on disk, according to:
247 * http://geekswithblogs.net/sdorman/archive/2007/12/24/volatile-registry-keys.aspx
248 */
249#define REGFI_NK_FLAG_VOLATILE     0x0001
250
251/* Useful for identifying unknown flag types */
252#define REGFI_NK_KNOWN_FLAGS       (REGFI_NK_FLAG_PREDEF_KEY\
253                                    | REGFI_NK_FLAG_ASCIINAME\
254                                    | REGFI_NK_FLAG_LINK\
255                                    | REGFI_NK_FLAG_NO_RM\
256                                    | REGFI_NK_FLAG_ROOT\
257                                    | REGFI_NK_FLAG_HIVE_LINK\
258                                    | REGFI_NK_FLAG_VOLATILE\
259                                    | REGFI_NK_FLAG_UNKNOWN1\
[167]260                                    | REGFI_NK_FLAG_UNKNOWN2\
261                                    | REGFI_NK_FLAG_UNKNOWN3)
[152]262
[168]263
[193]264#ifndef CHAR_BIT
[168]265#define CHAR_BIT 8
[193]266#endif
267
[168]268#define TIME_T_MIN ((time_t)0 < (time_t) -1 ? (time_t) 0 \
269                    : ~ (time_t) 0 << (sizeof (time_t) * CHAR_BIT - 1))
270#define TIME_T_MAX (~ (time_t) 0 - TIME_T_MIN)
271#define TIME_FIXUP_CONSTANT (369.0*365.25*24*60*60-(3.0*24*60*60+6.0*60*60))
272
[184]273
274
275/******************************************************************************/
276/* Structures                                                                 */
277/******************************************************************************/
278
[168]279typedef struct _regfi_nttime
280{
281  uint32_t low;
282  uint32_t high;
283} REGFI_NTTIME;
284
285
[182]286typedef struct _regfi_log
287{
288  /* Error/warning/info messages returned by lower layer functions */
289  char* messages;
290
291  /* Mask for error message types that will be stored. */
292  uint16_t msg_mask;
293
294} REGFI_LOG;
295
296
[169]297/** HBIN block information
298 * @ingroup regfiMiddleLayer
299 */
[135]300typedef struct _regfi_hbin
[97]301{
[169]302  /** Offset of this HBIN in the registry file */
303  uint32_t file_off;
[97]304
[169]305  /** Number of active records pointing to this block (not used currently) */
306  uint32_t ref_count;
307
308  /** Offset from first hbin block */
309  uint32_t first_hbin_off;
310
311  /** Block size of this block Should be a multiple of 4096 (0x1000) */
312  uint32_t block_size;
313
314  /** Relative offset to next block. 
315   *
316   * @note This value may be unreliable!
317   */
318  uint32_t next_block;
319
320  /** Magic number for the HBIN (should be "hbin"). */
321  uint8_t magic[REGFI_HBIN_MAGIC_SIZE];
[135]322} REGFI_HBIN;
[30]323
[97]324
[127]325/* Subkey List -- list of key offsets and hashed names for consistency */
[97]326typedef struct 
327{
[139]328  /* Virtual offset of NK record or additional subkey list,
329   * depending on this list's type.
330   */
[168]331  uint32_t offset;
[139]332
[168]333  uint32_t hash;
[135]334} REGFI_SUBKEY_LIST_ELEM;
[30]335
[97]336
[169]337/** Subkey-list structure
338 * @ingroup regfiMiddleLayer
339 */
[145]340typedef struct _regfi_subkey_list
[97]341{
[139]342  /* Real offset of this record's cell in the file */
[168]343  uint32_t offset;
[139]344
[168]345  uint32_t cell_size;
[139]346 
347  /* Number of immediate children */
[202]348  uint32_t num_children;
[139]349
[202]350  /* Total number of keys referenced by this list and its children */
351  uint32_t num_keys;
[139]352
[135]353  REGFI_SUBKEY_LIST_ELEM* elements;
[168]354  uint8_t magic[REGFI_CELL_MAGIC_SIZE];
[139]355
356  /* Set if the magic indicates this subkey list points to child subkey lists */
[202]357  bool recursive_type;
[135]358} REGFI_SUBKEY_LIST;
[30]359
[97]360
[168]361typedef uint32_t REGFI_VALUE_LIST_ELEM;
[169]362/** Value-list structure
363 * @ingroup regfiMiddleLayer
364 */
[145]365typedef struct _regfi_value_list
366{
[206]367  /* Real offset of this record's cell in the file */
368  uint32_t offset;
369
370  uint32_t cell_size;
371
[145]372  /* Actual number of values referenced by this list. 
373   * May differ from parent key's num_values if there were parsing errors.
374   */
[168]375  uint32_t num_values;
[145]376
377  REGFI_VALUE_LIST_ELEM* elements;
378} REGFI_VALUE_LIST;
379
380
[169]381/** Class name structure (used in storing SysKeys)
382 * @ingroup regfiBase
383 */
[160]384typedef struct _regfi_classname
385{
[206]386  /** Real offset of this record's cell in the file */
387  uint32_t offset;
388
[169]389  /** As converted to requested REGFI_ENCODING */
[160]390  char* interpreted;
391
[169]392  /** Represents raw buffer read from classname cell.
393   *
394   * Length of this item is specified in the size field.
395   */
[168]396  uint8_t* raw;
[160]397
[169]398  /** Length of the raw data.
399   *
400   * May be shorter than that indicated by parent key.
401   */
[168]402  uint16_t size;
[160]403} REGFI_CLASSNAME;
404
405
[169]406/** Data record structure
407 * @ingroup regfiBase
408 */
[159]409typedef struct _regfi_data
410{
[209]411  /* XXX: this isn't populated yet. Should set it to start of data cell
412   *      or big data cell.
413   */
414  uint32_t offset;
415
[169]416  /** Data type of this data, as indicated by the referencing VK record. */
[193]417  REGFI_DATA_TYPE type;
[159]418
[169]419  /** Length of the raw data. */
[168]420  uint32_t size;
[159]421
[169]422  /** This is always present, representing the raw data cell contents. */
[168]423  uint8_t* raw;
[159]424
[209]425  /** Represents the length of the interpreted value. Meaning is type-specific.
426   *  Will be 0 if interpretation failed for any reason.
427   */
[168]428  uint32_t interpreted_size;
[159]429
[169]430  /** These items represent interpreted versions of the REGFI_DATA::raw field.
431   *
432   * Only use the appropriate member according to the REGFI_DATA::type field.
433   * In the event of an unknown type, use only the REGFI_DATA::raw field.
[159]434   */
435  union _regfi_data_interpreted
436  {
[169]437    /** REG_NONE
438     *
439     * Stored as a raw buffer.  Use REGFI_DATA::interpreted_size to determine
440     * length.
441     */
442    uint8_t* none; 
443
444    /** REG_SZ
445     *
446     * Stored as a NUL terminated string.  Converted to the specified
447     * REGFI_ENCODING.
448     */
[168]449    uint8_t* string;
[169]450
451    /** REG_EXPAND_SZ
452     *
453     * Stored as a NUL terminated string.  Converted to the specified
454     * REGFI_ENCODING.
455     */
[168]456    uint8_t* expand_string;
[169]457
458    /** REG_BINARY
459     *
460     * Stored as a raw buffer.  Use REGFI_DATA::interpreted_size to determine
461     * length.
462     */
463    uint8_t* binary;
464
465    /** REG_DWORD */
[168]466    uint32_t dword;
[169]467
468    /** REG_DWORD_BE */
[168]469    uint32_t dword_be;
[169]470
471    /** REG_LINK
472     *
473     * Stored as a NUL terminated string.  Converted to the specified
474     * REGFI_ENCODING.
475     */
[168]476    uint8_t* link;
[169]477
478    /** REG_MULTI_SZ
479     *
480     * Stored as a list of uint8_t* pointers, terminated with a NULL pointer.
481     * Each string element in the list is NUL terminated, and the character set
482     * is determined by the specified REGFI_ENCODING.
483     */
[168]484    uint8_t** multiple_string;
[169]485
486    /** REG_QWORD */
[168]487    uint64_t qword;
[159]488
489    /* The following are treated as binary currently, but this may change in
490     * the future as the formats become better understood.
491     */
[169]492
493    /** REG_RESOURCE_LIST
494     *
495     * Stored as a raw buffer.  Use REGFI_DATA::interpreted_size to determine
496     * length.
497     */
[168]498    uint8_t* resource_list;
[169]499
500    /** REG_FULL_RESOURCE_DESCRIPTOR
501     *
502     * Stored as a raw buffer.  Use REGFI_DATA::interpreted_size to determine
503     * length.
504     */
[168]505    uint8_t* full_resource_descriptor;
[169]506
507    /** REG_RESOURCE_REQUIREMENTS_LIST
508     *
509     * Stored as a raw buffer.  Use REGFI_DATA::interpreted_size to determine
510     * length.
511     */
[168]512    uint8_t* resource_requirements_list;
[159]513  } interpreted;
514} REGFI_DATA;
515
516
[169]517/** Value structure
518 * @ingroup regfiBase
519 */
[206]520typedef struct _regfi_vk
[97]521{
[169]522  /** Real offset of this record's cell in the file */
523  uint32_t offset;     
[101]524
[169]525  /** ((start_offset - end_offset) & 0xfffffff8) */
526  uint32_t cell_size;
[159]527
[169]528  /** The name of this value converted to desired REGFI_ENCODING. 
529   *
530   * This conversion typically occurs automatically through REGFI_ITERATOR
531   * settings.  String is NUL terminated.
532   */
[206]533  char* name;
[169]534
535  /** The raw value name
536   *
537   * Length of the buffer is stored in name_length.
538   */
[206]539  uint8_t* name_raw;
[169]540
[206]541  /** Length of name_raw */
[168]542  uint16_t name_length;
[169]543
544  /** Offset from beginning of this hbin block */
545  uint32_t hbin_off;
[53]546 
[169]547  /** Size of the value's data as reported in the VK record.
548   *
549   * May be different than that obtained while parsing the data cell itself.
550   */
551  uint32_t data_size;
552
553  /** Virtual offset of data cell */
554  uint32_t data_off;
555
556  /** Value's data type */
[193]557  REGFI_DATA_TYPE type;
[169]558
559  /** VK record's magic number (should be "vk") */
[168]560  uint8_t  magic[REGFI_CELL_MAGIC_SIZE];
[169]561
562  /** VK record flags */
[168]563  uint16_t flags;
[169]564
565  /* XXX: A 2-byte field of unknown purpose stored in the VK record */
[168]566  uint16_t unknown1;
[169]567
568  /** Whether or not the data record is stored in the VK record's data_off field.
569   *
570   * This information is derived from the high bit of the raw data size field.
571   */
572  bool     data_in_offset;
[206]573
574  /* XXX: deprecated */
575  REGFI_DATA* data;
576
[203]577} REGFI_VK;
[30]578
579
580/* Key Security */
[206]581struct _regfi_sk;
[30]582
[169]583/** Security structure
584 * @ingroup regfiBase
585 */
[206]586typedef struct _regfi_sk
[97]587{
[169]588  /** Real file offset of this record */
589  uint32_t offset;
[111]590
[169]591  /** ((start_offset - end_offset) & 0xfffffff8) */
592  uint32_t cell_size;
593
594  /** The stored Windows security descriptor for this SK record */
[134]595  WINSEC_DESC* sec_desc;
[169]596
597  /** Offset of this record from beginning of this hbin block */
598  uint32_t hbin_off;
[53]599 
[169]600  /** Offset of the previous SK record in the linked list of SK records */
[168]601  uint32_t prev_sk_off;
[169]602
603  /** Offset of the next SK record in the linked list of SK records */
[168]604  uint32_t next_sk_off;
[169]605
606  /** Number of keys referencing this SK record */
[168]607  uint32_t ref_count;
[169]608
609  /** Size of security descriptor (sec_desc) */
610  uint32_t desc_size;
611
612  /* XXX: A 2-byte field of unknown purpose */
[168]613  uint16_t unknown_tag;
[169]614
615  /** The magic number for this record (should be "sk") */
[168]616  uint8_t  magic[REGFI_CELL_MAGIC_SIZE];
[203]617} REGFI_SK;
[30]618
[81]619
[169]620/** Key structure
621 * @ingroup regfiBase
622 */
[206]623typedef struct _regfi_nk
[97]624{
[169]625  /** Real offset of this record's cell in the file */
626  uint32_t offset;
[84]627
[169]628  /** Actual or estimated length of the cell. 
629   * Always in multiples of 8.
630   */
631  uint32_t cell_size;
632
633  /** Preloaded value-list for this key.
634   * This element is loaded automatically when using the iterator interface and
635   * possibly some lower layer interfaces.
636   */
[145]637  REGFI_VALUE_LIST* values;
[169]638
639
640  /** Preloaded subkey-list for this key.
641   * This element is loaded automatically when using the iterator interface and
642   * possibly some lower layer interfaces.
643   */
[135]644  REGFI_SUBKEY_LIST* subkeys;
[53]645 
[169]646  /** Key flags */
[168]647  uint16_t flags;
[169]648
649  /** Magic number of key (should be "nk") */
[168]650  uint8_t  magic[REGFI_CELL_MAGIC_SIZE];
[169]651
652  /** Key's last modification time */
[168]653  REGFI_NTTIME mtime;
[169]654
[249]655  /** Length of name_raw */
[168]656  uint16_t name_length;
[169]657
658  /** Length of referenced classname */
[168]659  uint16_t classname_length;
[169]660
661  /** The name of this key converted to desired REGFI_ENCODING. 
662   *
663   * This conversion typically occurs automatically through REGFI_ITERATOR
664   * settings.  String is NUL terminated.
665   */
[206]666  char* name;
[169]667
668  /** The raw key name
669   *
670   * Length of the buffer is stored in name_length.
671   */
[206]672  uint8_t* name_raw;
[169]673
[215]674  /** Virtual offset of parent key */
[169]675  uint32_t parent_off;
676
[215]677  /** Virtual offset of classname key */
[168]678  uint32_t classname_off;
[53]679 
[169]680  /* XXX: max subkey name * 2 */
681  uint32_t max_bytes_subkeyname;
682
683  /* XXX: max subkey classname length (as if) */
684  uint32_t max_bytes_subkeyclassname;
685
[206]686  /* XXX: max value name * 2 */
[169]687  uint32_t max_bytes_valuename;
688
689  /* XXX: max value data size */
690  uint32_t max_bytes_value;
[53]691 
[169]692  /* XXX: Fields of unknown purpose */
[168]693  uint32_t unknown1;
694  uint32_t unknown2;
695  uint32_t unknown3;
696  uint32_t unk_index;               /* nigel says run time index ? */
[53]697 
[169]698  /** Number of subkeys */
[168]699  uint32_t num_subkeys;
[169]700
701  /** Virtual offset of subkey-list */
702  uint32_t subkeys_off;
703
704  /** Number of values for this key */
[168]705  uint32_t num_values;
[169]706
707  /** Virtual offset of value-list */
708  uint32_t values_off;
709
710  /** Virtual offset of SK record */
711  uint32_t sk_off;
[203]712} REGFI_NK;
[30]713
[81]714
[178]715typedef struct _regfi_raw_file
716{
[226]717  int64_t  (* seek)(); /* (REGFI_RAW_FILE* self, uint64_t offset, int whence) */
[178]718  ssize_t  (* read)(); /* (REGFI_RAW_FILE* self, void* buf, size_t count) */
[97]719
[178]720  uint64_t cur_off;
721  uint64_t size;
722  void*    state;
723} REGFI_RAW_FILE;
724
725
[169]726/** Registry hive file data structure
727 *
728 * This essential structure stores run-time information about a single open
729 * registry hive as well as file header (REGF block) data.  This structure
730 * also stores a list of warnings and error messages generated while parsing
[238]731 * the registry hive.  These can be tuned using @ref regfi_log_set_mask. 
[202]732 * Messages may be retrieved using @ref regfi_log_get_str.
[169]733 *
734 * @note If the message mask is set to record any messages, dependent code
[202]735 *       must use @ref regfi_log_get_str periodically to clear the message
[169]736 *       queue. Otherwise, this structure will grow in size over time as
737 *       messages queue up.
738 *
739 * @ingroup regfiBase
740 */ 
[178]741typedef struct _regfi_file
[97]742{
[135]743  /* Data parsed from file header */
744  /********************************/
[168]745  uint8_t  magic[REGFI_REGF_MAGIC_SIZE];/* "regf" */
[151]746
747 /* These sequence numbers should match if
748  * the hive was properly synced to disk.
749  */
[168]750  uint32_t sequence1;           
751  uint32_t sequence2;
[151]752
[168]753  REGFI_NTTIME mtime;
754  uint32_t major_version;  /* Set to 1 in all known hives */
755  uint32_t minor_version;  /* Set to 3 or 5 in all known hives */
756  uint32_t type;           /* XXX: Unverified.  Set to 0 in all known hives */
757  uint32_t format;         /* XXX: Unverified.  Set to 1 in all known hives */
[97]758
[168]759  uint32_t root_cell;  /* Offset to root cell in the first (or any?) hbin block */
760  uint32_t last_block; /* Offset to last hbin block in file */
[151]761
[168]762  uint32_t cluster;    /* XXX: Unverified. Set to 1 in all known hives */
[151]763
764  /* Matches hive's base file name. Stored in UTF-16LE */
[168]765  uint8_t file_name[REGFI_REGF_NAME_SIZE];
[151]766
767  WINSEC_UUID* rm_id;       /* XXX: Unverified. */
768  WINSEC_UUID* log_id;      /* XXX: Unverified. */
769  WINSEC_UUID* tm_id;       /* XXX: Unverified. */
[168]770  uint32_t flags;             /* XXX: Unverified. */
771  uint32_t guid_signature;    /* XXX: Unverified. */
[151]772
[168]773  uint32_t checksum;          /* Stored checksum from file */
774  uint32_t computed_checksum; /* Our own calculation of the checksum.
[151]775                             * (XOR of bytes 0x0000 - 0x01FB) */
776
777  WINSEC_UUID* thaw_tm_id;  /* XXX: Unverified. */
778  WINSEC_UUID* thaw_rm_id;  /* XXX: Unverified. */
779  WINSEC_UUID* thaw_log_id; /* XXX: Unverified. */
[168]780  uint32_t boot_type;         /* XXX: Unverified. */
781  uint32_t boot_recover;      /* XXX: Unverified. */
[151]782
783  /* This seems to include random junk.  Possibly unsanitized memory left over
784   * from when header block was written.  For instance, chunks of nk records
785   * can be found, though often it's all 0s. */
[168]786  uint8_t reserved1[REGFI_REGF_RESERVED1_SIZE];
[151]787
788  /* This is likely reserved and unusued currently.  (Should be all 0s.)
789   * Included here for easier access in looking for hidden data
790   * or doing research. */
[168]791  uint8_t reserved2[REGFI_REGF_RESERVED2_SIZE];
[151]792
[203]793
794  /* Run-time information */
795  /************************/
[206]796  /* For sanity checking (not part of the registry header) */
797  uint32_t file_length;
798
799  /** The encoding that all strings are converted to during interpretation.
800   */
801  REGFI_ENCODING string_encoding;
802
[203]803  /* Functions for accessing the file */
804  REGFI_RAW_FILE* cb;
805
806  /* Mutex for all cb access.  This is done to prevent one thread from moving
807   * the file offset while another thread is in the middle of a multi-read
808   * parsing transaction */
809  pthread_mutex_t cb_lock;
810
811  /* Metadata about hbins */
812  range_list* hbins;
813
814  /* Multiple read access allowed, write access is exclusive */
815  pthread_rwlock_t hbins_lock;
816
817  /* SK record cached since they're repeatedly reused */
818  lru_cache* sk_cache;
819
820  /* Need exclusive access for LRUs, since lookups make changes */
821  pthread_mutex_t sk_lock;
822
[228]823  /* Needed to protect various talloc calls */
824  pthread_mutex_t mem_lock;
825
[135]826} REGFI_FILE;
[30]827
828
[249]829typedef struct _regfi_iter_position
830{
831  /* key offset */
832  uint32_t offset;
833
834  /* Index of the current subkey */
835  uint32_t cur_subkey;
836
837  /* Index of the current value */
838  uint32_t cur_value;
839
840  /* The number of subkeys of this key */
841  uint32_t num_subkeys;
842
843  /* The number of values of this key */
844  uint32_t num_values;
845
846} REGFI_ITER_POSITION;
847
848
[169]849/** Registry hive iterator
850 * @ingroup regfiIteratorLayer
851 */
[151]852typedef struct _regfi_iterator
[97]853{
[169]854  /** The registry hive this iterator is associated with */
[135]855  REGFI_FILE* f;
[169]856
857  /** All current parent keys and associated iterator positions */
[80]858  void_stack* key_positions;
[169]859
[249]860  REGFI_ITER_POSITION* cur;
[78]861} REGFI_ITERATOR;
862
[80]863
864
[169]865/** General purpose buffer with stored length
866 * @ingroup regfiBottomLayer
867 */
[151]868typedef struct _regfi_buffer
869{
[168]870  uint8_t* buf;
[151]871  uint32_t len;
872} REGFI_BUFFER;
873
874
[169]875
[54]876/******************************************************************************/
[168]877/**
[169]878 * @defgroup regfiBase Base Layer: Essential Functions and Data Structures
[168]879 *
[169]880 * These functions are either necessary for normal use of the regfi API or just
881 * don't fit particularly well in any of the other layers.
[168]882 */
[135]883/******************************************************************************/
[166]884
[233]885
[238]886
[233]887/** Returns the current regfi library version
888 *
889 * @return A string indicating the version.
890 *
891 * @ingroup regfiBase
892 */
[238]893_EXPORT()
[233]894const char* regfi_version();
895
896
[168]897/** Parses file headers of an already open registry hive file and
898 *  allocates related structures for further parsing.
[166]899 *
[168]900 * @param fd A file descriptor of an already open file.  Must be seekable.
[166]901 *
[168]902 * @return A reference to a newly allocated REGFI_FILE structure, if successful;
[184]903 *         NULL on error.  Use regfi_free to free the returned REGFI_FILE.
[168]904 *
905 * @ingroup regfiBase
[166]906 */
[238]907_EXPORT()
[206]908REGFI_FILE* regfi_alloc(int fd, REGFI_ENCODING output_encoding);
[166]909
910
[178]911/** Parses file headers returned by supplied callback functions.
[166]912 *
[178]913 * This interface is useful if you have a registry hive in memory
914 * or have some other reason to emulate a real file.
[166]915 *
[178]916 * @param file_cb A structure defining the callback functions needed to access the file.
[168]917 *
[178]918 * @return A reference to a newly allocated REGFI_FILE structure, if successful;
[184]919 *         NULL on error.  Use regfi_free to free the returned REGFI_FILE.
[178]920 *
[168]921 * @ingroup regfiBase
[166]922 */
[238]923_EXPORT()
[206]924REGFI_FILE* regfi_alloc_cb(REGFI_RAW_FILE* file_cb,
925                           REGFI_ENCODING output_encoding);
[166]926
927
[168]928/** Frees a hive's data structures without closing the underlying file.
[166]929 *
[168]930 * @param file The registry structure to free.
931 *
932 * @ingroup regfiBase
[166]933 */
[238]934_EXPORT()
[201]935void regfi_free(REGFI_FILE* file);
[166]936
937
[168]938/** Get errors, warnings, and/or verbose information relating to processing of
939 *  the given registry file.
[135]940 *
[168]941 * @return A newly allocated char* which must be free()d by the caller.
942 *
943 * @ingroup regfiBase
[135]944 */
[238]945_EXPORT()
[182]946char* regfi_log_get_str();
[159]947
[166]948
[185]949/** Set the verbosity level of messages generated by the library for the
950 *  current thread.
[166]951 *
[185]952 * @param mask   An integer representing the types of messages desired.
[166]953 *               Acceptable values are created through bitwise ORs of
[185]954 *               REGFI_LOG_* values.  For instance, if only errors and
[166]955 *               informational messages were desired (but not warnings),
[185]956 *               then one would specify: REGFI_LOG_ERROR|REGFI_LOG_INFO
957 *               By default the message mask is: REGFI_LOG_ERROR|REGFI_LOG_WARN.
[166]958 *
[185]959 * @return       true on success and false on failure.  Failure occurs if
960 *               underlying pthread functions fail.  errno is set in this case.
[182]961 *
[185]962 * Message masks are set in a thread-specific way.  If one were to set a message
963 * mask in one thread and then spawn a new thread, then the new thread will have
964 * it's message mask reset to the default.  This function may be called at any
965 * time and will take effect immediately for the current thread.
[182]966 *
[185]967 * @note When a non-zero message mask is set, messages will
968 *       accumulate in memory without limit if they are not fetched using
969 *       @ref regfi_get_log_str and subsequently freed by the caller.  It is
970 *       recommended that messsages be fetched after each regfi API call in
971 *       order to provide the most context.
972 *
[182]973 * @ingroup regfiBase
974 */
[238]975_EXPORT()
[185]976bool regfi_log_set_mask(uint16_t mask);
[182]977
978
[215]979/** Fetches a hive's root key.
980 *
981 * @return Returns the root key or NULL on failure.  Key must be freed using
982 *         @ref regfi_free_record.
983 *
984 * @ingroup regfiBase
985 */
[238]986_EXPORT()
[215]987const REGFI_NK*       regfi_get_rootkey(REGFI_FILE* file);
[168]988
[215]989
[184]990/** Frees a record previously returned by one of the API functions.
[159]991 *
[228]992 * @param file The file from which the record originated. 
993 *             (This is needed for memory management reasons.)
994 *
995 * @param record Any of the following record types: REGFI_NK, REGFI_VK,
996 *        REGFI_SK, REGFI_DATA, and REGFI_CLASSNAME records.
[159]997 *
[228]998 * @note The "const" in the record data type is a bit misleading and is there just for
[184]999 * convenience.  Since records returned previously must not be modified by users
1000 * of the API due to internal caching, these are returned as const, so this
[215]1001 * function is const to make passing those records back easy.
[168]1002 *
1003 * @ingroup regfiBase
1004 */
[238]1005_EXPORT()
[228]1006void regfi_free_record(REGFI_FILE* file, const void* record);
[168]1007
1008
[224]1009/** Increments reference count on record
1010 *
1011 * Adds an extra internal reference to specified record, making it necessary to
1012 * call regfi_free_record on it an additional time before it is freed.  This is
1013 * useful in cases where multiple threads/structures need access to a record,
1014 * without requiring them to be in sync with when it is freed.
1015 *
[228]1016 * @param file The file from which the record originated. 
1017 *             (This is needed for memory management reasons.)
1018 *
1019 * @param record Any of the following record types: REGFI_NK, REGFI_VK,
1020 *        REGFI_SK, REGFI_DATA, and REGFI_CLASSNAME records.
[224]1021 *
1022 * @return true on success, false otherwise
1023 *
1024 * @ingroup regfiBase
1025 */
[238]1026_EXPORT()
[228]1027bool regfi_reference_record(REGFI_FILE* file, const void* record);
[224]1028
1029
[207]1030/** Retrieves number of subkeys referenced by this key.
1031 *
1032 * Number of subkeyss in key structure and subkey list structure could differ,
1033 * so this provides a standard/sane way of determining the number.
1034 *
1035 * @param key  the key whose number of subkeys is desired
1036 *
1037 * @return Returns the number of subkeys referenced by this key.
1038 *
1039 * @ingroup regfiBase
1040 */
[238]1041_EXPORT()
[207]1042uint32_t regfi_fetch_num_subkeys(const REGFI_NK* key);
1043
1044
1045/** Retrieves number of values referenced by this key.
1046 *
1047 * Number of values in key structure and value list structure could differ,
1048 * so this provides a standard/sane way of determining the number.
1049 *
1050 * @param key  the key whose number of values is desired
1051 *
1052 * @return Returns the number of values referenced by this key.
1053 *
1054 * @ingroup regfiBase
1055 */
[238]1056_EXPORT()
[207]1057uint32_t regfi_fetch_num_values(const REGFI_NK* key);
1058
1059
[206]1060/** Retrieves classname for a given key.
1061 *
1062 * @param file the file from which key is derived
1063 * @param key the key whose classname is desired
1064 *
1065 * @return Returns a newly allocated classname structure, or NULL on failure.
1066 *         Classname structures must be freed with @ref regfi_free_record.
1067 *
1068 * @ingroup regfiBase
1069 */
[238]1070_EXPORT()
[206]1071const REGFI_CLASSNAME* regfi_fetch_classname(REGFI_FILE* file, 
1072                                             const REGFI_NK* key);
1073
1074
1075/** Returns the SK (security) record referenced by the supplied key.
1076 *
1077 * @param file the file from which key is derived
1078 * @param key  the key whose SK record is desired
1079 *
1080 * @return A read-only SK structure, or NULL on failure.
1081 *
1082 * @ingroup regfiBase
1083 */
[238]1084_EXPORT()
[206]1085const REGFI_SK* regfi_fetch_sk(REGFI_FILE* file, const REGFI_NK* key);
1086
1087
1088/** Retrieves data for a given value.
1089 *
1090 * @param file the file from which value is derived
1091 * @param value the value whose data is desired
1092 *
1093 * @return Returns a newly allocated data structure, or NULL on failure.
1094 *         Data structures must be freed with @ref regfi_free_record.
1095 *
1096 * @ingroup regfiBase
1097 */
[238]1098_EXPORT()
[206]1099const REGFI_DATA* regfi_fetch_data(REGFI_FILE* file,
1100                                   const REGFI_VK* value);
1101
1102
[207]1103/** Locates a specific subkey of a given key.
1104 *
1105 * @param file  the file from which key is derived
1106 * @param key   the key whose subkey is desired
1107 * @param name  name of the desired subkey
1108 * @param index a return value: the index of the desired subkey.
1109 *              undefined on error
1110 *
1111 * @return true if the subkey is found, false if an error occurred or if the
1112 *         specified name could not be found. If an error occurs, messages
1113 *         will be written explaining the issue. (See regfi_log_get_str.)
1114 *
1115 * @ingroup regfiBase
1116 */
[238]1117_EXPORT()
[207]1118bool regfi_find_subkey(REGFI_FILE* file, const REGFI_NK* key, 
1119                       const char* name, uint32_t* index);
1120
1121
1122/** Locates a specific value of a given key.
1123 *
1124 * @param file  the file from which key is derived
1125 * @param key   the key whose value is desired
1126 * @param name  name of the desired value
1127 * @param index a return value: the index of the desired value. 
1128 *              undefined on error
1129 *
1130 * @return true if the value is found, false if an error occurred or if the
1131 *         specified name could not be found. If an error occurs, messages
1132 *         will be written explaining the issue. (See regfi_log_get_str.)
1133 *
1134 * @ingroup regfiBase
1135 */
[238]1136_EXPORT()
[207]1137bool regfi_find_value(REGFI_FILE* file, const REGFI_NK* key,
1138                      const char* name, uint32_t* index);
1139
1140
1141/** Retrieves a specific subkey of a given key.
1142 *
1143 * @param file  the file from which key is derived
1144 * @param key   the key whose subkey is desired
1145 * @param index the index of the desired subkey
1146 *
1147 * @return the requested subkey or NULL on error.
1148 *
1149 * @ingroup regfiBase
1150 */
[238]1151_EXPORT()
[207]1152const REGFI_NK* regfi_get_subkey(REGFI_FILE* file, const REGFI_NK* key, 
1153                                 uint32_t index);
1154
1155
1156/** Retrieves a specific value of a given key.
1157 *
1158 * @param file  the file from which key is derived
1159 * @param key   the key whose value is desired
1160 * @param index the index of the desired value
1161 *
1162 * @return the requested value or NULL on error.
1163 *
1164 * @ingroup regfiBase
1165 */
[238]1166_EXPORT()
[207]1167const REGFI_VK* regfi_get_value(REGFI_FILE* file, const REGFI_NK* key, 
1168                                uint32_t index);
1169
1170
1171
[215]1172/** Uses a key's parent_off reference to retrieve it's parent.
1173 *
1174 * @param file  the file from which key is derived
1175 * @param key   the key whose parent is desired
1176 *
1177 * @return the requested subkey or NULL on error.
1178 *
1179 * @ingroup regfiBase
1180 */
[238]1181_EXPORT()
[215]1182const REGFI_NK* regfi_get_parentkey(REGFI_FILE* file, const REGFI_NK* key);
1183
1184
[168]1185/******************************************************************************/
1186/**
[169]1187 * @defgroup regfiIteratorLayer Iterator Layer: Primary regfi Library Interface
[168]1188 *
1189 * This top layer of API functions provides an iterator interface which makes
1190 * traversing registry data structures easy in both single-threaded and
1191 * multi-threaded scenarios.
1192 */
1193/******************************************************************************/
1194
1195/** Creates a new iterator for the provided registry file.
1196 *
1197 * @param file The opened registry file the iterator should be created for.
1198 *
1199 * @param output_encoding Character encoding that strings should be returned in.
1200 *                        Only supply the REGFI_ENCODING_* constants, as others
1201 *                        will be rejected.
1202 *                        The following values are currently accepted:
1203 *                        REGFI_ENCODING_DEFAULT (currently REGFI_ENCODING_ASCII)
1204 *                        REGFI_ENCODING_ASCII
1205 *                        REGFI_ENCODING_UTF8
1206 *
1207 * @return A newly allocated REGFI_ITERATOR.
1208 *         Must be free()d with regfi_iterator_free.
1209 *
[169]1210 * @ingroup regfiIteratorLayer
[168]1211 */
[238]1212_EXPORT()
[206]1213REGFI_ITERATOR* regfi_iterator_new(REGFI_FILE* file);
[166]1214
1215
[168]1216/** Frees a registry file iterator previously created by regfi_iterator_new.
[166]1217 *
1218 * This does not affect the underlying registry file's allocation status.
1219 *
[168]1220 * @param i the iterator to be freed
1221 *
[169]1222 * @ingroup regfiIteratorLayer
[166]1223 */
[238]1224_EXPORT()
[201]1225void regfi_iterator_free(REGFI_ITERATOR* i);
[166]1226
1227
[168]1228/** Traverse deeper into the registry tree at the current subkey.
[166]1229 *
[168]1230 * @param i the iterator
[166]1231 *
[168]1232 * @return  true on success, false on failure. 
1233 *          Note that subkey and value indexes are preserved.  That is, if a
1234 *          regfi_iterator_up call occurs later (reversing the effect of this
1235 *          call) then the subkey and value referenced prior to the
1236 *          regfi_iterator_down call will still be referenced.  This  makes
1237 *          depth-first iteration particularly easy.
1238 *
[169]1239 * @ingroup regfiIteratorLayer
[166]1240 */
[238]1241_EXPORT()
[201]1242bool regfi_iterator_down(REGFI_ITERATOR* i);
[166]1243
1244
[168]1245/** Traverse up to the current key's parent key.
[166]1246 *
[168]1247 * @param i the iterator
[166]1248 *
[168]1249 * @return  true on success, false on failure.  Any subkey or value state
1250 *          associated with the current key is lost.
1251 *
[169]1252 * @ingroup regfiIteratorLayer
[166]1253 */
[238]1254_EXPORT()
[201]1255bool regfi_iterator_up(REGFI_ITERATOR* i);
[166]1256
1257
[168]1258/** Traverse up to the root key of the hive.
[166]1259 *
[168]1260 * @param i the iterator
[166]1261 *
[168]1262 * @return true on success, false on failure.
1263 *
[169]1264 * @ingroup regfiIteratorLayer
[166]1265 */
[238]1266_EXPORT()
[201]1267bool regfi_iterator_to_root(REGFI_ITERATOR* i);
[30]1268
[166]1269
[168]1270/** Traverse down multiple levels in the registry hive.
[166]1271 *
1272 * XXX: This currently only accepts ASCII key names.  Need to look into
1273 *      accepting other encodings.
1274 *
[168]1275 * @param i    the iterator
1276 * @param path a list of key names representing the path.  This list must
1277 *             contain NUL terminated strings.  The list itself is
1278 *             terminated with a NULL pointer.  All path elements must be
1279 *             keys; value names are not accepted (even as the last
1280 *             element).
1281 *
1282 * @return true on success, false on failure.  If any element of path is not
1283 *                 found, false will be returned and the iterator will remain
1284 *                 in its original position.
1285 *
[169]1286 * @ingroup regfiIteratorLayer
[166]1287 */
[238]1288_EXPORT()
[168]1289bool regfi_iterator_walk_path(REGFI_ITERATOR* i, const char** path);
[166]1290
1291
[168]1292/** Returns the currently referenced key.
[166]1293 *
[168]1294 * @param i the iterator
[166]1295 *
[168]1296 * @return A read-only key structure for the current key, or NULL on failure.
[221]1297 *         Data structures must be freed with @ref regfi_free_record.
[168]1298 *
[169]1299 * @ingroup regfiIteratorLayer
[166]1300 */
[238]1301_EXPORT()
[203]1302const REGFI_NK* regfi_iterator_cur_key(REGFI_ITERATOR* i);
[166]1303
1304
[168]1305/** Sets the internal subkey index to the first subkey referenced by the current
[200]1306 *  key.
[166]1307 *
[168]1308 * @param i the iterator
[166]1309 *
[200]1310 * @return True if the current key has any subkeys, false otherwise.
[168]1311 *
[169]1312 * @ingroup regfiIteratorLayer
[166]1313 */
[238]1314_EXPORT()
[199]1315bool regfi_iterator_first_subkey(REGFI_ITERATOR* i);
[166]1316
1317
[168]1318/** Returns the currently indexed subkey.
[166]1319 *
[168]1320 * @param i the iterator
[166]1321 *
[168]1322 * @return A newly allocated key structure for the currently referenced subkey,
1323 *         or NULL on failure.  Newly allocated keys must be freed with
[185]1324 *         @ref regfi_free_record.
[168]1325 *
[169]1326 * @ingroup regfiIteratorLayer
[166]1327 */
[238]1328_EXPORT()
[203]1329const REGFI_NK* regfi_iterator_cur_subkey(REGFI_ITERATOR* i);
[167]1330
1331
[200]1332/** Increments the internal subkey index to the next key in the subkey-list.
[167]1333 *
[168]1334 * @param i the iterator
[167]1335 *
[200]1336 * @return True if another subkey should exist, false otherwise.
[168]1337 *
[169]1338 * @ingroup regfiIteratorLayer
[167]1339 */
[238]1340_EXPORT()
[199]1341bool regfi_iterator_next_subkey(REGFI_ITERATOR* i);
[167]1342
1343
[168]1344/** Searches for a subkey with a given name under the current key.
[167]1345 *
[207]1346 * @param i     the iterator
1347 * @param name  subkey name to search for
[167]1348 *
[168]1349 * @return True if such a subkey was found, false otherwise.  If a subkey is
1350 *         found, the current subkey index is set to that subkey.  Otherwise,
1351 *         the subkey index remains at the same location as before the call.
1352 *
[169]1353 * @ingroup regfiIteratorLayer
[167]1354 */
[238]1355_EXPORT()
[207]1356bool regfi_iterator_find_subkey(REGFI_ITERATOR* i, const char* name);
[150]1357
[184]1358
[168]1359/** Sets the internal value index to the first value referenced by the current
[200]1360 *  key.
[167]1361 *
[168]1362 * @param i the iterator
[167]1363 *
[200]1364 * @return True if the current key has any values, false otherwise.
[168]1365 *
[169]1366 * @ingroup regfiIteratorLayer
[167]1367 */
[238]1368_EXPORT()
[199]1369bool regfi_iterator_first_value(REGFI_ITERATOR* i);
[167]1370
1371
[168]1372/** Returns the currently indexed value.
[167]1373 *
[168]1374 * @param i the iterator
[167]1375 *
[168]1376 * @return A newly allocated value structure for the currently referenced value,
1377 *         or NULL on failure.  Newly allocated values must be freed with
[185]1378 *         @ref regfi_free_record.
[168]1379 *
[169]1380 * @ingroup regfiIteratorLayer
[167]1381 */
[238]1382_EXPORT()
[203]1383const REGFI_VK* regfi_iterator_cur_value(REGFI_ITERATOR* i);
[167]1384
1385
[200]1386/** Increments the internal value index to the next value in the value-list.
[167]1387 *
[168]1388 * @param i the iterator
[167]1389 *
[200]1390 * @return True if another value should exist, false otherwise.
[168]1391 *
[169]1392 * @ingroup regfiIteratorLayer
[167]1393 */
[238]1394_EXPORT()
[199]1395bool regfi_iterator_next_value(REGFI_ITERATOR* i);
[167]1396
1397
[168]1398/** Searches for a value with a given name under the current key.
[167]1399 *
[207]1400 * @param i     the iterator
1401 * @param name  value name to search for
[167]1402 *
[168]1403 * @return True if such a value was found, false otherwise.  If a value is
1404 *         found, the current value index is set to that value.  Otherwise,
1405 *         the value index remains at the same location as before the call.
1406 *
[169]1407 * @ingroup regfiIteratorLayer
[167]1408 */
[238]1409_EXPORT()
[207]1410bool regfi_iterator_find_value(REGFI_ITERATOR* i, const char* name);
[80]1411
[167]1412
[249]1413/** Returns the full path where the iterator is currently located as a list
1414 *  of NK records
1415 *
1416 * @param i     the iterator
1417 *
1418 * @return An array of NK record pointers terminated by a NULL pointer. 
1419 *         This array may be passed directly to regfi_free_record to free
1420 *         the entire array. 
1421 *
1422 * @note In order to use an element of the array independently from the
1423 *       array (that is, to hold a pointer to an individual NK record while
1424 *       freeing the remaining array), callers must first use
1425 *       regfi_reference_record on the elements to be kept.
1426 *
1427 * @ingroup regfiIteratorLayer
1428 */
1429_EXPORT()
1430const REGFI_NK** regfi_iterator_cur_path(REGFI_ITERATOR* i);
1431
1432
[168]1433/******************************************************************************/
1434/**
[169]1435 * @defgroup regfiGlueLayer Glue Layer: Logical Data Structure Loading
[168]1436 */
1437/******************************************************************************/
1438
[215]1439/** Loads a key and associated data structures given a file offset.
[168]1440 *
1441 * XXX: finish documenting
1442 *
[169]1443 * @ingroup regfiGlueLayer
[168]1444 */
[238]1445_EXPORT()
[203]1446REGFI_NK* regfi_load_key(REGFI_FILE* file, uint32_t offset, 
[215]1447                         REGFI_ENCODING output_encoding, 
1448                         bool strict);
[168]1449
1450
1451/** Loads a value at a given file offset alng with associated data structures.
1452 *
1453 * XXX: finish documenting
1454 *
[169]1455 * @ingroup regfiGlueLayer
[168]1456 */
[238]1457_EXPORT()
[203]1458REGFI_VK* regfi_load_value(REGFI_FILE* file, uint32_t offset, 
[201]1459                               REGFI_ENCODING output_encoding, 
1460                               bool strict);
[168]1461
1462
1463/** Loads a logical subkey list in its entirety which may span multiple records.
1464 *
1465 * XXX: finish documenting
1466 *
[169]1467 * @ingroup regfiGlueLayer
[168]1468 */
[238]1469_EXPORT()
[201]1470REGFI_SUBKEY_LIST* regfi_load_subkeylist(REGFI_FILE* file, uint32_t offset,
1471                                         uint32_t num_keys, uint32_t max_size,
1472                                         bool strict);
[168]1473
1474
1475/** Loads a valuelist.
1476 *
1477 * XXX: finish documenting
1478 *
[169]1479 * @ingroup regfiGlueLayer
[168]1480 */
[238]1481_EXPORT()
[201]1482REGFI_VALUE_LIST* regfi_load_valuelist(REGFI_FILE* file, uint32_t offset, 
1483                                       uint32_t num_values, uint32_t max_size,
1484                                       bool strict);
[127]1485
[168]1486
1487/** Loads a data record which may be contained in the virtual offset, in a
1488 *  single cell, or in multiple cells through big data records.
1489 *
1490 * XXX: finish documenting
1491 *
[169]1492 * @ingroup regfiGlueLayer
[168]1493 */
[238]1494_EXPORT()
[201]1495REGFI_BUFFER regfi_load_data(REGFI_FILE* file, uint32_t voffset,
1496                             uint32_t length, bool data_in_offset,
1497                             bool strict);
[157]1498
[168]1499
1500/** Loads the data associated with a big data record at the specified offset.
1501 *
1502 * XXX: finish documenting
1503 *
[169]1504 * @ingroup regfiGlueLayer
[168]1505 */
[238]1506_EXPORT()
[201]1507REGFI_BUFFER regfi_load_big_data(REGFI_FILE* file, uint32_t offset, 
1508                                 uint32_t data_length,uint32_t cell_length,
1509                                 range_list* used_ranges,
1510                                 bool strict);
[168]1511
1512
1513/** Given raw data, attempts to interpret the data based on a specified registry
1514 *  data type.
1515 *
1516 * XXX: finish documenting
1517 *
[169]1518 * @ingroup regfiGlueLayer
[168]1519 */
[238]1520_EXPORT()
[201]1521bool regfi_interpret_data(REGFI_FILE* file, 
1522                          REGFI_ENCODING string_encoding,
1523                          uint32_t type, REGFI_DATA* data);
[168]1524
1525
1526
[146]1527/* These are cached so return values don't need to be freed. */
[168]1528
1529/** Loads an "sk" security record at the specified offset.
1530 *
1531 * XXX: finish documenting
1532 *
[169]1533 * @ingroup regfiGlueLayer
[168]1534 */
[238]1535_EXPORT()
[203]1536const REGFI_SK* regfi_load_sk(REGFI_FILE* file, uint32_t offset,
[201]1537                                  bool strict);
[146]1538
1539
[206]1540
1541
[168]1542/** Retrieves the HBIN data structure stored at the specified offset.
1543 *
1544 * XXX: finish documenting
1545 *
[169]1546 * @ingroup regfiGlueLayer
[168]1547 */
[238]1548_EXPORT()
[201]1549const REGFI_HBIN* regfi_lookup_hbin(REGFI_FILE* file, uint32_t offset);
[168]1550
1551
1552
1553/******************************************************************************/
1554/**
[169]1555 * @defgroup regfiParseLayer Parsing Layer: Direct Data Structure Access
[168]1556 */
1557/******************************************************************************/
1558
[238]1559_EXPORT()
[201]1560REGFI_FILE* regfi_parse_regf(REGFI_RAW_FILE* file_cb, bool strict);
[80]1561
[238]1562_EXPORT()
[201]1563REGFI_HBIN* regfi_parse_hbin(REGFI_FILE* file, uint32_t offset, 
1564                             bool strict);
[99]1565
[201]1566
[168]1567/** Parses an NK record at the specified offset
[99]1568 *
[168]1569 * @param file     the registry file structure
1570 * @param offset   the offset of the cell (not the record) to be parsed.
1571 * @param max_size the maximum size the NK cell could be. (for validation)
1572 * @param strict   if true, rejects any malformed records.  Otherwise,
1573 *                 tries to minimally validate integrity.
1574 *
1575 * @return A newly allocated NK record structure, or NULL on failure.
1576 *
[169]1577 * @ingroup regfiParseLayer
[99]1578 */
[238]1579_EXPORT()
[203]1580REGFI_NK* regfi_parse_nk(REGFI_FILE* file, uint32_t offset,
[201]1581                             uint32_t max_size, bool strict);
[99]1582
[139]1583
[168]1584/** Parses a single cell containing a subkey-list record.
1585 *
1586 * XXX: finish documenting
1587 *
[169]1588 * @ingroup regfiParseLayer
[168]1589 */
[238]1590_EXPORT()
[201]1591REGFI_SUBKEY_LIST* regfi_parse_subkeylist(REGFI_FILE* file, uint32_t offset,
1592                                          uint32_t max_size, bool strict);
[103]1593
[111]1594
[168]1595/** Parses a VK (value) record at the specified offset
1596 *
1597 * XXX: finish documenting
1598 *
[169]1599 * @ingroup regfiParseLayer
[168]1600 */
[238]1601_EXPORT()
[203]1602REGFI_VK* regfi_parse_vk(REGFI_FILE* file, uint32_t offset, 
[201]1603                             uint32_t max_size, bool strict);
[168]1604
1605
1606/** Parses an SK (security) record at the specified offset
1607 *
1608 * XXX: finish documenting
1609 *
[169]1610 * @ingroup regfiParseLayer
[168]1611 */
[238]1612_EXPORT()
[203]1613REGFI_SK* regfi_parse_sk(REGFI_FILE* file, uint32_t offset, 
[201]1614                             uint32_t max_size, bool strict);
[168]1615
1616
1617/** Retrieves information on all cells in the registry hive which are
1618 *  currently in the unallocated status. 
1619 *
1620 * The unallocated status is determined based soley on the cell length sign.
1621 *
1622 * XXX: finish documenting
1623 *
[169]1624 * @ingroup regfiParseLayer
[168]1625 */
[238]1626_EXPORT()
[201]1627range_list* regfi_parse_unalloc_cells(REGFI_FILE* file);
[101]1628
[111]1629
[168]1630/** Helper function to parse a cell
1631 *
1632 * XXX: finish documenting
1633 *
[169]1634 * @ingroup regfiParseLayer
[168]1635 */
[238]1636_EXPORT()
[201]1637bool regfi_parse_cell(REGFI_RAW_FILE* file_cb, uint32_t offset,
1638                      uint8_t* hdr, uint32_t hdr_len,
1639                      uint32_t* cell_length, bool* unalloc);
[126]1640
[157]1641
[168]1642/** Parses a classname cell
1643 *
1644 * XXX: finish documenting
1645 *
[169]1646 * @ingroup regfiParseLayer
[168]1647 */
[238]1648_EXPORT()
[201]1649uint8_t* regfi_parse_classname(REGFI_FILE* file, uint32_t offset,
1650                               uint16_t* name_length, 
1651                               uint32_t max_size, bool strict);
[157]1652
1653
[168]1654/** Parses a single-cell data record
1655 *
1656 * XXX: finish documenting
1657 *
[169]1658 * @ingroup regfiParseLayer
[168]1659 */
[238]1660_EXPORT()
[201]1661REGFI_BUFFER regfi_parse_data(REGFI_FILE* file, uint32_t offset,
1662                              uint32_t length, bool strict);
[127]1663
[150]1664
[168]1665/** Parses a "little data" record which is stored entirely within the
1666 *  provided virtual offset.
1667 *
1668 * XXX: finish documenting
1669 *
[169]1670 * @ingroup regfiParseLayer
[168]1671 */
[238]1672_EXPORT()
[201]1673REGFI_BUFFER regfi_parse_little_data(REGFI_FILE* file, uint32_t voffset, 
1674                                     uint32_t length, bool strict);
[150]1675
[168]1676
1677/******************************************************************************/
[215]1678/*    Private (and undocumented) Functions                                    */
[168]1679/******************************************************************************/
[226]1680int64_t               regfi_raw_seek(REGFI_RAW_FILE* self, 
1681                                     uint64_t offset, int whence);
[178]1682ssize_t               regfi_raw_read(REGFI_RAW_FILE* self, 
1683                                     void* buf, size_t count);
[238]1684_EXPORT()
[226]1685uint64_t              regfi_seek(REGFI_RAW_FILE* file_cb, 
1686                                 uint64_t offset, int whence);
[238]1687_EXPORT()
[178]1688uint32_t              regfi_read(REGFI_RAW_FILE* file_cb, 
1689                                 uint8_t* buf, uint32_t* length);
1690
[238]1691_EXPORT()
[135]1692const char*           regfi_type_val2str(unsigned int val);
[238]1693_EXPORT()
[135]1694int                   regfi_type_str2val(const char* str);
[127]1695
[238]1696_EXPORT()
[135]1697char*                 regfi_get_sacl(WINSEC_DESC* sec_desc);
[238]1698_EXPORT()
[135]1699char*                 regfi_get_dacl(WINSEC_DESC* sec_desc);
[238]1700_EXPORT()
[135]1701char*                 regfi_get_owner(WINSEC_DESC* sec_desc);
[238]1702_EXPORT()
[135]1703char*                 regfi_get_group(WINSEC_DESC* sec_desc);
1704
[168]1705REGFI_SUBKEY_LIST*    regfi_merge_subkeylists(uint16_t num_lists, 
[135]1706                                              REGFI_SUBKEY_LIST** lists,
1707                                              bool strict);
[168]1708REGFI_SUBKEY_LIST*    regfi_load_subkeylist_aux(REGFI_FILE* file, uint32_t offset,
1709                                                uint32_t max_size, bool strict,
1710                                                uint8_t depth_left);
1711void                  regfi_add_message(REGFI_FILE* file, uint16_t msg_type, 
[138]1712                                        const char* fmt, ...);
[206]1713REGFI_NK*             regfi_copy_nk(const REGFI_NK* nk);
1714REGFI_VK*             regfi_copy_vk(const REGFI_VK* vk);
[238]1715_EXPORT()
[168]1716int32_t               regfi_calc_maxsize(REGFI_FILE* file, uint32_t offset);
1717int32_t               regfi_conv_charset(const char* input_charset, 
[161]1718                                         const char* output_charset,
[168]1719                                         uint8_t* input, char* output, 
1720                                         uint32_t input_len, uint32_t output_max);
[238]1721_EXPORT()
[159]1722REGFI_DATA*           regfi_buffer_to_data(REGFI_BUFFER raw_data);
[146]1723
[168]1724/* XXX: move to base API and document */
[238]1725_EXPORT()
[168]1726void                  regfi_unix2nt_time(REGFI_NTTIME* nt, time_t t);
[238]1727_EXPORT()
[219]1728double                regfi_nt2unix_time(const REGFI_NTTIME* nt);
[168]1729
1730
[238]1731_EXPORT()
[203]1732void regfi_interpret_keyname(REGFI_FILE* file, REGFI_NK* nk, 
[172]1733                             REGFI_ENCODING output_encoding, bool strict);
[238]1734_EXPORT()
[203]1735void regfi_interpret_valuename(REGFI_FILE* file, REGFI_VK* vk, 
[172]1736                               REGFI_ENCODING output_encoding, bool strict);
1737
[238]1738_EXPORT()
[202]1739void regfi_init();
[172]1740
[202]1741
[78]1742#endif  /* _REGFI_H */
Note: See TracBrowser for help on using the repository browser.