journal.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896
  1. #include <u.h>
  2. #include <libc.h>
  3. #include <auth.h>
  4. #include <fcall.h>
  5. #include <thread.h>
  6. #include <9p.h>
  7. #include "flashfs.h"
  8. enum
  9. {
  10. debug = 0,
  11. diags = 1,
  12. };
  13. typedef struct Gen Gen;
  14. typedef struct Sect Sect;
  15. struct Gen
  16. {
  17. int gnum;
  18. int count;
  19. int low;
  20. int high;
  21. Sect* head;
  22. Sect* tail;
  23. Sect* dup;
  24. Sect** vect;
  25. };
  26. struct Sect
  27. {
  28. int sect;
  29. ulong seq;
  30. int coff;
  31. int toff;
  32. int sum;
  33. ulong time;
  34. Sect* next;
  35. };
  36. static Gen gens[2];
  37. static Sect* freehead;
  38. static Sect* freetail;
  39. static int nfree;
  40. static int nbad;
  41. static ulong ltime;
  42. static int cursect;
  43. /*
  44. * If we have a delta then file times are in the future.
  45. * But they drift back to reality.
  46. */
  47. ulong
  48. now(void)
  49. {
  50. ulong cur, drift;
  51. static ulong last;
  52. cur = time(0);
  53. if(cur < last)
  54. delta += last - cur;
  55. else if(delta != 0 && last != 0) {
  56. drift = (cur - last + 1) / 2;
  57. if(drift > delta)
  58. delta = 0;
  59. else
  60. delta -= drift;
  61. }
  62. last = cur;
  63. return cur + delta;
  64. }
  65. static void
  66. damaged(char *mesg)
  67. {
  68. sysfatal("damaged filesystem: %s", mesg);
  69. }
  70. static void
  71. lddisc(char *mesg)
  72. {
  73. if(debug)
  74. fprint(2, "discard %s\n", mesg);
  75. else
  76. USED(mesg);
  77. }
  78. static Sect *
  79. getsect(void)
  80. {
  81. Sect *t;
  82. t = freehead;
  83. freehead = t->next;
  84. if(freehead == nil)
  85. freetail = nil;
  86. nfree--;
  87. return t;
  88. }
  89. static void
  90. newsect(Gen *g, Sect *s)
  91. {
  92. int m, n, err;
  93. uchar hdr[2*3];
  94. if(debug)
  95. fprint(2, "new %d %ld\n", g->gnum, s->seq);
  96. if(g->tail == nil)
  97. g->head = s;
  98. else
  99. g->tail->next = s;
  100. g->tail = s;
  101. s->next = nil;
  102. m = putc3(&hdr[0], g->gnum);
  103. n = putc3(&hdr[m], s->seq);
  104. s->toff = MAGSIZE + m + n;
  105. s->coff = s->toff + 4;
  106. s->time = NOTIME;
  107. s->sum = 0;
  108. err = 1;
  109. for(;;) {
  110. if(writedata(err, s->sect, hdr, m + n, MAGSIZE)
  111. && writedata(err, s->sect, magic, MAGSIZE, 0))
  112. break;
  113. clearsect(s->sect);
  114. err = 0;
  115. }
  116. }
  117. static Sect *
  118. newsum(Gen *g, ulong seq)
  119. {
  120. Sect *t;
  121. if(nfree == 0)
  122. damaged("no free sector for summary");
  123. t = getsect();
  124. t->seq = seq;
  125. newsect(g, t);
  126. return t;
  127. }
  128. static void
  129. freesect(Sect *s)
  130. {
  131. clearsect(s->sect);
  132. if(freetail == nil)
  133. freehead = s;
  134. else
  135. freetail->next = s;
  136. freetail = s;
  137. s->next = nil;
  138. nfree++;
  139. }
  140. static void
  141. dupsect(Sect *s, int renum)
  142. {
  143. Sect *t;
  144. Renum r;
  145. uchar *b;
  146. int err, n;
  147. ulong doff, off;
  148. if(nfree == 0)
  149. damaged("no free for copy");
  150. t = getsect();
  151. b = sectbuff;
  152. off = s->coff;
  153. readdata(s->sect, b, off, 0);
  154. doff = s->toff;
  155. if(s->time == NOTIME)
  156. doff += 4;
  157. // Window 5
  158. err = 1;
  159. for(;;) {
  160. if(writedata(err, t->sect, b + 1, s->toff - 1, 1)
  161. && writedata(err, t->sect, b + doff, off - doff, doff)
  162. && writedata(err, t->sect, b, 1, 0))
  163. break;
  164. clearsect(t->sect);
  165. err = 0;
  166. }
  167. if(renum) {
  168. r.old = s->sect;
  169. r.new = t->sect;
  170. erenum(&r);
  171. }
  172. n = s->sect;
  173. s->sect = t->sect;
  174. t->sect = n;
  175. freesect(t);
  176. if(cursect >= 0)
  177. readdata(cursect, b, sectsize, 0);
  178. }
  179. static void
  180. gswap(void)
  181. {
  182. Gen t;
  183. t = gens[0];
  184. gens[0] = gens[1];
  185. gens[1] = t;
  186. }
  187. static void
  188. checkdata(void)
  189. {
  190. Gen *g;
  191. g = &gens[0];
  192. if(g->dup != nil) { // Window 5 damage
  193. if(diags)
  194. fprint(2, "%s: window 5 damage\n", argv0);
  195. freesect(g->dup);
  196. g->dup = nil;
  197. }
  198. }
  199. static void
  200. checksweep(void)
  201. {
  202. Gen *g;
  203. Jrec j;
  204. uchar *b;
  205. int n, op;
  206. Sect *s, *t, *u;
  207. long off, seq, soff;
  208. g = &gens[1];
  209. if(g->dup != nil) { // Window 5 damage
  210. if(diags)
  211. fprint(2, "%s: window 5 damage\n", argv0);
  212. freesect(g->dup);
  213. g->dup = nil;
  214. }
  215. s = g->head;
  216. if(s != g->tail) {
  217. while(s->next != g->tail)
  218. s = s->next;
  219. }
  220. b = sectbuff;
  221. op = -1;
  222. seq = -1;
  223. soff = 0;
  224. u = nil;
  225. t = s;
  226. for(;;) {
  227. readdata(t->sect, b, sectsize, 0);
  228. off = t->toff + 4;
  229. for(;;) {
  230. n = convM2J(&j, &b[off]);
  231. if(n < 0) {
  232. if(j.type != 0xFF) {
  233. if(debug)
  234. fprint(2, "s[%d] @ %d %ld\n", j.type, t->sect, off);
  235. damaged("bad Jrec");
  236. }
  237. break;
  238. }
  239. switch(j.type) {
  240. case FT_SUMMARY:
  241. case FT_SUMBEG:
  242. seq = j.seq;
  243. case FT_SUMEND:
  244. op = j.type;
  245. soff = off;
  246. u = t;
  247. break;
  248. case FT_WRITE:
  249. case FT_AWRITE:
  250. off += j.size;
  251. }
  252. off += n;
  253. }
  254. t = t->next;
  255. if(t == nil)
  256. break;
  257. }
  258. if(op == FT_SUMBEG) { // Window 1 damage
  259. if(diags)
  260. fprint(2, "%s: window 1 damage\n", argv0);
  261. if(u != s) {
  262. freesect(u);
  263. s->next = nil;
  264. g->tail = s;
  265. }
  266. s->coff = soff;
  267. dupsect(s, 0);
  268. seq--;
  269. }
  270. if(seq >= 0) {
  271. g = &gens[0];
  272. if(seq > g->low)
  273. damaged("high sweep");
  274. if(seq == g->low) { // Window 2 damage
  275. if(diags)
  276. fprint(2, "%s: window 2 damage\n", argv0);
  277. s = g->head;
  278. g->head = s->next;
  279. freesect(s);
  280. if(g->head == nil) {
  281. g->tail = nil;
  282. g->gnum += 2;
  283. newsum(g, 0);
  284. gswap();
  285. }
  286. }
  287. }
  288. }
  289. void
  290. load1(Sect *s, int parity)
  291. {
  292. int n;
  293. Jrec j;
  294. uchar *b;
  295. char *err;
  296. Extent *x;
  297. Entry *d, *e;
  298. ulong ctime, off, mtime;
  299. if(s->sect < 0 && readonly) // readonly damaged
  300. return;
  301. b = sectbuff;
  302. readdata(s->sect, b, sectsize, 0);
  303. s->sum = 0;
  304. off = s->toff;
  305. ctime = get4(&b[off]);
  306. off += 4;
  307. for(;;) {
  308. n = convM2J(&j, &b[off]);
  309. if(n < 0) {
  310. if(j.type != 0xFF) {
  311. if(debug)
  312. fprint(2, "l[%d] @ %d %ld\n", j.type, s->sect, off);
  313. damaged("bad Jrec");
  314. }
  315. s->coff = off;
  316. break;
  317. }
  318. off += n;
  319. if(debug)
  320. fprint(2, "get %J\n", &j);
  321. switch(j.type) {
  322. case FT_create:
  323. ctime += j.mtime;
  324. create:
  325. d = elookup(j.parent);
  326. if(d == nil) {
  327. lddisc("parent");
  328. break;
  329. }
  330. d->ref++;
  331. e = ecreate(d, j.name, j.fnum, j.mode, ctime, &err);
  332. if(e == nil) {
  333. d->ref--;
  334. lddisc("create");
  335. break;
  336. }
  337. e->ref--;
  338. if(j.type == FT_trunc)
  339. e->mode = j.mode;
  340. break;
  341. case FT_chmod:
  342. e = elookup(j.fnum);
  343. if(e == nil) {
  344. lddisc("lookup");
  345. break;
  346. }
  347. echmod(e, j.mode, j.mnum);
  348. break;
  349. case FT_REMOVE:
  350. e = elookup(j.fnum);
  351. if(e == nil) {
  352. lddisc("lookup");
  353. break;
  354. }
  355. if(eremove(e) != nil) {
  356. lddisc("remove");
  357. break;
  358. }
  359. break;
  360. case FT_AWRITE:
  361. mtime = 0;
  362. goto write;
  363. case FT_WRITE:
  364. ctime += j.mtime;
  365. mtime = ctime;
  366. write:
  367. x = emalloc9p(sizeof(Extent));
  368. x->sect = s->sect;
  369. x->addr = off;
  370. x->off = j.offset;
  371. x->size = j.size;
  372. off += j.size;
  373. e = elookup(j.fnum);
  374. if(e == nil) {
  375. lddisc("lookup");
  376. break;
  377. }
  378. ewrite(e, x, parity, mtime);
  379. break;
  380. case FT_trunc:
  381. ctime += j.mtime;
  382. e = elookup(j.tnum);
  383. if(e == nil) {
  384. if(debug)
  385. fprint(2, "-> create\n");
  386. goto create;
  387. }
  388. etrunc(e, j.fnum, ctime);
  389. break;
  390. case FT_SUMMARY:
  391. case FT_SUMBEG:
  392. case FT_SUMEND:
  393. s->sum += n;
  394. break;
  395. default:
  396. damaged("load1 botch");
  397. }
  398. }
  399. if(s->sum > Nsum)
  400. s->sum = Nsum;
  401. s->time = ctime;
  402. if(ctime != NOTIME && ctime > ltime)
  403. ltime = ctime;
  404. }
  405. void
  406. load0(int parity)
  407. {
  408. Sect *s;
  409. if(debug)
  410. fprint(2, "load %d\n", parity);
  411. for(s = gens[parity].head; s != nil; s = s->next)
  412. load1(s, parity);
  413. }
  414. void
  415. loadfs(int ro)
  416. {
  417. Gen *g;
  418. Sect *s;
  419. ulong u, v;
  420. int i, j, n;
  421. uchar hdr[MAXHDR];
  422. readonly = ro;
  423. fmtinstall('J', Jconv);
  424. for(i = 0; i < 2; i++) {
  425. g = &gens[i];
  426. g->gnum = -1;
  427. g->low = nsects;
  428. g->high = -1;
  429. g->count = 0;
  430. g->head = nil;
  431. g->tail = nil;
  432. }
  433. for(i = 0; i < nsects; i++) {
  434. readdata(i, hdr, MAXHDR, 0);
  435. if(memcmp(hdr, magic, MAGSIZE) == 0) {
  436. n = MAGSIZE + getc3(&hdr[MAGSIZE], &u);
  437. getc3(&hdr[n], &v);
  438. if(debug)
  439. fprint(2, "%d: %ld %ld\n", i, u, v);
  440. for(j = 0; j < 2; j++) {
  441. g = &gens[j];
  442. if(g->gnum == u) {
  443. g->count++;
  444. if(v < g->low)
  445. g->low = v;
  446. if(v > g->high)
  447. g->high = v;
  448. break;
  449. }
  450. else if(g->gnum < 0) {
  451. g->gnum = u;
  452. g->count = 1;
  453. g->low = v;
  454. g->high = v;
  455. break;
  456. }
  457. }
  458. if(j == 2)
  459. damaged("unexpected generation");
  460. }
  461. else if(hdr[0] == 0xFF) {
  462. nfree++;
  463. s = emalloc9p(sizeof(Sect));
  464. s->sect = i;
  465. s->next = freehead;
  466. freehead = s;
  467. if(freetail == nil)
  468. freetail = s;
  469. }
  470. else
  471. nbad++;
  472. }
  473. if(nbad > 0)
  474. damaged("bad sectors");
  475. if(gens[0].gnum < 0)
  476. damaged("no data");
  477. if(gens[1].gnum < 0) { // Window 3 death
  478. if(diags)
  479. fprint(2, "%s: window 3 damage\n", argv0);
  480. g = &gens[1];
  481. g->gnum = gens[0].gnum + 1;
  482. g->low = 0;
  483. g->high = 0;
  484. g->count = 1;
  485. if(!readonly)
  486. newsum(g, 0);
  487. }
  488. if(gens[0].gnum > gens[1].gnum)
  489. gswap();
  490. for(i = 0; i < 2; i++) {
  491. g = &gens[i];
  492. n = g->count;
  493. if(n <= g->high - g->low)
  494. damaged("missing sectors");
  495. g->vect = emalloc9p(n * sizeof(Sect *));
  496. for(j = 0; j < n; j++) {
  497. s = emalloc9p(sizeof(Sect));
  498. s->sect = -1;
  499. g->vect[j] = s;
  500. }
  501. }
  502. if(debug) {
  503. for(j = 0; j < 2; j++) {
  504. g = &gens[j];
  505. print("%d\t%d\t%d-%d\n", g->gnum, g->count, g->low, g->high);
  506. }
  507. }
  508. for(i = 0; i < nsects; i++) {
  509. readdata(i, hdr, MAXHDR, 0);
  510. if(memcmp(hdr, magic, MAGSIZE) == 0) {
  511. n = MAGSIZE + getc3(&hdr[MAGSIZE], &u);
  512. n += getc3(&hdr[n], &v);
  513. g = nil;
  514. for(j = 0; j < 2; j++) {
  515. g = &gens[j];
  516. if(g->gnum == u)
  517. break;
  518. }
  519. if(j == 2)
  520. damaged("generation botch");
  521. s = g->vect[v - g->low];
  522. s->seq = v;
  523. s->toff = n;
  524. if(s->sect < 0)
  525. s->sect = i;
  526. else if(v == g->high && g->dup == nil) {
  527. s = emalloc9p(sizeof(Sect));
  528. s->sect = i;
  529. g->dup = s;
  530. }
  531. else
  532. damaged("dup block");
  533. }
  534. }
  535. for(j = 0; j < 2; j++) {
  536. g = &gens[j];
  537. for(i = 0; i < g->count; i++) {
  538. s = g->vect[i];
  539. if(g->tail == nil)
  540. g->head = s;
  541. else
  542. g->tail->next = s;
  543. g->tail = s;
  544. s->next = nil;
  545. }
  546. free(g->vect);
  547. }
  548. cursect = -1;
  549. if(!readonly) {
  550. checkdata();
  551. checksweep();
  552. }
  553. load0(1);
  554. load0(0);
  555. if(ltime != 0) {
  556. u = now();
  557. if(u < ltime) {
  558. delta = ltime - u;
  559. if(diags)
  560. fprint(2, "%s: check clock: delta = %lud\n", argv0, delta);
  561. }
  562. }
  563. limit = 80 * nsects * sectsize / 100;
  564. maxwrite = sectsize - MAXHDR - Nwrite - Nsum;
  565. if(maxwrite > WRSIZE)
  566. maxwrite = WRSIZE;
  567. }
  568. static int
  569. sputw(Sect *s, Jrec *j, int mtime, Extent *x, void *a)
  570. {
  571. ulong t;
  572. int err, n, r;
  573. uchar buff[Nmax], type[1];
  574. if(debug)
  575. fprint(2, "put %J\n", j);
  576. if(mtime) {
  577. t = j->mtime;
  578. if(s->time == NOTIME) {
  579. put4(buff, t);
  580. if(!writedata(1, s->sect, buff, 4, s->toff)) {
  581. dupsect(s, 1);
  582. writedata(0, s->sect, buff, 4, s->toff);
  583. }
  584. s->time = t;
  585. j->mtime = 0;
  586. }
  587. else {
  588. j->mtime = t - s->time;
  589. s->time = t;
  590. }
  591. }
  592. n = convJ2M(j, buff);
  593. if(n < 0)
  594. damaged("convJ2M");
  595. // Window 4
  596. err = 2;
  597. for(;;) {
  598. err--;
  599. if(!err)
  600. dupsect(s, 1); // Window 4 damage
  601. t = s->coff + 1;
  602. if(!writedata(err, s->sect, buff, n, t))
  603. continue;
  604. t += n;
  605. r = n;
  606. if(x != nil) {
  607. x->sect = s->sect;
  608. x->addr = t;
  609. if(!writedata(err, s->sect, a, j->size, t))
  610. continue;
  611. t += j->size;
  612. r += j->size;
  613. }
  614. type[0] = j->type;
  615. if(!writedata(err, s->sect, type, 1, s->coff))
  616. continue;
  617. r++;
  618. break;
  619. }
  620. s->coff = t;
  621. return r;
  622. }
  623. static void
  624. summarize(void)
  625. {
  626. Gen *g;
  627. uchar *b;
  628. Entry *e;
  629. Extent *x;
  630. Jrec j, sum;
  631. Sect *s, *t;
  632. ulong off, ctime;
  633. int n, bytes, more, mtime, sumd;
  634. g = &gens[eparity];
  635. s = g->head;
  636. g->head = s->next;
  637. if(g->head == nil)
  638. g->tail = nil;
  639. g = &gens[eparity^1];
  640. t = g->tail;
  641. b = sectbuff;
  642. x = nil;
  643. if(debug)
  644. fprint(2, "summarize\n");
  645. for(;;) { // Window 1
  646. readdata(s->sect, b, sectsize, 0);
  647. off = s->toff;
  648. ctime = get4(&b[off]);
  649. off += 4;
  650. sumd = 0;
  651. cursect = s->sect;
  652. while(b[off] != 0xFF) {
  653. n = convM2J(&j, &b[off]);
  654. if(n < 0)
  655. damaged("bad Jrec");
  656. if(debug)
  657. fprint(2, "read %J\n", &j);
  658. off += n;
  659. bytes = n;
  660. mtime = 0;
  661. switch(j.type) {
  662. case FT_create:
  663. ctime += j.mtime;
  664. mtime = 1;
  665. create:
  666. e = elookup(j.fnum);
  667. if(e == nil)
  668. continue;
  669. break;
  670. case FT_chmod:
  671. e = elookup(j.fnum);
  672. if(e == nil || j.mnum != e->mnum)
  673. continue;
  674. break;
  675. case FT_REMOVE:
  676. e = elookup(j.fnum);
  677. if(e == nil)
  678. continue;
  679. break;
  680. case FT_trunc:
  681. ctime += j.mtime;
  682. mtime = 1;
  683. e = elookup(j.tnum);
  684. if(e == nil) {
  685. if(debug)
  686. fprint(2, "-> create\n");
  687. j.type = FT_create;
  688. goto create;
  689. }
  690. break;
  691. case FT_AWRITE:
  692. goto write;
  693. case FT_WRITE:
  694. ctime += j.mtime;
  695. mtime = 1;
  696. write:
  697. e = elookup(j.fnum);
  698. if(e == nil) {
  699. off += j.size;
  700. continue;
  701. }
  702. x = esum(e, s->sect, off, &more);
  703. if(x == nil) {
  704. damaged("missing extent");
  705. off += j.size;
  706. continue;
  707. }
  708. if(more) {
  709. j.type = FT_AWRITE;
  710. mtime = 0;
  711. }
  712. bytes += j.size;
  713. break;
  714. case FT_SUMMARY:
  715. case FT_SUMBEG:
  716. case FT_SUMEND:
  717. continue;
  718. default:
  719. damaged("summarize botch");
  720. }
  721. if(!sumd) {
  722. if(t->coff + Nsumbeg >= sectsize - 1)
  723. t = newsum(g, t->seq + 1);
  724. sum.type = FT_SUMBEG;
  725. sum.seq = s->seq;
  726. if(debug)
  727. fprint(2, "+ %J\n", &sum);
  728. t->sum += sputw(t, &sum, 0, nil, nil);
  729. if(t->sum >= Nsum)
  730. t->sum = Nsum;
  731. sumd = 1;
  732. }
  733. if(t->coff + bytes >= sectsize - Nsum + t->sum - 1)
  734. t = newsum(g, t->seq + 1);
  735. if(mtime)
  736. j.mtime = ctime;
  737. switch(j.type) {
  738. case FT_AWRITE:
  739. case FT_WRITE:
  740. sputw(t, &j, mtime, x, &b[off]);
  741. off += j.size;
  742. break;
  743. default:
  744. sputw(t, &j, mtime, nil, nil);
  745. }
  746. }
  747. cursect = -1;
  748. if(t->coff + Nsumbeg >= sectsize - 1)
  749. t = newsum(g, t->seq + 1);
  750. if(sumd)
  751. sum.type = FT_SUMEND;
  752. else {
  753. sum.type = FT_SUMMARY;
  754. sum.seq = s->seq;
  755. }
  756. if(debug)
  757. fprint(2, "+ %J\n", &sum);
  758. t->sum += sputw(t, &sum, 0, nil, nil);
  759. if(t->sum >= Nsum)
  760. t->sum = Nsum;
  761. // Window 2
  762. freesect(s);
  763. g = &gens[eparity];
  764. s = g->head;
  765. if(s == nil) {
  766. // Window 3
  767. g->gnum += 2;
  768. newsum(g, 0);
  769. eparity ^= 1;
  770. return;
  771. }
  772. if(nfree >= Nfree)
  773. return;
  774. g->head = s->next;
  775. if(g->head == nil)
  776. g->tail = nil;
  777. g = &gens[eparity^1];
  778. }
  779. }
  780. char *
  781. need(int bytes)
  782. {
  783. Gen *g;
  784. int sums;
  785. Sect *s, *t;
  786. sums = 0;
  787. for(;;) {
  788. s = gens[eparity].tail;
  789. if(s->coff + bytes < sectsize - Nsum + s->sum - 1)
  790. return nil;
  791. if(nfree >= Nfree)
  792. break;
  793. if(sums == 2) {
  794. readonly = 1;
  795. return "generation full";
  796. }
  797. summarize();
  798. sums++;
  799. }
  800. g = &gens[eparity];
  801. t = getsect();
  802. t->seq = g->tail->seq + 1;
  803. newsect(g, t);
  804. return nil;
  805. }
  806. void
  807. putw(Jrec *j, int mtime, Extent *x, void *a)
  808. {
  809. sputw(gens[eparity].tail, j, mtime, x, a);
  810. }
  811. void
  812. put(Jrec *j, int mtime)
  813. {
  814. sputw(gens[eparity].tail, j, mtime, nil, nil);
  815. }