journal.c 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883
  1. /*
  2. * fs/logfs/journal.c - journal handling code
  3. *
  4. * As should be obvious for Linux kernel code, license is GPLv2
  5. *
  6. * Copyright (c) 2005-2008 Joern Engel <joern@logfs.org>
  7. */
  8. #include "logfs.h"
  9. static void logfs_calc_free(struct super_block *sb)
  10. {
  11. struct logfs_super *super = logfs_super(sb);
  12. u64 reserve, no_segs = super->s_no_segs;
  13. s64 free;
  14. int i;
  15. /* superblock segments */
  16. no_segs -= 2;
  17. super->s_no_journal_segs = 0;
  18. /* journal */
  19. journal_for_each(i)
  20. if (super->s_journal_seg[i]) {
  21. no_segs--;
  22. super->s_no_journal_segs++;
  23. }
  24. /* open segments plus one extra per level for GC */
  25. no_segs -= 2 * super->s_total_levels;
  26. free = no_segs * (super->s_segsize - LOGFS_SEGMENT_RESERVE);
  27. free -= super->s_used_bytes;
  28. /* just a bit extra */
  29. free -= super->s_total_levels * 4096;
  30. /* Bad blocks are 'paid' for with speed reserve - the filesystem
  31. * simply gets slower as bad blocks accumulate. Until the bad blocks
  32. * exceed the speed reserve - then the filesystem gets smaller.
  33. */
  34. reserve = super->s_bad_segments + super->s_bad_seg_reserve;
  35. reserve *= super->s_segsize - LOGFS_SEGMENT_RESERVE;
  36. reserve = max(reserve, super->s_speed_reserve);
  37. free -= reserve;
  38. if (free < 0)
  39. free = 0;
  40. super->s_free_bytes = free;
  41. }
  42. static void reserve_sb_and_journal(struct super_block *sb)
  43. {
  44. struct logfs_super *super = logfs_super(sb);
  45. struct btree_head32 *head = &super->s_reserved_segments;
  46. int i, err;
  47. err = btree_insert32(head, seg_no(sb, super->s_sb_ofs[0]), (void *)1,
  48. GFP_KERNEL);
  49. BUG_ON(err);
  50. err = btree_insert32(head, seg_no(sb, super->s_sb_ofs[1]), (void *)1,
  51. GFP_KERNEL);
  52. BUG_ON(err);
  53. journal_for_each(i) {
  54. if (!super->s_journal_seg[i])
  55. continue;
  56. err = btree_insert32(head, super->s_journal_seg[i], (void *)1,
  57. GFP_KERNEL);
  58. BUG_ON(err);
  59. }
  60. }
  61. static void read_dynsb(struct super_block *sb,
  62. struct logfs_je_dynsb *dynsb)
  63. {
  64. struct logfs_super *super = logfs_super(sb);
  65. super->s_gec = be64_to_cpu(dynsb->ds_gec);
  66. super->s_sweeper = be64_to_cpu(dynsb->ds_sweeper);
  67. super->s_victim_ino = be64_to_cpu(dynsb->ds_victim_ino);
  68. super->s_rename_dir = be64_to_cpu(dynsb->ds_rename_dir);
  69. super->s_rename_pos = be64_to_cpu(dynsb->ds_rename_pos);
  70. super->s_used_bytes = be64_to_cpu(dynsb->ds_used_bytes);
  71. super->s_generation = be32_to_cpu(dynsb->ds_generation);
  72. }
  73. static void read_anchor(struct super_block *sb,
  74. struct logfs_je_anchor *da)
  75. {
  76. struct logfs_super *super = logfs_super(sb);
  77. struct inode *inode = super->s_master_inode;
  78. struct logfs_inode *li = logfs_inode(inode);
  79. int i;
  80. super->s_last_ino = be64_to_cpu(da->da_last_ino);
  81. li->li_flags = 0;
  82. li->li_height = da->da_height;
  83. i_size_write(inode, be64_to_cpu(da->da_size));
  84. li->li_used_bytes = be64_to_cpu(da->da_used_bytes);
  85. for (i = 0; i < LOGFS_EMBEDDED_FIELDS; i++)
  86. li->li_data[i] = be64_to_cpu(da->da_data[i]);
  87. }
  88. static void read_erasecount(struct super_block *sb,
  89. struct logfs_je_journal_ec *ec)
  90. {
  91. struct logfs_super *super = logfs_super(sb);
  92. int i;
  93. journal_for_each(i)
  94. super->s_journal_ec[i] = be32_to_cpu(ec->ec[i]);
  95. }
  96. static int read_area(struct super_block *sb, struct logfs_je_area *a)
  97. {
  98. struct logfs_super *super = logfs_super(sb);
  99. struct logfs_area *area = super->s_area[a->gc_level];
  100. u64 ofs;
  101. u32 writemask = ~(super->s_writesize - 1);
  102. if (a->gc_level >= LOGFS_NO_AREAS)
  103. return -EIO;
  104. if (a->vim != VIM_DEFAULT)
  105. return -EIO; /* TODO: close area and continue */
  106. area->a_used_bytes = be32_to_cpu(a->used_bytes);
  107. area->a_written_bytes = area->a_used_bytes & writemask;
  108. area->a_segno = be32_to_cpu(a->segno);
  109. if (area->a_segno)
  110. area->a_is_open = 1;
  111. ofs = dev_ofs(sb, area->a_segno, area->a_written_bytes);
  112. if (super->s_writesize > 1)
  113. logfs_buf_recover(area, ofs, a + 1, super->s_writesize);
  114. else
  115. logfs_buf_recover(area, ofs, NULL, 0);
  116. return 0;
  117. }
  118. static void *unpack(void *from, void *to)
  119. {
  120. struct logfs_journal_header *jh = from;
  121. void *data = from + sizeof(struct logfs_journal_header);
  122. int err;
  123. size_t inlen, outlen;
  124. inlen = be16_to_cpu(jh->h_len);
  125. outlen = be16_to_cpu(jh->h_datalen);
  126. if (jh->h_compr == COMPR_NONE)
  127. memcpy(to, data, inlen);
  128. else {
  129. err = logfs_uncompress(data, to, inlen, outlen);
  130. BUG_ON(err);
  131. }
  132. return to;
  133. }
  134. static int __read_je_header(struct super_block *sb, u64 ofs,
  135. struct logfs_journal_header *jh)
  136. {
  137. struct logfs_super *super = logfs_super(sb);
  138. size_t bufsize = max_t(size_t, sb->s_blocksize, super->s_writesize)
  139. + MAX_JOURNAL_HEADER;
  140. u16 type, len, datalen;
  141. int err;
  142. /* read header only */
  143. err = wbuf_read(sb, ofs, sizeof(*jh), jh);
  144. if (err)
  145. return err;
  146. type = be16_to_cpu(jh->h_type);
  147. len = be16_to_cpu(jh->h_len);
  148. datalen = be16_to_cpu(jh->h_datalen);
  149. if (len > sb->s_blocksize)
  150. return -EIO;
  151. if ((type < JE_FIRST) || (type > JE_LAST))
  152. return -EIO;
  153. if (datalen > bufsize)
  154. return -EIO;
  155. return 0;
  156. }
  157. static int __read_je_payload(struct super_block *sb, u64 ofs,
  158. struct logfs_journal_header *jh)
  159. {
  160. u16 len;
  161. int err;
  162. len = be16_to_cpu(jh->h_len);
  163. err = wbuf_read(sb, ofs + sizeof(*jh), len, jh + 1);
  164. if (err)
  165. return err;
  166. if (jh->h_crc != logfs_crc32(jh, len + sizeof(*jh), 4)) {
  167. /* Old code was confused. It forgot about the header length
  168. * and stopped calculating the crc 16 bytes before the end
  169. * of data - ick!
  170. * FIXME: Remove this hack once the old code is fixed.
  171. */
  172. if (jh->h_crc == logfs_crc32(jh, len, 4))
  173. WARN_ON_ONCE(1);
  174. else
  175. return -EIO;
  176. }
  177. return 0;
  178. }
  179. /*
  180. * jh needs to be large enough to hold the complete entry, not just the header
  181. */
  182. static int __read_je(struct super_block *sb, u64 ofs,
  183. struct logfs_journal_header *jh)
  184. {
  185. int err;
  186. err = __read_je_header(sb, ofs, jh);
  187. if (err)
  188. return err;
  189. return __read_je_payload(sb, ofs, jh);
  190. }
  191. static int read_je(struct super_block *sb, u64 ofs)
  192. {
  193. struct logfs_super *super = logfs_super(sb);
  194. struct logfs_journal_header *jh = super->s_compressed_je;
  195. void *scratch = super->s_je;
  196. u16 type, datalen;
  197. int err;
  198. err = __read_je(sb, ofs, jh);
  199. if (err)
  200. return err;
  201. type = be16_to_cpu(jh->h_type);
  202. datalen = be16_to_cpu(jh->h_datalen);
  203. switch (type) {
  204. case JE_DYNSB:
  205. read_dynsb(sb, unpack(jh, scratch));
  206. break;
  207. case JE_ANCHOR:
  208. read_anchor(sb, unpack(jh, scratch));
  209. break;
  210. case JE_ERASECOUNT:
  211. read_erasecount(sb, unpack(jh, scratch));
  212. break;
  213. case JE_AREA:
  214. read_area(sb, unpack(jh, scratch));
  215. break;
  216. case JE_OBJ_ALIAS:
  217. err = logfs_load_object_aliases(sb, unpack(jh, scratch),
  218. datalen);
  219. break;
  220. default:
  221. WARN_ON_ONCE(1);
  222. return -EIO;
  223. }
  224. return err;
  225. }
  226. static int logfs_read_segment(struct super_block *sb, u32 segno)
  227. {
  228. struct logfs_super *super = logfs_super(sb);
  229. struct logfs_journal_header *jh = super->s_compressed_je;
  230. u64 ofs, seg_ofs = dev_ofs(sb, segno, 0);
  231. u32 h_ofs, last_ofs = 0;
  232. u16 len, datalen, last_len = 0;
  233. int i, err;
  234. /* search for most recent commit */
  235. for (h_ofs = 0; h_ofs < super->s_segsize; h_ofs += sizeof(*jh)) {
  236. ofs = seg_ofs + h_ofs;
  237. err = __read_je_header(sb, ofs, jh);
  238. if (err)
  239. continue;
  240. if (jh->h_type != cpu_to_be16(JE_COMMIT))
  241. continue;
  242. err = __read_je_payload(sb, ofs, jh);
  243. if (err)
  244. continue;
  245. len = be16_to_cpu(jh->h_len);
  246. datalen = be16_to_cpu(jh->h_datalen);
  247. if ((datalen > sizeof(super->s_je_array)) ||
  248. (datalen % sizeof(__be64)))
  249. continue;
  250. last_ofs = h_ofs;
  251. last_len = datalen;
  252. h_ofs += ALIGN(len, sizeof(*jh)) - sizeof(*jh);
  253. }
  254. /* read commit */
  255. if (last_ofs == 0)
  256. return -ENOENT;
  257. ofs = seg_ofs + last_ofs;
  258. log_journal("Read commit from %llx\n", ofs);
  259. err = __read_je(sb, ofs, jh);
  260. BUG_ON(err); /* We should have caught it in the scan loop already */
  261. if (err)
  262. return err;
  263. /* uncompress */
  264. unpack(jh, super->s_je_array);
  265. super->s_no_je = last_len / sizeof(__be64);
  266. /* iterate over array */
  267. for (i = 0; i < super->s_no_je; i++) {
  268. err = read_je(sb, be64_to_cpu(super->s_je_array[i]));
  269. if (err)
  270. return err;
  271. }
  272. super->s_journal_area->a_segno = segno;
  273. return 0;
  274. }
  275. static u64 read_gec(struct super_block *sb, u32 segno)
  276. {
  277. struct logfs_segment_header sh;
  278. __be32 crc;
  279. int err;
  280. if (!segno)
  281. return 0;
  282. err = wbuf_read(sb, dev_ofs(sb, segno, 0), sizeof(sh), &sh);
  283. if (err)
  284. return 0;
  285. crc = logfs_crc32(&sh, sizeof(sh), 4);
  286. if (crc != sh.crc) {
  287. WARN_ON(sh.gec != cpu_to_be64(0xffffffffffffffffull));
  288. /* Most likely it was just erased */
  289. return 0;
  290. }
  291. return be64_to_cpu(sh.gec);
  292. }
  293. static int logfs_read_journal(struct super_block *sb)
  294. {
  295. struct logfs_super *super = logfs_super(sb);
  296. u64 gec[LOGFS_JOURNAL_SEGS], max;
  297. u32 segno;
  298. int i, max_i;
  299. max = 0;
  300. max_i = -1;
  301. journal_for_each(i) {
  302. segno = super->s_journal_seg[i];
  303. gec[i] = read_gec(sb, super->s_journal_seg[i]);
  304. if (gec[i] > max) {
  305. max = gec[i];
  306. max_i = i;
  307. }
  308. }
  309. if (max_i == -1)
  310. return -EIO;
  311. /* FIXME: Try older segments in case of error */
  312. return logfs_read_segment(sb, super->s_journal_seg[max_i]);
  313. }
  314. /*
  315. * First search the current segment (outer loop), then pick the next segment
  316. * in the array, skipping any zero entries (inner loop).
  317. */
  318. static void journal_get_free_segment(struct logfs_area *area)
  319. {
  320. struct logfs_super *super = logfs_super(area->a_sb);
  321. int i;
  322. journal_for_each(i) {
  323. if (area->a_segno != super->s_journal_seg[i])
  324. continue;
  325. do {
  326. i++;
  327. if (i == LOGFS_JOURNAL_SEGS)
  328. i = 0;
  329. } while (!super->s_journal_seg[i]);
  330. area->a_segno = super->s_journal_seg[i];
  331. area->a_erase_count = ++(super->s_journal_ec[i]);
  332. log_journal("Journal now at %x (ec %x)\n", area->a_segno,
  333. area->a_erase_count);
  334. return;
  335. }
  336. BUG();
  337. }
  338. static void journal_get_erase_count(struct logfs_area *area)
  339. {
  340. /* erase count is stored globally and incremented in
  341. * journal_get_free_segment() - nothing to do here */
  342. }
  343. static int journal_erase_segment(struct logfs_area *area)
  344. {
  345. struct super_block *sb = area->a_sb;
  346. struct logfs_segment_header sh;
  347. u64 ofs;
  348. int err;
  349. err = logfs_erase_segment(sb, area->a_segno, 1);
  350. if (err)
  351. return err;
  352. sh.pad = 0;
  353. sh.type = SEG_JOURNAL;
  354. sh.level = 0;
  355. sh.segno = cpu_to_be32(area->a_segno);
  356. sh.ec = cpu_to_be32(area->a_erase_count);
  357. sh.gec = cpu_to_be64(logfs_super(sb)->s_gec);
  358. sh.crc = logfs_crc32(&sh, sizeof(sh), 4);
  359. /* This causes a bug in segment.c. Not yet. */
  360. //logfs_set_segment_erased(sb, area->a_segno, area->a_erase_count, 0);
  361. ofs = dev_ofs(sb, area->a_segno, 0);
  362. area->a_used_bytes = ALIGN(sizeof(sh), 16);
  363. logfs_buf_write(area, ofs, &sh, sizeof(sh));
  364. return 0;
  365. }
  366. static size_t __logfs_write_header(struct logfs_super *super,
  367. struct logfs_journal_header *jh, size_t len, size_t datalen,
  368. u16 type, u8 compr)
  369. {
  370. jh->h_len = cpu_to_be16(len);
  371. jh->h_type = cpu_to_be16(type);
  372. jh->h_datalen = cpu_to_be16(datalen);
  373. jh->h_compr = compr;
  374. jh->h_pad[0] = 'H';
  375. jh->h_pad[1] = 'E';
  376. jh->h_pad[2] = 'A';
  377. jh->h_pad[3] = 'D';
  378. jh->h_pad[4] = 'R';
  379. jh->h_crc = logfs_crc32(jh, len + sizeof(*jh), 4);
  380. return ALIGN(len, 16) + sizeof(*jh);
  381. }
  382. static size_t logfs_write_header(struct logfs_super *super,
  383. struct logfs_journal_header *jh, size_t datalen, u16 type)
  384. {
  385. size_t len = datalen;
  386. return __logfs_write_header(super, jh, len, datalen, type, COMPR_NONE);
  387. }
  388. static inline size_t logfs_journal_erasecount_size(struct logfs_super *super)
  389. {
  390. return LOGFS_JOURNAL_SEGS * sizeof(__be32);
  391. }
  392. static void *logfs_write_erasecount(struct super_block *sb, void *_ec,
  393. u16 *type, size_t *len)
  394. {
  395. struct logfs_super *super = logfs_super(sb);
  396. struct logfs_je_journal_ec *ec = _ec;
  397. int i;
  398. journal_for_each(i)
  399. ec->ec[i] = cpu_to_be32(super->s_journal_ec[i]);
  400. *type = JE_ERASECOUNT;
  401. *len = logfs_journal_erasecount_size(super);
  402. return ec;
  403. }
  404. static void account_shadow(void *_shadow, unsigned long _sb, u64 ignore,
  405. size_t ignore2)
  406. {
  407. struct logfs_shadow *shadow = _shadow;
  408. struct super_block *sb = (void *)_sb;
  409. struct logfs_super *super = logfs_super(sb);
  410. /* consume new space */
  411. super->s_free_bytes -= shadow->new_len;
  412. super->s_used_bytes += shadow->new_len;
  413. super->s_dirty_used_bytes -= shadow->new_len;
  414. /* free up old space */
  415. super->s_free_bytes += shadow->old_len;
  416. super->s_used_bytes -= shadow->old_len;
  417. super->s_dirty_free_bytes -= shadow->old_len;
  418. logfs_set_segment_used(sb, shadow->old_ofs, -shadow->old_len);
  419. logfs_set_segment_used(sb, shadow->new_ofs, shadow->new_len);
  420. log_journal("account_shadow(%llx, %llx, %x) %llx->%llx %x->%x\n",
  421. shadow->ino, shadow->bix, shadow->gc_level,
  422. shadow->old_ofs, shadow->new_ofs,
  423. shadow->old_len, shadow->new_len);
  424. mempool_free(shadow, super->s_shadow_pool);
  425. }
  426. static void account_shadows(struct super_block *sb)
  427. {
  428. struct logfs_super *super = logfs_super(sb);
  429. struct inode *inode = super->s_master_inode;
  430. struct logfs_inode *li = logfs_inode(inode);
  431. struct shadow_tree *tree = &super->s_shadow_tree;
  432. btree_grim_visitor64(&tree->new, (unsigned long)sb, account_shadow);
  433. btree_grim_visitor64(&tree->old, (unsigned long)sb, account_shadow);
  434. if (li->li_block) {
  435. /*
  436. * We never actually use the structure, when attached to the
  437. * master inode. But it is easier to always free it here than
  438. * to have checks in several places elsewhere when allocating
  439. * it.
  440. */
  441. li->li_block->ops->free_block(sb, li->li_block);
  442. }
  443. BUG_ON((s64)li->li_used_bytes < 0);
  444. }
  445. static void *__logfs_write_anchor(struct super_block *sb, void *_da,
  446. u16 *type, size_t *len)
  447. {
  448. struct logfs_super *super = logfs_super(sb);
  449. struct logfs_je_anchor *da = _da;
  450. struct inode *inode = super->s_master_inode;
  451. struct logfs_inode *li = logfs_inode(inode);
  452. int i;
  453. da->da_height = li->li_height;
  454. da->da_last_ino = cpu_to_be64(super->s_last_ino);
  455. da->da_size = cpu_to_be64(i_size_read(inode));
  456. da->da_used_bytes = cpu_to_be64(li->li_used_bytes);
  457. for (i = 0; i < LOGFS_EMBEDDED_FIELDS; i++)
  458. da->da_data[i] = cpu_to_be64(li->li_data[i]);
  459. *type = JE_ANCHOR;
  460. *len = sizeof(*da);
  461. return da;
  462. }
  463. static void *logfs_write_dynsb(struct super_block *sb, void *_dynsb,
  464. u16 *type, size_t *len)
  465. {
  466. struct logfs_super *super = logfs_super(sb);
  467. struct logfs_je_dynsb *dynsb = _dynsb;
  468. dynsb->ds_gec = cpu_to_be64(super->s_gec);
  469. dynsb->ds_sweeper = cpu_to_be64(super->s_sweeper);
  470. dynsb->ds_victim_ino = cpu_to_be64(super->s_victim_ino);
  471. dynsb->ds_rename_dir = cpu_to_be64(super->s_rename_dir);
  472. dynsb->ds_rename_pos = cpu_to_be64(super->s_rename_pos);
  473. dynsb->ds_used_bytes = cpu_to_be64(super->s_used_bytes);
  474. dynsb->ds_generation = cpu_to_be32(super->s_generation);
  475. *type = JE_DYNSB;
  476. *len = sizeof(*dynsb);
  477. return dynsb;
  478. }
  479. static void write_wbuf(struct super_block *sb, struct logfs_area *area,
  480. void *wbuf)
  481. {
  482. struct logfs_super *super = logfs_super(sb);
  483. struct address_space *mapping = super->s_mapping_inode->i_mapping;
  484. u64 ofs;
  485. pgoff_t index;
  486. int page_ofs;
  487. struct page *page;
  488. ofs = dev_ofs(sb, area->a_segno,
  489. area->a_used_bytes & ~(super->s_writesize - 1));
  490. index = ofs >> PAGE_SHIFT;
  491. page_ofs = ofs & (PAGE_SIZE - 1);
  492. page = find_lock_page(mapping, index);
  493. BUG_ON(!page);
  494. memcpy(wbuf, page_address(page) + page_ofs, super->s_writesize);
  495. unlock_page(page);
  496. }
  497. static void *logfs_write_area(struct super_block *sb, void *_a,
  498. u16 *type, size_t *len)
  499. {
  500. struct logfs_super *super = logfs_super(sb);
  501. struct logfs_area *area = super->s_area[super->s_sum_index];
  502. struct logfs_je_area *a = _a;
  503. a->vim = VIM_DEFAULT;
  504. a->gc_level = super->s_sum_index;
  505. a->used_bytes = cpu_to_be32(area->a_used_bytes);
  506. a->segno = cpu_to_be32(area->a_segno);
  507. if (super->s_writesize > 1)
  508. write_wbuf(sb, area, a + 1);
  509. *type = JE_AREA;
  510. *len = sizeof(*a) + super->s_writesize;
  511. return a;
  512. }
  513. static void *logfs_write_commit(struct super_block *sb, void *h,
  514. u16 *type, size_t *len)
  515. {
  516. struct logfs_super *super = logfs_super(sb);
  517. *type = JE_COMMIT;
  518. *len = super->s_no_je * sizeof(__be64);
  519. return super->s_je_array;
  520. }
  521. static size_t __logfs_write_je(struct super_block *sb, void *buf, u16 type,
  522. size_t len)
  523. {
  524. struct logfs_super *super = logfs_super(sb);
  525. void *header = super->s_compressed_je;
  526. void *data = header + sizeof(struct logfs_journal_header);
  527. ssize_t compr_len, pad_len;
  528. u8 compr = COMPR_ZLIB;
  529. if (len == 0)
  530. return logfs_write_header(super, header, 0, type);
  531. compr_len = logfs_compress(buf, data, len, sb->s_blocksize);
  532. if (compr_len < 0 || type == JE_ANCHOR) {
  533. BUG_ON(len > sb->s_blocksize);
  534. memcpy(data, buf, len);
  535. compr_len = len;
  536. compr = COMPR_NONE;
  537. }
  538. pad_len = ALIGN(compr_len, 16);
  539. memset(data + compr_len, 0, pad_len - compr_len);
  540. return __logfs_write_header(super, header, compr_len, len, type, compr);
  541. }
  542. static s64 logfs_get_free_bytes(struct logfs_area *area, size_t *bytes,
  543. int must_pad)
  544. {
  545. u32 writesize = logfs_super(area->a_sb)->s_writesize;
  546. s32 ofs;
  547. int ret;
  548. ret = logfs_open_area(area, *bytes);
  549. if (ret)
  550. return -EAGAIN;
  551. ofs = area->a_used_bytes;
  552. area->a_used_bytes += *bytes;
  553. if (must_pad) {
  554. area->a_used_bytes = ALIGN(area->a_used_bytes, writesize);
  555. *bytes = area->a_used_bytes - ofs;
  556. }
  557. return dev_ofs(area->a_sb, area->a_segno, ofs);
  558. }
  559. static int logfs_write_je_buf(struct super_block *sb, void *buf, u16 type,
  560. size_t buf_len)
  561. {
  562. struct logfs_super *super = logfs_super(sb);
  563. struct logfs_area *area = super->s_journal_area;
  564. struct logfs_journal_header *jh = super->s_compressed_je;
  565. size_t len;
  566. int must_pad = 0;
  567. s64 ofs;
  568. len = __logfs_write_je(sb, buf, type, buf_len);
  569. if (jh->h_type == cpu_to_be16(JE_COMMIT))
  570. must_pad = 1;
  571. ofs = logfs_get_free_bytes(area, &len, must_pad);
  572. if (ofs < 0)
  573. return ofs;
  574. logfs_buf_write(area, ofs, super->s_compressed_je, len);
  575. super->s_je_array[super->s_no_je++] = cpu_to_be64(ofs);
  576. return 0;
  577. }
  578. static int logfs_write_je(struct super_block *sb,
  579. void* (*write)(struct super_block *sb, void *scratch,
  580. u16 *type, size_t *len))
  581. {
  582. void *buf;
  583. size_t len;
  584. u16 type;
  585. buf = write(sb, logfs_super(sb)->s_je, &type, &len);
  586. return logfs_write_je_buf(sb, buf, type, len);
  587. }
  588. int write_alias_journal(struct super_block *sb, u64 ino, u64 bix,
  589. level_t level, int child_no, __be64 val)
  590. {
  591. struct logfs_super *super = logfs_super(sb);
  592. struct logfs_obj_alias *oa = super->s_je;
  593. int err = 0, fill = super->s_je_fill;
  594. log_aliases("logfs_write_obj_aliases #%x(%llx, %llx, %x, %x) %llx\n",
  595. fill, ino, bix, level, child_no, be64_to_cpu(val));
  596. oa[fill].ino = cpu_to_be64(ino);
  597. oa[fill].bix = cpu_to_be64(bix);
  598. oa[fill].val = val;
  599. oa[fill].level = (__force u8)level;
  600. oa[fill].child_no = cpu_to_be16(child_no);
  601. fill++;
  602. if (fill >= sb->s_blocksize / sizeof(*oa)) {
  603. err = logfs_write_je_buf(sb, oa, JE_OBJ_ALIAS, sb->s_blocksize);
  604. fill = 0;
  605. }
  606. super->s_je_fill = fill;
  607. return err;
  608. }
  609. static int logfs_write_obj_aliases(struct super_block *sb)
  610. {
  611. struct logfs_super *super = logfs_super(sb);
  612. int err;
  613. log_journal("logfs_write_obj_aliases: %d aliases to write\n",
  614. super->s_no_object_aliases);
  615. super->s_je_fill = 0;
  616. err = logfs_write_obj_aliases_pagecache(sb);
  617. if (err)
  618. return err;
  619. if (super->s_je_fill)
  620. err = logfs_write_je_buf(sb, super->s_je, JE_OBJ_ALIAS,
  621. super->s_je_fill
  622. * sizeof(struct logfs_obj_alias));
  623. return err;
  624. }
  625. /*
  626. * Write all journal entries. The goto logic ensures that all journal entries
  627. * are written whenever a new segment is used. It is ugly and potentially a
  628. * bit wasteful, but robustness is more important. With this we can *always*
  629. * erase all journal segments except the one containing the most recent commit.
  630. */
  631. void logfs_write_anchor(struct super_block *sb)
  632. {
  633. struct logfs_super *super = logfs_super(sb);
  634. struct logfs_area *area = super->s_journal_area;
  635. int i, err;
  636. if (!(super->s_flags & LOGFS_SB_FLAG_DIRTY))
  637. return;
  638. super->s_flags &= ~LOGFS_SB_FLAG_DIRTY;
  639. BUG_ON(super->s_flags & LOGFS_SB_FLAG_SHUTDOWN);
  640. mutex_lock(&super->s_journal_mutex);
  641. /* Do this first or suffer corruption */
  642. logfs_sync_segments(sb);
  643. account_shadows(sb);
  644. again:
  645. super->s_no_je = 0;
  646. for_each_area(i) {
  647. if (!super->s_area[i]->a_is_open)
  648. continue;
  649. super->s_sum_index = i;
  650. err = logfs_write_je(sb, logfs_write_area);
  651. if (err)
  652. goto again;
  653. }
  654. err = logfs_write_obj_aliases(sb);
  655. if (err)
  656. goto again;
  657. err = logfs_write_je(sb, logfs_write_erasecount);
  658. if (err)
  659. goto again;
  660. err = logfs_write_je(sb, __logfs_write_anchor);
  661. if (err)
  662. goto again;
  663. err = logfs_write_je(sb, logfs_write_dynsb);
  664. if (err)
  665. goto again;
  666. /*
  667. * Order is imperative. First we sync all writes, including the
  668. * non-committed journal writes. Then we write the final commit and
  669. * sync the current journal segment.
  670. * There is a theoretical bug here. Syncing the journal segment will
  671. * write a number of journal entries and the final commit. All these
  672. * are written in a single operation. If the device layer writes the
  673. * data back-to-front, the commit will precede the other journal
  674. * entries, leaving a race window.
  675. * Two fixes are possible. Preferred is to fix the device layer to
  676. * ensure writes happen front-to-back. Alternatively we can insert
  677. * another logfs_sync_area() super->s_devops->sync() combo before
  678. * writing the commit.
  679. */
  680. /*
  681. * On another subject, super->s_devops->sync is usually not necessary.
  682. * Unless called from sys_sync or friends, a barrier would suffice.
  683. */
  684. super->s_devops->sync(sb);
  685. err = logfs_write_je(sb, logfs_write_commit);
  686. if (err)
  687. goto again;
  688. log_journal("Write commit to %llx\n",
  689. be64_to_cpu(super->s_je_array[super->s_no_je - 1]));
  690. logfs_sync_area(area);
  691. BUG_ON(area->a_used_bytes != area->a_written_bytes);
  692. super->s_devops->sync(sb);
  693. mutex_unlock(&super->s_journal_mutex);
  694. return;
  695. }
  696. void do_logfs_journal_wl_pass(struct super_block *sb)
  697. {
  698. struct logfs_super *super = logfs_super(sb);
  699. struct logfs_area *area = super->s_journal_area;
  700. u32 segno, ec;
  701. int i, err;
  702. log_journal("Journal requires wear-leveling.\n");
  703. /* Drop old segments */
  704. journal_for_each(i)
  705. if (super->s_journal_seg[i]) {
  706. logfs_set_segment_unreserved(sb,
  707. super->s_journal_seg[i],
  708. super->s_journal_ec[i]);
  709. super->s_journal_seg[i] = 0;
  710. super->s_journal_ec[i] = 0;
  711. }
  712. /* Get new segments */
  713. for (i = 0; i < super->s_no_journal_segs; i++) {
  714. segno = get_best_cand(sb, &super->s_reserve_list, &ec);
  715. super->s_journal_seg[i] = segno;
  716. super->s_journal_ec[i] = ec;
  717. logfs_set_segment_reserved(sb, segno);
  718. }
  719. /* Manually move journal_area */
  720. area->a_segno = super->s_journal_seg[0];
  721. area->a_is_open = 0;
  722. area->a_used_bytes = 0;
  723. /* Write journal */
  724. logfs_write_anchor(sb);
  725. /* Write superblocks */
  726. err = logfs_write_sb(sb);
  727. BUG_ON(err);
  728. }
  729. static const struct logfs_area_ops journal_area_ops = {
  730. .get_free_segment = journal_get_free_segment,
  731. .get_erase_count = journal_get_erase_count,
  732. .erase_segment = journal_erase_segment,
  733. };
  734. int logfs_init_journal(struct super_block *sb)
  735. {
  736. struct logfs_super *super = logfs_super(sb);
  737. size_t bufsize = max_t(size_t, sb->s_blocksize, super->s_writesize)
  738. + MAX_JOURNAL_HEADER;
  739. int ret = -ENOMEM;
  740. mutex_init(&super->s_journal_mutex);
  741. btree_init_mempool32(&super->s_reserved_segments, super->s_btree_pool);
  742. super->s_je = kzalloc(bufsize, GFP_KERNEL);
  743. if (!super->s_je)
  744. return ret;
  745. super->s_compressed_je = kzalloc(bufsize, GFP_KERNEL);
  746. if (!super->s_compressed_je)
  747. return ret;
  748. super->s_master_inode = logfs_new_meta_inode(sb, LOGFS_INO_MASTER);
  749. if (IS_ERR(super->s_master_inode))
  750. return PTR_ERR(super->s_master_inode);
  751. ret = logfs_read_journal(sb);
  752. if (ret)
  753. return -EIO;
  754. reserve_sb_and_journal(sb);
  755. logfs_calc_free(sb);
  756. super->s_journal_area->a_ops = &journal_area_ops;
  757. return 0;
  758. }
  759. void logfs_cleanup_journal(struct super_block *sb)
  760. {
  761. struct logfs_super *super = logfs_super(sb);
  762. btree_grim_visitor32(&super->s_reserved_segments, 0, NULL);
  763. destroy_meta_inode(super->s_master_inode);
  764. super->s_master_inode = NULL;
  765. kfree(super->s_compressed_je);
  766. kfree(super->s_je);
  767. }