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 );
49 static void idl_check(ID_BLOCK *idl)
54 if( ID_BLOCK_INDIRECT(idl) || ID_BLOCK_ALLIDS(idl)
55 || ID_BLOCK_NIDS(idl) <= 1 )
60 for( last = ID_BLOCK_ID(idl, 0), i = 1;
61 i < ID_BLOCK_NIDS(idl);
62 last = ID_BLOCK_ID(idl, i), i++ )
64 assert (last < ID_BLOCK_ID(idl, i) );
69 /* Allocate an ID_BLOCK with room for nids ids */
71 idl_alloc( unsigned int nids )
75 /* nmax + nids + space for the ids */
76 new = (ID_BLOCK *) ch_calloc( (ID_BLOCK_IDS_OFFSET + nids), sizeof(ID) );
77 ID_BLOCK_NMAX(new) = nids;
78 ID_BLOCK_NIDS(new) = 0;
84 /* Allocate an empty ALLIDS ID_BLOCK */
86 idl_allids( Backend *be )
92 ID_BLOCK_NMAX(idl) = ID_BLOCK_ALLIDS_VALUE;
93 if ( next_id_get( be, &id ) ) {
96 ID_BLOCK_NIDS(idl) = id;
101 /* Free an ID_BLOCK */
103 idl_free( ID_BLOCK *idl )
107 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
108 "idl_free: called with NULL pointer\n" ));
110 Debug( LDAP_DEBUG_TRACE,
111 "idl_free: called with NULL pointer\n",
118 free( (char *) idl );
122 /* Fetch an single ID_BLOCK from the cache */
133 /* Debug( LDAP_DEBUG_TRACE, "=> idl_fetch_one\n", 0, 0, 0 ); */
135 data = ldbm_cache_fetch( db, key );
137 if( data.dptr == NULL ) {
141 idl = idl_dup((ID_BLOCK *) data.dptr);
143 ldbm_datum_free( db->dbc_db, data );
149 /* Fetch a set of ID_BLOCKs from the cache
151 * if block return is an ALLIDS block,
152 * return an new ALLIDS block
155 * construct super block from all blocks referenced by INDIRECT block
170 idl = idl_fetch_one( be, db, key );
176 if ( ID_BLOCK_ALLIDS(idl) ) {
178 /* make sure we have the current value of highest id */
180 idl = idl_allids( be );
185 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
191 * this is an indirect block which points to other blocks.
192 * we need to read in all the blocks it points to and construct
193 * a big id list containing all the ids, which we will return.
196 #ifndef USE_INDIRECT_NIDS
197 /* count the number of blocks & allocate space for pointers to them */
198 for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ )
201 i = ID_BLOCK_NIDS(idl);
203 tmp = (ID_BLOCK **) ch_malloc( (i + 1) * sizeof(ID_BLOCK *) );
205 /* read in all the blocks */
206 cont_alloc( &data, &key );
208 #ifndef USE_INDIRECT_NIDS
209 for ( i = 0; !ID_BLOCK_NOID(idl, i); i++ ) {
211 for ( i = 0; i < ID_BLOCK_NIDS(idl); i++ ) {
213 cont_id( &data, ID_BLOCK_ID(idl, i) );
215 if ( (tmp[i] = idl_fetch_one( be, db, data )) == NULL ) {
217 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
218 "idl_fetch: idl_fetch_one returned NULL\n" ));
220 Debug( LDAP_DEBUG_ANY,
221 "idl_fetch: one returned NULL\n", 0, 0, 0 );
227 nids += ID_BLOCK_NIDS(tmp[i]);
233 /* allocate space for the big block */
234 idl = idl_alloc( nids );
235 ID_BLOCK_NIDS(idl) = nids;
238 /* copy in all the ids from the component blocks */
239 for ( i = 0; tmp[i] != NULL; i++ ) {
240 if ( tmp[i] == NULL ) {
245 (char *) &ID_BLOCK_ID(idl, nids),
246 (char *) &ID_BLOCK_ID(tmp[i], 0),
247 ID_BLOCK_NIDS(tmp[i]) * sizeof(ID) );
248 nids += ID_BLOCK_NIDS(tmp[i]);
252 free( (char *) tmp );
254 #ifdef LDBM_DEBUG_IDL
259 LDAP_LOG(( "cache", LDAP_LEVEL_ENTRY,
260 "idl_fetch: %ld ids (%ld max)\n",
261 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAXN(idl) ));
263 Debug( LDAP_DEBUG_TRACE, "<= idl_fetch %ld ids (%ld max)\n",
264 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAXN(idl), 0 );
271 /* store a single block */
282 struct ldbminfo *li = (struct ldbminfo *) be->be_private;
284 #ifdef LDBM_DEBUG_IDL
288 ldbm_datum_init( data );
290 /* Debug( LDAP_DEBUG_TRACE, "=> idl_store\n", 0, 0, 0 ); */
292 data.dptr = (char *) idl;
293 data.dsize = (ID_BLOCK_IDS_OFFSET + ID_BLOCK_NMAXN(idl)) * sizeof(ID);
296 Statslog( LDAP_DEBUG_STATS, "<= idl_store(): rc=%d\n",
300 flags = LDBM_REPLACE;
301 rc = ldbm_cache_store( db, key, data, flags );
303 /* Debug( LDAP_DEBUG_TRACE, "<= idl_store %d\n", rc, 0, 0 ); */
307 /* Binary search for id in block, return index
308 * an index is always returned, even with no match. If no
309 * match, the returned index is the insertion point.
317 int lo=0, hi=ID_BLOCK_NIDS(b)-1, nr=0;
321 nr = ( lo + hi ) / 2;
322 if (ID_BLOCK_ID(b, nr) == id)
324 if (ID_BLOCK_ID(b, nr) > id)
332 /* split the block at id
333 * locate ID greater than or equal to id.
345 /* find where to split the block */
346 nr = idl_find(b, id);
347 if ( ID_BLOCK_ID(b,nr) < id )
350 nl = ID_BLOCK_NIDS(b) - nr;
352 *right = idl_alloc( nr == 0 ? 1 : nr );
353 *left = idl_alloc( nl + (nr == 0 ? 0 : 1));
356 * everything before the id being inserted in the first block
357 * unless there is nothing, in which case the id being inserted
361 ID_BLOCK_NIDS(*right) = 1;
362 ID_BLOCK_ID(*right, 0) = id;
365 (char *) &ID_BLOCK_ID(*right, 0),
366 (char *) &ID_BLOCK_ID(b, 0),
368 ID_BLOCK_NIDS(*right) = nr;
369 ID_BLOCK_ID(*left, 0) = id;
372 /* the id being inserted & everything after in the second block */
374 (char *) &ID_BLOCK_ID(*left, (nr == 0 ? 0 : 1)),
375 (char *) &ID_BLOCK_ID(b, nr),
377 ID_BLOCK_NIDS(*left) = nl + (nr == 0 ? 0 : 1);
379 #ifdef LDBM_DEBUG_IDL
387 * idl_change_first - called when an indirect block's first key has
388 * changed, meaning it needs to be stored under a new key, and the
389 * header block pointing to it needs updating.
395 Datum hkey, /* header block key */
396 ID_BLOCK *h, /* header block */
397 int pos, /* pos in h to update */
398 Datum bkey, /* data block key */
399 ID_BLOCK *b /* data block */
404 /* Debug( LDAP_DEBUG_TRACE, "=> idl_change_first\n", 0, 0, 0 ); */
406 /* delete old key block */
407 if ( (rc = ldbm_cache_delete( db, bkey )) != 0 ) {
409 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
410 "idl_change_first: ldbm_cache_delete returned %d\n", rc ));
412 Debug( LDAP_DEBUG_ANY,
413 "idl_change_first: ldbm_cache_delete returned %d\n",
420 /* write block with new key */
421 cont_id( &bkey, ID_BLOCK_ID(b, 0) );
423 if ( (rc = idl_store( be, db, bkey, b )) != 0 ) {
425 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
426 "idl_change_first: idl_store returned %d\n", rc ));
428 Debug( LDAP_DEBUG_ANY,
429 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
435 /* update + write indirect header block */
436 ID_BLOCK_ID(h, pos) = ID_BLOCK_ID(b, 0);
437 if ( (rc = idl_store( be, db, hkey, h )) != 0 ) {
439 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
440 "idl_change_first: idl_store returned %s\n", rc ));
442 Debug( LDAP_DEBUG_ANY,
443 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
462 ID_BLOCK *idl, *tmp, *tmp2, *tmp3;
465 if ( (idl = idl_fetch_one( be, db, key )) == NULL ) {
466 idl = idl_alloc( 1 );
467 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)++) = id;
468 rc = idl_store( be, db, key, idl );
474 if ( ID_BLOCK_ALLIDS( idl ) ) {
480 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
482 switch ( idl_insert( &idl, id, db->dbc_maxids ) ) {
483 case 0: /* id inserted - store the updated block */
485 rc = idl_store( be, db, key, idl );
488 case 2: /* id already there - nothing to do */
492 case 3: /* id not inserted - block must be split */
493 /* check threshold for marking this an all-id block */
494 if ( db->dbc_maxindirect < 2 ) {
496 idl = idl_allids( be );
497 rc = idl_store( be, db, key, idl );
501 idl_split_block( idl, id, &tmp, &tmp2 );
504 /* create the header indirect block */
505 idl = idl_alloc( 3 );
506 #ifndef USE_INDIRECT_NIDS
507 ID_BLOCK_NMAX(idl) = 3;
508 ID_BLOCK_NIDS(idl) = ID_BLOCK_INDIRECT_VALUE;
509 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
510 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
511 ID_BLOCK_ID(idl, 2) = NOID;
513 ID_BLOCK_NMAX(idl) = 2 | ID_BLOCK_INDIRECT_VALUE;
514 ID_BLOCK_NIDS(idl) = 2;
515 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
516 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
520 rc = idl_store( be, db, key, idl );
522 cont_alloc( &k2, &key );
523 cont_id( &k2, ID_BLOCK_ID(tmp, 0) );
525 rc = idl_store( be, db, k2, tmp );
527 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
528 rc = idl_store( be, db, k2, tmp2 );
542 * this is an indirect block which points to other blocks.
543 * we need to read in the block into which the id should be
544 * inserted, then insert the id and store the block. we might
545 * have to split the block if it is full, which means we also
546 * need to write a new "header" block.
549 #ifndef USE_INDIRECT_NIDS
550 /* select the block to try inserting into *//* XXX linear search XXX */
551 for ( i = 0; !ID_BLOCK_NOID(idl, i) && id > ID_BLOCK_ID(idl, i); i++ )
554 i = idl_find(idl, id);
555 if (ID_BLOCK_ID(idl, i) < id)
567 cont_alloc( &k2, &key );
568 cont_id( &k2, ID_BLOCK_ID(idl, i) );
570 if ( (tmp = idl_fetch_one( be, db, k2 )) == NULL ) {
572 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
573 "idl_insert_key: nonexistent continuation block\n" ));
575 Debug( LDAP_DEBUG_ANY, "idl_insert_key: nonexistent continuation block\n",
585 switch ( idl_insert( &tmp, id, db->dbc_maxids ) ) {
586 case 0: /* id inserted ok */
587 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
589 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
590 "ids_insert_key: idl_store returned %d\n", rc ));
592 Debug( LDAP_DEBUG_ANY,
593 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
599 case 1: /* id inserted - first id in block has changed */
601 * key for this block has changed, so we have to
602 * write the block under the new key, delete the
603 * old key block + update and write the indirect
607 rc = idl_change_first( be, db, key, idl, i, k2, tmp );
610 case 2: /* id not inserted - already there, do nothing */
614 case 3: /* id not inserted - block is full */
616 * first, see if it will fit in the next block,
617 * without splitting, unless we're trying to insert
618 * into the beginning of the first block.
621 #ifndef USE_INDIRECT_NIDS
622 /* is there a next block? */
623 if ( !first && !ID_BLOCK_NOID(idl, i + 1) ) {
625 if ( !first && (i + 1) < ID_BLOCK_NIDS(idl) ) {
628 cont_alloc( &k2, &key );
629 cont_id( &k2, ID_BLOCK_ID(idl, i) );
630 if ( (tmp2 = idl_fetch_one( be, db, k2 )) == NULL ) {
632 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
633 "idl_insert_key: idl_fetch_one returned NULL\n"));
635 Debug( LDAP_DEBUG_ANY,
636 "idl_insert_key: idl_fetch_one returned NULL\n",
640 /* split the original block */
645 /* If the new id is less than the last id in the
646 * current block, it must not be put into the next
647 * block. Push the last id of the current block
648 * into the next block instead.
650 if (id < ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1)) {
651 ID id2 = ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1);
654 ldbm_datum_init( k3 );
656 --ID_BLOCK_NIDS(tmp);
657 /* This must succeed since we just popped one
658 * ID off the end of it.
660 rc = idl_insert( &tmp, id, db->dbc_maxids );
662 k3.dptr = ch_malloc(k2.dsize);
664 AC_MEMCPY(k3.dptr, k2.dptr, k3.dsize);
665 if ( (rc = idl_store( be, db, k3, tmp )) != 0 ) {
667 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
668 "idl_insert_key: idl_store returned %d\n", rc ));
670 Debug( LDAP_DEBUG_ANY,
671 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
679 /* This new id will necessarily be inserted
680 * as the first id of the next block by the
681 * following switch() statement.
685 switch ( (rc = idl_insert( &tmp2, id,
686 db->dbc_maxids )) ) {
687 case 1: /* id inserted first in block */
688 rc = idl_change_first( be, db, key, idl,
692 case 2: /* id already there - how? */
693 case 0: /* id inserted: this can never be
694 * the result of idl_insert, because
695 * we guaranteed that idl_change_first
696 * will always be called.
700 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
701 "idl_insert_key: id %ld is already in next block\n",
704 Debug( LDAP_DEBUG_ANY,
705 "idl_insert_key: id %ld already in next block\n",
716 case 3: /* split the original block */
725 * must split the block, write both new blocks + update
726 * and write the indirect header block.
729 rc = 0; /* optimistic */
732 #ifndef USE_INDIRECT_NIDS
733 /* count how many indirect blocks *//* XXX linear count XXX */
734 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
737 j = ID_BLOCK_NIDS(idl);
740 /* check it against all-id thresholed */
741 if ( j + 1 > db->dbc_maxindirect ) {
743 * we've passed the all-id threshold, meaning
744 * that this set of blocks should be replaced
745 * by a single "all-id" block. our job: delete
746 * all the indirect blocks, and replace the header
747 * block by an all-id block.
750 /* delete all indirect blocks */
751 #ifndef USE_INDIRECT_NIDS
752 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ ) {
754 for ( j = 0; j < ID_BLOCK_NIDS(idl); j++ ) {
756 cont_id( &k2, ID_BLOCK_ID(idl, j) );
758 rc = ldbm_cache_delete( db, k2 );
761 /* store allid block in place of header block */
763 idl = idl_allids( be );
764 rc = idl_store( be, db, key, idl );
772 idl_split_block( tmp, id, &tmp2, &tmp3 );
775 /* create a new updated indirect header block */
776 tmp = idl_alloc( ID_BLOCK_NMAXN(idl) + 1 );
777 #ifndef USE_INDIRECT_NIDS
778 ID_BLOCK_NIDS(tmp) = ID_BLOCK_INDIRECT_VALUE;
780 ID_BLOCK_NMAX(tmp) |= ID_BLOCK_INDIRECT_VALUE;
782 /* everything up to the split block */
784 (char *) &ID_BLOCK_ID(tmp, 0),
785 (char *) &ID_BLOCK_ID(idl, 0),
787 /* the two new blocks */
788 ID_BLOCK_ID(tmp, i) = ID_BLOCK_ID(tmp2, 0);
789 ID_BLOCK_ID(tmp, i + 1) = ID_BLOCK_ID(tmp3, 0);
790 /* everything after the split block */
791 #ifndef USE_INDIRECT_NIDS
793 (char *) &ID_BLOCK_ID(tmp, i + 2),
794 (char *) &ID_BLOCK_ID(idl, i + 1),
795 (ID_BLOCK_NMAXN(idl) - i - 1) * sizeof(ID) );
798 (char *) &ID_BLOCK_ID(tmp, i + 2),
799 (char *) &ID_BLOCK_ID(idl, i + 1),
800 (ID_BLOCK_NIDS(idl) - i - 1) * sizeof(ID) );
801 ID_BLOCK_NIDS(idl)++;
804 /* store the header block */
805 rc = idl_store( be, db, key, tmp );
807 /* store the first id block */
808 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
809 rc = idl_store( be, db, k2, tmp2 );
811 /* store the second id block */
812 cont_id( &k2, ID_BLOCK_ID(tmp3, 0) );
813 rc = idl_store( be, db, k2, tmp3 );
828 * idl_insert - insert an id into an id list.
832 * 1 id inserted, first id in block has changed
833 * 2 id not inserted, already there
834 * 3 id not inserted, block must be split
837 idl_insert( ID_BLOCK **idl, ID id, unsigned int maxids )
841 if ( ID_BLOCK_ALLIDS( *idl ) ) {
842 return( 2 ); /* already there */
845 /* is it already there? */
846 i = idl_find(*idl, id);
847 if ( ID_BLOCK_ID(*idl, i) == id ) {
848 return( 2 ); /* already there */
850 if ( ID_BLOCK_NIDS(*idl) && ID_BLOCK_ID(*idl, i) < id )
853 /* do we need to make room for it? */
854 if ( ID_BLOCK_NIDS(*idl) == ID_BLOCK_NMAXN(*idl) ) {
855 /* make room or indicate block needs splitting */
856 if ( ID_BLOCK_NMAXN(*idl) >= maxids ) {
857 return( 3 ); /* block needs splitting */
860 ID_BLOCK_NMAX(*idl) *= 2;
861 if ( ID_BLOCK_NMAXN(*idl) > maxids ) {
862 ID_BLOCK_NMAX(*idl) = maxids;
864 *idl = (ID_BLOCK *) ch_realloc( (char *) *idl,
865 (ID_BLOCK_NMAXN(*idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
868 /* make a slot for the new id */
869 AC_MEMCPY( &ID_BLOCK_ID(*idl, i+1), &ID_BLOCK_ID(*idl, i),
870 (ID_BLOCK_NIDS(*idl) - i) * sizeof(ID) );
872 ID_BLOCK_ID(*idl, i) = id;
873 ID_BLOCK_NIDS(*idl)++;
875 (char *) &ID_BLOCK_ID((*idl), ID_BLOCK_NIDS(*idl)),
877 (ID_BLOCK_NMAXN(*idl) - ID_BLOCK_NIDS(*idl)) * sizeof(ID) );
879 #ifdef LDBM_DEBUG_IDL
883 return( i == 0 ? 1 : 0 ); /* inserted - first id changed or not */
900 if ( (idl = idl_fetch_one( be, db, key ) ) == NULL )
902 /* It wasn't found. Hmm... */
906 if ( ID_BLOCK_ALLIDS( idl ) ) {
911 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
912 i = idl_find(idl, id);
913 if ( ID_BLOCK_ID(idl, i) == id ) {
914 if( --ID_BLOCK_NIDS(idl) == 0 ) {
915 ldbm_cache_delete( db, key );
919 &ID_BLOCK_ID(idl, i),
920 &ID_BLOCK_ID(idl, i+1),
921 (ID_BLOCK_NIDS(idl)-i) * sizeof(ID) );
923 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)) = NOID;
925 idl_store( be, db, key, idl );
931 /* We didn't find the ID. Hmmm... */
936 /* We have to go through an indirect block and find the ID
939 #ifndef USE_INDIRECT_NIDS
940 for ( nids = 0; !ID_BLOCK_NOID(idl, nids); nids++ )
943 cont_alloc( &data, &key );
945 for ( j = 0; j<nids; j++ )
947 nids = ID_BLOCK_NIDS(idl);
948 for ( j = idl_find(idl, id); j >= 0; j = -1) /* execute once */
952 cont_id( &data, ID_BLOCK_ID(idl, j) );
954 if ( (tmp = idl_fetch_one( be, db, data )) == NULL ) {
956 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
957 "idl_delete_key: idl_fetch_one returned NULL\n" ));
959 Debug( LDAP_DEBUG_ANY,
960 "idl_delete_key: idl_fetch of returned NULL\n", 0, 0, 0 );
966 Now try to find the ID in tmp
969 i = idl_find(tmp, id);
970 if ( ID_BLOCK_ID(tmp, i) == id )
973 &ID_BLOCK_ID(tmp, i),
974 &ID_BLOCK_ID(tmp, i+1),
975 (ID_BLOCK_NIDS(tmp)-(i+1)) * sizeof(ID));
976 ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp)-1 ) = NOID;
977 ID_BLOCK_NIDS(tmp)--;
979 if ( ID_BLOCK_NIDS(tmp) ) {
980 idl_store ( be, db, data, tmp );
983 ldbm_cache_delete( db, data );
985 &ID_BLOCK_ID(idl, j),
986 &ID_BLOCK_ID(idl, j+1),
987 (nids-(j+1)) * sizeof(ID));
988 ID_BLOCK_ID(idl, nids-1) = NOID;
990 #ifdef USE_INDIRECT_NIDS
991 ID_BLOCK_NIDS(idl)--;
994 ldbm_cache_delete( db, key );
996 idl_store( be, db, key, idl );
1012 /* return a duplicate of a single ID_BLOCK */
1014 idl_dup( ID_BLOCK *idl )
1018 if ( idl == NULL ) {
1022 new = idl_alloc( ID_BLOCK_NMAXN(idl) );
1027 (ID_BLOCK_NMAXN(idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
1029 #ifdef LDBM_DEBUG_IDL
1037 /* return the smaller ID_BLOCK */
1039 idl_min( ID_BLOCK *a, ID_BLOCK *b )
1041 return( ID_BLOCK_NIDS(a) > ID_BLOCK_NIDS(b) ? b : a );
1046 * idl_intersection - return a intersection b
1055 unsigned int ai, bi, ni;
1058 if ( a == NULL || b == NULL ) {
1061 if ( ID_BLOCK_ALLIDS( a ) ) {
1062 return( idl_dup( b ) );
1064 if ( ID_BLOCK_ALLIDS( b ) ) {
1065 return( idl_dup( a ) );
1068 n = idl_dup( idl_min( a, b ) );
1070 #ifdef LDBM_DEBUG_IDL
1075 for ( ni = 0, ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
1077 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
1083 if ( bi == ID_BLOCK_NIDS(b) ) {
1087 if ( ID_BLOCK_ID(b, bi) == ID_BLOCK_ID(a, ai) ) {
1088 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1096 ID_BLOCK_NIDS(n) = ni;
1098 #ifdef LDBM_DEBUG_IDL
1107 * idl_union - return a union b
1116 unsigned int ai, bi, ni;
1120 return( idl_dup( b ) );
1123 return( idl_dup( a ) );
1125 if ( ID_BLOCK_ALLIDS( a ) || ID_BLOCK_ALLIDS( b ) ) {
1126 return( idl_allids( be ) );
1129 #ifdef LDBM_DEBUG_IDL
1134 if ( ID_BLOCK_NIDS(b) < ID_BLOCK_NIDS(a) ) {
1140 n = idl_alloc( ID_BLOCK_NIDS(a) + ID_BLOCK_NIDS(b) );
1142 for ( ni = 0, ai = 0, bi = 0;
1143 ai < ID_BLOCK_NIDS(a) && bi < ID_BLOCK_NIDS(b);
1146 if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
1147 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai++);
1149 } else if ( ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai) ) {
1150 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi++);
1153 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1158 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1159 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1161 for ( ; bi < ID_BLOCK_NIDS(b); bi++ ) {
1162 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi);
1164 ID_BLOCK_NIDS(n) = ni;
1166 #ifdef LDBM_DEBUG_IDL
1175 * idl_notin - return a intersection ~b (or a minus b)
1184 unsigned int ni, ai, bi;
1190 if ( b == NULL || ID_BLOCK_ALLIDS( b )) {
1191 return( idl_dup( a ) );
1194 if ( ID_BLOCK_ALLIDS( a ) ) {
1195 n = idl_alloc( SLAPD_LDBM_MIN_MAXIDS );
1198 for ( ai = 1, bi = 0;
1199 ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAXN(n) && bi < ID_BLOCK_NMAXN(b);
1202 if ( ID_BLOCK_ID(b, bi) == ai ) {
1205 ID_BLOCK_ID(n, ni++) = ai;
1209 for ( ; ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAXN(n); ai++ ) {
1210 ID_BLOCK_ID(n, ni++) = ai;
1213 if ( ni == ID_BLOCK_NMAXN(n) ) {
1215 return( idl_allids( be ) );
1217 ID_BLOCK_NIDS(n) = ni;
1225 for ( ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
1227 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
1233 if ( bi == ID_BLOCK_NIDS(b) ) {
1237 if ( ID_BLOCK_ID(b, bi) != ID_BLOCK_ID(a, ai) ) {
1238 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1242 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1243 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1245 ID_BLOCK_NIDS(n) = ni;
1247 #ifdef LDBM_DEBUG_IDL
1254 /* return the first ID in the block
1257 * otherwise return NOID
1258 * otherwise return first ID
1260 * cursor is set to 1
1263 idl_firstid( ID_BLOCK *idl, ID *cursor )
1267 if ( idl == NULL || ID_BLOCK_NIDS(idl) == 0 ) {
1271 if ( ID_BLOCK_ALLIDS( idl ) ) {
1272 return( ID_BLOCK_NIDS(idl) > 1 ? 1 : NOID );
1275 return( ID_BLOCK_ID(idl, 0) );
1279 * if ALLIDS block, cursor is id.
1281 * if id < NIDS return id
1283 * otherwise cursor is index into block
1285 * return id at index then increment
1288 idl_nextid( ID_BLOCK *idl, ID *cursor )
1290 if ( ID_BLOCK_ALLIDS( idl ) ) {
1291 if( ++(*cursor) < ID_BLOCK_NIDS(idl) ) {
1298 if ( *cursor < ID_BLOCK_NIDS(idl) ) {
1299 return( ID_BLOCK_ID(idl, (*cursor)++) );