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-2009 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 char buf[ SLAP_TEXT_BUFLEN ];
93 snprintf( buf, sizeof( buf ), "%s => bdb_dn2id_add dn=\"%s\" ID=0x%lx",
94 op->o_log_prefix, e->e_name.bv_val, e->e_id );
95 Debug( LDAP_DEBUG_ANY, "%s: put failed: %s %d\n",
96 buf, db_strerror(rc), rc );
100 #ifndef BDB_MULTIPLE_SUFFIXES
101 if( !be_issuffix( op->o_bd, &ptr ))
104 buf[0] = DN_SUBTREE_PREFIX;
105 rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
107 Debug( LDAP_DEBUG_ANY,
108 "=> bdb_dn2id_add 0x%lx: subtree (%s) put failed: %d\n",
109 e->e_id, ptr.bv_val, rc );
113 #ifdef BDB_MULTIPLE_SUFFIXES
114 if( !be_issuffix( op->o_bd, &ptr ))
117 dnParent( &ptr, &pdn );
119 key.size = pdn.bv_len + 2;
121 pdn.bv_val[-1] = DN_ONE_PREFIX;
122 key.data = pdn.bv_val-1;
125 rc = bdb_idl_insert_key( op->o_bd, db, txn, &key, e->e_id );
128 Debug( LDAP_DEBUG_ANY,
129 "=> bdb_dn2id_add 0x%lx: parent (%s) insert failed: %d\n",
130 e->e_id, ptr.bv_val, rc );
135 #ifndef BDB_MULTIPLE_SUFFIXES
136 while( !be_issuffix( op->o_bd, &ptr ))
141 ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
143 rc = bdb_idl_insert_key( op->o_bd, db, txn, &key, e->e_id );
146 Debug( LDAP_DEBUG_ANY,
147 "=> bdb_dn2id_add 0x%lx: subtree (%s) insert failed: %d\n",
148 e->e_id, ptr.bv_val, rc );
151 #ifdef BDB_MULTIPLE_SUFFIXES
152 if( be_issuffix( op->o_bd, &ptr )) break;
154 dnParent( &ptr, &pdn );
156 key.size = pdn.bv_len + 2;
158 key.data = pdn.bv_val - 1;
164 op->o_tmpfree( buf, op->o_tmpmemctx );
165 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_add 0x%lx: %d\n", e->e_id, rc, 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 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_delete 0x%lx: \"%s\"\n",
185 e->e_id, e->e_ndn, 0 );
188 key.size = e->e_nname.bv_len + 2;
189 buf = op->o_tmpalloc( key.size, op->o_tmpmemctx );
191 key.flags = DB_DBT_USERMEM;
192 buf[0] = DN_BASE_PREFIX;
194 ptr.bv_len = e->e_nname.bv_len;
195 AC_MEMCPY( ptr.bv_val, e->e_nname.bv_val, e->e_nname.bv_len );
196 ptr.bv_val[ptr.bv_len] = '\0';
198 /* We hold this lock until the TXN completes */
199 rc = bdb_dn2id_lock( bdb, &e->e_nname, 1, txn, &lock );
203 rc = db->del( db, txn, &key, 0 );
205 Debug( LDAP_DEBUG_ANY, "=> bdb_dn2id_delete 0x%lx: delete failed: %s %d\n",
206 e->e_id, db_strerror(rc), rc );
210 #ifndef BDB_MULTIPLE_SUFFIXES
211 if( !be_issuffix( op->o_bd, &ptr ))
214 buf[0] = DN_SUBTREE_PREFIX;
215 rc = bdb_idl_delete_key( op->o_bd, db, txn, &key, e->e_id );
217 Debug( LDAP_DEBUG_ANY,
218 "=> bdb_dn2id_delete 0x%lx: subtree (%s) delete failed: %d\n",
219 e->e_id, ptr.bv_val, rc );
223 #ifdef BDB_MULTIPLE_SUFFIXES
224 if( !be_issuffix( op->o_bd, &ptr ))
227 dnParent( &ptr, &pdn );
229 key.size = pdn.bv_len + 2;
231 pdn.bv_val[-1] = DN_ONE_PREFIX;
232 key.data = pdn.bv_val - 1;
235 rc = bdb_idl_delete_key( op->o_bd, db, txn, &key, e->e_id );
238 Debug( LDAP_DEBUG_ANY,
239 "=> bdb_dn2id_delete 0x%lx: parent (%s) delete failed: %d\n",
240 e->e_id, ptr.bv_val, rc );
245 #ifndef BDB_MULTIPLE_SUFFIXES
246 while( !be_issuffix( op->o_bd, &ptr ))
251 ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
253 rc = bdb_idl_delete_key( op->o_bd, db, txn, &key, e->e_id );
255 Debug( LDAP_DEBUG_ANY,
256 "=> bdb_dn2id_delete 0x%lx: subtree (%s) delete failed: %d\n",
257 e->e_id, ptr.bv_val, rc );
260 #ifdef BDB_MULTIPLE_SUFFIXES
261 if( be_issuffix( op->o_bd, &ptr )) break;
263 dnParent( &ptr, &pdn );
265 key.size = pdn.bv_len + 2;
267 key.data = pdn.bv_val - 1;
273 op->o_tmpfree( buf, op->o_tmpmemctx );
274 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_delete 0x%lx: %d\n", e->e_id, rc, 0 );
286 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
287 DB *db = bdb->bi_dn2id->bdi_db;
293 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id(\"%s\")\n", dn->bv_val, 0, 0 );
296 key.size = dn->bv_len + 2;
297 key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
298 ((char *)key.data)[0] = DN_BASE_PREFIX;
299 AC_MEMCPY( &((char *)key.data)[1], dn->bv_val, key.size - 1 );
304 data.ulen = sizeof(ID);
305 data.flags = DB_DBT_USERMEM;
307 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
308 if ( rc ) goto func_leave;
310 rc = bdb_dn2id_lock( bdb, dn, 0, txn, lock );
311 if ( rc ) goto nolock;
314 rc = cursor->c_get( cursor, &key, &data, DB_SET );
317 cursor->c_close( cursor );
321 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: get failed: %s (%d)\n",
322 db_strerror( rc ), rc, 0 );
324 BDB_DISK2ID( &nid, &ei->bei_id );
325 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: got id=0x%lx\n",
328 op->o_tmpfree( key.data, op->o_tmpmemctx );
339 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
340 DB *db = bdb->bi_dn2id->bdi_db;
344 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_children(\"%s\")\n",
345 e->e_nname.bv_val, 0, 0 );
347 key.size = e->e_nname.bv_len + 2;
348 key.data = op->o_tmpalloc( key.size, op->o_tmpmemctx );
349 ((char *)key.data)[0] = DN_ONE_PREFIX;
350 AC_MEMCPY( &((char *)key.data)[1], e->e_nname.bv_val, key.size - 1 );
352 if ( bdb->bi_idl_cache_size ) {
353 rc = bdb_idl_cache_get( bdb, db, &key, NULL );
354 if ( rc != LDAP_NO_SUCH_OBJECT ) {
355 op->o_tmpfree( key.data, op->o_tmpmemctx );
359 /* we actually could do a empty get... */
362 data.ulen = sizeof(id);
363 data.flags = DB_DBT_USERMEM;
365 data.dlen = sizeof(id);
367 rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
368 op->o_tmpfree( key.data, op->o_tmpmemctx );
370 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_children(\"%s\"): %s (%d)\n",
372 rc == 0 ? "" : ( rc == DB_NOTFOUND ? "no " :
373 db_strerror(rc) ), rc );
389 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
390 DB *db = bdb->bi_dn2id->bdi_db;
391 int prefix = ( op->ors_scope == LDAP_SCOPE_ONELEVEL )
392 ? DN_ONE_PREFIX : DN_SUBTREE_PREFIX;
394 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2idl(\"%s\")\n",
397 #ifndef BDB_MULTIPLE_SUFFIXES
398 if ( prefix == DN_SUBTREE_PREFIX
399 && ( ei->bei_id == 0 ||
400 ( ei->bei_parent->bei_id == 0 && op->o_bd->be_suffix[0].bv_len ))) {
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, txn, &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 if ( eip->bei_parent ) {
621 *ptr = DN_SUBTREE_PREFIX;
622 for (; eip && eip->bei_parent->bei_id; eip = eip->bei_parent) {
623 tmp[1] = eip->bei_id;
624 bdb_idl_cache_add_id( bdb, db, &key, e->e_id );
626 /* Handle DB with empty suffix */
627 if ( !op->o_bd->be_suffix[0].bv_len && eip ) {
628 tmp[1] = eip->bei_id;
629 bdb_idl_cache_add_id( bdb, db, &key, e->e_id );
634 op->o_tmpfree( d, op->o_tmpmemctx );
635 Debug( LDAP_DEBUG_TRACE, "<= hdb_dn2id_add 0x%lx: %d\n", e->e_id, rc, 0 );
647 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
648 DB *db = bdb->bi_dn2id->bdi_db;
654 unsigned char dlen[2];
657 Debug( LDAP_DEBUG_TRACE, "=> hdb_dn2id_delete 0x%lx: \"%s\"\n",
658 e->e_id, e->e_ndn, 0 );
661 key.size = sizeof(ID);
663 key.flags = DB_DBT_USERMEM;
664 BDB_ID2DISK( eip->bei_id, &nid );
667 data.size = sizeof(diskNode) + BEI(e)->bei_nrdn.bv_len - sizeof(ID) - 1;
668 data.ulen = data.size;
669 data.dlen = data.size;
670 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
674 d = op->o_tmpalloc( data.size, op->o_tmpmemctx );
675 d->nrdnlen[1] = BEI(e)->bei_nrdn.bv_len & 0xff;
676 d->nrdnlen[0] = (BEI(e)->bei_nrdn.bv_len >> 8) | 0x80;
677 dlen[0] = d->nrdnlen[0];
678 dlen[1] = d->nrdnlen[1];
679 strcpy( d->nrdn, BEI(e)->bei_nrdn.bv_val );
682 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
683 if ( rc ) goto func_leave;
685 /* We hold this lock until the TXN completes */
686 rc = bdb_dn2id_lock( bdb, &e->e_nname, 1, txn, &lock );
687 if ( rc ) goto nolock;
689 /* Delete our ID from the parent's list */
690 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH_RANGE );
692 if ( dlen[1] == d->nrdnlen[1] && dlen[0] == d->nrdnlen[0] &&
693 !strcmp( d->nrdn, BEI(e)->bei_nrdn.bv_val ))
694 rc = cursor->c_del( cursor, 0 );
699 /* Delete our ID from the tree. With sorted duplicates, this
700 * will leave any child nodes still hanging around. This is OK
701 * for modrdn, which will add our info back in later.
704 BDB_ID2DISK( e->e_id, &nid );
705 rc = cursor->c_get( cursor, &key, &data, DB_SET );
707 rc = cursor->c_del( cursor, 0 );
711 cursor->c_close( cursor );
713 op->o_tmpfree( d, op->o_tmpmemctx );
715 /* Delete IDL cache entries */
716 if ( rc == 0 && bdb->bi_idl_cache_size ) {
718 char *ptr = ((char *)&tmp[1])-1;
720 key.size = sizeof(ID)+1;
721 tmp[1] = eip->bei_id;
722 *ptr = DN_ONE_PREFIX;
723 bdb_idl_cache_del_id( bdb, db, &key, e->e_id );
724 if ( eip ->bei_parent ) {
725 *ptr = DN_SUBTREE_PREFIX;
726 for (; eip && eip->bei_parent->bei_id; eip = eip->bei_parent) {
727 tmp[1] = eip->bei_id;
728 bdb_idl_cache_del_id( bdb, db, &key, e->e_id );
730 /* Handle DB with empty suffix */
731 if ( !op->o_bd->be_suffix[0].bv_len && eip ) {
732 tmp[1] = eip->bei_id;
733 bdb_idl_cache_del_id( bdb, db, &key, e->e_id );
737 Debug( LDAP_DEBUG_TRACE, "<= hdb_dn2id_delete 0x%lx: %d\n", e->e_id, rc, 0 );
750 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
751 DB *db = bdb->bi_dn2id->bdi_db;
757 unsigned char dlen[2];
760 Debug( LDAP_DEBUG_TRACE, "=> hdb_dn2id(\"%s\")\n", in->bv_val, 0, 0 );
762 nrlen = dn_rdnlen( op->o_bd, in );
763 if (!nrlen) nrlen = in->bv_len;
766 key.size = sizeof(ID);
768 key.ulen = sizeof(ID);
769 key.flags = DB_DBT_USERMEM;
770 parentID = ( ei->bei_parent != NULL ) ? ei->bei_parent->bei_id : 0;
771 BDB_ID2DISK( parentID, &idp );
774 data.size = sizeof(diskNode) + nrlen - sizeof(ID) - 1;
775 data.ulen = data.size * 3;
776 data.dlen = data.ulen;
777 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
779 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
782 d = op->o_tmpalloc( data.size * 3, op->o_tmpmemctx );
783 d->nrdnlen[1] = nrlen & 0xff;
784 d->nrdnlen[0] = (nrlen >> 8) | 0x80;
785 dlen[0] = d->nrdnlen[0];
786 dlen[1] = d->nrdnlen[1];
787 ptr = lutil_strncopy( d->nrdn, in->bv_val, nrlen );
791 rc = bdb_dn2id_lock( bdb, in, 0, txn, lock );
792 if ( rc ) goto func_leave;
794 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH_RANGE );
795 if ( rc == 0 && (dlen[1] != d->nrdnlen[1] || dlen[0] != d->nrdnlen[0] ||
796 strncmp( d->nrdn, in->bv_val, nrlen ))) {
800 ptr = (char *) data.data + data.size - sizeof(ID);
801 BDB_DISK2ID( ptr, &ei->bei_id );
802 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) - nrlen;
803 ptr = d->nrdn + nrlen + 1;
804 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
805 if ( ei->bei_parent != NULL && !ei->bei_parent->bei_dkids ) {
807 /* How many children does the parent have? */
808 /* FIXME: do we need to lock the parent
809 * entryinfo? Seems safe...
811 cursor->c_count( cursor, &dkids, 0 );
812 ei->bei_parent->bei_dkids = dkids;
817 cursor->c_close( cursor );
818 op->o_tmpfree( d, op->o_tmpmemctx );
820 Debug( LDAP_DEBUG_TRACE, "<= hdb_dn2id: get failed: %s (%d)\n",
821 db_strerror( rc ), rc, 0 );
823 Debug( LDAP_DEBUG_TRACE, "<= hdb_dn2id: got id=0x%lx\n",
837 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
838 DB *db = bdb->bi_dn2id->bdi_db;
847 key.size = sizeof(ID);
849 key.ulen = sizeof(ID);
850 key.flags = DB_DBT_USERMEM;
851 BDB_ID2DISK( ei->bei_id, &nid );
854 data.flags = DB_DBT_USERMEM;
856 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
859 data.ulen = sizeof(diskNode) + (SLAP_LDAPDN_MAXLEN * 2);
860 d = op->o_tmpalloc( data.ulen, op->o_tmpmemctx );
863 rc = cursor->c_get( cursor, &key, &data, DB_SET );
865 if (d->nrdnlen[0] & 0x80) {
869 ptr = (char *) data.data + data.size - sizeof(ID);
870 BDB_DISK2ID( ptr, idp );
871 ei->bei_nrdn.bv_len = (d->nrdnlen[0] << 8) | d->nrdnlen[1];
872 ber_str2bv( d->nrdn, ei->bei_nrdn.bv_len, 1, &ei->bei_nrdn );
873 ei->bei_rdn.bv_len = data.size - sizeof(diskNode) -
875 ptr = d->nrdn + ei->bei_nrdn.bv_len + 1;
876 ber_str2bv( ptr, ei->bei_rdn.bv_len, 1, &ei->bei_rdn );
877 /* How many children does this node have? */
878 cursor->c_count( cursor, &dkids, 0 );
879 ei->bei_dkids = dkids;
882 cursor->c_close( cursor );
883 op->o_tmpfree( d, op->o_tmpmemctx );
893 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
894 DB *db = bdb->bi_dn2id->bdi_db;
902 key.size = sizeof(ID);
904 key.flags = DB_DBT_USERMEM;
905 BDB_ID2DISK( e->e_id, &id );
907 /* IDL cache is in host byte order */
908 if ( bdb->bi_idl_cache_size ) {
909 rc = bdb_idl_cache_get( bdb, db, &key, NULL );
910 if ( rc != LDAP_NO_SUCH_OBJECT ) {
918 data.ulen = sizeof(d);
919 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
920 data.dlen = sizeof(d);
922 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
925 rc = cursor->c_get( cursor, &key, &data, DB_SET );
928 rc = cursor->c_count( cursor, &dkids, 0 );
930 BEI(e)->bei_dkids = dkids;
931 if ( dkids < 2 ) rc = DB_NOTFOUND;
934 cursor->c_close( cursor );
939 * We can't just use bdb_idl_fetch_key because
940 * 1 - our data items are longer than just an entry ID
941 * 2 - our data items are sorted alphabetically by nrdn, not by ID.
943 * We descend the tree recursively, so we define this cookie
944 * to hold our necessary state information. The bdb_dn2idl_internal
945 * function uses this cookie when calling itself.
948 struct dn2id_cookie {
949 struct bdb_info *bdb;
974 EntryInfo *ei = data;
977 bdb_idl_append_one( idl, ei->bei_id );
983 struct dn2id_cookie *cx
986 BDB_IDL_ZERO( cx->tmp );
988 if ( cx->bdb->bi_idl_cache_size ) {
989 char *ptr = ((char *)&cx->id)-1;
992 cx->key.size = sizeof(ID)+1;
993 if ( cx->prefix == DN_SUBTREE_PREFIX ) {
994 ID *ids = cx->depth ? cx->tmp : cx->ids;
996 cx->rc = bdb_idl_cache_get(cx->bdb, cx->db, &cx->key, ids);
997 if ( cx->rc == LDAP_SUCCESS ) {
999 bdb_idl_append( cx->ids, cx->tmp );
1005 *ptr = DN_ONE_PREFIX;
1006 cx->rc = bdb_idl_cache_get(cx->bdb, cx->db, &cx->key, cx->tmp);
1007 if ( cx->rc == LDAP_SUCCESS ) {
1010 if ( cx->rc == DB_NOTFOUND ) {
1015 bdb_cache_entryinfo_lock( cx->ei );
1017 /* If number of kids in the cache differs from on-disk, load
1018 * up all the kids from the database
1020 if ( cx->ei->bei_ckids+1 != cx->ei->bei_dkids ) {
1022 db_recno_t dkids = cx->ei->bei_dkids;
1023 ei.bei_parent = cx->ei;
1025 /* Only one thread should load the cache */
1026 while ( cx->ei->bei_state & CACHE_ENTRY_ONELEVEL ) {
1027 bdb_cache_entryinfo_unlock( cx->ei );
1028 ldap_pvt_thread_yield();
1029 bdb_cache_entryinfo_lock( cx->ei );
1030 if ( cx->ei->bei_ckids+1 == cx->ei->bei_dkids ) {
1035 cx->ei->bei_state |= CACHE_ENTRY_ONELEVEL;
1037 bdb_cache_entryinfo_unlock( cx->ei );
1039 cx->rc = cx->db->cursor( cx->db, NULL, &cx->dbc,
1040 cx->bdb->bi_db_opflags );
1044 cx->data.data = &cx->dbuf;
1045 cx->data.ulen = sizeof(ID);
1046 cx->data.dlen = sizeof(ID);
1047 cx->data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
1049 /* The first item holds the parent ID. Ignore it. */
1050 cx->key.data = &cx->nid;
1051 cx->key.size = sizeof(ID);
1052 cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data, DB_SET );
1054 cx->dbc->c_close( cx->dbc );
1058 /* If the on-disk count is zero we've never checked it.
1062 cx->dbc->c_count( cx->dbc, &dkids, 0 );
1063 cx->ei->bei_dkids = dkids;
1066 cx->data.data = cx->buf;
1067 cx->data.ulen = BDB_IDL_UM_SIZE * sizeof(ID);
1068 cx->data.flags = DB_DBT_USERMEM;
1071 /* Fetch the rest of the IDs in a loop... */
1072 while ( (cx->rc = cx->dbc->c_get( cx->dbc, &cx->key, &cx->data,
1073 DB_MULTIPLE | DB_NEXT_DUP )) == 0 ) {
1077 DB_MULTIPLE_INIT( ptr, &cx->data );
1079 DB_MULTIPLE_NEXT( ptr, &cx->data, j, len );
1082 diskNode *d = (diskNode *)j;
1085 BDB_DISK2ID( j + len - sizeof(ID), &ei.bei_id );
1086 nrlen = ((d->nrdnlen[0] ^ 0x80) << 8) | d->nrdnlen[1];
1087 ei.bei_nrdn.bv_len = nrlen;
1088 /* nrdn/rdn are set in-place.
1089 * hdb_cache_load will copy them as needed
1091 ei.bei_nrdn.bv_val = d->nrdn;
1092 ei.bei_rdn.bv_len = len - sizeof(diskNode)
1093 - ei.bei_nrdn.bv_len;
1094 ei.bei_rdn.bv_val = d->nrdn + ei.bei_nrdn.bv_len + 1;
1095 bdb_idl_append_one( cx->tmp, ei.bei_id );
1096 hdb_cache_load( cx->bdb, &ei, &ei2 );
1102 cx->rc = cx->dbc->c_close( cx->dbc );
1104 bdb_cache_entryinfo_lock( cx->ei );
1105 cx->ei->bei_state ^= CACHE_ENTRY_ONELEVEL;
1106 bdb_cache_entryinfo_unlock( cx->ei );
1111 /* The in-memory cache is in sync with the on-disk data.
1112 * do we have any kids?
1116 if ( cx->ei->bei_ckids > 0 ) {
1117 /* Walk the kids tree; order is irrelevant since bdb_idl_sort
1118 * will sort it later.
1120 avl_apply( cx->ei->bei_kids, apply_func,
1121 cx->tmp, -1, AVL_POSTORDER );
1123 bdb_cache_entryinfo_unlock( cx->ei );
1126 if ( !BDB_IDL_IS_RANGE( cx->tmp ) && cx->tmp[0] > 3 )
1127 bdb_idl_sort( cx->tmp, cx->buf );
1128 if ( cx->bdb->bi_idl_cache_max_size && !BDB_IDL_IS_ZERO( cx->tmp )) {
1129 char *ptr = ((char *)&cx->id)-1;
1131 cx->key.size = sizeof(ID)+1;
1132 *ptr = DN_ONE_PREFIX;
1133 bdb_idl_cache_put( cx->bdb, cx->db, &cx->key, cx->tmp, cx->rc );
1137 if ( !BDB_IDL_IS_ZERO( cx->tmp )) {
1138 if ( cx->prefix == DN_SUBTREE_PREFIX ) {
1139 bdb_idl_append( cx->ids, cx->tmp );
1141 if ( !(cx->ei->bei_state & CACHE_ENTRY_NO_GRANDKIDS)) {
1143 EntryInfo *ei = cx->ei;
1145 save = cx->op->o_tmpalloc( BDB_IDL_SIZEOF( cx->tmp ),
1146 cx->op->o_tmpmemctx );
1147 BDB_IDL_CPY( save, cx->tmp );
1151 for ( cx->id = bdb_idl_first( save, &idcurs );
1153 cx->id = bdb_idl_next( save, &idcurs )) {
1154 cx->ei = bdb_cache_find_info( cx->bdb, cx->id );
1156 ( cx->ei->bei_state & CACHE_ENTRY_NO_KIDS ))
1159 BDB_ID2DISK( cx->id, &cx->nid );
1160 hdb_dn2idl_internal( cx );
1161 if ( !BDB_IDL_IS_ZERO( cx->tmp ))
1165 cx->op->o_tmpfree( save, cx->op->o_tmpmemctx );
1167 bdb_cache_entryinfo_lock( ei );
1168 ei->bei_state |= CACHE_ENTRY_NO_GRANDKIDS;
1169 bdb_cache_entryinfo_unlock( ei );
1172 /* Make sure caller knows it had kids! */
1177 BDB_IDL_CPY( cx->ids, cx->tmp );
1192 struct bdb_info *bdb = (struct bdb_info *)op->o_bd->be_private;
1193 struct dn2id_cookie cx;
1195 Debug( LDAP_DEBUG_TRACE, "=> hdb_dn2idl(\"%s\")\n",
1196 ndn->bv_val, 0, 0 );
1198 #ifndef BDB_MULTIPLE_SUFFIXES
1199 if ( op->ors_scope != LDAP_SCOPE_ONELEVEL &&
1200 ( ei->bei_id == 0 ||
1201 ( ei->bei_parent->bei_id == 0 && op->o_bd->be_suffix[0].bv_len )))
1203 BDB_IDL_ALL( bdb, ids );
1209 BDB_ID2DISK( cx.id, &cx.nid );
1212 cx.db = cx.bdb->bi_dn2id->bdi_db;
1213 cx.prefix = (op->ors_scope == LDAP_SCOPE_ONELEVEL) ?
1214 DN_ONE_PREFIX : DN_SUBTREE_PREFIX;
1217 cx.buf = stack + BDB_IDL_UM_SIZE;
1223 if ( cx.prefix == DN_SUBTREE_PREFIX ) {
1227 BDB_IDL_ZERO( ids );
1229 if ( cx.ei->bei_state & CACHE_ENTRY_NO_KIDS )
1230 return LDAP_SUCCESS;
1233 cx.key.ulen = sizeof(ID);
1234 cx.key.size = sizeof(ID);
1235 cx.key.flags = DB_DBT_USERMEM;
1239 hdb_dn2idl_internal(&cx);
1240 if ( cx.need_sort ) {
1241 char *ptr = ((char *)&cx.id)-1;
1242 if ( !BDB_IDL_IS_RANGE( cx.ids ) && cx.ids[0] > 3 )
1243 bdb_idl_sort( cx.ids, cx.tmp );
1245 cx.key.size = sizeof(ID)+1;
1248 if ( cx.bdb->bi_idl_cache_max_size )
1249 bdb_idl_cache_put( cx.bdb, cx.db, &cx.key, cx.ids, cx.rc );
1252 if ( cx.rc == DB_NOTFOUND )
1253 cx.rc = LDAP_SUCCESS;
1257 #endif /* BDB_HIER */