Loading...
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 * suballoc.c
6 *
7 * metadata alloc and free
8 * Inspired by ext3 block groups.
9 *
10 * Copyright (C) 2002, 2004 Oracle. All rights reserved.
11 */
12
13#include <linux/fs.h>
14#include <linux/types.h>
15#include <linux/slab.h>
16#include <linux/highmem.h>
17
18#include <cluster/masklog.h>
19
20#include "ocfs2.h"
21
22#include "alloc.h"
23#include "blockcheck.h"
24#include "dlmglue.h"
25#include "inode.h"
26#include "journal.h"
27#include "localalloc.h"
28#include "suballoc.h"
29#include "super.h"
30#include "sysfile.h"
31#include "uptodate.h"
32#include "ocfs2_trace.h"
33
34#include "buffer_head_io.h"
35
36#define NOT_ALLOC_NEW_GROUP 0
37#define ALLOC_NEW_GROUP 0x1
38#define ALLOC_GROUPS_FROM_GLOBAL 0x2
39
40#define OCFS2_MAX_TO_STEAL 1024
41
42struct ocfs2_suballoc_result {
43 u64 sr_bg_blkno; /* The bg we allocated from. Set
44 to 0 when a block group is
45 contiguous. */
46 u64 sr_bg_stable_blkno; /*
47 * Doesn't change, always
48 * set to target block
49 * group descriptor
50 * block.
51 */
52 u64 sr_blkno; /* The first allocated block */
53 unsigned int sr_bit_offset; /* The bit in the bg */
54 unsigned int sr_bits; /* How many bits we claimed */
55};
56
57static u64 ocfs2_group_from_res(struct ocfs2_suballoc_result *res)
58{
59 if (res->sr_blkno == 0)
60 return 0;
61
62 if (res->sr_bg_blkno)
63 return res->sr_bg_blkno;
64
65 return ocfs2_which_suballoc_group(res->sr_blkno, res->sr_bit_offset);
66}
67
68static inline u16 ocfs2_find_victim_chain(struct ocfs2_chain_list *cl);
69static int ocfs2_block_group_fill(handle_t *handle,
70 struct inode *alloc_inode,
71 struct buffer_head *bg_bh,
72 u64 group_blkno,
73 unsigned int group_clusters,
74 u16 my_chain,
75 struct ocfs2_chain_list *cl);
76static int ocfs2_block_group_alloc(struct ocfs2_super *osb,
77 struct inode *alloc_inode,
78 struct buffer_head *bh,
79 u64 max_block,
80 u64 *last_alloc_group,
81 int flags);
82
83static int ocfs2_cluster_group_search(struct inode *inode,
84 struct buffer_head *group_bh,
85 u32 bits_wanted, u32 min_bits,
86 u64 max_block,
87 struct ocfs2_suballoc_result *res);
88static int ocfs2_block_group_search(struct inode *inode,
89 struct buffer_head *group_bh,
90 u32 bits_wanted, u32 min_bits,
91 u64 max_block,
92 struct ocfs2_suballoc_result *res);
93static int ocfs2_claim_suballoc_bits(struct ocfs2_alloc_context *ac,
94 handle_t *handle,
95 u32 bits_wanted,
96 u32 min_bits,
97 struct ocfs2_suballoc_result *res);
98static int ocfs2_test_bg_bit_allocatable(struct buffer_head *bg_bh,
99 int nr);
100static int ocfs2_relink_block_group(handle_t *handle,
101 struct inode *alloc_inode,
102 struct buffer_head *fe_bh,
103 struct buffer_head *bg_bh,
104 struct buffer_head *prev_bg_bh,
105 u16 chain);
106static inline int ocfs2_block_group_reasonably_empty(struct ocfs2_group_desc *bg,
107 u32 wanted);
108static inline u32 ocfs2_desc_bitmap_to_cluster_off(struct inode *inode,
109 u64 bg_blkno,
110 u16 bg_bit_off);
111static inline void ocfs2_block_to_cluster_group(struct inode *inode,
112 u64 data_blkno,
113 u64 *bg_blkno,
114 u16 *bg_bit_off);
115static int ocfs2_reserve_clusters_with_limit(struct ocfs2_super *osb,
116 u32 bits_wanted, u64 max_block,
117 int flags,
118 struct ocfs2_alloc_context **ac);
119
120void ocfs2_free_ac_resource(struct ocfs2_alloc_context *ac)
121{
122 struct inode *inode = ac->ac_inode;
123
124 if (inode) {
125 if (ac->ac_which != OCFS2_AC_USE_LOCAL)
126 ocfs2_inode_unlock(inode, 1);
127
128 inode_unlock(inode);
129
130 iput(inode);
131 ac->ac_inode = NULL;
132 }
133 brelse(ac->ac_bh);
134 ac->ac_bh = NULL;
135 ac->ac_resv = NULL;
136 kfree(ac->ac_find_loc_priv);
137 ac->ac_find_loc_priv = NULL;
138}
139
140void ocfs2_free_alloc_context(struct ocfs2_alloc_context *ac)
141{
142 ocfs2_free_ac_resource(ac);
143 kfree(ac);
144}
145
146static u32 ocfs2_bits_per_group(struct ocfs2_chain_list *cl)
147{
148 return (u32)le16_to_cpu(cl->cl_cpg) * (u32)le16_to_cpu(cl->cl_bpc);
149}
150
151#define do_error(fmt, ...) \
152do { \
153 if (resize) \
154 mlog(ML_ERROR, fmt, ##__VA_ARGS__); \
155 else \
156 return ocfs2_error(sb, fmt, ##__VA_ARGS__); \
157} while (0)
158
159static int ocfs2_validate_gd_self(struct super_block *sb,
160 struct buffer_head *bh,
161 int resize)
162{
163 struct ocfs2_group_desc *gd = (struct ocfs2_group_desc *)bh->b_data;
164
165 if (!OCFS2_IS_VALID_GROUP_DESC(gd)) {
166 do_error("Group descriptor #%llu has bad signature %.*s\n",
167 (unsigned long long)bh->b_blocknr, 7,
168 gd->bg_signature);
169 }
170
171 if (le64_to_cpu(gd->bg_blkno) != bh->b_blocknr) {
172 do_error("Group descriptor #%llu has an invalid bg_blkno of %llu\n",
173 (unsigned long long)bh->b_blocknr,
174 (unsigned long long)le64_to_cpu(gd->bg_blkno));
175 }
176
177 if (le32_to_cpu(gd->bg_generation) != OCFS2_SB(sb)->fs_generation) {
178 do_error("Group descriptor #%llu has an invalid fs_generation of #%u\n",
179 (unsigned long long)bh->b_blocknr,
180 le32_to_cpu(gd->bg_generation));
181 }
182
183 if (le16_to_cpu(gd->bg_free_bits_count) > le16_to_cpu(gd->bg_bits)) {
184 do_error("Group descriptor #%llu has bit count %u but claims that %u are free\n",
185 (unsigned long long)bh->b_blocknr,
186 le16_to_cpu(gd->bg_bits),
187 le16_to_cpu(gd->bg_free_bits_count));
188 }
189
190 if (le16_to_cpu(gd->bg_bits) > (8 * le16_to_cpu(gd->bg_size))) {
191 do_error("Group descriptor #%llu has bit count %u but max bitmap bits of %u\n",
192 (unsigned long long)bh->b_blocknr,
193 le16_to_cpu(gd->bg_bits),
194 8 * le16_to_cpu(gd->bg_size));
195 }
196
197 return 0;
198}
199
200static int ocfs2_validate_gd_parent(struct super_block *sb,
201 struct ocfs2_dinode *di,
202 struct buffer_head *bh,
203 int resize)
204{
205 unsigned int max_bits;
206 struct ocfs2_group_desc *gd = (struct ocfs2_group_desc *)bh->b_data;
207
208 if (di->i_blkno != gd->bg_parent_dinode) {
209 do_error("Group descriptor #%llu has bad parent pointer (%llu, expected %llu)\n",
210 (unsigned long long)bh->b_blocknr,
211 (unsigned long long)le64_to_cpu(gd->bg_parent_dinode),
212 (unsigned long long)le64_to_cpu(di->i_blkno));
213 }
214
215 max_bits = le16_to_cpu(di->id2.i_chain.cl_cpg) * le16_to_cpu(di->id2.i_chain.cl_bpc);
216 if (le16_to_cpu(gd->bg_bits) > max_bits) {
217 do_error("Group descriptor #%llu has bit count of %u\n",
218 (unsigned long long)bh->b_blocknr,
219 le16_to_cpu(gd->bg_bits));
220 }
221
222 /* In resize, we may meet the case bg_chain == cl_next_free_rec. */
223 if ((le16_to_cpu(gd->bg_chain) >
224 le16_to_cpu(di->id2.i_chain.cl_next_free_rec)) ||
225 ((le16_to_cpu(gd->bg_chain) ==
226 le16_to_cpu(di->id2.i_chain.cl_next_free_rec)) && !resize)) {
227 do_error("Group descriptor #%llu has bad chain %u\n",
228 (unsigned long long)bh->b_blocknr,
229 le16_to_cpu(gd->bg_chain));
230 }
231
232 return 0;
233}
234
235#undef do_error
236
237/*
238 * This version only prints errors. It does not fail the filesystem, and
239 * exists only for resize.
240 */
241int ocfs2_check_group_descriptor(struct super_block *sb,
242 struct ocfs2_dinode *di,
243 struct buffer_head *bh)
244{
245 int rc;
246 struct ocfs2_group_desc *gd = (struct ocfs2_group_desc *)bh->b_data;
247
248 BUG_ON(!buffer_uptodate(bh));
249
250 /*
251 * If the ecc fails, we return the error but otherwise
252 * leave the filesystem running. We know any error is
253 * local to this block.
254 */
255 rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &gd->bg_check);
256 if (rc) {
257 mlog(ML_ERROR,
258 "Checksum failed for group descriptor %llu\n",
259 (unsigned long long)bh->b_blocknr);
260 } else
261 rc = ocfs2_validate_gd_self(sb, bh, 1);
262 if (!rc)
263 rc = ocfs2_validate_gd_parent(sb, di, bh, 1);
264
265 return rc;
266}
267
268static int ocfs2_validate_group_descriptor(struct super_block *sb,
269 struct buffer_head *bh)
270{
271 int rc;
272 struct ocfs2_group_desc *gd = (struct ocfs2_group_desc *)bh->b_data;
273
274 trace_ocfs2_validate_group_descriptor(
275 (unsigned long long)bh->b_blocknr);
276
277 BUG_ON(!buffer_uptodate(bh));
278
279 /*
280 * If the ecc fails, we return the error but otherwise
281 * leave the filesystem running. We know any error is
282 * local to this block.
283 */
284 rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &gd->bg_check);
285 if (rc)
286 return rc;
287
288 /*
289 * Errors after here are fatal.
290 */
291
292 return ocfs2_validate_gd_self(sb, bh, 0);
293}
294
295int ocfs2_read_group_descriptor(struct inode *inode, struct ocfs2_dinode *di,
296 u64 gd_blkno, struct buffer_head **bh)
297{
298 int rc;
299 struct buffer_head *tmp = *bh;
300
301 rc = ocfs2_read_block(INODE_CACHE(inode), gd_blkno, &tmp,
302 ocfs2_validate_group_descriptor);
303 if (rc)
304 goto out;
305
306 rc = ocfs2_validate_gd_parent(inode->i_sb, di, tmp, 0);
307 if (rc) {
308 brelse(tmp);
309 goto out;
310 }
311
312 /* If ocfs2_read_block() got us a new bh, pass it up. */
313 if (!*bh)
314 *bh = tmp;
315
316out:
317 return rc;
318}
319
320static void ocfs2_bg_discontig_add_extent(struct ocfs2_super *osb,
321 struct ocfs2_group_desc *bg,
322 struct ocfs2_chain_list *cl,
323 u64 p_blkno, unsigned int clusters)
324{
325 struct ocfs2_extent_list *el = &bg->bg_list;
326 struct ocfs2_extent_rec *rec;
327
328 BUG_ON(!ocfs2_supports_discontig_bg(osb));
329 if (!el->l_next_free_rec)
330 el->l_count = cpu_to_le16(ocfs2_extent_recs_per_gd(osb->sb));
331 rec = &el->l_recs[le16_to_cpu(el->l_next_free_rec)];
332 rec->e_blkno = cpu_to_le64(p_blkno);
333 rec->e_cpos = cpu_to_le32(le16_to_cpu(bg->bg_bits) /
334 le16_to_cpu(cl->cl_bpc));
335 rec->e_leaf_clusters = cpu_to_le16(clusters);
336 le16_add_cpu(&bg->bg_bits, clusters * le16_to_cpu(cl->cl_bpc));
337 le16_add_cpu(&bg->bg_free_bits_count,
338 clusters * le16_to_cpu(cl->cl_bpc));
339 le16_add_cpu(&el->l_next_free_rec, 1);
340}
341
342static int ocfs2_block_group_fill(handle_t *handle,
343 struct inode *alloc_inode,
344 struct buffer_head *bg_bh,
345 u64 group_blkno,
346 unsigned int group_clusters,
347 u16 my_chain,
348 struct ocfs2_chain_list *cl)
349{
350 int status = 0;
351 struct ocfs2_super *osb = OCFS2_SB(alloc_inode->i_sb);
352 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
353 struct super_block * sb = alloc_inode->i_sb;
354
355 if (((unsigned long long) bg_bh->b_blocknr) != group_blkno) {
356 status = ocfs2_error(alloc_inode->i_sb,
357 "group block (%llu) != b_blocknr (%llu)\n",
358 (unsigned long long)group_blkno,
359 (unsigned long long) bg_bh->b_blocknr);
360 goto bail;
361 }
362
363 status = ocfs2_journal_access_gd(handle,
364 INODE_CACHE(alloc_inode),
365 bg_bh,
366 OCFS2_JOURNAL_ACCESS_CREATE);
367 if (status < 0) {
368 mlog_errno(status);
369 goto bail;
370 }
371
372 memset(bg, 0, sb->s_blocksize);
373 strcpy(bg->bg_signature, OCFS2_GROUP_DESC_SIGNATURE);
374 bg->bg_generation = cpu_to_le32(osb->fs_generation);
375 bg->bg_size = cpu_to_le16(ocfs2_group_bitmap_size(sb, 1,
376 osb->s_feature_incompat));
377 bg->bg_chain = cpu_to_le16(my_chain);
378 bg->bg_next_group = cl->cl_recs[my_chain].c_blkno;
379 bg->bg_parent_dinode = cpu_to_le64(OCFS2_I(alloc_inode)->ip_blkno);
380 bg->bg_blkno = cpu_to_le64(group_blkno);
381 if (group_clusters == le16_to_cpu(cl->cl_cpg))
382 bg->bg_bits = cpu_to_le16(ocfs2_bits_per_group(cl));
383 else
384 ocfs2_bg_discontig_add_extent(osb, bg, cl, group_blkno,
385 group_clusters);
386
387 /* set the 1st bit in the bitmap to account for the descriptor block */
388 ocfs2_set_bit(0, (unsigned long *)bg->bg_bitmap);
389 bg->bg_free_bits_count = cpu_to_le16(le16_to_cpu(bg->bg_bits) - 1);
390
391 ocfs2_journal_dirty(handle, bg_bh);
392
393 /* There is no need to zero out or otherwise initialize the
394 * other blocks in a group - All valid FS metadata in a block
395 * group stores the superblock fs_generation value at
396 * allocation time. */
397
398bail:
399 if (status)
400 mlog_errno(status);
401 return status;
402}
403
404static inline u16 ocfs2_find_smallest_chain(struct ocfs2_chain_list *cl)
405{
406 u16 curr, best;
407
408 best = curr = 0;
409 while (curr < le16_to_cpu(cl->cl_count)) {
410 if (le32_to_cpu(cl->cl_recs[best].c_total) >
411 le32_to_cpu(cl->cl_recs[curr].c_total))
412 best = curr;
413 curr++;
414 }
415 return best;
416}
417
418static struct buffer_head *
419ocfs2_block_group_alloc_contig(struct ocfs2_super *osb, handle_t *handle,
420 struct inode *alloc_inode,
421 struct ocfs2_alloc_context *ac,
422 struct ocfs2_chain_list *cl)
423{
424 int status;
425 u32 bit_off, num_bits;
426 u64 bg_blkno;
427 struct buffer_head *bg_bh;
428 unsigned int alloc_rec = ocfs2_find_smallest_chain(cl);
429
430 status = ocfs2_claim_clusters(handle, ac,
431 le16_to_cpu(cl->cl_cpg), &bit_off,
432 &num_bits);
433 if (status < 0) {
434 if (status != -ENOSPC)
435 mlog_errno(status);
436 goto bail;
437 }
438
439 /* setup the group */
440 bg_blkno = ocfs2_clusters_to_blocks(osb->sb, bit_off);
441 trace_ocfs2_block_group_alloc_contig(
442 (unsigned long long)bg_blkno, alloc_rec);
443
444 bg_bh = sb_getblk(osb->sb, bg_blkno);
445 if (!bg_bh) {
446 status = -ENOMEM;
447 mlog_errno(status);
448 goto bail;
449 }
450 ocfs2_set_new_buffer_uptodate(INODE_CACHE(alloc_inode), bg_bh);
451
452 status = ocfs2_block_group_fill(handle, alloc_inode, bg_bh,
453 bg_blkno, num_bits, alloc_rec, cl);
454 if (status < 0) {
455 brelse(bg_bh);
456 mlog_errno(status);
457 }
458
459bail:
460 return status ? ERR_PTR(status) : bg_bh;
461}
462
463static int ocfs2_block_group_claim_bits(struct ocfs2_super *osb,
464 handle_t *handle,
465 struct ocfs2_alloc_context *ac,
466 unsigned int min_bits,
467 u32 *bit_off, u32 *num_bits)
468{
469 int status = 0;
470
471 while (min_bits) {
472 status = ocfs2_claim_clusters(handle, ac, min_bits,
473 bit_off, num_bits);
474 if (status != -ENOSPC)
475 break;
476
477 min_bits >>= 1;
478 }
479
480 return status;
481}
482
483static int ocfs2_block_group_grow_discontig(handle_t *handle,
484 struct inode *alloc_inode,
485 struct buffer_head *bg_bh,
486 struct ocfs2_alloc_context *ac,
487 struct ocfs2_chain_list *cl,
488 unsigned int min_bits)
489{
490 int status;
491 struct ocfs2_super *osb = OCFS2_SB(alloc_inode->i_sb);
492 struct ocfs2_group_desc *bg =
493 (struct ocfs2_group_desc *)bg_bh->b_data;
494 unsigned int needed = le16_to_cpu(cl->cl_cpg) -
495 le16_to_cpu(bg->bg_bits) / le16_to_cpu(cl->cl_bpc);
496 u32 p_cpos, clusters;
497 u64 p_blkno;
498 struct ocfs2_extent_list *el = &bg->bg_list;
499
500 status = ocfs2_journal_access_gd(handle,
501 INODE_CACHE(alloc_inode),
502 bg_bh,
503 OCFS2_JOURNAL_ACCESS_CREATE);
504 if (status < 0) {
505 mlog_errno(status);
506 goto bail;
507 }
508
509 while ((needed > 0) && (le16_to_cpu(el->l_next_free_rec) <
510 le16_to_cpu(el->l_count))) {
511 if (min_bits > needed)
512 min_bits = needed;
513 status = ocfs2_block_group_claim_bits(osb, handle, ac,
514 min_bits, &p_cpos,
515 &clusters);
516 if (status < 0) {
517 if (status != -ENOSPC)
518 mlog_errno(status);
519 goto bail;
520 }
521 p_blkno = ocfs2_clusters_to_blocks(osb->sb, p_cpos);
522 ocfs2_bg_discontig_add_extent(osb, bg, cl, p_blkno,
523 clusters);
524
525 min_bits = clusters;
526 needed = le16_to_cpu(cl->cl_cpg) -
527 le16_to_cpu(bg->bg_bits) / le16_to_cpu(cl->cl_bpc);
528 }
529
530 if (needed > 0) {
531 /*
532 * We have used up all the extent rec but can't fill up
533 * the cpg. So bail out.
534 */
535 status = -ENOSPC;
536 goto bail;
537 }
538
539 ocfs2_journal_dirty(handle, bg_bh);
540
541bail:
542 return status;
543}
544
545static void ocfs2_bg_alloc_cleanup(handle_t *handle,
546 struct ocfs2_alloc_context *cluster_ac,
547 struct inode *alloc_inode,
548 struct buffer_head *bg_bh)
549{
550 int i, ret;
551 struct ocfs2_group_desc *bg;
552 struct ocfs2_extent_list *el;
553 struct ocfs2_extent_rec *rec;
554
555 if (!bg_bh)
556 return;
557
558 bg = (struct ocfs2_group_desc *)bg_bh->b_data;
559 el = &bg->bg_list;
560 for (i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) {
561 rec = &el->l_recs[i];
562 ret = ocfs2_free_clusters(handle, cluster_ac->ac_inode,
563 cluster_ac->ac_bh,
564 le64_to_cpu(rec->e_blkno),
565 le16_to_cpu(rec->e_leaf_clusters));
566 if (ret)
567 mlog_errno(ret);
568 /* Try all the clusters to free */
569 }
570
571 ocfs2_remove_from_cache(INODE_CACHE(alloc_inode), bg_bh);
572 brelse(bg_bh);
573}
574
575static struct buffer_head *
576ocfs2_block_group_alloc_discontig(handle_t *handle,
577 struct inode *alloc_inode,
578 struct ocfs2_alloc_context *ac,
579 struct ocfs2_chain_list *cl)
580{
581 int status;
582 u32 bit_off, num_bits;
583 u64 bg_blkno;
584 unsigned int min_bits = le16_to_cpu(cl->cl_cpg) >> 1;
585 struct buffer_head *bg_bh = NULL;
586 unsigned int alloc_rec = ocfs2_find_smallest_chain(cl);
587 struct ocfs2_super *osb = OCFS2_SB(alloc_inode->i_sb);
588
589 if (!ocfs2_supports_discontig_bg(osb)) {
590 status = -ENOSPC;
591 goto bail;
592 }
593
594 status = ocfs2_extend_trans(handle,
595 ocfs2_calc_bg_discontig_credits(osb->sb));
596 if (status) {
597 mlog_errno(status);
598 goto bail;
599 }
600
601 /*
602 * We're going to be grabbing from multiple cluster groups.
603 * We don't have enough credits to relink them all, and the
604 * cluster groups will be staying in cache for the duration of
605 * this operation.
606 */
607 ac->ac_disable_chain_relink = 1;
608
609 /* Claim the first region */
610 status = ocfs2_block_group_claim_bits(osb, handle, ac, min_bits,
611 &bit_off, &num_bits);
612 if (status < 0) {
613 if (status != -ENOSPC)
614 mlog_errno(status);
615 goto bail;
616 }
617 min_bits = num_bits;
618
619 /* setup the group */
620 bg_blkno = ocfs2_clusters_to_blocks(osb->sb, bit_off);
621 trace_ocfs2_block_group_alloc_discontig(
622 (unsigned long long)bg_blkno, alloc_rec);
623
624 bg_bh = sb_getblk(osb->sb, bg_blkno);
625 if (!bg_bh) {
626 status = -ENOMEM;
627 mlog_errno(status);
628 goto bail;
629 }
630 ocfs2_set_new_buffer_uptodate(INODE_CACHE(alloc_inode), bg_bh);
631
632 status = ocfs2_block_group_fill(handle, alloc_inode, bg_bh,
633 bg_blkno, num_bits, alloc_rec, cl);
634 if (status < 0) {
635 mlog_errno(status);
636 goto bail;
637 }
638
639 status = ocfs2_block_group_grow_discontig(handle, alloc_inode,
640 bg_bh, ac, cl, min_bits);
641 if (status)
642 mlog_errno(status);
643
644bail:
645 if (status)
646 ocfs2_bg_alloc_cleanup(handle, ac, alloc_inode, bg_bh);
647 return status ? ERR_PTR(status) : bg_bh;
648}
649
650/*
651 * We expect the block group allocator to already be locked.
652 */
653static int ocfs2_block_group_alloc(struct ocfs2_super *osb,
654 struct inode *alloc_inode,
655 struct buffer_head *bh,
656 u64 max_block,
657 u64 *last_alloc_group,
658 int flags)
659{
660 int status, credits;
661 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) bh->b_data;
662 struct ocfs2_chain_list *cl;
663 struct ocfs2_alloc_context *ac = NULL;
664 handle_t *handle = NULL;
665 u16 alloc_rec;
666 struct buffer_head *bg_bh = NULL;
667 struct ocfs2_group_desc *bg;
668
669 BUG_ON(ocfs2_is_cluster_bitmap(alloc_inode));
670
671 cl = &fe->id2.i_chain;
672 status = ocfs2_reserve_clusters_with_limit(osb,
673 le16_to_cpu(cl->cl_cpg),
674 max_block, flags, &ac);
675 if (status < 0) {
676 if (status != -ENOSPC)
677 mlog_errno(status);
678 goto bail;
679 }
680
681 credits = ocfs2_calc_group_alloc_credits(osb->sb,
682 le16_to_cpu(cl->cl_cpg));
683 handle = ocfs2_start_trans(osb, credits);
684 if (IS_ERR(handle)) {
685 status = PTR_ERR(handle);
686 handle = NULL;
687 mlog_errno(status);
688 goto bail;
689 }
690
691 if (last_alloc_group && *last_alloc_group != 0) {
692 trace_ocfs2_block_group_alloc(
693 (unsigned long long)*last_alloc_group);
694 ac->ac_last_group = *last_alloc_group;
695 }
696
697 bg_bh = ocfs2_block_group_alloc_contig(osb, handle, alloc_inode,
698 ac, cl);
699 if (IS_ERR(bg_bh) && (PTR_ERR(bg_bh) == -ENOSPC))
700 bg_bh = ocfs2_block_group_alloc_discontig(handle,
701 alloc_inode,
702 ac, cl);
703 if (IS_ERR(bg_bh)) {
704 status = PTR_ERR(bg_bh);
705 bg_bh = NULL;
706 if (status != -ENOSPC)
707 mlog_errno(status);
708 goto bail;
709 }
710 bg = (struct ocfs2_group_desc *) bg_bh->b_data;
711
712 status = ocfs2_journal_access_di(handle, INODE_CACHE(alloc_inode),
713 bh, OCFS2_JOURNAL_ACCESS_WRITE);
714 if (status < 0) {
715 mlog_errno(status);
716 goto bail;
717 }
718
719 alloc_rec = le16_to_cpu(bg->bg_chain);
720 le32_add_cpu(&cl->cl_recs[alloc_rec].c_free,
721 le16_to_cpu(bg->bg_free_bits_count));
722 le32_add_cpu(&cl->cl_recs[alloc_rec].c_total,
723 le16_to_cpu(bg->bg_bits));
724 cl->cl_recs[alloc_rec].c_blkno = bg->bg_blkno;
725 if (le16_to_cpu(cl->cl_next_free_rec) < le16_to_cpu(cl->cl_count))
726 le16_add_cpu(&cl->cl_next_free_rec, 1);
727
728 le32_add_cpu(&fe->id1.bitmap1.i_used, le16_to_cpu(bg->bg_bits) -
729 le16_to_cpu(bg->bg_free_bits_count));
730 le32_add_cpu(&fe->id1.bitmap1.i_total, le16_to_cpu(bg->bg_bits));
731 le32_add_cpu(&fe->i_clusters, le16_to_cpu(cl->cl_cpg));
732
733 ocfs2_journal_dirty(handle, bh);
734
735 spin_lock(&OCFS2_I(alloc_inode)->ip_lock);
736 OCFS2_I(alloc_inode)->ip_clusters = le32_to_cpu(fe->i_clusters);
737 fe->i_size = cpu_to_le64(ocfs2_clusters_to_bytes(alloc_inode->i_sb,
738 le32_to_cpu(fe->i_clusters)));
739 spin_unlock(&OCFS2_I(alloc_inode)->ip_lock);
740 i_size_write(alloc_inode, le64_to_cpu(fe->i_size));
741 alloc_inode->i_blocks = ocfs2_inode_sector_count(alloc_inode);
742 ocfs2_update_inode_fsync_trans(handle, alloc_inode, 0);
743
744 status = 0;
745
746 /* save the new last alloc group so that the caller can cache it. */
747 if (last_alloc_group)
748 *last_alloc_group = ac->ac_last_group;
749
750bail:
751 if (handle)
752 ocfs2_commit_trans(osb, handle);
753
754 if (ac)
755 ocfs2_free_alloc_context(ac);
756
757 brelse(bg_bh);
758
759 if (status)
760 mlog_errno(status);
761 return status;
762}
763
764static int ocfs2_reserve_suballoc_bits(struct ocfs2_super *osb,
765 struct ocfs2_alloc_context *ac,
766 int type,
767 u32 slot,
768 u64 *last_alloc_group,
769 int flags)
770{
771 int status;
772 u32 bits_wanted = ac->ac_bits_wanted;
773 struct inode *alloc_inode;
774 struct buffer_head *bh = NULL;
775 struct ocfs2_dinode *fe;
776 u32 free_bits;
777
778 alloc_inode = ocfs2_get_system_file_inode(osb, type, slot);
779 if (!alloc_inode) {
780 mlog_errno(-EINVAL);
781 return -EINVAL;
782 }
783
784 inode_lock(alloc_inode);
785
786 status = ocfs2_inode_lock(alloc_inode, &bh, 1);
787 if (status < 0) {
788 inode_unlock(alloc_inode);
789 iput(alloc_inode);
790
791 mlog_errno(status);
792 return status;
793 }
794
795 ac->ac_inode = alloc_inode;
796 ac->ac_alloc_slot = slot;
797
798 fe = (struct ocfs2_dinode *) bh->b_data;
799
800 /* The bh was validated by the inode read inside
801 * ocfs2_inode_lock(). Any corruption is a code bug. */
802 BUG_ON(!OCFS2_IS_VALID_DINODE(fe));
803
804 if (!(fe->i_flags & cpu_to_le32(OCFS2_CHAIN_FL))) {
805 status = ocfs2_error(alloc_inode->i_sb,
806 "Invalid chain allocator %llu\n",
807 (unsigned long long)le64_to_cpu(fe->i_blkno));
808 goto bail;
809 }
810
811 free_bits = le32_to_cpu(fe->id1.bitmap1.i_total) -
812 le32_to_cpu(fe->id1.bitmap1.i_used);
813
814 if (bits_wanted > free_bits) {
815 /* cluster bitmap never grows */
816 if (ocfs2_is_cluster_bitmap(alloc_inode)) {
817 trace_ocfs2_reserve_suballoc_bits_nospc(bits_wanted,
818 free_bits);
819 status = -ENOSPC;
820 goto bail;
821 }
822
823 if (!(flags & ALLOC_NEW_GROUP)) {
824 trace_ocfs2_reserve_suballoc_bits_no_new_group(
825 slot, bits_wanted, free_bits);
826 status = -ENOSPC;
827 goto bail;
828 }
829
830 status = ocfs2_block_group_alloc(osb, alloc_inode, bh,
831 ac->ac_max_block,
832 last_alloc_group, flags);
833 if (status < 0) {
834 if (status != -ENOSPC)
835 mlog_errno(status);
836 goto bail;
837 }
838 atomic_inc(&osb->alloc_stats.bg_extends);
839
840 /* You should never ask for this much metadata */
841 BUG_ON(bits_wanted >
842 (le32_to_cpu(fe->id1.bitmap1.i_total)
843 - le32_to_cpu(fe->id1.bitmap1.i_used)));
844 }
845
846 get_bh(bh);
847 ac->ac_bh = bh;
848bail:
849 brelse(bh);
850
851 if (status)
852 mlog_errno(status);
853 return status;
854}
855
856static void ocfs2_init_inode_steal_slot(struct ocfs2_super *osb)
857{
858 spin_lock(&osb->osb_lock);
859 osb->s_inode_steal_slot = OCFS2_INVALID_SLOT;
860 spin_unlock(&osb->osb_lock);
861 atomic_set(&osb->s_num_inodes_stolen, 0);
862}
863
864static void ocfs2_init_meta_steal_slot(struct ocfs2_super *osb)
865{
866 spin_lock(&osb->osb_lock);
867 osb->s_meta_steal_slot = OCFS2_INVALID_SLOT;
868 spin_unlock(&osb->osb_lock);
869 atomic_set(&osb->s_num_meta_stolen, 0);
870}
871
872void ocfs2_init_steal_slots(struct ocfs2_super *osb)
873{
874 ocfs2_init_inode_steal_slot(osb);
875 ocfs2_init_meta_steal_slot(osb);
876}
877
878static void __ocfs2_set_steal_slot(struct ocfs2_super *osb, int slot, int type)
879{
880 spin_lock(&osb->osb_lock);
881 if (type == INODE_ALLOC_SYSTEM_INODE)
882 osb->s_inode_steal_slot = slot;
883 else if (type == EXTENT_ALLOC_SYSTEM_INODE)
884 osb->s_meta_steal_slot = slot;
885 spin_unlock(&osb->osb_lock);
886}
887
888static int __ocfs2_get_steal_slot(struct ocfs2_super *osb, int type)
889{
890 int slot = OCFS2_INVALID_SLOT;
891
892 spin_lock(&osb->osb_lock);
893 if (type == INODE_ALLOC_SYSTEM_INODE)
894 slot = osb->s_inode_steal_slot;
895 else if (type == EXTENT_ALLOC_SYSTEM_INODE)
896 slot = osb->s_meta_steal_slot;
897 spin_unlock(&osb->osb_lock);
898
899 return slot;
900}
901
902static int ocfs2_get_inode_steal_slot(struct ocfs2_super *osb)
903{
904 return __ocfs2_get_steal_slot(osb, INODE_ALLOC_SYSTEM_INODE);
905}
906
907static int ocfs2_get_meta_steal_slot(struct ocfs2_super *osb)
908{
909 return __ocfs2_get_steal_slot(osb, EXTENT_ALLOC_SYSTEM_INODE);
910}
911
912static int ocfs2_steal_resource(struct ocfs2_super *osb,
913 struct ocfs2_alloc_context *ac,
914 int type)
915{
916 int i, status = -ENOSPC;
917 int slot = __ocfs2_get_steal_slot(osb, type);
918
919 /* Start to steal resource from the first slot after ours. */
920 if (slot == OCFS2_INVALID_SLOT)
921 slot = osb->slot_num + 1;
922
923 for (i = 0; i < osb->max_slots; i++, slot++) {
924 if (slot == osb->max_slots)
925 slot = 0;
926
927 if (slot == osb->slot_num)
928 continue;
929
930 status = ocfs2_reserve_suballoc_bits(osb, ac,
931 type,
932 (u32)slot, NULL,
933 NOT_ALLOC_NEW_GROUP);
934 if (status >= 0) {
935 __ocfs2_set_steal_slot(osb, slot, type);
936 break;
937 }
938
939 ocfs2_free_ac_resource(ac);
940 }
941
942 return status;
943}
944
945static int ocfs2_steal_inode(struct ocfs2_super *osb,
946 struct ocfs2_alloc_context *ac)
947{
948 return ocfs2_steal_resource(osb, ac, INODE_ALLOC_SYSTEM_INODE);
949}
950
951static int ocfs2_steal_meta(struct ocfs2_super *osb,
952 struct ocfs2_alloc_context *ac)
953{
954 return ocfs2_steal_resource(osb, ac, EXTENT_ALLOC_SYSTEM_INODE);
955}
956
957int ocfs2_reserve_new_metadata_blocks(struct ocfs2_super *osb,
958 int blocks,
959 struct ocfs2_alloc_context **ac)
960{
961 int status;
962 int slot = ocfs2_get_meta_steal_slot(osb);
963
964 *ac = kzalloc(sizeof(struct ocfs2_alloc_context), GFP_KERNEL);
965 if (!(*ac)) {
966 status = -ENOMEM;
967 mlog_errno(status);
968 goto bail;
969 }
970
971 (*ac)->ac_bits_wanted = blocks;
972 (*ac)->ac_which = OCFS2_AC_USE_META;
973 (*ac)->ac_group_search = ocfs2_block_group_search;
974
975 if (slot != OCFS2_INVALID_SLOT &&
976 atomic_read(&osb->s_num_meta_stolen) < OCFS2_MAX_TO_STEAL)
977 goto extent_steal;
978
979 atomic_set(&osb->s_num_meta_stolen, 0);
980 status = ocfs2_reserve_suballoc_bits(osb, (*ac),
981 EXTENT_ALLOC_SYSTEM_INODE,
982 (u32)osb->slot_num, NULL,
983 ALLOC_GROUPS_FROM_GLOBAL|ALLOC_NEW_GROUP);
984
985
986 if (status >= 0) {
987 status = 0;
988 if (slot != OCFS2_INVALID_SLOT)
989 ocfs2_init_meta_steal_slot(osb);
990 goto bail;
991 } else if (status < 0 && status != -ENOSPC) {
992 mlog_errno(status);
993 goto bail;
994 }
995
996 ocfs2_free_ac_resource(*ac);
997
998extent_steal:
999 status = ocfs2_steal_meta(osb, *ac);
1000 atomic_inc(&osb->s_num_meta_stolen);
1001 if (status < 0) {
1002 if (status != -ENOSPC)
1003 mlog_errno(status);
1004 goto bail;
1005 }
1006
1007 status = 0;
1008bail:
1009 if ((status < 0) && *ac) {
1010 ocfs2_free_alloc_context(*ac);
1011 *ac = NULL;
1012 }
1013
1014 if (status)
1015 mlog_errno(status);
1016 return status;
1017}
1018
1019int ocfs2_reserve_new_metadata(struct ocfs2_super *osb,
1020 struct ocfs2_extent_list *root_el,
1021 struct ocfs2_alloc_context **ac)
1022{
1023 return ocfs2_reserve_new_metadata_blocks(osb,
1024 ocfs2_extend_meta_needed(root_el),
1025 ac);
1026}
1027
1028int ocfs2_reserve_new_inode(struct ocfs2_super *osb,
1029 struct ocfs2_alloc_context **ac)
1030{
1031 int status;
1032 int slot = ocfs2_get_inode_steal_slot(osb);
1033 u64 alloc_group;
1034
1035 *ac = kzalloc(sizeof(struct ocfs2_alloc_context), GFP_KERNEL);
1036 if (!(*ac)) {
1037 status = -ENOMEM;
1038 mlog_errno(status);
1039 goto bail;
1040 }
1041
1042 (*ac)->ac_bits_wanted = 1;
1043 (*ac)->ac_which = OCFS2_AC_USE_INODE;
1044
1045 (*ac)->ac_group_search = ocfs2_block_group_search;
1046
1047 /*
1048 * stat(2) can't handle i_ino > 32bits, so we tell the
1049 * lower levels not to allocate us a block group past that
1050 * limit. The 'inode64' mount option avoids this behavior.
1051 */
1052 if (!(osb->s_mount_opt & OCFS2_MOUNT_INODE64))
1053 (*ac)->ac_max_block = (u32)~0U;
1054
1055 /*
1056 * slot is set when we successfully steal inode from other nodes.
1057 * It is reset in 3 places:
1058 * 1. when we flush the truncate log
1059 * 2. when we complete local alloc recovery.
1060 * 3. when we successfully allocate from our own slot.
1061 * After it is set, we will go on stealing inodes until we find the
1062 * need to check our slots to see whether there is some space for us.
1063 */
1064 if (slot != OCFS2_INVALID_SLOT &&
1065 atomic_read(&osb->s_num_inodes_stolen) < OCFS2_MAX_TO_STEAL)
1066 goto inode_steal;
1067
1068 atomic_set(&osb->s_num_inodes_stolen, 0);
1069 alloc_group = osb->osb_inode_alloc_group;
1070 status = ocfs2_reserve_suballoc_bits(osb, *ac,
1071 INODE_ALLOC_SYSTEM_INODE,
1072 (u32)osb->slot_num,
1073 &alloc_group,
1074 ALLOC_NEW_GROUP |
1075 ALLOC_GROUPS_FROM_GLOBAL);
1076 if (status >= 0) {
1077 status = 0;
1078
1079 spin_lock(&osb->osb_lock);
1080 osb->osb_inode_alloc_group = alloc_group;
1081 spin_unlock(&osb->osb_lock);
1082 trace_ocfs2_reserve_new_inode_new_group(
1083 (unsigned long long)alloc_group);
1084
1085 /*
1086 * Some inodes must be freed by us, so try to allocate
1087 * from our own next time.
1088 */
1089 if (slot != OCFS2_INVALID_SLOT)
1090 ocfs2_init_inode_steal_slot(osb);
1091 goto bail;
1092 } else if (status < 0 && status != -ENOSPC) {
1093 mlog_errno(status);
1094 goto bail;
1095 }
1096
1097 ocfs2_free_ac_resource(*ac);
1098
1099inode_steal:
1100 status = ocfs2_steal_inode(osb, *ac);
1101 atomic_inc(&osb->s_num_inodes_stolen);
1102 if (status < 0) {
1103 if (status != -ENOSPC)
1104 mlog_errno(status);
1105 goto bail;
1106 }
1107
1108 status = 0;
1109bail:
1110 if ((status < 0) && *ac) {
1111 ocfs2_free_alloc_context(*ac);
1112 *ac = NULL;
1113 }
1114
1115 if (status)
1116 mlog_errno(status);
1117 return status;
1118}
1119
1120/* local alloc code has to do the same thing, so rather than do this
1121 * twice.. */
1122int ocfs2_reserve_cluster_bitmap_bits(struct ocfs2_super *osb,
1123 struct ocfs2_alloc_context *ac)
1124{
1125 int status;
1126
1127 ac->ac_which = OCFS2_AC_USE_MAIN;
1128 ac->ac_group_search = ocfs2_cluster_group_search;
1129
1130 status = ocfs2_reserve_suballoc_bits(osb, ac,
1131 GLOBAL_BITMAP_SYSTEM_INODE,
1132 OCFS2_INVALID_SLOT, NULL,
1133 ALLOC_NEW_GROUP);
1134 if (status < 0 && status != -ENOSPC)
1135 mlog_errno(status);
1136
1137 return status;
1138}
1139
1140/* Callers don't need to care which bitmap (local alloc or main) to
1141 * use so we figure it out for them, but unfortunately this clutters
1142 * things a bit. */
1143static int ocfs2_reserve_clusters_with_limit(struct ocfs2_super *osb,
1144 u32 bits_wanted, u64 max_block,
1145 int flags,
1146 struct ocfs2_alloc_context **ac)
1147{
1148 int status, ret = 0;
1149 int retried = 0;
1150
1151 *ac = kzalloc(sizeof(struct ocfs2_alloc_context), GFP_KERNEL);
1152 if (!(*ac)) {
1153 status = -ENOMEM;
1154 mlog_errno(status);
1155 goto bail;
1156 }
1157
1158 (*ac)->ac_bits_wanted = bits_wanted;
1159 (*ac)->ac_max_block = max_block;
1160
1161 status = -ENOSPC;
1162 if (!(flags & ALLOC_GROUPS_FROM_GLOBAL) &&
1163 ocfs2_alloc_should_use_local(osb, bits_wanted)) {
1164 status = ocfs2_reserve_local_alloc_bits(osb,
1165 bits_wanted,
1166 *ac);
1167 if ((status < 0) && (status != -ENOSPC)) {
1168 mlog_errno(status);
1169 goto bail;
1170 }
1171 }
1172
1173 if (status == -ENOSPC) {
1174retry:
1175 status = ocfs2_reserve_cluster_bitmap_bits(osb, *ac);
1176 /* Retry if there is sufficient space cached in truncate log */
1177 if (status == -ENOSPC && !retried) {
1178 retried = 1;
1179 ocfs2_inode_unlock((*ac)->ac_inode, 1);
1180 inode_unlock((*ac)->ac_inode);
1181
1182 ret = ocfs2_try_to_free_truncate_log(osb, bits_wanted);
1183 if (ret == 1) {
1184 iput((*ac)->ac_inode);
1185 (*ac)->ac_inode = NULL;
1186 goto retry;
1187 }
1188
1189 if (ret < 0)
1190 mlog_errno(ret);
1191
1192 inode_lock((*ac)->ac_inode);
1193 ret = ocfs2_inode_lock((*ac)->ac_inode, NULL, 1);
1194 if (ret < 0) {
1195 mlog_errno(ret);
1196 inode_unlock((*ac)->ac_inode);
1197 iput((*ac)->ac_inode);
1198 (*ac)->ac_inode = NULL;
1199 goto bail;
1200 }
1201 }
1202 if (status < 0) {
1203 if (status != -ENOSPC)
1204 mlog_errno(status);
1205 goto bail;
1206 }
1207 }
1208
1209 status = 0;
1210bail:
1211 if ((status < 0) && *ac) {
1212 ocfs2_free_alloc_context(*ac);
1213 *ac = NULL;
1214 }
1215
1216 if (status)
1217 mlog_errno(status);
1218 return status;
1219}
1220
1221int ocfs2_reserve_clusters(struct ocfs2_super *osb,
1222 u32 bits_wanted,
1223 struct ocfs2_alloc_context **ac)
1224{
1225 return ocfs2_reserve_clusters_with_limit(osb, bits_wanted, 0,
1226 ALLOC_NEW_GROUP, ac);
1227}
1228
1229/*
1230 * More or less lifted from ext3. I'll leave their description below:
1231 *
1232 * "For ext3 allocations, we must not reuse any blocks which are
1233 * allocated in the bitmap buffer's "last committed data" copy. This
1234 * prevents deletes from freeing up the page for reuse until we have
1235 * committed the delete transaction.
1236 *
1237 * If we didn't do this, then deleting something and reallocating it as
1238 * data would allow the old block to be overwritten before the
1239 * transaction committed (because we force data to disk before commit).
1240 * This would lead to corruption if we crashed between overwriting the
1241 * data and committing the delete.
1242 *
1243 * @@@ We may want to make this allocation behaviour conditional on
1244 * data-writes at some point, and disable it for metadata allocations or
1245 * sync-data inodes."
1246 *
1247 * Note: OCFS2 already does this differently for metadata vs data
1248 * allocations, as those bitmaps are separate and undo access is never
1249 * called on a metadata group descriptor.
1250 */
1251static int ocfs2_test_bg_bit_allocatable(struct buffer_head *bg_bh,
1252 int nr)
1253{
1254 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
1255 int ret;
1256
1257 if (ocfs2_test_bit(nr, (unsigned long *)bg->bg_bitmap))
1258 return 0;
1259
1260 if (!buffer_jbd(bg_bh))
1261 return 1;
1262
1263 jbd_lock_bh_state(bg_bh);
1264 bg = (struct ocfs2_group_desc *) bh2jh(bg_bh)->b_committed_data;
1265 if (bg)
1266 ret = !ocfs2_test_bit(nr, (unsigned long *)bg->bg_bitmap);
1267 else
1268 ret = 1;
1269 jbd_unlock_bh_state(bg_bh);
1270
1271 return ret;
1272}
1273
1274static int ocfs2_block_group_find_clear_bits(struct ocfs2_super *osb,
1275 struct buffer_head *bg_bh,
1276 unsigned int bits_wanted,
1277 unsigned int total_bits,
1278 struct ocfs2_suballoc_result *res)
1279{
1280 void *bitmap;
1281 u16 best_offset, best_size;
1282 int offset, start, found, status = 0;
1283 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
1284
1285 /* Callers got this descriptor from
1286 * ocfs2_read_group_descriptor(). Any corruption is a code bug. */
1287 BUG_ON(!OCFS2_IS_VALID_GROUP_DESC(bg));
1288
1289 found = start = best_offset = best_size = 0;
1290 bitmap = bg->bg_bitmap;
1291
1292 while((offset = ocfs2_find_next_zero_bit(bitmap, total_bits, start)) != -1) {
1293 if (offset == total_bits)
1294 break;
1295
1296 if (!ocfs2_test_bg_bit_allocatable(bg_bh, offset)) {
1297 /* We found a zero, but we can't use it as it
1298 * hasn't been put to disk yet! */
1299 found = 0;
1300 start = offset + 1;
1301 } else if (offset == start) {
1302 /* we found a zero */
1303 found++;
1304 /* move start to the next bit to test */
1305 start++;
1306 } else {
1307 /* got a zero after some ones */
1308 found = 1;
1309 start = offset + 1;
1310 }
1311 if (found > best_size) {
1312 best_size = found;
1313 best_offset = start - found;
1314 }
1315 /* we got everything we needed */
1316 if (found == bits_wanted) {
1317 /* mlog(0, "Found it all!\n"); */
1318 break;
1319 }
1320 }
1321
1322 if (best_size) {
1323 res->sr_bit_offset = best_offset;
1324 res->sr_bits = best_size;
1325 } else {
1326 status = -ENOSPC;
1327 /* No error log here -- see the comment above
1328 * ocfs2_test_bg_bit_allocatable */
1329 }
1330
1331 return status;
1332}
1333
1334int ocfs2_block_group_set_bits(handle_t *handle,
1335 struct inode *alloc_inode,
1336 struct ocfs2_group_desc *bg,
1337 struct buffer_head *group_bh,
1338 unsigned int bit_off,
1339 unsigned int num_bits)
1340{
1341 int status;
1342 void *bitmap = bg->bg_bitmap;
1343 int journal_type = OCFS2_JOURNAL_ACCESS_WRITE;
1344
1345 /* All callers get the descriptor via
1346 * ocfs2_read_group_descriptor(). Any corruption is a code bug. */
1347 BUG_ON(!OCFS2_IS_VALID_GROUP_DESC(bg));
1348 BUG_ON(le16_to_cpu(bg->bg_free_bits_count) < num_bits);
1349
1350 trace_ocfs2_block_group_set_bits(bit_off, num_bits);
1351
1352 if (ocfs2_is_cluster_bitmap(alloc_inode))
1353 journal_type = OCFS2_JOURNAL_ACCESS_UNDO;
1354
1355 status = ocfs2_journal_access_gd(handle,
1356 INODE_CACHE(alloc_inode),
1357 group_bh,
1358 journal_type);
1359 if (status < 0) {
1360 mlog_errno(status);
1361 goto bail;
1362 }
1363
1364 le16_add_cpu(&bg->bg_free_bits_count, -num_bits);
1365 if (le16_to_cpu(bg->bg_free_bits_count) > le16_to_cpu(bg->bg_bits)) {
1366 return ocfs2_error(alloc_inode->i_sb, "Group descriptor # %llu has bit count %u but claims %u are freed. num_bits %d\n",
1367 (unsigned long long)le64_to_cpu(bg->bg_blkno),
1368 le16_to_cpu(bg->bg_bits),
1369 le16_to_cpu(bg->bg_free_bits_count),
1370 num_bits);
1371 }
1372 while(num_bits--)
1373 ocfs2_set_bit(bit_off++, bitmap);
1374
1375 ocfs2_journal_dirty(handle, group_bh);
1376
1377bail:
1378 return status;
1379}
1380
1381/* find the one with the most empty bits */
1382static inline u16 ocfs2_find_victim_chain(struct ocfs2_chain_list *cl)
1383{
1384 u16 curr, best;
1385
1386 BUG_ON(!cl->cl_next_free_rec);
1387
1388 best = curr = 0;
1389 while (curr < le16_to_cpu(cl->cl_next_free_rec)) {
1390 if (le32_to_cpu(cl->cl_recs[curr].c_free) >
1391 le32_to_cpu(cl->cl_recs[best].c_free))
1392 best = curr;
1393 curr++;
1394 }
1395
1396 BUG_ON(best >= le16_to_cpu(cl->cl_next_free_rec));
1397 return best;
1398}
1399
1400static int ocfs2_relink_block_group(handle_t *handle,
1401 struct inode *alloc_inode,
1402 struct buffer_head *fe_bh,
1403 struct buffer_head *bg_bh,
1404 struct buffer_head *prev_bg_bh,
1405 u16 chain)
1406{
1407 int status;
1408 /* there is a really tiny chance the journal calls could fail,
1409 * but we wouldn't want inconsistent blocks in *any* case. */
1410 u64 bg_ptr, prev_bg_ptr;
1411 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) fe_bh->b_data;
1412 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
1413 struct ocfs2_group_desc *prev_bg = (struct ocfs2_group_desc *) prev_bg_bh->b_data;
1414
1415 /* The caller got these descriptors from
1416 * ocfs2_read_group_descriptor(). Any corruption is a code bug. */
1417 BUG_ON(!OCFS2_IS_VALID_GROUP_DESC(bg));
1418 BUG_ON(!OCFS2_IS_VALID_GROUP_DESC(prev_bg));
1419
1420 trace_ocfs2_relink_block_group(
1421 (unsigned long long)le64_to_cpu(fe->i_blkno), chain,
1422 (unsigned long long)le64_to_cpu(bg->bg_blkno),
1423 (unsigned long long)le64_to_cpu(prev_bg->bg_blkno));
1424
1425 bg_ptr = le64_to_cpu(bg->bg_next_group);
1426 prev_bg_ptr = le64_to_cpu(prev_bg->bg_next_group);
1427
1428 status = ocfs2_journal_access_gd(handle, INODE_CACHE(alloc_inode),
1429 prev_bg_bh,
1430 OCFS2_JOURNAL_ACCESS_WRITE);
1431 if (status < 0)
1432 goto out;
1433
1434 prev_bg->bg_next_group = bg->bg_next_group;
1435 ocfs2_journal_dirty(handle, prev_bg_bh);
1436
1437 status = ocfs2_journal_access_gd(handle, INODE_CACHE(alloc_inode),
1438 bg_bh, OCFS2_JOURNAL_ACCESS_WRITE);
1439 if (status < 0)
1440 goto out_rollback_prev_bg;
1441
1442 bg->bg_next_group = fe->id2.i_chain.cl_recs[chain].c_blkno;
1443 ocfs2_journal_dirty(handle, bg_bh);
1444
1445 status = ocfs2_journal_access_di(handle, INODE_CACHE(alloc_inode),
1446 fe_bh, OCFS2_JOURNAL_ACCESS_WRITE);
1447 if (status < 0)
1448 goto out_rollback_bg;
1449
1450 fe->id2.i_chain.cl_recs[chain].c_blkno = bg->bg_blkno;
1451 ocfs2_journal_dirty(handle, fe_bh);
1452
1453out:
1454 if (status < 0)
1455 mlog_errno(status);
1456 return status;
1457
1458out_rollback_bg:
1459 bg->bg_next_group = cpu_to_le64(bg_ptr);
1460out_rollback_prev_bg:
1461 prev_bg->bg_next_group = cpu_to_le64(prev_bg_ptr);
1462 goto out;
1463}
1464
1465static inline int ocfs2_block_group_reasonably_empty(struct ocfs2_group_desc *bg,
1466 u32 wanted)
1467{
1468 return le16_to_cpu(bg->bg_free_bits_count) > wanted;
1469}
1470
1471/* return 0 on success, -ENOSPC to keep searching and any other < 0
1472 * value on error. */
1473static int ocfs2_cluster_group_search(struct inode *inode,
1474 struct buffer_head *group_bh,
1475 u32 bits_wanted, u32 min_bits,
1476 u64 max_block,
1477 struct ocfs2_suballoc_result *res)
1478{
1479 int search = -ENOSPC;
1480 int ret;
1481 u64 blkoff;
1482 struct ocfs2_group_desc *gd = (struct ocfs2_group_desc *) group_bh->b_data;
1483 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
1484 unsigned int max_bits, gd_cluster_off;
1485
1486 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
1487
1488 if (gd->bg_free_bits_count) {
1489 max_bits = le16_to_cpu(gd->bg_bits);
1490
1491 /* Tail groups in cluster bitmaps which aren't cpg
1492 * aligned are prone to partial extension by a failed
1493 * fs resize. If the file system resize never got to
1494 * update the dinode cluster count, then we don't want
1495 * to trust any clusters past it, regardless of what
1496 * the group descriptor says. */
1497 gd_cluster_off = ocfs2_blocks_to_clusters(inode->i_sb,
1498 le64_to_cpu(gd->bg_blkno));
1499 if ((gd_cluster_off + max_bits) >
1500 OCFS2_I(inode)->ip_clusters) {
1501 max_bits = OCFS2_I(inode)->ip_clusters - gd_cluster_off;
1502 trace_ocfs2_cluster_group_search_wrong_max_bits(
1503 (unsigned long long)le64_to_cpu(gd->bg_blkno),
1504 le16_to_cpu(gd->bg_bits),
1505 OCFS2_I(inode)->ip_clusters, max_bits);
1506 }
1507
1508 ret = ocfs2_block_group_find_clear_bits(osb,
1509 group_bh, bits_wanted,
1510 max_bits, res);
1511 if (ret)
1512 return ret;
1513
1514 if (max_block) {
1515 blkoff = ocfs2_clusters_to_blocks(inode->i_sb,
1516 gd_cluster_off +
1517 res->sr_bit_offset +
1518 res->sr_bits);
1519 trace_ocfs2_cluster_group_search_max_block(
1520 (unsigned long long)blkoff,
1521 (unsigned long long)max_block);
1522 if (blkoff > max_block)
1523 return -ENOSPC;
1524 }
1525
1526 /* ocfs2_block_group_find_clear_bits() might
1527 * return success, but we still want to return
1528 * -ENOSPC unless it found the minimum number
1529 * of bits. */
1530 if (min_bits <= res->sr_bits)
1531 search = 0; /* success */
1532 else if (res->sr_bits) {
1533 /*
1534 * Don't show bits which we'll be returning
1535 * for allocation to the local alloc bitmap.
1536 */
1537 ocfs2_local_alloc_seen_free_bits(osb, res->sr_bits);
1538 }
1539 }
1540
1541 return search;
1542}
1543
1544static int ocfs2_block_group_search(struct inode *inode,
1545 struct buffer_head *group_bh,
1546 u32 bits_wanted, u32 min_bits,
1547 u64 max_block,
1548 struct ocfs2_suballoc_result *res)
1549{
1550 int ret = -ENOSPC;
1551 u64 blkoff;
1552 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) group_bh->b_data;
1553
1554 BUG_ON(min_bits != 1);
1555 BUG_ON(ocfs2_is_cluster_bitmap(inode));
1556
1557 if (bg->bg_free_bits_count) {
1558 ret = ocfs2_block_group_find_clear_bits(OCFS2_SB(inode->i_sb),
1559 group_bh, bits_wanted,
1560 le16_to_cpu(bg->bg_bits),
1561 res);
1562 if (!ret && max_block) {
1563 blkoff = le64_to_cpu(bg->bg_blkno) +
1564 res->sr_bit_offset + res->sr_bits;
1565 trace_ocfs2_block_group_search_max_block(
1566 (unsigned long long)blkoff,
1567 (unsigned long long)max_block);
1568 if (blkoff > max_block)
1569 ret = -ENOSPC;
1570 }
1571 }
1572
1573 return ret;
1574}
1575
1576int ocfs2_alloc_dinode_update_counts(struct inode *inode,
1577 handle_t *handle,
1578 struct buffer_head *di_bh,
1579 u32 num_bits,
1580 u16 chain)
1581{
1582 int ret;
1583 u32 tmp_used;
1584 struct ocfs2_dinode *di = (struct ocfs2_dinode *) di_bh->b_data;
1585 struct ocfs2_chain_list *cl = (struct ocfs2_chain_list *) &di->id2.i_chain;
1586
1587 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
1588 OCFS2_JOURNAL_ACCESS_WRITE);
1589 if (ret < 0) {
1590 mlog_errno(ret);
1591 goto out;
1592 }
1593
1594 tmp_used = le32_to_cpu(di->id1.bitmap1.i_used);
1595 di->id1.bitmap1.i_used = cpu_to_le32(num_bits + tmp_used);
1596 le32_add_cpu(&cl->cl_recs[chain].c_free, -num_bits);
1597 ocfs2_journal_dirty(handle, di_bh);
1598
1599out:
1600 return ret;
1601}
1602
1603void ocfs2_rollback_alloc_dinode_counts(struct inode *inode,
1604 struct buffer_head *di_bh,
1605 u32 num_bits,
1606 u16 chain)
1607{
1608 u32 tmp_used;
1609 struct ocfs2_dinode *di = (struct ocfs2_dinode *) di_bh->b_data;
1610 struct ocfs2_chain_list *cl;
1611
1612 cl = (struct ocfs2_chain_list *)&di->id2.i_chain;
1613 tmp_used = le32_to_cpu(di->id1.bitmap1.i_used);
1614 di->id1.bitmap1.i_used = cpu_to_le32(tmp_used - num_bits);
1615 le32_add_cpu(&cl->cl_recs[chain].c_free, num_bits);
1616}
1617
1618static int ocfs2_bg_discontig_fix_by_rec(struct ocfs2_suballoc_result *res,
1619 struct ocfs2_extent_rec *rec,
1620 struct ocfs2_chain_list *cl)
1621{
1622 unsigned int bpc = le16_to_cpu(cl->cl_bpc);
1623 unsigned int bitoff = le32_to_cpu(rec->e_cpos) * bpc;
1624 unsigned int bitcount = le16_to_cpu(rec->e_leaf_clusters) * bpc;
1625
1626 if (res->sr_bit_offset < bitoff)
1627 return 0;
1628 if (res->sr_bit_offset >= (bitoff + bitcount))
1629 return 0;
1630 res->sr_blkno = le64_to_cpu(rec->e_blkno) +
1631 (res->sr_bit_offset - bitoff);
1632 if ((res->sr_bit_offset + res->sr_bits) > (bitoff + bitcount))
1633 res->sr_bits = (bitoff + bitcount) - res->sr_bit_offset;
1634 return 1;
1635}
1636
1637static void ocfs2_bg_discontig_fix_result(struct ocfs2_alloc_context *ac,
1638 struct ocfs2_group_desc *bg,
1639 struct ocfs2_suballoc_result *res)
1640{
1641 int i;
1642 u64 bg_blkno = res->sr_bg_blkno; /* Save off */
1643 struct ocfs2_extent_rec *rec;
1644 struct ocfs2_dinode *di = (struct ocfs2_dinode *)ac->ac_bh->b_data;
1645 struct ocfs2_chain_list *cl = &di->id2.i_chain;
1646
1647 if (ocfs2_is_cluster_bitmap(ac->ac_inode)) {
1648 res->sr_blkno = 0;
1649 return;
1650 }
1651
1652 res->sr_blkno = res->sr_bg_blkno + res->sr_bit_offset;
1653 res->sr_bg_blkno = 0; /* Clear it for contig block groups */
1654 if (!ocfs2_supports_discontig_bg(OCFS2_SB(ac->ac_inode->i_sb)) ||
1655 !bg->bg_list.l_next_free_rec)
1656 return;
1657
1658 for (i = 0; i < le16_to_cpu(bg->bg_list.l_next_free_rec); i++) {
1659 rec = &bg->bg_list.l_recs[i];
1660 if (ocfs2_bg_discontig_fix_by_rec(res, rec, cl)) {
1661 res->sr_bg_blkno = bg_blkno; /* Restore */
1662 break;
1663 }
1664 }
1665}
1666
1667static int ocfs2_search_one_group(struct ocfs2_alloc_context *ac,
1668 handle_t *handle,
1669 u32 bits_wanted,
1670 u32 min_bits,
1671 struct ocfs2_suballoc_result *res,
1672 u16 *bits_left)
1673{
1674 int ret;
1675 struct buffer_head *group_bh = NULL;
1676 struct ocfs2_group_desc *gd;
1677 struct ocfs2_dinode *di = (struct ocfs2_dinode *)ac->ac_bh->b_data;
1678 struct inode *alloc_inode = ac->ac_inode;
1679
1680 ret = ocfs2_read_group_descriptor(alloc_inode, di,
1681 res->sr_bg_blkno, &group_bh);
1682 if (ret < 0) {
1683 mlog_errno(ret);
1684 return ret;
1685 }
1686
1687 gd = (struct ocfs2_group_desc *) group_bh->b_data;
1688 ret = ac->ac_group_search(alloc_inode, group_bh, bits_wanted, min_bits,
1689 ac->ac_max_block, res);
1690 if (ret < 0) {
1691 if (ret != -ENOSPC)
1692 mlog_errno(ret);
1693 goto out;
1694 }
1695
1696 if (!ret)
1697 ocfs2_bg_discontig_fix_result(ac, gd, res);
1698
1699 /*
1700 * sr_bg_blkno might have been changed by
1701 * ocfs2_bg_discontig_fix_result
1702 */
1703 res->sr_bg_stable_blkno = group_bh->b_blocknr;
1704
1705 if (ac->ac_find_loc_only)
1706 goto out_loc_only;
1707
1708 ret = ocfs2_alloc_dinode_update_counts(alloc_inode, handle, ac->ac_bh,
1709 res->sr_bits,
1710 le16_to_cpu(gd->bg_chain));
1711 if (ret < 0) {
1712 mlog_errno(ret);
1713 goto out;
1714 }
1715
1716 ret = ocfs2_block_group_set_bits(handle, alloc_inode, gd, group_bh,
1717 res->sr_bit_offset, res->sr_bits);
1718 if (ret < 0) {
1719 ocfs2_rollback_alloc_dinode_counts(alloc_inode, ac->ac_bh,
1720 res->sr_bits,
1721 le16_to_cpu(gd->bg_chain));
1722 mlog_errno(ret);
1723 }
1724
1725out_loc_only:
1726 *bits_left = le16_to_cpu(gd->bg_free_bits_count);
1727
1728out:
1729 brelse(group_bh);
1730
1731 return ret;
1732}
1733
1734static int ocfs2_search_chain(struct ocfs2_alloc_context *ac,
1735 handle_t *handle,
1736 u32 bits_wanted,
1737 u32 min_bits,
1738 struct ocfs2_suballoc_result *res,
1739 u16 *bits_left)
1740{
1741 int status;
1742 u16 chain;
1743 u64 next_group;
1744 struct inode *alloc_inode = ac->ac_inode;
1745 struct buffer_head *group_bh = NULL;
1746 struct buffer_head *prev_group_bh = NULL;
1747 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) ac->ac_bh->b_data;
1748 struct ocfs2_chain_list *cl = (struct ocfs2_chain_list *) &fe->id2.i_chain;
1749 struct ocfs2_group_desc *bg;
1750
1751 chain = ac->ac_chain;
1752 trace_ocfs2_search_chain_begin(
1753 (unsigned long long)OCFS2_I(alloc_inode)->ip_blkno,
1754 bits_wanted, chain);
1755
1756 status = ocfs2_read_group_descriptor(alloc_inode, fe,
1757 le64_to_cpu(cl->cl_recs[chain].c_blkno),
1758 &group_bh);
1759 if (status < 0) {
1760 mlog_errno(status);
1761 goto bail;
1762 }
1763 bg = (struct ocfs2_group_desc *) group_bh->b_data;
1764
1765 status = -ENOSPC;
1766 /* for now, the chain search is a bit simplistic. We just use
1767 * the 1st group with any empty bits. */
1768 while ((status = ac->ac_group_search(alloc_inode, group_bh,
1769 bits_wanted, min_bits,
1770 ac->ac_max_block,
1771 res)) == -ENOSPC) {
1772 if (!bg->bg_next_group)
1773 break;
1774
1775 brelse(prev_group_bh);
1776 prev_group_bh = NULL;
1777
1778 next_group = le64_to_cpu(bg->bg_next_group);
1779 prev_group_bh = group_bh;
1780 group_bh = NULL;
1781 status = ocfs2_read_group_descriptor(alloc_inode, fe,
1782 next_group, &group_bh);
1783 if (status < 0) {
1784 mlog_errno(status);
1785 goto bail;
1786 }
1787 bg = (struct ocfs2_group_desc *) group_bh->b_data;
1788 }
1789 if (status < 0) {
1790 if (status != -ENOSPC)
1791 mlog_errno(status);
1792 goto bail;
1793 }
1794
1795 trace_ocfs2_search_chain_succ(
1796 (unsigned long long)le64_to_cpu(bg->bg_blkno), res->sr_bits);
1797
1798 res->sr_bg_blkno = le64_to_cpu(bg->bg_blkno);
1799
1800 BUG_ON(res->sr_bits == 0);
1801 if (!status)
1802 ocfs2_bg_discontig_fix_result(ac, bg, res);
1803
1804 /*
1805 * sr_bg_blkno might have been changed by
1806 * ocfs2_bg_discontig_fix_result
1807 */
1808 res->sr_bg_stable_blkno = group_bh->b_blocknr;
1809
1810 /*
1811 * Keep track of previous block descriptor read. When
1812 * we find a target, if we have read more than X
1813 * number of descriptors, and the target is reasonably
1814 * empty, relink him to top of his chain.
1815 *
1816 * We've read 0 extra blocks and only send one more to
1817 * the transaction, yet the next guy to search has a
1818 * much easier time.
1819 *
1820 * Do this *after* figuring out how many bits we're taking out
1821 * of our target group.
1822 */
1823 if (!ac->ac_disable_chain_relink &&
1824 (prev_group_bh) &&
1825 (ocfs2_block_group_reasonably_empty(bg, res->sr_bits))) {
1826 status = ocfs2_relink_block_group(handle, alloc_inode,
1827 ac->ac_bh, group_bh,
1828 prev_group_bh, chain);
1829 if (status < 0) {
1830 mlog_errno(status);
1831 goto bail;
1832 }
1833 }
1834
1835 if (ac->ac_find_loc_only)
1836 goto out_loc_only;
1837
1838 status = ocfs2_alloc_dinode_update_counts(alloc_inode, handle,
1839 ac->ac_bh, res->sr_bits,
1840 chain);
1841 if (status) {
1842 mlog_errno(status);
1843 goto bail;
1844 }
1845
1846 status = ocfs2_block_group_set_bits(handle,
1847 alloc_inode,
1848 bg,
1849 group_bh,
1850 res->sr_bit_offset,
1851 res->sr_bits);
1852 if (status < 0) {
1853 ocfs2_rollback_alloc_dinode_counts(alloc_inode,
1854 ac->ac_bh, res->sr_bits, chain);
1855 mlog_errno(status);
1856 goto bail;
1857 }
1858
1859 trace_ocfs2_search_chain_end(
1860 (unsigned long long)le64_to_cpu(fe->i_blkno),
1861 res->sr_bits);
1862
1863out_loc_only:
1864 *bits_left = le16_to_cpu(bg->bg_free_bits_count);
1865bail:
1866 brelse(group_bh);
1867 brelse(prev_group_bh);
1868
1869 if (status)
1870 mlog_errno(status);
1871 return status;
1872}
1873
1874/* will give out up to bits_wanted contiguous bits. */
1875static int ocfs2_claim_suballoc_bits(struct ocfs2_alloc_context *ac,
1876 handle_t *handle,
1877 u32 bits_wanted,
1878 u32 min_bits,
1879 struct ocfs2_suballoc_result *res)
1880{
1881 int status;
1882 u16 victim, i;
1883 u16 bits_left = 0;
1884 u64 hint = ac->ac_last_group;
1885 struct ocfs2_chain_list *cl;
1886 struct ocfs2_dinode *fe;
1887
1888 BUG_ON(ac->ac_bits_given >= ac->ac_bits_wanted);
1889 BUG_ON(bits_wanted > (ac->ac_bits_wanted - ac->ac_bits_given));
1890 BUG_ON(!ac->ac_bh);
1891
1892 fe = (struct ocfs2_dinode *) ac->ac_bh->b_data;
1893
1894 /* The bh was validated by the inode read during
1895 * ocfs2_reserve_suballoc_bits(). Any corruption is a code bug. */
1896 BUG_ON(!OCFS2_IS_VALID_DINODE(fe));
1897
1898 if (le32_to_cpu(fe->id1.bitmap1.i_used) >=
1899 le32_to_cpu(fe->id1.bitmap1.i_total)) {
1900 status = ocfs2_error(ac->ac_inode->i_sb,
1901 "Chain allocator dinode %llu has %u used bits but only %u total\n",
1902 (unsigned long long)le64_to_cpu(fe->i_blkno),
1903 le32_to_cpu(fe->id1.bitmap1.i_used),
1904 le32_to_cpu(fe->id1.bitmap1.i_total));
1905 goto bail;
1906 }
1907
1908 res->sr_bg_blkno = hint;
1909 if (res->sr_bg_blkno) {
1910 /* Attempt to short-circuit the usual search mechanism
1911 * by jumping straight to the most recently used
1912 * allocation group. This helps us maintain some
1913 * contiguousness across allocations. */
1914 status = ocfs2_search_one_group(ac, handle, bits_wanted,
1915 min_bits, res, &bits_left);
1916 if (!status)
1917 goto set_hint;
1918 if (status < 0 && status != -ENOSPC) {
1919 mlog_errno(status);
1920 goto bail;
1921 }
1922 }
1923
1924 cl = (struct ocfs2_chain_list *) &fe->id2.i_chain;
1925
1926 victim = ocfs2_find_victim_chain(cl);
1927 ac->ac_chain = victim;
1928
1929 status = ocfs2_search_chain(ac, handle, bits_wanted, min_bits,
1930 res, &bits_left);
1931 if (!status) {
1932 if (ocfs2_is_cluster_bitmap(ac->ac_inode))
1933 hint = res->sr_bg_blkno;
1934 else
1935 hint = ocfs2_group_from_res(res);
1936 goto set_hint;
1937 }
1938 if (status < 0 && status != -ENOSPC) {
1939 mlog_errno(status);
1940 goto bail;
1941 }
1942
1943 trace_ocfs2_claim_suballoc_bits(victim);
1944
1945 /* If we didn't pick a good victim, then just default to
1946 * searching each chain in order. Don't allow chain relinking
1947 * because we only calculate enough journal credits for one
1948 * relink per alloc. */
1949 ac->ac_disable_chain_relink = 1;
1950 for (i = 0; i < le16_to_cpu(cl->cl_next_free_rec); i ++) {
1951 if (i == victim)
1952 continue;
1953 if (!cl->cl_recs[i].c_free)
1954 continue;
1955
1956 ac->ac_chain = i;
1957 status = ocfs2_search_chain(ac, handle, bits_wanted, min_bits,
1958 res, &bits_left);
1959 if (!status) {
1960 hint = ocfs2_group_from_res(res);
1961 break;
1962 }
1963 if (status < 0 && status != -ENOSPC) {
1964 mlog_errno(status);
1965 goto bail;
1966 }
1967 }
1968
1969set_hint:
1970 if (status != -ENOSPC) {
1971 /* If the next search of this group is not likely to
1972 * yield a suitable extent, then we reset the last
1973 * group hint so as to not waste a disk read */
1974 if (bits_left < min_bits)
1975 ac->ac_last_group = 0;
1976 else
1977 ac->ac_last_group = hint;
1978 }
1979
1980bail:
1981 if (status)
1982 mlog_errno(status);
1983 return status;
1984}
1985
1986int ocfs2_claim_metadata(handle_t *handle,
1987 struct ocfs2_alloc_context *ac,
1988 u32 bits_wanted,
1989 u64 *suballoc_loc,
1990 u16 *suballoc_bit_start,
1991 unsigned int *num_bits,
1992 u64 *blkno_start)
1993{
1994 int status;
1995 struct ocfs2_suballoc_result res = { .sr_blkno = 0, };
1996
1997 BUG_ON(!ac);
1998 BUG_ON(ac->ac_bits_wanted < (ac->ac_bits_given + bits_wanted));
1999 BUG_ON(ac->ac_which != OCFS2_AC_USE_META);
2000
2001 status = ocfs2_claim_suballoc_bits(ac,
2002 handle,
2003 bits_wanted,
2004 1,
2005 &res);
2006 if (status < 0) {
2007 mlog_errno(status);
2008 goto bail;
2009 }
2010 atomic_inc(&OCFS2_SB(ac->ac_inode->i_sb)->alloc_stats.bg_allocs);
2011
2012 *suballoc_loc = res.sr_bg_blkno;
2013 *suballoc_bit_start = res.sr_bit_offset;
2014 *blkno_start = res.sr_blkno;
2015 ac->ac_bits_given += res.sr_bits;
2016 *num_bits = res.sr_bits;
2017 status = 0;
2018bail:
2019 if (status)
2020 mlog_errno(status);
2021 return status;
2022}
2023
2024static void ocfs2_init_inode_ac_group(struct inode *dir,
2025 struct buffer_head *parent_di_bh,
2026 struct ocfs2_alloc_context *ac)
2027{
2028 struct ocfs2_dinode *di = (struct ocfs2_dinode *)parent_di_bh->b_data;
2029 /*
2030 * Try to allocate inodes from some specific group.
2031 *
2032 * If the parent dir has recorded the last group used in allocation,
2033 * cool, use it. Otherwise if we try to allocate new inode from the
2034 * same slot the parent dir belongs to, use the same chunk.
2035 *
2036 * We are very careful here to avoid the mistake of setting
2037 * ac_last_group to a group descriptor from a different (unlocked) slot.
2038 */
2039 if (OCFS2_I(dir)->ip_last_used_group &&
2040 OCFS2_I(dir)->ip_last_used_slot == ac->ac_alloc_slot)
2041 ac->ac_last_group = OCFS2_I(dir)->ip_last_used_group;
2042 else if (le16_to_cpu(di->i_suballoc_slot) == ac->ac_alloc_slot) {
2043 if (di->i_suballoc_loc)
2044 ac->ac_last_group = le64_to_cpu(di->i_suballoc_loc);
2045 else
2046 ac->ac_last_group = ocfs2_which_suballoc_group(
2047 le64_to_cpu(di->i_blkno),
2048 le16_to_cpu(di->i_suballoc_bit));
2049 }
2050}
2051
2052static inline void ocfs2_save_inode_ac_group(struct inode *dir,
2053 struct ocfs2_alloc_context *ac)
2054{
2055 OCFS2_I(dir)->ip_last_used_group = ac->ac_last_group;
2056 OCFS2_I(dir)->ip_last_used_slot = ac->ac_alloc_slot;
2057}
2058
2059int ocfs2_find_new_inode_loc(struct inode *dir,
2060 struct buffer_head *parent_fe_bh,
2061 struct ocfs2_alloc_context *ac,
2062 u64 *fe_blkno)
2063{
2064 int ret;
2065 handle_t *handle = NULL;
2066 struct ocfs2_suballoc_result *res;
2067
2068 BUG_ON(!ac);
2069 BUG_ON(ac->ac_bits_given != 0);
2070 BUG_ON(ac->ac_bits_wanted != 1);
2071 BUG_ON(ac->ac_which != OCFS2_AC_USE_INODE);
2072
2073 res = kzalloc(sizeof(*res), GFP_NOFS);
2074 if (res == NULL) {
2075 ret = -ENOMEM;
2076 mlog_errno(ret);
2077 goto out;
2078 }
2079
2080 ocfs2_init_inode_ac_group(dir, parent_fe_bh, ac);
2081
2082 /*
2083 * The handle started here is for chain relink. Alternatively,
2084 * we could just disable relink for these calls.
2085 */
2086 handle = ocfs2_start_trans(OCFS2_SB(dir->i_sb), OCFS2_SUBALLOC_ALLOC);
2087 if (IS_ERR(handle)) {
2088 ret = PTR_ERR(handle);
2089 handle = NULL;
2090 mlog_errno(ret);
2091 goto out;
2092 }
2093
2094 /*
2095 * This will instruct ocfs2_claim_suballoc_bits and
2096 * ocfs2_search_one_group to search but save actual allocation
2097 * for later.
2098 */
2099 ac->ac_find_loc_only = 1;
2100
2101 ret = ocfs2_claim_suballoc_bits(ac, handle, 1, 1, res);
2102 if (ret < 0) {
2103 mlog_errno(ret);
2104 goto out;
2105 }
2106
2107 ac->ac_find_loc_priv = res;
2108 *fe_blkno = res->sr_blkno;
2109 ocfs2_update_inode_fsync_trans(handle, dir, 0);
2110out:
2111 if (handle)
2112 ocfs2_commit_trans(OCFS2_SB(dir->i_sb), handle);
2113
2114 if (ret)
2115 kfree(res);
2116
2117 return ret;
2118}
2119
2120int ocfs2_claim_new_inode_at_loc(handle_t *handle,
2121 struct inode *dir,
2122 struct ocfs2_alloc_context *ac,
2123 u64 *suballoc_loc,
2124 u16 *suballoc_bit,
2125 u64 di_blkno)
2126{
2127 int ret;
2128 u16 chain;
2129 struct ocfs2_suballoc_result *res = ac->ac_find_loc_priv;
2130 struct buffer_head *bg_bh = NULL;
2131 struct ocfs2_group_desc *bg;
2132 struct ocfs2_dinode *di = (struct ocfs2_dinode *) ac->ac_bh->b_data;
2133
2134 /*
2135 * Since di_blkno is being passed back in, we check for any
2136 * inconsistencies which may have happened between
2137 * calls. These are code bugs as di_blkno is not expected to
2138 * change once returned from ocfs2_find_new_inode_loc()
2139 */
2140 BUG_ON(res->sr_blkno != di_blkno);
2141
2142 ret = ocfs2_read_group_descriptor(ac->ac_inode, di,
2143 res->sr_bg_stable_blkno, &bg_bh);
2144 if (ret) {
2145 mlog_errno(ret);
2146 goto out;
2147 }
2148
2149 bg = (struct ocfs2_group_desc *) bg_bh->b_data;
2150 chain = le16_to_cpu(bg->bg_chain);
2151
2152 ret = ocfs2_alloc_dinode_update_counts(ac->ac_inode, handle,
2153 ac->ac_bh, res->sr_bits,
2154 chain);
2155 if (ret) {
2156 mlog_errno(ret);
2157 goto out;
2158 }
2159
2160 ret = ocfs2_block_group_set_bits(handle,
2161 ac->ac_inode,
2162 bg,
2163 bg_bh,
2164 res->sr_bit_offset,
2165 res->sr_bits);
2166 if (ret < 0) {
2167 ocfs2_rollback_alloc_dinode_counts(ac->ac_inode,
2168 ac->ac_bh, res->sr_bits, chain);
2169 mlog_errno(ret);
2170 goto out;
2171 }
2172
2173 trace_ocfs2_claim_new_inode_at_loc((unsigned long long)di_blkno,
2174 res->sr_bits);
2175
2176 atomic_inc(&OCFS2_SB(ac->ac_inode->i_sb)->alloc_stats.bg_allocs);
2177
2178 BUG_ON(res->sr_bits != 1);
2179
2180 *suballoc_loc = res->sr_bg_blkno;
2181 *suballoc_bit = res->sr_bit_offset;
2182 ac->ac_bits_given++;
2183 ocfs2_save_inode_ac_group(dir, ac);
2184
2185out:
2186 brelse(bg_bh);
2187
2188 return ret;
2189}
2190
2191int ocfs2_claim_new_inode(handle_t *handle,
2192 struct inode *dir,
2193 struct buffer_head *parent_fe_bh,
2194 struct ocfs2_alloc_context *ac,
2195 u64 *suballoc_loc,
2196 u16 *suballoc_bit,
2197 u64 *fe_blkno)
2198{
2199 int status;
2200 struct ocfs2_suballoc_result res;
2201
2202 BUG_ON(!ac);
2203 BUG_ON(ac->ac_bits_given != 0);
2204 BUG_ON(ac->ac_bits_wanted != 1);
2205 BUG_ON(ac->ac_which != OCFS2_AC_USE_INODE);
2206
2207 ocfs2_init_inode_ac_group(dir, parent_fe_bh, ac);
2208
2209 status = ocfs2_claim_suballoc_bits(ac,
2210 handle,
2211 1,
2212 1,
2213 &res);
2214 if (status < 0) {
2215 mlog_errno(status);
2216 goto bail;
2217 }
2218 atomic_inc(&OCFS2_SB(ac->ac_inode->i_sb)->alloc_stats.bg_allocs);
2219
2220 BUG_ON(res.sr_bits != 1);
2221
2222 *suballoc_loc = res.sr_bg_blkno;
2223 *suballoc_bit = res.sr_bit_offset;
2224 *fe_blkno = res.sr_blkno;
2225 ac->ac_bits_given++;
2226 ocfs2_save_inode_ac_group(dir, ac);
2227 status = 0;
2228bail:
2229 if (status)
2230 mlog_errno(status);
2231 return status;
2232}
2233
2234/* translate a group desc. blkno and it's bitmap offset into
2235 * disk cluster offset. */
2236static inline u32 ocfs2_desc_bitmap_to_cluster_off(struct inode *inode,
2237 u64 bg_blkno,
2238 u16 bg_bit_off)
2239{
2240 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2241 u32 cluster = 0;
2242
2243 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
2244
2245 if (bg_blkno != osb->first_cluster_group_blkno)
2246 cluster = ocfs2_blocks_to_clusters(inode->i_sb, bg_blkno);
2247 cluster += (u32) bg_bit_off;
2248 return cluster;
2249}
2250
2251/* given a cluster offset, calculate which block group it belongs to
2252 * and return that block offset. */
2253u64 ocfs2_which_cluster_group(struct inode *inode, u32 cluster)
2254{
2255 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2256 u32 group_no;
2257
2258 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
2259
2260 group_no = cluster / osb->bitmap_cpg;
2261 if (!group_no)
2262 return osb->first_cluster_group_blkno;
2263 return ocfs2_clusters_to_blocks(inode->i_sb,
2264 group_no * osb->bitmap_cpg);
2265}
2266
2267/* given the block number of a cluster start, calculate which cluster
2268 * group and descriptor bitmap offset that corresponds to. */
2269static inline void ocfs2_block_to_cluster_group(struct inode *inode,
2270 u64 data_blkno,
2271 u64 *bg_blkno,
2272 u16 *bg_bit_off)
2273{
2274 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2275 u32 data_cluster = ocfs2_blocks_to_clusters(osb->sb, data_blkno);
2276
2277 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
2278
2279 *bg_blkno = ocfs2_which_cluster_group(inode,
2280 data_cluster);
2281
2282 if (*bg_blkno == osb->first_cluster_group_blkno)
2283 *bg_bit_off = (u16) data_cluster;
2284 else
2285 *bg_bit_off = (u16) ocfs2_blocks_to_clusters(osb->sb,
2286 data_blkno - *bg_blkno);
2287}
2288
2289/*
2290 * min_bits - minimum contiguous chunk from this total allocation we
2291 * can handle. set to what we asked for originally for a full
2292 * contig. allocation, set to '1' to indicate we can deal with extents
2293 * of any size.
2294 */
2295int __ocfs2_claim_clusters(handle_t *handle,
2296 struct ocfs2_alloc_context *ac,
2297 u32 min_clusters,
2298 u32 max_clusters,
2299 u32 *cluster_start,
2300 u32 *num_clusters)
2301{
2302 int status;
2303 unsigned int bits_wanted = max_clusters;
2304 struct ocfs2_suballoc_result res = { .sr_blkno = 0, };
2305 struct ocfs2_super *osb = OCFS2_SB(ac->ac_inode->i_sb);
2306
2307 BUG_ON(ac->ac_bits_given >= ac->ac_bits_wanted);
2308
2309 BUG_ON(ac->ac_which != OCFS2_AC_USE_LOCAL
2310 && ac->ac_which != OCFS2_AC_USE_MAIN);
2311
2312 if (ac->ac_which == OCFS2_AC_USE_LOCAL) {
2313 WARN_ON(min_clusters > 1);
2314
2315 status = ocfs2_claim_local_alloc_bits(osb,
2316 handle,
2317 ac,
2318 bits_wanted,
2319 cluster_start,
2320 num_clusters);
2321 if (!status)
2322 atomic_inc(&osb->alloc_stats.local_data);
2323 } else {
2324 if (min_clusters > (osb->bitmap_cpg - 1)) {
2325 /* The only paths asking for contiguousness
2326 * should know about this already. */
2327 mlog(ML_ERROR, "minimum allocation requested %u exceeds "
2328 "group bitmap size %u!\n", min_clusters,
2329 osb->bitmap_cpg);
2330 status = -ENOSPC;
2331 goto bail;
2332 }
2333 /* clamp the current request down to a realistic size. */
2334 if (bits_wanted > (osb->bitmap_cpg - 1))
2335 bits_wanted = osb->bitmap_cpg - 1;
2336
2337 status = ocfs2_claim_suballoc_bits(ac,
2338 handle,
2339 bits_wanted,
2340 min_clusters,
2341 &res);
2342 if (!status) {
2343 BUG_ON(res.sr_blkno); /* cluster alloc can't set */
2344 *cluster_start =
2345 ocfs2_desc_bitmap_to_cluster_off(ac->ac_inode,
2346 res.sr_bg_blkno,
2347 res.sr_bit_offset);
2348 atomic_inc(&osb->alloc_stats.bitmap_data);
2349 *num_clusters = res.sr_bits;
2350 }
2351 }
2352 if (status < 0) {
2353 if (status != -ENOSPC)
2354 mlog_errno(status);
2355 goto bail;
2356 }
2357
2358 ac->ac_bits_given += *num_clusters;
2359
2360bail:
2361 if (status)
2362 mlog_errno(status);
2363 return status;
2364}
2365
2366int ocfs2_claim_clusters(handle_t *handle,
2367 struct ocfs2_alloc_context *ac,
2368 u32 min_clusters,
2369 u32 *cluster_start,
2370 u32 *num_clusters)
2371{
2372 unsigned int bits_wanted = ac->ac_bits_wanted - ac->ac_bits_given;
2373
2374 return __ocfs2_claim_clusters(handle, ac, min_clusters,
2375 bits_wanted, cluster_start, num_clusters);
2376}
2377
2378static int ocfs2_block_group_clear_bits(handle_t *handle,
2379 struct inode *alloc_inode,
2380 struct ocfs2_group_desc *bg,
2381 struct buffer_head *group_bh,
2382 unsigned int bit_off,
2383 unsigned int num_bits,
2384 void (*undo_fn)(unsigned int bit,
2385 unsigned long *bmap))
2386{
2387 int status;
2388 unsigned int tmp;
2389 struct ocfs2_group_desc *undo_bg = NULL;
2390
2391 /* The caller got this descriptor from
2392 * ocfs2_read_group_descriptor(). Any corruption is a code bug. */
2393 BUG_ON(!OCFS2_IS_VALID_GROUP_DESC(bg));
2394
2395 trace_ocfs2_block_group_clear_bits(bit_off, num_bits);
2396
2397 BUG_ON(undo_fn && !ocfs2_is_cluster_bitmap(alloc_inode));
2398 status = ocfs2_journal_access_gd(handle, INODE_CACHE(alloc_inode),
2399 group_bh,
2400 undo_fn ?
2401 OCFS2_JOURNAL_ACCESS_UNDO :
2402 OCFS2_JOURNAL_ACCESS_WRITE);
2403 if (status < 0) {
2404 mlog_errno(status);
2405 goto bail;
2406 }
2407
2408 if (undo_fn) {
2409 jbd_lock_bh_state(group_bh);
2410 undo_bg = (struct ocfs2_group_desc *)
2411 bh2jh(group_bh)->b_committed_data;
2412 BUG_ON(!undo_bg);
2413 }
2414
2415 tmp = num_bits;
2416 while(tmp--) {
2417 ocfs2_clear_bit((bit_off + tmp),
2418 (unsigned long *) bg->bg_bitmap);
2419 if (undo_fn)
2420 undo_fn(bit_off + tmp,
2421 (unsigned long *) undo_bg->bg_bitmap);
2422 }
2423 le16_add_cpu(&bg->bg_free_bits_count, num_bits);
2424 if (le16_to_cpu(bg->bg_free_bits_count) > le16_to_cpu(bg->bg_bits)) {
2425 if (undo_fn)
2426 jbd_unlock_bh_state(group_bh);
2427 return ocfs2_error(alloc_inode->i_sb, "Group descriptor # %llu has bit count %u but claims %u are freed. num_bits %d\n",
2428 (unsigned long long)le64_to_cpu(bg->bg_blkno),
2429 le16_to_cpu(bg->bg_bits),
2430 le16_to_cpu(bg->bg_free_bits_count),
2431 num_bits);
2432 }
2433
2434 if (undo_fn)
2435 jbd_unlock_bh_state(group_bh);
2436
2437 ocfs2_journal_dirty(handle, group_bh);
2438bail:
2439 return status;
2440}
2441
2442/*
2443 * expects the suballoc inode to already be locked.
2444 */
2445static int _ocfs2_free_suballoc_bits(handle_t *handle,
2446 struct inode *alloc_inode,
2447 struct buffer_head *alloc_bh,
2448 unsigned int start_bit,
2449 u64 bg_blkno,
2450 unsigned int count,
2451 void (*undo_fn)(unsigned int bit,
2452 unsigned long *bitmap))
2453{
2454 int status = 0;
2455 u32 tmp_used;
2456 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) alloc_bh->b_data;
2457 struct ocfs2_chain_list *cl = &fe->id2.i_chain;
2458 struct buffer_head *group_bh = NULL;
2459 struct ocfs2_group_desc *group;
2460
2461 /* The alloc_bh comes from ocfs2_free_dinode() or
2462 * ocfs2_free_clusters(). The callers have all locked the
2463 * allocator and gotten alloc_bh from the lock call. This
2464 * validates the dinode buffer. Any corruption that has happened
2465 * is a code bug. */
2466 BUG_ON(!OCFS2_IS_VALID_DINODE(fe));
2467 BUG_ON((count + start_bit) > ocfs2_bits_per_group(cl));
2468
2469 trace_ocfs2_free_suballoc_bits(
2470 (unsigned long long)OCFS2_I(alloc_inode)->ip_blkno,
2471 (unsigned long long)bg_blkno,
2472 start_bit, count);
2473
2474 status = ocfs2_read_group_descriptor(alloc_inode, fe, bg_blkno,
2475 &group_bh);
2476 if (status < 0) {
2477 mlog_errno(status);
2478 goto bail;
2479 }
2480 group = (struct ocfs2_group_desc *) group_bh->b_data;
2481
2482 BUG_ON((count + start_bit) > le16_to_cpu(group->bg_bits));
2483
2484 status = ocfs2_block_group_clear_bits(handle, alloc_inode,
2485 group, group_bh,
2486 start_bit, count, undo_fn);
2487 if (status < 0) {
2488 mlog_errno(status);
2489 goto bail;
2490 }
2491
2492 status = ocfs2_journal_access_di(handle, INODE_CACHE(alloc_inode),
2493 alloc_bh, OCFS2_JOURNAL_ACCESS_WRITE);
2494 if (status < 0) {
2495 mlog_errno(status);
2496 ocfs2_block_group_set_bits(handle, alloc_inode, group, group_bh,
2497 start_bit, count);
2498 goto bail;
2499 }
2500
2501 le32_add_cpu(&cl->cl_recs[le16_to_cpu(group->bg_chain)].c_free,
2502 count);
2503 tmp_used = le32_to_cpu(fe->id1.bitmap1.i_used);
2504 fe->id1.bitmap1.i_used = cpu_to_le32(tmp_used - count);
2505 ocfs2_journal_dirty(handle, alloc_bh);
2506
2507bail:
2508 brelse(group_bh);
2509
2510 if (status)
2511 mlog_errno(status);
2512 return status;
2513}
2514
2515int ocfs2_free_suballoc_bits(handle_t *handle,
2516 struct inode *alloc_inode,
2517 struct buffer_head *alloc_bh,
2518 unsigned int start_bit,
2519 u64 bg_blkno,
2520 unsigned int count)
2521{
2522 return _ocfs2_free_suballoc_bits(handle, alloc_inode, alloc_bh,
2523 start_bit, bg_blkno, count, NULL);
2524}
2525
2526int ocfs2_free_dinode(handle_t *handle,
2527 struct inode *inode_alloc_inode,
2528 struct buffer_head *inode_alloc_bh,
2529 struct ocfs2_dinode *di)
2530{
2531 u64 blk = le64_to_cpu(di->i_blkno);
2532 u16 bit = le16_to_cpu(di->i_suballoc_bit);
2533 u64 bg_blkno = ocfs2_which_suballoc_group(blk, bit);
2534
2535 if (di->i_suballoc_loc)
2536 bg_blkno = le64_to_cpu(di->i_suballoc_loc);
2537 return ocfs2_free_suballoc_bits(handle, inode_alloc_inode,
2538 inode_alloc_bh, bit, bg_blkno, 1);
2539}
2540
2541static int _ocfs2_free_clusters(handle_t *handle,
2542 struct inode *bitmap_inode,
2543 struct buffer_head *bitmap_bh,
2544 u64 start_blk,
2545 unsigned int num_clusters,
2546 void (*undo_fn)(unsigned int bit,
2547 unsigned long *bitmap))
2548{
2549 int status;
2550 u16 bg_start_bit;
2551 u64 bg_blkno;
2552
2553 /* You can't ever have a contiguous set of clusters
2554 * bigger than a block group bitmap so we never have to worry
2555 * about looping on them.
2556 * This is expensive. We can safely remove once this stuff has
2557 * gotten tested really well. */
2558 BUG_ON(start_blk != ocfs2_clusters_to_blocks(bitmap_inode->i_sb,
2559 ocfs2_blocks_to_clusters(bitmap_inode->i_sb,
2560 start_blk)));
2561
2562
2563 ocfs2_block_to_cluster_group(bitmap_inode, start_blk, &bg_blkno,
2564 &bg_start_bit);
2565
2566 trace_ocfs2_free_clusters((unsigned long long)bg_blkno,
2567 (unsigned long long)start_blk,
2568 bg_start_bit, num_clusters);
2569
2570 status = _ocfs2_free_suballoc_bits(handle, bitmap_inode, bitmap_bh,
2571 bg_start_bit, bg_blkno,
2572 num_clusters, undo_fn);
2573 if (status < 0) {
2574 mlog_errno(status);
2575 goto out;
2576 }
2577
2578 ocfs2_local_alloc_seen_free_bits(OCFS2_SB(bitmap_inode->i_sb),
2579 num_clusters);
2580
2581out:
2582 if (status)
2583 mlog_errno(status);
2584 return status;
2585}
2586
2587int ocfs2_free_clusters(handle_t *handle,
2588 struct inode *bitmap_inode,
2589 struct buffer_head *bitmap_bh,
2590 u64 start_blk,
2591 unsigned int num_clusters)
2592{
2593 return _ocfs2_free_clusters(handle, bitmap_inode, bitmap_bh,
2594 start_blk, num_clusters,
2595 _ocfs2_set_bit);
2596}
2597
2598/*
2599 * Give never-used clusters back to the global bitmap. We don't need
2600 * to protect these bits in the undo buffer.
2601 */
2602int ocfs2_release_clusters(handle_t *handle,
2603 struct inode *bitmap_inode,
2604 struct buffer_head *bitmap_bh,
2605 u64 start_blk,
2606 unsigned int num_clusters)
2607{
2608 return _ocfs2_free_clusters(handle, bitmap_inode, bitmap_bh,
2609 start_blk, num_clusters,
2610 _ocfs2_clear_bit);
2611}
2612
2613/*
2614 * For a given allocation, determine which allocators will need to be
2615 * accessed, and lock them, reserving the appropriate number of bits.
2616 *
2617 * Sparse file systems call this from ocfs2_write_begin_nolock()
2618 * and ocfs2_allocate_unwritten_extents().
2619 *
2620 * File systems which don't support holes call this from
2621 * ocfs2_extend_allocation().
2622 */
2623int ocfs2_lock_allocators(struct inode *inode,
2624 struct ocfs2_extent_tree *et,
2625 u32 clusters_to_add, u32 extents_to_split,
2626 struct ocfs2_alloc_context **data_ac,
2627 struct ocfs2_alloc_context **meta_ac)
2628{
2629 int ret = 0, num_free_extents;
2630 unsigned int max_recs_needed = clusters_to_add + 2 * extents_to_split;
2631 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2632
2633 *meta_ac = NULL;
2634 if (data_ac)
2635 *data_ac = NULL;
2636
2637 BUG_ON(clusters_to_add != 0 && data_ac == NULL);
2638
2639 num_free_extents = ocfs2_num_free_extents(et);
2640 if (num_free_extents < 0) {
2641 ret = num_free_extents;
2642 mlog_errno(ret);
2643 goto out;
2644 }
2645
2646 /*
2647 * Sparse allocation file systems need to be more conservative
2648 * with reserving room for expansion - the actual allocation
2649 * happens while we've got a journal handle open so re-taking
2650 * a cluster lock (because we ran out of room for another
2651 * extent) will violate ordering rules.
2652 *
2653 * Most of the time we'll only be seeing this 1 cluster at a time
2654 * anyway.
2655 *
2656 * Always lock for any unwritten extents - we might want to
2657 * add blocks during a split.
2658 */
2659 if (!num_free_extents ||
2660 (ocfs2_sparse_alloc(osb) && num_free_extents < max_recs_needed)) {
2661 ret = ocfs2_reserve_new_metadata(osb, et->et_root_el, meta_ac);
2662 if (ret < 0) {
2663 if (ret != -ENOSPC)
2664 mlog_errno(ret);
2665 goto out;
2666 }
2667 }
2668
2669 if (clusters_to_add == 0)
2670 goto out;
2671
2672 ret = ocfs2_reserve_clusters(osb, clusters_to_add, data_ac);
2673 if (ret < 0) {
2674 if (ret != -ENOSPC)
2675 mlog_errno(ret);
2676 goto out;
2677 }
2678
2679out:
2680 if (ret) {
2681 if (*meta_ac) {
2682 ocfs2_free_alloc_context(*meta_ac);
2683 *meta_ac = NULL;
2684 }
2685
2686 /*
2687 * We cannot have an error and a non null *data_ac.
2688 */
2689 }
2690
2691 return ret;
2692}
2693
2694/*
2695 * Read the inode specified by blkno to get suballoc_slot and
2696 * suballoc_bit.
2697 */
2698static int ocfs2_get_suballoc_slot_bit(struct ocfs2_super *osb, u64 blkno,
2699 u16 *suballoc_slot, u64 *group_blkno,
2700 u16 *suballoc_bit)
2701{
2702 int status;
2703 struct buffer_head *inode_bh = NULL;
2704 struct ocfs2_dinode *inode_fe;
2705
2706 trace_ocfs2_get_suballoc_slot_bit((unsigned long long)blkno);
2707
2708 /* dirty read disk */
2709 status = ocfs2_read_blocks_sync(osb, blkno, 1, &inode_bh);
2710 if (status < 0) {
2711 mlog(ML_ERROR, "read block %llu failed %d\n",
2712 (unsigned long long)blkno, status);
2713 goto bail;
2714 }
2715
2716 inode_fe = (struct ocfs2_dinode *) inode_bh->b_data;
2717 if (!OCFS2_IS_VALID_DINODE(inode_fe)) {
2718 mlog(ML_ERROR, "invalid inode %llu requested\n",
2719 (unsigned long long)blkno);
2720 status = -EINVAL;
2721 goto bail;
2722 }
2723
2724 if (le16_to_cpu(inode_fe->i_suballoc_slot) != (u16)OCFS2_INVALID_SLOT &&
2725 (u32)le16_to_cpu(inode_fe->i_suballoc_slot) > osb->max_slots - 1) {
2726 mlog(ML_ERROR, "inode %llu has invalid suballoc slot %u\n",
2727 (unsigned long long)blkno,
2728 (u32)le16_to_cpu(inode_fe->i_suballoc_slot));
2729 status = -EINVAL;
2730 goto bail;
2731 }
2732
2733 if (suballoc_slot)
2734 *suballoc_slot = le16_to_cpu(inode_fe->i_suballoc_slot);
2735 if (suballoc_bit)
2736 *suballoc_bit = le16_to_cpu(inode_fe->i_suballoc_bit);
2737 if (group_blkno)
2738 *group_blkno = le64_to_cpu(inode_fe->i_suballoc_loc);
2739
2740bail:
2741 brelse(inode_bh);
2742
2743 if (status)
2744 mlog_errno(status);
2745 return status;
2746}
2747
2748/*
2749 * test whether bit is SET in allocator bitmap or not. on success, 0
2750 * is returned and *res is 1 for SET; 0 otherwise. when fails, errno
2751 * is returned and *res is meaningless. Call this after you have
2752 * cluster locked against suballoc, or you may get a result based on
2753 * non-up2date contents
2754 */
2755static int ocfs2_test_suballoc_bit(struct ocfs2_super *osb,
2756 struct inode *suballoc,
2757 struct buffer_head *alloc_bh,
2758 u64 group_blkno, u64 blkno,
2759 u16 bit, int *res)
2760{
2761 struct ocfs2_dinode *alloc_di;
2762 struct ocfs2_group_desc *group;
2763 struct buffer_head *group_bh = NULL;
2764 u64 bg_blkno;
2765 int status;
2766
2767 trace_ocfs2_test_suballoc_bit((unsigned long long)blkno,
2768 (unsigned int)bit);
2769
2770 alloc_di = (struct ocfs2_dinode *)alloc_bh->b_data;
2771 if ((bit + 1) > ocfs2_bits_per_group(&alloc_di->id2.i_chain)) {
2772 mlog(ML_ERROR, "suballoc bit %u out of range of %u\n",
2773 (unsigned int)bit,
2774 ocfs2_bits_per_group(&alloc_di->id2.i_chain));
2775 status = -EINVAL;
2776 goto bail;
2777 }
2778
2779 bg_blkno = group_blkno ? group_blkno :
2780 ocfs2_which_suballoc_group(blkno, bit);
2781 status = ocfs2_read_group_descriptor(suballoc, alloc_di, bg_blkno,
2782 &group_bh);
2783 if (status < 0) {
2784 mlog(ML_ERROR, "read group %llu failed %d\n",
2785 (unsigned long long)bg_blkno, status);
2786 goto bail;
2787 }
2788
2789 group = (struct ocfs2_group_desc *) group_bh->b_data;
2790 *res = ocfs2_test_bit(bit, (unsigned long *)group->bg_bitmap);
2791
2792bail:
2793 brelse(group_bh);
2794
2795 if (status)
2796 mlog_errno(status);
2797 return status;
2798}
2799
2800/*
2801 * Test if the bit representing this inode (blkno) is set in the
2802 * suballocator.
2803 *
2804 * On success, 0 is returned and *res is 1 for SET; 0 otherwise.
2805 *
2806 * In the event of failure, a negative value is returned and *res is
2807 * meaningless.
2808 *
2809 * Callers must make sure to hold nfs_sync_lock to prevent
2810 * ocfs2_delete_inode() on another node from accessing the same
2811 * suballocator concurrently.
2812 */
2813int ocfs2_test_inode_bit(struct ocfs2_super *osb, u64 blkno, int *res)
2814{
2815 int status;
2816 u64 group_blkno = 0;
2817 u16 suballoc_bit = 0, suballoc_slot = 0;
2818 struct inode *inode_alloc_inode;
2819 struct buffer_head *alloc_bh = NULL;
2820
2821 trace_ocfs2_test_inode_bit((unsigned long long)blkno);
2822
2823 status = ocfs2_get_suballoc_slot_bit(osb, blkno, &suballoc_slot,
2824 &group_blkno, &suballoc_bit);
2825 if (status < 0) {
2826 mlog(ML_ERROR, "get alloc slot and bit failed %d\n", status);
2827 goto bail;
2828 }
2829
2830 inode_alloc_inode =
2831 ocfs2_get_system_file_inode(osb, INODE_ALLOC_SYSTEM_INODE,
2832 suballoc_slot);
2833 if (!inode_alloc_inode) {
2834 /* the error code could be inaccurate, but we are not able to
2835 * get the correct one. */
2836 status = -EINVAL;
2837 mlog(ML_ERROR, "unable to get alloc inode in slot %u\n",
2838 (u32)suballoc_slot);
2839 goto bail;
2840 }
2841
2842 inode_lock(inode_alloc_inode);
2843 status = ocfs2_inode_lock(inode_alloc_inode, &alloc_bh, 0);
2844 if (status < 0) {
2845 inode_unlock(inode_alloc_inode);
2846 iput(inode_alloc_inode);
2847 mlog(ML_ERROR, "lock on alloc inode on slot %u failed %d\n",
2848 (u32)suballoc_slot, status);
2849 goto bail;
2850 }
2851
2852 status = ocfs2_test_suballoc_bit(osb, inode_alloc_inode, alloc_bh,
2853 group_blkno, blkno, suballoc_bit, res);
2854 if (status < 0)
2855 mlog(ML_ERROR, "test suballoc bit failed %d\n", status);
2856
2857 ocfs2_inode_unlock(inode_alloc_inode, 0);
2858 inode_unlock(inode_alloc_inode);
2859
2860 iput(inode_alloc_inode);
2861 brelse(alloc_bh);
2862bail:
2863 if (status)
2864 mlog_errno(status);
2865 return status;
2866}
1/* -*- mode: c; c-basic-offset: 8; -*-
2 * vim: noexpandtab sw=8 ts=8 sts=0:
3 *
4 * suballoc.c
5 *
6 * metadata alloc and free
7 * Inspired by ext3 block groups.
8 *
9 * Copyright (C) 2002, 2004 Oracle. All rights reserved.
10 *
11 * This program is free software; you can redistribute it and/or
12 * modify it under the terms of the GNU General Public
13 * License as published by the Free Software Foundation; either
14 * version 2 of the License, or (at your option) any later version.
15 *
16 * This program is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
19 * General Public License for more details.
20 *
21 * You should have received a copy of the GNU General Public
22 * License along with this program; if not, write to the
23 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
24 * Boston, MA 021110-1307, USA.
25 */
26
27#include <linux/fs.h>
28#include <linux/types.h>
29#include <linux/slab.h>
30#include <linux/highmem.h>
31
32#include <cluster/masklog.h>
33
34#include "ocfs2.h"
35
36#include "alloc.h"
37#include "blockcheck.h"
38#include "dlmglue.h"
39#include "inode.h"
40#include "journal.h"
41#include "localalloc.h"
42#include "suballoc.h"
43#include "super.h"
44#include "sysfile.h"
45#include "uptodate.h"
46#include "ocfs2_trace.h"
47
48#include "buffer_head_io.h"
49
50#define NOT_ALLOC_NEW_GROUP 0
51#define ALLOC_NEW_GROUP 0x1
52#define ALLOC_GROUPS_FROM_GLOBAL 0x2
53
54#define OCFS2_MAX_TO_STEAL 1024
55
56struct ocfs2_suballoc_result {
57 u64 sr_bg_blkno; /* The bg we allocated from. Set
58 to 0 when a block group is
59 contiguous. */
60 u64 sr_bg_stable_blkno; /*
61 * Doesn't change, always
62 * set to target block
63 * group descriptor
64 * block.
65 */
66 u64 sr_blkno; /* The first allocated block */
67 unsigned int sr_bit_offset; /* The bit in the bg */
68 unsigned int sr_bits; /* How many bits we claimed */
69};
70
71static u64 ocfs2_group_from_res(struct ocfs2_suballoc_result *res)
72{
73 if (res->sr_blkno == 0)
74 return 0;
75
76 if (res->sr_bg_blkno)
77 return res->sr_bg_blkno;
78
79 return ocfs2_which_suballoc_group(res->sr_blkno, res->sr_bit_offset);
80}
81
82static inline void ocfs2_debug_bg(struct ocfs2_group_desc *bg);
83static inline void ocfs2_debug_suballoc_inode(struct ocfs2_dinode *fe);
84static inline u16 ocfs2_find_victim_chain(struct ocfs2_chain_list *cl);
85static int ocfs2_block_group_fill(handle_t *handle,
86 struct inode *alloc_inode,
87 struct buffer_head *bg_bh,
88 u64 group_blkno,
89 unsigned int group_clusters,
90 u16 my_chain,
91 struct ocfs2_chain_list *cl);
92static int ocfs2_block_group_alloc(struct ocfs2_super *osb,
93 struct inode *alloc_inode,
94 struct buffer_head *bh,
95 u64 max_block,
96 u64 *last_alloc_group,
97 int flags);
98
99static int ocfs2_cluster_group_search(struct inode *inode,
100 struct buffer_head *group_bh,
101 u32 bits_wanted, u32 min_bits,
102 u64 max_block,
103 struct ocfs2_suballoc_result *res);
104static int ocfs2_block_group_search(struct inode *inode,
105 struct buffer_head *group_bh,
106 u32 bits_wanted, u32 min_bits,
107 u64 max_block,
108 struct ocfs2_suballoc_result *res);
109static int ocfs2_claim_suballoc_bits(struct ocfs2_alloc_context *ac,
110 handle_t *handle,
111 u32 bits_wanted,
112 u32 min_bits,
113 struct ocfs2_suballoc_result *res);
114static int ocfs2_test_bg_bit_allocatable(struct buffer_head *bg_bh,
115 int nr);
116static int ocfs2_relink_block_group(handle_t *handle,
117 struct inode *alloc_inode,
118 struct buffer_head *fe_bh,
119 struct buffer_head *bg_bh,
120 struct buffer_head *prev_bg_bh,
121 u16 chain);
122static inline int ocfs2_block_group_reasonably_empty(struct ocfs2_group_desc *bg,
123 u32 wanted);
124static inline u32 ocfs2_desc_bitmap_to_cluster_off(struct inode *inode,
125 u64 bg_blkno,
126 u16 bg_bit_off);
127static inline void ocfs2_block_to_cluster_group(struct inode *inode,
128 u64 data_blkno,
129 u64 *bg_blkno,
130 u16 *bg_bit_off);
131static int ocfs2_reserve_clusters_with_limit(struct ocfs2_super *osb,
132 u32 bits_wanted, u64 max_block,
133 int flags,
134 struct ocfs2_alloc_context **ac);
135
136void ocfs2_free_ac_resource(struct ocfs2_alloc_context *ac)
137{
138 struct inode *inode = ac->ac_inode;
139
140 if (inode) {
141 if (ac->ac_which != OCFS2_AC_USE_LOCAL)
142 ocfs2_inode_unlock(inode, 1);
143
144 inode_unlock(inode);
145
146 iput(inode);
147 ac->ac_inode = NULL;
148 }
149 brelse(ac->ac_bh);
150 ac->ac_bh = NULL;
151 ac->ac_resv = NULL;
152 kfree(ac->ac_find_loc_priv);
153 ac->ac_find_loc_priv = NULL;
154}
155
156void ocfs2_free_alloc_context(struct ocfs2_alloc_context *ac)
157{
158 ocfs2_free_ac_resource(ac);
159 kfree(ac);
160}
161
162static u32 ocfs2_bits_per_group(struct ocfs2_chain_list *cl)
163{
164 return (u32)le16_to_cpu(cl->cl_cpg) * (u32)le16_to_cpu(cl->cl_bpc);
165}
166
167#define do_error(fmt, ...) \
168do { \
169 if (resize) \
170 mlog(ML_ERROR, fmt, ##__VA_ARGS__); \
171 else \
172 return ocfs2_error(sb, fmt, ##__VA_ARGS__); \
173} while (0)
174
175static int ocfs2_validate_gd_self(struct super_block *sb,
176 struct buffer_head *bh,
177 int resize)
178{
179 struct ocfs2_group_desc *gd = (struct ocfs2_group_desc *)bh->b_data;
180
181 if (!OCFS2_IS_VALID_GROUP_DESC(gd)) {
182 do_error("Group descriptor #%llu has bad signature %.*s\n",
183 (unsigned long long)bh->b_blocknr, 7,
184 gd->bg_signature);
185 }
186
187 if (le64_to_cpu(gd->bg_blkno) != bh->b_blocknr) {
188 do_error("Group descriptor #%llu has an invalid bg_blkno of %llu\n",
189 (unsigned long long)bh->b_blocknr,
190 (unsigned long long)le64_to_cpu(gd->bg_blkno));
191 }
192
193 if (le32_to_cpu(gd->bg_generation) != OCFS2_SB(sb)->fs_generation) {
194 do_error("Group descriptor #%llu has an invalid fs_generation of #%u\n",
195 (unsigned long long)bh->b_blocknr,
196 le32_to_cpu(gd->bg_generation));
197 }
198
199 if (le16_to_cpu(gd->bg_free_bits_count) > le16_to_cpu(gd->bg_bits)) {
200 do_error("Group descriptor #%llu has bit count %u but claims that %u are free\n",
201 (unsigned long long)bh->b_blocknr,
202 le16_to_cpu(gd->bg_bits),
203 le16_to_cpu(gd->bg_free_bits_count));
204 }
205
206 if (le16_to_cpu(gd->bg_bits) > (8 * le16_to_cpu(gd->bg_size))) {
207 do_error("Group descriptor #%llu has bit count %u but max bitmap bits of %u\n",
208 (unsigned long long)bh->b_blocknr,
209 le16_to_cpu(gd->bg_bits),
210 8 * le16_to_cpu(gd->bg_size));
211 }
212
213 return 0;
214}
215
216static int ocfs2_validate_gd_parent(struct super_block *sb,
217 struct ocfs2_dinode *di,
218 struct buffer_head *bh,
219 int resize)
220{
221 unsigned int max_bits;
222 struct ocfs2_group_desc *gd = (struct ocfs2_group_desc *)bh->b_data;
223
224 if (di->i_blkno != gd->bg_parent_dinode) {
225 do_error("Group descriptor #%llu has bad parent pointer (%llu, expected %llu)\n",
226 (unsigned long long)bh->b_blocknr,
227 (unsigned long long)le64_to_cpu(gd->bg_parent_dinode),
228 (unsigned long long)le64_to_cpu(di->i_blkno));
229 }
230
231 max_bits = le16_to_cpu(di->id2.i_chain.cl_cpg) * le16_to_cpu(di->id2.i_chain.cl_bpc);
232 if (le16_to_cpu(gd->bg_bits) > max_bits) {
233 do_error("Group descriptor #%llu has bit count of %u\n",
234 (unsigned long long)bh->b_blocknr,
235 le16_to_cpu(gd->bg_bits));
236 }
237
238 /* In resize, we may meet the case bg_chain == cl_next_free_rec. */
239 if ((le16_to_cpu(gd->bg_chain) >
240 le16_to_cpu(di->id2.i_chain.cl_next_free_rec)) ||
241 ((le16_to_cpu(gd->bg_chain) ==
242 le16_to_cpu(di->id2.i_chain.cl_next_free_rec)) && !resize)) {
243 do_error("Group descriptor #%llu has bad chain %u\n",
244 (unsigned long long)bh->b_blocknr,
245 le16_to_cpu(gd->bg_chain));
246 }
247
248 return 0;
249}
250
251#undef do_error
252
253/*
254 * This version only prints errors. It does not fail the filesystem, and
255 * exists only for resize.
256 */
257int ocfs2_check_group_descriptor(struct super_block *sb,
258 struct ocfs2_dinode *di,
259 struct buffer_head *bh)
260{
261 int rc;
262 struct ocfs2_group_desc *gd = (struct ocfs2_group_desc *)bh->b_data;
263
264 BUG_ON(!buffer_uptodate(bh));
265
266 /*
267 * If the ecc fails, we return the error but otherwise
268 * leave the filesystem running. We know any error is
269 * local to this block.
270 */
271 rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &gd->bg_check);
272 if (rc) {
273 mlog(ML_ERROR,
274 "Checksum failed for group descriptor %llu\n",
275 (unsigned long long)bh->b_blocknr);
276 } else
277 rc = ocfs2_validate_gd_self(sb, bh, 1);
278 if (!rc)
279 rc = ocfs2_validate_gd_parent(sb, di, bh, 1);
280
281 return rc;
282}
283
284static int ocfs2_validate_group_descriptor(struct super_block *sb,
285 struct buffer_head *bh)
286{
287 int rc;
288 struct ocfs2_group_desc *gd = (struct ocfs2_group_desc *)bh->b_data;
289
290 trace_ocfs2_validate_group_descriptor(
291 (unsigned long long)bh->b_blocknr);
292
293 BUG_ON(!buffer_uptodate(bh));
294
295 /*
296 * If the ecc fails, we return the error but otherwise
297 * leave the filesystem running. We know any error is
298 * local to this block.
299 */
300 rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &gd->bg_check);
301 if (rc)
302 return rc;
303
304 /*
305 * Errors after here are fatal.
306 */
307
308 return ocfs2_validate_gd_self(sb, bh, 0);
309}
310
311int ocfs2_read_group_descriptor(struct inode *inode, struct ocfs2_dinode *di,
312 u64 gd_blkno, struct buffer_head **bh)
313{
314 int rc;
315 struct buffer_head *tmp = *bh;
316
317 rc = ocfs2_read_block(INODE_CACHE(inode), gd_blkno, &tmp,
318 ocfs2_validate_group_descriptor);
319 if (rc)
320 goto out;
321
322 rc = ocfs2_validate_gd_parent(inode->i_sb, di, tmp, 0);
323 if (rc) {
324 brelse(tmp);
325 goto out;
326 }
327
328 /* If ocfs2_read_block() got us a new bh, pass it up. */
329 if (!*bh)
330 *bh = tmp;
331
332out:
333 return rc;
334}
335
336static void ocfs2_bg_discontig_add_extent(struct ocfs2_super *osb,
337 struct ocfs2_group_desc *bg,
338 struct ocfs2_chain_list *cl,
339 u64 p_blkno, unsigned int clusters)
340{
341 struct ocfs2_extent_list *el = &bg->bg_list;
342 struct ocfs2_extent_rec *rec;
343
344 BUG_ON(!ocfs2_supports_discontig_bg(osb));
345 if (!el->l_next_free_rec)
346 el->l_count = cpu_to_le16(ocfs2_extent_recs_per_gd(osb->sb));
347 rec = &el->l_recs[le16_to_cpu(el->l_next_free_rec)];
348 rec->e_blkno = cpu_to_le64(p_blkno);
349 rec->e_cpos = cpu_to_le32(le16_to_cpu(bg->bg_bits) /
350 le16_to_cpu(cl->cl_bpc));
351 rec->e_leaf_clusters = cpu_to_le16(clusters);
352 le16_add_cpu(&bg->bg_bits, clusters * le16_to_cpu(cl->cl_bpc));
353 le16_add_cpu(&bg->bg_free_bits_count,
354 clusters * le16_to_cpu(cl->cl_bpc));
355 le16_add_cpu(&el->l_next_free_rec, 1);
356}
357
358static int ocfs2_block_group_fill(handle_t *handle,
359 struct inode *alloc_inode,
360 struct buffer_head *bg_bh,
361 u64 group_blkno,
362 unsigned int group_clusters,
363 u16 my_chain,
364 struct ocfs2_chain_list *cl)
365{
366 int status = 0;
367 struct ocfs2_super *osb = OCFS2_SB(alloc_inode->i_sb);
368 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
369 struct super_block * sb = alloc_inode->i_sb;
370
371 if (((unsigned long long) bg_bh->b_blocknr) != group_blkno) {
372 status = ocfs2_error(alloc_inode->i_sb,
373 "group block (%llu) != b_blocknr (%llu)\n",
374 (unsigned long long)group_blkno,
375 (unsigned long long) bg_bh->b_blocknr);
376 goto bail;
377 }
378
379 status = ocfs2_journal_access_gd(handle,
380 INODE_CACHE(alloc_inode),
381 bg_bh,
382 OCFS2_JOURNAL_ACCESS_CREATE);
383 if (status < 0) {
384 mlog_errno(status);
385 goto bail;
386 }
387
388 memset(bg, 0, sb->s_blocksize);
389 strcpy(bg->bg_signature, OCFS2_GROUP_DESC_SIGNATURE);
390 bg->bg_generation = cpu_to_le32(OCFS2_SB(sb)->fs_generation);
391 bg->bg_size = cpu_to_le16(ocfs2_group_bitmap_size(sb, 1,
392 osb->s_feature_incompat));
393 bg->bg_chain = cpu_to_le16(my_chain);
394 bg->bg_next_group = cl->cl_recs[my_chain].c_blkno;
395 bg->bg_parent_dinode = cpu_to_le64(OCFS2_I(alloc_inode)->ip_blkno);
396 bg->bg_blkno = cpu_to_le64(group_blkno);
397 if (group_clusters == le16_to_cpu(cl->cl_cpg))
398 bg->bg_bits = cpu_to_le16(ocfs2_bits_per_group(cl));
399 else
400 ocfs2_bg_discontig_add_extent(osb, bg, cl, group_blkno,
401 group_clusters);
402
403 /* set the 1st bit in the bitmap to account for the descriptor block */
404 ocfs2_set_bit(0, (unsigned long *)bg->bg_bitmap);
405 bg->bg_free_bits_count = cpu_to_le16(le16_to_cpu(bg->bg_bits) - 1);
406
407 ocfs2_journal_dirty(handle, bg_bh);
408
409 /* There is no need to zero out or otherwise initialize the
410 * other blocks in a group - All valid FS metadata in a block
411 * group stores the superblock fs_generation value at
412 * allocation time. */
413
414bail:
415 if (status)
416 mlog_errno(status);
417 return status;
418}
419
420static inline u16 ocfs2_find_smallest_chain(struct ocfs2_chain_list *cl)
421{
422 u16 curr, best;
423
424 best = curr = 0;
425 while (curr < le16_to_cpu(cl->cl_count)) {
426 if (le32_to_cpu(cl->cl_recs[best].c_total) >
427 le32_to_cpu(cl->cl_recs[curr].c_total))
428 best = curr;
429 curr++;
430 }
431 return best;
432}
433
434static struct buffer_head *
435ocfs2_block_group_alloc_contig(struct ocfs2_super *osb, handle_t *handle,
436 struct inode *alloc_inode,
437 struct ocfs2_alloc_context *ac,
438 struct ocfs2_chain_list *cl)
439{
440 int status;
441 u32 bit_off, num_bits;
442 u64 bg_blkno;
443 struct buffer_head *bg_bh;
444 unsigned int alloc_rec = ocfs2_find_smallest_chain(cl);
445
446 status = ocfs2_claim_clusters(handle, ac,
447 le16_to_cpu(cl->cl_cpg), &bit_off,
448 &num_bits);
449 if (status < 0) {
450 if (status != -ENOSPC)
451 mlog_errno(status);
452 goto bail;
453 }
454
455 /* setup the group */
456 bg_blkno = ocfs2_clusters_to_blocks(osb->sb, bit_off);
457 trace_ocfs2_block_group_alloc_contig(
458 (unsigned long long)bg_blkno, alloc_rec);
459
460 bg_bh = sb_getblk(osb->sb, bg_blkno);
461 if (!bg_bh) {
462 status = -ENOMEM;
463 mlog_errno(status);
464 goto bail;
465 }
466 ocfs2_set_new_buffer_uptodate(INODE_CACHE(alloc_inode), bg_bh);
467
468 status = ocfs2_block_group_fill(handle, alloc_inode, bg_bh,
469 bg_blkno, num_bits, alloc_rec, cl);
470 if (status < 0) {
471 brelse(bg_bh);
472 mlog_errno(status);
473 }
474
475bail:
476 return status ? ERR_PTR(status) : bg_bh;
477}
478
479static int ocfs2_block_group_claim_bits(struct ocfs2_super *osb,
480 handle_t *handle,
481 struct ocfs2_alloc_context *ac,
482 unsigned int min_bits,
483 u32 *bit_off, u32 *num_bits)
484{
485 int status = 0;
486
487 while (min_bits) {
488 status = ocfs2_claim_clusters(handle, ac, min_bits,
489 bit_off, num_bits);
490 if (status != -ENOSPC)
491 break;
492
493 min_bits >>= 1;
494 }
495
496 return status;
497}
498
499static int ocfs2_block_group_grow_discontig(handle_t *handle,
500 struct inode *alloc_inode,
501 struct buffer_head *bg_bh,
502 struct ocfs2_alloc_context *ac,
503 struct ocfs2_chain_list *cl,
504 unsigned int min_bits)
505{
506 int status;
507 struct ocfs2_super *osb = OCFS2_SB(alloc_inode->i_sb);
508 struct ocfs2_group_desc *bg =
509 (struct ocfs2_group_desc *)bg_bh->b_data;
510 unsigned int needed = le16_to_cpu(cl->cl_cpg) -
511 le16_to_cpu(bg->bg_bits) / le16_to_cpu(cl->cl_bpc);
512 u32 p_cpos, clusters;
513 u64 p_blkno;
514 struct ocfs2_extent_list *el = &bg->bg_list;
515
516 status = ocfs2_journal_access_gd(handle,
517 INODE_CACHE(alloc_inode),
518 bg_bh,
519 OCFS2_JOURNAL_ACCESS_CREATE);
520 if (status < 0) {
521 mlog_errno(status);
522 goto bail;
523 }
524
525 while ((needed > 0) && (le16_to_cpu(el->l_next_free_rec) <
526 le16_to_cpu(el->l_count))) {
527 if (min_bits > needed)
528 min_bits = needed;
529 status = ocfs2_block_group_claim_bits(osb, handle, ac,
530 min_bits, &p_cpos,
531 &clusters);
532 if (status < 0) {
533 if (status != -ENOSPC)
534 mlog_errno(status);
535 goto bail;
536 }
537 p_blkno = ocfs2_clusters_to_blocks(osb->sb, p_cpos);
538 ocfs2_bg_discontig_add_extent(osb, bg, cl, p_blkno,
539 clusters);
540
541 min_bits = clusters;
542 needed = le16_to_cpu(cl->cl_cpg) -
543 le16_to_cpu(bg->bg_bits) / le16_to_cpu(cl->cl_bpc);
544 }
545
546 if (needed > 0) {
547 /*
548 * We have used up all the extent rec but can't fill up
549 * the cpg. So bail out.
550 */
551 status = -ENOSPC;
552 goto bail;
553 }
554
555 ocfs2_journal_dirty(handle, bg_bh);
556
557bail:
558 return status;
559}
560
561static void ocfs2_bg_alloc_cleanup(handle_t *handle,
562 struct ocfs2_alloc_context *cluster_ac,
563 struct inode *alloc_inode,
564 struct buffer_head *bg_bh)
565{
566 int i, ret;
567 struct ocfs2_group_desc *bg;
568 struct ocfs2_extent_list *el;
569 struct ocfs2_extent_rec *rec;
570
571 if (!bg_bh)
572 return;
573
574 bg = (struct ocfs2_group_desc *)bg_bh->b_data;
575 el = &bg->bg_list;
576 for (i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) {
577 rec = &el->l_recs[i];
578 ret = ocfs2_free_clusters(handle, cluster_ac->ac_inode,
579 cluster_ac->ac_bh,
580 le64_to_cpu(rec->e_blkno),
581 le16_to_cpu(rec->e_leaf_clusters));
582 if (ret)
583 mlog_errno(ret);
584 /* Try all the clusters to free */
585 }
586
587 ocfs2_remove_from_cache(INODE_CACHE(alloc_inode), bg_bh);
588 brelse(bg_bh);
589}
590
591static struct buffer_head *
592ocfs2_block_group_alloc_discontig(handle_t *handle,
593 struct inode *alloc_inode,
594 struct ocfs2_alloc_context *ac,
595 struct ocfs2_chain_list *cl)
596{
597 int status;
598 u32 bit_off, num_bits;
599 u64 bg_blkno;
600 unsigned int min_bits = le16_to_cpu(cl->cl_cpg) >> 1;
601 struct buffer_head *bg_bh = NULL;
602 unsigned int alloc_rec = ocfs2_find_smallest_chain(cl);
603 struct ocfs2_super *osb = OCFS2_SB(alloc_inode->i_sb);
604
605 if (!ocfs2_supports_discontig_bg(osb)) {
606 status = -ENOSPC;
607 goto bail;
608 }
609
610 status = ocfs2_extend_trans(handle,
611 ocfs2_calc_bg_discontig_credits(osb->sb));
612 if (status) {
613 mlog_errno(status);
614 goto bail;
615 }
616
617 /*
618 * We're going to be grabbing from multiple cluster groups.
619 * We don't have enough credits to relink them all, and the
620 * cluster groups will be staying in cache for the duration of
621 * this operation.
622 */
623 ac->ac_disable_chain_relink = 1;
624
625 /* Claim the first region */
626 status = ocfs2_block_group_claim_bits(osb, handle, ac, min_bits,
627 &bit_off, &num_bits);
628 if (status < 0) {
629 if (status != -ENOSPC)
630 mlog_errno(status);
631 goto bail;
632 }
633 min_bits = num_bits;
634
635 /* setup the group */
636 bg_blkno = ocfs2_clusters_to_blocks(osb->sb, bit_off);
637 trace_ocfs2_block_group_alloc_discontig(
638 (unsigned long long)bg_blkno, alloc_rec);
639
640 bg_bh = sb_getblk(osb->sb, bg_blkno);
641 if (!bg_bh) {
642 status = -ENOMEM;
643 mlog_errno(status);
644 goto bail;
645 }
646 ocfs2_set_new_buffer_uptodate(INODE_CACHE(alloc_inode), bg_bh);
647
648 status = ocfs2_block_group_fill(handle, alloc_inode, bg_bh,
649 bg_blkno, num_bits, alloc_rec, cl);
650 if (status < 0) {
651 mlog_errno(status);
652 goto bail;
653 }
654
655 status = ocfs2_block_group_grow_discontig(handle, alloc_inode,
656 bg_bh, ac, cl, min_bits);
657 if (status)
658 mlog_errno(status);
659
660bail:
661 if (status)
662 ocfs2_bg_alloc_cleanup(handle, ac, alloc_inode, bg_bh);
663 return status ? ERR_PTR(status) : bg_bh;
664}
665
666/*
667 * We expect the block group allocator to already be locked.
668 */
669static int ocfs2_block_group_alloc(struct ocfs2_super *osb,
670 struct inode *alloc_inode,
671 struct buffer_head *bh,
672 u64 max_block,
673 u64 *last_alloc_group,
674 int flags)
675{
676 int status, credits;
677 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) bh->b_data;
678 struct ocfs2_chain_list *cl;
679 struct ocfs2_alloc_context *ac = NULL;
680 handle_t *handle = NULL;
681 u16 alloc_rec;
682 struct buffer_head *bg_bh = NULL;
683 struct ocfs2_group_desc *bg;
684
685 BUG_ON(ocfs2_is_cluster_bitmap(alloc_inode));
686
687 cl = &fe->id2.i_chain;
688 status = ocfs2_reserve_clusters_with_limit(osb,
689 le16_to_cpu(cl->cl_cpg),
690 max_block, flags, &ac);
691 if (status < 0) {
692 if (status != -ENOSPC)
693 mlog_errno(status);
694 goto bail;
695 }
696
697 credits = ocfs2_calc_group_alloc_credits(osb->sb,
698 le16_to_cpu(cl->cl_cpg));
699 handle = ocfs2_start_trans(osb, credits);
700 if (IS_ERR(handle)) {
701 status = PTR_ERR(handle);
702 handle = NULL;
703 mlog_errno(status);
704 goto bail;
705 }
706
707 if (last_alloc_group && *last_alloc_group != 0) {
708 trace_ocfs2_block_group_alloc(
709 (unsigned long long)*last_alloc_group);
710 ac->ac_last_group = *last_alloc_group;
711 }
712
713 bg_bh = ocfs2_block_group_alloc_contig(osb, handle, alloc_inode,
714 ac, cl);
715 if (IS_ERR(bg_bh) && (PTR_ERR(bg_bh) == -ENOSPC))
716 bg_bh = ocfs2_block_group_alloc_discontig(handle,
717 alloc_inode,
718 ac, cl);
719 if (IS_ERR(bg_bh)) {
720 status = PTR_ERR(bg_bh);
721 bg_bh = NULL;
722 if (status != -ENOSPC)
723 mlog_errno(status);
724 goto bail;
725 }
726 bg = (struct ocfs2_group_desc *) bg_bh->b_data;
727
728 status = ocfs2_journal_access_di(handle, INODE_CACHE(alloc_inode),
729 bh, OCFS2_JOURNAL_ACCESS_WRITE);
730 if (status < 0) {
731 mlog_errno(status);
732 goto bail;
733 }
734
735 alloc_rec = le16_to_cpu(bg->bg_chain);
736 le32_add_cpu(&cl->cl_recs[alloc_rec].c_free,
737 le16_to_cpu(bg->bg_free_bits_count));
738 le32_add_cpu(&cl->cl_recs[alloc_rec].c_total,
739 le16_to_cpu(bg->bg_bits));
740 cl->cl_recs[alloc_rec].c_blkno = bg->bg_blkno;
741 if (le16_to_cpu(cl->cl_next_free_rec) < le16_to_cpu(cl->cl_count))
742 le16_add_cpu(&cl->cl_next_free_rec, 1);
743
744 le32_add_cpu(&fe->id1.bitmap1.i_used, le16_to_cpu(bg->bg_bits) -
745 le16_to_cpu(bg->bg_free_bits_count));
746 le32_add_cpu(&fe->id1.bitmap1.i_total, le16_to_cpu(bg->bg_bits));
747 le32_add_cpu(&fe->i_clusters, le16_to_cpu(cl->cl_cpg));
748
749 ocfs2_journal_dirty(handle, bh);
750
751 spin_lock(&OCFS2_I(alloc_inode)->ip_lock);
752 OCFS2_I(alloc_inode)->ip_clusters = le32_to_cpu(fe->i_clusters);
753 fe->i_size = cpu_to_le64(ocfs2_clusters_to_bytes(alloc_inode->i_sb,
754 le32_to_cpu(fe->i_clusters)));
755 spin_unlock(&OCFS2_I(alloc_inode)->ip_lock);
756 i_size_write(alloc_inode, le64_to_cpu(fe->i_size));
757 alloc_inode->i_blocks = ocfs2_inode_sector_count(alloc_inode);
758 ocfs2_update_inode_fsync_trans(handle, alloc_inode, 0);
759
760 status = 0;
761
762 /* save the new last alloc group so that the caller can cache it. */
763 if (last_alloc_group)
764 *last_alloc_group = ac->ac_last_group;
765
766bail:
767 if (handle)
768 ocfs2_commit_trans(osb, handle);
769
770 if (ac)
771 ocfs2_free_alloc_context(ac);
772
773 brelse(bg_bh);
774
775 if (status)
776 mlog_errno(status);
777 return status;
778}
779
780static int ocfs2_reserve_suballoc_bits(struct ocfs2_super *osb,
781 struct ocfs2_alloc_context *ac,
782 int type,
783 u32 slot,
784 u64 *last_alloc_group,
785 int flags)
786{
787 int status;
788 u32 bits_wanted = ac->ac_bits_wanted;
789 struct inode *alloc_inode;
790 struct buffer_head *bh = NULL;
791 struct ocfs2_dinode *fe;
792 u32 free_bits;
793
794 alloc_inode = ocfs2_get_system_file_inode(osb, type, slot);
795 if (!alloc_inode) {
796 mlog_errno(-EINVAL);
797 return -EINVAL;
798 }
799
800 inode_lock(alloc_inode);
801
802 status = ocfs2_inode_lock(alloc_inode, &bh, 1);
803 if (status < 0) {
804 inode_unlock(alloc_inode);
805 iput(alloc_inode);
806
807 mlog_errno(status);
808 return status;
809 }
810
811 ac->ac_inode = alloc_inode;
812 ac->ac_alloc_slot = slot;
813
814 fe = (struct ocfs2_dinode *) bh->b_data;
815
816 /* The bh was validated by the inode read inside
817 * ocfs2_inode_lock(). Any corruption is a code bug. */
818 BUG_ON(!OCFS2_IS_VALID_DINODE(fe));
819
820 if (!(fe->i_flags & cpu_to_le32(OCFS2_CHAIN_FL))) {
821 status = ocfs2_error(alloc_inode->i_sb,
822 "Invalid chain allocator %llu\n",
823 (unsigned long long)le64_to_cpu(fe->i_blkno));
824 goto bail;
825 }
826
827 free_bits = le32_to_cpu(fe->id1.bitmap1.i_total) -
828 le32_to_cpu(fe->id1.bitmap1.i_used);
829
830 if (bits_wanted > free_bits) {
831 /* cluster bitmap never grows */
832 if (ocfs2_is_cluster_bitmap(alloc_inode)) {
833 trace_ocfs2_reserve_suballoc_bits_nospc(bits_wanted,
834 free_bits);
835 status = -ENOSPC;
836 goto bail;
837 }
838
839 if (!(flags & ALLOC_NEW_GROUP)) {
840 trace_ocfs2_reserve_suballoc_bits_no_new_group(
841 slot, bits_wanted, free_bits);
842 status = -ENOSPC;
843 goto bail;
844 }
845
846 status = ocfs2_block_group_alloc(osb, alloc_inode, bh,
847 ac->ac_max_block,
848 last_alloc_group, flags);
849 if (status < 0) {
850 if (status != -ENOSPC)
851 mlog_errno(status);
852 goto bail;
853 }
854 atomic_inc(&osb->alloc_stats.bg_extends);
855
856 /* You should never ask for this much metadata */
857 BUG_ON(bits_wanted >
858 (le32_to_cpu(fe->id1.bitmap1.i_total)
859 - le32_to_cpu(fe->id1.bitmap1.i_used)));
860 }
861
862 get_bh(bh);
863 ac->ac_bh = bh;
864bail:
865 brelse(bh);
866
867 if (status)
868 mlog_errno(status);
869 return status;
870}
871
872static void ocfs2_init_inode_steal_slot(struct ocfs2_super *osb)
873{
874 spin_lock(&osb->osb_lock);
875 osb->s_inode_steal_slot = OCFS2_INVALID_SLOT;
876 spin_unlock(&osb->osb_lock);
877 atomic_set(&osb->s_num_inodes_stolen, 0);
878}
879
880static void ocfs2_init_meta_steal_slot(struct ocfs2_super *osb)
881{
882 spin_lock(&osb->osb_lock);
883 osb->s_meta_steal_slot = OCFS2_INVALID_SLOT;
884 spin_unlock(&osb->osb_lock);
885 atomic_set(&osb->s_num_meta_stolen, 0);
886}
887
888void ocfs2_init_steal_slots(struct ocfs2_super *osb)
889{
890 ocfs2_init_inode_steal_slot(osb);
891 ocfs2_init_meta_steal_slot(osb);
892}
893
894static void __ocfs2_set_steal_slot(struct ocfs2_super *osb, int slot, int type)
895{
896 spin_lock(&osb->osb_lock);
897 if (type == INODE_ALLOC_SYSTEM_INODE)
898 osb->s_inode_steal_slot = slot;
899 else if (type == EXTENT_ALLOC_SYSTEM_INODE)
900 osb->s_meta_steal_slot = slot;
901 spin_unlock(&osb->osb_lock);
902}
903
904static int __ocfs2_get_steal_slot(struct ocfs2_super *osb, int type)
905{
906 int slot = OCFS2_INVALID_SLOT;
907
908 spin_lock(&osb->osb_lock);
909 if (type == INODE_ALLOC_SYSTEM_INODE)
910 slot = osb->s_inode_steal_slot;
911 else if (type == EXTENT_ALLOC_SYSTEM_INODE)
912 slot = osb->s_meta_steal_slot;
913 spin_unlock(&osb->osb_lock);
914
915 return slot;
916}
917
918static int ocfs2_get_inode_steal_slot(struct ocfs2_super *osb)
919{
920 return __ocfs2_get_steal_slot(osb, INODE_ALLOC_SYSTEM_INODE);
921}
922
923static int ocfs2_get_meta_steal_slot(struct ocfs2_super *osb)
924{
925 return __ocfs2_get_steal_slot(osb, EXTENT_ALLOC_SYSTEM_INODE);
926}
927
928static int ocfs2_steal_resource(struct ocfs2_super *osb,
929 struct ocfs2_alloc_context *ac,
930 int type)
931{
932 int i, status = -ENOSPC;
933 int slot = __ocfs2_get_steal_slot(osb, type);
934
935 /* Start to steal resource from the first slot after ours. */
936 if (slot == OCFS2_INVALID_SLOT)
937 slot = osb->slot_num + 1;
938
939 for (i = 0; i < osb->max_slots; i++, slot++) {
940 if (slot == osb->max_slots)
941 slot = 0;
942
943 if (slot == osb->slot_num)
944 continue;
945
946 status = ocfs2_reserve_suballoc_bits(osb, ac,
947 type,
948 (u32)slot, NULL,
949 NOT_ALLOC_NEW_GROUP);
950 if (status >= 0) {
951 __ocfs2_set_steal_slot(osb, slot, type);
952 break;
953 }
954
955 ocfs2_free_ac_resource(ac);
956 }
957
958 return status;
959}
960
961static int ocfs2_steal_inode(struct ocfs2_super *osb,
962 struct ocfs2_alloc_context *ac)
963{
964 return ocfs2_steal_resource(osb, ac, INODE_ALLOC_SYSTEM_INODE);
965}
966
967static int ocfs2_steal_meta(struct ocfs2_super *osb,
968 struct ocfs2_alloc_context *ac)
969{
970 return ocfs2_steal_resource(osb, ac, EXTENT_ALLOC_SYSTEM_INODE);
971}
972
973int ocfs2_reserve_new_metadata_blocks(struct ocfs2_super *osb,
974 int blocks,
975 struct ocfs2_alloc_context **ac)
976{
977 int status;
978 int slot = ocfs2_get_meta_steal_slot(osb);
979
980 *ac = kzalloc(sizeof(struct ocfs2_alloc_context), GFP_KERNEL);
981 if (!(*ac)) {
982 status = -ENOMEM;
983 mlog_errno(status);
984 goto bail;
985 }
986
987 (*ac)->ac_bits_wanted = blocks;
988 (*ac)->ac_which = OCFS2_AC_USE_META;
989 (*ac)->ac_group_search = ocfs2_block_group_search;
990
991 if (slot != OCFS2_INVALID_SLOT &&
992 atomic_read(&osb->s_num_meta_stolen) < OCFS2_MAX_TO_STEAL)
993 goto extent_steal;
994
995 atomic_set(&osb->s_num_meta_stolen, 0);
996 status = ocfs2_reserve_suballoc_bits(osb, (*ac),
997 EXTENT_ALLOC_SYSTEM_INODE,
998 (u32)osb->slot_num, NULL,
999 ALLOC_GROUPS_FROM_GLOBAL|ALLOC_NEW_GROUP);
1000
1001
1002 if (status >= 0) {
1003 status = 0;
1004 if (slot != OCFS2_INVALID_SLOT)
1005 ocfs2_init_meta_steal_slot(osb);
1006 goto bail;
1007 } else if (status < 0 && status != -ENOSPC) {
1008 mlog_errno(status);
1009 goto bail;
1010 }
1011
1012 ocfs2_free_ac_resource(*ac);
1013
1014extent_steal:
1015 status = ocfs2_steal_meta(osb, *ac);
1016 atomic_inc(&osb->s_num_meta_stolen);
1017 if (status < 0) {
1018 if (status != -ENOSPC)
1019 mlog_errno(status);
1020 goto bail;
1021 }
1022
1023 status = 0;
1024bail:
1025 if ((status < 0) && *ac) {
1026 ocfs2_free_alloc_context(*ac);
1027 *ac = NULL;
1028 }
1029
1030 if (status)
1031 mlog_errno(status);
1032 return status;
1033}
1034
1035int ocfs2_reserve_new_metadata(struct ocfs2_super *osb,
1036 struct ocfs2_extent_list *root_el,
1037 struct ocfs2_alloc_context **ac)
1038{
1039 return ocfs2_reserve_new_metadata_blocks(osb,
1040 ocfs2_extend_meta_needed(root_el),
1041 ac);
1042}
1043
1044int ocfs2_reserve_new_inode(struct ocfs2_super *osb,
1045 struct ocfs2_alloc_context **ac)
1046{
1047 int status;
1048 int slot = ocfs2_get_inode_steal_slot(osb);
1049 u64 alloc_group;
1050
1051 *ac = kzalloc(sizeof(struct ocfs2_alloc_context), GFP_KERNEL);
1052 if (!(*ac)) {
1053 status = -ENOMEM;
1054 mlog_errno(status);
1055 goto bail;
1056 }
1057
1058 (*ac)->ac_bits_wanted = 1;
1059 (*ac)->ac_which = OCFS2_AC_USE_INODE;
1060
1061 (*ac)->ac_group_search = ocfs2_block_group_search;
1062
1063 /*
1064 * stat(2) can't handle i_ino > 32bits, so we tell the
1065 * lower levels not to allocate us a block group past that
1066 * limit. The 'inode64' mount option avoids this behavior.
1067 */
1068 if (!(osb->s_mount_opt & OCFS2_MOUNT_INODE64))
1069 (*ac)->ac_max_block = (u32)~0U;
1070
1071 /*
1072 * slot is set when we successfully steal inode from other nodes.
1073 * It is reset in 3 places:
1074 * 1. when we flush the truncate log
1075 * 2. when we complete local alloc recovery.
1076 * 3. when we successfully allocate from our own slot.
1077 * After it is set, we will go on stealing inodes until we find the
1078 * need to check our slots to see whether there is some space for us.
1079 */
1080 if (slot != OCFS2_INVALID_SLOT &&
1081 atomic_read(&osb->s_num_inodes_stolen) < OCFS2_MAX_TO_STEAL)
1082 goto inode_steal;
1083
1084 atomic_set(&osb->s_num_inodes_stolen, 0);
1085 alloc_group = osb->osb_inode_alloc_group;
1086 status = ocfs2_reserve_suballoc_bits(osb, *ac,
1087 INODE_ALLOC_SYSTEM_INODE,
1088 (u32)osb->slot_num,
1089 &alloc_group,
1090 ALLOC_NEW_GROUP |
1091 ALLOC_GROUPS_FROM_GLOBAL);
1092 if (status >= 0) {
1093 status = 0;
1094
1095 spin_lock(&osb->osb_lock);
1096 osb->osb_inode_alloc_group = alloc_group;
1097 spin_unlock(&osb->osb_lock);
1098 trace_ocfs2_reserve_new_inode_new_group(
1099 (unsigned long long)alloc_group);
1100
1101 /*
1102 * Some inodes must be freed by us, so try to allocate
1103 * from our own next time.
1104 */
1105 if (slot != OCFS2_INVALID_SLOT)
1106 ocfs2_init_inode_steal_slot(osb);
1107 goto bail;
1108 } else if (status < 0 && status != -ENOSPC) {
1109 mlog_errno(status);
1110 goto bail;
1111 }
1112
1113 ocfs2_free_ac_resource(*ac);
1114
1115inode_steal:
1116 status = ocfs2_steal_inode(osb, *ac);
1117 atomic_inc(&osb->s_num_inodes_stolen);
1118 if (status < 0) {
1119 if (status != -ENOSPC)
1120 mlog_errno(status);
1121 goto bail;
1122 }
1123
1124 status = 0;
1125bail:
1126 if ((status < 0) && *ac) {
1127 ocfs2_free_alloc_context(*ac);
1128 *ac = NULL;
1129 }
1130
1131 if (status)
1132 mlog_errno(status);
1133 return status;
1134}
1135
1136/* local alloc code has to do the same thing, so rather than do this
1137 * twice.. */
1138int ocfs2_reserve_cluster_bitmap_bits(struct ocfs2_super *osb,
1139 struct ocfs2_alloc_context *ac)
1140{
1141 int status;
1142
1143 ac->ac_which = OCFS2_AC_USE_MAIN;
1144 ac->ac_group_search = ocfs2_cluster_group_search;
1145
1146 status = ocfs2_reserve_suballoc_bits(osb, ac,
1147 GLOBAL_BITMAP_SYSTEM_INODE,
1148 OCFS2_INVALID_SLOT, NULL,
1149 ALLOC_NEW_GROUP);
1150 if (status < 0 && status != -ENOSPC) {
1151 mlog_errno(status);
1152 goto bail;
1153 }
1154
1155bail:
1156 return status;
1157}
1158
1159/* Callers don't need to care which bitmap (local alloc or main) to
1160 * use so we figure it out for them, but unfortunately this clutters
1161 * things a bit. */
1162static int ocfs2_reserve_clusters_with_limit(struct ocfs2_super *osb,
1163 u32 bits_wanted, u64 max_block,
1164 int flags,
1165 struct ocfs2_alloc_context **ac)
1166{
1167 int status, ret = 0;
1168 int retried = 0;
1169
1170 *ac = kzalloc(sizeof(struct ocfs2_alloc_context), GFP_KERNEL);
1171 if (!(*ac)) {
1172 status = -ENOMEM;
1173 mlog_errno(status);
1174 goto bail;
1175 }
1176
1177 (*ac)->ac_bits_wanted = bits_wanted;
1178 (*ac)->ac_max_block = max_block;
1179
1180 status = -ENOSPC;
1181 if (!(flags & ALLOC_GROUPS_FROM_GLOBAL) &&
1182 ocfs2_alloc_should_use_local(osb, bits_wanted)) {
1183 status = ocfs2_reserve_local_alloc_bits(osb,
1184 bits_wanted,
1185 *ac);
1186 if ((status < 0) && (status != -ENOSPC)) {
1187 mlog_errno(status);
1188 goto bail;
1189 }
1190 }
1191
1192 if (status == -ENOSPC) {
1193retry:
1194 status = ocfs2_reserve_cluster_bitmap_bits(osb, *ac);
1195 /* Retry if there is sufficient space cached in truncate log */
1196 if (status == -ENOSPC && !retried) {
1197 retried = 1;
1198 ocfs2_inode_unlock((*ac)->ac_inode, 1);
1199 inode_unlock((*ac)->ac_inode);
1200
1201 ret = ocfs2_try_to_free_truncate_log(osb, bits_wanted);
1202 if (ret == 1) {
1203 iput((*ac)->ac_inode);
1204 (*ac)->ac_inode = NULL;
1205 goto retry;
1206 }
1207
1208 if (ret < 0)
1209 mlog_errno(ret);
1210
1211 inode_lock((*ac)->ac_inode);
1212 ret = ocfs2_inode_lock((*ac)->ac_inode, NULL, 1);
1213 if (ret < 0) {
1214 mlog_errno(ret);
1215 inode_unlock((*ac)->ac_inode);
1216 iput((*ac)->ac_inode);
1217 (*ac)->ac_inode = NULL;
1218 goto bail;
1219 }
1220 }
1221 if (status < 0) {
1222 if (status != -ENOSPC)
1223 mlog_errno(status);
1224 goto bail;
1225 }
1226 }
1227
1228 status = 0;
1229bail:
1230 if ((status < 0) && *ac) {
1231 ocfs2_free_alloc_context(*ac);
1232 *ac = NULL;
1233 }
1234
1235 if (status)
1236 mlog_errno(status);
1237 return status;
1238}
1239
1240int ocfs2_reserve_clusters(struct ocfs2_super *osb,
1241 u32 bits_wanted,
1242 struct ocfs2_alloc_context **ac)
1243{
1244 return ocfs2_reserve_clusters_with_limit(osb, bits_wanted, 0,
1245 ALLOC_NEW_GROUP, ac);
1246}
1247
1248/*
1249 * More or less lifted from ext3. I'll leave their description below:
1250 *
1251 * "For ext3 allocations, we must not reuse any blocks which are
1252 * allocated in the bitmap buffer's "last committed data" copy. This
1253 * prevents deletes from freeing up the page for reuse until we have
1254 * committed the delete transaction.
1255 *
1256 * If we didn't do this, then deleting something and reallocating it as
1257 * data would allow the old block to be overwritten before the
1258 * transaction committed (because we force data to disk before commit).
1259 * This would lead to corruption if we crashed between overwriting the
1260 * data and committing the delete.
1261 *
1262 * @@@ We may want to make this allocation behaviour conditional on
1263 * data-writes at some point, and disable it for metadata allocations or
1264 * sync-data inodes."
1265 *
1266 * Note: OCFS2 already does this differently for metadata vs data
1267 * allocations, as those bitmaps are separate and undo access is never
1268 * called on a metadata group descriptor.
1269 */
1270static int ocfs2_test_bg_bit_allocatable(struct buffer_head *bg_bh,
1271 int nr)
1272{
1273 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
1274 int ret;
1275
1276 if (ocfs2_test_bit(nr, (unsigned long *)bg->bg_bitmap))
1277 return 0;
1278
1279 if (!buffer_jbd(bg_bh))
1280 return 1;
1281
1282 jbd_lock_bh_state(bg_bh);
1283 bg = (struct ocfs2_group_desc *) bh2jh(bg_bh)->b_committed_data;
1284 if (bg)
1285 ret = !ocfs2_test_bit(nr, (unsigned long *)bg->bg_bitmap);
1286 else
1287 ret = 1;
1288 jbd_unlock_bh_state(bg_bh);
1289
1290 return ret;
1291}
1292
1293static int ocfs2_block_group_find_clear_bits(struct ocfs2_super *osb,
1294 struct buffer_head *bg_bh,
1295 unsigned int bits_wanted,
1296 unsigned int total_bits,
1297 struct ocfs2_suballoc_result *res)
1298{
1299 void *bitmap;
1300 u16 best_offset, best_size;
1301 int offset, start, found, status = 0;
1302 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
1303
1304 /* Callers got this descriptor from
1305 * ocfs2_read_group_descriptor(). Any corruption is a code bug. */
1306 BUG_ON(!OCFS2_IS_VALID_GROUP_DESC(bg));
1307
1308 found = start = best_offset = best_size = 0;
1309 bitmap = bg->bg_bitmap;
1310
1311 while((offset = ocfs2_find_next_zero_bit(bitmap, total_bits, start)) != -1) {
1312 if (offset == total_bits)
1313 break;
1314
1315 if (!ocfs2_test_bg_bit_allocatable(bg_bh, offset)) {
1316 /* We found a zero, but we can't use it as it
1317 * hasn't been put to disk yet! */
1318 found = 0;
1319 start = offset + 1;
1320 } else if (offset == start) {
1321 /* we found a zero */
1322 found++;
1323 /* move start to the next bit to test */
1324 start++;
1325 } else {
1326 /* got a zero after some ones */
1327 found = 1;
1328 start = offset + 1;
1329 }
1330 if (found > best_size) {
1331 best_size = found;
1332 best_offset = start - found;
1333 }
1334 /* we got everything we needed */
1335 if (found == bits_wanted) {
1336 /* mlog(0, "Found it all!\n"); */
1337 break;
1338 }
1339 }
1340
1341 if (best_size) {
1342 res->sr_bit_offset = best_offset;
1343 res->sr_bits = best_size;
1344 } else {
1345 status = -ENOSPC;
1346 /* No error log here -- see the comment above
1347 * ocfs2_test_bg_bit_allocatable */
1348 }
1349
1350 return status;
1351}
1352
1353int ocfs2_block_group_set_bits(handle_t *handle,
1354 struct inode *alloc_inode,
1355 struct ocfs2_group_desc *bg,
1356 struct buffer_head *group_bh,
1357 unsigned int bit_off,
1358 unsigned int num_bits)
1359{
1360 int status;
1361 void *bitmap = bg->bg_bitmap;
1362 int journal_type = OCFS2_JOURNAL_ACCESS_WRITE;
1363
1364 /* All callers get the descriptor via
1365 * ocfs2_read_group_descriptor(). Any corruption is a code bug. */
1366 BUG_ON(!OCFS2_IS_VALID_GROUP_DESC(bg));
1367 BUG_ON(le16_to_cpu(bg->bg_free_bits_count) < num_bits);
1368
1369 trace_ocfs2_block_group_set_bits(bit_off, num_bits);
1370
1371 if (ocfs2_is_cluster_bitmap(alloc_inode))
1372 journal_type = OCFS2_JOURNAL_ACCESS_UNDO;
1373
1374 status = ocfs2_journal_access_gd(handle,
1375 INODE_CACHE(alloc_inode),
1376 group_bh,
1377 journal_type);
1378 if (status < 0) {
1379 mlog_errno(status);
1380 goto bail;
1381 }
1382
1383 le16_add_cpu(&bg->bg_free_bits_count, -num_bits);
1384 if (le16_to_cpu(bg->bg_free_bits_count) > le16_to_cpu(bg->bg_bits)) {
1385 return ocfs2_error(alloc_inode->i_sb, "Group descriptor # %llu has bit count %u but claims %u are freed. num_bits %d\n",
1386 (unsigned long long)le64_to_cpu(bg->bg_blkno),
1387 le16_to_cpu(bg->bg_bits),
1388 le16_to_cpu(bg->bg_free_bits_count),
1389 num_bits);
1390 }
1391 while(num_bits--)
1392 ocfs2_set_bit(bit_off++, bitmap);
1393
1394 ocfs2_journal_dirty(handle, group_bh);
1395
1396bail:
1397 return status;
1398}
1399
1400/* find the one with the most empty bits */
1401static inline u16 ocfs2_find_victim_chain(struct ocfs2_chain_list *cl)
1402{
1403 u16 curr, best;
1404
1405 BUG_ON(!cl->cl_next_free_rec);
1406
1407 best = curr = 0;
1408 while (curr < le16_to_cpu(cl->cl_next_free_rec)) {
1409 if (le32_to_cpu(cl->cl_recs[curr].c_free) >
1410 le32_to_cpu(cl->cl_recs[best].c_free))
1411 best = curr;
1412 curr++;
1413 }
1414
1415 BUG_ON(best >= le16_to_cpu(cl->cl_next_free_rec));
1416 return best;
1417}
1418
1419static int ocfs2_relink_block_group(handle_t *handle,
1420 struct inode *alloc_inode,
1421 struct buffer_head *fe_bh,
1422 struct buffer_head *bg_bh,
1423 struct buffer_head *prev_bg_bh,
1424 u16 chain)
1425{
1426 int status;
1427 /* there is a really tiny chance the journal calls could fail,
1428 * but we wouldn't want inconsistent blocks in *any* case. */
1429 u64 bg_ptr, prev_bg_ptr;
1430 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) fe_bh->b_data;
1431 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
1432 struct ocfs2_group_desc *prev_bg = (struct ocfs2_group_desc *) prev_bg_bh->b_data;
1433
1434 /* The caller got these descriptors from
1435 * ocfs2_read_group_descriptor(). Any corruption is a code bug. */
1436 BUG_ON(!OCFS2_IS_VALID_GROUP_DESC(bg));
1437 BUG_ON(!OCFS2_IS_VALID_GROUP_DESC(prev_bg));
1438
1439 trace_ocfs2_relink_block_group(
1440 (unsigned long long)le64_to_cpu(fe->i_blkno), chain,
1441 (unsigned long long)le64_to_cpu(bg->bg_blkno),
1442 (unsigned long long)le64_to_cpu(prev_bg->bg_blkno));
1443
1444 bg_ptr = le64_to_cpu(bg->bg_next_group);
1445 prev_bg_ptr = le64_to_cpu(prev_bg->bg_next_group);
1446
1447 status = ocfs2_journal_access_gd(handle, INODE_CACHE(alloc_inode),
1448 prev_bg_bh,
1449 OCFS2_JOURNAL_ACCESS_WRITE);
1450 if (status < 0)
1451 goto out;
1452
1453 prev_bg->bg_next_group = bg->bg_next_group;
1454 ocfs2_journal_dirty(handle, prev_bg_bh);
1455
1456 status = ocfs2_journal_access_gd(handle, INODE_CACHE(alloc_inode),
1457 bg_bh, OCFS2_JOURNAL_ACCESS_WRITE);
1458 if (status < 0)
1459 goto out_rollback_prev_bg;
1460
1461 bg->bg_next_group = fe->id2.i_chain.cl_recs[chain].c_blkno;
1462 ocfs2_journal_dirty(handle, bg_bh);
1463
1464 status = ocfs2_journal_access_di(handle, INODE_CACHE(alloc_inode),
1465 fe_bh, OCFS2_JOURNAL_ACCESS_WRITE);
1466 if (status < 0)
1467 goto out_rollback_bg;
1468
1469 fe->id2.i_chain.cl_recs[chain].c_blkno = bg->bg_blkno;
1470 ocfs2_journal_dirty(handle, fe_bh);
1471
1472out:
1473 if (status < 0)
1474 mlog_errno(status);
1475 return status;
1476
1477out_rollback_bg:
1478 bg->bg_next_group = cpu_to_le64(bg_ptr);
1479out_rollback_prev_bg:
1480 prev_bg->bg_next_group = cpu_to_le64(prev_bg_ptr);
1481 goto out;
1482}
1483
1484static inline int ocfs2_block_group_reasonably_empty(struct ocfs2_group_desc *bg,
1485 u32 wanted)
1486{
1487 return le16_to_cpu(bg->bg_free_bits_count) > wanted;
1488}
1489
1490/* return 0 on success, -ENOSPC to keep searching and any other < 0
1491 * value on error. */
1492static int ocfs2_cluster_group_search(struct inode *inode,
1493 struct buffer_head *group_bh,
1494 u32 bits_wanted, u32 min_bits,
1495 u64 max_block,
1496 struct ocfs2_suballoc_result *res)
1497{
1498 int search = -ENOSPC;
1499 int ret;
1500 u64 blkoff;
1501 struct ocfs2_group_desc *gd = (struct ocfs2_group_desc *) group_bh->b_data;
1502 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
1503 unsigned int max_bits, gd_cluster_off;
1504
1505 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
1506
1507 if (gd->bg_free_bits_count) {
1508 max_bits = le16_to_cpu(gd->bg_bits);
1509
1510 /* Tail groups in cluster bitmaps which aren't cpg
1511 * aligned are prone to partial extension by a failed
1512 * fs resize. If the file system resize never got to
1513 * update the dinode cluster count, then we don't want
1514 * to trust any clusters past it, regardless of what
1515 * the group descriptor says. */
1516 gd_cluster_off = ocfs2_blocks_to_clusters(inode->i_sb,
1517 le64_to_cpu(gd->bg_blkno));
1518 if ((gd_cluster_off + max_bits) >
1519 OCFS2_I(inode)->ip_clusters) {
1520 max_bits = OCFS2_I(inode)->ip_clusters - gd_cluster_off;
1521 trace_ocfs2_cluster_group_search_wrong_max_bits(
1522 (unsigned long long)le64_to_cpu(gd->bg_blkno),
1523 le16_to_cpu(gd->bg_bits),
1524 OCFS2_I(inode)->ip_clusters, max_bits);
1525 }
1526
1527 ret = ocfs2_block_group_find_clear_bits(OCFS2_SB(inode->i_sb),
1528 group_bh, bits_wanted,
1529 max_bits, res);
1530 if (ret)
1531 return ret;
1532
1533 if (max_block) {
1534 blkoff = ocfs2_clusters_to_blocks(inode->i_sb,
1535 gd_cluster_off +
1536 res->sr_bit_offset +
1537 res->sr_bits);
1538 trace_ocfs2_cluster_group_search_max_block(
1539 (unsigned long long)blkoff,
1540 (unsigned long long)max_block);
1541 if (blkoff > max_block)
1542 return -ENOSPC;
1543 }
1544
1545 /* ocfs2_block_group_find_clear_bits() might
1546 * return success, but we still want to return
1547 * -ENOSPC unless it found the minimum number
1548 * of bits. */
1549 if (min_bits <= res->sr_bits)
1550 search = 0; /* success */
1551 else if (res->sr_bits) {
1552 /*
1553 * Don't show bits which we'll be returning
1554 * for allocation to the local alloc bitmap.
1555 */
1556 ocfs2_local_alloc_seen_free_bits(osb, res->sr_bits);
1557 }
1558 }
1559
1560 return search;
1561}
1562
1563static int ocfs2_block_group_search(struct inode *inode,
1564 struct buffer_head *group_bh,
1565 u32 bits_wanted, u32 min_bits,
1566 u64 max_block,
1567 struct ocfs2_suballoc_result *res)
1568{
1569 int ret = -ENOSPC;
1570 u64 blkoff;
1571 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) group_bh->b_data;
1572
1573 BUG_ON(min_bits != 1);
1574 BUG_ON(ocfs2_is_cluster_bitmap(inode));
1575
1576 if (bg->bg_free_bits_count) {
1577 ret = ocfs2_block_group_find_clear_bits(OCFS2_SB(inode->i_sb),
1578 group_bh, bits_wanted,
1579 le16_to_cpu(bg->bg_bits),
1580 res);
1581 if (!ret && max_block) {
1582 blkoff = le64_to_cpu(bg->bg_blkno) +
1583 res->sr_bit_offset + res->sr_bits;
1584 trace_ocfs2_block_group_search_max_block(
1585 (unsigned long long)blkoff,
1586 (unsigned long long)max_block);
1587 if (blkoff > max_block)
1588 ret = -ENOSPC;
1589 }
1590 }
1591
1592 return ret;
1593}
1594
1595int ocfs2_alloc_dinode_update_counts(struct inode *inode,
1596 handle_t *handle,
1597 struct buffer_head *di_bh,
1598 u32 num_bits,
1599 u16 chain)
1600{
1601 int ret;
1602 u32 tmp_used;
1603 struct ocfs2_dinode *di = (struct ocfs2_dinode *) di_bh->b_data;
1604 struct ocfs2_chain_list *cl = (struct ocfs2_chain_list *) &di->id2.i_chain;
1605
1606 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
1607 OCFS2_JOURNAL_ACCESS_WRITE);
1608 if (ret < 0) {
1609 mlog_errno(ret);
1610 goto out;
1611 }
1612
1613 tmp_used = le32_to_cpu(di->id1.bitmap1.i_used);
1614 di->id1.bitmap1.i_used = cpu_to_le32(num_bits + tmp_used);
1615 le32_add_cpu(&cl->cl_recs[chain].c_free, -num_bits);
1616 ocfs2_journal_dirty(handle, di_bh);
1617
1618out:
1619 return ret;
1620}
1621
1622void ocfs2_rollback_alloc_dinode_counts(struct inode *inode,
1623 struct buffer_head *di_bh,
1624 u32 num_bits,
1625 u16 chain)
1626{
1627 u32 tmp_used;
1628 struct ocfs2_dinode *di = (struct ocfs2_dinode *) di_bh->b_data;
1629 struct ocfs2_chain_list *cl;
1630
1631 cl = (struct ocfs2_chain_list *)&di->id2.i_chain;
1632 tmp_used = le32_to_cpu(di->id1.bitmap1.i_used);
1633 di->id1.bitmap1.i_used = cpu_to_le32(tmp_used - num_bits);
1634 le32_add_cpu(&cl->cl_recs[chain].c_free, num_bits);
1635}
1636
1637static int ocfs2_bg_discontig_fix_by_rec(struct ocfs2_suballoc_result *res,
1638 struct ocfs2_extent_rec *rec,
1639 struct ocfs2_chain_list *cl)
1640{
1641 unsigned int bpc = le16_to_cpu(cl->cl_bpc);
1642 unsigned int bitoff = le32_to_cpu(rec->e_cpos) * bpc;
1643 unsigned int bitcount = le16_to_cpu(rec->e_leaf_clusters) * bpc;
1644
1645 if (res->sr_bit_offset < bitoff)
1646 return 0;
1647 if (res->sr_bit_offset >= (bitoff + bitcount))
1648 return 0;
1649 res->sr_blkno = le64_to_cpu(rec->e_blkno) +
1650 (res->sr_bit_offset - bitoff);
1651 if ((res->sr_bit_offset + res->sr_bits) > (bitoff + bitcount))
1652 res->sr_bits = (bitoff + bitcount) - res->sr_bit_offset;
1653 return 1;
1654}
1655
1656static void ocfs2_bg_discontig_fix_result(struct ocfs2_alloc_context *ac,
1657 struct ocfs2_group_desc *bg,
1658 struct ocfs2_suballoc_result *res)
1659{
1660 int i;
1661 u64 bg_blkno = res->sr_bg_blkno; /* Save off */
1662 struct ocfs2_extent_rec *rec;
1663 struct ocfs2_dinode *di = (struct ocfs2_dinode *)ac->ac_bh->b_data;
1664 struct ocfs2_chain_list *cl = &di->id2.i_chain;
1665
1666 if (ocfs2_is_cluster_bitmap(ac->ac_inode)) {
1667 res->sr_blkno = 0;
1668 return;
1669 }
1670
1671 res->sr_blkno = res->sr_bg_blkno + res->sr_bit_offset;
1672 res->sr_bg_blkno = 0; /* Clear it for contig block groups */
1673 if (!ocfs2_supports_discontig_bg(OCFS2_SB(ac->ac_inode->i_sb)) ||
1674 !bg->bg_list.l_next_free_rec)
1675 return;
1676
1677 for (i = 0; i < le16_to_cpu(bg->bg_list.l_next_free_rec); i++) {
1678 rec = &bg->bg_list.l_recs[i];
1679 if (ocfs2_bg_discontig_fix_by_rec(res, rec, cl)) {
1680 res->sr_bg_blkno = bg_blkno; /* Restore */
1681 break;
1682 }
1683 }
1684}
1685
1686static int ocfs2_search_one_group(struct ocfs2_alloc_context *ac,
1687 handle_t *handle,
1688 u32 bits_wanted,
1689 u32 min_bits,
1690 struct ocfs2_suballoc_result *res,
1691 u16 *bits_left)
1692{
1693 int ret;
1694 struct buffer_head *group_bh = NULL;
1695 struct ocfs2_group_desc *gd;
1696 struct ocfs2_dinode *di = (struct ocfs2_dinode *)ac->ac_bh->b_data;
1697 struct inode *alloc_inode = ac->ac_inode;
1698
1699 ret = ocfs2_read_group_descriptor(alloc_inode, di,
1700 res->sr_bg_blkno, &group_bh);
1701 if (ret < 0) {
1702 mlog_errno(ret);
1703 return ret;
1704 }
1705
1706 gd = (struct ocfs2_group_desc *) group_bh->b_data;
1707 ret = ac->ac_group_search(alloc_inode, group_bh, bits_wanted, min_bits,
1708 ac->ac_max_block, res);
1709 if (ret < 0) {
1710 if (ret != -ENOSPC)
1711 mlog_errno(ret);
1712 goto out;
1713 }
1714
1715 if (!ret)
1716 ocfs2_bg_discontig_fix_result(ac, gd, res);
1717
1718 /*
1719 * sr_bg_blkno might have been changed by
1720 * ocfs2_bg_discontig_fix_result
1721 */
1722 res->sr_bg_stable_blkno = group_bh->b_blocknr;
1723
1724 if (ac->ac_find_loc_only)
1725 goto out_loc_only;
1726
1727 ret = ocfs2_alloc_dinode_update_counts(alloc_inode, handle, ac->ac_bh,
1728 res->sr_bits,
1729 le16_to_cpu(gd->bg_chain));
1730 if (ret < 0) {
1731 mlog_errno(ret);
1732 goto out;
1733 }
1734
1735 ret = ocfs2_block_group_set_bits(handle, alloc_inode, gd, group_bh,
1736 res->sr_bit_offset, res->sr_bits);
1737 if (ret < 0) {
1738 ocfs2_rollback_alloc_dinode_counts(alloc_inode, ac->ac_bh,
1739 res->sr_bits,
1740 le16_to_cpu(gd->bg_chain));
1741 mlog_errno(ret);
1742 }
1743
1744out_loc_only:
1745 *bits_left = le16_to_cpu(gd->bg_free_bits_count);
1746
1747out:
1748 brelse(group_bh);
1749
1750 return ret;
1751}
1752
1753static int ocfs2_search_chain(struct ocfs2_alloc_context *ac,
1754 handle_t *handle,
1755 u32 bits_wanted,
1756 u32 min_bits,
1757 struct ocfs2_suballoc_result *res,
1758 u16 *bits_left)
1759{
1760 int status;
1761 u16 chain;
1762 u64 next_group;
1763 struct inode *alloc_inode = ac->ac_inode;
1764 struct buffer_head *group_bh = NULL;
1765 struct buffer_head *prev_group_bh = NULL;
1766 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) ac->ac_bh->b_data;
1767 struct ocfs2_chain_list *cl = (struct ocfs2_chain_list *) &fe->id2.i_chain;
1768 struct ocfs2_group_desc *bg;
1769
1770 chain = ac->ac_chain;
1771 trace_ocfs2_search_chain_begin(
1772 (unsigned long long)OCFS2_I(alloc_inode)->ip_blkno,
1773 bits_wanted, chain);
1774
1775 status = ocfs2_read_group_descriptor(alloc_inode, fe,
1776 le64_to_cpu(cl->cl_recs[chain].c_blkno),
1777 &group_bh);
1778 if (status < 0) {
1779 mlog_errno(status);
1780 goto bail;
1781 }
1782 bg = (struct ocfs2_group_desc *) group_bh->b_data;
1783
1784 status = -ENOSPC;
1785 /* for now, the chain search is a bit simplistic. We just use
1786 * the 1st group with any empty bits. */
1787 while ((status = ac->ac_group_search(alloc_inode, group_bh,
1788 bits_wanted, min_bits,
1789 ac->ac_max_block,
1790 res)) == -ENOSPC) {
1791 if (!bg->bg_next_group)
1792 break;
1793
1794 brelse(prev_group_bh);
1795 prev_group_bh = NULL;
1796
1797 next_group = le64_to_cpu(bg->bg_next_group);
1798 prev_group_bh = group_bh;
1799 group_bh = NULL;
1800 status = ocfs2_read_group_descriptor(alloc_inode, fe,
1801 next_group, &group_bh);
1802 if (status < 0) {
1803 mlog_errno(status);
1804 goto bail;
1805 }
1806 bg = (struct ocfs2_group_desc *) group_bh->b_data;
1807 }
1808 if (status < 0) {
1809 if (status != -ENOSPC)
1810 mlog_errno(status);
1811 goto bail;
1812 }
1813
1814 trace_ocfs2_search_chain_succ(
1815 (unsigned long long)le64_to_cpu(bg->bg_blkno), res->sr_bits);
1816
1817 res->sr_bg_blkno = le64_to_cpu(bg->bg_blkno);
1818
1819 BUG_ON(res->sr_bits == 0);
1820 if (!status)
1821 ocfs2_bg_discontig_fix_result(ac, bg, res);
1822
1823 /*
1824 * sr_bg_blkno might have been changed by
1825 * ocfs2_bg_discontig_fix_result
1826 */
1827 res->sr_bg_stable_blkno = group_bh->b_blocknr;
1828
1829 /*
1830 * Keep track of previous block descriptor read. When
1831 * we find a target, if we have read more than X
1832 * number of descriptors, and the target is reasonably
1833 * empty, relink him to top of his chain.
1834 *
1835 * We've read 0 extra blocks and only send one more to
1836 * the transaction, yet the next guy to search has a
1837 * much easier time.
1838 *
1839 * Do this *after* figuring out how many bits we're taking out
1840 * of our target group.
1841 */
1842 if (!ac->ac_disable_chain_relink &&
1843 (prev_group_bh) &&
1844 (ocfs2_block_group_reasonably_empty(bg, res->sr_bits))) {
1845 status = ocfs2_relink_block_group(handle, alloc_inode,
1846 ac->ac_bh, group_bh,
1847 prev_group_bh, chain);
1848 if (status < 0) {
1849 mlog_errno(status);
1850 goto bail;
1851 }
1852 }
1853
1854 if (ac->ac_find_loc_only)
1855 goto out_loc_only;
1856
1857 status = ocfs2_alloc_dinode_update_counts(alloc_inode, handle,
1858 ac->ac_bh, res->sr_bits,
1859 chain);
1860 if (status) {
1861 mlog_errno(status);
1862 goto bail;
1863 }
1864
1865 status = ocfs2_block_group_set_bits(handle,
1866 alloc_inode,
1867 bg,
1868 group_bh,
1869 res->sr_bit_offset,
1870 res->sr_bits);
1871 if (status < 0) {
1872 ocfs2_rollback_alloc_dinode_counts(alloc_inode,
1873 ac->ac_bh, res->sr_bits, chain);
1874 mlog_errno(status);
1875 goto bail;
1876 }
1877
1878 trace_ocfs2_search_chain_end(
1879 (unsigned long long)le64_to_cpu(fe->i_blkno),
1880 res->sr_bits);
1881
1882out_loc_only:
1883 *bits_left = le16_to_cpu(bg->bg_free_bits_count);
1884bail:
1885 brelse(group_bh);
1886 brelse(prev_group_bh);
1887
1888 if (status)
1889 mlog_errno(status);
1890 return status;
1891}
1892
1893/* will give out up to bits_wanted contiguous bits. */
1894static int ocfs2_claim_suballoc_bits(struct ocfs2_alloc_context *ac,
1895 handle_t *handle,
1896 u32 bits_wanted,
1897 u32 min_bits,
1898 struct ocfs2_suballoc_result *res)
1899{
1900 int status;
1901 u16 victim, i;
1902 u16 bits_left = 0;
1903 u64 hint = ac->ac_last_group;
1904 struct ocfs2_chain_list *cl;
1905 struct ocfs2_dinode *fe;
1906
1907 BUG_ON(ac->ac_bits_given >= ac->ac_bits_wanted);
1908 BUG_ON(bits_wanted > (ac->ac_bits_wanted - ac->ac_bits_given));
1909 BUG_ON(!ac->ac_bh);
1910
1911 fe = (struct ocfs2_dinode *) ac->ac_bh->b_data;
1912
1913 /* The bh was validated by the inode read during
1914 * ocfs2_reserve_suballoc_bits(). Any corruption is a code bug. */
1915 BUG_ON(!OCFS2_IS_VALID_DINODE(fe));
1916
1917 if (le32_to_cpu(fe->id1.bitmap1.i_used) >=
1918 le32_to_cpu(fe->id1.bitmap1.i_total)) {
1919 status = ocfs2_error(ac->ac_inode->i_sb,
1920 "Chain allocator dinode %llu has %u used bits but only %u total\n",
1921 (unsigned long long)le64_to_cpu(fe->i_blkno),
1922 le32_to_cpu(fe->id1.bitmap1.i_used),
1923 le32_to_cpu(fe->id1.bitmap1.i_total));
1924 goto bail;
1925 }
1926
1927 res->sr_bg_blkno = hint;
1928 if (res->sr_bg_blkno) {
1929 /* Attempt to short-circuit the usual search mechanism
1930 * by jumping straight to the most recently used
1931 * allocation group. This helps us maintain some
1932 * contiguousness across allocations. */
1933 status = ocfs2_search_one_group(ac, handle, bits_wanted,
1934 min_bits, res, &bits_left);
1935 if (!status)
1936 goto set_hint;
1937 if (status < 0 && status != -ENOSPC) {
1938 mlog_errno(status);
1939 goto bail;
1940 }
1941 }
1942
1943 cl = (struct ocfs2_chain_list *) &fe->id2.i_chain;
1944
1945 victim = ocfs2_find_victim_chain(cl);
1946 ac->ac_chain = victim;
1947
1948 status = ocfs2_search_chain(ac, handle, bits_wanted, min_bits,
1949 res, &bits_left);
1950 if (!status) {
1951 if (ocfs2_is_cluster_bitmap(ac->ac_inode))
1952 hint = res->sr_bg_blkno;
1953 else
1954 hint = ocfs2_group_from_res(res);
1955 goto set_hint;
1956 }
1957 if (status < 0 && status != -ENOSPC) {
1958 mlog_errno(status);
1959 goto bail;
1960 }
1961
1962 trace_ocfs2_claim_suballoc_bits(victim);
1963
1964 /* If we didn't pick a good victim, then just default to
1965 * searching each chain in order. Don't allow chain relinking
1966 * because we only calculate enough journal credits for one
1967 * relink per alloc. */
1968 ac->ac_disable_chain_relink = 1;
1969 for (i = 0; i < le16_to_cpu(cl->cl_next_free_rec); i ++) {
1970 if (i == victim)
1971 continue;
1972 if (!cl->cl_recs[i].c_free)
1973 continue;
1974
1975 ac->ac_chain = i;
1976 status = ocfs2_search_chain(ac, handle, bits_wanted, min_bits,
1977 res, &bits_left);
1978 if (!status) {
1979 hint = ocfs2_group_from_res(res);
1980 break;
1981 }
1982 if (status < 0 && status != -ENOSPC) {
1983 mlog_errno(status);
1984 goto bail;
1985 }
1986 }
1987
1988set_hint:
1989 if (status != -ENOSPC) {
1990 /* If the next search of this group is not likely to
1991 * yield a suitable extent, then we reset the last
1992 * group hint so as to not waste a disk read */
1993 if (bits_left < min_bits)
1994 ac->ac_last_group = 0;
1995 else
1996 ac->ac_last_group = hint;
1997 }
1998
1999bail:
2000 if (status)
2001 mlog_errno(status);
2002 return status;
2003}
2004
2005int ocfs2_claim_metadata(handle_t *handle,
2006 struct ocfs2_alloc_context *ac,
2007 u32 bits_wanted,
2008 u64 *suballoc_loc,
2009 u16 *suballoc_bit_start,
2010 unsigned int *num_bits,
2011 u64 *blkno_start)
2012{
2013 int status;
2014 struct ocfs2_suballoc_result res = { .sr_blkno = 0, };
2015
2016 BUG_ON(!ac);
2017 BUG_ON(ac->ac_bits_wanted < (ac->ac_bits_given + bits_wanted));
2018 BUG_ON(ac->ac_which != OCFS2_AC_USE_META);
2019
2020 status = ocfs2_claim_suballoc_bits(ac,
2021 handle,
2022 bits_wanted,
2023 1,
2024 &res);
2025 if (status < 0) {
2026 mlog_errno(status);
2027 goto bail;
2028 }
2029 atomic_inc(&OCFS2_SB(ac->ac_inode->i_sb)->alloc_stats.bg_allocs);
2030
2031 *suballoc_loc = res.sr_bg_blkno;
2032 *suballoc_bit_start = res.sr_bit_offset;
2033 *blkno_start = res.sr_blkno;
2034 ac->ac_bits_given += res.sr_bits;
2035 *num_bits = res.sr_bits;
2036 status = 0;
2037bail:
2038 if (status)
2039 mlog_errno(status);
2040 return status;
2041}
2042
2043static void ocfs2_init_inode_ac_group(struct inode *dir,
2044 struct buffer_head *parent_di_bh,
2045 struct ocfs2_alloc_context *ac)
2046{
2047 struct ocfs2_dinode *di = (struct ocfs2_dinode *)parent_di_bh->b_data;
2048 /*
2049 * Try to allocate inodes from some specific group.
2050 *
2051 * If the parent dir has recorded the last group used in allocation,
2052 * cool, use it. Otherwise if we try to allocate new inode from the
2053 * same slot the parent dir belongs to, use the same chunk.
2054 *
2055 * We are very careful here to avoid the mistake of setting
2056 * ac_last_group to a group descriptor from a different (unlocked) slot.
2057 */
2058 if (OCFS2_I(dir)->ip_last_used_group &&
2059 OCFS2_I(dir)->ip_last_used_slot == ac->ac_alloc_slot)
2060 ac->ac_last_group = OCFS2_I(dir)->ip_last_used_group;
2061 else if (le16_to_cpu(di->i_suballoc_slot) == ac->ac_alloc_slot) {
2062 if (di->i_suballoc_loc)
2063 ac->ac_last_group = le64_to_cpu(di->i_suballoc_loc);
2064 else
2065 ac->ac_last_group = ocfs2_which_suballoc_group(
2066 le64_to_cpu(di->i_blkno),
2067 le16_to_cpu(di->i_suballoc_bit));
2068 }
2069}
2070
2071static inline void ocfs2_save_inode_ac_group(struct inode *dir,
2072 struct ocfs2_alloc_context *ac)
2073{
2074 OCFS2_I(dir)->ip_last_used_group = ac->ac_last_group;
2075 OCFS2_I(dir)->ip_last_used_slot = ac->ac_alloc_slot;
2076}
2077
2078int ocfs2_find_new_inode_loc(struct inode *dir,
2079 struct buffer_head *parent_fe_bh,
2080 struct ocfs2_alloc_context *ac,
2081 u64 *fe_blkno)
2082{
2083 int ret;
2084 handle_t *handle = NULL;
2085 struct ocfs2_suballoc_result *res;
2086
2087 BUG_ON(!ac);
2088 BUG_ON(ac->ac_bits_given != 0);
2089 BUG_ON(ac->ac_bits_wanted != 1);
2090 BUG_ON(ac->ac_which != OCFS2_AC_USE_INODE);
2091
2092 res = kzalloc(sizeof(*res), GFP_NOFS);
2093 if (res == NULL) {
2094 ret = -ENOMEM;
2095 mlog_errno(ret);
2096 goto out;
2097 }
2098
2099 ocfs2_init_inode_ac_group(dir, parent_fe_bh, ac);
2100
2101 /*
2102 * The handle started here is for chain relink. Alternatively,
2103 * we could just disable relink for these calls.
2104 */
2105 handle = ocfs2_start_trans(OCFS2_SB(dir->i_sb), OCFS2_SUBALLOC_ALLOC);
2106 if (IS_ERR(handle)) {
2107 ret = PTR_ERR(handle);
2108 handle = NULL;
2109 mlog_errno(ret);
2110 goto out;
2111 }
2112
2113 /*
2114 * This will instruct ocfs2_claim_suballoc_bits and
2115 * ocfs2_search_one_group to search but save actual allocation
2116 * for later.
2117 */
2118 ac->ac_find_loc_only = 1;
2119
2120 ret = ocfs2_claim_suballoc_bits(ac, handle, 1, 1, res);
2121 if (ret < 0) {
2122 mlog_errno(ret);
2123 goto out;
2124 }
2125
2126 ac->ac_find_loc_priv = res;
2127 *fe_blkno = res->sr_blkno;
2128 ocfs2_update_inode_fsync_trans(handle, dir, 0);
2129out:
2130 if (handle)
2131 ocfs2_commit_trans(OCFS2_SB(dir->i_sb), handle);
2132
2133 if (ret)
2134 kfree(res);
2135
2136 return ret;
2137}
2138
2139int ocfs2_claim_new_inode_at_loc(handle_t *handle,
2140 struct inode *dir,
2141 struct ocfs2_alloc_context *ac,
2142 u64 *suballoc_loc,
2143 u16 *suballoc_bit,
2144 u64 di_blkno)
2145{
2146 int ret;
2147 u16 chain;
2148 struct ocfs2_suballoc_result *res = ac->ac_find_loc_priv;
2149 struct buffer_head *bg_bh = NULL;
2150 struct ocfs2_group_desc *bg;
2151 struct ocfs2_dinode *di = (struct ocfs2_dinode *) ac->ac_bh->b_data;
2152
2153 /*
2154 * Since di_blkno is being passed back in, we check for any
2155 * inconsistencies which may have happened between
2156 * calls. These are code bugs as di_blkno is not expected to
2157 * change once returned from ocfs2_find_new_inode_loc()
2158 */
2159 BUG_ON(res->sr_blkno != di_blkno);
2160
2161 ret = ocfs2_read_group_descriptor(ac->ac_inode, di,
2162 res->sr_bg_stable_blkno, &bg_bh);
2163 if (ret) {
2164 mlog_errno(ret);
2165 goto out;
2166 }
2167
2168 bg = (struct ocfs2_group_desc *) bg_bh->b_data;
2169 chain = le16_to_cpu(bg->bg_chain);
2170
2171 ret = ocfs2_alloc_dinode_update_counts(ac->ac_inode, handle,
2172 ac->ac_bh, res->sr_bits,
2173 chain);
2174 if (ret) {
2175 mlog_errno(ret);
2176 goto out;
2177 }
2178
2179 ret = ocfs2_block_group_set_bits(handle,
2180 ac->ac_inode,
2181 bg,
2182 bg_bh,
2183 res->sr_bit_offset,
2184 res->sr_bits);
2185 if (ret < 0) {
2186 ocfs2_rollback_alloc_dinode_counts(ac->ac_inode,
2187 ac->ac_bh, res->sr_bits, chain);
2188 mlog_errno(ret);
2189 goto out;
2190 }
2191
2192 trace_ocfs2_claim_new_inode_at_loc((unsigned long long)di_blkno,
2193 res->sr_bits);
2194
2195 atomic_inc(&OCFS2_SB(ac->ac_inode->i_sb)->alloc_stats.bg_allocs);
2196
2197 BUG_ON(res->sr_bits != 1);
2198
2199 *suballoc_loc = res->sr_bg_blkno;
2200 *suballoc_bit = res->sr_bit_offset;
2201 ac->ac_bits_given++;
2202 ocfs2_save_inode_ac_group(dir, ac);
2203
2204out:
2205 brelse(bg_bh);
2206
2207 return ret;
2208}
2209
2210int ocfs2_claim_new_inode(handle_t *handle,
2211 struct inode *dir,
2212 struct buffer_head *parent_fe_bh,
2213 struct ocfs2_alloc_context *ac,
2214 u64 *suballoc_loc,
2215 u16 *suballoc_bit,
2216 u64 *fe_blkno)
2217{
2218 int status;
2219 struct ocfs2_suballoc_result res;
2220
2221 BUG_ON(!ac);
2222 BUG_ON(ac->ac_bits_given != 0);
2223 BUG_ON(ac->ac_bits_wanted != 1);
2224 BUG_ON(ac->ac_which != OCFS2_AC_USE_INODE);
2225
2226 ocfs2_init_inode_ac_group(dir, parent_fe_bh, ac);
2227
2228 status = ocfs2_claim_suballoc_bits(ac,
2229 handle,
2230 1,
2231 1,
2232 &res);
2233 if (status < 0) {
2234 mlog_errno(status);
2235 goto bail;
2236 }
2237 atomic_inc(&OCFS2_SB(ac->ac_inode->i_sb)->alloc_stats.bg_allocs);
2238
2239 BUG_ON(res.sr_bits != 1);
2240
2241 *suballoc_loc = res.sr_bg_blkno;
2242 *suballoc_bit = res.sr_bit_offset;
2243 *fe_blkno = res.sr_blkno;
2244 ac->ac_bits_given++;
2245 ocfs2_save_inode_ac_group(dir, ac);
2246 status = 0;
2247bail:
2248 if (status)
2249 mlog_errno(status);
2250 return status;
2251}
2252
2253/* translate a group desc. blkno and it's bitmap offset into
2254 * disk cluster offset. */
2255static inline u32 ocfs2_desc_bitmap_to_cluster_off(struct inode *inode,
2256 u64 bg_blkno,
2257 u16 bg_bit_off)
2258{
2259 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2260 u32 cluster = 0;
2261
2262 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
2263
2264 if (bg_blkno != osb->first_cluster_group_blkno)
2265 cluster = ocfs2_blocks_to_clusters(inode->i_sb, bg_blkno);
2266 cluster += (u32) bg_bit_off;
2267 return cluster;
2268}
2269
2270/* given a cluster offset, calculate which block group it belongs to
2271 * and return that block offset. */
2272u64 ocfs2_which_cluster_group(struct inode *inode, u32 cluster)
2273{
2274 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2275 u32 group_no;
2276
2277 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
2278
2279 group_no = cluster / osb->bitmap_cpg;
2280 if (!group_no)
2281 return osb->first_cluster_group_blkno;
2282 return ocfs2_clusters_to_blocks(inode->i_sb,
2283 group_no * osb->bitmap_cpg);
2284}
2285
2286/* given the block number of a cluster start, calculate which cluster
2287 * group and descriptor bitmap offset that corresponds to. */
2288static inline void ocfs2_block_to_cluster_group(struct inode *inode,
2289 u64 data_blkno,
2290 u64 *bg_blkno,
2291 u16 *bg_bit_off)
2292{
2293 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2294 u32 data_cluster = ocfs2_blocks_to_clusters(osb->sb, data_blkno);
2295
2296 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
2297
2298 *bg_blkno = ocfs2_which_cluster_group(inode,
2299 data_cluster);
2300
2301 if (*bg_blkno == osb->first_cluster_group_blkno)
2302 *bg_bit_off = (u16) data_cluster;
2303 else
2304 *bg_bit_off = (u16) ocfs2_blocks_to_clusters(osb->sb,
2305 data_blkno - *bg_blkno);
2306}
2307
2308/*
2309 * min_bits - minimum contiguous chunk from this total allocation we
2310 * can handle. set to what we asked for originally for a full
2311 * contig. allocation, set to '1' to indicate we can deal with extents
2312 * of any size.
2313 */
2314int __ocfs2_claim_clusters(handle_t *handle,
2315 struct ocfs2_alloc_context *ac,
2316 u32 min_clusters,
2317 u32 max_clusters,
2318 u32 *cluster_start,
2319 u32 *num_clusters)
2320{
2321 int status;
2322 unsigned int bits_wanted = max_clusters;
2323 struct ocfs2_suballoc_result res = { .sr_blkno = 0, };
2324 struct ocfs2_super *osb = OCFS2_SB(ac->ac_inode->i_sb);
2325
2326 BUG_ON(ac->ac_bits_given >= ac->ac_bits_wanted);
2327
2328 BUG_ON(ac->ac_which != OCFS2_AC_USE_LOCAL
2329 && ac->ac_which != OCFS2_AC_USE_MAIN);
2330
2331 if (ac->ac_which == OCFS2_AC_USE_LOCAL) {
2332 WARN_ON(min_clusters > 1);
2333
2334 status = ocfs2_claim_local_alloc_bits(osb,
2335 handle,
2336 ac,
2337 bits_wanted,
2338 cluster_start,
2339 num_clusters);
2340 if (!status)
2341 atomic_inc(&osb->alloc_stats.local_data);
2342 } else {
2343 if (min_clusters > (osb->bitmap_cpg - 1)) {
2344 /* The only paths asking for contiguousness
2345 * should know about this already. */
2346 mlog(ML_ERROR, "minimum allocation requested %u exceeds "
2347 "group bitmap size %u!\n", min_clusters,
2348 osb->bitmap_cpg);
2349 status = -ENOSPC;
2350 goto bail;
2351 }
2352 /* clamp the current request down to a realistic size. */
2353 if (bits_wanted > (osb->bitmap_cpg - 1))
2354 bits_wanted = osb->bitmap_cpg - 1;
2355
2356 status = ocfs2_claim_suballoc_bits(ac,
2357 handle,
2358 bits_wanted,
2359 min_clusters,
2360 &res);
2361 if (!status) {
2362 BUG_ON(res.sr_blkno); /* cluster alloc can't set */
2363 *cluster_start =
2364 ocfs2_desc_bitmap_to_cluster_off(ac->ac_inode,
2365 res.sr_bg_blkno,
2366 res.sr_bit_offset);
2367 atomic_inc(&osb->alloc_stats.bitmap_data);
2368 *num_clusters = res.sr_bits;
2369 }
2370 }
2371 if (status < 0) {
2372 if (status != -ENOSPC)
2373 mlog_errno(status);
2374 goto bail;
2375 }
2376
2377 ac->ac_bits_given += *num_clusters;
2378
2379bail:
2380 if (status)
2381 mlog_errno(status);
2382 return status;
2383}
2384
2385int ocfs2_claim_clusters(handle_t *handle,
2386 struct ocfs2_alloc_context *ac,
2387 u32 min_clusters,
2388 u32 *cluster_start,
2389 u32 *num_clusters)
2390{
2391 unsigned int bits_wanted = ac->ac_bits_wanted - ac->ac_bits_given;
2392
2393 return __ocfs2_claim_clusters(handle, ac, min_clusters,
2394 bits_wanted, cluster_start, num_clusters);
2395}
2396
2397static int ocfs2_block_group_clear_bits(handle_t *handle,
2398 struct inode *alloc_inode,
2399 struct ocfs2_group_desc *bg,
2400 struct buffer_head *group_bh,
2401 unsigned int bit_off,
2402 unsigned int num_bits,
2403 void (*undo_fn)(unsigned int bit,
2404 unsigned long *bmap))
2405{
2406 int status;
2407 unsigned int tmp;
2408 struct ocfs2_group_desc *undo_bg = NULL;
2409
2410 /* The caller got this descriptor from
2411 * ocfs2_read_group_descriptor(). Any corruption is a code bug. */
2412 BUG_ON(!OCFS2_IS_VALID_GROUP_DESC(bg));
2413
2414 trace_ocfs2_block_group_clear_bits(bit_off, num_bits);
2415
2416 BUG_ON(undo_fn && !ocfs2_is_cluster_bitmap(alloc_inode));
2417 status = ocfs2_journal_access_gd(handle, INODE_CACHE(alloc_inode),
2418 group_bh,
2419 undo_fn ?
2420 OCFS2_JOURNAL_ACCESS_UNDO :
2421 OCFS2_JOURNAL_ACCESS_WRITE);
2422 if (status < 0) {
2423 mlog_errno(status);
2424 goto bail;
2425 }
2426
2427 if (undo_fn) {
2428 jbd_lock_bh_state(group_bh);
2429 undo_bg = (struct ocfs2_group_desc *)
2430 bh2jh(group_bh)->b_committed_data;
2431 BUG_ON(!undo_bg);
2432 }
2433
2434 tmp = num_bits;
2435 while(tmp--) {
2436 ocfs2_clear_bit((bit_off + tmp),
2437 (unsigned long *) bg->bg_bitmap);
2438 if (undo_fn)
2439 undo_fn(bit_off + tmp,
2440 (unsigned long *) undo_bg->bg_bitmap);
2441 }
2442 le16_add_cpu(&bg->bg_free_bits_count, num_bits);
2443 if (le16_to_cpu(bg->bg_free_bits_count) > le16_to_cpu(bg->bg_bits)) {
2444 return ocfs2_error(alloc_inode->i_sb, "Group descriptor # %llu has bit count %u but claims %u are freed. num_bits %d\n",
2445 (unsigned long long)le64_to_cpu(bg->bg_blkno),
2446 le16_to_cpu(bg->bg_bits),
2447 le16_to_cpu(bg->bg_free_bits_count),
2448 num_bits);
2449 }
2450
2451 if (undo_fn)
2452 jbd_unlock_bh_state(group_bh);
2453
2454 ocfs2_journal_dirty(handle, group_bh);
2455bail:
2456 return status;
2457}
2458
2459/*
2460 * expects the suballoc inode to already be locked.
2461 */
2462static int _ocfs2_free_suballoc_bits(handle_t *handle,
2463 struct inode *alloc_inode,
2464 struct buffer_head *alloc_bh,
2465 unsigned int start_bit,
2466 u64 bg_blkno,
2467 unsigned int count,
2468 void (*undo_fn)(unsigned int bit,
2469 unsigned long *bitmap))
2470{
2471 int status = 0;
2472 u32 tmp_used;
2473 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) alloc_bh->b_data;
2474 struct ocfs2_chain_list *cl = &fe->id2.i_chain;
2475 struct buffer_head *group_bh = NULL;
2476 struct ocfs2_group_desc *group;
2477
2478 /* The alloc_bh comes from ocfs2_free_dinode() or
2479 * ocfs2_free_clusters(). The callers have all locked the
2480 * allocator and gotten alloc_bh from the lock call. This
2481 * validates the dinode buffer. Any corruption that has happened
2482 * is a code bug. */
2483 BUG_ON(!OCFS2_IS_VALID_DINODE(fe));
2484 BUG_ON((count + start_bit) > ocfs2_bits_per_group(cl));
2485
2486 trace_ocfs2_free_suballoc_bits(
2487 (unsigned long long)OCFS2_I(alloc_inode)->ip_blkno,
2488 (unsigned long long)bg_blkno,
2489 start_bit, count);
2490
2491 status = ocfs2_read_group_descriptor(alloc_inode, fe, bg_blkno,
2492 &group_bh);
2493 if (status < 0) {
2494 mlog_errno(status);
2495 goto bail;
2496 }
2497 group = (struct ocfs2_group_desc *) group_bh->b_data;
2498
2499 BUG_ON((count + start_bit) > le16_to_cpu(group->bg_bits));
2500
2501 status = ocfs2_block_group_clear_bits(handle, alloc_inode,
2502 group, group_bh,
2503 start_bit, count, undo_fn);
2504 if (status < 0) {
2505 mlog_errno(status);
2506 goto bail;
2507 }
2508
2509 status = ocfs2_journal_access_di(handle, INODE_CACHE(alloc_inode),
2510 alloc_bh, OCFS2_JOURNAL_ACCESS_WRITE);
2511 if (status < 0) {
2512 mlog_errno(status);
2513 ocfs2_block_group_set_bits(handle, alloc_inode, group, group_bh,
2514 start_bit, count);
2515 goto bail;
2516 }
2517
2518 le32_add_cpu(&cl->cl_recs[le16_to_cpu(group->bg_chain)].c_free,
2519 count);
2520 tmp_used = le32_to_cpu(fe->id1.bitmap1.i_used);
2521 fe->id1.bitmap1.i_used = cpu_to_le32(tmp_used - count);
2522 ocfs2_journal_dirty(handle, alloc_bh);
2523
2524bail:
2525 brelse(group_bh);
2526
2527 if (status)
2528 mlog_errno(status);
2529 return status;
2530}
2531
2532int ocfs2_free_suballoc_bits(handle_t *handle,
2533 struct inode *alloc_inode,
2534 struct buffer_head *alloc_bh,
2535 unsigned int start_bit,
2536 u64 bg_blkno,
2537 unsigned int count)
2538{
2539 return _ocfs2_free_suballoc_bits(handle, alloc_inode, alloc_bh,
2540 start_bit, bg_blkno, count, NULL);
2541}
2542
2543int ocfs2_free_dinode(handle_t *handle,
2544 struct inode *inode_alloc_inode,
2545 struct buffer_head *inode_alloc_bh,
2546 struct ocfs2_dinode *di)
2547{
2548 u64 blk = le64_to_cpu(di->i_blkno);
2549 u16 bit = le16_to_cpu(di->i_suballoc_bit);
2550 u64 bg_blkno = ocfs2_which_suballoc_group(blk, bit);
2551
2552 if (di->i_suballoc_loc)
2553 bg_blkno = le64_to_cpu(di->i_suballoc_loc);
2554 return ocfs2_free_suballoc_bits(handle, inode_alloc_inode,
2555 inode_alloc_bh, bit, bg_blkno, 1);
2556}
2557
2558static int _ocfs2_free_clusters(handle_t *handle,
2559 struct inode *bitmap_inode,
2560 struct buffer_head *bitmap_bh,
2561 u64 start_blk,
2562 unsigned int num_clusters,
2563 void (*undo_fn)(unsigned int bit,
2564 unsigned long *bitmap))
2565{
2566 int status;
2567 u16 bg_start_bit;
2568 u64 bg_blkno;
2569 struct ocfs2_dinode *fe;
2570
2571 /* You can't ever have a contiguous set of clusters
2572 * bigger than a block group bitmap so we never have to worry
2573 * about looping on them.
2574 * This is expensive. We can safely remove once this stuff has
2575 * gotten tested really well. */
2576 BUG_ON(start_blk != ocfs2_clusters_to_blocks(bitmap_inode->i_sb, ocfs2_blocks_to_clusters(bitmap_inode->i_sb, start_blk)));
2577
2578 fe = (struct ocfs2_dinode *) bitmap_bh->b_data;
2579
2580 ocfs2_block_to_cluster_group(bitmap_inode, start_blk, &bg_blkno,
2581 &bg_start_bit);
2582
2583 trace_ocfs2_free_clusters((unsigned long long)bg_blkno,
2584 (unsigned long long)start_blk,
2585 bg_start_bit, num_clusters);
2586
2587 status = _ocfs2_free_suballoc_bits(handle, bitmap_inode, bitmap_bh,
2588 bg_start_bit, bg_blkno,
2589 num_clusters, undo_fn);
2590 if (status < 0) {
2591 mlog_errno(status);
2592 goto out;
2593 }
2594
2595 ocfs2_local_alloc_seen_free_bits(OCFS2_SB(bitmap_inode->i_sb),
2596 num_clusters);
2597
2598out:
2599 if (status)
2600 mlog_errno(status);
2601 return status;
2602}
2603
2604int ocfs2_free_clusters(handle_t *handle,
2605 struct inode *bitmap_inode,
2606 struct buffer_head *bitmap_bh,
2607 u64 start_blk,
2608 unsigned int num_clusters)
2609{
2610 return _ocfs2_free_clusters(handle, bitmap_inode, bitmap_bh,
2611 start_blk, num_clusters,
2612 _ocfs2_set_bit);
2613}
2614
2615/*
2616 * Give never-used clusters back to the global bitmap. We don't need
2617 * to protect these bits in the undo buffer.
2618 */
2619int ocfs2_release_clusters(handle_t *handle,
2620 struct inode *bitmap_inode,
2621 struct buffer_head *bitmap_bh,
2622 u64 start_blk,
2623 unsigned int num_clusters)
2624{
2625 return _ocfs2_free_clusters(handle, bitmap_inode, bitmap_bh,
2626 start_blk, num_clusters,
2627 _ocfs2_clear_bit);
2628}
2629
2630static inline void ocfs2_debug_bg(struct ocfs2_group_desc *bg)
2631{
2632 printk("Block Group:\n");
2633 printk("bg_signature: %s\n", bg->bg_signature);
2634 printk("bg_size: %u\n", bg->bg_size);
2635 printk("bg_bits: %u\n", bg->bg_bits);
2636 printk("bg_free_bits_count: %u\n", bg->bg_free_bits_count);
2637 printk("bg_chain: %u\n", bg->bg_chain);
2638 printk("bg_generation: %u\n", le32_to_cpu(bg->bg_generation));
2639 printk("bg_next_group: %llu\n",
2640 (unsigned long long)bg->bg_next_group);
2641 printk("bg_parent_dinode: %llu\n",
2642 (unsigned long long)bg->bg_parent_dinode);
2643 printk("bg_blkno: %llu\n",
2644 (unsigned long long)bg->bg_blkno);
2645}
2646
2647static inline void ocfs2_debug_suballoc_inode(struct ocfs2_dinode *fe)
2648{
2649 int i;
2650
2651 printk("Suballoc Inode %llu:\n", (unsigned long long)fe->i_blkno);
2652 printk("i_signature: %s\n", fe->i_signature);
2653 printk("i_size: %llu\n",
2654 (unsigned long long)fe->i_size);
2655 printk("i_clusters: %u\n", fe->i_clusters);
2656 printk("i_generation: %u\n",
2657 le32_to_cpu(fe->i_generation));
2658 printk("id1.bitmap1.i_used: %u\n",
2659 le32_to_cpu(fe->id1.bitmap1.i_used));
2660 printk("id1.bitmap1.i_total: %u\n",
2661 le32_to_cpu(fe->id1.bitmap1.i_total));
2662 printk("id2.i_chain.cl_cpg: %u\n", fe->id2.i_chain.cl_cpg);
2663 printk("id2.i_chain.cl_bpc: %u\n", fe->id2.i_chain.cl_bpc);
2664 printk("id2.i_chain.cl_count: %u\n", fe->id2.i_chain.cl_count);
2665 printk("id2.i_chain.cl_next_free_rec: %u\n",
2666 fe->id2.i_chain.cl_next_free_rec);
2667 for(i = 0; i < fe->id2.i_chain.cl_next_free_rec; i++) {
2668 printk("fe->id2.i_chain.cl_recs[%d].c_free: %u\n", i,
2669 fe->id2.i_chain.cl_recs[i].c_free);
2670 printk("fe->id2.i_chain.cl_recs[%d].c_total: %u\n", i,
2671 fe->id2.i_chain.cl_recs[i].c_total);
2672 printk("fe->id2.i_chain.cl_recs[%d].c_blkno: %llu\n", i,
2673 (unsigned long long)fe->id2.i_chain.cl_recs[i].c_blkno);
2674 }
2675}
2676
2677/*
2678 * For a given allocation, determine which allocators will need to be
2679 * accessed, and lock them, reserving the appropriate number of bits.
2680 *
2681 * Sparse file systems call this from ocfs2_write_begin_nolock()
2682 * and ocfs2_allocate_unwritten_extents().
2683 *
2684 * File systems which don't support holes call this from
2685 * ocfs2_extend_allocation().
2686 */
2687int ocfs2_lock_allocators(struct inode *inode,
2688 struct ocfs2_extent_tree *et,
2689 u32 clusters_to_add, u32 extents_to_split,
2690 struct ocfs2_alloc_context **data_ac,
2691 struct ocfs2_alloc_context **meta_ac)
2692{
2693 int ret = 0, num_free_extents;
2694 unsigned int max_recs_needed = clusters_to_add + 2 * extents_to_split;
2695 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2696
2697 *meta_ac = NULL;
2698 if (data_ac)
2699 *data_ac = NULL;
2700
2701 BUG_ON(clusters_to_add != 0 && data_ac == NULL);
2702
2703 num_free_extents = ocfs2_num_free_extents(osb, et);
2704 if (num_free_extents < 0) {
2705 ret = num_free_extents;
2706 mlog_errno(ret);
2707 goto out;
2708 }
2709
2710 /*
2711 * Sparse allocation file systems need to be more conservative
2712 * with reserving room for expansion - the actual allocation
2713 * happens while we've got a journal handle open so re-taking
2714 * a cluster lock (because we ran out of room for another
2715 * extent) will violate ordering rules.
2716 *
2717 * Most of the time we'll only be seeing this 1 cluster at a time
2718 * anyway.
2719 *
2720 * Always lock for any unwritten extents - we might want to
2721 * add blocks during a split.
2722 */
2723 if (!num_free_extents ||
2724 (ocfs2_sparse_alloc(osb) && num_free_extents < max_recs_needed)) {
2725 ret = ocfs2_reserve_new_metadata(osb, et->et_root_el, meta_ac);
2726 if (ret < 0) {
2727 if (ret != -ENOSPC)
2728 mlog_errno(ret);
2729 goto out;
2730 }
2731 }
2732
2733 if (clusters_to_add == 0)
2734 goto out;
2735
2736 ret = ocfs2_reserve_clusters(osb, clusters_to_add, data_ac);
2737 if (ret < 0) {
2738 if (ret != -ENOSPC)
2739 mlog_errno(ret);
2740 goto out;
2741 }
2742
2743out:
2744 if (ret) {
2745 if (*meta_ac) {
2746 ocfs2_free_alloc_context(*meta_ac);
2747 *meta_ac = NULL;
2748 }
2749
2750 /*
2751 * We cannot have an error and a non null *data_ac.
2752 */
2753 }
2754
2755 return ret;
2756}
2757
2758/*
2759 * Read the inode specified by blkno to get suballoc_slot and
2760 * suballoc_bit.
2761 */
2762static int ocfs2_get_suballoc_slot_bit(struct ocfs2_super *osb, u64 blkno,
2763 u16 *suballoc_slot, u64 *group_blkno,
2764 u16 *suballoc_bit)
2765{
2766 int status;
2767 struct buffer_head *inode_bh = NULL;
2768 struct ocfs2_dinode *inode_fe;
2769
2770 trace_ocfs2_get_suballoc_slot_bit((unsigned long long)blkno);
2771
2772 /* dirty read disk */
2773 status = ocfs2_read_blocks_sync(osb, blkno, 1, &inode_bh);
2774 if (status < 0) {
2775 mlog(ML_ERROR, "read block %llu failed %d\n",
2776 (unsigned long long)blkno, status);
2777 goto bail;
2778 }
2779
2780 inode_fe = (struct ocfs2_dinode *) inode_bh->b_data;
2781 if (!OCFS2_IS_VALID_DINODE(inode_fe)) {
2782 mlog(ML_ERROR, "invalid inode %llu requested\n",
2783 (unsigned long long)blkno);
2784 status = -EINVAL;
2785 goto bail;
2786 }
2787
2788 if (le16_to_cpu(inode_fe->i_suballoc_slot) != (u16)OCFS2_INVALID_SLOT &&
2789 (u32)le16_to_cpu(inode_fe->i_suballoc_slot) > osb->max_slots - 1) {
2790 mlog(ML_ERROR, "inode %llu has invalid suballoc slot %u\n",
2791 (unsigned long long)blkno,
2792 (u32)le16_to_cpu(inode_fe->i_suballoc_slot));
2793 status = -EINVAL;
2794 goto bail;
2795 }
2796
2797 if (suballoc_slot)
2798 *suballoc_slot = le16_to_cpu(inode_fe->i_suballoc_slot);
2799 if (suballoc_bit)
2800 *suballoc_bit = le16_to_cpu(inode_fe->i_suballoc_bit);
2801 if (group_blkno)
2802 *group_blkno = le64_to_cpu(inode_fe->i_suballoc_loc);
2803
2804bail:
2805 brelse(inode_bh);
2806
2807 if (status)
2808 mlog_errno(status);
2809 return status;
2810}
2811
2812/*
2813 * test whether bit is SET in allocator bitmap or not. on success, 0
2814 * is returned and *res is 1 for SET; 0 otherwise. when fails, errno
2815 * is returned and *res is meaningless. Call this after you have
2816 * cluster locked against suballoc, or you may get a result based on
2817 * non-up2date contents
2818 */
2819static int ocfs2_test_suballoc_bit(struct ocfs2_super *osb,
2820 struct inode *suballoc,
2821 struct buffer_head *alloc_bh,
2822 u64 group_blkno, u64 blkno,
2823 u16 bit, int *res)
2824{
2825 struct ocfs2_dinode *alloc_di;
2826 struct ocfs2_group_desc *group;
2827 struct buffer_head *group_bh = NULL;
2828 u64 bg_blkno;
2829 int status;
2830
2831 trace_ocfs2_test_suballoc_bit((unsigned long long)blkno,
2832 (unsigned int)bit);
2833
2834 alloc_di = (struct ocfs2_dinode *)alloc_bh->b_data;
2835 if ((bit + 1) > ocfs2_bits_per_group(&alloc_di->id2.i_chain)) {
2836 mlog(ML_ERROR, "suballoc bit %u out of range of %u\n",
2837 (unsigned int)bit,
2838 ocfs2_bits_per_group(&alloc_di->id2.i_chain));
2839 status = -EINVAL;
2840 goto bail;
2841 }
2842
2843 bg_blkno = group_blkno ? group_blkno :
2844 ocfs2_which_suballoc_group(blkno, bit);
2845 status = ocfs2_read_group_descriptor(suballoc, alloc_di, bg_blkno,
2846 &group_bh);
2847 if (status < 0) {
2848 mlog(ML_ERROR, "read group %llu failed %d\n",
2849 (unsigned long long)bg_blkno, status);
2850 goto bail;
2851 }
2852
2853 group = (struct ocfs2_group_desc *) group_bh->b_data;
2854 *res = ocfs2_test_bit(bit, (unsigned long *)group->bg_bitmap);
2855
2856bail:
2857 brelse(group_bh);
2858
2859 if (status)
2860 mlog_errno(status);
2861 return status;
2862}
2863
2864/*
2865 * Test if the bit representing this inode (blkno) is set in the
2866 * suballocator.
2867 *
2868 * On success, 0 is returned and *res is 1 for SET; 0 otherwise.
2869 *
2870 * In the event of failure, a negative value is returned and *res is
2871 * meaningless.
2872 *
2873 * Callers must make sure to hold nfs_sync_lock to prevent
2874 * ocfs2_delete_inode() on another node from accessing the same
2875 * suballocator concurrently.
2876 */
2877int ocfs2_test_inode_bit(struct ocfs2_super *osb, u64 blkno, int *res)
2878{
2879 int status;
2880 u64 group_blkno = 0;
2881 u16 suballoc_bit = 0, suballoc_slot = 0;
2882 struct inode *inode_alloc_inode;
2883 struct buffer_head *alloc_bh = NULL;
2884
2885 trace_ocfs2_test_inode_bit((unsigned long long)blkno);
2886
2887 status = ocfs2_get_suballoc_slot_bit(osb, blkno, &suballoc_slot,
2888 &group_blkno, &suballoc_bit);
2889 if (status < 0) {
2890 mlog(ML_ERROR, "get alloc slot and bit failed %d\n", status);
2891 goto bail;
2892 }
2893
2894 inode_alloc_inode =
2895 ocfs2_get_system_file_inode(osb, INODE_ALLOC_SYSTEM_INODE,
2896 suballoc_slot);
2897 if (!inode_alloc_inode) {
2898 /* the error code could be inaccurate, but we are not able to
2899 * get the correct one. */
2900 status = -EINVAL;
2901 mlog(ML_ERROR, "unable to get alloc inode in slot %u\n",
2902 (u32)suballoc_slot);
2903 goto bail;
2904 }
2905
2906 inode_lock(inode_alloc_inode);
2907 status = ocfs2_inode_lock(inode_alloc_inode, &alloc_bh, 0);
2908 if (status < 0) {
2909 inode_unlock(inode_alloc_inode);
2910 iput(inode_alloc_inode);
2911 mlog(ML_ERROR, "lock on alloc inode on slot %u failed %d\n",
2912 (u32)suballoc_slot, status);
2913 goto bail;
2914 }
2915
2916 status = ocfs2_test_suballoc_bit(osb, inode_alloc_inode, alloc_bh,
2917 group_blkno, blkno, suballoc_bit, res);
2918 if (status < 0)
2919 mlog(ML_ERROR, "test suballoc bit failed %d\n", status);
2920
2921 ocfs2_inode_unlock(inode_alloc_inode, 0);
2922 inode_unlock(inode_alloc_inode);
2923
2924 iput(inode_alloc_inode);
2925 brelse(alloc_bh);
2926bail:
2927 if (status)
2928 mlog_errno(status);
2929 return status;
2930}