1 /* dn2id.c - routines to deal with the dn2id index */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2000-2011 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
20 #include <ac/string.h>
26 /* Management routines for a hierarchically structured database.
28 * Instead of a ldbm-style dn2id database, we use a hierarchical one. Each
29 * entry in this database is a struct diskNode, keyed by entryID and with
30 * the data containing the RDN and entryID of the node's children. We use
31 * a B-Tree with sorted duplicates to store all the children of a node under
32 * the same key. Also, the first item under the key contains the entry's own
33 * rdn and the ID of the node's parent, to allow bottom-up tree traversal as
34 * well as top-down. To keep this info first in the list, the high bit of all
35 * subsequent nrdnlen's is always set. This means we can only accomodate
36 * RDNs up to length 32767, but that's fine since full DNs are already
39 * The diskNode is a variable length structure. This definition is not
40 * directly usable for in-memory manipulation.
42 typedef struct diskNode {
43 unsigned char nrdnlen[2];
45 char rdn[1]; /* variable placement */
46 unsigned char entryID[sizeof(ID)]; /* variable placement */
49 /* Sort function for the sorted duplicate data items of a dn2id key.
50 * Sorts based on normalized RDN, in length order.
54 const MDB_val *usrkey,
61 un = (diskNode *)usrkey->mv_data;
62 cn = (diskNode *)curkey->mv_data;
64 /* data is not aligned, cannot compare directly */
65 rc = un->nrdnlen[0] - cn->nrdnlen[0];
67 rc = un->nrdnlen[1] - cn->nrdnlen[1];
70 nrlen = (un->nrdnlen[0] << 8) | un->nrdnlen[1];
71 return strncmp( un->nrdn, cn->nrdn, nrlen );
75 /* This function constructs a full DN for a given entry.
82 int rlen = 0, nrlen = 0;
89 /* count length of all DN components */
90 for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
91 rlen += ei->bei_rdn.bv_len + 1;
92 nrlen += ei->bei_nrdn.bv_len + 1;
93 if (ei->bei_modrdns > max) max = ei->bei_modrdns;
96 /* See if the entry DN was invalidated by a subtree rename */
98 if ( BEI(e)->bei_modrdns >= max ) {
101 /* We found a mismatch, tell the caller to lock it */
102 if ( checkit == 1 ) {
105 /* checkit == 2. do the fix. */
106 free( e->e_name.bv_val );
107 free( e->e_nname.bv_val );
110 e->e_name.bv_len = rlen - 1;
111 e->e_nname.bv_len = nrlen - 1;
112 e->e_name.bv_val = ch_malloc(rlen);
113 e->e_nname.bv_val = ch_malloc(nrlen);
114 ptr = e->e_name.bv_val;
115 nptr = e->e_nname.bv_val;
116 for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
117 ptr = lutil_strcopy(ptr, ei->bei_rdn.bv_val);
118 nptr = lutil_strcopy(nptr, ei->bei_nrdn.bv_val);
119 if ( ei->bei_parent ) {
124 BEI(e)->bei_modrdns = max;
125 if ( ptr > e->e_name.bv_val ) ptr[-1] = '\0';
126 if ( nptr > e->e_nname.bv_val ) nptr[-1] = '\0';
132 /* We add two elements to the DN2ID database - a data item under the parent's
133 * entryID containing the child's RDN and entryID, and an item under the
134 * child's entryID containing the parent's entryID.
143 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
144 MDB_dbi dbi = mdb->mi_dn2id;
151 Debug( LDAP_DEBUG_TRACE, "=> mdb_dn2id_add 0x%lx: \"%s\"\n",
152 e->e_id, e->e_ndn, 0 );
154 nrlen = dn_rdnlen( op->o_bd, &e->e_nname );
156 rlen = dn_rdnlen( op->o_bd, &e->e_name );
158 nrlen = e->e_nname.bv_len;
159 rlen = e->e_name.bv_len;
162 d = op->o_tmpalloc(sizeof(diskNode) + rlen + nrlen, op->o_tmpmemctx);
163 d->nrdnlen[1] = nrlen & 0xff;
164 d->nrdnlen[0] = (nrlen >> 8) | 0x80;
165 ptr = lutil_strncopy( d->nrdn, e->e_nname.bv_val, nrlen );
167 ptr = lutil_strncopy( ptr, e->e_name.bv_val, rlen );
169 memcpy( ptr, &e->e_id, sizeof( ID ));
171 key.mv_size = sizeof(ID);
176 /* Need to make dummy root node once. Subsequent attempts
177 * will fail harmlessly.
180 diskNode dummy = {{0, 0}, "", "", ""};
181 data.mv_data = &dummy;
182 data.mv_size = sizeof(diskNode);
184 mdb_put( txn, dbi, &key, &data, MDB_NODUPDATA );
188 data.mv_size = sizeof(diskNode) + rlen + nrlen;
190 rc = mdb_put( txn, dbi, &key, &data, MDB_NODUPDATA );
194 memcpy( ptr, &pid, sizeof( ID ));
195 d->nrdnlen[0] ^= 0x80;
197 rc = mdb_put( txn, dbi, &key, &data, MDB_NODUPDATA );
200 op->o_tmpfree( d, op->o_tmpmemctx );
201 Debug( LDAP_DEBUG_TRACE, "<= mdb_dn2id_add 0x%lx: %d\n", e->e_id, rc, 0 );
213 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
214 MDB_dbi dbi = mdb->mi_dn2id;
220 Debug( LDAP_DEBUG_TRACE, "=> mdb_dn2id_delete 0x%lx: \"%s\"\n",
221 e->e_id, e->e_ndn, 0 );
223 key.mv_size = sizeof(ID);
227 nrlen = dn_rdnlen( op->o_bd, &e->e_nname );
228 data.mv_size = sizeof(diskNode) + nrlen - sizeof(ID) - 1;
230 d = op->o_tmpalloc( data.mv_size, op->o_tmpmemctx );
231 d->nrdnlen[1] = nrlen & 0xff;
232 d->nrdnlen[0] = (nrlen >> 8) | 0x80;
233 memcpy( d->nrdn, e->e_nname.bv_val, nrlen );
236 /* Delete our ID from the parent's list */
237 rc = mdb_del( txn, dbi, &key, &data, MDB_DEL_DUP );
239 /* Delete our ID from the tree. With sorted duplicates, this
240 * will leave any child nodes still hanging around. This is OK
241 * for modrdn, which will add our info back in later.
245 d->nrdnlen[0] ^= 0x80;
246 rc = mdb_del( txn, dbi, &key, &data, MDB_DEL_DUP );
249 op->o_tmpfree( d, op->o_tmpmemctx );
251 Debug( LDAP_DEBUG_TRACE, "<= mdb_dn2id_delete 0x%lx: %d\n", e->e_id, rc, 0 );
255 /* return last found ID in *id if no match */
262 struct berval *matched )
264 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
266 MDB_dbi dbi = mdb->mi_dn2id;
271 char dn[SLAP_LDAPDN_MAXLEN];
275 Debug( LDAP_DEBUG_TRACE, "=> mdb_dn2id(\"%s\")\n", in->bv_val, 0, 0 );
286 matched->bv_val = dn + sizeof(dn) - 1;
288 *matched->bv_val-- = '\0';
291 nrlen = tmp.bv_len - op->o_bd->be_nsuffix[0].bv_len;
293 tmp.bv_len = op->o_bd->be_nsuffix[0].bv_len;
295 key.mv_size = sizeof(ID);
297 rc = mdb_cursor_open( txn, dbi, &cursor );
304 data.mv_size = sizeof(diskNode) + tmp.bv_len;
305 d = op->o_tmpalloc( data.mv_size, op->o_tmpmemctx );
306 d->nrdnlen[1] = tmp.bv_len & 0xff;
307 d->nrdnlen[0] = (tmp.bv_len >> 8) | 0x80;
308 ptr = lutil_strncopy( d->nrdn, tmp.bv_val, tmp.bv_len );
311 rc = mdb_cursor_get( cursor, &key, &data, MDB_GET_BOTH );
312 op->o_tmpfree( d, op->o_tmpmemctx );
313 if ( rc == MDB_NOTFOUND ) {
314 if ( matched && matched->bv_len ) {
315 ptr = op->o_tmpalloc( matched->bv_len+1, op->o_tmpmemctx );
316 strcpy( ptr, matched->bv_val );
317 matched->bv_val = ptr;
321 mdb_cursor_close( cursor );
324 ptr = (char *) data.mv_data + data.mv_size - sizeof(ID);
325 memcpy( &nid, ptr, sizeof(ID));
327 /* grab the non-normalized RDN */
331 rlen = data.mv_size - sizeof(diskNode) - tmp.bv_len;
332 matched->bv_len += rlen;
333 matched->bv_val -= rlen + 1;
334 ptr = lutil_strcopy( matched->bv_val, d->rdn + tmp.bv_len );
340 if ( tmp.bv_val > in->bv_val ) {
341 for (ptr = tmp.bv_val - 2; ptr > in->bv_val &&
342 !DN_SEPARATOR(*ptr); ptr--) /* empty */;
343 if ( ptr >= in->bv_val ) {
344 if (DN_SEPARATOR(*ptr)) ptr++;
345 tmp.bv_len = tmp.bv_val - ptr - 1;
356 Debug( LDAP_DEBUG_TRACE, "<= mdb_dn2id: get failed: %s (%d)\n",
357 mdb_strerror( rc ), rc, 0 );
359 Debug( LDAP_DEBUG_TRACE, "<= mdb_dn2id: got id=0x%lx\n",
366 /* return IDs from root to parent of DN */
374 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
376 MDB_dbi dbi = mdb->mi_dn2id;
384 Debug( LDAP_DEBUG_TRACE, "=> mdb_dn2sups(\"%s\")\n", in->bv_val, 0, 0 );
392 nrlen = tmp.bv_len - op->o_bd->be_nsuffix[0].bv_len;
394 tmp.bv_len = op->o_bd->be_nsuffix[0].bv_len;
396 key.mv_size = sizeof(ID);
398 rc = mdb_cursor_open( txn, dbi, &cursor );
405 data.mv_size = sizeof(diskNode) + tmp.bv_len;
406 d = op->o_tmpalloc( data.mv_size, op->o_tmpmemctx );
407 d->nrdnlen[1] = tmp.bv_len & 0xff;
408 d->nrdnlen[0] = (tmp.bv_len >> 8) | 0x80;
409 ptr = lutil_strncopy( d->nrdn, tmp.bv_val, tmp.bv_len );
412 rc = mdb_cursor_get( cursor, &key, &data, MDB_GET_BOTH );
413 op->o_tmpfree( d, op->o_tmpmemctx );
415 mdb_cursor_close( cursor );
418 ptr = (char *) data.mv_data + data.mv_size - sizeof(ID);
419 memcpy( &nid, ptr, sizeof(ID));
422 mdb_idl_insert( ids, pid );
424 if ( tmp.bv_val > in->bv_val ) {
425 for (ptr = tmp.bv_val - 2; ptr > in->bv_val &&
426 !DN_SEPARATOR(*ptr); ptr--) /* empty */;
427 if ( ptr >= in->bv_val ) {
428 if (DN_SEPARATOR(*ptr)) ptr++;
429 tmp.bv_len = tmp.bv_val - ptr - 1;
439 Debug( LDAP_DEBUG_TRACE, "<= mdb_dn2sups: get failed: %s (%d)\n",
440 mdb_strerror( rc ), rc, 0 );
454 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
455 DB *db = mdb->bi_dn2id->bdi_db;
464 key.size = sizeof(ID);
466 key.ulen = sizeof(ID);
467 key.flags = DB_DBT_USERMEM;
468 MDB_ID2DISK( ei->bei_id, &nid );
471 data.flags = DB_DBT_USERMEM;
473 rc = db->cursor( db, txn, &cursor, mdb->bi_db_opflags );
476 data.ulen = sizeof(diskNode) + (SLAP_LDAPDN_MAXLEN * 2);
477 d = op->o_tmpalloc( data.ulen, op->o_tmpmemctx );
480 rc = cursor->c_get( cursor, &key, &data, DB_SET );
482 if (d->nrdnlen[0] & 0x80) {
486 ptr = (char *) data.data + data.size - sizeof(ID);
487 MDB_DISK2ID( ptr, idp );
488 ei->bei_nrdn.bv_len = (d->nrdnlen[0] << 8) | d->nrdnlen[1];
489 ber_str2bv( d->nrdn, ei->bei_nrdn.bv_len, 1, &ei->bei_nrdn );
490 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) -
492 ptr = d->nrdn + ei->bei_nrdn.bv_len + 1;
493 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
494 /* How many children does this node have? */
495 cursor->c_count( cursor, &dkids, 0 );
496 ei->bei_dkids = dkids;
499 cursor->c_close( cursor );
500 op->o_tmpfree( d, op->o_tmpmemctx );
511 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
512 MDB_dbi dbi = mdb->mi_dn2id;
518 key.mv_size = sizeof(ID);
522 rc = mdb_cursor_open( txn, dbi, &cursor );
525 rc = mdb_cursor_get( cursor, &key, &data, MDB_SET );
528 rc = mdb_cursor_count( cursor, &dkids );
530 if ( dkids < 2 ) rc = MDB_NOTFOUND;
533 mdb_cursor_close( cursor );
543 struct berval *nname )
545 struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
546 MDB_dbi dbi = mdb->mi_dn2id;
550 char dn[SLAP_LDAPDN_MAXLEN], ndn[SLAP_LDAPDN_MAXLEN], *ptr;
554 key.mv_size = sizeof(ID);
556 rc = mdb_cursor_open( txn, dbi, &cursor );
568 rc = mdb_cursor_get( cursor, &key, &data, MDB_SET );
571 ptr += data.mv_size - sizeof(ID);
572 memcpy( &id, ptr, sizeof(ID) );
574 nrlen = (d->nrdnlen[0] << 8) | d->nrdnlen[1];
579 /* copy name and trailing NUL */
580 memcpy( nptr, d->nrdn, nrlen+1 );
581 rlen = data.mv_size - sizeof(diskNode) - nrlen;
582 memcpy( dptr, d->nrdn+nrlen+1, rlen+1 );
587 name->bv_len = dptr - dn;
588 nname->bv_len = nptr - ndn;
589 name->bv_val = op->o_tmpalloc( name->bv_len + 1, op->o_tmpmemctx );
590 nname->bv_val = op->o_tmpalloc( nname->bv_len + 1, op->o_tmpmemctx );
591 memcpy( name->bv_val, dn, name->bv_len );
592 name->bv_val[name->bv_len] = '\0';
593 memcpy( nname->bv_val, ndn, nname->bv_len );
594 nname->bv_val[nname->bv_len] = '\0';
596 mdb_cursor_close( cursor );
602 * We can't just use mdb_idl_fetch_key because
603 * 1 - our data items are longer than just an entry ID
604 * 2 - our data items are sorted alphabetically by nrdn, not by ID.
606 * We descend the tree recursively, so we define this cookie
607 * to hold our necessary state information. The mdb_dn2idl_internal
608 * function uses this cookie when calling itself.
611 struct dn2id_cookie {
612 struct mdb_info *mdb;
637 EntryInfo *ei = data;
640 mdb_idl_append_one( idl, ei->bei_id );
646 struct dn2id_cookie *cx
649 MDB_IDL_ZERO( cx->tmp );
651 if ( cx->mdb->bi_idl_cache_size ) {
652 char *ptr = ((char *)&cx->id)-1;
655 cx->key.size = sizeof(ID)+1;
656 if ( cx->prefix == DN_SUBTREE_PREFIX ) {
657 ID *ids = cx->depth ? cx->tmp : cx->ids;
659 cx->rc = mdb_idl_cache_get(cx->mdb, cx->db, &cx->key, ids);
660 if ( cx->rc == LDAP_SUCCESS ) {
662 mdb_idl_append( cx->ids, cx->tmp );
668 *ptr = DN_ONE_PREFIX;
669 cx->rc = mdb_idl_cache_get(cx->mdb, cx->db, &cx->key, cx->tmp);
670 if ( cx->rc == LDAP_SUCCESS ) {
673 if ( cx->rc == DB_NOTFOUND ) {
678 mdb_cache_entryinfo_lock( cx->ei );
680 /* If number of kids in the cache differs from on-disk, load
681 * up all the kids from the database
683 if ( cx->ei->bei_ckids+1 != cx->ei->bei_dkids ) {
685 db_recno_t dkids = cx->ei->bei_dkids;
686 ei.bei_parent = cx->ei;
688 /* Only one thread should load the cache */
689 while ( cx->ei->bei_state & CACHE_ENTRY_ONELEVEL ) {
690 mdb_cache_entryinfo_unlock( cx->ei );
691 ldap_pvt_thread_yield();
692 mdb_cache_entryinfo_lock( cx->ei );
693 if ( cx->ei->bei_ckids+1 == cx->ei->bei_dkids ) {
698 cx->ei->bei_state |= CACHE_ENTRY_ONELEVEL;
700 mdb_cache_entryinfo_unlock( cx->ei );
702 cx->rc = cx->db->cursor( cx->db, NULL, &cx->dbc,
703 cx->mdb->bi_db_opflags );
707 cx->data.data = &cx->dbuf;
708 cx->data.ulen = sizeof(ID);
709 cx->data.dlen = sizeof(ID);
710 cx->data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
712 /* The first item holds the parent ID. Ignore it. */
713 cx->key.data = &cx->nid;
714 cx->key.size = sizeof(ID);
715 cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data, DB_SET );
717 cx->dbc->c_close( cx->dbc );
721 /* If the on-disk count is zero we've never checked it.
725 cx->dbc->c_count( cx->dbc, &dkids, 0 );
726 cx->ei->bei_dkids = dkids;
729 cx->data.data = cx->buf;
730 cx->data.ulen = MDB_IDL_UM_SIZE * sizeof(ID);
731 cx->data.flags = DB_DBT_USERMEM;
734 /* Fetch the rest of the IDs in a loop... */
735 while ( (cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data,
736 DB_MULTIPLE | DB_NEXT_DUP )) == 0 ) {
740 DB_MULTIPLE_INIT( ptr, &cx->data );
742 DB_MULTIPLE_NEXT( ptr, &cx->data, j, len );
745 diskNode *d = (diskNode *)j;
748 MDB_DISK2ID( j + len - sizeof(ID), &ei.bei_id );
749 nrlen = ((d->nrdnlen[0] ^ 0x80) << 8) | d->nrdnlen[1];
750 ei.bei_nrdn.bv_len = nrlen;
751 /* nrdn/rdn are set in-place.
752 * mdb_cache_load will copy them as needed
754 ei.bei_nrdn.bv_val = d->nrdn;
755 ei.bei_rdn.bv_len = len - sizeof(diskNode)
756 - ei.bei_nrdn.bv_len;
757 ei.bei_rdn.bv_val = d->nrdn + ei.bei_nrdn.bv_len + 1;
758 mdb_idl_append_one( cx->tmp, ei.bei_id );
759 mdb_cache_load( cx->mdb, &ei, &ei2 );
765 cx->rc = cx->dbc->c_close( cx->dbc );
767 mdb_cache_entryinfo_lock( cx->ei );
768 cx->ei->bei_state &= ~CACHE_ENTRY_ONELEVEL;
769 mdb_cache_entryinfo_unlock( cx->ei );
774 /* The in-memory cache is in sync with the on-disk data.
775 * do we have any kids?
779 if ( cx->ei->bei_ckids > 0 ) {
780 /* Walk the kids tree; order is irrelevant since mdb_idl_sort
781 * will sort it later.
783 avl_apply( cx->ei->bei_kids, apply_func,
784 cx->tmp, -1, AVL_POSTORDER );
786 mdb_cache_entryinfo_unlock( cx->ei );
789 if ( !MDB_IDL_IS_RANGE( cx->tmp ) && cx->tmp[0] > 3 )
790 mdb_idl_sort( cx->tmp, cx->buf );
791 if ( cx->mdb->bi_idl_cache_max_size && !MDB_IDL_IS_ZERO( cx->tmp )) {
792 char *ptr = ((char *)&cx->id)-1;
794 cx->key.size = sizeof(ID)+1;
795 *ptr = DN_ONE_PREFIX;
796 mdb_idl_cache_put( cx->mdb, cx->db, &cx->key, cx->tmp, cx->rc );
800 if ( !MDB_IDL_IS_ZERO( cx->tmp )) {
801 if ( cx->prefix == DN_SUBTREE_PREFIX ) {
802 mdb_idl_append( cx->ids, cx->tmp );
804 if ( !(cx->ei->bei_state & CACHE_ENTRY_NO_GRANDKIDS)) {
806 EntryInfo *ei = cx->ei;
808 save = cx->op->o_tmpalloc( MDB_IDL_SIZEOF( cx->tmp ),
809 cx->op->o_tmpmemctx );
810 MDB_IDL_CPY( save, cx->tmp );
814 for ( cx->id = mdb_idl_first( save, &idcurs );
816 cx->id = mdb_idl_next( save, &idcurs )) {
819 if ( mdb_cache_find_id( cx->op, cx->txn, cx->id, &cx->ei,
824 if ( !( ei2->bei_state & CACHE_ENTRY_NO_KIDS )) {
825 MDB_ID2DISK( cx->id, &cx->nid );
826 mdb_dn2idl_internal( cx );
827 if ( !MDB_IDL_IS_ZERO( cx->tmp ))
830 mdb_cache_entryinfo_lock( ei2 );
832 mdb_cache_entryinfo_unlock( ei2 );
836 cx->op->o_tmpfree( save, cx->op->o_tmpmemctx );
838 mdb_cache_entryinfo_lock( ei );
839 ei->bei_state |= CACHE_ENTRY_NO_GRANDKIDS;
840 mdb_cache_entryinfo_unlock( ei );
843 /* Make sure caller knows it had kids! */
848 MDB_IDL_CPY( cx->ids, cx->tmp );
863 struct mdb_info *mdb = (struct mdb_info *)op->o_bd->be_private;
864 struct dn2id_cookie cx;
866 Debug( LDAP_DEBUG_TRACE, "=> mdb_dn2idl(\"%s\")\n",
869 #ifndef MDB_MULTIPLE_SUFFIXES
870 if ( op->ors_scope != LDAP_SCOPE_ONELEVEL &&
872 ( ei->bei_parent->bei_id == 0 && op->o_bd->be_suffix[0].bv_len )))
874 MDB_IDL_ALL( mdb, ids );
880 MDB_ID2DISK( cx.id, &cx.nid );
883 cx.db = cx.mdb->bi_dn2id->bdi_db;
884 cx.prefix = (op->ors_scope == LDAP_SCOPE_ONELEVEL) ?
885 DN_ONE_PREFIX : DN_SUBTREE_PREFIX;
888 cx.buf = stack + MDB_IDL_UM_SIZE;
894 if ( cx.prefix == DN_SUBTREE_PREFIX ) {
900 if ( cx.ei->bei_state & CACHE_ENTRY_NO_KIDS )
904 cx.key.ulen = sizeof(ID);
905 cx.key.size = sizeof(ID);
906 cx.key.flags = DB_DBT_USERMEM;
910 mdb_dn2idl_internal(&cx);
911 if ( cx.need_sort ) {
912 char *ptr = ((char *)&cx.id)-1;
913 if ( !MDB_IDL_IS_RANGE( cx.ids ) && cx.ids[0] > 3 )
914 mdb_idl_sort( cx.ids, cx.tmp );
916 cx.key.size = sizeof(ID)+1;
919 if ( cx.mdb->bi_idl_cache_max_size )
920 mdb_idl_cache_put( cx.mdb, cx.db, &cx.key, cx.ids, cx.rc );
923 if ( cx.rc == DB_NOTFOUND )
924 cx.rc = LDAP_SUCCESS;