Home | History | Annotate | Line # | Download | only in include
db.h revision 1.19
      1  1.19  kristerw /*	$NetBSD: db.h,v 1.19 2003/07/09 01:59:34 kristerw Exp $	*/
      2  1.13       cgd 
      3   1.1       cgd /*-
      4  1.12       cgd  * Copyright (c) 1990, 1993, 1994
      5   1.7       cgd  *	The Regents of the University of California.  All rights reserved.
      6   1.1       cgd  *
      7   1.1       cgd  * Redistribution and use in source and binary forms, with or without
      8   1.1       cgd  * modification, are permitted provided that the following conditions
      9   1.1       cgd  * are met:
     10   1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     11   1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     12   1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13   1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     14   1.1       cgd  *    documentation and/or other materials provided with the distribution.
     15   1.1       cgd  * 3. All advertising materials mentioning features or use of this software
     16   1.1       cgd  *    must display the following acknowledgement:
     17   1.1       cgd  *	This product includes software developed by the University of
     18   1.1       cgd  *	California, Berkeley and its contributors.
     19   1.1       cgd  * 4. Neither the name of the University nor the names of its contributors
     20   1.1       cgd  *    may be used to endorse or promote products derived from this software
     21   1.1       cgd  *    without specific prior written permission.
     22   1.1       cgd  *
     23   1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24   1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25   1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26   1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27   1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28   1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29   1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30   1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31   1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32   1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33   1.1       cgd  * SUCH DAMAGE.
     34   1.1       cgd  *
     35  1.12       cgd  *	@(#)db.h	8.7 (Berkeley) 6/16/94
     36   1.1       cgd  */
     37   1.1       cgd 
     38   1.1       cgd #ifndef _DB_H_
     39   1.1       cgd #define	_DB_H_
     40   1.1       cgd 
     41   1.3    proven #include <sys/types.h>
     42   1.1       cgd #include <sys/cdefs.h>
     43   1.1       cgd 
     44   1.9       cgd #include <limits.h>
     45   1.9       cgd 
     46   1.3    proven #define	RET_ERROR	-1		/* Return values. */
     47   1.3    proven #define	RET_SUCCESS	 0
     48   1.3    proven #define	RET_SPECIAL	 1
     49  1.12       cgd 
     50  1.12       cgd #define	MAX_PAGE_NUMBER	0xffffffff	/* >= # of pages in a file */
     51  1.12       cgd typedef u_int32_t	pgno_t;
     52  1.12       cgd #define	MAX_PAGE_OFFSET	65535		/* >= # of bytes in a page */
     53  1.12       cgd typedef u_int16_t	indx_t;
     54  1.12       cgd #define	MAX_REC_NUMBER	0xffffffff	/* >= # of records in a tree */
     55  1.12       cgd typedef u_int32_t	recno_t;
     56   1.3    proven 
     57   1.3    proven /* Key/data structure -- a Data-Base Thang. */
     58   1.1       cgd typedef struct {
     59   1.3    proven 	void	*data;			/* data */
     60   1.3    proven 	size_t	 size;			/* data length */
     61   1.1       cgd } DBT;
     62   1.1       cgd 
     63   1.3    proven /* Routine flags. */
     64   1.3    proven #define	R_CURSOR	1		/* del, put, seq */
     65   1.6       cgd #define	__R_UNUSED	2		/* UNUSED */
     66   1.3    proven #define	R_FIRST		3		/* seq */
     67   1.3    proven #define	R_IAFTER	4		/* put (RECNO) */
     68   1.3    proven #define	R_IBEFORE	5		/* put (RECNO) */
     69   1.3    proven #define	R_LAST		6		/* seq (BTREE, RECNO) */
     70   1.3    proven #define	R_NEXT		7		/* seq */
     71   1.3    proven #define	R_NOOVERWRITE	8		/* put */
     72   1.3    proven #define	R_PREV		9		/* seq (BTREE, RECNO) */
     73   1.3    proven #define	R_SETCURSOR	10		/* put (RECNO) */
     74   1.6       cgd #define	R_RECNOSYNC	11		/* sync (RECNO) */
     75   1.3    proven 
     76   1.3    proven typedef enum { DB_BTREE, DB_HASH, DB_RECNO } DBTYPE;
     77   1.3    proven 
     78   1.9       cgd /*
     79   1.9       cgd  * !!!
     80   1.9       cgd  * The following flags are included in the dbopen(3) call as part of the
     81   1.9       cgd  * open(2) flags.  In order to avoid conflicts with the open flags, start
     82   1.9       cgd  * at the top of the 16 or 32-bit number space and work our way down.  If
     83   1.9       cgd  * the open flags were significantly expanded in the future, it could be
     84   1.9       cgd  * a problem.  Wish I'd left another flags word in the dbopen call.
     85   1.9       cgd  *
     86   1.9       cgd  * !!!
     87   1.9       cgd  * None of this stuff is implemented yet.  The only reason that it's here
     88   1.9       cgd  * is so that the access methods can skip copying the key/data pair when
     89   1.9       cgd  * the DB_LOCK flag isn't set.
     90   1.9       cgd  */
     91   1.9       cgd #if UINT_MAX > 65535
     92   1.9       cgd #define	DB_LOCK		0x20000000	/* Do locking. */
     93   1.9       cgd #define	DB_SHMEM	0x40000000	/* Use shared memory. */
     94   1.9       cgd #define	DB_TXN		0x80000000	/* Do transactions. */
     95   1.9       cgd #else
     96  1.12       cgd #define	DB_LOCK		    0x2000	/* Do locking. */
     97  1.12       cgd #define	DB_SHMEM	    0x4000	/* Use shared memory. */
     98  1.12       cgd #define	DB_TXN		    0x8000	/* Do transactions. */
     99   1.9       cgd #endif
    100   1.3    proven 
    101   1.3    proven /* Access method description structure. */
    102   1.1       cgd typedef struct __db {
    103   1.9       cgd 	DBTYPE type;			/* Underlying db type. */
    104   1.3    proven 	int (*close)	__P((struct __db *));
    105   1.3    proven 	int (*del)	__P((const struct __db *, const DBT *, u_int));
    106   1.3    proven 	int (*get)	__P((const struct __db *, const DBT *, DBT *, u_int));
    107   1.3    proven 	int (*put)	__P((const struct __db *, DBT *, const DBT *, u_int));
    108   1.3    proven 	int (*seq)	__P((const struct __db *, DBT *, DBT *, u_int));
    109   1.6       cgd 	int (*sync)	__P((const struct __db *, u_int));
    110  1.11       cgd 	void *internal;			/* Access method private. */
    111  1.11       cgd 	int (*fd)	__P((const struct __db *));
    112   1.1       cgd } DB;
    113   1.1       cgd 
    114   1.1       cgd #define	BTREEMAGIC	0x053162
    115   1.3    proven #define	BTREEVERSION	3
    116   1.1       cgd 
    117   1.3    proven /* Structure used to pass parameters to the btree routines. */
    118   1.1       cgd typedef struct {
    119   1.1       cgd #define	R_DUP		0x01	/* duplicate keys */
    120  1.12       cgd 	u_long	flags;
    121  1.12       cgd 	u_int	cachesize;	/* bytes to cache */
    122  1.12       cgd 	int	maxkeypage;	/* maximum keys per page */
    123  1.12       cgd 	int	minkeypage;	/* minimum keys per page */
    124  1.12       cgd 	u_int	psize;		/* page size */
    125  1.12       cgd 	int	(*compare)	/* comparison function */
    126  1.12       cgd 	    __P((const DBT *, const DBT *));
    127  1.12       cgd 	size_t	(*prefix)	/* prefix function */
    128  1.12       cgd 	    __P((const DBT *, const DBT *));
    129  1.12       cgd 	int	lorder;		/* byte order */
    130   1.1       cgd } BTREEINFO;
    131   1.1       cgd 
    132   1.1       cgd #define	HASHMAGIC	0x061561
    133   1.3    proven #define	HASHVERSION	2
    134   1.1       cgd 
    135   1.3    proven /* Structure used to pass parameters to the hashing routines. */
    136   1.1       cgd typedef struct {
    137  1.12       cgd 	u_int	bsize;		/* bucket size */
    138  1.12       cgd 	u_int	ffactor;	/* fill factor */
    139  1.12       cgd 	u_int	nelem;		/* number of elements */
    140  1.12       cgd 	u_int	cachesize;	/* bytes to cache */
    141  1.12       cgd 	u_int32_t		/* hash function */
    142  1.12       cgd 		(*hash) __P((const void *, size_t));
    143  1.12       cgd 	int	lorder;		/* byte order */
    144   1.1       cgd } HASHINFO;
    145   1.1       cgd 
    146   1.3    proven /* Structure used to pass parameters to the record routines. */
    147   1.1       cgd typedef struct {
    148   1.1       cgd #define	R_FIXEDLEN	0x01	/* fixed-length records */
    149   1.3    proven #define	R_NOKEY		0x02	/* key not required */
    150   1.3    proven #define	R_SNAPSHOT	0x04	/* snapshot the input */
    151  1.12       cgd 	u_long	flags;
    152  1.12       cgd 	u_int	cachesize;	/* bytes to cache */
    153  1.12       cgd 	u_int	psize;		/* page size */
    154  1.12       cgd 	int	lorder;		/* byte order */
    155  1.12       cgd 	size_t	reclen;		/* record length (fixed-length records) */
    156  1.12       cgd 	u_char	bval;		/* delimiting byte (variable-length records */
    157   1.6       cgd 	char	*bfname;	/* btree file name */
    158   1.1       cgd } RECNOINFO;
    159   1.1       cgd 
    160  1.12       cgd #ifdef __DBINTERFACE_PRIVATE
    161   1.3    proven /*
    162  1.12       cgd  * Little endian <==> big endian 32-bit swap macros.
    163  1.12       cgd  *	M_32_SWAP	swap a memory location
    164  1.12       cgd  *	P_32_SWAP	swap a referenced memory location
    165  1.12       cgd  *	P_32_COPY	swap from one location to another
    166   1.3    proven  */
    167  1.12       cgd #define	M_32_SWAP(a) {							\
    168  1.12       cgd 	u_int32_t _tmp = a;						\
    169  1.15  christos 	((char *)(void *)&a)[0] = ((char *)(void *)&_tmp)[3];		\
    170  1.15  christos 	((char *)(void *)&a)[1] = ((char *)(void *)&_tmp)[2];		\
    171  1.15  christos 	((char *)(void *)&a)[2] = ((char *)(void *)&_tmp)[1];		\
    172  1.15  christos 	((char *)(void *)&a)[3] = ((char *)(void *)&_tmp)[0];		\
    173   1.9       cgd }
    174  1.12       cgd #define	P_32_SWAP(a) {							\
    175  1.17       scw 	char  _tmp[4];							\
    176  1.17       scw 	_tmp[0] = ((char *)(void *)a)[0];				\
    177  1.17       scw 	_tmp[1] = ((char *)(void *)a)[1];				\
    178  1.17       scw 	_tmp[2] = ((char *)(void *)a)[2];				\
    179  1.17       scw 	_tmp[3] = ((char *)(void *)a)[3];				\
    180  1.17       scw 	((char *)(void *)a)[0] = _tmp[3];				\
    181  1.17       scw 	((char *)(void *)a)[1] = _tmp[2];				\
    182  1.17       scw 	((char *)(void *)a)[2] = _tmp[1];				\
    183  1.17       scw 	((char *)(void *)a)[3] = _tmp[0];				\
    184   1.9       cgd }
    185  1.12       cgd #define	P_32_COPY(a, b) {						\
    186  1.15  christos 	((char *)(void *)&(b))[0] = ((char *)(void *)&(a))[3];		\
    187  1.15  christos 	((char *)(void *)&(b))[1] = ((char *)(void *)&(a))[2];		\
    188  1.15  christos 	((char *)(void *)&(b))[2] = ((char *)(void *)&(a))[1];		\
    189  1.15  christos 	((char *)(void *)&(b))[3] = ((char *)(void *)&(a))[0];		\
    190   1.6       cgd }
    191   1.3    proven 
    192   1.3    proven /*
    193  1.12       cgd  * Little endian <==> big endian 16-bit swap macros.
    194  1.12       cgd  *	M_16_SWAP	swap a memory location
    195  1.12       cgd  *	P_16_SWAP	swap a referenced memory location
    196  1.12       cgd  *	P_16_COPY	swap from one location to another
    197   1.3    proven  */
    198  1.12       cgd #define	M_16_SWAP(a) {							\
    199  1.12       cgd 	u_int16_t _tmp = a;						\
    200  1.15  christos 	((char *)(void *)&a)[0] = ((char *)(void *)&_tmp)[1];		\
    201  1.15  christos 	((char *)(void *)&a)[1] = ((char *)(void *)&_tmp)[0];		\
    202   1.9       cgd }
    203  1.12       cgd #define	P_16_SWAP(a) {							\
    204  1.17       scw 	char  _tmp[2];							\
    205  1.17       scw 	_tmp[0] = ((char *)(void *)a)[0];				\
    206  1.17       scw 	_tmp[1] = ((char *)(void *)a)[1];				\
    207  1.17       scw 	((char *)(void *)a)[0] = _tmp[1];				\
    208  1.17       scw 	((char *)(void *)a)[1] = _tmp[0];				\
    209   1.9       cgd }
    210  1.12       cgd #define	P_16_COPY(a, b) {						\
    211  1.15  christos 	((char *)(void *)&(b))[0] = ((char *)(void *)&(a))[1];		\
    212  1.15  christos 	((char *)(void *)&(b))[1] = ((char *)(void *)&(a))[0];		\
    213   1.6       cgd }
    214  1.12       cgd #endif
    215   1.1       cgd 
    216   1.1       cgd __BEGIN_DECLS
    217  1.14    kleink DB *dbopen __P((const char *, int, mode_t, DBTYPE, const void *));
    218   1.3    proven 
    219   1.3    proven #ifdef __DBINTERFACE_PRIVATE
    220  1.14    kleink DB	*__bt_open __P((const char *, int, mode_t, const BTREEINFO *, int));
    221  1.14    kleink DB	*__hash_open __P((const char *, int, mode_t, const HASHINFO *, int));
    222  1.14    kleink DB	*__rec_open __P((const char *, int, mode_t, const RECNOINFO *, int));
    223  1.19  kristerw void	 __dbpanic __P((DB *));
    224   1.3    proven #endif
    225   1.1       cgd __END_DECLS
    226   1.1       cgd #endif /* !_DB_H_ */
    227