diff options
Diffstat (limited to 'ext/sdbm')
-rw-r--r-- | ext/sdbm/.cvsignore | 2 | ||||
-rw-r--r-- | ext/sdbm/MANIFEST | 6 | ||||
-rw-r--r-- | ext/sdbm/_sdbm.c | 973 | ||||
-rw-r--r-- | ext/sdbm/depend | 2 | ||||
-rw-r--r-- | ext/sdbm/extconf.rb | 3 | ||||
-rw-r--r-- | ext/sdbm/init.c | 761 | ||||
-rw-r--r-- | ext/sdbm/sdbm.h | 84 | ||||
-rw-r--r-- | ext/sdbm/testsdbm.rb | 556 |
8 files changed, 0 insertions, 2387 deletions
diff --git a/ext/sdbm/.cvsignore b/ext/sdbm/.cvsignore deleted file mode 100644 index fc802ff1c2..0000000000 --- a/ext/sdbm/.cvsignore +++ /dev/null @@ -1,2 +0,0 @@ -Makefile -mkmf.log diff --git a/ext/sdbm/MANIFEST b/ext/sdbm/MANIFEST deleted file mode 100644 index 8888e69ad4..0000000000 --- a/ext/sdbm/MANIFEST +++ /dev/null @@ -1,6 +0,0 @@ -MANIFEST -_sdbm.c -depend -extconf.rb -init.c -sdbm.h diff --git a/ext/sdbm/_sdbm.c b/ext/sdbm/_sdbm.c deleted file mode 100644 index d8bfae80b2..0000000000 --- a/ext/sdbm/_sdbm.c +++ /dev/null @@ -1,973 +0,0 @@ -/* - * sdbm - ndbm work-alike hashed database library - * based on Per-Aake Larson's Dynamic Hashing algorithms. BIT 18 (1978). - * author: oz@nexus.yorku.ca - * status: public domain. - * - * core routines - */ - -#ifndef lint -/*char sdbm_rcsid[] = "$Id$";*/ -#endif - -#include "sdbm.h" -#include "config.h" - -/* - * sdbm - ndbm work-alike hashed database library - * tuning and portability constructs [not nearly enough] - * author: oz@nexus.yorku.ca - */ - -#define BYTESIZ 8 - -#ifdef HAVE_UNISTD_H -#include <unistd.h> -#endif - -#ifdef BSD42 -#define SEEK_SET L_SET -#define memset(s,c,n) bzero(s, n) /* only when c is zero */ -#define memcpy(s1,s2,n) bcopy(s2, s1, n) -#define memcmp(s1,s2,n) bcmp(s1,s2,n) -#endif - -/* - * important tuning parms (hah) - */ - -#define SEEDUPS /* always detect duplicates */ -#define BADMESS /* generate a message for worst case: - cannot make room after SPLTMAX splits */ -/* - * misc - */ -#ifdef DEBUG -#define debug(x) printf x -#else -#define debug(x) -#endif - -#ifdef BIG_E -#define GET_SHORT(p, i) (((unsigned)((unsigned char *)(p))[(i)*2] << 8) + (((unsigned char *)(p))[(i)*2 + 1])) -#define PUT_SHORT(p, i, s) (((unsigned char *)(p))[(i)*2] = (unsigned char)((s) >> 8), ((unsigned char *)(p))[(i)*2 + 1] = (unsigned char)(s)) -#else -#define GET_SHORT(p, i) ((p)[i]) -#define PUT_SHORT(p, i, s) ((p)[i] = (s)) -#endif - -/*#include "pair.h"*/ -static int fitpair proto((char *, int)); -static void putpair proto((char *, datum, datum)); -static datum getpair proto((char *, datum)); -static int delpair proto((char *, datum)); -static int chkpage proto((char *)); -static datum getnkey proto((char *, int)); -static void splpage proto((char *, char *, long)); -#ifdef SEEDUPS -static int duppair proto((char *, datum)); -#endif - -#include <stdio.h> -#include <stdlib.h> -#ifdef MSDOS -#include <io.h> -#endif -#include <sys/types.h> -#include <sys/stat.h> -#ifdef BSD42 -#include <sys/file.h> -#else -#include <fcntl.h> -/*#include <memory.h>*/ -#endif -#ifndef O_BINARY -#define O_BINARY 0 -#endif - -#include <errno.h> -#ifndef EPERM -#define EPERM EACCES -#endif -#include <string.h> - -#ifdef __STDC__ -#include <stddef.h> -#endif - -#ifndef NULL -#define NULL 0 -#endif - -/* - * externals - */ -#if !defined sun && !defined MSDOS && !defined _WIN32 && !defined __CYGWIN__ -extern int errno; -#endif - -/* - * forward - */ -static int getdbit proto((DBM *, long)); -static int setdbit proto((DBM *, long)); -static int getpage proto((DBM *, long)); -static datum getnext proto((DBM *)); -static int makroom proto((DBM *, long, int)); - -/* - * useful macros - */ -#define bad(x) ((x).dptr == NULL || (x).dsize < 0) -#define exhash(item) sdbm_hash((item).dptr, (item).dsize) -#define ioerr(db) ((db)->flags |= DBM_IOERR) - -#define OFF_PAG(off) (long) (off) * PBLKSIZ -#define OFF_DIR(off) (long) (off) * DBLKSIZ - -static long masks[] = { - 000000000000L, 000000000001L, 000000000003L, - 000000000007L, 000000000017L, 000000000037L, - 000000000077L, 000000000177L, 000000000377L, - 000000000777L, 000000001777L, 000000003777L, - 000000007777L, 000000017777L, 000000037777L, - 000000077777L, 000000177777L, 000000377777L, - 000000777777L, 000001777777L, 000003777777L, - 000007777777L, 000017777777L, 000037777777L, - 000077777777L, 000177777777L, 000377777777L, - 000777777777L, 001777777777L, 003777777777L, - 007777777777L, 017777777777L -}; - -datum nullitem = {NULL, 0}; - -DBM * -sdbm_open(file, flags, mode) -register char *file; -register int flags; -register int mode; -{ - register DBM *db; - register char *dirname; - register char *pagname; - register int n; - - if (file == NULL || !*file) - return errno = EINVAL, (DBM *) NULL; -/* - * need space for two seperate filenames - */ - n = strlen(file) * 2 + strlen(DIRFEXT) + strlen(PAGFEXT) + 2; - - if ((dirname = malloc((unsigned) n)) == NULL) - return errno = ENOMEM, (DBM *) NULL; -/* - * build the file names - */ - dirname = strcat(strcpy(dirname, file), DIRFEXT); - pagname = strcpy(dirname + strlen(dirname) + 1, file); - pagname = strcat(pagname, PAGFEXT); - - db = sdbm_prep(dirname, pagname, flags, mode); - free((char *) dirname); - return db; -} - -DBM * -sdbm_prep(dirname, pagname, flags, mode) -char *dirname; -char *pagname; -int flags; -int mode; -{ - register DBM *db; - struct stat dstat; - - if ((db = (DBM *) malloc(sizeof(DBM))) == NULL) - return errno = ENOMEM, (DBM *) NULL; - - db->flags = 0; - db->hmask = 0; - db->blkptr = 0; - db->keyptr = 0; -/* - * adjust user flags so that WRONLY becomes RDWR, - * as required by this package. Also set our internal - * flag for RDONLY. - */ - if (flags & O_WRONLY) - flags = (flags & ~O_WRONLY) | O_RDWR; - if (flags & O_RDONLY) - db->flags = DBM_RDONLY; -/* - * open the files in sequence, and stat the dirfile. - * If we fail anywhere, undo everything, return NULL. - */ - flags |= O_BINARY; - if ((db->pagf = open(pagname, flags, mode)) > -1) { - if ((db->dirf = open(dirname, flags, mode)) > -1) { -/* - * need the dirfile size to establish max bit number. - */ - if (fstat(db->dirf, &dstat) == 0) { -/* - * zero size: either a fresh database, or one with a single, - * unsplit data page: dirpage is all zeros. - */ - db->dirbno = (!dstat.st_size) ? 0 : -1; - db->pagbno = -1; - db->maxbno = dstat.st_size * (long) BYTESIZ; - - (void) memset(db->pagbuf, 0, PBLKSIZ); - (void) memset(db->dirbuf, 0, DBLKSIZ); - /* - * success - */ - return db; - } - (void) close(db->dirf); - } - (void) close(db->pagf); - } - free((char *) db); - return (DBM *) NULL; -} - -void -sdbm_close(db) -register DBM *db; -{ - if (db == NULL) - errno = EINVAL; - else { - (void) close(db->dirf); - (void) close(db->pagf); - free((char *) db); - } -} - -datum -sdbm_fetch(db, key) -register DBM *db; -datum key; -{ - if (db == NULL || bad(key)) - return errno = EINVAL, nullitem; - - if (getpage(db, exhash(key))) - return getpair(db->pagbuf, key); - - return ioerr(db), nullitem; -} - -int -sdbm_delete(db, key) -register DBM *db; -datum key; -{ - if (db == NULL || bad(key)) - return errno = EINVAL, -1; - if (sdbm_rdonly(db)) - return errno = EPERM, -1; - - if (getpage(db, exhash(key))) { - if (!delpair(db->pagbuf, key)) - return -1; -/* - * update the page file - */ - if (lseek(db->pagf, OFF_PAG(db->pagbno), SEEK_SET) < 0 - || write(db->pagf, db->pagbuf, PBLKSIZ) < 0) - return ioerr(db), -1; - - return 0; - } - - return ioerr(db), -1; -} - -int -sdbm_store(db, key, val, flags) -register DBM *db; -datum key; -datum val; -int flags; -{ - int need; - register long hash; - - if (db == NULL || bad(key)) - return errno = EINVAL, -1; - if (sdbm_rdonly(db)) - return errno = EPERM, -1; - - need = key.dsize + val.dsize; -/* - * is the pair too big (or too small) for this database ?? - */ - if (need < 0 || need > PAIRMAX) - return errno = EINVAL, -1; - - if (getpage(db, (hash = exhash(key)))) { -/* - * if we need to replace, delete the key/data pair - * first. If it is not there, ignore. - */ - if (flags == DBM_REPLACE) - (void) delpair(db->pagbuf, key); -#ifdef SEEDUPS - else if (duppair(db->pagbuf, key)) - return 1; -#endif -/* - * if we do not have enough room, we have to split. - */ - if (!fitpair(db->pagbuf, need)) - if (!makroom(db, hash, need)) - return ioerr(db), -1; -/* - * we have enough room or split is successful. insert the key, - * and update the page file. - */ - (void) putpair(db->pagbuf, key, val); - - if (lseek(db->pagf, OFF_PAG(db->pagbno), SEEK_SET) < 0 - || write(db->pagf, db->pagbuf, PBLKSIZ) < 0) - return ioerr(db), -1; - /* - * success - */ - return 0; - } - - return ioerr(db), -1; -} - -/* - * makroom - make room by splitting the overfull page - * this routine will attempt to make room for SPLTMAX times before - * giving up. - */ -static int -makroom(db, hash, need) -register DBM *db; -long hash; -int need; -{ - long newp; - char twin[PBLKSIZ]; -#if defined MSDOS || (defined _WIN32 && !defined __CYGWIN__) - char zer[PBLKSIZ]; - long oldtail; -#endif - char *pag = db->pagbuf; - char *new = twin; - register int smax = SPLTMAX; - - do { -/* - * split the current page - */ - (void) splpage(pag, new, db->hmask + 1); -/* - * address of the new page - */ - newp = (hash & db->hmask) | (db->hmask + 1); - debug(("newp: %ld\n", newp)); -/* - * write delay, read avoidence/cache shuffle: - * select the page for incoming pair: if key is to go to the new page, - * write out the previous one, and copy the new one over, thus making - * it the current page. If not, simply write the new page, and we are - * still looking at the page of interest. current page is not updated - * here, as sdbm_store will do so, after it inserts the incoming pair. - */ - -#if defined MSDOS || (defined _WIN32 && !defined __CYGWIN__) - /* - * Fill hole with 0 if made it. - * (hole is NOT read as 0) - */ - oldtail = lseek(db->pagf, 0L, SEEK_END); - memset(zer, 0, PBLKSIZ); - while (OFF_PAG(newp) > oldtail) { - if (lseek(db->pagf, 0L, SEEK_END) < 0 || - write(db->pagf, zer, PBLKSIZ) < 0) { - - return 0; - } - oldtail += PBLKSIZ; - } -#endif - - if (hash & (db->hmask + 1)) { - if (lseek(db->pagf, OFF_PAG(db->pagbno), SEEK_SET) < 0 - || write(db->pagf, db->pagbuf, PBLKSIZ) < 0) - return 0; - db->pagbno = newp; - (void) memcpy(pag, new, PBLKSIZ); - } - else if (lseek(db->pagf, OFF_PAG(newp), SEEK_SET) < 0 - || write(db->pagf, new, PBLKSIZ) < 0) - return 0; - - if (!setdbit(db, db->curbit)) - return 0; -/* - * see if we have enough room now - */ - if (fitpair(pag, need)) - return 1; -/* - * try again... update curbit and hmask as getpage would have - * done. because of our update of the current page, we do not - * need to read in anything. BUT we have to write the current - * [deferred] page out, as the window of failure is too great. - */ - db->curbit = 2 * db->curbit + - ((hash & (db->hmask + 1)) ? 2 : 1); - db->hmask |= (db->hmask + 1); - - if (lseek(db->pagf, OFF_PAG(db->pagbno), SEEK_SET) < 0 - || write(db->pagf, db->pagbuf, PBLKSIZ) < 0) - return 0; - - } while (--smax); -/* - * if we are here, this is real bad news. After SPLTMAX splits, - * we still cannot fit the key. say goodnight. - */ -#ifdef BADMESS - (void) write(2, "sdbm: cannot insert after SPLTMAX attempts.\n", 44); -#endif - return 0; - -} - -/* - * the following two routines will break if - * deletions aren't taken into account. (ndbm bug) - */ -datum -sdbm_firstkey(db) -register DBM *db; -{ - if (db == NULL) - return errno = EINVAL, nullitem; -/* - * start at page 0 - */ - (void) memset(db->pagbuf, 0, PBLKSIZ); - if (lseek(db->pagf, OFF_PAG(0), SEEK_SET) < 0 - || read(db->pagf, db->pagbuf, PBLKSIZ) < 0) - return ioerr(db), nullitem; - db->pagbno = 0; - db->blkptr = 0; - db->keyptr = 0; - - return getnext(db); -} - -datum -sdbm_nextkey(db) -register DBM *db; -{ - if (db == NULL) - return errno = EINVAL, nullitem; - return getnext(db); -} - -/* - * all important binary trie traversal - */ -static int -getpage(db, hash) -register DBM *db; -register long hash; -{ - register int hbit; - register long dbit; - register long pagb; - - dbit = 0; - hbit = 0; - while (dbit < db->maxbno && getdbit(db, dbit)) - dbit = 2 * dbit + ((hash & ((long) 1 << hbit++)) ? 2 : 1); - - debug(("dbit: %d...", dbit)); - - db->curbit = dbit; - db->hmask = masks[hbit]; - - pagb = hash & db->hmask; -/* - * see if the block we need is already in memory. - * note: this lookaside cache has about 10% hit rate. - */ - if (pagb != db->pagbno) { -/* - * note: here, we assume a "hole" is read as 0s. - * if not, must zero pagbuf first. - */ - (void) memset(db->pagbuf, 0, PBLKSIZ); - - if (lseek(db->pagf, OFF_PAG(pagb), SEEK_SET) < 0 - || read(db->pagf, db->pagbuf, PBLKSIZ) < 0) - return 0; - if (!chkpage(db->pagbuf)) { - return 0; - } - db->pagbno = pagb; - - debug(("pag read: %d\n", pagb)); - } - return 1; -} - -static int -getdbit(db, dbit) -register DBM *db; -register long dbit; -{ - register long c; - register long dirb; - - c = dbit / BYTESIZ; - dirb = c / DBLKSIZ; - - if (dirb != db->dirbno) { - if (lseek(db->dirf, OFF_DIR(dirb), SEEK_SET) < 0 - || read(db->dirf, db->dirbuf, DBLKSIZ) < 0) - return 0; - db->dirbno = dirb; - - debug(("dir read: %d\n", dirb)); - } - - return db->dirbuf[c % DBLKSIZ] & (1 << (dbit % BYTESIZ)); -} - -static int -setdbit(db, dbit) -register DBM *db; -register long dbit; -{ - register long c; - register long dirb; - - c = dbit / BYTESIZ; - dirb = c / DBLKSIZ; - - if (dirb != db->dirbno) { - if (lseek(db->dirf, OFF_DIR(dirb), SEEK_SET) < 0 - || read(db->dirf, db->dirbuf, DBLKSIZ) < 0) - return 0; - db->dirbno = dirb; - - debug(("dir read: %d\n", dirb)); - } - - db->dirbuf[c % DBLKSIZ] |= (1 << (dbit % BYTESIZ)); - - if (dbit >= db->maxbno) - db->maxbno += (long) DBLKSIZ * BYTESIZ; - - if (lseek(db->dirf, OFF_DIR(dirb), SEEK_SET) < 0 - || write(db->dirf, db->dirbuf, DBLKSIZ) < 0) - return 0; - - return 1; -} - -/* - * getnext - get the next key in the page, and if done with - * the page, try the next page in sequence - */ -static datum -getnext(db) -register DBM *db; -{ - datum key; - - for (;;) { - db->keyptr++; - key = getnkey(db->pagbuf, db->keyptr); - if (key.dptr != NULL) - return key; -/* - * we either run out, or there is nothing on this page.. - * try the next one... If we lost our position on the - * file, we will have to seek. - */ - db->keyptr = 0; - if (db->pagbno != db->blkptr++) - if (lseek(db->pagf, OFF_PAG(db->blkptr), SEEK_SET) < 0) - break; - db->pagbno = db->blkptr; - if (read(db->pagf, db->pagbuf, PBLKSIZ) <= 0) - break; - if (!chkpage(db->pagbuf)) { - break; - } - } - - return ioerr(db), nullitem; -} - -/* pair.c */ -/* - * sdbm - ndbm work-alike hashed database library - * based on Per-Aake Larson's Dynamic Hashing algorithms. BIT 18 (1978). - * author: oz@nexus.yorku.ca - * status: public domain. - * - * page-level routines - */ - -#ifndef lint -/*char pair_rcsid[] = "$Id$";*/ -#endif - -#ifndef BSD42 -/*#include <memory.h>*/ -#endif - -#define exhash(item) sdbm_hash((item).dptr, (item).dsize) - -/* - * forward - */ -static int seepair proto((char *, int, char *, int)); - -/* - * page format: - * +------------------------------+ - * ino | n | keyoff | datoff | keyoff | - * +------------+--------+--------+ - * | datoff | - - - ----> | - * +--------+---------------------+ - * | F R E E A R E A | - * +--------------+---------------+ - * | <---- - - - | data | - * +--------+-----+----+----------+ - * | key | data | key | - * +--------+----------+----------+ - * - * calculating the offsets for free area: if the number - * of entries (ino[0]) is zero, the offset to the END of - * the free area is the block size. Otherwise, it is the - * nth (ino[ino[0]]) entry's offset. - */ - -static int -fitpair(pag, need) -char *pag; -int need; -{ - register int n; - register int off; - register int free; - register short *ino = (short *) pag; - - off = ((n = GET_SHORT(ino,0)) > 0) ? GET_SHORT(ino,n) : PBLKSIZ; - free = off - (n + 1) * sizeof(short); - need += 2 * sizeof(short); - - debug(("free %d need %d\n", free, need)); - - return need <= free; -} - -static void -putpair(pag, key, val) -char *pag; -datum key; -datum val; -{ - register int n; - register int off; - register short *ino = (short *) pag; - - off = ((n = GET_SHORT(ino,0)) > 0) ? GET_SHORT(ino,n) : PBLKSIZ; -/* - * enter the key first - */ - off -= key.dsize; - if (key.dsize) - (void) memcpy(pag + off, key.dptr, key.dsize); - PUT_SHORT(ino,n + 1,off); -/* - * now the data - */ - off -= val.dsize; - if (val.dsize) - (void) memcpy(pag + off, val.dptr, val.dsize); - PUT_SHORT(ino,n + 2,off); -/* - * adjust item count - */ - PUT_SHORT(ino,0,GET_SHORT(ino,0) + 2); -} - -static datum -getpair(pag, key) -char *pag; -datum key; -{ - register int i; - register int n; - datum val; - register short *ino = (short *) pag; - - if ((n = GET_SHORT(ino,0)) == 0) - return nullitem; - - if ((i = seepair(pag, n, key.dptr, key.dsize)) == 0) - return nullitem; - - val.dptr = pag + GET_SHORT(ino,i + 1); - val.dsize = GET_SHORT(ino,i) - GET_SHORT(ino,i + 1); - return val; -} - -#ifdef SEEDUPS -static int -duppair(pag, key) -char *pag; -datum key; -{ - register short *ino = (short *) pag; - return GET_SHORT(ino,0) > 0 && - seepair(pag, GET_SHORT(ino,0), key.dptr, key.dsize) > 0; -} -#endif - -static datum -getnkey(pag, num) -char *pag; -int num; -{ - datum key; - register int off; - register short *ino = (short *) pag; - - num = num * 2 - 1; - if (GET_SHORT(ino,0) == 0 || num > GET_SHORT(ino,0)) - return nullitem; - - off = (num > 1) ? GET_SHORT(ino,num - 1) : PBLKSIZ; - - key.dptr = pag + GET_SHORT(ino,num); - key.dsize = off - GET_SHORT(ino,num); - - return key; -} - -static int -delpair(pag, key) -char *pag; -datum key; -{ - register int n; - register int i; - register short *ino = (short *) pag; - - if ((n = GET_SHORT(ino,0)) == 0) - return 0; - - if ((i = seepair(pag, n, key.dptr, key.dsize)) == 0) - return 0; -/* - * found the key. if it is the last entry - * [i.e. i == n - 1] we just adjust the entry count. - * hard case: move all data down onto the deleted pair, - * shift offsets onto deleted offsets, and adjust them. - * [note: 0 < i < n] - */ - if (i < n - 1) { - register int m; - register char *dst = pag + (i == 1 ? PBLKSIZ : GET_SHORT(ino,i - 1)); - register char *src = pag + GET_SHORT(ino,i + 1); - register int zoo = dst - src; - - debug(("free-up %d ", zoo)); -/* - * shift data/keys down - */ - m = GET_SHORT(ino,i + 1) - GET_SHORT(ino,n); -#ifdef DUFF -#define MOVB *--dst = *--src - - if (m > 0) { - register int loop = (m + 8 - 1) >> 3; - - switch (m & (8 - 1)) { - case 0: do { - MOVB; case 7: MOVB; - case 6: MOVB; case 5: MOVB; - case 4: MOVB; case 3: MOVB; - case 2: MOVB; case 1: MOVB; - } while (--loop); - } - } -#else -#ifdef MEMMOVE - memmove(dst, src, m); -#else - while (m--) - *--dst = *--src; -#endif -#endif -/* - * adjust offset index up - */ - while (i < n - 1) { - PUT_SHORT(ino,i, GET_SHORT(ino,i + 2) + zoo); - i++; - } - } - PUT_SHORT(ino, 0, GET_SHORT(ino, 0) - 2); - return 1; -} - -/* - * search for the key in the page. - * return offset index in the range 0 < i < n. - * return 0 if not found. - */ -static int -seepair(pag, n, key, siz) -char *pag; -register int n; -register char *key; -register int siz; -{ - register int i; - register int off = PBLKSIZ; - register short *ino = (short *) pag; - - for (i = 1; i < n; i += 2) { - if (siz == off - GET_SHORT(ino,i) && - memcmp(key, pag + GET_SHORT(ino,i), siz) == 0) - return i; - off = GET_SHORT(ino,i + 1); - } - return 0; -} - -static void -splpage(pag, new, sbit) -char *pag; -char *new; -long sbit; -{ - datum key; - datum val; - - register int n; - register int off = PBLKSIZ; - char cur[PBLKSIZ]; - register short *ino = (short *) cur; - - (void) memcpy(cur, pag, PBLKSIZ); - (void) memset(pag, 0, PBLKSIZ); - (void) memset(new, 0, PBLKSIZ); - - n = GET_SHORT(ino,0); - for (ino++; n > 0; ino += 2) { - key.dptr = cur + GET_SHORT(ino,0); - key.dsize = off - GET_SHORT(ino,0); - val.dptr = cur + GET_SHORT(ino,1); - val.dsize = GET_SHORT(ino,0) - GET_SHORT(ino,1); -/* - * select the page pointer (by looking at sbit) and insert - */ - (void) putpair((exhash(key) & sbit) ? new : pag, key, val); - - off = GET_SHORT(ino,1); - n -= 2; - } - - debug(("%d split %d/%d\n", ((short *) cur)[0] / 2, - ((short *) new)[0] / 2, - ((short *) pag)[0] / 2)); -} - -/* - * check page sanity: - * number of entries should be something - * reasonable, and all offsets in the index should be in order. - * this could be made more rigorous. - */ -static int -chkpage(pag) -char *pag; -{ - register int n; - register int off; - register short *ino = (short *) pag; - - if ((n = GET_SHORT(ino,0)) < 0 || n > PBLKSIZ / sizeof(short)) - return 0; - - if (n > 0) { - off = PBLKSIZ; - for (ino++; n > 0; ino += 2) { - if (GET_SHORT(ino,0) > off || GET_SHORT(ino,1) > off || - GET_SHORT(ino,1) > GET_SHORT(ino,0)) - return 0; - off = GET_SHORT(ino,1); - n -= 2; - } - } - return 1; -} - -/* hash.c */ -/* - * sdbm - ndbm work-alike hashed database library - * based on Per-Aake Larson's Dynamic Hashing algorithms. BIT 18 (1978). - * author: oz@nexus.yorku.ca - * status: public domain. keep it that way. - * - * hashing routine - */ - -/* - * polynomial conversion ignoring overflows - * [this seems to work remarkably well, in fact better - * then the ndbm hash function. Replace at your own risk] - * use: 65599 nice. - * 65587 even better. - */ -long -sdbm_hash(str, len) -register char *str; -register int len; -{ - register unsigned long n = 0; - -#ifdef DUFF - -#define HASHC n = *str++ + 65599 * n - - if (len > 0) { - register int loop = (len + 8 - 1) >> 3; - - switch(len & (8 - 1)) { - case 0: do { - HASHC; case 7: HASHC; - case 6: HASHC; case 5: HASHC; - case 4: HASHC; case 3: HASHC; - case 2: HASHC; case 1: HASHC; - } while (--loop); - } - - } -#else - while (len--) - n = ((*str++) & 255) + 65587L * n; -#endif - return n; -} diff --git a/ext/sdbm/depend b/ext/sdbm/depend deleted file mode 100644 index 1d8b13d13f..0000000000 --- a/ext/sdbm/depend +++ /dev/null @@ -1,2 +0,0 @@ -_sdbm.o: _sdbm.c $(hdrdir)/ruby.h $(topdir)/config.h $(hdrdir)/defines.h -init.o: init.c $(hdrdir)/ruby.h $(topdir)/config.h $(hdrdir)/defines.h diff --git a/ext/sdbm/extconf.rb b/ext/sdbm/extconf.rb deleted file mode 100644 index cc6c8cefd1..0000000000 --- a/ext/sdbm/extconf.rb +++ /dev/null @@ -1,3 +0,0 @@ -require 'mkmf' - -create_makefile("sdbm") diff --git a/ext/sdbm/init.c b/ext/sdbm/init.c deleted file mode 100644 index 5412dd8452..0000000000 --- a/ext/sdbm/init.c +++ /dev/null @@ -1,761 +0,0 @@ -/************************************************ - - sdbminit.c - - - $Author$ - $Date$ - created at: Fri May 7 08:34:24 JST 1999 - - Copyright (C) 1995-2001 Yukihiro Matsumoto - -************************************************/ - -#include "ruby.h" - -#include "sdbm.h" -#include <fcntl.h> -#include <errno.h> - -static VALUE rb_cDBM, rb_eDBMError; - -struct dbmdata { - int di_size; - DBM *di_dbm; -}; - -static void -closed_sdbm() -{ - rb_raise(rb_eDBMError, "closed SDBM file"); -} - -#define GetDBM(obj, dbmp) {\ - Data_Get_Struct(obj, struct dbmdata, dbmp);\ - if (dbmp->di_dbm == 0) closed_sdbm();\ -} - -static void -free_sdbm(dbmp) - struct dbmdata *dbmp; -{ - - if (dbmp->di_dbm) sdbm_close(dbmp->di_dbm); - free(dbmp); -} - -static VALUE -fsdbm_close(obj) - VALUE obj; -{ - struct dbmdata *dbmp; - - GetDBM(obj, dbmp); - sdbm_close(dbmp->di_dbm); - dbmp->di_dbm = 0; - - return Qnil; -} - -static VALUE -fsdbm_s_new(argc, argv, klass) - int argc; - VALUE *argv; - VALUE klass; -{ - VALUE obj = Data_Wrap_Struct(klass, 0, free_sdbm, 0); - rb_obj_call_init(obj, argc, argv); - return obj; -} - -static VALUE -fsdbm_initialize(argc, argv, obj) - int argc; - VALUE *argv; - VALUE obj; -{ - VALUE file, vmode; - DBM *dbm; - struct dbmdata *dbmp; - int mode; - - if (rb_scan_args(argc, argv, "11", &file, &vmode) == 1) { - mode = 0666; /* default value */ - } - else if (NIL_P(vmode)) { - mode = -1; /* return nil if DB not exist */ - } - else { - mode = NUM2INT(vmode); - } - SafeStringValue(file); - - dbm = 0; - if (mode >= 0) - dbm = sdbm_open(RSTRING(file)->ptr, O_RDWR|O_CREAT, mode); - if (!dbm) - dbm = sdbm_open(RSTRING(file)->ptr, O_RDWR, 0); - if (!dbm) - dbm = sdbm_open(RSTRING(file)->ptr, O_RDONLY, 0); - - if (!dbm) { - if (mode == -1) return Qnil; - rb_sys_fail(RSTRING(file)->ptr); - } - - dbmp = ALLOC(struct dbmdata); - DATA_PTR(obj) = dbmp; - dbmp->di_dbm = dbm; - dbmp->di_size = -1; - - return obj; -} - -static VALUE -fsdbm_s_open(argc, argv, klass) - int argc; - VALUE *argv; - VALUE klass; -{ - VALUE obj = Data_Wrap_Struct(klass, 0, free_sdbm, 0); - - if (NIL_P(fsdbm_initialize(argc, argv, obj))) { - return Qnil; - } - - if (rb_block_given_p()) { - return rb_ensure(rb_yield, obj, fsdbm_close, obj); - } - - return obj; -} - -static VALUE -fsdbm_fetch(obj, keystr, ifnone) - VALUE obj, keystr, ifnone; -{ - datum key, value; - struct dbmdata *dbmp; - DBM *dbm; - - StringValue(keystr); - key.dptr = RSTRING(keystr)->ptr; - key.dsize = RSTRING(keystr)->len; - - GetDBM(obj, dbmp); - dbm = dbmp->di_dbm; - value = sdbm_fetch(dbm, key); - if (value.dptr == 0) { - if (ifnone == Qnil && rb_block_given_p()) - return rb_yield(rb_tainted_str_new(key.dptr, key.dsize)); - return ifnone; - } - return rb_tainted_str_new(value.dptr, value.dsize); -} - -static VALUE -fsdbm_aref(obj, keystr) - VALUE obj, keystr; -{ - return fsdbm_fetch(obj, keystr, Qnil); -} - -static VALUE -fsdbm_fetch_m(argc, argv, obj) - int argc; - VALUE *argv; - VALUE obj; -{ - VALUE keystr, valstr, ifnone; - - rb_scan_args(argc, argv, "11", &keystr, &ifnone); - valstr = fsdbm_fetch(obj, keystr, ifnone); - if (argc == 1 && !rb_block_given_p() && NIL_P(valstr)) - rb_raise(rb_eIndexError, "key not found"); - - return valstr; -} - -static VALUE -fsdbm_index(obj, valstr) - VALUE obj, valstr; -{ - datum key, val; - struct dbmdata *dbmp; - DBM *dbm; - - StringValue(valstr); - val.dptr = RSTRING(valstr)->ptr; - val.dsize = RSTRING(valstr)->len; - - GetDBM(obj, dbmp); - dbm = dbmp->di_dbm; - for (key = sdbm_firstkey(dbm); key.dptr; key = sdbm_nextkey(dbm)) { - val = sdbm_fetch(dbm, key); - if (val.dsize == RSTRING(valstr)->len && - memcmp(val.dptr, RSTRING(valstr)->ptr, val.dsize) == 0) - return rb_tainted_str_new(key.dptr, key.dsize); - } - return Qnil; -} - -static VALUE -fsdbm_indexes(argc, argv, obj) - int argc; - VALUE *argv; - VALUE obj; -{ - VALUE new; - int i; - - new = rb_ary_new2(argc); - for (i=0; i<argc; i++) { - rb_ary_push(new, fsdbm_fetch(obj, argv[i])); - } - - return new; -} - -static VALUE -fsdbm_select(argc, argv, obj) - int argc; - VALUE *argv; - VALUE obj; -{ - VALUE new = rb_ary_new2(argc); - int i; - - if (rb_block_given_p()) { - datum key, val; - DBM *dbm; - struct dbmdata *dbmp; - VALUE keystr, valstr; - - if (argc > 0) { - rb_raise(rb_eArgError, "wrong number arguments(%d for 0)", argc); - } - GetDBM(obj, dbmp); - dbm = dbmp->di_dbm; - - for (key = sdbm_firstkey(dbm); key.dptr; key = sdbm_nextkey(dbm)) { - VALUE assoc; - val = sdbm_fetch(dbm, key); - assoc = rb_assoc_new(rb_tainted_str_new(key.dptr, key.dsize), - rb_tainted_str_new(val.dptr, val.dsize)); - if (RTEST(rb_yield(assoc))) - rb_ary_push(new, assoc); - } - } - else { - for (i=0; i<argc; i++) { - rb_ary_push(new, fsdbm_fetch(obj, argv[i])); - } - } - - return new; -} - -static VALUE -fsdbm_delete(obj, keystr) - VALUE obj, keystr; -{ - datum key, value; - struct dbmdata *dbmp; - DBM *dbm; - VALUE valstr; - - rb_secure(4); - StringValue(keystr); - key.dptr = RSTRING(keystr)->ptr; - key.dsize = RSTRING(keystr)->len; - - GetDBM(obj, dbmp); - dbm = dbmp->di_dbm; - dbmp->di_size = -1; - - value = sdbm_fetch(dbm, key); - if (value.dptr == 0) { - if (rb_block_given_p()) return rb_yield(keystr); - return Qnil; - } - - /* need to save value before sdbm_delete() */ - valstr = rb_tainted_str_new(value.dptr, value.dsize); - - if (sdbm_delete(dbm, key)) { - dbmp->di_size = -1; - rb_raise(rb_eDBMError, "dbm_delete failed"); - } - else if (dbmp->di_size >= 0) { - dbmp->di_size--; - } - return valstr; -} - -static VALUE -fsdbm_shift(obj) - VALUE obj; -{ - datum key, val; - struct dbmdata *dbmp; - DBM *dbm; - VALUE keystr, valstr; - - rb_secure(4); - GetDBM(obj, dbmp); - dbm = dbmp->di_dbm; - - key = sdbm_firstkey(dbm); - if (!key.dptr) return Qnil; - val = sdbm_fetch(dbm, key); - keystr = rb_tainted_str_new(key.dptr, key.dsize); - valstr = rb_tainted_str_new(val.dptr, val.dsize); - sdbm_delete(dbm, key); - if (dbmp->di_size >= 0) { - dbmp->di_size--; - } - - return rb_assoc_new(keystr, valstr); -} - -static VALUE -fsdbm_delete_if(obj) - VALUE obj; -{ - datum key, val; - struct dbmdata *dbmp; - DBM *dbm; - VALUE keystr, valstr; - VALUE ret, ary = rb_ary_new(); - int i, status = 0, n; - - rb_secure(4); - GetDBM(obj, dbmp); - dbm = dbmp->di_dbm; - n = dbmp->di_size; - dbmp->di_size = -1; - for (key = sdbm_firstkey(dbm); key.dptr; key = sdbm_nextkey(dbm)) { - val = sdbm_fetch(dbm, key); - keystr = rb_tainted_str_new(key.dptr, key.dsize); - valstr = rb_tainted_str_new(val.dptr, val.dsize); - ret = rb_protect(rb_yield, rb_assoc_new(rb_str_dup(keystr), valstr), &status); - if (status != 0) break; - if (RTEST(ret)) rb_ary_push(ary, keystr); - } - - for (i = 0; i < RARRAY(ary)->len; i++) { - keystr = RARRAY(ary)->ptr[i]; - key.dptr = RSTRING(keystr)->ptr; - key.dsize = RSTRING(keystr)->len; - if (sdbm_delete(dbm, key)) { - rb_raise(rb_eDBMError, "sdbm_delete failed"); - } - } - if (status) rb_jump_tag(status); - if (n > 0) dbmp->di_size = n - RARRAY(ary)->len; - - return obj; -} - -static VALUE -fsdbm_clear(obj) - VALUE obj; -{ - datum key; - struct dbmdata *dbmp; - DBM *dbm; - - rb_secure(4); - GetDBM(obj, dbmp); - dbm = dbmp->di_dbm; - dbmp->di_size = -1; - while (key = sdbm_firstkey(dbm), key.dptr) { - if (sdbm_delete(dbm, key)) { - rb_raise(rb_eDBMError, "sdbm_delete failed"); - } - } - dbmp->di_size = 0; - - return obj; -} - -static VALUE -fsdbm_invert(obj) - VALUE obj; -{ - datum key, val; - struct dbmdata *dbmp; - DBM *dbm; - VALUE keystr, valstr; - VALUE hash = rb_hash_new(); - - GetDBM(obj, dbmp); - dbm = dbmp->di_dbm; - for (key = sdbm_firstkey(dbm); key.dptr; key = sdbm_nextkey(dbm)) { - val = sdbm_fetch(dbm, key); - keystr = rb_tainted_str_new(key.dptr, key.dsize); - valstr = rb_tainted_str_new(val.dptr, val.dsize); - rb_hash_aset(hash, valstr, keystr); - } - return hash; -} - -static VALUE -each_pair(obj) - VALUE obj; -{ - return rb_funcall(obj, rb_intern("each_pair"), 0, 0); -} - -static VALUE fsdbm_store _((VALUE,VALUE,VALUE)); - -static VALUE -update_i(pair, dbm) - VALUE pair, dbm; -{ - Check_Type(pair, T_ARRAY); - if (RARRAY(pair)->len < 2) { - rb_raise(rb_eArgError, "pair must be [key, value]"); - } - fsdbm_store(dbm, RARRAY(pair)->ptr[0], RARRAY(pair)->ptr[1]); - return Qnil; -} - -static VALUE -fsdbm_update(obj, other) - VALUE obj, other; -{ - rb_iterate(each_pair, other, update_i, obj); - return obj; -} - -static VALUE -fsdbm_replace(obj, other) - VALUE obj, other; -{ - fsdbm_clear(obj); - rb_iterate(each_pair, other, update_i, obj); - return obj; -} - -static VALUE -fsdbm_store(obj, keystr, valstr) - VALUE obj, keystr, valstr; -{ - datum key, val; - struct dbmdata *dbmp; - DBM *dbm; - - if (valstr == Qnil) { - fsdbm_delete(obj, keystr); - return Qnil; - } - - rb_secure(4); - keystr = rb_obj_as_string(keystr); - - key.dptr = RSTRING(keystr)->ptr; - key.dsize = RSTRING(keystr)->len; - - if (NIL_P(valstr)) return fsdbm_delete(obj, keystr); - - valstr = rb_obj_as_string(valstr); - val.dptr = RSTRING(valstr)->ptr; - val.dsize = RSTRING(valstr)->len; - - GetDBM(obj, dbmp); - dbmp->di_size = -1; - dbm = dbmp->di_dbm; - if (sdbm_store(dbm, key, val, DBM_REPLACE)) { -#ifdef HAVE_DBM_CLAERERR - sdbm_clearerr(dbm); -#endif - if (errno == EPERM) rb_sys_fail(0); - rb_raise(rb_eDBMError, "sdbm_store failed"); - } - - return valstr; -} - -static VALUE -fsdbm_length(obj) - VALUE obj; -{ - datum key; - struct dbmdata *dbmp; - DBM *dbm; - int i = 0; - - GetDBM(obj, dbmp); - if (dbmp->di_size > 0) return INT2FIX(dbmp->di_size); - dbm = dbmp->di_dbm; - - for (key = sdbm_firstkey(dbm); key.dptr; key = sdbm_nextkey(dbm)) { - i++; - } - dbmp->di_size = i; - - return INT2FIX(i); -} - -static VALUE -fsdbm_empty_p(obj) - VALUE obj; -{ - datum key; - struct dbmdata *dbmp; - DBM *dbm; - int i = 0; - - GetDBM(obj, dbmp); - if (dbmp->di_size < 0) { - dbm = dbmp->di_dbm; - - for (key = sdbm_firstkey(dbm); key.dptr; key = sdbm_nextkey(dbm)) { - i++; - } - } - else { - i = dbmp->di_size; - } - if (i == 0) return Qtrue; - return Qfalse; -} - -static VALUE -fsdbm_each_value(obj) - VALUE obj; -{ - datum key, val; - struct dbmdata *dbmp; - DBM *dbm; - - GetDBM(obj, dbmp); - dbm = dbmp->di_dbm; - for (key = sdbm_firstkey(dbm); key.dptr; key = sdbm_nextkey(dbm)) { - val = sdbm_fetch(dbm, key); - rb_yield(rb_tainted_str_new(val.dptr, val.dsize)); - } - return obj; -} - -static VALUE -fsdbm_each_key(obj) - VALUE obj; -{ - datum key; - struct dbmdata *dbmp; - DBM *dbm; - - GetDBM(obj, dbmp); - dbm = dbmp->di_dbm; - for (key = sdbm_firstkey(dbm); key.dptr; key = sdbm_nextkey(dbm)) { - rb_yield(rb_tainted_str_new(key.dptr, key.dsize)); - } - return obj; -} - -static VALUE -fsdbm_each_pair(obj) - VALUE obj; -{ - datum key, val; - DBM *dbm; - struct dbmdata *dbmp; - VALUE keystr, valstr; - - GetDBM(obj, dbmp); - dbm = dbmp->di_dbm; - - for (key = sdbm_firstkey(dbm); key.dptr; key = sdbm_nextkey(dbm)) { - val = sdbm_fetch(dbm, key); - keystr = rb_tainted_str_new(key.dptr, key.dsize); - valstr = rb_tainted_str_new(val.dptr, val.dsize); - rb_yield(rb_assoc_new(keystr, valstr)); - } - - return obj; -} - -static VALUE -fsdbm_keys(obj) - VALUE obj; -{ - datum key; - struct dbmdata *dbmp; - DBM *dbm; - VALUE ary; - - GetDBM(obj, dbmp); - dbm = dbmp->di_dbm; - - ary = rb_ary_new(); - for (key = sdbm_firstkey(dbm); key.dptr; key = sdbm_nextkey(dbm)) { - rb_ary_push(ary, rb_tainted_str_new(key.dptr, key.dsize)); - } - - return ary; -} - -static VALUE -fsdbm_values(obj) - VALUE obj; -{ - datum key, val; - struct dbmdata *dbmp; - DBM *dbm; - VALUE ary; - - GetDBM(obj, dbmp); - dbm = dbmp->di_dbm; - - ary = rb_ary_new(); - for (key = sdbm_firstkey(dbm); key.dptr; key = sdbm_nextkey(dbm)) { - val = sdbm_fetch(dbm, key); - rb_ary_push(ary, rb_tainted_str_new(val.dptr, val.dsize)); - } - - return ary; -} - -static VALUE -fsdbm_has_key(obj, keystr) - VALUE obj, keystr; -{ - datum key, val; - struct dbmdata *dbmp; - DBM *dbm; - - StringValue(keystr); - key.dptr = RSTRING(keystr)->ptr; - key.dsize = RSTRING(keystr)->len; - - GetDBM(obj, dbmp); - dbm = dbmp->di_dbm; - val = sdbm_fetch(dbm, key); - if (val.dptr) return Qtrue; - return Qfalse; -} - -static VALUE -fsdbm_has_value(obj, valstr) - VALUE obj, valstr; -{ - datum key, val; - struct dbmdata *dbmp; - DBM *dbm; - - StringValue(valstr); - val.dptr = RSTRING(valstr)->ptr; - val.dsize = RSTRING(valstr)->len; - - GetDBM(obj, dbmp); - dbm = dbmp->di_dbm; - for (key = sdbm_firstkey(dbm); key.dptr; key = sdbm_nextkey(dbm)) { - val = sdbm_fetch(dbm, key); - if (val.dsize == RSTRING(valstr)->len && - memcmp(val.dptr, RSTRING(valstr)->ptr, val.dsize) == 0) - return Qtrue; - } - return Qfalse; -} - -static VALUE -fsdbm_to_a(obj) - VALUE obj; -{ - datum key, val; - struct dbmdata *dbmp; - DBM *dbm; - VALUE ary; - - GetDBM(obj, dbmp); - dbm = dbmp->di_dbm; - - ary = rb_ary_new(); - for (key = sdbm_firstkey(dbm); key.dptr; key = sdbm_nextkey(dbm)) { - val = sdbm_fetch(dbm, key); - rb_ary_push(ary, rb_assoc_new(rb_tainted_str_new(key.dptr, key.dsize), - rb_tainted_str_new(val.dptr, val.dsize))); - } - - return ary; -} - -static VALUE -fsdbm_to_hash(obj) - VALUE obj; -{ - datum key, val; - struct dbmdata *dbmp; - DBM *dbm; - VALUE hash; - - GetDBM(obj, dbmp); - dbm = dbmp->di_dbm; - - hash = rb_hash_new(); - for (key = sdbm_firstkey(dbm); key.dptr; key = sdbm_nextkey(dbm)) { - val = sdbm_fetch(dbm, key); - rb_hash_aset(hash, rb_tainted_str_new(key.dptr, key.dsize), - rb_tainted_str_new(val.dptr, val.dsize)); - } - - return hash; -} - -static VALUE -fsdbm_reject(obj) - VALUE obj; -{ - return rb_hash_delete_if(fsdbm_to_hash(obj)); -} - -void -Init_sdbm() -{ - rb_cDBM = rb_define_class("SDBM", rb_cObject); - rb_eDBMError = rb_define_class("SDBMError", rb_eStandardError); - rb_include_module(rb_cDBM, rb_mEnumerable); - - rb_define_singleton_method(rb_cDBM, "new", fsdbm_s_new, -1); - rb_define_singleton_method(rb_cDBM, "open", fsdbm_s_open, -1); - - rb_define_method(rb_cDBM, "initialize", fsdbm_initialize, -1); - rb_define_method(rb_cDBM, "close", fsdbm_close, 0); - rb_define_method(rb_cDBM, "[]", fsdbm_aref, 1); - rb_define_method(rb_cDBM, "fetch", fsdbm_fetch_m, -1); - rb_define_method(rb_cDBM, "[]=", fsdbm_store, 2); - rb_define_method(rb_cDBM, "store", fsdbm_store, 2); - rb_define_method(rb_cDBM, "index", fsdbm_index, 1); - rb_define_method(rb_cDBM, "indexes", fsdbm_indexes, -1); - rb_define_method(rb_cDBM, "indices", fsdbm_indexes, -1); - rb_define_method(rb_cDBM, "select", fsdbm_select, -1); - rb_define_method(rb_cDBM, "length", fsdbm_length, 0); - rb_define_method(rb_cDBM, "size", fsdbm_length, 0); - rb_define_method(rb_cDBM, "empty?", fsdbm_empty_p, 0); - rb_define_method(rb_cDBM, "each", fsdbm_each_pair, 0); - rb_define_method(rb_cDBM, "each_value", fsdbm_each_value, 0); - rb_define_method(rb_cDBM, "each_key", fsdbm_each_key, 0); - rb_define_method(rb_cDBM, "each_pair", fsdbm_each_pair, 0); - rb_define_method(rb_cDBM, "keys", fsdbm_keys, 0); - rb_define_method(rb_cDBM, "values", fsdbm_values, 0); - rb_define_method(rb_cDBM, "shift", fsdbm_shift, 0); - rb_define_method(rb_cDBM, "delete", fsdbm_delete, 1); - rb_define_method(rb_cDBM, "delete_if", fsdbm_delete_if, 0); - rb_define_method(rb_cDBM, "reject!", fsdbm_delete_if, 0); - rb_define_method(rb_cDBM, "reject", fsdbm_reject, 0); - rb_define_method(rb_cDBM, "clear", fsdbm_clear, 0); - rb_define_method(rb_cDBM,"invert", fsdbm_invert, 0); - rb_define_method(rb_cDBM,"update", fsdbm_update, 1); - rb_define_method(rb_cDBM,"replace", fsdbm_replace, 1); - - rb_define_method(rb_cDBM, "include?", fsdbm_has_key, 1); - rb_define_method(rb_cDBM, "has_key?", fsdbm_has_key, 1); - rb_define_method(rb_cDBM, "member?", fsdbm_has_key, 1); - rb_define_method(rb_cDBM, "has_value?", fsdbm_has_value, 1); - rb_define_method(rb_cDBM, "key?", fsdbm_has_key, 1); - rb_define_method(rb_cDBM, "value?", fsdbm_has_value, 1); - - rb_define_method(rb_cDBM, "to_a", fsdbm_to_a, 0); - rb_define_method(rb_cDBM, "to_hash", fsdbm_to_hash, 0); -} diff --git a/ext/sdbm/sdbm.h b/ext/sdbm/sdbm.h deleted file mode 100644 index ce8f54c4d4..0000000000 --- a/ext/sdbm/sdbm.h +++ /dev/null @@ -1,84 +0,0 @@ -/* - * sdbm - ndbm work-alike hashed database library - * based on Per-Ake Larson's Dynamic Hashing algorithms. BIT 18 (1978). - * author: oz@nexus.yorku.ca - * status: public domain. - */ -#ifndef _SDBM_H_ -#define _SDBM_H_ - -#define DBLKSIZ 4096 -#define PBLKSIZ 1024 -#define PAIRMAX 1008 /* arbitrary on PBLKSIZ-N */ -#define SPLTMAX 10 /* maximum allowed splits */ - /* for a single insertion */ -#define DIRFEXT ".dir" -#define PAGFEXT ".pag" - -typedef struct { - int dirf; /* directory file descriptor */ - int pagf; /* page file descriptor */ - int flags; /* status/error flags, see below */ - long maxbno; /* size of dirfile in bits */ - long curbit; /* current bit number */ - long hmask; /* current hash mask */ - long blkptr; /* current block for nextkey */ - int keyptr; /* current key for nextkey */ - long blkno; /* current page to read/write */ - long pagbno; /* current page in pagbuf */ - char pagbuf[PBLKSIZ]; /* page file block buffer */ - long dirbno; /* current block in dirbuf */ - char dirbuf[DBLKSIZ]; /* directory file block buffer */ -} DBM; - -#define DBM_RDONLY 0x1 /* data base open read-only */ -#define DBM_IOERR 0x2 /* data base I/O error */ - -/* - * utility macros - */ -#define sdbm_rdonly(db) ((db)->flags & DBM_RDONLY) -#define sdbm_error(db) ((db)->flags & DBM_IOERR) - -#define sdbm_clearerr(db) ((db)->flags &= ~DBM_IOERR) /* ouch */ - -#define sdbm_dirfno(db) ((db)->dirf) -#define sdbm_pagfno(db) ((db)->pagf) - -typedef struct { - char *dptr; - int dsize; -} datum; - -extern datum nullitem; - -#if defined(__STDC__) || defined(MSDOS) -#define proto(p) p -#else -#define proto(p) () -#endif - -/* - * flags to sdbm_store - */ -#define DBM_INSERT 0 -#define DBM_REPLACE 1 - -/* - * ndbm interface - */ -extern DBM *sdbm_open proto((char *, int, int)); -extern void sdbm_close proto((DBM *)); -extern datum sdbm_fetch proto((DBM *, datum)); -extern int sdbm_delete proto((DBM *, datum)); -extern int sdbm_store proto((DBM *, datum, datum, int)); -extern datum sdbm_firstkey proto((DBM *)); -extern datum sdbm_nextkey proto((DBM *)); - -/* - * other - */ -extern DBM *sdbm_prep proto((char *, char *, int, int)); -extern long sdbm_hash proto((char *, int)); - -#endif /* _SDBM_H_ */ diff --git a/ext/sdbm/testsdbm.rb b/ext/sdbm/testsdbm.rb deleted file mode 100644 index 550b47a008..0000000000 --- a/ext/sdbm/testsdbm.rb +++ /dev/null @@ -1,556 +0,0 @@ -require 'runit/testcase' -require 'runit/cui/testrunner' - -if $".grep(/\bsdbm.so\b/).empty? - begin - require './sdbm' - rescue LoadError - require 'sdbm' - end -end - -def uname_s - require 'rbconfig' - case Config::CONFIG['host_os'] - when 'cygwin' - require 'Win32API' - uname = Win32API.new 'cygwin1', 'uname', 'P', 'I' - utsname = ' ' * 100 - raise 'cannot get system name' if uname.call(utsname) == -1 - - utsname.unpack('A20' * 5)[0] - else - Config::CONFIG['host_os'] - end -end - -SYSTEM = uname_s - -class TestSDBM < RUNIT::TestCase - def setup - @path = "tmptest_sdbm_" - assert_instance_of(SDBM, @sdbm = SDBM.new(@path)) - end - def teardown - assert_nil(@sdbm.close) - GC.start - File.delete *Dir.glob("tmptest_sdbm*").to_a - p Dir.glob("tmptest_sdbm*") if $DEBUG - end - - def check_size(expect, sdbm=@sdbm) - assert_equals(expect, sdbm.size) - n = 0 - sdbm.each { n+=1 } - assert_equals(expect, n) - if expect == 0 - assert_equals(true, sdbm.empty?) - else - assert_equals(false, sdbm.empty?) - end - end - - def test_version - STDERR.print SDBM::VERSION - end - - def test_s_new_has_no_block - # SDBM.new ignore the block - foo = true - assert_instance_of(SDBM, sdbm = SDBM.new("tmptest_sdbm") { foo = false }) - assert_equals(foo, true) - assert_nil(sdbm.close) - end - def test_s_open_no_create - assert_nil(sdbm = SDBM.open("tmptest_sdbm", nil)) - ensure - sdbm.close if sdbm - end - def test_s_open_with_block - assert_equals(SDBM.open("tmptest_sdbm") { :foo }, :foo) - end -=begin - # Is it guaranteed on many OS? - def test_s_open_lock_one_process - # locking on one process - assert_instance_of(SDBM, sdbm = SDBM.open("tmptest_sdbm", 0644)) - assert_exception(Errno::EWOULDBLOCK) { - begin - SDBM.open("tmptest_sdbm", 0644) - rescue Errno::EAGAIN - raise Errno::EWOULDBLOCK - end - } - end -=end - - def test_s_open_nolock - # sdbm 1.8.0 specific - if not defined? SDBM::NOLOCK - return - end - - fork() { - assert_instance_of(SDBM, sdbm = SDBM.open("tmptest_sdbm", 0644, - SDBM::NOLOCK)) - sleep 2 - } - sleep 1 - begin - sdbm2 = nil - assert_no_exception(Errno::EWOULDBLOCK, Errno::EAGAIN, Errno::EACCES) { - assert_instance_of(SDBM, sdbm2 = SDBM.open("tmptest_sdbm", 0644)) - } - ensure - Process.wait - sdbm2.close if sdbm2 - end - - p Dir.glob("tmptest_sdbm*") if $DEBUG - - fork() { - assert_instance_of(SDBM, sdbm = SDBM.open("tmptest_sdbm", 0644)) - sleep 2 - } - begin - sleep 1 - sdbm2 = nil - assert_no_exception(Errno::EWOULDBLOCK, Errno::EAGAIN, Errno::EACCES) { - # this test is failed on Cygwin98 (???) - assert_instance_of(SDBM, sdbm2 = SDBM.open("tmptest_sdbm", 0644, - SDBM::NOLOCK)) - } - ensure - Process.wait - sdbm2.close if sdbm2 - end - end - - def test_s_open_error - assert_instance_of(SDBM, sdbm = SDBM.open("tmptest_sdbm", 0)) - assert_exception(Errno::EACCES) { - SDBM.open("tmptest_sdbm", 0) - } - sdbm.close - end - - def test_close - assert_instance_of(SDBM, sdbm = SDBM.open("tmptest_sdbm")) - assert_nil(sdbm.close) - - # closed SDBM file - assert_exception(SDBMError) { sdbm.close } - end - - def test_aref - assert_equals('bar', @sdbm['foo'] = 'bar') - assert_equals('bar', @sdbm['foo']) - - assert_nil(@sdbm['bar']) - end - - def test_fetch - assert_equals('bar', @sdbm['foo']='bar') - assert_equals('bar', @sdbm.fetch('foo')) - - # key not found - assert_exception(IndexError) { - @sdbm.fetch('bar') - } - - # test for `ifnone' arg - assert_equals('baz', @sdbm.fetch('bar', 'baz')) - - # test for `ifnone' block - assert_equals('foobar', @sdbm.fetch('bar') {|key| 'foo' + key }) - end - - def test_aset - num = 0 - 2.times {|i| - assert_equals('foo', @sdbm['foo'] = 'foo') - assert_equals('foo', @sdbm['foo']) - assert_equals('bar', @sdbm['foo'] = 'bar') - assert_equals('bar', @sdbm['foo']) - - num += 1 if i == 0 - assert_equals(num, @sdbm.size) - - # assign nil - assert_equals('', @sdbm['bar'] = '') - assert_equals('', @sdbm['bar']) - - num += 1 if i == 0 - assert_equals(num, @sdbm.size) - - # empty string - assert_equals('', @sdbm[''] = '') - assert_equals('', @sdbm['']) - - num += 1 if i == 0 - assert_equals(num, @sdbm.size) - - # Fixnum - assert_equals('200', @sdbm['100'] = '200') - assert_equals('200', @sdbm['100']) - - num += 1 if i == 0 - assert_equals(num, @sdbm.size) - - # Big key and value - assert_equals('y' * 100, @sdbm['x' * 100] = 'y' * 100) - assert_equals('y' * 100, @sdbm['x' * 100]) - - num += 1 if i == 0 - assert_equals(num, @sdbm.size) - } - end - - def test_index - assert_equals('bar', @sdbm['foo'] = 'bar') - assert_equals('foo', @sdbm.index('bar')) - assert_nil(@sdbm['bar']) - end - - def test_indexes - keys = %w(foo bar baz) - values = %w(FOO BAR BAZ) - @sdbm[keys[0]], @sdbm[keys[1]], @sdbm[keys[2]] = values - assert_equals(values.reverse, @sdbm.indexes(*keys.reverse)) - end - - def test_select - keys = %w(foo bar baz) - values = %w(FOO BAR BAZ) - @sdbm[keys[0]], @sdbm[keys[1]], @sdbm[keys[2]] = values - assert_equals(values.reverse, @sdbm.select(*keys.reverse)) - end - - def test_select_with_block - keys = %w(foo bar baz) - values = %w(FOO BAR BAZ) - @sdbm[keys[0]], @sdbm[keys[1]], @sdbm[keys[2]] = values - ret = @sdbm.select {|k,v| - assert_equals(k.upcase, v) - k != "bar" - } - assert_equals([['baz', 'BAZ'], ['foo', 'FOO']], - ret.sort) - end - - def test_length - num = 10 - assert_equals(0, @sdbm.size) - num.times {|i| - i = i.to_s - @sdbm[i] = i - } - assert_equals(num, @sdbm.size) - - @sdbm.shift - - assert_equals(num - 1, @sdbm.size) - end - - def test_empty? - assert_equals(true, @sdbm.empty?) - @sdbm['foo'] = 'FOO' - assert_equals(false, @sdbm.empty?) - end - - def test_each_pair - n = 0 - @sdbm.each_pair { n += 1 } - assert_equals(0, n) - - keys = %w(foo bar baz) - values = %w(FOO BAR BAZ) - - @sdbm[keys[0]], @sdbm[keys[1]], @sdbm[keys[2]] = values - - n = 0 - ret = @sdbm.each_pair {|key, val| - assert_not_nil(i = keys.index(key)) - assert_equals(val, values[i]) - - n += 1 - } - assert_equals(keys.size, n) - assert_equals(@sdbm, ret) - end - - def test_each_value - n = 0 - @sdbm.each_value { n += 1 } - assert_equals(0, n) - - keys = %w(foo bar baz) - values = %w(FOO BAR BAZ) - - @sdbm[keys[0]], @sdbm[keys[1]], @sdbm[keys[2]] = values - - n = 0 - ret = @sdbm.each_value {|val| - assert_not_nil(key = @sdbm.index(val)) - assert_not_nil(i = keys.index(key)) - assert_equals(val, values[i]) - - n += 1 - } - assert_equals(keys.size, n) - assert_equals(@sdbm, ret) - end - - def test_each_key - n = 0 - @sdbm.each_key { n += 1 } - assert_equals(0, n) - - keys = %w(foo bar baz) - values = %w(FOO BAR BAZ) - - @sdbm[keys[0]], @sdbm[keys[1]], @sdbm[keys[2]] = values - - n = 0 - ret = @sdbm.each_key {|key| - assert_not_nil(i = keys.index(key)) - assert_equals(@sdbm[key], values[i]) - - n += 1 - } - assert_equals(keys.size, n) - assert_equals(@sdbm, ret) - end - - def test_keys - assert_equals([], @sdbm.keys) - - keys = %w(foo bar baz) - values = %w(FOO BAR BAZ) - - @sdbm[keys[0]], @sdbm[keys[1]], @sdbm[keys[2]] = values - - assert_equals(keys.sort, @sdbm.keys.sort) - assert_equals(values.sort, @sdbm.values.sort) - end - - def test_values - test_keys - end - - def test_shift - assert_nil(@sdbm.shift) - assert_equals(0, @sdbm.size) - - keys = %w(foo bar baz) - values = %w(FOO BAR BAZ) - - @sdbm[keys[0]], @sdbm[keys[1]], @sdbm[keys[2]] = values - - ret_keys = [] - ret_values = [] - while ret = @sdbm.shift - ret_keys.push ret[0] - ret_values.push ret[1] - - assert_equals(keys.size - ret_keys.size, @sdbm.size) - end - - assert_equals(keys.sort, ret_keys.sort) - assert_equals(values.sort, ret_values.sort) - end - - def test_delete - keys = %w(foo bar baz) - values = %w(FOO BAR BAZ) - key = keys[1] - - assert_nil(@sdbm.delete(key)) - assert_equals(0, @sdbm.size) - - @sdbm[keys[0]], @sdbm[keys[1]], @sdbm[keys[2]] = values - - assert_equals('BAR', @sdbm.delete(key)) - assert_nil(@sdbm[key]) - assert_equals(2, @sdbm.size) - - assert_nil(@sdbm.delete(key)) - end - def test_delete_with_block - key = 'no called block' - @sdbm[key] = 'foo' - assert_equals('foo', @sdbm.delete(key) {|k| k.replace 'called block'}) - assert_equals('no called block', key) - assert_equals(0, @sdbm.size) - - key = 'no called block' - assert_equals(:blockval, - @sdbm.delete(key) {|k| k.replace 'called block'; :blockval}) - assert_equals('called block', key) - assert_equals(0, @sdbm.size) - end - - def test_delete_if - v = "0" - 100.times {@sdbm[v] = v; v = v.next} - - ret = @sdbm.delete_if {|key, val| key.to_i < 50} - assert_equals(@sdbm, ret) - check_size(50, @sdbm) - - ret = @sdbm.delete_if {|key, val| key.to_i >= 50} - assert_equals(@sdbm, ret) - check_size(0, @sdbm) - - # break - v = "0" - 100.times {@sdbm[v] = v; v = v.next} - check_size(100, @sdbm) - n = 0; - @sdbm.delete_if {|key, val| - break if n > 50 - n+=1 - true - } - assert_equals(51, n) - check_size(49, @sdbm) - - @sdbm.clear - - # raise - v = "0" - 100.times {@sdbm[v] = v; v = v.next} - check_size(100, @sdbm) - n = 0; - begin - @sdbm.delete_if {|key, val| - raise "runtime error" if n > 50 - n+=1 - true - } - rescue - end - assert_equals(51, n) - check_size(49, @sdbm) - end - - def test_reject - v = "0" - 100.times {@sdbm[v] = v; v = v.next} - - hash = @sdbm.reject {|key, val| key.to_i < 50} - assert_instance_of(Hash, hash) - assert_equals(100, @sdbm.size) - - assert_equals(50, hash.size) - hash.each_pair {|key,val| - assert_equals(false, key.to_i < 50) - assert_equals(key, val) - } - - hash = @sdbm.reject {|key, val| key.to_i < 100} - assert_instance_of(Hash, hash) - assert_equals(true, hash.empty?) - end - - def test_clear - v = "1" - 100.times {v = v.next; @sdbm[v] = v} - - assert_equals(@sdbm, @sdbm.clear) - - # validate SDBM#size - i = 0 - @sdbm.each { i += 1 } - assert_equals(@sdbm.size, i) - assert_equals(0, i) - end - - def test_invert - v = "0" - 100.times {@sdbm[v] = v; v = v.next} - - hash = @sdbm.invert - assert_instance_of(Hash, hash) - assert_equals(100, hash.size) - hash.each_pair {|key, val| - assert_equals(key.to_i, val.to_i) - } - end - - def test_update - hash = {} - v = "0" - 100.times {v = v.next; hash[v] = v} - - @sdbm["101"] = "101" - @sdbm.update hash - assert_equals(101, @sdbm.size) - @sdbm.each_pair {|key, val| - assert_equals(key.to_i, val.to_i) - } - end - - def test_replace - hash = {} - v = "0" - 100.times {v = v.next; hash[v] = v} - - @sdbm["101"] = "101" - @sdbm.replace hash - assert_equals(100, @sdbm.size) - @sdbm.each_pair {|key, val| - assert_equals(key.to_i, val.to_i) - } - end - - def test_haskey? - assert_equals('bar', @sdbm['foo']='bar') - assert_equals(true, @sdbm.has_key?('foo')) - assert_equals(false, @sdbm.has_key?('bar')) - end - - def test_has_value? - assert_equals('bar', @sdbm['foo']='bar') - assert_equals(true, @sdbm.has_value?('bar')) - assert_equals(false, @sdbm.has_value?('foo')) - end - - def test_to_a - v = "0" - 100.times {v = v.next; @sdbm[v] = v} - - ary = @sdbm.to_a - assert_instance_of(Array, ary) - assert_equals(100, ary.size) - ary.each {|key,val| - assert_equals(key.to_i, val.to_i) - } - end - - def test_to_hash - v = "0" - 100.times {v = v.next; @sdbm[v] = v} - - hash = @sdbm.to_hash - assert_instance_of(Hash, hash) - assert_equals(100, hash.size) - hash.each {|key,val| - assert_equals(key.to_i, val.to_i) - } - end -end - -if $0 == __FILE__ - if ARGV.size == 0 - suite = RUNIT::TestSuite.new - suite.add_test(TestSDBM.suite) - else - suite = RUNIT::TestSuite.new - ARGV.each do |testmethod| - suite.add_test(TestSDBM.new(testmethod)) - end - end - - RUNIT::CUI::TestRunner.run(suite) -end |