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-2008 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 #define bdb_dn2id_lock BDB_SYMBOL(dn2id_lock)
29 bdb_dn2id_lock( struct bdb_info *bdb, struct berval *dn,
30 int rw, DB_TXN *txn, DB_LOCK *lock )
40 db_rw = DB_LOCK_WRITE;
44 lockobj.data = dn->bv_val;
45 lockobj.size = dn->bv_len;
47 rc = LOCK_GET(bdb->bi_dbenv, TXN_ID(txn), DB_LOCK_NOWAIT,
48 &lockobj, db_rw, lock);
60 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
61 DB *db = bdb->bi_dn2id->bdi_db;
66 struct berval ptr, pdn;
68 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_add 0x%lx: \"%s\"\n",
69 e->e_id, e->e_ndn, 0 );
70 assert( e->e_id != NOID );
73 key.size = e->e_nname.bv_len + 2;
75 key.flags = DB_DBT_USERMEM;
76 buf = op->o_tmpalloc( key.size, op->o_tmpmemctx );
78 buf[0] = DN_BASE_PREFIX;
80 ptr.bv_len = e->e_nname.bv_len;
81 AC_MEMCPY( ptr.bv_val, e->e_nname.bv_val, e->e_nname.bv_len );
82 ptr.bv_val[ptr.bv_len] = '\0';
86 data.size = sizeof( nid );
87 BDB_ID2DISK( e->e_id, &nid );
89 /* store it -- don't override */
90 rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
92 Debug( LDAP_DEBUG_ANY, "=> bdb_dn2id_add 0x%lx: put failed: %s %d\n",
93 e->e_id, db_strerror(rc), rc );
97 #ifndef BDB_MULTIPLE_SUFFIXES
98 if( !be_issuffix( op->o_bd, &ptr ))
101 buf[0] = DN_SUBTREE_PREFIX;
102 rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
104 Debug( LDAP_DEBUG_ANY,
105 "=> bdb_dn2id_add 0x%lx: subtree (%s) put failed: %d\n",
106 e->e_id, ptr.bv_val, rc );
110 #ifdef BDB_MULTIPLE_SUFFIXES
111 if( !be_issuffix( op->o_bd, &ptr ))
114 dnParent( &ptr, &pdn );
116 key.size = pdn.bv_len + 2;
118 pdn.bv_val[-1] = DN_ONE_PREFIX;
119 key.data = pdn.bv_val-1;
122 rc = bdb_idl_insert_key( op->o_bd, db, txn, &key, e->e_id );
125 Debug( LDAP_DEBUG_ANY,
126 "=> bdb_dn2id_add 0x%lx: parent (%s) insert failed: %d\n",
127 e->e_id, ptr.bv_val, rc );
132 #ifndef BDB_MULTIPLE_SUFFIXES
133 while( !be_issuffix( op->o_bd, &ptr ))
138 ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
140 rc = bdb_idl_insert_key( op->o_bd, db, txn, &key, e->e_id );
143 Debug( LDAP_DEBUG_ANY,
144 "=> bdb_dn2id_add 0x%lx: subtree (%s) insert failed: %d\n",
145 e->e_id, ptr.bv_val, rc );
148 #ifdef BDB_MULTIPLE_SUFFIXES
149 if( be_issuffix( op->o_bd, &ptr )) break;
151 dnParent( &ptr, &pdn );
153 key.size = pdn.bv_len + 2;
155 key.data = pdn.bv_val - 1;
161 op->o_tmpfree( buf, op->o_tmpmemctx );
162 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_add 0x%lx: %d\n", e->e_id, rc, 0 );
173 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
174 DB *db = bdb->bi_dn2id->bdi_db;
178 struct berval pdn, ptr;
181 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_delete 0x%lx: \"%s\"\n",
182 e->e_id, e->e_ndn, 0 );
185 key.size = e->e_nname.bv_len + 2;
186 buf = op->o_tmpalloc( key.size, op->o_tmpmemctx );
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';
195 /* We hold this lock until the TXN completes */
196 rc = bdb_dn2id_lock( bdb, &e->e_nname, 1, txn, &lock );
200 rc = db->del( db, txn, &key, 0 );
202 Debug( LDAP_DEBUG_ANY, "=> bdb_dn2id_delete 0x%lx: delete failed: %s %d\n",
203 e->e_id, db_strerror(rc), rc );
207 #ifndef BDB_MULTIPLE_SUFFIXES
208 if( !be_issuffix( op->o_bd, &ptr ))
211 buf[0] = DN_SUBTREE_PREFIX;
212 rc = bdb_idl_delete_key( op->o_bd, db, txn, &key, e->e_id );
214 Debug( LDAP_DEBUG_ANY,
215 "=> bdb_dn2id_delete 0x%lx: subtree (%s) delete failed: %d\n",
216 e->e_id, ptr.bv_val, rc );
220 #ifdef BDB_MULTIPLE_SUFFIXES
221 if( !be_issuffix( op->o_bd, &ptr ))
224 dnParent( &ptr, &pdn );
226 key.size = pdn.bv_len + 2;
228 pdn.bv_val[-1] = DN_ONE_PREFIX;
229 key.data = pdn.bv_val - 1;
232 rc = bdb_idl_delete_key( op->o_bd, db, txn, &key, e->e_id );
235 Debug( LDAP_DEBUG_ANY,
236 "=> bdb_dn2id_delete 0x%lx: parent (%s) delete failed: %d\n",
237 e->e_id, ptr.bv_val, rc );
242 #ifndef BDB_MULTIPLE_SUFFIXES
243 while( !be_issuffix( op->o_bd, &ptr ))
248 ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
250 rc = bdb_idl_delete_key( op->o_bd, db, txn, &key, e->e_id );
252 Debug( LDAP_DEBUG_ANY,
253 "=> bdb_dn2id_delete 0x%lx: subtree (%s) delete failed: %d\n",
254 e->e_id, ptr.bv_val, rc );
257 #ifdef BDB_MULTIPLE_SUFFIXES
258 if( be_issuffix( op->o_bd, &ptr )) break;
260 dnParent( &ptr, &pdn );
262 key.size = pdn.bv_len + 2;
264 key.data = pdn.bv_val - 1;
270 op->o_tmpfree( buf, op->o_tmpmemctx );
271 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_delete 0x%lx: %d\n", e->e_id, rc, 0 );
283 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
284 DB *db = bdb->bi_dn2id->bdi_db;
290 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id(\"%s\")\n", dn->bv_val, 0, 0 );
293 key.size = dn->bv_len + 2;
294 key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
295 ((char *)key.data)[0] = DN_BASE_PREFIX;
296 AC_MEMCPY( &((char *)key.data)[1], dn->bv_val, key.size - 1 );
301 data.ulen = sizeof(ID);
302 data.flags = DB_DBT_USERMEM;
304 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
305 if ( rc ) goto func_leave;
307 rc = bdb_dn2id_lock( bdb, dn, 0, txn, lock );
308 if ( rc ) goto nolock;
311 rc = cursor->c_get( cursor, &key, &data, DB_SET );
314 cursor->c_close( cursor );
318 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: get failed: %s (%d)\n",
319 db_strerror( rc ), rc, 0 );
321 BDB_DISK2ID( &nid, &ei->bei_id );
322 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: got id=0x%lx\n",
325 op->o_tmpfree( key.data, op->o_tmpmemctx );
336 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
337 DB *db = bdb->bi_dn2id->bdi_db;
341 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_children(\"%s\")\n",
342 e->e_nname.bv_val, 0, 0 );
344 key.size = e->e_nname.bv_len + 2;
345 key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
346 ((char *)key.data)[0] = DN_ONE_PREFIX;
347 AC_MEMCPY( &((char *)key.data)[1], e->e_nname.bv_val, key.size - 1 );
349 if ( bdb->bi_idl_cache_size ) {
350 rc = bdb_idl_cache_get( bdb, db, &key, NULL );
351 if ( rc != LDAP_NO_SUCH_OBJECT ) {
352 op->o_tmpfree( key.data, op->o_tmpmemctx );
356 /* we actually could do a empty get... */
359 data.ulen = sizeof(id);
360 data.flags = DB_DBT_USERMEM;
362 data.dlen = sizeof(id);
364 rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
365 op->o_tmpfree( key.data, op->o_tmpmemctx );
367 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_children(\"%s\"): %s (%d)\n",
369 rc == 0 ? "" : ( rc == DB_NOTFOUND ? "no " :
370 db_strerror(rc) ), rc );
386 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
387 DB *db = bdb->bi_dn2id->bdi_db;
388 int prefix = ( op->ors_scope == LDAP_SCOPE_ONELEVEL )
389 ? DN_ONE_PREFIX : DN_SUBTREE_PREFIX;
391 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2idl(\"%s\")\n",
394 #ifndef BDB_MULTIPLE_SUFFIXES
395 if ( prefix == DN_SUBTREE_PREFIX
396 && ( ei->bei_id == 0 ||
397 ( ei->bei_parent->bei_id == 0 && op->o_bd->be_suffix[0].bv_len ))) {
398 BDB_IDL_ALL(bdb, ids);
404 key.size = ndn->bv_len + 2;
406 key.flags = DB_DBT_USERMEM;
407 key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
408 ((char *)key.data)[0] = prefix;
409 AC_MEMCPY( &((char *)key.data)[1], ndn->bv_val, key.size - 1 );
412 rc = bdb_idl_fetch_key( op->o_bd, db, txn, &key, ids, NULL, 0 );
415 Debug( LDAP_DEBUG_TRACE,
416 "<= bdb_dn2idl: get failed: %s (%d)\n",
417 db_strerror( rc ), rc, 0 );
420 Debug( LDAP_DEBUG_TRACE,
421 "<= bdb_dn2idl: id=%ld first=%ld last=%ld\n",
423 (long) BDB_IDL_FIRST( ids ), (long) BDB_IDL_LAST( ids ) );
426 op->o_tmpfree( key.data, op->o_tmpmemctx );
431 /* Management routines for a hierarchically structured database.
433 * Instead of a ldbm-style dn2id database, we use a hierarchical one. Each
434 * entry in this database is a struct diskNode, keyed by entryID and with
435 * the data containing the RDN and entryID of the node's children. We use
436 * a B-Tree with sorted duplicates to store all the children of a node under
437 * the same key. Also, the first item under the key contains the entry's own
438 * rdn and the ID of the node's parent, to allow bottom-up tree traversal as
439 * well as top-down. To keep this info first in the list, the high bit of all
440 * subsequent nrdnlen's is always set. This means we can only accomodate
441 * RDNs up to length 32767, but that's fine since full DNs are already
442 * restricted to 8192.
444 * The diskNode is a variable length structure. This definition is not
445 * directly usable for in-memory manipulation.
447 typedef struct diskNode {
448 unsigned char nrdnlen[2];
450 char rdn[1]; /* variable placement */
451 unsigned char entryID[sizeof(ID)]; /* variable placement */
454 /* Sort function for the sorted duplicate data items of a dn2id key.
455 * Sorts based on normalized RDN, in length order.
467 un = (diskNode *)usrkey->data;
468 cn = (diskNode *)curkey->data;
470 /* data is not aligned, cannot compare directly */
471 rc = un->nrdnlen[0] - cn->nrdnlen[0];
473 rc = un->nrdnlen[1] - cn->nrdnlen[1];
476 return strcmp( un->nrdn, cn->nrdn );
479 /* This function constructs a full DN for a given entry.
486 int rlen = 0, nrlen = 0;
493 /* count length of all DN components */
494 for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
495 rlen += ei->bei_rdn.bv_len + 1;
496 nrlen += ei->bei_nrdn.bv_len + 1;
497 if (ei->bei_modrdns > max) max = ei->bei_modrdns;
500 /* See if the entry DN was invalidated by a subtree rename */
502 if ( BEI(e)->bei_modrdns >= max ) {
505 /* We found a mismatch, tell the caller to lock it */
506 if ( checkit == 1 ) {
509 /* checkit == 2. do the fix. */
510 free( e->e_name.bv_val );
511 free( e->e_nname.bv_val );
514 e->e_name.bv_len = rlen - 1;
515 e->e_nname.bv_len = nrlen - 1;
516 e->e_name.bv_val = ch_malloc(rlen);
517 e->e_nname.bv_val = ch_malloc(nrlen);
518 ptr = e->e_name.bv_val;
519 nptr = e->e_nname.bv_val;
520 for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
521 ptr = lutil_strcopy(ptr, ei->bei_rdn.bv_val);
522 nptr = lutil_strcopy(nptr, ei->bei_nrdn.bv_val);
523 if ( ei->bei_parent ) {
528 BEI(e)->bei_modrdns = max;
535 /* We add two elements to the DN2ID database - a data item under the parent's
536 * entryID containing the child's RDN and entryID, and an item under the
537 * child's entryID containing the parent's entryID.
546 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
547 DB *db = bdb->bi_dn2id->bdi_db;
554 Debug( LDAP_DEBUG_TRACE, "=> hdb_dn2id_add 0x%lx: \"%s\"\n",
555 e->e_id, e->e_ndn, 0 );
557 nrlen = dn_rdnlen( op->o_bd, &e->e_nname );
559 rlen = dn_rdnlen( op->o_bd, &e->e_name );
561 nrlen = e->e_nname.bv_len;
562 rlen = e->e_name.bv_len;
565 d = op->o_tmpalloc(sizeof(diskNode) + rlen + nrlen, op->o_tmpmemctx);
566 d->nrdnlen[1] = nrlen & 0xff;
567 d->nrdnlen[0] = (nrlen >> 8) | 0x80;
568 ptr = lutil_strncopy( d->nrdn, e->e_nname.bv_val, nrlen );
570 ptr = lutil_strncopy( ptr, e->e_name.bv_val, rlen );
572 BDB_ID2DISK( e->e_id, ptr );
576 key.size = sizeof(ID);
577 key.flags = DB_DBT_USERMEM;
578 BDB_ID2DISK( eip->bei_id, &nid );
582 /* Need to make dummy root node once. Subsequent attempts
583 * will fail harmlessly.
585 if ( eip->bei_id == 0 ) {
586 diskNode dummy = {{0, 0}, "", "", ""};
588 data.size = sizeof(diskNode);
589 data.flags = DB_DBT_USERMEM;
591 db->put( db, txn, &key, &data, DB_NODUPDATA );
595 data.size = sizeof(diskNode) + rlen + nrlen;
596 data.flags = DB_DBT_USERMEM;
598 rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
601 BDB_ID2DISK( e->e_id, &nid );
602 BDB_ID2DISK( eip->bei_id, ptr );
603 d->nrdnlen[0] ^= 0x80;
605 rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
608 /* Update all parents' IDL cache entries */
609 if ( rc == 0 && bdb->bi_idl_cache_size ) {
611 char *ptr = ((char *)&tmp[1])-1;
613 key.size = sizeof(ID)+1;
614 tmp[1] = eip->bei_id;
615 *ptr = DN_ONE_PREFIX;
616 bdb_idl_cache_add_id( bdb, db, &key, e->e_id );
617 if ( eip->bei_parent ) {
618 *ptr = DN_SUBTREE_PREFIX;
619 for (; eip && eip->bei_parent->bei_id; eip = eip->bei_parent) {
620 tmp[1] = eip->bei_id;
621 bdb_idl_cache_add_id( bdb, db, &key, e->e_id );
626 op->o_tmpfree( d, op->o_tmpmemctx );
627 Debug( LDAP_DEBUG_TRACE, "<= hdb_dn2id_add 0x%lx: %d\n", e->e_id, rc, 0 );
639 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
640 DB *db = bdb->bi_dn2id->bdi_db;
646 unsigned char dlen[2];
649 Debug( LDAP_DEBUG_TRACE, "=> hdb_dn2id_delete 0x%lx: \"%s\"\n",
650 e->e_id, e->e_ndn, 0 );
653 key.size = sizeof(ID);
655 key.flags = DB_DBT_USERMEM;
656 BDB_ID2DISK( eip->bei_id, &nid );
659 data.size = sizeof(diskNode) + BEI(e)->bei_nrdn.bv_len - sizeof(ID) - 1;
660 data.ulen = data.size;
661 data.dlen = data.size;
662 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
666 d = op->o_tmpalloc( data.size, op->o_tmpmemctx );
667 d->nrdnlen[1] = BEI(e)->bei_nrdn.bv_len & 0xff;
668 d->nrdnlen[0] = (BEI(e)->bei_nrdn.bv_len >> 8) | 0x80;
669 dlen[0] = d->nrdnlen[0];
670 dlen[1] = d->nrdnlen[1];
671 strcpy( d->nrdn, BEI(e)->bei_nrdn.bv_val );
674 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
675 if ( rc ) goto func_leave;
677 /* We hold this lock until the TXN completes */
678 rc = bdb_dn2id_lock( bdb, &e->e_nname, 1, txn, &lock );
679 if ( rc ) goto nolock;
681 /* Delete our ID from the parent's list */
682 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH_RANGE );
684 if ( dlen[1] == d->nrdnlen[1] && dlen[0] == d->nrdnlen[0] &&
685 !strcmp( d->nrdn, BEI(e)->bei_nrdn.bv_val ))
686 rc = cursor->c_del( cursor, 0 );
691 /* Delete our ID from the tree. With sorted duplicates, this
692 * will leave any child nodes still hanging around. This is OK
693 * for modrdn, which will add our info back in later.
696 BDB_ID2DISK( e->e_id, &nid );
697 rc = cursor->c_get( cursor, &key, &data, DB_SET );
699 rc = cursor->c_del( cursor, 0 );
703 cursor->c_close( cursor );
705 op->o_tmpfree( d, op->o_tmpmemctx );
707 /* Delete IDL cache entries */
708 if ( rc == 0 && bdb->bi_idl_cache_size ) {
710 char *ptr = ((char *)&tmp[1])-1;
712 key.size = sizeof(ID)+1;
713 tmp[1] = eip->bei_id;
714 *ptr = DN_ONE_PREFIX;
715 bdb_idl_cache_del_id( bdb, db, &key, e->e_id );
716 if ( eip ->bei_parent ) {
717 *ptr = DN_SUBTREE_PREFIX;
718 for (; eip && eip->bei_parent->bei_id; eip = eip->bei_parent) {
719 tmp[1] = eip->bei_id;
720 bdb_idl_cache_del_id( bdb, db, &key, e->e_id );
724 Debug( LDAP_DEBUG_TRACE, "<= hdb_dn2id_delete 0x%lx: %d\n", e->e_id, rc, 0 );
737 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
738 DB *db = bdb->bi_dn2id->bdi_db;
744 unsigned char dlen[2];
747 Debug( LDAP_DEBUG_TRACE, "=> hdb_dn2id(\"%s\")\n", in->bv_val, 0, 0 );
749 nrlen = dn_rdnlen( op->o_bd, in );
750 if (!nrlen) nrlen = in->bv_len;
753 key.size = sizeof(ID);
755 key.ulen = sizeof(ID);
756 key.flags = DB_DBT_USERMEM;
757 parentID = ( ei->bei_parent != NULL ) ? ei->bei_parent->bei_id : 0;
758 BDB_ID2DISK( parentID, &idp );
761 data.size = sizeof(diskNode) + nrlen - sizeof(ID) - 1;
762 data.ulen = data.size * 3;
763 data.dlen = data.ulen;
764 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
766 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
769 d = op->o_tmpalloc( data.size * 3, op->o_tmpmemctx );
770 d->nrdnlen[1] = nrlen & 0xff;
771 d->nrdnlen[0] = (nrlen >> 8) | 0x80;
772 dlen[0] = d->nrdnlen[0];
773 dlen[1] = d->nrdnlen[1];
774 ptr = lutil_strncopy( d->nrdn, in->bv_val, nrlen );
778 rc = bdb_dn2id_lock( bdb, in, 0, txn, lock );
779 if ( rc ) goto func_leave;
781 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH_RANGE );
782 if ( rc == 0 && (dlen[1] != d->nrdnlen[1] || dlen[0] != d->nrdnlen[0] ||
783 strncmp( d->nrdn, in->bv_val, nrlen ))) {
787 ptr = (char *) data.data + data.size - sizeof(ID);
788 BDB_DISK2ID( ptr, &ei->bei_id );
789 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) - nrlen;
790 ptr = d->nrdn + nrlen + 1;
791 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
792 if ( ei->bei_parent != NULL && !ei->bei_parent->bei_dkids ) {
794 /* How many children does the parent have? */
795 /* FIXME: do we need to lock the parent
796 * entryinfo? Seems safe...
798 cursor->c_count( cursor, &dkids, 0 );
799 ei->bei_parent->bei_dkids = dkids;
804 cursor->c_close( cursor );
805 op->o_tmpfree( d, op->o_tmpmemctx );
807 Debug( LDAP_DEBUG_TRACE, "<= hdb_dn2id: get failed: %s (%d)\n",
808 db_strerror( rc ), rc, 0 );
810 Debug( LDAP_DEBUG_TRACE, "<= hdb_dn2id: got id=0x%lx\n",
824 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
825 DB *db = bdb->bi_dn2id->bdi_db;
834 key.size = sizeof(ID);
836 key.ulen = sizeof(ID);
837 key.flags = DB_DBT_USERMEM;
838 BDB_ID2DISK( ei->bei_id, &nid );
841 data.flags = DB_DBT_USERMEM;
843 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
846 data.ulen = sizeof(diskNode) + (SLAP_LDAPDN_MAXLEN * 2);
847 d = op->o_tmpalloc( data.ulen, op->o_tmpmemctx );
850 rc = cursor->c_get( cursor, &key, &data, DB_SET );
852 if (d->nrdnlen[0] & 0x80) {
856 ptr = (char *) data.data + data.size - sizeof(ID);
857 BDB_DISK2ID( ptr, idp );
858 ei->bei_nrdn.bv_len = (d->nrdnlen[0] << 8) | d->nrdnlen[1];
859 ber_str2bv( d->nrdn, ei->bei_nrdn.bv_len, 1, &ei->bei_nrdn );
860 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) -
862 ptr = d->nrdn + ei->bei_nrdn.bv_len + 1;
863 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
864 /* How many children does this node have? */
865 cursor->c_count( cursor, &dkids, 0 );
866 ei->bei_dkids = dkids;
869 cursor->c_close( cursor );
870 op->o_tmpfree( d, op->o_tmpmemctx );
880 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
881 DB *db = bdb->bi_dn2id->bdi_db;
889 key.size = sizeof(ID);
891 key.flags = DB_DBT_USERMEM;
892 BDB_ID2DISK( e->e_id, &id );
894 /* IDL cache is in host byte order */
895 if ( bdb->bi_idl_cache_size ) {
896 rc = bdb_idl_cache_get( bdb, db, &key, NULL );
897 if ( rc != LDAP_NO_SUCH_OBJECT ) {
905 data.ulen = sizeof(d);
906 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
907 data.dlen = sizeof(d);
909 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
912 rc = cursor->c_get( cursor, &key, &data, DB_SET );
915 rc = cursor->c_count( cursor, &dkids, 0 );
917 BEI(e)->bei_dkids = dkids;
918 if ( dkids < 2 ) rc = DB_NOTFOUND;
921 cursor->c_close( cursor );
926 * We can't just use bdb_idl_fetch_key because
927 * 1 - our data items are longer than just an entry ID
928 * 2 - our data items are sorted alphabetically by nrdn, not by ID.
930 * We descend the tree recursively, so we define this cookie
931 * to hold our necessary state information. The bdb_dn2idl_internal
932 * function uses this cookie when calling itself.
935 struct dn2id_cookie {
936 struct bdb_info *bdb;
961 EntryInfo *ei = data;
964 bdb_idl_append_one( idl, ei->bei_id );
970 struct dn2id_cookie *cx
973 BDB_IDL_ZERO( cx->tmp );
975 if ( cx->bdb->bi_idl_cache_size ) {
976 char *ptr = ((char *)&cx->id)-1;
979 cx->key.size = sizeof(ID)+1;
980 if ( cx->prefix == DN_SUBTREE_PREFIX ) {
981 ID *ids = cx->depth ? cx->tmp : cx->ids;
983 cx->rc = bdb_idl_cache_get(cx->bdb, cx->db, &cx->key, ids);
984 if ( cx->rc == LDAP_SUCCESS ) {
986 bdb_idl_append( cx->ids, cx->tmp );
992 *ptr = DN_ONE_PREFIX;
993 cx->rc = bdb_idl_cache_get(cx->bdb, cx->db, &cx->key, cx->tmp);
994 if ( cx->rc == LDAP_SUCCESS ) {
997 if ( cx->rc == DB_NOTFOUND ) {
1002 bdb_cache_entryinfo_lock( cx->ei );
1004 /* If number of kids in the cache differs from on-disk, load
1005 * up all the kids from the database
1007 if ( cx->ei->bei_ckids+1 != cx->ei->bei_dkids ) {
1009 db_recno_t dkids = cx->ei->bei_dkids;
1010 ei.bei_parent = cx->ei;
1012 /* Only one thread should load the cache */
1013 while ( cx->ei->bei_state & CACHE_ENTRY_ONELEVEL ) {
1014 bdb_cache_entryinfo_unlock( cx->ei );
1015 ldap_pvt_thread_yield();
1016 bdb_cache_entryinfo_lock( cx->ei );
1017 if ( cx->ei->bei_ckids+1 == cx->ei->bei_dkids ) {
1022 cx->ei->bei_state |= CACHE_ENTRY_ONELEVEL;
1024 bdb_cache_entryinfo_unlock( cx->ei );
1026 cx->rc = cx->db->cursor( cx->db, NULL, &cx->dbc,
1027 cx->bdb->bi_db_opflags );
1031 cx->data.data = &cx->dbuf;
1032 cx->data.ulen = sizeof(ID);
1033 cx->data.dlen = sizeof(ID);
1034 cx->data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
1036 /* The first item holds the parent ID. Ignore it. */
1037 cx->key.data = &cx->nid;
1038 cx->key.size = sizeof(ID);
1039 cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data, DB_SET );
1041 cx->dbc->c_close( cx->dbc );
1045 /* If the on-disk count is zero we've never checked it.
1049 cx->dbc->c_count( cx->dbc, &dkids, 0 );
1050 cx->ei->bei_dkids = dkids;
1053 cx->data.data = cx->buf;
1054 cx->data.ulen = BDB_IDL_UM_SIZE * sizeof(ID);
1055 cx->data.flags = DB_DBT_USERMEM;
1058 /* Fetch the rest of the IDs in a loop... */
1059 while ( (cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data,
1060 DB_MULTIPLE | DB_NEXT_DUP )) == 0 ) {
1064 DB_MULTIPLE_INIT( ptr, &cx->data );
1066 DB_MULTIPLE_NEXT( ptr, &cx->data, j, len );
1069 diskNode *d = (diskNode *)j;
1072 BDB_DISK2ID( j + len - sizeof(ID), &ei.bei_id );
1073 nrlen = ((d->nrdnlen[0] ^ 0x80) << 8) | d->nrdnlen[1];
1074 ei.bei_nrdn.bv_len = nrlen;
1075 /* nrdn/rdn are set in-place.
1076 * hdb_cache_load will copy them as needed
1078 ei.bei_nrdn.bv_val = d->nrdn;
1079 ei.bei_rdn.bv_len = len - sizeof(diskNode)
1080 - ei.bei_nrdn.bv_len;
1081 ei.bei_rdn.bv_val = d->nrdn + ei.bei_nrdn.bv_len + 1;
1082 bdb_idl_append_one( cx->tmp, ei.bei_id );
1083 hdb_cache_load( cx->bdb, &ei, &ei2 );
1089 cx->rc = cx->dbc->c_close( cx->dbc );
1091 bdb_cache_entryinfo_lock( cx->ei );
1092 cx->ei->bei_state ^= CACHE_ENTRY_ONELEVEL;
1093 bdb_cache_entryinfo_unlock( cx->ei );
1098 /* The in-memory cache is in sync with the on-disk data.
1099 * do we have any kids?
1103 if ( cx->ei->bei_ckids > 0 ) {
1104 /* Walk the kids tree; order is irrelevant since bdb_idl_sort
1105 * will sort it later.
1107 avl_apply( cx->ei->bei_kids, apply_func,
1108 cx->tmp, -1, AVL_POSTORDER );
1110 bdb_cache_entryinfo_unlock( cx->ei );
1113 if ( !BDB_IDL_IS_RANGE( cx->tmp ) && cx->tmp[0] > 3 )
1114 bdb_idl_sort( cx->tmp, cx->buf );
1115 if ( cx->bdb->bi_idl_cache_max_size && !BDB_IDL_IS_ZERO( cx->tmp )) {
1116 char *ptr = ((char *)&cx->id)-1;
1118 cx->key.size = sizeof(ID)+1;
1119 *ptr = DN_ONE_PREFIX;
1120 bdb_idl_cache_put( cx->bdb, cx->db, &cx->key, cx->tmp, cx->rc );
1124 if ( !BDB_IDL_IS_ZERO( cx->tmp )) {
1125 if ( cx->prefix == DN_SUBTREE_PREFIX ) {
1126 bdb_idl_append( cx->ids, cx->tmp );
1128 if ( !(cx->ei->bei_state & CACHE_ENTRY_NO_GRANDKIDS)) {
1130 EntryInfo *ei = cx->ei;
1132 save = cx->op->o_tmpalloc( BDB_IDL_SIZEOF( cx->tmp ),
1133 cx->op->o_tmpmemctx );
1134 BDB_IDL_CPY( save, cx->tmp );
1138 for ( cx->id = bdb_idl_first( save, &idcurs );
1140 cx->id = bdb_idl_next( save, &idcurs )) {
1141 cx->ei = bdb_cache_find_info( cx->bdb, cx->id );
1143 ( cx->ei->bei_state & CACHE_ENTRY_NO_KIDS ))
1146 BDB_ID2DISK( cx->id, &cx->nid );
1147 hdb_dn2idl_internal( cx );
1148 if ( !BDB_IDL_IS_ZERO( cx->tmp ))
1152 cx->op->o_tmpfree( save, cx->op->o_tmpmemctx );
1154 bdb_cache_entryinfo_lock( ei );
1155 ei->bei_state |= CACHE_ENTRY_NO_GRANDKIDS;
1156 bdb_cache_entryinfo_unlock( ei );
1159 /* Make sure caller knows it had kids! */
1164 BDB_IDL_CPY( cx->ids, cx->tmp );
1179 struct bdb_info *bdb = (struct bdb_info *)op->o_bd->be_private;
1180 struct dn2id_cookie cx;
1182 Debug( LDAP_DEBUG_TRACE, "=> hdb_dn2idl(\"%s\")\n",
1183 ndn->bv_val, 0, 0 );
1185 #ifndef BDB_MULTIPLE_SUFFIXES
1186 if ( op->ors_scope != LDAP_SCOPE_ONELEVEL &&
1187 ( ei->bei_id == 0 ||
1188 ( ei->bei_parent->bei_id == 0 && op->o_bd->be_suffix[0].bv_len )))
1190 BDB_IDL_ALL( bdb, ids );
1196 BDB_ID2DISK( cx.id, &cx.nid );
1199 cx.db = cx.bdb->bi_dn2id->bdi_db;
1200 cx.prefix = (op->ors_scope == LDAP_SCOPE_ONELEVEL) ?
1201 DN_ONE_PREFIX : DN_SUBTREE_PREFIX;
1204 cx.buf = stack + BDB_IDL_UM_SIZE;
1210 if ( cx.prefix == DN_SUBTREE_PREFIX ) {
1214 BDB_IDL_ZERO( ids );
1216 if ( cx.ei->bei_state & CACHE_ENTRY_NO_KIDS )
1217 return LDAP_SUCCESS;
1220 cx.key.ulen = sizeof(ID);
1221 cx.key.size = sizeof(ID);
1222 cx.key.flags = DB_DBT_USERMEM;
1226 hdb_dn2idl_internal(&cx);
1227 if ( cx.need_sort ) {
1228 char *ptr = ((char *)&cx.id)-1;
1229 if ( !BDB_IDL_IS_RANGE( cx.ids ) && cx.ids[0] > 3 )
1230 bdb_idl_sort( cx.ids, cx.tmp );
1232 cx.key.size = sizeof(ID)+1;
1235 if ( cx.bdb->bi_idl_cache_max_size )
1236 bdb_idl_cache_put( cx.bdb, cx.db, &cx.key, cx.ids, cx.rc );
1239 if ( cx.rc == DB_NOTFOUND )
1240 cx.rc = LDAP_SUCCESS;
1244 #endif /* BDB_HIER */