1 /* idl.c - ldap id list handling routines */
10 #include "ldapconfig.h"
12 #include "back-ldbm.h"
14 static ID_BLOCK* idl_dup( ID_BLOCK *idl );
16 /* Allocate an ID_BLOCK with room for nids ids */
22 /* nmax + nids + space for the ids */
23 new = (ID_BLOCK *) ch_calloc( (ID_BLOCK_IDS_OFFSET + nids), sizeof(ID) );
24 ID_BLOCK_NMAX(new) = nids;
25 ID_BLOCK_NIDS(new) = 0;
31 /* Allocate an empty ALLIDS ID_BLOCK */
33 idl_allids( Backend *be )
38 ID_BLOCK_NMAX(idl) = ID_BLOCK_ALLIDS_VALUE;
39 ID_BLOCK_NIDS(idl) = next_id_get( be );
45 /* Free an ID_BLOCK */
47 idl_free( ID_BLOCK *idl )
50 Debug( LDAP_DEBUG_TRACE,
51 "idl_free: called with NULL pointer\n",
60 /* Fetch an single ID_BLOCK from the cache */
71 ldbm_datum_init( data );
73 /* Debug( LDAP_DEBUG_TRACE, "=> idl_fetch_one\n", 0, 0, 0 ); */
75 data = ldbm_cache_fetch( db, key );
77 if( data.dptr == NULL ) {
81 idl = idl_dup( (ID_BLOCK *) data.dptr);
82 ldbm_datum_free( db->dbc_db, data );
88 /* Fetch a set of ID_BLOCKs from the cache
90 * if block return is an ALLIDS block,
91 * return an new ALLIDS block
94 * construct super block from all blocks referenced by INDIRECT block
110 idl = idl_fetch_one( be, db, key );
116 if ( ID_BLOCK_ALLIDS(idl) ) {
118 /* make sure we have the current value of highest id */
120 idl = idl_allids( be );
125 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
131 * this is an indirect block which points to other blocks.
132 * we need to read in all the blocks it points to and construct
133 * a big id list containing all the ids, which we will return.
136 /* count the number of blocks & allocate space for pointers to them */
137 for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ )
139 tmp = (ID_BLOCK **) ch_malloc( (i + 1) * sizeof(ID_BLOCK *) );
141 /* read in all the blocks */
142 kstr = (char *) ch_malloc( key.dsize + 20 );
144 for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ ) {
145 ldbm_datum_init( data );
147 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr, ID_BLOCK_ID(idl, i) );
149 data.dsize = strlen( kstr ) + 1;
151 if ( (tmp[i] = idl_fetch_one( be, db, data )) == NULL ) {
152 Debug( LDAP_DEBUG_ANY,
153 "idl_fetch of (%s) returns NULL\n", data.dptr, 0, 0 );
157 nids += ID_BLOCK_NIDS(tmp[i]);
163 /* allocate space for the big block */
164 idl = idl_alloc( nids );
165 ID_BLOCK_NIDS(idl) = nids;
168 /* copy in all the ids from the component blocks */
169 for ( i = 0; tmp[i] != NULL; i++ ) {
170 if ( tmp[i] == NULL ) {
175 (char *) &ID_BLOCK_ID(idl, nids),
176 (char *) &ID_BLOCK_ID(tmp[i], 0),
177 ID_BLOCK_NIDS(tmp[i]) * sizeof(ID) );
178 nids += ID_BLOCK_NIDS(tmp[i]);
182 free( (char *) tmp );
184 Debug( LDAP_DEBUG_TRACE, "<= idl_fetch %lu ids (%lu max)\n",
185 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAX(idl), 0 );
190 /* store a single block */
201 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
203 ldbm_datum_init( data );
205 /* Debug( LDAP_DEBUG_TRACE, "=> idl_store\n", 0, 0, 0 ); */
207 data.dptr = (char *) idl;
208 data.dsize = (ID_BLOCK_IDS_OFFSET + ID_BLOCK_NMAX(idl)) * sizeof(ID);
211 Statslog( LDAP_DEBUG_STATS, "<= idl_store(): rc=%d\n",
215 flags = LDBM_REPLACE;
216 if( li->li_dbcachewsync ) flags |= LDBM_SYNC;
217 rc = ldbm_cache_store( db, key, data, flags );
219 /* Debug( LDAP_DEBUG_TRACE, "<= idl_store %d\n", rc, 0, 0 ); */
224 /* split the block at id
225 * locate ID greater than or equal to id.
237 /* find where to split the block *//* XXX linear search XXX */
238 for ( nr = 0; nr < ID_BLOCK_NIDS(b) && id > ID_BLOCK_ID(b, nr); nr++ )
241 nl = ID_BLOCK_NIDS(b) - nr;
243 *right = idl_alloc( nr == 0 ? 1 : nr );
244 *left = idl_alloc( nl + (nr == 0 ? 0 : 1));
247 * everything before the id being inserted in the first block
248 * unless there is nothing, in which case the id being inserted
252 ID_BLOCK_NIDS(*right) = 1;
253 ID_BLOCK_ID(*right, 0) = id;
256 (char *) &ID_BLOCK_ID(*right, 0),
257 (char *) &ID_BLOCK_ID(b, 0),
259 ID_BLOCK_NIDS(*right) = nr;
260 ID_BLOCK_ID(*left, 0) = id;
263 /* the id being inserted & everything after in the second block */
265 (char *) &ID_BLOCK_ID(*left, (nr == 0 ? 0 : 1)),
266 (char *) &ID_BLOCK_ID(b, nr),
268 ID_BLOCK_NIDS(*left) = nl + (nr == 0 ? 0 : 1);
273 * idl_change_first - called when an indirect block's first key has
274 * changed, meaning it needs to be stored under a new key, and the
275 * header block pointing to it needs updating.
281 Datum hkey, /* header block key */
282 ID_BLOCK *h, /* header block */
283 int pos, /* pos in h to update */
284 Datum bkey, /* data block key */
285 ID_BLOCK *b /* data block */
290 /* Debug( LDAP_DEBUG_TRACE, "=> idl_change_first\n", 0, 0, 0 ); */
292 /* delete old key block */
293 if ( (rc = ldbm_cache_delete( db, bkey )) != 0 ) {
294 Debug( LDAP_DEBUG_ANY,
295 "ldbm_delete of (%s) returns %d\n", bkey.dptr, rc,
300 /* write block with new key */
301 sprintf( bkey.dptr, "%c%s%ld", CONT_PREFIX, hkey.dptr, ID_BLOCK_ID(b, 0) );
302 bkey.dsize = strlen( bkey.dptr ) + 1;
303 if ( (rc = idl_store( be, db, bkey, b )) != 0 ) {
304 Debug( LDAP_DEBUG_ANY,
305 "idl_store of (%s) returns %d\n", bkey.dptr, rc, 0 );
309 /* update + write indirect header block */
310 ID_BLOCK_ID(h, pos) = ID_BLOCK_ID(b, 0);
311 if ( (rc = idl_store( be, db, hkey, h )) != 0 ) {
312 Debug( LDAP_DEBUG_ANY,
313 "idl_store of (%s) returns %d\n", hkey.dptr, rc, 0 );
330 ID_BLOCK *idl, *tmp, *tmp2, *tmp3;
334 ldbm_datum_init( k2 );
336 if ( (idl = idl_fetch_one( be, db, key )) == NULL ) {
338 Statslog( LDAP_DEBUG_STATS, "=> idl_insert_key(): no key yet\n",
342 idl = idl_alloc( 1 );
343 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)++) = id;
344 rc = idl_store( be, db, key, idl );
350 if ( ID_BLOCK_ALLIDS( idl ) ) {
356 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
358 switch ( idl_insert( &idl, id, db->dbc_maxids ) ) {
359 case 0: /* id inserted - store the updated block */
361 rc = idl_store( be, db, key, idl );
364 case 2: /* id already there - nothing to do */
368 case 3: /* id not inserted - block must be split */
369 /* check threshold for marking this an all-id block */
370 if ( db->dbc_maxindirect < 2 ) {
372 idl = idl_allids( be );
373 rc = idl_store( be, db, key, idl );
379 idl_split_block( idl, id, &tmp, &tmp2 );
382 /* create the header indirect block */
383 idl = idl_alloc( 3 );
384 ID_BLOCK_NMAX(idl) = 3;
385 ID_BLOCK_NIDS(idl) = ID_BLOCK_INDIRECT_VALUE;
386 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
387 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
388 ID_BLOCK_ID(idl, 2) = NOID;
391 rc = idl_store( be, db, key, idl );
393 /* store the first id block */
394 kstr = (char *) ch_malloc( key.dsize + 20 );
395 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
396 ID_BLOCK_ID(tmp, 0) );
398 k2.dsize = strlen( kstr ) + 1;
399 rc = idl_store( be, db, k2, tmp );
401 /* store the second id block */
402 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
403 ID_BLOCK_ID(tmp2, 0) );
405 k2.dsize = strlen( kstr ) + 1;
406 rc = idl_store( be, db, k2, tmp2 );
419 * this is an indirect block which points to other blocks.
420 * we need to read in the block into which the id should be
421 * inserted, then insert the id and store the block. we might
422 * have to split the block if it is full, which means we also
423 * need to write a new "header" block.
426 /* select the block to try inserting into *//* XXX linear search XXX */
427 for ( i = 0; !ID_BLOCK_NOID(idl, i) && id > ID_BLOCK_ID(idl, i); i++ )
437 kstr = (char *) ch_malloc( key.dsize + 20 );
438 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr, ID_BLOCK_ID(idl, i) );
440 k2.dsize = strlen( kstr ) + 1;
441 if ( (tmp = idl_fetch_one( be, db, k2 )) == NULL ) {
442 Debug( LDAP_DEBUG_ANY, "nonexistent continuation block (%s)\n",
449 switch ( idl_insert( &tmp, id, db->dbc_maxids ) ) {
450 case 0: /* id inserted ok */
451 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
452 Debug( LDAP_DEBUG_ANY,
453 "idl_store of (%s) returns %d\n", k2.dptr, rc, 0 );
457 case 1: /* id inserted - first id in block has changed */
459 * key for this block has changed, so we have to
460 * write the block under the new key, delete the
461 * old key block + update and write the indirect
465 rc = idl_change_first( be, db, key, idl, i, k2, tmp );
468 case 2: /* id not inserted - already there */
471 case 3: /* id not inserted - block is full */
473 * first, see if it will fit in the next block,
474 * without splitting, unless we're trying to insert
475 * into the beginning of the first block.
478 /* is there a next block? */
479 if ( !first && !ID_BLOCK_NOID(idl, i + 1) ) {
481 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
482 ID_BLOCK_ID(idl, i + 1) );
484 k2.dsize = strlen( kstr ) + 1;
485 if ( (tmp2 = idl_fetch_one( be, db, k2 )) == NULL ) {
486 Debug( LDAP_DEBUG_ANY,
487 "idl_fetch_one (%s) returns NULL\n",
492 switch ( (rc = idl_insert( &tmp2, id,
493 db->dbc_maxids )) ) {
494 case 1: /* id inserted first in block */
495 rc = idl_change_first( be, db, key, idl,
499 case 2: /* id already there - how? */
500 case 0: /* id inserted */
502 Debug( LDAP_DEBUG_ANY,
503 "id %lu already in next block\n",
512 case 3: /* split the original block */
520 * must split the block, write both new blocks + update
521 * and write the indirect header block.
524 /* count how many indirect blocks *//* XXX linear count XXX */
525 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
528 /* check it against all-id thresholed */
529 if ( j + 1 > db->dbc_maxindirect ) {
531 * we've passed the all-id threshold, meaning
532 * that this set of blocks should be replaced
533 * by a single "all-id" block. our job: delete
534 * all the indirect blocks, and replace the header
535 * block by an all-id block.
538 /* delete all indirect blocks */
539 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ ) {
540 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
541 ID_BLOCK_ID(idl, j) );
543 k2.dsize = strlen( kstr ) + 1;
545 rc = ldbm_cache_delete( db, k2 );
548 /* store allid block in place of header block */
550 idl = idl_allids( be );
551 rc = idl_store( be, db, key, idl );
559 idl_split_block( tmp, id, &tmp2, &tmp3 );
562 /* create a new updated indirect header block */
563 tmp = idl_alloc( ID_BLOCK_NMAX(idl) + 1 );
564 ID_BLOCK_NIDS(tmp) = ID_BLOCK_INDIRECT_VALUE;
565 /* everything up to the split block */
567 (char *) &ID_BLOCK_ID(tmp, 0),
568 (char *) &ID_BLOCK_ID(idl, 0),
570 /* the two new blocks */
571 ID_BLOCK_ID(tmp, i) = ID_BLOCK_ID(tmp2, 0);
572 ID_BLOCK_ID(tmp, i + 1) = ID_BLOCK_ID(tmp3, 0);
573 /* everything after the split block */
575 (char *) &ID_BLOCK_ID(tmp, i + 2),
576 (char *) &ID_BLOCK_ID(idl, i + 1),
577 (ID_BLOCK_NMAX(idl) - i - 1) * sizeof(ID) );
579 /* store the header block */
580 rc = idl_store( be, db, key, tmp );
582 /* store the first id block */
583 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
584 ID_BLOCK_ID(tmp2, 0) );
586 k2.dsize = strlen( kstr ) + 1;
587 rc = idl_store( be, db, k2, tmp2 );
589 /* store the second id block */
590 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
591 ID_BLOCK_ID(tmp3, 0) );
593 k2.dsize = strlen( kstr ) + 1;
594 rc = idl_store( be, db, k2, tmp3 );
609 * idl_insert - insert an id into an id list.
613 * 1 id inserted, first id in block has changed
614 * 2 id not inserted, already there
615 * 3 id not inserted, block must be split
618 idl_insert( ID_BLOCK **idl, ID id, int maxids )
622 if ( ID_BLOCK_ALLIDS( *idl ) ) {
623 return( 2 ); /* already there */
626 /* is it already there? *//* XXX linear search XXX */
627 for ( i = 0; i < ID_BLOCK_NIDS(*idl) && id > ID_BLOCK_ID(*idl, i); i++ ) {
630 if ( i < ID_BLOCK_NIDS(*idl) && ID_BLOCK_ID(*idl, i) == id ) {
631 return( 2 ); /* already there */
634 /* do we need to make room for it? */
635 if ( ID_BLOCK_NIDS(*idl) == ID_BLOCK_NMAX(*idl) ) {
636 /* make room or indicate block needs splitting */
637 if ( ID_BLOCK_NMAX(*idl) >= maxids ) {
638 return( 3 ); /* block needs splitting */
641 ID_BLOCK_NMAX(*idl) *= 2;
642 if ( ID_BLOCK_NMAX(*idl) > maxids ) {
643 ID_BLOCK_NMAX(*idl) = maxids;
645 *idl = (ID_BLOCK *) ch_realloc( (char *) *idl,
646 (ID_BLOCK_NMAX(*idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
649 /* make a slot for the new id *//* XXX bubble move XXX */
650 for ( j = ID_BLOCK_NIDS(*idl); j != i; j-- ) {
651 ID_BLOCK_ID(*idl, j) = ID_BLOCK_ID(*idl, j-1);
653 ID_BLOCK_ID(*idl, i) = id;
654 ID_BLOCK_NIDS(*idl)++;
656 (char *) &ID_BLOCK_ID((*idl), ID_BLOCK_NIDS(*idl)),
658 (ID_BLOCK_NMAX(*idl) - ID_BLOCK_NIDS(*idl)) * sizeof(ID) );
660 return( i == 0 ? 1 : 0 ); /* inserted - first id changed or not */
678 if ( (idl = idl_fetch_one( be, db, key ) ) == NULL )
680 /* It wasn't found. Hmm... */
684 if ( ID_BLOCK_ALLIDS( idl ) ) {
689 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
690 for ( i=0; i < ID_BLOCK_NIDS(idl); i++ ) {
691 if ( ID_BLOCK_ID(idl, i) == id ) {
692 if( --ID_BLOCK_NIDS(idl) == 0 ) {
693 ldbm_cache_delete( db, key );
697 &ID_BLOCK_ID(idl, i),
698 &ID_BLOCK_ID(idl, i+1),
699 (ID_BLOCK_NIDS(idl)-i) * sizeof(ID) );
701 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)) = NOID;
703 idl_store( be, db, key, idl );
708 /* We didn't find the ID. Hmmm... */
713 /* We have to go through an indirect block and find the ID
716 for ( nids = 0; !ID_BLOCK_NOID(idl, nids); nids++ )
718 kstr = (char *) ch_malloc( key.dsize + 20 );
720 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
722 ldbm_datum_init( data );
723 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr, ID_BLOCK_ID(idl, j) );
725 data.dsize = strlen( kstr ) + 1;
727 if ( (tmp = idl_fetch_one( be, db, data )) == NULL ) {
728 Debug( LDAP_DEBUG_ANY,
729 "idl_fetch of (%s) returns NULL\n", data.dptr, 0, 0 );
733 Now try to find the ID in tmp
735 for ( i=0; i < ID_BLOCK_NIDS(tmp); i++ )
737 if ( ID_BLOCK_ID(tmp, i) == id )
740 &ID_BLOCK_ID(tmp, i),
741 &ID_BLOCK_ID(tmp, i+1),
742 (ID_BLOCK_NIDS(tmp)-(i+1)) * sizeof(ID));
743 ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp)-1 ) = NOID;
744 ID_BLOCK_NIDS(tmp)--;
746 if ( ID_BLOCK_NIDS(tmp) ) {
747 idl_store ( be, db, data, tmp );
750 ldbm_cache_delete( db, data );
752 &ID_BLOCK_ID(idl, j),
753 &ID_BLOCK_ID(idl, j+1),
754 (nids-(j+1)) * sizeof(ID));
755 ID_BLOCK_ID(idl, nids-1) = NOID;
758 ldbm_cache_delete( db, key );
760 idl_store( be, db, key, idl );
772 /* return a duplicate of a single ID_BLOCK */
774 idl_dup( ID_BLOCK *idl )
782 new = idl_alloc( ID_BLOCK_NMAX(idl) );
787 (ID_BLOCK_NMAX(idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
793 /* return the smaller ID_BLOCK */
795 idl_min( ID_BLOCK *a, ID_BLOCK *b )
797 return( ID_BLOCK_NIDS(a) > ID_BLOCK_NIDS(b) ? b : a );
802 * idl_intersection - return a intersection b
811 unsigned int ai, bi, ni;
814 if ( a == NULL || b == NULL ) {
817 if ( ID_BLOCK_ALLIDS( a ) ) {
818 return( idl_dup( b ) );
820 if ( ID_BLOCK_ALLIDS( b ) ) {
821 return( idl_dup( a ) );
824 n = idl_dup( idl_min( a, b ) );
826 for ( ni = 0, ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
828 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
834 if ( bi == ID_BLOCK_NIDS(b) ) {
838 if ( ID_BLOCK_ID(b, bi) == ID_BLOCK_ID(a, ai) ) {
839 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
847 ID_BLOCK_NIDS(n) = ni;
854 * idl_union - return a union b
863 unsigned int ai, bi, ni;
867 return( idl_dup( b ) );
870 return( idl_dup( a ) );
872 if ( ID_BLOCK_ALLIDS( a ) || ID_BLOCK_ALLIDS( b ) ) {
873 return( idl_allids( be ) );
876 if ( ID_BLOCK_NIDS(b) < ID_BLOCK_NIDS(a) ) {
882 n = idl_alloc( ID_BLOCK_NIDS(a) + ID_BLOCK_NIDS(b) );
884 for ( ni = 0, ai = 0, bi = 0;
885 ai < ID_BLOCK_NIDS(a) && bi < ID_BLOCK_NIDS(b);
888 if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
889 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai++);
891 } else if ( ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai) ) {
892 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi++);
895 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
900 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
901 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
903 for ( ; bi < ID_BLOCK_NIDS(b); bi++ ) {
904 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi);
906 ID_BLOCK_NIDS(n) = ni;
913 * idl_notin - return a intersection ~b (or a minus b)
922 unsigned int ni, ai, bi;
928 if ( b == NULL || ID_BLOCK_ALLIDS( b )) {
929 return( idl_dup( a ) );
932 if ( ID_BLOCK_ALLIDS( a ) ) {
933 n = idl_alloc( SLAPD_LDBM_MIN_MAXIDS );
936 for ( ai = 1, bi = 0;
937 ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAX(n) && bi < ID_BLOCK_NMAX(b);
940 if ( ID_BLOCK_ID(b, bi) == ai ) {
943 ID_BLOCK_ID(n, ni++) = ai;
947 for ( ; ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAX(n); ai++ ) {
948 ID_BLOCK_ID(n, ni++) = ai;
951 if ( ni == ID_BLOCK_NMAX(n) ) {
953 return( idl_allids( be ) );
955 ID_BLOCK_NIDS(n) = ni;
963 for ( ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
965 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
971 if ( bi == ID_BLOCK_NIDS(b) ) {
975 if ( ID_BLOCK_ID(b, bi) != ID_BLOCK_ID(a, ai) ) {
976 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
980 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
981 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
983 ID_BLOCK_NIDS(n) = ni;
988 /* return the first ID in the block
991 * otherwise return NOID
992 * otherwise return first ID
995 idl_firstid( ID_BLOCK *idl )
997 if ( idl == NULL || ID_BLOCK_NIDS(idl) == 0 ) {
1001 if ( ID_BLOCK_ALLIDS( idl ) ) {
1002 return( ID_BLOCK_NIDS(idl) > 1 ? 1 : NOID );
1005 return( ID_BLOCK_ID(idl, 0) );
1008 /* return next ID after id
1009 * if ALLIDS block, increment id.
1010 * if id < NIDS return id
1012 * otherwise SEARCH for next id (ugh!)
1015 idl_nextid( ID_BLOCK *idl, ID id )
1019 if ( ID_BLOCK_ALLIDS( idl ) ) {
1020 return( ++id < ID_BLOCK_NIDS(idl) ? id : NOID );
1023 for ( i = 0; i < ID_BLOCK_NIDS(idl) && ID_BLOCK_ID(idl, i) <= id; i++ ) {
1027 if ( i >= ID_BLOCK_NIDS(idl) ) {
1030 return( ID_BLOCK_ID(idl, i) );