Back to index

lightning-sunbird  0.9+nobinonly
Defines | Functions
hash.c File Reference
#include "watcomfx.h"
#include <sys/param.h>
#include <sys/stat.h>
#include <errno.h>
#include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <assert.h>
#include "mcom_db.h"
#include "hash.h"
#include "page.h"

Go to the source code of this file.

Defines

#define MOD(x, y)   ((x) & ((y) - 1))
#define RETURN_ERROR(ERR, LOC)   { save_errno = ERR; goto LOC; }
#define SUCCESS   (0)
#define DBM_ERROR   (-1)
#define ABNORMAL   (1)
#define OLDHASHVERSION   1
#define MAX_OVERFLOW_HASH_ACCESS_LOOPS   2000

Functions

static int alloc_segs __P ((HTAB *, int))
static int flush_meta __P ((HTAB *))
static int hash_access __P ((HTAB *, ACTION, DBT *, DBT *))
static int hash_close __P ((DB *))
static int hash_delete __P ((const DB *, const DBT *, uint))
static int hash_fd __P ((const DB *))
static int hash_get __P ((const DB *, const DBT *, DBT *, uint))
static void *hash_realloc __P ((SEGMENT **, size_t, size_t))
static int hash_seq __P ((const DB *, DBT *, DBT *, uint))
static int hash_sync __P ((const DB *, uint))
static HTAB *init_hash __P ((HTAB *, const char *, HASHINFO *))
static void swap_header_copy __P ((HASHHDR *, HASHHDR *))
static void __remove_database (DB *dbp)
DB__hash_open (const char *file, int flags, int mode, const HASHINFO *info, int dflags)
static int hash_close (DB *dbp)
static int hash_fd (const DB *dbp)
static HTABinit_hash (HTAB *hashp, const char *file, HASHINFO *info)
static int init_htab (HTAB *hashp, int nelem)
static int hdestroy (HTAB *hashp)
static int hash_sync (const DB *dbp, uint flags)
static int flush_meta (HTAB *hashp)
static int hash_get (const DB *dbp, const DBT *key, DBT *data, uint flag)
static int hash_put (const DB *dbp, DBT *key, const DBT *data, uint flag)
static int hash_delete (const DB *dbp, const DBT *key, uint flag)
static int hash_access (HTAB *hashp, ACTION action, DBT *key, DBT *val)
static int hash_seq (const DB *dbp, DBT *key, DBT *data, uint flag)
int __expand_table (HTAB *hashp)
static voidhash_realloc (SEGMENT **p_ptr, size_t oldsize, size_t newsize)
uint32 __call_hash (HTAB *hashp, char *k, size_t len)
static int alloc_segs (HTAB *hashp, int nsegs)
static void swap_header_copy (HASHHDR *srcp, HASHHDR *destp)
static void swap_header (HTAB *hashp)

Define Documentation

#define ABNORMAL   (1)

Definition at line 106 of file hash.c.

#define DBM_ERROR   (-1)

Definition at line 105 of file hash.c.

Definition at line 757 of file hash.c.

#define MOD (   x,
  y 
)    ((x) & ((y) - 1))

Definition at line 99 of file hash.c.

#define RETURN_ERROR (   ERR,
  LOC 
)    { save_errno = ERR; goto LOC; }

Definition at line 101 of file hash.c.

#define SUCCESS   (0)

Definition at line 104 of file hash.c.


Function Documentation

uint32 __call_hash ( HTAB hashp,
char *  k,
size_t  len 
)

Definition at line 1074 of file hash.c.

{
       uint32 n, bucket;

       n = hashp->hash(k, len);
       bucket = n & hashp->HIGH_MASK;
       if (bucket > (uint32)hashp->MAX_BUCKET)
              bucket = bucket & hashp->LOW_MASK;
       return (bucket);
}

Here is the caller graph for this function:

int __expand_table ( HTAB hashp)

Definition at line 1003 of file hash.c.

