NetBSD/include/db.h

196 lines
6.7 KiB
C
Raw Normal View History

1993-03-21 12:45:37 +03:00
/*-
* Copyright (c) 1990, 1993
* The Regents of the University of California. All rights reserved.
1993-03-21 12:45:37 +03:00
*
* 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. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. 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.
*
1993-08-01 21:54:45 +04:00
* from: @(#)db.h 8.1 (Berkeley) 6/2/93
* $Id: db.h,v 1.8 1993/08/01 18:44:59 mycroft Exp $
1993-03-21 12:45:37 +03:00
*/
#ifndef _DB_H_
#define _DB_H_
1993-04-19 01:48:37 +04:00
#include <sys/types.h>
1993-03-21 12:45:37 +03:00
#include <sys/cdefs.h>
#include <machine/endian.h>
1993-03-21 12:45:37 +03:00
1993-04-19 01:48:37 +04:00
#define RET_ERROR -1 /* Return values. */
#define RET_SUCCESS 0
#define RET_SPECIAL 1
1993-03-21 12:45:37 +03:00
1993-04-19 01:48:37 +04:00
#define MAX_PAGE_NUMBER ULONG_MAX /* >= # of pages in a file */
typedef u_long pgno_t;
#define MAX_PAGE_OFFSET USHRT_MAX /* >= # of bytes in a page */
typedef u_short indx_t;
#define MAX_REC_NUMBER ULONG_MAX /* >= # of records in a tree */
typedef u_long recno_t;
1993-03-21 12:45:37 +03:00
1993-04-19 01:48:37 +04:00
/* Key/data structure -- a Data-Base Thang. */
1993-03-21 12:45:37 +03:00
typedef struct {
1993-04-19 01:48:37 +04:00
void *data; /* data */
size_t size; /* data length */
1993-03-21 12:45:37 +03:00
} DBT;
1993-04-19 01:48:37 +04:00
/* Routine flags. */
#define R_CURSOR 1 /* del, put, seq */
1993-05-27 23:54:30 +04:00
#define __R_UNUSED 2 /* UNUSED */
1993-04-19 01:48:37 +04:00
#define R_FIRST 3 /* seq */
#define R_IAFTER 4 /* put (RECNO) */
#define R_IBEFORE 5 /* put (RECNO) */
#define R_LAST 6 /* seq (BTREE, RECNO) */
#define R_NEXT 7 /* seq */
#define R_NOOVERWRITE 8 /* put */
#define R_PREV 9 /* seq (BTREE, RECNO) */
#define R_SETCURSOR 10 /* put (RECNO) */
1993-05-27 23:54:30 +04:00
#define R_RECNOSYNC 11 /* sync (RECNO) */
1993-04-19 01:48:37 +04:00
typedef enum { DB_BTREE, DB_HASH, DB_RECNO } DBTYPE;
#define __USE_OPEN_FLAGS \
(O_CREAT|O_EXCL|O_EXLOCK|O_RDONLY|O_RDWR|O_SHLOCK|O_TRUNC)
/* Access method description structure. */
1993-03-21 12:45:37 +03:00
typedef struct __db {
1993-04-19 01:48:37 +04:00
DBTYPE type; /* underlying db type */
int (*close) __P((struct __db *));
int (*del) __P((const struct __db *, const DBT *, u_int));
1993-05-27 23:54:30 +04:00
int (*fd) __P((const struct __db *));
1993-04-19 01:48:37 +04:00
int (*get) __P((const struct __db *, const DBT *, DBT *, u_int));
int (*put) __P((const struct __db *, DBT *, const DBT *, u_int));
int (*seq) __P((const struct __db *, DBT *, DBT *, u_int));
1993-05-27 23:54:30 +04:00
int (*sync) __P((const struct __db *, u_int));
1993-04-19 01:48:37 +04:00
void *internal; /* access method private */
1993-03-21 12:45:37 +03:00
} DB;
#define BTREEMAGIC 0x053162
1993-04-19 01:48:37 +04:00
#define BTREEVERSION 3
1993-03-21 12:45:37 +03:00
1993-04-19 01:48:37 +04:00
/* Structure used to pass parameters to the btree routines. */
1993-03-21 12:45:37 +03:00
typedef struct {
#define R_DUP 0x01 /* duplicate keys */
1993-05-27 23:54:30 +04:00
u_long flags;
int cachesize; /* bytes to cache */
int maxkeypage; /* maximum keys per page */
int minkeypage; /* minimum keys per page */
int psize; /* page size */
1993-04-19 01:48:37 +04:00
/* comparison, prefix functions */
1993-05-27 23:54:30 +04:00
int (*compare) __P((const DBT *, const DBT *));
int (*prefix) __P((const DBT *, const DBT *));
int lorder; /* byte order */
1993-03-21 12:45:37 +03:00
} BTREEINFO;
#define HASHMAGIC 0x061561
1993-04-19 01:48:37 +04:00
#define HASHVERSION 2
1993-03-21 12:45:37 +03:00
1993-04-19 01:48:37 +04:00
/* Structure used to pass parameters to the hashing routines. */
1993-03-21 12:45:37 +03:00
typedef struct {
1993-05-27 23:54:30 +04:00
int bsize; /* bucket size */
int ffactor; /* fill factor */
int nelem; /* number of elements */
int cachesize; /* bytes to cache */
/* hash function */
int (*hash) __P((const void *, size_t));
int lorder; /* byte order */
1993-03-21 12:45:37 +03:00
} HASHINFO;
1993-04-19 01:48:37 +04:00
/* Structure used to pass parameters to the record routines. */
1993-03-21 12:45:37 +03:00
typedef struct {
#define R_FIXEDLEN 0x01 /* fixed-length records */
1993-04-19 01:48:37 +04:00
#define R_NOKEY 0x02 /* key not required */
#define R_SNAPSHOT 0x04 /* snapshot the input */
1993-05-27 23:54:30 +04:00
u_long flags;
int cachesize; /* bytes to cache */
int psize; /* page size */
int lorder; /* byte order */
size_t reclen; /* record length (fixed-length records) */
u_char bval; /* delimiting byte (variable-length records */
char *bfname; /* btree file name */
1993-03-21 12:45:37 +03:00
} RECNOINFO;
1993-04-19 01:48:37 +04:00
/*
* Little endian <==> big endian long swap macros.
* BLSWAP swap a memory location
* BLPSWAP swap a referenced memory location
* BLSWAP_COPY swap from one location to another
*/
1993-05-27 23:54:30 +04:00
#define BLSWAP(a) { \
u_long _tmp = a; \
((char *)&a)[0] = ((char *)&_tmp)[3]; \
((char *)&a)[1] = ((char *)&_tmp)[2]; \
((char *)&a)[2] = ((char *)&_tmp)[1]; \
((char *)&a)[3] = ((char *)&_tmp)[0]; \
}
#define BLPSWAP(a) { \
u_long _tmp = *(u_long *)a; \
((char *)a)[0] = ((char *)&_tmp)[3]; \
((char *)a)[1] = ((char *)&_tmp)[2]; \
((char *)a)[2] = ((char *)&_tmp)[1]; \
((char *)a)[3] = ((char *)&_tmp)[0]; \
}
#define BLSWAP_COPY(a, b) { \
((char *)&(b))[0] = ((char *)&(a))[3]; \
((char *)&(b))[1] = ((char *)&(a))[2]; \
((char *)&(b))[2] = ((char *)&(a))[1]; \
((char *)&(b))[3] = ((char *)&(a))[0]; \
}
1993-04-19 01:48:37 +04:00
/*
* Little endian <==> big endian short swap macros.
* BSSWAP swap a memory location
* BSPSWAP swap a referenced memory location
* BSSWAP_COPY swap from one location to another
*/
1993-05-27 23:54:30 +04:00
#define BSSWAP(a) { \
u_short _tmp = a; \
((char *)&a)[0] = ((char *)&_tmp)[1]; \
((char *)&a)[1] = ((char *)&_tmp)[0]; \
}
#define BSPSWAP(a) { \
u_short _tmp = *(u_short *)a; \
((char *)a)[0] = ((char *)&_tmp)[1]; \
((char *)a)[1] = ((char *)&_tmp)[0]; \
}
#define BSSWAP_COPY(a, b) { \
((char *)&(b))[0] = ((char *)&(a))[1]; \
((char *)&(b))[1] = ((char *)&(a))[0]; \
}
1993-03-21 12:45:37 +03:00
__BEGIN_DECLS
1993-04-19 01:48:37 +04:00
DB *dbopen __P((const char *, int, int, DBTYPE, const void *));
#ifdef __DBINTERFACE_PRIVATE
DB *__bt_open __P((const char *, int, int, const BTREEINFO *));
DB *__hash_open __P((const char *, int, int, const HASHINFO *));
DB *__rec_open __P((const char *, int, int, const RECNOINFO *));
void __dbpanic __P((DB *dbp));
#endif
1993-03-21 12:45:37 +03:00
__END_DECLS
#endif /* !_DB_H_ */