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 );
364 rc = bdb_idl_fetch_key( op->o_bd, db, NULL, &key, ids, NULL, 0 );
367 Debug( LDAP_DEBUG_TRACE,
368 "<= bdb_dn2idl: get failed: %s (%d)\n",
369 db_strerror( rc ), rc, 0 );
372 Debug( LDAP_DEBUG_TRACE,
373 "<= bdb_dn2idl: id=%ld first=%ld last=%ld\n",
375 (long) BDB_IDL_FIRST( ids ), (long) BDB_IDL_LAST( ids ) );
378 op->o_tmpfree( key.data, op->o_tmpmemctx );
383 /* Experimental management routines for a hierarchically structured database.
385 * Unsupported! Use at your own risk!
386 * -- Howard Chu, Symas Corp. 2003.
388 * Instead of a ldbm-style dn2id database, we use a hierarchical one. Each
389 * entry in this database is a struct diskNode, keyed by entryID and with
390 * the data containing the RDN and entryID of the node's children. We use
391 * a B-Tree with sorted duplicates to store all the children of a node under
392 * the same key. Also, the first item under the key contains the entry's own
393 * rdn and the ID of the node's parent, to allow bottom-up tree traversal as
394 * well as top-down. To keep this info first in the list, the high bit of all
395 * subsequent nrdnlen's is always set. This means we can only accomodate
396 * RDNs up to length 32767, but that's fine since full DNs are already
397 * restricted to 8192.
399 * The diskNode is a variable length structure. This definition is not
400 * directly usable for in-memory manipulation.
402 typedef struct diskNode {
403 unsigned char nrdnlen[2];
404 unsigned char nrdn[1];
405 unsigned char rdn[1];
406 unsigned char entryID[sizeof(ID)];
409 /* This function constructs a full DN for a given entry.
416 int rlen = 0, nrlen = 0;
420 /* count length of all DN components */
421 for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
422 rlen += ei->bei_rdn.bv_len + 1;
423 nrlen += ei->bei_nrdn.bv_len + 1;
424 if (ei->bei_modrdns > max) max = ei->bei_modrdns;
427 /* See if the entry DN was invalidated by a subtree rename */
429 if ( BEI(e)->bei_modrdns >= max ) {
432 /* We found a mismatch, tell the caller to lock it */
433 if ( checkit == 1 ) {
436 /* checkit == 2. do the fix. */
437 free( e->e_name.bv_val );
438 free( e->e_nname.bv_val );
441 e->e_name.bv_len = rlen - 1;
442 e->e_nname.bv_len = nrlen - 1;
443 e->e_name.bv_val = ch_malloc(rlen);
444 e->e_nname.bv_val = ch_malloc(nrlen);
445 ptr = e->e_name.bv_val;
446 nptr = e->e_nname.bv_val;
447 for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
448 ptr = lutil_strcopy(ptr, ei->bei_rdn.bv_val);
449 nptr = lutil_strcopy(nptr, ei->bei_nrdn.bv_val);
450 if ( ei->bei_parent ) {
455 BEI(e)->bei_modrdns = max;
462 /* We add two elements to the DN2ID database - a data item under the parent's
463 * entryID containing the child's RDN and entryID, and an item under the
464 * child's entryID containing the parent's entryID.
473 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
474 DB *db = bdb->bi_dn2id->bdi_db;
481 nrlen = dn_rdnlen( op->o_bd, &e->e_nname );
483 rlen = dn_rdnlen( op->o_bd, &e->e_name );
485 nrlen = e->e_nname.bv_len;
486 rlen = e->e_name.bv_len;
489 d = op->o_tmpalloc(sizeof(diskNode) + rlen + nrlen, op->o_tmpmemctx);
490 d->nrdnlen[1] = nrlen & 0xff;
491 d->nrdnlen[0] = (nrlen >> 8) | 0x80;
492 ptr = lutil_strncopy( d->nrdn, e->e_nname.bv_val, nrlen );
494 ptr = lutil_strncopy( ptr, e->e_name.bv_val, rlen );
496 BDB_ID2DISK( e->e_id, ptr );
501 key.size = sizeof(ID);
502 key.flags = DB_DBT_USERMEM;
503 BDB_ID2DISK( eip->bei_id, &nid );
505 /* Need to make dummy root node once. Subsequent attempts
506 * will fail harmlessly.
508 if ( eip->bei_id == 0 ) {
509 diskNode dummy = {0};
511 data.size = sizeof(diskNode);
512 data.flags = DB_DBT_USERMEM;
514 db->put( db, txn, &key, &data, DB_NODUPDATA );
517 if ( bdb->bi_idl_cache_size ) {
518 bdb_idl_cache_del( bdb, db, &key );
521 data.size = sizeof(diskNode) + rlen + nrlen;
522 data.flags = DB_DBT_USERMEM;
524 rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
527 BDB_ID2DISK( e->e_id, &nid );
528 BDB_ID2DISK( eip->bei_id, ptr );
529 d->nrdnlen[0] ^= 0x80;
531 rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
534 op->o_tmpfree( d, op->o_tmpmemctx );
546 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
547 DB *db = bdb->bi_dn2id->bdi_db;
555 key.size = sizeof(ID);
558 key.flags = DB_DBT_USERMEM;
559 BDB_ID2DISK( eip->bei_id, &nid );
562 data.size = sizeof(diskNode) + BEI(e)->bei_nrdn.bv_len - sizeof(ID) - 1;
563 data.ulen = data.size;
564 data.dlen = data.size;
565 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
567 if ( bdb->bi_idl_cache_size ) {
568 bdb_idl_cache_del( bdb, db, &key );
570 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
573 d = op->o_tmpalloc( data.size, op->o_tmpmemctx );
574 d->nrdnlen[1] = BEI(e)->bei_nrdn.bv_len & 0xff;
575 d->nrdnlen[0] = (BEI(e)->bei_nrdn.bv_len >> 8) | 0x80;
576 strcpy( d->nrdn, BEI(e)->bei_nrdn.bv_val );
579 /* Delete our ID from the parent's list */
580 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH_RANGE | DB_RMW );
582 if ( !strcmp( d->nrdn, BEI(e)->bei_nrdn.bv_val ))
583 rc = cursor->c_del( cursor, 0 );
588 /* Delete our ID from the tree. With sorted duplicates, this
589 * will leave any child nodes still hanging around. This is OK
590 * for modrdn, which will add our info back in later.
593 BDB_ID2DISK( e->e_id, &nid );
594 rc = cursor->c_get( cursor, &key, &data, DB_SET | DB_RMW );
596 rc = cursor->c_del( cursor, 0 );
598 cursor->c_close( cursor );
599 op->o_tmpfree( d, op->o_tmpmemctx );
612 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
613 DB *db = bdb->bi_dn2id->bdi_db;
621 nrlen = dn_rdnlen( op->o_bd, in );
622 if (!nrlen) nrlen = in->bv_len;
625 key.size = sizeof(ID);
627 key.ulen = sizeof(ID);
628 key.flags = DB_DBT_USERMEM;
629 BDB_ID2DISK( ei->bei_parent->bei_id, &idp );
632 data.size = sizeof(diskNode) + nrlen - sizeof(ID) - 1;
633 data.ulen = data.size * 3;
634 data.dlen = data.ulen;
635 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
637 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
640 d = op->o_tmpalloc( data.size * 3, op->o_tmpmemctx );
641 d->nrdnlen[1] = nrlen & 0xff;
642 d->nrdnlen[0] = (nrlen >> 8) | 0x80;
643 ptr = lutil_strncopy( d->nrdn, in->bv_val, nrlen );
647 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH_RANGE );
648 if ( rc == 0 && strncmp( d->nrdn, in->bv_val, nrlen )) {
652 ptr = data.data + data.size - sizeof(ID);
653 BDB_DISK2ID( ptr, &ei->bei_id );
654 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) - nrlen;
655 ptr = d->nrdn + nrlen + 1;
656 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
657 if ( !ei->bei_parent->bei_dkids ) {
659 /* How many children does the parent have? */
660 /* FIXME: do we need to lock the parent
661 * entryinfo? Seems safe...
663 cursor->c_count( cursor, &dkids, 0 );
664 ei->bei_parent->bei_dkids = dkids;
667 cursor->c_close( cursor );
668 op->o_tmpfree( d, op->o_tmpmemctx );
680 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
681 DB *db = bdb->bi_dn2id->bdi_db;
691 key.size = sizeof(ID);
693 key.ulen = sizeof(ID);
694 key.flags = DB_DBT_USERMEM;
695 BDB_ID2DISK( ei->bei_id, &nid );
698 data.flags = DB_DBT_USERMEM;
700 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
703 data.ulen = sizeof(diskNode) + (SLAP_LDAPDN_MAXLEN * 2);
704 d = op->o_tmpalloc( data.ulen, op->o_tmpmemctx );
707 rc = cursor->c_get( cursor, &key, &data, DB_SET );
709 if (d->nrdnlen[0] & 0x80) {
713 ptr = data.data + data.size - sizeof(ID);
714 BDB_DISK2ID( ptr, idp );
715 ei->bei_nrdn.bv_len = (d->nrdnlen[0] << 8) | d->nrdnlen[1];
716 ber_str2bv( d->nrdn, ei->bei_nrdn.bv_len, 1, &ei->bei_nrdn );
717 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) -
719 ptr = d->nrdn + ei->bei_nrdn.bv_len + 1;
720 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
721 /* How many children does this node have? */
722 cursor->c_count( cursor, &dkids, 0 );
723 ei->bei_dkids = dkids;
726 cursor->c_close( cursor );
727 op->o_tmpfree( d, op->o_tmpmemctx );
737 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
738 DB *db = bdb->bi_dn2id->bdi_db;
746 key.size = sizeof(ID);
748 key.flags = DB_DBT_USERMEM;
749 BDB_ID2DISK( e->e_id, &id );
751 /* IDL cache is in host byte order */
752 if ( bdb->bi_idl_cache_size ) {
753 rc = bdb_idl_cache_get( bdb, db, &key, NULL );
754 if ( rc != LDAP_NO_SUCH_OBJECT ) {
762 data.ulen = sizeof(d);
763 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
764 data.dlen = sizeof(d);
766 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
769 rc = cursor->c_get( cursor, &key, &data, DB_SET );
772 rc = cursor->c_count( cursor, &dkids, 0 );
774 BEI(e)->bei_dkids = dkids;
775 if ( dkids < 2 ) rc = DB_NOTFOUND;
778 cursor->c_close( cursor );
783 * We can't just use bdb_idl_fetch_key because
784 * 1 - our data items are longer than just an entry ID
785 * 2 - our data items are sorted alphabetically by nrdn, not by ID.
787 * We descend the tree recursively, so we define this cookie
788 * to hold our necessary state information. The bdb_dn2idl_internal
789 * function uses this cookie when calling itself.
792 struct dn2id_cookie {
793 struct bdb_info *bdb;
803 ID tmp[BDB_IDL_DB_SIZE];
816 EntryInfo *ei = data;
819 bdb_idl_insert( idl, ei->bei_id );
825 struct dn2id_cookie *cx
828 if ( cx->bdb->bi_idl_cache_size ) {
829 cx->key.data = &cx->id;
830 cx->rc = bdb_idl_cache_get(cx->bdb, cx->db, &cx->key, cx->tmp);
831 if ( cx->rc == DB_NOTFOUND ) {
834 if ( cx->rc == LDAP_SUCCESS ) {
838 BDB_IDL_ZERO( cx->tmp );
841 cx->ei = bdb_cache_find_info( cx->bdb, cx->id );
843 cx->rc = DB_NOTFOUND;
848 bdb_cache_entryinfo_lock( cx->ei );
850 /* If number of kids in the cache differs from on-disk, load
851 * up all the kids from the database
853 if ( cx->ei->bei_ckids+1 != cx->ei->bei_dkids ) {
855 db_recno_t dkids = cx->ei->bei_dkids;
856 ei.bei_parent = cx->ei;
858 bdb_cache_entryinfo_unlock( cx->ei );
860 cx->rc = cx->db->cursor( cx->db, NULL, &cx->dbc,
861 cx->bdb->bi_db_opflags );
862 if ( cx->rc ) return cx->rc;
864 cx->data.data = &cx->dbuf;
865 cx->data.ulen = sizeof(ID);
866 cx->data.dlen = sizeof(ID);
867 cx->data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
869 /* The first item holds the parent ID. Ignore it. */
870 cx->key.data = &cx->nid;
871 cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data, DB_SET );
873 cx->dbc->c_close( cx->dbc );
874 if ( cx->rc == DB_NOTFOUND ) goto saveit;
878 /* If the on-disk count is zero we've never checked it.
882 cx->dbc->c_count( cx->dbc, &dkids, 0 );
883 cx->ei->bei_dkids = dkids;
886 cx->data.data = cx->buf;
887 cx->data.ulen = BDB_IDL_UM_SIZE * sizeof(ID);
888 cx->data.flags = DB_DBT_USERMEM;
890 /* Fetch the rest of the IDs in a loop... */
891 while ( (cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data,
892 DB_MULTIPLE | DB_NEXT_DUP )) == 0 ) {
895 DB_MULTIPLE_INIT( cx->ptr, &cx->data );
897 DB_MULTIPLE_NEXT( cx->ptr, &cx->data, j, len );
900 diskNode *d = (diskNode *)j;
903 BDB_DISK2ID( j + len - sizeof(ID), &ei.bei_id );
904 nrlen = ((d->nrdnlen[0] ^ 0x80) << 8) | d->nrdnlen[1];
905 ei.bei_nrdn.bv_len = nrlen;
906 /* nrdn/rdn are set in-place.
907 * hdb_cache_load will copy them as needed
909 ei.bei_nrdn.bv_val = d->nrdn;
910 ei.bei_rdn.bv_len = len - sizeof(diskNode)
911 - ei.bei_nrdn.bv_len;
912 ei.bei_rdn.bv_val = d->nrdn + ei.bei_nrdn.bv_len + 1;
913 bdb_idl_insert( cx->tmp, ei.bei_id );
914 hdb_cache_load( cx->bdb, &ei, &ei2 );
918 cx->rc = cx->dbc->c_close( cx->dbc );
920 /* The in-memory cache is in sync with the on-disk data.
921 * do we have any kids?
924 if ( cx->ei->bei_ckids > 0 ) {
925 /* Walk the kids tree; order is irrelevant since bdb_idl_insert
926 * will insert in sorted order.
928 avl_apply( cx->ei->bei_kids, apply_func,
929 cx->tmp, -1, AVL_POSTORDER );
931 bdb_cache_entryinfo_unlock( cx->ei );
935 if ( cx->bdb->bi_idl_cache_max_size ) {
936 cx->key.data = &cx->id;
937 bdb_idl_cache_put( cx->bdb, cx->db, &cx->key, cx->tmp, cx->rc );
941 if ( !BDB_IDL_IS_ZERO( cx->tmp )) {
942 if ( cx->prefix == DN_SUBTREE_PREFIX ) {
943 if (cx->ei->bei_state & CACHE_ENTRY_NO_GRANDKIDS) {
944 bdb_idl_union( cx->ids, cx->tmp );
947 EntryInfo *ei = cx->ei;
949 save = cx->op->o_tmpalloc( BDB_IDL_SIZEOF( cx->tmp ),
950 cx->op->o_tmpmemctx );
951 BDB_IDL_CPY( save, cx->tmp );
952 bdb_idl_union( cx->ids, cx->tmp );
955 for ( cx->id = bdb_idl_first( save, &idcurs );
957 cx->id = bdb_idl_next( save, &idcurs )) {
958 BDB_ID2DISK( cx->id, &cx->nid );
960 hdb_dn2idl_internal( cx );
961 if ( !BDB_IDL_IS_ZERO( cx->tmp ))
964 cx->op->o_tmpfree( save, cx->op->o_tmpmemctx );
965 if ( nokids ) ei->bei_state |= CACHE_ENTRY_NO_GRANDKIDS;
967 /* Make sure caller knows it had kids! */
972 BDB_IDL_CPY( cx->ids, cx->tmp );
985 struct bdb_info *bdb = (struct bdb_info *)op->o_bd->be_private;
986 struct dn2id_cookie cx;
988 Debug( LDAP_DEBUG_TRACE, "=> hdb_dn2idl(\"%s\")\n",
989 e->e_nname.bv_val, 0, 0 );
991 #ifndef BDB_MULTIPLE_SUFFIXES
992 if ( op->ors_scope != LDAP_SCOPE_ONELEVEL &&
993 BEI(e)->bei_parent->bei_id == 0 )
995 BDB_IDL_ALL( bdb, ids );
1001 BDB_ID2DISK( cx.id, &cx.nid );
1002 cx.ei = e->e_id ? BEI(e) : &bdb->bi_cache.c_dntree;
1004 cx.db = cx.bdb->bi_dn2id->bdi_db;
1005 cx.prefix = op->ors_scope == LDAP_SCOPE_ONELEVEL
1006 ? DN_ONE_PREFIX : DN_SUBTREE_PREFIX;
1011 BDB_IDL_ZERO( ids );
1012 if ( cx.prefix == DN_SUBTREE_PREFIX ) {
1013 bdb_idl_insert( ids, cx.id );
1017 cx.key.ulen = sizeof(ID);
1018 cx.key.size = sizeof(ID);
1019 cx.key.flags = DB_DBT_USERMEM;
1023 return hdb_dn2idl_internal(&cx);
1025 #endif /* BDB_HIER */