uint mode; // read-write mode
#ifdef unix
int idx;
- char *pooladvise; // bit maps for pool page advisements
#else
HANDLE idx;
#endif
free (mgr->pool);
free (mgr->hash);
free (mgr->latch);
- free (mgr->pooladvise);
free (mgr);
#else
FlushFileBuffers(mgr->idx);
mgr->pool = calloc (poolmax, sizeof(BtPool));
mgr->hash = calloc (hashsize, sizeof(ushort));
mgr->latch = calloc (hashsize, sizeof(BtSpinLatch));
- mgr->pooladvise = calloc (poolmax, (mgr->poolmask + 8) / 8);
#else
mgr->pool = GlobalAlloc (GMEM_FIXED|GMEM_ZEROINIT, poolmax * sizeof(BtPool));
mgr->hash = GlobalAlloc (GMEM_FIXED|GMEM_ZEROINIT, hashsize * sizeof(ushort));
pool->map = mmap (0, (bt->mgr->poolmask+1) << bt->mgr->page_bits, flag, MAP_SHARED, bt->mgr->idx, off);
if( pool->map == MAP_FAILED )
return bt->err = BTERR_map;
- // clear out madvise issued bits
- memset (bt->mgr->pooladvise + pool->slot * ((bt->mgr->poolmask + 8) / 8), 0, (bt->mgr->poolmask + 8)/8);
#else
flag = ( bt->mgr->mode == BT_ro ? PAGE_READONLY : PAGE_READWRITE );
pool->hmap = CreateFileMapping(bt->mgr->idx, NULL, flag, (DWORD)(limit >> 32), (DWORD)limit, NULL);
BtPage page;
page = (BtPage)(pool->map + (subpage << bt->mgr->page_bits));
-#ifdef unix
- {
- uint idx = subpage / 8;
- uint bit = subpage % 8;
-
- if( ~((bt->mgr->pooladvise + pool->slot * ((bt->mgr->poolmask + 8)/8))[idx] >> bit) & 1 ) {
- madvise (page, bt->mgr->page_size, MADV_WILLNEED);
- (bt->mgr->pooladvise + pool->slot * ((bt->mgr->poolmask + 8)/8))[idx] |= 1 << bit;
- }
- }
-#endif
return page;
}
int bt_findslot (BtDb *bt, unsigned char *key, uint len)
{
uint diff, higher = bt->page->cnt, low = 1, slot;
+uint good = 0;
- // low is the lowest candidate, higher is already
- // tested as .ge. the given key, loop ends when they meet
+ // if no right link
+ // make stopper key an infinite fence value
+ // by setting the good flag
+
+ if( bt_getid (bt->page->right) )
+ higher++;
+ else
+ good++;
+
+ // low is the next candidate.
+ // loop ends when they meet
+
+ // if good, higher is already
+ // tested as .ge. the given key.
while( diff = higher - low ) {
slot = low + ( diff >> 1 );
if( keycmp (keyptr(bt->page, slot), key, len) < 0 )
low = slot + 1;
else
- higher = slot;
+ higher = slot, good++;
}
- return higher;
+ // return zero if key is on right link page
+
+ return good ? higher : 0;
}
// find and load page at given level for given key
}
}
- prevpage = bt->page_no;
- prevpool = bt->pool;
- prevset = bt->set;
- prevmode = mode;
-
- // were we supposed to find a foster child?
- // if so, slide right onto it
-
- if( keycmp (keyptr(bt->page,bt->page->cnt), key, len) < 0 ) {
- page_no = bt_getid(bt->page->right);
- foster = 1;
- continue;
- }
-
// find key on page at this level
// and either descend to requested level
// or return key slot
- slot = bt_findslot (bt, key, len);
-
- // is this slot < foster child area
- // on the requested level?
+ if( slot = bt_findslot (bt, key, len) ) {
+ // is this slot < foster child area
+ // on the requested level?
- // if so, return actual slot even if dead
+ // if so, return actual slot even if dead
- if( slot <= bt->page->cnt - bt->page->foster )
- if( drill == lvl )
+ if( slot <= bt->page->cnt - bt->page->foster )
+ if( drill == lvl )
return bt->foster = foster, slot;
- // find next active slot
+ // find next active slot
+ // note: foster children are never dead
- // note: foster children are never dead
-
- while( slotptr(bt->page, slot)->dead )
- if( slot++ < bt->page->cnt )
+ while( slotptr(bt->page, slot)->dead )
+ if( slot++ < bt->page->cnt )
continue;
- else {
+ else {
// we are waiting for fence key posting
page_no = bt_getid(bt->page->right);
- continue;
+ goto slideright;
}
- // is this slot < foster child area
- // if so, drill to next level
+ // is this slot < foster child area
+ // if so, drill to next level
- if( slot <= bt->page->cnt - bt->page->foster )
+ if( slot <= bt->page->cnt - bt->page->foster )
foster = 0, drill--;
- else
+ else
foster = 1;
- // continue right onto foster child
- // or down to next level.
+ // continue right onto foster child
+ // or down to next level.
+
+ page_no = bt_getid(slotptr(bt->page, slot)->id);
+
+ // or slide right into next page
+
+ } else {
+ page_no = bt_getid(bt->page->right);
+ foster = 1;
+ }
- page_no = bt_getid(slotptr(bt->page, slot)->id);
+slideright:
+ prevpage = bt->page_no;
+ prevpool = bt->pool;
+ prevset = bt->set;
+ prevmode = mode;
} while( page_no );
#ifdef STANDALONE
+void bt_latchaudit (BtDb *bt)
+{
+ushort idx, hashidx;
+BtLatchSet *set;
+BtPool *pool;
+BtPage page;
+uid page_no;
+
+#ifdef unix
+ for( idx = 1; idx < bt->mgr->latchmgr->latchdeployed; idx++ ) {
+ set = bt->mgr->latchsets + idx;
+ if( set->pin ) {
+ fprintf(stderr, "latchset %d pinned\n", idx);
+ set->pin = 0;
+ }
+ }
+
+ for( hashidx = 0; hashidx < bt->mgr->latchmgr->latchhash; hashidx++ ) {
+ if( idx = bt->mgr->latchmgr->table[hashidx].slot ) do {
+ set = bt->mgr->latchsets + idx;
+ if( set->hash != hashidx )
+ fprintf(stderr, "latchset %d wrong hashidx\n", idx);
+ if( set->pin )
+ fprintf(stderr, "latchset %d pinned\n", idx);
+ } while( idx = set->next );
+ }
+ page_no = LEAF_page;
+
+ while( page_no ) {
+ fprintf(stderr, "page: %.6x\n", (uint)page_no);
+ pool = bt_pinpool (bt, page_no);
+ page = bt_page (bt, pool, page_no);
+ page_no = bt_getid(page->right);
+ bt_unpinpool (pool);
+ }
+
+ page_no = bt_getid(bt->mgr->latchmgr->alloc[1].right);
+
+ while( page_no ) {
+ fprintf(stderr, "free: %.6x\n", (uint)page_no);
+ pool = bt_pinpool (bt, page_no);
+ page = bt_page (bt, pool, page_no);
+ page_no = bt_getid(page->right);
+ bt_unpinpool (pool);
+ }
+#endif
+}
+
typedef struct {
char type, idx;
char *infile;
switch(args->type | 0x20)
{
+ case 'a':
+ fprintf(stderr, "started latch mgr audit\n");
+ bt_latchaudit (bt);
+ fprintf(stderr, "finished latch mgr audit\n");
+ break;
+
case 'w':
fprintf(stderr, "started indexing for %s\n", args->infile);
if( in = fopen (args->infile, "rb") )
projects / btree / blobdiff