2001-06-15 15:08:37 +08:00
|
|
|
/* back-bdb.h - ldap ldbm back-end header file */
|
|
|
|
/* $OpenLDAP$ */
|
|
|
|
/*
|
2002-01-05 05:17:25 +08:00
|
|
|
* Copyright 2000-2002 The OpenLDAP Foundation, All Rights Reserved.
|
2001-06-15 15:08:37 +08:00
|
|
|
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _BDB_IDL_H_
|
|
|
|
#define _BDB_IDL_H_
|
|
|
|
|
|
|
|
#include <portable.h>
|
|
|
|
|
|
|
|
#include "slap.h"
|
|
|
|
|
2001-10-14 00:55:54 +08:00
|
|
|
/* IDL sizes - likely should be even bigger
|
|
|
|
* limiting factors: sizeof(ID), thread stack size
|
2002-01-31 08:10:24 +08:00
|
|
|
*
|
|
|
|
* Note: the -2 stuff is intended to reduce the size
|
|
|
|
* just enough to avoiding internal (to malloc) allocation
|
|
|
|
* of overly large blocks to provide the requested size.
|
|
|
|
* The stuff needs to be thought out better, doesn't deal
|
|
|
|
* well with mixed stack/malloc allocation of IDLs.
|
2001-10-14 00:55:54 +08:00
|
|
|
*/
|
2002-01-31 08:10:24 +08:00
|
|
|
#define BDB_IDL_DB_SIZE ((1<<16)-2) /* 32K IDL on disk */
|
|
|
|
#define BDB_IDL_UM_SIZE ((1<<17)-2) /* 64K IDL in memory */
|
2001-10-14 00:55:54 +08:00
|
|
|
#define BDB_IDL_UM_SIZEOF (BDB_IDL_UM_SIZE * sizeof(ID))
|
2001-07-31 12:30:11 +08:00
|
|
|
|
2002-01-31 08:10:24 +08:00
|
|
|
#define BDB_IDL_DB_MAX (BDB_IDL_DB_SIZE-2)
|
2001-06-15 15:08:37 +08:00
|
|
|
/* #define BDB_IDL_DB_ALLOC (BDB_IDL_DB_SIZE * sizeof(ID)) */
|
|
|
|
|
2002-01-31 08:10:24 +08:00
|
|
|
#define BDB_IDL_UM_MAX (BDB_IDL_UM_SIZE-2)
|
2001-10-14 00:55:54 +08:00
|
|
|
/* #define BDB_IDL_UM_ALLOC (BDB_IDL_UM_SIZE * sizeof(ID)) */
|
2001-06-15 15:08:37 +08:00
|
|
|
|
|
|
|
#define BDB_IDL_IS_RANGE(ids) ((ids)[0] == NOID)
|
2001-10-14 00:55:54 +08:00
|
|
|
#define BDB_IDL_RANGE_SIZE (3)
|
|
|
|
#define BDB_IDL_RANGE_SIZEOF (BDB_IDL_RANGE_SIZE * sizeof(ID))
|
2001-11-24 20:41:54 +08:00
|
|
|
#define BDB_IDL_SIZEOF(ids) ((BDB_IDL_IS_RANGE(ids) \
|
|
|
|
? BDB_IDL_RANGE_SIZE : ((ids)[0]+1)) * sizeof(ID))
|
2001-10-14 00:55:54 +08:00
|
|
|
|
|
|
|
#define BDB_IDL_RANGE_FIRST(ids) ((ids)[1])
|
|
|
|
#define BDB_IDL_RANGE_LAST(ids) ((ids)[2])
|
2001-06-15 15:08:37 +08:00
|
|
|
|
|
|
|
#define BDB_IDL_RANGE( ids, f, l ) \
|
|
|
|
do { \
|
|
|
|
(ids)[0] = NOID; \
|
|
|
|
(ids)[1] = (f); \
|
|
|
|
(ids)[2] = (l); \
|
|
|
|
} while(0)
|
|
|
|
|
|
|
|
#define BDB_IDL_ZERO(ids) \
|
|
|
|
do { \
|
|
|
|
(ids)[0] = 0; \
|
|
|
|
(ids)[1] = 0; \
|
|
|
|
(ids)[2] = 0; \
|
2001-10-14 00:55:54 +08:00
|
|
|
} while(0)
|
2001-06-15 15:08:37 +08:00
|
|
|
|
|
|
|
#define BDB_IDL_IS_ZERO(ids) ( (ids)[0] == 0 )
|
|
|
|
#define BDB_IDL_IS_ALL( range, ids ) ( (ids)[0] == NOID \
|
|
|
|
&& (ids)[1] <= (range)[1] && (range)[2] <= (ids)[2] )
|
|
|
|
|
2001-10-14 00:55:54 +08:00
|
|
|
#define BDB_IDL_CPY( dst, src ) (AC_MEMCPY( dst, src, BDB_IDL_SIZEOF( src ) ))
|
2001-06-15 15:08:37 +08:00
|
|
|
|
|
|
|
#define BDB_IDL_ID( bdb, ids, id ) BDB_IDL_RANGE( ids, id, ((bdb)->bi_lastid) )
|
|
|
|
#define BDB_IDL_ALL( bdb, ids ) BDB_IDL_RANGE( ids, 1, ((bdb)->bi_lastid) )
|
|
|
|
|
|
|
|
#define BDB_IDL_FIRST( ids ) ( ids[1] )
|
2001-10-03 03:04:12 +08:00
|
|
|
#define BDB_IDL_LAST( ids ) ( BDB_IDL_IS_RANGE(ids) \
|
|
|
|
? ids[2] : ids[ids[0]] )
|
|
|
|
|
|
|
|
#define BDB_IDL_N( ids ) ( BDB_IDL_IS_RANGE(ids) \
|
|
|
|
? (ids[2]-ids[1])+1 : ids[0] )
|
2001-06-15 15:08:37 +08:00
|
|
|
|
|
|
|
LDAP_BEGIN_DECL
|
|
|
|
LDAP_END_DECL
|
|
|
|
|
2001-07-31 12:24:29 +08:00
|
|
|
#endif
|