1 /* -*- mode: c; c-basic-offset: 8; -*-
2 * vim: noexpandtab sw=8 ts=8 sts=0:
6 * metadata alloc and free
7 * Inspired by ext3 block groups.
9 * Copyright (C) 2002, 2004 Oracle. All rights reserved.
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.
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.
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.
28 #include <linux/types.h>
29 #include <linux/slab.h>
30 #include <linux/highmem.h>
32 #include <cluster/masklog.h>
37 #include "blockcheck.h"
41 #include "localalloc.h"
46 #include "ocfs2_trace.h"
48 #include "buffer_head_io.h"
50 #define NOT_ALLOC_NEW_GROUP 0
51 #define ALLOC_NEW_GROUP 0x1
52 #define ALLOC_GROUPS_FROM_GLOBAL 0x2
54 #define OCFS2_MAX_TO_STEAL 1024
56 struct ocfs2_suballoc_result {
57 u64 sr_bg_blkno; /* The bg we allocated from. Set
58 to 0 when a block group is
60 u64 sr_bg_stable_blkno; /*
61 * Doesn't change, always
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 */
71 static u64 ocfs2_group_from_res(struct ocfs2_suballoc_result *res)
73 if (res->sr_blkno == 0)
77 return res->sr_bg_blkno;
79 return ocfs2_which_suballoc_group(res->sr_blkno, res->sr_bit_offset);
82 static inline void ocfs2_debug_bg(struct ocfs2_group_desc *bg);
83 static inline void ocfs2_debug_suballoc_inode(struct ocfs2_dinode *fe);
84 static inline u16 ocfs2_find_victim_chain(struct ocfs2_chain_list *cl);
85 static int ocfs2_block_group_fill(handle_t *handle,
86 struct inode *alloc_inode,
87 struct buffer_head *bg_bh,
89 unsigned int group_clusters,
91 struct ocfs2_chain_list *cl);
92 static int ocfs2_block_group_alloc(struct ocfs2_super *osb,
93 struct inode *alloc_inode,
94 struct buffer_head *bh,
96 u64 *last_alloc_group,
99 static int ocfs2_cluster_group_search(struct inode *inode,
100 struct buffer_head *group_bh,
101 u32 bits_wanted, u32 min_bits,
103 struct ocfs2_suballoc_result *res);
104 static int ocfs2_block_group_search(struct inode *inode,
105 struct buffer_head *group_bh,
106 u32 bits_wanted, u32 min_bits,
108 struct ocfs2_suballoc_result *res);
109 static int ocfs2_claim_suballoc_bits(struct ocfs2_alloc_context *ac,
113 struct ocfs2_suballoc_result *res);
114 static int ocfs2_test_bg_bit_allocatable(struct buffer_head *bg_bh,
116 static 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,
122 static inline int ocfs2_block_group_reasonably_empty(struct ocfs2_group_desc *bg,
124 static inline u32 ocfs2_desc_bitmap_to_cluster_off(struct inode *inode,
127 static inline void ocfs2_block_to_cluster_group(struct inode *inode,
131 static int ocfs2_reserve_clusters_with_limit(struct ocfs2_super *osb,
132 u32 bits_wanted, u64 max_block,
134 struct ocfs2_alloc_context **ac);
136 void ocfs2_free_ac_resource(struct ocfs2_alloc_context *ac)
138 struct inode *inode = ac->ac_inode;
141 if (ac->ac_which != OCFS2_AC_USE_LOCAL)
142 ocfs2_inode_unlock(inode, 1);
152 kfree(ac->ac_find_loc_priv);
153 ac->ac_find_loc_priv = NULL;
156 void ocfs2_free_alloc_context(struct ocfs2_alloc_context *ac)
158 ocfs2_free_ac_resource(ac);
162 static u32 ocfs2_bits_per_group(struct ocfs2_chain_list *cl)
164 return (u32)le16_to_cpu(cl->cl_cpg) * (u32)le16_to_cpu(cl->cl_bpc);
167 #define do_error(fmt, ...) \
170 mlog(ML_ERROR, fmt, ##__VA_ARGS__); \
172 return ocfs2_error(sb, fmt, ##__VA_ARGS__); \
175 static int ocfs2_validate_gd_self(struct super_block *sb,
176 struct buffer_head *bh,
179 struct ocfs2_group_desc *gd = (struct ocfs2_group_desc *)bh->b_data;
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,
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));
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));
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));
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));
216 static int ocfs2_validate_gd_parent(struct super_block *sb,
217 struct ocfs2_dinode *di,
218 struct buffer_head *bh,
221 unsigned int max_bits;
222 struct ocfs2_group_desc *gd = (struct ocfs2_group_desc *)bh->b_data;
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));
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));
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));
254 * This version only prints errors. It does not fail the filesystem, and
255 * exists only for resize.
257 int ocfs2_check_group_descriptor(struct super_block *sb,
258 struct ocfs2_dinode *di,
259 struct buffer_head *bh)
262 struct ocfs2_group_desc *gd = (struct ocfs2_group_desc *)bh->b_data;
264 BUG_ON(!buffer_uptodate(bh));
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.
271 rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &gd->bg_check);
274 "Checksum failed for group descriptor %llu\n",
275 (unsigned long long)bh->b_blocknr);
277 rc = ocfs2_validate_gd_self(sb, bh, 1);
279 rc = ocfs2_validate_gd_parent(sb, di, bh, 1);
284 static int ocfs2_validate_group_descriptor(struct super_block *sb,
285 struct buffer_head *bh)
288 struct ocfs2_group_desc *gd = (struct ocfs2_group_desc *)bh->b_data;
290 trace_ocfs2_validate_group_descriptor(
291 (unsigned long long)bh->b_blocknr);
293 BUG_ON(!buffer_uptodate(bh));
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.
300 rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &gd->bg_check);
305 * Errors after here are fatal.
308 return ocfs2_validate_gd_self(sb, bh, 0);
311 int ocfs2_read_group_descriptor(struct inode *inode, struct ocfs2_dinode *di,
312 u64 gd_blkno, struct buffer_head **bh)
315 struct buffer_head *tmp = *bh;
317 rc = ocfs2_read_block(INODE_CACHE(inode), gd_blkno, &tmp,
318 ocfs2_validate_group_descriptor);
322 rc = ocfs2_validate_gd_parent(inode->i_sb, di, tmp, 0);
328 /* If ocfs2_read_block() got us a new bh, pass it up. */
336 static 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)
341 struct ocfs2_extent_list *el = &bg->bg_list;
342 struct ocfs2_extent_rec *rec;
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);
358 static int ocfs2_block_group_fill(handle_t *handle,
359 struct inode *alloc_inode,
360 struct buffer_head *bg_bh,
362 unsigned int group_clusters,
364 struct ocfs2_chain_list *cl)
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;
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);
379 status = ocfs2_journal_access_gd(handle,
380 INODE_CACHE(alloc_inode),
382 OCFS2_JOURNAL_ACCESS_CREATE);
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));
400 ocfs2_bg_discontig_add_extent(osb, bg, cl, group_blkno,
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);
407 ocfs2_journal_dirty(handle, bg_bh);
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. */
420 static inline u16 ocfs2_find_smallest_chain(struct ocfs2_chain_list *cl)
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))
434 static struct buffer_head *
435 ocfs2_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)
441 u32 bit_off, num_bits;
443 struct buffer_head *bg_bh;
444 unsigned int alloc_rec = ocfs2_find_smallest_chain(cl);
446 status = ocfs2_claim_clusters(handle, ac,
447 le16_to_cpu(cl->cl_cpg), &bit_off,
450 if (status != -ENOSPC)
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);
460 bg_bh = sb_getblk(osb->sb, bg_blkno);
466 ocfs2_set_new_buffer_uptodate(INODE_CACHE(alloc_inode), bg_bh);
468 status = ocfs2_block_group_fill(handle, alloc_inode, bg_bh,
469 bg_blkno, num_bits, alloc_rec, cl);
476 return status ? ERR_PTR(status) : bg_bh;
479 static int ocfs2_block_group_claim_bits(struct ocfs2_super *osb,
481 struct ocfs2_alloc_context *ac,
482 unsigned int min_bits,
483 u32 *bit_off, u32 *num_bits)
488 status = ocfs2_claim_clusters(handle, ac, min_bits,
490 if (status != -ENOSPC)
499 static 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)
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;
514 struct ocfs2_extent_list *el = &bg->bg_list;
516 status = ocfs2_journal_access_gd(handle,
517 INODE_CACHE(alloc_inode),
519 OCFS2_JOURNAL_ACCESS_CREATE);
525 while ((needed > 0) && (le16_to_cpu(el->l_next_free_rec) <
526 le16_to_cpu(el->l_count))) {
527 if (min_bits > needed)
529 status = ocfs2_block_group_claim_bits(osb, handle, ac,
533 if (status != -ENOSPC)
537 p_blkno = ocfs2_clusters_to_blocks(osb->sb, p_cpos);
538 ocfs2_bg_discontig_add_extent(osb, bg, cl, p_blkno,
542 needed = le16_to_cpu(cl->cl_cpg) -
543 le16_to_cpu(bg->bg_bits) / le16_to_cpu(cl->cl_bpc);
548 * We have used up all the extent rec but can't fill up
549 * the cpg. So bail out.
555 ocfs2_journal_dirty(handle, bg_bh);
561 static 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)
567 struct ocfs2_group_desc *bg;
568 struct ocfs2_extent_list *el;
569 struct ocfs2_extent_rec *rec;
574 bg = (struct ocfs2_group_desc *)bg_bh->b_data;
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,
580 le64_to_cpu(rec->e_blkno),
581 le16_to_cpu(rec->e_leaf_clusters));
584 /* Try all the clusters to free */
587 ocfs2_remove_from_cache(INODE_CACHE(alloc_inode), bg_bh);
591 static struct buffer_head *
592 ocfs2_block_group_alloc_discontig(handle_t *handle,
593 struct inode *alloc_inode,
594 struct ocfs2_alloc_context *ac,
595 struct ocfs2_chain_list *cl)
598 u32 bit_off, num_bits;
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);
605 if (!ocfs2_supports_discontig_bg(osb)) {
610 status = ocfs2_extend_trans(handle,
611 ocfs2_calc_bg_discontig_credits(osb->sb));
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
623 ac->ac_disable_chain_relink = 1;
625 /* Claim the first region */
626 status = ocfs2_block_group_claim_bits(osb, handle, ac, min_bits,
627 &bit_off, &num_bits);
629 if (status != -ENOSPC)
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);
640 bg_bh = sb_getblk(osb->sb, bg_blkno);
646 ocfs2_set_new_buffer_uptodate(INODE_CACHE(alloc_inode), bg_bh);
648 status = ocfs2_block_group_fill(handle, alloc_inode, bg_bh,
649 bg_blkno, num_bits, alloc_rec, cl);
655 status = ocfs2_block_group_grow_discontig(handle, alloc_inode,
656 bg_bh, ac, cl, min_bits);
662 ocfs2_bg_alloc_cleanup(handle, ac, alloc_inode, bg_bh);
663 return status ? ERR_PTR(status) : bg_bh;
667 * We expect the block group allocator to already be locked.
669 static int ocfs2_block_group_alloc(struct ocfs2_super *osb,
670 struct inode *alloc_inode,
671 struct buffer_head *bh,
673 u64 *last_alloc_group,
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;
682 struct buffer_head *bg_bh = NULL;
683 struct ocfs2_group_desc *bg;
685 BUG_ON(ocfs2_is_cluster_bitmap(alloc_inode));
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);
692 if (status != -ENOSPC)
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);
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;
713 bg_bh = ocfs2_block_group_alloc_contig(osb, handle, alloc_inode,
715 if (IS_ERR(bg_bh) && (PTR_ERR(bg_bh) == -ENOSPC))
716 bg_bh = ocfs2_block_group_alloc_discontig(handle,
720 status = PTR_ERR(bg_bh);
722 if (status != -ENOSPC)
726 bg = (struct ocfs2_group_desc *) bg_bh->b_data;
728 status = ocfs2_journal_access_di(handle, INODE_CACHE(alloc_inode),
729 bh, OCFS2_JOURNAL_ACCESS_WRITE);
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);
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));
749 ocfs2_journal_dirty(handle, bh);
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);
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;
768 ocfs2_commit_trans(osb, handle);
771 ocfs2_free_alloc_context(ac);
780 static int ocfs2_reserve_suballoc_bits(struct ocfs2_super *osb,
781 struct ocfs2_alloc_context *ac,
784 u64 *last_alloc_group,
788 u32 bits_wanted = ac->ac_bits_wanted;
789 struct inode *alloc_inode;
790 struct buffer_head *bh = NULL;
791 struct ocfs2_dinode *fe;
794 alloc_inode = ocfs2_get_system_file_inode(osb, type, slot);
800 inode_lock(alloc_inode);
802 status = ocfs2_inode_lock(alloc_inode, &bh, 1);
804 inode_unlock(alloc_inode);
811 ac->ac_inode = alloc_inode;
812 ac->ac_alloc_slot = slot;
814 fe = (struct ocfs2_dinode *) bh->b_data;
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));
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));
827 free_bits = le32_to_cpu(fe->id1.bitmap1.i_total) -
828 le32_to_cpu(fe->id1.bitmap1.i_used);
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,
839 if (!(flags & ALLOC_NEW_GROUP)) {
840 trace_ocfs2_reserve_suballoc_bits_no_new_group(
841 slot, bits_wanted, free_bits);
846 status = ocfs2_block_group_alloc(osb, alloc_inode, bh,
848 last_alloc_group, flags);
850 if (status != -ENOSPC)
854 atomic_inc(&osb->alloc_stats.bg_extends);
856 /* You should never ask for this much metadata */
858 (le32_to_cpu(fe->id1.bitmap1.i_total)
859 - le32_to_cpu(fe->id1.bitmap1.i_used)));
872 static void ocfs2_init_inode_steal_slot(struct ocfs2_super *osb)
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);
880 static void ocfs2_init_meta_steal_slot(struct ocfs2_super *osb)
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);
888 void ocfs2_init_steal_slots(struct ocfs2_super *osb)
890 ocfs2_init_inode_steal_slot(osb);
891 ocfs2_init_meta_steal_slot(osb);
894 static void __ocfs2_set_steal_slot(struct ocfs2_super *osb, int slot, int type)
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);
904 static int __ocfs2_get_steal_slot(struct ocfs2_super *osb, int type)
906 int slot = OCFS2_INVALID_SLOT;
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);
918 static int ocfs2_get_inode_steal_slot(struct ocfs2_super *osb)
920 return __ocfs2_get_steal_slot(osb, INODE_ALLOC_SYSTEM_INODE);
923 static int ocfs2_get_meta_steal_slot(struct ocfs2_super *osb)
925 return __ocfs2_get_steal_slot(osb, EXTENT_ALLOC_SYSTEM_INODE);
928 static int ocfs2_steal_resource(struct ocfs2_super *osb,
929 struct ocfs2_alloc_context *ac,
932 int i, status = -ENOSPC;
933 int slot = __ocfs2_get_steal_slot(osb, type);
935 /* Start to steal resource from the first slot after ours. */
936 if (slot == OCFS2_INVALID_SLOT)
937 slot = osb->slot_num + 1;
939 for (i = 0; i < osb->max_slots; i++, slot++) {
940 if (slot == osb->max_slots)
943 if (slot == osb->slot_num)
946 status = ocfs2_reserve_suballoc_bits(osb, ac,
949 NOT_ALLOC_NEW_GROUP);
951 __ocfs2_set_steal_slot(osb, slot, type);
955 ocfs2_free_ac_resource(ac);
961 static int ocfs2_steal_inode(struct ocfs2_super *osb,
962 struct ocfs2_alloc_context *ac)
964 return ocfs2_steal_resource(osb, ac, INODE_ALLOC_SYSTEM_INODE);
967 static int ocfs2_steal_meta(struct ocfs2_super *osb,
968 struct ocfs2_alloc_context *ac)
970 return ocfs2_steal_resource(osb, ac, EXTENT_ALLOC_SYSTEM_INODE);
973 int ocfs2_reserve_new_metadata_blocks(struct ocfs2_super *osb,
975 struct ocfs2_alloc_context **ac)
978 int slot = ocfs2_get_meta_steal_slot(osb);
980 *ac = kzalloc(sizeof(struct ocfs2_alloc_context), GFP_KERNEL);
987 (*ac)->ac_bits_wanted = blocks;
988 (*ac)->ac_which = OCFS2_AC_USE_META;
989 (*ac)->ac_group_search = ocfs2_block_group_search;
991 if (slot != OCFS2_INVALID_SLOT &&
992 atomic_read(&osb->s_num_meta_stolen) < OCFS2_MAX_TO_STEAL)
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);
1004 if (slot != OCFS2_INVALID_SLOT)
1005 ocfs2_init_meta_steal_slot(osb);
1007 } else if (status < 0 && status != -ENOSPC) {
1012 ocfs2_free_ac_resource(*ac);
1015 status = ocfs2_steal_meta(osb, *ac);
1016 atomic_inc(&osb->s_num_meta_stolen);
1018 if (status != -ENOSPC)
1025 if ((status < 0) && *ac) {
1026 ocfs2_free_alloc_context(*ac);
1035 int ocfs2_reserve_new_metadata(struct ocfs2_super *osb,
1036 struct ocfs2_extent_list *root_el,
1037 struct ocfs2_alloc_context **ac)
1039 return ocfs2_reserve_new_metadata_blocks(osb,
1040 ocfs2_extend_meta_needed(root_el),
1044 int ocfs2_reserve_new_inode(struct ocfs2_super *osb,
1045 struct ocfs2_alloc_context **ac)
1048 int slot = ocfs2_get_inode_steal_slot(osb);
1051 *ac = kzalloc(sizeof(struct ocfs2_alloc_context), GFP_KERNEL);
1058 (*ac)->ac_bits_wanted = 1;
1059 (*ac)->ac_which = OCFS2_AC_USE_INODE;
1061 (*ac)->ac_group_search = ocfs2_block_group_search;
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.
1068 if (!(osb->s_mount_opt & OCFS2_MOUNT_INODE64))
1069 (*ac)->ac_max_block = (u32)~0U;
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.
1080 if (slot != OCFS2_INVALID_SLOT &&
1081 atomic_read(&osb->s_num_inodes_stolen) < OCFS2_MAX_TO_STEAL)
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,
1091 ALLOC_GROUPS_FROM_GLOBAL);
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);
1102 * Some inodes must be freed by us, so try to allocate
1103 * from our own next time.
1105 if (slot != OCFS2_INVALID_SLOT)
1106 ocfs2_init_inode_steal_slot(osb);
1108 } else if (status < 0 && status != -ENOSPC) {
1113 ocfs2_free_ac_resource(*ac);
1116 status = ocfs2_steal_inode(osb, *ac);
1117 atomic_inc(&osb->s_num_inodes_stolen);
1119 if (status != -ENOSPC)
1126 if ((status < 0) && *ac) {
1127 ocfs2_free_alloc_context(*ac);
1136 /* local alloc code has to do the same thing, so rather than do this
1138 int ocfs2_reserve_cluster_bitmap_bits(struct ocfs2_super *osb,
1139 struct ocfs2_alloc_context *ac)
1143 ac->ac_which = OCFS2_AC_USE_MAIN;
1144 ac->ac_group_search = ocfs2_cluster_group_search;
1146 status = ocfs2_reserve_suballoc_bits(osb, ac,
1147 GLOBAL_BITMAP_SYSTEM_INODE,
1148 OCFS2_INVALID_SLOT, NULL,
1150 if (status < 0 && status != -ENOSPC) {
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
1162 static int ocfs2_reserve_clusters_with_limit(struct ocfs2_super *osb,
1163 u32 bits_wanted, u64 max_block,
1165 struct ocfs2_alloc_context **ac)
1167 int status, ret = 0;
1170 *ac = kzalloc(sizeof(struct ocfs2_alloc_context), GFP_KERNEL);
1177 (*ac)->ac_bits_wanted = bits_wanted;
1178 (*ac)->ac_max_block = max_block;
1181 if (!(flags & ALLOC_GROUPS_FROM_GLOBAL) &&
1182 ocfs2_alloc_should_use_local(osb, bits_wanted)) {
1183 status = ocfs2_reserve_local_alloc_bits(osb,
1186 if ((status < 0) && (status != -ENOSPC)) {
1192 if (status == -ENOSPC) {
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) {
1198 ocfs2_inode_unlock((*ac)->ac_inode, 1);
1199 inode_unlock((*ac)->ac_inode);
1201 ret = ocfs2_try_to_free_truncate_log(osb, bits_wanted);
1208 inode_lock((*ac)->ac_inode);
1209 ocfs2_inode_lock((*ac)->ac_inode, NULL, 1);
1212 if (status != -ENOSPC)
1220 if ((status < 0) && *ac) {
1221 ocfs2_free_alloc_context(*ac);
1230 int ocfs2_reserve_clusters(struct ocfs2_super *osb,
1232 struct ocfs2_alloc_context **ac)
1234 return ocfs2_reserve_clusters_with_limit(osb, bits_wanted, 0,
1235 ALLOC_NEW_GROUP, ac);
1239 * More or less lifted from ext3. I'll leave their description below:
1241 * "For ext3 allocations, we must not reuse any blocks which are
1242 * allocated in the bitmap buffer's "last committed data" copy. This
1243 * prevents deletes from freeing up the page for reuse until we have
1244 * committed the delete transaction.
1246 * If we didn't do this, then deleting something and reallocating it as
1247 * data would allow the old block to be overwritten before the
1248 * transaction committed (because we force data to disk before commit).
1249 * This would lead to corruption if we crashed between overwriting the
1250 * data and committing the delete.
1252 * @@@ We may want to make this allocation behaviour conditional on
1253 * data-writes at some point, and disable it for metadata allocations or
1254 * sync-data inodes."
1256 * Note: OCFS2 already does this differently for metadata vs data
1257 * allocations, as those bitmaps are separate and undo access is never
1258 * called on a metadata group descriptor.
1260 static int ocfs2_test_bg_bit_allocatable(struct buffer_head *bg_bh,
1263 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
1266 if (ocfs2_test_bit(nr, (unsigned long *)bg->bg_bitmap))
1269 if (!buffer_jbd(bg_bh))
1272 jbd_lock_bh_state(bg_bh);
1273 bg = (struct ocfs2_group_desc *) bh2jh(bg_bh)->b_committed_data;
1275 ret = !ocfs2_test_bit(nr, (unsigned long *)bg->bg_bitmap);
1278 jbd_unlock_bh_state(bg_bh);
1283 static int ocfs2_block_group_find_clear_bits(struct ocfs2_super *osb,
1284 struct buffer_head *bg_bh,
1285 unsigned int bits_wanted,
1286 unsigned int total_bits,
1287 struct ocfs2_suballoc_result *res)
1290 u16 best_offset, best_size;
1291 int offset, start, found, status = 0;
1292 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
1294 /* Callers got this descriptor from
1295 * ocfs2_read_group_descriptor(). Any corruption is a code bug. */
1296 BUG_ON(!OCFS2_IS_VALID_GROUP_DESC(bg));
1298 found = start = best_offset = best_size = 0;
1299 bitmap = bg->bg_bitmap;
1301 while((offset = ocfs2_find_next_zero_bit(bitmap, total_bits, start)) != -1) {
1302 if (offset == total_bits)
1305 if (!ocfs2_test_bg_bit_allocatable(bg_bh, offset)) {
1306 /* We found a zero, but we can't use it as it
1307 * hasn't been put to disk yet! */
1310 } else if (offset == start) {
1311 /* we found a zero */
1313 /* move start to the next bit to test */
1316 /* got a zero after some ones */
1320 if (found > best_size) {
1322 best_offset = start - found;
1324 /* we got everything we needed */
1325 if (found == bits_wanted) {
1326 /* mlog(0, "Found it all!\n"); */
1332 res->sr_bit_offset = best_offset;
1333 res->sr_bits = best_size;
1336 /* No error log here -- see the comment above
1337 * ocfs2_test_bg_bit_allocatable */
1343 int ocfs2_block_group_set_bits(handle_t *handle,
1344 struct inode *alloc_inode,
1345 struct ocfs2_group_desc *bg,
1346 struct buffer_head *group_bh,
1347 unsigned int bit_off,
1348 unsigned int num_bits)
1351 void *bitmap = bg->bg_bitmap;
1352 int journal_type = OCFS2_JOURNAL_ACCESS_WRITE;
1354 /* All callers get the descriptor via
1355 * ocfs2_read_group_descriptor(). Any corruption is a code bug. */
1356 BUG_ON(!OCFS2_IS_VALID_GROUP_DESC(bg));
1357 BUG_ON(le16_to_cpu(bg->bg_free_bits_count) < num_bits);
1359 trace_ocfs2_block_group_set_bits(bit_off, num_bits);
1361 if (ocfs2_is_cluster_bitmap(alloc_inode))
1362 journal_type = OCFS2_JOURNAL_ACCESS_UNDO;
1364 status = ocfs2_journal_access_gd(handle,
1365 INODE_CACHE(alloc_inode),
1373 le16_add_cpu(&bg->bg_free_bits_count, -num_bits);
1374 if (le16_to_cpu(bg->bg_free_bits_count) > le16_to_cpu(bg->bg_bits)) {
1375 return ocfs2_error(alloc_inode->i_sb, "Group descriptor # %llu has bit count %u but claims %u are freed. num_bits %d\n",
1376 (unsigned long long)le64_to_cpu(bg->bg_blkno),
1377 le16_to_cpu(bg->bg_bits),
1378 le16_to_cpu(bg->bg_free_bits_count),
1382 ocfs2_set_bit(bit_off++, bitmap);
1384 ocfs2_journal_dirty(handle, group_bh);
1390 /* find the one with the most empty bits */
1391 static inline u16 ocfs2_find_victim_chain(struct ocfs2_chain_list *cl)
1395 BUG_ON(!cl->cl_next_free_rec);
1398 while (curr < le16_to_cpu(cl->cl_next_free_rec)) {
1399 if (le32_to_cpu(cl->cl_recs[curr].c_free) >
1400 le32_to_cpu(cl->cl_recs[best].c_free))
1405 BUG_ON(best >= le16_to_cpu(cl->cl_next_free_rec));
1409 static int ocfs2_relink_block_group(handle_t *handle,
1410 struct inode *alloc_inode,
1411 struct buffer_head *fe_bh,
1412 struct buffer_head *bg_bh,
1413 struct buffer_head *prev_bg_bh,
1417 /* there is a really tiny chance the journal calls could fail,
1418 * but we wouldn't want inconsistent blocks in *any* case. */
1419 u64 bg_ptr, prev_bg_ptr;
1420 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) fe_bh->b_data;
1421 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
1422 struct ocfs2_group_desc *prev_bg = (struct ocfs2_group_desc *) prev_bg_bh->b_data;
1424 /* The caller got these descriptors from
1425 * ocfs2_read_group_descriptor(). Any corruption is a code bug. */
1426 BUG_ON(!OCFS2_IS_VALID_GROUP_DESC(bg));
1427 BUG_ON(!OCFS2_IS_VALID_GROUP_DESC(prev_bg));
1429 trace_ocfs2_relink_block_group(
1430 (unsigned long long)le64_to_cpu(fe->i_blkno), chain,
1431 (unsigned long long)le64_to_cpu(bg->bg_blkno),
1432 (unsigned long long)le64_to_cpu(prev_bg->bg_blkno));
1434 bg_ptr = le64_to_cpu(bg->bg_next_group);
1435 prev_bg_ptr = le64_to_cpu(prev_bg->bg_next_group);
1437 status = ocfs2_journal_access_gd(handle, INODE_CACHE(alloc_inode),
1439 OCFS2_JOURNAL_ACCESS_WRITE);
1443 prev_bg->bg_next_group = bg->bg_next_group;
1444 ocfs2_journal_dirty(handle, prev_bg_bh);
1446 status = ocfs2_journal_access_gd(handle, INODE_CACHE(alloc_inode),
1447 bg_bh, OCFS2_JOURNAL_ACCESS_WRITE);
1449 goto out_rollback_prev_bg;
1451 bg->bg_next_group = fe->id2.i_chain.cl_recs[chain].c_blkno;
1452 ocfs2_journal_dirty(handle, bg_bh);
1454 status = ocfs2_journal_access_di(handle, INODE_CACHE(alloc_inode),
1455 fe_bh, OCFS2_JOURNAL_ACCESS_WRITE);
1457 goto out_rollback_bg;
1459 fe->id2.i_chain.cl_recs[chain].c_blkno = bg->bg_blkno;
1460 ocfs2_journal_dirty(handle, fe_bh);
1468 bg->bg_next_group = cpu_to_le64(bg_ptr);
1469 out_rollback_prev_bg:
1470 prev_bg->bg_next_group = cpu_to_le64(prev_bg_ptr);
1474 static inline int ocfs2_block_group_reasonably_empty(struct ocfs2_group_desc *bg,
1477 return le16_to_cpu(bg->bg_free_bits_count) > wanted;
1480 /* return 0 on success, -ENOSPC to keep searching and any other < 0
1481 * value on error. */
1482 static int ocfs2_cluster_group_search(struct inode *inode,
1483 struct buffer_head *group_bh,
1484 u32 bits_wanted, u32 min_bits,
1486 struct ocfs2_suballoc_result *res)
1488 int search = -ENOSPC;
1491 struct ocfs2_group_desc *gd = (struct ocfs2_group_desc *) group_bh->b_data;
1492 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
1493 unsigned int max_bits, gd_cluster_off;
1495 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
1497 if (gd->bg_free_bits_count) {
1498 max_bits = le16_to_cpu(gd->bg_bits);
1500 /* Tail groups in cluster bitmaps which aren't cpg
1501 * aligned are prone to partial extension by a failed
1502 * fs resize. If the file system resize never got to
1503 * update the dinode cluster count, then we don't want
1504 * to trust any clusters past it, regardless of what
1505 * the group descriptor says. */
1506 gd_cluster_off = ocfs2_blocks_to_clusters(inode->i_sb,
1507 le64_to_cpu(gd->bg_blkno));
1508 if ((gd_cluster_off + max_bits) >
1509 OCFS2_I(inode)->ip_clusters) {
1510 max_bits = OCFS2_I(inode)->ip_clusters - gd_cluster_off;
1511 trace_ocfs2_cluster_group_search_wrong_max_bits(
1512 (unsigned long long)le64_to_cpu(gd->bg_blkno),
1513 le16_to_cpu(gd->bg_bits),
1514 OCFS2_I(inode)->ip_clusters, max_bits);
1517 ret = ocfs2_block_group_find_clear_bits(OCFS2_SB(inode->i_sb),
1518 group_bh, bits_wanted,
1524 blkoff = ocfs2_clusters_to_blocks(inode->i_sb,
1526 res->sr_bit_offset +
1528 trace_ocfs2_cluster_group_search_max_block(
1529 (unsigned long long)blkoff,
1530 (unsigned long long)max_block);
1531 if (blkoff > max_block)
1535 /* ocfs2_block_group_find_clear_bits() might
1536 * return success, but we still want to return
1537 * -ENOSPC unless it found the minimum number
1539 if (min_bits <= res->sr_bits)
1540 search = 0; /* success */
1541 else if (res->sr_bits) {
1543 * Don't show bits which we'll be returning
1544 * for allocation to the local alloc bitmap.
1546 ocfs2_local_alloc_seen_free_bits(osb, res->sr_bits);
1553 static int ocfs2_block_group_search(struct inode *inode,
1554 struct buffer_head *group_bh,
1555 u32 bits_wanted, u32 min_bits,
1557 struct ocfs2_suballoc_result *res)
1561 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) group_bh->b_data;
1563 BUG_ON(min_bits != 1);
1564 BUG_ON(ocfs2_is_cluster_bitmap(inode));
1566 if (bg->bg_free_bits_count) {
1567 ret = ocfs2_block_group_find_clear_bits(OCFS2_SB(inode->i_sb),
1568 group_bh, bits_wanted,
1569 le16_to_cpu(bg->bg_bits),
1571 if (!ret && max_block) {
1572 blkoff = le64_to_cpu(bg->bg_blkno) +
1573 res->sr_bit_offset + res->sr_bits;
1574 trace_ocfs2_block_group_search_max_block(
1575 (unsigned long long)blkoff,
1576 (unsigned long long)max_block);
1577 if (blkoff > max_block)
1585 int ocfs2_alloc_dinode_update_counts(struct inode *inode,
1587 struct buffer_head *di_bh,
1593 struct ocfs2_dinode *di = (struct ocfs2_dinode *) di_bh->b_data;
1594 struct ocfs2_chain_list *cl = (struct ocfs2_chain_list *) &di->id2.i_chain;
1596 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
1597 OCFS2_JOURNAL_ACCESS_WRITE);
1603 tmp_used = le32_to_cpu(di->id1.bitmap1.i_used);
1604 di->id1.bitmap1.i_used = cpu_to_le32(num_bits + tmp_used);
1605 le32_add_cpu(&cl->cl_recs[chain].c_free, -num_bits);
1606 ocfs2_journal_dirty(handle, di_bh);
1612 void ocfs2_rollback_alloc_dinode_counts(struct inode *inode,
1613 struct buffer_head *di_bh,
1618 struct ocfs2_dinode *di = (struct ocfs2_dinode *) di_bh->b_data;
1619 struct ocfs2_chain_list *cl;
1621 cl = (struct ocfs2_chain_list *)&di->id2.i_chain;
1622 tmp_used = le32_to_cpu(di->id1.bitmap1.i_used);
1623 di->id1.bitmap1.i_used = cpu_to_le32(tmp_used - num_bits);
1624 le32_add_cpu(&cl->cl_recs[chain].c_free, num_bits);
1627 static int ocfs2_bg_discontig_fix_by_rec(struct ocfs2_suballoc_result *res,
1628 struct ocfs2_extent_rec *rec,
1629 struct ocfs2_chain_list *cl)
1631 unsigned int bpc = le16_to_cpu(cl->cl_bpc);
1632 unsigned int bitoff = le32_to_cpu(rec->e_cpos) * bpc;
1633 unsigned int bitcount = le16_to_cpu(rec->e_leaf_clusters) * bpc;
1635 if (res->sr_bit_offset < bitoff)
1637 if (res->sr_bit_offset >= (bitoff + bitcount))
1639 res->sr_blkno = le64_to_cpu(rec->e_blkno) +
1640 (res->sr_bit_offset - bitoff);
1641 if ((res->sr_bit_offset + res->sr_bits) > (bitoff + bitcount))
1642 res->sr_bits = (bitoff + bitcount) - res->sr_bit_offset;
1646 static void ocfs2_bg_discontig_fix_result(struct ocfs2_alloc_context *ac,
1647 struct ocfs2_group_desc *bg,
1648 struct ocfs2_suballoc_result *res)
1651 u64 bg_blkno = res->sr_bg_blkno; /* Save off */
1652 struct ocfs2_extent_rec *rec;
1653 struct ocfs2_dinode *di = (struct ocfs2_dinode *)ac->ac_bh->b_data;
1654 struct ocfs2_chain_list *cl = &di->id2.i_chain;
1656 if (ocfs2_is_cluster_bitmap(ac->ac_inode)) {
1661 res->sr_blkno = res->sr_bg_blkno + res->sr_bit_offset;
1662 res->sr_bg_blkno = 0; /* Clear it for contig block groups */
1663 if (!ocfs2_supports_discontig_bg(OCFS2_SB(ac->ac_inode->i_sb)) ||
1664 !bg->bg_list.l_next_free_rec)
1667 for (i = 0; i < le16_to_cpu(bg->bg_list.l_next_free_rec); i++) {
1668 rec = &bg->bg_list.l_recs[i];
1669 if (ocfs2_bg_discontig_fix_by_rec(res, rec, cl)) {
1670 res->sr_bg_blkno = bg_blkno; /* Restore */
1676 static int ocfs2_search_one_group(struct ocfs2_alloc_context *ac,
1680 struct ocfs2_suballoc_result *res,
1684 struct buffer_head *group_bh = NULL;
1685 struct ocfs2_group_desc *gd;
1686 struct ocfs2_dinode *di = (struct ocfs2_dinode *)ac->ac_bh->b_data;
1687 struct inode *alloc_inode = ac->ac_inode;
1689 ret = ocfs2_read_group_descriptor(alloc_inode, di,
1690 res->sr_bg_blkno, &group_bh);
1696 gd = (struct ocfs2_group_desc *) group_bh->b_data;
1697 ret = ac->ac_group_search(alloc_inode, group_bh, bits_wanted, min_bits,
1698 ac->ac_max_block, res);
1706 ocfs2_bg_discontig_fix_result(ac, gd, res);
1709 * sr_bg_blkno might have been changed by
1710 * ocfs2_bg_discontig_fix_result
1712 res->sr_bg_stable_blkno = group_bh->b_blocknr;
1714 if (ac->ac_find_loc_only)
1717 ret = ocfs2_alloc_dinode_update_counts(alloc_inode, handle, ac->ac_bh,
1719 le16_to_cpu(gd->bg_chain));
1725 ret = ocfs2_block_group_set_bits(handle, alloc_inode, gd, group_bh,
1726 res->sr_bit_offset, res->sr_bits);
1728 ocfs2_rollback_alloc_dinode_counts(alloc_inode, ac->ac_bh,
1730 le16_to_cpu(gd->bg_chain));
1735 *bits_left = le16_to_cpu(gd->bg_free_bits_count);
1743 static int ocfs2_search_chain(struct ocfs2_alloc_context *ac,
1747 struct ocfs2_suballoc_result *res,
1753 struct inode *alloc_inode = ac->ac_inode;
1754 struct buffer_head *group_bh = NULL;
1755 struct buffer_head *prev_group_bh = NULL;
1756 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) ac->ac_bh->b_data;
1757 struct ocfs2_chain_list *cl = (struct ocfs2_chain_list *) &fe->id2.i_chain;
1758 struct ocfs2_group_desc *bg;
1760 chain = ac->ac_chain;
1761 trace_ocfs2_search_chain_begin(
1762 (unsigned long long)OCFS2_I(alloc_inode)->ip_blkno,
1763 bits_wanted, chain);
1765 status = ocfs2_read_group_descriptor(alloc_inode, fe,
1766 le64_to_cpu(cl->cl_recs[chain].c_blkno),
1772 bg = (struct ocfs2_group_desc *) group_bh->b_data;
1775 /* for now, the chain search is a bit simplistic. We just use
1776 * the 1st group with any empty bits. */
1777 while ((status = ac->ac_group_search(alloc_inode, group_bh,
1778 bits_wanted, min_bits,
1781 if (!bg->bg_next_group)
1784 brelse(prev_group_bh);
1785 prev_group_bh = NULL;
1787 next_group = le64_to_cpu(bg->bg_next_group);
1788 prev_group_bh = group_bh;
1790 status = ocfs2_read_group_descriptor(alloc_inode, fe,
1791 next_group, &group_bh);
1796 bg = (struct ocfs2_group_desc *) group_bh->b_data;
1799 if (status != -ENOSPC)
1804 trace_ocfs2_search_chain_succ(
1805 (unsigned long long)le64_to_cpu(bg->bg_blkno), res->sr_bits);
1807 res->sr_bg_blkno = le64_to_cpu(bg->bg_blkno);
1809 BUG_ON(res->sr_bits == 0);
1811 ocfs2_bg_discontig_fix_result(ac, bg, res);
1814 * sr_bg_blkno might have been changed by
1815 * ocfs2_bg_discontig_fix_result
1817 res->sr_bg_stable_blkno = group_bh->b_blocknr;
1820 * Keep track of previous block descriptor read. When
1821 * we find a target, if we have read more than X
1822 * number of descriptors, and the target is reasonably
1823 * empty, relink him to top of his chain.
1825 * We've read 0 extra blocks and only send one more to
1826 * the transaction, yet the next guy to search has a
1829 * Do this *after* figuring out how many bits we're taking out
1830 * of our target group.
1832 if (!ac->ac_disable_chain_relink &&
1834 (ocfs2_block_group_reasonably_empty(bg, res->sr_bits))) {
1835 status = ocfs2_relink_block_group(handle, alloc_inode,
1836 ac->ac_bh, group_bh,
1837 prev_group_bh, chain);
1844 if (ac->ac_find_loc_only)
1847 status = ocfs2_alloc_dinode_update_counts(alloc_inode, handle,
1848 ac->ac_bh, res->sr_bits,
1855 status = ocfs2_block_group_set_bits(handle,
1862 ocfs2_rollback_alloc_dinode_counts(alloc_inode,
1863 ac->ac_bh, res->sr_bits, chain);
1868 trace_ocfs2_search_chain_end(
1869 (unsigned long long)le64_to_cpu(fe->i_blkno),
1873 *bits_left = le16_to_cpu(bg->bg_free_bits_count);
1876 brelse(prev_group_bh);
1883 /* will give out up to bits_wanted contiguous bits. */
1884 static int ocfs2_claim_suballoc_bits(struct ocfs2_alloc_context *ac,
1888 struct ocfs2_suballoc_result *res)
1893 u64 hint = ac->ac_last_group;
1894 struct ocfs2_chain_list *cl;
1895 struct ocfs2_dinode *fe;
1897 BUG_ON(ac->ac_bits_given >= ac->ac_bits_wanted);
1898 BUG_ON(bits_wanted > (ac->ac_bits_wanted - ac->ac_bits_given));
1901 fe = (struct ocfs2_dinode *) ac->ac_bh->b_data;
1903 /* The bh was validated by the inode read during
1904 * ocfs2_reserve_suballoc_bits(). Any corruption is a code bug. */
1905 BUG_ON(!OCFS2_IS_VALID_DINODE(fe));
1907 if (le32_to_cpu(fe->id1.bitmap1.i_used) >=
1908 le32_to_cpu(fe->id1.bitmap1.i_total)) {
1909 status = ocfs2_error(ac->ac_inode->i_sb,
1910 "Chain allocator dinode %llu has %u used bits but only %u total\n",
1911 (unsigned long long)le64_to_cpu(fe->i_blkno),
1912 le32_to_cpu(fe->id1.bitmap1.i_used),
1913 le32_to_cpu(fe->id1.bitmap1.i_total));
1917 res->sr_bg_blkno = hint;
1918 if (res->sr_bg_blkno) {
1919 /* Attempt to short-circuit the usual search mechanism
1920 * by jumping straight to the most recently used
1921 * allocation group. This helps us maintain some
1922 * contiguousness across allocations. */
1923 status = ocfs2_search_one_group(ac, handle, bits_wanted,
1924 min_bits, res, &bits_left);
1927 if (status < 0 && status != -ENOSPC) {
1933 cl = (struct ocfs2_chain_list *) &fe->id2.i_chain;
1935 victim = ocfs2_find_victim_chain(cl);
1936 ac->ac_chain = victim;
1938 status = ocfs2_search_chain(ac, handle, bits_wanted, min_bits,
1941 if (ocfs2_is_cluster_bitmap(ac->ac_inode))
1942 hint = res->sr_bg_blkno;
1944 hint = ocfs2_group_from_res(res);
1947 if (status < 0 && status != -ENOSPC) {
1952 trace_ocfs2_claim_suballoc_bits(victim);
1954 /* If we didn't pick a good victim, then just default to
1955 * searching each chain in order. Don't allow chain relinking
1956 * because we only calculate enough journal credits for one
1957 * relink per alloc. */
1958 ac->ac_disable_chain_relink = 1;
1959 for (i = 0; i < le16_to_cpu(cl->cl_next_free_rec); i ++) {
1962 if (!cl->cl_recs[i].c_free)
1966 status = ocfs2_search_chain(ac, handle, bits_wanted, min_bits,
1969 hint = ocfs2_group_from_res(res);
1972 if (status < 0 && status != -ENOSPC) {
1979 if (status != -ENOSPC) {
1980 /* If the next search of this group is not likely to
1981 * yield a suitable extent, then we reset the last
1982 * group hint so as to not waste a disk read */
1983 if (bits_left < min_bits)
1984 ac->ac_last_group = 0;
1986 ac->ac_last_group = hint;
1995 int ocfs2_claim_metadata(handle_t *handle,
1996 struct ocfs2_alloc_context *ac,
1999 u16 *suballoc_bit_start,
2000 unsigned int *num_bits,
2004 struct ocfs2_suballoc_result res = { .sr_blkno = 0, };
2007 BUG_ON(ac->ac_bits_wanted < (ac->ac_bits_given + bits_wanted));
2008 BUG_ON(ac->ac_which != OCFS2_AC_USE_META);
2010 status = ocfs2_claim_suballoc_bits(ac,
2019 atomic_inc(&OCFS2_SB(ac->ac_inode->i_sb)->alloc_stats.bg_allocs);
2021 *suballoc_loc = res.sr_bg_blkno;
2022 *suballoc_bit_start = res.sr_bit_offset;
2023 *blkno_start = res.sr_blkno;
2024 ac->ac_bits_given += res.sr_bits;
2025 *num_bits = res.sr_bits;
2033 static void ocfs2_init_inode_ac_group(struct inode *dir,
2034 struct buffer_head *parent_di_bh,
2035 struct ocfs2_alloc_context *ac)
2037 struct ocfs2_dinode *di = (struct ocfs2_dinode *)parent_di_bh->b_data;
2039 * Try to allocate inodes from some specific group.
2041 * If the parent dir has recorded the last group used in allocation,
2042 * cool, use it. Otherwise if we try to allocate new inode from the
2043 * same slot the parent dir belongs to, use the same chunk.
2045 * We are very careful here to avoid the mistake of setting
2046 * ac_last_group to a group descriptor from a different (unlocked) slot.
2048 if (OCFS2_I(dir)->ip_last_used_group &&
2049 OCFS2_I(dir)->ip_last_used_slot == ac->ac_alloc_slot)
2050 ac->ac_last_group = OCFS2_I(dir)->ip_last_used_group;
2051 else if (le16_to_cpu(di->i_suballoc_slot) == ac->ac_alloc_slot) {
2052 if (di->i_suballoc_loc)
2053 ac->ac_last_group = le64_to_cpu(di->i_suballoc_loc);
2055 ac->ac_last_group = ocfs2_which_suballoc_group(
2056 le64_to_cpu(di->i_blkno),
2057 le16_to_cpu(di->i_suballoc_bit));
2061 static inline void ocfs2_save_inode_ac_group(struct inode *dir,
2062 struct ocfs2_alloc_context *ac)
2064 OCFS2_I(dir)->ip_last_used_group = ac->ac_last_group;
2065 OCFS2_I(dir)->ip_last_used_slot = ac->ac_alloc_slot;
2068 int ocfs2_find_new_inode_loc(struct inode *dir,
2069 struct buffer_head *parent_fe_bh,
2070 struct ocfs2_alloc_context *ac,
2074 handle_t *handle = NULL;
2075 struct ocfs2_suballoc_result *res;
2078 BUG_ON(ac->ac_bits_given != 0);
2079 BUG_ON(ac->ac_bits_wanted != 1);
2080 BUG_ON(ac->ac_which != OCFS2_AC_USE_INODE);
2082 res = kzalloc(sizeof(*res), GFP_NOFS);
2089 ocfs2_init_inode_ac_group(dir, parent_fe_bh, ac);
2092 * The handle started here is for chain relink. Alternatively,
2093 * we could just disable relink for these calls.
2095 handle = ocfs2_start_trans(OCFS2_SB(dir->i_sb), OCFS2_SUBALLOC_ALLOC);
2096 if (IS_ERR(handle)) {
2097 ret = PTR_ERR(handle);
2104 * This will instruct ocfs2_claim_suballoc_bits and
2105 * ocfs2_search_one_group to search but save actual allocation
2108 ac->ac_find_loc_only = 1;
2110 ret = ocfs2_claim_suballoc_bits(ac, handle, 1, 1, res);
2116 ac->ac_find_loc_priv = res;
2117 *fe_blkno = res->sr_blkno;
2118 ocfs2_update_inode_fsync_trans(handle, dir, 0);
2121 ocfs2_commit_trans(OCFS2_SB(dir->i_sb), handle);
2129 int ocfs2_claim_new_inode_at_loc(handle_t *handle,
2131 struct ocfs2_alloc_context *ac,
2138 struct ocfs2_suballoc_result *res = ac->ac_find_loc_priv;
2139 struct buffer_head *bg_bh = NULL;
2140 struct ocfs2_group_desc *bg;
2141 struct ocfs2_dinode *di = (struct ocfs2_dinode *) ac->ac_bh->b_data;
2144 * Since di_blkno is being passed back in, we check for any
2145 * inconsistencies which may have happened between
2146 * calls. These are code bugs as di_blkno is not expected to
2147 * change once returned from ocfs2_find_new_inode_loc()
2149 BUG_ON(res->sr_blkno != di_blkno);
2151 ret = ocfs2_read_group_descriptor(ac->ac_inode, di,
2152 res->sr_bg_stable_blkno, &bg_bh);
2158 bg = (struct ocfs2_group_desc *) bg_bh->b_data;
2159 chain = le16_to_cpu(bg->bg_chain);
2161 ret = ocfs2_alloc_dinode_update_counts(ac->ac_inode, handle,
2162 ac->ac_bh, res->sr_bits,
2169 ret = ocfs2_block_group_set_bits(handle,
2176 ocfs2_rollback_alloc_dinode_counts(ac->ac_inode,
2177 ac->ac_bh, res->sr_bits, chain);
2182 trace_ocfs2_claim_new_inode_at_loc((unsigned long long)di_blkno,
2185 atomic_inc(&OCFS2_SB(ac->ac_inode->i_sb)->alloc_stats.bg_allocs);
2187 BUG_ON(res->sr_bits != 1);
2189 *suballoc_loc = res->sr_bg_blkno;
2190 *suballoc_bit = res->sr_bit_offset;
2191 ac->ac_bits_given++;
2192 ocfs2_save_inode_ac_group(dir, ac);
2200 int ocfs2_claim_new_inode(handle_t *handle,
2202 struct buffer_head *parent_fe_bh,
2203 struct ocfs2_alloc_context *ac,
2209 struct ocfs2_suballoc_result res;
2212 BUG_ON(ac->ac_bits_given != 0);
2213 BUG_ON(ac->ac_bits_wanted != 1);
2214 BUG_ON(ac->ac_which != OCFS2_AC_USE_INODE);
2216 ocfs2_init_inode_ac_group(dir, parent_fe_bh, ac);
2218 status = ocfs2_claim_suballoc_bits(ac,
2227 atomic_inc(&OCFS2_SB(ac->ac_inode->i_sb)->alloc_stats.bg_allocs);
2229 BUG_ON(res.sr_bits != 1);
2231 *suballoc_loc = res.sr_bg_blkno;
2232 *suballoc_bit = res.sr_bit_offset;
2233 *fe_blkno = res.sr_blkno;
2234 ac->ac_bits_given++;
2235 ocfs2_save_inode_ac_group(dir, ac);
2243 /* translate a group desc. blkno and it's bitmap offset into
2244 * disk cluster offset. */
2245 static inline u32 ocfs2_desc_bitmap_to_cluster_off(struct inode *inode,
2249 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2252 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
2254 if (bg_blkno != osb->first_cluster_group_blkno)
2255 cluster = ocfs2_blocks_to_clusters(inode->i_sb, bg_blkno);
2256 cluster += (u32) bg_bit_off;
2260 /* given a cluster offset, calculate which block group it belongs to
2261 * and return that block offset. */
2262 u64 ocfs2_which_cluster_group(struct inode *inode, u32 cluster)
2264 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2267 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
2269 group_no = cluster / osb->bitmap_cpg;
2271 return osb->first_cluster_group_blkno;
2272 return ocfs2_clusters_to_blocks(inode->i_sb,
2273 group_no * osb->bitmap_cpg);
2276 /* given the block number of a cluster start, calculate which cluster
2277 * group and descriptor bitmap offset that corresponds to. */
2278 static inline void ocfs2_block_to_cluster_group(struct inode *inode,
2283 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2284 u32 data_cluster = ocfs2_blocks_to_clusters(osb->sb, data_blkno);
2286 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
2288 *bg_blkno = ocfs2_which_cluster_group(inode,
2291 if (*bg_blkno == osb->first_cluster_group_blkno)
2292 *bg_bit_off = (u16) data_cluster;
2294 *bg_bit_off = (u16) ocfs2_blocks_to_clusters(osb->sb,
2295 data_blkno - *bg_blkno);
2299 * min_bits - minimum contiguous chunk from this total allocation we
2300 * can handle. set to what we asked for originally for a full
2301 * contig. allocation, set to '1' to indicate we can deal with extents
2304 int __ocfs2_claim_clusters(handle_t *handle,
2305 struct ocfs2_alloc_context *ac,
2312 unsigned int bits_wanted = max_clusters;
2313 struct ocfs2_suballoc_result res = { .sr_blkno = 0, };
2314 struct ocfs2_super *osb = OCFS2_SB(ac->ac_inode->i_sb);
2316 BUG_ON(ac->ac_bits_given >= ac->ac_bits_wanted);
2318 BUG_ON(ac->ac_which != OCFS2_AC_USE_LOCAL
2319 && ac->ac_which != OCFS2_AC_USE_MAIN);
2321 if (ac->ac_which == OCFS2_AC_USE_LOCAL) {
2322 WARN_ON(min_clusters > 1);
2324 status = ocfs2_claim_local_alloc_bits(osb,
2331 atomic_inc(&osb->alloc_stats.local_data);
2333 if (min_clusters > (osb->bitmap_cpg - 1)) {
2334 /* The only paths asking for contiguousness
2335 * should know about this already. */
2336 mlog(ML_ERROR, "minimum allocation requested %u exceeds "
2337 "group bitmap size %u!\n", min_clusters,
2342 /* clamp the current request down to a realistic size. */
2343 if (bits_wanted > (osb->bitmap_cpg - 1))
2344 bits_wanted = osb->bitmap_cpg - 1;
2346 status = ocfs2_claim_suballoc_bits(ac,
2352 BUG_ON(res.sr_blkno); /* cluster alloc can't set */
2354 ocfs2_desc_bitmap_to_cluster_off(ac->ac_inode,
2357 atomic_inc(&osb->alloc_stats.bitmap_data);
2358 *num_clusters = res.sr_bits;
2362 if (status != -ENOSPC)
2367 ac->ac_bits_given += *num_clusters;
2375 int ocfs2_claim_clusters(handle_t *handle,
2376 struct ocfs2_alloc_context *ac,
2381 unsigned int bits_wanted = ac->ac_bits_wanted - ac->ac_bits_given;
2383 return __ocfs2_claim_clusters(handle, ac, min_clusters,
2384 bits_wanted, cluster_start, num_clusters);
2387 static int ocfs2_block_group_clear_bits(handle_t *handle,
2388 struct inode *alloc_inode,
2389 struct ocfs2_group_desc *bg,
2390 struct buffer_head *group_bh,
2391 unsigned int bit_off,
2392 unsigned int num_bits,
2393 void (*undo_fn)(unsigned int bit,
2394 unsigned long *bmap))
2398 struct ocfs2_group_desc *undo_bg = NULL;
2400 /* The caller got this descriptor from
2401 * ocfs2_read_group_descriptor(). Any corruption is a code bug. */
2402 BUG_ON(!OCFS2_IS_VALID_GROUP_DESC(bg));
2404 trace_ocfs2_block_group_clear_bits(bit_off, num_bits);
2406 BUG_ON(undo_fn && !ocfs2_is_cluster_bitmap(alloc_inode));
2407 status = ocfs2_journal_access_gd(handle, INODE_CACHE(alloc_inode),
2410 OCFS2_JOURNAL_ACCESS_UNDO :
2411 OCFS2_JOURNAL_ACCESS_WRITE);
2418 jbd_lock_bh_state(group_bh);
2419 undo_bg = (struct ocfs2_group_desc *)
2420 bh2jh(group_bh)->b_committed_data;
2426 ocfs2_clear_bit((bit_off + tmp),
2427 (unsigned long *) bg->bg_bitmap);
2429 undo_fn(bit_off + tmp,
2430 (unsigned long *) undo_bg->bg_bitmap);
2432 le16_add_cpu(&bg->bg_free_bits_count, num_bits);
2433 if (le16_to_cpu(bg->bg_free_bits_count) > le16_to_cpu(bg->bg_bits)) {
2434 return ocfs2_error(alloc_inode->i_sb, "Group descriptor # %llu has bit count %u but claims %u are freed. num_bits %d\n",
2435 (unsigned long long)le64_to_cpu(bg->bg_blkno),
2436 le16_to_cpu(bg->bg_bits),
2437 le16_to_cpu(bg->bg_free_bits_count),
2442 jbd_unlock_bh_state(group_bh);
2444 ocfs2_journal_dirty(handle, group_bh);
2450 * expects the suballoc inode to already be locked.
2452 static int _ocfs2_free_suballoc_bits(handle_t *handle,
2453 struct inode *alloc_inode,
2454 struct buffer_head *alloc_bh,
2455 unsigned int start_bit,
2458 void (*undo_fn)(unsigned int bit,
2459 unsigned long *bitmap))
2463 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) alloc_bh->b_data;
2464 struct ocfs2_chain_list *cl = &fe->id2.i_chain;
2465 struct buffer_head *group_bh = NULL;
2466 struct ocfs2_group_desc *group;
2468 /* The alloc_bh comes from ocfs2_free_dinode() or
2469 * ocfs2_free_clusters(). The callers have all locked the
2470 * allocator and gotten alloc_bh from the lock call. This
2471 * validates the dinode buffer. Any corruption that has happened
2473 BUG_ON(!OCFS2_IS_VALID_DINODE(fe));
2474 BUG_ON((count + start_bit) > ocfs2_bits_per_group(cl));
2476 trace_ocfs2_free_suballoc_bits(
2477 (unsigned long long)OCFS2_I(alloc_inode)->ip_blkno,
2478 (unsigned long long)bg_blkno,
2481 status = ocfs2_read_group_descriptor(alloc_inode, fe, bg_blkno,
2487 group = (struct ocfs2_group_desc *) group_bh->b_data;
2489 BUG_ON((count + start_bit) > le16_to_cpu(group->bg_bits));
2491 status = ocfs2_block_group_clear_bits(handle, alloc_inode,
2493 start_bit, count, undo_fn);
2499 status = ocfs2_journal_access_di(handle, INODE_CACHE(alloc_inode),
2500 alloc_bh, OCFS2_JOURNAL_ACCESS_WRITE);
2503 ocfs2_block_group_set_bits(handle, alloc_inode, group, group_bh,
2508 le32_add_cpu(&cl->cl_recs[le16_to_cpu(group->bg_chain)].c_free,
2510 tmp_used = le32_to_cpu(fe->id1.bitmap1.i_used);
2511 fe->id1.bitmap1.i_used = cpu_to_le32(tmp_used - count);
2512 ocfs2_journal_dirty(handle, alloc_bh);
2522 int ocfs2_free_suballoc_bits(handle_t *handle,
2523 struct inode *alloc_inode,
2524 struct buffer_head *alloc_bh,
2525 unsigned int start_bit,
2529 return _ocfs2_free_suballoc_bits(handle, alloc_inode, alloc_bh,
2530 start_bit, bg_blkno, count, NULL);
2533 int ocfs2_free_dinode(handle_t *handle,
2534 struct inode *inode_alloc_inode,
2535 struct buffer_head *inode_alloc_bh,
2536 struct ocfs2_dinode *di)
2538 u64 blk = le64_to_cpu(di->i_blkno);
2539 u16 bit = le16_to_cpu(di->i_suballoc_bit);
2540 u64 bg_blkno = ocfs2_which_suballoc_group(blk, bit);
2542 if (di->i_suballoc_loc)
2543 bg_blkno = le64_to_cpu(di->i_suballoc_loc);
2544 return ocfs2_free_suballoc_bits(handle, inode_alloc_inode,
2545 inode_alloc_bh, bit, bg_blkno, 1);
2548 static int _ocfs2_free_clusters(handle_t *handle,
2549 struct inode *bitmap_inode,
2550 struct buffer_head *bitmap_bh,
2552 unsigned int num_clusters,
2553 void (*undo_fn)(unsigned int bit,
2554 unsigned long *bitmap))
2559 struct ocfs2_dinode *fe;
2561 /* You can't ever have a contiguous set of clusters
2562 * bigger than a block group bitmap so we never have to worry
2563 * about looping on them.
2564 * This is expensive. We can safely remove once this stuff has
2565 * gotten tested really well. */
2566 BUG_ON(start_blk != ocfs2_clusters_to_blocks(bitmap_inode->i_sb, ocfs2_blocks_to_clusters(bitmap_inode->i_sb, start_blk)));
2568 fe = (struct ocfs2_dinode *) bitmap_bh->b_data;
2570 ocfs2_block_to_cluster_group(bitmap_inode, start_blk, &bg_blkno,
2573 trace_ocfs2_free_clusters((unsigned long long)bg_blkno,
2574 (unsigned long long)start_blk,
2575 bg_start_bit, num_clusters);
2577 status = _ocfs2_free_suballoc_bits(handle, bitmap_inode, bitmap_bh,
2578 bg_start_bit, bg_blkno,
2579 num_clusters, undo_fn);
2585 ocfs2_local_alloc_seen_free_bits(OCFS2_SB(bitmap_inode->i_sb),
2594 int ocfs2_free_clusters(handle_t *handle,
2595 struct inode *bitmap_inode,
2596 struct buffer_head *bitmap_bh,
2598 unsigned int num_clusters)
2600 return _ocfs2_free_clusters(handle, bitmap_inode, bitmap_bh,
2601 start_blk, num_clusters,
2606 * Give never-used clusters back to the global bitmap. We don't need
2607 * to protect these bits in the undo buffer.
2609 int ocfs2_release_clusters(handle_t *handle,
2610 struct inode *bitmap_inode,
2611 struct buffer_head *bitmap_bh,
2613 unsigned int num_clusters)
2615 return _ocfs2_free_clusters(handle, bitmap_inode, bitmap_bh,
2616 start_blk, num_clusters,
2620 static inline void ocfs2_debug_bg(struct ocfs2_group_desc *bg)
2622 printk("Block Group:\n");
2623 printk("bg_signature: %s\n", bg->bg_signature);
2624 printk("bg_size: %u\n", bg->bg_size);
2625 printk("bg_bits: %u\n", bg->bg_bits);
2626 printk("bg_free_bits_count: %u\n", bg->bg_free_bits_count);
2627 printk("bg_chain: %u\n", bg->bg_chain);
2628 printk("bg_generation: %u\n", le32_to_cpu(bg->bg_generation));
2629 printk("bg_next_group: %llu\n",
2630 (unsigned long long)bg->bg_next_group);
2631 printk("bg_parent_dinode: %llu\n",
2632 (unsigned long long)bg->bg_parent_dinode);
2633 printk("bg_blkno: %llu\n",
2634 (unsigned long long)bg->bg_blkno);
2637 static inline void ocfs2_debug_suballoc_inode(struct ocfs2_dinode *fe)
2641 printk("Suballoc Inode %llu:\n", (unsigned long long)fe->i_blkno);
2642 printk("i_signature: %s\n", fe->i_signature);
2643 printk("i_size: %llu\n",
2644 (unsigned long long)fe->i_size);
2645 printk("i_clusters: %u\n", fe->i_clusters);
2646 printk("i_generation: %u\n",
2647 le32_to_cpu(fe->i_generation));
2648 printk("id1.bitmap1.i_used: %u\n",
2649 le32_to_cpu(fe->id1.bitmap1.i_used));
2650 printk("id1.bitmap1.i_total: %u\n",
2651 le32_to_cpu(fe->id1.bitmap1.i_total));
2652 printk("id2.i_chain.cl_cpg: %u\n", fe->id2.i_chain.cl_cpg);
2653 printk("id2.i_chain.cl_bpc: %u\n", fe->id2.i_chain.cl_bpc);
2654 printk("id2.i_chain.cl_count: %u\n", fe->id2.i_chain.cl_count);
2655 printk("id2.i_chain.cl_next_free_rec: %u\n",
2656 fe->id2.i_chain.cl_next_free_rec);
2657 for(i = 0; i < fe->id2.i_chain.cl_next_free_rec; i++) {
2658 printk("fe->id2.i_chain.cl_recs[%d].c_free: %u\n", i,
2659 fe->id2.i_chain.cl_recs[i].c_free);
2660 printk("fe->id2.i_chain.cl_recs[%d].c_total: %u\n", i,
2661 fe->id2.i_chain.cl_recs[i].c_total);
2662 printk("fe->id2.i_chain.cl_recs[%d].c_blkno: %llu\n", i,
2663 (unsigned long long)fe->id2.i_chain.cl_recs[i].c_blkno);
2668 * For a given allocation, determine which allocators will need to be
2669 * accessed, and lock them, reserving the appropriate number of bits.
2671 * Sparse file systems call this from ocfs2_write_begin_nolock()
2672 * and ocfs2_allocate_unwritten_extents().
2674 * File systems which don't support holes call this from
2675 * ocfs2_extend_allocation().
2677 int ocfs2_lock_allocators(struct inode *inode,
2678 struct ocfs2_extent_tree *et,
2679 u32 clusters_to_add, u32 extents_to_split,
2680 struct ocfs2_alloc_context **data_ac,
2681 struct ocfs2_alloc_context **meta_ac)
2683 int ret = 0, num_free_extents;
2684 unsigned int max_recs_needed = clusters_to_add + 2 * extents_to_split;
2685 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2691 BUG_ON(clusters_to_add != 0 && data_ac == NULL);
2693 num_free_extents = ocfs2_num_free_extents(osb, et);
2694 if (num_free_extents < 0) {
2695 ret = num_free_extents;
2701 * Sparse allocation file systems need to be more conservative
2702 * with reserving room for expansion - the actual allocation
2703 * happens while we've got a journal handle open so re-taking
2704 * a cluster lock (because we ran out of room for another
2705 * extent) will violate ordering rules.
2707 * Most of the time we'll only be seeing this 1 cluster at a time
2710 * Always lock for any unwritten extents - we might want to
2711 * add blocks during a split.
2713 if (!num_free_extents ||
2714 (ocfs2_sparse_alloc(osb) && num_free_extents < max_recs_needed)) {
2715 ret = ocfs2_reserve_new_metadata(osb, et->et_root_el, meta_ac);
2723 if (clusters_to_add == 0)
2726 ret = ocfs2_reserve_clusters(osb, clusters_to_add, data_ac);
2736 ocfs2_free_alloc_context(*meta_ac);
2741 * We cannot have an error and a non null *data_ac.
2749 * Read the inode specified by blkno to get suballoc_slot and
2752 static int ocfs2_get_suballoc_slot_bit(struct ocfs2_super *osb, u64 blkno,
2753 u16 *suballoc_slot, u64 *group_blkno,
2757 struct buffer_head *inode_bh = NULL;
2758 struct ocfs2_dinode *inode_fe;
2760 trace_ocfs2_get_suballoc_slot_bit((unsigned long long)blkno);
2762 /* dirty read disk */
2763 status = ocfs2_read_blocks_sync(osb, blkno, 1, &inode_bh);
2765 mlog(ML_ERROR, "read block %llu failed %d\n",
2766 (unsigned long long)blkno, status);
2770 inode_fe = (struct ocfs2_dinode *) inode_bh->b_data;
2771 if (!OCFS2_IS_VALID_DINODE(inode_fe)) {
2772 mlog(ML_ERROR, "invalid inode %llu requested\n",
2773 (unsigned long long)blkno);
2778 if (le16_to_cpu(inode_fe->i_suballoc_slot) != (u16)OCFS2_INVALID_SLOT &&
2779 (u32)le16_to_cpu(inode_fe->i_suballoc_slot) > osb->max_slots - 1) {
2780 mlog(ML_ERROR, "inode %llu has invalid suballoc slot %u\n",
2781 (unsigned long long)blkno,
2782 (u32)le16_to_cpu(inode_fe->i_suballoc_slot));
2788 *suballoc_slot = le16_to_cpu(inode_fe->i_suballoc_slot);
2790 *suballoc_bit = le16_to_cpu(inode_fe->i_suballoc_bit);
2792 *group_blkno = le64_to_cpu(inode_fe->i_suballoc_loc);
2803 * test whether bit is SET in allocator bitmap or not. on success, 0
2804 * is returned and *res is 1 for SET; 0 otherwise. when fails, errno
2805 * is returned and *res is meaningless. Call this after you have
2806 * cluster locked against suballoc, or you may get a result based on
2807 * non-up2date contents
2809 static int ocfs2_test_suballoc_bit(struct ocfs2_super *osb,
2810 struct inode *suballoc,
2811 struct buffer_head *alloc_bh,
2812 u64 group_blkno, u64 blkno,
2815 struct ocfs2_dinode *alloc_di;
2816 struct ocfs2_group_desc *group;
2817 struct buffer_head *group_bh = NULL;
2821 trace_ocfs2_test_suballoc_bit((unsigned long long)blkno,
2824 alloc_di = (struct ocfs2_dinode *)alloc_bh->b_data;
2825 if ((bit + 1) > ocfs2_bits_per_group(&alloc_di->id2.i_chain)) {
2826 mlog(ML_ERROR, "suballoc bit %u out of range of %u\n",
2828 ocfs2_bits_per_group(&alloc_di->id2.i_chain));
2833 bg_blkno = group_blkno ? group_blkno :
2834 ocfs2_which_suballoc_group(blkno, bit);
2835 status = ocfs2_read_group_descriptor(suballoc, alloc_di, bg_blkno,
2838 mlog(ML_ERROR, "read group %llu failed %d\n",
2839 (unsigned long long)bg_blkno, status);
2843 group = (struct ocfs2_group_desc *) group_bh->b_data;
2844 *res = ocfs2_test_bit(bit, (unsigned long *)group->bg_bitmap);
2855 * Test if the bit representing this inode (blkno) is set in the
2858 * On success, 0 is returned and *res is 1 for SET; 0 otherwise.
2860 * In the event of failure, a negative value is returned and *res is
2863 * Callers must make sure to hold nfs_sync_lock to prevent
2864 * ocfs2_delete_inode() on another node from accessing the same
2865 * suballocator concurrently.
2867 int ocfs2_test_inode_bit(struct ocfs2_super *osb, u64 blkno, int *res)
2870 u64 group_blkno = 0;
2871 u16 suballoc_bit = 0, suballoc_slot = 0;
2872 struct inode *inode_alloc_inode;
2873 struct buffer_head *alloc_bh = NULL;
2875 trace_ocfs2_test_inode_bit((unsigned long long)blkno);
2877 status = ocfs2_get_suballoc_slot_bit(osb, blkno, &suballoc_slot,
2878 &group_blkno, &suballoc_bit);
2880 mlog(ML_ERROR, "get alloc slot and bit failed %d\n", status);
2885 ocfs2_get_system_file_inode(osb, INODE_ALLOC_SYSTEM_INODE,
2887 if (!inode_alloc_inode) {
2888 /* the error code could be inaccurate, but we are not able to
2889 * get the correct one. */
2891 mlog(ML_ERROR, "unable to get alloc inode in slot %u\n",
2892 (u32)suballoc_slot);
2896 inode_lock(inode_alloc_inode);
2897 status = ocfs2_inode_lock(inode_alloc_inode, &alloc_bh, 0);
2899 inode_unlock(inode_alloc_inode);
2900 iput(inode_alloc_inode);
2901 mlog(ML_ERROR, "lock on alloc inode on slot %u failed %d\n",
2902 (u32)suballoc_slot, status);
2906 status = ocfs2_test_suballoc_bit(osb, inode_alloc_inode, alloc_bh,
2907 group_blkno, blkno, suballoc_bit, res);
2909 mlog(ML_ERROR, "test suballoc bit failed %d\n", status);
2911 ocfs2_inode_unlock(inode_alloc_inode, 0);
2912 inode_unlock(inode_alloc_inode);
2914 iput(inode_alloc_inode);