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