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
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
|
/*
ldb database library
Copyright (C) Andrew Tridgell 2004
Copyright (C) Stefan Metzmacher 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
* Author: Stefan Metzmacher
*/
#include "includes.h"
#include "ldb/include/ldb.h"
#include "ldb/include/ldb_private.h"
#include "ldb/ldb_tdb/ldb_tdb.h"
#define LDBLOCK "INT_LDBLOCK"
/*
casefold a dn. We need to uppercase the attribute names, and the
attribute values of case insensitive attributes. We also need to remove
extraneous spaces between elements
*/
static char *ltdb_dn_fold(struct ldb_module *module, const char *dn)
{
const char *dn_orig = dn;
struct ldb_context *ldb = module->ldb;
TALLOC_CTX *tmp_ctx = talloc_new(ldb);
char *ret;
size_t len;
ret = talloc_strdup(tmp_ctx, "");
if (ret == NULL) goto failed;
while ((len = strcspn(dn, ",")) > 0) {
char *p = strchr(dn, '=');
char *attr, *value;
int flags;
if (p == NULL || (p-dn) > len) goto failed;
attr = talloc_strndup(tmp_ctx, dn, p-dn);
if (attr == NULL) goto failed;
/* trim spaces from the attribute name */
while (' ' == *attr) attr++;
while (' ' == attr[strlen(attr)-1]) {
attr[strlen(attr)-1] = 0;
}
if (*attr == 0) goto failed;
value = talloc_strndup(tmp_ctx, p+1, len-(p+1-dn));
if (value == NULL) goto failed;
/* trim spaces from the value */
while (' ' == *value) value++;
while (' ' == value[strlen(value)-1]) {
value[strlen(value)-1] = 0;
}
if (*value == 0) goto failed;
flags = ltdb_attribute_flags(module, attr);
attr = ldb_casefold(ldb, attr);
if (attr == NULL) goto failed;
talloc_steal(tmp_ctx, attr);
if (flags & LTDB_FLAG_CASE_INSENSITIVE) {
value = ldb_casefold(ldb, value);
if (value == NULL) goto failed;
talloc_steal(tmp_ctx, value);
}
if (dn[len] == ',') {
ret = talloc_asprintf_append(ret, "%s=%s,", attr, value);
} else {
ret = talloc_asprintf_append(ret, "%s=%s", attr, value);
}
if (ret == NULL) goto failed;
dn += len;
if (*dn == ',') dn++;
}
talloc_steal(ldb, ret);
talloc_free(tmp_ctx);
return ret;
failed:
talloc_free(tmp_ctx);
return ldb_casefold(ldb, dn_orig);
}
/*
form a TDB_DATA for a record key
caller frees
note that the key for a record can depend on whether the
dn refers to a case sensitive index record or not
*/
struct TDB_DATA ltdb_key(struct ldb_module *module, const char *dn)
{
struct ldb_context *ldb = module->ldb;
TDB_DATA key;
char *key_str = NULL;
char *dn_folded = NULL;
const char *prefix = LTDB_INDEX ":";
const char *s;
int flags;
/*
most DNs are case insensitive. The exception is index DNs for
case sensitive attributes
there are 3 cases dealt with in this code:
1) if the dn doesn't start with @INDEX: then uppercase the attribute
names and the attributes values of case insensitive attributes
2) if the dn starts with @INDEX:attr and 'attr' is a case insensitive
attribute then uppercase whole dn
3) if the dn starts with @INDEX:attr and 'attr' is a case sensitive
attribute then uppercase up to the value of the attribute, but
not the value itself
*/
if (strncmp(dn, prefix, strlen(prefix)) == 0 &&
(s = strchr(dn+strlen(prefix), ':'))) {
char *attr_name, *attr_name_folded;
attr_name = talloc_strndup(ldb, dn+strlen(prefix), (s-(dn+strlen(prefix))));
if (!attr_name) {
goto failed;
}
flags = ltdb_attribute_flags(module, attr_name);
if (flags & LTDB_FLAG_CASE_INSENSITIVE) {
dn_folded = ldb_casefold(ldb, dn);
} else {
attr_name_folded = ldb_casefold(ldb, attr_name);
if (!attr_name_folded) {
goto failed;
}
dn_folded = talloc_asprintf(ldb, "%s:%s:%s",
prefix, attr_name_folded,
s+1);
talloc_free(attr_name_folded);
}
talloc_free(attr_name);
} else {
dn_folded = ltdb_dn_fold(module, dn);
}
if (!dn_folded) {
goto failed;
}
key_str = talloc_asprintf(ldb, "DN=%s", dn_folded);
talloc_free(dn_folded);
if (!key_str) {
goto failed;
}
key.dptr = key_str;
key.dsize = strlen(key_str)+1;
return key;
failed:
errno = ENOMEM;
key.dptr = NULL;
key.dsize = 0;
return key;
}
/*
lock the database for write - currently a single lock is used
*/
static int ltdb_lock(struct ldb_module *module, const char *lockname)
{
struct ltdb_private *ltdb = module->private_data;
TDB_DATA key;
int ret;
if (lockname == NULL) {
return -1;
}
key = ltdb_key(module, lockname);
if (!key.dptr) {
return -1;
}
ret = tdb_chainlock(ltdb->tdb, key);
talloc_free(key.dptr);
return ret;
}
/*
unlock the database after a ltdb_lock()
*/
static int ltdb_unlock(struct ldb_module *module, const char *lockname)
{
struct ltdb_private *ltdb = module->private_data;
TDB_DATA key;
if (lockname == NULL) {
return -1;
}
key = ltdb_key(module, lockname);
if (!key.dptr) {
return -1;
}
tdb_chainunlock(ltdb->tdb, key);
talloc_free(key.dptr);
return 0;
}
/*
lock the database for read - use by ltdb_search
*/
int ltdb_lock_read(struct ldb_module *module)
{
struct ltdb_private *ltdb = module->private_data;
TDB_DATA key;
int ret;
key = ltdb_key(module, LDBLOCK);
if (!key.dptr) {
return -1;
}
ret = tdb_chainlock_read(ltdb->tdb, key);
talloc_free(key.dptr);
return ret;
}
/*
unlock the database after a ltdb_lock_read()
*/
int ltdb_unlock_read(struct ldb_module *module)
{
struct ltdb_private *ltdb = module->private_data;
TDB_DATA key;
key = ltdb_key(module, LDBLOCK);
if (!key.dptr) {
return -1;
}
tdb_chainunlock_read(ltdb->tdb, key);
talloc_free(key.dptr);
return 0;
}
/*
we've made a modification to a dn - possibly reindex and
update sequence number
*/
static int ltdb_modified(struct ldb_module *module, const char *dn)
{
int ret = 0;
if (strcmp(dn, LTDB_INDEXLIST) == 0 ||
strcmp(dn, LTDB_ATTRIBUTES) == 0) {
ret = ltdb_reindex(module);
}
if (ret == 0 &&
strcmp(dn, LTDB_BASEINFO) != 0) {
ret = ltdb_increase_sequence_number(module);
}
return ret;
}
/*
store a record into the db
*/
int ltdb_store(struct ldb_module *module, const struct ldb_message *msg, int flgs)
{
struct ltdb_private *ltdb = module->private_data;
TDB_DATA tdb_key, tdb_data;
int ret;
tdb_key = ltdb_key(module, msg->dn);
if (!tdb_key.dptr) {
return -1;
}
ret = ltdb_pack_data(module, msg, &tdb_data);
if (ret == -1) {
talloc_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(module, msg);
if (ret == -1) {
tdb_delete(ltdb->tdb, tdb_key);
}
done:
talloc_free(tdb_key.dptr);
talloc_free(tdb_data.dptr);
return ret;
}
/*
add a record to the database
*/
static int ltdb_add(struct ldb_module *module, const struct ldb_message *msg)
{
struct ltdb_private *ltdb = module->private_data;
int ret;
ltdb->last_err_string = NULL;
if (ltdb_lock(module, LDBLOCK) != 0) {
return -1;
}
if (ltdb_cache_load(module) != 0) {
ltdb_unlock(module, LDBLOCK);
return -1;
}
ret = ltdb_store(module, msg, TDB_INSERT);
if (ret == 0) {
ltdb_modified(module, msg->dn);
}
ltdb_unlock(module, LDBLOCK);
return ret;
}
/*
delete a record from the database, not updating indexes (used for deleting
index records)
*/
int ltdb_delete_noindex(struct ldb_module *module, const char *dn)
{
struct ltdb_private *ltdb = module->private_data;
TDB_DATA tdb_key;
int ret;
tdb_key = ltdb_key(module, dn);
if (!tdb_key.dptr) {
return -1;
}
ret = tdb_delete(ltdb->tdb, tdb_key);
talloc_free(tdb_key.dptr);
return ret;
}
/*
delete a record from the database
*/
static int ltdb_delete(struct ldb_module *module, const char *dn)
{
struct ltdb_private *ltdb = module->private_data;
int ret;
struct ldb_message *msg = NULL;
ltdb->last_err_string = NULL;
if (ltdb_lock(module, LDBLOCK) != 0) {
return -1;
}
if (ltdb_cache_load(module) != 0) {
goto failed;
}
msg = talloc(module, struct ldb_message);
if (msg == NULL) {
goto failed;
}
/* in case any attribute of the message was indexed, we need
to fetch the old record */
ret = ltdb_search_dn1(module, dn, msg);
if (ret != 1) {
/* not finding the old record is an error */
goto failed;
}
ret = ltdb_delete_noindex(module, dn);
if (ret == -1) {
goto failed;
}
/* remove any indexed attributes */
ret = ltdb_index_del(module, msg);
if (ret == 0) {
ltdb_modified(module, dn);
}
talloc_free(msg);
ltdb_unlock(module, LDBLOCK);
return ret;
failed:
talloc_free(msg);
ltdb_unlock(module, LDBLOCK);
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)
{
unsigned int i;
for (i=0;i<msg->num_elements;i++) {
if (ldb_attr_cmp(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_context *ldb,
struct ldb_message *msg, struct ldb_message_element *el)
{
struct ldb_message_element *e2;
unsigned int i;
e2 = talloc_realloc(msg, 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 = talloc_array(msg->elements, struct ldb_val, el->num_values);
if (!e2->values) {
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_module *module,
struct ldb_context *ldb,
struct ldb_message *msg, const char *name)
{
unsigned int i, j;
for (i=0;i<msg->num_elements;i++) {
if (ldb_attr_cmp(msg->elements[i].name, name) == 0) {
for (j=0;j<msg->elements[i].num_values;j++) {
ltdb_index_del_value(module, msg->dn, &msg->elements[i], j);
}
talloc_free(msg->elements[i].values);
if (msg->num_elements > (i+1)) {
memmove(&msg->elements[i],
&msg->elements[i+1],
sizeof(struct ldb_message_element)*
(msg->num_elements - (i+1)));
}
msg->num_elements--;
i--;
msg->elements = talloc_realloc(msg, msg->elements,
struct ldb_message_element,
msg->num_elements);
}
}
return 0;
}
/*
delete all elements matching an attribute name/value
return 0 on success, -1 on failure
*/
static int msg_delete_element(struct ldb_module *module,
struct ldb_message *msg,
const char *name,
const struct ldb_val *val)
{
struct ldb_context *ldb = module->ldb;
unsigned int i;
int found;
struct ldb_message_element *el;
found = find_element(msg, name);
if (found == -1) {
return -1;
}
el = &msg->elements[found];
for (i=0;i<el->num_values;i++) {
if (ltdb_val_equal(module, msg->elements[i].name, &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--;
if (el->num_values == 0) {
return msg_delete_attribute(module, ldb, msg, name);
}
return 0;
}
}
return -1;
}
/*
modify a record - internal interface
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
*/
int ltdb_modify_internal(struct ldb_module *module, const struct ldb_message *msg)
{
struct ldb_context *ldb = module->ldb;
struct ltdb_private *ltdb = module->private_data;
TDB_DATA tdb_key, tdb_data;
struct ldb_message *msg2;
unsigned i, j;
int ret;
tdb_key = ltdb_key(module, msg->dn);
if (!tdb_key.dptr) {
return -1;
}
tdb_data = tdb_fetch(ltdb->tdb, tdb_key);
if (!tdb_data.dptr) {
talloc_free(tdb_key.dptr);
return -1;
}
msg2 = talloc(tdb_key.dptr, struct ldb_message);
if (msg2 == NULL) {
talloc_free(tdb_key.dptr);
return -1;
}
ret = ltdb_unpack_data(module, &tdb_data, msg2);
if (ret == -1) {
talloc_free(tdb_key.dptr);
free(tdb_data.dptr);
return -1;
}
if (!msg2->dn) {
msg2->dn = msg->dn;
}
for (i=0;i<msg->num_elements;i++) {
struct ldb_message_element *el = &msg->elements[i];
struct ldb_message_element *el2;
struct ldb_val *vals;
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, el->name);
if (ret == -1) {
if (msg_add_element(ldb, msg2, el) != 0) {
goto failed;
}
continue;
}
el2 = &msg2->elements[ret];
/* An attribute with this name already exists, add all
* values if they don't already exist. */
for (j=0;j<el->num_values;j++) {
if (ldb_msg_find_val(el2, &el->values[j])) {
ltdb->last_err_string =
"Type or value exists";
goto failed;
}
}
vals = talloc_realloc(msg2->elements, el2->values, struct ldb_val,
el2->num_values + el->num_values);
if (vals == NULL)
goto failed;
for (j=0;j<el->num_values;j++) {
vals[el2->num_values + j] =
ldb_val_dup(vals, &el->values[j]);
}
el2->values = vals;
el2->num_values += el->num_values;
break;
case LDB_FLAG_MOD_REPLACE:
/* replace all elements of this attribute name with the elements
listed. The attribute not existing is not an error */
msg_delete_attribute(module, ldb, msg2, msg->elements[i].name);
/* add the replacement element, if not empty */
if (msg->elements[i].num_values != 0 &&
msg_add_element(ldb, 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(module, ldb, msg2,
msg->elements[i].name) != 0) {
ltdb->last_err_string = "No such attribute";
goto failed;
}
break;
}
for (j=0;j<msg->elements[i].num_values;j++) {
if (msg_delete_element(module,
msg2,
msg->elements[i].name,
&msg->elements[i].values[j]) != 0) {
ltdb->last_err_string = "No such attribute";
goto failed;
}
if (ltdb_index_del_value(module, msg->dn, &msg->elements[i], j) != 0) {
goto failed;
}
}
break;
}
}
/* we've made all the mods - save the modified record back into the database */
ret = ltdb_store(module, msg2, TDB_MODIFY);
talloc_free(tdb_key.dptr);
free(tdb_data.dptr);
return ret;
failed:
talloc_free(tdb_key.dptr);
free(tdb_data.dptr);
return -1;
}
/*
modify a record
*/
static int ltdb_modify(struct ldb_module *module, const struct ldb_message *msg)
{
struct ltdb_private *ltdb = module->private_data;
int ret;
ltdb->last_err_string = NULL;
if (ltdb_lock(module, LDBLOCK) != 0) {
return -1;
}
if (ltdb_cache_load(module) != 0) {
ltdb_unlock(module, LDBLOCK);
return -1;
}
ret = ltdb_modify_internal(module, msg);
if (ret == 0) {
ltdb_modified(module, msg->dn);
}
ltdb_unlock(module, LDBLOCK);
return ret;
}
/*
rename a record
*/
static int ltdb_rename(struct ldb_module *module, const char *olddn, const char *newdn)
{
struct ltdb_private *ltdb = module->private_data;
int ret;
struct ldb_message *msg;
const char *error_str;
ltdb->last_err_string = NULL;
if (ltdb_lock(module, LDBLOCK) != 0) {
return -1;
}
msg = talloc(module, struct ldb_message);
if (msg == NULL) {
goto failed;
}
/* in case any attribute of the message was indexed, we need
to fetch the old record */
ret = ltdb_search_dn1(module, olddn, msg);
if (ret != 1) {
/* not finding the old record is an error */
goto failed;
}
msg->dn = talloc_strdup(msg, newdn);
if (!msg->dn) {
goto failed;
}
ret = ltdb_add(module, msg);
if (ret == -1) {
goto failed;
}
ret = ltdb_delete(module, olddn);
error_str = ltdb->last_err_string;
if (ret == -1) {
ltdb_delete(module, newdn);
}
ltdb->last_err_string = error_str;
talloc_free(msg);
ltdb_unlock(module, LDBLOCK);
return ret;
failed:
talloc_free(msg);
ltdb_unlock(module, LDBLOCK);
return -1;
}
/*
return extended error information
*/
static const char *ltdb_errstring(struct ldb_module *module)
{
struct ltdb_private *ltdb = module->private_data;
if (ltdb->last_err_string) {
return ltdb->last_err_string;
}
return tdb_errorstr(ltdb->tdb);
}
static const struct ldb_module_ops ltdb_ops = {
"tdb",
ltdb_search,
ltdb_add,
ltdb_modify,
ltdb_delete,
ltdb_rename,
ltdb_lock,
ltdb_unlock,
ltdb_errstring
};
/*
destroy the ltdb context
*/
static int ltdb_destructor(void *p)
{
struct ltdb_private *ltdb = p;
tdb_close(ltdb->tdb);
return 0;
}
/*
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;
ldb = talloc_zero(NULL, struct ldb_context);
if (!ldb) {
errno = ENOMEM;
return NULL;
}
/* parse the url */
if (strchr(url, ':')) {
if (strncmp(url, "tdb://", 6) != 0) {
errno = EINVAL;
talloc_free(ldb);
return NULL;
}
path = url+6;
} else {
path = url;
}
tdb_flags = TDB_DEFAULT;
if (flags & LDB_FLG_RDONLY) {
open_flags = O_RDONLY;
} else {
open_flags = O_CREAT | O_RDWR;
}
/* note that we use quite a large default hash size */
tdb = tdb_open(path, 10000, tdb_flags, open_flags, 0666);
if (!tdb) {
talloc_free(ldb);
return NULL;
}
ltdb = talloc_zero(ldb, struct ltdb_private);
if (!ltdb) {
tdb_close(tdb);
talloc_free(ldb);
errno = ENOMEM;
return NULL;
}
ltdb->tdb = tdb;
ltdb->sequence_number = 0;
talloc_set_destructor(ltdb, ltdb_destructor);
ldb->modules = talloc(ldb, struct ldb_module);
if (!ldb->modules) {
talloc_free(ldb);
errno = ENOMEM;
return NULL;
}
ldb->modules->ldb = ldb;
ldb->modules->prev = ldb->modules->next = NULL;
ldb->modules->private_data = ltdb;
ldb->modules->ops = <db_ops;
return ldb;
}
|