#ifndef BDB_HIER
int
bdb_dn2id_add(
- BackendDB *be,
+ Operation *op,
DB_TXN *txn,
- struct berval *pbv,
+ EntryInfo *eip,
Entry *e )
{
- struct bdb_info *bdb = (struct bdb_info *) be->be_private;
+ struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
DB *db = bdb->bi_dn2id->bdi_db;
int rc;
DBT key, data;
key.size = e->e_nname.bv_len + 2;
key.ulen = key.size;
key.flags = DB_DBT_USERMEM;
- buf = ch_malloc( key.size );
+ buf = op->o_tmpalloc( key.size, op->o_tmpmemctx );
key.data = buf;
buf[0] = DN_BASE_PREFIX;
ptr.bv_val = buf + 1;
}
#ifndef BDB_MULTIPLE_SUFFIXES
- if( !be_issuffix( be, &ptr )) {
+ if( !be_issuffix( op->o_bd, &ptr )) {
#endif
buf[0] = DN_SUBTREE_PREFIX;
rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
}
#ifdef BDB_MULTIPLE_SUFFIXES
- if( !be_issuffix( be, &ptr )) {
+ if( !be_issuffix( op->o_bd, &ptr )) {
#endif
dnParent( &ptr, &pdn );
key.data = pdn.bv_val-1;
ptr = pdn;
- rc = bdb_idl_insert_key( be, db, txn, &key, e->e_id );
+ rc = bdb_idl_insert_key( op->o_bd, db, txn, &key, e->e_id );
if( rc != 0 ) {
#ifdef NEW_LOGGING
#ifndef BDB_MULTIPLE_SUFFIXES
}
- while( !be_issuffix( be, &ptr )) {
+ while( !be_issuffix( op->o_bd, &ptr )) {
#else
for (;;) {
#endif
ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
- rc = bdb_idl_insert_key( be, db, txn, &key, e->e_id );
+ rc = bdb_idl_insert_key( op->o_bd, db, txn, &key, e->e_id );
if( rc != 0 ) {
#ifdef NEW_LOGGING
break;
}
#ifdef BDB_MULTIPLE_SUFFIXES
- if( be_issuffix( be, &ptr )) break;
+ if( be_issuffix( op->o_bd, &ptr )) break;
#endif
dnParent( &ptr, &pdn );
#endif
done:
- ch_free( buf );
+ op->o_tmpfree( buf, op->o_tmpmemctx );
#ifdef NEW_LOGGING
LDAP_LOG ( INDEX, RESULTS, "<= bdb_dn2id_add: %d\n", rc, 0, 0 );
#else
int
bdb_dn2id_delete(
- BackendDB *be,
+ Operation *op,
DB_TXN *txn,
- char *pdnc,
+ EntryInfo *eip,
Entry *e )
{
- struct bdb_info *bdb = (struct bdb_info *) be->be_private;
+ struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
DB *db = bdb->bi_dn2id->bdi_db;
int rc;
DBT key;
DBTzero( &key );
key.size = e->e_nname.bv_len + 2;
- buf = ch_malloc( key.size );
+ buf = op->o_tmpalloc( key.size, op->o_tmpmemctx );
key.data = buf;
key.flags = DB_DBT_USERMEM;
buf[0] = DN_BASE_PREFIX;
}
#ifndef BDB_MULTIPLE_SUFFIXES
- if( !be_issuffix( be, &ptr )) {
+ if( !be_issuffix( op->o_bd, &ptr )) {
#endif
buf[0] = DN_SUBTREE_PREFIX;
rc = db->del( db, txn, &key, 0 );
}
#ifdef BDB_MULTIPLE_SUFFIXES
- if( !be_issuffix( be, &ptr )) {
+ if( !be_issuffix( op->o_bd, &ptr )) {
#endif
dnParent( &ptr, &pdn );
key.data = pdn.bv_val - 1;
ptr = pdn;
- rc = bdb_idl_delete_key( be, db, txn, &key, e->e_id );
+ rc = bdb_idl_delete_key( op->o_bd, db, txn, &key, e->e_id );
if( rc != 0 ) {
#ifdef NEW_LOGGING
#ifndef BDB_MULTIPLE_SUFFIXES
}
- while( !be_issuffix( be, &ptr )) {
+ while( !be_issuffix( op->o_bd, &ptr )) {
#else
for (;;) {
#endif
ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
- rc = bdb_idl_delete_key( be, db, txn, &key, e->e_id );
+ rc = bdb_idl_delete_key( op->o_bd, db, txn, &key, e->e_id );
if( rc != 0 ) {
#ifdef NEW_LOGGING
LDAP_LOG ( INDEX, ERR,
goto done;
}
#ifdef BDB_MULTIPLE_SUFFIXES
- if( be_issuffix( be, &ptr )) break;
+ if( be_issuffix( op->o_bd, &ptr )) break;
#endif
dnParent( &ptr, &pdn );
#endif
done:
- ch_free( buf );
+ op->o_tmpfree( buf, op->o_tmpmemctx );
#ifdef NEW_LOGGING
LDAP_LOG ( INDEX, RESULTS, "<= bdb_dn2id_delete %d\n", rc, 0, 0 );
#else
int
bdb_dn2id(
- BackendDB *be,
+ Operation *op,
DB_TXN *txn,
struct berval *dn,
- ID *id,
- void *ctx )
+ EntryInfo *ei )
{
int rc;
DBT key, data;
- struct bdb_info *bdb = (struct bdb_info *) be->be_private;
+ struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
DB *db = bdb->bi_dn2id->bdi_db;
#ifdef NEW_LOGGING
#else
Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id( \"%s\" )\n", dn->bv_val, 0, 0 );
#endif
-
- assert (id);
-
DBTzero( &key );
key.size = dn->bv_len + 2;
- key.data = sl_malloc( key.size, ctx );
+ key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
((char *)key.data)[0] = DN_BASE_PREFIX;
AC_MEMCPY( &((char *)key.data)[1], dn->bv_val, key.size - 1 );
/* store the ID */
DBTzero( &data );
- data.data = id;
+ data.data = &ei->bei_id;
data.ulen = sizeof(ID);
data.flags = DB_DBT_USERMEM;
} else {
#ifdef NEW_LOGGING
LDAP_LOG ( INDEX, RESULTS,
- "<= bdb_dn2id: got id=0x%08lx\n", *id, 0, 0 );
+ "<= bdb_dn2id: got id=0x%08lx\n", ei->bei_id, 0, 0 );
#else
Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: got id=0x%08lx\n",
- *id, 0, 0 );
+ ei->bei_id, 0, 0 );
#endif
}
- sl_free( key.data, ctx );
+ op->o_tmpfree( key.data, op->o_tmpmemctx );
return rc;
}
DB_TXN *txn,
Entry *e )
{
+ DBT key, data;
+ struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
+ DB *db = bdb->bi_dn2id->bdi_db;
+ ID id;
int rc;
#ifdef NEW_LOGGING
Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_children( %s )\n",
e->e_nname.bv_val, 0, 0 );
#endif
-
- if ( BEI(e)->bei_kids ) {
- rc = 0;
- }
- if ( BEI(e)->bei_state & CACHE_ENTRY_NO_KIDS ) {
- rc = DB_NOTFOUND;
- } else {
-
- DBT key, data;
- struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
- DB *db = bdb->bi_dn2id->bdi_db;
- ID id;
-
DBTzero( &key );
key.size = e->e_nname.bv_len + 2;
- key.data = sl_malloc( key.size, op->o_tmpmemctx );
+ key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
((char *)key.data)[0] = DN_ONE_PREFIX;
AC_MEMCPY( &((char *)key.data)[1], e->e_nname.bv_val, key.size - 1 );
+#ifdef SLAP_IDL_CACHE
+ if ( bdb->bi_idl_cache_size ) {
+ rc = bdb_idl_cache_get( bdb, db, &key, NULL );
+ if ( rc != LDAP_NO_SUCH_OBJECT ) {
+ op->o_tmpfree( key.data, op->o_tmpmemctx );
+ return rc;
+ }
+ }
+#endif
/* we actually could do a empty get... */
DBTzero( &data );
data.data = &id;
data.dlen = sizeof(id);
rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
- sl_free( key.data, op->o_tmpmemctx );
-
- if ( rc == DB_NOTFOUND ) {
- BEI(e)->bei_state |= CACHE_ENTRY_NO_KIDS;
- }
-
- }
+ op->o_tmpfree( key.data, op->o_tmpmemctx );
#ifdef NEW_LOGGING
LDAP_LOG ( INDEX, DETAIL1,
int
bdb_dn2idl(
- BackendDB *be,
- struct berval *dn,
- int prefix,
- ID *ids )
+ Operation *op,
+ Entry *e,
+ ID *ids,
+ ID *stack )
{
int rc;
DBT key;
- struct bdb_info *bdb = (struct bdb_info *) be->be_private;
+ struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
DB *db = bdb->bi_dn2id->bdi_db;
+ int prefix = op->ors_scope == LDAP_SCOPE_SUBTREE ? DN_SUBTREE_PREFIX :
+ DN_ONE_PREFIX;
#ifdef NEW_LOGGING
LDAP_LOG ( INDEX, ARGS,
- "=> bdb_dn2ididl( \"%s\" )\n", dn->bv_val, 0, 0 );
+ "=> bdb_dn2ididl( \"%s\" )\n", e->e_nname.bv_val, 0, 0 );
#else
- Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2idl( \"%s\" )\n", dn->bv_val, 0, 0 );
+ Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2idl( \"%s\" )\n", e->e_nname.bv_val, 0, 0 );
#endif
#ifndef BDB_MULTIPLE_SUFFIXES
- if (prefix == DN_SUBTREE_PREFIX && be_issuffix(be, dn))
+ if (prefix == DN_SUBTREE_PREFIX && BEI(e)->bei_parent->bei_id == 0 )
{
BDB_IDL_ALL(bdb, ids);
return 0;
#endif
DBTzero( &key );
- key.size = dn->bv_len + 2;
+ key.size = e->e_nname.bv_len + 2;
key.ulen = key.size;
key.flags = DB_DBT_USERMEM;
- key.data = ch_malloc( key.size );
+ key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
((char *)key.data)[0] = prefix;
- AC_MEMCPY( &((char *)key.data)[1], dn->bv_val, key.size - 1 );
+ AC_MEMCPY( &((char *)key.data)[1], e->e_nname.bv_val, key.size - 1 );
- rc = bdb_idl_fetch_key( be, db, NULL, &key, ids );
+ rc = bdb_idl_fetch_key( op->o_bd, db, NULL, &key, ids );
if( rc != 0 ) {
#ifdef NEW_LOGGING
#endif
}
- ch_free( key.data );
+ op->o_tmpfree( key.data, op->o_tmpmemctx );
return rc;
}
#else /* BDB_HIER */
-/* Experimental management routines for a hierarchically structured backend.
+/* Experimental management routines for a hierarchically structured database.
*
* Unsupported! Use at your own risk!
+ * -- Howard Chu, Symas Corp. 2003.
+ *
+ * Instead of a ldbm-style dn2id database, we use a hierarchical one. Each
+ * entry in this database is a struct diskNode, keyed by entryID and with
+ * the data containing the RDN and entryID of the node's children. We use
+ * a B-Tree with sorted duplicates to store all the children of a node under
+ * the same key. Also, the first item under the key contains the entry's own
+ * rdn and the ID of the node's parent, to allow bottom-up tree traversal as
+ * well as top-down. To keep this info first in the list, the nrdnlen is set
+ * to the negative of its value.
*
- * Instead of a dn2id database, we use an id2parent database. Each entry in
- * this database is a struct diskNode, containing the ID of the node's parent
- * and the RDN of the node.
+ * The diskNode is a variable length structure. This definition is not
+ * directly usable for in-memory manipulation.
*/
typedef struct diskNode {
- ID parent;
- struct berval rdn;
- struct berval nrdn;
+ ID entryID;
+ short nrdnlen;
+ char nrdn[1];
+ char rdn[1];
} diskNode;
-/* In bdb_db_open() we call bdb_build_tree() which reads the entire id2parent
- * database into memory (into an AVL tree). Next we iterate through each node
- * of this tree, connecting each child to its parent. The nodes in this AVL
- * tree are a struct idNode. The immediate (Onelevel) children of a node are
- * referenced in the i_kids AVL tree. With this arrangement, there is no need
- * to maintain the DN_ONE_PREFIX or DN_SUBTREE_PREFIX database keys. Note that
- * the DN of an entry is constructed by walking up the list of i_parent
- * pointers, so no full DN is stored on disk anywhere. This makes modrdn
- * extremely efficient, even when operating on a populated subtree.
- *
- * The idNode tree is searched directly from the root when performing id to
- * entry lookups. The tree is traversed using the i_kids subtrees when
- * performing dn to id lookups.
- */
-typedef struct idNode {
- ID i_id;
- struct idNode *i_parent;
- diskNode *i_rdn;
- Avlnode *i_kids;
- ldap_pvt_thread_rdwr_t i_kids_rdwr;
-} idNode;
-
-
-/* The main AVL tree is sorted in ID order. The i_kids AVL trees are
- * sorted in lexical order. These are the various helper routines used
- * for the searches and sorts.
+/* Sort function for the sorted duplicate data items of a dn2id key.
+ * Sorts based on normalized RDN, in length order.
*/
-static int
-node_find_cmp(
- const void *id,
- const void *node
-)
-{
- return *(const ID *)id - ((const idNode *)node)->i_id;
-}
-
-static int
-node_frdn_cmp(
- const void *v_nrdn,
- const void *v_n
-)
-{
- const struct berval *nrdn = v_nrdn;
- const idNode *n = v_n;
- return ber_bvcmp(nrdn, &n->i_rdn->nrdn);
-}
-
-static int
-node_add_cmp(
- const void *v_a,
- const void *v_b
-)
-{
- const idNode *a = v_a, *b = v_b;
- return a->i_id - b->i_id;
-}
-
-static int
-node_rdn_cmp(
- const void *v_a,
- const void *v_b
-)
-{
- const idNode *a = v_a, *b = v_b;
- /* should be slightly better without ordering drawbacks */
- return ber_bvcmp(&a->i_rdn->nrdn, &b->i_rdn->nrdn);
-}
-
-idNode * bdb_find_id_node(
- ID id,
- Avlnode *tree
-)
-{
- return avl_find(tree, &id, node_find_cmp);
-}
-
-idNode * bdb_find_rdn_node(
- struct berval *nrdn,
- Avlnode *tree
-)
-{
- return avl_find(tree, nrdn, node_frdn_cmp);
-}
-
-/* This function links a node into its parent's i_kids tree. */
-static int bdb_insert_kid(
- void *v_a,
- void *v_tree
+int
+hdb_dup_compare(
+ DB *db,
+ const DBT *usrkey,
+ const DBT *curkey
)
{
- idNode *a = v_a;
- Avlnode *tree = v_tree;
- int rc;
-
- if (a->i_rdn->parent == 0)
- return 0;
- a->i_parent = bdb_find_id_node(a->i_rdn->parent, tree);
- if (!a->i_parent)
- return -1;
- ldap_pvt_thread_rdwr_wlock(&a->i_parent->i_kids_rdwr);
- rc = avl_insert( &a->i_parent->i_kids, (caddr_t) a,
- node_rdn_cmp, avl_dup_error );
- ldap_pvt_thread_rdwr_wunlock(&a->i_parent->i_kids_rdwr);
- return rc;
-}
+ char *u = (char *)&(((diskNode *)(usrkey->data))->nrdnlen);
+ char *c = (char *)&(((diskNode *)(curkey->data))->nrdnlen);
+ int rc, i;
-/* This function adds a node into the main AVL tree */
-idNode *bdb_add_node(
- ID id,
- char *d,
- struct bdb_info *bdb
-)
-{
- idNode *node;
-
- node = (idNode *)ch_malloc(sizeof(idNode));
- node->i_id = id;
- node->i_parent = NULL;
- node->i_kids = NULL;
- node->i_rdn = (diskNode *)d;
- node->i_rdn->rdn.bv_val += (long)d;
- node->i_rdn->nrdn.bv_val += (long)d;
- ldap_pvt_thread_rdwr_init(&node->i_kids_rdwr);
- avl_insert( &bdb->bi_tree, (caddr_t) node, node_add_cmp, avl_dup_error );
- if (id == 1)
- bdb->bi_troot = node;
- return node;
+ /* data is not aligned, cannot compare directly */
+#ifdef WORDS_BIGENDIAN
+ for( i = 0; i < (int)sizeof(short); i++)
+#else
+ for( i = sizeof(short)-1; i >= 0; i--)
+#endif
+ {
+ rc = u[i] - c[i];
+ if( rc ) return rc;
+ }
+ return strcmp( u+sizeof(short), c+sizeof(short) );
}
-/* This function initializes the trees at startup time. */
-int bdb_build_tree(
- Backend *be
+/* This function constructs a full DN for a given entry.
+ */
+int hdb_fix_dn(
+ Entry *e,
+ int checkit
)
{
- struct bdb_info *bdb = (struct bdb_info *) be->be_private;
- int rc;
- DBC *cursor;
- DBT key, data;
- ID id;
- idNode *node;
-
- bdb->bi_tree = NULL;
+ EntryInfo *ei;
+ int rlen = 0, nrlen = 0;
+ char *ptr, *nptr;
+ int max = 0;
- rc = bdb->bi_id2parent->bdi_db->cursor(
- bdb->bi_id2parent->bdi_db, NULL, &cursor,
- bdb->bi_db_opflags );
- if( rc != 0 ) {
- return NOID;
+ /* count length of all DN components */
+ for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
+ rlen += ei->bei_rdn.bv_len + 1;
+ nrlen += ei->bei_nrdn.bv_len + 1;
+ if (ei->bei_modrdns > max) max = ei->bei_modrdns;
}
- DBTzero( &key );
- DBTzero( &data );
- key.data = (char *)&id;
- key.ulen = sizeof( id );
- key.flags = DB_DBT_USERMEM;
- data.flags = DB_DBT_MALLOC;
-
- while (cursor->c_get( cursor, &key, &data, DB_NEXT ) == 0) {
- bdb_add_node( id, data.data, bdb );
+ /* See if the entry DN was invalidated by a subtree rename */
+ if ( checkit ) {
+ if ( BEI(e)->bei_modrdns >= max ) {
+ return 0;
+ }
+ /* We found a mismatch, tell the caller to lock it */
+ if ( checkit == 1 ) {
+ return 1;
+ }
+ /* checkit == 2. do the fix. */
+ free( e->e_name.bv_val );
+ free( e->e_nname.bv_val );
}
- cursor->c_close( cursor );
-
- rc = avl_apply(bdb->bi_tree, bdb_insert_kid, bdb->bi_tree,
- -1, AVL_INORDER );
-
- return rc;
-}
-/* This function constructs a full DN for a given id. We really should
- * be passing idNodes directly, to save some effort...
- */
-int bdb_fix_dn(
- BackendDB *be,
- ID id,
- Entry *e
-)
-{
- struct bdb_info *bdb = (struct bdb_info *) be->be_private;
- idNode *n, *o;
- int rlen, nrlen;
- char *ptr, *nptr;
-
- ldap_pvt_thread_rdwr_rlock(&bdb->bi_tree_rdwr);
- o = bdb_find_id_node(id, bdb->bi_tree);
- rlen = be->be_suffix[0].bv_len + 1;
- nrlen = be->be_nsuffix[0].bv_len + 1;
- for (n = o; n && n->i_parent; n=n->i_parent) {
- rlen += n->i_rdn->rdn.bv_len + 1;
- nrlen += n->i_rdn->nrdn.bv_len + 1;
- }
e->e_name.bv_len = rlen - 1;
e->e_nname.bv_len = nrlen - 1;
- e->e_name.bv_val = ch_malloc(rlen + nrlen);
- e->e_nname.bv_val = e->e_name.bv_val + rlen;
+ e->e_name.bv_val = ch_malloc(rlen);
+ e->e_nname.bv_val = ch_malloc(nrlen);
ptr = e->e_name.bv_val;
nptr = e->e_nname.bv_val;
- for (n = o; n && n->i_parent; n=n->i_parent) {
- ptr = lutil_strcopy(ptr, n->i_rdn->rdn.bv_val);
- *ptr++ = ',';
- nptr = lutil_strcopy(nptr, n->i_rdn->nrdn.bv_val);
- *nptr++ = ',';
+ for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
+ ptr = lutil_strcopy(ptr, ei->bei_rdn.bv_val);
+ nptr = lutil_strcopy(nptr, ei->bei_nrdn.bv_val);
+ if ( ei->bei_parent ) {
+ *ptr++ = ',';
+ *nptr++ = ',';
+ }
}
- ldap_pvt_thread_rdwr_runlock(&bdb->bi_tree_rdwr);
-
- strcpy(ptr, be->be_suffix[0].bv_val);
- strcpy(nptr, be->be_nsuffix[0].bv_val);
+ BEI(e)->bei_modrdns = max;
+ ptr[-1] = '\0';
+ nptr[-1] = '\0';
return 0;
}
+/* We add two elements to the DN2ID database - a data item under the parent's
+ * entryID containing the child's RDN and entryID, and an item under the
+ * child's entryID containing the parent's entryID.
+ */
int
-bdb_dn2id_add(
- BackendDB *be,
+hdb_dn2id_add(
+ Operation *op,
DB_TXN *txn,
- struct berval *pdn,
+ EntryInfo *eip,
Entry *e )
{
- struct bdb_info *bdb = (struct bdb_info *) be->be_private;
- int rc, rlen, nrlen;
+ struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
+ DB *db = bdb->bi_dn2id->bdi_db;
DBT key, data;
- DB *db = bdb->bi_id2parent->bdi_db;
+ int rc, rlen, nrlen;
diskNode *d;
- idNode *n;
+ char *ptr;
- nrlen = dn_rdnlen( be, &e->e_nname );
+ nrlen = dn_rdnlen( op->o_bd, &e->e_nname );
if (nrlen) {
- rlen = dn_rdnlen( be, &e->e_name );
- } else {
- rlen = 0;
- }
-
- d = ch_malloc(sizeof(diskNode) + rlen + nrlen + 2);
- d->rdn.bv_len = rlen;
- d->nrdn.bv_len = nrlen;
- d->rdn.bv_val = (char *)(d+1);
- d->nrdn.bv_val = d->rdn.bv_val + rlen + 1;
- strncpy(d->rdn.bv_val, e->e_dn, rlen);
- d->rdn.bv_val[rlen] = '\0';
- strncpy(d->nrdn.bv_val, e->e_ndn, nrlen);
- d->nrdn.bv_val[nrlen] = '\0';
- d->rdn.bv_val -= (long)d;
- d->nrdn.bv_val -= (long)d;
-
- if (pdn->bv_len) {
- bdb_dn2id(be, txn, pdn, &d->parent, 0);
+ rlen = dn_rdnlen( op->o_bd, &e->e_name );
} else {
- d->parent = 0;
+ nrlen = e->e_nname.bv_len;
+ rlen = e->e_name.bv_len;
}
+ d = op->o_tmpalloc(sizeof(diskNode) + rlen + nrlen, op->o_tmpmemctx);
+ d->entryID = e->e_id;
+ d->nrdnlen = nrlen;
+ ptr = lutil_strncopy( d->nrdn, e->e_nname.bv_val, nrlen );
+ *ptr++ = '\0';
+ ptr = lutil_strncopy( ptr, e->e_name.bv_val, rlen );
+ *ptr = '\0';
+
DBTzero(&key);
DBTzero(&data);
- key.data = &e->e_id;
+ key.data = &eip->bei_id;
key.size = sizeof(ID);
key.flags = DB_DBT_USERMEM;
+#ifdef SLAP_IDL_CACHE
+ if ( bdb->bi_idl_cache_size ) {
+ bdb_idl_cache_del( bdb, db, &key );
+ }
+#endif
data.data = d;
- data.size = sizeof(diskNode) + rlen + nrlen + 2;
+ data.size = sizeof(diskNode) + rlen + nrlen;
data.flags = DB_DBT_USERMEM;
- rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
+ rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
if (rc == 0) {
- ldap_pvt_thread_rdwr_wlock(&bdb->bi_tree_rdwr);
- n = bdb_add_node( e->e_id, data.data, bdb);
- ldap_pvt_thread_rdwr_wunlock(&bdb->bi_tree_rdwr);
-
- if (d->parent) {
- ldap_pvt_thread_rdwr_rlock(&bdb->bi_tree_rdwr);
- bdb_insert_kid(n, bdb->bi_tree);
- ldap_pvt_thread_rdwr_runlock(&bdb->bi_tree_rdwr);
- }
- } else {
- free(d);
+ key.data = &e->e_id;
+ d->entryID = eip->bei_id;
+ d->nrdnlen = 0 - nrlen;
+
+ rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
}
+
+ op->o_tmpfree( d, op->o_tmpmemctx );
+
return rc;
}
int
-bdb_dn2id_delete(
- BackendDB *be,
+hdb_dn2id_delete(
+ Operation *op,
DB_TXN *txn,
- char *pdn,
+ EntryInfo *eip,
Entry *e )
{
- struct bdb_info *bdb = (struct bdb_info *) be->be_private;
- int rc;
- DBT key;
- DB *db = bdb->bi_id2parent->bdi_db;
- idNode *n;
+ struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
+ DB *db = bdb->bi_dn2id->bdi_db;
+ DBT key, data;
+ DBC *cursor;
+ diskNode *d;
+ int rc, nrlen;
DBTzero(&key);
- key.size = sizeof(e->e_id);
- key.data = &e->e_id;
+ key.size = sizeof(ID);
+ key.ulen = key.size;
+ key.data = &eip->bei_id;
+ key.flags = DB_DBT_USERMEM;
+
+ DBTzero(&data);
+ data.size = sizeof(diskNode) + BEI(e)->bei_nrdn.bv_len;
+ data.ulen = data.size;
+ data.dlen = data.size;
+ data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
+
+#ifdef SLAP_IDL_CACHE
+ if ( bdb->bi_idl_cache_size ) {
+ bdb_idl_cache_del( bdb, db, &key );
+ }
+#endif
+ rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
+ if ( rc ) return rc;
- rc = db->del( db, txn, &key, 0);
+ d = op->o_tmpalloc( data.size, op->o_tmpmemctx );
+ d->entryID = e->e_id;
+ d->nrdnlen = BEI(e)->bei_nrdn.bv_len;
+ strcpy( d->nrdn, BEI(e)->bei_nrdn.bv_val );
+ data.data = d;
- ldap_pvt_thread_rdwr_wlock(&bdb->bi_tree_rdwr);
- n = avl_delete(&bdb->bi_tree, &e->e_id, node_find_cmp);
- if (n) {
- if (n->i_parent) {
- ldap_pvt_thread_rdwr_wlock(&n->i_parent->i_kids_rdwr);
- avl_delete(&n->i_parent->i_kids, &n->i_rdn->nrdn, node_frdn_cmp);
- ldap_pvt_thread_rdwr_wunlock(&n->i_parent->i_kids_rdwr);
- }
- free(n->i_rdn);
- ldap_pvt_thread_rdwr_destroy(&n->i_kids_rdwr);
- free(n);
+ /* Delete our ID from the parent's list */
+ rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH | DB_RMW );
+ if ( rc == 0 )
+ rc = cursor->c_del( cursor, 0 );
+
+ /* Delete our ID from the tree. With sorted duplicates, this
+ * will leave any child nodes still hanging around. This is OK
+ * for modrdn, which will add our info back in later.
+ */
+ if ( rc == 0 ) {
+ key.data = &e->e_id;
+ rc = cursor->c_get( cursor, &key, &data, DB_SET | DB_RMW );
+ if ( rc == 0 )
+ rc = cursor->c_del( cursor, 0 );
}
- if (e->e_id == 1)
- bdb->bi_troot = NULL;
- ldap_pvt_thread_rdwr_wunlock(&bdb->bi_tree_rdwr);
+ cursor->c_close( cursor );
+ op->o_tmpfree( d, op->o_tmpmemctx );
return rc;
}
+
int
-bdb_dn2id_matched(
- BackendDB *be,
+hdb_dn2id(
+ Operation *op,
DB_TXN *txn,
struct berval *in,
- ID *id,
- ID *id2,
- int flags )
+ EntryInfo *ei )
{
- struct bdb_info *bdb = (struct bdb_info *) be->be_private;
- struct berval rdn;
- char *p1, *p2;
- idNode *n, *p;
- int rc = 0;
+ struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
+ DB *db = bdb->bi_dn2id->bdi_db;
+ DBT key, data;
+ DBC *cursor;
+ int rc = 0, nrlen;
+ diskNode *d;
+ char *ptr;
+ ID idp = ei->bei_parent->bei_id;
- if (!bdb->bi_troot)
- return DB_NOTFOUND;
+ nrlen = dn_rdnlen( op->o_bd, in );
+ if (!nrlen) nrlen = in->bv_len;
- p = bdb->bi_troot;
- if (be_issuffix(be, in)) {
- *id = p->i_id;
- return 0;
- }
+ DBTzero(&key);
+ key.size = sizeof(ID);
+ key.data = &idp;
+ key.ulen = sizeof(ID);
+ key.flags = DB_DBT_USERMEM;
- p1 = in->bv_val + in->bv_len - be->be_nsuffix[0].bv_len - 1;
+ DBTzero(&data);
+ data.size = sizeof(diskNode) + nrlen;
+ data.ulen = data.size * 3;
+ data.flags = DB_DBT_USERMEM;
- n = p;
- ldap_pvt_thread_rdwr_rlock(&bdb->bi_tree_rdwr);
- for (;;) {
- for (p2 = p1-1; (p2 >= in->bv_val) && !DN_SEPARATOR(*p2); p2--);
- rdn.bv_val = p2+1;
- rdn.bv_len = p1-rdn.bv_val;
- p1 = p2;
-
- ldap_pvt_thread_rdwr_rlock(&p->i_kids_rdwr);
- n = bdb_find_rdn_node(&rdn, p->i_kids);
- ldap_pvt_thread_rdwr_runlock(&p->i_kids_rdwr);
- if (!n || p2 < in->bv_val) break;
- p = n;
- }
- ldap_pvt_thread_rdwr_runlock(&bdb->bi_tree_rdwr);
-
- if (n) {
- *id = n->i_id;
- } else if (id2) {
- *id2 = p->i_id;
- } else {
- rc = DB_NOTFOUND;
+ rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
+ if ( rc ) return rc;
+
+ d = op->o_tmpalloc( data.size * 3, op->o_tmpmemctx );
+ d->nrdnlen = nrlen;
+ ptr = lutil_strncopy( d->nrdn, in->bv_val, nrlen );
+ *ptr = '\0';
+ data.data = d;
+
+ rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH );
+ if ( rc == 0 ) {
+ ei->bei_id = d->entryID;
+ ei->bei_rdn.bv_len = data.size - sizeof(diskNode) - nrlen;
+ ptr = d->nrdn + nrlen + 1;
+ ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
+ if ( !ei->bei_parent->bei_dkids ) {
+ db_recno_t dkids;
+ /* How many children does the parent have? */
+ /* FIXME: do we need to lock the parent
+ * entryinfo? Seems safe...
+ */
+ cursor->c_count( cursor, &dkids, 0 );
+ ei->bei_parent->bei_dkids = dkids;
+ }
}
+ cursor->c_close( cursor );
+ op->o_tmpfree( d, op->o_tmpmemctx );
return rc;
}
int
-bdb_dn2id(
- BackendDB *be,
+hdb_dn2id_parent(
+ Operation *op,
DB_TXN *txn,
- struct berval *dn,
- ID *id,
- int flags )
+ EntryInfo *ei,
+ ID *idp )
{
- return bdb_dn2id_matched(be, txn, dn, id, NULL, flags);
+ struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
+ DB *db = bdb->bi_dn2id->bdi_db;
+ DBT key, data;
+ DBC *cursor;
+ int rc = 0;
+ diskNode *d;
+ char *ptr;
+ unsigned char *pt2;
+
+ DBTzero(&key);
+ key.size = sizeof(ID);
+ key.data = &ei->bei_id;
+ key.ulen = sizeof(ID);
+ key.flags = DB_DBT_USERMEM;
+
+ DBTzero(&data);
+ data.flags = DB_DBT_USERMEM;
+
+ rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
+ if ( rc ) return rc;
+
+ data.ulen = sizeof(diskNode) + (SLAP_LDAPDN_MAXLEN * 2);
+ d = op->o_tmpalloc( data.ulen, op->o_tmpmemctx );
+ data.data = d;
+
+ rc = cursor->c_get( cursor, &key, &data, DB_SET );
+ if ( rc == 0 ) {
+ if (d->nrdnlen >= 0) {
+ rc = LDAP_OTHER;
+ } else {
+ db_recno_t dkids;
+ *idp = d->entryID;
+ ei->bei_nrdn.bv_len = 0 - d->nrdnlen;
+ ber_str2bv( d->nrdn, ei->bei_nrdn.bv_len, 1, &ei->bei_nrdn );
+ ei->bei_rdn.bv_len = data.size - sizeof(diskNode) -
+ ei->bei_nrdn.bv_len;
+ ptr = d->nrdn + ei->bei_nrdn.bv_len + 1;
+ ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
+ /* How many children does this node have? */
+ cursor->c_count( cursor, &dkids, 0 );
+ ei->bei_dkids = dkids;
+ }
+ }
+ cursor->c_close( cursor );
+ op->o_tmpfree( d, op->o_tmpmemctx );
+ return rc;
}
int
-bdb_dn2id_children(
- BackendDB *be,
+hdb_dn2id_children(
+ Operation *op,
DB_TXN *txn,
- struct berval *dn,
- int flags )
+ Entry *e )
{
+ struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
+ DB *db = bdb->bi_dn2id->bdi_db;
+ DBT key, data;
+ DBC *cursor;
int rc;
- struct bdb_info *bdb = (struct bdb_info *) be->be_private;
ID id;
- idNode *n;
-
- rc = bdb_dn2id(be, txn, dn, &id, flags);
- if (rc != 0)
- return rc;
+ diskNode d;
- ldap_pvt_thread_rdwr_rlock(&bdb->bi_tree_rdwr);
- n = bdb_find_id_node(id, bdb->bi_tree);
- ldap_pvt_thread_rdwr_runlock(&bdb->bi_tree_rdwr);
+ DBTzero(&key);
+ key.size = sizeof(ID);
+ key.data = &e->e_id;
+ key.flags = DB_DBT_USERMEM;
- if (!n->i_kids)
- return DB_NOTFOUND;
- else
- return 0;
+#ifdef SLAP_IDL_CACHE
+ if ( bdb->bi_idl_cache_size ) {
+ rc = bdb_idl_cache_get( bdb, db, &key, NULL );
+ if ( rc != LDAP_NO_SUCH_OBJECT ) {
+ return rc;
+ }
+ }
+#endif
+ DBTzero(&data);
+ data.data = &d;
+ data.ulen = sizeof(d);
+ data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
+ data.dlen = sizeof(d);
+
+ rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
+ if ( rc ) return rc;
+
+ rc = cursor->c_get( cursor, &key, &data, DB_SET );
+ if ( rc == 0 ) {
+ db_recno_t dkids;
+ rc = cursor->c_count( cursor, &dkids, 0 );
+ if ( rc == 0 ) {
+ BEI(e)->bei_dkids = dkids;
+ if ( dkids < 2 ) rc = DB_NOTFOUND;
+ }
+ }
+ cursor->c_close( cursor );
+ return rc;
}
-/* Since we don't store IDLs for onelevel or subtree, we have to construct
- * them on the fly... Perhaps the i_kids tree ought to just be an IDL?
+/* bdb_dn2idl:
+ * We can't just use bdb_idl_fetch_key because
+ * 1 - our data items are longer than just an entry ID
+ * 2 - our data items are sorted alphabetically by nrdn, not by ID.
+ *
+ * We descend the tree recursively, so we define this cookie
+ * to hold our necessary state information. The bdb_dn2idl_internal
+ * function uses this cookie when calling itself.
*/
+
+struct dn2id_cookie {
+ struct bdb_info *bdb;
+ DB *db;
+ int prefix;
+ int rc;
+ EntryInfo *ei;
+ ID id;
+ ID dbuf;
+ ID *ids;
+ void *ptr;
+ ID tmp[BDB_IDL_DB_SIZE];
+ ID *buf;
+ DBT key;
+ DBT data;
+ DBC *dbc;
+ Operation *op;
+};
+
+/* Stuff for iterating over a bei_kids AVL tree and adding the
+ * IDs to an IDL
+ */
+struct apply_arg {
+ ID *idl;
+ EntryInfo **ei;
+};
+
static int
-insert_one(
- void *v_n,
- void *v_ids
-)
+apply_func(
+ void *data,
+ void *arg )
{
- idNode *n = v_n;
- ID *ids = v_ids;
- return bdb_idl_insert(ids, n->i_id);
+ EntryInfo *ei = data;
+ struct apply_arg *ap = arg;
+
+ bdb_idl_insert( ap->idl, ei->bei_id );
+ if ( ap->ei ) {
+ *(ap->ei)++ = ei;
+ }
+ return 0;
}
static int
-insert_sub(
- void *v_n,
- void *v_ids
+hdb_dn2idl_internal(
+ struct dn2id_cookie *cx
)
{
- idNode *n = v_n;
- ID *ids = v_ids;
- int rc;
+ EntryInfo **eilist = NULL, **ptr;
+#ifdef SLAP_IDL_CACHE
+ if ( cx->bdb->bi_idl_cache_size ) {
+ cx->rc = bdb_idl_cache_get(cx->bdb, cx->db, &cx->key, cx->tmp);
+ if ( cx->rc == DB_NOTFOUND ) {
+ return cx->rc;
+ }
+ if ( cx->rc == LDAP_SUCCESS ) {
+ goto gotit;
+ }
+ }
+#endif
+ BDB_IDL_ZERO( cx->tmp );
+
+ /* If number of kids in the cache differs from on-disk, load
+ * up all the kids from the database
+ */
+ if ( cx->ei->bei_ckids+1 != cx->ei->bei_dkids ) {
+ EntryInfo ei;
+ ei.bei_parent = cx->ei;
+
+ cx->rc = cx->db->cursor( cx->db, NULL, &cx->dbc,
+ cx->bdb->bi_db_opflags );
+ if ( cx->rc ) return cx->rc;
+
+ cx->data.data = &cx->dbuf;
+ cx->data.ulen = sizeof(ID);
+ cx->data.dlen = sizeof(ID);
+ cx->data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
+
+ /* The first item holds the parent ID. Ignore it. */
+ cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data, DB_SET );
+ if ( cx->rc == DB_NOTFOUND ) goto saveit;
+ if ( cx->rc ) return cx->rc;
+
+ /* If the on-disk count is zero we've never checked it.
+ * Count it now.
+ */
+ if ( !cx->ei->bei_dkids ) {
+ db_recno_t dkids;
+ cx->dbc->c_count( cx->dbc, &dkids, 0 );
+ cx->ei->bei_dkids = dkids;
+ }
- rc = bdb_idl_insert(ids, n->i_id);
- if (rc == 0) {
- ldap_pvt_thread_rdwr_rlock(&n->i_kids_rdwr);
- rc = avl_apply(n->i_kids, insert_sub, ids, -1, AVL_INORDER);
- ldap_pvt_thread_rdwr_runlock(&n->i_kids_rdwr);
+ /* If there are kids and this is a subtree search, allocate
+ * temp storage for the list of kids.
+ */
+ if ( cx->prefix == DN_SUBTREE_PREFIX && cx->ei->bei_dkids > 1 ) {
+ eilist = cx->op->o_tmpalloc( sizeof(EntryInfo *) * cx->ei->bei_dkids, cx->op->o_tmpmemctx );
+ eilist[cx->ei->bei_dkids-1] = NULL;
+ ptr = eilist;
+ }
+
+ cx->data.data = cx->buf;
+ cx->data.ulen = BDB_IDL_UM_SIZE * sizeof(ID);
+ cx->data.flags = DB_DBT_USERMEM;
+
+ /* Fetch the rest of the IDs in a loop... */
+ while ( (cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data,
+ DB_MULTIPLE | DB_NEXT_DUP )) == 0 ) {
+ u_int8_t *j;
+ size_t len;
+ DB_MULTIPLE_INIT( cx->ptr, &cx->data );
+ while (cx->ptr) {
+ DB_MULTIPLE_NEXT( cx->ptr, &cx->data, j, len );
+ if (j) {
+ EntryInfo *ei2;
+ diskNode *d = (diskNode *)j;
+
+ AC_MEMCPY( &ei.bei_id, &d->entryID, sizeof(ID) );
+ AC_MEMCPY( &ei.bei_nrdn.bv_len, &d->nrdnlen, sizeof(d->nrdnlen) );
+ /* nrdn/rdn are set in-place.
+ * hdb_cache_load will copy them as needed
+ */
+ ei.bei_nrdn.bv_val = d->nrdn;
+ ei.bei_rdn.bv_len = len - sizeof(diskNode) - ei.bei_nrdn.bv_len;
+ ei.bei_rdn.bv_val = d->nrdn + ei.bei_nrdn.bv_len + 1;
+ bdb_idl_insert( cx->tmp, ei.bei_id );
+ hdb_cache_load( cx->bdb, &ei, &ei2 );
+ if ( eilist )
+ *ptr++ = ei2;
+ }
+ }
+ }
+ cx->dbc->c_close( cx->dbc );
+ } else {
+ /* The in-memory cache is in sync with the on-disk data.
+ * do we have any kids?
+ */
+ if ( cx->ei->bei_ckids > 0 ) {
+ struct apply_arg ap;
+
+ /* Temp storage for subtree search */
+ if ( cx->prefix == DN_SUBTREE_PREFIX ) {
+ eilist = cx->op->o_tmpalloc( sizeof(EntryInfo *) * cx->ei->bei_dkids, cx->op->o_tmpmemctx );
+ eilist[cx->ei->bei_dkids-1] = NULL;
+ }
+
+ /* Walk the kids tree; order is irrelevant since bdb_idl_insert
+ * will insert in sorted order.
+ */
+ ap.idl = cx->tmp;
+ ap.ei = eilist;
+ bdb_cache_entryinfo_lock( cx->ei );
+ avl_apply( cx->ei->bei_kids, apply_func, &ap, -1, AVL_POSTORDER );
+ bdb_cache_entryinfo_unlock( cx->ei );
+ }
}
- return rc;
+
+ /* If we got some records, treat as success */
+ if (!BDB_IDL_IS_ZERO(cx->tmp)) {
+ cx->rc = 0;
+ }
+
+saveit:
+#ifdef SLAP_IDL_CACHE
+ if ( cx->bdb->bi_idl_cache_max_size ) {
+ bdb_idl_cache_put( cx->bdb, cx->db, &cx->key, cx->tmp, cx->rc );
+ }
+#endif
+ ;
+gotit:
+ if ( cx->rc == 0 ) {
+ /* If eilist is NULL, cx->tmp is empty... */
+ if ( cx->prefix == DN_SUBTREE_PREFIX && eilist ) {
+ bdb_idl_union( cx->ids, cx->tmp );
+ for (ptr = eilist; *ptr; ptr++) {
+ cx->ei = *ptr;
+ cx->id = cx->ei->bei_id;
+ hdb_dn2idl_internal( cx );
+ }
+ cx->op->o_tmpfree( eilist, cx->op->o_tmpmemctx );
+ cx->rc = 0;
+ } else {
+ BDB_IDL_CPY( cx->ids, cx->tmp );
+ }
+ }
+ return cx->rc;
}
int
-bdb_dn2idl(
- BackendDB *be,
- struct berval *dn,
- int prefix,
- ID *ids )
+hdb_dn2idl(
+ Operation *op,
+ Entry *e,
+ ID *ids,
+ ID *stack )
{
- struct bdb_info *bdb = (struct bdb_info *) be->be_private;
- int rc;
- ID id;
- idNode *n;
+ struct bdb_info *bdb = (struct bdb_info *)op->o_bd->be_private;
+ struct dn2id_cookie cx;
- if (prefix == DN_SUBTREE_PREFIX && be_issuffix(be, dn)) {
- BDB_IDL_ALL(bdb, ids);
+#ifdef NEW_LOGGING
+ LDAP_LOG ( INDEX, ARGS,
+ "=> hdb_dn2ididl( \"%s\" )\n", e->e_nname.bv_val, 0, 0 );
+#else
+ Debug( LDAP_DEBUG_TRACE, "=> hdb_dn2idl( \"%s\" )\n", e->e_nname.bv_val, 0, 0 );
+#endif
+
+#ifndef BDB_MULTIPLE_SUFFIXES
+ if ( op->ors_scope == LDAP_SCOPE_SUBTREE &&
+ BEI(e)->bei_parent->bei_id == 0 ) {
+ BDB_IDL_ALL( bdb, ids );
return 0;
}
+#endif
- rc = bdb_dn2id(be, NULL, dn, &id, 0);
- if (rc) return rc;
+ cx.id = e->e_id;
+ cx.ei = BEI(e);
+ cx.bdb = bdb;
+ cx.db = cx.bdb->bi_dn2id->bdi_db;
+ cx.prefix = op->ors_scope == LDAP_SCOPE_SUBTREE ? DN_SUBTREE_PREFIX :
+ DN_ONE_PREFIX;
+ cx.ids = ids;
+ cx.buf = stack;
+ cx.op = op;
+
+ BDB_IDL_ZERO( ids );
+ if ( cx.prefix == DN_SUBTREE_PREFIX ) {
+ bdb_idl_insert( ids, cx.id );
+ }
- ldap_pvt_thread_rdwr_rlock(&bdb->bi_tree_rdwr);
- n = bdb_find_id_node(id, bdb->bi_tree);
- ldap_pvt_thread_rdwr_runlock(&bdb->bi_tree_rdwr);
+ DBTzero(&cx.key);
+ cx.key.data = &cx.id;
+ cx.key.ulen = sizeof(ID);
+ cx.key.size = sizeof(ID);
+ cx.key.flags = DB_DBT_USERMEM;
- ids[0] = 0;
- ldap_pvt_thread_rdwr_rlock(&n->i_kids_rdwr);
- if (prefix == DN_ONE_PREFIX) {
- rc = avl_apply(n->i_kids, insert_one, ids, -1, AVL_INORDER);
- } else {
- ids[0] = 1;
- ids[1] = id;
- if (n->i_kids)
- rc = avl_apply(n->i_kids, insert_sub, ids, -1, AVL_INORDER);
- }
- ldap_pvt_thread_rdwr_runlock(&n->i_kids_rdwr);
- return rc;
+ DBTzero(&cx.data);
+
+ return hdb_dn2idl_internal(&cx);
}
#endif /* BDB_HIER */
projects / openldap / blobdiff