resize.c 16 KB

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