1 /* dn2id.c - routines to deal with the dn2id index */
4 * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
11 #include <ac/string.h>
26 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
27 DB *db = bdb->bi_dn2id->bdi_db;
31 struct berval ptr, pdn;
34 LDAP_LOG ( INDEX, ARGS, "bdb_dn2id_add( \"%s\", 0x%08lx )\n",
35 e->e_ndn, (long) e->e_id, 0 );
37 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_add( \"%s\", 0x%08lx )\n",
38 e->e_ndn, (long) e->e_id, 0 );
40 assert( e->e_id != NOID );
43 key.size = e->e_nname.bv_len + 2;
45 key.flags = DB_DBT_USERMEM;
46 buf = sl_malloc( key.size, ctx );
48 buf[0] = DN_BASE_PREFIX;
50 ptr.bv_len = e->e_nname.bv_len;
51 AC_MEMCPY( ptr.bv_val, e->e_nname.bv_val, e->e_nname.bv_len );
52 ptr.bv_val[ptr.bv_len] = '\0';
55 data.data = (char *) &e->e_id;
56 data.size = sizeof( e->e_id );
58 /* store it -- don't override */
59 rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
62 LDAP_LOG ( INDEX, ERR, "bdb_dn2id_add: put failed: %s %d\n",
63 db_strerror(rc), rc, 0 );
65 Debug( LDAP_DEBUG_ANY, "=> bdb_dn2id_add: put failed: %s %d\n",
66 db_strerror(rc), rc, 0 );
71 #ifndef BDB_MULTIPLE_SUFFIXES
72 if( !be_issuffix( be, &ptr )) {
74 buf[0] = DN_SUBTREE_PREFIX;
75 rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
78 LDAP_LOG ( INDEX, ERR,
79 "=> bdb_dn2id_add: subtree (%s) put failed: %d\n",
82 Debug( LDAP_DEBUG_ANY,
83 "=> bdb_dn2id_add: subtree (%s) put failed: %d\n",
89 #ifdef BDB_MULTIPLE_SUFFIXES
90 if( !be_issuffix( be, &ptr )) {
92 dnParent( &ptr, &pdn );
94 key.size = pdn.bv_len + 2;
96 pdn.bv_val[-1] = DN_ONE_PREFIX;
97 key.data = pdn.bv_val-1;
100 rc = bdb_idl_insert_key( be, db, txn, &key, e->e_id );
104 LDAP_LOG ( INDEX, ERR,
105 "=> bdb_dn2id_add: parent (%s) insert failed: %d\n",
108 Debug( LDAP_DEBUG_ANY,
109 "=> bdb_dn2id_add: parent (%s) insert failed: %d\n",
114 #ifndef BDB_MULTIPLE_SUFFIXES
117 while( !be_issuffix( be, &ptr )) {
121 ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
123 rc = bdb_idl_insert_key( be, db, txn, &key, e->e_id );
127 LDAP_LOG ( INDEX, ERR,
128 "=> bdb_dn2id_add: subtree (%s) insert failed: %d\n",
131 Debug( LDAP_DEBUG_ANY,
132 "=> bdb_dn2id_add: subtree (%s) insert failed: %d\n",
137 #ifdef BDB_MULTIPLE_SUFFIXES
138 if( be_issuffix( be, &ptr )) break;
140 dnParent( &ptr, &pdn );
142 key.size = pdn.bv_len + 2;
144 key.data = pdn.bv_val - 1;
147 #ifdef BDB_MULTIPLE_SUFFIXES
154 LDAP_LOG ( INDEX, RESULTS, "<= bdb_dn2id_add: %d\n", rc, 0, 0 );
156 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_add: %d\n", rc, 0, 0 );
169 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
170 DB *db = bdb->bi_dn2id->bdi_db;
174 struct berval pdn, ptr;
177 LDAP_LOG ( INDEX, ARGS,
178 "=> bdb_dn2id_delete ( \"%s\", 0x%08lx )\n", e->e_ndn, e->e_id, 0);
180 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_delete( \"%s\", 0x%08lx )\n",
181 e->e_ndn, e->e_id, 0 );
185 key.size = e->e_nname.bv_len + 2;
186 buf = sl_malloc( key.size, ctx );
188 key.flags = DB_DBT_USERMEM;
189 buf[0] = DN_BASE_PREFIX;
191 ptr.bv_len = e->e_nname.bv_len;
192 AC_MEMCPY( ptr.bv_val, e->e_nname.bv_val, e->e_nname.bv_len );
193 ptr.bv_val[ptr.bv_len] = '\0';
196 rc = db->del( db, txn, &key, 0 );
199 LDAP_LOG ( INDEX, ERR,
200 "=> bdb_dn2id_delete: delete failed: %s %d\n",
201 db_strerror(rc), rc, 0 );
203 Debug( LDAP_DEBUG_ANY, "=> bdb_dn2id_delete: delete failed: %s %d\n",
204 db_strerror(rc), rc, 0 );
209 #ifndef BDB_MULTIPLE_SUFFIXES
210 if( !be_issuffix( be, &ptr )) {
212 buf[0] = DN_SUBTREE_PREFIX;
213 rc = db->del( db, txn, &key, 0 );
216 LDAP_LOG ( INDEX, ERR,
217 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
220 Debug( LDAP_DEBUG_ANY,
221 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
227 #ifdef BDB_MULTIPLE_SUFFIXES
228 if( !be_issuffix( be, &ptr )) {
230 dnParent( &ptr, &pdn );
232 key.size = pdn.bv_len + 2;
234 pdn.bv_val[-1] = DN_ONE_PREFIX;
235 key.data = pdn.bv_val - 1;
238 rc = bdb_idl_delete_key( be, db, txn, &key, e->e_id );
242 LDAP_LOG ( INDEX, ERR,
243 "=> bdb_dn2id_delete: parent (%s) delete failed: %d\n",
246 Debug( LDAP_DEBUG_ANY,
247 "=> bdb_dn2id_delete: parent (%s) delete failed: %d\n",
252 #ifndef BDB_MULTIPLE_SUFFIXES
255 while( !be_issuffix( be, &ptr )) {
259 ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
261 rc = bdb_idl_delete_key( be, db, txn, &key, e->e_id );
264 LDAP_LOG ( INDEX, ERR,
265 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
268 Debug( LDAP_DEBUG_ANY,
269 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
274 #ifdef BDB_MULTIPLE_SUFFIXES
275 if( be_issuffix( be, &ptr )) break;
277 dnParent( &ptr, &pdn );
279 key.size = pdn.bv_len + 2;
281 key.data = pdn.bv_val - 1;
284 #ifdef BDB_MULTIPLE_SUFFIXES
291 LDAP_LOG ( INDEX, RESULTS, "<= bdb_dn2id_delete %d\n", rc, 0, 0 );
293 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_delete %d\n", rc, 0, 0 );
308 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
309 DB *db = bdb->bi_dn2id->bdi_db;
312 LDAP_LOG ( INDEX, ARGS, "=> bdb_dn2id( \"%s\" )\n", dn->bv_val, 0, 0 );
314 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id( \"%s\" )\n", dn->bv_val, 0, 0 );
317 key.size = dn->bv_len + 2;
318 key.data = sl_malloc( key.size, ctx );
319 ((char *)key.data)[0] = DN_BASE_PREFIX;
320 AC_MEMCPY( &((char *)key.data)[1], dn->bv_val, key.size - 1 );
324 data.data = &ei->bei_id;
325 data.ulen = sizeof(ID);
326 data.flags = DB_DBT_USERMEM;
329 rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
333 LDAP_LOG ( INDEX, ERR, "<= bdb_dn2id: get failed %s (%d)\n",
334 db_strerror(rc), rc, 0 );
336 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: get failed: %s (%d)\n",
337 db_strerror( rc ), rc, 0 );
341 LDAP_LOG ( INDEX, RESULTS,
342 "<= bdb_dn2id: got id=0x%08lx\n", ei->bei_id, 0, 0 );
344 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: got id=0x%08lx\n",
349 sl_free( key.data, ctx );
360 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
361 DB *db = bdb->bi_dn2id->bdi_db;
366 LDAP_LOG ( INDEX, ARGS,
367 "=> bdb_dn2id_children( %s )\n", e->e_nname.bv_val, 0, 0 );
369 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_children( %s )\n",
370 e->e_nname.bv_val, 0, 0 );
373 key.size = e->e_nname.bv_len + 2;
374 key.data = sl_malloc( key.size, op->o_tmpmemctx );
375 ((char *)key.data)[0] = DN_ONE_PREFIX;
376 AC_MEMCPY( &((char *)key.data)[1], e->e_nname.bv_val, key.size - 1 );
378 #ifdef SLAP_IDL_CACHE
379 if ( bdb->bi_idl_cache_size ) {
380 rc = bdb_idl_cache_get( bdb, db, &key, NULL );
381 if ( rc != LDAP_NO_SUCH_OBJECT ) {
382 sl_free( key.data, op->o_tmpmemctx );
387 /* we actually could do a empty get... */
390 data.ulen = sizeof(id);
391 data.flags = DB_DBT_USERMEM;
393 data.dlen = sizeof(id);
395 rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
396 sl_free( key.data, op->o_tmpmemctx );
399 LDAP_LOG ( INDEX, DETAIL1,
400 "<= bdb_dn2id_children( %s ): %s (%d)\n",
401 e->e_nname.bv_val, rc == 0 ? "" : ( rc == DB_NOTFOUND ? "no " :
402 db_strerror(rc)), rc );
404 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_children( %s ): %s (%d)\n",
406 rc == 0 ? "" : ( rc == DB_NOTFOUND ? "no " :
407 db_strerror(rc) ), rc );
424 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
425 DB *db = bdb->bi_dn2id->bdi_db;
428 LDAP_LOG ( INDEX, ARGS,
429 "=> bdb_dn2ididl( \"%s\" )\n", dn->bv_val, 0, 0 );
431 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2idl( \"%s\" )\n", dn->bv_val, 0, 0 );
434 #ifndef BDB_MULTIPLE_SUFFIXES
435 if (prefix == DN_SUBTREE_PREFIX && be_issuffix(be, dn))
437 BDB_IDL_ALL(bdb, ids);
443 key.size = dn->bv_len + 2;
445 key.flags = DB_DBT_USERMEM;
446 key.data = sl_malloc( key.size, ctx );
447 ((char *)key.data)[0] = prefix;
448 AC_MEMCPY( &((char *)key.data)[1], dn->bv_val, key.size - 1 );
450 rc = bdb_idl_fetch_key( be, db, NULL, &key, ids );
454 LDAP_LOG ( INDEX, ERR,
455 "<= bdb_dn2ididl: get failed: %s (%d)\n", db_strerror(rc), rc, 0 );
457 Debug( LDAP_DEBUG_TRACE,
458 "<= bdb_dn2idl: get failed: %s (%d)\n",
459 db_strerror( rc ), rc, 0 );
464 LDAP_LOG ( INDEX, RESULTS,
465 "<= bdb_dn2ididl: id=%ld first=%ld last=%ld\n",
466 (long) ids[0], (long) BDB_IDL_FIRST( ids ),
467 (long) BDB_IDL_LAST( ids ) );
469 Debug( LDAP_DEBUG_TRACE,
470 "<= bdb_dn2idl: id=%ld first=%ld last=%ld\n",
472 (long) BDB_IDL_FIRST( ids ), (long) BDB_IDL_LAST( ids ) );
476 sl_free( key.data, ctx );
481 /* Experimental management routines for a hierarchically structured database.
483 * Unsupported! Use at your own risk!
484 * -- Howard Chu, Symas Corp. 2003.
486 * Instead of a ldbm-style dn2id database, we use a hierarchical one. Each
487 * entry in this database is a struct diskNode, keyed by entryID and with
488 * the data containing the RDN and entryID of the node's children. We use
489 * a B-Tree with sorted duplicates to store all the children of a node under
490 * the same key. Also, the first item under the key contains the entry's own
491 * rdn and the ID of the node's parent, to allow bottom-up tree traversal as
492 * well as top-down. To keep this info first in the list, the nrdnlen is set
493 * to the negative of its value.
495 * The diskNode is a variable length structure. This definition is not
496 * directly usable for in-memory manipulation.
498 typedef struct diskNode {
505 /* Sort function for the sorted duplicate data items of a dn2id key.
506 * Sorts based on normalized RDN, in lexical order.
515 diskNode *usr = usrkey->data;
516 diskNode *cur = curkey->data;
517 short curlen, usrlen;
522 /* Make sure to detect negative values in the nrdnlen */
523 ptr = (char *)&usr->nrdnlen;
524 pt2 = (unsigned char *)(ptr+1);
526 usrlen = ptr[0] << 8 | *pt2;
528 ptr = (char *)&cur->nrdnlen;
529 pt2 = (unsigned char *)(ptr+1);
531 curlen = ptr[0] << 8 | *pt2;
534 if ( curlen < 0 ) return 0;
538 if ( curlen < 0 ) return 1;
540 rc = strncmp( usr->nrdn, cur->nrdn, usrlen );
541 if ( rc == 0 ) rc = usrlen - curlen;
545 /* This function constructs a full DN for a given entry.
553 int rlen = 0, nrlen = 0;
557 for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
558 rlen += ei->bei_rdn.bv_len + 1;
559 nrlen += ei->bei_nrdn.bv_len + 1;
560 if (ei->bei_modrdns > max) max = ei->bei_modrdns;
563 /* See if the entry DN was invalidated by a subtree rename */
565 if ( BEI(e)->bei_modrdns >= max ) {
568 /* We found a mismatch, tell the caller to lock it */
569 if ( checkit == 1 ) {
572 /* checkit == 2. do the fix. */
573 free( e->e_name.bv_val );
576 e->e_name.bv_len = rlen - 1;
577 e->e_nname.bv_len = nrlen - 1;
578 e->e_name.bv_val = ch_malloc(rlen + nrlen);
579 e->e_nname.bv_val = e->e_name.bv_val + rlen;
580 ptr = e->e_name.bv_val;
581 nptr = e->e_nname.bv_val;
582 for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
583 ptr = lutil_strcopy(ptr, ei->bei_rdn.bv_val);
584 nptr = lutil_strcopy(nptr, ei->bei_nrdn.bv_val);
585 if ( ei->bei_parent ) {
590 BEI(e)->bei_modrdns = max;
597 /* We add two elements to the DN2ID database - a data item under the parent's
598 * entryID containing the child's RDN and entryID, and an item under the
599 * child's entryID containing the parent's entryID.
609 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
610 DB *db = bdb->bi_dn2id->bdi_db;
616 nrlen = dn_rdnlen( be, &e->e_nname );
618 rlen = dn_rdnlen( be, &e->e_name );
620 nrlen = e->e_nname.bv_len;
621 rlen = e->e_name.bv_len;
624 d = sl_malloc(sizeof(diskNode) + rlen + nrlen, ctx);
625 d->entryID = e->e_id;
627 ptr = lutil_strncopy( d->nrdn, e->e_nname.bv_val, nrlen );
629 ptr = lutil_strncopy( ptr, e->e_name.bv_val, rlen );
634 key.data = &eip->bei_id;
635 key.size = sizeof(ID);
636 key.flags = DB_DBT_USERMEM;
638 #ifdef SLAP_IDL_CACHE
639 if ( bdb->bi_idl_cache_size ) {
640 bdb_idl_cache_del( bdb, db, &key );
644 data.size = sizeof(diskNode) + rlen + nrlen;
645 data.flags = DB_DBT_USERMEM;
647 rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
651 d->entryID = eip->bei_id;
652 d->nrdnlen = 0 - nrlen;
654 rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
670 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
671 DB *db = bdb->bi_dn2id->bdi_db;
678 key.size = sizeof(ID);
680 key.data = &eip->bei_id;
681 key.flags = DB_DBT_USERMEM;
684 data.size = sizeof(diskNode) + BEI(e)->bei_nrdn.bv_len;
685 data.ulen = data.size;
686 data.dlen = data.size;
687 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
689 #ifdef SLAP_IDL_CACHE
690 if ( bdb->bi_idl_cache_size ) {
691 bdb_idl_cache_del( bdb, db, &key );
694 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
697 d = sl_malloc( data.size, ctx );
698 d->entryID = e->e_id;
699 d->nrdnlen = BEI(e)->bei_nrdn.bv_len;
700 strcpy( d->nrdn, BEI(e)->bei_nrdn.bv_val );
703 /* Delete our ID from the parent's list */
704 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH | DB_RMW );
706 rc = cursor->c_del( cursor, 0 );
708 /* Delete our ID from the tree. With sorted duplicates, this
709 * will leave any child nodes still hanging around. This is OK
710 * for modrdn, which will add our info back in later.
714 rc = cursor->c_get( cursor, &key, &data, DB_SET );
716 rc = cursor->c_del( cursor, 0 );
718 cursor->c_close( cursor );
732 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
733 DB *db = bdb->bi_dn2id->bdi_db;
739 ID idp = ei->bei_parent->bei_id;
741 nrlen = dn_rdnlen( be, in );
742 if (!nrlen) nrlen = in->bv_len;
745 key.size = sizeof(ID);
747 key.ulen = sizeof(ID);
748 key.flags = DB_DBT_USERMEM;
751 data.size = sizeof(diskNode) + nrlen;
752 data.ulen = data.size * 3;
753 data.flags = DB_DBT_USERMEM;
755 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
758 d = sl_malloc( data.size * 3, ctx );
760 ptr = lutil_strncopy( d->nrdn, in->bv_val, nrlen );
764 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH );
765 cursor->c_close( cursor );
768 AC_MEMCPY( &ei->bei_id, &d->entryID, sizeof(ID) );
769 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) - nrlen;
770 ptr = d->nrdn + nrlen + 1;
771 ei->bei_rdn.bv_val = ch_malloc( ei->bei_rdn.bv_len + 1 );
772 strcpy( ei->bei_rdn.bv_val, ptr );
787 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
788 DB *db = bdb->bi_dn2id->bdi_db;
797 key.size = sizeof(ID);
798 key.data = &ei->bei_id;
799 key.ulen = sizeof(ID);
800 key.flags = DB_DBT_USERMEM;
803 data.flags = DB_DBT_USERMEM;
805 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
808 data.ulen = sizeof(diskNode) + (SLAP_LDAPDN_MAXLEN * 2);
809 d = sl_malloc( data.ulen, ctx );
812 rc = cursor->c_get( cursor, &key, &data, DB_SET );
813 cursor->c_close( cursor );
815 if (d->nrdnlen >= 0) {
818 AC_MEMCPY( idp, &d->entryID, sizeof(ID) );
819 ei->bei_nrdn.bv_len = 0 - d->nrdnlen;
820 ber_str2bv( d->nrdn, ei->bei_nrdn.bv_len, 1, &ei->bei_nrdn );
821 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) -
823 ptr = d->nrdn + ei->bei_nrdn.bv_len + 1;
824 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
836 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
837 DB *db = bdb->bi_dn2id->bdi_db;
845 key.size = sizeof(ID);
847 key.flags = DB_DBT_USERMEM;
849 #ifdef SLAP_IDL_CACHE
850 if ( bdb->bi_idl_cache_size ) {
851 rc = bdb_idl_cache_get( bdb, db, &key, NULL );
852 if ( rc != LDAP_NO_SUCH_OBJECT ) {
859 data.ulen = sizeof(d);
860 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
861 data.dlen = sizeof(d);
863 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
866 rc = cursor->c_get( cursor, &key, &data, DB_SET );
868 rc = cursor->c_get( cursor, &key, &data, DB_NEXT_DUP );
870 cursor->c_close( cursor );
875 * We can't just use bdb_idl_fetch_key because
876 * 1 - our data items are longer than just an entry ID
877 * 2 - our data items are sorted alphabetically by nrdn, not by ID.
879 * We descend the tree recursively, so we define this cookie
880 * to hold our necessary state information. The bdb_dn2idl_internal
881 * function uses this cookie when calling itself.
884 struct dn2id_cookie {
885 struct bdb_info *bdb;
893 ID tmp[BDB_IDL_DB_SIZE];
903 struct dn2id_cookie *cx
906 #ifdef SLAP_IDL_CACHE
907 if ( cx->bdb->bi_idl_cache_size ) {
908 cx->rc = bdb_idl_cache_get(cx->bdb, cx->db, &cx->key, cx->tmp);
909 if ( cx->rc == DB_NOTFOUND ) {
912 if ( cx->rc == LDAP_SUCCESS ) {
918 cx->rc = cx->db->cursor( cx->db, NULL, &cx->dbc,
919 cx->bdb->bi_db_opflags );
920 if ( cx->rc ) return cx->rc;
921 BDB_IDL_ZERO( cx->tmp );
923 cx->data.data = &cx->dbuf;
924 cx->data.ulen = sizeof(ID);
925 cx->data.dlen = sizeof(ID);
926 cx->data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
928 /* The first item holds the parent ID. Ignore it. */
929 cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data, DB_SET );
930 if ( cx->rc == DB_NOTFOUND ) goto saveit;
931 if ( cx->rc ) return cx->rc;
933 cx->data.data = cx->buf;
934 cx->data.ulen = BDB_IDL_UM_SIZE * sizeof(ID);
935 cx->data.flags = DB_DBT_USERMEM;
937 /* Fetch the rest of the IDs in a loop... */
938 while ( (cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data,
939 DB_MULTIPLE | DB_NEXT_DUP )) == 0 ) {
942 DB_MULTIPLE_INIT( cx->ptr, &cx->data );
944 DB_MULTIPLE_NEXT( cx->ptr, &cx->data, j, len );
946 AC_MEMCPY( &cx->dbuf, j, sizeof(ID) );
947 bdb_idl_insert( cx->tmp, cx->dbuf );
951 cx->dbc->c_close( cx->dbc );
953 /* If we got some records, treat as success */
954 if (!BDB_IDL_IS_ZERO(cx->tmp)) {
959 #ifdef SLAP_IDL_CACHE
960 if ( cx->bdb->bi_idl_cache_max_size ) {
961 bdb_idl_cache_put( cx->bdb, cx->db, &cx->key, cx->tmp, cx->rc );
965 if ( cx->prefix == DN_SUBTREE_PREFIX ) {
968 save = sl_malloc( BDB_IDL_SIZEOF( cx->tmp ), cx->ctx );
969 BDB_IDL_CPY( save, cx->tmp );
970 bdb_idl_union( cx->ids, cx->tmp );
973 for ( cx->id = bdb_idl_first( save, &idcurs );
975 cx->id = bdb_idl_next( save, &idcurs )) {
976 bdb_dn2idl_internal( cx );
978 sl_free( save, cx->ctx );
981 BDB_IDL_CPY( cx->ids, cx->tmp );
996 struct dn2id_cookie cx;
997 EntryInfo *ei = (EntryInfo *)dn;
999 #ifndef BDB_MULTIPLE_SUFFIXES
1000 if ( ei->bei_parent->bei_id == 0 ) {
1001 struct bdb_info *bdb = (struct bdb_info *)be->be_private;
1002 BDB_IDL_ALL( bdb, ids );
1008 cx.bdb = (struct bdb_info *)be->be_private;
1009 cx.db = cx.bdb->bi_dn2id->bdi_db;
1015 BDB_IDL_ZERO( ids );
1016 if ( prefix == DN_SUBTREE_PREFIX ) {
1017 bdb_idl_insert( ids, cx.id );
1021 cx.key.data = &cx.id;
1022 cx.key.ulen = sizeof(ID);
1023 cx.key.size = sizeof(ID);
1024 cx.key.flags = DB_DBT_USERMEM;
1028 return bdb_dn2idl_internal(&cx);
1030 #endif /* BDB_HIER */