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 */
41 int (*write)(VtConn*, uchar[VtScoreSize], uint, uchar*, int);
44 static void cachecheck(VtCache*);
47 vtcachealloc(VtConn *z, int blocksize, ulong nblock)
54 c = vtmallocz(sizeof(VtCache));
57 c->blocksize = (blocksize + 127) & ~127;
60 c->hash = vtmallocz(nblock*sizeof(VtBlock*));
61 c->heap = vtmallocz(nblock*sizeof(VtBlock*));
62 c->block = vtmallocz(nblock*sizeof(VtBlock));
63 c->mem = vtmallocz(nblock*c->blocksize);
67 for(i=0; i<nblock; i++){
82 * BUG This is here so that vbackup can override it and do some
83 * pipelining of writes. Arguably vtwrite or vtwritepacket or the
84 * cache itself should be providing this functionality.
87 vtcachesetwrite(VtCache *c, int (*write)(VtConn*, uchar[VtScoreSize], uint, uchar*, int))
95 vtcachefree(VtCache *c)
102 for(i=0; i<c->nblock; i++)
103 assert(c->block[i].ref == 0);
113 vtcachedump(VtCache *c)
118 for(i=0; i<c->nblock; i++){
120 print("cache block %d: type %d score %V iostate %d addr %d ref %d nlock %d\n",
121 i, b->type, b->score, b->iostate, b->addr, b->ref, b->nlock);
126 cachecheck(VtCache *c)
135 for(i = 0; i < c->nheap; i++){
136 if(c->heap[i]->heap != i)
137 sysfatal("mis-heaped at %d: %d", i, c->heap[i]->heap);
138 if(i > 0 && c->heap[(i - 1) >> 1]->used - now > c->heap[i]->used - now)
139 sysfatal("bad heap ordering");
141 if(k < c->nheap && c->heap[i]->used - now > c->heap[k]->used - now)
142 sysfatal("bad heap ordering");
144 if(k < c->nheap && c->heap[i]->used - now > c->heap[k]->used - now)
145 sysfatal("bad heap ordering");
149 for(i = 0; i < c->nblock; i++){
151 if(b->data != &c->mem[i * size])
152 sysfatal("mis-blocked at %d", i);
153 if(b->ref && b->heap == BadHeap)
155 else if(b->addr != NilBlock)
158 if(c->nheap + refed != c->nblock){
159 fprint(2, "cachecheck: nheap %d refed %d nblocks %d\n", c->nheap, refed, c->nblock);
162 assert(c->nheap + refed == c->nblock);
164 for(i = 0; i < c->nblock; i++){
167 if(1)fprint(2, "a=%ud %V ref=%d\n", b->addr, b->score, b->ref);
171 if(refed > 0)fprint(2, "cachecheck: in used %d\n", refed);
175 upheap(int i, VtBlock *b)
184 for(; i != 0; i = p){
187 if(b->used - now >= bb->used - now)
199 downheap(int i, VtBlock *b)
212 if(k + 1 < c->nheap && c->heap[k]->used - now > c->heap[k + 1]->used - now)
215 if(b->used - now <= bb->used - now)
226 * Delete a block from the heap.
227 * Called with c->lk held.
244 b = c->heap[c->nheap];
251 * Insert a block into the heap.
252 * Called with c->lk held.
257 assert(b->heap == BadHeap);
258 upheap(b->c->nheap++, b);
262 * locate the vtBlock with the oldest second to last use.
263 * remove it from the heap, and fix up the heap.
265 /* called with c->lk held */
267 vtcachebumpblock(VtCache *c)
272 * locate the vtBlock with the oldest second to last use.
273 * remove it from the heap, and fix up the heap.
277 fprint(2, "vtcachebumpblock: no free blocks in vtCache");
283 assert(b->heap == BadHeap);
287 * unchain the vtBlock from hash chain if any
290 *(b->prev) = b->next;
292 b->next->prev = b->prev;
297 if(0)fprint(2, "droping %x:%V\n", b->addr, b->score);
298 /* set vtBlock to a reasonable state */
300 b->iostate = BioEmpty;
305 * fetch a local block from the memory cache.
306 * if it's not there, load it, bumping some other Block.
307 * if we're out of free blocks, we're screwed.
310 vtcachelocal(VtCache *c, u32int addr, int type)
314 if(addr >= c->nblock)
315 sysfatal("vtcachelocal: asked for block #%ud; only %d blocks\n",
319 if(b->addr == NilBlock || b->iostate != BioLocal)
320 sysfatal("vtcachelocal: block is not local");
323 sysfatal("vtcachelocal: block has wrong type %d != %d", b->type, type);
335 vtcacheallocblock(VtCache *c, int type)
340 b = vtcachebumpblock(c);
341 b->iostate = BioLocal;
343 b->addr = b - c->block;
344 vtzeroextend(type, b->data, 0, c->blocksize);
345 vtlocaltoglobal(b->addr, b->score);
355 * fetch a global (Venti) block from the memory cache.
356 * if it's not there, load it, bumping some other block.
359 vtcacheglobal(VtCache *c, uchar score[VtScoreSize], int type)
366 addr = vtglobaltolocal(score);
368 return vtcachelocal(c, addr, type);
370 h = (u32int)(score[0]|(score[1]<<8)|(score[2]<<16)|(score[3]<<24)) % c->nhash;
373 * look for the block in the cache
376 for(b = c->hash[h]; b != nil; b = b->next){
377 if(b->addr != NilBlock || memcmp(b->score, score, VtScoreSize) != 0 || b->type != type)
384 if(b->iostate == BioVentiError){
386 fprint(2, "cached read error for %V\n", score);
387 werrstr("venti i/o error");
397 b = vtcachebumpblock(c);
400 memmove(b->score, score, VtScoreSize);
401 /* chain onto correct hash */
402 b->next = c->hash[h];
405 b->next->prev = &b->next;
406 b->prev = &c->hash[h];
409 * Lock b before unlocking c, so that others wait while we read.
411 * You might think there is a race between this qlock(b) before qunlock(c)
412 * and the qlock(c) while holding a qlock(b) in vtblockwrite. However,
413 * the block here can never be the block in a vtblockwrite, so we're safe.
414 * We're certainly living on the edge.
420 n = vtread(c->z, score, type, b->data, c->blocksize);
422 werrstr("vtread %V: %r", score);
424 fprint(2, "read %V: %r\n", score);
425 b->iostate = BioVentiError;
429 vtzeroextend(type, b->data, n, c->blocksize);
430 b->iostate = BioVenti;
436 * The thread that has locked b may refer to it by
437 * multiple names. Nlock counts the number of
438 * references the locking thread holds. It will call
439 * vtblockput once per reference.
442 vtblockduplock(VtBlock *b)
444 assert(b->nlock > 0);
449 * we're done with the block.
450 * unlock it. can't use it after calling this.
453 vtblockput(VtBlock* b)
460 if(0)fprint(2, "vtblockput: %d: %x %d %d\n", getpid(), b->addr, c->nheap, b->iostate);
466 * b->nlock should probably stay at zero while
467 * the vtBlock is unlocked, but diskThread and vtSleep
468 * conspire to assume that they can just qlock(&b->lk); vtblockput(b),
469 * so we have to keep b->nlock set to 1 even
470 * when the vtBlock is unlocked.
472 assert(b->nlock == 0);
487 //if(b->addr != NilBlock) print("blockput %d\n", b->addr);
499 vtblockwrite(VtBlock *b)
501 uchar score[VtScoreSize];
506 if(b->iostate != BioLocal){
507 werrstr("vtblockwrite: not a local block");
512 n = vtzerotruncate(b->type, b->data, c->blocksize);
513 if(c->write(c->z, score, b->type, b->data, n) < 0)
516 memmove(b->score, score, VtScoreSize);
519 b->iostate = BioVenti;
520 h = (u32int)(score[0]|(score[1]<<8)|(score[2]<<16)|(score[3]<<24)) % c->nhash;
521 b->next = c->hash[h];
524 b->next->prev = &b->next;
525 b->prev = &c->hash[h];
531 vtcacheblocksize(VtCache *c)
537 vtblockcopy(VtBlock *b)
542 bb = vtcacheallocblock(b->c, b->type);
547 memmove(bb->data, b->data, b->c->blocksize);
553 vtlocaltoglobal(u32int addr, uchar score[VtScoreSize])
555 memset(score, 0, 16);
556 score[16] = addr>>24;
557 score[17] = addr>>16;
564 vtglobaltolocal(uchar score[VtScoreSize])
566 static uchar zero[16];
567 if(memcmp(score, zero, 16) != 0)
569 return (score[16]<<24)|(score[17]<<16)|(score[18]<<8)|score[19];