icachewrite.c 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359
  1. /*
  2. * Write the dirty icache entries to disk. Random seeks are
  3. * so expensive that it makes sense to wait until we have
  4. * a lot and then just make a sequential pass over the disk.
  5. */
  6. #include "stdinc.h"
  7. #include "dat.h"
  8. #include "fns.h"
  9. static void icachewriteproc(void*);
  10. static void icachewritecoord(void*);
  11. static IEntry *iesort(IEntry*);
  12. int icachesleeptime = 1000; /* milliseconds */
  13. int minicachesleeptime = 0;
  14. enum
  15. {
  16. Bufsize = 8*1024*1024
  17. };
  18. typedef struct IWrite IWrite;
  19. struct IWrite
  20. {
  21. Round round;
  22. AState as;
  23. };
  24. static IWrite iwrite;
  25. void
  26. initicachewrite(void)
  27. {
  28. int i;
  29. Index *ix;
  30. initround(&iwrite.round, "icache", 120*60*1000);
  31. ix = mainindex;
  32. for(i=0; i<ix->nsects; i++){
  33. ix->sects[i]->writechan = chancreate(sizeof(ulong), 1);
  34. ix->sects[i]->writedonechan = chancreate(sizeof(ulong), 1);
  35. vtproc(icachewriteproc, ix->sects[i]);
  36. }
  37. vtproc(icachewritecoord, nil);
  38. vtproc(delaykickroundproc, &iwrite.round);
  39. }
  40. static u64int
  41. ie2diskaddr(Index *ix, ISect *is, IEntry *ie)
  42. {
  43. u64int bucket, addr;
  44. bucket = hashbits(ie->score, 32)/ix->div;
  45. addr = is->blockbase + ((bucket - is->start) << is->blocklog);
  46. return addr;
  47. }
  48. static IEntry*
  49. nextchunk(Index *ix, ISect *is, IEntry **pie, u64int *paddr, uint *pnbuf)
  50. {
  51. u64int addr, naddr;
  52. uint nbuf;
  53. int bsize;
  54. IEntry *iefirst, *ie, **l;
  55. bsize = 1<<is->blocklog;
  56. iefirst = *pie;
  57. addr = ie2diskaddr(ix, is, iefirst);
  58. nbuf = 0;
  59. for(l = &iefirst->nextdirty; (ie = *l) != nil; l = &(*l)->nextdirty){
  60. naddr = ie2diskaddr(ix, is, ie);
  61. if(naddr - addr >= Bufsize)
  62. break;
  63. nbuf = naddr - addr;
  64. }
  65. nbuf += bsize;
  66. *l = nil;
  67. *pie = ie;
  68. *paddr = addr;
  69. *pnbuf = nbuf;
  70. return iefirst;
  71. }
  72. static int
  73. icachewritesect(Index *ix, ISect *is, u8int *buf)
  74. {
  75. int err, i, werr, h, bsize, t;
  76. u32int lo, hi;
  77. u64int addr, naddr;
  78. uint nbuf, off;
  79. DBlock *b;
  80. IBucket ib;
  81. IEntry *ie, *iedirty, **l, *chunk;
  82. lo = is->start * ix->div;
  83. if(TWID32/ix->div < is->stop)
  84. hi = TWID32;
  85. else
  86. hi = is->stop * ix->div - 1;
  87. trace(TraceProc, "icachewritesect enter %ud %ud %llud",
  88. lo, hi, iwrite.as.aa);
  89. iedirty = icachedirty(lo, hi, iwrite.as.aa);
  90. iedirty = iesort(iedirty);
  91. bsize = 1 << is->blocklog;
  92. err = 0;
  93. while(iedirty){
  94. disksched();
  95. while((t = icachesleeptime) == SleepForever){
  96. sleep(1000);
  97. disksched();
  98. }
  99. if(t < minicachesleeptime)
  100. t = minicachesleeptime;
  101. if(t > 0)
  102. sleep(t);
  103. trace(TraceProc, "icachewritesect nextchunk");
  104. chunk = nextchunk(ix, is, &iedirty, &addr, &nbuf);
  105. trace(TraceProc, "icachewritesect readpart 0x%llux+0x%ux",
  106. addr, nbuf);
  107. if(readpart(is->part, addr, buf, nbuf) < 0){
  108. fprint(2, "%s: part %s addr 0x%llux: icachewritesect "
  109. "readpart: %r\n", argv0, is->part->name, addr);
  110. err = -1;
  111. continue;
  112. }
  113. trace(TraceProc, "icachewritesect updatebuf");
  114. addstat(StatIsectReadBytes, nbuf);
  115. addstat(StatIsectRead, 1);
  116. for(l=&chunk; (ie=*l)!=nil; l=&ie->nextdirty){
  117. again:
  118. naddr = ie2diskaddr(ix, is, ie);
  119. off = naddr - addr;
  120. if(off+bsize > nbuf){
  121. fprint(2, "%s: whoops! addr=0x%llux nbuf=%ud "
  122. "addr+nbuf=0x%llux naddr=0x%llux\n",
  123. argv0, addr, nbuf, addr+nbuf, naddr);
  124. assert(off+bsize <= nbuf);
  125. }
  126. unpackibucket(&ib, buf+off, is->bucketmagic);
  127. if(okibucket(&ib, is) < 0){
  128. fprint(2, "%s: bad bucket XXX\n", argv0);
  129. goto skipit;
  130. }
  131. trace(TraceProc, "icachewritesect add %V at 0x%llux",
  132. ie->score, naddr);
  133. h = bucklook(ie->score, ie->ia.type, ib.data, ib.n);
  134. if(h & 1){
  135. h ^= 1;
  136. packientry(ie, &ib.data[h]);
  137. }else if(ib.n < is->buckmax){
  138. memmove(&ib.data[h + IEntrySize], &ib.data[h],
  139. ib.n*IEntrySize - h);
  140. ib.n++;
  141. packientry(ie, &ib.data[h]);
  142. }else{
  143. fprint(2, "%s: bucket overflow XXX\n", argv0);
  144. skipit:
  145. err = -1;
  146. *l = ie->nextdirty;
  147. ie = *l;
  148. if(ie)
  149. goto again;
  150. else
  151. break;
  152. }
  153. packibucket(&ib, buf+off, is->bucketmagic);
  154. }
  155. diskaccess(1);
  156. trace(TraceProc, "icachewritesect writepart", addr, nbuf);
  157. werr = 0;
  158. if(writepart(is->part, addr, buf, nbuf) < 0 || flushpart(is->part) < 0)
  159. werr = -1;
  160. for(i=0; i<nbuf; i+=bsize){
  161. if((b = _getdblock(is->part, addr+i, ORDWR, 0)) != nil){
  162. memmove(b->data, buf+i, bsize);
  163. putdblock(b);
  164. }
  165. }
  166. if(werr < 0){
  167. fprint(2, "%s: part %s addr 0x%llux: icachewritesect "
  168. "writepart: %r\n", argv0, is->part->name, addr);
  169. err = -1;
  170. continue;
  171. }
  172. addstat(StatIsectWriteBytes, nbuf);
  173. addstat(StatIsectWrite, 1);
  174. icacheclean(chunk);
  175. }
  176. trace(TraceProc, "icachewritesect done");
  177. return err;
  178. }
  179. static void
  180. icachewriteproc(void *v)
  181. {
  182. int ret;
  183. uint bsize;
  184. ISect *is;
  185. Index *ix;
  186. u8int *buf;
  187. ix = mainindex;
  188. is = v;
  189. threadsetname("icachewriteproc:%s", is->part->name);
  190. bsize = 1<<is->blocklog;
  191. buf = emalloc(Bufsize+bsize);
  192. buf = (u8int*)(((ulong)buf+bsize-1)&~(ulong)(bsize-1));
  193. for(;;){
  194. trace(TraceProc, "icachewriteproc recv");
  195. recv(is->writechan, 0);
  196. trace(TraceWork, "start");
  197. ret = icachewritesect(ix, is, buf);
  198. trace(TraceProc, "icachewriteproc send");
  199. trace(TraceWork, "finish");
  200. sendul(is->writedonechan, ret);
  201. }
  202. }
  203. static void
  204. icachewritecoord(void *v)
  205. {
  206. int i, err;
  207. Index *ix;
  208. AState as;
  209. USED(v);
  210. threadsetname("icachewritecoord");
  211. ix = mainindex;
  212. iwrite.as = icachestate();
  213. for(;;){
  214. trace(TraceProc, "icachewritecoord sleep");
  215. waitforkick(&iwrite.round);
  216. trace(TraceWork, "start");
  217. as = icachestate();
  218. if(as.arena==iwrite.as.arena && as.aa==iwrite.as.aa){
  219. /* will not be able to do anything more than last flush - kick disk */
  220. fprint(2, "icache: nothing to do - kick dcache\n");
  221. trace(TraceProc, "icachewritecoord kick dcache");
  222. kickdcache();
  223. trace(TraceProc, "icachewritecoord kicked dcache");
  224. goto SkipWork; /* won't do anything; don't bother rewriting bloom filter */
  225. }
  226. iwrite.as = as;
  227. trace(TraceProc, "icachewritecoord start flush");
  228. if(iwrite.as.arena){
  229. for(i=0; i<ix->nsects; i++)
  230. send(ix->sects[i]->writechan, 0);
  231. if(ix->bloom)
  232. send(ix->bloom->writechan, 0);
  233. err = 0;
  234. for(i=0; i<ix->nsects; i++)
  235. err |= recvul(ix->sects[i]->writedonechan);
  236. if(ix->bloom)
  237. err |= recvul(ix->bloom->writedonechan);
  238. trace(TraceProc, "icachewritecoord donewrite err=%d", err);
  239. if(err == 0){
  240. setatailstate(&iwrite.as);
  241. }
  242. }
  243. SkipWork:
  244. icacheclean(nil); /* wake up anyone waiting */
  245. trace(TraceWork, "finish");
  246. addstat(StatIcacheFlush, 1);
  247. }
  248. }
  249. void
  250. flushicache(void)
  251. {
  252. trace(TraceProc, "flushicache enter");
  253. kickround(&iwrite.round, 1);
  254. trace(TraceProc, "flushicache exit");
  255. }
  256. void
  257. kickicache(void)
  258. {
  259. kickround(&iwrite.round, 0);
  260. }
  261. void
  262. delaykickicache(void)
  263. {
  264. delaykickround(&iwrite.round);
  265. }
  266. static IEntry*
  267. iesort(IEntry *ie)
  268. {
  269. int cmp;
  270. IEntry **l;
  271. IEntry *ie1, *ie2, *sorted;
  272. if(ie == nil || ie->nextdirty == nil)
  273. return ie;
  274. /* split the lists */
  275. ie1 = ie;
  276. ie2 = ie;
  277. if(ie2)
  278. ie2 = ie2->nextdirty;
  279. if(ie2)
  280. ie2 = ie2->nextdirty;
  281. while(ie1 && ie2){
  282. ie1 = ie1->nextdirty;
  283. ie2 = ie2->nextdirty;
  284. if(ie2)
  285. ie2 = ie2->nextdirty;
  286. }
  287. if(ie1){
  288. ie2 = ie1->nextdirty;
  289. ie1->nextdirty = nil;
  290. }
  291. /* sort the lists */
  292. ie1 = iesort(ie);
  293. ie2 = iesort(ie2);
  294. /* merge the lists */
  295. sorted = nil;
  296. l = &sorted;
  297. cmp = 0;
  298. while(ie1 || ie2){
  299. if(ie1 && ie2)
  300. cmp = scorecmp(ie1->score, ie2->score);
  301. if(ie1==nil || (ie2 && cmp > 0)){
  302. *l = ie2;
  303. l = &ie2->nextdirty;
  304. ie2 = ie2->nextdirty;
  305. }else{
  306. *l = ie1;
  307. l = &ie1->nextdirty;
  308. ie1 = ie1->nextdirty;
  309. }
  310. }
  311. *l = nil;
  312. return sorted;
  313. }