openldap/servers/slapd/back-bdb/proto-bdb.h
Howard Chu cc21d814b3 Use a single malloc'd block for all the temporary IDL storage in the
filter processing, to avoid runtime stack blowout. Also removes the
need for gigantic thread stacks.
2002-03-18 11:40:58 +00:00

335 lines
5.3 KiB
C

/* $OpenLDAP$ */
/*
* Copyright 2000-2002 The OpenLDAP Foundation, All Rights Reserved.
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
*/
#ifndef _PROTO_BDB_H
#define _PROTO_BDB_H
LDAP_BEGIN_DECL
/*
* alias.c
*/
Entry *bdb_deref_internal_r LDAP_P((
BackendDB *be,
Entry *e,
struct berval *dn,
int *err,
Entry **matched,
const char **text ));
#define deref_entry_r( be, e, err, matched, text ) \
bdb_deref_internal_r( be, e, NULL, err, matched, text )
#define deref_dn_r( be, dn, err, matched, text ) \
bdb_deref_internal_r( be, NULL, dn, err, matched, text)
/*
* attr.c
*/
void bdb_attr_mask( struct bdb_info *bdb,
AttributeDescription *desc,
slap_mask_t *indexmask );
int bdb_attr_index_config LDAP_P(( struct bdb_info *bdb,
const char *fname, int lineno,
int argc, char **argv ));
void bdb_attr_index_destroy LDAP_P(( Avlnode *tree ));
/*
* attribute.c
*/
BI_acl_attribute bdb_attribute;
/*
* dbcache.c
*/
int
bdb_db_cache(
Backend *be,
const char *name,
DB **db );
/*
* dn2entry.c
*/
int bdb_dn2entry_rw LDAP_P(( BackendDB *be, DB_TXN *tid,
struct berval *dn, Entry **e, Entry **matched, int flags, int rw ));
#define bdb_dn2entry_r(be, tid, dn, e, m, f) bdb_dn2entry_rw((be), (tid), (dn), (e), (m), (f), 0)
#define bdb_dn2entry_w(be, tid, dn, e, m, f) bdb_dn2entry_rw((be), (tid), (dn), (e), (m), (f), 1)
/*
* dn2id.c
*/
int bdb_dn2id(
BackendDB *be,
DB_TXN *tid,
struct berval *dn,
ID *id );
int bdb_dn2id_matched(
BackendDB *be,
DB_TXN *tid,
struct berval *dn,
ID *id,
ID *id2 );
int bdb_dn2id_add(
BackendDB *be,
DB_TXN *tid,
struct berval *pdn,
Entry *e );
int bdb_dn2id_delete(
BackendDB *be,
DB_TXN *tid,
char *pdn,
Entry *e );
int bdb_dn2id_children(
BackendDB *be,
DB_TXN *tid,
struct berval *dn );
int
bdb_dn2idl(
BackendDB *be,
struct berval *dn,
int prefix,
ID *ids );
/*
* entry.c
*/
int bdb_entry_return( Entry *e );
BI_entry_release_rw bdb_entry_release;
/*
* error.c
*/
void bdb_errcall( const char *pfx, char * msg );
/*
* filterentry.c
*/
int bdb_filter_candidates(
Backend *be,
Filter *f,
ID *ids,
ID *tmp,
ID *stack );
/*
* group.c
*/
BI_acl_group bdb_group;
/*
* id2entry.c
*/
int bdb_id2entry_add(
BackendDB *be,
DB_TXN *tid,
Entry *e );
int bdb_id2entry_update(
BackendDB *be,
DB_TXN *tid,
Entry *e );
int bdb_id2entry_delete(
BackendDB *be,
DB_TXN *tid,
Entry *e);
int bdb_id2entry_rw(
BackendDB *be,
DB_TXN *tid,
ID id,
Entry **e,
int rw );
#define bdb_id2entry_r(be, tid, id, e) bdb_id2entry_rw((be), (tid), (id), (e), 0)
#define bdb_id2entry_w(be, tid, id, e) bdb_id2entry_rw((be), (tid), (id), (e), 1)
void bdb_entry_free ( Entry *e );
/*
* idl.c
*/
unsigned bdb_idl_search( ID *ids, ID id );
int bdb_bt_compare(
DB *db,
const DBT *a,
const DBT *b );
int bdb_idl_fetch_key(
BackendDB *be,
DB *db,
DB_TXN *txn,
DBT *key,
ID *ids );
int bdb_idl_insert_key(
BackendDB *be,
DB *db,
DB_TXN *txn,
DBT *key,
ID id );
int bdb_idl_delete_key(
BackendDB *be,
DB *db,
DB_TXN *txn,
DBT *key,
ID id );
#if 0
int
bdb_idl_notin(
ID *a,
ID *b,
ID *ids );
#endif
int
bdb_idl_intersection(
ID *a,
ID *b );
int
bdb_idl_union(
ID *a,
ID *b );
ID bdb_idl_first( ID *ids, ID *cursor );
ID bdb_idl_next( ID *ids, ID *cursor );
/*
* index.c
*/
extern int
bdb_index_is_indexed LDAP_P((
Backend *be,
AttributeDescription *desc ));
extern int
bdb_index_param LDAP_P((
Backend *be,
AttributeDescription *desc,
int ftype,
DB **db,
slap_mask_t *mask,
struct berval *prefix ));
extern int
bdb_index_values LDAP_P((
Backend *be,
DB_TXN *txn,
AttributeDescription *desc,
BerVarray vals,
ID id,
int op ));
int bdb_index_entry LDAP_P(( Backend *be, DB_TXN *t,
int r, Entry *e, Attribute *ap ));
#define bdb_index_entry_add(be,t,e,ap) \
bdb_index_entry((be),(t),SLAP_INDEX_ADD_OP,(e),(ap))
#define bdb_index_entry_del(be,t,e,ap) \
bdb_index_entry((be),(t),SLAP_INDEX_DELETE_OP,(e),(ap))
/*
* init.c
*/
extern struct berval bdb_uuid;
/*
* key.c
*/
extern int
bdb_key_read(
Backend *be,
DB *db,
DB_TXN *txn,
struct berval *k,
ID *ids );
extern int
bdb_key_change(
Backend *be,
DB *db,
DB_TXN *txn,
struct berval *k,
ID id,
int op );
/*
* nextid.c
*/
int bdb_next_id( BackendDB *be, DB_TXN *tid, ID *id );
int bdb_last_id( BackendDB *be, DB_TXN *tid );
/*
* modify.c
*/
int bdb_modify_internal(
BackendDB *be,
Connection *conn,
Operation *op,
DB_TXN *tid,
Modifications *modlist,
Entry *e,
const char **text,
char *textbuf,
size_t textlen );
/*
* passwd.c
*/
BI_op_extended bdb_exop_passwd;
/*
* cache.c
*/
void bdb_cache_entry_commit( Entry *e );
void bdb_cache_return_entry_rw( Cache *cache, Entry *e, int rw );
#define bdb_cache_return_entry_r(c, e) bdb_cache_return_entry_rw((c), (e), 0)
#define bdb_cache_return_entry_w(c, e) bdb_cache_return_entry_rw((c), (e), 1)
int bdb_cache_add_entry_rw(
Cache *cache,
Entry *e,
int rw
);
int bdb_cache_update_entry(
Cache *cache,
Entry *e
);
ID bdb_cache_find_entry_ndn2id(
Backend *be,
Cache *cache,
struct berval *ndn
);
Entry* bdb_cache_find_entry_id(
Cache *cache,
ID id,
int rw
);
int bdb_cache_delete_entry(
Cache *cache,
Entry *e
);
void bdb_cache_release_all( Cache *cache );
LDAP_END_DECL
#endif /* _PROTO_BDB_H */