{
       uint32 old_bucket, new_bucket;
       int new_segnum, spare_ndx;
       size_t dirsize;

#ifdef HASH_STATISTICS
       hash_expansions++;
#endif
       new_bucket = ++hashp->MAX_BUCKET;
       old_bucket = (hashp->MAX_BUCKET & hashp->LOW_MASK);

       new_segnum = new_bucket >> hashp->SSHIFT;

       /* Check if we need a new segment */
       if (new_segnum >= hashp->nsegs) {
              /* Check if we need to expand directory */
              if (new_segnum >= hashp->DSIZE) {
                     /* Reallocate directory */
                     dirsize = hashp->DSIZE * sizeof(SEGMENT *);
                     if (!hash_realloc(&hashp->dir, dirsize, dirsize << 1))
                            return (-1);
                     hashp->DSIZE = dirsize << 1;
              }
              if ((hashp->dir[new_segnum] =
                  (SEGMENT)calloc((size_t)hashp->SGSIZE, sizeof(SEGMENT))) == NULL)
                     return (-1);
              hashp->exsegs++;
              hashp->nsegs++;
       }
       /*
        * If the split point is increasing (MAX_BUCKET's log base 2
        * * increases), we need to copy the current contents of the spare
        * split bucket to the next bucket.
        */
       spare_ndx = __log2((uint32)(hashp->MAX_BUCKET + 1));
       if (spare_ndx > hashp->OVFL_POINT) {
              hashp->SPARES[spare_ndx] = hashp->SPARES[hashp->OVFL_POINT];
              hashp->OVFL_POINT = spare_ndx;
       }

       if (new_bucket > (uint32)hashp->HIGH_MASK) {
              /* Starting a new doubling */
              hashp->LOW_MASK = hashp->HIGH_MASK;
              hashp->HIGH_MASK = new_bucket | hashp->LOW_MASK;
       }
       /* Relocate records to the new bucket */
       return (__split_page(hashp, old_bucket, new_bucket));
}

Here is the call graph for this function:

Here is the caller graph for this function:

DB* __hash_open ( const char *  file,
int  flags,
int  mode,
const HASHINFO info,
int  dflags 
)

Definition at line 136 of file hash.c.

