1 /* idl.c - ldap id list handling routines */
4 * Copyright 1998-2003 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
185 unsigned i, nids, nblocks;
187 idl = idl_fetch_one( be, db, key );
193 if ( ID_BLOCK_ALLIDS(idl) ) {
198 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
204 * this is an indirect block which points to other blocks.
205 * we need to read in all the blocks it points to and construct
206 * a big id list containing all the ids, which we will return.
209 #ifndef USE_INDIRECT_NIDS
210 /* count the number of blocks & allocate space for pointers to them */
211 for ( nblocks = 0; !ID_BLOCK_NOID(idl, nblocks); nblocks++ )
214 nblocks = ID_BLOCK_NIDS(idl);
216 tmp = (ID_BLOCK **) ch_malloc( nblocks * sizeof(ID_BLOCK *) );
218 /* read in all the blocks */
219 cont_alloc( &data, &key );
221 for ( i = 0; i < nblocks; i++ ) {
222 cont_id( &data, ID_BLOCK_ID(idl, i) );
224 if ( (tmp[i] = idl_fetch_one( be, db, data )) == NULL ) {
226 LDAP_LOG( INDEX, INFO,
227 "idl_fetch: idl_fetch_one returned NULL\n", 0,0,0 );
229 Debug( LDAP_DEBUG_ANY,
230 "idl_fetch: one returned NULL\n", 0, 0, 0 );
236 nids += ID_BLOCK_NIDS(tmp[i]);
241 /* allocate space for the big block */
242 idl = idl_alloc( nids );
243 ID_BLOCK_NIDS(idl) = nids;
246 /* copy in all the ids from the component blocks */
247 for ( i = 0; i < nblocks; i++ ) {
248 if ( tmp[i] == NULL ) {
253 (char *) &ID_BLOCK_ID(idl, nids),
254 (char *) &ID_BLOCK_ID(tmp[i], 0),
255 ID_BLOCK_NIDS(tmp[i]) * sizeof(ID) );
256 nids += ID_BLOCK_NIDS(tmp[i]);
260 free( (char *) tmp );
262 assert( ID_BLOCK_NIDS(idl) == nids );
264 #ifdef LDBM_DEBUG_IDL
269 LDAP_LOG( INDEX, ENTRY,
270 "idl_fetch: %ld ids (%ld max)\n",
271 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAXN(idl), 0 );
273 Debug( LDAP_DEBUG_TRACE, "<= idl_fetch %ld ids (%ld max)\n",
274 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAXN(idl), 0 );
281 /* store a single block */
293 #ifdef LDBM_DEBUG_IDL
297 ldbm_datum_init( data );
299 /* Debug( LDAP_DEBUG_TRACE, "=> idl_store\n", 0, 0, 0 ); */
301 data.dptr = (char *) idl;
302 data.dsize = (ID_BLOCK_IDS_OFFSET + ID_BLOCK_NMAXN(idl)) * sizeof(ID);
304 flags = LDBM_REPLACE;
305 rc = ldbm_cache_store( db, key, data, flags );
307 /* Debug( LDAP_DEBUG_TRACE, "<= idl_store %d\n", rc, 0, 0 ); */
311 /* Binary search for id in block, return index
312 * an index is always returned, even with no match. If no
313 * match, the returned index is the insertion point.
321 int lo=0, hi=ID_BLOCK_NIDS(b)-1, nr=0;
325 nr = ( lo + hi ) / 2;
326 if (ID_BLOCK_ID(b, nr) == id)
328 if (ID_BLOCK_ID(b, nr) > id)
336 /* split the block at id
337 * locate ID greater than or equal to id.
349 /* find where to split the block */
350 nr = idl_find(b, id);
351 if ( ID_BLOCK_ID(b,nr) < id )
354 nl = ID_BLOCK_NIDS(b) - nr;
356 *right = idl_alloc( nr == 0 ? 1 : nr );
357 *left = idl_alloc( nl + (nr == 0 ? 0 : 1));
360 * everything before the id being inserted in the first block
361 * unless there is nothing, in which case the id being inserted
365 ID_BLOCK_NIDS(*right) = 1;
366 ID_BLOCK_ID(*right, 0) = id;
369 (char *) &ID_BLOCK_ID(*right, 0),
370 (char *) &ID_BLOCK_ID(b, 0),
372 ID_BLOCK_NIDS(*right) = nr;
373 ID_BLOCK_ID(*left, 0) = id;
376 /* the id being inserted & everything after in the second block */
378 (char *) &ID_BLOCK_ID(*left, (nr == 0 ? 0 : 1)),
379 (char *) &ID_BLOCK_ID(b, nr),
381 ID_BLOCK_NIDS(*left) = nl + (nr == 0 ? 0 : 1);
383 #ifdef LDBM_DEBUG_IDL
391 * idl_change_first - called when an indirect block's first key has
392 * changed, meaning it needs to be stored under a new key, and the
393 * header block pointing to it needs updating.
399 Datum hkey, /* header block key */
400 ID_BLOCK *h, /* header block */
401 int pos, /* pos in h to update */
402 Datum bkey, /* data block key */
403 ID_BLOCK *b /* data block */
408 /* Debug( LDAP_DEBUG_TRACE, "=> idl_change_first\n", 0, 0, 0 ); */
410 /* delete old key block */
411 if ( (rc = ldbm_cache_delete( db, bkey )) != 0 ) {
413 LDAP_LOG( INDEX, INFO,
414 "idl_change_first: ldbm_cache_delete returned %d\n", rc, 0, 0 );
416 Debug( LDAP_DEBUG_ANY,
417 "idl_change_first: ldbm_cache_delete returned %d\n",
424 /* write block with new key */
425 cont_id( &bkey, ID_BLOCK_ID(b, 0) );
427 if ( (rc = idl_store( be, db, bkey, b )) != 0 ) {
429 LDAP_LOG( INDEX, INFO,
430 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
432 Debug( LDAP_DEBUG_ANY,
433 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
439 /* update + write indirect header block */
440 ID_BLOCK_ID(h, pos) = ID_BLOCK_ID(b, 0);
441 if ( (rc = idl_store( be, db, hkey, h )) != 0 ) {
443 LDAP_LOG( INDEX, INFO,
444 "idl_change_first: idl_store returned %s\n", rc, 0, 0 );
446 Debug( LDAP_DEBUG_ANY,
447 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
465 int i, j, first, rc = 0;
466 ID_BLOCK *idl, *tmp, *tmp2, *tmp3;
469 if ( (idl = idl_fetch_one( be, db, key )) == NULL ) {
470 idl = idl_alloc( 1 );
471 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)++) = id;
472 rc = idl_store( be, db, key, idl );
478 if ( ID_BLOCK_ALLIDS( idl ) ) {
484 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
486 switch ( idl_insert( &idl, id, db->dbc_maxids ) ) {
487 case 0: /* id inserted - store the updated block */
489 rc = idl_store( be, db, key, idl );
492 case 2: /* id already there - nothing to do */
496 case 3: /* id not inserted - block must be split */
497 /* check threshold for marking this an all-id block */
498 if ( db->dbc_maxindirect < 2 ) {
500 idl = idl_allids( be );
501 rc = idl_store( be, db, key, idl );
505 idl_split_block( idl, id, &tmp, &tmp2 );
508 /* create the header indirect block */
509 #ifndef USE_INDIRECT_NIDS
510 idl = idl_alloc( 3 );
511 ID_BLOCK_NMAX(idl) = 3;
512 ID_BLOCK_NIDS(idl) = ID_BLOCK_INDIRECT_VALUE;
513 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
514 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
515 ID_BLOCK_ID(idl, 2) = NOID;
517 idl = idl_alloc( 2 );
518 ID_BLOCK_NMAX(idl) = 2 | ID_BLOCK_INDIRECT_VALUE;
519 ID_BLOCK_NIDS(idl) = 2;
520 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
521 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
525 rc = idl_store( be, db, key, idl );
527 cont_alloc( &k2, &key );
528 cont_id( &k2, ID_BLOCK_ID(tmp, 0) );
530 rc = idl_store( be, db, k2, tmp );
532 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
533 rc = idl_store( be, db, k2, tmp2 );
547 * this is an indirect block which points to other blocks.
548 * we need to read in the block into which the id should be
549 * inserted, then insert the id and store the block. we might
550 * have to split the block if it is full, which means we also
551 * need to write a new "header" block.
554 #ifndef USE_INDIRECT_NIDS
555 /* select the block to try inserting into *//* XXX linear search XXX */
556 for ( i = 0; !ID_BLOCK_NOID(idl, i) && id >= ID_BLOCK_ID(idl, i); i++ )
559 i = idl_find(idl, id);
560 if (ID_BLOCK_ID(idl, i) <= id)
570 /* At this point, the following condition must be true:
571 * ID_BLOCK_ID(idl, i) <= id && id < ID_BLOCK_ID(idl, i+1)
572 * except when i is the first or the last block.
576 cont_alloc( &k2, &key );
577 cont_id( &k2, ID_BLOCK_ID(idl, i) );
579 if ( (tmp = idl_fetch_one( be, db, k2 )) == NULL ) {
581 LDAP_LOG( INDEX, ERR,
582 "idl_insert_key: nonexistent continuation block\n", 0, 0, 0 );
584 Debug( LDAP_DEBUG_ANY, "idl_insert_key: nonexistent continuation block\n",
594 switch ( idl_insert( &tmp, id, db->dbc_maxids ) ) {
595 case 0: /* id inserted ok */
596 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
598 LDAP_LOG( INDEX, ERR,
599 "ids_insert_key: idl_store returned %d\n", rc, 0, 0 );
601 Debug( LDAP_DEBUG_ANY,
602 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
608 case 1: /* id inserted - first id in block has changed */
610 * key for this block has changed, so we have to
611 * write the block under the new key, delete the
612 * old key block + update and write the indirect
616 rc = idl_change_first( be, db, key, idl, i, k2, tmp );
619 case 2: /* id not inserted - already there, do nothing */
623 case 3: /* id not inserted - block is full */
625 * first, see if it will fit in the next block,
626 * without splitting, unless we're trying to insert
627 * into the beginning of the first block.
630 #ifndef USE_INDIRECT_NIDS
631 /* is there a next block? */
632 if ( !first && !ID_BLOCK_NOID(idl, i + 1) ) {
634 if ( !first && (unsigned long)(i + 1) < ID_BLOCK_NIDS(idl) ) {
638 cont_alloc( &k3, &key );
639 cont_id( &k3, ID_BLOCK_ID(idl, i + 1) );
640 if ( (tmp2 = idl_fetch_one( be, db, k3 )) == NULL ) {
642 LDAP_LOG( INDEX, ERR,
643 "idl_insert_key: idl_fetch_one returned NULL\n", 0, 0, 0);
645 Debug( LDAP_DEBUG_ANY,
646 "idl_insert_key: idl_fetch_one returned NULL\n",
650 /* split the original block */
655 /* If the new id is less than the last id in the
656 * current block, it must not be put into the next
657 * block. Push the last id of the current block
658 * into the next block instead.
660 if (id < ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1)) {
661 ID id2 = ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1);
663 --ID_BLOCK_NIDS(tmp);
664 /* This must succeed since we just popped one
665 * ID off the end of it.
667 rc = idl_insert( &tmp, id, db->dbc_maxids );
669 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
671 LDAP_LOG( INDEX, ERR,
672 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
674 Debug( LDAP_DEBUG_ANY,
675 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
681 /* This new id will necessarily be inserted
682 * as the first id of the next block by the
683 * following switch() statement.
687 switch ( (rc = idl_insert( &tmp2, id,
688 db->dbc_maxids )) ) {
689 case 1: /* id inserted first in block */
690 rc = idl_change_first( be, db, key, idl,
694 case 2: /* id already there - how? */
695 case 0: /* id inserted: this can never be
696 * the result of idl_insert, because
697 * we guaranteed that idl_change_first
698 * will always be called.
702 LDAP_LOG( INDEX, INFO,
703 "idl_insert_key: id %ld is already in next block\n",
706 Debug( LDAP_DEBUG_ANY,
707 "idl_insert_key: id %ld already in next block\n",
720 case 3: /* split the original block */
730 * must split the block, write both new blocks + update
731 * and write the indirect header block.
734 rc = 0; /* optimistic */
737 #ifndef USE_INDIRECT_NIDS
738 /* count how many indirect blocks *//* XXX linear count XXX */
739 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
742 j = ID_BLOCK_NIDS(idl);
745 /* check it against all-id thresholed */
746 if ( j + 1 > db->dbc_maxindirect ) {
748 * we've passed the all-id threshold, meaning
749 * that this set of blocks should be replaced
750 * by a single "all-id" block. our job: delete
751 * all the indirect blocks, and replace the header
752 * block by an all-id block.
755 /* delete all indirect blocks */
756 #ifndef USE_INDIRECT_NIDS
757 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ ) {
759 for ( j = 0; (unsigned long) j < ID_BLOCK_NIDS(idl); j++ ) {
761 cont_id( &k2, ID_BLOCK_ID(idl, j) );
763 rc = ldbm_cache_delete( db, k2 );
766 /* store allid block in place of header block */
768 idl = idl_allids( be );
769 rc = idl_store( be, db, key, idl );
777 idl_split_block( tmp, id, &tmp2, &tmp3 );
780 /* create a new updated indirect header block */
781 tmp = idl_alloc( ID_BLOCK_NMAXN(idl) + 1 );
782 #ifndef USE_INDIRECT_NIDS
783 ID_BLOCK_NIDS(tmp) = ID_BLOCK_INDIRECT_VALUE;
785 ID_BLOCK_NMAX(tmp) |= ID_BLOCK_INDIRECT_VALUE;
787 /* everything up to the split block */
789 (char *) &ID_BLOCK_ID(tmp, 0),
790 (char *) &ID_BLOCK_ID(idl, 0),
792 /* the two new blocks */
793 ID_BLOCK_ID(tmp, i) = ID_BLOCK_ID(tmp2, 0);
794 ID_BLOCK_ID(tmp, i + 1) = ID_BLOCK_ID(tmp3, 0);
795 /* everything after the split block */
796 #ifndef USE_INDIRECT_NIDS
798 (char *) &ID_BLOCK_ID(tmp, i + 2),
799 (char *) &ID_BLOCK_ID(idl, i + 1),
800 (ID_BLOCK_NMAXN(idl) - i - 1) * sizeof(ID) );
803 (char *) &ID_BLOCK_ID(tmp, i + 2),
804 (char *) &ID_BLOCK_ID(idl, i + 1),
805 (ID_BLOCK_NIDS(idl) - i - 1) * sizeof(ID) );
806 ID_BLOCK_NIDS(tmp) = ID_BLOCK_NIDS(idl) + 1;
809 /* store the header block */
810 rc = idl_store( be, db, key, tmp );
812 /* store the first id block */
813 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
814 rc = idl_store( be, db, k2, tmp2 );
816 /* store the second id block */
817 cont_id( &k2, ID_BLOCK_ID(tmp3, 0) );
818 rc = idl_store( be, db, k2, tmp3 );
833 * idl_insert - insert an id into an id list.
837 * 1 id inserted, first id in block has changed
838 * 2 id not inserted, already there
839 * 3 id not inserted, block must be split
842 idl_insert( ID_BLOCK **idl, ID id, unsigned int maxids )
846 if ( ID_BLOCK_ALLIDS( *idl ) ) {
847 return( 2 ); /* already there */
850 /* is it already there? */
851 i = idl_find(*idl, id);
852 if ( ID_BLOCK_ID(*idl, i) == id ) {
853 return( 2 ); /* already there */
855 if ( ID_BLOCK_NIDS(*idl) && ID_BLOCK_ID(*idl, i) < id )
858 /* do we need to make room for it? */
859 if ( ID_BLOCK_NIDS(*idl) == ID_BLOCK_NMAXN(*idl) ) {
860 /* make room or indicate block needs splitting */
861 if ( ID_BLOCK_NMAXN(*idl) >= maxids ) {
862 return( 3 ); /* block needs splitting */
865 ID_BLOCK_NMAX(*idl) *= 2;
866 if ( ID_BLOCK_NMAXN(*idl) > maxids ) {
867 ID_BLOCK_NMAX(*idl) = maxids;
869 *idl = (ID_BLOCK *) ch_realloc( (char *) *idl,
870 (ID_BLOCK_NMAXN(*idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
873 /* make a slot for the new id */
874 AC_MEMCPY( &ID_BLOCK_ID(*idl, i+1), &ID_BLOCK_ID(*idl, i),
875 (ID_BLOCK_NIDS(*idl) - i) * sizeof(ID) );
877 ID_BLOCK_ID(*idl, i) = id;
878 ID_BLOCK_NIDS(*idl)++;
880 (char *) &ID_BLOCK_ID((*idl), ID_BLOCK_NIDS(*idl)),
882 (ID_BLOCK_NMAXN(*idl) - ID_BLOCK_NIDS(*idl)) * sizeof(ID) );
884 #ifdef LDBM_DEBUG_IDL
888 return( i == 0 ? 1 : 0 ); /* inserted - first id changed or not */
905 if ( (idl = idl_fetch_one( be, db, key ) ) == NULL )
907 /* It wasn't found. Hmm... */
911 if ( ID_BLOCK_ALLIDS( idl ) ) {
916 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
917 i = idl_find(idl, id);
918 if ( ID_BLOCK_ID(idl, i) == id ) {
919 if( --ID_BLOCK_NIDS(idl) == 0 ) {
920 ldbm_cache_delete( db, key );
924 &ID_BLOCK_ID(idl, i),
925 &ID_BLOCK_ID(idl, i+1),
926 (ID_BLOCK_NIDS(idl)-i) * sizeof(ID) );
928 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)) = NOID;
930 idl_store( be, db, key, idl );
936 /* We didn't find the ID. Hmmm... */
941 /* We have to go through an indirect block and find the ID
944 cont_alloc( &data, &key );
945 #ifndef USE_INDIRECT_NIDS
946 for ( nids = 0; !ID_BLOCK_NOID(idl, nids); nids++ )
949 for ( j = 0; j<nids; j++ )
951 nids = ID_BLOCK_NIDS(idl);
952 for ( j = idl_find(idl, id); j >= 0; j = -1) /* execute once */
956 cont_id( &data, ID_BLOCK_ID(idl, j) );
958 if ( (tmp = idl_fetch_one( be, db, data )) == NULL ) {
960 LDAP_LOG( INDEX, INFO,
961 "idl_delete_key: idl_fetch_one returned NULL\n", 0, 0, 0 );
963 Debug( LDAP_DEBUG_ANY,
964 "idl_delete_key: idl_fetch of returned NULL\n", 0, 0, 0 );
970 Now try to find the ID in tmp
973 i = idl_find(tmp, id);
974 if ( ID_BLOCK_ID(tmp, i) == id )
977 &ID_BLOCK_ID(tmp, i),
978 &ID_BLOCK_ID(tmp, i+1),
979 (ID_BLOCK_NIDS(tmp)-(i+1)) * sizeof(ID));
980 ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp)-1 ) = NOID;
981 ID_BLOCK_NIDS(tmp)--;
983 if ( ID_BLOCK_NIDS(tmp) ) {
984 idl_store ( be, db, data, tmp );
987 ldbm_cache_delete( db, data );
989 &ID_BLOCK_ID(idl, j),
990 &ID_BLOCK_ID(idl, j+1),
991 (nids-(j+1)) * sizeof(ID));
992 ID_BLOCK_ID(idl, nids-1) = NOID;
994 #ifdef USE_INDIRECT_NIDS
995 ID_BLOCK_NIDS(idl)--;
998 ldbm_cache_delete( db, key );
1000 idl_store( be, db, key, idl );
1016 /* return a duplicate of a single ID_BLOCK */
1018 idl_dup( ID_BLOCK *idl )
1022 if ( idl == NULL ) {
1026 new = idl_alloc( ID_BLOCK_NMAXN(idl) );
1031 (ID_BLOCK_NMAXN(idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
1033 #ifdef LDBM_DEBUG_IDL
1041 /* return the smaller ID_BLOCK */
1043 idl_min( ID_BLOCK *a, ID_BLOCK *b )
1045 return( ID_BLOCK_NIDS(a) > ID_BLOCK_NIDS(b) ? b : a );
1050 * idl_intersection - return a intersection b
1059 unsigned int ai, bi, ni;
1062 if ( a == NULL || b == NULL ) {
1065 if ( ID_BLOCK_ALLIDS( a ) ) {
1066 return( idl_dup( b ) );
1068 if ( ID_BLOCK_ALLIDS( b ) ) {
1069 return( idl_dup( a ) );
1071 if ( ID_BLOCK_NIDS(a) == 0 || ID_BLOCK_NIDS(b) == 0 ) {
1075 n = idl_dup( idl_min( a, b ) );
1077 #ifdef LDBM_DEBUG_IDL
1082 for ( ni = 0, ai = 0, bi = 0; ; ) {
1083 if ( ID_BLOCK_ID(b, bi) == ID_BLOCK_ID(a, ai) ) {
1084 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1087 if ( ai >= ID_BLOCK_NIDS(a) || bi >= ID_BLOCK_NIDS(b) )
1089 } else if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
1091 if ( ai >= ID_BLOCK_NIDS(a) )
1095 if ( bi >= ID_BLOCK_NIDS(b) )
1104 ID_BLOCK_NIDS(n) = ni;
1106 #ifdef LDBM_DEBUG_IDL
1115 * idl_union - return a union b
1124 unsigned int ai, bi, ni;
1128 return( idl_dup( b ) );
1131 return( idl_dup( a ) );
1133 if ( ID_BLOCK_ALLIDS( a ) || ID_BLOCK_ALLIDS( b ) ) {
1134 return( idl_allids( be ) );
1137 #ifdef LDBM_DEBUG_IDL
1142 if ( ID_BLOCK_NIDS(b) < ID_BLOCK_NIDS(a) ) {
1148 n = idl_alloc( ID_BLOCK_NIDS(a) + ID_BLOCK_NIDS(b) );
1150 for ( ni = 0, ai = 0, bi = 0;
1151 ai < ID_BLOCK_NIDS(a) && bi < ID_BLOCK_NIDS(b);
1154 if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
1155 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai++);
1157 } else if ( ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai) ) {
1158 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi++);
1161 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1166 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1167 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1169 for ( ; bi < ID_BLOCK_NIDS(b); bi++ ) {
1170 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi);
1172 ID_BLOCK_NIDS(n) = ni;
1174 #ifdef LDBM_DEBUG_IDL
1183 * idl_notin - return a intersection ~b (or a minus b)
1192 unsigned int ni, ai, bi;
1198 if ( b == NULL || ID_BLOCK_ALLIDS( b )) {
1199 return( idl_dup( a ) );
1202 if ( ID_BLOCK_ALLIDS( a ) ) {
1203 n = idl_alloc( SLAPD_LDBM_MIN_MAXIDS );
1206 for ( ai = 1, bi = 0;
1207 ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAXN(n) && bi < ID_BLOCK_NMAXN(b);
1210 if ( ID_BLOCK_ID(b, bi) == ai ) {
1213 ID_BLOCK_ID(n, ni++) = ai;
1217 for ( ; ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAXN(n); ai++ ) {
1218 ID_BLOCK_ID(n, ni++) = ai;
1221 if ( ni == ID_BLOCK_NMAXN(n) ) {
1223 return( idl_allids( be ) );
1225 ID_BLOCK_NIDS(n) = ni;
1233 for ( ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
1235 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
1241 if ( bi == ID_BLOCK_NIDS(b) ) {
1245 if ( ID_BLOCK_ID(b, bi) != ID_BLOCK_ID(a, ai) ) {
1246 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1250 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1251 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1253 ID_BLOCK_NIDS(n) = ni;
1255 #ifdef LDBM_DEBUG_IDL
1262 /* return the first ID in the block
1265 * otherwise return NOID
1266 * otherwise return first ID
1268 * cursor is set to 1
1271 idl_firstid( ID_BLOCK *idl, ID *cursor )
1275 if ( idl == NULL || ID_BLOCK_NIDS(idl) == 0 ) {
1279 if ( ID_BLOCK_ALLIDS( idl ) ) {
1280 return( ID_BLOCK_NIDS(idl) > 1 ? 1 : NOID );
1283 return( ID_BLOCK_ID(idl, 0) );
1287 * if ALLIDS block, cursor is id.
1289 * if id < NIDS return id
1291 * otherwise cursor is index into block
1293 * return id at index then increment
1296 idl_nextid( ID_BLOCK *idl, ID *cursor )
1298 if ( ID_BLOCK_ALLIDS( idl ) ) {
1299 if( ++(*cursor) < ID_BLOCK_NIDS(idl) ) {
1306 if ( *cursor < ID_BLOCK_NIDS(idl) ) {
1307 return( ID_BLOCK_ID(idl, (*cursor)++) );