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 */
283 #ifdef LDBM_DEBUG_IDL
287 ldbm_datum_init( data );
289 /* Debug( LDAP_DEBUG_TRACE, "=> idl_store\n", 0, 0, 0 ); */
291 data.dptr = (char *) idl;
292 data.dsize = (ID_BLOCK_IDS_OFFSET + ID_BLOCK_NMAXN(idl)) * sizeof(ID);
294 flags = LDBM_REPLACE;
295 rc = ldbm_cache_store( db, key, data, flags );
298 Statslog( LDAP_DEBUG_STATS, "<= idl_store(): rc=%d\n",
302 /* Debug( LDAP_DEBUG_TRACE, "<= idl_store %d\n", rc, 0, 0 ); */
306 /* Binary search for id in block, return index
307 * an index is always returned, even with no match. If no
308 * match, the returned index is the insertion point.
316 int lo=0, hi=ID_BLOCK_NIDS(b)-1, nr=0;
320 nr = ( lo + hi ) / 2;
321 if (ID_BLOCK_ID(b, nr) == id)
323 if (ID_BLOCK_ID(b, nr) > id)
331 /* split the block at id
332 * locate ID greater than or equal to id.
344 /* find where to split the block */
345 nr = idl_find(b, id);
346 if ( ID_BLOCK_ID(b,nr) < id )
349 nl = ID_BLOCK_NIDS(b) - nr;
351 *right = idl_alloc( nr == 0 ? 1 : nr );
352 *left = idl_alloc( nl + (nr == 0 ? 0 : 1));
355 * everything before the id being inserted in the first block
356 * unless there is nothing, in which case the id being inserted
360 ID_BLOCK_NIDS(*right) = 1;
361 ID_BLOCK_ID(*right, 0) = id;
364 (char *) &ID_BLOCK_ID(*right, 0),
365 (char *) &ID_BLOCK_ID(b, 0),
367 ID_BLOCK_NIDS(*right) = nr;
368 ID_BLOCK_ID(*left, 0) = id;
371 /* the id being inserted & everything after in the second block */
373 (char *) &ID_BLOCK_ID(*left, (nr == 0 ? 0 : 1)),
374 (char *) &ID_BLOCK_ID(b, nr),
376 ID_BLOCK_NIDS(*left) = nl + (nr == 0 ? 0 : 1);
378 #ifdef LDBM_DEBUG_IDL
386 * idl_change_first - called when an indirect block's first key has
387 * changed, meaning it needs to be stored under a new key, and the
388 * header block pointing to it needs updating.
394 Datum hkey, /* header block key */
395 ID_BLOCK *h, /* header block */
396 int pos, /* pos in h to update */
397 Datum bkey, /* data block key */
398 ID_BLOCK *b /* data block */
403 /* Debug( LDAP_DEBUG_TRACE, "=> idl_change_first\n", 0, 0, 0 ); */
405 /* delete old key block */
406 if ( (rc = ldbm_cache_delete( db, bkey )) != 0 ) {
408 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
409 "idl_change_first: ldbm_cache_delete returned %d\n", rc ));
411 Debug( LDAP_DEBUG_ANY,
412 "idl_change_first: ldbm_cache_delete returned %d\n",
419 /* write block with new key */
420 cont_id( &bkey, ID_BLOCK_ID(b, 0) );
422 if ( (rc = idl_store( be, db, bkey, b )) != 0 ) {
424 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
425 "idl_change_first: idl_store returned %d\n", rc ));
427 Debug( LDAP_DEBUG_ANY,
428 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
434 /* update + write indirect header block */
435 ID_BLOCK_ID(h, pos) = ID_BLOCK_ID(b, 0);
436 if ( (rc = idl_store( be, db, hkey, h )) != 0 ) {
438 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
439 "idl_change_first: idl_store returned %s\n", rc ));
441 Debug( LDAP_DEBUG_ANY,
442 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
460 int i, j, first, rc = 0;
461 ID_BLOCK *idl, *tmp, *tmp2, *tmp3;
464 if ( (idl = idl_fetch_one( be, db, key )) == NULL ) {
465 idl = idl_alloc( 1 );
466 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)++) = id;
467 rc = idl_store( be, db, key, idl );
473 if ( ID_BLOCK_ALLIDS( idl ) ) {
479 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
481 switch ( idl_insert( &idl, id, db->dbc_maxids ) ) {
482 case 0: /* id inserted - store the updated block */
484 rc = idl_store( be, db, key, idl );
487 case 2: /* id already there - nothing to do */
491 case 3: /* id not inserted - block must be split */
492 /* check threshold for marking this an all-id block */
493 if ( db->dbc_maxindirect < 2 ) {
495 idl = idl_allids( be );
496 rc = idl_store( be, db, key, idl );
500 idl_split_block( idl, id, &tmp, &tmp2 );
503 /* create the header indirect block */
504 idl = idl_alloc( 3 );
505 #ifndef USE_INDIRECT_NIDS
506 ID_BLOCK_NMAX(idl) = 3;
507 ID_BLOCK_NIDS(idl) = ID_BLOCK_INDIRECT_VALUE;
508 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
509 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
510 ID_BLOCK_ID(idl, 2) = NOID;
512 ID_BLOCK_NMAX(idl) = 2 | ID_BLOCK_INDIRECT_VALUE;
513 ID_BLOCK_NIDS(idl) = 2;
514 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
515 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
519 rc = idl_store( be, db, key, idl );
521 cont_alloc( &k2, &key );
522 cont_id( &k2, ID_BLOCK_ID(tmp, 0) );
524 rc = idl_store( be, db, k2, tmp );
526 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
527 rc = idl_store( be, db, k2, tmp2 );
541 * this is an indirect block which points to other blocks.
542 * we need to read in the block into which the id should be
543 * inserted, then insert the id and store the block. we might
544 * have to split the block if it is full, which means we also
545 * need to write a new "header" block.
548 #ifndef USE_INDIRECT_NIDS
549 /* select the block to try inserting into *//* XXX linear search XXX */
550 for ( i = 0; !ID_BLOCK_NOID(idl, i) && id > ID_BLOCK_ID(idl, i); i++ )
553 i = idl_find(idl, id);
554 if (ID_BLOCK_ID(idl, i) < id)
566 cont_alloc( &k2, &key );
567 cont_id( &k2, ID_BLOCK_ID(idl, i) );
569 if ( (tmp = idl_fetch_one( be, db, k2 )) == NULL ) {
571 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
572 "idl_insert_key: nonexistent continuation block\n" ));
574 Debug( LDAP_DEBUG_ANY, "idl_insert_key: nonexistent continuation block\n",
584 switch ( idl_insert( &tmp, id, db->dbc_maxids ) ) {
585 case 0: /* id inserted ok */
586 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
588 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
589 "ids_insert_key: idl_store returned %d\n", rc ));
591 Debug( LDAP_DEBUG_ANY,
592 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
598 case 1: /* id inserted - first id in block has changed */
600 * key for this block has changed, so we have to
601 * write the block under the new key, delete the
602 * old key block + update and write the indirect
606 rc = idl_change_first( be, db, key, idl, i, k2, tmp );
609 case 2: /* id not inserted - already there, do nothing */
613 case 3: /* id not inserted - block is full */
615 * first, see if it will fit in the next block,
616 * without splitting, unless we're trying to insert
617 * into the beginning of the first block.
620 #ifndef USE_INDIRECT_NIDS
621 /* is there a next block? */
622 if ( !first && !ID_BLOCK_NOID(idl, i + 1) ) {
624 if ( !first && (i + 1) < ID_BLOCK_NIDS(idl) ) {
627 cont_alloc( &k2, &key );
628 cont_id( &k2, ID_BLOCK_ID(idl, i) );
629 if ( (tmp2 = idl_fetch_one( be, db, k2 )) == NULL ) {
631 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
632 "idl_insert_key: idl_fetch_one returned NULL\n"));
634 Debug( LDAP_DEBUG_ANY,
635 "idl_insert_key: idl_fetch_one returned NULL\n",
639 /* split the original block */
644 /* If the new id is less than the last id in the
645 * current block, it must not be put into the next
646 * block. Push the last id of the current block
647 * into the next block instead.
649 if (id < ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1)) {
650 ID id2 = ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1);
653 ldbm_datum_init( k3 );
655 --ID_BLOCK_NIDS(tmp);
656 /* This must succeed since we just popped one
657 * ID off the end of it.
659 rc = idl_insert( &tmp, id, db->dbc_maxids );
661 k3.dptr = ch_malloc(k2.dsize);
663 AC_MEMCPY(k3.dptr, k2.dptr, k3.dsize);
664 if ( (rc = idl_store( be, db, k3, tmp )) != 0 ) {
666 LDAP_LOG(( "cache", LDAP_LEVEL_ERR,
667 "idl_insert_key: idl_store returned %d\n", rc ));
669 Debug( LDAP_DEBUG_ANY,
670 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
678 /* This new id will necessarily be inserted
679 * as the first id of the next block by the
680 * following switch() statement.
684 switch ( (rc = idl_insert( &tmp2, id,
685 db->dbc_maxids )) ) {
686 case 1: /* id inserted first in block */
687 rc = idl_change_first( be, db, key, idl,
691 case 2: /* id already there - how? */
692 case 0: /* id inserted: this can never be
693 * the result of idl_insert, because
694 * we guaranteed that idl_change_first
695 * will always be called.
699 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
700 "idl_insert_key: id %ld is already in next block\n",
703 Debug( LDAP_DEBUG_ANY,
704 "idl_insert_key: id %ld already in next block\n",
715 case 3: /* split the original block */
724 * must split the block, write both new blocks + update
725 * and write the indirect header block.
728 rc = 0; /* optimistic */
731 #ifndef USE_INDIRECT_NIDS
732 /* count how many indirect blocks *//* XXX linear count XXX */
733 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
736 j = ID_BLOCK_NIDS(idl);
739 /* check it against all-id thresholed */
740 if ( j + 1 > db->dbc_maxindirect ) {
742 * we've passed the all-id threshold, meaning
743 * that this set of blocks should be replaced
744 * by a single "all-id" block. our job: delete
745 * all the indirect blocks, and replace the header
746 * block by an all-id block.
749 /* delete all indirect blocks */
750 #ifndef USE_INDIRECT_NIDS
751 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ ) {
753 for ( j = 0; j < ID_BLOCK_NIDS(idl); j++ ) {
755 cont_id( &k2, ID_BLOCK_ID(idl, j) );
757 rc = ldbm_cache_delete( db, k2 );
760 /* store allid block in place of header block */
762 idl = idl_allids( be );
763 rc = idl_store( be, db, key, idl );
771 idl_split_block( tmp, id, &tmp2, &tmp3 );
774 /* create a new updated indirect header block */
775 tmp = idl_alloc( ID_BLOCK_NMAXN(idl) + 1 );
776 #ifndef USE_INDIRECT_NIDS
777 ID_BLOCK_NIDS(tmp) = ID_BLOCK_INDIRECT_VALUE;
779 ID_BLOCK_NMAX(tmp) |= ID_BLOCK_INDIRECT_VALUE;
781 /* everything up to the split block */
783 (char *) &ID_BLOCK_ID(tmp, 0),
784 (char *) &ID_BLOCK_ID(idl, 0),
786 /* the two new blocks */
787 ID_BLOCK_ID(tmp, i) = ID_BLOCK_ID(tmp2, 0);
788 ID_BLOCK_ID(tmp, i + 1) = ID_BLOCK_ID(tmp3, 0);
789 /* everything after the split block */
790 #ifndef USE_INDIRECT_NIDS
792 (char *) &ID_BLOCK_ID(tmp, i + 2),
793 (char *) &ID_BLOCK_ID(idl, i + 1),
794 (ID_BLOCK_NMAXN(idl) - i - 1) * sizeof(ID) );
797 (char *) &ID_BLOCK_ID(tmp, i + 2),
798 (char *) &ID_BLOCK_ID(idl, i + 1),
799 (ID_BLOCK_NIDS(idl) - i - 1) * sizeof(ID) );
800 ID_BLOCK_NIDS(idl)++;
803 /* store the header block */
804 rc = idl_store( be, db, key, tmp );
806 /* store the first id block */
807 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
808 rc = idl_store( be, db, k2, tmp2 );
810 /* store the second id block */
811 cont_id( &k2, ID_BLOCK_ID(tmp3, 0) );
812 rc = idl_store( be, db, k2, tmp3 );
827 * idl_insert - insert an id into an id list.
831 * 1 id inserted, first id in block has changed
832 * 2 id not inserted, already there
833 * 3 id not inserted, block must be split
836 idl_insert( ID_BLOCK **idl, ID id, unsigned int maxids )
840 if ( ID_BLOCK_ALLIDS( *idl ) ) {
841 return( 2 ); /* already there */
844 /* is it already there? */
845 i = idl_find(*idl, id);
846 if ( ID_BLOCK_ID(*idl, i) == id ) {
847 return( 2 ); /* already there */
849 if ( ID_BLOCK_NIDS(*idl) && ID_BLOCK_ID(*idl, i) < id )
852 /* do we need to make room for it? */
853 if ( ID_BLOCK_NIDS(*idl) == ID_BLOCK_NMAXN(*idl) ) {
854 /* make room or indicate block needs splitting */
855 if ( ID_BLOCK_NMAXN(*idl) >= maxids ) {
856 return( 3 ); /* block needs splitting */
859 ID_BLOCK_NMAX(*idl) *= 2;
860 if ( ID_BLOCK_NMAXN(*idl) > maxids ) {
861 ID_BLOCK_NMAX(*idl) = maxids;
863 *idl = (ID_BLOCK *) ch_realloc( (char *) *idl,
864 (ID_BLOCK_NMAXN(*idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
867 /* make a slot for the new id */
868 AC_MEMCPY( &ID_BLOCK_ID(*idl, i+1), &ID_BLOCK_ID(*idl, i),
869 (ID_BLOCK_NIDS(*idl) - i) * sizeof(ID) );
871 ID_BLOCK_ID(*idl, i) = id;
872 ID_BLOCK_NIDS(*idl)++;
874 (char *) &ID_BLOCK_ID((*idl), ID_BLOCK_NIDS(*idl)),
876 (ID_BLOCK_NMAXN(*idl) - ID_BLOCK_NIDS(*idl)) * sizeof(ID) );
878 #ifdef LDBM_DEBUG_IDL
882 return( i == 0 ? 1 : 0 ); /* inserted - first id changed or not */
899 if ( (idl = idl_fetch_one( be, db, key ) ) == NULL )
901 /* It wasn't found. Hmm... */
905 if ( ID_BLOCK_ALLIDS( idl ) ) {
910 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
911 i = idl_find(idl, id);
912 if ( ID_BLOCK_ID(idl, i) == id ) {
913 if( --ID_BLOCK_NIDS(idl) == 0 ) {
914 ldbm_cache_delete( db, key );
918 &ID_BLOCK_ID(idl, i),
919 &ID_BLOCK_ID(idl, i+1),
920 (ID_BLOCK_NIDS(idl)-i) * sizeof(ID) );
922 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)) = NOID;
924 idl_store( be, db, key, idl );
930 /* We didn't find the ID. Hmmm... */
935 /* We have to go through an indirect block and find the ID
938 #ifndef USE_INDIRECT_NIDS
939 for ( nids = 0; !ID_BLOCK_NOID(idl, nids); nids++ )
942 cont_alloc( &data, &key );
944 for ( j = 0; j<nids; j++ )
946 nids = ID_BLOCK_NIDS(idl);
947 for ( j = idl_find(idl, id); j >= 0; j = -1) /* execute once */
951 cont_id( &data, ID_BLOCK_ID(idl, j) );
953 if ( (tmp = idl_fetch_one( be, db, data )) == NULL ) {
955 LDAP_LOG(( "cache", LDAP_LEVEL_INFO,
956 "idl_delete_key: idl_fetch_one returned NULL\n" ));
958 Debug( LDAP_DEBUG_ANY,
959 "idl_delete_key: idl_fetch of returned NULL\n", 0, 0, 0 );
965 Now try to find the ID in tmp
968 i = idl_find(tmp, id);
969 if ( ID_BLOCK_ID(tmp, i) == id )
972 &ID_BLOCK_ID(tmp, i),
973 &ID_BLOCK_ID(tmp, i+1),
974 (ID_BLOCK_NIDS(tmp)-(i+1)) * sizeof(ID));
975 ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp)-1 ) = NOID;
976 ID_BLOCK_NIDS(tmp)--;
978 if ( ID_BLOCK_NIDS(tmp) ) {
979 idl_store ( be, db, data, tmp );
982 ldbm_cache_delete( db, data );
984 &ID_BLOCK_ID(idl, j),
985 &ID_BLOCK_ID(idl, j+1),
986 (nids-(j+1)) * sizeof(ID));
987 ID_BLOCK_ID(idl, nids-1) = NOID;
989 #ifdef USE_INDIRECT_NIDS
990 ID_BLOCK_NIDS(idl)--;
993 ldbm_cache_delete( db, key );
995 idl_store( be, db, key, idl );
1011 /* return a duplicate of a single ID_BLOCK */
1013 idl_dup( ID_BLOCK *idl )
1017 if ( idl == NULL ) {
1021 new = idl_alloc( ID_BLOCK_NMAXN(idl) );
1026 (ID_BLOCK_NMAXN(idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
1028 #ifdef LDBM_DEBUG_IDL
1036 /* return the smaller ID_BLOCK */
1038 idl_min( ID_BLOCK *a, ID_BLOCK *b )
1040 return( ID_BLOCK_NIDS(a) > ID_BLOCK_NIDS(b) ? b : a );
1045 * idl_intersection - return a intersection b
1054 unsigned int ai, bi, ni;
1057 if ( a == NULL || b == NULL ) {
1060 if ( ID_BLOCK_ALLIDS( a ) ) {
1061 return( idl_dup( b ) );
1063 if ( ID_BLOCK_ALLIDS( b ) ) {
1064 return( idl_dup( a ) );
1067 n = idl_dup( idl_min( a, b ) );
1069 #ifdef LDBM_DEBUG_IDL
1074 for ( ni = 0, ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
1076 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
1082 if ( bi == ID_BLOCK_NIDS(b) ) {
1086 if ( ID_BLOCK_ID(b, bi) == ID_BLOCK_ID(a, ai) ) {
1087 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1095 ID_BLOCK_NIDS(n) = ni;
1097 #ifdef LDBM_DEBUG_IDL
1106 * idl_union - return a union b
1115 unsigned int ai, bi, ni;
1119 return( idl_dup( b ) );
1122 return( idl_dup( a ) );
1124 if ( ID_BLOCK_ALLIDS( a ) || ID_BLOCK_ALLIDS( b ) ) {
1125 return( idl_allids( be ) );
1128 #ifdef LDBM_DEBUG_IDL
1133 if ( ID_BLOCK_NIDS(b) < ID_BLOCK_NIDS(a) ) {
1139 n = idl_alloc( ID_BLOCK_NIDS(a) + ID_BLOCK_NIDS(b) );
1141 for ( ni = 0, ai = 0, bi = 0;
1142 ai < ID_BLOCK_NIDS(a) && bi < ID_BLOCK_NIDS(b);
1145 if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
1146 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai++);
1148 } else if ( ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai) ) {
1149 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi++);
1152 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1157 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1158 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1160 for ( ; bi < ID_BLOCK_NIDS(b); bi++ ) {
1161 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi);
1163 ID_BLOCK_NIDS(n) = ni;
1165 #ifdef LDBM_DEBUG_IDL
1174 * idl_notin - return a intersection ~b (or a minus b)
1183 unsigned int ni, ai, bi;
1189 if ( b == NULL || ID_BLOCK_ALLIDS( b )) {
1190 return( idl_dup( a ) );
1193 if ( ID_BLOCK_ALLIDS( a ) ) {
1194 n = idl_alloc( SLAPD_LDBM_MIN_MAXIDS );
1197 for ( ai = 1, bi = 0;
1198 ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAXN(n) && bi < ID_BLOCK_NMAXN(b);
1201 if ( ID_BLOCK_ID(b, bi) == ai ) {
1204 ID_BLOCK_ID(n, ni++) = ai;
1208 for ( ; ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAXN(n); ai++ ) {
1209 ID_BLOCK_ID(n, ni++) = ai;
1212 if ( ni == ID_BLOCK_NMAXN(n) ) {
1214 return( idl_allids( be ) );
1216 ID_BLOCK_NIDS(n) = ni;
1224 for ( ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
1226 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
1232 if ( bi == ID_BLOCK_NIDS(b) ) {
1236 if ( ID_BLOCK_ID(b, bi) != ID_BLOCK_ID(a, ai) ) {
1237 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1241 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1242 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1244 ID_BLOCK_NIDS(n) = ni;
1246 #ifdef LDBM_DEBUG_IDL
1253 /* return the first ID in the block
1256 * otherwise return NOID
1257 * otherwise return first ID
1259 * cursor is set to 1
1262 idl_firstid( ID_BLOCK *idl, ID *cursor )
1266 if ( idl == NULL || ID_BLOCK_NIDS(idl) == 0 ) {
1270 if ( ID_BLOCK_ALLIDS( idl ) ) {
1271 return( ID_BLOCK_NIDS(idl) > 1 ? 1 : NOID );
1274 return( ID_BLOCK_ID(idl, 0) );
1278 * if ALLIDS block, cursor is id.
1280 * if id < NIDS return id
1282 * otherwise cursor is index into block
1284 * return id at index then increment
1287 idl_nextid( ID_BLOCK *idl, ID *cursor )
1289 if ( ID_BLOCK_ALLIDS( idl ) ) {
1290 if( ++(*cursor) < ID_BLOCK_NIDS(idl) ) {
1297 if ( *cursor < ID_BLOCK_NIDS(idl) ) {
1298 return( ID_BLOCK_ID(idl, (*cursor)++) );