1 /* dn2id.c - routines to deal with the dn2id index */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 2000-2005 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
20 #include <ac/string.h>
34 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
35 DB *db = bdb->bi_dn2id->bdi_db;
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 ))
130 ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
132 rc = bdb_idl_insert_key( op->o_bd, db, txn, &key, e->e_id );
136 LDAP_LOG ( INDEX, ERR,
137 "=> bdb_dn2id_add: subtree (%s) insert failed: %d\n",
140 Debug( LDAP_DEBUG_ANY,
141 "=> bdb_dn2id_add: subtree (%s) insert failed: %d\n",
146 #ifdef BDB_MULTIPLE_SUFFIXES
147 if( be_issuffix( op->o_bd, &ptr )) break;
149 dnParent( &ptr, &pdn );
151 key.size = pdn.bv_len + 2;
153 key.data = pdn.bv_val - 1;
156 #ifdef BDB_MULTIPLE_SUFFIXES
161 op->o_tmpfree( buf, op->o_tmpmemctx );
163 LDAP_LOG ( INDEX, RESULTS, "<= bdb_dn2id_add: %d\n", rc, 0, 0 );
165 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_add: %d\n", rc, 0, 0 );
177 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
178 DB *db = bdb->bi_dn2id->bdi_db;
182 struct berval pdn, ptr;
185 LDAP_LOG ( INDEX, ARGS,
186 "=> bdb_dn2id_delete ( \"%s\", 0x%08lx )\n", e->e_ndn, e->e_id, 0);
188 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_delete( \"%s\", 0x%08lx )\n",
189 e->e_ndn, e->e_id, 0 );
193 key.size = e->e_nname.bv_len + 2;
194 buf = op->o_tmpalloc( key.size, op->o_tmpmemctx );
196 key.flags = DB_DBT_USERMEM;
197 buf[0] = DN_BASE_PREFIX;
199 ptr.bv_len = e->e_nname.bv_len;
200 AC_MEMCPY( ptr.bv_val, e->e_nname.bv_val, e->e_nname.bv_len );
201 ptr.bv_val[ptr.bv_len] = '\0';
204 rc = db->del( db, txn, &key, 0 );
207 LDAP_LOG ( INDEX, ERR,
208 "=> bdb_dn2id_delete: delete failed: %s %d\n",
209 db_strerror(rc), rc, 0 );
211 Debug( LDAP_DEBUG_ANY, "=> bdb_dn2id_delete: delete failed: %s %d\n",
212 db_strerror(rc), rc, 0 );
217 #ifndef BDB_MULTIPLE_SUFFIXES
218 if( !be_issuffix( op->o_bd, &ptr )) {
220 buf[0] = DN_SUBTREE_PREFIX;
221 rc = db->del( db, txn, &key, 0 );
224 LDAP_LOG ( INDEX, ERR,
225 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
228 Debug( LDAP_DEBUG_ANY,
229 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
235 #ifdef BDB_MULTIPLE_SUFFIXES
236 if( !be_issuffix( op->o_bd, &ptr )) {
238 dnParent( &ptr, &pdn );
240 key.size = pdn.bv_len + 2;
242 pdn.bv_val[-1] = DN_ONE_PREFIX;
243 key.data = pdn.bv_val - 1;
246 rc = bdb_idl_delete_key( op->o_bd, db, txn, &key, e->e_id );
250 LDAP_LOG ( INDEX, ERR,
251 "=> bdb_dn2id_delete: parent (%s) delete failed: %d\n",
254 Debug( LDAP_DEBUG_ANY,
255 "=> bdb_dn2id_delete: parent (%s) delete failed: %d\n",
260 #ifndef BDB_MULTIPLE_SUFFIXES
263 while( !be_issuffix( op->o_bd, &ptr )) {
267 ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
269 rc = bdb_idl_delete_key( op->o_bd, db, txn, &key, e->e_id );
272 LDAP_LOG ( INDEX, ERR,
273 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
276 Debug( LDAP_DEBUG_ANY,
277 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
282 #ifdef BDB_MULTIPLE_SUFFIXES
283 if( be_issuffix( op->o_bd, &ptr )) break;
285 dnParent( &ptr, &pdn );
287 key.size = pdn.bv_len + 2;
289 key.data = pdn.bv_val - 1;
292 #ifdef BDB_MULTIPLE_SUFFIXES
297 op->o_tmpfree( buf, op->o_tmpmemctx );
299 LDAP_LOG ( INDEX, RESULTS, "<= bdb_dn2id_delete %d\n", rc, 0, 0 );
301 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_delete %d\n", rc, 0, 0 );
315 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
316 DB *db = bdb->bi_dn2id->bdi_db;
319 LDAP_LOG ( INDEX, ARGS, "=> bdb_dn2id( \"%s\" )\n", dn->bv_val, 0, 0 );
321 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id( \"%s\" )\n", dn->bv_val, 0, 0 );
324 key.size = dn->bv_len + 2;
325 key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
326 ((char *)key.data)[0] = DN_BASE_PREFIX;
327 AC_MEMCPY( &((char *)key.data)[1], dn->bv_val, key.size - 1 );
331 data.data = &ei->bei_id;
332 data.ulen = sizeof(ID);
333 data.flags = DB_DBT_USERMEM;
336 rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
340 LDAP_LOG ( INDEX, ERR, "<= bdb_dn2id: get failed %s (%d)\n",
341 db_strerror(rc), rc, 0 );
343 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: get failed: %s (%d)\n",
344 db_strerror( rc ), rc, 0 );
348 LDAP_LOG ( INDEX, RESULTS,
349 "<= bdb_dn2id: got id=0x%08lx\n", ei->bei_id, 0, 0 );
351 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: got id=0x%08lx\n",
356 op->o_tmpfree( key.data, op->o_tmpmemctx );
367 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
368 DB *db = bdb->bi_dn2id->bdi_db;
373 LDAP_LOG ( INDEX, ARGS,
374 "=> bdb_dn2id_children( %s )\n", e->e_nname.bv_val, 0, 0 );
376 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_children( %s )\n",
377 e->e_nname.bv_val, 0, 0 );
380 key.size = e->e_nname.bv_len + 2;
381 key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
382 ((char *)key.data)[0] = DN_ONE_PREFIX;
383 AC_MEMCPY( &((char *)key.data)[1], e->e_nname.bv_val, key.size - 1 );
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 );
392 /* we actually could do a empty get... */
395 data.ulen = sizeof(id);
396 data.flags = DB_DBT_USERMEM;
398 data.dlen = sizeof(id);
400 rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
401 op->o_tmpfree( key.data, op->o_tmpmemctx );
404 LDAP_LOG ( INDEX, DETAIL1,
405 "<= bdb_dn2id_children( %s ): %s (%d)\n",
406 e->e_nname.bv_val, rc == 0 ? "" : ( rc == DB_NOTFOUND ? "no " :
407 db_strerror(rc)), rc );
409 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_children( %s ): %s (%d)\n",
411 rc == 0 ? "" : ( rc == DB_NOTFOUND ? "no " :
412 db_strerror(rc) ), rc );
427 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
428 DB *db = bdb->bi_dn2id->bdi_db;
429 int prefix = ( op->ors_scope == LDAP_SCOPE_ONELEVEL )
430 ? DN_ONE_PREFIX : DN_SUBTREE_PREFIX;
433 LDAP_LOG ( INDEX, ARGS, "=> bdb_dn2ididl( \"%s\" )\n",
434 e->e_nname.bv_val, 0, 0 );
436 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2idl( \"%s\" )\n",
437 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 ) {
442 BDB_IDL_ALL(bdb, ids);
448 key.size = e->e_nname.bv_len + 2;
450 key.flags = DB_DBT_USERMEM;
451 key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
452 ((char *)key.data)[0] = prefix;
453 AC_MEMCPY( &((char *)key.data)[1], e->e_nname.bv_val, key.size - 1 );
455 rc = bdb_idl_fetch_key( op->o_bd, db, NULL, &key, ids );
459 LDAP_LOG ( INDEX, ERR,
460 "<= bdb_dn2ididl: get failed: %s (%d)\n", db_strerror(rc), rc, 0 );
462 Debug( LDAP_DEBUG_TRACE,
463 "<= bdb_dn2idl: get failed: %s (%d)\n",
464 db_strerror( rc ), rc, 0 );
469 LDAP_LOG ( INDEX, RESULTS,
470 "<= bdb_dn2ididl: id=%ld first=%ld last=%ld\n",
471 (long) ids[0], (long) BDB_IDL_FIRST( ids ),
472 (long) BDB_IDL_LAST( ids ) );
474 Debug( LDAP_DEBUG_TRACE,
475 "<= bdb_dn2idl: id=%ld first=%ld last=%ld\n",
477 (long) BDB_IDL_FIRST( ids ), (long) BDB_IDL_LAST( ids ) );
481 op->o_tmpfree( key.data, op->o_tmpmemctx );
486 /* Experimental management routines for a hierarchically structured database.
488 * Unsupported! Use at your own risk!
489 * -- Howard Chu, Symas Corp. 2003.
491 * Instead of a ldbm-style dn2id database, we use a hierarchical one. Each
492 * entry in this database is a struct diskNode, keyed by entryID and with
493 * the data containing the RDN and entryID of the node's children. We use
494 * a B-Tree with sorted duplicates to store all the children of a node under
495 * the same key. Also, the first item under the key contains the entry's own
496 * rdn and the ID of the node's parent, to allow bottom-up tree traversal as
497 * well as top-down. To keep this info first in the list, the nrdnlen is set
498 * to the negative of its value.
500 * The diskNode is a variable length structure. This definition is not
501 * directly usable for in-memory manipulation.
503 typedef struct diskNode {
510 /* Sort function for the sorted duplicate data items of a dn2id key.
511 * Sorts based on normalized RDN, in length order.
520 signed char *u = (signed char *)&(((diskNode *)(usrkey->data))->nrdnlen);
521 signed char *c = (signed char *)&(((diskNode *)(curkey->data))->nrdnlen);
524 /* data is not aligned, cannot compare directly */
525 #ifdef WORDS_BIGENDIAN
526 for( i = 0; i < (int)sizeof(short); i++)
528 for( i = sizeof(short)-1; i >= 0; i--)
534 return strcmp( u+sizeof(short), c+sizeof(short) );
537 /* This function constructs a full DN for a given entry.
545 int rlen = 0, nrlen = 0;
549 /* count length of all DN components */
550 for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
551 rlen += ei->bei_rdn.bv_len + 1;
552 nrlen += ei->bei_nrdn.bv_len + 1;
553 if (ei->bei_modrdns > max) max = ei->bei_modrdns;
556 /* See if the entry DN was invalidated by a subtree rename */
558 if ( BEI(e)->bei_modrdns >= max ) {
561 /* We found a mismatch, tell the caller to lock it */
562 if ( checkit == 1 ) {
565 /* checkit == 2. do the fix. */
566 free( e->e_name.bv_val );
567 free( e->e_nname.bv_val );
570 e->e_name.bv_len = rlen - 1;
571 e->e_nname.bv_len = nrlen - 1;
572 e->e_name.bv_val = ch_malloc(rlen);
573 e->e_nname.bv_val = ch_malloc(nrlen);
574 ptr = e->e_name.bv_val;
575 nptr = e->e_nname.bv_val;
576 for ( ei = BEI(e); ei && ei->bei_id; ei=ei->bei_parent ) {
577 ptr = lutil_strcopy(ptr, ei->bei_rdn.bv_val);
578 nptr = lutil_strcopy(nptr, ei->bei_nrdn.bv_val);
579 if ( ei->bei_parent ) {
584 BEI(e)->bei_modrdns = max;
591 /* We add two elements to the DN2ID database - a data item under the parent's
592 * entryID containing the child's RDN and entryID, and an item under the
593 * child's entryID containing the parent's entryID.
602 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
603 DB *db = bdb->bi_dn2id->bdi_db;
609 nrlen = dn_rdnlen( op->o_bd, &e->e_nname );
611 rlen = dn_rdnlen( op->o_bd, &e->e_name );
613 nrlen = e->e_nname.bv_len;
614 rlen = e->e_name.bv_len;
617 d = op->o_tmpalloc(sizeof(diskNode) + rlen + nrlen, op->o_tmpmemctx);
618 d->entryID = e->e_id;
620 ptr = lutil_strncopy( d->nrdn, e->e_nname.bv_val, nrlen );
622 ptr = lutil_strncopy( ptr, e->e_name.bv_val, rlen );
627 key.data = &eip->bei_id;
628 key.size = sizeof(ID);
629 key.flags = DB_DBT_USERMEM;
631 /* Need to make dummy root node once. Subsequent attempts
632 * will fail harmlessly.
634 if ( eip->bei_id == 0 ) {
635 diskNode dummy = {0};
637 data.size = sizeof(diskNode);
638 data.flags = DB_DBT_USERMEM;
640 db->put( db, txn, &key, &data, DB_NODUPDATA );
643 if ( bdb->bi_idl_cache_size ) {
644 bdb_idl_cache_del( bdb, db, &key );
647 data.size = sizeof(diskNode) + rlen + nrlen;
648 data.flags = DB_DBT_USERMEM;
650 rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
654 d->entryID = eip->bei_id;
655 d->nrdnlen = 0 - nrlen;
657 rc = db->put( db, txn, &key, &data, DB_NODUPDATA );
660 op->o_tmpfree( d, op->o_tmpmemctx );
672 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
673 DB *db = bdb->bi_dn2id->bdi_db;
680 key.size = sizeof(ID);
682 key.data = &eip->bei_id;
683 key.flags = DB_DBT_USERMEM;
686 data.size = sizeof(diskNode) + BEI(e)->bei_nrdn.bv_len;
687 data.ulen = data.size;
688 data.dlen = data.size;
689 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
691 if ( bdb->bi_idl_cache_size ) {
692 bdb_idl_cache_del( bdb, db, &key );
694 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
697 d = op->o_tmpalloc( data.size, op->o_tmpmemctx );
698 d->entryID = e->e_id;
699 d->nrdnlen = BEI(e)->bei_nrdn.bv_len;
700 strcpy( d->nrdn, BEI(e)->bei_nrdn.bv_val );
703 /* Delete our ID from the parent's list */
704 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH | DB_RMW );
706 rc = cursor->c_del( cursor, 0 );
708 /* Delete our ID from the tree. With sorted duplicates, this
709 * will leave any child nodes still hanging around. This is OK
710 * for modrdn, which will add our info back in later.
714 rc = cursor->c_get( cursor, &key, &data, DB_SET | DB_RMW );
716 rc = cursor->c_del( cursor, 0 );
718 cursor->c_close( cursor );
719 op->o_tmpfree( d, op->o_tmpmemctx );
732 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
733 DB *db = bdb->bi_dn2id->bdi_db;
739 ID idp = ei->bei_parent->bei_id;
741 nrlen = dn_rdnlen( op->o_bd, in );
742 if (!nrlen) nrlen = in->bv_len;
745 key.size = sizeof(ID);
747 key.ulen = sizeof(ID);
748 key.flags = DB_DBT_USERMEM;
751 data.size = sizeof(diskNode) + nrlen;
752 data.ulen = data.size * 3;
753 data.flags = DB_DBT_USERMEM;
755 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
758 d = op->o_tmpalloc( data.size * 3, op->o_tmpmemctx );
760 ptr = lutil_strncopy( d->nrdn, in->bv_val, nrlen );
764 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH );
766 ei->bei_id = d->entryID;
767 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) - nrlen;
768 ptr = d->nrdn + nrlen + 1;
769 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
770 if ( !ei->bei_parent->bei_dkids ) {
772 /* How many children does the parent have? */
773 /* FIXME: do we need to lock the parent
774 * entryinfo? Seems safe...
776 cursor->c_count( cursor, &dkids, 0 );
777 ei->bei_parent->bei_dkids = dkids;
780 cursor->c_close( cursor );
781 op->o_tmpfree( d, op->o_tmpmemctx );
793 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
794 DB *db = bdb->bi_dn2id->bdi_db;
803 key.size = sizeof(ID);
804 key.data = &ei->bei_id;
805 key.ulen = sizeof(ID);
806 key.flags = DB_DBT_USERMEM;
809 data.flags = DB_DBT_USERMEM;
811 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
814 data.ulen = sizeof(diskNode) + (SLAP_LDAPDN_MAXLEN * 2);
815 d = op->o_tmpalloc( data.ulen, op->o_tmpmemctx );
818 rc = cursor->c_get( cursor, &key, &data, DB_SET );
820 if (d->nrdnlen >= 0) {
825 ei->bei_nrdn.bv_len = 0 - d->nrdnlen;
826 ber_str2bv( d->nrdn, ei->bei_nrdn.bv_len, 1, &ei->bei_nrdn );
827 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) -
829 ptr = d->nrdn + ei->bei_nrdn.bv_len + 1;
830 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
831 /* How many children does this node have? */
832 cursor->c_count( cursor, &dkids, 0 );
833 ei->bei_dkids = dkids;
836 cursor->c_close( cursor );
837 op->o_tmpfree( d, op->o_tmpmemctx );
847 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
848 DB *db = bdb->bi_dn2id->bdi_db;
856 key.size = sizeof(ID);
858 key.flags = DB_DBT_USERMEM;
860 if ( bdb->bi_idl_cache_size ) {
861 rc = bdb_idl_cache_get( bdb, db, &key, NULL );
862 if ( rc != LDAP_NO_SUCH_OBJECT ) {
868 data.ulen = sizeof(d);
869 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
870 data.dlen = sizeof(d);
872 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
875 rc = cursor->c_get( cursor, &key, &data, DB_SET );
878 rc = cursor->c_count( cursor, &dkids, 0 );
880 BEI(e)->bei_dkids = dkids;
881 if ( dkids < 2 ) rc = DB_NOTFOUND;
884 cursor->c_close( cursor );
889 * We can't just use bdb_idl_fetch_key because
890 * 1 - our data items are longer than just an entry ID
891 * 2 - our data items are sorted alphabetically by nrdn, not by ID.
893 * We descend the tree recursively, so we define this cookie
894 * to hold our necessary state information. The bdb_dn2idl_internal
895 * function uses this cookie when calling itself.
898 struct dn2id_cookie {
899 struct bdb_info *bdb;
908 ID tmp[BDB_IDL_DB_SIZE];
921 EntryInfo *ei = data;
924 bdb_idl_insert( idl, ei->bei_id );
930 struct dn2id_cookie *cx
933 BDB_IDL_ZERO( cx->tmp );
936 cx->ei = bdb_cache_find_info( cx->bdb, cx->id );
938 cx->rc = DB_NOTFOUND;
943 if ( cx->bdb->bi_idl_cache_size ) {
944 cx->rc = bdb_idl_cache_get(cx->bdb, cx->db, &cx->key, cx->tmp);
945 if ( cx->rc == DB_NOTFOUND ) {
948 if ( cx->rc == LDAP_SUCCESS ) {
953 bdb_cache_entryinfo_lock( cx->ei );
955 /* If number of kids in the cache differs from on-disk, load
956 * up all the kids from the database
958 if ( cx->ei->bei_ckids+1 != cx->ei->bei_dkids ) {
960 db_recno_t dkids = cx->ei->bei_dkids;
961 ei.bei_parent = cx->ei;
963 bdb_cache_entryinfo_unlock( cx->ei );
965 cx->rc = cx->db->cursor( cx->db, NULL, &cx->dbc,
966 cx->bdb->bi_db_opflags );
967 if ( cx->rc ) return cx->rc;
969 cx->data.data = &cx->dbuf;
970 cx->data.ulen = sizeof(ID);
971 cx->data.dlen = sizeof(ID);
972 cx->data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
974 /* The first item holds the parent ID. Ignore it. */
975 cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data, DB_SET );
977 cx->dbc->c_close( cx->dbc );
978 if ( cx->rc == DB_NOTFOUND ) goto saveit;
982 /* If the on-disk count is zero we've never checked it.
986 cx->dbc->c_count( cx->dbc, &dkids, 0 );
987 cx->ei->bei_dkids = dkids;
990 cx->data.data = cx->buf;
991 cx->data.ulen = BDB_IDL_UM_SIZE * sizeof(ID);
992 cx->data.flags = DB_DBT_USERMEM;
994 /* Fetch the rest of the IDs in a loop... */
995 while ( (cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data,
996 DB_MULTIPLE | DB_NEXT_DUP )) == 0 ) {
999 DB_MULTIPLE_INIT( cx->ptr, &cx->data );
1001 DB_MULTIPLE_NEXT( cx->ptr, &cx->data, j, len );
1004 diskNode *d = (diskNode *)j;
1007 AC_MEMCPY( &ei.bei_id, &d->entryID, sizeof(ID) );
1008 AC_MEMCPY( &nrlen, &d->nrdnlen, sizeof(d->nrdnlen) );
1009 ei.bei_nrdn.bv_len = nrlen;
1010 /* nrdn/rdn are set in-place.
1011 * hdb_cache_load will copy them as needed
1013 ei.bei_nrdn.bv_val = d->nrdn;
1014 ei.bei_rdn.bv_len = len - sizeof(diskNode) - ei.bei_nrdn.bv_len;
1015 ei.bei_rdn.bv_val = d->nrdn + ei.bei_nrdn.bv_len + 1;
1016 bdb_idl_insert( cx->tmp, ei.bei_id );
1017 hdb_cache_load( cx->bdb, &ei, &ei2 );
1021 cx->rc = cx->dbc->c_close( cx->dbc );
1023 /* The in-memory cache is in sync with the on-disk data.
1024 * do we have any kids?
1027 if ( cx->ei->bei_ckids > 0 ) {
1029 /* Walk the kids tree; order is irrelevant since bdb_idl_insert
1030 * will insert in sorted order.
1032 avl_apply( cx->ei->bei_kids, apply_func, cx->tmp, -1, AVL_POSTORDER );
1034 bdb_cache_entryinfo_unlock( cx->ei );
1038 if ( cx->bdb->bi_idl_cache_max_size ) {
1039 bdb_idl_cache_put( cx->bdb, cx->db, &cx->key, cx->tmp, cx->rc );
1043 if ( !BDB_IDL_IS_ZERO( cx->tmp )) {
1044 if ( cx->prefix == DN_SUBTREE_PREFIX ) {
1045 if (cx->ei->bei_state & CACHE_ENTRY_NO_GRANDKIDS) {
1046 bdb_idl_union( cx->ids, cx->tmp );
1049 EntryInfo *ei = cx->ei;
1051 save = cx->op->o_tmpalloc( BDB_IDL_SIZEOF( cx->tmp ),
1052 cx->op->o_tmpmemctx );
1053 BDB_IDL_CPY( save, cx->tmp );
1054 bdb_idl_union( cx->ids, cx->tmp );
1057 for ( cx->id = bdb_idl_first( save, &idcurs );
1059 cx->id = bdb_idl_next( save, &idcurs )) {
1061 hdb_dn2idl_internal( cx );
1062 if ( !BDB_IDL_IS_ZERO( cx->tmp ))
1065 cx->op->o_tmpfree( save, cx->op->o_tmpmemctx );
1066 if ( nokids ) ei->bei_state |= CACHE_ENTRY_NO_GRANDKIDS;
1068 /* Make sure caller knows it had kids! */
1073 BDB_IDL_CPY( cx->ids, cx->tmp );
1086 struct bdb_info *bdb = (struct bdb_info *)op->o_bd->be_private;
1087 struct dn2id_cookie cx;
1090 LDAP_LOG ( INDEX, ARGS,
1091 "=> hdb_dn2ididl( \"%s\" )\n", e->e_nname.bv_val, 0, 0 );
1093 Debug( LDAP_DEBUG_TRACE, "=> hdb_dn2idl( \"%s\" )\n", e->e_nname.bv_val, 0, 0 );
1096 #ifndef BDB_MULTIPLE_SUFFIXES
1097 if ( op->ors_scope != LDAP_SCOPE_ONELEVEL &&
1098 BEI(e)->bei_parent->bei_id == 0 )
1100 BDB_IDL_ALL( bdb, ids );
1106 cx.ei = e->e_id ? BEI(e) : &bdb->bi_cache.c_dntree;
1108 cx.db = cx.bdb->bi_dn2id->bdi_db;
1109 cx.prefix = op->ors_scope == LDAP_SCOPE_ONELEVEL
1110 ? DN_ONE_PREFIX : DN_SUBTREE_PREFIX;
1115 BDB_IDL_ZERO( ids );
1116 if ( cx.prefix == DN_SUBTREE_PREFIX ) {
1117 bdb_idl_insert( ids, cx.id );
1121 cx.key.data = &cx.id;
1122 cx.key.ulen = sizeof(ID);
1123 cx.key.size = sizeof(ID);
1124 cx.key.flags = DB_DBT_USERMEM;
1128 return hdb_dn2idl_internal(&cx);
1130 #endif /* BDB_HIER */