1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
|
/*
* Unix SMB/CIFS implementation.
* RPC Pipe client / server routines
* 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.
*/
/* Implementation of registry frontend view functions. */
#include "includes.h"
#include "lib/registry/common/registry.h"
#undef DBGC_CLASS
#define DBGC_CLASS DBGC_RPC_SRV
/***********************************************************************
allocate memory for and duplicate a REG_VAL.
This is malloc'd memory so the caller should free it when done
**********************************************************************/
REG_VAL* reg_val_dup( REG_VAL *val )
{
val->ref++;
return val;
}
/**********************************************************************
free the memory allocated to a REG_VAL
*********************************************************************/
void reg_val_free( REG_VAL *val )
{
if ( !val )
return;
val->ref--;
if(val->ref) return;
if(val->handle->functions->free_val_backend_data)
val->handle->functions->free_val_backend_data(val);
talloc_destroy( val->mem_ctx );
return;
}
/**********************************************************************
*********************************************************************/
uint8* reg_val_data_blk( REG_VAL *val )
{
return val->data_blk;
}
/**********************************************************************
*********************************************************************/
int reg_val_size( REG_VAL *val )
{
return val->data_len;
}
/**********************************************************************
*********************************************************************/
char *reg_val_name( REG_VAL *val )
{
return val->name;
}
/**********************************************************************
*********************************************************************/
uint32 reg_val_type( REG_VAL *val )
{
return val->data_type;
}
/**********************************************************************
*********************************************************************/
REG_HANDLE *reg_key_handle (REG_KEY *key)
{
return key->handle;
}
char *reg_key_name( REG_KEY *key )
{
return key->name;
}
REG_KEY *reg_key_dup(REG_KEY *key)
{
key->ref++;
return key;
}
void reg_key_free(REG_KEY *key)
{
if(!key)
return;
key->ref--;
if(key->ref) return;
if(key->handle->functions->free_key_backend_data)
key->handle->functions->free_key_backend_data(key);
if(key->cache_values) {
int i;
for(i = 0; i < key->cache_values_count; i++) {
reg_val_free(key->cache_values[i]);
}
}
if(key->cache_subkeys) {
int i;
for(i = 0; i < key->cache_subkeys_count; i++) {
reg_key_free(key->cache_subkeys[i]);
}
}
talloc_destroy(key->mem_ctx);
}
char *reg_val_get_path(REG_VAL *v)
{
/* FIXME */
return NULL;
}
const char *reg_key_get_path(REG_KEY *k)
{
SMB_REG_ASSERT(k);
return strchr(k->path, '\\')?strchr(k->path, '\\')+1:"";
}
const char *reg_key_get_path_abs(REG_KEY *k)
{
SMB_REG_ASSERT(k);
return k->path;
}
/* For use by the backends _ONLY_ */
REG_KEY *reg_key_new_abs(const char *path, REG_HANDLE *h, void *data)
{
REG_KEY *r;
TALLOC_CTX *mem_ctx = talloc_init(path);
r = talloc(mem_ctx, sizeof(REG_KEY));
ZERO_STRUCTP(r);
r->handle = h;
r->mem_ctx = mem_ctx;
r->path = talloc_strdup(mem_ctx, path);
r->name = talloc_strdup(mem_ctx, strrchr(path, '\\')?strrchr(path,'\\')+1:path);
r->backend_data = data;
r->ref = 1;
return r;
}
REG_KEY *reg_key_new_rel(const char *name, REG_KEY *k, void *data)
{
REG_KEY *r;
const char *parent_path = k?reg_key_get_path(k):"";
TALLOC_CTX *mem_ctx = talloc_init(name);
r = talloc(mem_ctx, sizeof(REG_KEY));
ZERO_STRUCTP(r);
r->handle = k->handle;
r->hive = k->hive;
r->name = talloc_strdup(mem_ctx, name);
r->path = talloc_asprintf(mem_ctx, "%s%s%s", parent_path, *parent_path && parent_path[strlen(parent_path)-1] != '\\'?"\\":"", name);
r->backend_data = data;
r->mem_ctx = mem_ctx;
r->ref = 1;
return r;
}
REG_VAL *reg_val_new(REG_KEY *parent, void *data)
{
REG_VAL *r;
TALLOC_CTX *mem_ctx = talloc_init("value");
r = talloc(mem_ctx, sizeof(REG_VAL));
ZERO_STRUCTP(r);
r->mem_ctx = mem_ctx;
r->handle = parent->handle;
r->backend_data = data;
r->ref = 1;
return r;
}
|
