resize.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592
  1. // SPDX-License-Identifier: GPL-2.0-or-later
  2. /*
  3. * resize.c
  4. *
  5. * volume resize.
  6. * Inspired by ext3/resize.c.
  7. *
  8. * Copyright (C) 2007 Oracle. All rights reserved.
  9. */
  10. #include <linux/fs.h>
  11. #include <linux/types.h>
  12. #include <cluster/masklog.h>
  13. #include "ocfs2.h"
  14. #include "alloc.h"
  15. #include "dlmglue.h"
  16. #include "inode.h"
  17. #include "journal.h"
  18. #include "super.h"
  19. #include "sysfile.h"
  20. #include "uptodate.h"
  21. #include "ocfs2_trace.h"
  22. #include "buffer_head_io.h"
  23. #include "suballoc.h"
  24. #include "resize.h"
  25. /*
  26. * Check whether there are new backup superblocks exist
  27. * in the last group. If there are some, mark them or clear
  28. * them in the bitmap.
  29. *
  30. * Return how many backups we find in the last group.
  31. */
  32. static u16 ocfs2_calc_new_backup_super(struct inode *inode,
  33. struct ocfs2_group_desc *gd,
  34. u16 cl_cpg,
  35. u16 old_bg_clusters,
  36. int set)
  37. {
  38. int i;
  39. u16 backups = 0;
  40. u32 cluster, lgd_cluster;
  41. u64 blkno, gd_blkno, lgd_blkno = le64_to_cpu(gd->bg_blkno);
  42. for (i = 0; i < OCFS2_MAX_BACKUP_SUPERBLOCKS; i++) {
  43. blkno = ocfs2_backup_super_blkno(inode->i_sb, i);
  44. cluster = ocfs2_blocks_to_clusters(inode->i_sb, blkno);
  45. gd_blkno = ocfs2_which_cluster_group(inode, cluster);
  46. if (gd_blkno < lgd_blkno)
  47. continue;
  48. else if (gd_blkno > lgd_blkno)
  49. break;
  50. /* check if already done backup super */
  51. lgd_cluster = ocfs2_blocks_to_clusters(inode->i_sb, lgd_blkno);
  52. lgd_cluster += old_bg_clusters;
  53. if (lgd_cluster >= cluster)
  54. continue;
  55. if (set)
  56. ocfs2_set_bit(cluster % cl_cpg,
  57. (unsigned long *)gd->bg_bitmap);
  58. else
  59. ocfs2_clear_bit(cluster % cl_cpg,
  60. (unsigned long *)gd->bg_bitmap);
  61. backups++;
  62. }
  63. return backups;
  64. }
  65. static int ocfs2_update_last_group_and_inode(handle_t *handle,
  66. struct inode *bm_inode,
  67. struct buffer_head *bm_bh,
  68. struct buffer_head *group_bh,
  69. u32 first_new_cluster,
  70. int new_clusters)
  71. {
  72. int ret = 0;
  73. struct ocfs2_super *osb = OCFS2_SB(bm_inode->i_sb);
  74. struct ocfs2_dinode *fe = (struct ocfs2_dinode *) bm_bh->b_data;
  75. struct ocfs2_chain_list *cl = &fe->id2.i_chain;
  76. struct ocfs2_chain_rec *cr;
  77. struct ocfs2_group_desc *group;
  78. u16 chain, num_bits, backups = 0;
  79. u16 cl_bpc = le16_to_cpu(cl->cl_bpc);
  80. u16 cl_cpg = le16_to_cpu(cl->cl_cpg);
  81. u16 old_bg_clusters;
  82. u16 contig_bits;
  83. __le16 old_bg_contig_free_bits;
  84. trace_ocfs2_update_last_group_and_inode(new_clusters,
  85. first_new_cluster);
  86. ret = ocfs2_journal_access_gd(handle, INODE_CACHE(bm_inode),
  87. group_bh, OCFS2_JOURNAL_ACCESS_WRITE);
  88. if (ret < 0) {
  89. mlog_errno(ret);
  90. goto out;
  91. }
  92. group = (struct ocfs2_group_desc *)group_bh->b_data;
  93. old_bg_clusters = le16_to_cpu(group->bg_bits) / cl_bpc;
  94. /* update the group first. */
  95. num_bits = new_clusters * cl_bpc;
  96. le16_add_cpu(&group->bg_bits, num_bits);
  97. le16_add_cpu(&group->bg_free_bits_count, num_bits);
  98. /*
  99. * check whether there are some new backup superblocks exist in
  100. * this group and update the group bitmap accordingly.
  101. */
  102. if (OCFS2_HAS_COMPAT_FEATURE(osb->sb,
  103. OCFS2_FEATURE_COMPAT_BACKUP_SB)) {
  104. backups = ocfs2_calc_new_backup_super(bm_inode,
  105. group,
  106. cl_cpg, old_bg_clusters, 1);
  107. le16_add_cpu(&group->bg_free_bits_count, -1 * backups);
  108. }
  109. contig_bits = ocfs2_find_max_contig_free_bits(group->bg_bitmap,
  110. le16_to_cpu(group->bg_bits), 0);
  111. old_bg_contig_free_bits = group->bg_contig_free_bits;
  112. group->bg_contig_free_bits = cpu_to_le16(contig_bits);
  113. ocfs2_journal_dirty(handle, group_bh);
  114. /* update the inode accordingly. */
  115. ret = ocfs2_journal_access_di(handle, INODE_CACHE(bm_inode), bm_bh,
  116. OCFS2_JOURNAL_ACCESS_WRITE);
  117. if (ret < 0) {
  118. mlog_errno(ret);
  119. goto out_rollback;
  120. }
  121. chain = le16_to_cpu(group->bg_chain);
  122. cr = (&cl->cl_recs[chain]);
  123. le32_add_cpu(&cr->c_total, num_bits);
  124. le32_add_cpu(&cr->c_free, num_bits);
  125. le32_add_cpu(&fe->id1.bitmap1.i_total, num_bits);
  126. le32_add_cpu(&fe->i_clusters, new_clusters);
  127. if (backups) {
  128. le32_add_cpu(&cr->c_free, -1 * backups);
  129. le32_add_cpu(&fe->id1.bitmap1.i_used, backups);
  130. }
  131. spin_lock(&OCFS2_I(bm_inode)->ip_lock);
  132. OCFS2_I(bm_inode)->ip_clusters = le32_to_cpu(fe->i_clusters);
  133. le64_add_cpu(&fe->i_size, (u64)new_clusters << osb->s_clustersize_bits);
  134. spin_unlock(&OCFS2_I(bm_inode)->ip_lock);
  135. i_size_write(bm_inode, le64_to_cpu(fe->i_size));
  136. ocfs2_journal_dirty(handle, bm_bh);
  137. out_rollback:
  138. if (ret < 0) {
  139. ocfs2_calc_new_backup_super(bm_inode,
  140. group,
  141. cl_cpg, old_bg_clusters, 0);
  142. le16_add_cpu(&group->bg_free_bits_count, backups);
  143. le16_add_cpu(&group->bg_bits, -1 * num_bits);
  144. le16_add_cpu(&group->bg_free_bits_count, -1 * num_bits);
  145. group->bg_contig_free_bits = old_bg_contig_free_bits;
  146. }
  147. out:
  148. if (ret)
  149. mlog_errno(ret);
  150. return ret;
  151. }
  152. static int update_backups(struct inode * inode, u32 clusters, char *data)
  153. {
  154. int i, ret = 0;
  155. u32 cluster;
  156. u64 blkno;
  157. struct buffer_head *backup = NULL;
  158. struct ocfs2_dinode *backup_di = NULL;
  159. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  160. /* calculate the real backups we need to update. */
  161. for (i = 0; i < OCFS2_MAX_BACKUP_SUPERBLOCKS; i++) {
  162. blkno = ocfs2_backup_super_blkno(inode->i_sb, i);
  163. cluster = ocfs2_blocks_to_clusters(inode->i_sb, blkno);
  164. if (cluster >= clusters)
  165. break;
  166. ret = ocfs2_read_blocks_sync(osb, blkno, 1, &backup);
  167. if (ret < 0) {
  168. mlog_errno(ret);
  169. break;
  170. }
  171. memcpy(backup->b_data, data, inode->i_sb->s_blocksize);
  172. backup_di = (struct ocfs2_dinode *)backup->b_data;
  173. backup_di->i_blkno = cpu_to_le64(blkno);
  174. ret = ocfs2_write_super_or_backup(osb, backup);
  175. brelse(backup);
  176. backup = NULL;
  177. if (ret < 0) {
  178. mlog_errno(ret);
  179. break;
  180. }
  181. }
  182. return ret;
  183. }
  184. static void ocfs2_update_super_and_backups(struct inode *inode,
  185. int new_clusters)
  186. {
  187. int ret;
  188. u32 clusters = 0;
  189. struct buffer_head *super_bh = NULL;
  190. struct ocfs2_dinode *super_di = NULL;
  191. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  192. /*
  193. * update the superblock last.
  194. * It doesn't matter if the write failed.
  195. */
  196. ret = ocfs2_read_blocks_sync(osb, OCFS2_SUPER_BLOCK_BLKNO, 1,
  197. &super_bh);
  198. if (ret < 0) {
  199. mlog_errno(ret);
  200. goto out;
  201. }
  202. super_di = (struct ocfs2_dinode *)super_bh->b_data;
  203. le32_add_cpu(&super_di->i_clusters, new_clusters);
  204. clusters = le32_to_cpu(super_di->i_clusters);
  205. ret = ocfs2_write_super_or_backup(osb, super_bh);
  206. if (ret < 0) {
  207. mlog_errno(ret);
  208. goto out;
  209. }
  210. if (OCFS2_HAS_COMPAT_FEATURE(osb->sb, OCFS2_FEATURE_COMPAT_BACKUP_SB))
  211. ret = update_backups(inode, clusters, super_bh->b_data);
  212. out:
  213. brelse(super_bh);
  214. if (ret)
  215. printk(KERN_WARNING "ocfs2: Failed to update super blocks on %s"
  216. " during fs resize. This condition is not fatal,"
  217. " but fsck.ocfs2 should be run to fix it\n",
  218. osb->dev_str);
  219. return;
  220. }
  221. /*
  222. * Extend the filesystem to the new number of clusters specified. This entry
  223. * point is only used to extend the current filesystem to the end of the last
  224. * existing group.
  225. */
  226. int ocfs2_group_extend(struct inode * inode, int new_clusters)
  227. {
  228. int ret;
  229. handle_t *handle;
  230. struct buffer_head *main_bm_bh = NULL;
  231. struct buffer_head *group_bh = NULL;
  232. struct inode *main_bm_inode = NULL;
  233. struct ocfs2_dinode *fe = NULL;
  234. struct ocfs2_group_desc *group = NULL;
  235. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  236. u16 cl_bpc;
  237. u32 first_new_cluster;
  238. u64 lgd_blkno;
  239. if (ocfs2_is_hard_readonly(osb) || ocfs2_is_soft_readonly(osb))
  240. return -EROFS;
  241. if (new_clusters < 0)
  242. return -EINVAL;
  243. else if (new_clusters == 0)
  244. return 0;
  245. main_bm_inode = ocfs2_get_system_file_inode(osb,
  246. GLOBAL_BITMAP_SYSTEM_INODE,
  247. OCFS2_INVALID_SLOT);
  248. if (!main_bm_inode) {
  249. ret = -EINVAL;
  250. mlog_errno(ret);
  251. goto out;
  252. }
  253. inode_lock(main_bm_inode);
  254. ret = ocfs2_inode_lock(main_bm_inode, &main_bm_bh, 1);
  255. if (ret < 0) {
  256. mlog_errno(ret);
  257. goto out_mutex;
  258. }
  259. fe = (struct ocfs2_dinode *)main_bm_bh->b_data;
  260. /* main_bm_bh is validated by inode read inside ocfs2_inode_lock(),
  261. * so any corruption is a code bug. */
  262. BUG_ON(!OCFS2_IS_VALID_DINODE(fe));
  263. if (le16_to_cpu(fe->id2.i_chain.cl_cpg) !=
  264. ocfs2_group_bitmap_size(osb->sb, 0,
  265. osb->s_feature_incompat) * 8) {
  266. mlog(ML_ERROR, "The disk is too old and small. "
  267. "Force to do offline resize.");
  268. ret = -EINVAL;
  269. goto out_unlock;
  270. }
  271. first_new_cluster = le32_to_cpu(fe->i_clusters);
  272. lgd_blkno = ocfs2_which_cluster_group(main_bm_inode,
  273. first_new_cluster - 1);
  274. ret = ocfs2_read_group_descriptor(main_bm_inode, fe, lgd_blkno,
  275. &group_bh);
  276. if (ret < 0) {
  277. mlog_errno(ret);
  278. goto out_unlock;
  279. }
  280. group = (struct ocfs2_group_desc *)group_bh->b_data;
  281. cl_bpc = le16_to_cpu(fe->id2.i_chain.cl_bpc);
  282. if (le16_to_cpu(group->bg_bits) / cl_bpc + new_clusters >
  283. le16_to_cpu(fe->id2.i_chain.cl_cpg)) {
  284. ret = -EINVAL;
  285. goto out_unlock;
  286. }
  287. trace_ocfs2_group_extend(
  288. (unsigned long long)le64_to_cpu(group->bg_blkno), new_clusters);
  289. handle = ocfs2_start_trans(osb, OCFS2_GROUP_EXTEND_CREDITS);
  290. if (IS_ERR(handle)) {
  291. mlog_errno(PTR_ERR(handle));
  292. ret = -EINVAL;
  293. goto out_unlock;
  294. }
  295. /* update the last group descriptor and inode. */
  296. ret = ocfs2_update_last_group_and_inode(handle, main_bm_inode,
  297. main_bm_bh, group_bh,
  298. first_new_cluster,
  299. new_clusters);
  300. if (ret) {
  301. mlog_errno(ret);
  302. goto out_commit;
  303. }
  304. ocfs2_update_super_and_backups(main_bm_inode, new_clusters);
  305. out_commit:
  306. ocfs2_commit_trans(osb, handle);
  307. out_unlock:
  308. brelse(group_bh);
  309. brelse(main_bm_bh);
  310. ocfs2_inode_unlock(main_bm_inode, 1);
  311. out_mutex:
  312. inode_unlock(main_bm_inode);
  313. iput(main_bm_inode);
  314. out:
  315. return ret;
  316. }
  317. static int ocfs2_check_new_group(struct inode *inode,
  318. struct ocfs2_dinode *di,
  319. struct ocfs2_new_group_input *input,
  320. struct buffer_head *group_bh)
  321. {
  322. int ret;
  323. struct ocfs2_group_desc *gd =
  324. (struct ocfs2_group_desc *)group_bh->b_data;
  325. u16 cl_bpc = le16_to_cpu(di->id2.i_chain.cl_bpc);
  326. ret = ocfs2_check_group_descriptor(inode->i_sb, di, group_bh);
  327. if (ret)
  328. goto out;
  329. ret = -EINVAL;
  330. if (le16_to_cpu(gd->bg_chain) != input->chain)
  331. mlog(ML_ERROR, "Group descriptor # %llu has bad chain %u "
  332. "while input has %u set.\n",
  333. (unsigned long long)le64_to_cpu(gd->bg_blkno),
  334. le16_to_cpu(gd->bg_chain), input->chain);
  335. else if (le16_to_cpu(gd->bg_bits) != input->clusters * cl_bpc)
  336. mlog(ML_ERROR, "Group descriptor # %llu has bit count %u but "
  337. "input has %u clusters set\n",
  338. (unsigned long long)le64_to_cpu(gd->bg_blkno),
  339. le16_to_cpu(gd->bg_bits), input->clusters);
  340. else if (le16_to_cpu(gd->bg_free_bits_count) != input->frees * cl_bpc)
  341. mlog(ML_ERROR, "Group descriptor # %llu has free bit count %u "
  342. "but it should have %u set\n",
  343. (unsigned long long)le64_to_cpu(gd->bg_blkno),
  344. le16_to_cpu(gd->bg_bits),
  345. input->frees * cl_bpc);
  346. else
  347. ret = 0;
  348. out:
  349. return ret;
  350. }
  351. static int ocfs2_verify_group_and_input(struct inode *inode,
  352. struct ocfs2_dinode *di,
  353. struct ocfs2_new_group_input *input,
  354. struct buffer_head *group_bh)
  355. {
  356. u16 cl_count = le16_to_cpu(di->id2.i_chain.cl_count);
  357. u16 cl_cpg = le16_to_cpu(di->id2.i_chain.cl_cpg);
  358. u16 next_free = le16_to_cpu(di->id2.i_chain.cl_next_free_rec);
  359. u32 cluster = ocfs2_blocks_to_clusters(inode->i_sb, input->group);
  360. u32 total_clusters = le32_to_cpu(di->i_clusters);
  361. int ret = -EINVAL;
  362. if (cluster < total_clusters)
  363. mlog(ML_ERROR, "add a group which is in the current volume.\n");
  364. else if (input->chain >= cl_count)
  365. mlog(ML_ERROR, "input chain exceeds the limit.\n");
  366. else if (next_free != cl_count && next_free != input->chain)
  367. mlog(ML_ERROR,
  368. "the add group should be in chain %u\n", next_free);
  369. else if (total_clusters + input->clusters < total_clusters)
  370. mlog(ML_ERROR, "add group's clusters overflow.\n");
  371. else if (input->clusters > cl_cpg)
  372. mlog(ML_ERROR, "the cluster exceeds the maximum of a group\n");
  373. else if (input->frees > input->clusters)
  374. mlog(ML_ERROR, "the free cluster exceeds the total clusters\n");
  375. else if (total_clusters % cl_cpg != 0)
  376. mlog(ML_ERROR,
  377. "the last group isn't full. Use group extend first.\n");
  378. else if (input->group != ocfs2_which_cluster_group(inode, cluster))
  379. mlog(ML_ERROR, "group blkno is invalid\n");
  380. else if ((ret = ocfs2_check_new_group(inode, di, input, group_bh)))
  381. mlog(ML_ERROR, "group descriptor check failed.\n");
  382. else
  383. ret = 0;
  384. return ret;
  385. }
  386. /* Add a new group descriptor to global_bitmap. */
  387. int ocfs2_group_add(struct inode *inode, struct ocfs2_new_group_input *input)
  388. {
  389. int ret;
  390. handle_t *handle;
  391. struct buffer_head *main_bm_bh = NULL;
  392. struct inode *main_bm_inode = NULL;
  393. struct ocfs2_dinode *fe = NULL;
  394. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  395. struct buffer_head *group_bh = NULL;
  396. struct ocfs2_group_desc *group = NULL;
  397. struct ocfs2_chain_list *cl;
  398. struct ocfs2_chain_rec *cr;
  399. u16 cl_bpc;
  400. u64 bg_ptr;
  401. if (ocfs2_is_hard_readonly(osb) || ocfs2_is_soft_readonly(osb))
  402. return -EROFS;
  403. main_bm_inode = ocfs2_get_system_file_inode(osb,
  404. GLOBAL_BITMAP_SYSTEM_INODE,
  405. OCFS2_INVALID_SLOT);
  406. if (!main_bm_inode) {
  407. ret = -EINVAL;
  408. mlog_errno(ret);
  409. goto out;
  410. }
  411. inode_lock(main_bm_inode);
  412. ret = ocfs2_inode_lock(main_bm_inode, &main_bm_bh, 1);
  413. if (ret < 0) {
  414. mlog_errno(ret);
  415. goto out_mutex;
  416. }
  417. fe = (struct ocfs2_dinode *)main_bm_bh->b_data;
  418. if (le16_to_cpu(fe->id2.i_chain.cl_cpg) !=
  419. ocfs2_group_bitmap_size(osb->sb, 0,
  420. osb->s_feature_incompat) * 8) {
  421. mlog(ML_ERROR, "The disk is too old and small."
  422. " Force to do offline resize.");
  423. ret = -EINVAL;
  424. goto out_unlock;
  425. }
  426. ret = ocfs2_read_blocks_sync(osb, input->group, 1, &group_bh);
  427. if (ret < 0) {
  428. mlog(ML_ERROR, "Can't read the group descriptor # %llu "
  429. "from the device.", (unsigned long long)input->group);
  430. goto out_unlock;
  431. }
  432. ocfs2_set_new_buffer_uptodate(INODE_CACHE(inode), group_bh);
  433. ret = ocfs2_verify_group_and_input(main_bm_inode, fe, input, group_bh);
  434. if (ret) {
  435. mlog_errno(ret);
  436. goto out_free_group_bh;
  437. }
  438. trace_ocfs2_group_add((unsigned long long)input->group,
  439. input->chain, input->clusters, input->frees);
  440. handle = ocfs2_start_trans(osb, OCFS2_GROUP_ADD_CREDITS);
  441. if (IS_ERR(handle)) {
  442. mlog_errno(PTR_ERR(handle));
  443. ret = -EINVAL;
  444. goto out_free_group_bh;
  445. }
  446. cl_bpc = le16_to_cpu(fe->id2.i_chain.cl_bpc);
  447. cl = &fe->id2.i_chain;
  448. cr = &cl->cl_recs[input->chain];
  449. ret = ocfs2_journal_access_gd(handle, INODE_CACHE(main_bm_inode),
  450. group_bh, OCFS2_JOURNAL_ACCESS_WRITE);
  451. if (ret < 0) {
  452. mlog_errno(ret);
  453. goto out_commit;
  454. }
  455. group = (struct ocfs2_group_desc *)group_bh->b_data;
  456. bg_ptr = le64_to_cpu(group->bg_next_group);
  457. group->bg_next_group = cr->c_blkno;
  458. ocfs2_journal_dirty(handle, group_bh);
  459. ret = ocfs2_journal_access_di(handle, INODE_CACHE(main_bm_inode),
  460. main_bm_bh, OCFS2_JOURNAL_ACCESS_WRITE);
  461. if (ret < 0) {
  462. group->bg_next_group = cpu_to_le64(bg_ptr);
  463. mlog_errno(ret);
  464. goto out_commit;
  465. }
  466. if (input->chain == le16_to_cpu(cl->cl_next_free_rec)) {
  467. le16_add_cpu(&cl->cl_next_free_rec, 1);
  468. memset(cr, 0, sizeof(struct ocfs2_chain_rec));
  469. }
  470. cr->c_blkno = cpu_to_le64(input->group);
  471. le32_add_cpu(&cr->c_total, input->clusters * cl_bpc);
  472. le32_add_cpu(&cr->c_free, input->frees * cl_bpc);
  473. le32_add_cpu(&fe->id1.bitmap1.i_total, input->clusters *cl_bpc);
  474. le32_add_cpu(&fe->id1.bitmap1.i_used,
  475. (input->clusters - input->frees) * cl_bpc);
  476. le32_add_cpu(&fe->i_clusters, input->clusters);
  477. ocfs2_journal_dirty(handle, main_bm_bh);
  478. spin_lock(&OCFS2_I(main_bm_inode)->ip_lock);
  479. OCFS2_I(main_bm_inode)->ip_clusters = le32_to_cpu(fe->i_clusters);
  480. le64_add_cpu(&fe->i_size, (u64)input->clusters << osb->s_clustersize_bits);
  481. spin_unlock(&OCFS2_I(main_bm_inode)->ip_lock);
  482. i_size_write(main_bm_inode, le64_to_cpu(fe->i_size));
  483. ocfs2_update_super_and_backups(main_bm_inode, input->clusters);
  484. out_commit:
  485. ocfs2_commit_trans(osb, handle);
  486. out_free_group_bh:
  487. if (ret < 0)
  488. ocfs2_remove_from_cache(INODE_CACHE(inode), group_bh);
  489. brelse(group_bh);
  490. out_unlock:
  491. brelse(main_bm_bh);
  492. ocfs2_inode_unlock(main_bm_inode, 1);
  493. out_mutex:
  494. inode_unlock(main_bm_inode);
  495. iput(main_bm_inode);
  496. out:
  497. return ret;
  498. }