{
       HTAB *hashp=NULL;
       struct stat statbuf;
       DB *dbp;
       int bpages, hdrsize, new_table, nsegs, save_errno;

       if ((flags & O_ACCMODE) == O_WRONLY) {
              errno = EINVAL;
              return NULL;
       }

       /* zero the statbuffer so that
        * we can check it for a non-zero
        * date to see if stat succeeded
        */
       memset(&statbuf, 0, sizeof(struct stat));

       if (!(hashp = (HTAB *)calloc(1, sizeof(HTAB)))) {
              errno = ENOMEM;
              return NULL;
       }
       hashp->fp = NO_FILE;
       if(file)
              hashp->filename = strdup(file);

       /*
        * Even if user wants write only, we need to be able to read
        * the actual file, so we need to open it read/write. But, the
        * field in the hashp structure needs to be accurate so that
        * we can check accesses.
        */
       hashp->flags = flags;

       new_table = 0;
       if (!file || (flags & O_TRUNC)     || (stat(file, &statbuf)  && (errno == ENOENT))) 
       {
              if (errno == ENOENT)
                     errno = 0; /* Just in case someone looks at errno */
              new_table = 1;
       }
       else if(statbuf.st_mtime && statbuf.st_size == 0)
       {
              /* check for a zero length file and delete it
               * if it exists
               */
              new_table = 1;
       }
       hashp->file_size = statbuf.st_size;

       if (file) {                         
#if defined(_WIN32) || defined(_WINDOWS) || defined (macintosh)  || defined(XP_OS2)
              if ((hashp->fp = DBFILE_OPEN(file, flags | O_BINARY, mode)) == -1)
                     RETURN_ERROR(errno, error1);
#else
              if ((hashp->fp = open(file, flags, mode)) == -1)
                     RETURN_ERROR(errno, error1);
              (void)fcntl(hashp->fp, F_SETFD, 1);
#endif
       }
       if (new_table) {
              if (!init_hash(hashp, file, (HASHINFO *)info))
                     RETURN_ERROR(errno, error1);
       } else {
              /* Table already exists */
              if (info && info->hash)
                     hashp->hash = info->hash;
              else
                     hashp->hash = __default_hash;

              hdrsize = read(hashp->fp, (char *)&hashp->hdr, sizeof(HASHHDR));
              if (hdrsize == -1)
                     RETURN_ERROR(errno, error1);
              if (hdrsize != sizeof(HASHHDR))
                     RETURN_ERROR(EFTYPE, error1);
#if BYTE_ORDER == LITTLE_ENDIAN
              swap_header(hashp);
#endif
              /* Verify file type, versions and hash function */
              if (hashp->MAGIC != HASHMAGIC)
                     RETURN_ERROR(EFTYPE, error1);
#define       OLDHASHVERSION       1
              if (hashp->VERSION != HASHVERSION &&
                  hashp->VERSION != OLDHASHVERSION)
                     RETURN_ERROR(EFTYPE, error1);
              if (hashp->hash(CHARKEY, sizeof(CHARKEY)) != hashp->H_CHARKEY)
                     RETURN_ERROR(EFTYPE, error1);
              if (hashp->NKEYS < 0) /* Old bad database. */
                     RETURN_ERROR(EFTYPE, error1);

              /*
               * Figure out how many segments we need.  Max_Bucket is the
               * maximum bucket number, so the number of buckets is
               * max_bucket + 1.
               */
              nsegs = (hashp->MAX_BUCKET + 1 + hashp->SGSIZE - 1) /
                      hashp->SGSIZE;
              hashp->nsegs = 0;
              if (alloc_segs(hashp, nsegs))
                     /* If alloc_segs fails, errno will have been set.  */
                     RETURN_ERROR(errno, error1);
              /* Read in bitmaps */
              bpages = (hashp->SPARES[hashp->OVFL_POINT] +
                  (hashp->BSIZE << BYTE_SHIFT) - 1) >>
                  (hashp->BSHIFT + BYTE_SHIFT);

              hashp->nmaps = bpages;
              (void)memset(&hashp->mapp[0], 0, bpages * sizeof(uint32 *));
       }

       /* Initialize Buffer Manager */
       if (info && info->cachesize)
              __buf_init(hashp, (int32) info->cachesize);
       else
              __buf_init(hashp, DEF_BUFSIZE);

       hashp->new_file = new_table;
#ifdef macintosh
       hashp->save_file = file && !(hashp->flags & O_RDONLY);
#else
       hashp->save_file = file && (hashp->flags & O_RDWR);
#endif
       hashp->cbucket = -1;
       if (!(dbp = (DB *)malloc(sizeof(DB)))) {
              RETURN_ERROR(ENOMEM, error1);
       }
       dbp->internal = hashp;
       dbp->close = hash_close;
       dbp->del = hash_delete;
       dbp->fd = hash_fd;
       dbp->get = hash_get;
       dbp->put = hash_put;
       dbp->seq = hash_seq;
       dbp->sync = hash_sync;
       dbp->type = DB_HASH;

#ifdef HASH_STATISTICS
       hash_overflows = hash_accesses = hash_collisions = hash_expansions = 0;
#endif
       return (dbp);

error1:
       hdestroy(hashp);
       errno = save_errno;
       return (NULL);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int init_htab __P ( (HTAB *, int ) [static]
static void swap_header __P ( (HTAB *)  ) [static]
static int hash_access __P ( (HTAB *, ACTION, DBT *, DBT *)  ) [static]
static int hash_close __P ( (DB *)  ) [static]
static int hash_delete __P ( (const DB *, const DBT *, uint ) [static]
static int hash_fd __P ( (const DB *)  ) [static]
static int hash_put __P ( (const DB *, const DBT *, DBT *, uint ) [static]
static void* hash_realloc __P ( (SEGMENT **, size_t, size_t)  ) [static]
static int hash_seq __P ( (const DB *, DBT *, DBT *, uint ) [static]
static int hash_sync __P ( (const DB *, uint ) [static]
static HTAB* init_hash __P ( (HTAB *, const char *, HASHINFO *)  ) [static]
static void swap_header_copy __P ( (HASHHDR *, HASHHDR *)  ) [static]
static void __remove_database ( DB dbp) [static]

Definition at line 119 of file hash.c.

{
       HTAB *hashp = (HTAB *)dbp->internal;

       assert(0);

       if (!hashp)
              return;
       hdestroy(hashp);
       dbp->internal = NULL; 
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int alloc_segs ( HTAB hashp,
int  nsegs 
) [static]

Definition at line 1091 of file hash.c.

{
       register int i;
       register SEGMENT store;

       if ((hashp->dir =
           (SEGMENT *)calloc((size_t)hashp->DSIZE, sizeof(SEGMENT *))) == NULL) {
              errno = ENOMEM;
              return (-1);
       }
       /* Allocate segments */
       if ((store =
           (SEGMENT)calloc((size_t)nsegs << hashp->SSHIFT, sizeof(SEGMENT))) == NULL) {
              errno = ENOMEM;
              return (-1);
       }
       for (i = 0; i < nsegs; i++, hashp->nsegs++)
              hashp->dir[i] = &store[i << hashp->SSHIFT];
       return (0);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int flush_meta ( HTAB hashp) [static]

Definition at line 608 of file hash.c.

{
       HASHHDR *whdrp;
#if BYTE_ORDER == LITTLE_ENDIAN
       HASHHDR whdr;
#endif
       int fp, i, wsize;

       if (!hashp->save_file)
              return (0);
       hashp->MAGIC = HASHMAGIC;
       hashp->VERSION = HASHVERSION;
       hashp->H_CHARKEY = hashp->hash(CHARKEY, sizeof(CHARKEY));

       fp = hashp->fp;
       whdrp = &hashp->hdr;
#if BYTE_ORDER == LITTLE_ENDIAN
       whdrp = &whdr;
       swap_header_copy(&hashp->hdr, whdrp);
#endif
       if ((lseek(fp, (off_t)0, SEEK_SET) == -1) ||
           ((wsize = write(fp, (char*)whdrp, sizeof(HASHHDR))) == -1))
              return (-1);
       else
              if (wsize != sizeof(HASHHDR)) {
                     errno = EFTYPE;
                     hashp->dbmerrno = errno;
                     return (-1);
              }
       for (i = 0; i < NCACHED; i++)
              if (hashp->mapp[i])
                     if (__put_page(hashp, (char *)hashp->mapp[i],
                            hashp->BITMAPS[i], 0, 1))
                            return (-1);
       return (0);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int hash_access ( HTAB hashp,
ACTION  action,
DBT key,
DBT val 
) [static]

Definition at line 762 of file hash.c.

{
       register BUFHEAD *rbufp;
       BUFHEAD *bufp, *save_bufp;
       register uint16 *bp;
       register long n, ndx, off;
       register size_t size;
       register char *kp;
       uint16 pageno;
       uint32 ovfl_loop_count=0;
    int32 last_overflow_page_no = -1;

#ifdef HASH_STATISTICS
       hash_accesses++;
#endif

       off = hashp->BSIZE;
       size = key->size;
       kp = (char *)key->data;
       rbufp = __get_buf(hashp, __call_hash(hashp, kp, size), NULL, 0);
       if (!rbufp)
              return (DATABASE_CORRUPTED_ERROR);
       save_bufp = rbufp;

       /* Pin the bucket chain */
       rbufp->flags |= BUF_PIN;
       for (bp = (uint16 *)rbufp->page, n = *bp++, ndx = 1; ndx < n;)
       {

              if (bp[1] >= REAL_KEY) {
                     /* Real key/data pair */
                     if (size == (unsigned long)(off - *bp) &&
                         memcmp(kp, rbufp->page + *bp, size) == 0)
                            goto found;
                     off = bp[1];
#ifdef HASH_STATISTICS
                     hash_collisions++;
#endif
                     bp += 2;
                     ndx += 2;
              } else if (bp[1] == OVFLPAGE) {

            /* database corruption: overflow loop detection */
            if(last_overflow_page_no == (int32)*bp)
                     return (DATABASE_CORRUPTED_ERROR);

            last_overflow_page_no = *bp;

                     rbufp = __get_buf(hashp, *bp, rbufp, 0);
                     if (!rbufp) {
                            save_bufp->flags &= ~BUF_PIN;
                            return (DBM_ERROR);
                     }

            ovfl_loop_count++;
            if(ovfl_loop_count > MAX_OVERFLOW_HASH_ACCESS_LOOPS)
                     return (DATABASE_CORRUPTED_ERROR);

                     /* FOR LOOP INIT */
                     bp = (uint16 *)rbufp->page;
                     n = *bp++;
                     ndx = 1;
                     off = hashp->BSIZE;
              } else if (bp[1] < REAL_KEY) {
                     if ((ndx =
                         __find_bigpair(hashp, rbufp, ndx, kp, (int)size)) > 0)
                            goto found;
                     if (ndx == -2) {
                            bufp = rbufp;
                            if (!(pageno =
                                __find_last_page(hashp, &bufp))) {
                                   ndx = 0;
                                   rbufp = bufp;
                                   break; /* FOR */
                            }
                            rbufp = __get_buf(hashp, pageno, bufp, 0);
                            if (!rbufp) {
                                   save_bufp->flags &= ~BUF_PIN;
                                   return (DBM_ERROR);
                            }
                            /* FOR LOOP INIT */
                            bp = (uint16 *)rbufp->page;
                            n = *bp++;
                            ndx = 1;
                            off = hashp->BSIZE;
                     } else {
                            save_bufp->flags &= ~BUF_PIN;
                            return (DBM_ERROR);

                     }
              }
       }

       /* Not found */
       switch (action) {
       case HASH_PUT:
       case HASH_PUTNEW:
              if (__addel(hashp, rbufp, key, val)) {
                     save_bufp->flags &= ~BUF_PIN;
                     return (DBM_ERROR);
              } else {
                     save_bufp->flags &= ~BUF_PIN;
                     return (SUCCESS);
              }
       case HASH_GET:
       case HASH_DELETE:
       default:
              save_bufp->flags &= ~BUF_PIN;
              return (ABNORMAL);
       }

found:
       switch (action) {
       case HASH_PUTNEW:
              save_bufp->flags &= ~BUF_PIN;
              return (ABNORMAL);
       case HASH_GET:
              bp = (uint16 *)rbufp->page;
              if (bp[ndx + 1] < REAL_KEY) {
                     if (__big_return(hashp, rbufp, ndx, val, 0))
                            return (DBM_ERROR);
              } else {
                     val->data = (uint8 *)rbufp->page + (int)bp[ndx + 1];
                     val->size = bp[ndx] - bp[ndx + 1];
              }
              break;
       case HASH_PUT:
              if ((__delpair(hashp, rbufp, ndx)) ||
                  (__addel(hashp, rbufp, key, val))) {
                     save_bufp->flags &= ~BUF_PIN;
                     return (DBM_ERROR);
              }
              break;
       case HASH_DELETE:
              if (__delpair(hashp, rbufp, ndx))
                     return (DBM_ERROR);
              break;
       default:
              abort();
       }
       save_bufp->flags &= ~BUF_PIN;
       return (SUCCESS);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int hash_close ( DB dbp) [static]

Definition at line 284 of file hash.c.

{
       HTAB *hashp;
       int retval;

       if (!dbp)
              return (DBM_ERROR);

       hashp = (HTAB *)dbp->internal;
       if(!hashp)
              return (DBM_ERROR);

       retval = hdestroy(hashp);
       free(dbp);
       return (retval);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int hash_delete ( const DB dbp,
const DBT key,
uint  flag 
) [static]

Definition at line 724 of file hash.c.

{
       HTAB *hashp;
       int rv;

       hashp = (HTAB *)dbp->internal;
       if (!hashp)
              return (DBM_ERROR);

       if (flag && flag != R_CURSOR) {
              hashp->dbmerrno = errno = EINVAL;
              return (DBM_ERROR);
       }
       if ((hashp->flags & O_ACCMODE) == O_RDONLY) {
              hashp->dbmerrno = errno = EPERM;
              return (DBM_ERROR);
       }
       rv = hash_access(hashp, HASH_DELETE, (DBT *)key, NULL);

       if(rv == DATABASE_CORRUPTED_ERROR)
         {
#if defined(unix) && defined(DEBUG)
              printf("\n\nDBM Database has been corrupted, tell Lou...\n\n");
#endif
              __remove_database((DB *)dbp);
         }

       return(rv);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int hash_fd ( const DB dbp) [static]

Definition at line 301 of file hash.c.

{
       HTAB *hashp;

       if (!dbp)
              return (DBM_ERROR);

       hashp = (HTAB *)dbp->internal;
       if(!hashp)
              return (DBM_ERROR);

       if (hashp->fp == -1) {
              errno = ENOENT;
              return (-1);
       }
       return (hashp->fp);
}

Here is the caller graph for this function:

static int hash_get ( const DB dbp,
const DBT key,
DBT data,
uint  flag 
) [static]

Definition at line 655 of file hash.c.

{
       HTAB *hashp;
       int rv;

       hashp = (HTAB *)dbp->internal;
       if (!hashp)
              return (DBM_ERROR);

       if (flag) {
              hashp->dbmerrno = errno = EINVAL;
              return (DBM_ERROR);
       }

       rv = hash_access(hashp, HASH_GET, (DBT *)key, data);

       if(rv == DATABASE_CORRUPTED_ERROR)
         {
#if defined(unix) && defined(DEBUG)
              printf("\n\nDBM Database has been corrupted, tell Lou...\n\n");
#endif
              __remove_database((DB *)dbp);
         }

       return(rv);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int hash_put ( const DB dbp,
DBT key,
const DBT data,
uint  flag 
) [static]

Definition at line 687 of file hash.c.

{
       HTAB *hashp;
       int rv;

       hashp = (HTAB *)dbp->internal;
       if (!hashp)
              return (DBM_ERROR);

       if (flag && flag != R_NOOVERWRITE) {
              hashp->dbmerrno = errno = EINVAL;
              return (DBM_ERROR);
       }
       if ((hashp->flags & O_ACCMODE) == O_RDONLY) {
              hashp->dbmerrno = errno = EPERM;
              return (DBM_ERROR);
       }

       rv =  hash_access(hashp, flag == R_NOOVERWRITE ?
           HASH_PUTNEW : HASH_PUT, (DBT *)key, (DBT *)data);

       if(rv == DATABASE_CORRUPTED_ERROR)
         {
#if defined(unix) && defined(DEBUG)
              printf("\n\nDBM Database has been corrupted, tell Lou...\n\n");
#endif
              __remove_database((DB *)dbp);
         }

       return(rv);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static void* hash_realloc ( SEGMENT **  p_ptr,
size_t  oldsize,
size_t  newsize 
) [static]

Definition at line 1058 of file hash.c.

{
       register void *p;

       if ((p = malloc(newsize))) {
              memmove(p, *p_ptr, oldsize);
              memset((char *)p + oldsize, 0, newsize - oldsize);
              free(*p_ptr);
              *p_ptr = (SEGMENT *)p;
       }
       return (p);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int hash_seq ( const DB dbp,
DBT key,
DBT data,
uint  flag 
) [static]

Definition at line 910 of file hash.c.

{
       register uint32 bucket;
       register BUFHEAD *bufp;
       HTAB *hashp;
       uint16 *bp, ndx;

       hashp = (HTAB *)dbp->internal;
       if (!hashp)
              return (DBM_ERROR);

       if (flag && flag != R_FIRST && flag != R_NEXT) {
              hashp->dbmerrno = errno = EINVAL;
              return (DBM_ERROR);
       }
#ifdef HASH_STATISTICS
       hash_accesses++;
#endif
       if ((hashp->cbucket < 0) || (flag == R_FIRST)) {
              hashp->cbucket = 0;
              hashp->cndx = 1;
              hashp->cpage = NULL;
       }

       for (bp = NULL; !bp || !bp[0]; ) {
              if (!(bufp = hashp->cpage)) {
                     for (bucket = hashp->cbucket;
                         bucket <= (uint32)hashp->MAX_BUCKET;
                         bucket++, hashp->cndx = 1) {
                            bufp = __get_buf(hashp, bucket, NULL, 0);
                            if (!bufp)
                                   return (DBM_ERROR);
                            hashp->cpage = bufp;
                            bp = (uint16 *)bufp->page;
                            if (bp[0])
                                   break;
                     }
                     hashp->cbucket = bucket;
                     if (hashp->cbucket > hashp->MAX_BUCKET) {
                            hashp->cbucket = -1;
                            return (ABNORMAL);
                     }
              } else
                     bp = (uint16 *)hashp->cpage->page;

#ifdef DEBUG
              assert(bp);
              assert(bufp);
#endif
              while (bp[hashp->cndx + 1] == OVFLPAGE) {
                     bufp = hashp->cpage =
                         __get_buf(hashp, bp[hashp->cndx], bufp, 0);
                     if (!bufp)
                            return (DBM_ERROR);
                     bp = (uint16 *)(bufp->page);
                     hashp->cndx = 1;
              }
              if (!bp[0]) {
                     hashp->cpage = NULL;
                     ++hashp->cbucket;
              }
       }
       ndx = hashp->cndx;
       if (bp[ndx + 1] < REAL_KEY) {
              if (__big_keydata(hashp, bufp, key, data, 1))
                     return (DBM_ERROR);
       } else {
              key->data = (uint8 *)hashp->cpage->page + bp[ndx];
              key->size = (ndx > 1 ? bp[ndx - 1] : hashp->BSIZE) - bp[ndx];
              data->data = (uint8 *)hashp->cpage->page + bp[ndx + 1];
              data->size = bp[ndx] - bp[ndx + 1];
              ndx += 2;
              if (ndx > bp[0]) {
                     hashp->cpage = NULL;
                     hashp->cbucket++;
                     hashp->cndx = 1;
              } else
                     hashp->cndx = ndx;
       }
       return (SUCCESS);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int hash_sync ( const DB dbp,
uint  flags 
) [static]

Definition at line 570 of file hash.c.

{
       HTAB *hashp;

       if (flags != 0) {
              errno = EINVAL;
              return (DBM_ERROR);
       }

       if (!dbp)
              return (DBM_ERROR);

       hashp = (HTAB *)dbp->internal;
       if(!hashp)
              return (DBM_ERROR);

       if (!hashp->save_file)
              return (0);
       if (__buf_free(hashp, 0, 1) || flush_meta(hashp))
              return (DBM_ERROR);
#if defined(_WIN32) || defined(_WINDOWS) 
       if (hashp->updateEOF && hashp->filename && !hashp->is_temp) {
              int status = update_EOF(hashp);
              hashp->updateEOF = 0;
              if (status)
                     return status;
       }
#endif
       hashp->new_file = 0;
       return (0);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int hdestroy ( HTAB hashp) [static]

Definition at line 442 of file hash.c.

{
       int i, save_errno;

       save_errno = 0;

#ifdef HASH_STATISTICS
       (void)fprintf(stderr, "hdestroy: accesses %ld collisions %ld\n",
           hash_accesses, hash_collisions);
       (void)fprintf(stderr, "hdestroy: expansions %ld\n",
           hash_expansions);
       (void)fprintf(stderr, "hdestroy: overflows %ld\n",
           hash_overflows);
       (void)fprintf(stderr, "keys %ld maxp %d segmentcount %d\n",
           hashp->NKEYS, hashp->MAX_BUCKET, hashp->nsegs);

       for (i = 0; i < NCACHED; i++)
              (void)fprintf(stderr,
                  "spares[%d] = %d\n", i, hashp->SPARES[i]);
#endif
       /*
        * Call on buffer manager to free buffers, and if required,
        * write them to disk.
        */
       if (__buf_free(hashp, 1, hashp->save_file))
              save_errno = errno;
       if (hashp->dir) {
              free(*hashp->dir);   /* Free initial segments */
              /* Free extra segments */
              while (hashp->exsegs--)
                     free(hashp->dir[--hashp->nsegs]);
              free(hashp->dir);
       }
       if (flush_meta(hashp) && !save_errno)
              save_errno = errno;
       /* Free Bigmaps */
       for (i = 0; i < hashp->nmaps; i++)
              if (hashp->mapp[i])
                     free(hashp->mapp[i]);

       if (hashp->fp != -1)
              (void)close(hashp->fp);

       if(hashp->filename) {
#if defined(_WIN32) || defined(_WINDOWS) || defined(XP_OS2)
              if (hashp->is_temp)
                     (void)unlink(hashp->filename);
#endif
              free(hashp->filename);
       }
       if (hashp->tmp_buf)
           free(hashp->tmp_buf);
       if (hashp->tmp_key)
           free(hashp->tmp_key);
       free(hashp);
       if (save_errno) {
              errno = save_errno;
              return (DBM_ERROR);
       }
       return (SUCCESS);
}

Here is the call graph for this function:

static HTAB* init_hash ( HTAB hashp,
const char *  file,
HASHINFO info 
) [static]

Definition at line 321 of file hash.c.

{
       struct stat statbuf;
       int nelem;

       nelem = 1;
       hashp->NKEYS = 0;
       hashp->LORDER = BYTE_ORDER;
       hashp->BSIZE = DEF_BUCKET_SIZE;
       hashp->BSHIFT = DEF_BUCKET_SHIFT;
       hashp->SGSIZE = DEF_SEGSIZE;
       hashp->SSHIFT = DEF_SEGSIZE_SHIFT;
       hashp->DSIZE = DEF_DIRSIZE;
       hashp->FFACTOR = DEF_FFACTOR;
       hashp->hash = __default_hash;
       memset(hashp->SPARES, 0, sizeof(hashp->SPARES));
       memset(hashp->BITMAPS, 0, sizeof (hashp->BITMAPS));

       /* Fix bucket size to be optimal for file system */
       if (file != NULL) {
              if (stat(file, &statbuf))
                     return (NULL);

#if !defined(_WIN32) && !defined(_WINDOWS) && !defined(macintosh) && !defined(VMS) && !defined(XP_OS2)
#if defined(__QNX__) && !defined(__QNXNTO__)
              hashp->BSIZE = 512; /* preferred blk size on qnx4 */
#else
              hashp->BSIZE = statbuf.st_blksize;
#endif

              /* new code added by Lou to reduce block
               * size down below MAX_BSIZE
               */
              if (hashp->BSIZE > MAX_BSIZE)
                     hashp->BSIZE = MAX_BSIZE;
#endif
              hashp->BSHIFT = __log2((uint32)hashp->BSIZE);
       }

       if (info) {
              if (info->bsize) {
                     /* Round pagesize up to power of 2 */
                     hashp->BSHIFT = __log2(info->bsize);
                     hashp->BSIZE = 1 << hashp->BSHIFT;
                     if (hashp->BSIZE > MAX_BSIZE) {
                            errno = EINVAL;
                            return (NULL);
                     }
              }
              if (info->ffactor)
                     hashp->FFACTOR = info->ffactor;
              if (info->hash)
                     hashp->hash = info->hash;
              if (info->nelem)
                     nelem = info->nelem;
              if (info->lorder) {
                     if (info->lorder != BIG_ENDIAN &&
                         info->lorder != LITTLE_ENDIAN) {
                            errno = EINVAL;
                            return (NULL);
                     }
                     hashp->LORDER = info->lorder;
              }
       }
       /* init_htab sets errno if it fails */
       if (init_htab(hashp, nelem))
              return (NULL);
       else
              return (hashp);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int init_htab ( HTAB hashp,
int  nelem 
) [static]

Definition at line 398 of file hash.c.

{
       register int nbuckets, nsegs;
       int l2;

       /*
        * Divide number of elements by the fill factor and determine a
        * desired number of buckets.  Allocate space for the next greater
        * power of two number of buckets.
        */
       nelem = (nelem - 1) / hashp->FFACTOR + 1;

       l2 = __log2((uint32)PR_MAX(nelem, 2));
       nbuckets = 1 << l2;

       hashp->SPARES[l2] = l2 + 1;
       hashp->SPARES[l2 + 1] = l2 + 1;
       hashp->OVFL_POINT = l2;
       hashp->LAST_FREED = 2;

       /* First bitmap page is at: splitpoint l2 page offset 1 */
       if (__ibitmap(hashp, (int)OADDR_OF(l2, 1), l2 + 1, 0))
              return (-1);

       hashp->MAX_BUCKET = hashp->LOW_MASK = nbuckets - 1;
       hashp->HIGH_MASK = (nbuckets << 1) - 1;
       hashp->HDRPAGES = ((PR_MAX(sizeof(HASHHDR), MINHDRSIZE) - 1) >>
           hashp->BSHIFT) + 1;

       nsegs = (nbuckets - 1) / hashp->SGSIZE + 1;
       nsegs = 1 << __log2((uint32)nsegs);

       if (nsegs > hashp->DSIZE)
              hashp->DSIZE = nsegs;
       return (alloc_segs(hashp, nsegs));
}

Here is the call graph for this function:

Here is the caller graph for this function:

static void swap_header ( HTAB hashp) [static]

Definition at line 1148 of file hash.c.

{
       HASHHDR *hdrp;
       int i;

       hdrp = &hashp->hdr;

       M_32_SWAP(hdrp->magic);
       M_32_SWAP(hdrp->version);
       M_32_SWAP(hdrp->lorder);
       M_32_SWAP(hdrp->bsize);
       M_32_SWAP(hdrp->bshift);
       M_32_SWAP(hdrp->dsize);
       M_32_SWAP(hdrp->ssize);
       M_32_SWAP(hdrp->sshift);
       M_32_SWAP(hdrp->ovfl_point);
       M_32_SWAP(hdrp->last_freed);
       M_32_SWAP(hdrp->max_bucket);
       M_32_SWAP(hdrp->high_mask);
       M_32_SWAP(hdrp->low_mask);
       M_32_SWAP(hdrp->ffactor);
       M_32_SWAP(hdrp->nkeys);
       M_32_SWAP(hdrp->hdrpages);
       M_32_SWAP(hdrp->h_charkey);
       for (i = 0; i < NCACHED; i++) {
              M_32_SWAP(hdrp->spares[i]);
              M_16_SWAP(hdrp->bitmaps[i]);
       }
}

Here is the caller graph for this function:

static void swap_header_copy ( HASHHDR srcp,
HASHHDR destp 
) [static]

Definition at line 1119 of file hash.c.

{
       int i;

       P_32_COPY(srcp->magic, destp->magic);
       P_32_COPY(srcp->version, destp->version);
       P_32_COPY(srcp->lorder, destp->lorder);
       P_32_COPY(srcp->bsize, destp->bsize);
       P_32_COPY(srcp->bshift, destp->bshift);
       P_32_COPY(srcp->dsize, destp->dsize);
       P_32_COPY(srcp->ssize, destp->ssize);
       P_32_COPY(srcp->sshift, destp->sshift);
       P_32_COPY(srcp->ovfl_point, destp->ovfl_point);
       P_32_COPY(srcp->last_freed, destp->last_freed);
       P_32_COPY(srcp->max_bucket, destp->max_bucket);
       P_32_COPY(srcp->high_mask, destp->high_mask);
       P_32_COPY(srcp->low_mask, destp->low_mask);
       P_32_COPY(srcp->ffactor, destp->ffactor);
       P_32_COPY(srcp->nkeys, destp->nkeys);
       P_32_COPY(srcp->hdrpages, destp->hdrpages);
       P_32_COPY(srcp->h_charkey, destp->h_charkey);
       for (i = 0; i < NCACHED; i++) {
              P_32_COPY(srcp->spares[i], destp->spares[i]);
              P_16_COPY(srcp->bitmaps[i], destp->bitmaps[i]);
       }
}

Here is the caller graph for this function: