localalloc.c 34 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344
  1. /* -*- mode: c; c-basic-offset: 8; -*-
  2. * vim: noexpandtab sw=8 ts=8 sts=0:
  3. *
  4. * localalloc.c
  5. *
  6. * Node local data allocation
  7. *
  8. * Copyright (C) 2002, 2004 Oracle. All rights reserved.
  9. *
  10. * This program is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU General Public
  12. * License as published by the Free Software Foundation; either
  13. * version 2 of the License, or (at your option) any later version.
  14. *
  15. * This program is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  18. * General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU General Public
  21. * License along with this program; if not, write to the
  22. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  23. * Boston, MA 021110-1307, USA.
  24. */
  25. #include <linux/fs.h>
  26. #include <linux/types.h>
  27. #include <linux/slab.h>
  28. #include <linux/highmem.h>
  29. #include <linux/bitops.h>
  30. #include <cluster/masklog.h>
  31. #include "ocfs2.h"
  32. #include "alloc.h"
  33. #include "blockcheck.h"
  34. #include "dlmglue.h"
  35. #include "inode.h"
  36. #include "journal.h"
  37. #include "localalloc.h"
  38. #include "suballoc.h"
  39. #include "super.h"
  40. #include "sysfile.h"
  41. #include "ocfs2_trace.h"
  42. #include "buffer_head_io.h"
  43. #define OCFS2_LOCAL_ALLOC(dinode) (&((dinode)->id2.i_lab))
  44. static u32 ocfs2_local_alloc_count_bits(struct ocfs2_dinode *alloc);
  45. static int ocfs2_local_alloc_find_clear_bits(struct ocfs2_super *osb,
  46. struct ocfs2_dinode *alloc,
  47. u32 *numbits,
  48. struct ocfs2_alloc_reservation *resv);
  49. static void ocfs2_clear_local_alloc(struct ocfs2_dinode *alloc);
  50. static int ocfs2_sync_local_to_main(struct ocfs2_super *osb,
  51. handle_t *handle,
  52. struct ocfs2_dinode *alloc,
  53. struct inode *main_bm_inode,
  54. struct buffer_head *main_bm_bh);
  55. static int ocfs2_local_alloc_reserve_for_window(struct ocfs2_super *osb,
  56. struct ocfs2_alloc_context **ac,
  57. struct inode **bitmap_inode,
  58. struct buffer_head **bitmap_bh);
  59. static int ocfs2_local_alloc_new_window(struct ocfs2_super *osb,
  60. handle_t *handle,
  61. struct ocfs2_alloc_context *ac);
  62. static int ocfs2_local_alloc_slide_window(struct ocfs2_super *osb,
  63. struct inode *local_alloc_inode);
  64. /*
  65. * ocfs2_la_default_mb() - determine a default size, in megabytes of
  66. * the local alloc.
  67. *
  68. * Generally, we'd like to pick as large a local alloc as
  69. * possible. Performance on large workloads tends to scale
  70. * proportionally to la size. In addition to that, the reservations
  71. * code functions more efficiently as it can reserve more windows for
  72. * write.
  73. *
  74. * Some things work against us when trying to choose a large local alloc:
  75. *
  76. * - We need to ensure our sizing is picked to leave enough space in
  77. * group descriptors for other allocations (such as block groups,
  78. * etc). Picking default sizes which are a multiple of 4 could help
  79. * - block groups are allocated in 2mb and 4mb chunks.
  80. *
  81. * - Likewise, we don't want to starve other nodes of bits on small
  82. * file systems. This can easily be taken care of by limiting our
  83. * default to a reasonable size (256M) on larger cluster sizes.
  84. *
  85. * - Some file systems can't support very large sizes - 4k and 8k in
  86. * particular are limited to less than 128 and 256 megabytes respectively.
  87. *
  88. * The following reference table shows group descriptor and local
  89. * alloc maximums at various cluster sizes (4k blocksize)
  90. *
  91. * csize: 4K group: 126M la: 121M
  92. * csize: 8K group: 252M la: 243M
  93. * csize: 16K group: 504M la: 486M
  94. * csize: 32K group: 1008M la: 972M
  95. * csize: 64K group: 2016M la: 1944M
  96. * csize: 128K group: 4032M la: 3888M
  97. * csize: 256K group: 8064M la: 7776M
  98. * csize: 512K group: 16128M la: 15552M
  99. * csize: 1024K group: 32256M la: 31104M
  100. */
  101. #define OCFS2_LA_MAX_DEFAULT_MB 256
  102. #define OCFS2_LA_OLD_DEFAULT 8
  103. unsigned int ocfs2_la_default_mb(struct ocfs2_super *osb)
  104. {
  105. unsigned int la_mb;
  106. unsigned int gd_mb;
  107. unsigned int la_max_mb;
  108. unsigned int megs_per_slot;
  109. struct super_block *sb = osb->sb;
  110. gd_mb = ocfs2_clusters_to_megabytes(osb->sb,
  111. 8 * ocfs2_group_bitmap_size(sb, 0, osb->s_feature_incompat));
  112. /*
  113. * This takes care of files systems with very small group
  114. * descriptors - 512 byte blocksize at cluster sizes lower
  115. * than 16K and also 1k blocksize with 4k cluster size.
  116. */
  117. if ((sb->s_blocksize == 512 && osb->s_clustersize <= 8192)
  118. || (sb->s_blocksize == 1024 && osb->s_clustersize == 4096))
  119. return OCFS2_LA_OLD_DEFAULT;
  120. /*
  121. * Leave enough room for some block groups and make the final
  122. * value we work from a multiple of 4.
  123. */
  124. gd_mb -= 16;
  125. gd_mb &= 0xFFFFFFFB;
  126. la_mb = gd_mb;
  127. /*
  128. * Keep window sizes down to a reasonable default
  129. */
  130. if (la_mb > OCFS2_LA_MAX_DEFAULT_MB) {
  131. /*
  132. * Some clustersize / blocksize combinations will have
  133. * given us a larger than OCFS2_LA_MAX_DEFAULT_MB
  134. * default size, but get poor distribution when
  135. * limited to exactly 256 megabytes.
  136. *
  137. * As an example, 16K clustersize at 4K blocksize
  138. * gives us a cluster group size of 504M. Paring the
  139. * local alloc size down to 256 however, would give us
  140. * only one window and around 200MB left in the
  141. * cluster group. Instead, find the first size below
  142. * 256 which would give us an even distribution.
  143. *
  144. * Larger cluster group sizes actually work out pretty
  145. * well when pared to 256, so we don't have to do this
  146. * for any group that fits more than two
  147. * OCFS2_LA_MAX_DEFAULT_MB windows.
  148. */
  149. if (gd_mb > (2 * OCFS2_LA_MAX_DEFAULT_MB))
  150. la_mb = 256;
  151. else {
  152. unsigned int gd_mult = gd_mb;
  153. while (gd_mult > 256)
  154. gd_mult = gd_mult >> 1;
  155. la_mb = gd_mult;
  156. }
  157. }
  158. megs_per_slot = osb->osb_clusters_at_boot / osb->max_slots;
  159. megs_per_slot = ocfs2_clusters_to_megabytes(osb->sb, megs_per_slot);
  160. /* Too many nodes, too few disk clusters. */
  161. if (megs_per_slot < la_mb)
  162. la_mb = megs_per_slot;
  163. /* We can't store more bits than we can in a block. */
  164. la_max_mb = ocfs2_clusters_to_megabytes(osb->sb,
  165. ocfs2_local_alloc_size(sb) * 8);
  166. if (la_mb > la_max_mb)
  167. la_mb = la_max_mb;
  168. return la_mb;
  169. }
  170. void ocfs2_la_set_sizes(struct ocfs2_super *osb, int requested_mb)
  171. {
  172. struct super_block *sb = osb->sb;
  173. unsigned int la_default_mb = ocfs2_la_default_mb(osb);
  174. unsigned int la_max_mb;
  175. la_max_mb = ocfs2_clusters_to_megabytes(sb,
  176. ocfs2_local_alloc_size(sb) * 8);
  177. trace_ocfs2_la_set_sizes(requested_mb, la_max_mb, la_default_mb);
  178. if (requested_mb == -1) {
  179. /* No user request - use defaults */
  180. osb->local_alloc_default_bits =
  181. ocfs2_megabytes_to_clusters(sb, la_default_mb);
  182. } else if (requested_mb > la_max_mb) {
  183. /* Request is too big, we give the maximum available */
  184. osb->local_alloc_default_bits =
  185. ocfs2_megabytes_to_clusters(sb, la_max_mb);
  186. } else {
  187. osb->local_alloc_default_bits =
  188. ocfs2_megabytes_to_clusters(sb, requested_mb);
  189. }
  190. osb->local_alloc_bits = osb->local_alloc_default_bits;
  191. }
  192. static inline int ocfs2_la_state_enabled(struct ocfs2_super *osb)
  193. {
  194. return (osb->local_alloc_state == OCFS2_LA_THROTTLED ||
  195. osb->local_alloc_state == OCFS2_LA_ENABLED);
  196. }
  197. void ocfs2_local_alloc_seen_free_bits(struct ocfs2_super *osb,
  198. unsigned int num_clusters)
  199. {
  200. spin_lock(&osb->osb_lock);
  201. if (osb->local_alloc_state == OCFS2_LA_DISABLED ||
  202. osb->local_alloc_state == OCFS2_LA_THROTTLED)
  203. if (num_clusters >= osb->local_alloc_default_bits) {
  204. cancel_delayed_work(&osb->la_enable_wq);
  205. osb->local_alloc_state = OCFS2_LA_ENABLED;
  206. }
  207. spin_unlock(&osb->osb_lock);
  208. }
  209. void ocfs2_la_enable_worker(struct work_struct *work)
  210. {
  211. struct ocfs2_super *osb =
  212. container_of(work, struct ocfs2_super,
  213. la_enable_wq.work);
  214. spin_lock(&osb->osb_lock);
  215. osb->local_alloc_state = OCFS2_LA_ENABLED;
  216. spin_unlock(&osb->osb_lock);
  217. }
  218. /*
  219. * Tell us whether a given allocation should use the local alloc
  220. * file. Otherwise, it has to go to the main bitmap.
  221. *
  222. * This function does semi-dirty reads of local alloc size and state!
  223. * This is ok however, as the values are re-checked once under mutex.
  224. */
  225. int ocfs2_alloc_should_use_local(struct ocfs2_super *osb, u64 bits)
  226. {
  227. int ret = 0;
  228. int la_bits;
  229. spin_lock(&osb->osb_lock);
  230. la_bits = osb->local_alloc_bits;
  231. if (!ocfs2_la_state_enabled(osb))
  232. goto bail;
  233. /* la_bits should be at least twice the size (in clusters) of
  234. * a new block group. We want to be sure block group
  235. * allocations go through the local alloc, so allow an
  236. * allocation to take up to half the bitmap. */
  237. if (bits > (la_bits / 2))
  238. goto bail;
  239. ret = 1;
  240. bail:
  241. trace_ocfs2_alloc_should_use_local(
  242. (unsigned long long)bits, osb->local_alloc_state, la_bits, ret);
  243. spin_unlock(&osb->osb_lock);
  244. return ret;
  245. }
  246. int ocfs2_load_local_alloc(struct ocfs2_super *osb)
  247. {
  248. int status = 0;
  249. struct ocfs2_dinode *alloc = NULL;
  250. struct buffer_head *alloc_bh = NULL;
  251. u32 num_used;
  252. struct inode *inode = NULL;
  253. struct ocfs2_local_alloc *la;
  254. if (osb->local_alloc_bits == 0)
  255. goto bail;
  256. if (osb->local_alloc_bits >= osb->bitmap_cpg) {
  257. mlog(ML_NOTICE, "Requested local alloc window %d is larger "
  258. "than max possible %u. Using defaults.\n",
  259. osb->local_alloc_bits, (osb->bitmap_cpg - 1));
  260. osb->local_alloc_bits =
  261. ocfs2_megabytes_to_clusters(osb->sb,
  262. ocfs2_la_default_mb(osb));
  263. }
  264. /* read the alloc off disk */
  265. inode = ocfs2_get_system_file_inode(osb, LOCAL_ALLOC_SYSTEM_INODE,
  266. osb->slot_num);
  267. if (!inode) {
  268. status = -EINVAL;
  269. mlog_errno(status);
  270. goto bail;
  271. }
  272. status = ocfs2_read_inode_block_full(inode, &alloc_bh,
  273. OCFS2_BH_IGNORE_CACHE);
  274. if (status < 0) {
  275. mlog_errno(status);
  276. goto bail;
  277. }
  278. alloc = (struct ocfs2_dinode *) alloc_bh->b_data;
  279. la = OCFS2_LOCAL_ALLOC(alloc);
  280. if (!(le32_to_cpu(alloc->i_flags) &
  281. (OCFS2_LOCAL_ALLOC_FL|OCFS2_BITMAP_FL))) {
  282. mlog(ML_ERROR, "Invalid local alloc inode, %llu\n",
  283. (unsigned long long)OCFS2_I(inode)->ip_blkno);
  284. status = -EINVAL;
  285. goto bail;
  286. }
  287. if ((la->la_size == 0) ||
  288. (le16_to_cpu(la->la_size) > ocfs2_local_alloc_size(inode->i_sb))) {
  289. mlog(ML_ERROR, "Local alloc size is invalid (la_size = %u)\n",
  290. le16_to_cpu(la->la_size));
  291. status = -EINVAL;
  292. goto bail;
  293. }
  294. /* do a little verification. */
  295. num_used = ocfs2_local_alloc_count_bits(alloc);
  296. /* hopefully the local alloc has always been recovered before
  297. * we load it. */
  298. if (num_used
  299. || alloc->id1.bitmap1.i_used
  300. || alloc->id1.bitmap1.i_total
  301. || la->la_bm_off) {
  302. mlog(ML_ERROR, "inconsistent detected, clean journal with"
  303. " unrecovered local alloc, please run fsck.ocfs2!\n"
  304. "found = %u, set = %u, taken = %u, off = %u\n",
  305. num_used, le32_to_cpu(alloc->id1.bitmap1.i_used),
  306. le32_to_cpu(alloc->id1.bitmap1.i_total),
  307. OCFS2_LOCAL_ALLOC(alloc)->la_bm_off);
  308. status = -EINVAL;
  309. goto bail;
  310. }
  311. osb->local_alloc_bh = alloc_bh;
  312. osb->local_alloc_state = OCFS2_LA_ENABLED;
  313. bail:
  314. if (status < 0)
  315. brelse(alloc_bh);
  316. iput(inode);
  317. trace_ocfs2_load_local_alloc(osb->local_alloc_bits);
  318. if (status)
  319. mlog_errno(status);
  320. return status;
  321. }
  322. /*
  323. * return any unused bits to the bitmap and write out a clean
  324. * local_alloc.
  325. *
  326. * local_alloc_bh is optional. If not passed, we will simply use the
  327. * one off osb. If you do pass it however, be warned that it *will* be
  328. * returned brelse'd and NULL'd out.*/
  329. void ocfs2_shutdown_local_alloc(struct ocfs2_super *osb)
  330. {
  331. int status;
  332. handle_t *handle;
  333. struct inode *local_alloc_inode = NULL;
  334. struct buffer_head *bh = NULL;
  335. struct buffer_head *main_bm_bh = NULL;
  336. struct inode *main_bm_inode = NULL;
  337. struct ocfs2_dinode *alloc_copy = NULL;
  338. struct ocfs2_dinode *alloc = NULL;
  339. cancel_delayed_work(&osb->la_enable_wq);
  340. flush_workqueue(osb->ocfs2_wq);
  341. if (osb->local_alloc_state == OCFS2_LA_UNUSED)
  342. goto out;
  343. local_alloc_inode =
  344. ocfs2_get_system_file_inode(osb,
  345. LOCAL_ALLOC_SYSTEM_INODE,
  346. osb->slot_num);
  347. if (!local_alloc_inode) {
  348. status = -ENOENT;
  349. mlog_errno(status);
  350. goto out;
  351. }
  352. osb->local_alloc_state = OCFS2_LA_DISABLED;
  353. ocfs2_resmap_uninit(&osb->osb_la_resmap);
  354. main_bm_inode = ocfs2_get_system_file_inode(osb,
  355. GLOBAL_BITMAP_SYSTEM_INODE,
  356. OCFS2_INVALID_SLOT);
  357. if (!main_bm_inode) {
  358. status = -EINVAL;
  359. mlog_errno(status);
  360. goto out;
  361. }
  362. inode_lock(main_bm_inode);
  363. status = ocfs2_inode_lock(main_bm_inode, &main_bm_bh, 1);
  364. if (status < 0) {
  365. mlog_errno(status);
  366. goto out_mutex;
  367. }
  368. /* WINDOW_MOVE_CREDITS is a bit heavy... */
  369. handle = ocfs2_start_trans(osb, OCFS2_WINDOW_MOVE_CREDITS);
  370. if (IS_ERR(handle)) {
  371. mlog_errno(PTR_ERR(handle));
  372. handle = NULL;
  373. goto out_unlock;
  374. }
  375. bh = osb->local_alloc_bh;
  376. alloc = (struct ocfs2_dinode *) bh->b_data;
  377. alloc_copy = kmalloc(bh->b_size, GFP_NOFS);
  378. if (!alloc_copy) {
  379. status = -ENOMEM;
  380. goto out_commit;
  381. }
  382. memcpy(alloc_copy, alloc, bh->b_size);
  383. status = ocfs2_journal_access_di(handle, INODE_CACHE(local_alloc_inode),
  384. bh, OCFS2_JOURNAL_ACCESS_WRITE);
  385. if (status < 0) {
  386. mlog_errno(status);
  387. goto out_commit;
  388. }
  389. ocfs2_clear_local_alloc(alloc);
  390. ocfs2_journal_dirty(handle, bh);
  391. brelse(bh);
  392. osb->local_alloc_bh = NULL;
  393. osb->local_alloc_state = OCFS2_LA_UNUSED;
  394. status = ocfs2_sync_local_to_main(osb, handle, alloc_copy,
  395. main_bm_inode, main_bm_bh);
  396. if (status < 0)
  397. mlog_errno(status);
  398. out_commit:
  399. ocfs2_commit_trans(osb, handle);
  400. out_unlock:
  401. brelse(main_bm_bh);
  402. ocfs2_inode_unlock(main_bm_inode, 1);
  403. out_mutex:
  404. inode_unlock(main_bm_inode);
  405. iput(main_bm_inode);
  406. out:
  407. iput(local_alloc_inode);
  408. kfree(alloc_copy);
  409. }
  410. /*
  411. * We want to free the bitmap bits outside of any recovery context as
  412. * we'll need a cluster lock to do so, but we must clear the local
  413. * alloc before giving up the recovered nodes journal. To solve this,
  414. * we kmalloc a copy of the local alloc before it's change for the
  415. * caller to process with ocfs2_complete_local_alloc_recovery
  416. */
  417. int ocfs2_begin_local_alloc_recovery(struct ocfs2_super *osb,
  418. int slot_num,
  419. struct ocfs2_dinode **alloc_copy)
  420. {
  421. int status = 0;
  422. struct buffer_head *alloc_bh = NULL;
  423. struct inode *inode = NULL;
  424. struct ocfs2_dinode *alloc;
  425. trace_ocfs2_begin_local_alloc_recovery(slot_num);
  426. *alloc_copy = NULL;
  427. inode = ocfs2_get_system_file_inode(osb,
  428. LOCAL_ALLOC_SYSTEM_INODE,
  429. slot_num);
  430. if (!inode) {
  431. status = -EINVAL;
  432. mlog_errno(status);
  433. goto bail;
  434. }
  435. inode_lock(inode);
  436. status = ocfs2_read_inode_block_full(inode, &alloc_bh,
  437. OCFS2_BH_IGNORE_CACHE);
  438. if (status < 0) {
  439. mlog_errno(status);
  440. goto bail;
  441. }
  442. *alloc_copy = kmalloc(alloc_bh->b_size, GFP_KERNEL);
  443. if (!(*alloc_copy)) {
  444. status = -ENOMEM;
  445. goto bail;
  446. }
  447. memcpy((*alloc_copy), alloc_bh->b_data, alloc_bh->b_size);
  448. alloc = (struct ocfs2_dinode *) alloc_bh->b_data;
  449. ocfs2_clear_local_alloc(alloc);
  450. ocfs2_compute_meta_ecc(osb->sb, alloc_bh->b_data, &alloc->i_check);
  451. status = ocfs2_write_block(osb, alloc_bh, INODE_CACHE(inode));
  452. if (status < 0)
  453. mlog_errno(status);
  454. bail:
  455. if (status < 0) {
  456. kfree(*alloc_copy);
  457. *alloc_copy = NULL;
  458. }
  459. brelse(alloc_bh);
  460. if (inode) {
  461. inode_unlock(inode);
  462. iput(inode);
  463. }
  464. if (status)
  465. mlog_errno(status);
  466. return status;
  467. }
  468. /*
  469. * Step 2: By now, we've completed the journal recovery, we've stamped
  470. * a clean local alloc on disk and dropped the node out of the
  471. * recovery map. Dlm locks will no longer stall, so lets clear out the
  472. * main bitmap.
  473. */
  474. int ocfs2_complete_local_alloc_recovery(struct ocfs2_super *osb,
  475. struct ocfs2_dinode *alloc)
  476. {
  477. int status;
  478. handle_t *handle;
  479. struct buffer_head *main_bm_bh = NULL;
  480. struct inode *main_bm_inode;
  481. main_bm_inode = ocfs2_get_system_file_inode(osb,
  482. GLOBAL_BITMAP_SYSTEM_INODE,
  483. OCFS2_INVALID_SLOT);
  484. if (!main_bm_inode) {
  485. status = -EINVAL;
  486. mlog_errno(status);
  487. goto out;
  488. }
  489. inode_lock(main_bm_inode);
  490. status = ocfs2_inode_lock(main_bm_inode, &main_bm_bh, 1);
  491. if (status < 0) {
  492. mlog_errno(status);
  493. goto out_mutex;
  494. }
  495. handle = ocfs2_start_trans(osb, OCFS2_WINDOW_MOVE_CREDITS);
  496. if (IS_ERR(handle)) {
  497. status = PTR_ERR(handle);
  498. handle = NULL;
  499. mlog_errno(status);
  500. goto out_unlock;
  501. }
  502. /* we want the bitmap change to be recorded on disk asap */
  503. handle->h_sync = 1;
  504. status = ocfs2_sync_local_to_main(osb, handle, alloc,
  505. main_bm_inode, main_bm_bh);
  506. if (status < 0)
  507. mlog_errno(status);
  508. ocfs2_commit_trans(osb, handle);
  509. out_unlock:
  510. ocfs2_inode_unlock(main_bm_inode, 1);
  511. out_mutex:
  512. inode_unlock(main_bm_inode);
  513. brelse(main_bm_bh);
  514. iput(main_bm_inode);
  515. out:
  516. if (!status)
  517. ocfs2_init_steal_slots(osb);
  518. if (status)
  519. mlog_errno(status);
  520. return status;
  521. }
  522. /*
  523. * make sure we've got at least bits_wanted contiguous bits in the
  524. * local alloc. You lose them when you drop i_mutex.
  525. *
  526. * We will add ourselves to the transaction passed in, but may start
  527. * our own in order to shift windows.
  528. */
  529. int ocfs2_reserve_local_alloc_bits(struct ocfs2_super *osb,
  530. u32 bits_wanted,
  531. struct ocfs2_alloc_context *ac)
  532. {
  533. int status;
  534. struct ocfs2_dinode *alloc;
  535. struct inode *local_alloc_inode;
  536. unsigned int free_bits;
  537. BUG_ON(!ac);
  538. local_alloc_inode =
  539. ocfs2_get_system_file_inode(osb,
  540. LOCAL_ALLOC_SYSTEM_INODE,
  541. osb->slot_num);
  542. if (!local_alloc_inode) {
  543. status = -ENOENT;
  544. mlog_errno(status);
  545. goto bail;
  546. }
  547. inode_lock(local_alloc_inode);
  548. /*
  549. * We must double check state and allocator bits because
  550. * another process may have changed them while holding i_mutex.
  551. */
  552. spin_lock(&osb->osb_lock);
  553. if (!ocfs2_la_state_enabled(osb) ||
  554. (bits_wanted > osb->local_alloc_bits)) {
  555. spin_unlock(&osb->osb_lock);
  556. status = -ENOSPC;
  557. goto bail;
  558. }
  559. spin_unlock(&osb->osb_lock);
  560. alloc = (struct ocfs2_dinode *) osb->local_alloc_bh->b_data;
  561. #ifdef CONFIG_OCFS2_DEBUG_FS
  562. if (le32_to_cpu(alloc->id1.bitmap1.i_used) !=
  563. ocfs2_local_alloc_count_bits(alloc)) {
  564. ocfs2_error(osb->sb, "local alloc inode %llu says it has %u used bits, but a count shows %u\n",
  565. (unsigned long long)le64_to_cpu(alloc->i_blkno),
  566. le32_to_cpu(alloc->id1.bitmap1.i_used),
  567. ocfs2_local_alloc_count_bits(alloc));
  568. status = -EIO;
  569. goto bail;
  570. }
  571. #endif
  572. free_bits = le32_to_cpu(alloc->id1.bitmap1.i_total) -
  573. le32_to_cpu(alloc->id1.bitmap1.i_used);
  574. if (bits_wanted > free_bits) {
  575. /* uhoh, window change time. */
  576. status =
  577. ocfs2_local_alloc_slide_window(osb, local_alloc_inode);
  578. if (status < 0) {
  579. if (status != -ENOSPC)
  580. mlog_errno(status);
  581. goto bail;
  582. }
  583. /*
  584. * Under certain conditions, the window slide code
  585. * might have reduced the number of bits available or
  586. * disabled the the local alloc entirely. Re-check
  587. * here and return -ENOSPC if necessary.
  588. */
  589. status = -ENOSPC;
  590. if (!ocfs2_la_state_enabled(osb))
  591. goto bail;
  592. free_bits = le32_to_cpu(alloc->id1.bitmap1.i_total) -
  593. le32_to_cpu(alloc->id1.bitmap1.i_used);
  594. if (bits_wanted > free_bits)
  595. goto bail;
  596. }
  597. ac->ac_inode = local_alloc_inode;
  598. /* We should never use localalloc from another slot */
  599. ac->ac_alloc_slot = osb->slot_num;
  600. ac->ac_which = OCFS2_AC_USE_LOCAL;
  601. get_bh(osb->local_alloc_bh);
  602. ac->ac_bh = osb->local_alloc_bh;
  603. status = 0;
  604. bail:
  605. if (status < 0 && local_alloc_inode) {
  606. inode_unlock(local_alloc_inode);
  607. iput(local_alloc_inode);
  608. }
  609. trace_ocfs2_reserve_local_alloc_bits(
  610. (unsigned long long)ac->ac_max_block,
  611. bits_wanted, osb->slot_num, status);
  612. if (status)
  613. mlog_errno(status);
  614. return status;
  615. }
  616. int ocfs2_claim_local_alloc_bits(struct ocfs2_super *osb,
  617. handle_t *handle,
  618. struct ocfs2_alloc_context *ac,
  619. u32 bits_wanted,
  620. u32 *bit_off,
  621. u32 *num_bits)
  622. {
  623. int status, start;
  624. struct inode *local_alloc_inode;
  625. void *bitmap;
  626. struct ocfs2_dinode *alloc;
  627. struct ocfs2_local_alloc *la;
  628. BUG_ON(ac->ac_which != OCFS2_AC_USE_LOCAL);
  629. local_alloc_inode = ac->ac_inode;
  630. alloc = (struct ocfs2_dinode *) osb->local_alloc_bh->b_data;
  631. la = OCFS2_LOCAL_ALLOC(alloc);
  632. start = ocfs2_local_alloc_find_clear_bits(osb, alloc, &bits_wanted,
  633. ac->ac_resv);
  634. if (start == -1) {
  635. /* TODO: Shouldn't we just BUG here? */
  636. status = -ENOSPC;
  637. mlog_errno(status);
  638. goto bail;
  639. }
  640. bitmap = la->la_bitmap;
  641. *bit_off = le32_to_cpu(la->la_bm_off) + start;
  642. *num_bits = bits_wanted;
  643. status = ocfs2_journal_access_di(handle,
  644. INODE_CACHE(local_alloc_inode),
  645. osb->local_alloc_bh,
  646. OCFS2_JOURNAL_ACCESS_WRITE);
  647. if (status < 0) {
  648. mlog_errno(status);
  649. goto bail;
  650. }
  651. ocfs2_resmap_claimed_bits(&osb->osb_la_resmap, ac->ac_resv, start,
  652. bits_wanted);
  653. while(bits_wanted--)
  654. ocfs2_set_bit(start++, bitmap);
  655. le32_add_cpu(&alloc->id1.bitmap1.i_used, *num_bits);
  656. ocfs2_journal_dirty(handle, osb->local_alloc_bh);
  657. bail:
  658. if (status)
  659. mlog_errno(status);
  660. return status;
  661. }
  662. int ocfs2_free_local_alloc_bits(struct ocfs2_super *osb,
  663. handle_t *handle,
  664. struct ocfs2_alloc_context *ac,
  665. u32 bit_off,
  666. u32 num_bits)
  667. {
  668. int status, start;
  669. u32 clear_bits;
  670. struct inode *local_alloc_inode;
  671. void *bitmap;
  672. struct ocfs2_dinode *alloc;
  673. struct ocfs2_local_alloc *la;
  674. BUG_ON(ac->ac_which != OCFS2_AC_USE_LOCAL);
  675. local_alloc_inode = ac->ac_inode;
  676. alloc = (struct ocfs2_dinode *) osb->local_alloc_bh->b_data;
  677. la = OCFS2_LOCAL_ALLOC(alloc);
  678. bitmap = la->la_bitmap;
  679. start = bit_off - le32_to_cpu(la->la_bm_off);
  680. clear_bits = num_bits;
  681. status = ocfs2_journal_access_di(handle,
  682. INODE_CACHE(local_alloc_inode),
  683. osb->local_alloc_bh,
  684. OCFS2_JOURNAL_ACCESS_WRITE);
  685. if (status < 0) {
  686. mlog_errno(status);
  687. goto bail;
  688. }
  689. while (clear_bits--)
  690. ocfs2_clear_bit(start++, bitmap);
  691. le32_add_cpu(&alloc->id1.bitmap1.i_used, -num_bits);
  692. ocfs2_journal_dirty(handle, osb->local_alloc_bh);
  693. bail:
  694. return status;
  695. }
  696. static u32 ocfs2_local_alloc_count_bits(struct ocfs2_dinode *alloc)
  697. {
  698. u32 count;
  699. struct ocfs2_local_alloc *la = OCFS2_LOCAL_ALLOC(alloc);
  700. count = memweight(la->la_bitmap, le16_to_cpu(la->la_size));
  701. trace_ocfs2_local_alloc_count_bits(count);
  702. return count;
  703. }
  704. static int ocfs2_local_alloc_find_clear_bits(struct ocfs2_super *osb,
  705. struct ocfs2_dinode *alloc,
  706. u32 *numbits,
  707. struct ocfs2_alloc_reservation *resv)
  708. {
  709. int numfound = 0, bitoff, left, startoff, lastzero;
  710. int local_resv = 0;
  711. struct ocfs2_alloc_reservation r;
  712. void *bitmap = NULL;
  713. struct ocfs2_reservation_map *resmap = &osb->osb_la_resmap;
  714. if (!alloc->id1.bitmap1.i_total) {
  715. bitoff = -1;
  716. goto bail;
  717. }
  718. if (!resv) {
  719. local_resv = 1;
  720. ocfs2_resv_init_once(&r);
  721. ocfs2_resv_set_type(&r, OCFS2_RESV_FLAG_TMP);
  722. resv = &r;
  723. }
  724. numfound = *numbits;
  725. if (ocfs2_resmap_resv_bits(resmap, resv, &bitoff, &numfound) == 0) {
  726. if (numfound < *numbits)
  727. *numbits = numfound;
  728. goto bail;
  729. }
  730. /*
  731. * Code error. While reservations are enabled, local
  732. * allocation should _always_ go through them.
  733. */
  734. BUG_ON(osb->osb_resv_level != 0);
  735. /*
  736. * Reservations are disabled. Handle this the old way.
  737. */
  738. bitmap = OCFS2_LOCAL_ALLOC(alloc)->la_bitmap;
  739. numfound = bitoff = startoff = 0;
  740. lastzero = -1;
  741. left = le32_to_cpu(alloc->id1.bitmap1.i_total);
  742. while ((bitoff = ocfs2_find_next_zero_bit(bitmap, left, startoff)) != -1) {
  743. if (bitoff == left) {
  744. /* mlog(0, "bitoff (%d) == left", bitoff); */
  745. break;
  746. }
  747. /* mlog(0, "Found a zero: bitoff = %d, startoff = %d, "
  748. "numfound = %d\n", bitoff, startoff, numfound);*/
  749. /* Ok, we found a zero bit... is it contig. or do we
  750. * start over?*/
  751. if (bitoff == startoff) {
  752. /* we found a zero */
  753. numfound++;
  754. startoff++;
  755. } else {
  756. /* got a zero after some ones */
  757. numfound = 1;
  758. startoff = bitoff+1;
  759. }
  760. /* we got everything we needed */
  761. if (numfound == *numbits) {
  762. /* mlog(0, "Found it all!\n"); */
  763. break;
  764. }
  765. }
  766. trace_ocfs2_local_alloc_find_clear_bits_search_bitmap(bitoff, numfound);
  767. if (numfound == *numbits)
  768. bitoff = startoff - numfound;
  769. else
  770. bitoff = -1;
  771. bail:
  772. if (local_resv)
  773. ocfs2_resv_discard(resmap, resv);
  774. trace_ocfs2_local_alloc_find_clear_bits(*numbits,
  775. le32_to_cpu(alloc->id1.bitmap1.i_total),
  776. bitoff, numfound);
  777. return bitoff;
  778. }
  779. static void ocfs2_clear_local_alloc(struct ocfs2_dinode *alloc)
  780. {
  781. struct ocfs2_local_alloc *la = OCFS2_LOCAL_ALLOC(alloc);
  782. int i;
  783. alloc->id1.bitmap1.i_total = 0;
  784. alloc->id1.bitmap1.i_used = 0;
  785. la->la_bm_off = 0;
  786. for(i = 0; i < le16_to_cpu(la->la_size); i++)
  787. la->la_bitmap[i] = 0;
  788. }
  789. #if 0
  790. /* turn this on and uncomment below to aid debugging window shifts. */
  791. static void ocfs2_verify_zero_bits(unsigned long *bitmap,
  792. unsigned int start,
  793. unsigned int count)
  794. {
  795. unsigned int tmp = count;
  796. while(tmp--) {
  797. if (ocfs2_test_bit(start + tmp, bitmap)) {
  798. printk("ocfs2_verify_zero_bits: start = %u, count = "
  799. "%u\n", start, count);
  800. printk("ocfs2_verify_zero_bits: bit %u is set!",
  801. start + tmp);
  802. BUG();
  803. }
  804. }
  805. }
  806. #endif
  807. /*
  808. * sync the local alloc to main bitmap.
  809. *
  810. * assumes you've already locked the main bitmap -- the bitmap inode
  811. * passed is used for caching.
  812. */
  813. static int ocfs2_sync_local_to_main(struct ocfs2_super *osb,
  814. handle_t *handle,
  815. struct ocfs2_dinode *alloc,
  816. struct inode *main_bm_inode,
  817. struct buffer_head *main_bm_bh)
  818. {
  819. int status = 0;
  820. int bit_off, left, count, start;
  821. u64 la_start_blk;
  822. u64 blkno;
  823. void *bitmap;
  824. struct ocfs2_local_alloc *la = OCFS2_LOCAL_ALLOC(alloc);
  825. trace_ocfs2_sync_local_to_main(
  826. le32_to_cpu(alloc->id1.bitmap1.i_total),
  827. le32_to_cpu(alloc->id1.bitmap1.i_used));
  828. if (!alloc->id1.bitmap1.i_total) {
  829. goto bail;
  830. }
  831. if (le32_to_cpu(alloc->id1.bitmap1.i_used) ==
  832. le32_to_cpu(alloc->id1.bitmap1.i_total)) {
  833. goto bail;
  834. }
  835. la_start_blk = ocfs2_clusters_to_blocks(osb->sb,
  836. le32_to_cpu(la->la_bm_off));
  837. bitmap = la->la_bitmap;
  838. start = count = bit_off = 0;
  839. left = le32_to_cpu(alloc->id1.bitmap1.i_total);
  840. while ((bit_off = ocfs2_find_next_zero_bit(bitmap, left, start))
  841. != -1) {
  842. if ((bit_off < left) && (bit_off == start)) {
  843. count++;
  844. start++;
  845. continue;
  846. }
  847. if (count) {
  848. blkno = la_start_blk +
  849. ocfs2_clusters_to_blocks(osb->sb,
  850. start - count);
  851. trace_ocfs2_sync_local_to_main_free(
  852. count, start - count,
  853. (unsigned long long)la_start_blk,
  854. (unsigned long long)blkno);
  855. status = ocfs2_release_clusters(handle,
  856. main_bm_inode,
  857. main_bm_bh, blkno,
  858. count);
  859. if (status < 0) {
  860. mlog_errno(status);
  861. goto bail;
  862. }
  863. }
  864. if (bit_off >= left)
  865. break;
  866. count = 1;
  867. start = bit_off + 1;
  868. }
  869. bail:
  870. if (status)
  871. mlog_errno(status);
  872. return status;
  873. }
  874. enum ocfs2_la_event {
  875. OCFS2_LA_EVENT_SLIDE, /* Normal window slide. */
  876. OCFS2_LA_EVENT_FRAGMENTED, /* The global bitmap has
  877. * enough bits theoretically
  878. * free, but a contiguous
  879. * allocation could not be
  880. * found. */
  881. OCFS2_LA_EVENT_ENOSPC, /* Global bitmap doesn't have
  882. * enough bits free to satisfy
  883. * our request. */
  884. };
  885. #define OCFS2_LA_ENABLE_INTERVAL (30 * HZ)
  886. /*
  887. * Given an event, calculate the size of our next local alloc window.
  888. *
  889. * This should always be called under i_mutex of the local alloc inode
  890. * so that local alloc disabling doesn't race with processes trying to
  891. * use the allocator.
  892. *
  893. * Returns the state which the local alloc was left in. This value can
  894. * be ignored by some paths.
  895. */
  896. static int ocfs2_recalc_la_window(struct ocfs2_super *osb,
  897. enum ocfs2_la_event event)
  898. {
  899. unsigned int bits;
  900. int state;
  901. spin_lock(&osb->osb_lock);
  902. if (osb->local_alloc_state == OCFS2_LA_DISABLED) {
  903. WARN_ON_ONCE(osb->local_alloc_state == OCFS2_LA_DISABLED);
  904. goto out_unlock;
  905. }
  906. /*
  907. * ENOSPC and fragmentation are treated similarly for now.
  908. */
  909. if (event == OCFS2_LA_EVENT_ENOSPC ||
  910. event == OCFS2_LA_EVENT_FRAGMENTED) {
  911. /*
  912. * We ran out of contiguous space in the primary
  913. * bitmap. Drastically reduce the number of bits used
  914. * by local alloc until we have to disable it.
  915. */
  916. bits = osb->local_alloc_bits >> 1;
  917. if (bits > ocfs2_megabytes_to_clusters(osb->sb, 1)) {
  918. /*
  919. * By setting state to THROTTLED, we'll keep
  920. * the number of local alloc bits used down
  921. * until an event occurs which would give us
  922. * reason to assume the bitmap situation might
  923. * have changed.
  924. */
  925. osb->local_alloc_state = OCFS2_LA_THROTTLED;
  926. osb->local_alloc_bits = bits;
  927. } else {
  928. osb->local_alloc_state = OCFS2_LA_DISABLED;
  929. }
  930. queue_delayed_work(osb->ocfs2_wq, &osb->la_enable_wq,
  931. OCFS2_LA_ENABLE_INTERVAL);
  932. goto out_unlock;
  933. }
  934. /*
  935. * Don't increase the size of the local alloc window until we
  936. * know we might be able to fulfill the request. Otherwise, we
  937. * risk bouncing around the global bitmap during periods of
  938. * low space.
  939. */
  940. if (osb->local_alloc_state != OCFS2_LA_THROTTLED)
  941. osb->local_alloc_bits = osb->local_alloc_default_bits;
  942. out_unlock:
  943. state = osb->local_alloc_state;
  944. spin_unlock(&osb->osb_lock);
  945. return state;
  946. }
  947. static int ocfs2_local_alloc_reserve_for_window(struct ocfs2_super *osb,
  948. struct ocfs2_alloc_context **ac,
  949. struct inode **bitmap_inode,
  950. struct buffer_head **bitmap_bh)
  951. {
  952. int status;
  953. *ac = kzalloc(sizeof(struct ocfs2_alloc_context), GFP_KERNEL);
  954. if (!(*ac)) {
  955. status = -ENOMEM;
  956. mlog_errno(status);
  957. goto bail;
  958. }
  959. retry_enospc:
  960. (*ac)->ac_bits_wanted = osb->local_alloc_bits;
  961. status = ocfs2_reserve_cluster_bitmap_bits(osb, *ac);
  962. if (status == -ENOSPC) {
  963. if (ocfs2_recalc_la_window(osb, OCFS2_LA_EVENT_ENOSPC) ==
  964. OCFS2_LA_DISABLED)
  965. goto bail;
  966. ocfs2_free_ac_resource(*ac);
  967. memset(*ac, 0, sizeof(struct ocfs2_alloc_context));
  968. goto retry_enospc;
  969. }
  970. if (status < 0) {
  971. mlog_errno(status);
  972. goto bail;
  973. }
  974. *bitmap_inode = (*ac)->ac_inode;
  975. igrab(*bitmap_inode);
  976. *bitmap_bh = (*ac)->ac_bh;
  977. get_bh(*bitmap_bh);
  978. status = 0;
  979. bail:
  980. if ((status < 0) && *ac) {
  981. ocfs2_free_alloc_context(*ac);
  982. *ac = NULL;
  983. }
  984. if (status)
  985. mlog_errno(status);
  986. return status;
  987. }
  988. /*
  989. * pass it the bitmap lock in lock_bh if you have it.
  990. */
  991. static int ocfs2_local_alloc_new_window(struct ocfs2_super *osb,
  992. handle_t *handle,
  993. struct ocfs2_alloc_context *ac)
  994. {
  995. int status = 0;
  996. u32 cluster_off, cluster_count;
  997. struct ocfs2_dinode *alloc = NULL;
  998. struct ocfs2_local_alloc *la;
  999. alloc = (struct ocfs2_dinode *) osb->local_alloc_bh->b_data;
  1000. la = OCFS2_LOCAL_ALLOC(alloc);
  1001. trace_ocfs2_local_alloc_new_window(
  1002. le32_to_cpu(alloc->id1.bitmap1.i_total),
  1003. osb->local_alloc_bits);
  1004. /* Instruct the allocation code to try the most recently used
  1005. * cluster group. We'll re-record the group used this pass
  1006. * below. */
  1007. ac->ac_last_group = osb->la_last_gd;
  1008. /* we used the generic suballoc reserve function, but we set
  1009. * everything up nicely, so there's no reason why we can't use
  1010. * the more specific cluster api to claim bits. */
  1011. status = ocfs2_claim_clusters(handle, ac, osb->local_alloc_bits,
  1012. &cluster_off, &cluster_count);
  1013. if (status == -ENOSPC) {
  1014. retry_enospc:
  1015. /*
  1016. * Note: We could also try syncing the journal here to
  1017. * allow use of any free bits which the current
  1018. * transaction can't give us access to. --Mark
  1019. */
  1020. if (ocfs2_recalc_la_window(osb, OCFS2_LA_EVENT_FRAGMENTED) ==
  1021. OCFS2_LA_DISABLED)
  1022. goto bail;
  1023. ac->ac_bits_wanted = osb->local_alloc_bits;
  1024. status = ocfs2_claim_clusters(handle, ac,
  1025. osb->local_alloc_bits,
  1026. &cluster_off,
  1027. &cluster_count);
  1028. if (status == -ENOSPC)
  1029. goto retry_enospc;
  1030. /*
  1031. * We only shrunk the *minimum* number of in our
  1032. * request - it's entirely possible that the allocator
  1033. * might give us more than we asked for.
  1034. */
  1035. if (status == 0) {
  1036. spin_lock(&osb->osb_lock);
  1037. osb->local_alloc_bits = cluster_count;
  1038. spin_unlock(&osb->osb_lock);
  1039. }
  1040. }
  1041. if (status < 0) {
  1042. if (status != -ENOSPC)
  1043. mlog_errno(status);
  1044. goto bail;
  1045. }
  1046. osb->la_last_gd = ac->ac_last_group;
  1047. la->la_bm_off = cpu_to_le32(cluster_off);
  1048. alloc->id1.bitmap1.i_total = cpu_to_le32(cluster_count);
  1049. /* just in case... In the future when we find space ourselves,
  1050. * we don't have to get all contiguous -- but we'll have to
  1051. * set all previously used bits in bitmap and update
  1052. * la_bits_set before setting the bits in the main bitmap. */
  1053. alloc->id1.bitmap1.i_used = 0;
  1054. memset(OCFS2_LOCAL_ALLOC(alloc)->la_bitmap, 0,
  1055. le16_to_cpu(la->la_size));
  1056. ocfs2_resmap_restart(&osb->osb_la_resmap, cluster_count,
  1057. OCFS2_LOCAL_ALLOC(alloc)->la_bitmap);
  1058. trace_ocfs2_local_alloc_new_window_result(
  1059. OCFS2_LOCAL_ALLOC(alloc)->la_bm_off,
  1060. le32_to_cpu(alloc->id1.bitmap1.i_total));
  1061. bail:
  1062. if (status)
  1063. mlog_errno(status);
  1064. return status;
  1065. }
  1066. /* Note that we do *NOT* lock the local alloc inode here as
  1067. * it's been locked already for us. */
  1068. static int ocfs2_local_alloc_slide_window(struct ocfs2_super *osb,
  1069. struct inode *local_alloc_inode)
  1070. {
  1071. int status = 0;
  1072. struct buffer_head *main_bm_bh = NULL;
  1073. struct inode *main_bm_inode = NULL;
  1074. handle_t *handle = NULL;
  1075. struct ocfs2_dinode *alloc;
  1076. struct ocfs2_dinode *alloc_copy = NULL;
  1077. struct ocfs2_alloc_context *ac = NULL;
  1078. ocfs2_recalc_la_window(osb, OCFS2_LA_EVENT_SLIDE);
  1079. /* This will lock the main bitmap for us. */
  1080. status = ocfs2_local_alloc_reserve_for_window(osb,
  1081. &ac,
  1082. &main_bm_inode,
  1083. &main_bm_bh);
  1084. if (status < 0) {
  1085. if (status != -ENOSPC)
  1086. mlog_errno(status);
  1087. goto bail;
  1088. }
  1089. handle = ocfs2_start_trans(osb, OCFS2_WINDOW_MOVE_CREDITS);
  1090. if (IS_ERR(handle)) {
  1091. status = PTR_ERR(handle);
  1092. handle = NULL;
  1093. mlog_errno(status);
  1094. goto bail;
  1095. }
  1096. alloc = (struct ocfs2_dinode *) osb->local_alloc_bh->b_data;
  1097. /* We want to clear the local alloc before doing anything
  1098. * else, so that if we error later during this operation,
  1099. * local alloc shutdown won't try to double free main bitmap
  1100. * bits. Make a copy so the sync function knows which bits to
  1101. * free. */
  1102. alloc_copy = kmalloc(osb->local_alloc_bh->b_size, GFP_NOFS);
  1103. if (!alloc_copy) {
  1104. status = -ENOMEM;
  1105. mlog_errno(status);
  1106. goto bail;
  1107. }
  1108. memcpy(alloc_copy, alloc, osb->local_alloc_bh->b_size);
  1109. status = ocfs2_journal_access_di(handle,
  1110. INODE_CACHE(local_alloc_inode),
  1111. osb->local_alloc_bh,
  1112. OCFS2_JOURNAL_ACCESS_WRITE);
  1113. if (status < 0) {
  1114. mlog_errno(status);
  1115. goto bail;
  1116. }
  1117. ocfs2_clear_local_alloc(alloc);
  1118. ocfs2_journal_dirty(handle, osb->local_alloc_bh);
  1119. status = ocfs2_sync_local_to_main(osb, handle, alloc_copy,
  1120. main_bm_inode, main_bm_bh);
  1121. if (status < 0) {
  1122. mlog_errno(status);
  1123. goto bail;
  1124. }
  1125. status = ocfs2_local_alloc_new_window(osb, handle, ac);
  1126. if (status < 0) {
  1127. if (status != -ENOSPC)
  1128. mlog_errno(status);
  1129. goto bail;
  1130. }
  1131. atomic_inc(&osb->alloc_stats.moves);
  1132. bail:
  1133. if (handle)
  1134. ocfs2_commit_trans(osb, handle);
  1135. brelse(main_bm_bh);
  1136. iput(main_bm_inode);
  1137. kfree(alloc_copy);
  1138. if (ac)
  1139. ocfs2_free_alloc_context(ac);
  1140. if (status)
  1141. mlog_errno(status);
  1142. return status;
  1143. }