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 ldbm_datum_init( data );
112 /* Debug( LDAP_DEBUG_TRACE, "=> idl_fetch\n", 0, 0, 0 ); */
114 data = ldbm_cache_fetch( db, key );
116 if ( data.dptr == NULL ) {
120 idl = idl_dup( (ID_BLOCK *) data.dptr );
121 ldbm_datum_free( db->dbc_db, data);
123 if ( ID_BLOCK_ALLIDS(idl) ) {
125 /* make sure we have the current value of highest id */
127 idl = idl_allids( be );
132 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
138 * this is an indirect block which points to other blocks.
139 * we need to read in all the blocks it points to and construct
140 * a big id list containing all the ids, which we will return.
143 /* count the number of blocks & allocate space for pointers to them */
144 for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ )
146 tmp = (ID_BLOCK **) ch_malloc( (i + 1) * sizeof(ID_BLOCK *) );
148 /* read in all the blocks */
149 kstr = (char *) ch_malloc( key.dsize + 20 );
151 for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ ) {
152 ldbm_datum_init( data );
154 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr, ID_BLOCK_ID(idl, i) );
156 data.dsize = strlen( kstr ) + 1;
158 if ( (tmp[i] = idl_fetch_one( be, db, data )) == NULL ) {
159 Debug( LDAP_DEBUG_ANY,
160 "idl_fetch of (%s) returns NULL\n", data.dptr, 0, 0 );
164 nids += ID_BLOCK_NIDS(tmp[i]);
170 /* allocate space for the big block */
171 idl = idl_alloc( nids );
172 ID_BLOCK_NIDS(idl) = nids;
175 /* copy in all the ids from the component blocks */
176 for ( i = 0; tmp[i] != NULL; i++ ) {
177 if ( tmp[i] == NULL ) {
182 (char *) &ID_BLOCK_ID(idl, nids),
183 (char *) &ID_BLOCK_ID(tmp[i], 0),
184 ID_BLOCK_NIDS(tmp[i]) * sizeof(ID) );
185 nids += ID_BLOCK_NIDS(tmp[i]);
189 free( (char *) tmp );
191 Debug( LDAP_DEBUG_TRACE, "<= idl_fetch %lu ids (%lu max)\n",
192 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAX(idl), 0 );
197 /* store a single block */
208 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
210 ldbm_datum_init( data );
212 /* Debug( LDAP_DEBUG_TRACE, "=> idl_store\n", 0, 0, 0 ); */
214 data.dptr = (char *) idl;
215 data.dsize = (ID_BLOCK_IDS_OFFSET + ID_BLOCK_NMAX(idl)) * sizeof(ID);
218 Statslog( LDAP_DEBUG_STATS, "<= idl_store(): rc=%d\n",
222 flags = LDBM_REPLACE;
223 if( li->li_dbcachewsync ) flags |= LDBM_SYNC;
224 rc = ldbm_cache_store( db, key, data, flags );
226 /* Debug( LDAP_DEBUG_TRACE, "<= idl_store %d\n", rc, 0, 0 ); */
231 /* split the block at id
232 * locate ID greater than or equal to id.
244 /* find where to split the block *//* XXX linear search XXX */
245 for ( nr = 0; nr < ID_BLOCK_NIDS(b) && id > ID_BLOCK_ID(b, nr); nr++ )
248 nl = ID_BLOCK_NIDS(b) - nr;
250 *right = idl_alloc( nr == 0 ? 1 : nr );
251 *left = idl_alloc( nl + (nr == 0 ? 0 : 1));
254 * everything before the id being inserted in the first block
255 * unless there is nothing, in which case the id being inserted
259 ID_BLOCK_NIDS(*right) = 1;
260 ID_BLOCK_ID(*right, 0) = id;
263 (char *) &ID_BLOCK_ID(*right, 0),
264 (char *) &ID_BLOCK_ID(b, 0),
266 ID_BLOCK_NIDS(*right) = nr;
267 ID_BLOCK_ID(*left, 0) = id;
270 /* the id being inserted & everything after in the second block */
272 (char *) &ID_BLOCK_ID(*left, (nr == 0 ? 0 : 1)),
273 (char *) &ID_BLOCK_ID(b, nr),
275 ID_BLOCK_NIDS(*left) = nl + (nr == 0 ? 0 : 1);
280 * idl_change_first - called when an indirect block's first key has
281 * changed, meaning it needs to be stored under a new key, and the
282 * header block pointing to it needs updating.
288 Datum hkey, /* header block key */
289 ID_BLOCK *h, /* header block */
290 int pos, /* pos in h to update */
291 Datum bkey, /* data block key */
292 ID_BLOCK *b /* data block */
297 /* Debug( LDAP_DEBUG_TRACE, "=> idl_change_first\n", 0, 0, 0 ); */
299 /* delete old key block */
300 if ( (rc = ldbm_cache_delete( db, bkey )) != 0 ) {
301 Debug( LDAP_DEBUG_ANY,
302 "ldbm_delete of (%s) returns %d\n", bkey.dptr, rc,
307 /* write block with new key */
308 sprintf( bkey.dptr, "%c%s%ld", CONT_PREFIX, hkey.dptr, ID_BLOCK_ID(b, 0) );
309 bkey.dsize = strlen( bkey.dptr ) + 1;
310 if ( (rc = idl_store( be, db, bkey, b )) != 0 ) {
311 Debug( LDAP_DEBUG_ANY,
312 "idl_store of (%s) returns %d\n", bkey.dptr, rc, 0 );
316 /* update + write indirect header block */
317 ID_BLOCK_ID(h, pos) = ID_BLOCK_ID(b, 0);
318 if ( (rc = idl_store( be, db, hkey, h )) != 0 ) {
319 Debug( LDAP_DEBUG_ANY,
320 "idl_store of (%s) returns %d\n", hkey.dptr, rc, 0 );
337 ID_BLOCK *idl, *tmp, *tmp2, *tmp3;
341 ldbm_datum_init( k2 );
343 if ( (idl = idl_fetch_one( be, db, key )) == NULL ) {
345 Statslog( LDAP_DEBUG_STATS, "=> idl_insert_key(): no key yet\n",
349 idl = idl_alloc( 1 );
350 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)++) = id;
351 rc = idl_store( be, db, key, idl );
357 if ( ID_BLOCK_ALLIDS( idl ) ) {
363 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
365 switch ( idl_insert( &idl, id, db->dbc_maxids ) ) {
366 case 0: /* id inserted - store the updated block */
368 rc = idl_store( be, db, key, idl );
371 case 2: /* id already there - nothing to do */
375 case 3: /* id not inserted - block must be split */
376 /* check threshold for marking this an all-id block */
377 if ( db->dbc_maxindirect < 2 ) {
379 idl = idl_allids( be );
380 rc = idl_store( be, db, key, idl );
386 idl_split_block( idl, id, &tmp, &tmp2 );
389 /* create the header indirect block */
390 idl = idl_alloc( 3 );
391 ID_BLOCK_NMAX(idl) = 3;
392 ID_BLOCK_NIDS(idl) = ID_BLOCK_INDIRECT_VALUE;
393 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
394 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
395 ID_BLOCK_ID(idl, 2) = NOID;
398 rc = idl_store( be, db, key, idl );
400 /* store the first id block */
401 kstr = (char *) ch_malloc( key.dsize + 20 );
402 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
403 ID_BLOCK_ID(tmp, 0) );
405 k2.dsize = strlen( kstr ) + 1;
406 rc = idl_store( be, db, k2, tmp );
408 /* store the second id block */
409 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
410 ID_BLOCK_ID(tmp2, 0) );
412 k2.dsize = strlen( kstr ) + 1;
413 rc = idl_store( be, db, k2, tmp2 );
426 * this is an indirect block which points to other blocks.
427 * we need to read in the block into which the id should be
428 * inserted, then insert the id and store the block. we might
429 * have to split the block if it is full, which means we also
430 * need to write a new "header" block.
433 /* select the block to try inserting into *//* XXX linear search XXX */
434 for ( i = 0; !ID_BLOCK_NOID(idl, i) && id > ID_BLOCK_ID(idl, i); i++ )
444 kstr = (char *) ch_malloc( key.dsize + 20 );
445 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr, ID_BLOCK_ID(idl, i) );
447 k2.dsize = strlen( kstr ) + 1;
448 if ( (tmp = idl_fetch_one( be, db, k2 )) == NULL ) {
449 Debug( LDAP_DEBUG_ANY, "nonexistent continuation block (%s)\n",
456 switch ( idl_insert( &tmp, id, db->dbc_maxids ) ) {
457 case 0: /* id inserted ok */
458 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
459 Debug( LDAP_DEBUG_ANY,
460 "idl_store of (%s) returns %d\n", k2.dptr, rc, 0 );
464 case 1: /* id inserted - first id in block has changed */
466 * key for this block has changed, so we have to
467 * write the block under the new key, delete the
468 * old key block + update and write the indirect
472 rc = idl_change_first( be, db, key, idl, i, k2, tmp );
475 case 2: /* id not inserted - already there */
478 case 3: /* id not inserted - block is full */
480 * first, see if it will fit in the next block,
481 * without splitting, unless we're trying to insert
482 * into the beginning of the first block.
485 /* is there a next block? */
486 if ( !first && !ID_BLOCK_NOID(idl, i + 1) ) {
488 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
489 ID_BLOCK_ID(idl, i + 1) );
491 k2.dsize = strlen( kstr ) + 1;
492 if ( (tmp2 = idl_fetch_one( be, db, k2 )) == NULL ) {
493 Debug( LDAP_DEBUG_ANY,
494 "idl_fetch_one (%s) returns NULL\n",
499 switch ( (rc = idl_insert( &tmp2, id,
500 db->dbc_maxids )) ) {
501 case 1: /* id inserted first in block */
502 rc = idl_change_first( be, db, key, idl,
506 case 2: /* id already there - how? */
507 case 0: /* id inserted */
509 Debug( LDAP_DEBUG_ANY,
510 "id %lu already in next block\n",
519 case 3: /* split the original block */
527 * must split the block, write both new blocks + update
528 * and write the indirect header block.
531 /* count how many indirect blocks *//* XXX linear count XXX */
532 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
535 /* check it against all-id thresholed */
536 if ( j + 1 > db->dbc_maxindirect ) {
538 * we've passed the all-id threshold, meaning
539 * that this set of blocks should be replaced
540 * by a single "all-id" block. our job: delete
541 * all the indirect blocks, and replace the header
542 * block by an all-id block.
545 /* delete all indirect blocks */
546 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ ) {
547 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
548 ID_BLOCK_ID(idl, j) );
550 k2.dsize = strlen( kstr ) + 1;
552 rc = ldbm_cache_delete( db, k2 );
555 /* store allid block in place of header block */
557 idl = idl_allids( be );
558 rc = idl_store( be, db, key, idl );
566 idl_split_block( tmp, id, &tmp2, &tmp3 );
569 /* create a new updated indirect header block */
570 tmp = idl_alloc( ID_BLOCK_NMAX(idl) + 1 );
571 ID_BLOCK_NIDS(tmp) = ID_BLOCK_INDIRECT_VALUE;
572 /* everything up to the split block */
574 (char *) &ID_BLOCK_ID(tmp, 0),
575 (char *) &ID_BLOCK_ID(idl, 0),
577 /* the two new blocks */
578 ID_BLOCK_ID(tmp, i) = ID_BLOCK_ID(tmp2, 0);
579 ID_BLOCK_ID(tmp, i + 1) = ID_BLOCK_ID(tmp3, 0);
580 /* everything after the split block */
582 (char *) &ID_BLOCK_ID(tmp, i + 2),
583 (char *) &ID_BLOCK_ID(idl, i + 1),
584 (ID_BLOCK_NMAX(idl) - i - 1) * sizeof(ID) );
586 /* store the header block */
587 rc = idl_store( be, db, key, tmp );
589 /* store the first id block */
590 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
591 ID_BLOCK_ID(tmp2, 0) );
593 k2.dsize = strlen( kstr ) + 1;
594 rc = idl_store( be, db, k2, tmp2 );
596 /* store the second id block */
597 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr,
598 ID_BLOCK_ID(tmp3, 0) );
600 k2.dsize = strlen( kstr ) + 1;
601 rc = idl_store( be, db, k2, tmp3 );
616 * idl_insert - insert an id into an id list.
620 * 1 id inserted, first id in block has changed
621 * 2 id not inserted, already there
622 * 3 id not inserted, block must be split
625 idl_insert( ID_BLOCK **idl, ID id, int maxids )
629 if ( ID_BLOCK_ALLIDS( *idl ) ) {
630 return( 2 ); /* already there */
633 /* is it already there? *//* XXX linear search XXX */
634 for ( i = 0; i < ID_BLOCK_NIDS(*idl) && id > ID_BLOCK_ID(*idl, i); i++ ) {
637 if ( i < ID_BLOCK_NIDS(*idl) && ID_BLOCK_ID(*idl, i) == id ) {
638 return( 2 ); /* already there */
641 /* do we need to make room for it? */
642 if ( ID_BLOCK_NIDS(*idl) == ID_BLOCK_NMAX(*idl) ) {
643 /* make room or indicate block needs splitting */
644 if ( ID_BLOCK_NMAX(*idl) >= maxids ) {
645 return( 3 ); /* block needs splitting */
648 ID_BLOCK_NMAX(*idl) *= 2;
649 if ( ID_BLOCK_NMAX(*idl) > maxids ) {
650 ID_BLOCK_NMAX(*idl) = maxids;
652 *idl = (ID_BLOCK *) ch_realloc( (char *) *idl,
653 (ID_BLOCK_NMAX(*idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
656 /* make a slot for the new id *//* XXX bubble move XXX */
657 for ( j = ID_BLOCK_NIDS(*idl); j != i; j-- ) {
658 ID_BLOCK_ID(*idl, j) = ID_BLOCK_ID(*idl, j-1);
660 ID_BLOCK_ID(*idl, i) = id;
661 ID_BLOCK_NIDS(*idl)++;
663 (char *) &ID_BLOCK_ID((*idl), ID_BLOCK_NIDS(*idl)),
665 (ID_BLOCK_NMAX(*idl) - ID_BLOCK_NIDS(*idl)) * sizeof(ID) );
667 return( i == 0 ? 1 : 0 ); /* inserted - first id changed or not */
685 if ( (idl = idl_fetch_one( be, db, key ) ) == NULL )
687 /* It wasn't found. Hmm... */
691 if ( ID_BLOCK_ALLIDS( idl ) ) {
696 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
697 for ( i=0; i < ID_BLOCK_NIDS(idl); i++ ) {
698 if ( ID_BLOCK_ID(idl, i) == id ) {
699 if( --ID_BLOCK_NIDS(idl) == 0 ) {
700 ldbm_cache_delete( db, key );
704 &ID_BLOCK_ID(idl, i),
705 &ID_BLOCK_ID(idl, i+1),
706 (ID_BLOCK_NIDS(idl)-i) * sizeof(ID) );
708 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)) = NOID;
710 idl_store( be, db, key, idl );
715 /* We didn't find the ID. Hmmm... */
720 /* We have to go through an indirect block and find the ID
723 for ( nids = 0; !ID_BLOCK_NOID(idl, nids); nids++ )
725 kstr = (char *) ch_malloc( key.dsize + 20 );
727 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
729 ldbm_datum_init( data );
730 sprintf( kstr, "%c%s%ld", CONT_PREFIX, key.dptr, ID_BLOCK_ID(idl, j) );
732 data.dsize = strlen( kstr ) + 1;
734 if ( (tmp = idl_fetch_one( be, db, data )) == NULL ) {
735 Debug( LDAP_DEBUG_ANY,
736 "idl_fetch of (%s) returns NULL\n", data.dptr, 0, 0 );
740 Now try to find the ID in tmp
742 for ( i=0; i < ID_BLOCK_NIDS(tmp); i++ )
744 if ( ID_BLOCK_ID(tmp, i) == id )
747 &ID_BLOCK_ID(tmp, i),
748 &ID_BLOCK_ID(tmp, i+1),
749 (ID_BLOCK_NIDS(tmp)-(i+1)) * sizeof(ID));
750 ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp)-1 ) = NOID;
751 ID_BLOCK_NIDS(tmp)--;
753 if ( ID_BLOCK_NIDS(tmp) ) {
754 idl_store ( be, db, data, tmp );
757 ldbm_cache_delete( db, data );
759 &ID_BLOCK_ID(idl, j),
760 &ID_BLOCK_ID(idl, j+1),
761 (nids-(j+1)) * sizeof(ID));
762 ID_BLOCK_ID(idl, nids-1) = NOID;
765 ldbm_cache_delete( db, key );
767 idl_store( be, db, key, idl );
779 /* return a duplicate of a single ID_BLOCK */
781 idl_dup( ID_BLOCK *idl )
789 new = idl_alloc( ID_BLOCK_NMAX(idl) );
794 (ID_BLOCK_NMAX(idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
800 /* return the smaller ID_BLOCK */
802 idl_min( ID_BLOCK *a, ID_BLOCK *b )
804 return( ID_BLOCK_NIDS(a) > ID_BLOCK_NIDS(b) ? b : a );
809 * idl_intersection - return a intersection b
818 unsigned int ai, bi, ni;
821 if ( a == NULL || b == NULL ) {
824 if ( ID_BLOCK_ALLIDS( a ) ) {
825 return( idl_dup( b ) );
827 if ( ID_BLOCK_ALLIDS( b ) ) {
828 return( idl_dup( a ) );
831 n = idl_dup( idl_min( a, b ) );
833 for ( ni = 0, ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
835 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
841 if ( bi == ID_BLOCK_NIDS(b) ) {
845 if ( ID_BLOCK_ID(b, bi) == ID_BLOCK_ID(a, ai) ) {
846 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
854 ID_BLOCK_NIDS(n) = ni;
861 * idl_union - return a union b
870 unsigned int ai, bi, ni;
874 return( idl_dup( b ) );
877 return( idl_dup( a ) );
879 if ( ID_BLOCK_ALLIDS( a ) || ID_BLOCK_ALLIDS( b ) ) {
880 return( idl_allids( be ) );
883 if ( ID_BLOCK_NIDS(b) < ID_BLOCK_NIDS(a) ) {
889 n = idl_alloc( ID_BLOCK_NIDS(a) + ID_BLOCK_NIDS(b) );
891 for ( ni = 0, ai = 0, bi = 0;
892 ai < ID_BLOCK_NIDS(a) && bi < ID_BLOCK_NIDS(b);
895 if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
896 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai++);
898 } else if ( ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai) ) {
899 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi++);
902 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
907 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
908 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
910 for ( ; bi < ID_BLOCK_NIDS(b); bi++ ) {
911 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi);
913 ID_BLOCK_NIDS(n) = ni;
920 * idl_notin - return a intersection ~b (or a minus b)
929 unsigned int ni, ai, bi;
935 if ( b == NULL || ID_BLOCK_ALLIDS( b )) {
936 return( idl_dup( a ) );
939 if ( ID_BLOCK_ALLIDS( a ) ) {
940 n = idl_alloc( SLAPD_LDBM_MIN_MAXIDS );
943 for ( ai = 1, bi = 0;
944 ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAX(n) && bi < ID_BLOCK_NMAX(b);
947 if ( ID_BLOCK_ID(b, bi) == ai ) {
950 ID_BLOCK_ID(n, ni++) = ai;
954 for ( ; ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAX(n); ai++ ) {
955 ID_BLOCK_ID(n, ni++) = ai;
958 if ( ni == ID_BLOCK_NMAX(n) ) {
960 return( idl_allids( be ) );
962 ID_BLOCK_NIDS(n) = ni;
970 for ( ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
972 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
978 if ( bi == ID_BLOCK_NIDS(b) ) {
982 if ( ID_BLOCK_ID(b, bi) != ID_BLOCK_ID(a, ai) ) {
983 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
987 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
988 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
990 ID_BLOCK_NIDS(n) = ni;
995 /* return the first ID in the block
998 * otherwise return NOID
999 * otherwise return first ID
1002 idl_firstid( ID_BLOCK *idl )
1004 if ( idl == NULL || ID_BLOCK_NIDS(idl) == 0 ) {
1008 if ( ID_BLOCK_ALLIDS( idl ) ) {
1009 return( ID_BLOCK_NIDS(idl) > 1 ? 1 : NOID );
1012 return( ID_BLOCK_ID(idl, 0) );
1015 /* return next ID after id
1016 * if ALLIDS block, increment id.
1017 * if id < NIDS return id
1019 * otherwise SEARCH for next id (ugh!)
1022 idl_nextid( ID_BLOCK *idl, ID id )
1026 if ( ID_BLOCK_ALLIDS( idl ) ) {
1027 return( ++id < ID_BLOCK_NIDS(idl) ? id : NOID );
1030 for ( i = 0; i < ID_BLOCK_NIDS(idl) && ID_BLOCK_ID(idl, i) <= id; i++ ) {
1034 if ( i >= ID_BLOCK_NIDS(idl) ) {
1037 return( ID_BLOCK_ID(idl, i) );