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 #define MLOG_MASK_PREFIX ML_DISK_ALLOC
33 #include <cluster/masklog.h>
41 #include "localalloc.h"
47 #include "buffer_head_io.h"
49 static inline void ocfs2_debug_bg(struct ocfs2_group_desc *bg);
50 static inline void ocfs2_debug_suballoc_inode(struct ocfs2_dinode *fe);
51 static inline u16 ocfs2_find_victim_chain(struct ocfs2_chain_list *cl);
52 static int ocfs2_block_group_fill(handle_t *handle,
53 struct inode *alloc_inode,
54 struct buffer_head *bg_bh,
57 struct ocfs2_chain_list *cl);
58 static int ocfs2_block_group_alloc(struct ocfs2_super *osb,
59 struct inode *alloc_inode,
60 struct buffer_head *bh);
62 static int ocfs2_cluster_group_search(struct inode *inode,
63 struct buffer_head *group_bh,
64 u32 bits_wanted, u32 min_bits,
65 u16 *bit_off, u16 *bits_found);
66 static int ocfs2_block_group_search(struct inode *inode,
67 struct buffer_head *group_bh,
68 u32 bits_wanted, u32 min_bits,
69 u16 *bit_off, u16 *bits_found);
70 static int ocfs2_claim_suballoc_bits(struct ocfs2_super *osb,
71 struct ocfs2_alloc_context *ac,
76 unsigned int *num_bits,
78 static int ocfs2_test_bg_bit_allocatable(struct buffer_head *bg_bh,
80 static inline int ocfs2_block_group_set_bits(handle_t *handle,
81 struct inode *alloc_inode,
82 struct ocfs2_group_desc *bg,
83 struct buffer_head *group_bh,
85 unsigned int num_bits);
86 static inline int ocfs2_block_group_clear_bits(handle_t *handle,
87 struct inode *alloc_inode,
88 struct ocfs2_group_desc *bg,
89 struct buffer_head *group_bh,
91 unsigned int num_bits);
93 static int ocfs2_relink_block_group(handle_t *handle,
94 struct inode *alloc_inode,
95 struct buffer_head *fe_bh,
96 struct buffer_head *bg_bh,
97 struct buffer_head *prev_bg_bh,
99 static inline int ocfs2_block_group_reasonably_empty(struct ocfs2_group_desc *bg,
101 static inline u32 ocfs2_desc_bitmap_to_cluster_off(struct inode *inode,
104 static inline void ocfs2_block_to_cluster_group(struct inode *inode,
109 void ocfs2_free_alloc_context(struct ocfs2_alloc_context *ac)
111 struct inode *inode = ac->ac_inode;
114 if (ac->ac_which != OCFS2_AC_USE_LOCAL)
115 ocfs2_inode_unlock(inode, 1);
117 mutex_unlock(&inode->i_mutex);
126 static u32 ocfs2_bits_per_group(struct ocfs2_chain_list *cl)
128 return (u32)le16_to_cpu(cl->cl_cpg) * (u32)le16_to_cpu(cl->cl_bpc);
131 /* somewhat more expensive than our other checks, so use sparingly. */
132 int ocfs2_check_group_descriptor(struct super_block *sb,
133 struct ocfs2_dinode *di,
134 struct ocfs2_group_desc *gd)
136 unsigned int max_bits;
138 if (!OCFS2_IS_VALID_GROUP_DESC(gd)) {
139 OCFS2_RO_ON_INVALID_GROUP_DESC(sb, gd);
143 if (di->i_blkno != gd->bg_parent_dinode) {
144 ocfs2_error(sb, "Group descriptor # %llu has bad parent "
145 "pointer (%llu, expected %llu)",
146 (unsigned long long)le64_to_cpu(gd->bg_blkno),
147 (unsigned long long)le64_to_cpu(gd->bg_parent_dinode),
148 (unsigned long long)le64_to_cpu(di->i_blkno));
152 max_bits = le16_to_cpu(di->id2.i_chain.cl_cpg) * le16_to_cpu(di->id2.i_chain.cl_bpc);
153 if (le16_to_cpu(gd->bg_bits) > max_bits) {
154 ocfs2_error(sb, "Group descriptor # %llu has bit count of %u",
155 (unsigned long long)le64_to_cpu(gd->bg_blkno),
156 le16_to_cpu(gd->bg_bits));
160 if (le16_to_cpu(gd->bg_chain) >=
161 le16_to_cpu(di->id2.i_chain.cl_next_free_rec)) {
162 ocfs2_error(sb, "Group descriptor # %llu has bad chain %u",
163 (unsigned long long)le64_to_cpu(gd->bg_blkno),
164 le16_to_cpu(gd->bg_chain));
168 if (le16_to_cpu(gd->bg_free_bits_count) > le16_to_cpu(gd->bg_bits)) {
169 ocfs2_error(sb, "Group descriptor # %llu has bit count %u but "
170 "claims that %u are free",
171 (unsigned long long)le64_to_cpu(gd->bg_blkno),
172 le16_to_cpu(gd->bg_bits),
173 le16_to_cpu(gd->bg_free_bits_count));
177 if (le16_to_cpu(gd->bg_bits) > (8 * le16_to_cpu(gd->bg_size))) {
178 ocfs2_error(sb, "Group descriptor # %llu has bit count %u but "
179 "max bitmap bits of %u",
180 (unsigned long long)le64_to_cpu(gd->bg_blkno),
181 le16_to_cpu(gd->bg_bits),
182 8 * le16_to_cpu(gd->bg_size));
189 static int ocfs2_block_group_fill(handle_t *handle,
190 struct inode *alloc_inode,
191 struct buffer_head *bg_bh,
194 struct ocfs2_chain_list *cl)
197 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
198 struct super_block * sb = alloc_inode->i_sb;
202 if (((unsigned long long) bg_bh->b_blocknr) != group_blkno) {
203 ocfs2_error(alloc_inode->i_sb, "group block (%llu) != "
205 (unsigned long long)group_blkno,
206 (unsigned long long) bg_bh->b_blocknr);
211 status = ocfs2_journal_access(handle,
214 OCFS2_JOURNAL_ACCESS_CREATE);
220 memset(bg, 0, sb->s_blocksize);
221 strcpy(bg->bg_signature, OCFS2_GROUP_DESC_SIGNATURE);
222 bg->bg_generation = cpu_to_le32(OCFS2_SB(sb)->fs_generation);
223 bg->bg_size = cpu_to_le16(ocfs2_group_bitmap_size(sb));
224 bg->bg_bits = cpu_to_le16(ocfs2_bits_per_group(cl));
225 bg->bg_chain = cpu_to_le16(my_chain);
226 bg->bg_next_group = cl->cl_recs[my_chain].c_blkno;
227 bg->bg_parent_dinode = cpu_to_le64(OCFS2_I(alloc_inode)->ip_blkno);
228 bg->bg_blkno = cpu_to_le64(group_blkno);
229 /* set the 1st bit in the bitmap to account for the descriptor block */
230 ocfs2_set_bit(0, (unsigned long *)bg->bg_bitmap);
231 bg->bg_free_bits_count = cpu_to_le16(le16_to_cpu(bg->bg_bits) - 1);
233 status = ocfs2_journal_dirty(handle, bg_bh);
237 /* There is no need to zero out or otherwise initialize the
238 * other blocks in a group - All valid FS metadata in a block
239 * group stores the superblock fs_generation value at
240 * allocation time. */
247 static inline u16 ocfs2_find_smallest_chain(struct ocfs2_chain_list *cl)
252 while (curr < le16_to_cpu(cl->cl_count)) {
253 if (le32_to_cpu(cl->cl_recs[best].c_total) >
254 le32_to_cpu(cl->cl_recs[curr].c_total))
262 * We expect the block group allocator to already be locked.
264 static int ocfs2_block_group_alloc(struct ocfs2_super *osb,
265 struct inode *alloc_inode,
266 struct buffer_head *bh)
269 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) bh->b_data;
270 struct ocfs2_chain_list *cl;
271 struct ocfs2_alloc_context *ac = NULL;
272 handle_t *handle = NULL;
273 u32 bit_off, num_bits;
276 struct buffer_head *bg_bh = NULL;
277 struct ocfs2_group_desc *bg;
279 BUG_ON(ocfs2_is_cluster_bitmap(alloc_inode));
283 cl = &fe->id2.i_chain;
284 status = ocfs2_reserve_clusters(osb,
285 le16_to_cpu(cl->cl_cpg),
288 if (status != -ENOSPC)
293 credits = ocfs2_calc_group_alloc_credits(osb->sb,
294 le16_to_cpu(cl->cl_cpg));
295 handle = ocfs2_start_trans(osb, credits);
296 if (IS_ERR(handle)) {
297 status = PTR_ERR(handle);
303 status = ocfs2_claim_clusters(osb,
306 le16_to_cpu(cl->cl_cpg),
310 if (status != -ENOSPC)
315 alloc_rec = ocfs2_find_smallest_chain(cl);
317 /* setup the group */
318 bg_blkno = ocfs2_clusters_to_blocks(osb->sb, bit_off);
319 mlog(0, "new descriptor, record %u, at block %llu\n",
320 alloc_rec, (unsigned long long)bg_blkno);
322 bg_bh = sb_getblk(osb->sb, bg_blkno);
328 ocfs2_set_new_buffer_uptodate(alloc_inode, bg_bh);
330 status = ocfs2_block_group_fill(handle,
341 bg = (struct ocfs2_group_desc *) bg_bh->b_data;
343 status = ocfs2_journal_access(handle, alloc_inode,
344 bh, OCFS2_JOURNAL_ACCESS_WRITE);
350 le32_add_cpu(&cl->cl_recs[alloc_rec].c_free,
351 le16_to_cpu(bg->bg_free_bits_count));
352 le32_add_cpu(&cl->cl_recs[alloc_rec].c_total, le16_to_cpu(bg->bg_bits));
353 cl->cl_recs[alloc_rec].c_blkno = cpu_to_le64(bg_blkno);
354 if (le16_to_cpu(cl->cl_next_free_rec) < le16_to_cpu(cl->cl_count))
355 le16_add_cpu(&cl->cl_next_free_rec, 1);
357 le32_add_cpu(&fe->id1.bitmap1.i_used, le16_to_cpu(bg->bg_bits) -
358 le16_to_cpu(bg->bg_free_bits_count));
359 le32_add_cpu(&fe->id1.bitmap1.i_total, le16_to_cpu(bg->bg_bits));
360 le32_add_cpu(&fe->i_clusters, le16_to_cpu(cl->cl_cpg));
362 status = ocfs2_journal_dirty(handle, bh);
368 spin_lock(&OCFS2_I(alloc_inode)->ip_lock);
369 OCFS2_I(alloc_inode)->ip_clusters = le32_to_cpu(fe->i_clusters);
370 fe->i_size = cpu_to_le64(ocfs2_clusters_to_bytes(alloc_inode->i_sb,
371 le32_to_cpu(fe->i_clusters)));
372 spin_unlock(&OCFS2_I(alloc_inode)->ip_lock);
373 i_size_write(alloc_inode, le64_to_cpu(fe->i_size));
374 alloc_inode->i_blocks = ocfs2_inode_sector_count(alloc_inode);
379 ocfs2_commit_trans(osb, handle);
382 ocfs2_free_alloc_context(ac);
391 static int ocfs2_reserve_suballoc_bits(struct ocfs2_super *osb,
392 struct ocfs2_alloc_context *ac,
397 u32 bits_wanted = ac->ac_bits_wanted;
398 struct inode *alloc_inode;
399 struct buffer_head *bh = NULL;
400 struct ocfs2_dinode *fe;
405 alloc_inode = ocfs2_get_system_file_inode(osb, type, slot);
411 mutex_lock(&alloc_inode->i_mutex);
413 status = ocfs2_inode_lock(alloc_inode, &bh, 1);
415 mutex_unlock(&alloc_inode->i_mutex);
422 ac->ac_inode = alloc_inode;
424 fe = (struct ocfs2_dinode *) bh->b_data;
425 if (!OCFS2_IS_VALID_DINODE(fe)) {
426 OCFS2_RO_ON_INVALID_DINODE(alloc_inode->i_sb, fe);
430 if (!(fe->i_flags & cpu_to_le32(OCFS2_CHAIN_FL))) {
431 ocfs2_error(alloc_inode->i_sb, "Invalid chain allocator %llu",
432 (unsigned long long)le64_to_cpu(fe->i_blkno));
437 free_bits = le32_to_cpu(fe->id1.bitmap1.i_total) -
438 le32_to_cpu(fe->id1.bitmap1.i_used);
440 if (bits_wanted > free_bits) {
441 /* cluster bitmap never grows */
442 if (ocfs2_is_cluster_bitmap(alloc_inode)) {
443 mlog(0, "Disk Full: wanted=%u, free_bits=%u\n",
444 bits_wanted, free_bits);
449 status = ocfs2_block_group_alloc(osb, alloc_inode, bh);
451 if (status != -ENOSPC)
455 atomic_inc(&osb->alloc_stats.bg_extends);
457 /* You should never ask for this much metadata */
459 (le32_to_cpu(fe->id1.bitmap1.i_total)
460 - le32_to_cpu(fe->id1.bitmap1.i_used)));
473 int ocfs2_reserve_new_metadata(struct ocfs2_super *osb,
474 struct ocfs2_dinode *fe,
475 struct ocfs2_alloc_context **ac)
480 *ac = kzalloc(sizeof(struct ocfs2_alloc_context), GFP_KERNEL);
487 (*ac)->ac_bits_wanted = ocfs2_extend_meta_needed(fe);
488 (*ac)->ac_which = OCFS2_AC_USE_META;
489 slot = osb->slot_num;
490 (*ac)->ac_group_search = ocfs2_block_group_search;
492 status = ocfs2_reserve_suballoc_bits(osb, (*ac),
493 EXTENT_ALLOC_SYSTEM_INODE, slot);
495 if (status != -ENOSPC)
502 if ((status < 0) && *ac) {
503 ocfs2_free_alloc_context(*ac);
511 int ocfs2_reserve_new_inode(struct ocfs2_super *osb,
512 struct ocfs2_alloc_context **ac)
516 *ac = kzalloc(sizeof(struct ocfs2_alloc_context), GFP_KERNEL);
523 (*ac)->ac_bits_wanted = 1;
524 (*ac)->ac_which = OCFS2_AC_USE_INODE;
526 (*ac)->ac_group_search = ocfs2_block_group_search;
528 status = ocfs2_reserve_suballoc_bits(osb, *ac,
529 INODE_ALLOC_SYSTEM_INODE,
532 if (status != -ENOSPC)
539 if ((status < 0) && *ac) {
540 ocfs2_free_alloc_context(*ac);
548 /* local alloc code has to do the same thing, so rather than do this
550 int ocfs2_reserve_cluster_bitmap_bits(struct ocfs2_super *osb,
551 struct ocfs2_alloc_context *ac)
555 ac->ac_which = OCFS2_AC_USE_MAIN;
556 ac->ac_group_search = ocfs2_cluster_group_search;
558 status = ocfs2_reserve_suballoc_bits(osb, ac,
559 GLOBAL_BITMAP_SYSTEM_INODE,
561 if (status < 0 && status != -ENOSPC) {
570 /* Callers don't need to care which bitmap (local alloc or main) to
571 * use so we figure it out for them, but unfortunately this clutters
573 int ocfs2_reserve_clusters(struct ocfs2_super *osb,
575 struct ocfs2_alloc_context **ac)
581 *ac = kzalloc(sizeof(struct ocfs2_alloc_context), GFP_KERNEL);
588 (*ac)->ac_bits_wanted = bits_wanted;
591 if (ocfs2_alloc_should_use_local(osb, bits_wanted)) {
592 status = ocfs2_reserve_local_alloc_bits(osb,
595 if ((status < 0) && (status != -ENOSPC)) {
598 } else if (status == -ENOSPC) {
599 /* reserve_local_bits will return enospc with
600 * the local alloc inode still locked, so we
601 * can change this safely here. */
602 mlog(0, "Disabling local alloc\n");
603 /* We set to OCFS2_LA_DISABLED so that umount
604 * can clean up what's left of the local
606 osb->local_alloc_state = OCFS2_LA_DISABLED;
610 if (status == -ENOSPC) {
611 status = ocfs2_reserve_cluster_bitmap_bits(osb, *ac);
613 if (status != -ENOSPC)
621 if ((status < 0) && *ac) {
622 ocfs2_free_alloc_context(*ac);
631 * More or less lifted from ext3. I'll leave their description below:
633 * "For ext3 allocations, we must not reuse any blocks which are
634 * allocated in the bitmap buffer's "last committed data" copy. This
635 * prevents deletes from freeing up the page for reuse until we have
636 * committed the delete transaction.
638 * If we didn't do this, then deleting something and reallocating it as
639 * data would allow the old block to be overwritten before the
640 * transaction committed (because we force data to disk before commit).
641 * This would lead to corruption if we crashed between overwriting the
642 * data and committing the delete.
644 * @@@ We may want to make this allocation behaviour conditional on
645 * data-writes at some point, and disable it for metadata allocations or
648 * Note: OCFS2 already does this differently for metadata vs data
649 * allocations, as those bitmaps are separate and undo access is never
650 * called on a metadata group descriptor.
652 static int ocfs2_test_bg_bit_allocatable(struct buffer_head *bg_bh,
655 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
657 if (ocfs2_test_bit(nr, (unsigned long *)bg->bg_bitmap))
659 if (!buffer_jbd(bg_bh) || !bh2jh(bg_bh)->b_committed_data)
662 bg = (struct ocfs2_group_desc *) bh2jh(bg_bh)->b_committed_data;
663 return !ocfs2_test_bit(nr, (unsigned long *)bg->bg_bitmap);
666 static int ocfs2_block_group_find_clear_bits(struct ocfs2_super *osb,
667 struct buffer_head *bg_bh,
668 unsigned int bits_wanted,
669 unsigned int total_bits,
674 u16 best_offset, best_size;
675 int offset, start, found, status = 0;
676 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
678 if (!OCFS2_IS_VALID_GROUP_DESC(bg)) {
679 OCFS2_RO_ON_INVALID_GROUP_DESC(osb->sb, bg);
683 found = start = best_offset = best_size = 0;
684 bitmap = bg->bg_bitmap;
686 while((offset = ocfs2_find_next_zero_bit(bitmap, total_bits, start)) != -1) {
687 if (offset == total_bits)
690 if (!ocfs2_test_bg_bit_allocatable(bg_bh, offset)) {
691 /* We found a zero, but we can't use it as it
692 * hasn't been put to disk yet! */
695 } else if (offset == start) {
696 /* we found a zero */
698 /* move start to the next bit to test */
701 /* got a zero after some ones */
705 if (found > best_size) {
707 best_offset = start - found;
709 /* we got everything we needed */
710 if (found == bits_wanted) {
711 /* mlog(0, "Found it all!\n"); */
716 /* XXX: I think the first clause is equivalent to the second
718 if (found == bits_wanted) {
719 *bit_off = start - found;
721 } else if (best_size) {
722 *bit_off = best_offset;
723 *bits_found = best_size;
726 /* No error log here -- see the comment above
727 * ocfs2_test_bg_bit_allocatable */
733 static inline int ocfs2_block_group_set_bits(handle_t *handle,
734 struct inode *alloc_inode,
735 struct ocfs2_group_desc *bg,
736 struct buffer_head *group_bh,
737 unsigned int bit_off,
738 unsigned int num_bits)
741 void *bitmap = bg->bg_bitmap;
742 int journal_type = OCFS2_JOURNAL_ACCESS_WRITE;
746 if (!OCFS2_IS_VALID_GROUP_DESC(bg)) {
747 OCFS2_RO_ON_INVALID_GROUP_DESC(alloc_inode->i_sb, bg);
751 BUG_ON(le16_to_cpu(bg->bg_free_bits_count) < num_bits);
753 mlog(0, "block_group_set_bits: off = %u, num = %u\n", bit_off,
756 if (ocfs2_is_cluster_bitmap(alloc_inode))
757 journal_type = OCFS2_JOURNAL_ACCESS_UNDO;
759 status = ocfs2_journal_access(handle,
768 le16_add_cpu(&bg->bg_free_bits_count, -num_bits);
771 ocfs2_set_bit(bit_off++, bitmap);
773 status = ocfs2_journal_dirty(handle,
785 /* find the one with the most empty bits */
786 static inline u16 ocfs2_find_victim_chain(struct ocfs2_chain_list *cl)
790 BUG_ON(!cl->cl_next_free_rec);
793 while (curr < le16_to_cpu(cl->cl_next_free_rec)) {
794 if (le32_to_cpu(cl->cl_recs[curr].c_free) >
795 le32_to_cpu(cl->cl_recs[best].c_free))
800 BUG_ON(best >= le16_to_cpu(cl->cl_next_free_rec));
804 static int ocfs2_relink_block_group(handle_t *handle,
805 struct inode *alloc_inode,
806 struct buffer_head *fe_bh,
807 struct buffer_head *bg_bh,
808 struct buffer_head *prev_bg_bh,
812 /* there is a really tiny chance the journal calls could fail,
813 * but we wouldn't want inconsistent blocks in *any* case. */
814 u64 fe_ptr, bg_ptr, prev_bg_ptr;
815 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) fe_bh->b_data;
816 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
817 struct ocfs2_group_desc *prev_bg = (struct ocfs2_group_desc *) prev_bg_bh->b_data;
819 if (!OCFS2_IS_VALID_DINODE(fe)) {
820 OCFS2_RO_ON_INVALID_DINODE(alloc_inode->i_sb, fe);
824 if (!OCFS2_IS_VALID_GROUP_DESC(bg)) {
825 OCFS2_RO_ON_INVALID_GROUP_DESC(alloc_inode->i_sb, bg);
829 if (!OCFS2_IS_VALID_GROUP_DESC(prev_bg)) {
830 OCFS2_RO_ON_INVALID_GROUP_DESC(alloc_inode->i_sb, prev_bg);
835 mlog(0, "Suballoc %llu, chain %u, move group %llu to top, prev = %llu\n",
836 (unsigned long long)le64_to_cpu(fe->i_blkno), chain,
837 (unsigned long long)le64_to_cpu(bg->bg_blkno),
838 (unsigned long long)le64_to_cpu(prev_bg->bg_blkno));
840 fe_ptr = le64_to_cpu(fe->id2.i_chain.cl_recs[chain].c_blkno);
841 bg_ptr = le64_to_cpu(bg->bg_next_group);
842 prev_bg_ptr = le64_to_cpu(prev_bg->bg_next_group);
844 status = ocfs2_journal_access(handle, alloc_inode, prev_bg_bh,
845 OCFS2_JOURNAL_ACCESS_WRITE);
851 prev_bg->bg_next_group = bg->bg_next_group;
853 status = ocfs2_journal_dirty(handle, prev_bg_bh);
859 status = ocfs2_journal_access(handle, alloc_inode, bg_bh,
860 OCFS2_JOURNAL_ACCESS_WRITE);
866 bg->bg_next_group = fe->id2.i_chain.cl_recs[chain].c_blkno;
868 status = ocfs2_journal_dirty(handle, bg_bh);
874 status = ocfs2_journal_access(handle, alloc_inode, fe_bh,
875 OCFS2_JOURNAL_ACCESS_WRITE);
881 fe->id2.i_chain.cl_recs[chain].c_blkno = bg->bg_blkno;
883 status = ocfs2_journal_dirty(handle, fe_bh);
892 fe->id2.i_chain.cl_recs[chain].c_blkno = cpu_to_le64(fe_ptr);
893 bg->bg_next_group = cpu_to_le64(bg_ptr);
894 prev_bg->bg_next_group = cpu_to_le64(prev_bg_ptr);
901 static inline int ocfs2_block_group_reasonably_empty(struct ocfs2_group_desc *bg,
904 return le16_to_cpu(bg->bg_free_bits_count) > wanted;
907 /* return 0 on success, -ENOSPC to keep searching and any other < 0
909 static int ocfs2_cluster_group_search(struct inode *inode,
910 struct buffer_head *group_bh,
911 u32 bits_wanted, u32 min_bits,
912 u16 *bit_off, u16 *bits_found)
914 int search = -ENOSPC;
916 struct ocfs2_group_desc *gd = (struct ocfs2_group_desc *) group_bh->b_data;
917 u16 tmp_off, tmp_found;
918 unsigned int max_bits, gd_cluster_off;
920 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
922 if (gd->bg_free_bits_count) {
923 max_bits = le16_to_cpu(gd->bg_bits);
925 /* Tail groups in cluster bitmaps which aren't cpg
926 * aligned are prone to partial extention by a failed
927 * fs resize. If the file system resize never got to
928 * update the dinode cluster count, then we don't want
929 * to trust any clusters past it, regardless of what
930 * the group descriptor says. */
931 gd_cluster_off = ocfs2_blocks_to_clusters(inode->i_sb,
932 le64_to_cpu(gd->bg_blkno));
933 if ((gd_cluster_off + max_bits) >
934 OCFS2_I(inode)->ip_clusters) {
935 max_bits = OCFS2_I(inode)->ip_clusters - gd_cluster_off;
936 mlog(0, "Desc %llu, bg_bits %u, clusters %u, use %u\n",
937 (unsigned long long)le64_to_cpu(gd->bg_blkno),
938 le16_to_cpu(gd->bg_bits),
939 OCFS2_I(inode)->ip_clusters, max_bits);
942 ret = ocfs2_block_group_find_clear_bits(OCFS2_SB(inode->i_sb),
943 group_bh, bits_wanted,
945 &tmp_off, &tmp_found);
949 /* ocfs2_block_group_find_clear_bits() might
950 * return success, but we still want to return
951 * -ENOSPC unless it found the minimum number
953 if (min_bits <= tmp_found) {
955 *bits_found = tmp_found;
956 search = 0; /* success */
963 static int ocfs2_block_group_search(struct inode *inode,
964 struct buffer_head *group_bh,
965 u32 bits_wanted, u32 min_bits,
966 u16 *bit_off, u16 *bits_found)
969 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) group_bh->b_data;
971 BUG_ON(min_bits != 1);
972 BUG_ON(ocfs2_is_cluster_bitmap(inode));
974 if (bg->bg_free_bits_count)
975 ret = ocfs2_block_group_find_clear_bits(OCFS2_SB(inode->i_sb),
976 group_bh, bits_wanted,
977 le16_to_cpu(bg->bg_bits),
978 bit_off, bits_found);
983 static int ocfs2_alloc_dinode_update_counts(struct inode *inode,
985 struct buffer_head *di_bh,
991 struct ocfs2_dinode *di = (struct ocfs2_dinode *) di_bh->b_data;
992 struct ocfs2_chain_list *cl = (struct ocfs2_chain_list *) &di->id2.i_chain;
994 ret = ocfs2_journal_access(handle, inode, di_bh,
995 OCFS2_JOURNAL_ACCESS_WRITE);
1001 tmp_used = le32_to_cpu(di->id1.bitmap1.i_used);
1002 di->id1.bitmap1.i_used = cpu_to_le32(num_bits + tmp_used);
1003 le32_add_cpu(&cl->cl_recs[chain].c_free, -num_bits);
1005 ret = ocfs2_journal_dirty(handle, di_bh);
1013 static int ocfs2_search_one_group(struct ocfs2_alloc_context *ac,
1018 unsigned int *num_bits,
1024 struct buffer_head *group_bh = NULL;
1025 struct ocfs2_group_desc *gd;
1026 struct inode *alloc_inode = ac->ac_inode;
1028 ret = ocfs2_read_block(OCFS2_SB(alloc_inode->i_sb), gd_blkno,
1029 &group_bh, OCFS2_BH_CACHED, alloc_inode);
1035 gd = (struct ocfs2_group_desc *) group_bh->b_data;
1036 if (!OCFS2_IS_VALID_GROUP_DESC(gd)) {
1037 OCFS2_RO_ON_INVALID_GROUP_DESC(alloc_inode->i_sb, gd);
1042 ret = ac->ac_group_search(alloc_inode, group_bh, bits_wanted, min_bits,
1052 ret = ocfs2_alloc_dinode_update_counts(alloc_inode, handle, ac->ac_bh,
1054 le16_to_cpu(gd->bg_chain));
1060 ret = ocfs2_block_group_set_bits(handle, alloc_inode, gd, group_bh,
1061 *bit_off, *num_bits);
1065 *bits_left = le16_to_cpu(gd->bg_free_bits_count);
1073 static int ocfs2_search_chain(struct ocfs2_alloc_context *ac,
1078 unsigned int *num_bits,
1083 u16 chain, tmp_bits;
1086 struct inode *alloc_inode = ac->ac_inode;
1087 struct buffer_head *group_bh = NULL;
1088 struct buffer_head *prev_group_bh = NULL;
1089 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) ac->ac_bh->b_data;
1090 struct ocfs2_chain_list *cl = (struct ocfs2_chain_list *) &fe->id2.i_chain;
1091 struct ocfs2_group_desc *bg;
1093 chain = ac->ac_chain;
1094 mlog(0, "trying to alloc %u bits from chain %u, inode %llu\n",
1096 (unsigned long long)OCFS2_I(alloc_inode)->ip_blkno);
1098 status = ocfs2_read_block(OCFS2_SB(alloc_inode->i_sb),
1099 le64_to_cpu(cl->cl_recs[chain].c_blkno),
1100 &group_bh, OCFS2_BH_CACHED, alloc_inode);
1105 bg = (struct ocfs2_group_desc *) group_bh->b_data;
1106 status = ocfs2_check_group_descriptor(alloc_inode->i_sb, fe, bg);
1113 /* for now, the chain search is a bit simplistic. We just use
1114 * the 1st group with any empty bits. */
1115 while ((status = ac->ac_group_search(alloc_inode, group_bh,
1116 bits_wanted, min_bits, bit_off,
1117 &tmp_bits)) == -ENOSPC) {
1118 if (!bg->bg_next_group)
1121 if (prev_group_bh) {
1122 brelse(prev_group_bh);
1123 prev_group_bh = NULL;
1125 next_group = le64_to_cpu(bg->bg_next_group);
1126 prev_group_bh = group_bh;
1128 status = ocfs2_read_block(OCFS2_SB(alloc_inode->i_sb),
1129 next_group, &group_bh,
1130 OCFS2_BH_CACHED, alloc_inode);
1135 bg = (struct ocfs2_group_desc *) group_bh->b_data;
1136 status = ocfs2_check_group_descriptor(alloc_inode->i_sb, fe, bg);
1143 if (status != -ENOSPC)
1148 mlog(0, "alloc succeeds: we give %u bits from block group %llu\n",
1149 tmp_bits, (unsigned long long)le64_to_cpu(bg->bg_blkno));
1151 *num_bits = tmp_bits;
1153 BUG_ON(*num_bits == 0);
1156 * Keep track of previous block descriptor read. When
1157 * we find a target, if we have read more than X
1158 * number of descriptors, and the target is reasonably
1159 * empty, relink him to top of his chain.
1161 * We've read 0 extra blocks and only send one more to
1162 * the transaction, yet the next guy to search has a
1165 * Do this *after* figuring out how many bits we're taking out
1166 * of our target group.
1168 if (ac->ac_allow_chain_relink &&
1170 (ocfs2_block_group_reasonably_empty(bg, *num_bits))) {
1171 status = ocfs2_relink_block_group(handle, alloc_inode,
1172 ac->ac_bh, group_bh,
1173 prev_group_bh, chain);
1180 /* Ok, claim our bits now: set the info on dinode, chainlist
1181 * and then the group */
1182 status = ocfs2_journal_access(handle,
1185 OCFS2_JOURNAL_ACCESS_WRITE);
1191 tmp_used = le32_to_cpu(fe->id1.bitmap1.i_used);
1192 fe->id1.bitmap1.i_used = cpu_to_le32(*num_bits + tmp_used);
1193 le32_add_cpu(&cl->cl_recs[chain].c_free, -(*num_bits));
1195 status = ocfs2_journal_dirty(handle,
1202 status = ocfs2_block_group_set_bits(handle,
1213 mlog(0, "Allocated %u bits from suballocator %llu\n", *num_bits,
1214 (unsigned long long)le64_to_cpu(fe->i_blkno));
1216 *bg_blkno = le64_to_cpu(bg->bg_blkno);
1217 *bits_left = le16_to_cpu(bg->bg_free_bits_count);
1222 brelse(prev_group_bh);
1228 /* will give out up to bits_wanted contiguous bits. */
1229 static int ocfs2_claim_suballoc_bits(struct ocfs2_super *osb,
1230 struct ocfs2_alloc_context *ac,
1235 unsigned int *num_bits,
1241 u64 hint_blkno = ac->ac_last_group;
1242 struct ocfs2_chain_list *cl;
1243 struct ocfs2_dinode *fe;
1247 BUG_ON(ac->ac_bits_given >= ac->ac_bits_wanted);
1248 BUG_ON(bits_wanted > (ac->ac_bits_wanted - ac->ac_bits_given));
1251 fe = (struct ocfs2_dinode *) ac->ac_bh->b_data;
1252 if (!OCFS2_IS_VALID_DINODE(fe)) {
1253 OCFS2_RO_ON_INVALID_DINODE(osb->sb, fe);
1257 if (le32_to_cpu(fe->id1.bitmap1.i_used) >=
1258 le32_to_cpu(fe->id1.bitmap1.i_total)) {
1259 ocfs2_error(osb->sb, "Chain allocator dinode %llu has %u used "
1260 "bits but only %u total.",
1261 (unsigned long long)le64_to_cpu(fe->i_blkno),
1262 le32_to_cpu(fe->id1.bitmap1.i_used),
1263 le32_to_cpu(fe->id1.bitmap1.i_total));
1269 /* Attempt to short-circuit the usual search mechanism
1270 * by jumping straight to the most recently used
1271 * allocation group. This helps us mantain some
1272 * contiguousness across allocations. */
1273 status = ocfs2_search_one_group(ac, handle, bits_wanted,
1274 min_bits, bit_off, num_bits,
1275 hint_blkno, &bits_left);
1277 /* Be careful to update *bg_blkno here as the
1278 * caller is expecting it to be filled in, and
1279 * ocfs2_search_one_group() won't do that for
1281 *bg_blkno = hint_blkno;
1284 if (status < 0 && status != -ENOSPC) {
1290 cl = (struct ocfs2_chain_list *) &fe->id2.i_chain;
1292 victim = ocfs2_find_victim_chain(cl);
1293 ac->ac_chain = victim;
1294 ac->ac_allow_chain_relink = 1;
1296 status = ocfs2_search_chain(ac, handle, bits_wanted, min_bits, bit_off,
1297 num_bits, bg_blkno, &bits_left);
1300 if (status < 0 && status != -ENOSPC) {
1305 mlog(0, "Search of victim chain %u came up with nothing, "
1306 "trying all chains now.\n", victim);
1308 /* If we didn't pick a good victim, then just default to
1309 * searching each chain in order. Don't allow chain relinking
1310 * because we only calculate enough journal credits for one
1311 * relink per alloc. */
1312 ac->ac_allow_chain_relink = 0;
1313 for (i = 0; i < le16_to_cpu(cl->cl_next_free_rec); i ++) {
1316 if (!cl->cl_recs[i].c_free)
1320 status = ocfs2_search_chain(ac, handle, bits_wanted, min_bits,
1321 bit_off, num_bits, bg_blkno,
1325 if (status < 0 && status != -ENOSPC) {
1332 if (status != -ENOSPC) {
1333 /* If the next search of this group is not likely to
1334 * yield a suitable extent, then we reset the last
1335 * group hint so as to not waste a disk read */
1336 if (bits_left < min_bits)
1337 ac->ac_last_group = 0;
1339 ac->ac_last_group = *bg_blkno;
1347 int ocfs2_claim_metadata(struct ocfs2_super *osb,
1349 struct ocfs2_alloc_context *ac,
1351 u16 *suballoc_bit_start,
1352 unsigned int *num_bits,
1359 BUG_ON(ac->ac_bits_wanted < (ac->ac_bits_given + bits_wanted));
1360 BUG_ON(ac->ac_which != OCFS2_AC_USE_META);
1362 status = ocfs2_claim_suballoc_bits(osb,
1374 atomic_inc(&osb->alloc_stats.bg_allocs);
1376 *blkno_start = bg_blkno + (u64) *suballoc_bit_start;
1377 ac->ac_bits_given += (*num_bits);
1384 int ocfs2_claim_new_inode(struct ocfs2_super *osb,
1386 struct ocfs2_alloc_context *ac,
1391 unsigned int num_bits;
1397 BUG_ON(ac->ac_bits_given != 0);
1398 BUG_ON(ac->ac_bits_wanted != 1);
1399 BUG_ON(ac->ac_which != OCFS2_AC_USE_INODE);
1401 status = ocfs2_claim_suballoc_bits(osb,
1413 atomic_inc(&osb->alloc_stats.bg_allocs);
1415 BUG_ON(num_bits != 1);
1417 *fe_blkno = bg_blkno + (u64) (*suballoc_bit);
1418 ac->ac_bits_given++;
1425 /* translate a group desc. blkno and it's bitmap offset into
1426 * disk cluster offset. */
1427 static inline u32 ocfs2_desc_bitmap_to_cluster_off(struct inode *inode,
1431 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
1434 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
1436 if (bg_blkno != osb->first_cluster_group_blkno)
1437 cluster = ocfs2_blocks_to_clusters(inode->i_sb, bg_blkno);
1438 cluster += (u32) bg_bit_off;
1442 /* given a cluster offset, calculate which block group it belongs to
1443 * and return that block offset. */
1444 u64 ocfs2_which_cluster_group(struct inode *inode, u32 cluster)
1446 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
1449 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
1451 group_no = cluster / osb->bitmap_cpg;
1453 return osb->first_cluster_group_blkno;
1454 return ocfs2_clusters_to_blocks(inode->i_sb,
1455 group_no * osb->bitmap_cpg);
1458 /* given the block number of a cluster start, calculate which cluster
1459 * group and descriptor bitmap offset that corresponds to. */
1460 static inline void ocfs2_block_to_cluster_group(struct inode *inode,
1465 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
1466 u32 data_cluster = ocfs2_blocks_to_clusters(osb->sb, data_blkno);
1468 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
1470 *bg_blkno = ocfs2_which_cluster_group(inode,
1473 if (*bg_blkno == osb->first_cluster_group_blkno)
1474 *bg_bit_off = (u16) data_cluster;
1476 *bg_bit_off = (u16) ocfs2_blocks_to_clusters(osb->sb,
1477 data_blkno - *bg_blkno);
1481 * min_bits - minimum contiguous chunk from this total allocation we
1482 * can handle. set to what we asked for originally for a full
1483 * contig. allocation, set to '1' to indicate we can deal with extents
1486 int __ocfs2_claim_clusters(struct ocfs2_super *osb,
1488 struct ocfs2_alloc_context *ac,
1495 unsigned int bits_wanted = max_clusters;
1501 BUG_ON(ac->ac_bits_given >= ac->ac_bits_wanted);
1503 BUG_ON(ac->ac_which != OCFS2_AC_USE_LOCAL
1504 && ac->ac_which != OCFS2_AC_USE_MAIN);
1506 if (ac->ac_which == OCFS2_AC_USE_LOCAL) {
1507 status = ocfs2_claim_local_alloc_bits(osb,
1514 atomic_inc(&osb->alloc_stats.local_data);
1516 if (min_clusters > (osb->bitmap_cpg - 1)) {
1517 /* The only paths asking for contiguousness
1518 * should know about this already. */
1519 mlog(ML_ERROR, "minimum allocation requested %u exceeds "
1520 "group bitmap size %u!\n", min_clusters,
1525 /* clamp the current request down to a realistic size. */
1526 if (bits_wanted > (osb->bitmap_cpg - 1))
1527 bits_wanted = osb->bitmap_cpg - 1;
1529 status = ocfs2_claim_suballoc_bits(osb,
1539 ocfs2_desc_bitmap_to_cluster_off(ac->ac_inode,
1542 atomic_inc(&osb->alloc_stats.bitmap_data);
1546 if (status != -ENOSPC)
1551 ac->ac_bits_given += *num_clusters;
1558 int ocfs2_claim_clusters(struct ocfs2_super *osb,
1560 struct ocfs2_alloc_context *ac,
1565 unsigned int bits_wanted = ac->ac_bits_wanted - ac->ac_bits_given;
1567 return __ocfs2_claim_clusters(osb, handle, ac, min_clusters,
1568 bits_wanted, cluster_start, num_clusters);
1571 static inline int ocfs2_block_group_clear_bits(handle_t *handle,
1572 struct inode *alloc_inode,
1573 struct ocfs2_group_desc *bg,
1574 struct buffer_head *group_bh,
1575 unsigned int bit_off,
1576 unsigned int num_bits)
1580 int journal_type = OCFS2_JOURNAL_ACCESS_WRITE;
1581 struct ocfs2_group_desc *undo_bg = NULL;
1585 if (!OCFS2_IS_VALID_GROUP_DESC(bg)) {
1586 OCFS2_RO_ON_INVALID_GROUP_DESC(alloc_inode->i_sb, bg);
1591 mlog(0, "off = %u, num = %u\n", bit_off, num_bits);
1593 if (ocfs2_is_cluster_bitmap(alloc_inode))
1594 journal_type = OCFS2_JOURNAL_ACCESS_UNDO;
1596 status = ocfs2_journal_access(handle, alloc_inode, group_bh,
1603 if (ocfs2_is_cluster_bitmap(alloc_inode))
1604 undo_bg = (struct ocfs2_group_desc *) bh2jh(group_bh)->b_committed_data;
1608 ocfs2_clear_bit((bit_off + tmp),
1609 (unsigned long *) bg->bg_bitmap);
1610 if (ocfs2_is_cluster_bitmap(alloc_inode))
1611 ocfs2_set_bit(bit_off + tmp,
1612 (unsigned long *) undo_bg->bg_bitmap);
1614 le16_add_cpu(&bg->bg_free_bits_count, num_bits);
1616 status = ocfs2_journal_dirty(handle, group_bh);
1624 * expects the suballoc inode to already be locked.
1626 int ocfs2_free_suballoc_bits(handle_t *handle,
1627 struct inode *alloc_inode,
1628 struct buffer_head *alloc_bh,
1629 unsigned int start_bit,
1635 struct ocfs2_super *osb = OCFS2_SB(alloc_inode->i_sb);
1636 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) alloc_bh->b_data;
1637 struct ocfs2_chain_list *cl = &fe->id2.i_chain;
1638 struct buffer_head *group_bh = NULL;
1639 struct ocfs2_group_desc *group;
1643 if (!OCFS2_IS_VALID_DINODE(fe)) {
1644 OCFS2_RO_ON_INVALID_DINODE(alloc_inode->i_sb, fe);
1648 BUG_ON((count + start_bit) > ocfs2_bits_per_group(cl));
1650 mlog(0, "%llu: freeing %u bits from group %llu, starting at %u\n",
1651 (unsigned long long)OCFS2_I(alloc_inode)->ip_blkno, count,
1652 (unsigned long long)bg_blkno, start_bit);
1654 status = ocfs2_read_block(osb, bg_blkno, &group_bh, OCFS2_BH_CACHED,
1661 group = (struct ocfs2_group_desc *) group_bh->b_data;
1662 status = ocfs2_check_group_descriptor(alloc_inode->i_sb, fe, group);
1667 BUG_ON((count + start_bit) > le16_to_cpu(group->bg_bits));
1669 status = ocfs2_block_group_clear_bits(handle, alloc_inode,
1677 status = ocfs2_journal_access(handle, alloc_inode, alloc_bh,
1678 OCFS2_JOURNAL_ACCESS_WRITE);
1684 le32_add_cpu(&cl->cl_recs[le16_to_cpu(group->bg_chain)].c_free,
1686 tmp_used = le32_to_cpu(fe->id1.bitmap1.i_used);
1687 fe->id1.bitmap1.i_used = cpu_to_le32(tmp_used - count);
1689 status = ocfs2_journal_dirty(handle, alloc_bh);
1703 int ocfs2_free_dinode(handle_t *handle,
1704 struct inode *inode_alloc_inode,
1705 struct buffer_head *inode_alloc_bh,
1706 struct ocfs2_dinode *di)
1708 u64 blk = le64_to_cpu(di->i_blkno);
1709 u16 bit = le16_to_cpu(di->i_suballoc_bit);
1710 u64 bg_blkno = ocfs2_which_suballoc_group(blk, bit);
1712 return ocfs2_free_suballoc_bits(handle, inode_alloc_inode,
1713 inode_alloc_bh, bit, bg_blkno, 1);
1716 int ocfs2_free_clusters(handle_t *handle,
1717 struct inode *bitmap_inode,
1718 struct buffer_head *bitmap_bh,
1720 unsigned int num_clusters)
1725 struct ocfs2_dinode *fe;
1727 /* You can't ever have a contiguous set of clusters
1728 * bigger than a block group bitmap so we never have to worry
1729 * about looping on them. */
1733 /* This is expensive. We can safely remove once this stuff has
1734 * gotten tested really well. */
1735 BUG_ON(start_blk != ocfs2_clusters_to_blocks(bitmap_inode->i_sb, ocfs2_blocks_to_clusters(bitmap_inode->i_sb, start_blk)));
1737 fe = (struct ocfs2_dinode *) bitmap_bh->b_data;
1739 ocfs2_block_to_cluster_group(bitmap_inode, start_blk, &bg_blkno,
1742 mlog(0, "want to free %u clusters starting at block %llu\n",
1743 num_clusters, (unsigned long long)start_blk);
1744 mlog(0, "bg_blkno = %llu, bg_start_bit = %u\n",
1745 (unsigned long long)bg_blkno, bg_start_bit);
1747 status = ocfs2_free_suballoc_bits(handle, bitmap_inode, bitmap_bh,
1748 bg_start_bit, bg_blkno,
1757 static inline void ocfs2_debug_bg(struct ocfs2_group_desc *bg)
1759 printk("Block Group:\n");
1760 printk("bg_signature: %s\n", bg->bg_signature);
1761 printk("bg_size: %u\n", bg->bg_size);
1762 printk("bg_bits: %u\n", bg->bg_bits);
1763 printk("bg_free_bits_count: %u\n", bg->bg_free_bits_count);
1764 printk("bg_chain: %u\n", bg->bg_chain);
1765 printk("bg_generation: %u\n", le32_to_cpu(bg->bg_generation));
1766 printk("bg_next_group: %llu\n",
1767 (unsigned long long)bg->bg_next_group);
1768 printk("bg_parent_dinode: %llu\n",
1769 (unsigned long long)bg->bg_parent_dinode);
1770 printk("bg_blkno: %llu\n",
1771 (unsigned long long)bg->bg_blkno);
1774 static inline void ocfs2_debug_suballoc_inode(struct ocfs2_dinode *fe)
1778 printk("Suballoc Inode %llu:\n", (unsigned long long)fe->i_blkno);
1779 printk("i_signature: %s\n", fe->i_signature);
1780 printk("i_size: %llu\n",
1781 (unsigned long long)fe->i_size);
1782 printk("i_clusters: %u\n", fe->i_clusters);
1783 printk("i_generation: %u\n",
1784 le32_to_cpu(fe->i_generation));
1785 printk("id1.bitmap1.i_used: %u\n",
1786 le32_to_cpu(fe->id1.bitmap1.i_used));
1787 printk("id1.bitmap1.i_total: %u\n",
1788 le32_to_cpu(fe->id1.bitmap1.i_total));
1789 printk("id2.i_chain.cl_cpg: %u\n", fe->id2.i_chain.cl_cpg);
1790 printk("id2.i_chain.cl_bpc: %u\n", fe->id2.i_chain.cl_bpc);
1791 printk("id2.i_chain.cl_count: %u\n", fe->id2.i_chain.cl_count);
1792 printk("id2.i_chain.cl_next_free_rec: %u\n",
1793 fe->id2.i_chain.cl_next_free_rec);
1794 for(i = 0; i < fe->id2.i_chain.cl_next_free_rec; i++) {
1795 printk("fe->id2.i_chain.cl_recs[%d].c_free: %u\n", i,
1796 fe->id2.i_chain.cl_recs[i].c_free);
1797 printk("fe->id2.i_chain.cl_recs[%d].c_total: %u\n", i,
1798 fe->id2.i_chain.cl_recs[i].c_total);
1799 printk("fe->id2.i_chain.cl_recs[%d].c_blkno: %llu\n", i,
1800 (unsigned long long)fe->id2.i_chain.cl_recs[i].c_blkno);