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-2003 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;
39 struct berval ptr, pdn;
42 LDAP_LOG ( INDEX, ARGS, "bdb_dn2id_add( \"%s\", 0x%08lx )\n",
43 e->e_ndn, (long) e->e_id, 0 );
45 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_add( \"%s\", 0x%08lx )\n",
46 e->e_ndn, (long) e->e_id, 0 );
48 assert( e->e_id != NOID );
51 key.size = e->e_nname.bv_len + 2;
53 key.flags = DB_DBT_USERMEM;
54 buf = op->o_tmpalloc( key.size, op->o_tmpmemctx );
56 buf[0] = DN_BASE_PREFIX;
58 ptr.bv_len = e->e_nname.bv_len;
59 AC_MEMCPY( ptr.bv_val, e->e_nname.bv_val, e->e_nname.bv_len );
60 ptr.bv_val[ptr.bv_len] = '\0';
63 data.data = (char *) &e->e_id;
64 data.size = sizeof( e->e_id );
66 /* store it -- don't override */
67 rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
70 LDAP_LOG ( INDEX, ERR, "bdb_dn2id_add: put failed: %s %d\n",
71 db_strerror(rc), rc, 0 );
73 Debug( LDAP_DEBUG_ANY, "=> bdb_dn2id_add: put failed: %s %d\n",
74 db_strerror(rc), rc, 0 );
79 #ifndef BDB_MULTIPLE_SUFFIXES
80 if( !be_issuffix( op->o_bd, &ptr )) {
82 buf[0] = DN_SUBTREE_PREFIX;
83 rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
86 LDAP_LOG ( INDEX, ERR,
87 "=> bdb_dn2id_add: subtree (%s) put failed: %d\n",
90 Debug( LDAP_DEBUG_ANY,
91 "=> bdb_dn2id_add: subtree (%s) put failed: %d\n",
97 #ifdef BDB_MULTIPLE_SUFFIXES
98 if( !be_issuffix( op->o_bd, &ptr )) {
100 dnParent( &ptr, &pdn );
102 key.size = pdn.bv_len + 2;
104 pdn.bv_val[-1] = DN_ONE_PREFIX;
105 key.data = pdn.bv_val-1;
108 rc = bdb_idl_insert_key( op->o_bd, db, txn, &key, e->e_id );
112 LDAP_LOG ( INDEX, ERR,
113 "=> bdb_dn2id_add: parent (%s) insert failed: %d\n",
116 Debug( LDAP_DEBUG_ANY,
117 "=> bdb_dn2id_add: parent (%s) insert failed: %d\n",
122 #ifndef BDB_MULTIPLE_SUFFIXES
125 while( !be_issuffix( op->o_bd, &ptr )) {
129 ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
131 rc = bdb_idl_insert_key( op->o_bd, db, txn, &key, e->e_id );
135 LDAP_LOG ( INDEX, ERR,
136 "=> bdb_dn2id_add: subtree (%s) insert failed: %d\n",
139 Debug( LDAP_DEBUG_ANY,
140 "=> bdb_dn2id_add: subtree (%s) insert failed: %d\n",
145 #ifdef BDB_MULTIPLE_SUFFIXES
146 if( be_issuffix( op->o_bd, &ptr )) break;
148 dnParent( &ptr, &pdn );
150 key.size = pdn.bv_len + 2;
152 key.data = pdn.bv_val - 1;
155 #ifdef BDB_MULTIPLE_SUFFIXES
160 op->o_tmpfree( buf, op->o_tmpmemctx );
162 LDAP_LOG ( INDEX, RESULTS, "<= bdb_dn2id_add: %d\n", rc, 0, 0 );
164 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_add: %d\n", rc, 0, 0 );
176 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
177 DB *db = bdb->bi_dn2id->bdi_db;
181 struct berval pdn, ptr;
184 LDAP_LOG ( INDEX, ARGS,
185 "=> bdb_dn2id_delete ( \"%s\", 0x%08lx )\n", e->e_ndn, e->e_id, 0);
187 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_delete( \"%s\", 0x%08lx )\n",
188 e->e_ndn, e->e_id, 0 );
192 key.size = e->e_nname.bv_len + 2;
193 buf = op->o_tmpalloc( key.size, op->o_tmpmemctx );
195 key.flags = DB_DBT_USERMEM;
196 buf[0] = DN_BASE_PREFIX;
198 ptr.bv_len = e->e_nname.bv_len;
199 AC_MEMCPY( ptr.bv_val, e->e_nname.bv_val, e->e_nname.bv_len );
200 ptr.bv_val[ptr.bv_len] = '\0';
203 rc = db->del( db, txn, &key, 0 );
206 LDAP_LOG ( INDEX, ERR,
207 "=> bdb_dn2id_delete: delete failed: %s %d\n",
208 db_strerror(rc), rc, 0 );
210 Debug( LDAP_DEBUG_ANY, "=> bdb_dn2id_delete: delete failed: %s %d\n",
211 db_strerror(rc), rc, 0 );
216 #ifndef BDB_MULTIPLE_SUFFIXES
217 if( !be_issuffix( op->o_bd, &ptr )) {
219 buf[0] = DN_SUBTREE_PREFIX;
220 rc = db->del( db, txn, &key, 0 );
223 LDAP_LOG ( INDEX, ERR,
224 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
227 Debug( LDAP_DEBUG_ANY,
228 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
234 #ifdef BDB_MULTIPLE_SUFFIXES
235 if( !be_issuffix( op->o_bd, &ptr )) {
237 dnParent( &ptr, &pdn );
239 key.size = pdn.bv_len + 2;
241 pdn.bv_val[-1] = DN_ONE_PREFIX;
242 key.data = pdn.bv_val - 1;
245 rc = bdb_idl_delete_key( op->o_bd, db, txn, &key, e->e_id );
249 LDAP_LOG ( INDEX, ERR,
250 "=> bdb_dn2id_delete: parent (%s) delete failed: %d\n",
253 Debug( LDAP_DEBUG_ANY,
254 "=> bdb_dn2id_delete: parent (%s) delete failed: %d\n",
259 #ifndef BDB_MULTIPLE_SUFFIXES
262 while( !be_issuffix( op->o_bd, &ptr )) {
266 ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
268 rc = bdb_idl_delete_key( op->o_bd, db, txn, &key, e->e_id );
271 LDAP_LOG ( INDEX, ERR,
272 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
275 Debug( LDAP_DEBUG_ANY,
276 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
281 #ifdef BDB_MULTIPLE_SUFFIXES
282 if( be_issuffix( op->o_bd, &ptr )) break;
284 dnParent( &ptr, &pdn );
286 key.size = pdn.bv_len + 2;
288 key.data = pdn.bv_val - 1;
291 #ifdef BDB_MULTIPLE_SUFFIXES
296 op->o_tmpfree( buf, op->o_tmpmemctx );
298 LDAP_LOG ( INDEX, RESULTS, "<= bdb_dn2id_delete %d\n", rc, 0, 0 );
300 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_delete %d\n", rc, 0, 0 );
314 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
315 DB *db = bdb->bi_dn2id->bdi_db;
318 LDAP_LOG ( INDEX, ARGS, "=> bdb_dn2id( \"%s\" )\n", dn->bv_val, 0, 0 );
320 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id( \"%s\" )\n", dn->bv_val, 0, 0 );
323 key.size = dn->bv_len + 2;
324 key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
325 ((char *)key.data)[0] = DN_BASE_PREFIX;
326 AC_MEMCPY( &((char *)key.data)[1], dn->bv_val, key.size - 1 );
330 data.data = &ei->bei_id;
331 data.ulen = sizeof(ID);
332 data.flags = DB_DBT_USERMEM;
335 rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
339 LDAP_LOG ( INDEX, ERR, "<= bdb_dn2id: get failed %s (%d)\n",
340 db_strerror(rc), rc, 0 );
342 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: get failed: %s (%d)\n",
343 db_strerror( rc ), rc, 0 );
347 LDAP_LOG ( INDEX, RESULTS,
348 "<= bdb_dn2id: got id=0x%08lx\n", ei->bei_id, 0, 0 );
350 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: got id=0x%08lx\n",
355 op->o_tmpfree( key.data, op->o_tmpmemctx );
366 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
367 DB *db = bdb->bi_dn2id->bdi_db;
372 LDAP_LOG ( INDEX, ARGS,
373 "=> bdb_dn2id_children( %s )\n", e->e_nname.bv_val, 0, 0 );
375 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_children( %s )\n",
376 e->e_nname.bv_val, 0, 0 );
379 key.size = e->e_nname.bv_len + 2;
380 key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
381 ((char *)key.data)[0] = DN_ONE_PREFIX;
382 AC_MEMCPY( &((char *)key.data)[1], e->e_nname.bv_val, key.size - 1 );
384 #ifdef SLAP_IDL_CACHE
385 if ( bdb->bi_idl_cache_size ) {
386 rc = bdb_idl_cache_get( bdb, db, &key, NULL );
387 if ( rc != LDAP_NO_SUCH_OBJECT ) {
388 op->o_tmpfree( key.data, op->o_tmpmemctx );
393 /* we actually could do a empty get... */
396 data.ulen = sizeof(id);
397 data.flags = DB_DBT_USERMEM;
399 data.dlen = sizeof(id);
401 rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
402 op->o_tmpfree( key.data, op->o_tmpmemctx );
405 LDAP_LOG ( INDEX, DETAIL1,
406 "<= bdb_dn2id_children( %s ): %s (%d)\n",
407 e->e_nname.bv_val, rc == 0 ? "" : ( rc == DB_NOTFOUND ? "no " :
408 db_strerror(rc)), rc );
410 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_children( %s ): %s (%d)\n",
412 rc == 0 ? "" : ( rc == DB_NOTFOUND ? "no " :
413 db_strerror(rc) ), rc );
428 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
429 DB *db = bdb->bi_dn2id->bdi_db;
430 int prefix = op->ors_scope == LDAP_SCOPE_SUBTREE ? DN_SUBTREE_PREFIX :
434 LDAP_LOG ( INDEX, ARGS,
435 "=> bdb_dn2ididl( \"%s\" )\n", e->e_nname.bv_val, 0, 0 );
437 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2idl( \"%s\" )\n", e->e_nname.bv_val, 0, 0 );
440 #ifndef BDB_MULTIPLE_SUFFIXES
441 if (prefix == DN_SUBTREE_PREFIX && BEI(e)->bei_parent->bei_id == 0 )
443 BDB_IDL_ALL(bdb, ids);
449 key.size = e->e_nname.bv_len + 2;
451 key.flags = DB_DBT_USERMEM;
452 key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
453 ((char *)key.data)[0] = prefix;
454 AC_MEMCPY( &((char *)key.data)[1], e->e_nname.bv_val, key.size - 1 );
456 rc = bdb_idl_fetch_key( op->o_bd, db, NULL, &key, ids );
460 LDAP_LOG ( INDEX, ERR,
461 "<= bdb_dn2ididl: get failed: %s (%d)\n", db_strerror(rc), rc, 0 );
463 Debug( LDAP_DEBUG_TRACE,
464 "<= bdb_dn2idl: get failed: %s (%d)\n",
465 db_strerror( rc ), rc, 0 );
470 LDAP_LOG ( INDEX, RESULTS,
471 "<= bdb_dn2ididl: id=%ld first=%ld last=%ld\n",
472 (long) ids[0], (long) BDB_IDL_FIRST( ids ),
473 (long) BDB_IDL_LAST( ids ) );
475 Debug( LDAP_DEBUG_TRACE,
476 "<= bdb_dn2idl: id=%ld first=%ld last=%ld\n",
478 (long) BDB_IDL_FIRST( ids ), (long) BDB_IDL_LAST( ids ) );
482 op->o_tmpfree( key.data, op->o_tmpmemctx );
487 /* Experimental management routines for a hierarchically structured database.
489 * Unsupported! Use at your own risk!
490 * -- Howard Chu, Symas Corp. 2003.
492 * Instead of a ldbm-style dn2id database, we use a hierarchical one. Each
493 * entry in this database is a struct diskNode, keyed by entryID and with
494 * the data containing the RDN and entryID of the node's children. We use
495 * a B-Tree with sorted duplicates to store all the children of a node under
496 * the same key. Also, the first item under the key contains the entry's own
497 * rdn and the ID of the node's parent, to allow bottom-up tree traversal as
498 * well as top-down. To keep this info first in the list, the nrdnlen is set
499 * to the negative of its value.
501 * The diskNode is a variable length structure. This definition is not
502 * directly usable for in-memory manipulation.
504 typedef struct diskNode {
511 /* Sort function for the sorted duplicate data items of a dn2id key.
512 * Sorts based on normalized RDN, in length order.
521 char *u = (char *)&(((diskNode *)(usrkey->data))->nrdnlen);
522 char *c = (char *)&(((diskNode *)(curkey->data))->nrdnlen);
525 /* data is not aligned, cannot compare directly */
526 #ifdef WORDS_BIGENDIAN
527 for( i = 0; i < (int)sizeof(short); i++)
529 for( i = sizeof(short)-1; i >= 0; i--)
535 return strcmp( u+sizeof(short), c+sizeof(short) );
538 /* This function constructs a full DN for a given entry.
546 int rlen = 0, nrlen = 0;
550 /* count length of all DN components */
551 for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
552 rlen += ei->bei_rdn.bv_len + 1;
553 nrlen += ei->bei_nrdn.bv_len + 1;
554 if (ei->bei_modrdns > max) max = ei->bei_modrdns;
557 /* See if the entry DN was invalidated by a subtree rename */
559 if ( BEI(e)->bei_modrdns >= max ) {
562 /* We found a mismatch, tell the caller to lock it */
563 if ( checkit == 1 ) {
566 /* checkit == 2. do the fix. */
567 free( e->e_name.bv_val );
568 free( e->e_nname.bv_val );
571 e->e_name.bv_len = rlen - 1;
572 e->e_nname.bv_len = nrlen - 1;
573 e->e_name.bv_val = ch_malloc(rlen);
574 e->e_nname.bv_val = ch_malloc(nrlen);
575 ptr = e->e_name.bv_val;
576 nptr = e->e_nname.bv_val;
577 for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
578 ptr = lutil_strcopy(ptr, ei->bei_rdn.bv_val);
579 nptr = lutil_strcopy(nptr, ei->bei_nrdn.bv_val);
580 if ( ei->bei_parent ) {
585 BEI(e)->bei_modrdns = max;
592 /* We add two elements to the DN2ID database - a data item under the parent's
593 * entryID containing the child's RDN and entryID, and an item under the
594 * child's entryID containing the parent's entryID.
603 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
604 DB *db = bdb->bi_dn2id->bdi_db;
610 nrlen = dn_rdnlen( op->o_bd, &e->e_nname );
612 rlen = dn_rdnlen( op->o_bd, &e->e_name );
614 nrlen = e->e_nname.bv_len;
615 rlen = e->e_name.bv_len;
618 d = op->o_tmpalloc(sizeof(diskNode) + rlen + nrlen, op->o_tmpmemctx);
619 d->entryID = e->e_id;
621 ptr = lutil_strncopy( d->nrdn, e->e_nname.bv_val, nrlen );
623 ptr = lutil_strncopy( ptr, e->e_name.bv_val, rlen );
628 key.data = &eip->bei_id;
629 key.size = sizeof(ID);
630 key.flags = DB_DBT_USERMEM;
632 #ifdef SLAP_IDL_CACHE
633 if ( bdb->bi_idl_cache_size ) {
634 bdb_idl_cache_del( bdb, db, &key );
638 data.size = sizeof(diskNode) + rlen + nrlen;
639 data.flags = DB_DBT_USERMEM;
641 rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
645 d->entryID = eip->bei_id;
646 d->nrdnlen = 0 - nrlen;
648 rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
651 op->o_tmpfree( d, op->o_tmpmemctx );
663 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
664 DB *db = bdb->bi_dn2id->bdi_db;
671 key.size = sizeof(ID);
673 key.data = &eip->bei_id;
674 key.flags = DB_DBT_USERMEM;
677 data.size = sizeof(diskNode) + BEI(e)->bei_nrdn.bv_len;
678 data.ulen = data.size;
679 data.dlen = data.size;
680 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
682 #ifdef SLAP_IDL_CACHE
683 if ( bdb->bi_idl_cache_size ) {
684 bdb_idl_cache_del( bdb, db, &key );
687 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
690 d = op->o_tmpalloc( data.size, op->o_tmpmemctx );
691 d->entryID = e->e_id;
692 d->nrdnlen = BEI(e)->bei_nrdn.bv_len;
693 strcpy( d->nrdn, BEI(e)->bei_nrdn.bv_val );
696 /* Delete our ID from the parent's list */
697 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH | DB_RMW );
699 rc = cursor->c_del( cursor, 0 );
701 /* Delete our ID from the tree. With sorted duplicates, this
702 * will leave any child nodes still hanging around. This is OK
703 * for modrdn, which will add our info back in later.
707 rc = cursor->c_get( cursor, &key, &data, DB_SET | DB_RMW );
709 rc = cursor->c_del( cursor, 0 );
711 cursor->c_close( cursor );
712 op->o_tmpfree( d, op->o_tmpmemctx );
725 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
726 DB *db = bdb->bi_dn2id->bdi_db;
732 ID idp = ei->bei_parent->bei_id;
734 nrlen = dn_rdnlen( op->o_bd, in );
735 if (!nrlen) nrlen = in->bv_len;
738 key.size = sizeof(ID);
740 key.ulen = sizeof(ID);
741 key.flags = DB_DBT_USERMEM;
744 data.size = sizeof(diskNode) + nrlen;
745 data.ulen = data.size * 3;
746 data.flags = DB_DBT_USERMEM;
748 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
751 d = op->o_tmpalloc( data.size * 3, op->o_tmpmemctx );
753 ptr = lutil_strncopy( d->nrdn, in->bv_val, nrlen );
757 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH );
759 ei->bei_id = d->entryID;
760 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) - nrlen;
761 ptr = d->nrdn + nrlen + 1;
762 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
763 if ( !ei->bei_parent->bei_dkids ) {
765 /* How many children does the parent have? */
766 /* FIXME: do we need to lock the parent
767 * entryinfo? Seems safe...
769 cursor->c_count( cursor, &dkids, 0 );
770 ei->bei_parent->bei_dkids = dkids;
773 cursor->c_close( cursor );
774 op->o_tmpfree( d, op->o_tmpmemctx );
786 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
787 DB *db = bdb->bi_dn2id->bdi_db;
796 key.size = sizeof(ID);
797 key.data = &ei->bei_id;
798 key.ulen = sizeof(ID);
799 key.flags = DB_DBT_USERMEM;
802 data.flags = DB_DBT_USERMEM;
804 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
807 data.ulen = sizeof(diskNode) + (SLAP_LDAPDN_MAXLEN * 2);
808 d = op->o_tmpalloc( data.ulen, op->o_tmpmemctx );
811 rc = cursor->c_get( cursor, &key, &data, DB_SET );
813 if (d->nrdnlen >= 0) {
818 ei->bei_nrdn.bv_len = 0 - d->nrdnlen;
819 ber_str2bv( d->nrdn, ei->bei_nrdn.bv_len, 1, &ei->bei_nrdn );
820 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) -
822 ptr = d->nrdn + ei->bei_nrdn.bv_len + 1;
823 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
824 /* How many children does this node have? */
825 cursor->c_count( cursor, &dkids, 0 );
826 ei->bei_dkids = dkids;
829 cursor->c_close( cursor );
830 op->o_tmpfree( d, op->o_tmpmemctx );
840 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
841 DB *db = bdb->bi_dn2id->bdi_db;
849 key.size = sizeof(ID);
851 key.flags = DB_DBT_USERMEM;
853 #ifdef SLAP_IDL_CACHE
854 if ( bdb->bi_idl_cache_size ) {
855 rc = bdb_idl_cache_get( bdb, db, &key, NULL );
856 if ( rc != LDAP_NO_SUCH_OBJECT ) {
863 data.ulen = sizeof(d);
864 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
865 data.dlen = sizeof(d);
867 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
870 rc = cursor->c_get( cursor, &key, &data, DB_SET );
873 rc = cursor->c_count( cursor, &dkids, 0 );
875 BEI(e)->bei_dkids = dkids;
876 if ( dkids < 2 ) rc = DB_NOTFOUND;
879 cursor->c_close( cursor );
884 * We can't just use bdb_idl_fetch_key because
885 * 1 - our data items are longer than just an entry ID
886 * 2 - our data items are sorted alphabetically by nrdn, not by ID.
888 * We descend the tree recursively, so we define this cookie
889 * to hold our necessary state information. The bdb_dn2idl_internal
890 * function uses this cookie when calling itself.
893 struct dn2id_cookie {
894 struct bdb_info *bdb;
903 ID tmp[BDB_IDL_DB_SIZE];
916 EntryInfo *ei = data;
919 bdb_idl_insert( idl, ei->bei_id );
925 struct dn2id_cookie *cx
928 #ifdef SLAP_IDL_CACHE
929 if ( cx->bdb->bi_idl_cache_size ) {
930 cx->rc = bdb_idl_cache_get(cx->bdb, cx->db, &cx->key, cx->tmp);
931 if ( cx->rc == DB_NOTFOUND ) {
934 if ( cx->rc == LDAP_SUCCESS ) {
939 BDB_IDL_ZERO( cx->tmp );
942 cx->ei = bdb_cache_find_info( cx->bdb, cx->id );
944 cx->rc = DB_NOTFOUND;
949 bdb_cache_entryinfo_lock( cx->ei );
951 /* If number of kids in the cache differs from on-disk, load
952 * up all the kids from the database
954 if ( cx->ei->bei_ckids+1 != cx->ei->bei_dkids ) {
956 db_recno_t dkids = cx->ei->bei_dkids;
957 ei.bei_parent = cx->ei;
959 bdb_cache_entryinfo_unlock( cx->ei );
961 cx->rc = cx->db->cursor( cx->db, NULL, &cx->dbc,
962 cx->bdb->bi_db_opflags );
963 if ( cx->rc ) return cx->rc;
965 cx->data.data = &cx->dbuf;
966 cx->data.ulen = sizeof(ID);
967 cx->data.dlen = sizeof(ID);
968 cx->data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
970 /* The first item holds the parent ID. Ignore it. */
971 cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data, DB_SET );
973 cx->dbc->c_close( cx->dbc );
974 if ( cx->rc == DB_NOTFOUND ) goto saveit;
978 /* If the on-disk count is zero we've never checked it.
982 cx->dbc->c_count( cx->dbc, &dkids, 0 );
983 cx->ei->bei_dkids = dkids;
986 cx->data.data = cx->buf;
987 cx->data.ulen = BDB_IDL_UM_SIZE * sizeof(ID);
988 cx->data.flags = DB_DBT_USERMEM;
990 /* Fetch the rest of the IDs in a loop... */
991 while ( (cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data,
992 DB_MULTIPLE | DB_NEXT_DUP )) == 0 ) {
995 DB_MULTIPLE_INIT( cx->ptr, &cx->data );
997 DB_MULTIPLE_NEXT( cx->ptr, &cx->data, j, len );
1000 diskNode *d = (diskNode *)j;
1003 AC_MEMCPY( &ei.bei_id, &d->entryID, sizeof(ID) );
1004 AC_MEMCPY( &nrlen, &d->nrdnlen, sizeof(d->nrdnlen) );
1005 ei.bei_nrdn.bv_len = nrlen;
1006 /* nrdn/rdn are set in-place.
1007 * hdb_cache_load will copy them as needed
1009 ei.bei_nrdn.bv_val = d->nrdn;
1010 ei.bei_rdn.bv_len = len - sizeof(diskNode) - ei.bei_nrdn.bv_len;
1011 ei.bei_rdn.bv_val = d->nrdn + ei.bei_nrdn.bv_len + 1;
1012 bdb_idl_insert( cx->tmp, ei.bei_id );
1013 hdb_cache_load( cx->bdb, &ei, &ei2 );
1017 cx->rc = cx->dbc->c_close( cx->dbc );
1019 /* The in-memory cache is in sync with the on-disk data.
1020 * do we have any kids?
1023 if ( cx->ei->bei_ckids > 0 ) {
1025 /* Walk the kids tree; order is irrelevant since bdb_idl_insert
1026 * will insert in sorted order.
1028 avl_apply( cx->ei->bei_kids, apply_func, cx->tmp, -1, AVL_POSTORDER );
1030 bdb_cache_entryinfo_unlock( cx->ei );
1034 #ifdef SLAP_IDL_CACHE
1035 if ( cx->bdb->bi_idl_cache_max_size ) {
1036 bdb_idl_cache_put( cx->bdb, cx->db, &cx->key, cx->tmp, cx->rc );
1041 if ( !BDB_IDL_IS_ZERO( cx->tmp )) {
1042 if ( cx->prefix == DN_SUBTREE_PREFIX ) {
1043 if (cx->ei->bei_state & CACHE_ENTRY_NO_GRANDKIDS) {
1044 bdb_idl_union( cx->ids, cx->tmp );
1047 EntryInfo *ei = cx->ei;
1049 save = cx->op->o_tmpalloc( BDB_IDL_SIZEOF( cx->tmp ),
1050 cx->op->o_tmpmemctx );
1051 BDB_IDL_CPY( save, cx->tmp );
1052 bdb_idl_union( cx->ids, cx->tmp );
1055 for ( cx->id = bdb_idl_first( save, &idcurs );
1057 cx->id = bdb_idl_next( save, &idcurs )) {
1059 hdb_dn2idl_internal( cx );
1060 if ( !BDB_IDL_IS_ZERO( cx->tmp ))
1063 cx->op->o_tmpfree( save, cx->op->o_tmpmemctx );
1064 if ( nokids ) ei->bei_state |= CACHE_ENTRY_NO_GRANDKIDS;
1066 /* Make sure caller knows it had kids! */
1071 BDB_IDL_CPY( cx->ids, cx->tmp );
1084 struct bdb_info *bdb = (struct bdb_info *)op->o_bd->be_private;
1085 struct dn2id_cookie cx;
1088 LDAP_LOG ( INDEX, ARGS,
1089 "=> hdb_dn2ididl( \"%s\" )\n", e->e_nname.bv_val, 0, 0 );
1091 Debug( LDAP_DEBUG_TRACE, "=> hdb_dn2idl( \"%s\" )\n", e->e_nname.bv_val, 0, 0 );
1094 #ifndef BDB_MULTIPLE_SUFFIXES
1095 if ( op->ors_scope == LDAP_SCOPE_SUBTREE &&
1096 BEI(e)->bei_parent->bei_id == 0 ) {
1097 BDB_IDL_ALL( bdb, ids );
1105 cx.db = cx.bdb->bi_dn2id->bdi_db;
1106 cx.prefix = op->ors_scope == LDAP_SCOPE_SUBTREE ? DN_SUBTREE_PREFIX :
1112 BDB_IDL_ZERO( ids );
1113 if ( cx.prefix == DN_SUBTREE_PREFIX ) {
1114 bdb_idl_insert( ids, cx.id );
1118 cx.key.data = &cx.id;
1119 cx.key.ulen = sizeof(ID);
1120 cx.key.size = sizeof(ID);
1121 cx.key.flags = DB_DBT_USERMEM;
1125 return hdb_dn2idl_internal(&cx);
1127 #endif /* BDB_HIER */