You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
166 lines
6.1 KiB
166 lines
6.1 KiB
/*-
|
|
* See the file LICENSE for redistribution information.
|
|
*
|
|
* Copyright (c) 1996, 1997, 1998, 1999
|
|
* Sleepycat Software. All rights reserved.
|
|
*/
|
|
/*
|
|
* Copyright (c) 1990, 1993, 1994
|
|
* Margo Seltzer. All rights reserved.
|
|
*/
|
|
/*
|
|
* Copyright (c) 1990, 1993, 1994
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* Margo Seltzer.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* @(#)hash.h 11.5 (Sleepycat) 10/5/99
|
|
*/
|
|
|
|
/* Hash internal structure. */
|
|
typedef struct hash_t {
|
|
DB *dbp; /* Pointer to enclosing DB */
|
|
db_pgno_t meta_pgno; /* Page number of the meta data page. */
|
|
u_int32_t h_ffactor; /* Fill factor. */
|
|
u_int32_t h_nelem; /* Number of elements. */
|
|
/* Hash function. */
|
|
u_int32_t (*h_hash) __P((const void *, u_int32_t));
|
|
} HASH;
|
|
|
|
/* Cursor structure definitions. */
|
|
typedef struct cursor_t {
|
|
DBC *dbc;
|
|
|
|
/* Per-thread information */
|
|
DB_LOCK hlock; /* Metadata page lock. */
|
|
HMETA *hdr; /* Pointer to meta-data page. */
|
|
PAGE *split_buf; /* Temporary buffer for splits. */
|
|
|
|
/* Hash cursor information */
|
|
db_pgno_t bucket; /* Bucket we are traversing. */
|
|
db_pgno_t lbucket; /* Bucket for which we are locked. */
|
|
DB_LOCK lock; /* Lock held on the current bucket. */
|
|
db_lockmode_t mode; /* Lock mode of lock. */
|
|
PAGE *pagep; /* The current page. */
|
|
db_pgno_t pgno; /* Current page number. */
|
|
db_indx_t bndx; /* Index within the current page. */
|
|
PAGE *dpagep; /* Duplicate page pointer. */
|
|
db_pgno_t dpgno; /* Duplicate page number. */
|
|
db_indx_t dndx; /* Index within a duplicate set. */
|
|
db_indx_t dup_off; /* Offset within a duplicate set. */
|
|
db_indx_t dup_len; /* Length of current duplicate. */
|
|
db_indx_t dup_tlen; /* Total length of duplicate entry. */
|
|
u_int32_t seek_size; /* Number of bytes we need for add. */
|
|
db_pgno_t seek_found_page;/* Page on which we can insert. */
|
|
|
|
#define H_DELETED 0x0001 /* Cursor item is deleted. */
|
|
#define H_DUPONLY 0x0002 /* Dups only; do not change key. */
|
|
#define H_EXPAND 0x0004 /* Table expanded. */
|
|
#define H_ISDUP 0x0008 /* Cursor is within duplicate set. */
|
|
#define H_NOMORE 0x0010 /* No more entries in bucket. */
|
|
#define H_OK 0x0020 /* Request succeeded. */
|
|
#define H_DIRTY 0x0040 /* Meta-data page needs to be written */
|
|
#define H_ORIGINAL 0x0080 /* Bucket lock existed on entry. */
|
|
u_int32_t flags;
|
|
} HASH_CURSOR;
|
|
|
|
#define IS_VALID(C) ((C)->bucket != BUCKET_INVALID)
|
|
|
|
#define SAVE_CURSOR(ORIG, COPY) { \
|
|
if ((ORIG)->lock.off != LOCK_INVALID) \
|
|
F_SET((ORIG), H_ORIGINAL); \
|
|
*(COPY) = *(ORIG); \
|
|
}
|
|
|
|
#define RESTORE_CURSOR(D, ORIG, COPY, RET) { \
|
|
if ((RET) == 0) { \
|
|
if ((ORIG)->dbc->txn == NULL && \
|
|
(COPY)->lock.off != LOCK_INVALID && \
|
|
(ORIG)->lock.off != (COPY)->lock.off) { \
|
|
if ((ORIG)->lbucket == (COPY)->lbucket && \
|
|
(ORIG)->mode == DB_LOCK_WRITE && \
|
|
(COPY)->mode == DB_LOCK_READ) { \
|
|
(void)CDB_lock_put((D)->dbenv, &(ORIG)->lock);\
|
|
(ORIG)->lock = (COPY)->lock; \
|
|
(ORIG)->mode = (COPY)->mode; \
|
|
} else \
|
|
(void)CDB_lock_put((D)->dbenv, &(COPY)->lock);\
|
|
} \
|
|
} else { \
|
|
if ((ORIG)->dbc->txn == NULL && \
|
|
(ORIG)->lock.off != LOCK_INVALID && \
|
|
(ORIG)->lock.off != (COPY)->lock.off) \
|
|
(void)CDB_lock_put((D)->dbenv, &(ORIG)->lock); \
|
|
*ORIG = *COPY; \
|
|
} \
|
|
}
|
|
|
|
/* Test string. */
|
|
#define CHARKEY "%$sniglet^&"
|
|
|
|
/* Overflow management */
|
|
/*
|
|
* The spares table indicates the page number at which each doubling begins.
|
|
* From this page number we subtract the number of buckets already allocated
|
|
* so that we can do a simple addition to calculate the page number here.
|
|
*/
|
|
#define BUCKET_TO_PAGE(I, B) ((B) + (I)->hdr->spares[CDB___db_log2((B)+1)])
|
|
|
|
/* Constraints about number of pages and how much data goes on a page. */
|
|
|
|
#define MAX_PAGES(H) UINT32_T_MAX
|
|
#define MINFILL 4
|
|
#define ISBIG(I, N) (((N) > ((I)->hdr->dbmeta.pagesize / MINFILL)) ? 1 : 0)
|
|
|
|
/* Shorthands for accessing structure */
|
|
#define NDX_INVALID 0xFFFF
|
|
#define BUCKET_INVALID 0xFFFFFFFF
|
|
|
|
/* On page duplicates are stored as a string of size-data-size triples. */
|
|
#define DUP_SIZE(len) ((len) + 2 * sizeof(db_indx_t))
|
|
|
|
/* Log messages types (these are subtypes within a record type) */
|
|
#define PAIR_KEYMASK 0x1
|
|
#define PAIR_DATAMASK 0x2
|
|
#define PAIR_ISKEYBIG(N) (N & PAIR_KEYMASK)
|
|
#define PAIR_ISDATABIG(N) (N & PAIR_DATAMASK)
|
|
#define OPCODE_OF(N) (N & ~(PAIR_KEYMASK | PAIR_DATAMASK))
|
|
|
|
#define PUTPAIR 0x20
|
|
#define DELPAIR 0x30
|
|
#define PUTOVFL 0x40
|
|
#define DELOVFL 0x50
|
|
#define ALLOCPGNO 0x60
|
|
#define DELPGNO 0x70
|
|
#define SPLITOLD 0x80
|
|
#define SPLITNEW 0x90
|
|
|
|
#include "hash_auto.h"
|
|
#include "hash_ext.h"
|
|
#include "db_am.h"
|