resize.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590
  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. #include <cluster/masklog.h>
  29. #include "ocfs2.h"
  30. #include "alloc.h"
  31. #include "dlmglue.h"
  32. #include "inode.h"
  33. #include "journal.h"
  34. #include "super.h"
  35. #include "sysfile.h"
  36. #include "uptodate.h"
  37. #include "ocfs2_trace.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. return backups;
  76. }
  77. static int ocfs2_update_last_group_and_inode(handle_t *handle,
  78. struct inode *bm_inode,
  79. struct buffer_head *bm_bh,
  80. struct buffer_head *group_bh,
  81. u32 first_new_cluster,
  82. int new_clusters)
  83. {
  84. int ret = 0;
  85. struct ocfs2_super *osb = OCFS2_SB(bm_inode->i_sb);
  86. struct ocfs2_dinode *fe = (struct ocfs2_dinode *) bm_bh->b_data;
  87. struct ocfs2_chain_list *cl = &fe->id2.i_chain;
  88. struct ocfs2_chain_rec *cr;
  89. struct ocfs2_group_desc *group;
  90. u16 chain, num_bits, backups = 0;
  91. u16 cl_bpc = le16_to_cpu(cl->cl_bpc);
  92. u16 cl_cpg = le16_to_cpu(cl->cl_cpg);
  93. trace_ocfs2_update_last_group_and_inode(new_clusters,
  94. first_new_cluster);
  95. ret = ocfs2_journal_access_gd(handle, INODE_CACHE(bm_inode),
  96. group_bh, OCFS2_JOURNAL_ACCESS_WRITE);
  97. if (ret < 0) {
  98. mlog_errno(ret);
  99. goto out;
  100. }
  101. group = (struct ocfs2_group_desc *)group_bh->b_data;
  102. /* update the group first. */
  103. num_bits = new_clusters * cl_bpc;
  104. le16_add_cpu(&group->bg_bits, num_bits);
  105. le16_add_cpu(&group->bg_free_bits_count, num_bits);
  106. /*
  107. * check whether there are some new backup superblocks exist in
  108. * this group and update the group bitmap accordingly.
  109. */
  110. if (OCFS2_HAS_COMPAT_FEATURE(osb->sb,
  111. OCFS2_FEATURE_COMPAT_BACKUP_SB)) {
  112. backups = ocfs2_calc_new_backup_super(bm_inode,
  113. group,
  114. new_clusters,
  115. first_new_cluster,
  116. cl_cpg, 1);
  117. le16_add_cpu(&group->bg_free_bits_count, -1 * backups);
  118. }
  119. ocfs2_journal_dirty(handle, group_bh);
  120. /* update the inode accordingly. */
  121. ret = ocfs2_journal_access_di(handle, INODE_CACHE(bm_inode), bm_bh,
  122. OCFS2_JOURNAL_ACCESS_WRITE);
  123. if (ret < 0) {
  124. mlog_errno(ret);
  125. goto out_rollback;
  126. }
  127. chain = le16_to_cpu(group->bg_chain);
  128. cr = (&cl->cl_recs[chain]);
  129. le32_add_cpu(&cr->c_total, num_bits);
  130. le32_add_cpu(&cr->c_free, num_bits);
  131. le32_add_cpu(&fe->id1.bitmap1.i_total, num_bits);
  132. le32_add_cpu(&fe->i_clusters, new_clusters);
  133. if (backups) {
  134. le32_add_cpu(&cr->c_free, -1 * backups);
  135. le32_add_cpu(&fe->id1.bitmap1.i_used, backups);
  136. }
  137. spin_lock(&OCFS2_I(bm_inode)->ip_lock);
  138. OCFS2_I(bm_inode)->ip_clusters = le32_to_cpu(fe->i_clusters);
  139. le64_add_cpu(&fe->i_size, new_clusters << osb->s_clustersize_bits);
  140. spin_unlock(&OCFS2_I(bm_inode)->ip_lock);
  141. i_size_write(bm_inode, le64_to_cpu(fe->i_size));
  142. ocfs2_journal_dirty(handle, bm_bh);
  143. out_rollback:
  144. if (ret < 0) {
  145. ocfs2_calc_new_backup_super(bm_inode,
  146. group,
  147. new_clusters,
  148. first_new_cluster,
  149. cl_cpg, 0);
  150. le16_add_cpu(&group->bg_free_bits_count, backups);
  151. le16_add_cpu(&group->bg_bits, -1 * num_bits);
  152. le16_add_cpu(&group->bg_free_bits_count, -1 * num_bits);
  153. }
  154. out:
  155. if (ret)
  156. mlog_errno(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. if (ocfs2_is_hard_readonly(osb) || ocfs2_is_soft_readonly(osb))
  247. return -EROFS;
  248. if (new_clusters < 0)
  249. return -EINVAL;
  250. else if (new_clusters == 0)
  251. return 0;
  252. main_bm_inode = ocfs2_get_system_file_inode(osb,
  253. GLOBAL_BITMAP_SYSTEM_INODE,
  254. OCFS2_INVALID_SLOT);
  255. if (!main_bm_inode) {
  256. ret = -EINVAL;
  257. mlog_errno(ret);
  258. goto out;
  259. }
  260. mutex_lock(&main_bm_inode->i_mutex);
  261. ret = ocfs2_inode_lock(main_bm_inode, &main_bm_bh, 1);
  262. if (ret < 0) {
  263. mlog_errno(ret);
  264. goto out_mutex;
  265. }
  266. fe = (struct ocfs2_dinode *)main_bm_bh->b_data;
  267. /* main_bm_bh is validated by inode read inside ocfs2_inode_lock(),
  268. * so any corruption is a code bug. */
  269. BUG_ON(!OCFS2_IS_VALID_DINODE(fe));
  270. if (le16_to_cpu(fe->id2.i_chain.cl_cpg) !=
  271. ocfs2_group_bitmap_size(osb->sb, 0,
  272. osb->s_feature_incompat) * 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. trace_ocfs2_group_extend(
  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. return ret;
  323. }
  324. static int ocfs2_check_new_group(struct inode *inode,
  325. struct ocfs2_dinode *di,
  326. struct ocfs2_new_group_input *input,
  327. struct buffer_head *group_bh)
  328. {
  329. int ret;
  330. struct ocfs2_group_desc *gd =
  331. (struct ocfs2_group_desc *)group_bh->b_data;
  332. u16 cl_bpc = le16_to_cpu(di->id2.i_chain.cl_bpc);
  333. ret = ocfs2_check_group_descriptor(inode->i_sb, di, group_bh);
  334. if (ret)
  335. goto out;
  336. ret = -EINVAL;
  337. if (le16_to_cpu(gd->bg_chain) != input->chain)
  338. mlog(ML_ERROR, "Group descriptor # %llu has bad chain %u "
  339. "while input has %u set.\n",
  340. (unsigned long long)le64_to_cpu(gd->bg_blkno),
  341. le16_to_cpu(gd->bg_chain), input->chain);
  342. else if (le16_to_cpu(gd->bg_bits) != input->clusters * cl_bpc)
  343. mlog(ML_ERROR, "Group descriptor # %llu has bit count %u but "
  344. "input has %u clusters set\n",
  345. (unsigned long long)le64_to_cpu(gd->bg_blkno),
  346. le16_to_cpu(gd->bg_bits), input->clusters);
  347. else if (le16_to_cpu(gd->bg_free_bits_count) != input->frees * cl_bpc)
  348. mlog(ML_ERROR, "Group descriptor # %llu has free bit count %u "
  349. "but it should have %u set\n",
  350. (unsigned long long)le64_to_cpu(gd->bg_blkno),
  351. le16_to_cpu(gd->bg_bits),
  352. input->frees * cl_bpc);
  353. else
  354. ret = 0;
  355. out:
  356. return ret;
  357. }
  358. static int ocfs2_verify_group_and_input(struct inode *inode,
  359. struct ocfs2_dinode *di,
  360. struct ocfs2_new_group_input *input,
  361. struct buffer_head *group_bh)
  362. {
  363. u16 cl_count = le16_to_cpu(di->id2.i_chain.cl_count);
  364. u16 cl_cpg = le16_to_cpu(di->id2.i_chain.cl_cpg);
  365. u16 next_free = le16_to_cpu(di->id2.i_chain.cl_next_free_rec);
  366. u32 cluster = ocfs2_blocks_to_clusters(inode->i_sb, input->group);
  367. u32 total_clusters = le32_to_cpu(di->i_clusters);
  368. int ret = -EINVAL;
  369. if (cluster < total_clusters)
  370. mlog(ML_ERROR, "add a group which is in the current volume.\n");
  371. else if (input->chain >= cl_count)
  372. mlog(ML_ERROR, "input chain exceeds the limit.\n");
  373. else if (next_free != cl_count && next_free != input->chain)
  374. mlog(ML_ERROR,
  375. "the add group should be in chain %u\n", next_free);
  376. else if (total_clusters + input->clusters < total_clusters)
  377. mlog(ML_ERROR, "add group's clusters overflow.\n");
  378. else if (input->clusters > cl_cpg)
  379. mlog(ML_ERROR, "the cluster exceeds the maximum of a group\n");
  380. else if (input->frees > input->clusters)
  381. mlog(ML_ERROR, "the free cluster exceeds the total clusters\n");
  382. else if (total_clusters % cl_cpg != 0)
  383. mlog(ML_ERROR,
  384. "the last group isn't full. Use group extend first.\n");
  385. else if (input->group != ocfs2_which_cluster_group(inode, cluster))
  386. mlog(ML_ERROR, "group blkno is invalid\n");
  387. else if ((ret = ocfs2_check_new_group(inode, di, input, group_bh)))
  388. mlog(ML_ERROR, "group descriptor check failed.\n");
  389. else
  390. ret = 0;
  391. return ret;
  392. }
  393. /* Add a new group descriptor to global_bitmap. */
  394. int ocfs2_group_add(struct inode *inode, struct ocfs2_new_group_input *input)
  395. {
  396. int ret;
  397. handle_t *handle;
  398. struct buffer_head *main_bm_bh = NULL;
  399. struct inode *main_bm_inode = NULL;
  400. struct ocfs2_dinode *fe = NULL;
  401. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  402. struct buffer_head *group_bh = NULL;
  403. struct ocfs2_group_desc *group = NULL;
  404. struct ocfs2_chain_list *cl;
  405. struct ocfs2_chain_rec *cr;
  406. u16 cl_bpc;
  407. if (ocfs2_is_hard_readonly(osb) || ocfs2_is_soft_readonly(osb))
  408. return -EROFS;
  409. main_bm_inode = ocfs2_get_system_file_inode(osb,
  410. GLOBAL_BITMAP_SYSTEM_INODE,
  411. OCFS2_INVALID_SLOT);
  412. if (!main_bm_inode) {
  413. ret = -EINVAL;
  414. mlog_errno(ret);
  415. goto out;
  416. }
  417. mutex_lock(&main_bm_inode->i_mutex);
  418. ret = ocfs2_inode_lock(main_bm_inode, &main_bm_bh, 1);
  419. if (ret < 0) {
  420. mlog_errno(ret);
  421. goto out_mutex;
  422. }
  423. fe = (struct ocfs2_dinode *)main_bm_bh->b_data;
  424. if (le16_to_cpu(fe->id2.i_chain.cl_cpg) !=
  425. ocfs2_group_bitmap_size(osb->sb, 0,
  426. osb->s_feature_incompat) * 8) {
  427. mlog(ML_ERROR, "The disk is too old and small."
  428. " Force to do offline resize.");
  429. ret = -EINVAL;
  430. goto out_unlock;
  431. }
  432. ret = ocfs2_read_blocks_sync(osb, input->group, 1, &group_bh);
  433. if (ret < 0) {
  434. mlog(ML_ERROR, "Can't read the group descriptor # %llu "
  435. "from the device.", (unsigned long long)input->group);
  436. goto out_unlock;
  437. }
  438. ocfs2_set_new_buffer_uptodate(INODE_CACHE(inode), group_bh);
  439. ret = ocfs2_verify_group_and_input(main_bm_inode, fe, input, group_bh);
  440. if (ret) {
  441. mlog_errno(ret);
  442. goto out_unlock;
  443. }
  444. trace_ocfs2_group_add((unsigned long long)input->group,
  445. input->chain, input->clusters, input->frees);
  446. handle = ocfs2_start_trans(osb, OCFS2_GROUP_ADD_CREDITS);
  447. if (IS_ERR(handle)) {
  448. mlog_errno(PTR_ERR(handle));
  449. ret = -EINVAL;
  450. goto out_unlock;
  451. }
  452. cl_bpc = le16_to_cpu(fe->id2.i_chain.cl_bpc);
  453. cl = &fe->id2.i_chain;
  454. cr = &cl->cl_recs[input->chain];
  455. ret = ocfs2_journal_access_gd(handle, INODE_CACHE(main_bm_inode),
  456. group_bh, OCFS2_JOURNAL_ACCESS_WRITE);
  457. if (ret < 0) {
  458. mlog_errno(ret);
  459. goto out_commit;
  460. }
  461. group = (struct ocfs2_group_desc *)group_bh->b_data;
  462. group->bg_next_group = cr->c_blkno;
  463. ocfs2_journal_dirty(handle, group_bh);
  464. ret = ocfs2_journal_access_di(handle, INODE_CACHE(main_bm_inode),
  465. main_bm_bh, OCFS2_JOURNAL_ACCESS_WRITE);
  466. if (ret < 0) {
  467. mlog_errno(ret);
  468. goto out_commit;
  469. }
  470. if (input->chain == le16_to_cpu(cl->cl_next_free_rec)) {
  471. le16_add_cpu(&cl->cl_next_free_rec, 1);
  472. memset(cr, 0, sizeof(struct ocfs2_chain_rec));
  473. }
  474. cr->c_blkno = cpu_to_le64(input->group);
  475. le32_add_cpu(&cr->c_total, input->clusters * cl_bpc);
  476. le32_add_cpu(&cr->c_free, input->frees * cl_bpc);
  477. le32_add_cpu(&fe->id1.bitmap1.i_total, input->clusters *cl_bpc);
  478. le32_add_cpu(&fe->id1.bitmap1.i_used,
  479. (input->clusters - input->frees) * cl_bpc);
  480. le32_add_cpu(&fe->i_clusters, input->clusters);
  481. ocfs2_journal_dirty(handle, main_bm_bh);
  482. spin_lock(&OCFS2_I(main_bm_inode)->ip_lock);
  483. OCFS2_I(main_bm_inode)->ip_clusters = le32_to_cpu(fe->i_clusters);
  484. le64_add_cpu(&fe->i_size, input->clusters << osb->s_clustersize_bits);
  485. spin_unlock(&OCFS2_I(main_bm_inode)->ip_lock);
  486. i_size_write(main_bm_inode, le64_to_cpu(fe->i_size));
  487. ocfs2_update_super_and_backups(main_bm_inode, input->clusters);
  488. out_commit:
  489. ocfs2_commit_trans(osb, handle);
  490. out_unlock:
  491. brelse(group_bh);
  492. brelse(main_bm_bh);
  493. ocfs2_inode_unlock(main_bm_inode, 1);
  494. out_mutex:
  495. mutex_unlock(&main_bm_inode->i_mutex);
  496. iput(main_bm_inode);
  497. out:
  498. return ret;
  499. }