1 /* idl.c - ldap id list handling routines */
10 #include "ldap_defaults.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 */
18 idl_alloc( unsigned int nids )
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 %ld ids (%ld 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 );
377 idl_split_block( idl, id, &tmp, &tmp2 );
380 /* create the header indirect block */
381 idl = idl_alloc( 3 );
382 ID_BLOCK_NMAX(idl) = 3;
383 ID_BLOCK_NIDS(idl) = ID_BLOCK_INDIRECT_VALUE;
384 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
385 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
386 ID_BLOCK_ID(idl, 2) = NOID;
389 rc = idl_store( be, db, key, idl );
391 /* store the first id block */
392 kstr = (char *) ch_malloc( key.dsize + 20 );
393 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
394 ID_BLOCK_ID(tmp, 0) );
396 k2.dsize = strlen( kstr ) + 1;
397 rc = idl_store( be, db, k2, tmp );
399 /* store the second id block */
400 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
401 ID_BLOCK_ID(tmp2, 0) );
403 k2.dsize = strlen( kstr ) + 1;
404 rc = idl_store( be, db, k2, tmp2 );
417 * this is an indirect block which points to other blocks.
418 * we need to read in the block into which the id should be
419 * inserted, then insert the id and store the block. we might
420 * have to split the block if it is full, which means we also
421 * need to write a new "header" block.
424 /* select the block to try inserting into *//* XXX linear search XXX */
425 for ( i = 0; !ID_BLOCK_NOID(idl, i) && id > ID_BLOCK_ID(idl, i); i++ )
435 kstr = (char *) ch_malloc( key.dsize + 20 );
436 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr, ID_BLOCK_ID(idl, i) );
438 k2.dsize = strlen( kstr ) + 1;
439 if ( (tmp = idl_fetch_one( be, db, k2 )) == NULL ) {
440 Debug( LDAP_DEBUG_ANY, "nonexistent continuation block (%s)\n",
448 switch ( idl_insert( &tmp, id, db->dbc_maxids ) ) {
449 case 0: /* id inserted ok */
450 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
451 Debug( LDAP_DEBUG_ANY,
452 "idl_store of (%s) returns %d\n", k2.dptr, rc, 0 );
456 case 1: /* id inserted - first id in block has changed */
458 * key for this block has changed, so we have to
459 * write the block under the new key, delete the
460 * old key block + update and write the indirect
464 rc = idl_change_first( be, db, key, idl, i, k2, tmp );
467 case 2: /* id not inserted - already there */
470 case 3: /* id not inserted - block is full */
472 * first, see if it will fit in the next block,
473 * without splitting, unless we're trying to insert
474 * into the beginning of the first block.
477 /* is there a next block? */
478 if ( !first && !ID_BLOCK_NOID(idl, i + 1) ) {
480 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
481 ID_BLOCK_ID(idl, i + 1) );
483 k2.dsize = strlen( kstr ) + 1;
484 if ( (tmp2 = idl_fetch_one( be, db, k2 )) == NULL ) {
485 Debug( LDAP_DEBUG_ANY,
486 "idl_fetch_one (%s) returns NULL\n",
491 switch ( (rc = idl_insert( &tmp2, id,
492 db->dbc_maxids )) ) {
493 case 1: /* id inserted first in block */
494 rc = idl_change_first( be, db, key, idl,
498 case 2: /* id already there - how? */
499 case 0: /* id inserted */
501 Debug( LDAP_DEBUG_ANY,
502 "id %ld already in next block\n",
511 case 3: /* split the original block */
518 * must split the block, write both new blocks + update
519 * and write the indirect header block.
522 /* count how many indirect blocks *//* XXX linear count XXX */
523 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
526 /* check it against all-id thresholed */
527 if ( j + 1 > db->dbc_maxindirect ) {
529 * we've passed the all-id threshold, meaning
530 * that this set of blocks should be replaced
531 * by a single "all-id" block. our job: delete
532 * all the indirect blocks, and replace the header
533 * block by an all-id block.
536 /* delete all indirect blocks */
537 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ ) {
538 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
539 ID_BLOCK_ID(idl, j) );
541 k2.dsize = strlen( kstr ) + 1;
543 rc = ldbm_cache_delete( db, k2 );
546 /* store allid block in place of header block */
548 idl = idl_allids( be );
549 rc = idl_store( be, db, key, idl );
557 idl_split_block( tmp, id, &tmp2, &tmp3 );
560 /* create a new updated indirect header block */
561 tmp = idl_alloc( ID_BLOCK_NMAX(idl) + 1 );
562 ID_BLOCK_NIDS(tmp) = ID_BLOCK_INDIRECT_VALUE;
563 /* everything up to the split block */
565 (char *) &ID_BLOCK_ID(tmp, 0),
566 (char *) &ID_BLOCK_ID(idl, 0),
568 /* the two new blocks */
569 ID_BLOCK_ID(tmp, i) = ID_BLOCK_ID(tmp2, 0);
570 ID_BLOCK_ID(tmp, i + 1) = ID_BLOCK_ID(tmp3, 0);
571 /* everything after the split block */
573 (char *) &ID_BLOCK_ID(tmp, i + 2),
574 (char *) &ID_BLOCK_ID(idl, i + 1),
575 (ID_BLOCK_NMAX(idl) - i - 1) * sizeof(ID) );
577 /* store the header block */
578 rc = idl_store( be, db, key, tmp );
580 /* store the first id block */
581 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
582 ID_BLOCK_ID(tmp2, 0) );
584 k2.dsize = strlen( kstr ) + 1;
585 rc = idl_store( be, db, k2, tmp2 );
587 /* store the second id block */
588 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
589 ID_BLOCK_ID(tmp3, 0) );
591 k2.dsize = strlen( kstr ) + 1;
592 rc = idl_store( be, db, k2, tmp3 );
607 * idl_insert - insert an id into an id list.
611 * 1 id inserted, first id in block has changed
612 * 2 id not inserted, already there
613 * 3 id not inserted, block must be split
616 idl_insert( ID_BLOCK **idl, ID id, unsigned int maxids )
620 if ( ID_BLOCK_ALLIDS( *idl ) ) {
621 return( 2 ); /* already there */
624 /* is it already there? *//* XXX linear search XXX */
625 for ( i = 0; i < ID_BLOCK_NIDS(*idl) && id > ID_BLOCK_ID(*idl, i); i++ ) {
628 if ( i < ID_BLOCK_NIDS(*idl) && ID_BLOCK_ID(*idl, i) == id ) {
629 return( 2 ); /* already there */
632 /* do we need to make room for it? */
633 if ( ID_BLOCK_NIDS(*idl) == ID_BLOCK_NMAX(*idl) ) {
634 /* make room or indicate block needs splitting */
635 if ( ID_BLOCK_NMAX(*idl) >= maxids ) {
636 return( 3 ); /* block needs splitting */
639 ID_BLOCK_NMAX(*idl) *= 2;
640 if ( ID_BLOCK_NMAX(*idl) > maxids ) {
641 ID_BLOCK_NMAX(*idl) = maxids;
643 *idl = (ID_BLOCK *) ch_realloc( (char *) *idl,
644 (ID_BLOCK_NMAX(*idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
647 /* make a slot for the new id *//* XXX bubble move XXX */
648 for ( j = ID_BLOCK_NIDS(*idl); j != i; j-- ) {
649 ID_BLOCK_ID(*idl, j) = ID_BLOCK_ID(*idl, j-1);
651 ID_BLOCK_ID(*idl, i) = id;
652 ID_BLOCK_NIDS(*idl)++;
654 (char *) &ID_BLOCK_ID((*idl), ID_BLOCK_NIDS(*idl)),
656 (ID_BLOCK_NMAX(*idl) - ID_BLOCK_NIDS(*idl)) * sizeof(ID) );
658 return( i == 0 ? 1 : 0 ); /* inserted - first id changed or not */
676 if ( (idl = idl_fetch_one( be, db, key ) ) == NULL )
678 /* It wasn't found. Hmm... */
682 if ( ID_BLOCK_ALLIDS( idl ) ) {
687 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
688 for ( i=0; i < ID_BLOCK_NIDS(idl); i++ ) {
689 if ( ID_BLOCK_ID(idl, i) == id ) {
690 if( --ID_BLOCK_NIDS(idl) == 0 ) {
691 ldbm_cache_delete( db, key );
695 &ID_BLOCK_ID(idl, i),
696 &ID_BLOCK_ID(idl, i+1),
697 (ID_BLOCK_NIDS(idl)-i) * sizeof(ID) );
699 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)) = NOID;
701 idl_store( be, db, key, idl );
707 /* 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 );
776 /* return a duplicate of a single ID_BLOCK */
778 idl_dup( ID_BLOCK *idl )
786 new = idl_alloc( ID_BLOCK_NMAX(idl) );
791 (ID_BLOCK_NMAX(idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
797 /* return the smaller ID_BLOCK */
799 idl_min( ID_BLOCK *a, ID_BLOCK *b )
801 return( ID_BLOCK_NIDS(a) > ID_BLOCK_NIDS(b) ? b : a );
806 * idl_intersection - return a intersection b
815 unsigned int ai, bi, ni;
818 if ( a == NULL || b == NULL ) {
821 if ( ID_BLOCK_ALLIDS( a ) ) {
822 return( idl_dup( b ) );
824 if ( ID_BLOCK_ALLIDS( b ) ) {
825 return( idl_dup( a ) );
828 n = idl_dup( idl_min( a, b ) );
830 for ( ni = 0, ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
832 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
838 if ( bi == ID_BLOCK_NIDS(b) ) {
842 if ( ID_BLOCK_ID(b, bi) == ID_BLOCK_ID(a, ai) ) {
843 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
851 ID_BLOCK_NIDS(n) = ni;
858 * idl_union - return a union b
867 unsigned int ai, bi, ni;
871 return( idl_dup( b ) );
874 return( idl_dup( a ) );
876 if ( ID_BLOCK_ALLIDS( a ) || ID_BLOCK_ALLIDS( b ) ) {
877 return( idl_allids( be ) );
880 if ( ID_BLOCK_NIDS(b) < ID_BLOCK_NIDS(a) ) {
886 n = idl_alloc( ID_BLOCK_NIDS(a) + ID_BLOCK_NIDS(b) );
888 for ( ni = 0, ai = 0, bi = 0;
889 ai < ID_BLOCK_NIDS(a) && bi < ID_BLOCK_NIDS(b);
892 if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
893 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai++);
895 } else if ( ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai) ) {
896 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi++);
899 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
904 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
905 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
907 for ( ; bi < ID_BLOCK_NIDS(b); bi++ ) {
908 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi);
910 ID_BLOCK_NIDS(n) = ni;
917 * idl_notin - return a intersection ~b (or a minus b)
926 unsigned int ni, ai, bi;
932 if ( b == NULL || ID_BLOCK_ALLIDS( b )) {
933 return( idl_dup( a ) );
936 if ( ID_BLOCK_ALLIDS( a ) ) {
937 n = idl_alloc( SLAPD_LDBM_MIN_MAXIDS );
940 for ( ai = 1, bi = 0;
941 ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAX(n) && bi < ID_BLOCK_NMAX(b);
944 if ( ID_BLOCK_ID(b, bi) == ai ) {
947 ID_BLOCK_ID(n, ni++) = ai;
951 for ( ; ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAX(n); ai++ ) {
952 ID_BLOCK_ID(n, ni++) = ai;
955 if ( ni == ID_BLOCK_NMAX(n) ) {
957 return( idl_allids( be ) );
959 ID_BLOCK_NIDS(n) = ni;
967 for ( ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
969 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
975 if ( bi == ID_BLOCK_NIDS(b) ) {
979 if ( ID_BLOCK_ID(b, bi) != ID_BLOCK_ID(a, ai) ) {
980 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
984 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
985 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
987 ID_BLOCK_NIDS(n) = ni;
992 /* return the first ID in the block
995 * otherwise return NOID
996 * otherwise return first ID
999 idl_firstid( ID_BLOCK *idl )
1001 if ( idl == NULL || ID_BLOCK_NIDS(idl) == 0 ) {
1005 if ( ID_BLOCK_ALLIDS( idl ) ) {
1006 return( ID_BLOCK_NIDS(idl) > 1 ? 1 : NOID );
1009 return( ID_BLOCK_ID(idl, 0) );
1012 /* return next ID after id
1013 * if ALLIDS block, increment id.
1014 * if id < NIDS return id
1016 * otherwise SEARCH for next id (ugh!)
1019 idl_nextid( ID_BLOCK *idl, ID id )
1023 if ( ID_BLOCK_ALLIDS( idl ) ) {
1024 return( ++id < ID_BLOCK_NIDS(idl) ? id : NOID );
1027 for ( i = 0; i < ID_BLOCK_NIDS(idl) && ID_BLOCK_ID(idl, i) <= id; i++ ) {
1031 if ( i >= ID_BLOCK_NIDS(idl) ) {
1034 return( ID_BLOCK_ID(idl, i) );