localalloc.c 34 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339
  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, "Local alloc hasn't been recovered!\n"
  303. "found = %u, set = %u, taken = %u, off = %u\n",
  304. num_used, le32_to_cpu(alloc->id1.bitmap1.i_used),
  305. le32_to_cpu(alloc->id1.bitmap1.i_total),
  306. OCFS2_LOCAL_ALLOC(alloc)->la_bm_off);
  307. osb->local_alloc_bh = alloc_bh;
  308. osb->local_alloc_state = OCFS2_LA_ENABLED;
  309. bail:
  310. if (status < 0)
  311. brelse(alloc_bh);
  312. iput(inode);
  313. trace_ocfs2_load_local_alloc(osb->local_alloc_bits);
  314. if (status)
  315. mlog_errno(status);
  316. return status;
  317. }
  318. /*
  319. * return any unused bits to the bitmap and write out a clean
  320. * local_alloc.
  321. *
  322. * local_alloc_bh is optional. If not passed, we will simply use the
  323. * one off osb. If you do pass it however, be warned that it *will* be
  324. * returned brelse'd and NULL'd out.*/
  325. void ocfs2_shutdown_local_alloc(struct ocfs2_super *osb)
  326. {
  327. int status;
  328. handle_t *handle;
  329. struct inode *local_alloc_inode = NULL;
  330. struct buffer_head *bh = NULL;
  331. struct buffer_head *main_bm_bh = NULL;
  332. struct inode *main_bm_inode = NULL;
  333. struct ocfs2_dinode *alloc_copy = NULL;
  334. struct ocfs2_dinode *alloc = NULL;
  335. cancel_delayed_work(&osb->la_enable_wq);
  336. flush_workqueue(osb->ocfs2_wq);
  337. if (osb->local_alloc_state == OCFS2_LA_UNUSED)
  338. goto out;
  339. local_alloc_inode =
  340. ocfs2_get_system_file_inode(osb,
  341. LOCAL_ALLOC_SYSTEM_INODE,
  342. osb->slot_num);
  343. if (!local_alloc_inode) {
  344. status = -ENOENT;
  345. mlog_errno(status);
  346. goto out;
  347. }
  348. osb->local_alloc_state = OCFS2_LA_DISABLED;
  349. ocfs2_resmap_uninit(&osb->osb_la_resmap);
  350. main_bm_inode = ocfs2_get_system_file_inode(osb,
  351. GLOBAL_BITMAP_SYSTEM_INODE,
  352. OCFS2_INVALID_SLOT);
  353. if (!main_bm_inode) {
  354. status = -EINVAL;
  355. mlog_errno(status);
  356. goto out;
  357. }
  358. inode_lock(main_bm_inode);
  359. status = ocfs2_inode_lock(main_bm_inode, &main_bm_bh, 1);
  360. if (status < 0) {
  361. mlog_errno(status);
  362. goto out_mutex;
  363. }
  364. /* WINDOW_MOVE_CREDITS is a bit heavy... */
  365. handle = ocfs2_start_trans(osb, OCFS2_WINDOW_MOVE_CREDITS);
  366. if (IS_ERR(handle)) {
  367. mlog_errno(PTR_ERR(handle));
  368. handle = NULL;
  369. goto out_unlock;
  370. }
  371. bh = osb->local_alloc_bh;
  372. alloc = (struct ocfs2_dinode *) bh->b_data;
  373. alloc_copy = kmalloc(bh->b_size, GFP_NOFS);
  374. if (!alloc_copy) {
  375. status = -ENOMEM;
  376. goto out_commit;
  377. }
  378. memcpy(alloc_copy, alloc, bh->b_size);
  379. status = ocfs2_journal_access_di(handle, INODE_CACHE(local_alloc_inode),
  380. bh, OCFS2_JOURNAL_ACCESS_WRITE);
  381. if (status < 0) {
  382. mlog_errno(status);
  383. goto out_commit;
  384. }
  385. ocfs2_clear_local_alloc(alloc);
  386. ocfs2_journal_dirty(handle, bh);
  387. brelse(bh);
  388. osb->local_alloc_bh = NULL;
  389. osb->local_alloc_state = OCFS2_LA_UNUSED;
  390. status = ocfs2_sync_local_to_main(osb, handle, alloc_copy,
  391. main_bm_inode, main_bm_bh);
  392. if (status < 0)
  393. mlog_errno(status);
  394. out_commit:
  395. ocfs2_commit_trans(osb, handle);
  396. out_unlock:
  397. brelse(main_bm_bh);
  398. ocfs2_inode_unlock(main_bm_inode, 1);
  399. out_mutex:
  400. inode_unlock(main_bm_inode);
  401. iput(main_bm_inode);
  402. out:
  403. iput(local_alloc_inode);
  404. kfree(alloc_copy);
  405. }
  406. /*
  407. * We want to free the bitmap bits outside of any recovery context as
  408. * we'll need a cluster lock to do so, but we must clear the local
  409. * alloc before giving up the recovered nodes journal. To solve this,
  410. * we kmalloc a copy of the local alloc before it's change for the
  411. * caller to process with ocfs2_complete_local_alloc_recovery
  412. */
  413. int ocfs2_begin_local_alloc_recovery(struct ocfs2_super *osb,
  414. int slot_num,
  415. struct ocfs2_dinode **alloc_copy)
  416. {
  417. int status = 0;
  418. struct buffer_head *alloc_bh = NULL;
  419. struct inode *inode = NULL;
  420. struct ocfs2_dinode *alloc;
  421. trace_ocfs2_begin_local_alloc_recovery(slot_num);
  422. *alloc_copy = NULL;
  423. inode = ocfs2_get_system_file_inode(osb,
  424. LOCAL_ALLOC_SYSTEM_INODE,
  425. slot_num);
  426. if (!inode) {
  427. status = -EINVAL;
  428. mlog_errno(status);
  429. goto bail;
  430. }
  431. inode_lock(inode);
  432. status = ocfs2_read_inode_block_full(inode, &alloc_bh,
  433. OCFS2_BH_IGNORE_CACHE);
  434. if (status < 0) {
  435. mlog_errno(status);
  436. goto bail;
  437. }
  438. *alloc_copy = kmalloc(alloc_bh->b_size, GFP_KERNEL);
  439. if (!(*alloc_copy)) {
  440. status = -ENOMEM;
  441. goto bail;
  442. }
  443. memcpy((*alloc_copy), alloc_bh->b_data, alloc_bh->b_size);
  444. alloc = (struct ocfs2_dinode *) alloc_bh->b_data;
  445. ocfs2_clear_local_alloc(alloc);
  446. ocfs2_compute_meta_ecc(osb->sb, alloc_bh->b_data, &alloc->i_check);
  447. status = ocfs2_write_block(osb, alloc_bh, INODE_CACHE(inode));
  448. if (status < 0)
  449. mlog_errno(status);
  450. bail:
  451. if (status < 0) {
  452. kfree(*alloc_copy);
  453. *alloc_copy = NULL;
  454. }
  455. brelse(alloc_bh);
  456. if (inode) {
  457. inode_unlock(inode);
  458. iput(inode);
  459. }
  460. if (status)
  461. mlog_errno(status);
  462. return status;
  463. }
  464. /*
  465. * Step 2: By now, we've completed the journal recovery, we've stamped
  466. * a clean local alloc on disk and dropped the node out of the
  467. * recovery map. Dlm locks will no longer stall, so lets clear out the
  468. * main bitmap.
  469. */
  470. int ocfs2_complete_local_alloc_recovery(struct ocfs2_super *osb,
  471. struct ocfs2_dinode *alloc)
  472. {
  473. int status;
  474. handle_t *handle;
  475. struct buffer_head *main_bm_bh = NULL;
  476. struct inode *main_bm_inode;
  477. main_bm_inode = ocfs2_get_system_file_inode(osb,
  478. GLOBAL_BITMAP_SYSTEM_INODE,
  479. OCFS2_INVALID_SLOT);
  480. if (!main_bm_inode) {
  481. status = -EINVAL;
  482. mlog_errno(status);
  483. goto out;
  484. }
  485. inode_lock(main_bm_inode);
  486. status = ocfs2_inode_lock(main_bm_inode, &main_bm_bh, 1);
  487. if (status < 0) {
  488. mlog_errno(status);
  489. goto out_mutex;
  490. }
  491. handle = ocfs2_start_trans(osb, OCFS2_WINDOW_MOVE_CREDITS);
  492. if (IS_ERR(handle)) {
  493. status = PTR_ERR(handle);
  494. handle = NULL;
  495. mlog_errno(status);
  496. goto out_unlock;
  497. }
  498. /* we want the bitmap change to be recorded on disk asap */
  499. handle->h_sync = 1;
  500. status = ocfs2_sync_local_to_main(osb, handle, alloc,
  501. main_bm_inode, main_bm_bh);
  502. if (status < 0)
  503. mlog_errno(status);
  504. ocfs2_commit_trans(osb, handle);
  505. out_unlock:
  506. ocfs2_inode_unlock(main_bm_inode, 1);
  507. out_mutex:
  508. inode_unlock(main_bm_inode);
  509. brelse(main_bm_bh);
  510. iput(main_bm_inode);
  511. out:
  512. if (!status)
  513. ocfs2_init_steal_slots(osb);
  514. if (status)
  515. mlog_errno(status);
  516. return status;
  517. }
  518. /*
  519. * make sure we've got at least bits_wanted contiguous bits in the
  520. * local alloc. You lose them when you drop i_mutex.
  521. *
  522. * We will add ourselves to the transaction passed in, but may start
  523. * our own in order to shift windows.
  524. */
  525. int ocfs2_reserve_local_alloc_bits(struct ocfs2_super *osb,
  526. u32 bits_wanted,
  527. struct ocfs2_alloc_context *ac)
  528. {
  529. int status;
  530. struct ocfs2_dinode *alloc;
  531. struct inode *local_alloc_inode;
  532. unsigned int free_bits;
  533. BUG_ON(!ac);
  534. local_alloc_inode =
  535. ocfs2_get_system_file_inode(osb,
  536. LOCAL_ALLOC_SYSTEM_INODE,
  537. osb->slot_num);
  538. if (!local_alloc_inode) {
  539. status = -ENOENT;
  540. mlog_errno(status);
  541. goto bail;
  542. }
  543. inode_lock(local_alloc_inode);
  544. /*
  545. * We must double check state and allocator bits because
  546. * another process may have changed them while holding i_mutex.
  547. */
  548. spin_lock(&osb->osb_lock);
  549. if (!ocfs2_la_state_enabled(osb) ||
  550. (bits_wanted > osb->local_alloc_bits)) {
  551. spin_unlock(&osb->osb_lock);
  552. status = -ENOSPC;
  553. goto bail;
  554. }
  555. spin_unlock(&osb->osb_lock);
  556. alloc = (struct ocfs2_dinode *) osb->local_alloc_bh->b_data;
  557. #ifdef CONFIG_OCFS2_DEBUG_FS
  558. if (le32_to_cpu(alloc->id1.bitmap1.i_used) !=
  559. ocfs2_local_alloc_count_bits(alloc)) {
  560. ocfs2_error(osb->sb, "local alloc inode %llu says it has %u used bits, but a count shows %u\n",
  561. (unsigned long long)le64_to_cpu(alloc->i_blkno),
  562. le32_to_cpu(alloc->id1.bitmap1.i_used),
  563. ocfs2_local_alloc_count_bits(alloc));
  564. status = -EIO;
  565. goto bail;
  566. }
  567. #endif
  568. free_bits = le32_to_cpu(alloc->id1.bitmap1.i_total) -
  569. le32_to_cpu(alloc->id1.bitmap1.i_used);
  570. if (bits_wanted > free_bits) {
  571. /* uhoh, window change time. */
  572. status =
  573. ocfs2_local_alloc_slide_window(osb, local_alloc_inode);
  574. if (status < 0) {
  575. if (status != -ENOSPC)
  576. mlog_errno(status);
  577. goto bail;
  578. }
  579. /*
  580. * Under certain conditions, the window slide code
  581. * might have reduced the number of bits available or
  582. * disabled the the local alloc entirely. Re-check
  583. * here and return -ENOSPC if necessary.
  584. */
  585. status = -ENOSPC;
  586. if (!ocfs2_la_state_enabled(osb))
  587. goto bail;
  588. free_bits = le32_to_cpu(alloc->id1.bitmap1.i_total) -
  589. le32_to_cpu(alloc->id1.bitmap1.i_used);
  590. if (bits_wanted > free_bits)
  591. goto bail;
  592. }
  593. ac->ac_inode = local_alloc_inode;
  594. /* We should never use localalloc from another slot */
  595. ac->ac_alloc_slot = osb->slot_num;
  596. ac->ac_which = OCFS2_AC_USE_LOCAL;
  597. get_bh(osb->local_alloc_bh);
  598. ac->ac_bh = osb->local_alloc_bh;
  599. status = 0;
  600. bail:
  601. if (status < 0 && local_alloc_inode) {
  602. inode_unlock(local_alloc_inode);
  603. iput(local_alloc_inode);
  604. }
  605. trace_ocfs2_reserve_local_alloc_bits(
  606. (unsigned long long)ac->ac_max_block,
  607. bits_wanted, osb->slot_num, status);
  608. if (status)
  609. mlog_errno(status);
  610. return status;
  611. }
  612. int ocfs2_claim_local_alloc_bits(struct ocfs2_super *osb,
  613. handle_t *handle,
  614. struct ocfs2_alloc_context *ac,
  615. u32 bits_wanted,
  616. u32 *bit_off,
  617. u32 *num_bits)
  618. {
  619. int status, start;
  620. struct inode *local_alloc_inode;
  621. void *bitmap;
  622. struct ocfs2_dinode *alloc;
  623. struct ocfs2_local_alloc *la;
  624. BUG_ON(ac->ac_which != OCFS2_AC_USE_LOCAL);
  625. local_alloc_inode = ac->ac_inode;
  626. alloc = (struct ocfs2_dinode *) osb->local_alloc_bh->b_data;
  627. la = OCFS2_LOCAL_ALLOC(alloc);
  628. start = ocfs2_local_alloc_find_clear_bits(osb, alloc, &bits_wanted,
  629. ac->ac_resv);
  630. if (start == -1) {
  631. /* TODO: Shouldn't we just BUG here? */
  632. status = -ENOSPC;
  633. mlog_errno(status);
  634. goto bail;
  635. }
  636. bitmap = la->la_bitmap;
  637. *bit_off = le32_to_cpu(la->la_bm_off) + start;
  638. *num_bits = bits_wanted;
  639. status = ocfs2_journal_access_di(handle,
  640. INODE_CACHE(local_alloc_inode),
  641. osb->local_alloc_bh,
  642. OCFS2_JOURNAL_ACCESS_WRITE);
  643. if (status < 0) {
  644. mlog_errno(status);
  645. goto bail;
  646. }
  647. ocfs2_resmap_claimed_bits(&osb->osb_la_resmap, ac->ac_resv, start,
  648. bits_wanted);
  649. while(bits_wanted--)
  650. ocfs2_set_bit(start++, bitmap);
  651. le32_add_cpu(&alloc->id1.bitmap1.i_used, *num_bits);
  652. ocfs2_journal_dirty(handle, osb->local_alloc_bh);
  653. bail:
  654. if (status)
  655. mlog_errno(status);
  656. return status;
  657. }
  658. int ocfs2_free_local_alloc_bits(struct ocfs2_super *osb,
  659. handle_t *handle,
  660. struct ocfs2_alloc_context *ac,
  661. u32 bit_off,
  662. u32 num_bits)
  663. {
  664. int status, start;
  665. u32 clear_bits;
  666. struct inode *local_alloc_inode;
  667. void *bitmap;
  668. struct ocfs2_dinode *alloc;
  669. struct ocfs2_local_alloc *la;
  670. BUG_ON(ac->ac_which != OCFS2_AC_USE_LOCAL);
  671. local_alloc_inode = ac->ac_inode;
  672. alloc = (struct ocfs2_dinode *) osb->local_alloc_bh->b_data;
  673. la = OCFS2_LOCAL_ALLOC(alloc);
  674. bitmap = la->la_bitmap;
  675. start = bit_off - le32_to_cpu(la->la_bm_off);
  676. clear_bits = num_bits;
  677. status = ocfs2_journal_access_di(handle,
  678. INODE_CACHE(local_alloc_inode),
  679. osb->local_alloc_bh,
  680. OCFS2_JOURNAL_ACCESS_WRITE);
  681. if (status < 0) {
  682. mlog_errno(status);
  683. goto bail;
  684. }
  685. while (clear_bits--)
  686. ocfs2_clear_bit(start++, bitmap);
  687. le32_add_cpu(&alloc->id1.bitmap1.i_used, -num_bits);
  688. ocfs2_journal_dirty(handle, osb->local_alloc_bh);
  689. bail:
  690. return status;
  691. }
  692. static u32 ocfs2_local_alloc_count_bits(struct ocfs2_dinode *alloc)
  693. {
  694. u32 count;
  695. struct ocfs2_local_alloc *la = OCFS2_LOCAL_ALLOC(alloc);
  696. count = memweight(la->la_bitmap, le16_to_cpu(la->la_size));
  697. trace_ocfs2_local_alloc_count_bits(count);
  698. return count;
  699. }
  700. static int ocfs2_local_alloc_find_clear_bits(struct ocfs2_super *osb,
  701. struct ocfs2_dinode *alloc,
  702. u32 *numbits,
  703. struct ocfs2_alloc_reservation *resv)
  704. {
  705. int numfound = 0, bitoff, left, startoff, lastzero;
  706. int local_resv = 0;
  707. struct ocfs2_alloc_reservation r;
  708. void *bitmap = NULL;
  709. struct ocfs2_reservation_map *resmap = &osb->osb_la_resmap;
  710. if (!alloc->id1.bitmap1.i_total) {
  711. bitoff = -1;
  712. goto bail;
  713. }
  714. if (!resv) {
  715. local_resv = 1;
  716. ocfs2_resv_init_once(&r);
  717. ocfs2_resv_set_type(&r, OCFS2_RESV_FLAG_TMP);
  718. resv = &r;
  719. }
  720. numfound = *numbits;
  721. if (ocfs2_resmap_resv_bits(resmap, resv, &bitoff, &numfound) == 0) {
  722. if (numfound < *numbits)
  723. *numbits = numfound;
  724. goto bail;
  725. }
  726. /*
  727. * Code error. While reservations are enabled, local
  728. * allocation should _always_ go through them.
  729. */
  730. BUG_ON(osb->osb_resv_level != 0);
  731. /*
  732. * Reservations are disabled. Handle this the old way.
  733. */
  734. bitmap = OCFS2_LOCAL_ALLOC(alloc)->la_bitmap;
  735. numfound = bitoff = startoff = 0;
  736. lastzero = -1;
  737. left = le32_to_cpu(alloc->id1.bitmap1.i_total);
  738. while ((bitoff = ocfs2_find_next_zero_bit(bitmap, left, startoff)) != -1) {
  739. if (bitoff == left) {
  740. /* mlog(0, "bitoff (%d) == left", bitoff); */
  741. break;
  742. }
  743. /* mlog(0, "Found a zero: bitoff = %d, startoff = %d, "
  744. "numfound = %d\n", bitoff, startoff, numfound);*/
  745. /* Ok, we found a zero bit... is it contig. or do we
  746. * start over?*/
  747. if (bitoff == startoff) {
  748. /* we found a zero */
  749. numfound++;
  750. startoff++;
  751. } else {
  752. /* got a zero after some ones */
  753. numfound = 1;
  754. startoff = bitoff+1;
  755. }
  756. /* we got everything we needed */
  757. if (numfound == *numbits) {
  758. /* mlog(0, "Found it all!\n"); */
  759. break;
  760. }
  761. }
  762. trace_ocfs2_local_alloc_find_clear_bits_search_bitmap(bitoff, numfound);
  763. if (numfound == *numbits)
  764. bitoff = startoff - numfound;
  765. else
  766. bitoff = -1;
  767. bail:
  768. if (local_resv)
  769. ocfs2_resv_discard(resmap, resv);
  770. trace_ocfs2_local_alloc_find_clear_bits(*numbits,
  771. le32_to_cpu(alloc->id1.bitmap1.i_total),
  772. bitoff, numfound);
  773. return bitoff;
  774. }
  775. static void ocfs2_clear_local_alloc(struct ocfs2_dinode *alloc)
  776. {
  777. struct ocfs2_local_alloc *la = OCFS2_LOCAL_ALLOC(alloc);
  778. int i;
  779. alloc->id1.bitmap1.i_total = 0;
  780. alloc->id1.bitmap1.i_used = 0;
  781. la->la_bm_off = 0;
  782. for(i = 0; i < le16_to_cpu(la->la_size); i++)
  783. la->la_bitmap[i] = 0;
  784. }
  785. #if 0
  786. /* turn this on and uncomment below to aid debugging window shifts. */
  787. static void ocfs2_verify_zero_bits(unsigned long *bitmap,
  788. unsigned int start,
  789. unsigned int count)
  790. {
  791. unsigned int tmp = count;
  792. while(tmp--) {
  793. if (ocfs2_test_bit(start + tmp, bitmap)) {
  794. printk("ocfs2_verify_zero_bits: start = %u, count = "
  795. "%u\n", start, count);
  796. printk("ocfs2_verify_zero_bits: bit %u is set!",
  797. start + tmp);
  798. BUG();
  799. }
  800. }
  801. }
  802. #endif
  803. /*
  804. * sync the local alloc to main bitmap.
  805. *
  806. * assumes you've already locked the main bitmap -- the bitmap inode
  807. * passed is used for caching.
  808. */
  809. static int ocfs2_sync_local_to_main(struct ocfs2_super *osb,
  810. handle_t *handle,
  811. struct ocfs2_dinode *alloc,
  812. struct inode *main_bm_inode,
  813. struct buffer_head *main_bm_bh)
  814. {
  815. int status = 0;
  816. int bit_off, left, count, start;
  817. u64 la_start_blk;
  818. u64 blkno;
  819. void *bitmap;
  820. struct ocfs2_local_alloc *la = OCFS2_LOCAL_ALLOC(alloc);
  821. trace_ocfs2_sync_local_to_main(
  822. le32_to_cpu(alloc->id1.bitmap1.i_total),
  823. le32_to_cpu(alloc->id1.bitmap1.i_used));
  824. if (!alloc->id1.bitmap1.i_total) {
  825. goto bail;
  826. }
  827. if (le32_to_cpu(alloc->id1.bitmap1.i_used) ==
  828. le32_to_cpu(alloc->id1.bitmap1.i_total)) {
  829. goto bail;
  830. }
  831. la_start_blk = ocfs2_clusters_to_blocks(osb->sb,
  832. le32_to_cpu(la->la_bm_off));
  833. bitmap = la->la_bitmap;
  834. start = count = bit_off = 0;
  835. left = le32_to_cpu(alloc->id1.bitmap1.i_total);
  836. while ((bit_off = ocfs2_find_next_zero_bit(bitmap, left, start))
  837. != -1) {
  838. if ((bit_off < left) && (bit_off == start)) {
  839. count++;
  840. start++;
  841. continue;
  842. }
  843. if (count) {
  844. blkno = la_start_blk +
  845. ocfs2_clusters_to_blocks(osb->sb,
  846. start - count);
  847. trace_ocfs2_sync_local_to_main_free(
  848. count, start - count,
  849. (unsigned long long)la_start_blk,
  850. (unsigned long long)blkno);
  851. status = ocfs2_release_clusters(handle,
  852. main_bm_inode,
  853. main_bm_bh, blkno,
  854. count);
  855. if (status < 0) {
  856. mlog_errno(status);
  857. goto bail;
  858. }
  859. }
  860. if (bit_off >= left)
  861. break;
  862. count = 1;
  863. start = bit_off + 1;
  864. }
  865. bail:
  866. if (status)
  867. mlog_errno(status);
  868. return status;
  869. }
  870. enum ocfs2_la_event {
  871. OCFS2_LA_EVENT_SLIDE, /* Normal window slide. */
  872. OCFS2_LA_EVENT_FRAGMENTED, /* The global bitmap has
  873. * enough bits theoretically
  874. * free, but a contiguous
  875. * allocation could not be
  876. * found. */
  877. OCFS2_LA_EVENT_ENOSPC, /* Global bitmap doesn't have
  878. * enough bits free to satisfy
  879. * our request. */
  880. };
  881. #define OCFS2_LA_ENABLE_INTERVAL (30 * HZ)
  882. /*
  883. * Given an event, calculate the size of our next local alloc window.
  884. *
  885. * This should always be called under i_mutex of the local alloc inode
  886. * so that local alloc disabling doesn't race with processes trying to
  887. * use the allocator.
  888. *
  889. * Returns the state which the local alloc was left in. This value can
  890. * be ignored by some paths.
  891. */
  892. static int ocfs2_recalc_la_window(struct ocfs2_super *osb,
  893. enum ocfs2_la_event event)
  894. {
  895. unsigned int bits;
  896. int state;
  897. spin_lock(&osb->osb_lock);
  898. if (osb->local_alloc_state == OCFS2_LA_DISABLED) {
  899. WARN_ON_ONCE(osb->local_alloc_state == OCFS2_LA_DISABLED);
  900. goto out_unlock;
  901. }
  902. /*
  903. * ENOSPC and fragmentation are treated similarly for now.
  904. */
  905. if (event == OCFS2_LA_EVENT_ENOSPC ||
  906. event == OCFS2_LA_EVENT_FRAGMENTED) {
  907. /*
  908. * We ran out of contiguous space in the primary
  909. * bitmap. Drastically reduce the number of bits used
  910. * by local alloc until we have to disable it.
  911. */
  912. bits = osb->local_alloc_bits >> 1;
  913. if (bits > ocfs2_megabytes_to_clusters(osb->sb, 1)) {
  914. /*
  915. * By setting state to THROTTLED, we'll keep
  916. * the number of local alloc bits used down
  917. * until an event occurs which would give us
  918. * reason to assume the bitmap situation might
  919. * have changed.
  920. */
  921. osb->local_alloc_state = OCFS2_LA_THROTTLED;
  922. osb->local_alloc_bits = bits;
  923. } else {
  924. osb->local_alloc_state = OCFS2_LA_DISABLED;
  925. }
  926. queue_delayed_work(osb->ocfs2_wq, &osb->la_enable_wq,
  927. OCFS2_LA_ENABLE_INTERVAL);
  928. goto out_unlock;
  929. }
  930. /*
  931. * Don't increase the size of the local alloc window until we
  932. * know we might be able to fulfill the request. Otherwise, we
  933. * risk bouncing around the global bitmap during periods of
  934. * low space.
  935. */
  936. if (osb->local_alloc_state != OCFS2_LA_THROTTLED)
  937. osb->local_alloc_bits = osb->local_alloc_default_bits;
  938. out_unlock:
  939. state = osb->local_alloc_state;
  940. spin_unlock(&osb->osb_lock);
  941. return state;
  942. }
  943. static int ocfs2_local_alloc_reserve_for_window(struct ocfs2_super *osb,
  944. struct ocfs2_alloc_context **ac,
  945. struct inode **bitmap_inode,
  946. struct buffer_head **bitmap_bh)
  947. {
  948. int status;
  949. *ac = kzalloc(sizeof(struct ocfs2_alloc_context), GFP_KERNEL);
  950. if (!(*ac)) {
  951. status = -ENOMEM;
  952. mlog_errno(status);
  953. goto bail;
  954. }
  955. retry_enospc:
  956. (*ac)->ac_bits_wanted = osb->local_alloc_bits;
  957. status = ocfs2_reserve_cluster_bitmap_bits(osb, *ac);
  958. if (status == -ENOSPC) {
  959. if (ocfs2_recalc_la_window(osb, OCFS2_LA_EVENT_ENOSPC) ==
  960. OCFS2_LA_DISABLED)
  961. goto bail;
  962. ocfs2_free_ac_resource(*ac);
  963. memset(*ac, 0, sizeof(struct ocfs2_alloc_context));
  964. goto retry_enospc;
  965. }
  966. if (status < 0) {
  967. mlog_errno(status);
  968. goto bail;
  969. }
  970. *bitmap_inode = (*ac)->ac_inode;
  971. igrab(*bitmap_inode);
  972. *bitmap_bh = (*ac)->ac_bh;
  973. get_bh(*bitmap_bh);
  974. status = 0;
  975. bail:
  976. if ((status < 0) && *ac) {
  977. ocfs2_free_alloc_context(*ac);
  978. *ac = NULL;
  979. }
  980. if (status)
  981. mlog_errno(status);
  982. return status;
  983. }
  984. /*
  985. * pass it the bitmap lock in lock_bh if you have it.
  986. */
  987. static int ocfs2_local_alloc_new_window(struct ocfs2_super *osb,
  988. handle_t *handle,
  989. struct ocfs2_alloc_context *ac)
  990. {
  991. int status = 0;
  992. u32 cluster_off, cluster_count;
  993. struct ocfs2_dinode *alloc = NULL;
  994. struct ocfs2_local_alloc *la;
  995. alloc = (struct ocfs2_dinode *) osb->local_alloc_bh->b_data;
  996. la = OCFS2_LOCAL_ALLOC(alloc);
  997. trace_ocfs2_local_alloc_new_window(
  998. le32_to_cpu(alloc->id1.bitmap1.i_total),
  999. osb->local_alloc_bits);
  1000. /* Instruct the allocation code to try the most recently used
  1001. * cluster group. We'll re-record the group used this pass
  1002. * below. */
  1003. ac->ac_last_group = osb->la_last_gd;
  1004. /* we used the generic suballoc reserve function, but we set
  1005. * everything up nicely, so there's no reason why we can't use
  1006. * the more specific cluster api to claim bits. */
  1007. status = ocfs2_claim_clusters(handle, ac, osb->local_alloc_bits,
  1008. &cluster_off, &cluster_count);
  1009. if (status == -ENOSPC) {
  1010. retry_enospc:
  1011. /*
  1012. * Note: We could also try syncing the journal here to
  1013. * allow use of any free bits which the current
  1014. * transaction can't give us access to. --Mark
  1015. */
  1016. if (ocfs2_recalc_la_window(osb, OCFS2_LA_EVENT_FRAGMENTED) ==
  1017. OCFS2_LA_DISABLED)
  1018. goto bail;
  1019. ac->ac_bits_wanted = osb->local_alloc_bits;
  1020. status = ocfs2_claim_clusters(handle, ac,
  1021. osb->local_alloc_bits,
  1022. &cluster_off,
  1023. &cluster_count);
  1024. if (status == -ENOSPC)
  1025. goto retry_enospc;
  1026. /*
  1027. * We only shrunk the *minimum* number of in our
  1028. * request - it's entirely possible that the allocator
  1029. * might give us more than we asked for.
  1030. */
  1031. if (status == 0) {
  1032. spin_lock(&osb->osb_lock);
  1033. osb->local_alloc_bits = cluster_count;
  1034. spin_unlock(&osb->osb_lock);
  1035. }
  1036. }
  1037. if (status < 0) {
  1038. if (status != -ENOSPC)
  1039. mlog_errno(status);
  1040. goto bail;
  1041. }
  1042. osb->la_last_gd = ac->ac_last_group;
  1043. la->la_bm_off = cpu_to_le32(cluster_off);
  1044. alloc->id1.bitmap1.i_total = cpu_to_le32(cluster_count);
  1045. /* just in case... In the future when we find space ourselves,
  1046. * we don't have to get all contiguous -- but we'll have to
  1047. * set all previously used bits in bitmap and update
  1048. * la_bits_set before setting the bits in the main bitmap. */
  1049. alloc->id1.bitmap1.i_used = 0;
  1050. memset(OCFS2_LOCAL_ALLOC(alloc)->la_bitmap, 0,
  1051. le16_to_cpu(la->la_size));
  1052. ocfs2_resmap_restart(&osb->osb_la_resmap, cluster_count,
  1053. OCFS2_LOCAL_ALLOC(alloc)->la_bitmap);
  1054. trace_ocfs2_local_alloc_new_window_result(
  1055. OCFS2_LOCAL_ALLOC(alloc)->la_bm_off,
  1056. le32_to_cpu(alloc->id1.bitmap1.i_total));
  1057. bail:
  1058. if (status)
  1059. mlog_errno(status);
  1060. return status;
  1061. }
  1062. /* Note that we do *NOT* lock the local alloc inode here as
  1063. * it's been locked already for us. */
  1064. static int ocfs2_local_alloc_slide_window(struct ocfs2_super *osb,
  1065. struct inode *local_alloc_inode)
  1066. {
  1067. int status = 0;
  1068. struct buffer_head *main_bm_bh = NULL;
  1069. struct inode *main_bm_inode = NULL;
  1070. handle_t *handle = NULL;
  1071. struct ocfs2_dinode *alloc;
  1072. struct ocfs2_dinode *alloc_copy = NULL;
  1073. struct ocfs2_alloc_context *ac = NULL;
  1074. ocfs2_recalc_la_window(osb, OCFS2_LA_EVENT_SLIDE);
  1075. /* This will lock the main bitmap for us. */
  1076. status = ocfs2_local_alloc_reserve_for_window(osb,
  1077. &ac,
  1078. &main_bm_inode,
  1079. &main_bm_bh);
  1080. if (status < 0) {
  1081. if (status != -ENOSPC)
  1082. mlog_errno(status);
  1083. goto bail;
  1084. }
  1085. handle = ocfs2_start_trans(osb, OCFS2_WINDOW_MOVE_CREDITS);
  1086. if (IS_ERR(handle)) {
  1087. status = PTR_ERR(handle);
  1088. handle = NULL;
  1089. mlog_errno(status);
  1090. goto bail;
  1091. }
  1092. alloc = (struct ocfs2_dinode *) osb->local_alloc_bh->b_data;
  1093. /* We want to clear the local alloc before doing anything
  1094. * else, so that if we error later during this operation,
  1095. * local alloc shutdown won't try to double free main bitmap
  1096. * bits. Make a copy so the sync function knows which bits to
  1097. * free. */
  1098. alloc_copy = kmalloc(osb->local_alloc_bh->b_size, GFP_NOFS);
  1099. if (!alloc_copy) {
  1100. status = -ENOMEM;
  1101. mlog_errno(status);
  1102. goto bail;
  1103. }
  1104. memcpy(alloc_copy, alloc, osb->local_alloc_bh->b_size);
  1105. status = ocfs2_journal_access_di(handle,
  1106. INODE_CACHE(local_alloc_inode),
  1107. osb->local_alloc_bh,
  1108. OCFS2_JOURNAL_ACCESS_WRITE);
  1109. if (status < 0) {
  1110. mlog_errno(status);
  1111. goto bail;
  1112. }
  1113. ocfs2_clear_local_alloc(alloc);
  1114. ocfs2_journal_dirty(handle, osb->local_alloc_bh);
  1115. status = ocfs2_sync_local_to_main(osb, handle, alloc_copy,
  1116. main_bm_inode, main_bm_bh);
  1117. if (status < 0) {
  1118. mlog_errno(status);
  1119. goto bail;
  1120. }
  1121. status = ocfs2_local_alloc_new_window(osb, handle, ac);
  1122. if (status < 0) {
  1123. if (status != -ENOSPC)
  1124. mlog_errno(status);
  1125. goto bail;
  1126. }
  1127. atomic_inc(&osb->alloc_stats.moves);
  1128. bail:
  1129. if (handle)
  1130. ocfs2_commit_trans(osb, handle);
  1131. brelse(main_bm_bh);
  1132. iput(main_bm_inode);
  1133. kfree(alloc_copy);
  1134. if (ac)
  1135. ocfs2_free_alloc_context(ac);
  1136. if (status)
  1137. mlog_errno(status);
  1138. return status;
  1139. }