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-2007 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 = bdb_idl_delete_key( op->o_bd, db, txn, &key, e->e_id );
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 );
343 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
344 DB *db = bdb->bi_dn2id->bdi_db;
345 int prefix = ( op->ors_scope == LDAP_SCOPE_ONELEVEL )
346 ? DN_ONE_PREFIX : DN_SUBTREE_PREFIX;
348 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2idl(\"%s\")\n",
351 #ifndef BDB_MULTIPLE_SUFFIXES
352 if ( prefix == DN_SUBTREE_PREFIX
353 && ( ei->bei_id == 0 || ei->bei_parent->bei_id == 0 )) {
354 BDB_IDL_ALL(bdb, ids);
360 key.size = ndn->bv_len + 2;
362 key.flags = DB_DBT_USERMEM;
363 key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
364 ((char *)key.data)[0] = prefix;
365 AC_MEMCPY( &((char *)key.data)[1], ndn->bv_val, key.size - 1 );
368 rc = bdb_idl_fetch_key( op->o_bd, db, locker, &key, ids, NULL, 0 );
371 Debug( LDAP_DEBUG_TRACE,
372 "<= bdb_dn2idl: get failed: %s (%d)\n",
373 db_strerror( rc ), rc, 0 );
376 Debug( LDAP_DEBUG_TRACE,
377 "<= bdb_dn2idl: id=%ld first=%ld last=%ld\n",
379 (long) BDB_IDL_FIRST( ids ), (long) BDB_IDL_LAST( ids ) );
382 op->o_tmpfree( key.data, op->o_tmpmemctx );
387 /* Management routines for a hierarchically structured database.
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];
406 char rdn[1]; /* variable placement */
407 unsigned char entryID[sizeof(ID)]; /* variable placement */
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 );
504 key.size = sizeof(ID);
505 key.flags = DB_DBT_USERMEM;
506 BDB_ID2DISK( eip->bei_id, &nid );
510 /* Need to make dummy root node once. Subsequent attempts
511 * will fail harmlessly.
513 if ( eip->bei_id == 0 ) {
514 diskNode dummy = {{0, 0}, "", "", ""};
516 data.size = sizeof(diskNode);
517 data.flags = DB_DBT_USERMEM;
519 db->put( db, txn, &key, &data, DB_NODUPDATA );
523 data.size = sizeof(diskNode) + rlen + nrlen;
524 data.flags = DB_DBT_USERMEM;
526 rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
529 BDB_ID2DISK( e->e_id, &nid );
530 BDB_ID2DISK( eip->bei_id, ptr );
531 d->nrdnlen[0] ^= 0x80;
533 rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
536 /* Update all parents' IDL cache entries */
537 if ( rc == 0 && bdb->bi_idl_cache_size ) {
539 char *ptr = ((char *)&tmp[1])-1;
541 key.size = sizeof(ID)+1;
542 tmp[1] = eip->bei_id;
543 *ptr = DN_ONE_PREFIX;
544 bdb_idl_cache_add_id( bdb, db, &key, e->e_id );
545 *ptr = DN_SUBTREE_PREFIX;
546 for (; eip && eip->bei_parent->bei_id; eip = eip->bei_parent) {
547 tmp[1] = eip->bei_id;
548 bdb_idl_cache_add_id( bdb, db, &key, e->e_id );
551 op->o_tmpfree( d, op->o_tmpmemctx );
563 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
564 DB *db = bdb->bi_dn2id->bdi_db;
570 unsigned char dlen[2];
573 key.size = sizeof(ID);
575 key.flags = DB_DBT_USERMEM;
576 BDB_ID2DISK( eip->bei_id, &nid );
579 data.size = sizeof(diskNode) + BEI(e)->bei_nrdn.bv_len - sizeof(ID) - 1;
580 data.ulen = data.size;
581 data.dlen = data.size;
582 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
585 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
588 d = op->o_tmpalloc( data.size, op->o_tmpmemctx );
589 d->nrdnlen[1] = BEI(e)->bei_nrdn.bv_len & 0xff;
590 d->nrdnlen[0] = (BEI(e)->bei_nrdn.bv_len >> 8) | 0x80;
591 dlen[0] = d->nrdnlen[0];
592 dlen[1] = d->nrdnlen[1];
593 strcpy( d->nrdn, BEI(e)->bei_nrdn.bv_val );
596 /* Delete our ID from the parent's list */
597 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH_RANGE );
599 if ( dlen[1] == d->nrdnlen[1] && dlen[0] == d->nrdnlen[0] &&
600 !strcmp( d->nrdn, BEI(e)->bei_nrdn.bv_val ))
601 rc = cursor->c_del( cursor, 0 );
606 /* Delete our ID from the tree. With sorted duplicates, this
607 * will leave any child nodes still hanging around. This is OK
608 * for modrdn, which will add our info back in later.
611 BDB_ID2DISK( e->e_id, &nid );
612 rc = cursor->c_get( cursor, &key, &data, DB_SET );
614 rc = cursor->c_del( cursor, 0 );
616 cursor->c_close( cursor );
617 op->o_tmpfree( d, op->o_tmpmemctx );
619 /* Delete IDL cache entries */
620 if ( rc == 0 && bdb->bi_idl_cache_size ) {
622 char *ptr = ((char *)&tmp[1])-1;
624 key.size = sizeof(ID)+1;
625 tmp[1] = eip->bei_id;
626 *ptr = DN_ONE_PREFIX;
627 bdb_idl_cache_del_id( bdb, db, &key, e->e_id );
628 *ptr = DN_SUBTREE_PREFIX;
629 for (; eip && eip->bei_parent->bei_id; eip = eip->bei_parent) {
630 tmp[1] = eip->bei_id;
631 bdb_idl_cache_del_id( bdb, db, &key, e->e_id );
645 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
646 DB *db = bdb->bi_dn2id->bdi_db;
652 unsigned char dlen[2];
655 nrlen = dn_rdnlen( op->o_bd, in );
656 if (!nrlen) nrlen = in->bv_len;
659 key.size = sizeof(ID);
661 key.ulen = sizeof(ID);
662 key.flags = DB_DBT_USERMEM;
663 parentID = ( ei->bei_parent != NULL ) ? ei->bei_parent->bei_id : 0;
664 BDB_ID2DISK( parentID, &idp );
667 data.size = sizeof(diskNode) + nrlen - sizeof(ID) - 1;
668 data.ulen = data.size * 3;
669 data.dlen = data.ulen;
670 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
672 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
675 d = op->o_tmpalloc( data.size * 3, op->o_tmpmemctx );
676 d->nrdnlen[1] = nrlen & 0xff;
677 d->nrdnlen[0] = (nrlen >> 8) | 0x80;
678 dlen[0] = d->nrdnlen[0];
679 dlen[1] = d->nrdnlen[1];
680 ptr = lutil_strncopy( d->nrdn, in->bv_val, nrlen );
684 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH_RANGE );
685 if ( rc == 0 && (dlen[1] != d->nrdnlen[1] || dlen[0] != d->nrdnlen[0] ||
686 strncmp( d->nrdn, in->bv_val, nrlen ))) {
690 ptr = (char *) data.data + data.size - sizeof(ID);
691 BDB_DISK2ID( ptr, &ei->bei_id );
692 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) - nrlen;
693 ptr = d->nrdn + nrlen + 1;
694 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
695 if ( ei->bei_parent != NULL && !ei->bei_parent->bei_dkids ) {
697 /* How many children does the parent have? */
698 /* FIXME: do we need to lock the parent
699 * entryinfo? Seems safe...
701 cursor->c_count( cursor, &dkids, 0 );
702 ei->bei_parent->bei_dkids = dkids;
705 cursor->c_close( cursor );
706 op->o_tmpfree( d, op->o_tmpmemctx );
719 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
720 DB *db = bdb->bi_dn2id->bdi_db;
729 key.size = sizeof(ID);
731 key.ulen = sizeof(ID);
732 key.flags = DB_DBT_USERMEM;
733 BDB_ID2DISK( ei->bei_id, &nid );
736 data.flags = DB_DBT_USERMEM;
738 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
740 if ( !txn && locker ) {
741 cursor->locker = locker;
744 data.ulen = sizeof(diskNode) + (SLAP_LDAPDN_MAXLEN * 2);
745 d = op->o_tmpalloc( data.ulen, op->o_tmpmemctx );
748 rc = cursor->c_get( cursor, &key, &data, DB_SET );
750 if (d->nrdnlen[0] & 0x80) {
754 ptr = (char *) data.data + data.size - sizeof(ID);
755 BDB_DISK2ID( ptr, idp );
756 ei->bei_nrdn.bv_len = (d->nrdnlen[0] << 8) | d->nrdnlen[1];
757 ber_str2bv( d->nrdn, ei->bei_nrdn.bv_len, 1, &ei->bei_nrdn );
758 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) -
760 ptr = d->nrdn + ei->bei_nrdn.bv_len + 1;
761 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
762 /* How many children does this node have? */
763 cursor->c_count( cursor, &dkids, 0 );
764 ei->bei_dkids = dkids;
767 cursor->c_close( cursor );
768 op->o_tmpfree( d, op->o_tmpmemctx );
778 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
779 DB *db = bdb->bi_dn2id->bdi_db;
787 key.size = sizeof(ID);
789 key.flags = DB_DBT_USERMEM;
790 BDB_ID2DISK( e->e_id, &id );
792 /* IDL cache is in host byte order */
793 if ( bdb->bi_idl_cache_size ) {
794 rc = bdb_idl_cache_get( bdb, db, &key, NULL );
795 if ( rc != LDAP_NO_SUCH_OBJECT ) {
803 data.ulen = sizeof(d);
804 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
805 data.dlen = sizeof(d);
807 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
810 rc = cursor->c_get( cursor, &key, &data, DB_SET );
813 rc = cursor->c_count( cursor, &dkids, 0 );
815 BEI(e)->bei_dkids = dkids;
816 if ( dkids < 2 ) rc = DB_NOTFOUND;
819 cursor->c_close( cursor );
824 * We can't just use bdb_idl_fetch_key because
825 * 1 - our data items are longer than just an entry ID
826 * 2 - our data items are sorted alphabetically by nrdn, not by ID.
828 * We descend the tree recursively, so we define this cookie
829 * to hold our necessary state information. The bdb_dn2idl_internal
830 * function uses this cookie when calling itself.
833 struct dn2id_cookie {
834 struct bdb_info *bdb;
859 EntryInfo *ei = data;
862 bdb_idl_append_one( idl, ei->bei_id );
868 struct dn2id_cookie *cx
871 BDB_IDL_ZERO( cx->tmp );
873 if ( cx->bdb->bi_idl_cache_size ) {
874 char *ptr = ((char *)&cx->id)-1;
877 cx->key.size = sizeof(ID)+1;
878 if ( cx->prefix == DN_SUBTREE_PREFIX ) {
879 ID *ids = cx->depth ? cx->tmp : cx->ids;
881 cx->rc = bdb_idl_cache_get(cx->bdb, cx->db, &cx->key, ids);
882 if ( cx->rc == LDAP_SUCCESS ) {
884 bdb_idl_append( cx->ids, cx->tmp );
890 *ptr = DN_ONE_PREFIX;
891 cx->rc = bdb_idl_cache_get(cx->bdb, cx->db, &cx->key, cx->tmp);
892 if ( cx->rc == LDAP_SUCCESS ) {
895 if ( cx->rc == DB_NOTFOUND ) {
900 bdb_cache_entryinfo_lock( cx->ei );
902 /* If number of kids in the cache differs from on-disk, load
903 * up all the kids from the database
905 if ( cx->ei->bei_ckids+1 != cx->ei->bei_dkids ) {
907 db_recno_t dkids = cx->ei->bei_dkids;
908 ei.bei_parent = cx->ei;
910 /* Only one thread should load the cache */
911 while ( cx->ei->bei_state & CACHE_ENTRY_ONELEVEL ) {
912 bdb_cache_entryinfo_unlock( cx->ei );
913 ldap_pvt_thread_yield();
914 bdb_cache_entryinfo_lock( cx->ei );
915 if ( cx->ei->bei_ckids+1 == cx->ei->bei_dkids ) {
920 cx->ei->bei_state |= CACHE_ENTRY_ONELEVEL;
922 bdb_cache_entryinfo_unlock( cx->ei );
924 cx->rc = cx->db->cursor( cx->db, NULL, &cx->dbc,
925 cx->bdb->bi_db_opflags );
929 cx->data.data = &cx->dbuf;
930 cx->data.ulen = sizeof(ID);
931 cx->data.dlen = sizeof(ID);
932 cx->data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
934 /* The first item holds the parent ID. Ignore it. */
935 cx->key.data = &cx->nid;
936 cx->key.size = sizeof(ID);
937 cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data, DB_SET );
939 cx->dbc->c_close( cx->dbc );
943 /* If the on-disk count is zero we've never checked it.
947 cx->dbc->c_count( cx->dbc, &dkids, 0 );
948 cx->ei->bei_dkids = dkids;
951 cx->data.data = cx->buf;
952 cx->data.ulen = BDB_IDL_UM_SIZE * sizeof(ID);
953 cx->data.flags = DB_DBT_USERMEM;
956 /* Fetch the rest of the IDs in a loop... */
957 while ( (cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data,
958 DB_MULTIPLE | DB_NEXT_DUP )) == 0 ) {
962 DB_MULTIPLE_INIT( ptr, &cx->data );
964 DB_MULTIPLE_NEXT( ptr, &cx->data, j, len );
967 diskNode *d = (diskNode *)j;
970 BDB_DISK2ID( j + len - sizeof(ID), &ei.bei_id );
971 nrlen = ((d->nrdnlen[0] ^ 0x80) << 8) | d->nrdnlen[1];
972 ei.bei_nrdn.bv_len = nrlen;
973 /* nrdn/rdn are set in-place.
974 * hdb_cache_load will copy them as needed
976 ei.bei_nrdn.bv_val = d->nrdn;
977 ei.bei_rdn.bv_len = len - sizeof(diskNode)
978 - ei.bei_nrdn.bv_len;
979 ei.bei_rdn.bv_val = d->nrdn + ei.bei_nrdn.bv_len + 1;
980 bdb_idl_append_one( cx->tmp, ei.bei_id );
981 hdb_cache_load( cx->bdb, &ei, &ei2 );
987 cx->rc = cx->dbc->c_close( cx->dbc );
989 bdb_cache_entryinfo_lock( cx->ei );
990 cx->ei->bei_state ^= CACHE_ENTRY_ONELEVEL;
991 bdb_cache_entryinfo_unlock( cx->ei );
996 /* The in-memory cache is in sync with the on-disk data.
997 * do we have any kids?
1001 if ( cx->ei->bei_ckids > 0 ) {
1002 /* Walk the kids tree; order is irrelevant since bdb_idl_sort
1003 * will sort it later.
1005 avl_apply( cx->ei->bei_kids, apply_func,
1006 cx->tmp, -1, AVL_POSTORDER );
1008 bdb_cache_entryinfo_unlock( cx->ei );
1011 if ( !BDB_IDL_IS_RANGE( cx->tmp ) && cx->tmp[0] > 3 )
1012 bdb_idl_sort( cx->tmp, cx->buf );
1013 if ( cx->bdb->bi_idl_cache_max_size && !BDB_IDL_IS_ZERO( cx->tmp )) {
1014 char *ptr = ((char *)&cx->id)-1;
1016 cx->key.size = sizeof(ID)+1;
1017 *ptr = DN_ONE_PREFIX;
1018 bdb_idl_cache_put( cx->bdb, cx->db, &cx->key, cx->tmp, cx->rc );
1022 if ( !BDB_IDL_IS_ZERO( cx->tmp )) {
1023 if ( cx->prefix == DN_SUBTREE_PREFIX ) {
1024 bdb_idl_append( cx->ids, cx->tmp );
1026 if ( !(cx->ei->bei_state & CACHE_ENTRY_NO_GRANDKIDS)) {
1028 EntryInfo *ei = cx->ei;
1030 save = cx->op->o_tmpalloc( BDB_IDL_SIZEOF( cx->tmp ),
1031 cx->op->o_tmpmemctx );
1032 BDB_IDL_CPY( save, cx->tmp );
1036 for ( cx->id = bdb_idl_first( save, &idcurs );
1038 cx->id = bdb_idl_next( save, &idcurs )) {
1039 cx->ei = bdb_cache_find_info( cx->bdb, cx->id );
1041 ( cx->ei->bei_state & CACHE_ENTRY_NO_KIDS ))
1044 BDB_ID2DISK( cx->id, &cx->nid );
1045 hdb_dn2idl_internal( cx );
1046 if ( !BDB_IDL_IS_ZERO( cx->tmp ))
1050 cx->op->o_tmpfree( save, cx->op->o_tmpmemctx );
1051 if ( nokids ) ei->bei_state |= CACHE_ENTRY_NO_GRANDKIDS;
1053 /* Make sure caller knows it had kids! */
1058 BDB_IDL_CPY( cx->ids, cx->tmp );
1073 struct bdb_info *bdb = (struct bdb_info *)op->o_bd->be_private;
1074 struct dn2id_cookie cx;
1076 Debug( LDAP_DEBUG_TRACE, "=> hdb_dn2idl(\"%s\")\n",
1077 ndn->bv_val, 0, 0 );
1079 #ifndef BDB_MULTIPLE_SUFFIXES
1080 if ( op->ors_scope != LDAP_SCOPE_ONELEVEL &&
1081 ( ei->bei_id == 0 ||
1082 ei->bei_parent->bei_id == 0 ))
1084 BDB_IDL_ALL( bdb, ids );
1090 BDB_ID2DISK( cx.id, &cx.nid );
1093 cx.db = cx.bdb->bi_dn2id->bdi_db;
1094 cx.prefix = (op->ors_scope == LDAP_SCOPE_ONELEVEL) ?
1095 DN_ONE_PREFIX : DN_SUBTREE_PREFIX;
1098 cx.buf = stack + BDB_IDL_UM_SIZE;
1104 if ( cx.prefix == DN_SUBTREE_PREFIX ) {
1108 BDB_IDL_ZERO( ids );
1110 if ( cx.ei->bei_state & CACHE_ENTRY_NO_KIDS )
1111 return LDAP_SUCCESS;
1114 cx.key.ulen = sizeof(ID);
1115 cx.key.size = sizeof(ID);
1116 cx.key.flags = DB_DBT_USERMEM;
1120 hdb_dn2idl_internal(&cx);
1121 if ( cx.need_sort ) {
1122 char *ptr = ((char *)&cx.id)-1;
1123 if ( !BDB_IDL_IS_RANGE( cx.ids ) && cx.ids[0] > 3 )
1124 bdb_idl_sort( cx.ids, cx.tmp );
1126 cx.key.size = sizeof(ID)+1;
1129 if ( cx.bdb->bi_idl_cache_max_size )
1130 bdb_idl_cache_put( cx.bdb, cx.db, &cx.key, cx.ids, cx.rc );
1133 if ( cx.rc == DB_NOTFOUND )
1134 cx.rc = LDAP_SUCCESS;
1138 #endif /* BDB_HIER */