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, BDB_LOCKER locker, 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, BDB_LOCKID(locker), 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_ID( 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, NULL, &cursor, bdb->bi_db_opflags );
305 if ( rc ) goto leave;
307 rc = bdb_dn2id_lock( bdb, dn, 0, locker, lock );
308 if ( rc ) goto nolock;
311 CURSOR_SETLOCKER(cursor, locker);
315 rc = cursor->c_get( cursor, &key, &data, DB_SET );
318 cursor->c_close( cursor );
322 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: get failed: %s (%d)\n",
323 db_strerror( rc ), rc, 0 );
325 BDB_DISK2ID( &nid, &ei->bei_id );
326 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: got id=0x%lx\n",
329 op->o_tmpfree( key.data, op->o_tmpmemctx );
340 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
341 DB *db = bdb->bi_dn2id->bdi_db;
345 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_children(\"%s\")\n",
346 e->e_nname.bv_val, 0, 0 );
348 key.size = e->e_nname.bv_len + 2;
349 key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
350 ((char *)key.data)[0] = DN_ONE_PREFIX;
351 AC_MEMCPY( &((char *)key.data)[1], e->e_nname.bv_val, key.size - 1 );
353 if ( bdb->bi_idl_cache_size ) {
354 rc = bdb_idl_cache_get( bdb, db, &key, NULL );
355 if ( rc != LDAP_NO_SUCH_OBJECT ) {
356 op->o_tmpfree( key.data, op->o_tmpmemctx );
360 /* we actually could do a empty get... */
363 data.ulen = sizeof(id);
364 data.flags = DB_DBT_USERMEM;
366 data.dlen = sizeof(id);
368 rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
369 op->o_tmpfree( key.data, op->o_tmpmemctx );
371 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_children(\"%s\"): %s (%d)\n",
373 rc == 0 ? "" : ( rc == DB_NOTFOUND ? "no " :
374 db_strerror(rc) ), rc );
390 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
391 DB *db = bdb->bi_dn2id->bdi_db;
392 int prefix = ( op->ors_scope == LDAP_SCOPE_ONELEVEL )
393 ? DN_ONE_PREFIX : DN_SUBTREE_PREFIX;
395 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2idl(\"%s\")\n",
398 #ifndef BDB_MULTIPLE_SUFFIXES
399 if ( prefix == DN_SUBTREE_PREFIX
400 && ( ei->bei_id == 0 || ei->bei_parent->bei_id == 0 )) {
401 BDB_IDL_ALL(bdb, ids);
407 key.size = ndn->bv_len + 2;
409 key.flags = DB_DBT_USERMEM;
410 key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
411 ((char *)key.data)[0] = prefix;
412 AC_MEMCPY( &((char *)key.data)[1], ndn->bv_val, key.size - 1 );
415 rc = bdb_idl_fetch_key( op->o_bd, db, locker, &key, ids, NULL, 0 );
418 Debug( LDAP_DEBUG_TRACE,
419 "<= bdb_dn2idl: get failed: %s (%d)\n",
420 db_strerror( rc ), rc, 0 );
423 Debug( LDAP_DEBUG_TRACE,
424 "<= bdb_dn2idl: id=%ld first=%ld last=%ld\n",
426 (long) BDB_IDL_FIRST( ids ), (long) BDB_IDL_LAST( ids ) );
429 op->o_tmpfree( key.data, op->o_tmpmemctx );
434 /* Management routines for a hierarchically structured database.
436 * Instead of a ldbm-style dn2id database, we use a hierarchical one. Each
437 * entry in this database is a struct diskNode, keyed by entryID and with
438 * the data containing the RDN and entryID of the node's children. We use
439 * a B-Tree with sorted duplicates to store all the children of a node under
440 * the same key. Also, the first item under the key contains the entry's own
441 * rdn and the ID of the node's parent, to allow bottom-up tree traversal as
442 * well as top-down. To keep this info first in the list, the high bit of all
443 * subsequent nrdnlen's is always set. This means we can only accomodate
444 * RDNs up to length 32767, but that's fine since full DNs are already
445 * restricted to 8192.
447 * The diskNode is a variable length structure. This definition is not
448 * directly usable for in-memory manipulation.
450 typedef struct diskNode {
451 unsigned char nrdnlen[2];
453 char rdn[1]; /* variable placement */
454 unsigned char entryID[sizeof(ID)]; /* variable placement */
457 /* Sort function for the sorted duplicate data items of a dn2id key.
458 * Sorts based on normalized RDN, in length order.
470 un = (diskNode *)usrkey->data;
471 cn = (diskNode *)curkey->data;
473 /* data is not aligned, cannot compare directly */
474 rc = un->nrdnlen[0] - cn->nrdnlen[0];
476 rc = un->nrdnlen[1] - cn->nrdnlen[1];
479 return strcmp( un->nrdn, cn->nrdn );
482 /* This function constructs a full DN for a given entry.
489 int rlen = 0, nrlen = 0;
496 /* count length of all DN components */
497 for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
498 rlen += ei->bei_rdn.bv_len + 1;
499 nrlen += ei->bei_nrdn.bv_len + 1;
500 if (ei->bei_modrdns > max) max = ei->bei_modrdns;
503 /* See if the entry DN was invalidated by a subtree rename */
505 if ( BEI(e)->bei_modrdns >= max ) {
508 /* We found a mismatch, tell the caller to lock it */
509 if ( checkit == 1 ) {
512 /* checkit == 2. do the fix. */
513 free( e->e_name.bv_val );
514 free( e->e_nname.bv_val );
517 e->e_name.bv_len = rlen - 1;
518 e->e_nname.bv_len = nrlen - 1;
519 e->e_name.bv_val = ch_malloc(rlen);
520 e->e_nname.bv_val = ch_malloc(nrlen);
521 ptr = e->e_name.bv_val;
522 nptr = e->e_nname.bv_val;
523 for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
524 ptr = lutil_strcopy(ptr, ei->bei_rdn.bv_val);
525 nptr = lutil_strcopy(nptr, ei->bei_nrdn.bv_val);
526 if ( ei->bei_parent ) {
531 BEI(e)->bei_modrdns = max;
538 /* We add two elements to the DN2ID database - a data item under the parent's
539 * entryID containing the child's RDN and entryID, and an item under the
540 * child's entryID containing the parent's entryID.
549 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
550 DB *db = bdb->bi_dn2id->bdi_db;
557 Debug( LDAP_DEBUG_TRACE, "=> hdb_dn2id_add 0x%lx: \"%s\"\n",
558 e->e_id, e->e_ndn, 0 );
560 nrlen = dn_rdnlen( op->o_bd, &e->e_nname );
562 rlen = dn_rdnlen( op->o_bd, &e->e_name );
564 nrlen = e->e_nname.bv_len;
565 rlen = e->e_name.bv_len;
568 d = op->o_tmpalloc(sizeof(diskNode) + rlen + nrlen, op->o_tmpmemctx);
569 d->nrdnlen[1] = nrlen & 0xff;
570 d->nrdnlen[0] = (nrlen >> 8) | 0x80;
571 ptr = lutil_strncopy( d->nrdn, e->e_nname.bv_val, nrlen );
573 ptr = lutil_strncopy( ptr, e->e_name.bv_val, rlen );
575 BDB_ID2DISK( e->e_id, ptr );
579 key.size = sizeof(ID);
580 key.flags = DB_DBT_USERMEM;
581 BDB_ID2DISK( eip->bei_id, &nid );
585 /* Need to make dummy root node once. Subsequent attempts
586 * will fail harmlessly.
588 if ( eip->bei_id == 0 ) {
589 diskNode dummy = {{0, 0}, "", "", ""};
591 data.size = sizeof(diskNode);
592 data.flags = DB_DBT_USERMEM;
594 db->put( db, txn, &key, &data, DB_NODUPDATA );
598 data.size = sizeof(diskNode) + rlen + nrlen;
599 data.flags = DB_DBT_USERMEM;
601 rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
604 BDB_ID2DISK( e->e_id, &nid );
605 BDB_ID2DISK( eip->bei_id, ptr );
606 d->nrdnlen[0] ^= 0x80;
608 rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
611 /* Update all parents' IDL cache entries */
612 if ( rc == 0 && bdb->bi_idl_cache_size ) {
614 char *ptr = ((char *)&tmp[1])-1;
616 key.size = sizeof(ID)+1;
617 tmp[1] = eip->bei_id;
618 *ptr = DN_ONE_PREFIX;
619 bdb_idl_cache_add_id( bdb, db, &key, e->e_id );
620 *ptr = DN_SUBTREE_PREFIX;
621 for (; eip && eip->bei_parent->bei_id; eip = eip->bei_parent) {
622 tmp[1] = eip->bei_id;
623 bdb_idl_cache_add_id( bdb, db, &key, e->e_id );
628 op->o_tmpfree( d, op->o_tmpmemctx );
629 Debug( LDAP_DEBUG_TRACE, "<= hdb_dn2id_add 0x%lx: %d\n", e->e_id, rc, 0 );
641 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
642 DB *db = bdb->bi_dn2id->bdi_db;
648 unsigned char dlen[2];
651 Debug( LDAP_DEBUG_TRACE, "=> hdb_dn2id_delete 0x%lx: \"%s\"\n",
652 e->e_id, e->e_ndn, 0 );
655 key.size = sizeof(ID);
657 key.flags = DB_DBT_USERMEM;
658 BDB_ID2DISK( eip->bei_id, &nid );
661 data.size = sizeof(diskNode) + BEI(e)->bei_nrdn.bv_len - sizeof(ID) - 1;
662 data.ulen = data.size;
663 data.dlen = data.size;
664 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
668 d = op->o_tmpalloc( data.size, op->o_tmpmemctx );
669 d->nrdnlen[1] = BEI(e)->bei_nrdn.bv_len & 0xff;
670 d->nrdnlen[0] = (BEI(e)->bei_nrdn.bv_len >> 8) | 0x80;
671 dlen[0] = d->nrdnlen[0];
672 dlen[1] = d->nrdnlen[1];
673 strcpy( d->nrdn, BEI(e)->bei_nrdn.bv_val );
676 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
677 if ( rc ) goto leave;
679 /* We hold this lock until the TXN completes */
680 rc = bdb_dn2id_lock( bdb, &e->e_nname, 1, TXN_ID( txn ), &lock );
681 if ( rc ) goto nolock;
683 /* Delete our ID from the parent's list */
684 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH_RANGE );
686 if ( dlen[1] == d->nrdnlen[1] && dlen[0] == d->nrdnlen[0] &&
687 !strcmp( d->nrdn, BEI(e)->bei_nrdn.bv_val ))
688 rc = cursor->c_del( cursor, 0 );
693 /* Delete our ID from the tree. With sorted duplicates, this
694 * will leave any child nodes still hanging around. This is OK
695 * for modrdn, which will add our info back in later.
698 BDB_ID2DISK( e->e_id, &nid );
699 rc = cursor->c_get( cursor, &key, &data, DB_SET );
701 rc = cursor->c_del( cursor, 0 );
705 cursor->c_close( cursor );
707 op->o_tmpfree( d, op->o_tmpmemctx );
709 /* Delete IDL cache entries */
710 if ( rc == 0 && bdb->bi_idl_cache_size ) {
712 char *ptr = ((char *)&tmp[1])-1;
714 key.size = sizeof(ID)+1;
715 tmp[1] = eip->bei_id;
716 *ptr = DN_ONE_PREFIX;
717 bdb_idl_cache_del_id( bdb, db, &key, e->e_id );
718 *ptr = DN_SUBTREE_PREFIX;
719 for (; eip && eip->bei_parent->bei_id; eip = eip->bei_parent) {
720 tmp[1] = eip->bei_id;
721 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, NULL, &cursor, bdb->bi_db_opflags );
769 CURSOR_SETLOCKER( cursor, locker );
772 d = op->o_tmpalloc( data.size * 3, op->o_tmpmemctx );
773 d->nrdnlen[1] = nrlen & 0xff;
774 d->nrdnlen[0] = (nrlen >> 8) | 0x80;
775 dlen[0] = d->nrdnlen[0];
776 dlen[1] = d->nrdnlen[1];
777 ptr = lutil_strncopy( d->nrdn, in->bv_val, nrlen );
781 rc = bdb_dn2id_lock( bdb, in, 0, locker, lock );
782 if ( rc ) goto leave;
784 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH_RANGE );
785 if ( rc == 0 && (dlen[1] != d->nrdnlen[1] || dlen[0] != d->nrdnlen[0] ||
786 strncmp( d->nrdn, in->bv_val, nrlen ))) {
790 ptr = (char *) data.data + data.size - sizeof(ID);
791 BDB_DISK2ID( ptr, &ei->bei_id );
792 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) - nrlen;
793 ptr = d->nrdn + nrlen + 1;
794 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
795 if ( ei->bei_parent != NULL && !ei->bei_parent->bei_dkids ) {
797 /* How many children does the parent have? */
798 /* FIXME: do we need to lock the parent
799 * entryinfo? Seems safe...
801 cursor->c_count( cursor, &dkids, 0 );
802 ei->bei_parent->bei_dkids = dkids;
807 cursor->c_close( cursor );
808 op->o_tmpfree( d, op->o_tmpmemctx );
810 Debug( LDAP_DEBUG_TRACE, "<= hdb_dn2id: get failed: %s (%d)\n",
811 db_strerror( rc ), rc, 0 );
813 Debug( LDAP_DEBUG_TRACE, "<= hdb_dn2id: got id=0x%lx\n",
827 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
828 DB *db = bdb->bi_dn2id->bdi_db;
837 key.size = sizeof(ID);
839 key.ulen = sizeof(ID);
840 key.flags = DB_DBT_USERMEM;
841 BDB_ID2DISK( ei->bei_id, &nid );
844 data.flags = DB_DBT_USERMEM;
846 rc = db->cursor( db, NULL, &cursor, bdb->bi_db_opflags );
849 CURSOR_SETLOCKER(cursor, locker);
852 data.ulen = sizeof(diskNode) + (SLAP_LDAPDN_MAXLEN * 2);
853 d = op->o_tmpalloc( data.ulen, op->o_tmpmemctx );
856 rc = cursor->c_get( cursor, &key, &data, DB_SET );
858 if (d->nrdnlen[0] & 0x80) {
862 ptr = (char *) data.data + data.size - sizeof(ID);
863 BDB_DISK2ID( ptr, idp );
864 ei->bei_nrdn.bv_len = (d->nrdnlen[0] << 8) | d->nrdnlen[1];
865 ber_str2bv( d->nrdn, ei->bei_nrdn.bv_len, 1, &ei->bei_nrdn );
866 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) -
868 ptr = d->nrdn + ei->bei_nrdn.bv_len + 1;
869 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
870 /* How many children does this node have? */
871 cursor->c_count( cursor, &dkids, 0 );
872 ei->bei_dkids = dkids;
875 cursor->c_close( cursor );
876 op->o_tmpfree( d, op->o_tmpmemctx );
886 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
887 DB *db = bdb->bi_dn2id->bdi_db;
895 key.size = sizeof(ID);
897 key.flags = DB_DBT_USERMEM;
898 BDB_ID2DISK( e->e_id, &id );
900 /* IDL cache is in host byte order */
901 if ( bdb->bi_idl_cache_size ) {
902 rc = bdb_idl_cache_get( bdb, db, &key, NULL );
903 if ( rc != LDAP_NO_SUCH_OBJECT ) {
911 data.ulen = sizeof(d);
912 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
913 data.dlen = sizeof(d);
915 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
918 rc = cursor->c_get( cursor, &key, &data, DB_SET );
921 rc = cursor->c_count( cursor, &dkids, 0 );
923 BEI(e)->bei_dkids = dkids;
924 if ( dkids < 2 ) rc = DB_NOTFOUND;
927 cursor->c_close( cursor );
932 * We can't just use bdb_idl_fetch_key because
933 * 1 - our data items are longer than just an entry ID
934 * 2 - our data items are sorted alphabetically by nrdn, not by ID.
936 * We descend the tree recursively, so we define this cookie
937 * to hold our necessary state information. The bdb_dn2idl_internal
938 * function uses this cookie when calling itself.
941 struct dn2id_cookie {
942 struct bdb_info *bdb;
967 EntryInfo *ei = data;
970 bdb_idl_append_one( idl, ei->bei_id );
976 struct dn2id_cookie *cx
979 BDB_IDL_ZERO( cx->tmp );
981 if ( cx->bdb->bi_idl_cache_size ) {
982 char *ptr = ((char *)&cx->id)-1;
985 cx->key.size = sizeof(ID)+1;
986 if ( cx->prefix == DN_SUBTREE_PREFIX ) {
987 ID *ids = cx->depth ? cx->tmp : cx->ids;
989 cx->rc = bdb_idl_cache_get(cx->bdb, cx->db, &cx->key, ids);
990 if ( cx->rc == LDAP_SUCCESS ) {
992 bdb_idl_append( cx->ids, cx->tmp );
998 *ptr = DN_ONE_PREFIX;
999 cx->rc = bdb_idl_cache_get(cx->bdb, cx->db, &cx->key, cx->tmp);
1000 if ( cx->rc == LDAP_SUCCESS ) {
1003 if ( cx->rc == DB_NOTFOUND ) {
1008 bdb_cache_entryinfo_lock( cx->ei );
1010 /* If number of kids in the cache differs from on-disk, load
1011 * up all the kids from the database
1013 if ( cx->ei->bei_ckids+1 != cx->ei->bei_dkids ) {
1015 db_recno_t dkids = cx->ei->bei_dkids;
1016 ei.bei_parent = cx->ei;
1018 /* Only one thread should load the cache */
1019 while ( cx->ei->bei_state & CACHE_ENTRY_ONELEVEL ) {
1020 bdb_cache_entryinfo_unlock( cx->ei );
1021 ldap_pvt_thread_yield();
1022 bdb_cache_entryinfo_lock( cx->ei );
1023 if ( cx->ei->bei_ckids+1 == cx->ei->bei_dkids ) {
1028 cx->ei->bei_state |= CACHE_ENTRY_ONELEVEL;
1030 bdb_cache_entryinfo_unlock( cx->ei );
1032 cx->rc = cx->db->cursor( cx->db, NULL, &cx->dbc,
1033 cx->bdb->bi_db_opflags );
1037 cx->data.data = &cx->dbuf;
1038 cx->data.ulen = sizeof(ID);
1039 cx->data.dlen = sizeof(ID);
1040 cx->data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
1042 /* The first item holds the parent ID. Ignore it. */
1043 cx->key.data = &cx->nid;
1044 cx->key.size = sizeof(ID);
1045 cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data, DB_SET );
1047 cx->dbc->c_close( cx->dbc );
1051 /* If the on-disk count is zero we've never checked it.
1055 cx->dbc->c_count( cx->dbc, &dkids, 0 );
1056 cx->ei->bei_dkids = dkids;
1059 cx->data.data = cx->buf;
1060 cx->data.ulen = BDB_IDL_UM_SIZE * sizeof(ID);
1061 cx->data.flags = DB_DBT_USERMEM;
1064 /* Fetch the rest of the IDs in a loop... */
1065 while ( (cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data,
1066 DB_MULTIPLE | DB_NEXT_DUP )) == 0 ) {
1070 DB_MULTIPLE_INIT( ptr, &cx->data );
1072 DB_MULTIPLE_NEXT( ptr, &cx->data, j, len );
1075 diskNode *d = (diskNode *)j;
1078 BDB_DISK2ID( j + len - sizeof(ID), &ei.bei_id );
1079 nrlen = ((d->nrdnlen[0] ^ 0x80) << 8) | d->nrdnlen[1];
1080 ei.bei_nrdn.bv_len = nrlen;
1081 /* nrdn/rdn are set in-place.
1082 * hdb_cache_load will copy them as needed
1084 ei.bei_nrdn.bv_val = d->nrdn;
1085 ei.bei_rdn.bv_len = len - sizeof(diskNode)
1086 - ei.bei_nrdn.bv_len;
1087 ei.bei_rdn.bv_val = d->nrdn + ei.bei_nrdn.bv_len + 1;
1088 bdb_idl_append_one( cx->tmp, ei.bei_id );
1089 hdb_cache_load( cx->bdb, &ei, &ei2 );
1095 cx->rc = cx->dbc->c_close( cx->dbc );
1097 bdb_cache_entryinfo_lock( cx->ei );
1098 cx->ei->bei_state ^= CACHE_ENTRY_ONELEVEL;
1099 bdb_cache_entryinfo_unlock( cx->ei );
1104 /* The in-memory cache is in sync with the on-disk data.
1105 * do we have any kids?
1109 if ( cx->ei->bei_ckids > 0 ) {
1110 /* Walk the kids tree; order is irrelevant since bdb_idl_sort
1111 * will sort it later.
1113 avl_apply( cx->ei->bei_kids, apply_func,
1114 cx->tmp, -1, AVL_POSTORDER );
1116 bdb_cache_entryinfo_unlock( cx->ei );
1119 if ( !BDB_IDL_IS_RANGE( cx->tmp ) && cx->tmp[0] > 3 )
1120 bdb_idl_sort( cx->tmp, cx->buf );
1121 if ( cx->bdb->bi_idl_cache_max_size && !BDB_IDL_IS_ZERO( cx->tmp )) {
1122 char *ptr = ((char *)&cx->id)-1;
1124 cx->key.size = sizeof(ID)+1;
1125 *ptr = DN_ONE_PREFIX;
1126 bdb_idl_cache_put( cx->bdb, cx->db, &cx->key, cx->tmp, cx->rc );
1130 if ( !BDB_IDL_IS_ZERO( cx->tmp )) {
1131 if ( cx->prefix == DN_SUBTREE_PREFIX ) {
1132 bdb_idl_append( cx->ids, cx->tmp );
1134 if ( !(cx->ei->bei_state & CACHE_ENTRY_NO_GRANDKIDS)) {
1136 EntryInfo *ei = cx->ei;
1138 save = cx->op->o_tmpalloc( BDB_IDL_SIZEOF( cx->tmp ),
1139 cx->op->o_tmpmemctx );
1140 BDB_IDL_CPY( save, cx->tmp );
1144 for ( cx->id = bdb_idl_first( save, &idcurs );
1146 cx->id = bdb_idl_next( save, &idcurs )) {
1147 cx->ei = bdb_cache_find_info( cx->bdb, cx->id );
1149 ( cx->ei->bei_state & CACHE_ENTRY_NO_KIDS ))
1152 BDB_ID2DISK( cx->id, &cx->nid );
1153 hdb_dn2idl_internal( cx );
1154 if ( !BDB_IDL_IS_ZERO( cx->tmp ))
1158 cx->op->o_tmpfree( save, cx->op->o_tmpmemctx );
1159 if ( nokids ) ei->bei_state |= CACHE_ENTRY_NO_GRANDKIDS;
1161 /* Make sure caller knows it had kids! */
1166 BDB_IDL_CPY( cx->ids, cx->tmp );
1181 struct bdb_info *bdb = (struct bdb_info *)op->o_bd->be_private;
1182 struct dn2id_cookie cx;
1184 Debug( LDAP_DEBUG_TRACE, "=> hdb_dn2idl(\"%s\")\n",
1185 ndn->bv_val, 0, 0 );
1187 #ifndef BDB_MULTIPLE_SUFFIXES
1188 if ( op->ors_scope != LDAP_SCOPE_ONELEVEL &&
1189 ( ei->bei_id == 0 ||
1190 ei->bei_parent->bei_id == 0 ))
1192 BDB_IDL_ALL( bdb, ids );
1198 BDB_ID2DISK( cx.id, &cx.nid );
1201 cx.db = cx.bdb->bi_dn2id->bdi_db;
1202 cx.prefix = (op->ors_scope == LDAP_SCOPE_ONELEVEL) ?
1203 DN_ONE_PREFIX : DN_SUBTREE_PREFIX;
1206 cx.buf = stack + BDB_IDL_UM_SIZE;
1212 if ( cx.prefix == DN_SUBTREE_PREFIX ) {
1216 BDB_IDL_ZERO( ids );
1218 if ( cx.ei->bei_state & CACHE_ENTRY_NO_KIDS )
1219 return LDAP_SUCCESS;
1222 cx.key.ulen = sizeof(ID);
1223 cx.key.size = sizeof(ID);
1224 cx.key.flags = DB_DBT_USERMEM;
1228 hdb_dn2idl_internal(&cx);
1229 if ( cx.need_sort ) {
1230 char *ptr = ((char *)&cx.id)-1;
1231 if ( !BDB_IDL_IS_RANGE( cx.ids ) && cx.ids[0] > 3 )
1232 bdb_idl_sort( cx.ids, cx.tmp );
1234 cx.key.size = sizeof(ID)+1;
1237 if ( cx.bdb->bi_idl_cache_max_size )
1238 bdb_idl_cache_put( cx.bdb, cx.db, &cx.key, cx.ids, cx.rc );
1241 if ( cx.rc == DB_NOTFOUND )
1242 cx.rc = LDAP_SUCCESS;
1246 #endif /* BDB_HIER */