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-2005 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>
34 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
35 DB *db = bdb->bi_dn2id->bdi_db;
40 struct berval ptr, pdn;
42 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_add( \"%s\", 0x%08lx )\n",
43 e->e_ndn, (long) e->e_id, 0 );
44 assert( e->e_id != NOID );
47 key.size = e->e_nname.bv_len + 2;
49 key.flags = DB_DBT_USERMEM;
50 buf = op->o_tmpalloc( key.size, op->o_tmpmemctx );
52 buf[0] = DN_BASE_PREFIX;
54 ptr.bv_len = e->e_nname.bv_len;
55 AC_MEMCPY( ptr.bv_val, e->e_nname.bv_val, e->e_nname.bv_len );
56 ptr.bv_val[ptr.bv_len] = '\0';
60 data.size = sizeof( nid );
61 BDB_ID2DISK( e->e_id, &nid );
63 /* store it -- don't override */
64 rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
66 Debug( LDAP_DEBUG_ANY, "=> bdb_dn2id_add: put failed: %s %d\n",
67 db_strerror(rc), rc, 0 );
71 #ifndef BDB_MULTIPLE_SUFFIXES
72 if( !be_issuffix( op->o_bd, &ptr ))
75 buf[0] = DN_SUBTREE_PREFIX;
76 rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
78 Debug( LDAP_DEBUG_ANY,
79 "=> bdb_dn2id_add: subtree (%s) put failed: %d\n",
84 #ifdef BDB_MULTIPLE_SUFFIXES
85 if( !be_issuffix( op->o_bd, &ptr ))
88 dnParent( &ptr, &pdn );
90 key.size = pdn.bv_len + 2;
92 pdn.bv_val[-1] = DN_ONE_PREFIX;
93 key.data = pdn.bv_val-1;
96 rc = bdb_idl_insert_key( op->o_bd, db, txn, &key, e->e_id );
99 Debug( LDAP_DEBUG_ANY,
100 "=> bdb_dn2id_add: parent (%s) insert failed: %d\n",
106 #ifndef BDB_MULTIPLE_SUFFIXES
107 while( !be_issuffix( op->o_bd, &ptr ))
112 ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
114 rc = bdb_idl_insert_key( op->o_bd, db, txn, &key, e->e_id );
117 Debug( LDAP_DEBUG_ANY,
118 "=> bdb_dn2id_add: subtree (%s) insert failed: %d\n",
122 #ifdef BDB_MULTIPLE_SUFFIXES
123 if( be_issuffix( op->o_bd, &ptr )) break;
125 dnParent( &ptr, &pdn );
127 key.size = pdn.bv_len + 2;
129 key.data = pdn.bv_val - 1;
135 op->o_tmpfree( buf, op->o_tmpmemctx );
136 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_add: %d\n", rc, 0, 0 );
147 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
148 DB *db = bdb->bi_dn2id->bdi_db;
152 struct berval pdn, ptr;
154 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_delete( \"%s\", 0x%08lx )\n",
155 e->e_ndn, e->e_id, 0 );
158 key.size = e->e_nname.bv_len + 2;
159 buf = op->o_tmpalloc( key.size, op->o_tmpmemctx );
161 key.flags = DB_DBT_USERMEM;
162 buf[0] = DN_BASE_PREFIX;
164 ptr.bv_len = e->e_nname.bv_len;
165 AC_MEMCPY( ptr.bv_val, e->e_nname.bv_val, e->e_nname.bv_len );
166 ptr.bv_val[ptr.bv_len] = '\0';
169 rc = db->del( db, txn, &key, 0 );
171 Debug( LDAP_DEBUG_ANY, "=> bdb_dn2id_delete: delete failed: %s %d\n",
172 db_strerror(rc), rc, 0 );
176 #ifndef BDB_MULTIPLE_SUFFIXES
177 if( !be_issuffix( op->o_bd, &ptr ))
180 buf[0] = DN_SUBTREE_PREFIX;
181 rc = db->del( db, txn, &key, 0 );
183 Debug( LDAP_DEBUG_ANY,
184 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
189 #ifdef BDB_MULTIPLE_SUFFIXES
190 if( !be_issuffix( op->o_bd, &ptr ))
193 dnParent( &ptr, &pdn );
195 key.size = pdn.bv_len + 2;
197 pdn.bv_val[-1] = DN_ONE_PREFIX;
198 key.data = pdn.bv_val - 1;
201 rc = bdb_idl_delete_key( op->o_bd, db, txn, &key, e->e_id );
204 Debug( LDAP_DEBUG_ANY,
205 "=> bdb_dn2id_delete: parent (%s) delete failed: %d\n",
211 #ifndef BDB_MULTIPLE_SUFFIXES
212 while( !be_issuffix( op->o_bd, &ptr ))
217 ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
219 rc = bdb_idl_delete_key( op->o_bd, db, txn, &key, e->e_id );
221 Debug( LDAP_DEBUG_ANY,
222 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
226 #ifdef BDB_MULTIPLE_SUFFIXES
227 if( be_issuffix( op->o_bd, &ptr )) break;
229 dnParent( &ptr, &pdn );
231 key.size = pdn.bv_len + 2;
233 key.data = pdn.bv_val - 1;
239 op->o_tmpfree( buf, op->o_tmpmemctx );
240 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_delete %d\n", rc, 0, 0 );
251 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
252 DB *db = bdb->bi_dn2id->bdi_db;
257 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id(\"%s\")\n", dn->bv_val, 0, 0 );
259 key.size = dn->bv_len + 2;
260 key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
261 ((char *)key.data)[0] = DN_BASE_PREFIX;
262 AC_MEMCPY( &((char *)key.data)[1], dn->bv_val, key.size - 1 );
267 data.ulen = sizeof(ID);
268 data.flags = DB_DBT_USERMEM;
271 rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
274 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: get failed: %s (%d)\n",
275 db_strerror( rc ), rc, 0 );
277 BDB_DISK2ID( &nid, &ei->bei_id );
278 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: got id=0x%08lx\n",
282 op->o_tmpfree( key.data, op->o_tmpmemctx );
293 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
294 DB *db = bdb->bi_dn2id->bdi_db;
298 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_children(\"%s\")\n",
299 e->e_nname.bv_val, 0, 0 );
301 key.size = e->e_nname.bv_len + 2;
302 key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
303 ((char *)key.data)[0] = DN_ONE_PREFIX;
304 AC_MEMCPY( &((char *)key.data)[1], e->e_nname.bv_val, key.size - 1 );
306 if ( bdb->bi_idl_cache_size ) {
307 rc = bdb_idl_cache_get( bdb, db, &key, NULL );
308 if ( rc != LDAP_NO_SUCH_OBJECT ) {
309 op->o_tmpfree( key.data, op->o_tmpmemctx );
313 /* we actually could do a empty get... */
316 data.ulen = sizeof(id);
317 data.flags = DB_DBT_USERMEM;
319 data.dlen = sizeof(id);
321 rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
322 op->o_tmpfree( key.data, op->o_tmpmemctx );
324 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_children(\"%s\"): %s (%d)\n",
326 rc == 0 ? "" : ( rc == DB_NOTFOUND ? "no " :
327 db_strerror(rc) ), rc );
341 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
342 DB *db = bdb->bi_dn2id->bdi_db;
343 int prefix = ( op->ors_scope == LDAP_SCOPE_ONELEVEL )
344 ? DN_ONE_PREFIX : DN_SUBTREE_PREFIX;
346 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2idl(\"%s\")\n",
347 e->e_nname.bv_val, 0, 0 );
349 #ifndef BDB_MULTIPLE_SUFFIXES
350 if ( prefix == DN_SUBTREE_PREFIX && BEI(e)->bei_parent->bei_id == 0 ) {
351 BDB_IDL_ALL(bdb, ids);
357 key.size = e->e_nname.bv_len + 2;
359 key.flags = DB_DBT_USERMEM;
360 key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
361 ((char *)key.data)[0] = prefix;
362 AC_MEMCPY( &((char *)key.data)[1], e->e_nname.bv_val, key.size - 1 );
365 rc = bdb_idl_fetch_key( op->o_bd, db, NULL, &key, ids, NULL, 0 );
368 Debug( LDAP_DEBUG_TRACE,
369 "<= bdb_dn2idl: get failed: %s (%d)\n",
370 db_strerror( rc ), rc, 0 );
373 Debug( LDAP_DEBUG_TRACE,
374 "<= bdb_dn2idl: id=%ld first=%ld last=%ld\n",
376 (long) BDB_IDL_FIRST( ids ), (long) BDB_IDL_LAST( ids ) );
379 op->o_tmpfree( key.data, op->o_tmpmemctx );
384 /* Experimental management routines for a hierarchically structured database.
386 * Unsupported! Use at your own risk!
387 * -- Howard Chu, Symas Corp. 2003.
389 * Instead of a ldbm-style dn2id database, we use a hierarchical one. Each
390 * entry in this database is a struct diskNode, keyed by entryID and with
391 * the data containing the RDN and entryID of the node's children. We use
392 * a B-Tree with sorted duplicates to store all the children of a node under
393 * the same key. Also, the first item under the key contains the entry's own
394 * rdn and the ID of the node's parent, to allow bottom-up tree traversal as
395 * well as top-down. To keep this info first in the list, the high bit of all
396 * subsequent nrdnlen's is always set. This means we can only accomodate
397 * RDNs up to length 32767, but that's fine since full DNs are already
398 * restricted to 8192.
400 * The diskNode is a variable length structure. This definition is not
401 * directly usable for in-memory manipulation.
403 typedef struct diskNode {
404 unsigned char nrdnlen[2];
405 unsigned char nrdn[1];
406 unsigned char rdn[1];
407 unsigned char entryID[sizeof(ID)];
410 /* This function constructs a full DN for a given entry.
417 int rlen = 0, nrlen = 0;
424 /* count length of all DN components */
425 for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
426 rlen += ei->bei_rdn.bv_len + 1;
427 nrlen += ei->bei_nrdn.bv_len + 1;
428 if (ei->bei_modrdns > max) max = ei->bei_modrdns;
431 /* See if the entry DN was invalidated by a subtree rename */
433 if ( BEI(e)->bei_modrdns >= max ) {
436 /* We found a mismatch, tell the caller to lock it */
437 if ( checkit == 1 ) {
440 /* checkit == 2. do the fix. */
441 free( e->e_name.bv_val );
442 free( e->e_nname.bv_val );
445 e->e_name.bv_len = rlen - 1;
446 e->e_nname.bv_len = nrlen - 1;
447 e->e_name.bv_val = ch_malloc(rlen);
448 e->e_nname.bv_val = ch_malloc(nrlen);
449 ptr = e->e_name.bv_val;
450 nptr = e->e_nname.bv_val;
451 for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
452 ptr = lutil_strcopy(ptr, ei->bei_rdn.bv_val);
453 nptr = lutil_strcopy(nptr, ei->bei_nrdn.bv_val);
454 if ( ei->bei_parent ) {
459 BEI(e)->bei_modrdns = max;
466 /* We add two elements to the DN2ID database - a data item under the parent's
467 * entryID containing the child's RDN and entryID, and an item under the
468 * child's entryID containing the parent's entryID.
477 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
478 DB *db = bdb->bi_dn2id->bdi_db;
485 nrlen = dn_rdnlen( op->o_bd, &e->e_nname );
487 rlen = dn_rdnlen( op->o_bd, &e->e_name );
489 nrlen = e->e_nname.bv_len;
490 rlen = e->e_name.bv_len;
493 d = op->o_tmpalloc(sizeof(diskNode) + rlen + nrlen, op->o_tmpmemctx);
494 d->nrdnlen[1] = nrlen & 0xff;
495 d->nrdnlen[0] = (nrlen >> 8) | 0x80;
496 ptr = lutil_strncopy( d->nrdn, e->e_nname.bv_val, nrlen );
498 ptr = lutil_strncopy( ptr, e->e_name.bv_val, rlen );
500 BDB_ID2DISK( e->e_id, ptr );
505 key.size = sizeof(ID);
506 key.flags = DB_DBT_USERMEM;
507 BDB_ID2DISK( eip->bei_id, &nid );
509 /* Need to make dummy root node once. Subsequent attempts
510 * will fail harmlessly.
512 if ( eip->bei_id == 0 ) {
513 diskNode dummy = {0};
515 data.size = sizeof(diskNode);
516 data.flags = DB_DBT_USERMEM;
518 db->put( db, txn, &key, &data, DB_NODUPDATA );
521 if ( bdb->bi_idl_cache_size ) {
522 bdb_idl_cache_del( bdb, db, &key );
525 data.size = sizeof(diskNode) + rlen + nrlen;
526 data.flags = DB_DBT_USERMEM;
528 rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
531 BDB_ID2DISK( e->e_id, &nid );
532 BDB_ID2DISK( eip->bei_id, ptr );
533 d->nrdnlen[0] ^= 0x80;
535 rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
538 op->o_tmpfree( d, op->o_tmpmemctx );
550 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
551 DB *db = bdb->bi_dn2id->bdi_db;
559 key.size = sizeof(ID);
562 key.flags = DB_DBT_USERMEM;
563 BDB_ID2DISK( eip->bei_id, &nid );
566 data.size = sizeof(diskNode) + BEI(e)->bei_nrdn.bv_len - sizeof(ID) - 1;
567 data.ulen = data.size;
568 data.dlen = data.size;
569 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
571 if ( bdb->bi_idl_cache_size ) {
572 bdb_idl_cache_del( bdb, db, &key );
574 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
577 d = op->o_tmpalloc( data.size, op->o_tmpmemctx );
578 d->nrdnlen[1] = BEI(e)->bei_nrdn.bv_len & 0xff;
579 d->nrdnlen[0] = (BEI(e)->bei_nrdn.bv_len >> 8) | 0x80;
580 strcpy( d->nrdn, BEI(e)->bei_nrdn.bv_val );
583 /* Delete our ID from the parent's list */
584 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH_RANGE );
586 if ( !strcmp( d->nrdn, BEI(e)->bei_nrdn.bv_val ))
587 rc = cursor->c_del( cursor, 0 );
592 /* Delete our ID from the tree. With sorted duplicates, this
593 * will leave any child nodes still hanging around. This is OK
594 * for modrdn, which will add our info back in later.
597 BDB_ID2DISK( e->e_id, &nid );
598 rc = cursor->c_get( cursor, &key, &data, DB_SET );
600 rc = cursor->c_del( cursor, 0 );
602 cursor->c_close( cursor );
603 op->o_tmpfree( d, op->o_tmpmemctx );
616 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
617 DB *db = bdb->bi_dn2id->bdi_db;
625 nrlen = dn_rdnlen( op->o_bd, in );
626 if (!nrlen) nrlen = in->bv_len;
629 key.size = sizeof(ID);
631 key.ulen = sizeof(ID);
632 key.flags = DB_DBT_USERMEM;
633 BDB_ID2DISK( ei->bei_parent->bei_id, &idp );
636 data.size = sizeof(diskNode) + nrlen - sizeof(ID) - 1;
637 data.ulen = data.size * 3;
638 data.dlen = data.ulen;
639 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
641 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
644 d = op->o_tmpalloc( data.size * 3, op->o_tmpmemctx );
645 d->nrdnlen[1] = nrlen & 0xff;
646 d->nrdnlen[0] = (nrlen >> 8) | 0x80;
647 ptr = lutil_strncopy( d->nrdn, in->bv_val, nrlen );
651 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH_RANGE );
652 if ( rc == 0 && strncmp( d->nrdn, in->bv_val, nrlen )) {
656 ptr = data.data + data.size - sizeof(ID);
657 BDB_DISK2ID( ptr, &ei->bei_id );
658 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) - nrlen;
659 ptr = d->nrdn + nrlen + 1;
660 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
661 if ( !ei->bei_parent->bei_dkids ) {
663 /* How many children does the parent have? */
664 /* FIXME: do we need to lock the parent
665 * entryinfo? Seems safe...
667 cursor->c_count( cursor, &dkids, 0 );
668 ei->bei_parent->bei_dkids = dkids;
671 cursor->c_close( cursor );
672 op->o_tmpfree( d, op->o_tmpmemctx );
684 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
685 DB *db = bdb->bi_dn2id->bdi_db;
695 key.size = sizeof(ID);
697 key.ulen = sizeof(ID);
698 key.flags = DB_DBT_USERMEM;
699 BDB_ID2DISK( ei->bei_id, &nid );
702 data.flags = DB_DBT_USERMEM;
704 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
707 data.ulen = sizeof(diskNode) + (SLAP_LDAPDN_MAXLEN * 2);
708 d = op->o_tmpalloc( data.ulen, op->o_tmpmemctx );
711 rc = cursor->c_get( cursor, &key, &data, DB_SET );
713 if (d->nrdnlen[0] & 0x80) {
717 ptr = data.data + data.size - sizeof(ID);
718 BDB_DISK2ID( ptr, idp );
719 ei->bei_nrdn.bv_len = (d->nrdnlen[0] << 8) | d->nrdnlen[1];
720 ber_str2bv( d->nrdn, ei->bei_nrdn.bv_len, 1, &ei->bei_nrdn );
721 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) -
723 ptr = d->nrdn + ei->bei_nrdn.bv_len + 1;
724 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
725 /* How many children does this node have? */
726 cursor->c_count( cursor, &dkids, 0 );
727 ei->bei_dkids = dkids;
730 cursor->c_close( cursor );
731 op->o_tmpfree( d, op->o_tmpmemctx );
741 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
742 DB *db = bdb->bi_dn2id->bdi_db;
750 key.size = sizeof(ID);
752 key.flags = DB_DBT_USERMEM;
753 BDB_ID2DISK( e->e_id, &id );
755 /* IDL cache is in host byte order */
756 if ( bdb->bi_idl_cache_size ) {
757 rc = bdb_idl_cache_get( bdb, db, &key, NULL );
758 if ( rc != LDAP_NO_SUCH_OBJECT ) {
766 data.ulen = sizeof(d);
767 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
768 data.dlen = sizeof(d);
770 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
773 rc = cursor->c_get( cursor, &key, &data, DB_SET );
776 rc = cursor->c_count( cursor, &dkids, 0 );
778 BEI(e)->bei_dkids = dkids;
779 if ( dkids < 2 ) rc = DB_NOTFOUND;
782 cursor->c_close( cursor );
787 * We can't just use bdb_idl_fetch_key because
788 * 1 - our data items are longer than just an entry ID
789 * 2 - our data items are sorted alphabetically by nrdn, not by ID.
791 * We descend the tree recursively, so we define this cookie
792 * to hold our necessary state information. The bdb_dn2idl_internal
793 * function uses this cookie when calling itself.
796 struct dn2id_cookie {
797 struct bdb_info *bdb;
807 ID tmp[BDB_IDL_DB_SIZE];
820 EntryInfo *ei = data;
823 bdb_idl_insert( idl, ei->bei_id );
829 struct dn2id_cookie *cx
832 BDB_IDL_ZERO( cx->tmp );
835 cx->ei = bdb_cache_find_info( cx->bdb, cx->id );
837 cx->rc = DB_NOTFOUND;
842 if ( cx->bdb->bi_idl_cache_size ) {
843 cx->key.data = &cx->id;
844 cx->rc = bdb_idl_cache_get(cx->bdb, cx->db, &cx->key, cx->tmp);
845 if ( cx->rc == DB_NOTFOUND ) {
848 if ( cx->rc == LDAP_SUCCESS ) {
853 bdb_cache_entryinfo_lock( cx->ei );
855 /* If number of kids in the cache differs from on-disk, load
856 * up all the kids from the database
858 if ( cx->ei->bei_ckids+1 != cx->ei->bei_dkids ) {
860 db_recno_t dkids = cx->ei->bei_dkids;
861 ei.bei_parent = cx->ei;
863 bdb_cache_entryinfo_unlock( cx->ei );
865 cx->rc = cx->db->cursor( cx->db, NULL, &cx->dbc,
866 cx->bdb->bi_db_opflags );
867 if ( cx->rc ) return cx->rc;
869 cx->data.data = &cx->dbuf;
870 cx->data.ulen = sizeof(ID);
871 cx->data.dlen = sizeof(ID);
872 cx->data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
874 /* The first item holds the parent ID. Ignore it. */
875 cx->key.data = &cx->nid;
876 cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data, DB_SET );
878 cx->dbc->c_close( cx->dbc );
879 if ( cx->rc == DB_NOTFOUND ) goto saveit;
883 /* If the on-disk count is zero we've never checked it.
887 cx->dbc->c_count( cx->dbc, &dkids, 0 );
888 cx->ei->bei_dkids = dkids;
891 cx->data.data = cx->buf;
892 cx->data.ulen = BDB_IDL_UM_SIZE * sizeof(ID);
893 cx->data.flags = DB_DBT_USERMEM;
895 /* Fetch the rest of the IDs in a loop... */
896 while ( (cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data,
897 DB_MULTIPLE | DB_NEXT_DUP )) == 0 ) {
900 DB_MULTIPLE_INIT( cx->ptr, &cx->data );
902 DB_MULTIPLE_NEXT( cx->ptr, &cx->data, j, len );
905 diskNode *d = (diskNode *)j;
908 BDB_DISK2ID( j + len - sizeof(ID), &ei.bei_id );
909 nrlen = ((d->nrdnlen[0] ^ 0x80) << 8) | d->nrdnlen[1];
910 ei.bei_nrdn.bv_len = nrlen;
911 /* nrdn/rdn are set in-place.
912 * hdb_cache_load will copy them as needed
914 ei.bei_nrdn.bv_val = d->nrdn;
915 ei.bei_rdn.bv_len = len - sizeof(diskNode)
916 - ei.bei_nrdn.bv_len;
917 ei.bei_rdn.bv_val = d->nrdn + ei.bei_nrdn.bv_len + 1;
918 bdb_idl_insert( cx->tmp, ei.bei_id );
919 hdb_cache_load( cx->bdb, &ei, &ei2 );
923 cx->rc = cx->dbc->c_close( cx->dbc );
925 /* The in-memory cache is in sync with the on-disk data.
926 * do we have any kids?
929 if ( cx->ei->bei_ckids > 0 ) {
930 /* Walk the kids tree; order is irrelevant since bdb_idl_insert
931 * will insert in sorted order.
933 avl_apply( cx->ei->bei_kids, apply_func,
934 cx->tmp, -1, AVL_POSTORDER );
936 bdb_cache_entryinfo_unlock( cx->ei );
940 if ( cx->bdb->bi_idl_cache_max_size ) {
941 cx->key.data = &cx->id;
942 bdb_idl_cache_put( cx->bdb, cx->db, &cx->key, cx->tmp, cx->rc );
946 if ( !BDB_IDL_IS_ZERO( cx->tmp )) {
947 if ( cx->prefix == DN_SUBTREE_PREFIX ) {
948 if (cx->ei->bei_state & CACHE_ENTRY_NO_GRANDKIDS) {
949 bdb_idl_union( cx->ids, cx->tmp );
952 EntryInfo *ei = cx->ei;
954 save = cx->op->o_tmpalloc( BDB_IDL_SIZEOF( cx->tmp ),
955 cx->op->o_tmpmemctx );
956 BDB_IDL_CPY( save, cx->tmp );
957 bdb_idl_union( cx->ids, cx->tmp );
960 for ( cx->id = bdb_idl_first( save, &idcurs );
962 cx->id = bdb_idl_next( save, &idcurs )) {
963 BDB_ID2DISK( cx->id, &cx->nid );
965 hdb_dn2idl_internal( cx );
966 if ( !BDB_IDL_IS_ZERO( cx->tmp ))
969 cx->op->o_tmpfree( save, cx->op->o_tmpmemctx );
970 if ( nokids ) ei->bei_state |= CACHE_ENTRY_NO_GRANDKIDS;
972 /* Make sure caller knows it had kids! */
977 BDB_IDL_CPY( cx->ids, cx->tmp );
990 struct bdb_info *bdb = (struct bdb_info *)op->o_bd->be_private;
991 struct dn2id_cookie cx;
993 Debug( LDAP_DEBUG_TRACE, "=> hdb_dn2idl(\"%s\")\n",
994 e->e_nname.bv_val, 0, 0 );
996 #ifndef BDB_MULTIPLE_SUFFIXES
997 if ( op->ors_scope != LDAP_SCOPE_ONELEVEL &&
998 BEI(e)->bei_parent->bei_id == 0 )
1000 BDB_IDL_ALL( bdb, ids );
1006 BDB_ID2DISK( cx.id, &cx.nid );
1007 cx.ei = e->e_id ? BEI(e) : &bdb->bi_cache.c_dntree;
1009 cx.db = cx.bdb->bi_dn2id->bdi_db;
1010 cx.prefix = op->ors_scope == LDAP_SCOPE_ONELEVEL
1011 ? DN_ONE_PREFIX : DN_SUBTREE_PREFIX;
1016 BDB_IDL_ZERO( ids );
1017 if ( cx.prefix == DN_SUBTREE_PREFIX ) {
1018 bdb_idl_insert( ids, cx.id );
1022 cx.key.ulen = sizeof(ID);
1023 cx.key.size = sizeof(ID);
1024 cx.key.flags = DB_DBT_USERMEM;
1028 return hdb_dn2idl_internal(&cx);
1030 #endif /* BDB_HIER */