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 );
48 /* Allocate an ID_BLOCK with room for nids ids */
50 idl_alloc( unsigned int nids )
54 /* nmax + nids + space for the ids */
55 new = (ID_BLOCK *) ch_calloc( (ID_BLOCK_IDS_OFFSET + nids), sizeof(ID) );
56 ID_BLOCK_NMAX(new) = nids;
57 ID_BLOCK_NIDS(new) = 0;
63 /* Allocate an empty ALLIDS ID_BLOCK */
65 idl_allids( Backend *be )
70 ID_BLOCK_NMAX(idl) = ID_BLOCK_ALLIDS_VALUE;
71 ID_BLOCK_NIDS(idl) = next_id_get( be );
76 /* Free an ID_BLOCK */
78 idl_free( ID_BLOCK *idl )
82 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
83 "idl_freee: called with NULL pointer\n" ));
85 Debug( LDAP_DEBUG_TRACE,
86 "idl_free: called with NULL pointer\n",
97 /* Fetch an single ID_BLOCK from the cache */
108 /* Debug( LDAP_DEBUG_TRACE, "=> idl_fetch_one\n", 0, 0, 0 ); */
110 data = ldbm_cache_fetch( db, key );
112 if( data.dptr == NULL ) {
116 idl = idl_dup((ID_BLOCK *) data.dptr);
118 ldbm_datum_free( db->dbc_db, data );
124 /* Fetch a set of ID_BLOCKs from the cache
126 * if block return is an ALLIDS block,
127 * return an new ALLIDS block
130 * construct super block from all blocks referenced by INDIRECT block
145 idl = idl_fetch_one( be, db, key );
151 if ( ID_BLOCK_ALLIDS(idl) ) {
153 /* make sure we have the current value of highest id */
155 idl = idl_allids( be );
160 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
166 * this is an indirect block which points to other blocks.
167 * we need to read in all the blocks it points to and construct
168 * a big id list containing all the ids, which we will return.
171 /* count the number of blocks & allocate space for pointers to them */
172 for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ )
174 tmp = (ID_BLOCK **) ch_malloc( (i + 1) * sizeof(ID_BLOCK *) );
176 /* read in all the blocks */
177 cont_alloc( &data, &key );
179 for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ ) {
180 cont_id( &data, ID_BLOCK_ID(idl, i) );
182 if ( (tmp[i] = idl_fetch_one( be, db, data )) == NULL ) {
184 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
185 "idl_fetch: idl_fetch_one returned NULL\n" ));
187 Debug( LDAP_DEBUG_ANY,
188 "idl_fetch: one returned NULL\n", 0, 0, 0 );
194 nids += ID_BLOCK_NIDS(tmp[i]);
200 /* allocate space for the big block */
201 idl = idl_alloc( nids );
202 ID_BLOCK_NIDS(idl) = nids;
205 /* copy in all the ids from the component blocks */
206 for ( i = 0; tmp[i] != NULL; i++ ) {
207 if ( tmp[i] == NULL ) {
212 (char *) &ID_BLOCK_ID(idl, nids),
213 (char *) &ID_BLOCK_ID(tmp[i], 0),
214 ID_BLOCK_NIDS(tmp[i]) * sizeof(ID) );
215 nids += ID_BLOCK_NIDS(tmp[i]);
219 free( (char *) tmp );
222 LDAP_LOG(( "cache", LDAP_LEVEL_ENTRY,
223 "idl_fetch: %ld ids (%ld max)\n",
224 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAX(idl) ));
226 Debug( LDAP_DEBUG_TRACE, "<= idl_fetch %ld ids (%ld max)\n",
227 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAX(idl), 0 );
234 /* store a single block */
245 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
247 ldbm_datum_init( data );
249 /* Debug( LDAP_DEBUG_TRACE, "=> idl_store\n", 0, 0, 0 ); */
251 data.dptr = (char *) idl;
252 data.dsize = (ID_BLOCK_IDS_OFFSET + ID_BLOCK_NMAX(idl)) * sizeof(ID);
255 Statslog( LDAP_DEBUG_STATS, "<= idl_store(): rc=%d\n",
259 flags = LDBM_REPLACE;
260 rc = ldbm_cache_store( db, key, data, flags );
262 /* Debug( LDAP_DEBUG_TRACE, "<= idl_store %d\n", rc, 0, 0 ); */
266 /* split the block at id
267 * locate ID greater than or equal to id.
279 /* find where to split the block *//* XXX linear search XXX */
280 for ( nr = 0; nr < ID_BLOCK_NIDS(b) && id > ID_BLOCK_ID(b, nr); nr++ )
283 nl = ID_BLOCK_NIDS(b) - nr;
285 *right = idl_alloc( nr == 0 ? 1 : nr );
286 *left = idl_alloc( nl + (nr == 0 ? 0 : 1));
289 * everything before the id being inserted in the first block
290 * unless there is nothing, in which case the id being inserted
294 ID_BLOCK_NIDS(*right) = 1;
295 ID_BLOCK_ID(*right, 0) = id;
298 (char *) &ID_BLOCK_ID(*right, 0),
299 (char *) &ID_BLOCK_ID(b, 0),
301 ID_BLOCK_NIDS(*right) = nr;
302 ID_BLOCK_ID(*left, 0) = id;
305 /* the id being inserted & everything after in the second block */
307 (char *) &ID_BLOCK_ID(*left, (nr == 0 ? 0 : 1)),
308 (char *) &ID_BLOCK_ID(b, nr),
310 ID_BLOCK_NIDS(*left) = nl + (nr == 0 ? 0 : 1);
315 * idl_change_first - called when an indirect block's first key has
316 * changed, meaning it needs to be stored under a new key, and the
317 * header block pointing to it needs updating.
323 Datum hkey, /* header block key */
324 ID_BLOCK *h, /* header block */
325 int pos, /* pos in h to update */
326 Datum bkey, /* data block key */
327 ID_BLOCK *b /* data block */
332 /* Debug( LDAP_DEBUG_TRACE, "=> idl_change_first\n", 0, 0, 0 ); */
334 /* delete old key block */
335 if ( (rc = ldbm_cache_delete( db, bkey )) != 0 ) {
337 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
338 "idl_change_first: ldbm_cache_delete returned %d\n", rc ));
340 Debug( LDAP_DEBUG_ANY,
341 "idl_change_first: ldbm_cache_delete returned %d\n",
348 /* write block with new key */
349 cont_id( &bkey, ID_BLOCK_ID(b, 0) );
351 if ( (rc = idl_store( be, db, bkey, b )) != 0 ) {
353 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
354 "idl_change_first: idl_store returned %d\n", rc ));
356 Debug( LDAP_DEBUG_ANY,
357 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
363 /* update + write indirect header block */
364 ID_BLOCK_ID(h, pos) = ID_BLOCK_ID(b, 0);
365 if ( (rc = idl_store( be, db, hkey, h )) != 0 ) {
367 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
368 "idl_change_first: idl_store returned %s\n", rc ));
370 Debug( LDAP_DEBUG_ANY,
371 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
390 ID_BLOCK *idl, *tmp, *tmp2, *tmp3;
393 if ( (idl = idl_fetch_one( be, db, key )) == NULL ) {
394 idl = idl_alloc( 1 );
395 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)++) = id;
396 rc = idl_store( be, db, key, idl );
402 if ( ID_BLOCK_ALLIDS( idl ) ) {
408 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
410 switch ( idl_insert( &idl, id, db->dbc_maxids ) ) {
411 case 0: /* id inserted - store the updated block */
413 rc = idl_store( be, db, key, idl );
416 case 2: /* id already there - nothing to do */
420 case 3: /* id not inserted - block must be split */
421 /* check threshold for marking this an all-id block */
422 if ( db->dbc_maxindirect < 2 ) {
424 idl = idl_allids( be );
425 rc = idl_store( be, db, key, idl );
429 idl_split_block( idl, id, &tmp, &tmp2 );
432 /* create the header indirect block */
433 idl = idl_alloc( 3 );
434 ID_BLOCK_NMAX(idl) = 3;
435 ID_BLOCK_NIDS(idl) = ID_BLOCK_INDIRECT_VALUE;
436 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
437 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
438 ID_BLOCK_ID(idl, 2) = NOID;
441 rc = idl_store( be, db, key, idl );
443 cont_alloc( &k2, &key );
444 cont_id( &k2, ID_BLOCK_ID(tmp, 0) );
446 rc = idl_store( be, db, k2, tmp );
448 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
449 rc = idl_store( be, db, k2, tmp2 );
463 * this is an indirect block which points to other blocks.
464 * we need to read in the block into which the id should be
465 * inserted, then insert the id and store the block. we might
466 * have to split the block if it is full, which means we also
467 * need to write a new "header" block.
470 /* select the block to try inserting into *//* XXX linear search XXX */
471 for ( i = 0; !ID_BLOCK_NOID(idl, i) && id > ID_BLOCK_ID(idl, i); i++ )
482 cont_alloc( &k2, &key );
483 cont_id( &k2, ID_BLOCK_ID(idl, i) );
485 if ( (tmp = idl_fetch_one( be, db, k2 )) == NULL ) {
487 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
488 "idl_insert_key: nonexistent continuation block\n" ));
490 Debug( LDAP_DEBUG_ANY, "idl_insert_key: nonexistent continuation block\n",
500 switch ( idl_insert( &tmp, id, db->dbc_maxids ) ) {
501 case 0: /* id inserted ok */
502 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
504 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
505 "ids_insert_key: idl_store returned %d\n", rc ));
507 Debug( LDAP_DEBUG_ANY,
508 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
514 case 1: /* id inserted - first id in block has changed */
516 * key for this block has changed, so we have to
517 * write the block under the new key, delete the
518 * old key block + update and write the indirect
522 rc = idl_change_first( be, db, key, idl, i, k2, tmp );
525 case 2: /* id not inserted - already there, do nothing */
529 case 3: /* id not inserted - block is full */
531 * first, see if it will fit in the next block,
532 * without splitting, unless we're trying to insert
533 * into the beginning of the first block.
536 /* is there a next block? */
537 if ( !first && !ID_BLOCK_NOID(idl, i + 1) ) {
539 cont_alloc( &k2, &key );
540 cont_id( &k2, ID_BLOCK_ID(idl, i) );
541 if ( (tmp2 = idl_fetch_one( be, db, k2 )) == NULL ) {
543 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
544 "idl_insert_key: idl_fetch_one returned NULL\n"));
546 Debug( LDAP_DEBUG_ANY,
547 "idl_insert_key: idl_fetch_one returned NULL\n",
551 /* split the original block */
556 /* If the new id is less than the last id in the
557 * current block, it must not be put into the next
558 * block. Push the last id of the current block
559 * into the next block instead.
561 if (id < ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1)) {
562 ID id2 = ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1);
565 ldbm_datum_init( k3 );
567 --ID_BLOCK_NIDS(tmp);
568 /* This must succeed since we just popped one
569 * ID off the end of it.
571 rc = idl_insert( &tmp, id, db->dbc_maxids );
573 k3.dptr = ch_malloc(k2.dsize);
575 AC_MEMCPY(k3.dptr, k2.dptr, k3.dsize);
576 if ( (rc = idl_store( be, db, k3, tmp )) != 0 ) {
578 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
579 "idl_insert_key: idl_store returned %d\n", rc ));
581 Debug( LDAP_DEBUG_ANY,
582 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
590 /* This new id will necessarily be inserted
591 * as the first id of the next block by the
592 * following switch() statement.
596 switch ( (rc = idl_insert( &tmp2, id,
597 db->dbc_maxids )) ) {
598 case 1: /* id inserted first in block */
599 rc = idl_change_first( be, db, key, idl,
603 case 2: /* id already there - how? */
604 case 0: /* id inserted: this can never be
605 * the result of idl_insert, because
606 * we guaranteed that idl_change_first
607 * will always be called.
611 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
612 "idl_insert_key: id %ld is already in next block\n",
615 Debug( LDAP_DEBUG_ANY,
616 "idl_insert_key: id %ld already in next block\n",
627 case 3: /* split the original block */
636 * must split the block, write both new blocks + update
637 * and write the indirect header block.
640 rc = 0; /* optimistic */
643 /* count how many indirect blocks *//* XXX linear count XXX */
644 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
647 /* check it against all-id thresholed */
648 if ( j + 1 > db->dbc_maxindirect ) {
650 * we've passed the all-id threshold, meaning
651 * that this set of blocks should be replaced
652 * by a single "all-id" block. our job: delete
653 * all the indirect blocks, and replace the header
654 * block by an all-id block.
657 /* delete all indirect blocks */
658 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ ) {
659 cont_id( &k2, ID_BLOCK_ID(idl, j) );
661 rc = ldbm_cache_delete( db, k2 );
664 /* store allid block in place of header block */
666 idl = idl_allids( be );
667 rc = idl_store( be, db, key, idl );
675 idl_split_block( tmp, id, &tmp2, &tmp3 );
678 /* create a new updated indirect header block */
679 tmp = idl_alloc( ID_BLOCK_NMAX(idl) + 1 );
680 ID_BLOCK_NIDS(tmp) = ID_BLOCK_INDIRECT_VALUE;
681 /* everything up to the split block */
683 (char *) &ID_BLOCK_ID(tmp, 0),
684 (char *) &ID_BLOCK_ID(idl, 0),
686 /* the two new blocks */
687 ID_BLOCK_ID(tmp, i) = ID_BLOCK_ID(tmp2, 0);
688 ID_BLOCK_ID(tmp, i + 1) = ID_BLOCK_ID(tmp3, 0);
689 /* everything after the split block */
691 (char *) &ID_BLOCK_ID(tmp, i + 2),
692 (char *) &ID_BLOCK_ID(idl, i + 1),
693 (ID_BLOCK_NMAX(idl) - i - 1) * sizeof(ID) );
695 /* store the header block */
696 rc = idl_store( be, db, key, tmp );
698 /* store the first id block */
699 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
700 rc = idl_store( be, db, k2, tmp2 );
702 /* store the second id block */
703 cont_id( &k2, ID_BLOCK_ID(tmp3, 0) );
704 rc = idl_store( be, db, k2, tmp3 );
719 * idl_insert - insert an id into an id list.
723 * 1 id inserted, first id in block has changed
724 * 2 id not inserted, already there
725 * 3 id not inserted, block must be split
728 idl_insert( ID_BLOCK **idl, ID id, unsigned int maxids )
732 if ( ID_BLOCK_ALLIDS( *idl ) ) {
733 return( 2 ); /* already there */
736 /* is it already there? *//* XXX linear search XXX */
737 for ( i = 0; i < ID_BLOCK_NIDS(*idl) && id > ID_BLOCK_ID(*idl, i); i++ ) {
740 if ( i < ID_BLOCK_NIDS(*idl) && ID_BLOCK_ID(*idl, i) == id ) {
741 return( 2 ); /* already there */
744 /* do we need to make room for it? */
745 if ( ID_BLOCK_NIDS(*idl) == ID_BLOCK_NMAX(*idl) ) {
746 /* make room or indicate block needs splitting */
747 if ( ID_BLOCK_NMAX(*idl) >= maxids ) {
748 return( 3 ); /* block needs splitting */
751 ID_BLOCK_NMAX(*idl) *= 2;
752 if ( ID_BLOCK_NMAX(*idl) > maxids ) {
753 ID_BLOCK_NMAX(*idl) = maxids;
755 *idl = (ID_BLOCK *) ch_realloc( (char *) *idl,
756 (ID_BLOCK_NMAX(*idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
759 /* make a slot for the new id */
760 AC_MEMCPY( &ID_BLOCK_ID(*idl, i+1), &ID_BLOCK_ID(*idl, i),
761 (ID_BLOCK_NIDS(*idl) - i) * sizeof(ID) );
763 ID_BLOCK_ID(*idl, i) = id;
764 ID_BLOCK_NIDS(*idl)++;
766 (char *) &ID_BLOCK_ID((*idl), ID_BLOCK_NIDS(*idl)),
768 (ID_BLOCK_NMAX(*idl) - ID_BLOCK_NIDS(*idl)) * sizeof(ID) );
770 return( i == 0 ? 1 : 0 ); /* inserted - first id changed or not */
787 if ( (idl = idl_fetch_one( be, db, key ) ) == NULL )
789 /* It wasn't found. Hmm... */
793 if ( ID_BLOCK_ALLIDS( idl ) ) {
798 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
799 for ( i=0; i < ID_BLOCK_NIDS(idl); i++ ) {
800 if ( ID_BLOCK_ID(idl, i) == id ) {
801 if( --ID_BLOCK_NIDS(idl) == 0 ) {
802 ldbm_cache_delete( db, key );
806 &ID_BLOCK_ID(idl, i),
807 &ID_BLOCK_ID(idl, i+1),
808 (ID_BLOCK_NIDS(idl)-i) * sizeof(ID) );
810 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)) = NOID;
812 idl_store( be, db, key, idl );
818 /* We didn't find the ID. Hmmm... */
824 /* We have to go through an indirect block and find the ID
827 for ( nids = 0; !ID_BLOCK_NOID(idl, nids); nids++ )
830 cont_alloc( &data, &key );
832 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
835 cont_id( &data, ID_BLOCK_ID(idl, j) );
837 if ( (tmp = idl_fetch_one( be, db, data )) == NULL ) {
839 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
840 "idl_delete_key: idl_fetch_one returned NULL\n" ));
842 Debug( LDAP_DEBUG_ANY,
843 "idl_delete_key: idl_fetch of returned NULL\n", 0, 0, 0 );
849 Now try to find the ID in tmp
851 for ( i=0; i < ID_BLOCK_NIDS(tmp); i++ )
853 if ( ID_BLOCK_ID(tmp, i) == id )
856 &ID_BLOCK_ID(tmp, i),
857 &ID_BLOCK_ID(tmp, i+1),
858 (ID_BLOCK_NIDS(tmp)-(i+1)) * sizeof(ID));
859 ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp)-1 ) = NOID;
860 ID_BLOCK_NIDS(tmp)--;
862 if ( ID_BLOCK_NIDS(tmp) ) {
863 idl_store ( be, db, data, tmp );
866 ldbm_cache_delete( db, data );
868 &ID_BLOCK_ID(idl, j),
869 &ID_BLOCK_ID(idl, j+1),
870 (nids-(j+1)) * sizeof(ID));
871 ID_BLOCK_ID(idl, nids-1) = NOID;
874 ldbm_cache_delete( db, key );
876 idl_store( be, db, key, idl );
893 /* return a duplicate of a single ID_BLOCK */
895 idl_dup( ID_BLOCK *idl )
903 new = idl_alloc( ID_BLOCK_NMAX(idl) );
908 (ID_BLOCK_NMAX(idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
914 /* return the smaller ID_BLOCK */
916 idl_min( ID_BLOCK *a, ID_BLOCK *b )
918 return( ID_BLOCK_NIDS(a) > ID_BLOCK_NIDS(b) ? b : a );
923 * idl_intersection - return a intersection b
932 unsigned int ai, bi, ni;
935 if ( a == NULL || b == NULL ) {
938 if ( ID_BLOCK_ALLIDS( a ) ) {
939 return( idl_dup( b ) );
941 if ( ID_BLOCK_ALLIDS( b ) ) {
942 return( idl_dup( a ) );
945 n = idl_dup( idl_min( a, b ) );
947 for ( ni = 0, ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
949 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
955 if ( bi == ID_BLOCK_NIDS(b) ) {
959 if ( ID_BLOCK_ID(b, bi) == ID_BLOCK_ID(a, ai) ) {
960 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
968 ID_BLOCK_NIDS(n) = ni;
975 * idl_union - return a union b
984 unsigned int ai, bi, ni;
988 return( idl_dup( b ) );
991 return( idl_dup( a ) );
993 if ( ID_BLOCK_ALLIDS( a ) || ID_BLOCK_ALLIDS( b ) ) {
994 return( idl_allids( be ) );
997 if ( ID_BLOCK_NIDS(b) < ID_BLOCK_NIDS(a) ) {
1003 n = idl_alloc( ID_BLOCK_NIDS(a) + ID_BLOCK_NIDS(b) );
1005 for ( ni = 0, ai = 0, bi = 0;
1006 ai < ID_BLOCK_NIDS(a) && bi < ID_BLOCK_NIDS(b);
1009 if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
1010 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai++);
1012 } else if ( ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai) ) {
1013 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi++);
1016 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1021 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1022 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1024 for ( ; bi < ID_BLOCK_NIDS(b); bi++ ) {
1025 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi);
1027 ID_BLOCK_NIDS(n) = ni;
1034 * idl_notin - return a intersection ~b (or a minus b)
1043 unsigned int ni, ai, bi;
1049 if ( b == NULL || ID_BLOCK_ALLIDS( b )) {
1050 return( idl_dup( a ) );
1053 if ( ID_BLOCK_ALLIDS( a ) ) {
1054 n = idl_alloc( SLAPD_LDBM_MIN_MAXIDS );
1057 for ( ai = 1, bi = 0;
1058 ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAX(n) && bi < ID_BLOCK_NMAX(b);
1061 if ( ID_BLOCK_ID(b, bi) == ai ) {
1064 ID_BLOCK_ID(n, ni++) = ai;
1068 for ( ; ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAX(n); ai++ ) {
1069 ID_BLOCK_ID(n, ni++) = ai;
1072 if ( ni == ID_BLOCK_NMAX(n) ) {
1074 return( idl_allids( be ) );
1076 ID_BLOCK_NIDS(n) = ni;
1084 for ( ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
1086 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
1092 if ( bi == ID_BLOCK_NIDS(b) ) {
1096 if ( ID_BLOCK_ID(b, bi) != ID_BLOCK_ID(a, ai) ) {
1097 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1101 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1102 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1104 ID_BLOCK_NIDS(n) = ni;
1109 /* return the first ID in the block
1112 * otherwise return NOID
1113 * otherwise return first ID
1115 * cursor is set to 1
1118 idl_firstid( ID_BLOCK *idl, ID *cursor )
1122 if ( idl == NULL || ID_BLOCK_NIDS(idl) == 0 ) {
1126 if ( ID_BLOCK_ALLIDS( idl ) ) {
1127 return( ID_BLOCK_NIDS(idl) > 1 ? 1 : NOID );
1130 return( ID_BLOCK_ID(idl, 0) );
1134 * if ALLIDS block, cursor is id.
1136 * if id < NIDS return id
1138 * otherwise cursor is index into block
1140 * return id at index then increment
1143 idl_nextid( ID_BLOCK *idl, ID *cursor )
1145 if ( ID_BLOCK_ALLIDS( idl ) ) {
1146 if( ++(*cursor) < ID_BLOCK_NIDS(idl) ) {
1153 if ( *cursor < ID_BLOCK_NIDS(idl) ) {
1154 return( ID_BLOCK_ID(idl, (*cursor)++) );