1 /* idl.c - ldap id list handling routines */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1998-2004 The OpenLDAP Foundation.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
21 #include <ac/string.h>
22 #include <ac/socket.h>
25 #include "back-ldbm.h"
27 static ID_BLOCK* idl_dup( ID_BLOCK *idl );
29 static void cont_alloc( Datum *cont, Datum *key )
31 ldbm_datum_init( *cont );
32 cont->dsize = 1 + sizeof(ID) + key->dsize;
33 cont->dptr = ch_malloc( cont->dsize );
35 * (unsigned char *) cont->dptr = SLAP_INDEX_CONT_PREFIX;
37 AC_MEMCPY( &((unsigned char *)cont->dptr)[1 + sizeof(ID)],
38 key->dptr, key->dsize );
41 static void cont_id( Datum *cont, ID id )
45 for( i=1; i <= sizeof(id); i++) {
46 ((unsigned char *)cont->dptr)[i] = (unsigned char)(id & 0xFF);
52 static void cont_free( Datum *cont )
54 ch_free( cont->dptr );
58 static void idl_check(ID_BLOCK *idl)
63 if( ID_BLOCK_ALLIDS(idl) )
67 #ifndef USE_INDIRECT_NIDS
68 if( ID_BLOCK_INDIRECT(idl) )
70 for ( max = 0; !ID_BLOCK_NOID(idl, max); max++ ) ;
74 max = ID_BLOCK_NIDS(idl);
81 for( last = ID_BLOCK_ID(idl, 0), i = 1;
83 last = ID_BLOCK_ID(idl, i), i++ )
85 assert (last < ID_BLOCK_ID(idl, i) );
90 /* Allocate an ID_BLOCK with room for nids ids */
92 idl_alloc( unsigned int nids )
96 /* nmax + nids + space for the ids */
97 new = (ID_BLOCK *) ch_calloc( (ID_BLOCK_IDS_OFFSET + nids), sizeof(ID) );
98 ID_BLOCK_NMAX(new) = nids;
99 ID_BLOCK_NIDS(new) = 0;
105 /* Allocate an empty ALLIDS ID_BLOCK */
107 idl_allids( Backend *be )
112 idl = idl_alloc( 0 );
113 ID_BLOCK_NMAX(idl) = ID_BLOCK_ALLIDS_VALUE;
114 if ( next_id_get( be, &id ) ) {
117 ID_BLOCK_NIDS(idl) = id;
122 /* Free an ID_BLOCK */
124 idl_free( ID_BLOCK *idl )
128 LDAP_LOG( INDEX, INFO, "idl_free: called with NULL pointer\n" , 0,0,0);
130 Debug( LDAP_DEBUG_TRACE,
131 "idl_free: called with NULL pointer\n",
138 free( (char *) idl );
142 /* Fetch an single ID_BLOCK from the cache */
153 /* Debug( LDAP_DEBUG_TRACE, "=> idl_fetch_one\n", 0, 0, 0 ); */
155 data = ldbm_cache_fetch( db, key );
157 if( data.dptr == NULL ) {
161 idl = (ID_BLOCK *) data.dptr;
162 if ( ID_BLOCK_ALLIDS(idl) ) {
163 /* make sure we have the current value of highest id */
164 idl = idl_allids( be );
166 idl = idl_dup((ID_BLOCK *) data.dptr);
169 ldbm_datum_free( db->dbc_db, data );
175 /* Fetch a set of ID_BLOCKs from the cache
177 * if block return is an ALLIDS block,
178 * return an new ALLIDS block
181 * construct super block from all blocks referenced by INDIRECT block
194 unsigned i, nids, nblocks;
196 idl = idl_fetch_one( be, db, key );
202 if ( ID_BLOCK_ALLIDS(idl) ) {
207 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
213 * this is an indirect block which points to other blocks.
214 * we need to read in all the blocks it points to and construct
215 * a big id list containing all the ids, which we will return.
218 #ifndef USE_INDIRECT_NIDS
219 /* count the number of blocks & allocate space for pointers to them */
220 for ( nblocks = 0; !ID_BLOCK_NOID(idl, nblocks); nblocks++ )
223 nblocks = ID_BLOCK_NIDS(idl);
225 tmp = (ID_BLOCK **) ch_malloc( nblocks * sizeof(ID_BLOCK *) );
227 /* read in all the blocks */
228 cont_alloc( &data, &key );
230 for ( i = 0; i < nblocks; i++ ) {
231 cont_id( &data, ID_BLOCK_ID(idl, i) );
233 if ( (tmp[i] = idl_fetch_one( be, db, data )) == NULL ) {
235 LDAP_LOG( INDEX, INFO,
236 "idl_fetch: idl_fetch_one returned NULL\n", 0,0,0 );
238 Debug( LDAP_DEBUG_ANY,
239 "idl_fetch: one returned NULL\n", 0, 0, 0 );
245 nids += ID_BLOCK_NIDS(tmp[i]);
250 /* allocate space for the big block */
251 idl = idl_alloc( nids );
252 ID_BLOCK_NIDS(idl) = nids;
255 /* copy in all the ids from the component blocks */
256 for ( i = 0; i < nblocks; i++ ) {
257 if ( tmp[i] == NULL ) {
262 (char *) &ID_BLOCK_ID(idl, nids),
263 (char *) &ID_BLOCK_ID(tmp[i], 0),
264 ID_BLOCK_NIDS(tmp[i]) * sizeof(ID) );
265 nids += ID_BLOCK_NIDS(tmp[i]);
269 free( (char *) tmp );
271 assert( ID_BLOCK_NIDS(idl) == nids );
273 #ifdef LDBM_DEBUG_IDL
278 LDAP_LOG( INDEX, ENTRY,
279 "idl_fetch: %ld ids (%ld max)\n",
280 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAXN(idl), 0 );
282 Debug( LDAP_DEBUG_TRACE, "<= idl_fetch %ld ids (%ld max)\n",
283 ID_BLOCK_NIDS(idl), ID_BLOCK_NMAXN(idl), 0 );
290 /* store a single block */
302 #ifdef LDBM_DEBUG_IDL
306 ldbm_datum_init( data );
308 /* Debug( LDAP_DEBUG_TRACE, "=> idl_store\n", 0, 0, 0 ); */
310 data.dptr = (char *) idl;
311 data.dsize = (ID_BLOCK_IDS_OFFSET + ID_BLOCK_NMAXN(idl)) * sizeof(ID);
313 flags = LDBM_REPLACE;
314 rc = ldbm_cache_store( db, key, data, flags );
316 /* Debug( LDAP_DEBUG_TRACE, "<= idl_store %d\n", rc, 0, 0 ); */
320 /* Binary search for id in block, return index
321 * an index is always returned, even with no match. If no
322 * match, the returned index is the insertion point.
330 int lo=0, hi=ID_BLOCK_NIDS(b)-1, nr=0;
334 nr = ( lo + hi ) / 2;
335 if (ID_BLOCK_ID(b, nr) == id)
337 if (ID_BLOCK_ID(b, nr) > id)
345 /* split the block at id
346 * locate ID greater than or equal to id.
358 /* find where to split the block */
359 nr = idl_find(b, id);
360 if ( ID_BLOCK_ID(b,nr) < id )
363 nl = ID_BLOCK_NIDS(b) - nr;
365 *right = idl_alloc( nr == 0 ? 1 : nr );
366 *left = idl_alloc( nl + (nr == 0 ? 0 : 1));
369 * everything before the id being inserted in the first block
370 * unless there is nothing, in which case the id being inserted
374 ID_BLOCK_NIDS(*right) = 1;
375 ID_BLOCK_ID(*right, 0) = id;
378 (char *) &ID_BLOCK_ID(*right, 0),
379 (char *) &ID_BLOCK_ID(b, 0),
381 ID_BLOCK_NIDS(*right) = nr;
382 ID_BLOCK_ID(*left, 0) = id;
385 /* the id being inserted & everything after in the second block */
387 (char *) &ID_BLOCK_ID(*left, (nr == 0 ? 0 : 1)),
388 (char *) &ID_BLOCK_ID(b, nr),
390 ID_BLOCK_NIDS(*left) = nl + (nr == 0 ? 0 : 1);
392 #ifdef LDBM_DEBUG_IDL
400 * idl_change_first - called when an indirect block's first key has
401 * changed, meaning it needs to be stored under a new key, and the
402 * header block pointing to it needs updating.
408 Datum hkey, /* header block key */
409 ID_BLOCK *h, /* header block */
410 int pos, /* pos in h to update */
411 Datum bkey, /* data block key */
412 ID_BLOCK *b /* data block */
417 /* Debug( LDAP_DEBUG_TRACE, "=> idl_change_first\n", 0, 0, 0 ); */
419 /* delete old key block */
420 if ( (rc = ldbm_cache_delete( db, bkey )) != 0 ) {
422 LDAP_LOG( INDEX, INFO,
423 "idl_change_first: ldbm_cache_delete returned %d\n", rc, 0, 0 );
425 Debug( LDAP_DEBUG_ANY,
426 "idl_change_first: ldbm_cache_delete returned %d\n",
433 /* write block with new key */
434 cont_id( &bkey, ID_BLOCK_ID(b, 0) );
436 if ( (rc = idl_store( be, db, bkey, b )) != 0 ) {
438 LDAP_LOG( INDEX, INFO,
439 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
441 Debug( LDAP_DEBUG_ANY,
442 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
448 /* update + write indirect header block */
449 ID_BLOCK_ID(h, pos) = ID_BLOCK_ID(b, 0);
450 if ( (rc = idl_store( be, db, hkey, h )) != 0 ) {
452 LDAP_LOG( INDEX, INFO,
453 "idl_change_first: idl_store returned %s\n", rc, 0, 0 );
455 Debug( LDAP_DEBUG_ANY,
456 "idl_change_first: idl_store returned %d\n", rc, 0, 0 );
474 int i, j, first, rc = 0;
475 ID_BLOCK *idl, *tmp, *tmp2, *tmp3;
478 if ( (idl = idl_fetch_one( be, db, key )) == NULL ) {
479 idl = idl_alloc( 1 );
480 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)++) = id;
481 rc = idl_store( be, db, key, idl );
487 if ( ID_BLOCK_ALLIDS( idl ) ) {
493 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
495 switch ( idl_insert( &idl, id, db->dbc_maxids ) ) {
496 case 0: /* id inserted - store the updated block */
498 rc = idl_store( be, db, key, idl );
501 case 2: /* id already there - nothing to do */
505 case 3: /* id not inserted - block must be split */
506 /* check threshold for marking this an all-id block */
507 if ( db->dbc_maxindirect < 2 ) {
509 idl = idl_allids( be );
510 rc = idl_store( be, db, key, idl );
514 idl_split_block( idl, id, &tmp, &tmp2 );
517 /* create the header indirect block */
518 #ifndef USE_INDIRECT_NIDS
519 idl = idl_alloc( 3 );
520 ID_BLOCK_NMAX(idl) = 3;
521 ID_BLOCK_NIDS(idl) = ID_BLOCK_INDIRECT_VALUE;
522 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
523 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
524 ID_BLOCK_ID(idl, 2) = NOID;
526 idl = idl_alloc( 2 );
527 ID_BLOCK_NMAX(idl) = 2 | ID_BLOCK_INDIRECT_VALUE;
528 ID_BLOCK_NIDS(idl) = 2;
529 ID_BLOCK_ID(idl, 0) = ID_BLOCK_ID(tmp, 0);
530 ID_BLOCK_ID(idl, 1) = ID_BLOCK_ID(tmp2, 0);
534 rc = idl_store( be, db, key, idl );
536 cont_alloc( &k2, &key );
537 cont_id( &k2, ID_BLOCK_ID(tmp, 0) );
539 rc = idl_store( be, db, k2, tmp );
541 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
542 rc = idl_store( be, db, k2, tmp2 );
556 * this is an indirect block which points to other blocks.
557 * we need to read in the block into which the id should be
558 * inserted, then insert the id and store the block. we might
559 * have to split the block if it is full, which means we also
560 * need to write a new "header" block.
563 #ifndef USE_INDIRECT_NIDS
564 /* select the block to try inserting into *//* XXX linear search XXX */
565 for ( i = 0; !ID_BLOCK_NOID(idl, i) && id >= ID_BLOCK_ID(idl, i); i++ )
568 i = idl_find(idl, id);
569 if (ID_BLOCK_ID(idl, i) <= id)
579 /* At this point, the following condition must be true:
580 * ID_BLOCK_ID(idl, i) <= id && id < ID_BLOCK_ID(idl, i+1)
581 * except when i is the first or the last block.
585 cont_alloc( &k2, &key );
586 cont_id( &k2, ID_BLOCK_ID(idl, i) );
588 if ( (tmp = idl_fetch_one( be, db, k2 )) == NULL ) {
590 LDAP_LOG( INDEX, ERR,
591 "idl_insert_key: nonexistent continuation block\n", 0, 0, 0 );
593 Debug( LDAP_DEBUG_ANY, "idl_insert_key: nonexistent continuation block\n",
603 switch ( idl_insert( &tmp, id, db->dbc_maxids ) ) {
604 case 0: /* id inserted ok */
605 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
607 LDAP_LOG( INDEX, ERR,
608 "ids_insert_key: idl_store returned %d\n", rc, 0, 0 );
610 Debug( LDAP_DEBUG_ANY,
611 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
617 case 1: /* id inserted - first id in block has changed */
619 * key for this block has changed, so we have to
620 * write the block under the new key, delete the
621 * old key block + update and write the indirect
625 rc = idl_change_first( be, db, key, idl, i, k2, tmp );
628 case 2: /* id not inserted - already there, do nothing */
632 case 3: /* id not inserted - block is full */
634 * first, see if it will fit in the next block,
635 * without splitting, unless we're trying to insert
636 * into the beginning of the first block.
639 #ifndef USE_INDIRECT_NIDS
640 /* is there a next block? */
641 if ( !first && !ID_BLOCK_NOID(idl, i + 1) ) {
643 if ( !first && (unsigned long)(i + 1) < ID_BLOCK_NIDS(idl) ) {
647 cont_alloc( &k3, &key );
648 cont_id( &k3, ID_BLOCK_ID(idl, i + 1) );
649 if ( (tmp2 = idl_fetch_one( be, db, k3 )) == NULL ) {
651 LDAP_LOG( INDEX, ERR,
652 "idl_insert_key: idl_fetch_one returned NULL\n", 0, 0, 0);
654 Debug( LDAP_DEBUG_ANY,
655 "idl_insert_key: idl_fetch_one returned NULL\n",
659 /* split the original block */
664 /* If the new id is less than the last id in the
665 * current block, it must not be put into the next
666 * block. Push the last id of the current block
667 * into the next block instead.
669 if (id < ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1)) {
670 ID id2 = ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp) - 1);
672 --ID_BLOCK_NIDS(tmp);
673 /* This must succeed since we just popped one
674 * ID off the end of it.
676 rc = idl_insert( &tmp, id, db->dbc_maxids );
678 if ( (rc = idl_store( be, db, k2, tmp )) != 0 ) {
680 LDAP_LOG( INDEX, ERR,
681 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
683 Debug( LDAP_DEBUG_ANY,
684 "idl_insert_key: idl_store returned %d\n", rc, 0, 0 );
690 /* This new id will necessarily be inserted
691 * as the first id of the next block by the
692 * following switch() statement.
696 switch ( (rc = idl_insert( &tmp2, id,
697 db->dbc_maxids )) ) {
698 case 1: /* id inserted first in block */
699 rc = idl_change_first( be, db, key, idl,
703 case 2: /* id already there - how? */
704 case 0: /* id inserted: this can never be
705 * the result of idl_insert, because
706 * we guaranteed that idl_change_first
707 * will always be called.
711 LDAP_LOG( INDEX, INFO,
712 "idl_insert_key: id %ld is already in next block\n",
715 Debug( LDAP_DEBUG_ANY,
716 "idl_insert_key: id %ld already in next block\n",
729 case 3: /* split the original block */
739 * must split the block, write both new blocks + update
740 * and write the indirect header block.
743 rc = 0; /* optimistic */
746 #ifndef USE_INDIRECT_NIDS
747 /* count how many indirect blocks *//* XXX linear count XXX */
748 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ )
751 j = ID_BLOCK_NIDS(idl);
754 /* check it against all-id thresholed */
755 if ( j + 1 > db->dbc_maxindirect ) {
757 * we've passed the all-id threshold, meaning
758 * that this set of blocks should be replaced
759 * by a single "all-id" block. our job: delete
760 * all the indirect blocks, and replace the header
761 * block by an all-id block.
764 /* delete all indirect blocks */
765 #ifndef USE_INDIRECT_NIDS
766 for ( j = 0; !ID_BLOCK_NOID(idl, j); j++ ) {
768 for ( j = 0; (unsigned long) j < ID_BLOCK_NIDS(idl); j++ ) {
770 cont_id( &k2, ID_BLOCK_ID(idl, j) );
772 rc = ldbm_cache_delete( db, k2 );
775 /* store allid block in place of header block */
777 idl = idl_allids( be );
778 rc = idl_store( be, db, key, idl );
786 idl_split_block( tmp, id, &tmp2, &tmp3 );
789 /* create a new updated indirect header block */
790 tmp = idl_alloc( ID_BLOCK_NMAXN(idl) + 1 );
791 #ifndef USE_INDIRECT_NIDS
792 ID_BLOCK_NIDS(tmp) = ID_BLOCK_INDIRECT_VALUE;
794 ID_BLOCK_NMAX(tmp) |= ID_BLOCK_INDIRECT_VALUE;
796 /* everything up to the split block */
798 (char *) &ID_BLOCK_ID(tmp, 0),
799 (char *) &ID_BLOCK_ID(idl, 0),
801 /* the two new blocks */
802 ID_BLOCK_ID(tmp, i) = ID_BLOCK_ID(tmp2, 0);
803 ID_BLOCK_ID(tmp, i + 1) = ID_BLOCK_ID(tmp3, 0);
804 /* everything after the split block */
805 #ifndef USE_INDIRECT_NIDS
807 (char *) &ID_BLOCK_ID(tmp, i + 2),
808 (char *) &ID_BLOCK_ID(idl, i + 1),
809 (ID_BLOCK_NMAXN(idl) - i - 1) * sizeof(ID) );
812 (char *) &ID_BLOCK_ID(tmp, i + 2),
813 (char *) &ID_BLOCK_ID(idl, i + 1),
814 (ID_BLOCK_NIDS(idl) - i - 1) * sizeof(ID) );
815 ID_BLOCK_NIDS(tmp) = ID_BLOCK_NIDS(idl) + 1;
818 /* store the header block */
819 rc = idl_store( be, db, key, tmp );
821 /* store the first id block */
822 cont_id( &k2, ID_BLOCK_ID(tmp2, 0) );
823 rc = idl_store( be, db, k2, tmp2 );
825 /* store the second id block */
826 cont_id( &k2, ID_BLOCK_ID(tmp3, 0) );
827 rc = idl_store( be, db, k2, tmp3 );
842 * idl_insert - insert an id into an id list.
846 * 1 id inserted, first id in block has changed
847 * 2 id not inserted, already there
848 * 3 id not inserted, block must be split
851 idl_insert( ID_BLOCK **idl, ID id, unsigned int maxids )
855 if ( ID_BLOCK_ALLIDS( *idl ) ) {
856 return( 2 ); /* already there */
859 /* is it already there? */
860 i = idl_find(*idl, id);
861 if ( ID_BLOCK_ID(*idl, i) == id ) {
862 return( 2 ); /* already there */
864 if ( ID_BLOCK_NIDS(*idl) && ID_BLOCK_ID(*idl, i) < id )
867 /* do we need to make room for it? */
868 if ( ID_BLOCK_NIDS(*idl) == ID_BLOCK_NMAXN(*idl) ) {
869 /* make room or indicate block needs splitting */
870 if ( ID_BLOCK_NMAXN(*idl) >= maxids ) {
871 return( 3 ); /* block needs splitting */
874 ID_BLOCK_NMAX(*idl) *= 2;
875 if ( ID_BLOCK_NMAXN(*idl) > maxids ) {
876 ID_BLOCK_NMAX(*idl) = maxids;
878 *idl = (ID_BLOCK *) ch_realloc( (char *) *idl,
879 (ID_BLOCK_NMAXN(*idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
882 /* make a slot for the new id */
883 AC_MEMCPY( &ID_BLOCK_ID(*idl, i+1), &ID_BLOCK_ID(*idl, i),
884 (ID_BLOCK_NIDS(*idl) - i) * sizeof(ID) );
886 ID_BLOCK_ID(*idl, i) = id;
887 ID_BLOCK_NIDS(*idl)++;
889 (char *) &ID_BLOCK_ID((*idl), ID_BLOCK_NIDS(*idl)),
891 (ID_BLOCK_NMAXN(*idl) - ID_BLOCK_NIDS(*idl)) * sizeof(ID) );
893 #ifdef LDBM_DEBUG_IDL
897 return( i == 0 ? 1 : 0 ); /* inserted - first id changed or not */
914 if ( (idl = idl_fetch_one( be, db, key ) ) == NULL )
916 /* It wasn't found. Hmm... */
920 if ( ID_BLOCK_ALLIDS( idl ) ) {
925 if ( ! ID_BLOCK_INDIRECT( idl ) ) {
926 i = idl_find(idl, id);
927 if ( ID_BLOCK_ID(idl, i) == id ) {
928 if( --ID_BLOCK_NIDS(idl) == 0 ) {
929 ldbm_cache_delete( db, key );
933 &ID_BLOCK_ID(idl, i),
934 &ID_BLOCK_ID(idl, i+1),
935 (ID_BLOCK_NIDS(idl)-i) * sizeof(ID) );
937 ID_BLOCK_ID(idl, ID_BLOCK_NIDS(idl)) = NOID;
939 idl_store( be, db, key, idl );
945 /* We didn't find the ID. Hmmm... */
950 /* We have to go through an indirect block and find the ID
953 cont_alloc( &data, &key );
954 #ifndef USE_INDIRECT_NIDS
955 for ( nids = 0; !ID_BLOCK_NOID(idl, nids); nids++ )
958 for ( j = 0; j<nids; j++ )
960 nids = ID_BLOCK_NIDS(idl);
961 for ( j = idl_find(idl, id); j >= 0; j = -1) /* execute once */
965 cont_id( &data, ID_BLOCK_ID(idl, j) );
967 if ( (tmp = idl_fetch_one( be, db, data )) == NULL ) {
969 LDAP_LOG( INDEX, INFO,
970 "idl_delete_key: idl_fetch_one returned NULL\n", 0, 0, 0 );
972 Debug( LDAP_DEBUG_ANY,
973 "idl_delete_key: idl_fetch of returned NULL\n", 0, 0, 0 );
979 Now try to find the ID in tmp
982 i = idl_find(tmp, id);
983 if ( ID_BLOCK_ID(tmp, i) == id )
986 &ID_BLOCK_ID(tmp, i),
987 &ID_BLOCK_ID(tmp, i+1),
988 (ID_BLOCK_NIDS(tmp)-(i+1)) * sizeof(ID));
989 ID_BLOCK_ID(tmp, ID_BLOCK_NIDS(tmp)-1 ) = NOID;
990 ID_BLOCK_NIDS(tmp)--;
992 if ( ID_BLOCK_NIDS(tmp) ) {
993 idl_store ( be, db, data, tmp );
996 ldbm_cache_delete( db, data );
998 &ID_BLOCK_ID(idl, j),
999 &ID_BLOCK_ID(idl, j+1),
1000 (nids-(j+1)) * sizeof(ID));
1001 ID_BLOCK_ID(idl, nids-1) = NOID;
1003 #ifdef USE_INDIRECT_NIDS
1004 ID_BLOCK_NIDS(idl)--;
1007 ldbm_cache_delete( db, key );
1009 idl_store( be, db, key, idl );
1025 /* return a duplicate of a single ID_BLOCK */
1027 idl_dup( ID_BLOCK *idl )
1031 if ( idl == NULL ) {
1035 new = idl_alloc( ID_BLOCK_NMAXN(idl) );
1040 (ID_BLOCK_NMAXN(idl) + ID_BLOCK_IDS_OFFSET) * sizeof(ID) );
1042 #ifdef LDBM_DEBUG_IDL
1050 /* return the smaller ID_BLOCK */
1052 idl_min( ID_BLOCK *a, ID_BLOCK *b )
1054 return( ID_BLOCK_NIDS(a) > ID_BLOCK_NIDS(b) ? b : a );
1059 * idl_intersection - return a intersection b
1068 unsigned int ai, bi, ni;
1071 if ( a == NULL || b == NULL ) {
1074 if ( ID_BLOCK_ALLIDS( a ) ) {
1075 return( idl_dup( b ) );
1077 if ( ID_BLOCK_ALLIDS( b ) ) {
1078 return( idl_dup( a ) );
1080 if ( ID_BLOCK_NIDS(a) == 0 || ID_BLOCK_NIDS(b) == 0 ) {
1084 n = idl_dup( idl_min( a, b ) );
1086 #ifdef LDBM_DEBUG_IDL
1091 for ( ni = 0, ai = 0, bi = 0; ; ) {
1092 if ( ID_BLOCK_ID(b, bi) == ID_BLOCK_ID(a, ai) ) {
1093 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1096 if ( ai >= ID_BLOCK_NIDS(a) || bi >= ID_BLOCK_NIDS(b) )
1098 } else if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
1100 if ( ai >= ID_BLOCK_NIDS(a) )
1104 if ( bi >= ID_BLOCK_NIDS(b) )
1113 ID_BLOCK_NIDS(n) = ni;
1115 #ifdef LDBM_DEBUG_IDL
1124 * idl_union - return a union b
1133 unsigned int ai, bi, ni;
1137 return( idl_dup( b ) );
1140 return( idl_dup( a ) );
1142 if ( ID_BLOCK_ALLIDS( a ) || ID_BLOCK_ALLIDS( b ) ) {
1143 return( idl_allids( be ) );
1146 #ifdef LDBM_DEBUG_IDL
1151 if ( ID_BLOCK_NIDS(b) < ID_BLOCK_NIDS(a) ) {
1157 n = idl_alloc( ID_BLOCK_NIDS(a) + ID_BLOCK_NIDS(b) );
1159 for ( ni = 0, ai = 0, bi = 0;
1160 ai < ID_BLOCK_NIDS(a) && bi < ID_BLOCK_NIDS(b);
1163 if ( ID_BLOCK_ID(a, ai) < ID_BLOCK_ID(b, bi) ) {
1164 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai++);
1166 } else if ( ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai) ) {
1167 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi++);
1170 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1175 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1176 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1178 for ( ; bi < ID_BLOCK_NIDS(b); bi++ ) {
1179 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(b, bi);
1181 ID_BLOCK_NIDS(n) = ni;
1183 #ifdef LDBM_DEBUG_IDL
1192 * idl_notin - return a intersection ~b (or a minus b)
1201 unsigned int ni, ai, bi;
1207 if ( b == NULL || ID_BLOCK_ALLIDS( b )) {
1208 return( idl_dup( a ) );
1211 if ( ID_BLOCK_ALLIDS( a ) ) {
1212 n = idl_alloc( SLAPD_LDBM_MIN_MAXIDS );
1215 for ( ai = 1, bi = 0;
1216 ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAXN(n) && bi < ID_BLOCK_NMAXN(b);
1219 if ( ID_BLOCK_ID(b, bi) == ai ) {
1222 ID_BLOCK_ID(n, ni++) = ai;
1226 for ( ; ai < ID_BLOCK_NIDS(a) && ni < ID_BLOCK_NMAXN(n); ai++ ) {
1227 ID_BLOCK_ID(n, ni++) = ai;
1230 if ( ni == ID_BLOCK_NMAXN(n) ) {
1232 return( idl_allids( be ) );
1234 ID_BLOCK_NIDS(n) = ni;
1242 for ( ai = 0, bi = 0; ai < ID_BLOCK_NIDS(a); ai++ ) {
1244 bi < ID_BLOCK_NIDS(b) && ID_BLOCK_ID(b, bi) < ID_BLOCK_ID(a, ai);
1250 if ( bi == ID_BLOCK_NIDS(b) ) {
1254 if ( ID_BLOCK_ID(b, bi) != ID_BLOCK_ID(a, ai) ) {
1255 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1259 for ( ; ai < ID_BLOCK_NIDS(a); ai++ ) {
1260 ID_BLOCK_ID(n, ni++) = ID_BLOCK_ID(a, ai);
1262 ID_BLOCK_NIDS(n) = ni;
1264 #ifdef LDBM_DEBUG_IDL
1271 /* return the first ID in the block
1274 * otherwise return NOID
1275 * otherwise return first ID
1277 * cursor is set to 1
1280 idl_firstid( ID_BLOCK *idl, ID *cursor )
1284 if ( idl == NULL || ID_BLOCK_NIDS(idl) == 0 ) {
1288 if ( ID_BLOCK_ALLIDS( idl ) ) {
1289 return( ID_BLOCK_NIDS(idl) > 1 ? 1 : NOID );
1292 return( ID_BLOCK_ID(idl, 0) );
1296 * if ALLIDS block, cursor is id.
1298 * if id < NIDS return id
1300 * otherwise cursor is index into block
1302 * return id at index then increment
1305 idl_nextid( ID_BLOCK *idl, ID *cursor )
1307 if ( ID_BLOCK_ALLIDS( idl ) ) {
1308 if( ++(*cursor) < ID_BLOCK_NIDS(idl) ) {
1315 if ( *cursor < ID_BLOCK_NIDS(idl) ) {
1316 return( ID_BLOCK_ID(idl, (*cursor)++) );