3 DB_File.xs -- Perl 5 interface to Berkeley DB
5 written by Paul Marquess <Paul.Marquess@btinternet.com>
6 last modified 1st September 2002
9 All comments/suggestions/problems are welcome
11 Copyright (c) 1995-2002 Paul Marquess. All rights reserved.
12 This program is free software; you can redistribute it and/or
13 modify it under the same terms as Perl itself.
17 0.2 - No longer bombs out if dbopen returns an error.
18 0.3 - Added some support for multiple btree compares
19 1.0 - Complete support for multiple callbacks added.
20 Fixed a problem with pushing a value onto an empty list.
21 1.01 - Fixed a SunOS core dump problem.
22 The return value from TIEHASH wasn't set to NULL when
23 dbopen returned an error.
24 1.02 - Use ALIAS to define TIEARRAY.
25 Removed some redundant commented code.
26 Merged OS2 code into the main distribution.
27 Allow negative subscripts with RECNO interface.
28 Changed the default flags to O_CREAT|O_RDWR
30 1.04 - fixed a couple of bugs in hash_cb. Patches supplied by
31 Dave Hammen, hammen@gothamcity.jsc.nasa.gov
32 1.05 - Added logic to allow prefix & hash types to be specified via
34 1.06 - Minor namespace cleanup: Localized PrintBtree.
35 1.07 - Fixed bug with RECNO, where bval wasn't defaulting to "\n".
36 1.08 - No change to DB_File.xs
37 1.09 - Default mode for dbopen changed to 0666
38 1.10 - Fixed fd method so that it still returns -1 for
39 in-memory files when db 1.86 is used.
40 1.11 - No change to DB_File.xs
41 1.12 - No change to DB_File.xs
42 1.13 - Tidied up a few casts.
43 1.14 - Made it illegal to tie an associative array to a RECNO
44 database and an ordinary array to a HASH or BTREE database.
45 1.50 - Make work with both DB 1.x or DB 2.x
46 1.51 - Fixed a bug in mapping 1.x O_RDONLY flag to 2.x DB_RDONLY equivalent
47 1.52 - Patch from Gisle Aas <gisle@aas.no> to suppress "use of
48 undefined value" warning with db_get and db_seq.
49 1.53 - Added DB_RENUMBER to flags for recno.
50 1.54 - Fixed bug in the fd method
51 1.55 - Fix for AIX from Jarkko Hietaniemi
52 1.56 - No change to DB_File.xs
53 1.57 - added the #undef op to allow building with Threads support.
54 1.58 - Fixed a problem with the use of sv_setpvn. When the
55 size is specified as 0, it does a strlen on the data.
56 This was ok for DB 1.x, but isn't for DB 2.x.
57 1.59 - No change to DB_File.xs
58 1.60 - Some code tidy up
59 1.61 - added flagSet macro for DB 2.5.x
60 fixed typo in O_RDONLY test.
61 1.62 - No change to DB_File.xs
62 1.63 - Fix to alllow DB 2.6.x to build.
63 1.64 - Tidied up the 1.x to 2.x flags mapping code.
64 Added a patch from Mark Kettenis <kettenis@wins.uva.nl>
65 to fix a flag mapping problem with O_RDONLY on the Hurd
66 1.65 - Fixed a bug in the PUSH logic.
67 Added BOOT check that using 2.3.4 or greater
68 1.66 - Added DBM filter code
69 1.67 - Backed off the use of newSVpvn.
70 Fixed DBM Filter code for Perl 5.004.
71 Fixed a small memory leak in the filter code.
72 1.68 - fixed backward compatability bug with R_IAFTER & R_IBEFORE
73 merged in the 5.005_58 changes
74 1.69 - fixed a bug in push -- DB_APPEND wasn't working properly.
75 Fixed the R_SETCURSOR bug introduced in 1.68
76 Added a new Perl variable $DB_File::db_ver
77 1.70 - Initialise $DB_File::db_ver and $DB_File::db_version with
78 GV_ADD|GV_ADDMULT -- bug spotted by Nick Ing-Simmons.
79 Added a BOOT check to test for equivalent versions of db.h &
81 1.71 - Support for Berkeley DB version 3.
82 Support for Berkeley DB 2/3's backward compatability mode.
84 1.72 - No change to DB_File.xs
85 1.73 - No change to DB_File.xs
86 1.74 - A call to open needed parenthesised to stop it clashing
88 Added Perl core patches 7703 & 7801.
89 1.75 - Fixed Perl core patch 7703.
90 Added suppport to allow DB_File to be built with
91 Berkeley DB 3.2 -- btree_compare, btree_prefix and hash_cb
93 1.76 - No change to DB_File.xs
94 1.77 - Tidied up a few types used in calling newSVpvn.
95 1.78 - Core patch 10335, 10372, 10534, 10549, 11051 included.
96 1.79 - NEXTKEY ignores the input key.
98 1.800 - Moved backward compatability code into ppport.h.
99 Use the new constants code.
100 1.801 - No change to DB_File.xs
101 1.802 - No change to DB_File.xs
102 1.803 - FETCH, STORE & DELETE don't map the flags parameter
103 into the equivalent Berkeley DB function anymore.
105 1.805 - recursion detection added to the callbacks
106 Support for 4.1.X added.
107 Filter code can now cope with read-only $_
111 #define PERL_NO_GET_CONTEXT
120 /* Mention DB_VERSION_MAJOR_CFG, DB_VERSION_MINOR_CFG, and
121 DB_VERSION_PATCH_CFG here so that Configure pulls them all in. */
123 /* Being the Berkeley DB we prefer the <sys/cdefs.h> (which will be
124 * shortly #included by the <db.h>) __attribute__ to the possibly
125 * already defined __attribute__, for example by GNUC or by Perl. */
127 /* #if DB_VERSION_MAJOR_CFG < 2 */
128 #ifndef DB_VERSION_MAJOR
129 # undef __attribute__
138 /* Wall starts with 5.7.x */
140 #if PERL_REVISION > 5 || (PERL_REVISION == 5 && PERL_VERSION >= 7)
142 /* Since we dropped the gccish definition of __attribute__ we will want
143 * to redefine dNOOP, however (so that dTHX continues to work). Yes,
144 * all this means that we can't do attribute checking on the DB_File,
146 # ifndef DB_VERSION_MAJOR
149 # define dNOOP extern int Perl___notused
151 /* Ditto for dXSARGS. */
155 I32 ax = mark - PL_stack_base + 1; \
156 I32 items = sp - mark
160 /* avoid -Wall; DB_File xsubs never make use of `ix' setup for ALIASes */
162 # define dXSI32 dNOOP
164 #endif /* Perl >= 5.7 */
171 # define Trace(x) printf x
177 #define DBT_clear(x) Zero(&x, 1, DBT) ;
179 #ifdef DB_VERSION_MAJOR
181 #if DB_VERSION_MAJOR == 2
182 # define BERKELEY_DB_1_OR_2
185 #if DB_VERSION_MAJOR > 3 || (DB_VERSION_MAJOR == 3 && DB_VERSION_MINOR >= 2)
186 # define AT_LEAST_DB_3_2
189 #if DB_VERSION_MAJOR > 4 || (DB_VERSION_MAJOR == 4 && DB_VERSION_MINOR >= 1)
190 # define AT_LEAST_DB_4_1
193 /* map version 2 features & constants onto their version 1 equivalent */
198 #define DB_Prefix_t size_t
203 #define DB_Hash_t u_int32_t
205 /* DBTYPE stays the same */
206 /* HASHINFO, RECNOINFO and BTREEINFO map to DB_INFO */
207 #if DB_VERSION_MAJOR == 2
208 typedef DB_INFO INFO ;
209 #else /* DB_VERSION_MAJOR > 2 */
210 # define DB_FIXEDLEN (0x8000)
211 #endif /* DB_VERSION_MAJOR == 2 */
213 /* version 2 has db_recno_t in place of recno_t */
214 typedef db_recno_t recno_t;
217 #define R_CURSOR DB_SET_RANGE
218 #define R_FIRST DB_FIRST
219 #define R_IAFTER DB_AFTER
220 #define R_IBEFORE DB_BEFORE
221 #define R_LAST DB_LAST
222 #define R_NEXT DB_NEXT
223 #define R_NOOVERWRITE DB_NOOVERWRITE
224 #define R_PREV DB_PREV
226 #if DB_VERSION_MAJOR == 2 && DB_VERSION_MINOR < 5
227 # define R_SETCURSOR 0x800000
229 # define R_SETCURSOR (-100)
232 #define R_RECNOSYNC 0
233 #define R_FIXEDLEN DB_FIXEDLEN
237 #define db_HA_hash h_hash
238 #define db_HA_ffactor h_ffactor
239 #define db_HA_nelem h_nelem
240 #define db_HA_bsize db_pagesize
241 #define db_HA_cachesize db_cachesize
242 #define db_HA_lorder db_lorder
244 #define db_BT_compare bt_compare
245 #define db_BT_prefix bt_prefix
246 #define db_BT_flags flags
247 #define db_BT_psize db_pagesize
248 #define db_BT_cachesize db_cachesize
249 #define db_BT_lorder db_lorder
250 #define db_BT_maxkeypage
251 #define db_BT_minkeypage
254 #define db_RE_reclen re_len
255 #define db_RE_flags flags
256 #define db_RE_bval re_pad
257 #define db_RE_bfname re_source
258 #define db_RE_psize db_pagesize
259 #define db_RE_cachesize db_cachesize
260 #define db_RE_lorder db_lorder
264 #define do_SEQ(db, key, value, flag) (db->cursor->c_get)(db->cursor, &key, &value, flag)
267 #define DBT_flags(x) x.flags = 0
268 #define DB_flags(x, v) x |= v
270 #if DB_VERSION_MAJOR == 2 && DB_VERSION_MINOR < 5
271 # define flagSet(flags, bitmask) ((flags) & (bitmask))
273 # define flagSet(flags, bitmask) (((flags) & DB_OPFLAGS_MASK) == (bitmask))
276 #else /* db version 1.x */
278 #define BERKELEY_DB_1
279 #define BERKELEY_DB_1_OR_2
292 # define DB_Prefix_t mDB_Prefix_t
299 # define DB_Hash_t mDB_Hash_t
302 #define db_HA_hash hash.hash
303 #define db_HA_ffactor hash.ffactor
304 #define db_HA_nelem hash.nelem
305 #define db_HA_bsize hash.bsize
306 #define db_HA_cachesize hash.cachesize
307 #define db_HA_lorder hash.lorder
309 #define db_BT_compare btree.compare
310 #define db_BT_prefix btree.prefix
311 #define db_BT_flags btree.flags
312 #define db_BT_psize btree.psize
313 #define db_BT_cachesize btree.cachesize
314 #define db_BT_lorder btree.lorder
315 #define db_BT_maxkeypage btree.maxkeypage
316 #define db_BT_minkeypage btree.minkeypage
318 #define db_RE_reclen recno.reclen
319 #define db_RE_flags recno.flags
320 #define db_RE_bval recno.bval
321 #define db_RE_bfname recno.bfname
322 #define db_RE_psize recno.psize
323 #define db_RE_cachesize recno.cachesize
324 #define db_RE_lorder recno.lorder
328 #define do_SEQ(db, key, value, flag) (db->dbp->seq)(db->dbp, &key, &value, flag)
330 #define DB_flags(x, v)
331 #define flagSet(flags, bitmask) ((flags) & (bitmask))
333 #endif /* db version 1 */
337 #define db_DELETE(db, key, flags) ((db->dbp)->del)(db->dbp, TXN &key, 0)
338 #define db_STORE(db, key, value, flags) ((db->dbp)->put)(db->dbp, TXN &key, &value, 0)
339 #define db_FETCH(db, key, flags) ((db->dbp)->get)(db->dbp, TXN &key, &value, 0)
341 #define db_sync(db, flags) ((db->dbp)->sync)(db->dbp, flags)
342 #define db_get(db, key, value, flags) ((db->dbp)->get)(db->dbp, TXN &key, &value, flags)
344 #ifdef DB_VERSION_MAJOR
345 #define db_DESTROY(db) (!db->aborted && ( db->cursor->c_close(db->cursor),\
346 (db->dbp->close)(db->dbp, 0) ))
347 #define db_close(db) ((db->dbp)->close)(db->dbp, 0)
348 #define db_del(db, key, flags) (flagSet(flags, R_CURSOR) \
349 ? ((db->cursor)->c_del)(db->cursor, 0) \
350 : ((db->dbp)->del)(db->dbp, NULL, &key, flags) )
352 #else /* ! DB_VERSION_MAJOR */
354 #define db_DESTROY(db) (!db->aborted && ((db->dbp)->close)(db->dbp))
355 #define db_close(db) ((db->dbp)->close)(db->dbp)
356 #define db_del(db, key, flags) ((db->dbp)->del)(db->dbp, &key, flags)
357 #define db_put(db, key, value, flags) ((db->dbp)->put)(db->dbp, &key, &value, flags)
359 #endif /* ! DB_VERSION_MAJOR */
362 #define db_seq(db, key, value, flags) do_SEQ(db, key, value, flags)
375 #ifdef BERKELEY_DB_1_OR_2
378 #ifdef DB_VERSION_MAJOR
381 SV * filter_fetch_key ;
382 SV * filter_store_key ;
383 SV * filter_fetch_value ;
384 SV * filter_store_value ;
389 typedef DB_File_type * DB_File ;
392 #define my_sv_setpvn(sv, d, s) sv_setpvn(sv, (s ? d : (void*)""), s)
394 #define OutputValue(arg, name) \
395 { if (RETVAL == 0) { \
396 my_sv_setpvn(arg, name.data, name.size) ; \
399 DBM_ckFilter(arg, filter_fetch_value,"filter_fetch_value") ; \
403 #define OutputKey(arg, name) \
406 if (db->type != DB_RECNO) { \
407 my_sv_setpvn(arg, name.data, name.size); \
410 sv_setiv(arg, (I32)*(I32*)name.data - 1); \
413 DBM_ckFilter(arg, filter_fetch_key,"filter_fetch_key") ; \
417 #define my_SvUV32(sv) ((u_int32_t)SvUV(sv))
420 extern void __getBerkeleyDBInfo(void);
423 /* Internal Global Data */
425 #define MY_CXT_KEY "DB_File::_guts" XS_VERSION
436 #define Value (MY_CXT.x_Value)
437 #define zero (MY_CXT.x_zero)
438 #define CurrentDB (MY_CXT.x_CurrentDB)
439 #define empty (MY_CXT.x_empty)
441 #define ERR_BUFF "DB_File::Error"
443 #ifdef DB_VERSION_MAJOR
447 db_put(DB_File db, DBTKEY key, DBT value, u_int flags)
449 db_put(db, key, value, flags)
458 if (flagSet(flags, R_IAFTER) || flagSet(flags, R_IBEFORE)) {
462 #if DB_VERSION_MAJOR == 2 && DB_VERSION_MINOR < 6
463 if (((db->dbp)->cursor)(db->dbp, NULL, &temp_cursor) != 0)
465 if (((db->dbp)->cursor)(db->dbp, NULL, &temp_cursor, 0) != 0)
469 memset(&l_key, 0, sizeof(l_key));
470 l_key.data = key.data;
471 l_key.size = key.size;
472 memset(&l_value, 0, sizeof(l_value));
473 l_value.data = value.data;
474 l_value.size = value.size;
476 if ( temp_cursor->c_get(temp_cursor, &l_key, &l_value, DB_SET) != 0) {
477 (void)temp_cursor->c_close(temp_cursor);
481 status = temp_cursor->c_put(temp_cursor, &key, &value, flags);
482 (void)temp_cursor->c_close(temp_cursor);
488 if (flagSet(flags, R_CURSOR)) {
489 return ((db->cursor)->c_put)(db->cursor, &key, &value, DB_CURRENT);
492 if (flagSet(flags, R_SETCURSOR)) {
493 if ((db->dbp)->put(db->dbp, NULL, &key, &value, 0) != 0)
495 return ((db->cursor)->c_get)(db->cursor, &key, &value, DB_SET_RANGE);
499 return ((db->dbp)->put)(db->dbp, NULL, &key, &value, flags) ;
503 #endif /* DB_VERSION_MAJOR */
508 /* db_DESTROY(db); */
514 #ifdef AT_LEAST_DB_3_2
517 btree_compare(DB * db, const DBT *key1, const DBT *key2)
519 btree_compare(db, key1, key2)
523 #endif /* CAN_PROTOTYPE */
525 #else /* Berkeley DB < 3.2 */
528 btree_compare(const DBT *key1, const DBT *key2)
530 btree_compare(key1, key2)
543 void * data1, * data2 ;
546 DB_File keep_CurrentDB = CurrentDB;
549 if (CurrentDB->in_compare) {
551 croak ("DB_File btree_compare: recursion detected\n") ;
554 data1 = (char *) key1->data ;
555 data2 = (char *) key2->data ;
558 /* As newSVpv will assume that the data pointer is a null terminated C
559 string if the size parameter is 0, make sure that data points to an
560 empty string if the length is 0
573 PUSHs(sv_2mortal(newSVpvn(data1,key1->size)));
574 PUSHs(sv_2mortal(newSVpvn(data2,key2->size)));
577 CurrentDB->in_compare = TRUE;
579 count = perl_call_sv(CurrentDB->compare, G_SCALAR);
581 CurrentDB = keep_CurrentDB;
582 CurrentDB->in_compare = FALSE;
588 croak ("DB_File btree_compare: expected 1 return value from compare sub, got %d\n", count) ;
602 #ifdef AT_LEAST_DB_3_2
605 btree_prefix(DB * db, const DBT *key1, const DBT *key2)
607 btree_prefix(db, key1, key2)
613 #else /* Berkeley DB < 3.2 */
616 btree_prefix(const DBT *key1, const DBT *key2)
618 btree_prefix(key1, key2)
630 char * data1, * data2 ;
633 DB_File keep_CurrentDB = CurrentDB;
635 if (CurrentDB->in_prefix){
637 croak ("DB_File btree_prefix: recursion detected\n") ;
640 data1 = (char *) key1->data ;
641 data2 = (char *) key2->data ;
644 /* As newSVpv will assume that the data pointer is a null terminated C
645 string if the size parameter is 0, make sure that data points to an
646 empty string if the length is 0
659 PUSHs(sv_2mortal(newSVpvn(data1,key1->size)));
660 PUSHs(sv_2mortal(newSVpvn(data2,key2->size)));
663 CurrentDB->in_prefix = TRUE;
665 count = perl_call_sv(CurrentDB->prefix, G_SCALAR);
667 CurrentDB = keep_CurrentDB;
668 CurrentDB->in_prefix = FALSE;
674 croak ("DB_File btree_prefix: expected 1 return value from prefix sub, got %d\n", count) ;
688 # define HASH_CB_SIZE_TYPE size_t
690 # define HASH_CB_SIZE_TYPE u_int32_t
694 #ifdef AT_LEAST_DB_3_2
697 hash_cb(DB * db, const void *data, u_int32_t size)
699 hash_cb(db, data, size)
702 HASH_CB_SIZE_TYPE size ;
705 #else /* Berkeley DB < 3.2 */
708 hash_cb(const void *data, HASH_CB_SIZE_TYPE size)
712 HASH_CB_SIZE_TYPE size ;
724 DB_File keep_CurrentDB = CurrentDB;
726 if (CurrentDB->in_hash){
728 croak ("DB_File hash callback: recursion detected\n") ;
736 /* DGH - Next two lines added to fix corrupted stack problem */
742 XPUSHs(sv_2mortal(newSVpvn((char*)data,size)));
745 keep_CurrentDB->in_hash = TRUE;
747 count = perl_call_sv(CurrentDB->hash, G_SCALAR);
749 CurrentDB = keep_CurrentDB;
750 CurrentDB->in_hash = FALSE;
756 croak ("DB_File hash_cb: expected 1 return value from hash sub, got %d\n", count) ;
770 db_errcall_cb(const char * db_errpfx, char * buffer)
772 db_errcall_cb(db_errpfx, buffer)
773 const char * db_errpfx;
777 SV * sv = perl_get_sv(ERR_BUFF, FALSE) ;
780 sv_setpvf(sv, "%s: %s", db_errpfx, buffer) ;
782 sv_setpv(sv, buffer) ;
786 #if defined(TRACE) && defined(BERKELEY_DB_1_OR_2)
790 PrintHash(INFO *hash)
796 printf ("HASH Info\n") ;
797 printf (" hash = %s\n",
798 (hash->db_HA_hash != NULL ? "redefined" : "default")) ;
799 printf (" bsize = %d\n", hash->db_HA_bsize) ;
800 printf (" ffactor = %d\n", hash->db_HA_ffactor) ;
801 printf (" nelem = %d\n", hash->db_HA_nelem) ;
802 printf (" cachesize = %d\n", hash->db_HA_cachesize) ;
803 printf (" lorder = %d\n", hash->db_HA_lorder) ;
809 PrintRecno(INFO *recno)
815 printf ("RECNO Info\n") ;
816 printf (" flags = %d\n", recno->db_RE_flags) ;
817 printf (" cachesize = %d\n", recno->db_RE_cachesize) ;
818 printf (" psize = %d\n", recno->db_RE_psize) ;
819 printf (" lorder = %d\n", recno->db_RE_lorder) ;
820 printf (" reclen = %ul\n", (unsigned long)recno->db_RE_reclen) ;
821 printf (" bval = %d 0x%x\n", recno->db_RE_bval, recno->db_RE_bval) ;
822 printf (" bfname = %d [%s]\n", recno->db_RE_bfname, recno->db_RE_bfname) ;
827 PrintBtree(INFO *btree)
833 printf ("BTREE Info\n") ;
834 printf (" compare = %s\n",
835 (btree->db_BT_compare ? "redefined" : "default")) ;
836 printf (" prefix = %s\n",
837 (btree->db_BT_prefix ? "redefined" : "default")) ;
838 printf (" flags = %d\n", btree->db_BT_flags) ;
839 printf (" cachesize = %d\n", btree->db_BT_cachesize) ;
840 printf (" psize = %d\n", btree->db_BT_psize) ;
841 #ifndef DB_VERSION_MAJOR
842 printf (" maxkeypage = %d\n", btree->db_BT_maxkeypage) ;
843 printf (" minkeypage = %d\n", btree->db_BT_minkeypage) ;
845 printf (" lorder = %d\n", btree->db_BT_lorder) ;
850 #define PrintRecno(recno)
851 #define PrintHash(hash)
852 #define PrintBtree(btree)
859 GetArrayLength(pTHX_ DB_File db)
871 RETVAL = do_SEQ(db, key, value, R_LAST) ;
873 RETVAL = *(I32 *)key.data ;
874 else /* No key means empty file */
877 return ((I32)RETVAL) ;
882 GetRecnoKey(pTHX_ DB_File db, I32 value)
884 GetRecnoKey(db, value)
890 /* Get the length of the array */
891 I32 length = GetArrayLength(aTHX_ db) ;
893 /* check for attempt to write before start of array */
894 if (length + value + 1 <= 0) {
896 croak("Modification of non-creatable array value attempted, subscript %ld", (long)value) ;
899 value = length + value + 1 ;
910 ParseOpenInfo(pTHX_ int isHASH, char *name, int flags, int mode, SV *sv)
912 ParseOpenInfo(isHASH, name, flags, mode, sv)
921 #ifdef BERKELEY_DB_1_OR_2 /* Berkeley DB Version 1 or 2 */
925 DB_File RETVAL = (DB_File)safemalloc(sizeof(DB_File_type)) ;
926 void * openinfo = NULL ;
927 INFO * info = &RETVAL->info ;
931 /* printf("In ParseOpenInfo name=[%s] flags=[%d] mode = [%d]\n", name, flags, mode) ; */
932 Zero(RETVAL, 1, DB_File_type) ;
934 /* Default to HASH */
935 RETVAL->filtering = 0 ;
936 RETVAL->filter_fetch_key = RETVAL->filter_store_key =
937 RETVAL->filter_fetch_value = RETVAL->filter_store_value =
938 RETVAL->hash = RETVAL->compare = RETVAL->prefix = NULL ;
939 RETVAL->type = DB_HASH ;
941 /* DGH - Next line added to avoid SEGV on existing hash DB */
944 /* fd for 1.86 hash in memory files doesn't return -1 like 1.85 */
945 RETVAL->in_memory = (name == NULL) ;
950 croak ("type parameter is not a reference") ;
952 svp = hv_fetch( (HV*)SvRV(sv), "GOT", 3, FALSE) ;
953 if (svp && SvOK(*svp))
954 action = (HV*) SvRV(*svp) ;
956 croak("internal error") ;
958 if (sv_isa(sv, "DB_File::HASHINFO"))
962 croak("DB_File can only tie an associative array to a DB_HASH database") ;
964 RETVAL->type = DB_HASH ;
965 openinfo = (void*)info ;
967 svp = hv_fetch(action, "hash", 4, FALSE);
969 if (svp && SvOK(*svp))
971 info->db_HA_hash = hash_cb ;
972 RETVAL->hash = newSVsv(*svp) ;
975 info->db_HA_hash = NULL ;
977 svp = hv_fetch(action, "ffactor", 7, FALSE);
978 info->db_HA_ffactor = svp ? SvIV(*svp) : 0;
980 svp = hv_fetch(action, "nelem", 5, FALSE);
981 info->db_HA_nelem = svp ? SvIV(*svp) : 0;
983 svp = hv_fetch(action, "bsize", 5, FALSE);
984 info->db_HA_bsize = svp ? SvIV(*svp) : 0;
986 svp = hv_fetch(action, "cachesize", 9, FALSE);
987 info->db_HA_cachesize = svp ? SvIV(*svp) : 0;
989 svp = hv_fetch(action, "lorder", 6, FALSE);
990 info->db_HA_lorder = svp ? SvIV(*svp) : 0;
994 else if (sv_isa(sv, "DB_File::BTREEINFO"))
997 croak("DB_File can only tie an associative array to a DB_BTREE database");
999 RETVAL->type = DB_BTREE ;
1000 openinfo = (void*)info ;
1002 svp = hv_fetch(action, "compare", 7, FALSE);
1003 if (svp && SvOK(*svp))
1005 info->db_BT_compare = btree_compare ;
1006 RETVAL->compare = newSVsv(*svp) ;
1009 info->db_BT_compare = NULL ;
1011 svp = hv_fetch(action, "prefix", 6, FALSE);
1012 if (svp && SvOK(*svp))
1014 info->db_BT_prefix = btree_prefix ;
1015 RETVAL->prefix = newSVsv(*svp) ;
1018 info->db_BT_prefix = NULL ;
1020 svp = hv_fetch(action, "flags", 5, FALSE);
1021 info->db_BT_flags = svp ? SvIV(*svp) : 0;
1023 svp = hv_fetch(action, "cachesize", 9, FALSE);
1024 info->db_BT_cachesize = svp ? SvIV(*svp) : 0;
1026 #ifndef DB_VERSION_MAJOR
1027 svp = hv_fetch(action, "minkeypage", 10, FALSE);
1028 info->btree.minkeypage = svp ? SvIV(*svp) : 0;
1030 svp = hv_fetch(action, "maxkeypage", 10, FALSE);
1031 info->btree.maxkeypage = svp ? SvIV(*svp) : 0;
1034 svp = hv_fetch(action, "psize", 5, FALSE);
1035 info->db_BT_psize = svp ? SvIV(*svp) : 0;
1037 svp = hv_fetch(action, "lorder", 6, FALSE);
1038 info->db_BT_lorder = svp ? SvIV(*svp) : 0;
1043 else if (sv_isa(sv, "DB_File::RECNOINFO"))
1046 croak("DB_File can only tie an array to a DB_RECNO database");
1048 RETVAL->type = DB_RECNO ;
1049 openinfo = (void *)info ;
1051 info->db_RE_flags = 0 ;
1053 svp = hv_fetch(action, "flags", 5, FALSE);
1054 info->db_RE_flags = (u_long) (svp ? SvIV(*svp) : 0);
1056 svp = hv_fetch(action, "reclen", 6, FALSE);
1057 info->db_RE_reclen = (size_t) (svp ? SvIV(*svp) : 0);
1059 svp = hv_fetch(action, "cachesize", 9, FALSE);
1060 info->db_RE_cachesize = (u_int) (svp ? SvIV(*svp) : 0);
1062 svp = hv_fetch(action, "psize", 5, FALSE);
1063 info->db_RE_psize = (u_int) (svp ? SvIV(*svp) : 0);
1065 svp = hv_fetch(action, "lorder", 6, FALSE);
1066 info->db_RE_lorder = (int) (svp ? SvIV(*svp) : 0);
1068 #ifdef DB_VERSION_MAJOR
1069 info->re_source = name ;
1072 svp = hv_fetch(action, "bfname", 6, FALSE);
1073 if (svp && SvOK(*svp)) {
1074 char * ptr = SvPV(*svp,n_a) ;
1075 #ifdef DB_VERSION_MAJOR
1076 name = (char*) n_a ? ptr : NULL ;
1078 info->db_RE_bfname = (char*) (n_a ? ptr : NULL) ;
1082 #ifdef DB_VERSION_MAJOR
1085 info->db_RE_bfname = NULL ;
1088 svp = hv_fetch(action, "bval", 4, FALSE);
1089 #ifdef DB_VERSION_MAJOR
1090 if (svp && SvOK(*svp))
1094 value = (int)*SvPV(*svp, n_a) ;
1096 value = SvIV(*svp) ;
1098 if (info->flags & DB_FIXEDLEN) {
1099 info->re_pad = value ;
1100 info->flags |= DB_PAD ;
1103 info->re_delim = value ;
1104 info->flags |= DB_DELIMITER ;
1109 if (svp && SvOK(*svp))
1112 info->db_RE_bval = (u_char)*SvPV(*svp, n_a) ;
1114 info->db_RE_bval = (u_char)(unsigned long) SvIV(*svp) ;
1115 DB_flags(info->flags, DB_DELIMITER) ;
1120 if (info->db_RE_flags & R_FIXEDLEN)
1121 info->db_RE_bval = (u_char) ' ' ;
1123 info->db_RE_bval = (u_char) '\n' ;
1124 DB_flags(info->flags, DB_DELIMITER) ;
1129 info->flags |= DB_RENUMBER ;
1135 croak("type is not of type DB_File::HASHINFO, DB_File::BTREEINFO or DB_File::RECNOINFO");
1139 /* OS2 Specific Code */
1143 #endif /* __EMX__ */
1146 #ifdef DB_VERSION_MAJOR
1152 /* Map 1.x flags to 2.x flags */
1153 if ((flags & O_CREAT) == O_CREAT)
1154 Flags |= DB_CREATE ;
1157 if (flags == O_RDONLY)
1159 if ((flags & O_RDONLY) == O_RDONLY && (flags & O_RDWR) != O_RDWR)
1161 Flags |= DB_RDONLY ;
1164 if ((flags & O_TRUNC) == O_TRUNC)
1165 Flags |= DB_TRUNCATE ;
1168 status = db_open(name, RETVAL->type, Flags, mode, NULL, openinfo, &RETVAL->dbp) ;
1170 #if DB_VERSION_MAJOR == 2 && DB_VERSION_MINOR < 6
1171 status = (RETVAL->dbp->cursor)(RETVAL->dbp, NULL, &RETVAL->cursor) ;
1173 status = (RETVAL->dbp->cursor)(RETVAL->dbp, NULL, &RETVAL->cursor,
1178 RETVAL->dbp = NULL ;
1183 #if defined(DB_LIBRARY_COMPATIBILITY_API) && DB_VERSION_MAJOR > 2
1184 RETVAL->dbp = __db185_open(name, flags, mode, RETVAL->type, openinfo) ;
1186 RETVAL->dbp = dbopen(name, flags, mode, RETVAL->type, openinfo) ;
1187 #endif /* DB_LIBRARY_COMPATIBILITY_API */
1193 #else /* Berkeley DB Version > 2 */
1197 DB_File RETVAL = (DB_File)safemalloc(sizeof(DB_File_type)) ;
1203 /* printf("In ParseOpenInfo name=[%s] flags=[%d] mode = [%d]\n", name, flags, mode) ; */
1204 Zero(RETVAL, 1, DB_File_type) ;
1206 /* Default to HASH */
1207 RETVAL->filtering = 0 ;
1208 RETVAL->filter_fetch_key = RETVAL->filter_store_key =
1209 RETVAL->filter_fetch_value = RETVAL->filter_store_value =
1210 RETVAL->hash = RETVAL->compare = RETVAL->prefix = NULL ;
1211 RETVAL->type = DB_HASH ;
1213 /* DGH - Next line added to avoid SEGV on existing hash DB */
1216 /* fd for 1.86 hash in memory files doesn't return -1 like 1.85 */
1217 RETVAL->in_memory = (name == NULL) ;
1219 status = db_create(&RETVAL->dbp, NULL,0) ;
1220 /* printf("db_create returned %d %s\n", status, db_strerror(status)) ; */
1222 RETVAL->dbp = NULL ;
1230 croak ("type parameter is not a reference") ;
1232 svp = hv_fetch( (HV*)SvRV(sv), "GOT", 3, FALSE) ;
1233 if (svp && SvOK(*svp))
1234 action = (HV*) SvRV(*svp) ;
1236 croak("internal error") ;
1238 if (sv_isa(sv, "DB_File::HASHINFO"))
1242 croak("DB_File can only tie an associative array to a DB_HASH database") ;
1244 RETVAL->type = DB_HASH ;
1246 svp = hv_fetch(action, "hash", 4, FALSE);
1248 if (svp && SvOK(*svp))
1250 (void)dbp->set_h_hash(dbp, hash_cb) ;
1251 RETVAL->hash = newSVsv(*svp) ;
1254 svp = hv_fetch(action, "ffactor", 7, FALSE);
1256 (void)dbp->set_h_ffactor(dbp, my_SvUV32(*svp)) ;
1258 svp = hv_fetch(action, "nelem", 5, FALSE);
1260 (void)dbp->set_h_nelem(dbp, my_SvUV32(*svp)) ;
1262 svp = hv_fetch(action, "bsize", 5, FALSE);
1264 (void)dbp->set_pagesize(dbp, my_SvUV32(*svp));
1266 svp = hv_fetch(action, "cachesize", 9, FALSE);
1268 (void)dbp->set_cachesize(dbp, 0, my_SvUV32(*svp), 0) ;
1270 svp = hv_fetch(action, "lorder", 6, FALSE);
1272 (void)dbp->set_lorder(dbp, (int)SvIV(*svp)) ;
1276 else if (sv_isa(sv, "DB_File::BTREEINFO"))
1279 croak("DB_File can only tie an associative array to a DB_BTREE database");
1281 RETVAL->type = DB_BTREE ;
1283 svp = hv_fetch(action, "compare", 7, FALSE);
1284 if (svp && SvOK(*svp))
1286 (void)dbp->set_bt_compare(dbp, btree_compare) ;
1287 RETVAL->compare = newSVsv(*svp) ;
1290 svp = hv_fetch(action, "prefix", 6, FALSE);
1291 if (svp && SvOK(*svp))
1293 (void)dbp->set_bt_prefix(dbp, btree_prefix) ;
1294 RETVAL->prefix = newSVsv(*svp) ;
1297 svp = hv_fetch(action, "flags", 5, FALSE);
1299 (void)dbp->set_flags(dbp, my_SvUV32(*svp)) ;
1301 svp = hv_fetch(action, "cachesize", 9, FALSE);
1303 (void)dbp->set_cachesize(dbp, 0, my_SvUV32(*svp), 0) ;
1305 svp = hv_fetch(action, "psize", 5, FALSE);
1307 (void)dbp->set_pagesize(dbp, my_SvUV32(*svp)) ;
1309 svp = hv_fetch(action, "lorder", 6, FALSE);
1311 (void)dbp->set_lorder(dbp, (int)SvIV(*svp)) ;
1316 else if (sv_isa(sv, "DB_File::RECNOINFO"))
1321 croak("DB_File can only tie an array to a DB_RECNO database");
1323 RETVAL->type = DB_RECNO ;
1325 svp = hv_fetch(action, "flags", 5, FALSE);
1327 int flags = SvIV(*svp) ;
1328 /* remove FIXDLEN, if present */
1329 if (flags & DB_FIXEDLEN) {
1331 flags &= ~DB_FIXEDLEN ;
1335 svp = hv_fetch(action, "cachesize", 9, FALSE);
1337 status = dbp->set_cachesize(dbp, 0, my_SvUV32(*svp), 0) ;
1340 svp = hv_fetch(action, "psize", 5, FALSE);
1342 status = dbp->set_pagesize(dbp, my_SvUV32(*svp)) ;
1345 svp = hv_fetch(action, "lorder", 6, FALSE);
1347 status = dbp->set_lorder(dbp, (int)SvIV(*svp)) ;
1350 svp = hv_fetch(action, "bval", 4, FALSE);
1351 if (svp && SvOK(*svp))
1355 value = (int)*SvPV(*svp, n_a) ;
1357 value = (int)SvIV(*svp) ;
1360 status = dbp->set_re_pad(dbp, value) ;
1363 status = dbp->set_re_delim(dbp, value) ;
1369 svp = hv_fetch(action, "reclen", 6, FALSE);
1371 u_int32_t len = my_SvUV32(*svp) ;
1372 status = dbp->set_re_len(dbp, len) ;
1377 status = dbp->set_re_source(dbp, name) ;
1381 svp = hv_fetch(action, "bfname", 6, FALSE);
1382 if (svp && SvOK(*svp)) {
1383 char * ptr = SvPV(*svp,n_a) ;
1384 name = (char*) n_a ? ptr : NULL ;
1390 status = dbp->set_flags(dbp, (u_int32_t)DB_RENUMBER) ;
1393 (void)dbp->set_flags(dbp, (u_int32_t)flags) ;
1398 croak("type is not of type DB_File::HASHINFO, DB_File::BTREEINFO or DB_File::RECNOINFO");
1402 u_int32_t Flags = 0 ;
1405 /* Map 1.x flags to 3.x flags */
1406 if ((flags & O_CREAT) == O_CREAT)
1407 Flags |= DB_CREATE ;
1410 if (flags == O_RDONLY)
1412 if ((flags & O_RDONLY) == O_RDONLY && (flags & O_RDWR) != O_RDWR)
1414 Flags |= DB_RDONLY ;
1417 if ((flags & O_TRUNC) == O_TRUNC)
1418 Flags |= DB_TRUNCATE ;
1421 #ifdef AT_LEAST_DB_4_1
1422 status = (RETVAL->dbp->open)(RETVAL->dbp, NULL, name, NULL, RETVAL->type,
1425 status = (RETVAL->dbp->open)(RETVAL->dbp, name, NULL, RETVAL->type,
1428 /* printf("open returned %d %s\n", status, db_strerror(status)) ; */
1431 RETVAL->dbp->set_errcall(RETVAL->dbp, db_errcall_cb) ;
1433 status = (RETVAL->dbp->cursor)(RETVAL->dbp, NULL, &RETVAL->cursor,
1435 /* printf("cursor returned %d %s\n", status, db_strerror(status)) ; */
1439 RETVAL->dbp = NULL ;
1445 #endif /* Berkeley DB Version > 2 */
1447 } /* ParseOpenInfo */
1450 #include "constants.h"
1452 MODULE = DB_File PACKAGE = DB_File PREFIX = db_
1454 INCLUDE: constants.xs
1458 SV * sv_err = perl_get_sv(ERR_BUFF, GV_ADD|GV_ADDMULTI) ;
1460 __getBerkeleyDBInfo() ;
1463 empty.data = &zero ;
1464 empty.size = sizeof(recno_t) ;
1470 db_DoTie_(isHASH, dbtype, name=undef, flags=O_CREAT|O_RDWR, mode=0666, type=DB_HASH)
1477 char * name = (char *) NULL ;
1478 SV * sv = (SV *) NULL ;
1481 if (items >= 3 && SvOK(ST(2)))
1482 name = (char*) SvPV(ST(2), n_a) ;
1487 RETVAL = ParseOpenInfo(aTHX_ isHASH, name, flags, mode, sv) ;
1488 if (RETVAL->dbp == NULL)
1501 Trace(("DESTROY %p\n", db));
1503 Trace(("DESTROY %p done\n", db));
1505 SvREFCNT_dec(db->hash) ;
1507 SvREFCNT_dec(db->compare) ;
1509 SvREFCNT_dec(db->prefix) ;
1510 if (db->filter_fetch_key)
1511 SvREFCNT_dec(db->filter_fetch_key) ;
1512 if (db->filter_store_key)
1513 SvREFCNT_dec(db->filter_store_key) ;
1514 if (db->filter_fetch_value)
1515 SvREFCNT_dec(db->filter_fetch_value) ;
1516 if (db->filter_store_value)
1517 SvREFCNT_dec(db->filter_store_value) ;
1519 #ifdef DB_VERSION_MAJOR
1526 db_DELETE(db, key, flags=0)
1548 RETVAL = (((db->dbp)->get)(db->dbp, TXN &key, &value, 0) == 0) ;
1554 db_FETCH(db, key, flags=0)
1567 RETVAL = db_get(db, key, value, flags) ;
1568 ST(0) = sv_newmortal();
1569 OutputValue(ST(0), value)
1573 db_STORE(db, key, value, flags=0)
1598 RETVAL = do_SEQ(db, key, value, R_FIRST) ;
1599 ST(0) = sv_newmortal();
1600 OutputKey(ST(0), key) ;
1606 DBTKEY key = NO_INIT
1617 RETVAL = do_SEQ(db, key, value, R_NEXT) ;
1618 ST(0) = sv_newmortal();
1619 OutputKey(ST(0), key) ;
1623 # These would be nice for RECNO
1643 #ifdef DB_VERSION_MAJOR
1644 /* get the first value */
1645 RETVAL = do_SEQ(db, key, value, DB_FIRST) ;
1650 for (i = items-1 ; i > 0 ; --i)
1652 value.data = SvPV(ST(i), n_a) ;
1656 key.size = sizeof(int) ;
1657 #ifdef DB_VERSION_MAJOR
1658 RETVAL = (db->cursor->c_put)(db->cursor, &key, &value, DB_BEFORE) ;
1660 RETVAL = (db->dbp->put)(db->dbp, &key, &value, R_IBEFORE) ;
1686 /* First get the final value */
1687 RETVAL = do_SEQ(db, key, value, R_LAST) ;
1688 ST(0) = sv_newmortal();
1692 /* the call to del will trash value, so take a copy now */
1693 OutputValue(ST(0), value) ;
1694 RETVAL = db_del(db, key, R_CURSOR) ;
1696 sv_setsv(ST(0), &PL_sv_undef);
1716 /* get the first value */
1717 RETVAL = do_SEQ(db, key, value, R_FIRST) ;
1718 ST(0) = sv_newmortal();
1722 /* the call to del will trash value, so take a copy now */
1723 OutputValue(ST(0), value) ;
1724 RETVAL = db_del(db, key, R_CURSOR) ;
1726 sv_setsv (ST(0), &PL_sv_undef) ;
1749 /* Set the Cursor to the Last element */
1750 RETVAL = do_SEQ(db, key, value, R_LAST) ;
1751 #ifndef DB_VERSION_MAJOR
1756 keyval = *(int*)key.data ;
1759 for (i = 1 ; i < items ; ++i)
1761 value.data = SvPV(ST(i), n_a) ;
1764 key.data = &keyval ;
1765 key.size = sizeof(int) ;
1766 RETVAL = (Db->put)(Db, TXN &key, &value, 0) ;
1780 ALIAS: FETCHSIZE = 1
1783 RETVAL = GetArrayLength(aTHX_ db) ;
1789 # Now provide an interface to the rest of the DB functionality
1793 db_del(db, key, flags=0)
1801 RETVAL = db_del(db, key, flags) ;
1802 #ifdef DB_VERSION_MAJOR
1805 else if (RETVAL == DB_NOTFOUND)
1813 db_get(db, key, value, flags=0)
1823 RETVAL = db_get(db, key, value, flags) ;
1824 #ifdef DB_VERSION_MAJOR
1827 else if (RETVAL == DB_NOTFOUND)
1835 db_put(db, key, value, flags=0)
1844 RETVAL = db_put(db, key, value, flags) ;
1845 #ifdef DB_VERSION_MAJOR
1848 else if (RETVAL == DB_KEYEXIST)
1853 key if (flagSet(flags, R_IAFTER) || flagSet(flags, R_IBEFORE)) OutputKey(ST(1), key);
1862 #ifdef DB_VERSION_MAJOR
1866 status = (db->in_memory
1868 : ((db->dbp)->fd)(db->dbp, &RETVAL) ) ;
1873 RETVAL = (db->in_memory
1875 : ((db->dbp)->fd)(db->dbp) ) ;
1881 db_sync(db, flags=0)
1888 RETVAL = db_sync(db, flags) ;
1889 #ifdef DB_VERSION_MAJOR
1898 db_seq(db, key, value, flags)
1908 RETVAL = db_seq(db, key, value, flags);
1909 #ifdef DB_VERSION_MAJOR
1912 else if (RETVAL == DB_NOTFOUND)
1921 filter_fetch_key(db, code)
1924 SV * RETVAL = &PL_sv_undef ;
1926 DBM_setFilter(db->filter_fetch_key, code) ;
1929 filter_store_key(db, code)
1932 SV * RETVAL = &PL_sv_undef ;
1934 DBM_setFilter(db->filter_store_key, code) ;
1937 filter_fetch_value(db, code)
1940 SV * RETVAL = &PL_sv_undef ;
1942 DBM_setFilter(db->filter_fetch_value, code) ;
1945 filter_store_value(db, code)
1948 SV * RETVAL = &PL_sv_undef ;
1950 DBM_setFilter(db->filter_store_value, code) ;