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_INDIRECT(idl) || ID_BLOCK_ALLIDS(idl)
55 || ID_BLOCK_NIDS(idl) <= 1 )
60 for( last = ID_BLOCK_ID(idl, 0), i = 1;
61 i < ID_BLOCK_NIDS(idl);
62 last = ID_BLOCK_ID(idl, i), i++ )
64 assert (last < ID_BLOCK_ID(idl, i) );
69 /* Allocate an ID_BLOCK with room for nids ids */
71 idl_alloc( unsigned int nids )
75 /* nmax + nids + space for the ids */
76 new = (ID_BLOCK *) ch_calloc( (ID_BLOCK_IDS_OFFSET + nids), sizeof(ID) );
77 ID_BLOCK_NMAX(new) = nids;
78 ID_BLOCK_NIDS(new) = 0;
84 /* Allocate an empty ALLIDS ID_BLOCK */
86 idl_allids( Backend *be )
92 ID_BLOCK_NMAX(idl) = ID_BLOCK_ALLIDS_VALUE;
93 if ( next_id_get( be, &id ) ) {
96 ID_BLOCK_NIDS(idl) = id;
101 /* Free an ID_BLOCK */
103 idl_free( ID_BLOCK *idl )
107 LDAP_LOG( INDEX, INFO, "idl_free: called with NULL pointer\n" , 0,0,0);
109 Debug( LDAP_DEBUG_TRACE,
110 "idl_free: called with NULL pointer\n",
117 free( (char *) idl );
121 /* Fetch an single ID_BLOCK from the cache */
132 /* Debug( LDAP_DEBUG_TRACE, "=> idl_fetch_one\n", 0, 0, 0 ); */
134 data = ldbm_cache_fetch( db, key );
136 if( data.dptr == NULL ) {
140 idl = (ID_BLOCK *) data.dptr;
141 if ( ID_BLOCK_ALLIDS(idl) ) {
142 /* make sure we have the current value of highest id */
143 idl = idl_allids( be );
145 idl = idl_dup((ID_BLOCK *) data.dptr);
148 ldbm_datum_free( db->dbc_db, data );
154 /* Fetch a set of ID_BLOCKs from the cache
156 * if block return is an ALLIDS block,
157 * return an new ALLIDS block
160 * construct super block from all blocks referenced by INDIRECT block
176 idl = idl_fetch_one( be, db, key );
182 if ( ID_BLOCK_ALLIDS(idl) ) {
187 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
193 * this is an indirect block which points to other blocks.
194 * we need to read in all the blocks it points to and construct
195 * a big id list containing all the ids, which we will return.
198 #ifndef USE_INDIRECT_NIDS
199 /* count the number of blocks & allocate space for pointers to them */
200 for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ )
203 i = ID_BLOCK_NIDS(idl);
205 tmp = (ID_BLOCK **) ch_malloc( (i + 1) * sizeof(ID_BLOCK *) );
207 /* read in all the blocks */
208 cont_alloc( &data, &key );
210 #ifndef USE_INDIRECT_NIDS
211 for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ ) {
213 for ( i = 0; i < ID_BLOCK_NIDS(idl); i++ ) {
215 cont_id( &data, ID_BLOCK_ID(idl, i) );
217 if ( (tmp[i] = idl_fetch_one( be, db, data )) == NULL ) {
219 LDAP_LOG( INDEX, INFO,
220 "idl_fetch: idl_fetch_one returned NULL\n", 0,0,0 );
222 Debug( LDAP_DEBUG_ANY,
223 "idl_fetch: one returned NULL\n", 0, 0, 0 );
229 nids += ID_BLOCK_NIDS(tmp[i]);
235 /* allocate space for the big block */
236 idl = idl_alloc( nids );
237 ID_BLOCK_NIDS(idl) = nids;
240 /* copy in all the ids from the component blocks */
241 for ( i = 0; tmp[i] != NULL; i++ ) {
242 if ( tmp[i] == NULL ) {
247 (char *) &ID_BLOCK_ID(idl, nids),
248 (char *) &ID_BLOCK_ID(tmp[i], 0),
249 ID_BLOCK_NIDS(tmp[i]) * sizeof(ID) );
250 nids += ID_BLOCK_NIDS(tmp[i]);
254 free( (char *) tmp );
256 #ifdef LDBM_DEBUG_IDL
261 LDAP_LOG( INDEX, ENTRY,
262 "idl_fetch: %ld ids (%ld max)\n",
263 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAXN(idl), 0 );
265 Debug( LDAP_DEBUG_TRACE, "<= idl_fetch %ld ids (%ld max)\n",
266 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAXN(idl), 0 );
273 /* store a single block */
285 #ifdef LDBM_DEBUG_IDL
289 ldbm_datum_init( data );
291 /* Debug( LDAP_DEBUG_TRACE, "=> idl_store\n", 0, 0, 0 ); */
293 data.dptr = (char *) idl;
294 data.dsize = (ID_BLOCK_IDS_OFFSET + ID_BLOCK_NMAXN(idl)) * sizeof(ID);
296 flags = LDBM_REPLACE;
297 rc = ldbm_cache_store( db, key, data, flags );
300 Statslog( LDAP_DEBUG_STATS, "<= idl_store(): rc=%d\n",
304 /* Debug( LDAP_DEBUG_TRACE, "<= idl_store %d\n", rc, 0, 0 ); */
308 /* Binary search for id in block, return index
309 * an index is always returned, even with no match. If no
310 * match, the returned index is the insertion point.
318 int lo=0, hi=ID_BLOCK_NIDS(b)-1, nr=0;
322 nr = ( lo + hi ) / 2;
323 if (ID_BLOCK_ID(b, nr) == id)
325 if (ID_BLOCK_ID(b, nr) > id)
333 /* split the block at id
334 * locate ID greater than or equal to id.
346 /* find where to split the block */
347 nr = idl_find(b, id);
348 if ( ID_BLOCK_ID(b,nr) < id )
351 nl = ID_BLOCK_NIDS(b) - nr;
353 *right = idl_alloc( nr == 0 ? 1 : nr );
354 *left = idl_alloc( nl + (nr == 0 ? 0 : 1));
357 * everything before the id being inserted in the first block
358 * unless there is nothing, in which case the id being inserted
362 ID_BLOCK_NIDS(*right) = 1;
363 ID_BLOCK_ID(*right, 0) = id;
366 (char *) &ID_BLOCK_ID(*right, 0),
367 (char *) &ID_BLOCK_ID(b, 0),
369 ID_BLOCK_NIDS(*right) = nr;
370 ID_BLOCK_ID(*left, 0) = id;
373 /* the id being inserted & everything after in the second block */
375 (char *) &ID_BLOCK_ID(*left, (nr == 0 ? 0 : 1)),
376 (char *) &ID_BLOCK_ID(b, nr),
378 ID_BLOCK_NIDS(*left) = nl + (nr == 0 ? 0 : 1);
380 #ifdef LDBM_DEBUG_IDL
388 * idl_change_first - called when an indirect block's first key has
389 * changed, meaning it needs to be stored under a new key, and the
390 * header block pointing to it needs updating.
396 Datum hkey, /* header block key */
397 ID_BLOCK *h, /* header block */
398 int pos, /* pos in h to update */
399 Datum bkey, /* data block key */
400 ID_BLOCK *b /* data block */
405 /* Debug( LDAP_DEBUG_TRACE, "=> idl_change_first\n", 0, 0, 0 ); */
407 /* delete old key block */
408 if ( (rc = ldbm_cache_delete( db, bkey )) != 0 ) {
410 LDAP_LOG( INDEX, INFO,
411 "idl_change_first: ldbm_cache_delete returned %d\n", rc, 0, 0 );
413 Debug( LDAP_DEBUG_ANY,
414 "idl_change_first: ldbm_cache_delete returned %d\n",
421 /* write block with new key */
422 cont_id( &bkey, ID_BLOCK_ID(b, 0) );
424 if ( (rc = idl_store( be, db, bkey, b )) != 0 ) {
426 LDAP_LOG( INDEX, INFO,
427 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
429 Debug( LDAP_DEBUG_ANY,
430 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
436 /* update + write indirect header block */
437 ID_BLOCK_ID(h, pos) = ID_BLOCK_ID(b, 0);
438 if ( (rc = idl_store( be, db, hkey, h )) != 0 ) {
440 LDAP_LOG( INDEX, INFO,
441 "idl_change_first: idl_store returned %s\n", rc, 0, 0 );
443 Debug( LDAP_DEBUG_ANY,
444 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
462 int i, j, first, rc = 0;
463 ID_BLOCK *idl, *tmp, *tmp2, *tmp3;
466 if ( (idl = idl_fetch_one( be, db, key )) == NULL ) {
467 idl = idl_alloc( 1 );
468 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)++) = id;
469 rc = idl_store( be, db, key, idl );
475 if ( ID_BLOCK_ALLIDS( idl ) ) {
481 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
483 switch ( idl_insert( &idl, id, db->dbc_maxids ) ) {
484 case 0: /* id inserted - store the updated block */
486 rc = idl_store( be, db, key, idl );
489 case 2: /* id already there - nothing to do */
493 case 3: /* id not inserted - block must be split */
494 /* check threshold for marking this an all-id block */
495 if ( db->dbc_maxindirect < 2 ) {
497 idl = idl_allids( be );
498 rc = idl_store( be, db, key, idl );
502 idl_split_block( idl, id, &tmp, &tmp2 );
505 /* create the header indirect block */
506 #ifndef USE_INDIRECT_NIDS
507 idl = idl_alloc( 3 );
508 ID_BLOCK_NMAX(idl) = 3;
509 ID_BLOCK_NIDS(idl) = ID_BLOCK_INDIRECT_VALUE;
510 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
511 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
512 ID_BLOCK_ID(idl, 2) = NOID;
514 idl = idl_alloc( 2 );
515 ID_BLOCK_NMAX(idl) = 2 | ID_BLOCK_INDIRECT_VALUE;
516 ID_BLOCK_NIDS(idl) = 2;
517 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
518 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
522 rc = idl_store( be, db, key, idl );
524 cont_alloc( &k2, &key );
525 cont_id( &k2, ID_BLOCK_ID(tmp, 0) );
527 rc = idl_store( be, db, k2, tmp );
529 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
530 rc = idl_store( be, db, k2, tmp2 );
544 * this is an indirect block which points to other blocks.
545 * we need to read in the block into which the id should be
546 * inserted, then insert the id and store the block. we might
547 * have to split the block if it is full, which means we also
548 * need to write a new "header" block.
551 #ifndef USE_INDIRECT_NIDS
552 /* select the block to try inserting into *//* XXX linear search XXX */
553 for ( i = 0; !ID_BLOCK_NOID(idl, i) && id > ID_BLOCK_ID(idl, i); i++ )
556 i = idl_find(idl, id);
557 if (ID_BLOCK_ID(idl, i) < id)
569 cont_alloc( &k2, &key );
570 cont_id( &k2, ID_BLOCK_ID(idl, i) );
572 if ( (tmp = idl_fetch_one( be, db, k2 )) == NULL ) {
574 LDAP_LOG( INDEX, ERR,
575 "idl_insert_key: nonexistent continuation block\n", 0, 0, 0 );
577 Debug( LDAP_DEBUG_ANY, "idl_insert_key: nonexistent continuation block\n",
587 switch ( idl_insert( &tmp, id, db->dbc_maxids ) ) {
588 case 0: /* id inserted ok */
589 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
591 LDAP_LOG( INDEX, ERR,
592 "ids_insert_key: idl_store returned %d\n", rc, 0, 0 );
594 Debug( LDAP_DEBUG_ANY,
595 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
601 case 1: /* id inserted - first id in block has changed */
603 * key for this block has changed, so we have to
604 * write the block under the new key, delete the
605 * old key block + update and write the indirect
609 rc = idl_change_first( be, db, key, idl, i, k2, tmp );
612 case 2: /* id not inserted - already there, do nothing */
616 case 3: /* id not inserted - block is full */
618 * first, see if it will fit in the next block,
619 * without splitting, unless we're trying to insert
620 * into the beginning of the first block.
623 #ifndef USE_INDIRECT_NIDS
624 /* is there a next block? */
625 if ( !first && !ID_BLOCK_NOID(idl, i + 1) ) {
627 if ( !first && (unsigned long)(i + 1) < ID_BLOCK_NIDS(idl) ) {
630 cont_alloc( &k2, &key );
631 cont_id( &k2, ID_BLOCK_ID(idl, i) );
632 if ( (tmp2 = idl_fetch_one( be, db, k2 )) == NULL ) {
634 LDAP_LOG( INDEX, ERR,
635 "idl_insert_key: idl_fetch_one returned NULL\n", 0, 0, 0);
637 Debug( LDAP_DEBUG_ANY,
638 "idl_insert_key: idl_fetch_one returned NULL\n",
642 /* split the original block */
647 /* If the new id is less than the last id in the
648 * current block, it must not be put into the next
649 * block. Push the last id of the current block
650 * into the next block instead.
652 if (id < ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1)) {
653 ID id2 = ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1);
655 --ID_BLOCK_NIDS(tmp);
656 /* This must succeed since we just popped one
657 * ID off the end of it.
659 rc = idl_insert( &tmp, id, db->dbc_maxids );
661 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
663 LDAP_LOG( INDEX, ERR,
664 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
666 Debug( LDAP_DEBUG_ANY,
667 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
673 /* This new id will necessarily be inserted
674 * as the first id of the next block by the
675 * following switch() statement.
679 switch ( (rc = idl_insert( &tmp2, id,
680 db->dbc_maxids )) ) {
681 case 1: /* id inserted first in block */
682 rc = idl_change_first( be, db, key, idl,
686 case 2: /* id already there - how? */
687 case 0: /* id inserted: this can never be
688 * the result of idl_insert, because
689 * we guaranteed that idl_change_first
690 * will always be called.
694 LDAP_LOG( INDEX, INFO,
695 "idl_insert_key: id %ld is already in next block\n",
698 Debug( LDAP_DEBUG_ANY,
699 "idl_insert_key: id %ld already in next block\n",
710 case 3: /* split the original block */
719 * must split the block, write both new blocks + update
720 * and write the indirect header block.
723 rc = 0; /* optimistic */
726 #ifndef USE_INDIRECT_NIDS
727 /* count how many indirect blocks *//* XXX linear count XXX */
728 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
731 j = ID_BLOCK_NIDS(idl);
734 /* check it against all-id thresholed */
735 if ( j + 1 > db->dbc_maxindirect ) {
737 * we've passed the all-id threshold, meaning
738 * that this set of blocks should be replaced
739 * by a single "all-id" block. our job: delete
740 * all the indirect blocks, and replace the header
741 * block by an all-id block.
744 /* delete all indirect blocks */
745 #ifndef USE_INDIRECT_NIDS
746 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ ) {
748 for ( j = 0; (unsigned long) j < ID_BLOCK_NIDS(idl); j++ ) {
750 cont_id( &k2, ID_BLOCK_ID(idl, j) );
752 rc = ldbm_cache_delete( db, k2 );
755 /* store allid block in place of header block */
757 idl = idl_allids( be );
758 rc = idl_store( be, db, key, idl );
766 idl_split_block( tmp, id, &tmp2, &tmp3 );
769 /* create a new updated indirect header block */
770 tmp = idl_alloc( ID_BLOCK_NMAXN(idl) + 1 );
771 #ifndef USE_INDIRECT_NIDS
772 ID_BLOCK_NIDS(tmp) = ID_BLOCK_INDIRECT_VALUE;
774 ID_BLOCK_NMAX(tmp) |= ID_BLOCK_INDIRECT_VALUE;
776 /* everything up to the split block */
778 (char *) &ID_BLOCK_ID(tmp, 0),
779 (char *) &ID_BLOCK_ID(idl, 0),
781 /* the two new blocks */
782 ID_BLOCK_ID(tmp, i) = ID_BLOCK_ID(tmp2, 0);
783 ID_BLOCK_ID(tmp, i + 1) = ID_BLOCK_ID(tmp3, 0);
784 /* everything after the split block */
785 #ifndef USE_INDIRECT_NIDS
787 (char *) &ID_BLOCK_ID(tmp, i + 2),
788 (char *) &ID_BLOCK_ID(idl, i + 1),
789 (ID_BLOCK_NMAXN(idl) - i - 1) * sizeof(ID) );
792 (char *) &ID_BLOCK_ID(tmp, i + 2),
793 (char *) &ID_BLOCK_ID(idl, i + 1),
794 (ID_BLOCK_NIDS(idl) - i - 1) * sizeof(ID) );
795 ID_BLOCK_NIDS(tmp) = ID_BLOCK_NIDS(idl) + 1;
798 /* store the header block */
799 rc = idl_store( be, db, key, tmp );
801 /* store the first id block */
802 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
803 rc = idl_store( be, db, k2, tmp2 );
805 /* store the second id block */
806 cont_id( &k2, ID_BLOCK_ID(tmp3, 0) );
807 rc = idl_store( be, db, k2, tmp3 );
822 * idl_insert - insert an id into an id list.
826 * 1 id inserted, first id in block has changed
827 * 2 id not inserted, already there
828 * 3 id not inserted, block must be split
831 idl_insert( ID_BLOCK **idl, ID id, unsigned int maxids )
835 if ( ID_BLOCK_ALLIDS( *idl ) ) {
836 return( 2 ); /* already there */
839 /* is it already there? */
840 i = idl_find(*idl, id);
841 if ( ID_BLOCK_ID(*idl, i) == id ) {
842 return( 2 ); /* already there */
844 if ( ID_BLOCK_NIDS(*idl) && ID_BLOCK_ID(*idl, i) < id )
847 /* do we need to make room for it? */
848 if ( ID_BLOCK_NIDS(*idl) == ID_BLOCK_NMAXN(*idl) ) {
849 /* make room or indicate block needs splitting */
850 if ( ID_BLOCK_NMAXN(*idl) >= maxids ) {
851 return( 3 ); /* block needs splitting */
854 ID_BLOCK_NMAX(*idl) *= 2;
855 if ( ID_BLOCK_NMAXN(*idl) > maxids ) {
856 ID_BLOCK_NMAX(*idl) = maxids;
858 *idl = (ID_BLOCK *) ch_realloc( (char *) *idl,
859 (ID_BLOCK_NMAXN(*idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
862 /* make a slot for the new id */
863 AC_MEMCPY( &ID_BLOCK_ID(*idl, i+1), &ID_BLOCK_ID(*idl, i),
864 (ID_BLOCK_NIDS(*idl) - i) * sizeof(ID) );
866 ID_BLOCK_ID(*idl, i) = id;
867 ID_BLOCK_NIDS(*idl)++;
869 (char *) &ID_BLOCK_ID((*idl), ID_BLOCK_NIDS(*idl)),
871 (ID_BLOCK_NMAXN(*idl) - ID_BLOCK_NIDS(*idl)) * sizeof(ID) );
873 #ifdef LDBM_DEBUG_IDL
877 return( i == 0 ? 1 : 0 ); /* inserted - first id changed or not */
894 if ( (idl = idl_fetch_one( be, db, key ) ) == NULL )
896 /* It wasn't found. Hmm... */
900 if ( ID_BLOCK_ALLIDS( idl ) ) {
905 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
906 i = idl_find(idl, id);
907 if ( ID_BLOCK_ID(idl, i) == id ) {
908 if( --ID_BLOCK_NIDS(idl) == 0 ) {
909 ldbm_cache_delete( db, key );
913 &ID_BLOCK_ID(idl, i),
914 &ID_BLOCK_ID(idl, i+1),
915 (ID_BLOCK_NIDS(idl)-i) * sizeof(ID) );
917 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)) = NOID;
919 idl_store( be, db, key, idl );
925 /* We didn't find the ID. Hmmm... */
930 /* We have to go through an indirect block and find the ID
933 cont_alloc( &data, &key );
934 #ifndef USE_INDIRECT_NIDS
935 for ( nids = 0; !ID_BLOCK_NOID(idl, nids); nids++ )
938 for ( j = 0; j<nids; j++ )
940 nids = ID_BLOCK_NIDS(idl);
941 for ( j = idl_find(idl, id); j >= 0; j = -1) /* execute once */
945 cont_id( &data, ID_BLOCK_ID(idl, j) );
947 if ( (tmp = idl_fetch_one( be, db, data )) == NULL ) {
949 LDAP_LOG( INDEX, INFO,
950 "idl_delete_key: idl_fetch_one returned NULL\n", 0, 0, 0 );
952 Debug( LDAP_DEBUG_ANY,
953 "idl_delete_key: idl_fetch of returned NULL\n", 0, 0, 0 );
959 Now try to find the ID in tmp
962 i = idl_find(tmp, id);
963 if ( ID_BLOCK_ID(tmp, i) == id )
966 &ID_BLOCK_ID(tmp, i),
967 &ID_BLOCK_ID(tmp, i+1),
968 (ID_BLOCK_NIDS(tmp)-(i+1)) * sizeof(ID));
969 ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp)-1 ) = NOID;
970 ID_BLOCK_NIDS(tmp)--;
972 if ( ID_BLOCK_NIDS(tmp) ) {
973 idl_store ( be, db, data, tmp );
976 ldbm_cache_delete( db, data );
978 &ID_BLOCK_ID(idl, j),
979 &ID_BLOCK_ID(idl, j+1),
980 (nids-(j+1)) * sizeof(ID));
981 ID_BLOCK_ID(idl, nids-1) = NOID;
983 #ifdef USE_INDIRECT_NIDS
984 ID_BLOCK_NIDS(idl)--;
987 ldbm_cache_delete( db, key );
989 idl_store( be, db, key, idl );
1005 /* return a duplicate of a single ID_BLOCK */
1007 idl_dup( ID_BLOCK *idl )
1011 if ( idl == NULL ) {
1015 new = idl_alloc( ID_BLOCK_NMAXN(idl) );
1020 (ID_BLOCK_NMAXN(idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
1022 #ifdef LDBM_DEBUG_IDL
1030 /* return the smaller ID_BLOCK */
1032 idl_min( ID_BLOCK *a, ID_BLOCK *b )
1034 return( ID_BLOCK_NIDS(a) > ID_BLOCK_NIDS(b) ? b : a );
1039 * idl_intersection - return a intersection b
1048 unsigned int ai, bi, ni;
1051 if ( a == NULL || b == NULL ) {
1054 if ( ID_BLOCK_ALLIDS( a ) ) {
1055 return( idl_dup( b ) );
1057 if ( ID_BLOCK_ALLIDS( b ) ) {
1058 return( idl_dup( a ) );
1060 if ( ID_BLOCK_NIDS(a) == 0 || ID_BLOCK_NIDS(b) == 0 ) {
1064 n = idl_dup( idl_min( a, b ) );
1066 #ifdef LDBM_DEBUG_IDL
1071 for ( ni = 0, ai = 0, bi = 0; ; ) {
1072 if ( ID_BLOCK_ID(b, bi) == ID_BLOCK_ID(a, ai) ) {
1073 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1076 if ( ai >= ID_BLOCK_NIDS(a) || bi >= ID_BLOCK_NIDS(b) )
1078 } else if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
1080 if ( ai >= ID_BLOCK_NIDS(a) )
1084 if ( bi >= ID_BLOCK_NIDS(b) )
1093 ID_BLOCK_NIDS(n) = ni;
1095 #ifdef LDBM_DEBUG_IDL
1104 * idl_union - return a union b
1113 unsigned int ai, bi, ni;
1117 return( idl_dup( b ) );
1120 return( idl_dup( a ) );
1122 if ( ID_BLOCK_ALLIDS( a ) || ID_BLOCK_ALLIDS( b ) ) {
1123 return( idl_allids( be ) );
1126 #ifdef LDBM_DEBUG_IDL
1131 if ( ID_BLOCK_NIDS(b) < ID_BLOCK_NIDS(a) ) {
1137 n = idl_alloc( ID_BLOCK_NIDS(a) + ID_BLOCK_NIDS(b) );
1139 for ( ni = 0, ai = 0, bi = 0;
1140 ai < ID_BLOCK_NIDS(a) && bi < ID_BLOCK_NIDS(b);
1143 if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
1144 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai++);
1146 } else if ( ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai) ) {
1147 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi++);
1150 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1155 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1156 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1158 for ( ; bi < ID_BLOCK_NIDS(b); bi++ ) {
1159 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi);
1161 ID_BLOCK_NIDS(n) = ni;
1163 #ifdef LDBM_DEBUG_IDL
1172 * idl_notin - return a intersection ~b (or a minus b)
1181 unsigned int ni, ai, bi;
1187 if ( b == NULL || ID_BLOCK_ALLIDS( b )) {
1188 return( idl_dup( a ) );
1191 if ( ID_BLOCK_ALLIDS( a ) ) {
1192 n = idl_alloc( SLAPD_LDBM_MIN_MAXIDS );
1195 for ( ai = 1, bi = 0;
1196 ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAXN(n) && bi < ID_BLOCK_NMAXN(b);
1199 if ( ID_BLOCK_ID(b, bi) == ai ) {
1202 ID_BLOCK_ID(n, ni++) = ai;
1206 for ( ; ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAXN(n); ai++ ) {
1207 ID_BLOCK_ID(n, ni++) = ai;
1210 if ( ni == ID_BLOCK_NMAXN(n) ) {
1212 return( idl_allids( be ) );
1214 ID_BLOCK_NIDS(n) = ni;
1222 for ( ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
1224 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
1230 if ( bi == ID_BLOCK_NIDS(b) ) {
1234 if ( ID_BLOCK_ID(b, bi) != ID_BLOCK_ID(a, ai) ) {
1235 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1239 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1240 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1242 ID_BLOCK_NIDS(n) = ni;
1244 #ifdef LDBM_DEBUG_IDL
1251 /* return the first ID in the block
1254 * otherwise return NOID
1255 * otherwise return first ID
1257 * cursor is set to 1
1260 idl_firstid( ID_BLOCK *idl, ID *cursor )
1264 if ( idl == NULL || ID_BLOCK_NIDS(idl) == 0 ) {
1268 if ( ID_BLOCK_ALLIDS( idl ) ) {
1269 return( ID_BLOCK_NIDS(idl) > 1 ? 1 : NOID );
1272 return( ID_BLOCK_ID(idl, 0) );
1276 * if ALLIDS block, cursor is id.
1278 * if id < NIDS return id
1280 * otherwise cursor is index into block
1282 * return id at index then increment
1285 idl_nextid( ID_BLOCK *idl, ID *cursor )
1287 if ( ID_BLOCK_ALLIDS( idl ) ) {
1288 if( ++(*cursor) < ID_BLOCK_NIDS(idl) ) {
1295 if ( *cursor < ID_BLOCK_NIDS(idl) ) {
1296 return( ID_BLOCK_ID(idl, (*cursor)++) );