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 )
71 ID_BLOCK_NMAX(idl) = ID_BLOCK_ALLIDS_VALUE;
72 if ( next_id_get( be, &id ) ) {
75 ID_BLOCK_NIDS(idl) = id;
80 /* Free an ID_BLOCK */
82 idl_free( ID_BLOCK *idl )
86 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
87 "idl_free: called with NULL pointer\n" ));
89 Debug( LDAP_DEBUG_TRACE,
90 "idl_free: called with NULL pointer\n",
101 /* Fetch an single ID_BLOCK from the cache */
112 /* Debug( LDAP_DEBUG_TRACE, "=> idl_fetch_one\n", 0, 0, 0 ); */
114 data = ldbm_cache_fetch( db, key );
116 if( data.dptr == NULL ) {
120 idl = idl_dup((ID_BLOCK *) data.dptr);
122 ldbm_datum_free( db->dbc_db, data );
128 /* Fetch a set of ID_BLOCKs from the cache
130 * if block return is an ALLIDS block,
131 * return an new ALLIDS block
134 * construct super block from all blocks referenced by INDIRECT block
149 idl = idl_fetch_one( be, db, key );
155 if ( ID_BLOCK_ALLIDS(idl) ) {
157 /* make sure we have the current value of highest id */
159 idl = idl_allids( be );
164 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
170 * this is an indirect block which points to other blocks.
171 * we need to read in all the blocks it points to and construct
172 * a big id list containing all the ids, which we will return.
175 /* count the number of blocks & allocate space for pointers to them */
176 for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ )
178 tmp = (ID_BLOCK **) ch_malloc( (i + 1) * sizeof(ID_BLOCK *) );
180 /* read in all the blocks */
181 cont_alloc( &data, &key );
183 for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ ) {
184 cont_id( &data, ID_BLOCK_ID(idl, i) );
186 if ( (tmp[i] = idl_fetch_one( be, db, data )) == NULL ) {
188 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
189 "idl_fetch: idl_fetch_one returned NULL\n" ));
191 Debug( LDAP_DEBUG_ANY,
192 "idl_fetch: one returned NULL\n", 0, 0, 0 );
198 nids += ID_BLOCK_NIDS(tmp[i]);
204 /* allocate space for the big block */
205 idl = idl_alloc( nids );
206 ID_BLOCK_NIDS(idl) = nids;
209 /* copy in all the ids from the component blocks */
210 for ( i = 0; tmp[i] != NULL; i++ ) {
211 if ( tmp[i] == NULL ) {
216 (char *) &ID_BLOCK_ID(idl, nids),
217 (char *) &ID_BLOCK_ID(tmp[i], 0),
218 ID_BLOCK_NIDS(tmp[i]) * sizeof(ID) );
219 nids += ID_BLOCK_NIDS(tmp[i]);
223 free( (char *) tmp );
226 LDAP_LOG(( "cache", LDAP_LEVEL_ENTRY,
227 "idl_fetch: %ld ids (%ld max)\n",
228 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAX(idl) ));
230 Debug( LDAP_DEBUG_TRACE, "<= idl_fetch %ld ids (%ld max)\n",
231 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAX(idl), 0 );
238 /* store a single block */
249 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
251 ldbm_datum_init( data );
253 /* Debug( LDAP_DEBUG_TRACE, "=> idl_store\n", 0, 0, 0 ); */
255 data.dptr = (char *) idl;
256 data.dsize = (ID_BLOCK_IDS_OFFSET + ID_BLOCK_NMAX(idl)) * sizeof(ID);
259 Statslog( LDAP_DEBUG_STATS, "<= idl_store(): rc=%d\n",
263 flags = LDBM_REPLACE;
264 rc = ldbm_cache_store( db, key, data, flags );
266 /* Debug( LDAP_DEBUG_TRACE, "<= idl_store %d\n", rc, 0, 0 ); */
270 /* split the block at id
271 * locate ID greater than or equal to id.
283 /* find where to split the block *//* XXX linear search XXX */
284 for ( nr = 0; nr < ID_BLOCK_NIDS(b) && id > ID_BLOCK_ID(b, nr); nr++ )
287 nl = ID_BLOCK_NIDS(b) - nr;
289 *right = idl_alloc( nr == 0 ? 1 : nr );
290 *left = idl_alloc( nl + (nr == 0 ? 0 : 1));
293 * everything before the id being inserted in the first block
294 * unless there is nothing, in which case the id being inserted
298 ID_BLOCK_NIDS(*right) = 1;
299 ID_BLOCK_ID(*right, 0) = id;
302 (char *) &ID_BLOCK_ID(*right, 0),
303 (char *) &ID_BLOCK_ID(b, 0),
305 ID_BLOCK_NIDS(*right) = nr;
306 ID_BLOCK_ID(*left, 0) = id;
309 /* the id being inserted & everything after in the second block */
311 (char *) &ID_BLOCK_ID(*left, (nr == 0 ? 0 : 1)),
312 (char *) &ID_BLOCK_ID(b, nr),
314 ID_BLOCK_NIDS(*left) = nl + (nr == 0 ? 0 : 1);
319 * idl_change_first - called when an indirect block's first key has
320 * changed, meaning it needs to be stored under a new key, and the
321 * header block pointing to it needs updating.
327 Datum hkey, /* header block key */
328 ID_BLOCK *h, /* header block */
329 int pos, /* pos in h to update */
330 Datum bkey, /* data block key */
331 ID_BLOCK *b /* data block */
336 /* Debug( LDAP_DEBUG_TRACE, "=> idl_change_first\n", 0, 0, 0 ); */
338 /* delete old key block */
339 if ( (rc = ldbm_cache_delete( db, bkey )) != 0 ) {
341 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
342 "idl_change_first: ldbm_cache_delete returned %d\n", rc ));
344 Debug( LDAP_DEBUG_ANY,
345 "idl_change_first: ldbm_cache_delete returned %d\n",
352 /* write block with new key */
353 cont_id( &bkey, ID_BLOCK_ID(b, 0) );
355 if ( (rc = idl_store( be, db, bkey, b )) != 0 ) {
357 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
358 "idl_change_first: idl_store returned %d\n", rc ));
360 Debug( LDAP_DEBUG_ANY,
361 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
367 /* update + write indirect header block */
368 ID_BLOCK_ID(h, pos) = ID_BLOCK_ID(b, 0);
369 if ( (rc = idl_store( be, db, hkey, h )) != 0 ) {
371 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
372 "idl_change_first: idl_store returned %s\n", rc ));
374 Debug( LDAP_DEBUG_ANY,
375 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
394 ID_BLOCK *idl, *tmp, *tmp2, *tmp3;
397 if ( (idl = idl_fetch_one( be, db, key )) == NULL ) {
398 idl = idl_alloc( 1 );
399 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)++) = id;
400 rc = idl_store( be, db, key, idl );
406 if ( ID_BLOCK_ALLIDS( idl ) ) {
412 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
414 switch ( idl_insert( &idl, id, db->dbc_maxids ) ) {
415 case 0: /* id inserted - store the updated block */
417 rc = idl_store( be, db, key, idl );
420 case 2: /* id already there - nothing to do */
424 case 3: /* id not inserted - block must be split */
425 /* check threshold for marking this an all-id block */
426 if ( db->dbc_maxindirect < 2 ) {
428 idl = idl_allids( be );
429 rc = idl_store( be, db, key, idl );
433 idl_split_block( idl, id, &tmp, &tmp2 );
436 /* create the header indirect block */
437 idl = idl_alloc( 3 );
438 ID_BLOCK_NMAX(idl) = 3;
439 ID_BLOCK_NIDS(idl) = ID_BLOCK_INDIRECT_VALUE;
440 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
441 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
442 ID_BLOCK_ID(idl, 2) = NOID;
445 rc = idl_store( be, db, key, idl );
447 cont_alloc( &k2, &key );
448 cont_id( &k2, ID_BLOCK_ID(tmp, 0) );
450 rc = idl_store( be, db, k2, tmp );
452 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
453 rc = idl_store( be, db, k2, tmp2 );
467 * this is an indirect block which points to other blocks.
468 * we need to read in the block into which the id should be
469 * inserted, then insert the id and store the block. we might
470 * have to split the block if it is full, which means we also
471 * need to write a new "header" block.
474 /* select the block to try inserting into *//* XXX linear search XXX */
475 for ( i = 0; !ID_BLOCK_NOID(idl, i) && id > ID_BLOCK_ID(idl, i); i++ )
486 cont_alloc( &k2, &key );
487 cont_id( &k2, ID_BLOCK_ID(idl, i) );
489 if ( (tmp = idl_fetch_one( be, db, k2 )) == NULL ) {
491 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
492 "idl_insert_key: nonexistent continuation block\n" ));
494 Debug( LDAP_DEBUG_ANY, "idl_insert_key: nonexistent continuation block\n",
504 switch ( idl_insert( &tmp, id, db->dbc_maxids ) ) {
505 case 0: /* id inserted ok */
506 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
508 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
509 "ids_insert_key: idl_store returned %d\n", rc ));
511 Debug( LDAP_DEBUG_ANY,
512 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
518 case 1: /* id inserted - first id in block has changed */
520 * key for this block has changed, so we have to
521 * write the block under the new key, delete the
522 * old key block + update and write the indirect
526 rc = idl_change_first( be, db, key, idl, i, k2, tmp );
529 case 2: /* id not inserted - already there, do nothing */
533 case 3: /* id not inserted - block is full */
535 * first, see if it will fit in the next block,
536 * without splitting, unless we're trying to insert
537 * into the beginning of the first block.
540 /* is there a next block? */
541 if ( !first && !ID_BLOCK_NOID(idl, i + 1) ) {
543 cont_alloc( &k2, &key );
544 cont_id( &k2, ID_BLOCK_ID(idl, i) );
545 if ( (tmp2 = idl_fetch_one( be, db, k2 )) == NULL ) {
547 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
548 "idl_insert_key: idl_fetch_one returned NULL\n"));
550 Debug( LDAP_DEBUG_ANY,
551 "idl_insert_key: idl_fetch_one returned NULL\n",
555 /* split the original block */
560 /* If the new id is less than the last id in the
561 * current block, it must not be put into the next
562 * block. Push the last id of the current block
563 * into the next block instead.
565 if (id < ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1)) {
566 ID id2 = ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1);
569 ldbm_datum_init( k3 );
571 --ID_BLOCK_NIDS(tmp);
572 /* This must succeed since we just popped one
573 * ID off the end of it.
575 rc = idl_insert( &tmp, id, db->dbc_maxids );
577 k3.dptr = ch_malloc(k2.dsize);
579 AC_MEMCPY(k3.dptr, k2.dptr, k3.dsize);
580 if ( (rc = idl_store( be, db, k3, tmp )) != 0 ) {
582 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
583 "idl_insert_key: idl_store returned %d\n", rc ));
585 Debug( LDAP_DEBUG_ANY,
586 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
594 /* This new id will necessarily be inserted
595 * as the first id of the next block by the
596 * following switch() statement.
600 switch ( (rc = idl_insert( &tmp2, id,
601 db->dbc_maxids )) ) {
602 case 1: /* id inserted first in block */
603 rc = idl_change_first( be, db, key, idl,
607 case 2: /* id already there - how? */
608 case 0: /* id inserted: this can never be
609 * the result of idl_insert, because
610 * we guaranteed that idl_change_first
611 * will always be called.
615 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
616 "idl_insert_key: id %ld is already in next block\n",
619 Debug( LDAP_DEBUG_ANY,
620 "idl_insert_key: id %ld already in next block\n",
631 case 3: /* split the original block */
640 * must split the block, write both new blocks + update
641 * and write the indirect header block.
644 rc = 0; /* optimistic */
647 /* count how many indirect blocks *//* XXX linear count XXX */
648 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
651 /* check it against all-id thresholed */
652 if ( j + 1 > db->dbc_maxindirect ) {
654 * we've passed the all-id threshold, meaning
655 * that this set of blocks should be replaced
656 * by a single "all-id" block. our job: delete
657 * all the indirect blocks, and replace the header
658 * block by an all-id block.
661 /* delete all indirect blocks */
662 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ ) {
663 cont_id( &k2, ID_BLOCK_ID(idl, j) );
665 rc = ldbm_cache_delete( db, k2 );
668 /* store allid block in place of header block */
670 idl = idl_allids( be );
671 rc = idl_store( be, db, key, idl );
679 idl_split_block( tmp, id, &tmp2, &tmp3 );
682 /* create a new updated indirect header block */
683 tmp = idl_alloc( ID_BLOCK_NMAX(idl) + 1 );
684 ID_BLOCK_NIDS(tmp) = ID_BLOCK_INDIRECT_VALUE;
685 /* everything up to the split block */
687 (char *) &ID_BLOCK_ID(tmp, 0),
688 (char *) &ID_BLOCK_ID(idl, 0),
690 /* the two new blocks */
691 ID_BLOCK_ID(tmp, i) = ID_BLOCK_ID(tmp2, 0);
692 ID_BLOCK_ID(tmp, i + 1) = ID_BLOCK_ID(tmp3, 0);
693 /* everything after the split block */
695 (char *) &ID_BLOCK_ID(tmp, i + 2),
696 (char *) &ID_BLOCK_ID(idl, i + 1),
697 (ID_BLOCK_NMAX(idl) - i - 1) * sizeof(ID) );
699 /* store the header block */
700 rc = idl_store( be, db, key, tmp );
702 /* store the first id block */
703 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
704 rc = idl_store( be, db, k2, tmp2 );
706 /* store the second id block */
707 cont_id( &k2, ID_BLOCK_ID(tmp3, 0) );
708 rc = idl_store( be, db, k2, tmp3 );
723 * idl_insert - insert an id into an id list.
727 * 1 id inserted, first id in block has changed
728 * 2 id not inserted, already there
729 * 3 id not inserted, block must be split
732 idl_insert( ID_BLOCK **idl, ID id, unsigned int maxids )
736 if ( ID_BLOCK_ALLIDS( *idl ) ) {
737 return( 2 ); /* already there */
740 /* is it already there? *//* XXX linear search XXX */
741 for ( i = 0; i < ID_BLOCK_NIDS(*idl) && id > ID_BLOCK_ID(*idl, i); i++ ) {
744 if ( i < ID_BLOCK_NIDS(*idl) && ID_BLOCK_ID(*idl, i) == id ) {
745 return( 2 ); /* already there */
748 /* do we need to make room for it? */
749 if ( ID_BLOCK_NIDS(*idl) == ID_BLOCK_NMAX(*idl) ) {
750 /* make room or indicate block needs splitting */
751 if ( ID_BLOCK_NMAX(*idl) >= maxids ) {
752 return( 3 ); /* block needs splitting */
755 ID_BLOCK_NMAX(*idl) *= 2;
756 if ( ID_BLOCK_NMAX(*idl) > maxids ) {
757 ID_BLOCK_NMAX(*idl) = maxids;
759 *idl = (ID_BLOCK *) ch_realloc( (char *) *idl,
760 (ID_BLOCK_NMAX(*idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
763 /* make a slot for the new id */
764 AC_MEMCPY( &ID_BLOCK_ID(*idl, i+1), &ID_BLOCK_ID(*idl, i),
765 (ID_BLOCK_NIDS(*idl) - i) * sizeof(ID) );
767 ID_BLOCK_ID(*idl, i) = id;
768 ID_BLOCK_NIDS(*idl)++;
770 (char *) &ID_BLOCK_ID((*idl), ID_BLOCK_NIDS(*idl)),
772 (ID_BLOCK_NMAX(*idl) - ID_BLOCK_NIDS(*idl)) * sizeof(ID) );
774 return( i == 0 ? 1 : 0 ); /* inserted - first id changed or not */
791 if ( (idl = idl_fetch_one( be, db, key ) ) == NULL )
793 /* It wasn't found. Hmm... */
797 if ( ID_BLOCK_ALLIDS( idl ) ) {
802 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
803 for ( i=0; i < ID_BLOCK_NIDS(idl); i++ ) {
804 if ( ID_BLOCK_ID(idl, i) == id ) {
805 if( --ID_BLOCK_NIDS(idl) == 0 ) {
806 ldbm_cache_delete( db, key );
810 &ID_BLOCK_ID(idl, i),
811 &ID_BLOCK_ID(idl, i+1),
812 (ID_BLOCK_NIDS(idl)-i) * sizeof(ID) );
814 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)) = NOID;
816 idl_store( be, db, key, idl );
822 /* We didn't find the ID. Hmmm... */
828 /* We have to go through an indirect block and find the ID
831 for ( nids = 0; !ID_BLOCK_NOID(idl, nids); nids++ )
834 cont_alloc( &data, &key );
836 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
839 cont_id( &data, ID_BLOCK_ID(idl, j) );
841 if ( (tmp = idl_fetch_one( be, db, data )) == NULL ) {
843 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
844 "idl_delete_key: idl_fetch_one returned NULL\n" ));
846 Debug( LDAP_DEBUG_ANY,
847 "idl_delete_key: idl_fetch of returned NULL\n", 0, 0, 0 );
853 Now try to find the ID in tmp
855 for ( i=0; i < ID_BLOCK_NIDS(tmp); i++ )
857 if ( ID_BLOCK_ID(tmp, i) == id )
860 &ID_BLOCK_ID(tmp, i),
861 &ID_BLOCK_ID(tmp, i+1),
862 (ID_BLOCK_NIDS(tmp)-(i+1)) * sizeof(ID));
863 ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp)-1 ) = NOID;
864 ID_BLOCK_NIDS(tmp)--;
866 if ( ID_BLOCK_NIDS(tmp) ) {
867 idl_store ( be, db, data, tmp );
870 ldbm_cache_delete( db, data );
872 &ID_BLOCK_ID(idl, j),
873 &ID_BLOCK_ID(idl, j+1),
874 (nids-(j+1)) * sizeof(ID));
875 ID_BLOCK_ID(idl, nids-1) = NOID;
878 ldbm_cache_delete( db, key );
880 idl_store( be, db, key, idl );
897 /* return a duplicate of a single ID_BLOCK */
899 idl_dup( ID_BLOCK *idl )
907 new = idl_alloc( ID_BLOCK_NMAX(idl) );
912 (ID_BLOCK_NMAX(idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
918 /* return the smaller ID_BLOCK */
920 idl_min( ID_BLOCK *a, ID_BLOCK *b )
922 return( ID_BLOCK_NIDS(a) > ID_BLOCK_NIDS(b) ? b : a );
927 * idl_intersection - return a intersection b
936 unsigned int ai, bi, ni;
939 if ( a == NULL || b == NULL ) {
942 if ( ID_BLOCK_ALLIDS( a ) ) {
943 return( idl_dup( b ) );
945 if ( ID_BLOCK_ALLIDS( b ) ) {
946 return( idl_dup( a ) );
949 n = idl_dup( idl_min( a, b ) );
951 for ( ni = 0, ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
953 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
959 if ( bi == ID_BLOCK_NIDS(b) ) {
963 if ( ID_BLOCK_ID(b, bi) == ID_BLOCK_ID(a, ai) ) {
964 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
972 ID_BLOCK_NIDS(n) = ni;
979 * idl_union - return a union b
988 unsigned int ai, bi, ni;
992 return( idl_dup( b ) );
995 return( idl_dup( a ) );
997 if ( ID_BLOCK_ALLIDS( a ) || ID_BLOCK_ALLIDS( b ) ) {
998 return( idl_allids( be ) );
1001 if ( ID_BLOCK_NIDS(b) < ID_BLOCK_NIDS(a) ) {
1007 n = idl_alloc( ID_BLOCK_NIDS(a) + ID_BLOCK_NIDS(b) );
1009 for ( ni = 0, ai = 0, bi = 0;
1010 ai < ID_BLOCK_NIDS(a) && bi < ID_BLOCK_NIDS(b);
1013 if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
1014 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai++);
1016 } else if ( ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai) ) {
1017 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi++);
1020 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1025 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1026 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1028 for ( ; bi < ID_BLOCK_NIDS(b); bi++ ) {
1029 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi);
1031 ID_BLOCK_NIDS(n) = ni;
1038 * idl_notin - return a intersection ~b (or a minus b)
1047 unsigned int ni, ai, bi;
1053 if ( b == NULL || ID_BLOCK_ALLIDS( b )) {
1054 return( idl_dup( a ) );
1057 if ( ID_BLOCK_ALLIDS( a ) ) {
1058 n = idl_alloc( SLAPD_LDBM_MIN_MAXIDS );
1061 for ( ai = 1, bi = 0;
1062 ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAX(n) && bi < ID_BLOCK_NMAX(b);
1065 if ( ID_BLOCK_ID(b, bi) == ai ) {
1068 ID_BLOCK_ID(n, ni++) = ai;
1072 for ( ; ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAX(n); ai++ ) {
1073 ID_BLOCK_ID(n, ni++) = ai;
1076 if ( ni == ID_BLOCK_NMAX(n) ) {
1078 return( idl_allids( be ) );
1080 ID_BLOCK_NIDS(n) = ni;
1088 for ( ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
1090 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
1096 if ( bi == ID_BLOCK_NIDS(b) ) {
1100 if ( ID_BLOCK_ID(b, bi) != ID_BLOCK_ID(a, ai) ) {
1101 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1105 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1106 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1108 ID_BLOCK_NIDS(n) = ni;
1113 /* return the first ID in the block
1116 * otherwise return NOID
1117 * otherwise return first ID
1119 * cursor is set to 1
1122 idl_firstid( ID_BLOCK *idl, ID *cursor )
1126 if ( idl == NULL || ID_BLOCK_NIDS(idl) == 0 ) {
1130 if ( ID_BLOCK_ALLIDS( idl ) ) {
1131 return( ID_BLOCK_NIDS(idl) > 1 ? 1 : NOID );
1134 return( ID_BLOCK_ID(idl, 0) );
1138 * if ALLIDS block, cursor is id.
1140 * if id < NIDS return id
1142 * otherwise cursor is index into block
1144 * return id at index then increment
1147 idl_nextid( ID_BLOCK *idl, ID *cursor )
1149 if ( ID_BLOCK_ALLIDS( idl ) ) {
1150 if( ++(*cursor) < ID_BLOCK_NIDS(idl) ) {
1157 if ( *cursor < ID_BLOCK_NIDS(idl) ) {
1158 return( ID_BLOCK_ID(idl, (*cursor)++) );