resize.c 16 KB

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