1 /* idl.c - ldap id list handling routines */
4 * Copyright 1998-2000 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(( "cache", LDAP_LEVEL_INFO,
108 "idl_free: called with NULL pointer\n" ));
110 Debug( LDAP_DEBUG_TRACE,
111 "idl_free: called with NULL pointer\n",
118 free( (char *) idl );
122 /* Fetch an single ID_BLOCK from the cache */
133 /* Debug( LDAP_DEBUG_TRACE, "=> idl_fetch_one\n", 0, 0, 0 ); */
135 data = ldbm_cache_fetch( db, key );
137 if( data.dptr == NULL ) {
141 idl = idl_dup((ID_BLOCK *) data.dptr);
143 ldbm_datum_free( db->dbc_db, data );
149 /* Fetch a set of ID_BLOCKs from the cache
151 * if block return is an ALLIDS block,
152 * return an new ALLIDS block
155 * construct super block from all blocks referenced by INDIRECT block
170 idl = idl_fetch_one( be, db, key );
176 if ( ID_BLOCK_ALLIDS(idl) ) {
178 /* make sure we have the current value of highest id */
180 idl = idl_allids( be );
185 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
191 * this is an indirect block which points to other blocks.
192 * we need to read in all the blocks it points to and construct
193 * a big id list containing all the ids, which we will return.
196 /* count the number of blocks & allocate space for pointers to them */
197 for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ )
199 tmp = (ID_BLOCK **) ch_malloc( (i + 1) * sizeof(ID_BLOCK *) );
201 /* read in all the blocks */
202 cont_alloc( &data, &key );
204 for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ ) {
205 cont_id( &data, ID_BLOCK_ID(idl, i) );
207 if ( (tmp[i] = idl_fetch_one( be, db, data )) == NULL ) {
209 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
210 "idl_fetch: idl_fetch_one returned NULL\n" ));
212 Debug( LDAP_DEBUG_ANY,
213 "idl_fetch: one returned NULL\n", 0, 0, 0 );
219 nids += ID_BLOCK_NIDS(tmp[i]);
225 /* allocate space for the big block */
226 idl = idl_alloc( nids );
227 ID_BLOCK_NIDS(idl) = nids;
230 /* copy in all the ids from the component blocks */
231 for ( i = 0; tmp[i] != NULL; i++ ) {
232 if ( tmp[i] == NULL ) {
237 (char *) &ID_BLOCK_ID(idl, nids),
238 (char *) &ID_BLOCK_ID(tmp[i], 0),
239 ID_BLOCK_NIDS(tmp[i]) * sizeof(ID) );
240 nids += ID_BLOCK_NIDS(tmp[i]);
244 free( (char *) tmp );
246 #ifdef LDBM_DEBUG_IDL
251 LDAP_LOG(( "cache", LDAP_LEVEL_ENTRY,
252 "idl_fetch: %ld ids (%ld max)\n",
253 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAX(idl) ));
255 Debug( LDAP_DEBUG_TRACE, "<= idl_fetch %ld ids (%ld max)\n",
256 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAX(idl), 0 );
263 /* store a single block */
274 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
276 #ifdef LDBM_DEBUG_IDL
280 ldbm_datum_init( data );
282 /* Debug( LDAP_DEBUG_TRACE, "=> idl_store\n", 0, 0, 0 ); */
284 data.dptr = (char *) idl;
285 data.dsize = (ID_BLOCK_IDS_OFFSET + ID_BLOCK_NMAX(idl)) * sizeof(ID);
288 Statslog( LDAP_DEBUG_STATS, "<= idl_store(): rc=%d\n",
292 flags = LDBM_REPLACE;
293 rc = ldbm_cache_store( db, key, data, flags );
295 /* Debug( LDAP_DEBUG_TRACE, "<= idl_store %d\n", rc, 0, 0 ); */
299 /* split the block at id
300 * locate ID greater than or equal to id.
312 /* find where to split the block *//* XXX linear search XXX */
313 for ( nr = 0; nr < ID_BLOCK_NIDS(b) && id > ID_BLOCK_ID(b, nr); nr++ )
316 nl = ID_BLOCK_NIDS(b) - nr;
318 *right = idl_alloc( nr == 0 ? 1 : nr );
319 *left = idl_alloc( nl + (nr == 0 ? 0 : 1));
322 * everything before the id being inserted in the first block
323 * unless there is nothing, in which case the id being inserted
327 ID_BLOCK_NIDS(*right) = 1;
328 ID_BLOCK_ID(*right, 0) = id;
331 (char *) &ID_BLOCK_ID(*right, 0),
332 (char *) &ID_BLOCK_ID(b, 0),
334 ID_BLOCK_NIDS(*right) = nr;
335 ID_BLOCK_ID(*left, 0) = id;
338 /* the id being inserted & everything after in the second block */
340 (char *) &ID_BLOCK_ID(*left, (nr == 0 ? 0 : 1)),
341 (char *) &ID_BLOCK_ID(b, nr),
343 ID_BLOCK_NIDS(*left) = nl + (nr == 0 ? 0 : 1);
345 #ifdef LDBM_DEBUG_IDL
353 * idl_change_first - called when an indirect block's first key has
354 * changed, meaning it needs to be stored under a new key, and the
355 * header block pointing to it needs updating.
361 Datum hkey, /* header block key */
362 ID_BLOCK *h, /* header block */
363 int pos, /* pos in h to update */
364 Datum bkey, /* data block key */
365 ID_BLOCK *b /* data block */
370 /* Debug( LDAP_DEBUG_TRACE, "=> idl_change_first\n", 0, 0, 0 ); */
372 /* delete old key block */
373 if ( (rc = ldbm_cache_delete( db, bkey )) != 0 ) {
375 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
376 "idl_change_first: ldbm_cache_delete returned %d\n", rc ));
378 Debug( LDAP_DEBUG_ANY,
379 "idl_change_first: ldbm_cache_delete returned %d\n",
386 /* write block with new key */
387 cont_id( &bkey, ID_BLOCK_ID(b, 0) );
389 if ( (rc = idl_store( be, db, bkey, b )) != 0 ) {
391 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
392 "idl_change_first: idl_store returned %d\n", rc ));
394 Debug( LDAP_DEBUG_ANY,
395 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
401 /* update + write indirect header block */
402 ID_BLOCK_ID(h, pos) = ID_BLOCK_ID(b, 0);
403 if ( (rc = idl_store( be, db, hkey, h )) != 0 ) {
405 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
406 "idl_change_first: idl_store returned %s\n", rc ));
408 Debug( LDAP_DEBUG_ANY,
409 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
428 ID_BLOCK *idl, *tmp, *tmp2, *tmp3;
431 if ( (idl = idl_fetch_one( be, db, key )) == NULL ) {
432 idl = idl_alloc( 1 );
433 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)++) = id;
434 rc = idl_store( be, db, key, idl );
440 if ( ID_BLOCK_ALLIDS( idl ) ) {
446 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
448 switch ( idl_insert( &idl, id, db->dbc_maxids ) ) {
449 case 0: /* id inserted - store the updated block */
451 rc = idl_store( be, db, key, idl );
454 case 2: /* id already there - nothing to do */
458 case 3: /* id not inserted - block must be split */
459 /* check threshold for marking this an all-id block */
460 if ( db->dbc_maxindirect < 2 ) {
462 idl = idl_allids( be );
463 rc = idl_store( be, db, key, idl );
467 idl_split_block( idl, id, &tmp, &tmp2 );
470 /* create the header indirect block */
471 idl = idl_alloc( 3 );
472 ID_BLOCK_NMAX(idl) = 3;
473 ID_BLOCK_NIDS(idl) = ID_BLOCK_INDIRECT_VALUE;
474 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
475 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
476 ID_BLOCK_ID(idl, 2) = NOID;
479 rc = idl_store( be, db, key, idl );
481 cont_alloc( &k2, &key );
482 cont_id( &k2, ID_BLOCK_ID(tmp, 0) );
484 rc = idl_store( be, db, k2, tmp );
486 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
487 rc = idl_store( be, db, k2, tmp2 );
501 * this is an indirect block which points to other blocks.
502 * we need to read in the block into which the id should be
503 * inserted, then insert the id and store the block. we might
504 * have to split the block if it is full, which means we also
505 * need to write a new "header" block.
508 /* select the block to try inserting into *//* XXX linear search XXX */
509 for ( i = 0; !ID_BLOCK_NOID(idl, i) && id > ID_BLOCK_ID(idl, i); i++ )
520 cont_alloc( &k2, &key );
521 cont_id( &k2, ID_BLOCK_ID(idl, i) );
523 if ( (tmp = idl_fetch_one( be, db, k2 )) == NULL ) {
525 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
526 "idl_insert_key: nonexistent continuation block\n" ));
528 Debug( LDAP_DEBUG_ANY, "idl_insert_key: nonexistent continuation block\n",
538 switch ( idl_insert( &tmp, id, db->dbc_maxids ) ) {
539 case 0: /* id inserted ok */
540 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
542 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
543 "ids_insert_key: idl_store returned %d\n", rc ));
545 Debug( LDAP_DEBUG_ANY,
546 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
552 case 1: /* id inserted - first id in block has changed */
554 * key for this block has changed, so we have to
555 * write the block under the new key, delete the
556 * old key block + update and write the indirect
560 rc = idl_change_first( be, db, key, idl, i, k2, tmp );
563 case 2: /* id not inserted - already there, do nothing */
567 case 3: /* id not inserted - block is full */
569 * first, see if it will fit in the next block,
570 * without splitting, unless we're trying to insert
571 * into the beginning of the first block.
574 /* is there a next block? */
575 if ( !first && !ID_BLOCK_NOID(idl, i + 1) ) {
577 cont_alloc( &k2, &key );
578 cont_id( &k2, ID_BLOCK_ID(idl, i) );
579 if ( (tmp2 = idl_fetch_one( be, db, k2 )) == NULL ) {
581 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
582 "idl_insert_key: idl_fetch_one returned NULL\n"));
584 Debug( LDAP_DEBUG_ANY,
585 "idl_insert_key: idl_fetch_one returned NULL\n",
589 /* split the original block */
594 /* If the new id is less than the last id in the
595 * current block, it must not be put into the next
596 * block. Push the last id of the current block
597 * into the next block instead.
599 if (id < ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1)) {
600 ID id2 = ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1);
603 ldbm_datum_init( k3 );
605 --ID_BLOCK_NIDS(tmp);
606 /* This must succeed since we just popped one
607 * ID off the end of it.
609 rc = idl_insert( &tmp, id, db->dbc_maxids );
611 k3.dptr = ch_malloc(k2.dsize);
613 AC_MEMCPY(k3.dptr, k2.dptr, k3.dsize);
614 if ( (rc = idl_store( be, db, k3, tmp )) != 0 ) {
616 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
617 "idl_insert_key: idl_store returned %d\n", rc ));
619 Debug( LDAP_DEBUG_ANY,
620 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
628 /* This new id will necessarily be inserted
629 * as the first id of the next block by the
630 * following switch() statement.
634 switch ( (rc = idl_insert( &tmp2, id,
635 db->dbc_maxids )) ) {
636 case 1: /* id inserted first in block */
637 rc = idl_change_first( be, db, key, idl,
641 case 2: /* id already there - how? */
642 case 0: /* id inserted: this can never be
643 * the result of idl_insert, because
644 * we guaranteed that idl_change_first
645 * will always be called.
649 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
650 "idl_insert_key: id %ld is already in next block\n",
653 Debug( LDAP_DEBUG_ANY,
654 "idl_insert_key: id %ld already in next block\n",
665 case 3: /* split the original block */
674 * must split the block, write both new blocks + update
675 * and write the indirect header block.
678 rc = 0; /* optimistic */
681 /* count how many indirect blocks *//* XXX linear count XXX */
682 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
685 /* check it against all-id thresholed */
686 if ( j + 1 > db->dbc_maxindirect ) {
688 * we've passed the all-id threshold, meaning
689 * that this set of blocks should be replaced
690 * by a single "all-id" block. our job: delete
691 * all the indirect blocks, and replace the header
692 * block by an all-id block.
695 /* delete all indirect blocks */
696 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ ) {
697 cont_id( &k2, ID_BLOCK_ID(idl, j) );
699 rc = ldbm_cache_delete( db, k2 );
702 /* store allid block in place of header block */
704 idl = idl_allids( be );
705 rc = idl_store( be, db, key, idl );
713 idl_split_block( tmp, id, &tmp2, &tmp3 );
716 /* create a new updated indirect header block */
717 tmp = idl_alloc( ID_BLOCK_NMAX(idl) + 1 );
718 ID_BLOCK_NIDS(tmp) = ID_BLOCK_INDIRECT_VALUE;
719 /* everything up to the split block */
721 (char *) &ID_BLOCK_ID(tmp, 0),
722 (char *) &ID_BLOCK_ID(idl, 0),
724 /* the two new blocks */
725 ID_BLOCK_ID(tmp, i) = ID_BLOCK_ID(tmp2, 0);
726 ID_BLOCK_ID(tmp, i + 1) = ID_BLOCK_ID(tmp3, 0);
727 /* everything after the split block */
729 (char *) &ID_BLOCK_ID(tmp, i + 2),
730 (char *) &ID_BLOCK_ID(idl, i + 1),
731 (ID_BLOCK_NMAX(idl) - i - 1) * sizeof(ID) );
733 /* store the header block */
734 rc = idl_store( be, db, key, tmp );
736 /* store the first id block */
737 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
738 rc = idl_store( be, db, k2, tmp2 );
740 /* store the second id block */
741 cont_id( &k2, ID_BLOCK_ID(tmp3, 0) );
742 rc = idl_store( be, db, k2, tmp3 );
757 * idl_insert - insert an id into an id list.
761 * 1 id inserted, first id in block has changed
762 * 2 id not inserted, already there
763 * 3 id not inserted, block must be split
766 idl_insert( ID_BLOCK **idl, ID id, unsigned int maxids )
770 if ( ID_BLOCK_ALLIDS( *idl ) ) {
771 return( 2 ); /* already there */
774 /* is it already there? *//* XXX linear search XXX */
775 for ( i = 0; i < ID_BLOCK_NIDS(*idl) && id > ID_BLOCK_ID(*idl, i); i++ ) {
778 if ( i < ID_BLOCK_NIDS(*idl) && ID_BLOCK_ID(*idl, i) == id ) {
779 return( 2 ); /* already there */
782 /* do we need to make room for it? */
783 if ( ID_BLOCK_NIDS(*idl) == ID_BLOCK_NMAX(*idl) ) {
784 /* make room or indicate block needs splitting */
785 if ( ID_BLOCK_NMAX(*idl) >= maxids ) {
786 return( 3 ); /* block needs splitting */
789 ID_BLOCK_NMAX(*idl) *= 2;
790 if ( ID_BLOCK_NMAX(*idl) > maxids ) {
791 ID_BLOCK_NMAX(*idl) = maxids;
793 *idl = (ID_BLOCK *) ch_realloc( (char *) *idl,
794 (ID_BLOCK_NMAX(*idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
797 /* make a slot for the new id */
798 AC_MEMCPY( &ID_BLOCK_ID(*idl, i+1), &ID_BLOCK_ID(*idl, i),
799 (ID_BLOCK_NIDS(*idl) - i) * sizeof(ID) );
801 ID_BLOCK_ID(*idl, i) = id;
802 ID_BLOCK_NIDS(*idl)++;
804 (char *) &ID_BLOCK_ID((*idl), ID_BLOCK_NIDS(*idl)),
806 (ID_BLOCK_NMAX(*idl) - ID_BLOCK_NIDS(*idl)) * sizeof(ID) );
808 #ifdef LDBM_DEBUG_IDL
812 return( i == 0 ? 1 : 0 ); /* inserted - first id changed or not */
829 if ( (idl = idl_fetch_one( be, db, key ) ) == NULL )
831 /* It wasn't found. Hmm... */
835 if ( ID_BLOCK_ALLIDS( idl ) ) {
840 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
841 for ( i=0; i < ID_BLOCK_NIDS(idl); i++ ) {
842 if ( ID_BLOCK_ID(idl, i) == id ) {
843 if( --ID_BLOCK_NIDS(idl) == 0 ) {
844 ldbm_cache_delete( db, key );
848 &ID_BLOCK_ID(idl, i),
849 &ID_BLOCK_ID(idl, i+1),
850 (ID_BLOCK_NIDS(idl)-i) * sizeof(ID) );
852 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)) = NOID;
854 idl_store( be, db, key, idl );
860 /* We didn't find the ID. Hmmm... */
866 /* We have to go through an indirect block and find the ID
869 for ( nids = 0; !ID_BLOCK_NOID(idl, nids); nids++ )
872 cont_alloc( &data, &key );
874 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
877 cont_id( &data, ID_BLOCK_ID(idl, j) );
879 if ( (tmp = idl_fetch_one( be, db, data )) == NULL ) {
881 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
882 "idl_delete_key: idl_fetch_one returned NULL\n" ));
884 Debug( LDAP_DEBUG_ANY,
885 "idl_delete_key: idl_fetch of returned NULL\n", 0, 0, 0 );
891 Now try to find the ID in tmp
893 for ( i=0; i < ID_BLOCK_NIDS(tmp); i++ )
895 if ( ID_BLOCK_ID(tmp, i) == id )
898 &ID_BLOCK_ID(tmp, i),
899 &ID_BLOCK_ID(tmp, i+1),
900 (ID_BLOCK_NIDS(tmp)-(i+1)) * sizeof(ID));
901 ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp)-1 ) = NOID;
902 ID_BLOCK_NIDS(tmp)--;
904 if ( ID_BLOCK_NIDS(tmp) ) {
905 idl_store ( be, db, data, tmp );
908 ldbm_cache_delete( db, data );
910 &ID_BLOCK_ID(idl, j),
911 &ID_BLOCK_ID(idl, j+1),
912 (nids-(j+1)) * sizeof(ID));
913 ID_BLOCK_ID(idl, nids-1) = NOID;
916 ldbm_cache_delete( db, key );
918 idl_store( be, db, key, idl );
935 /* return a duplicate of a single ID_BLOCK */
937 idl_dup( ID_BLOCK *idl )
945 new = idl_alloc( ID_BLOCK_NMAX(idl) );
950 (ID_BLOCK_NMAX(idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
952 #ifdef LDBM_DEBUG_IDL
960 /* return the smaller ID_BLOCK */
962 idl_min( ID_BLOCK *a, ID_BLOCK *b )
964 return( ID_BLOCK_NIDS(a) > ID_BLOCK_NIDS(b) ? b : a );
969 * idl_intersection - return a intersection b
978 unsigned int ai, bi, ni;
981 if ( a == NULL || b == NULL ) {
984 if ( ID_BLOCK_ALLIDS( a ) ) {
985 return( idl_dup( b ) );
987 if ( ID_BLOCK_ALLIDS( b ) ) {
988 return( idl_dup( a ) );
991 n = idl_dup( idl_min( a, b ) );
993 #ifdef LDBM_DEBUG_IDL
998 for ( ni = 0, ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
1000 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
1006 if ( bi == ID_BLOCK_NIDS(b) ) {
1010 if ( ID_BLOCK_ID(b, bi) == ID_BLOCK_ID(a, ai) ) {
1011 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1019 ID_BLOCK_NIDS(n) = ni;
1021 #ifdef LDBM_DEBUG_IDL
1030 * idl_union - return a union b
1039 unsigned int ai, bi, ni;
1043 return( idl_dup( b ) );
1046 return( idl_dup( a ) );
1048 if ( ID_BLOCK_ALLIDS( a ) || ID_BLOCK_ALLIDS( b ) ) {
1049 return( idl_allids( be ) );
1052 #ifdef LDBM_DEBUG_IDL
1057 if ( ID_BLOCK_NIDS(b) < ID_BLOCK_NIDS(a) ) {
1063 n = idl_alloc( ID_BLOCK_NIDS(a) + ID_BLOCK_NIDS(b) );
1065 for ( ni = 0, ai = 0, bi = 0;
1066 ai < ID_BLOCK_NIDS(a) && bi < ID_BLOCK_NIDS(b);
1069 if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
1070 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai++);
1072 } else if ( ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai) ) {
1073 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi++);
1076 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1081 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1082 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1084 for ( ; bi < ID_BLOCK_NIDS(b); bi++ ) {
1085 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi);
1087 ID_BLOCK_NIDS(n) = ni;
1089 #ifdef LDBM_DEBUG_IDL
1098 * idl_notin - return a intersection ~b (or a minus b)
1107 unsigned int ni, ai, bi;
1113 if ( b == NULL || ID_BLOCK_ALLIDS( b )) {
1114 return( idl_dup( a ) );
1117 if ( ID_BLOCK_ALLIDS( a ) ) {
1118 n = idl_alloc( SLAPD_LDBM_MIN_MAXIDS );
1121 for ( ai = 1, bi = 0;
1122 ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAX(n) && bi < ID_BLOCK_NMAX(b);
1125 if ( ID_BLOCK_ID(b, bi) == ai ) {
1128 ID_BLOCK_ID(n, ni++) = ai;
1132 for ( ; ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAX(n); ai++ ) {
1133 ID_BLOCK_ID(n, ni++) = ai;
1136 if ( ni == ID_BLOCK_NMAX(n) ) {
1138 return( idl_allids( be ) );
1140 ID_BLOCK_NIDS(n) = ni;
1148 for ( ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
1150 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
1156 if ( bi == ID_BLOCK_NIDS(b) ) {
1160 if ( ID_BLOCK_ID(b, bi) != ID_BLOCK_ID(a, ai) ) {
1161 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1165 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1166 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1168 ID_BLOCK_NIDS(n) = ni;
1170 #ifdef LDBM_DEBUG_IDL
1177 /* return the first ID in the block
1180 * otherwise return NOID
1181 * otherwise return first ID
1183 * cursor is set to 1
1186 idl_firstid( ID_BLOCK *idl, ID *cursor )
1190 if ( idl == NULL || ID_BLOCK_NIDS(idl) == 0 ) {
1194 if ( ID_BLOCK_ALLIDS( idl ) ) {
1195 return( ID_BLOCK_NIDS(idl) > 1 ? 1 : NOID );
1198 return( ID_BLOCK_ID(idl, 0) );
1202 * if ALLIDS block, cursor is id.
1204 * if id < NIDS return id
1206 * otherwise cursor is index into block
1208 * return id at index then increment
1211 idl_nextid( ID_BLOCK *idl, ID *cursor )
1213 if ( ID_BLOCK_ALLIDS( idl ) ) {
1214 if( ++(*cursor) < ID_BLOCK_NIDS(idl) ) {
1221 if ( *cursor < ID_BLOCK_NIDS(idl) ) {
1222 return( ID_BLOCK_ID(idl, (*cursor)++) );