-
Notifications
You must be signed in to change notification settings - Fork 909
/
db_berkeley.c
1252 lines (1035 loc) · 25.4 KB
/
db_berkeley.c
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
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* db_berkeley module, portions of this code were templated using
* the dbtext and postgres modules.
* Copyright (C) 2007 Cisco Systems
*
* This file is part of Kamailio, a free SIP server.
*
* Kamailio 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
*
* Kamailio 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
*/
/*! \file
* Berkeley DB :
*
* \ingroup database
*/
#include <stdio.h>
#include <unistd.h>
#include <sys/stat.h>
#include "../../core/str.h"
#include "../../core/ut.h"
#include "../../core/mem/mem.h"
#include "../../core/sr_module.h"
#include "../../core/rpc.h"
#include "../../core/rpc_lookup.h"
#include "../../lib/srdb1/db_res.h"
#include "../../lib/srdb1/db.h"
#include "../../lib/srdb1/db_query.h"
#include "db_berkeley.h"
#include "km_bdb_lib.h"
#include "km_bdb_res.h"
#include "bdb_mod.h"
#include "bdb_crs_compat.h"
#ifndef CFG_DIR
#define CFG_DIR "/tmp"
#endif
#define BDB_ID "berkeley://"
#define BDB_ID_LEN (sizeof(BDB_ID) - 1)
#define BDB_PATH_LEN 256
#define BDB_KEY 1
#define BDB_VALUE 0
/*MODULE_VERSION*/
int bdb_bind_api(db_func_t *dbb);
static int db_berkeley_init_rpc(void);
/* clang-format off */
/*
* Exported functions
*/
static cmd_export_t cmds[] = {
{"db_bind_api", (cmd_function)bdb_bind_api, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0}
};
/*
* Exported parameters
*/
static param_export_t params[] = {
{"auto_reload", INT_PARAM, &auto_reload },
{"log_enable", INT_PARAM, &log_enable },
{"journal_roll_interval", INT_PARAM, &journal_roll_interval },
{0, 0, 0}
};
struct module_exports kam_exports = {
"db_berkeley",
DEFAULT_DLFLAGS,/* dlopen flags */
cmds, /* Exported functions */
params, /* Exported parameters */
0, /* exported·RPC·method */
0, /* exported pseudo-variables */
0, /* response·function */
km_mod_init, /* module initialization function */
0, /* per-child init function */
km_destroy /* destroy function */
};
/* clang-format on */
int km_mod_init(void)
{
db_parms_t p;
if(db_berkeley_init_rpc() < 0) {
LM_ERR("failed to register RPC commands\n");
return -1;
}
p.auto_reload = auto_reload;
p.log_enable = log_enable;
p.cache_size = (4 * 1024 * 1024); //4Mb
p.journal_roll_interval = journal_roll_interval;
if(km_bdblib_init(&p))
return -1;
return 0;
}
void km_destroy(void)
{
km_bdblib_destroy();
}
int bdb_bind_api(db_func_t *dbb)
{
if(dbb == NULL)
return -1;
memset(dbb, 0, sizeof(db_func_t));
dbb->use_table = bdb_use_table;
dbb->init = bdb_init;
dbb->close = bdb_close;
dbb->query = (db_query_f)km_bdb_query;
dbb->free_result = bdb_free_query;
dbb->insert = (db_insert_f)bdb_insert;
dbb->delete = (db_delete_f)bdb_delete;
dbb->update = (db_update_f)bdb_update;
return 0;
}
int bdb_use_table(db1_con_t *_h, const str *_t)
{
return db_use_table(_h, _t);
}
/*
* Initialize database connection
*/
db1_con_t *bdb_init(const str *_sqlurl)
{
db1_con_t *_res;
str _s;
char bdb_path[BDB_PATH_LEN];
if(!_sqlurl || !_sqlurl->s) {
LM_ERR("invalid parameter value\n");
return 0;
}
_s.s = _sqlurl->s;
_s.len = _sqlurl->len;
if(_s.len <= BDB_ID_LEN || strncmp(_s.s, BDB_ID, BDB_ID_LEN) != 0) {
LM_ERR("invalid database URL - should be:"
" <%s[/]path/to/directory>\n",
BDB_ID);
return NULL;
}
_s.s += BDB_ID_LEN;
_s.len -= BDB_ID_LEN;
if(_s.s[0] != '/') {
if(sizeof(CFG_DIR) + _s.len + 2 > BDB_PATH_LEN) {
LM_ERR("path to database is too long\n");
return NULL;
}
strcpy(bdb_path, CFG_DIR);
bdb_path[sizeof(CFG_DIR)] = '/';
strncpy(&bdb_path[sizeof(CFG_DIR) + 1], _s.s, _s.len);
_s.len += sizeof(CFG_DIR);
_s.s = bdb_path;
}
_res = pkg_malloc(sizeof(db1_con_t) + sizeof(bdb_con_t));
if(!_res) {
LM_ERR("No private memory left\n");
return NULL;
}
memset(_res, 0, sizeof(db1_con_t) + sizeof(bdb_con_t));
_res->tail = (unsigned long)((char *)_res + sizeof(db1_con_t));
LM_INFO("using database at: %.*s\n", _s.len, _s.s);
BDB_CON_CONNECTION(_res) = km_bdblib_get_db(&_s);
if(!BDB_CON_CONNECTION(_res)) {
LM_ERR("cannot get the link to database\n");
return NULL;
}
return _res;
}
/*
* Close a database connection
*/
void bdb_close(db1_con_t *_h)
{
if(BDB_CON_RESULT(_h))
db_free_result(BDB_CON_RESULT(_h));
pkg_free(_h);
}
/*
* n can be the dbenv path or a table name
*/
int bdb_reload(char *_n)
{
int rc = 0;
#ifdef BDB_EXTRA_DEBUG
LM_DBG("[bdb_reload] Initiate RELOAD in %s\n", _n);
#endif
if((rc = km_bdblib_close(_n)) != 0) {
LM_ERR("[bdb_reload] Error while closing db_berkeley DB.\n");
return rc;
}
if((rc = km_bdblib_reopen(_n)) != 0) {
LM_ERR("[bdb_reload] Error while reopening db_berkeley DB.\n");
return rc;
}
#ifdef BDB_EXTRA_DEBUG
LM_DBG("[bdb_reload] RELOAD successful in %s\n", _n);
#endif
return rc;
}
/*
* Attempts to reload a Berkeley database; reloads when the inode changes
*/
void bdb_check_reload(db1_con_t *_con)
{
str s;
char *p;
int rc, len;
struct stat st;
database_p db;
char n[MAX_ROW_SIZE];
char t[MAX_TABLENAME_SIZE];
table_p tp = NULL;
tbl_cache_p tbc = NULL;
p = n;
rc = len = 0;
/*get dbenv name*/
db = BDB_CON_CONNECTION(_con);
if(!db->dbenv)
return;
s.s = db->name.s;
s.len = db->name.len;
len += s.len;
if(len > MAX_ROW_SIZE) {
LM_ERR("dbenv name too long \n");
return;
}
strncpy(p, s.s, s.len);
p += s.len;
len++;
if(len > MAX_ROW_SIZE) {
LM_ERR("dbenv name too long \n");
return;
}
/*append slash */
*p = '/';
p++;
/*get table name*/
s.s = CON_TABLE(_con)->s;
s.len = CON_TABLE(_con)->len;
len += s.len;
if((len > MAX_ROW_SIZE) || (s.len > MAX_TABLENAME_SIZE)) {
LM_ERR("table name too long \n");
return;
}
strncpy(t, s.s, s.len);
t[s.len] = 0;
strncpy(p, s.s, s.len);
p += s.len;
*p = 0;
if((tbc = km_bdblib_get_table(db, &s)) == NULL)
return;
if((tp = tbc->dtp) == NULL)
return;
LM_DBG("stat file [%.*s]\n", len, n);
rc = stat(n, &st);
if(!rc) {
if((tp->ino != 0) && (st.st_ino != tp->ino))
bdb_reload(t); /*file changed on disk*/
tp->ino = st.st_ino;
}
}
/*
* Free all memory allocated by get_result
*/
int bdb_free_query(db1_con_t *_h, db1_res_t *_r)
{
if(_r)
db_free_result(_r);
if(_h)
BDB_CON_RESULT(_h) = NULL;
return 0;
}
/*
* Query table for specified rows
* _con: structure representing database connection
* _k: key names
* _op: operators
* _v: values of the keys that must match
* _c: column names to return
* _n: number of key=values pairs to compare
* _nc: number of columns to return
* _o: order by the specified column
*/
int km_bdb_query(db1_con_t *_con, db_key_t *_k, db_op_t *_op, db_val_t *_v,
db_key_t *_c, int _n, int _nc, db_key_t _o, db1_res_t **_r)
{
tbl_cache_p _tbc = NULL;
table_p _tp = NULL;
char kbuf[MAX_ROW_SIZE];
char dbuf[MAX_ROW_SIZE];
u_int32_t i, len;
int klen = MAX_ROW_SIZE;
int *lkey = NULL, *lres = NULL;
int ret;
DBT key, data;
DB *db;
DBC *dbcp;
if((!_con) || (!_r) || !CON_TABLE(_con)) {
#ifdef BDB_EXTRA_DEBUG
LM_ERR("Invalid parameter value\n");
#endif
return -1;
}
*_r = NULL;
/*check if underlying DB file has changed inode */
if(auto_reload)
bdb_check_reload(_con);
_tbc = km_bdblib_get_table(
BDB_CON_CONNECTION(_con), (str *)CON_TABLE(_con));
if(!_tbc) {
LM_WARN("table does not exist!\n");
return -1;
}
_tp = _tbc->dtp;
if(!_tp) {
LM_WARN("table not loaded!\n");
return -1;
}
#ifdef BDB_EXTRA_DEBUG
LM_DBG("QUERY in %.*s\n", _tp->name.len, _tp->name.s);
if(_o)
LM_DBG("DONT-CARE : _o: order by the specified column \n");
if(_op)
LM_DBG("DONT-CARE : _op: operators for refining query \n");
#endif
db = _tp->db;
if(!db)
return -1;
memset(&key, 0, sizeof(DBT));
memset(kbuf, 0, MAX_ROW_SIZE);
memset(&data, 0, sizeof(DBT));
memset(dbuf, 0, MAX_ROW_SIZE);
data.data = dbuf;
data.ulen = MAX_ROW_SIZE;
data.flags = DB_DBT_USERMEM;
/* if _c is NULL and _nc is zero, you will get all table
columns in the result
*/
if(_c) {
lres = bdb_get_colmap(_tbc->dtp, _c, _nc);
if(!lres) {
ret = -1;
goto error;
}
}
if(_k) {
lkey = bdb_get_colmap(_tbc->dtp, _k, _n);
if(!lkey) {
ret = -1;
goto error;
}
} else {
DB_HASH_STAT st;
memset(&st, 0, sizeof(DB_HASH_STAT));
i = 0;
#ifdef BDB_EXTRA_DEBUG
LM_DBG("SELECT * FROM %.*s\n", _tp->name.len, _tp->name.s);
#endif
/* Acquire a cursor for the database. */
if((ret = db->cursor(db, NULL, &dbcp, 0)) != 0) {
LM_ERR("Error creating cursor\n");
goto error;
}
/*count the number of records*/
while((ret = dbcp->c_get(dbcp, &key, &data, DB_NEXT)) == 0) {
if(!strncasecmp((char *)key.data, "METADATA", 8))
continue;
i++;
}
dbcp->CLOSE_CURSOR(dbcp);
ret = 0;
#ifdef BDB_EXTRA_DEBUG
LM_DBG("%i = SELECT COUNT(*) FROM %.*s\n", i, _tp->name.len,
_tp->name.s);
#endif
*_r = db_new_result();
if(!*_r) {
LM_ERR("no memory left for result \n");
ret = -2;
goto error;
}
if(i == 0) {
/*return empty table*/
RES_ROW_N(*_r) = 0;
BDB_CON_RESULT(_con) = *_r;
return 0;
}
/*allocate N rows in the result*/
RES_ROW_N(*_r) = i;
len = sizeof(db_row_t) * i;
RES_ROWS(*_r) = (db_row_t *)pkg_malloc(len);
memset(RES_ROWS(*_r), 0, len);
/*fill in the column part of db1_res_t (metadata) */
if((ret = bdb_get_columns(_tbc->dtp, *_r, lres, _nc)) < 0) {
LM_ERR("Error while getting column names\n");
goto error;
}
/* Acquire a cursor for the database. */
if((ret = db->cursor(db, NULL, &dbcp, 0)) != 0) {
LM_ERR("Error creating cursor\n");
goto error;
}
/*convert each record into a row in the result*/
i = 0;
while((ret = dbcp->c_get(dbcp, &key, &data, DB_NEXT)) == 0) {
if(!strncasecmp((char *)key.data, "METADATA", 8))
continue;
#ifdef BDB_EXTRA_DEBUG
LM_DBG("KEY: [%.*s]\nDATA: [%.*s]\n", (int)key.size,
(char *)key.data, (int)data.size, (char *)data.data);
#endif
/*fill in the row part of db1_res_t */
if((ret = bdb_append_row(*_r, dbuf, lres, i)) < 0) {
LM_ERR("Error while converting row\n");
goto error;
}
i++;
}
dbcp->CLOSE_CURSOR(dbcp);
BDB_CON_RESULT(_con) = *_r;
return 0;
}
if((ret = km_bdblib_valtochar(_tp, lkey, kbuf, &klen, _v, _n, BDB_KEY))
!= 0) {
LM_ERR("error in query key \n");
goto error;
}
key.data = kbuf;
key.ulen = MAX_ROW_SIZE;
key.flags = DB_DBT_USERMEM;
key.size = klen;
data.data = dbuf;
data.ulen = MAX_ROW_SIZE;
data.flags = DB_DBT_USERMEM;
/*create an empty db1_res_t which gets returned even if no result*/
*_r = db_new_result();
if(!*_r) {
LM_ERR("no memory left for result \n");
ret = -2;
goto error;
}
RES_ROW_N(*_r) = 0;
BDB_CON_RESULT(_con) = *_r;
#ifdef BDB_EXTRA_DEBUG
LM_DBG("SELECT KEY: [%.*s]\n", (int)key.size, (char *)key.data);
#endif
/*query Berkeley DB*/
if((ret = db->get(db, NULL, &key, &data, 0)) == 0) {
#ifdef BDB_EXTRA_DEBUG
LM_DBG("RESULT\nKEY: [%.*s]\nDATA: [%.*s]\n", (int)key.size,
(char *)key.data, (int)data.size, (char *)data.data);
#endif
/*fill in the col part of db1_res_t */
if((ret = bdb_get_columns(_tbc->dtp, *_r, lres, _nc)) < 0) {
LM_ERR("Error while getting column names\n");
goto error;
}
/*fill in the row part of db1_res_t */
if((ret = bdb_convert_row(*_r, dbuf, lres)) < 0) {
LM_ERR("Error while converting row\n");
goto error;
}
} else {
/*Berkeley DB error handler*/
switch(ret) {
case DB_NOTFOUND:
#ifdef BDB_EXTRA_DEBUG
LM_DBG("NO RESULT for QUERY \n");
#endif
ret = 0;
break;
/*The following are all critical/fatal */
case DB_LOCK_DEADLOCK:
// The operation was selected to resolve a deadlock.
case DB_SECONDARY_BAD:
// A secondary index references a nonexistent primary key.
case DB_RUNRECOVERY:
default:
LM_CRIT("DB->get error: %s.\n", db_strerror(ret));
km_bdblib_recover(_tp, ret);
goto error;
}
}
if(lkey)
pkg_free(lkey);
if(lres)
pkg_free(lres);
return ret;
error:
if(lkey)
pkg_free(lkey);
if(lres)
pkg_free(lres);
if(*_r)
db_free_result(*_r);
*_r = NULL;
return ret;
}
/*
* Raw SQL query
*/
int bdb_raw_query(db1_con_t *_h, char *_s, db1_res_t **_r)
{
LM_CRIT("DB RAW QUERY not implemented!\n");
return -1;
}
/*
* Insert a row into table
*/
int bdb_insert(db1_con_t *_h, db_key_t *_k, db_val_t *_v, int _n)
{
tbl_cache_p _tbc = NULL;
table_p _tp = NULL;
char kbuf[MAX_ROW_SIZE];
char dbuf[MAX_ROW_SIZE];
int i, j, ret, klen, dlen;
int *lkey = NULL;
DBT key, data;
DB *db;
i = j = ret = 0;
klen = MAX_ROW_SIZE;
dlen = MAX_ROW_SIZE;
if((!_h) || (!_v) || !CON_TABLE(_h)) {
return -1;
}
if(!_k) {
#ifdef BDB_EXTRA_DEBUG
LM_ERR("DB INSERT without KEYs not implemented! \n");
#endif
return -2;
}
_tbc = km_bdblib_get_table(BDB_CON_CONNECTION(_h), (str *)CON_TABLE(_h));
if(!_tbc) {
LM_WARN("table does not exist!\n");
return -3;
}
_tp = _tbc->dtp;
if(!_tp) {
LM_WARN("table not loaded!\n");
return -4;
}
#ifdef BDB_EXTRA_DEBUG
LM_DBG("INSERT in %.*s\n", _tp->name.len, _tp->name.s);
#endif
db = _tp->db;
memset(&key, 0, sizeof(DBT));
memset(kbuf, 0, klen);
if(_tp->ncols < _n) {
LM_WARN("more values than columns!!\n");
return -5;
}
lkey = bdb_get_colmap(_tp, _k, _n);
if(!lkey)
return -7;
/* verify col types provided */
for(i = 0; i < _n; i++) {
j = (lkey) ? lkey[i] : i;
if(bdb_is_neq_type(_tp->colp[j]->type, _v[i].type)) {
LM_WARN("incompatible types v[%d] - c[%d]!\n", i, j);
ret = -8;
goto error;
}
}
/* make the key */
if((ret = km_bdblib_valtochar(_tp, lkey, kbuf, &klen, _v, _n, BDB_KEY))
!= 0) {
LM_ERR("Error in km_bdblib_valtochar \n");
ret = -9;
goto error;
}
key.data = kbuf;
key.ulen = MAX_ROW_SIZE;
key.flags = DB_DBT_USERMEM;
key.size = klen;
//make the value (row)
memset(&data, 0, sizeof(DBT));
memset(dbuf, 0, MAX_ROW_SIZE);
if((ret = km_bdblib_valtochar(_tp, lkey, dbuf, &dlen, _v, _n, BDB_VALUE))
!= 0) {
LM_ERR("Error in km_bdblib_valtochar \n");
ret = -9;
goto error;
}
data.data = dbuf;
data.ulen = MAX_ROW_SIZE;
data.flags = DB_DBT_USERMEM;
data.size = dlen;
if((ret = db->put(db, NULL, &key, &data, 0)) == 0) {
km_bdblib_log(JLOG_INSERT, _tp, dbuf, dlen);
#ifdef BDB_EXTRA_DEBUG
LM_DBG("INSERT\nKEY: [%.*s]\nDATA: [%.*s]\n", (int)key.size,
(char *)key.data, (int)data.size, (char *)data.data);
#endif
} else { /*Berkeley DB error handler*/
switch(ret) {
/*The following are all critical/fatal */
case DB_LOCK_DEADLOCK:
/* The operation was selected to resolve a deadlock. */
case DB_RUNRECOVERY:
default:
LM_CRIT("DB->put error: %s.\n", db_strerror(ret));
km_bdblib_recover(_tp, ret);
goto error;
}
}
error:
if(lkey)
pkg_free(lkey);
return ret;
}
/*
* Delete a row from table
*
* To delete ALL rows:
* do Not specify any keys, or values, and _n <=0
*
*/
int bdb_delete(db1_con_t *_h, db_key_t *_k, db_op_t *_op, db_val_t *_v, int _n)
{
tbl_cache_p _tbc = NULL;
table_p _tp = NULL;
char kbuf[MAX_ROW_SIZE];
int ret, klen;
int *lkey = NULL;
DBT key;
DB *db;
DBC *dbcp;
ret = 0;
klen = MAX_ROW_SIZE;
if(_op)
return (_bdb_delete_cursor(_h, _k, _op, _v, _n));
if((!_h) || !CON_TABLE(_h))
return -1;
_tbc = km_bdblib_get_table(BDB_CON_CONNECTION(_h), (str *)CON_TABLE(_h));
if(!_tbc) {
LM_WARN("table does not exist!\n");
return -3;
}
_tp = _tbc->dtp;
if(!_tp) {
LM_WARN("table not loaded!\n");
return -4;
}
#ifdef BDB_EXTRA_DEBUG
LM_DBG("DELETE in %.*s\n", _tp->name.len, _tp->name.s);
#endif
db = _tp->db;
memset(&key, 0, sizeof(DBT));
memset(kbuf, 0, klen);
if(!_k || !_v || _n <= 0) {
/* Acquire a cursor for the database. */
if((ret = db->cursor(db, NULL, &dbcp, DB_WRITECURSOR)) != 0) {
LM_ERR("Error creating cursor\n");
goto error;
}
while((ret = dbcp->c_get(dbcp, &key, NULL, DB_NEXT)) == 0) {
if(!strncasecmp((char *)key.data, "METADATA", 8))
continue;
#ifdef BDB_EXTRA_DEBUG
LM_DBG("KEY: [%.*s]\n", (int)key.size, (char *)key.data);
#endif
ret = dbcp->c_del(dbcp, 0);
}
dbcp->CLOSE_CURSOR(dbcp);
return 0;
}
lkey = bdb_get_colmap(_tp, _k, _n);
if(!lkey)
return -5;
/* make the key */
if((ret = km_bdblib_valtochar(_tp, lkey, kbuf, &klen, _v, _n, BDB_KEY))
!= 0) {
LM_ERR("Error in bdblib_makekey\n");
ret = -6;
goto error;
}
key.data = kbuf;
key.ulen = MAX_ROW_SIZE;
key.flags = DB_DBT_USERMEM;
key.size = klen;
if((ret = db->del(db, NULL, &key, 0)) == 0) {
km_bdblib_log(JLOG_DELETE, _tp, kbuf, klen);
#ifdef BDB_EXTRA_DEBUG
LM_DBG("DELETED ROW \n KEY: %s \n", (char *)key.data);
#endif
} else { /*Berkeley DB error handler*/
switch(ret) {
case DB_NOTFOUND:
ret = 0;
break;
/*The following are all critical/fatal */
case DB_LOCK_DEADLOCK:
/* The operation was selected to resolve a deadlock. */
case DB_SECONDARY_BAD:
/* A secondary index references a nonexistent primary key. */
case DB_RUNRECOVERY:
default:
LM_CRIT("DB->del error: %s.\n", db_strerror(ret));
km_bdblib_recover(_tp, ret);
goto error;
}
}
ret = 0;
error:
if(lkey)
pkg_free(lkey);
return ret;
}
/*
_bdb_delete_cursor -- called from bdb_delete when the query involves operators
other than equal '='. Adds support for queries like this:
DELETE from SomeTable WHERE _k[0] < _v[0]
In this case, the keys _k are not the actually schema keys, so we need to
iterate via cursor to perform this operation.
*/
int _bdb_delete_cursor(
db1_con_t *_h, db_key_t *_k, db_op_t *_op, db_val_t *_v, int _n)
{
tbl_cache_p _tbc = NULL;
table_p _tp = NULL;
db1_res_t *_r = NULL;
char kbuf[MAX_ROW_SIZE];
char dbuf[MAX_ROW_SIZE];
int ret, klen = MAX_ROW_SIZE;
DBT key, data;
DB *db;
DBC *dbcp = NULL;
int *lkey = NULL;
ret = 0;
if((!_h) || !CON_TABLE(_h))
return -1;
_tbc = km_bdblib_get_table(BDB_CON_CONNECTION(_h), (str *)CON_TABLE(_h));
if(!_tbc) {
LM_WARN("table does not exist!\n");
return -3;
}
_tp = _tbc->dtp;
if(!_tp) {
LM_WARN("table not loaded!\n");
return -4;
}
#ifdef BDB_EXTRA_DEBUG
LM_DBG("DELETE by cursor in %.*s\n", _tp->name.len, _tp->name.s);
#endif
if(_k) {
lkey = bdb_get_colmap(_tp, _k, _n);
if(!lkey) {
ret = -1;
goto error;
}
}
/* create an empty db1_res_t which gets returned even if no result */
_r = db_new_result();
if(!_r) {
LM_ERR("no memory for result \n");
}
RES_ROW_N(_r) = 0;
/* fill in the col part of db1_res_t */
if((ret = bdb_get_columns(_tp, _r, 0, 0)) != 0) {
LM_ERR("Error while getting column names\n");
goto error;
}
db = _tp->db;
memset(&key, 0, sizeof(DBT));
memset(kbuf, 0, klen);
memset(&data, 0, sizeof(DBT));
memset(dbuf, 0, MAX_ROW_SIZE);
data.data = dbuf;
data.ulen = MAX_ROW_SIZE;
data.flags = DB_DBT_USERMEM;
/* Acquire a cursor for the database. */
if((ret = db->cursor(db, NULL, &dbcp, DB_WRITECURSOR)) != 0) {
LM_ERR("Error creating cursor\n");
}
while((ret = dbcp->c_get(dbcp, &key, &data, DB_NEXT)) == 0) {
if(!strncasecmp((char *)key.data, "METADATA", 8))
continue;
/*fill in the row part of db1_res_t */
if((ret = bdb_convert_row(_r, dbuf, 0)) < 0) {
LM_ERR("Error while converting row\n");
goto error;
}
if(bdb_row_match(_k, _op, _v, _n, _r, lkey)) {
#ifdef BDB_EXTRA_DEBUG
LM_DBG("DELETE ROW by KEY: [%.*s]\n", (int)key.size,
(char *)key.data);
#endif
if((ret = dbcp->c_del(dbcp, 0)) != 0) {
/* Berkeley DB error handler */
LM_CRIT("DB->get error: %s.\n", db_strerror(ret));
km_bdblib_recover(_tp, ret);
}
}
memset(dbuf, 0, MAX_ROW_SIZE);
db_free_rows(_r);
}
ret = 0;
error:
if(dbcp)
dbcp->CLOSE_CURSOR(dbcp);
if(_r)
db_free_result(_r);
if(lkey)
pkg_free(lkey);
return ret;
}
/*
* Updates a row in table
* Limitation: only knows how to update a single row
*
* _con: structure representing database connection
* _k: key names
* _op: operators
* _v: values of the keys that must match
* _uk: update keys; cols that need to be updated
* _uv: update values; col values that need to be committed
* _un: number of rows to update
*/
int bdb_update(db1_con_t *_con, db_key_t *_k, db_op_t *_op, db_val_t *_v,
db_key_t *_uk, db_val_t *_uv, int _n, int _un)
{
char *c, *t;
int ret, i, qcol, len, sum;
int *lkey = NULL;
tbl_cache_p _tbc = NULL;
table_p _tp = NULL;
char kbuf[MAX_ROW_SIZE];
char qbuf[MAX_ROW_SIZE];
char ubuf[MAX_ROW_SIZE];
DBT key, qdata, udata;
DB *db;