1 /* idl.c - ldap id list handling routines */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1998-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>.
21 #include <ac/string.h>
22 #include <ac/socket.h>
25 #include "back-ldbm.h"
27 static ID_BLOCK* idl_dup( ID_BLOCK *idl );
29 static void cont_alloc( Datum *cont, Datum *key )
31 ldbm_datum_init( *cont );
32 cont->dsize = 1 + sizeof(ID) + key->dsize;
33 cont->dptr = ch_malloc( cont->dsize );
35 * (unsigned char *) cont->dptr = SLAP_INDEX_CONT_PREFIX;
37 AC_MEMCPY( &((unsigned char *)cont->dptr)[1 + sizeof(ID)],
38 key->dptr, key->dsize );
41 static void cont_id( Datum *cont, ID id )
45 for( i=1; i <= sizeof(id); i++) {
46 ((unsigned char *)cont->dptr)[i] = (unsigned char)(id & 0xFF);
52 static void cont_free( Datum *cont )
54 ch_free( cont->dptr );
58 static void idl_check(ID_BLOCK *idl)
63 if( ID_BLOCK_ALLIDS(idl) )
67 #ifndef USE_INDIRECT_NIDS
68 if( ID_BLOCK_INDIRECT(idl) )
70 for ( max = 0; !ID_BLOCK_NOID(idl, max); max++ ) ;
74 max = ID_BLOCK_NIDS(idl);
81 for( last = ID_BLOCK_ID(idl, 0), i = 1;
83 last = ID_BLOCK_ID(idl, i), i++ )
85 assert (last < ID_BLOCK_ID(idl, i) );
90 /* Allocate an ID_BLOCK with room for nids ids */
92 idl_alloc( unsigned int nids )
96 /* nmax + nids + space for the ids */
97 new = (ID_BLOCK *) ch_calloc( (ID_BLOCK_IDS_OFFSET + nids), sizeof(ID) );
98 ID_BLOCK_NMAX(new) = nids;
99 ID_BLOCK_NIDS(new) = 0;
105 /* Allocate an empty ALLIDS ID_BLOCK */
107 idl_allids( Backend *be )
112 idl = idl_alloc( 0 );
113 ID_BLOCK_NMAX(idl) = ID_BLOCK_ALLIDS_VALUE;
114 if ( next_id_get( be, &id ) ) {
117 ID_BLOCK_NIDS(idl) = id;
122 /* Free an ID_BLOCK */
124 idl_free( ID_BLOCK *idl )
127 Debug( LDAP_DEBUG_TRACE,
128 "idl_free: called with NULL pointer\n",
134 free( (char *) idl );
138 /* Fetch an single ID_BLOCK from the cache */
149 /* Debug( LDAP_DEBUG_TRACE, "=> idl_fetch_one\n", 0, 0, 0 ); */
151 data = ldbm_cache_fetch( db, key );
153 if( data.dptr == NULL ) {
157 idl = (ID_BLOCK *) data.dptr;
158 if ( ID_BLOCK_ALLIDS(idl) ) {
159 /* make sure we have the current value of highest id */
160 idl = idl_allids( be );
162 idl = idl_dup((ID_BLOCK *) data.dptr);
165 ldbm_datum_free( db->dbc_db, data );
171 /* Fetch a set of ID_BLOCKs from the cache
173 * if block return is an ALLIDS block,
174 * return an new ALLIDS block
177 * construct super block from all blocks referenced by INDIRECT block
190 unsigned i, nids, nblocks;
192 idl = idl_fetch_one( be, db, key );
198 if ( ID_BLOCK_ALLIDS(idl) ) {
203 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
209 * this is an indirect block which points to other blocks.
210 * we need to read in all the blocks it points to and construct
211 * a big id list containing all the ids, which we will return.
214 #ifndef USE_INDIRECT_NIDS
215 /* count the number of blocks & allocate space for pointers to them */
216 for ( nblocks = 0; !ID_BLOCK_NOID(idl, nblocks); nblocks++ )
219 nblocks = ID_BLOCK_NIDS(idl);
221 tmp = (ID_BLOCK **) ch_malloc( nblocks * sizeof(ID_BLOCK *) );
223 /* read in all the blocks */
224 cont_alloc( &data, &key );
226 for ( i = 0; i < nblocks; i++ ) {
227 cont_id( &data, ID_BLOCK_ID(idl, i) );
229 if ( (tmp[i] = idl_fetch_one( be, db, data )) == NULL ) {
230 Debug( LDAP_DEBUG_ANY,
231 "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
268 Debug( LDAP_DEBUG_TRACE, "<= idl_fetch %ld ids (%ld max)\n",
269 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAXN(idl), 0 );
275 /* store a single block */
287 #ifdef LDBM_DEBUG_IDL
291 ldbm_datum_init( data );
293 /* Debug( LDAP_DEBUG_TRACE, "=> idl_store\n", 0, 0, 0 ); */
295 data.dptr = (char *) idl;
296 data.dsize = (ID_BLOCK_IDS_OFFSET + ID_BLOCK_NMAXN(idl)) * sizeof(ID);
298 flags = LDBM_REPLACE;
299 rc = ldbm_cache_store( db, key, data, flags );
301 /* Debug( LDAP_DEBUG_TRACE, "<= idl_store %d\n", rc, 0, 0 ); */
305 /* Binary search for id in block, return index
306 * an index is always returned, even with no match. If no
307 * match, the returned index is the insertion point.
315 int lo=0, hi=ID_BLOCK_NIDS(b)-1, nr=0;
319 nr = ( lo + hi ) / 2;
320 if (ID_BLOCK_ID(b, nr) == id)
322 if (ID_BLOCK_ID(b, nr) > id)
330 /* split the block at id
331 * locate ID greater than or equal to id.
343 /* find where to split the block */
344 nr = idl_find(b, id);
345 if ( ID_BLOCK_ID(b,nr) < id )
348 nl = ID_BLOCK_NIDS(b) - nr;
350 *right = idl_alloc( nr == 0 ? 1 : nr );
351 *left = idl_alloc( nl + (nr == 0 ? 0 : 1));
354 * everything before the id being inserted in the first block
355 * unless there is nothing, in which case the id being inserted
359 ID_BLOCK_NIDS(*right) = 1;
360 ID_BLOCK_ID(*right, 0) = id;
363 (char *) &ID_BLOCK_ID(*right, 0),
364 (char *) &ID_BLOCK_ID(b, 0),
366 ID_BLOCK_NIDS(*right) = nr;
367 ID_BLOCK_ID(*left, 0) = id;
370 /* the id being inserted & everything after in the second block */
372 (char *) &ID_BLOCK_ID(*left, (nr == 0 ? 0 : 1)),
373 (char *) &ID_BLOCK_ID(b, nr),
375 ID_BLOCK_NIDS(*left) = nl + (nr == 0 ? 0 : 1);
377 #ifdef LDBM_DEBUG_IDL
385 * idl_change_first - called when an indirect block's first key has
386 * changed, meaning it needs to be stored under a new key, and the
387 * header block pointing to it needs updating.
393 Datum hkey, /* header block key */
394 ID_BLOCK *h, /* header block */
395 int pos, /* pos in h to update */
396 Datum bkey, /* data block key */
397 ID_BLOCK *b /* data block */
402 /* Debug( LDAP_DEBUG_TRACE, "=> idl_change_first\n", 0, 0, 0 ); */
404 /* delete old key block */
405 if ( (rc = ldbm_cache_delete( db, bkey )) != 0 ) {
406 Debug( LDAP_DEBUG_ANY,
407 "idl_change_first: ldbm_cache_delete returned %d\n",
413 /* write block with new key */
414 cont_id( &bkey, ID_BLOCK_ID(b, 0) );
416 if ( (rc = idl_store( be, db, bkey, b )) != 0 ) {
417 Debug( LDAP_DEBUG_ANY,
418 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
423 /* update + write indirect header block */
424 ID_BLOCK_ID(h, pos) = ID_BLOCK_ID(b, 0);
425 if ( (rc = idl_store( be, db, hkey, h )) != 0 ) {
426 Debug( LDAP_DEBUG_ANY,
427 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
444 int i, j, first, rc = 0;
445 ID_BLOCK *idl, *tmp, *tmp2, *tmp3;
448 if ( (idl = idl_fetch_one( be, db, key )) == NULL ) {
449 idl = idl_alloc( 1 );
450 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)++) = id;
451 rc = idl_store( be, db, key, idl );
457 if ( ID_BLOCK_ALLIDS( idl ) ) {
463 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
465 switch ( idl_insert( &idl, id, db->dbc_maxids ) ) {
466 case 0: /* id inserted - store the updated block */
468 rc = idl_store( be, db, key, idl );
471 case 2: /* id already there - nothing to do */
475 case 3: /* id not inserted - block must be split */
476 /* check threshold for marking this an all-id block */
477 if ( db->dbc_maxindirect < 2 ) {
479 idl = idl_allids( be );
480 rc = idl_store( be, db, key, idl );
484 idl_split_block( idl, id, &tmp, &tmp2 );
487 /* create the header indirect block */
488 #ifndef USE_INDIRECT_NIDS
489 idl = idl_alloc( 3 );
490 ID_BLOCK_NMAX(idl) = 3;
491 ID_BLOCK_NIDS(idl) = ID_BLOCK_INDIRECT_VALUE;
492 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
493 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
494 ID_BLOCK_ID(idl, 2) = NOID;
496 idl = idl_alloc( 2 );
497 ID_BLOCK_NMAX(idl) = 2 | ID_BLOCK_INDIRECT_VALUE;
498 ID_BLOCK_NIDS(idl) = 2;
499 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
500 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
504 rc = idl_store( be, db, key, idl );
506 cont_alloc( &k2, &key );
507 cont_id( &k2, ID_BLOCK_ID(tmp, 0) );
509 rc = idl_store( be, db, k2, tmp );
511 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
512 rc = idl_store( be, db, k2, tmp2 );
526 * this is an indirect block which points to other blocks.
527 * we need to read in the block into which the id should be
528 * inserted, then insert the id and store the block. we might
529 * have to split the block if it is full, which means we also
530 * need to write a new "header" block.
533 #ifndef USE_INDIRECT_NIDS
534 /* select the block to try inserting into *//* XXX linear search XXX */
535 for ( i = 0; !ID_BLOCK_NOID(idl, i) && id >= ID_BLOCK_ID(idl, i); i++ )
538 i = idl_find(idl, id);
539 if (ID_BLOCK_ID(idl, i) <= id)
549 /* At this point, the following condition must be true:
550 * ID_BLOCK_ID(idl, i) <= id && id < ID_BLOCK_ID(idl, i+1)
551 * except when i is the first or the last block.
555 cont_alloc( &k2, &key );
556 cont_id( &k2, ID_BLOCK_ID(idl, i) );
558 if ( (tmp = idl_fetch_one( be, db, k2 )) == NULL ) {
559 Debug( LDAP_DEBUG_ANY, "idl_insert_key: nonexistent continuation block\n",
568 switch ( idl_insert( &tmp, id, db->dbc_maxids ) ) {
569 case 0: /* id inserted ok */
570 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
571 Debug( LDAP_DEBUG_ANY,
572 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
577 case 1: /* id inserted - first id in block has changed */
579 * key for this block has changed, so we have to
580 * write the block under the new key, delete the
581 * old key block + update and write the indirect
585 rc = idl_change_first( be, db, key, idl, i, k2, tmp );
588 case 2: /* id not inserted - already there, do nothing */
592 case 3: /* id not inserted - block is full */
594 * first, see if it will fit in the next block,
595 * without splitting, unless we're trying to insert
596 * into the beginning of the first block.
599 #ifndef USE_INDIRECT_NIDS
600 /* is there a next block? */
601 if ( !first && !ID_BLOCK_NOID(idl, i + 1) ) {
603 if ( !first && (unsigned long)(i + 1) < ID_BLOCK_NIDS(idl) ) {
607 cont_alloc( &k3, &key );
608 cont_id( &k3, ID_BLOCK_ID(idl, i + 1) );
609 if ( (tmp2 = idl_fetch_one( be, db, k3 )) == NULL ) {
610 Debug( LDAP_DEBUG_ANY,
611 "idl_insert_key: idl_fetch_one returned NULL\n",
614 /* split the original block */
619 /* If the new id is less than the last id in the
620 * current block, it must not be put into the next
621 * block. Push the last id of the current block
622 * into the next block instead.
624 if (id < ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1)) {
625 ID id2 = ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1);
627 --ID_BLOCK_NIDS(tmp);
628 /* This must succeed since we just popped one
629 * ID off the end of it.
631 rc = idl_insert( &tmp, id, db->dbc_maxids );
633 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
634 Debug( LDAP_DEBUG_ANY,
635 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
640 /* This new id will necessarily be inserted
641 * as the first id of the next block by the
642 * following switch() statement.
646 switch ( (rc = idl_insert( &tmp2, id,
647 db->dbc_maxids )) ) {
648 case 1: /* id inserted first in block */
649 rc = idl_change_first( be, db, key, idl,
653 case 2: /* id already there - how? */
654 case 0: /* id inserted: this can never be
655 * the result of idl_insert, because
656 * we guaranteed that idl_change_first
657 * will always be called.
660 Debug( LDAP_DEBUG_ANY,
661 "idl_insert_key: id %ld already in next block\n",
673 case 3: /* split the original block */
683 * must split the block, write both new blocks + update
684 * and write the indirect header block.
687 rc = 0; /* optimistic */
690 #ifndef USE_INDIRECT_NIDS
691 /* count how many indirect blocks *//* XXX linear count XXX */
692 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
695 j = ID_BLOCK_NIDS(idl);
698 /* check it against all-id thresholed */
699 if ( j + 1 > db->dbc_maxindirect ) {
701 * we've passed the all-id threshold, meaning
702 * that this set of blocks should be replaced
703 * by a single "all-id" block. our job: delete
704 * all the indirect blocks, and replace the header
705 * block by an all-id block.
708 /* delete all indirect blocks */
709 #ifndef USE_INDIRECT_NIDS
710 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ ) {
712 for ( j = 0; (unsigned long) j < ID_BLOCK_NIDS(idl); j++ ) {
714 cont_id( &k2, ID_BLOCK_ID(idl, j) );
716 rc = ldbm_cache_delete( db, k2 );
719 /* store allid block in place of header block */
721 idl = idl_allids( be );
722 rc = idl_store( be, db, key, idl );
730 idl_split_block( tmp, id, &tmp2, &tmp3 );
733 /* create a new updated indirect header block */
734 tmp = idl_alloc( ID_BLOCK_NMAXN(idl) + 1 );
735 #ifndef USE_INDIRECT_NIDS
736 ID_BLOCK_NIDS(tmp) = ID_BLOCK_INDIRECT_VALUE;
738 ID_BLOCK_NMAX(tmp) |= ID_BLOCK_INDIRECT_VALUE;
740 /* everything up to the split block */
742 (char *) &ID_BLOCK_ID(tmp, 0),
743 (char *) &ID_BLOCK_ID(idl, 0),
745 /* the two new blocks */
746 ID_BLOCK_ID(tmp, i) = ID_BLOCK_ID(tmp2, 0);
747 ID_BLOCK_ID(tmp, i + 1) = ID_BLOCK_ID(tmp3, 0);
748 /* everything after the split block */
749 #ifndef USE_INDIRECT_NIDS
751 (char *) &ID_BLOCK_ID(tmp, i + 2),
752 (char *) &ID_BLOCK_ID(idl, i + 1),
753 (ID_BLOCK_NMAXN(idl) - i - 1) * sizeof(ID) );
756 (char *) &ID_BLOCK_ID(tmp, i + 2),
757 (char *) &ID_BLOCK_ID(idl, i + 1),
758 (ID_BLOCK_NIDS(idl) - i - 1) * sizeof(ID) );
759 ID_BLOCK_NIDS(tmp) = ID_BLOCK_NIDS(idl) + 1;
762 /* store the header block */
763 rc = idl_store( be, db, key, tmp );
765 /* store the first id block */
766 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
767 rc = idl_store( be, db, k2, tmp2 );
769 /* store the second id block */
770 cont_id( &k2, ID_BLOCK_ID(tmp3, 0) );
771 rc = idl_store( be, db, k2, tmp3 );
786 * idl_insert - insert an id into an id list.
790 * 1 id inserted, first id in block has changed
791 * 2 id not inserted, already there
792 * 3 id not inserted, block must be split
795 idl_insert( ID_BLOCK **idl, ID id, unsigned int maxids )
799 if ( ID_BLOCK_ALLIDS( *idl ) ) {
800 return( 2 ); /* already there */
803 /* is it already there? */
804 i = idl_find(*idl, id);
805 if ( ID_BLOCK_ID(*idl, i) == id ) {
806 return( 2 ); /* already there */
808 if ( ID_BLOCK_NIDS(*idl) && ID_BLOCK_ID(*idl, i) < id )
811 /* do we need to make room for it? */
812 if ( ID_BLOCK_NIDS(*idl) == ID_BLOCK_NMAXN(*idl) ) {
813 /* make room or indicate block needs splitting */
814 if ( ID_BLOCK_NMAXN(*idl) >= maxids ) {
815 return( 3 ); /* block needs splitting */
818 ID_BLOCK_NMAX(*idl) *= 2;
819 if ( ID_BLOCK_NMAXN(*idl) > maxids ) {
820 ID_BLOCK_NMAX(*idl) = maxids;
822 *idl = (ID_BLOCK *) ch_realloc( (char *) *idl,
823 (ID_BLOCK_NMAXN(*idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
826 /* make a slot for the new id */
827 AC_MEMCPY( &ID_BLOCK_ID(*idl, i+1), &ID_BLOCK_ID(*idl, i),
828 (ID_BLOCK_NIDS(*idl) - i) * sizeof(ID) );
830 ID_BLOCK_ID(*idl, i) = id;
831 ID_BLOCK_NIDS(*idl)++;
833 (char *) &ID_BLOCK_ID((*idl), ID_BLOCK_NIDS(*idl)),
835 (ID_BLOCK_NMAXN(*idl) - ID_BLOCK_NIDS(*idl)) * sizeof(ID) );
837 #ifdef LDBM_DEBUG_IDL
841 return( i == 0 ? 1 : 0 ); /* inserted - first id changed or not */
858 if ( (idl = idl_fetch_one( be, db, key ) ) == NULL )
860 /* It wasn't found. Hmm... */
864 if ( ID_BLOCK_ALLIDS( idl ) ) {
869 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
870 i = idl_find(idl, id);
871 if ( ID_BLOCK_ID(idl, i) == id ) {
872 if( --ID_BLOCK_NIDS(idl) == 0 ) {
873 ldbm_cache_delete( db, key );
877 &ID_BLOCK_ID(idl, i),
878 &ID_BLOCK_ID(idl, i+1),
879 (ID_BLOCK_NIDS(idl)-i) * sizeof(ID) );
881 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)) = NOID;
883 idl_store( be, db, key, idl );
889 /* We didn't find the ID. Hmmm... */
894 /* We have to go through an indirect block and find the ID
897 cont_alloc( &data, &key );
898 #ifndef USE_INDIRECT_NIDS
899 for ( nids = 0; !ID_BLOCK_NOID(idl, nids); nids++ ) {
903 for ( j = 0; j<nids; j++ )
905 nids = ID_BLOCK_NIDS(idl);
906 j = idl_find(idl, id);
907 if ( ID_BLOCK_ID(idl, j) > id ) j--;
908 for (; j>=0; j = -1 ) /* execute once */
912 cont_id( &data, ID_BLOCK_ID(idl, j) );
914 if ( (tmp = idl_fetch_one( be, db, data )) == NULL ) {
915 Debug( LDAP_DEBUG_ANY,
916 "idl_delete_key: idl_fetch of returned NULL\n", 0, 0, 0 );
921 Now try to find the ID in tmp
924 i = idl_find(tmp, id);
925 if ( ID_BLOCK_ID(tmp, i) == id )
928 &ID_BLOCK_ID(tmp, i),
929 &ID_BLOCK_ID(tmp, i+1),
930 (ID_BLOCK_NIDS(tmp)-(i+1)) * sizeof(ID));
931 ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp)-1 ) = NOID;
932 ID_BLOCK_NIDS(tmp)--;
934 if ( ID_BLOCK_NIDS(tmp) ) {
935 idl_store ( be, db, data, tmp );
938 ldbm_cache_delete( db, data );
940 &ID_BLOCK_ID(idl, j),
941 &ID_BLOCK_ID(idl, j+1),
942 (nids-(j+1)) * sizeof(ID));
943 ID_BLOCK_ID(idl, nids-1) = NOID;
945 #ifdef USE_INDIRECT_NIDS
946 ID_BLOCK_NIDS(idl)--;
949 ldbm_cache_delete( db, key );
951 idl_store( be, db, key, idl );
967 /* return a duplicate of a single ID_BLOCK */
969 idl_dup( ID_BLOCK *idl )
977 new = idl_alloc( ID_BLOCK_NMAXN(idl) );
982 (ID_BLOCK_NMAXN(idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
984 #ifdef LDBM_DEBUG_IDL
992 /* return the smaller ID_BLOCK */
994 idl_min( ID_BLOCK *a, ID_BLOCK *b )
996 return( ID_BLOCK_NIDS(a) > ID_BLOCK_NIDS(b) ? b : a );
1001 * idl_intersection - return a intersection b
1010 unsigned int ai, bi, ni;
1013 if ( a == NULL || b == NULL ) {
1016 if ( ID_BLOCK_ALLIDS( a ) ) {
1017 return( idl_dup( b ) );
1019 if ( ID_BLOCK_ALLIDS( b ) ) {
1020 return( idl_dup( a ) );
1022 if ( ID_BLOCK_NIDS(a) == 0 || ID_BLOCK_NIDS(b) == 0 ) {
1026 n = idl_dup( idl_min( a, b ) );
1028 #ifdef LDBM_DEBUG_IDL
1033 for ( ni = 0, ai = 0, bi = 0; ; ) {
1034 if ( ID_BLOCK_ID(b, bi) == ID_BLOCK_ID(a, ai) ) {
1035 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1038 if ( ai >= ID_BLOCK_NIDS(a) || bi >= ID_BLOCK_NIDS(b) )
1040 } else if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
1042 if ( ai >= ID_BLOCK_NIDS(a) )
1046 if ( bi >= ID_BLOCK_NIDS(b) )
1055 ID_BLOCK_NIDS(n) = ni;
1057 #ifdef LDBM_DEBUG_IDL
1066 * idl_union - return a union b
1075 unsigned int ai, bi, ni;
1079 return( idl_dup( b ) );
1082 return( idl_dup( a ) );
1084 if ( ID_BLOCK_ALLIDS( a ) || ID_BLOCK_ALLIDS( b ) ) {
1085 return( idl_allids( be ) );
1088 #ifdef LDBM_DEBUG_IDL
1093 if ( ID_BLOCK_NIDS(b) < ID_BLOCK_NIDS(a) ) {
1099 n = idl_alloc( ID_BLOCK_NIDS(a) + ID_BLOCK_NIDS(b) );
1101 for ( ni = 0, ai = 0, bi = 0;
1102 ai < ID_BLOCK_NIDS(a) && bi < ID_BLOCK_NIDS(b);
1105 if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
1106 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai++);
1108 } else if ( ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai) ) {
1109 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi++);
1112 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1117 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1118 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1120 for ( ; bi < ID_BLOCK_NIDS(b); bi++ ) {
1121 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi);
1123 ID_BLOCK_NIDS(n) = ni;
1125 #ifdef LDBM_DEBUG_IDL
1134 * idl_notin - return a intersection ~b (or a minus b)
1143 unsigned int ni, ai, bi;
1149 if ( b == NULL || ID_BLOCK_ALLIDS( b )) {
1150 return( idl_dup( a ) );
1153 if ( ID_BLOCK_ALLIDS( a ) ) {
1154 n = idl_alloc( SLAPD_LDBM_MIN_MAXIDS );
1157 for ( ai = 1, bi = 0;
1158 ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAXN(n) && bi < ID_BLOCK_NMAXN(b);
1161 if ( ID_BLOCK_ID(b, bi) == ai ) {
1164 ID_BLOCK_ID(n, ni++) = ai;
1168 for ( ; ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAXN(n); ai++ ) {
1169 ID_BLOCK_ID(n, ni++) = ai;
1172 if ( ni == ID_BLOCK_NMAXN(n) ) {
1174 return( idl_allids( be ) );
1176 ID_BLOCK_NIDS(n) = ni;
1184 for ( ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
1186 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
1192 if ( bi == ID_BLOCK_NIDS(b) ) {
1196 if ( ID_BLOCK_ID(b, bi) != ID_BLOCK_ID(a, ai) ) {
1197 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1201 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1202 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1204 ID_BLOCK_NIDS(n) = ni;
1206 #ifdef LDBM_DEBUG_IDL
1213 /* return the first ID in the block
1216 * otherwise return NOID
1217 * otherwise return first ID
1219 * cursor is set to 1
1222 idl_firstid( ID_BLOCK *idl, ID *cursor )
1226 if ( idl == NULL || ID_BLOCK_NIDS(idl) == 0 ) {
1230 if ( ID_BLOCK_ALLIDS( idl ) ) {
1231 return( ID_BLOCK_NIDS(idl) > 1 ? 1 : NOID );
1234 return( ID_BLOCK_ID(idl, 0) );
1238 * if ALLIDS block, cursor is id.
1240 * if id < NIDS return id
1242 * otherwise cursor is index into block
1244 * return id at index then increment
1247 idl_nextid( ID_BLOCK *idl, ID *cursor )
1249 if ( ID_BLOCK_ALLIDS( idl ) ) {
1250 if( ++(*cursor) < ID_BLOCK_NIDS(idl) ) {
1257 if ( *cursor < ID_BLOCK_NIDS(idl) ) {
1258 return( ID_BLOCK_ID(idl, (*cursor)++) );