2 * Memory-only VtBlock cache.
4 * The cached Venti blocks are in the hash chains.
5 * The cached local blocks are only in the blocks array.
6 * The free blocks are in the heap, which is supposed to
7 * be indexed by second-to-last use but actually
8 * appears to be last use.
15 int nread, ncopy, nwrite;
33 u32int now; /* ticks for usage time stamps */
34 VtBlock **hash; /* hash table for finding addresses */
36 VtBlock **heap; /* heap for finding victims */
38 VtBlock *block; /* all allocated blocks */
40 uchar *mem; /* memory for all blocks and data */
42 int (*write)(VtConn*, uchar[VtScoreSize], uint, uchar*, int);
45 static void cachecheck(VtCache*);
48 vtcachealloc(VtConn *z, int blocksize, ulong nblock, int mode)
55 c = vtmallocz(sizeof(VtCache));
58 c->blocksize = (blocksize + 127) & ~127;
61 c->hash = vtmallocz(nblock*sizeof(VtBlock*));
62 c->heap = vtmallocz(nblock*sizeof(VtBlock*));
63 c->block = vtmallocz(nblock*sizeof(VtBlock));
64 c->mem = vtmallocz(nblock*c->blocksize);
69 for(i=0; i<nblock; i++){
84 * BUG This is here so that vbackup can override it and do some
85 * pipelining of writes. Arguably vtwrite or vtwritepacket or the
86 * cache itself should be providing this functionality.
89 vtcachesetwrite(VtCache *c, int (*write)(VtConn*, uchar[VtScoreSize], uint, uchar*, int))
97 vtcachefree(VtCache *c)
104 for(i=0; i<c->nblock; i++)
105 assert(c->block[i].ref == 0);
115 vtcachedump(VtCache *c)
120 for(i=0; i<c->nblock; i++){
122 print("cache block %d: type %d score %V iostate %d addr %d ref %d nlock %d\n",
123 i, b->type, b->score, b->iostate, b->addr, b->ref, b->nlock);
128 cachecheck(VtCache *c)
137 for(i = 0; i < c->nheap; i++){
138 if(c->heap[i]->heap != i)
139 sysfatal("mis-heaped at %d: %d", i, c->heap[i]->heap);
140 if(i > 0 && c->heap[(i - 1) >> 1]->used - now > c->heap[i]->used - now)
141 sysfatal("bad heap ordering");
143 if(k < c->nheap && c->heap[i]->used - now > c->heap[k]->used - now)
144 sysfatal("bad heap ordering");
146 if(k < c->nheap && c->heap[i]->used - now > c->heap[k]->used - now)
147 sysfatal("bad heap ordering");
151 for(i = 0; i < c->nblock; i++){
153 if(b->data != &c->mem[i * size])
154 sysfatal("mis-blocked at %d", i);
155 if(b->ref && b->heap == BadHeap)
157 else if(b->addr != NilBlock)
160 if(c->nheap + refed != c->nblock){
161 fprint(2, "cachecheck: nheap %d refed %d nblocks %d\n", c->nheap, refed, c->nblock);
164 assert(c->nheap + refed == c->nblock);
166 for(i = 0; i < c->nblock; i++){
169 if(1)fprint(2, "a=%ud %V ref=%d\n", b->addr, b->score, b->ref);
173 if(refed > 0)fprint(2, "cachecheck: in used %d\n", refed);
177 upheap(int i, VtBlock *b)
186 for(; i != 0; i = p){
189 if(b->used - now >= bb->used - now)
201 downheap(int i, VtBlock *b)
214 if(k + 1 < c->nheap && c->heap[k]->used - now > c->heap[k + 1]->used - now)
217 if(b->used - now <= bb->used - now)
228 * Delete a block from the heap.
229 * Called with c->lk held.
246 b = c->heap[c->nheap];
253 * Insert a block into the heap.
254 * Called with c->lk held.
259 assert(b->heap == BadHeap);
260 upheap(b->c->nheap++, b);
264 * locate the vtBlock with the oldest second to last use.
265 * remove it from the heap, and fix up the heap.
267 /* called with c->lk held */
269 vtcachebumpblock(VtCache *c)
274 * locate the vtBlock with the oldest second to last use.
275 * remove it from the heap, and fix up the heap.
279 fprint(2, "vtcachebumpblock: no free blocks in vtCache");
285 assert(b->heap == BadHeap);
289 * unchain the vtBlock from hash chain if any
292 *(b->prev) = b->next;
294 b->next->prev = b->prev;
299 if(0)fprint(2, "droping %x:%V\n", b->addr, b->score);
300 /* set vtBlock to a reasonable state */
302 b->iostate = BioEmpty;
307 * fetch a local block from the memory cache.
308 * if it's not there, load it, bumping some other Block.
309 * if we're out of free blocks, we're screwed.
312 vtcachelocal(VtCache *c, u32int addr, int type)
316 if(addr >= c->nblock)
317 sysfatal("vtcachelocal: asked for block #%ud; only %d blocks\n",
321 if(b->addr == NilBlock || b->iostate != BioLocal)
322 sysfatal("vtcachelocal: block is not local");
325 sysfatal("vtcachelocal: block has wrong type %d != %d", b->type, type);
337 vtcacheallocblock(VtCache *c, int type)
342 b = vtcachebumpblock(c);
343 b->iostate = BioLocal;
345 b->addr = b - c->block;
346 vtzeroextend(type, b->data, 0, c->blocksize);
347 vtlocaltoglobal(b->addr, b->score);
357 * fetch a global (Venti) block from the memory cache.
358 * if it's not there, load it, bumping some other block.
361 vtcacheglobal(VtCache *c, uchar score[VtScoreSize], int type)
368 addr = vtglobaltolocal(score);
370 return vtcachelocal(c, addr, type);
372 h = (u32int)(score[0]|(score[1]<<8)|(score[2]<<16)|(score[3]<<24)) % c->nhash;
375 * look for the block in the cache
378 for(b = c->hash[h]; b != nil; b = b->next){
379 if(b->addr != NilBlock || memcmp(b->score, score, VtScoreSize) != 0 || b->type != type)
386 if(b->iostate == BioVentiError){
388 fprint(2, "cached read error for %V\n", score);
389 werrstr("venti i/o error");
399 b = vtcachebumpblock(c);
402 memmove(b->score, score, VtScoreSize);
403 /* chain onto correct hash */
404 b->next = c->hash[h];
407 b->next->prev = &b->next;
408 b->prev = &c->hash[h];
411 * Lock b before unlocking c, so that others wait while we read.
413 * You might think there is a race between this qlock(b) before qunlock(c)
414 * and the qlock(c) while holding a qlock(b) in vtblockwrite. However,
415 * the block here can never be the block in a vtblockwrite, so we're safe.
416 * We're certainly living on the edge.
422 n = vtread(c->z, score, type, b->data, c->blocksize);
424 werrstr("vtread %V: %r", score);
426 fprint(2, "read %V: %r\n", score);
427 b->iostate = BioVentiError;
431 vtzeroextend(type, b->data, n, c->blocksize);
432 b->iostate = BioVenti;
439 * The thread that has locked b may refer to it by
440 * multiple names. Nlock counts the number of
441 * references the locking thread holds. It will call
442 * vtblockput once per reference.
445 vtblockduplock(VtBlock *b)
447 assert(b->nlock > 0);
452 * we're done with the block.
453 * unlock it. can't use it after calling this.
456 vtblockput(VtBlock* b)
463 if(0)fprint(2, "vtblockput: %d: %x %d %d\n", getpid(), b->addr, c->nheap, b->iostate);
469 * b->nlock should probably stay at zero while
470 * the vtBlock is unlocked, but diskThread and vtSleep
471 * conspire to assume that they can just qlock(&b->lk); vtblockput(b),
472 * so we have to keep b->nlock set to 1 even
473 * when the vtBlock is unlocked.
475 assert(b->nlock == 0);
490 //if(b->addr != NilBlock) print("blockput %d\n", b->addr);
502 vtblockwrite(VtBlock *b)
504 uchar score[VtScoreSize];
509 if(b->iostate != BioLocal){
510 werrstr("vtblockwrite: not a local block");
515 n = vtzerotruncate(b->type, b->data, c->blocksize);
516 if(c->write(c->z, score, b->type, b->data, n) < 0)
519 memmove(b->score, score, VtScoreSize);
522 b->iostate = BioVenti;
523 h = (u32int)(score[0]|(score[1]<<8)|(score[2]<<16)|(score[3]<<24)) % c->nhash;
524 b->next = c->hash[h];
527 b->next->prev = &b->next;
528 b->prev = &c->hash[h];
534 vtcacheblocksize(VtCache *c)
540 vtblockcopy(VtBlock *b)
545 bb = vtcacheallocblock(b->c, b->type);
550 memmove(bb->data, b->data, b->c->blocksize);
556 vtlocaltoglobal(u32int addr, uchar score[VtScoreSize])
558 memset(score, 0, 16);
559 score[16] = addr>>24;
560 score[17] = addr>>16;
567 vtglobaltolocal(uchar score[VtScoreSize])
569 static uchar zero[16];
570 if(memcmp(score, zero, 16) != 0)
572 return (score[16]<<24)|(score[17]<<16)|(score[18]<<8)|score[19];
576 vtblockdirty(VtBlock *b)