1 /* idl.c - ldap id list handling routines */
4 * Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
12 #include <ac/string.h>
13 #include <ac/socket.h>
16 #include "back-ldbm.h"
18 static ID_BLOCK* idl_dup( ID_BLOCK *idl );
20 static void cont_alloc( Datum *cont, Datum *key )
22 ldbm_datum_init( *cont );
23 cont->dsize = 1 + sizeof(ID) + key->dsize;
24 cont->dptr = ch_malloc( cont->dsize );
26 * (unsigned char *) cont->dptr = SLAP_INDEX_CONT_PREFIX;
28 AC_MEMCPY( &((unsigned char *)cont->dptr)[1 + sizeof(ID)],
29 key->dptr, key->dsize );
32 static void cont_id( Datum *cont, ID id )
36 for( i=1; i <= sizeof(id); i++) {
37 ((unsigned char *)cont->dptr)[i] = (unsigned char)(id & 0xFF);
43 static void cont_free( Datum *cont )
45 ch_free( cont->dptr );
49 static void idl_check(ID_BLOCK *idl)
54 if( ID_BLOCK_ALLIDS(idl) )
58 #ifndef USE_INDIRECT_NIDS
59 if( ID_BLOCK_INDIRECT(idl) )
61 for ( max = 0; !ID_BLOCK_NOID(idl, max); max++ ) ;
65 max = ID_BLOCK_NIDS(idl);
72 for( last = ID_BLOCK_ID(idl, 0), i = 1;
74 last = ID_BLOCK_ID(idl, i), i++ )
76 assert (last < ID_BLOCK_ID(idl, i) );
81 /* Allocate an ID_BLOCK with room for nids ids */
83 idl_alloc( unsigned int nids )
87 /* nmax + nids + space for the ids */
88 new = (ID_BLOCK *) ch_calloc( (ID_BLOCK_IDS_OFFSET + nids), sizeof(ID) );
89 ID_BLOCK_NMAX(new) = nids;
90 ID_BLOCK_NIDS(new) = 0;
96 /* Allocate an empty ALLIDS ID_BLOCK */
98 idl_allids( Backend *be )
103 idl = idl_alloc( 0 );
104 ID_BLOCK_NMAX(idl) = ID_BLOCK_ALLIDS_VALUE;
105 if ( next_id_get( be, &id ) ) {
108 ID_BLOCK_NIDS(idl) = id;
113 /* Free an ID_BLOCK */
115 idl_free( ID_BLOCK *idl )
119 LDAP_LOG( INDEX, INFO, "idl_free: called with NULL pointer\n" , 0,0,0);
121 Debug( LDAP_DEBUG_TRACE,
122 "idl_free: called with NULL pointer\n",
129 free( (char *) idl );
133 /* Fetch an single ID_BLOCK from the cache */
144 /* Debug( LDAP_DEBUG_TRACE, "=> idl_fetch_one\n", 0, 0, 0 ); */
146 data = ldbm_cache_fetch( db, key );
148 if( data.dptr == NULL ) {
152 idl = (ID_BLOCK *) data.dptr;
153 if ( ID_BLOCK_ALLIDS(idl) ) {
154 /* make sure we have the current value of highest id */
155 idl = idl_allids( be );
157 idl = idl_dup((ID_BLOCK *) data.dptr);
160 ldbm_datum_free( db->dbc_db, data );
166 /* Fetch a set of ID_BLOCKs from the cache
168 * if block return is an ALLIDS block,
169 * return an new ALLIDS block
172 * construct super block from all blocks referenced by INDIRECT block
188 idl = idl_fetch_one( be, db, key );
194 if ( ID_BLOCK_ALLIDS(idl) ) {
199 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
205 * this is an indirect block which points to other blocks.
206 * we need to read in all the blocks it points to and construct
207 * a big id list containing all the ids, which we will return.
210 #ifndef USE_INDIRECT_NIDS
211 /* count the number of blocks & allocate space for pointers to them */
212 for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ )
215 i = ID_BLOCK_NIDS(idl);
217 tmp = (ID_BLOCK **) ch_malloc( (i + 1) * sizeof(ID_BLOCK *) );
219 /* read in all the blocks */
220 cont_alloc( &data, &key );
222 #ifndef USE_INDIRECT_NIDS
223 for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ ) {
225 for ( i = 0; i < ID_BLOCK_NIDS(idl); i++ ) {
227 cont_id( &data, ID_BLOCK_ID(idl, i) );
229 if ( (tmp[i] = idl_fetch_one( be, db, data )) == NULL ) {
231 LDAP_LOG( INDEX, INFO,
232 "idl_fetch: idl_fetch_one returned NULL\n", 0,0,0 );
234 Debug( LDAP_DEBUG_ANY,
235 "idl_fetch: one returned NULL\n", 0, 0, 0 );
241 nids += ID_BLOCK_NIDS(tmp[i]);
247 /* allocate space for the big block */
248 idl = idl_alloc( nids );
249 ID_BLOCK_NIDS(idl) = nids;
252 /* copy in all the ids from the component blocks */
253 for ( i = 0; tmp[i] != NULL; i++ ) {
254 if ( tmp[i] == NULL ) {
259 (char *) &ID_BLOCK_ID(idl, nids),
260 (char *) &ID_BLOCK_ID(tmp[i], 0),
261 ID_BLOCK_NIDS(tmp[i]) * sizeof(ID) );
262 nids += ID_BLOCK_NIDS(tmp[i]);
266 free( (char *) tmp );
268 #ifdef LDBM_DEBUG_IDL
273 LDAP_LOG( INDEX, ENTRY,
274 "idl_fetch: %ld ids (%ld max)\n",
275 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAXN(idl), 0 );
277 Debug( LDAP_DEBUG_TRACE, "<= idl_fetch %ld ids (%ld max)\n",
278 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAXN(idl), 0 );
285 /* store a single block */
297 #ifdef LDBM_DEBUG_IDL
301 ldbm_datum_init( data );
303 /* Debug( LDAP_DEBUG_TRACE, "=> idl_store\n", 0, 0, 0 ); */
305 data.dptr = (char *) idl;
306 data.dsize = (ID_BLOCK_IDS_OFFSET + ID_BLOCK_NMAXN(idl)) * sizeof(ID);
308 flags = LDBM_REPLACE;
309 rc = ldbm_cache_store( db, key, data, flags );
312 Statslog( LDAP_DEBUG_STATS, "<= idl_store(): rc=%d\n",
316 /* Debug( LDAP_DEBUG_TRACE, "<= idl_store %d\n", rc, 0, 0 ); */
320 /* Binary search for id in block, return index
321 * an index is always returned, even with no match. If no
322 * match, the returned index is the insertion point.
330 int lo=0, hi=ID_BLOCK_NIDS(b)-1, nr=0;
334 nr = ( lo + hi ) / 2;
335 if (ID_BLOCK_ID(b, nr) == id)
337 if (ID_BLOCK_ID(b, nr) > id)
345 /* split the block at id
346 * locate ID greater than or equal to id.
358 /* find where to split the block */
359 nr = idl_find(b, id);
360 if ( ID_BLOCK_ID(b,nr) < id )
363 nl = ID_BLOCK_NIDS(b) - nr;
365 *right = idl_alloc( nr == 0 ? 1 : nr );
366 *left = idl_alloc( nl + (nr == 0 ? 0 : 1));
369 * everything before the id being inserted in the first block
370 * unless there is nothing, in which case the id being inserted
374 ID_BLOCK_NIDS(*right) = 1;
375 ID_BLOCK_ID(*right, 0) = id;
378 (char *) &ID_BLOCK_ID(*right, 0),
379 (char *) &ID_BLOCK_ID(b, 0),
381 ID_BLOCK_NIDS(*right) = nr;
382 ID_BLOCK_ID(*left, 0) = id;
385 /* the id being inserted & everything after in the second block */
387 (char *) &ID_BLOCK_ID(*left, (nr == 0 ? 0 : 1)),
388 (char *) &ID_BLOCK_ID(b, nr),
390 ID_BLOCK_NIDS(*left) = nl + (nr == 0 ? 0 : 1);
392 #ifdef LDBM_DEBUG_IDL
400 * idl_change_first - called when an indirect block's first key has
401 * changed, meaning it needs to be stored under a new key, and the
402 * header block pointing to it needs updating.
408 Datum hkey, /* header block key */
409 ID_BLOCK *h, /* header block */
410 int pos, /* pos in h to update */
411 Datum bkey, /* data block key */
412 ID_BLOCK *b /* data block */
417 /* Debug( LDAP_DEBUG_TRACE, "=> idl_change_first\n", 0, 0, 0 ); */
419 /* delete old key block */
420 if ( (rc = ldbm_cache_delete( db, bkey )) != 0 ) {
422 LDAP_LOG( INDEX, INFO,
423 "idl_change_first: ldbm_cache_delete returned %d\n", rc, 0, 0 );
425 Debug( LDAP_DEBUG_ANY,
426 "idl_change_first: ldbm_cache_delete returned %d\n",
433 /* write block with new key */
434 cont_id( &bkey, ID_BLOCK_ID(b, 0) );
436 if ( (rc = idl_store( be, db, bkey, b )) != 0 ) {
438 LDAP_LOG( INDEX, INFO,
439 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
441 Debug( LDAP_DEBUG_ANY,
442 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
448 /* update + write indirect header block */
449 ID_BLOCK_ID(h, pos) = ID_BLOCK_ID(b, 0);
450 if ( (rc = idl_store( be, db, hkey, h )) != 0 ) {
452 LDAP_LOG( INDEX, INFO,
453 "idl_change_first: idl_store returned %s\n", rc, 0, 0 );
455 Debug( LDAP_DEBUG_ANY,
456 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
474 int i, j, first, rc = 0;
475 ID_BLOCK *idl, *tmp, *tmp2, *tmp3;
478 if ( (idl = idl_fetch_one( be, db, key )) == NULL ) {
479 idl = idl_alloc( 1 );
480 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)++) = id;
481 rc = idl_store( be, db, key, idl );
487 if ( ID_BLOCK_ALLIDS( idl ) ) {
493 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
495 switch ( idl_insert( &idl, id, db->dbc_maxids ) ) {
496 case 0: /* id inserted - store the updated block */
498 rc = idl_store( be, db, key, idl );
501 case 2: /* id already there - nothing to do */
505 case 3: /* id not inserted - block must be split */
506 /* check threshold for marking this an all-id block */
507 if ( db->dbc_maxindirect < 2 ) {
509 idl = idl_allids( be );
510 rc = idl_store( be, db, key, idl );
514 idl_split_block( idl, id, &tmp, &tmp2 );
517 /* create the header indirect block */
518 #ifndef USE_INDIRECT_NIDS
519 idl = idl_alloc( 3 );
520 ID_BLOCK_NMAX(idl) = 3;
521 ID_BLOCK_NIDS(idl) = ID_BLOCK_INDIRECT_VALUE;
522 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
523 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
524 ID_BLOCK_ID(idl, 2) = NOID;
526 idl = idl_alloc( 2 );
527 ID_BLOCK_NMAX(idl) = 2 | ID_BLOCK_INDIRECT_VALUE;
528 ID_BLOCK_NIDS(idl) = 2;
529 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
530 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
534 rc = idl_store( be, db, key, idl );
536 cont_alloc( &k2, &key );
537 cont_id( &k2, ID_BLOCK_ID(tmp, 0) );
539 rc = idl_store( be, db, k2, tmp );
541 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
542 rc = idl_store( be, db, k2, tmp2 );
556 * this is an indirect block which points to other blocks.
557 * we need to read in the block into which the id should be
558 * inserted, then insert the id and store the block. we might
559 * have to split the block if it is full, which means we also
560 * need to write a new "header" block.
563 #ifndef USE_INDIRECT_NIDS
564 /* select the block to try inserting into *//* XXX linear search XXX */
565 for ( i = 0; !ID_BLOCK_NOID(idl, i) && id > ID_BLOCK_ID(idl, i); i++ )
568 i = idl_find(idl, id);
569 if (ID_BLOCK_ID(idl, i) < id)
581 cont_alloc( &k2, &key );
582 cont_id( &k2, ID_BLOCK_ID(idl, i) );
584 if ( (tmp = idl_fetch_one( be, db, k2 )) == NULL ) {
586 LDAP_LOG( INDEX, ERR,
587 "idl_insert_key: nonexistent continuation block\n", 0, 0, 0 );
589 Debug( LDAP_DEBUG_ANY, "idl_insert_key: nonexistent continuation block\n",
599 switch ( idl_insert( &tmp, id, db->dbc_maxids ) ) {
600 case 0: /* id inserted ok */
601 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
603 LDAP_LOG( INDEX, ERR,
604 "ids_insert_key: idl_store returned %d\n", rc, 0, 0 );
606 Debug( LDAP_DEBUG_ANY,
607 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
613 case 1: /* id inserted - first id in block has changed */
615 * key for this block has changed, so we have to
616 * write the block under the new key, delete the
617 * old key block + update and write the indirect
621 rc = idl_change_first( be, db, key, idl, i, k2, tmp );
624 case 2: /* id not inserted - already there, do nothing */
628 case 3: /* id not inserted - block is full */
630 * first, see if it will fit in the next block,
631 * without splitting, unless we're trying to insert
632 * into the beginning of the first block.
635 #ifndef USE_INDIRECT_NIDS
636 /* is there a next block? */
637 if ( !first && !ID_BLOCK_NOID(idl, i + 1) ) {
639 if ( !first && (unsigned long)(i + 1) < ID_BLOCK_NIDS(idl) ) {
642 cont_alloc( &k2, &key );
643 cont_id( &k2, ID_BLOCK_ID(idl, i + 1) );
644 if ( (tmp2 = idl_fetch_one( be, db, k2 )) == NULL ) {
646 LDAP_LOG( INDEX, ERR,
647 "idl_insert_key: idl_fetch_one returned NULL\n", 0, 0, 0);
649 Debug( LDAP_DEBUG_ANY,
650 "idl_insert_key: idl_fetch_one returned NULL\n",
654 /* split the original block */
659 /* If the new id is less than the last id in the
660 * current block, it must not be put into the next
661 * block. Push the last id of the current block
662 * into the next block instead.
664 if (id < ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1)) {
665 ID id2 = ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1);
667 --ID_BLOCK_NIDS(tmp);
668 /* This must succeed since we just popped one
669 * ID off the end of it.
671 rc = idl_insert( &tmp, id, db->dbc_maxids );
673 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
675 LDAP_LOG( INDEX, ERR,
676 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
678 Debug( LDAP_DEBUG_ANY,
679 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
685 /* This new id will necessarily be inserted
686 * as the first id of the next block by the
687 * following switch() statement.
691 switch ( (rc = idl_insert( &tmp2, id,
692 db->dbc_maxids )) ) {
693 case 1: /* id inserted first in block */
694 rc = idl_change_first( be, db, key, idl,
698 case 2: /* id already there - how? */
699 case 0: /* id inserted: this can never be
700 * the result of idl_insert, because
701 * we guaranteed that idl_change_first
702 * will always be called.
706 LDAP_LOG( INDEX, INFO,
707 "idl_insert_key: id %ld is already in next block\n",
710 Debug( LDAP_DEBUG_ANY,
711 "idl_insert_key: id %ld already in next block\n",
722 case 3: /* split the original block */
731 * must split the block, write both new blocks + update
732 * and write the indirect header block.
735 rc = 0; /* optimistic */
738 #ifndef USE_INDIRECT_NIDS
739 /* count how many indirect blocks *//* XXX linear count XXX */
740 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
743 j = ID_BLOCK_NIDS(idl);
746 /* check it against all-id thresholed */
747 if ( j + 1 > db->dbc_maxindirect ) {
749 * we've passed the all-id threshold, meaning
750 * that this set of blocks should be replaced
751 * by a single "all-id" block. our job: delete
752 * all the indirect blocks, and replace the header
753 * block by an all-id block.
756 /* delete all indirect blocks */
757 #ifndef USE_INDIRECT_NIDS
758 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ ) {
760 for ( j = 0; (unsigned long) j < ID_BLOCK_NIDS(idl); j++ ) {
762 cont_id( &k2, ID_BLOCK_ID(idl, j) );
764 rc = ldbm_cache_delete( db, k2 );
767 /* store allid block in place of header block */
769 idl = idl_allids( be );
770 rc = idl_store( be, db, key, idl );
778 idl_split_block( tmp, id, &tmp2, &tmp3 );
781 /* create a new updated indirect header block */
782 tmp = idl_alloc( ID_BLOCK_NMAXN(idl) + 1 );
783 #ifndef USE_INDIRECT_NIDS
784 ID_BLOCK_NIDS(tmp) = ID_BLOCK_INDIRECT_VALUE;
786 ID_BLOCK_NMAX(tmp) |= ID_BLOCK_INDIRECT_VALUE;
788 /* everything up to the split block */
790 (char *) &ID_BLOCK_ID(tmp, 0),
791 (char *) &ID_BLOCK_ID(idl, 0),
793 /* the two new blocks */
794 ID_BLOCK_ID(tmp, i) = ID_BLOCK_ID(tmp2, 0);
795 ID_BLOCK_ID(tmp, i + 1) = ID_BLOCK_ID(tmp3, 0);
796 /* everything after the split block */
797 #ifndef USE_INDIRECT_NIDS
799 (char *) &ID_BLOCK_ID(tmp, i + 2),
800 (char *) &ID_BLOCK_ID(idl, i + 1),
801 (ID_BLOCK_NMAXN(idl) - i - 1) * sizeof(ID) );
804 (char *) &ID_BLOCK_ID(tmp, i + 2),
805 (char *) &ID_BLOCK_ID(idl, i + 1),
806 (ID_BLOCK_NIDS(idl) - i - 1) * sizeof(ID) );
807 ID_BLOCK_NIDS(tmp) = ID_BLOCK_NIDS(idl) + 1;
810 /* store the header block */
811 rc = idl_store( be, db, key, tmp );
813 /* store the first id block */
814 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
815 rc = idl_store( be, db, k2, tmp2 );
817 /* store the second id block */
818 cont_id( &k2, ID_BLOCK_ID(tmp3, 0) );
819 rc = idl_store( be, db, k2, tmp3 );
834 * idl_insert - insert an id into an id list.
838 * 1 id inserted, first id in block has changed
839 * 2 id not inserted, already there
840 * 3 id not inserted, block must be split
843 idl_insert( ID_BLOCK **idl, ID id, unsigned int maxids )
847 if ( ID_BLOCK_ALLIDS( *idl ) ) {
848 return( 2 ); /* already there */
851 /* is it already there? */
852 i = idl_find(*idl, id);
853 if ( ID_BLOCK_ID(*idl, i) == id ) {
854 return( 2 ); /* already there */
856 if ( ID_BLOCK_NIDS(*idl) && ID_BLOCK_ID(*idl, i) < id )
859 /* do we need to make room for it? */
860 if ( ID_BLOCK_NIDS(*idl) == ID_BLOCK_NMAXN(*idl) ) {
861 /* make room or indicate block needs splitting */
862 if ( ID_BLOCK_NMAXN(*idl) >= maxids ) {
863 return( 3 ); /* block needs splitting */
866 ID_BLOCK_NMAX(*idl) *= 2;
867 if ( ID_BLOCK_NMAXN(*idl) > maxids ) {
868 ID_BLOCK_NMAX(*idl) = maxids;
870 *idl = (ID_BLOCK *) ch_realloc( (char *) *idl,
871 (ID_BLOCK_NMAXN(*idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
874 /* make a slot for the new id */
875 AC_MEMCPY( &ID_BLOCK_ID(*idl, i+1), &ID_BLOCK_ID(*idl, i),
876 (ID_BLOCK_NIDS(*idl) - i) * sizeof(ID) );
878 ID_BLOCK_ID(*idl, i) = id;
879 ID_BLOCK_NIDS(*idl)++;
881 (char *) &ID_BLOCK_ID((*idl), ID_BLOCK_NIDS(*idl)),
883 (ID_BLOCK_NMAXN(*idl) - ID_BLOCK_NIDS(*idl)) * sizeof(ID) );
885 #ifdef LDBM_DEBUG_IDL
889 return( i == 0 ? 1 : 0 ); /* inserted - first id changed or not */
906 if ( (idl = idl_fetch_one( be, db, key ) ) == NULL )
908 /* It wasn't found. Hmm... */
912 if ( ID_BLOCK_ALLIDS( idl ) ) {
917 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
918 i = idl_find(idl, id);
919 if ( ID_BLOCK_ID(idl, i) == id ) {
920 if( --ID_BLOCK_NIDS(idl) == 0 ) {
921 ldbm_cache_delete( db, key );
925 &ID_BLOCK_ID(idl, i),
926 &ID_BLOCK_ID(idl, i+1),
927 (ID_BLOCK_NIDS(idl)-i) * sizeof(ID) );
929 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)) = NOID;
931 idl_store( be, db, key, idl );
937 /* We didn't find the ID. Hmmm... */
942 /* We have to go through an indirect block and find the ID
945 cont_alloc( &data, &key );
946 #ifndef USE_INDIRECT_NIDS
947 for ( nids = 0; !ID_BLOCK_NOID(idl, nids); nids++ )
950 for ( j = 0; j<nids; j++ )
952 nids = ID_BLOCK_NIDS(idl);
953 for ( j = idl_find(idl, id); j >= 0; j = -1) /* execute once */
957 cont_id( &data, ID_BLOCK_ID(idl, j) );
959 if ( (tmp = idl_fetch_one( be, db, data )) == NULL ) {
961 LDAP_LOG( INDEX, INFO,
962 "idl_delete_key: idl_fetch_one returned NULL\n", 0, 0, 0 );
964 Debug( LDAP_DEBUG_ANY,
965 "idl_delete_key: idl_fetch of returned NULL\n", 0, 0, 0 );
971 Now try to find the ID in tmp
974 i = idl_find(tmp, id);
975 if ( ID_BLOCK_ID(tmp, i) == id )
978 &ID_BLOCK_ID(tmp, i),
979 &ID_BLOCK_ID(tmp, i+1),
980 (ID_BLOCK_NIDS(tmp)-(i+1)) * sizeof(ID));
981 ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp)-1 ) = NOID;
982 ID_BLOCK_NIDS(tmp)--;
984 if ( ID_BLOCK_NIDS(tmp) ) {
985 idl_store ( be, db, data, tmp );
988 ldbm_cache_delete( db, data );
990 &ID_BLOCK_ID(idl, j),
991 &ID_BLOCK_ID(idl, j+1),
992 (nids-(j+1)) * sizeof(ID));
993 ID_BLOCK_ID(idl, nids-1) = NOID;
995 #ifdef USE_INDIRECT_NIDS
996 ID_BLOCK_NIDS(idl)--;
999 ldbm_cache_delete( db, key );
1001 idl_store( be, db, key, idl );
1017 /* return a duplicate of a single ID_BLOCK */
1019 idl_dup( ID_BLOCK *idl )
1023 if ( idl == NULL ) {
1027 new = idl_alloc( ID_BLOCK_NMAXN(idl) );
1032 (ID_BLOCK_NMAXN(idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
1034 #ifdef LDBM_DEBUG_IDL
1042 /* return the smaller ID_BLOCK */
1044 idl_min( ID_BLOCK *a, ID_BLOCK *b )
1046 return( ID_BLOCK_NIDS(a) > ID_BLOCK_NIDS(b) ? b : a );
1051 * idl_intersection - return a intersection b
1060 unsigned int ai, bi, ni;
1063 if ( a == NULL || b == NULL ) {
1066 if ( ID_BLOCK_ALLIDS( a ) ) {
1067 return( idl_dup( b ) );
1069 if ( ID_BLOCK_ALLIDS( b ) ) {
1070 return( idl_dup( a ) );
1072 if ( ID_BLOCK_NIDS(a) == 0 || ID_BLOCK_NIDS(b) == 0 ) {
1076 n = idl_dup( idl_min( a, b ) );
1078 #ifdef LDBM_DEBUG_IDL
1083 for ( ni = 0, ai = 0, bi = 0; ; ) {
1084 if ( ID_BLOCK_ID(b, bi) == ID_BLOCK_ID(a, ai) ) {
1085 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1088 if ( ai >= ID_BLOCK_NIDS(a) || bi >= ID_BLOCK_NIDS(b) )
1090 } else if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
1092 if ( ai >= ID_BLOCK_NIDS(a) )
1096 if ( bi >= ID_BLOCK_NIDS(b) )
1105 ID_BLOCK_NIDS(n) = ni;
1107 #ifdef LDBM_DEBUG_IDL
1116 * idl_union - return a union b
1125 unsigned int ai, bi, ni;
1129 return( idl_dup( b ) );
1132 return( idl_dup( a ) );
1134 if ( ID_BLOCK_ALLIDS( a ) || ID_BLOCK_ALLIDS( b ) ) {
1135 return( idl_allids( be ) );
1138 #ifdef LDBM_DEBUG_IDL
1143 if ( ID_BLOCK_NIDS(b) < ID_BLOCK_NIDS(a) ) {
1149 n = idl_alloc( ID_BLOCK_NIDS(a) + ID_BLOCK_NIDS(b) );
1151 for ( ni = 0, ai = 0, bi = 0;
1152 ai < ID_BLOCK_NIDS(a) && bi < ID_BLOCK_NIDS(b);
1155 if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
1156 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai++);
1158 } else if ( ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai) ) {
1159 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi++);
1162 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1167 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1168 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1170 for ( ; bi < ID_BLOCK_NIDS(b); bi++ ) {
1171 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi);
1173 ID_BLOCK_NIDS(n) = ni;
1175 #ifdef LDBM_DEBUG_IDL
1184 * idl_notin - return a intersection ~b (or a minus b)
1193 unsigned int ni, ai, bi;
1199 if ( b == NULL || ID_BLOCK_ALLIDS( b )) {
1200 return( idl_dup( a ) );
1203 if ( ID_BLOCK_ALLIDS( a ) ) {
1204 n = idl_alloc( SLAPD_LDBM_MIN_MAXIDS );
1207 for ( ai = 1, bi = 0;
1208 ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAXN(n) && bi < ID_BLOCK_NMAXN(b);
1211 if ( ID_BLOCK_ID(b, bi) == ai ) {
1214 ID_BLOCK_ID(n, ni++) = ai;
1218 for ( ; ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAXN(n); ai++ ) {
1219 ID_BLOCK_ID(n, ni++) = ai;
1222 if ( ni == ID_BLOCK_NMAXN(n) ) {
1224 return( idl_allids( be ) );
1226 ID_BLOCK_NIDS(n) = ni;
1234 for ( ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
1236 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
1242 if ( bi == ID_BLOCK_NIDS(b) ) {
1246 if ( ID_BLOCK_ID(b, bi) != ID_BLOCK_ID(a, ai) ) {
1247 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1251 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1252 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1254 ID_BLOCK_NIDS(n) = ni;
1256 #ifdef LDBM_DEBUG_IDL
1263 /* return the first ID in the block
1266 * otherwise return NOID
1267 * otherwise return first ID
1269 * cursor is set to 1
1272 idl_firstid( ID_BLOCK *idl, ID *cursor )
1276 if ( idl == NULL || ID_BLOCK_NIDS(idl) == 0 ) {
1280 if ( ID_BLOCK_ALLIDS( idl ) ) {
1281 return( ID_BLOCK_NIDS(idl) > 1 ? 1 : NOID );
1284 return( ID_BLOCK_ID(idl, 0) );
1288 * if ALLIDS block, cursor is id.
1290 * if id < NIDS return id
1292 * otherwise cursor is index into block
1294 * return id at index then increment
1297 idl_nextid( ID_BLOCK *idl, ID *cursor )
1299 if ( ID_BLOCK_ALLIDS( idl ) ) {
1300 if( ++(*cursor) < ID_BLOCK_NIDS(idl) ) {
1307 if ( *cursor < ID_BLOCK_NIDS(idl) ) {
1308 return( ID_BLOCK_ID(idl, (*cursor)++) );