1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
|
/*
ldb database library
Copyright (C) Andrew Tridgell 2004
** NOTE! The following LGPL license applies to the ldb
** library. This does NOT imply that all of Samba is released
** under the LGPL
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
/*
* Name: ldb
*
* Component: ldb tdb backend
*
* Description: core functions for tdb backend
*
* Author: Andrew Tridgell
*/
#include "includes.h"
#include "ldb_tdb/ldb_tdb.h"
/*
form a TDB_DATA for a record key
caller frees
*/
struct TDB_DATA ltdb_key(const char *dn)
{
TDB_DATA key;
char *key_str = NULL;
asprintf(&key_str, "DN=%s", dn);
if (!key_str) {
errno = ENOMEM;
key.dptr = NULL;
key.dsize = 0;
return key;
}
key.dptr = key_str;
key.dsize = strlen(key_str)+1;
return key;
}
/*
lock the database for write - currently a single lock is used
*/
static int ltdb_lock(struct ldb_context *ldb)
{
struct ltdb_private *ltdb = ldb->private;
TDB_DATA key;
int ret;
key = ltdb_key("LDBLOCK");
if (!key.dptr) {
return -1;
}
ret = tdb_chainlock(ltdb->tdb, key);
free(key.dptr);
return ret;
}
/*
unlock the database after a ltdb_lock()
*/
static void ltdb_unlock(struct ldb_context *ldb)
{
struct ltdb_private *ltdb = ldb->private;
TDB_DATA key;
key = ltdb_key("LDBLOCK");
if (!key.dptr) {
return;
}
tdb_chainunlock(ltdb->tdb, key);
free(key.dptr);
}
/*
store a record into the db
*/
int ltdb_store(struct ldb_context *ldb, const struct ldb_message *msg, int flgs)
{
struct ltdb_private *ltdb = ldb->private;
TDB_DATA tdb_key, tdb_data;
int ret;
tdb_key = ltdb_key(msg->dn);
if (!tdb_key.dptr) {
return -1;
}
ret = ltdb_pack_data(ldb, msg, &tdb_data);
if (ret == -1) {
free(tdb_key.dptr);
return -1;
}
ret = tdb_store(ltdb->tdb, tdb_key, tdb_data, flgs);
if (ret == -1) {
goto done;
}
ret = ltdb_index_add(ldb, msg);
if (ret == -1) {
tdb_delete(ltdb->tdb, tdb_key);
}
done:
free(tdb_key.dptr);
free(tdb_data.dptr);
return ret;
}
/*
add a record to the database
*/
static int ltdb_add(struct ldb_context *ldb, const struct ldb_message *msg)
{
int ret;
if (ltdb_lock(ldb) != 0) {
return -1;
}
ret = ltdb_store(ldb, msg, TDB_INSERT);
ltdb_unlock(ldb);
return ret;
}
/*
delete a record from the database, not updating indexes (used for deleting
index records)
*/
int ltdb_delete_noindex(struct ldb_context *ldb, const char *dn)
{
struct ltdb_private *ltdb = ldb->private;
TDB_DATA tdb_key;
int ret;
tdb_key = ltdb_key(dn);
if (!tdb_key.dptr) {
return -1;
}
ret = tdb_delete(ltdb->tdb, tdb_key);
free(tdb_key.dptr);
return ret;
}
/*
delete a record from the database
*/
static int ltdb_delete(struct ldb_context *ldb, const char *dn)
{
int ret;
struct ldb_message msg;
if (ltdb_lock(ldb) != 0) {
return -1;
}
/* in case any attribute of the message was indexed, we need
to fetch the old record */
ret = ltdb_search_dn1(ldb, dn, &msg);
if (ret != 1) {
/* not finding the old record is an error */
goto failed;
}
ret = ltdb_delete_noindex(ldb, dn);
if (ret == -1) {
ltdb_search_dn1_free(ldb, &msg);
goto failed;
}
/* remove any indexed attributes */
ret = ltdb_index_del(ldb, &msg);
ltdb_search_dn1_free(ldb, &msg);
ltdb_unlock(ldb);
return ret;
failed:
ltdb_unlock(ldb);
return -1;
}
/*
find an element by attribute name. At the moment this does a linear search, it should
be re-coded to use a binary search once all places that modify records guarantee
sorted order
return the index of the first matching element if found, otherwise -1
*/
static int find_element(const struct ldb_message *msg, const char *name)
{
int i;
for (i=0;i<msg->num_elements;i++) {
if (strcmp(msg->elements[i].name, name) == 0) {
return i;
}
}
return -1;
}
/*
add an element to an existing record. Assumes a elements array that we
can call re-alloc on, and assumed that we can re-use the data pointers from the
passed in additional values. Use with care!
returns 0 on success, -1 on failure (and sets errno)
*/
static int msg_add_element(struct ldb_message *msg, struct ldb_message_element *el)
{
struct ldb_message_element *e2;
int i;
e2 = realloc_p(msg->elements, struct ldb_message_element,
msg->num_elements+1);
if (!e2) {
errno = ENOMEM;
return -1;
}
msg->elements = e2;
e2 = &msg->elements[msg->num_elements];
e2->name = el->name;
e2->flags = el->flags;
e2->values = NULL;
if (el->num_values != 0) {
e2->values = malloc_array_p(struct ldb_val, el->num_values);
if (!e2->values) {
free(e2->name);
errno = ENOMEM;
return -1;
}
}
for (i=0;i<el->num_values;i++) {
e2->values[i] = el->values[i];
}
e2->num_values = el->num_values;
msg->num_elements++;
return 0;
}
/*
delete all elements having a specified attribute name
*/
static int msg_delete_attribute(struct ldb_message *msg, const char *name)
{
int i, count=0;
struct ldb_message_element *el2;
el2 = malloc_array_p(struct ldb_message_element, msg->num_elements);
if (!el2) {
errno = ENOMEM;
return -1;
}
for (i=0;i<msg->num_elements;i++) {
if (strcmp(msg->elements[i].name, name) != 0) {
el2[count++] = msg->elements[i];
} else {
if (msg->elements[i].values) free(msg->elements[i].values);
}
}
msg->num_elements = count;
if (msg->elements) free(msg->elements);
msg->elements = el2;
return 0;
}
/*
delete all elements matching an attribute name/value
return 0 on success, -1 on failure
*/
static int msg_delete_element(struct ldb_message *msg,
const char *name,
const struct ldb_val *val)
{
int i;
struct ldb_message_element *el;
i = find_element(msg, name);
if (i == -1) {
return -1;
}
el = &msg->elements[i];
for (i=0;i<el->num_values;i++) {
if (ldb_val_equal(&el->values[i], val)) {
if (i<el->num_values-1) {
memmove(&el->values[i], &el->values[i+1],
sizeof(el->values[i])*el->num_values-(i+1));
}
el->num_values--;
return 0;
}
}
return -1;
}
/*
modify a record
yuck - this is O(n^2). Luckily n is usually small so we probably
get away with it, but if we ever have really large attribute lists
then we'll need to look at this again
*/
static int ltdb_modify(struct ldb_context *ldb, const struct ldb_message *msg)
{
struct ltdb_private *ltdb = ldb->private;
TDB_DATA tdb_key, tdb_data;
struct ldb_message msg2;
int ret, i, j;
if (ltdb_lock(ldb) != 0) {
return -1;
}
tdb_key = ltdb_key(msg->dn);
if (!tdb_key.dptr) {
goto unlock_fail;
}
tdb_data = tdb_fetch(ltdb->tdb, tdb_key);
if (!tdb_data.dptr) {
free(tdb_key.dptr);
goto unlock_fail;
}
ret = ltdb_unpack_data(ldb, &tdb_data, &msg2);
if (ret == -1) {
free(tdb_key.dptr);
free(tdb_data.dptr);
goto unlock_fail;
}
msg2.dn = msg->dn;
for (i=0;i<msg->num_elements;i++) {
switch (msg->elements[i].flags & LDB_FLAG_MOD_MASK) {
case LDB_FLAG_MOD_ADD:
/* add this element to the message. fail if it
already exists */
ret = find_element(&msg2, msg->elements[i].name);
if (ret != -1) {
errno = EEXIST;
goto failed;
}
if (msg_add_element(&msg2, &msg->elements[i]) != 0) {
goto failed;
}
break;
case LDB_FLAG_MOD_REPLACE:
/* replace all elements of this attribute name with the elements
listed */
if (msg_delete_attribute(&msg2, msg->elements[i].name) != 0) {
goto failed;
}
/* add the replacement element */
if (msg_add_element(&msg2, &msg->elements[i]) != 0) {
goto failed;
}
break;
case LDB_FLAG_MOD_DELETE:
/* we could be being asked to delete all
values or just some values */
if (msg->elements[i].num_values == 0) {
if (msg_delete_attribute(&msg2,
msg->elements[i].name) != 0) {
goto failed;
}
break;
}
for (j=0;j<msg->elements[i].num_values;j++) {
if (msg_delete_element(&msg2,
msg->elements[i].name,
&msg->elements[i].values[j]) != 0) {
goto failed;
}
}
break;
}
}
/* we've made all the mods - save the modified record back into the database */
ret = ltdb_store(ldb, &msg2, TDB_MODIFY);
free(tdb_key.dptr);
free(tdb_data.dptr);
ltdb_unpack_data_free(&msg2);
ltdb_unlock(ldb);
return ret;
failed:
free(tdb_key.dptr);
free(tdb_data.dptr);
ltdb_unpack_data_free(&msg2);
unlock_fail:
ltdb_unlock(ldb);
return -1;
}
/*
close database
*/
static int ltdb_close(struct ldb_context *ldb)
{
struct ltdb_private *ltdb = ldb->private;
int ret;
ret = tdb_close(ltdb->tdb);
free(ltdb);
free(ldb);
return ret;
}
/*
return extended error information
*/
static const char *ltdb_errstring(struct ldb_context *ldb)
{
struct ltdb_private *ltdb = ldb->private;
return tdb_errorstr(ltdb->tdb);
}
static const struct ldb_backend_ops ltdb_ops = {
ltdb_close,
ltdb_search,
ltdb_search_free,
ltdb_add,
ltdb_modify,
ltdb_delete,
ltdb_errstring
};
/*
connect to the database
*/
struct ldb_context *ltdb_connect(const char *url,
unsigned int flags,
const char *options[])
{
const char *path;
int tdb_flags, open_flags;
struct ltdb_private *ltdb;
TDB_CONTEXT *tdb;
struct ldb_context *ldb;
/* parse the url */
if (strncmp(url, "tdb://", 6) != 0) {
errno = EINVAL;
return NULL;
}
path = url+6;
tdb_flags = TDB_DEFAULT;
if (flags & LDB_FLG_RDONLY) {
open_flags = O_RDONLY;
} else {
open_flags = O_CREAT | O_RDWR;
}
tdb = tdb_open(path, 0, tdb_flags, open_flags, 0666);
if (!tdb) {
return NULL;
}
ltdb = malloc_p(struct ltdb_private);
if (!ltdb) {
tdb_close(tdb);
errno = ENOMEM;
return NULL;
}
ltdb->tdb = tdb;
ldb = malloc_p(struct ldb_context);
if (!ldb) {
tdb_close(tdb);
free(ltdb);
errno = ENOMEM;
return NULL;
}
ldb->private = ltdb;
ldb->ops = <db_ops;
return ldb;
}
|