3 DB_File.xs -- Perl 5 interface to Berkeley DB
5 written by Paul Marquess (pmarquess@bfsec.bt.co.uk)
6 last modified 7th October 1995
9 All comments/suggestions/problems are welcome
13 0.2 - No longer bombs out if dbopen returns an error.
14 0.3 - Added some support for multiple btree compares
15 1.0 - Complete support for multiple callbacks added.
16 Fixed a problem with pushing a value onto an empty list.
35 typedef DB_File_type * DB_File ;
47 #define db_DESTROY(db) (db->dbp->close)(db->dbp)
48 #define db_DELETE(db, key, flags) (db->dbp->del)(db->dbp, &key, flags)
49 #define db_STORE(db, key, value, flags) (db->dbp->put)(db->dbp, &key, &value, flags)
50 #define db_FETCH(db, key, flags) (db->dbp->get)(db->dbp, &key, &value, flags)
52 #define db_close(db) (db->dbp->close)(db->dbp)
53 #define db_del(db, key, flags) (db->dbp->del)(db->dbp, &key, flags)
54 #define db_fd(db) (db->dbp->fd)(db->dbp)
55 #define db_put(db, key, value, flags) (db->dbp->put)(db->dbp, &key, &value, flags)
56 #define db_get(db, key, value, flags) (db->dbp->get)(db->dbp, &key, &value, flags)
57 #define db_seq(db, key, value, flags) (db->dbp->seq)(db->dbp, &key, &value, flags)
58 #define db_sync(db, flags) (db->dbp->sync)(db->dbp, flags)
61 #define OutputValue(arg, name) \
62 { if (RETVAL == 0) sv_setpvn(arg, name.data, name.size) ; }
64 #define OutputKey(arg, name) \
67 if (db->type != DB_RECNO) \
68 sv_setpvn(arg, name.data, name.size); \
70 sv_setiv(arg, (I32)*(I32*)name.data - 1); \
74 /* Internal Global Data */
75 static recno_t Value ;
76 static DB_File CurrentDB ;
77 static recno_t zero = 0 ;
78 static DBTKEY empty = { &zero, sizeof(recno_t) } ;
82 btree_compare(key1, key2)
87 void * data1, * data2 ;
94 /* As newSVpv will assume that the data pointer is a null terminated C
95 string if the size parameter is 0, make sure that data points to an
96 empty string if the length is 0
108 PUSHs(sv_2mortal(newSVpv(data1,key1->size)));
109 PUSHs(sv_2mortal(newSVpv(data2,key2->size)));
112 count = perl_call_sv(CurrentDB->compare, G_SCALAR);
117 croak ("DB_File btree_compare: expected 1 return value from %s, got %d\n", count) ;
129 btree_prefix(key1, key2)
134 void * data1, * data2 ;
141 /* As newSVpv will assume that the data pointer is a null terminated C
142 string if the size parameter is 0, make sure that data points to an
143 empty string if the length is 0
155 PUSHs(sv_2mortal(newSVpv(data1,key1->size)));
156 PUSHs(sv_2mortal(newSVpv(data2,key2->size)));
159 count = perl_call_sv(CurrentDB->prefix, G_SCALAR);
164 croak ("DB_File btree_prefix: expected 1 return value from %s, got %d\n", count) ;
188 XPUSHs(sv_2mortal(newSVpv((char*)data,size)));
191 count = perl_call_sv(CurrentDB->hash, G_SCALAR);
196 croak ("DB_File hash_cb: expected 1 return value from %s, got %d\n", count) ;
214 printf ("HASH Info\n") ;
215 printf (" hash = %s\n", (hash.hash != NULL ? "redefined" : "default")) ;
216 printf (" bsize = %d\n", hash.bsize) ;
217 printf (" ffactor = %d\n", hash.ffactor) ;
218 printf (" nelem = %d\n", hash.nelem) ;
219 printf (" cachesize = %d\n", hash.cachesize) ;
220 printf (" lorder = %d\n", hash.lorder) ;
228 printf ("RECNO Info\n") ;
229 printf (" flags = %d\n", recno.flags) ;
230 printf (" cachesize = %d\n", recno.cachesize) ;
231 printf (" psize = %d\n", recno.psize) ;
232 printf (" lorder = %d\n", recno.lorder) ;
233 printf (" reclen = %d\n", recno.reclen) ;
234 printf (" bval = %d\n", recno.bval) ;
235 printf (" bfname = %s\n", recno.bfname) ;
241 printf ("BTREE Info\n") ;
242 printf (" compare = %s\n", (btree.compare ? "redefined" : "default")) ;
243 printf (" prefix = %s\n", (btree.prefix ? "redefined" : "default")) ;
244 printf (" flags = %d\n", btree.flags) ;
245 printf (" cachesize = %d\n", btree.cachesize) ;
246 printf (" psize = %d\n", btree.psize) ;
247 printf (" maxkeypage = %d\n", btree.maxkeypage) ;
248 printf (" minkeypage = %d\n", btree.minkeypage) ;
249 printf (" lorder = %d\n", btree.lorder) ;
254 #define PrintRecno(recno)
255 #define PrintHash(hash)
256 #define PrintBtree(btree)
269 RETVAL = (db->seq)(db, &key, &value, R_LAST) ;
271 RETVAL = *(I32 *)key.data ;
272 else if (RETVAL == 1) /* No key means empty file */
279 ParseOpenInfo(name, flags, mode, sv, string)
289 DB_File RETVAL = (DB_File)safemalloc(sizeof(DB_File_type)) ;
290 void * openinfo = NULL ;
291 /* DBTYPE type = DB_HASH ; */
293 RETVAL->hash = RETVAL->compare = RETVAL->prefix = NULL ;
294 RETVAL->type = DB_HASH ;
299 croak ("type parameter is not a reference") ;
301 action = (HV*)SvRV(sv);
302 if (sv_isa(sv, "DB_File::HASHINFO"))
304 RETVAL->type = DB_HASH ;
305 openinfo = (void*)&info ;
307 svp = hv_fetch(action, "hash", 4, FALSE);
309 if (svp && SvOK(*svp))
311 info.hash.hash = hash_cb ;
312 RETVAL->hash = newSVsv(*svp) ;
315 info.hash.hash = NULL ;
317 svp = hv_fetch(action, "bsize", 5, FALSE);
318 info.hash.bsize = svp ? SvIV(*svp) : 0;
320 svp = hv_fetch(action, "ffactor", 7, FALSE);
321 info.hash.ffactor = svp ? SvIV(*svp) : 0;
323 svp = hv_fetch(action, "nelem", 5, FALSE);
324 info.hash.nelem = svp ? SvIV(*svp) : 0;
326 svp = hv_fetch(action, "cachesize", 9, FALSE);
327 info.hash.cachesize = svp ? SvIV(*svp) : 0;
329 svp = hv_fetch(action, "lorder", 6, FALSE);
330 info.hash.lorder = svp ? SvIV(*svp) : 0;
334 else if (sv_isa(sv, "DB_File::BTREEINFO"))
336 RETVAL->type = DB_BTREE ;
337 openinfo = (void*)&info ;
339 svp = hv_fetch(action, "compare", 7, FALSE);
340 if (svp && SvOK(*svp))
342 info.btree.compare = btree_compare ;
343 RETVAL->compare = newSVsv(*svp) ;
346 info.btree.compare = NULL ;
348 svp = hv_fetch(action, "prefix", 6, FALSE);
349 if (svp && SvOK(*svp))
351 info.btree.prefix = btree_prefix ;
352 RETVAL->prefix = newSVsv(*svp) ;
355 info.btree.prefix = NULL ;
357 svp = hv_fetch(action, "flags", 5, FALSE);
358 info.btree.flags = svp ? SvIV(*svp) : 0;
360 svp = hv_fetch(action, "cachesize", 9, FALSE);
361 info.btree.cachesize = svp ? SvIV(*svp) : 0;
363 svp = hv_fetch(action, "minkeypage", 10, FALSE);
364 info.btree.minkeypage = svp ? SvIV(*svp) : 0;
366 svp = hv_fetch(action, "maxkeypage", 10, FALSE);
367 info.btree.maxkeypage = svp ? SvIV(*svp) : 0;
369 svp = hv_fetch(action, "psize", 5, FALSE);
370 info.btree.psize = svp ? SvIV(*svp) : 0;
372 svp = hv_fetch(action, "lorder", 6, FALSE);
373 info.btree.lorder = svp ? SvIV(*svp) : 0;
378 else if (sv_isa(sv, "DB_File::RECNOINFO"))
380 RETVAL->type = DB_RECNO ;
381 openinfo = (void *)&info ;
383 svp = hv_fetch(action, "flags", 5, FALSE);
384 info.recno.flags = (u_long) svp ? SvIV(*svp) : 0;
386 svp = hv_fetch(action, "cachesize", 9, FALSE);
387 info.recno.cachesize = (u_int) svp ? SvIV(*svp) : 0;
389 svp = hv_fetch(action, "psize", 5, FALSE);
390 info.recno.psize = (int) svp ? SvIV(*svp) : 0;
392 svp = hv_fetch(action, "lorder", 6, FALSE);
393 info.recno.lorder = (int) svp ? SvIV(*svp) : 0;
395 svp = hv_fetch(action, "reclen", 6, FALSE);
396 info.recno.reclen = (size_t) svp ? SvIV(*svp) : 0;
398 svp = hv_fetch(action, "bval", 4, FALSE);
399 if (svp && SvOK(*svp))
402 info.recno.bval = (u_char)*SvPV(*svp, na) ;
404 info.recno.bval = (u_char)(unsigned long) SvIV(*svp) ;
408 if (info.recno.flags & R_FIXEDLEN)
409 info.recno.bval = (u_char) ' ' ;
411 info.recno.bval = (u_char) '\n' ;
414 svp = hv_fetch(action, "bfname", 6, FALSE);
415 info.recno.bfname = (char *) svp ? SvPV(*svp,na) : 0;
420 croak("type is not of type DB_File::HASHINFO, DB_File::BTREEINFO or DB_File::RECNOINFO");
424 RETVAL->dbp = dbopen(name, flags, mode, RETVAL->type, openinfo) ;
427 /* kludge mode on: RETVAL->type for DB_RECNO is set to DB_BTREE
428 so remember a DB_RECNO by saving the address
429 of one of it's internal routines
431 if (RETVAL->dbp && type == DB_RECNO)
432 DB_recno_close = RETVAL->dbp->close ;
444 croak("DB_File::%s not implemented on this architecture", s);
458 if (strEQ(name, "BTREEMAGIC"))
464 if (strEQ(name, "BTREEVERSION"))
474 if (strEQ(name, "DB_LOCK"))
480 if (strEQ(name, "DB_SHMEM"))
486 if (strEQ(name, "DB_TXN"))
500 if (strEQ(name, "HASHMAGIC"))
506 if (strEQ(name, "HASHVERSION"))
522 if (strEQ(name, "MAX_PAGE_NUMBER"))
523 #ifdef MAX_PAGE_NUMBER
524 return (U32)MAX_PAGE_NUMBER;
528 if (strEQ(name, "MAX_PAGE_OFFSET"))
529 #ifdef MAX_PAGE_OFFSET
530 return MAX_PAGE_OFFSET;
534 if (strEQ(name, "MAX_REC_NUMBER"))
535 #ifdef MAX_REC_NUMBER
536 return (U32)MAX_REC_NUMBER;
550 if (strEQ(name, "RET_ERROR"))
556 if (strEQ(name, "RET_SPECIAL"))
562 if (strEQ(name, "RET_SUCCESS"))
568 if (strEQ(name, "R_CURSOR"))
574 if (strEQ(name, "R_DUP"))
580 if (strEQ(name, "R_FIRST"))
586 if (strEQ(name, "R_FIXEDLEN"))
592 if (strEQ(name, "R_IAFTER"))
598 if (strEQ(name, "R_IBEFORE"))
604 if (strEQ(name, "R_LAST"))
610 if (strEQ(name, "R_NEXT"))
616 if (strEQ(name, "R_NOKEY"))
622 if (strEQ(name, "R_NOOVERWRITE"))
624 return R_NOOVERWRITE;
628 if (strEQ(name, "R_PREV"))
634 if (strEQ(name, "R_RECNOSYNC"))
640 if (strEQ(name, "R_SETCURSOR"))
646 if (strEQ(name, "R_SNAPSHOT"))
670 if (strEQ(name, "__R_UNUSED"))
686 MODULE = DB_File PACKAGE = DB_File PREFIX = db_
695 db_TIEHASH(dbtype, name=undef, flags=O_RDWR, mode=0640, type=DB_HASH)
701 char * name = (char *) NULL ;
702 SV * sv = (SV *) NULL ;
704 if (items >= 2 && SvOK(ST(1)))
705 name = (char*) SvPV(ST(1), na) ;
710 RETVAL = ParseOpenInfo(name, flags, mode, sv, "new") ;
716 newXS("DB_File::TIEARRAY", XS_DB_File_db_TIEHASH, file);
725 SvREFCNT_dec(db->hash) ;
727 SvREFCNT_dec(db->compare) ;
729 SvREFCNT_dec(db->prefix) ;
734 db_DELETE(db, key, flags=0)
742 db_FETCH(db, key, flags=0)
751 RETVAL = (db->dbp->get)(db->dbp, &key, &value, flags) ;
752 ST(0) = sv_newmortal();
754 sv_setpvn(ST(0), value.data, value.size);
758 db_STORE(db, key, value, flags=0)
776 RETVAL = (db->dbp->seq)(db->dbp, &key, &value, R_FIRST) ;
777 ST(0) = sv_newmortal();
780 if (db->dbp->type != DB_RECNO)
781 sv_setpvn(ST(0), key.data, key.size);
783 sv_setiv(ST(0), (I32)*(I32*)key.data - 1);
796 RETVAL = (db->dbp->seq)(db->dbp, &key, &value, R_NEXT) ;
797 ST(0) = sv_newmortal();
800 if (db->dbp->type != DB_RECNO)
801 sv_setpvn(ST(0), key.data, key.size);
803 sv_setiv(ST(0), (I32)*(I32*)key.data - 1);
808 # These would be nice for RECNO
823 for (i = items-1 ; i > 0 ; --i)
825 value.data = SvPV(ST(i), na) ;
829 key.size = sizeof(int) ;
830 RETVAL = (db->dbp->put)(db->dbp, &key, &value, R_IBEFORE) ;
847 /* First get the final value */
848 RETVAL = (db->dbp->seq)(db->dbp, &key, &value, R_LAST) ;
849 ST(0) = sv_newmortal();
853 RETVAL = (db->dbp->del)(db->dbp, &key, R_CURSOR) ;
855 sv_setpvn(ST(0), value.data, value.size);
868 /* get the first value */
869 RETVAL = (db->dbp->seq)(db->dbp, &key, &value, R_FIRST) ;
870 ST(0) = sv_newmortal();
874 RETVAL = (db->dbp->del)(db->dbp, &key, R_CURSOR) ;
876 sv_setpvn(ST(0), value.data, value.size);
887 DBTKEY * keyptr = &key ;
892 /* Set the Cursor to the Last element */
893 RETVAL = (db->dbp->seq)(db->dbp, &key, &value, R_LAST) ;
898 for (i = items - 1 ; i > 0 ; --i)
900 value.data = SvPV(ST(i), na) ;
902 RETVAL = (db->dbp->put)(db->dbp, keyptr, &value, R_IAFTER) ;
917 RETVAL = GetArrayLength(db->dbp) ;
923 # Now provide an interface to the rest of the DB functionality
927 db_del(db, key, flags=0)
936 db_get(db, key, value, flags=0)
947 db_put(db, key, value, flags=0)
955 key if (flags & (R_IAFTER|R_IBEFORE)) OutputKey(ST(1), key);
972 db_seq(db, key, value, flags)