1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
|
/*
Unix SMB/CIFS implementation.
Registry interface
Copyright (C) Gerald Carter 2002.
Copyright (C) Jelmer Vernooij 2003-2004.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#ifndef _REGISTRY_H /* _REGISTRY_H */
#define _REGISTRY_H
#define HKEY_CLASSES_ROOT 0x80000000
#define HKEY_CURRENT_USER 0x80000001
#define HKEY_LOCAL_MACHINE 0x80000002
#define HKEY_USERS 0x80000003
/* Registry data types */
#define REG_DELETE -1
#define REG_NONE 0
#define REG_SZ 1
#define REG_EXPAND_SZ 2
#define REG_BINARY 3
#define REG_DWORD 4
#define REG_DWORD_LE 4 /* DWORD, little endian*/
#define REG_DWORD_BE 5 /* DWORD, big endian */
#define REG_LINK 6
#define REG_MULTI_SZ 7
#define REG_RESOURCE_LIST 8
#define REG_FULL_RESOURCE_DESCRIPTOR 9
#define REG_RESOURCE_REQUIREMENTS_LIST 10
#if 0
/* FIXME */
typedef struct ace_struct_s {
uint8_t type, flags;
uint_t perms; /* Perhaps a better def is in order */
DOM_SID *trustee;
} ACE;
#endif
/*
* The general idea here is that every backend provides a 'hive'. Combining
* various hives gives you a complete registry like windows has
*/
#define REGISTRY_INTERFACE_VERSION 1
/* structure to store the registry handles */
struct registry_key {
char *name; /* Name of the key */
char *path; /* Full path to the key */
char *class_name; /* Name of key class */
NTTIME last_mod; /* Time last modified */
SEC_DESC *security;
struct registry_hive *hive;
void *backend_data;
int ref;
};
struct registry_value {
char *name;
unsigned int data_type;
int data_len;
void *data_blk; /* Might want a separate block */
struct registry_hive *hive;
struct registry_key *parent;
void *backend_data;
int ref;
};
/* FIXME */
typedef void (*key_notification_function) (void);
typedef void (*value_notification_function) (void);
/*
* Container for function pointers to enumeration routines
* for virtual registry view
*
* Backends can provide :
* - just one hive (example: nt4, w95)
* - several hives (example: rpc)
*
*/
struct registry_operations {
const char *name;
/* If one file, connection, etc may have more then one hive */
WERROR (*list_available_hives) (TALLOC_CTX *, const char *location, const char *credentials, char ***hives);
/* Implement this one */
WERROR (*open_hive) (TALLOC_CTX *, struct registry_hive *, struct registry_key **);
WERROR (*close_hive) (struct registry_hive *);
/* Or this one */
WERROR (*open_key) (TALLOC_CTX *, struct registry_hive *, const char *name, struct registry_key **);
/* Either implement these */
WERROR (*num_subkeys) (struct registry_key *, int *count);
WERROR (*num_values) (struct registry_key *, int *count);
WERROR (*get_subkey_by_index) (TALLOC_CTX *, struct registry_key *, int idx, struct registry_key **);
/* Can not contain more then one level */
WERROR (*get_subkey_by_name) (TALLOC_CTX *, struct registry_key *, const char *name, struct registry_key **);
WERROR (*get_value_by_index) (TALLOC_CTX *, struct registry_key *, int idx, struct registry_value **);
/* Can not contain more then one level */
WERROR (*get_value_by_name) (TALLOC_CTX *, struct registry_key *, const char *name, struct registry_value **);
/* Security control */
WERROR (*key_get_sec_desc) (TALLOC_CTX *, struct registry_key *, SEC_DESC **);
WERROR (*key_set_sec_desc) (struct registry_key *, SEC_DESC *);
/* Notification */
WERROR (*request_key_change_notify) (struct registry_key *, key_notification_function);
WERROR (*request_value_change_notify) (struct registry_value *, value_notification_function);
/* Key management */
WERROR (*add_key)(TALLOC_CTX *, struct registry_key *, const char *name, uint32_t access_mask, SEC_DESC *, struct registry_key **);
WERROR (*del_key)(struct registry_key *);
WERROR (*flush_key) (struct registry_key *);
/* Value management */
WERROR (*set_value)(struct registry_key *, const char *name, int type, void *data, int len);
WERROR (*del_value)(struct registry_value *);
};
struct registry_hive {
const struct registry_operations *functions;
char *name; /* usually something like HKEY_CURRENT_USER, etc */
char *location;
char *credentials;
char *backend_hivename;
void *backend_data;
struct registry_key *root;
struct registry_context *reg_ctx;
};
/* Handle to a full registry
* contains zero or more hives */
struct registry_context {
TALLOC_CTX *mem_ctx;
int num_hives;
struct registry_hive **hives;
};
struct reg_init_function_entry {
/* Function to create a member of the pdb_methods list */
const struct registry_operations *functions;
struct reg_init_function_entry *prev, *next;
};
/* Used internally */
#define SMB_REG_ASSERT(a) { if(!(a)) { DEBUG(0,("%s failed! (%s:%d)", #a, __FILE__, __LINE__)); }}
#endif /* _REGISTRY_H */
|
