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