1 /* dn2id.c - routines to deal with the dn2id index */
4 * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
11 #include <ac/string.h>
26 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
27 DB *db = bdb->bi_dn2id->bdi_db;
31 struct berval ptr, pdn;
34 LDAP_LOG ( INDEX, ARGS, "bdb_dn2id_add( \"%s\", 0x%08lx )\n",
35 e->e_ndn, (long) e->e_id, 0 );
37 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_add( \"%s\", 0x%08lx )\n",
38 e->e_ndn, (long) e->e_id, 0 );
40 assert( e->e_id != NOID );
43 key.size = e->e_nname.bv_len + 2;
45 key.flags = DB_DBT_USERMEM;
46 buf = sl_malloc( key.size, ctx );
48 buf[0] = DN_BASE_PREFIX;
50 ptr.bv_len = e->e_nname.bv_len;
51 AC_MEMCPY( ptr.bv_val, e->e_nname.bv_val, e->e_nname.bv_len );
52 ptr.bv_val[ptr.bv_len] = '\0';
55 data.data = (char *) &e->e_id;
56 data.size = sizeof( e->e_id );
58 /* store it -- don't override */
59 rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
62 LDAP_LOG ( INDEX, ERR, "bdb_dn2id_add: put failed: %s %d\n",
63 db_strerror(rc), rc, 0 );
65 Debug( LDAP_DEBUG_ANY, "=> bdb_dn2id_add: put failed: %s %d\n",
66 db_strerror(rc), rc, 0 );
71 #ifndef BDB_MULTIPLE_SUFFIXES
72 if( !be_issuffix( be, &ptr )) {
74 buf[0] = DN_SUBTREE_PREFIX;
75 rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
78 LDAP_LOG ( INDEX, ERR,
79 "=> bdb_dn2id_add: subtree (%s) put failed: %d\n",
82 Debug( LDAP_DEBUG_ANY,
83 "=> bdb_dn2id_add: subtree (%s) put failed: %d\n",
89 #ifdef BDB_MULTIPLE_SUFFIXES
90 if( !be_issuffix( be, &ptr )) {
92 dnParent( &ptr, &pdn );
94 key.size = pdn.bv_len + 2;
96 pdn.bv_val[-1] = DN_ONE_PREFIX;
97 key.data = pdn.bv_val-1;
100 rc = bdb_idl_insert_key( be, db, txn, &key, e->e_id );
104 LDAP_LOG ( INDEX, ERR,
105 "=> bdb_dn2id_add: parent (%s) insert failed: %d\n",
108 Debug( LDAP_DEBUG_ANY,
109 "=> bdb_dn2id_add: parent (%s) insert failed: %d\n",
114 #ifndef BDB_MULTIPLE_SUFFIXES
117 while( !be_issuffix( be, &ptr )) {
121 ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
123 rc = bdb_idl_insert_key( be, db, txn, &key, e->e_id );
127 LDAP_LOG ( INDEX, ERR,
128 "=> bdb_dn2id_add: subtree (%s) insert failed: %d\n",
131 Debug( LDAP_DEBUG_ANY,
132 "=> bdb_dn2id_add: subtree (%s) insert failed: %d\n",
137 #ifdef BDB_MULTIPLE_SUFFIXES
138 if( be_issuffix( be, &ptr )) break;
140 dnParent( &ptr, &pdn );
142 key.size = pdn.bv_len + 2;
144 key.data = pdn.bv_val - 1;
147 #ifdef BDB_MULTIPLE_SUFFIXES
154 LDAP_LOG ( INDEX, RESULTS, "<= bdb_dn2id_add: %d\n", rc, 0, 0 );
156 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_add: %d\n", rc, 0, 0 );
169 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
170 DB *db = bdb->bi_dn2id->bdi_db;
174 struct berval pdn, ptr;
177 LDAP_LOG ( INDEX, ARGS,
178 "=> bdb_dn2id_delete ( \"%s\", 0x%08lx )\n", e->e_ndn, e->e_id, 0);
180 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_delete( \"%s\", 0x%08lx )\n",
181 e->e_ndn, e->e_id, 0 );
185 key.size = e->e_nname.bv_len + 2;
186 buf = sl_malloc( key.size, ctx );
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';
196 rc = db->del( db, txn, &key, 0 );
199 LDAP_LOG ( INDEX, ERR,
200 "=> bdb_dn2id_delete: delete failed: %s %d\n",
201 db_strerror(rc), rc, 0 );
203 Debug( LDAP_DEBUG_ANY, "=> bdb_dn2id_delete: delete failed: %s %d\n",
204 db_strerror(rc), rc, 0 );
209 #ifndef BDB_MULTIPLE_SUFFIXES
210 if( !be_issuffix( be, &ptr )) {
212 buf[0] = DN_SUBTREE_PREFIX;
213 rc = db->del( db, txn, &key, 0 );
216 LDAP_LOG ( INDEX, ERR,
217 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
220 Debug( LDAP_DEBUG_ANY,
221 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
227 #ifdef BDB_MULTIPLE_SUFFIXES
228 if( !be_issuffix( be, &ptr )) {
230 dnParent( &ptr, &pdn );
232 key.size = pdn.bv_len + 2;
234 pdn.bv_val[-1] = DN_ONE_PREFIX;
235 key.data = pdn.bv_val - 1;
238 rc = bdb_idl_delete_key( be, db, txn, &key, e->e_id );
242 LDAP_LOG ( INDEX, ERR,
243 "=> bdb_dn2id_delete: parent (%s) delete failed: %d\n",
246 Debug( LDAP_DEBUG_ANY,
247 "=> bdb_dn2id_delete: parent (%s) delete failed: %d\n",
252 #ifndef BDB_MULTIPLE_SUFFIXES
255 while( !be_issuffix( be, &ptr )) {
259 ptr.bv_val[-1] = DN_SUBTREE_PREFIX;
261 rc = bdb_idl_delete_key( be, db, txn, &key, e->e_id );
264 LDAP_LOG ( INDEX, ERR,
265 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
268 Debug( LDAP_DEBUG_ANY,
269 "=> bdb_dn2id_delete: subtree (%s) delete failed: %d\n",
274 #ifdef BDB_MULTIPLE_SUFFIXES
275 if( be_issuffix( be, &ptr )) break;
277 dnParent( &ptr, &pdn );
279 key.size = pdn.bv_len + 2;
281 key.data = pdn.bv_val - 1;
284 #ifdef BDB_MULTIPLE_SUFFIXES
291 LDAP_LOG ( INDEX, RESULTS, "<= bdb_dn2id_delete %d\n", rc, 0, 0 );
293 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_delete %d\n", rc, 0, 0 );
308 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
309 DB *db = bdb->bi_dn2id->bdi_db;
312 LDAP_LOG ( INDEX, ARGS, "=> bdb_dn2id( \"%s\" )\n", dn->bv_val, 0, 0 );
314 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id( \"%s\" )\n", dn->bv_val, 0, 0 );
318 key.size = dn->bv_len + 2;
319 key.data = sl_malloc( key.size, ctx );
320 ((char *)key.data)[0] = DN_BASE_PREFIX;
321 AC_MEMCPY( &((char *)key.data)[1], dn->bv_val, key.size - 1 );
325 data.data = &ei->bei_id;
326 data.ulen = sizeof(ID);
327 data.flags = DB_DBT_USERMEM;
330 rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
334 LDAP_LOG ( INDEX, ERR, "<= bdb_dn2id: get failed %s (%d)\n",
335 db_strerror(rc), rc, 0 );
337 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: get failed: %s (%d)\n",
338 db_strerror( rc ), rc, 0 );
342 LDAP_LOG ( INDEX, RESULTS,
343 "<= bdb_dn2id: got id=0x%08lx\n", ei->bei_id, 0, 0 );
345 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id: got id=0x%08lx\n",
350 sl_free( key.data, ctx );
361 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
362 DB *db = bdb->bi_dn2id->bdi_db;
367 LDAP_LOG ( INDEX, ARGS,
368 "=> bdb_dn2id_children( %s )\n", e->e_nname.bv_val, 0, 0 );
370 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2id_children( %s )\n",
371 e->e_nname.bv_val, 0, 0 );
374 key.size = e->e_nname.bv_len + 2;
375 key.data = sl_malloc( key.size, op->o_tmpmemctx );
376 ((char *)key.data)[0] = DN_ONE_PREFIX;
377 AC_MEMCPY( &((char *)key.data)[1], e->e_nname.bv_val, key.size - 1 );
379 #ifdef SLAP_IDL_CACHE
380 if ( bdb->bi_idl_cache_size ) {
381 rc = bdb_idl_cache_get( bdb, db, &key, NULL );
382 if ( rc != LDAP_NO_SUCH_OBJECT ) {
383 sl_free( key.data, op->o_tmpmemctx );
388 /* we actually could do a empty get... */
391 data.ulen = sizeof(id);
392 data.flags = DB_DBT_USERMEM;
394 data.dlen = sizeof(id);
396 rc = db->get( db, txn, &key, &data, bdb->bi_db_opflags );
397 sl_free( key.data, op->o_tmpmemctx );
400 LDAP_LOG ( INDEX, DETAIL1,
401 "<= bdb_dn2id_children( %s ): %s (%d)\n",
402 e->e_nname.bv_val, rc == 0 ? "" : ( rc == DB_NOTFOUND ? "no " :
403 db_strerror(rc)), rc );
405 Debug( LDAP_DEBUG_TRACE, "<= bdb_dn2id_children( %s ): %s (%d)\n",
407 rc == 0 ? "" : ( rc == DB_NOTFOUND ? "no " :
408 db_strerror(rc) ), rc );
423 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
424 DB *db = bdb->bi_dn2id->bdi_db;
427 LDAP_LOG ( INDEX, ARGS,
428 "=> bdb_dn2ididl( \"%s\" )\n", dn->bv_val, 0, 0 );
430 Debug( LDAP_DEBUG_TRACE, "=> bdb_dn2idl( \"%s\" )\n", dn->bv_val, 0, 0 );
433 #ifndef BDB_MULTIPLE_SUFFIXES
434 if (prefix == DN_SUBTREE_PREFIX && be_issuffix(be, dn))
436 BDB_IDL_ALL(bdb, ids);
442 key.size = dn->bv_len + 2;
444 key.flags = DB_DBT_USERMEM;
445 key.data = ch_malloc( key.size );
446 ((char *)key.data)[0] = prefix;
447 AC_MEMCPY( &((char *)key.data)[1], dn->bv_val, key.size - 1 );
449 rc = bdb_idl_fetch_key( be, db, NULL, &key, ids );
453 LDAP_LOG ( INDEX, ERR,
454 "<= bdb_dn2ididl: get failed: %s (%d)\n", db_strerror(rc), rc, 0 );
456 Debug( LDAP_DEBUG_TRACE,
457 "<= bdb_dn2idl: get failed: %s (%d)\n",
458 db_strerror( rc ), rc, 0 );
463 LDAP_LOG ( INDEX, RESULTS,
464 "<= bdb_dn2ididl: id=%ld first=%ld last=%ld\n",
465 (long) ids[0], (long) BDB_IDL_FIRST( ids ),
466 (long) BDB_IDL_LAST( ids ) );
468 Debug( LDAP_DEBUG_TRACE,
469 "<= bdb_dn2idl: id=%ld first=%ld last=%ld\n",
471 (long) BDB_IDL_FIRST( ids ), (long) BDB_IDL_LAST( ids ) );
480 /* Experimental management routines for a hierarchically structured database.
482 * Unsupported! Use at your own risk!
484 * Instead of a ldbm-style dn2id database, we use a hierarchical one. Each
485 * entry in this database is a struct diskNode, keyed by entryID and with
486 * the data containing the RDN and entryID of the node's children. We use
487 * a B-Tree with sorted duplicates to store all the children of a node under
488 * the same key. Also, the first item under the key contains an empty rdn
489 * and the ID of the node's parent, to allow bottom-up tree traversal as
492 * The diskNode is a variable length structure. This definition is not
493 * directly usable for in-memory manipulation.
495 typedef struct diskNode {
502 /* Sort function for the sorted duplicate data items of a dn2id key.
503 * Sorts based on normalized RDN, in lexical order.
512 diskNode *usr = usrkey->data;
513 diskNode *cur = curkey->data;
515 char *ptr = (char *)&cur->nrdnlen;
518 curlen = ptr[0] << 8 | ptr[1];
520 rc = strncmp( usr->nrdn, cur->nrdn, usr->nrdnlen );
521 if ( rc == 0 ) rc = usrlen - curlen;
525 /* This function constructs a full DN for a given entry.
532 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
534 int rlen = 0, nrlen = 0;
537 for ( ei = BEI(e); ei; ei=ei->bei_parent ) {
538 rlen += ei->bei_rdn.bv_len + 1;
539 nrlen += ei->bei_nrdn.bv_len + 1;
541 e->e_name.bv_len = rlen - 1;
542 e->e_nname.bv_len = nrlen - 1;
543 e->e_name.bv_val = ch_malloc(rlen + nrlen);
544 e->e_nname.bv_val = e->e_name.bv_val + rlen;
545 ptr = e->e_name.bv_val;
546 nptr = e->e_nname.bv_val;
547 for ( ei = BEI(e); ei; ei=ei->bei_parent ) {
548 ptr = lutil_strcopy(ptr, ei->bei_rdn.bv_val);
549 nptr = lutil_strcopy(nptr, ei->bei_nrdn.bv_val);
550 if ( ei->bei_parent ) {
561 /* We add two elements to the DN2ID database - a data item under the parent's
562 * entryID containing the child's RDN and entryID, and an item under the
563 * child's entryID containing the parent's entryID.
573 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
574 DB *db = bdb->bi_dn2id->bdi_db;
580 nrlen = dn_rdnlen( be, &e->e_nname );
582 rlen = dn_rdnlen( be, &e->e_name );
587 d = sl_malloc(sizeof(diskNode) + rlen + nrlen, ctx);
588 d->entryID = e->e_id;
590 ptr = lutil_strncopy( d->nrdn, e->e_nname.bv_val, nrlen );
592 ptr = lutil_strncopy( ptr, e->e_name.bv_val, rlen );
597 key.data = &eip->bei_id;
598 key.size = sizeof(ID);
599 key.flags = DB_DBT_USERMEM;
601 #ifdef SLAP_IDL_CACHE
602 if ( bdb->bi_idl_cache_size ) {
603 bdb_idl_cache_del( bdb, db, &key );
607 data.size = sizeof(diskNode) + rlen + nrlen + 2;
608 data.flags = DB_DBT_USERMEM;
610 rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
614 d->entryID = eip->bei_id;
618 data.size = sizeof(diskNode);
620 rc = db->put( db, txn, &key, &data, DB_NOOVERWRITE );
636 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
637 DB *db = bdb->bi_dn2id->bdi_db;
644 key.size = sizeof(ID);
646 key.data = &eip->bei_id;
647 key.flags = DB_DBT_USERMEM;
650 data.size = sizeof(diskNode) + BEI(e)->nrdn.bv_len;
651 d = sl_malloc( data.size, ctx );
652 d->entryID = e->e_id;
653 d->nrdnlen = BEI(e)->nrdn.bv_len;
654 strcpy( d->nrdn, BEI(e)->nrdn.bv_val );
656 data.ulen = data.size;
657 data.dlen = data.size;
658 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
660 #ifdef SLAP_IDL_CACHE
661 if ( bdb->bi_idl_cache_size ) {
662 bdb_idl_cache_del( bdb, db, &key );
665 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
668 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH | DB_RMW );
670 rc = cursor->c_del( cursor, 0 );
671 cursor->c_close( cursor );
674 rc = db->del( db, txn, &key, 0);
688 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
689 DB *db = bdb->bi_dn2id->bdi_db;
695 nrlen = dn_rdnlen( be, &in );
698 key.size = sizeof(ID);
699 key.data = &eip->bei_id;
700 key.flags = DB_DBT_USERMEM;
703 data.size = sizeof(diskNode) + nrlen;
704 d = sl_malloc( data.size * 3, ctx );
706 ptr = lutil_strncopy( d->nrdn, BEI(e)->nrdn.bv_val, nrlen );
709 data.ulen = data.size * 3;
710 data.flags = DB_DBT_USERMEM;
712 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
715 rc = cursor->c_get( cursor, &key, &data, DB_GET_BOTH );
716 cursor->c_close( cursor );
719 AC_MEMCPY( &ei->bei_id, &d->entryID, sizeof(ID) );
720 ei->rdn.bv_len = data.size - sizeof(diskNode) - nrlen;
721 ptr = d->nrdn + nrlen + 1;
722 strcpy( ei->rdn.bv_val, ptr );
733 struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
734 DB *db = bdb->bi_dn2id->bdi_db;
742 key.size = sizeof(ID);
744 key.flags = DB_DBT_USERMEM;
746 #ifdef SLAP_IDL_CACHE
747 if ( bdb->bi_idl_cache_size ) {
748 rc = bdb_idl_cache_get( bdb, db, &key, NULL );
749 if ( rc != LDAP_NO_SUCH_OBJECT ) {
750 sl_free( key.data, o->o_tmpmemctx );
756 data.ulen = sizeof(d);
757 data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
758 data.dlen = sizeof(d);
760 rc = db->cursor( db, txn, &cursor, bdb->bi_db_opflags );
763 rc = cursor->c_get( cursor, &key, &data, DB_FIRST );
765 rc = cursor->c_get( cursor, &key, &data, DB_NEXT_DUP );
767 cursor->c_close( cursor );
778 struct bdb_info *bdb = (struct bdb_info *) be->be_private;
783 if (prefix == DN_SUBTREE_PREFIX && be_issuffix(be, dn)) {
784 BDB_IDL_ALL(bdb, ids);
788 rc = bdb_dn2id(be, NULL, dn, &id, 0);
791 ldap_pvt_thread_rdwr_rlock(&bdb->bi_tree_rdwr);
792 n = bdb_find_id_node(id, bdb->bi_tree);
793 ldap_pvt_thread_rdwr_runlock(&bdb->bi_tree_rdwr);
796 ldap_pvt_thread_rdwr_rlock(&n->i_kids_rdwr);
797 if (prefix == DN_ONE_PREFIX) {
798 rc = avl_apply(n->i_kids, insert_one, ids, -1, AVL_INORDER);
803 rc = avl_apply(n->i_kids, insert_sub, ids, -1, AVL_INORDER);
805 ldap_pvt_thread_rdwr_runlock(&n->i_kids_rdwr);
808 #endif /* BDB_HIER */