X-Git-Url: https://pd.if.org/git/?p=btree;a=blobdiff_plain;f=threads2i.c;h=f1d0269b89776928b209bef823aa65c40c4f91ae;hp=af913b4cf05b7e69553da0f76eb7df99f0b079f2;hb=HEAD;hpb=d3d8184d50ec57dc1c0f0e19505ea026c1a1fbab

diff --git a/threads2i.c b/threads2i.c
index af913b4..f1d0269 100644
--- a/threads2i.c
+++ b/threads2i.c
@@ -171,7 +171,6 @@ typedef struct BtPage_ {
 //	The memory mapping pool table buffer manager entry
 
 typedef struct {
-	unsigned long long int lru;	// number of times accessed
 	uid  basepage;				// mapped base page number
 	char *map;					// mapped memory pointer
 	ushort slot;				// slot index in this array
@@ -183,6 +182,8 @@ typedef struct {
 #endif
 } BtPool;
 
+#define CLOCK_bit 0x8000		// bit in pool->pin
+
 //  The loadpage interface object
 
 typedef struct {
@@ -713,10 +714,10 @@ uint slot;
 void bt_close (BtDb *bt)
 {
 #ifdef unix
-	if ( bt->mem )
+	if( bt->mem )
 		free (bt->mem);
 #else
-	if ( bt->mem)
+	if( bt->mem)
 		VirtualFree (bt->mem, 0, MEM_RELEASE);
 #endif
 	free (bt);
@@ -1027,7 +1028,7 @@ uint slot;
 
 	pool->hashprev = pool->hashnext = NULL;
 	pool->basepage = page_no & ~bt->mgr->poolmask;
-	pool->lru = 1;
+	pool->pin = CLOCK_bit + 1;
 
 	if( slot = bt->mgr->hash[idx] ) {
 		node = bt->mgr->pool + slot;
@@ -1038,32 +1039,6 @@ uint slot;
 	bt->mgr->hash[idx] = pool->slot;
 }
 
-//	find best segment to evict from buffer pool
-
-BtPool *bt_findlru (BtDb *bt, uint hashslot)
-{
-unsigned long long int target = ~0LL;
-BtPool *pool = NULL, *node;
-
-	if( !hashslot )
-		return NULL;
-
-	node = bt->mgr->pool + hashslot;
-
-	//  scan pool entries under hash table slot
-
-	do {
-	  if( node->pin )
-		continue;
-	  if( node->lru > target )
-		continue;
-	  target = node->lru;
-	  pool = node;
-	} while( node = node->hashnext );
-
-	return pool;
-}
-
 //  map new buffer pool segment to virtual memory
 
 BTERR bt_mapsegment(BtDb *bt, BtPool *pool, uid page_no)
@@ -1119,42 +1094,25 @@ void bt_unpinpool (BtPool *pool)
 
 BtPool *bt_pinpool(BtDb *bt, uid page_no)
 {
+uint slot, hashidx, idx, victim;
 BtPool *pool, *node, *next;
-uint slot, idx, victim;
 
 	//	lock hash table chain
 
-	idx = (uint)(page_no >> bt->mgr->seg_bits) % bt->mgr->hashsize;
-	bt_spinreadlock (&bt->mgr->latch[idx]);
+	hashidx = (uint)(page_no >> bt->mgr->seg_bits) % bt->mgr->hashsize;
+	bt_spinwritelock (&bt->mgr->latch[hashidx]);
 
 	//	look up in hash table
 
-	if( pool = bt_findpool(bt, page_no, idx) ) {
+	if( pool = bt_findpool(bt, page_no, hashidx) ) {
 #ifdef unix
+		__sync_fetch_and_or(&pool->pin, CLOCK_bit);
 		__sync_fetch_and_add(&pool->pin, 1);
 #else
+		_InterlockedOr16 (&pool->pin, CLOCK_bit);
 		_InterlockedIncrement16 (&pool->pin);
 #endif
-		bt_spinreleaseread (&bt->mgr->latch[idx]);
-		pool->lru++;
-		return pool;
-	}
-
-	//	upgrade to write lock
-
-	bt_spinreleaseread (&bt->mgr->latch[idx]);
-	bt_spinwritelock (&bt->mgr->latch[idx]);
-
-	// try to find page in pool with write lock
-
-	if( pool = bt_findpool(bt, page_no, idx) ) {
-#ifdef unix
-		__sync_fetch_and_add(&pool->pin, 1);
-#else
-		_InterlockedIncrement16 (&pool->pin);
-#endif
-		bt_spinreleasewrite (&bt->mgr->latch[idx]);
-		pool->lru++;
+		bt_spinreleasewrite (&bt->mgr->latch[hashidx]);
 		return pool;
 	}
 
@@ -1174,13 +1132,8 @@ uint slot, idx, victim;
 		if( bt_mapsegment(bt, pool, page_no) )
 			return NULL;
 
-		bt_linkhash(bt, pool, page_no, idx);
-#ifdef unix
-		__sync_fetch_and_add(&pool->pin, 1);
-#else
-		_InterlockedIncrement16 (&pool->pin);
-#endif
-		bt_spinreleasewrite (&bt->mgr->latch[idx]);
+		bt_linkhash(bt, pool, page_no, hashidx);
+		bt_spinreleasewrite (&bt->mgr->latch[hashidx]);
 		return pool;
 	}
 
@@ -1199,20 +1152,30 @@ uint slot, idx, victim;
 #else
 		victim = _InterlockedIncrement (&bt->mgr->evicted) - 1;
 #endif
-		victim %= bt->mgr->hashsize;
+		victim %= bt->mgr->poolmax;
+		pool = bt->mgr->pool + victim;
+		idx = (uint)(pool->basepage >> bt->mgr->seg_bits) % bt->mgr->hashsize;
+
+		if( !victim )
+			continue;
 
 		// try to get write lock
 		//	skip entry if not obtained
 
-		if( !bt_spinwritetry (&bt->mgr->latch[victim]) )
+		if( !bt_spinwritetry (&bt->mgr->latch[idx]) )
 			continue;
 
-		//  if pool entry is empty
-		//	or any pages are pinned
-		//	skip this entry
+		//	skip this entry if
+		//	page is pinned
+		//  or clock bit is set
 
-		if( !(pool = bt_findlru(bt, bt->mgr->hash[victim])) ) {
-			bt_spinreleasewrite (&bt->mgr->latch[victim]);
+		if( pool->pin ) {
+#ifdef unix
+			__sync_fetch_and_and(&pool->pin, ~CLOCK_bit);
+#else
+			_InterlockedAnd16 (&pool->pin, ~CLOCK_bit);
+#endif
+			bt_spinreleasewrite (&bt->mgr->latch[idx]);
 			continue;
 		}
 
@@ -1221,14 +1184,14 @@ uint slot, idx, victim;
 		if( node = pool->hashprev )
 			node->hashnext = pool->hashnext;
 		else if( node = pool->hashnext )
-			bt->mgr->hash[victim] = node->slot;
+			bt->mgr->hash[idx] = node->slot;
 		else
-			bt->mgr->hash[victim] = 0;
+			bt->mgr->hash[idx] = 0;
 
 		if( node = pool->hashnext )
 			node->hashprev = pool->hashprev;
 
-		bt_spinreleasewrite (&bt->mgr->latch[victim]);
+		bt_spinreleasewrite (&bt->mgr->latch[idx]);
 
 		//	remove old file mapping
 #ifdef unix
@@ -1246,13 +1209,8 @@ uint slot, idx, victim;
 		if( bt_mapsegment(bt, pool, page_no) )
 			return NULL;
 
-		bt_linkhash(bt, pool, page_no, idx);
-#ifdef unix
-		__sync_fetch_and_add(&pool->pin, 1);
-#else
-		_InterlockedIncrement16 (&pool->pin);
-#endif
-		bt_spinreleasewrite (&bt->mgr->latch[idx]);
+		bt_linkhash(bt, pool, page_no, hashidx);
+		bt_spinreleasewrite (&bt->mgr->latch[hashidx]);
 		return pool;
 	}
 }
@@ -1333,15 +1291,15 @@ int reuse;
 		reuse = 0;
 	}
 #ifdef unix
-	if ( pwrite(bt->mgr->idx, page, bt->mgr->page_size, new_page << bt->mgr->page_bits) < bt->mgr->page_size )
+	if( pwrite(bt->mgr->idx, page, bt->mgr->page_size, new_page << bt->mgr->page_bits) < bt->mgr->page_size )
 		return bt->err = BTERR_wrt, 0;
 
 	// if writing first page of pool block, zero last page in the block
 
-	if ( !reuse && bt->mgr->poolmask > 0 && (new_page & bt->mgr->poolmask) == 0 )
+	if( !reuse && bt->mgr->poolmask > 0 && (new_page & bt->mgr->poolmask) == 0 )
 	{
 		// use zero buffer to write zeros
-		if ( pwrite(bt->mgr->idx,bt->zero, bt->mgr->page_size, (new_page | bt->mgr->poolmask) << bt->mgr->page_bits) < bt->mgr->page_size )
+		if( pwrite(bt->mgr->idx,bt->zero, bt->mgr->page_size, (new_page | bt->mgr->poolmask) << bt->mgr->page_bits) < bt->mgr->page_size )
 			return bt->err = BTERR_wrt, 0;
 	}
 #else
@@ -1449,7 +1407,7 @@ BtPool *prevpool;
 	// re-read and re-lock root after determining actual level of root
 
 	if( set->page->lvl != drill) {
-		if ( set->page_no != ROOT_page )
+		if( set->page_no != ROOT_page )
 			return bt->err = BTERR_struct, 0;
 			
 		drill = set->page->lvl;
@@ -1995,7 +1953,7 @@ BtKey ptr;
 			ptr = keyptr(set->page, slot);
 		else
 		{
-			if ( !bt->err )
+			if( !bt->err )
 				bt->err = BTERR_ovflw;
 			return bt->err;
 		}
@@ -2145,40 +2103,52 @@ FILETIME xittime[1];
 FILETIME systime[1];
 FILETIME usrtime[1];
 SYSTEMTIME timeconv[1];
-double ans;
+double ans = 0;
 
-	GetProcessTimes (GetCurrentProcess(), crtime, xittime, systime, usrtime);
 	memset (timeconv, 0, sizeof(SYSTEMTIME));
 
 	switch( type ) {
+	case 0:
+		GetSystemTimeAsFileTime (xittime);
+		FileTimeToSystemTime (xittime, timeconv);
+		ans = (double)timeconv->wDayOfWeek * 3600 * 24;
+		break;
 	case 1:
+		GetProcessTimes (GetCurrentProcess(), crtime, xittime, systime, usrtime);
 		FileTimeToSystemTime (usrtime, timeconv);
 		break;
 	case 2:
+		GetProcessTimes (GetCurrentProcess(), crtime, xittime, systime, usrtime);
 		FileTimeToSystemTime (systime, timeconv);
 		break;
 	}
 
-	ans = (double)timeconv->wHour * 3600;
+	ans += (double)timeconv->wHour * 3600;
 	ans += (double)timeconv->wMinute * 60;
 	ans += (double)timeconv->wSecond;
 	ans += (double)timeconv->wMilliseconds / 1000;
 	return ans;
 }
 #else
-#include <sys/time.h>
+#include <time.h>
 #include <sys/resource.h>
 
 double getCpuTime(int type)
 {
 struct rusage used[1];
+struct timeval tv[1];
 
-	getrusage(RUSAGE_SELF, used);
 	switch( type ) {
+	case 0:
+		gettimeofday(tv, NULL);
+		return (double)tv->tv_sec + (double)tv->tv_usec / 1000000;
+
 	case 1:
+		getrusage(RUSAGE_SELF, used);
 		return (double)used->ru_utime.tv_sec + (double)used->ru_utime.tv_usec / 1000000;
 
 	case 2:
+		getrusage(RUSAGE_SELF, used);
 		return (double)used->ru_stime.tv_sec + (double)used->ru_stime.tv_usec / 1000000;
 	}
 
@@ -2190,26 +2160,50 @@ void bt_latchaudit (BtDb *bt)
 {
 ushort idx, hashidx;
 uid next, page_no;
-BtPageSet set[1];
+BtLatchSet *latch;
 BtKey ptr;
 
 #ifdef unix
-	for( idx = 1; idx < bt->mgr->latchmgr->latchdeployed; idx++ ) {
-		set->latch = bt->mgr->latchsets + idx;
-		if( set->latch->pin ) {
-			fprintf(stderr, "latchset %d pinned for page %.6x\n", idx, set->latch->page_no);
-			set->latch->pin = 0;
+	if( *(uint *)(bt->mgr->latchmgr->lock) )
+		fprintf(stderr, "Alloc page locked\n");
+	*(uint *)(bt->mgr->latchmgr->lock) = 0;
+
+	for( idx = 1; idx <= bt->mgr->latchmgr->latchdeployed; idx++ ) {
+		latch = bt->mgr->latchsets + idx;
+		if( *(uint *)latch->readwr )
+			fprintf(stderr, "latchset %d rwlocked for page %.8x\n", idx, latch->page_no);
+		*(uint *)latch->readwr = 0;
+
+		if( *(uint *)latch->access )
+			fprintf(stderr, "latchset %d accesslocked for page %.8x\n", idx, latch->page_no);
+		*(uint *)latch->access = 0;
+
+		if( *(uint *)latch->parent )
+			fprintf(stderr, "latchset %d parentlocked for page %.8x\n", idx, latch->page_no);
+		*(uint *)latch->parent = 0;
+
+		if( latch->pin ) {
+			fprintf(stderr, "latchset %d pinned for page %.8x\n", idx, latch->page_no);
+			latch->pin = 0;
 		}
 	}
 
 	for( hashidx = 0; hashidx < bt->mgr->latchmgr->latchhash; hashidx++ ) {
+	  if( *(uint *)(bt->mgr->latchmgr->table[hashidx].latch) )
+			fprintf(stderr, "hash entry %d locked\n", hashidx);
+
+	  *(uint *)(bt->mgr->latchmgr->table[hashidx].latch) = 0;
+
 	  if( idx = bt->mgr->latchmgr->table[hashidx].slot ) do {
-		set->latch = bt->mgr->latchsets + idx;
-		if( set->latch->hash != hashidx )
+		latch = bt->mgr->latchsets + idx;
+		if( *(uint *)latch->busy )
+			fprintf(stderr, "latchset %d busylocked for page %.8x\n", idx, latch->page_no);
+		*(uint *)latch->busy = 0;
+		if( latch->hash != hashidx )
 			fprintf(stderr, "latchset %d wrong hashidx\n", idx);
-		if( set->latch->pin )
-			fprintf(stderr, "latchset %d pinned for page %.8x\n", idx, set->latch->page_no);
-	  } while( idx = set->latch->next );
+		if( latch->pin )
+			fprintf(stderr, "latchset %d pinned for page %.8x\n", idx, latch->page_no);
+	  } while( idx = latch->next );
 	}
 
 	next = bt->mgr->latchmgr->nlatchpage + LATCH_page;
@@ -2331,8 +2325,6 @@ FILE *in;
 				found++;
 			  else if( bt->err )
 				fprintf(stderr, "Error %d Syserr %d Line: %d\n", bt->err, errno, line), exit(0);
-			  else
-				fprintf(stderr, "Unable to find key %.*s line %d\n", len, key, line);
 			  len = 0;
 			}
 			else if( len < 255 )
@@ -2415,14 +2407,12 @@ int main (int argc, char **argv)
 {
 int idx, cnt, len, slot, err;
 int segsize, bits = 16;
+double start, stop;
 #ifdef unix
 pthread_t *threads;
-timer start, stop;
 #else
-time_t start[1], stop[1];
 HANDLE *threads;
 #endif
-double real_time;
 ThreadArg *args;
 uint poolsize = 0;
 float elapsed;
@@ -2442,11 +2432,7 @@ BtDb *bt;
 		exit(0);
 	}
 
-#ifdef unix
-	gettimeofday(&start, NULL);
-#else
-	time(start);
-#endif
+	start = getCpuTime(0);
 
 	if( argc > 3 )
 		bits = atoi(argv[3]);
@@ -2504,18 +2490,14 @@ BtDb *bt;
 #ifdef unix
 	for( idx = 0; idx < cnt; idx++ )
 		pthread_join (threads[idx], NULL);
-	gettimeofday(&stop, NULL);
-	real_time = 1000.0 * ( stop.tv_sec - start.tv_sec ) + 0.001 * (stop.tv_usec - start.tv_usec );
 #else
 	WaitForMultipleObjects (cnt, threads, TRUE, INFINITE);
 
 	for( idx = 0; idx < cnt; idx++ )
 		CloseHandle(threads[idx]);
 
-	time (stop);
-	real_time = 1000 * (*stop - *start);
 #endif
-	elapsed = real_time / 1000;
+	elapsed = getCpuTime(0) - start;
 	fprintf(stderr, " real %dm%.3fs\n", (int)(elapsed/60), elapsed - (int)(elapsed/60)*60);
 	elapsed = getCpuTime(1);
 	fprintf(stderr, " user %dm%.3fs\n", (int)(elapsed/60), elapsed - (int)(elapsed/60)*60);