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 u64 ocfs2_which_cluster_group(struct inode *inode,
106 static inline void ocfs2_block_to_cluster_group(struct inode *inode,
111 void ocfs2_free_alloc_context(struct ocfs2_alloc_context *ac)
113 struct inode *inode = ac->ac_inode;
116 if (ac->ac_which != OCFS2_AC_USE_LOCAL)
117 ocfs2_meta_unlock(inode, 1);
119 mutex_unlock(&inode->i_mutex);
128 static u32 ocfs2_bits_per_group(struct ocfs2_chain_list *cl)
130 return (u32)le16_to_cpu(cl->cl_cpg) * (u32)le16_to_cpu(cl->cl_bpc);
133 /* somewhat more expensive than our other checks, so use sparingly. */
134 static int ocfs2_check_group_descriptor(struct super_block *sb,
135 struct ocfs2_dinode *di,
136 struct ocfs2_group_desc *gd)
138 unsigned int max_bits;
140 if (!OCFS2_IS_VALID_GROUP_DESC(gd)) {
141 OCFS2_RO_ON_INVALID_GROUP_DESC(sb, gd);
145 if (di->i_blkno != gd->bg_parent_dinode) {
146 ocfs2_error(sb, "Group descriptor # %llu has bad parent "
147 "pointer (%llu, expected %llu)",
148 (unsigned long long)le64_to_cpu(gd->bg_blkno),
149 (unsigned long long)le64_to_cpu(gd->bg_parent_dinode),
150 (unsigned long long)le64_to_cpu(di->i_blkno));
154 max_bits = le16_to_cpu(di->id2.i_chain.cl_cpg) * le16_to_cpu(di->id2.i_chain.cl_bpc);
155 if (le16_to_cpu(gd->bg_bits) > max_bits) {
156 ocfs2_error(sb, "Group descriptor # %llu has bit count of %u",
157 (unsigned long long)le64_to_cpu(gd->bg_blkno),
158 le16_to_cpu(gd->bg_bits));
162 if (le16_to_cpu(gd->bg_chain) >=
163 le16_to_cpu(di->id2.i_chain.cl_next_free_rec)) {
164 ocfs2_error(sb, "Group descriptor # %llu has bad chain %u",
165 (unsigned long long)le64_to_cpu(gd->bg_blkno),
166 le16_to_cpu(gd->bg_chain));
170 if (le16_to_cpu(gd->bg_free_bits_count) > le16_to_cpu(gd->bg_bits)) {
171 ocfs2_error(sb, "Group descriptor # %llu has bit count %u but "
172 "claims that %u are free",
173 (unsigned long long)le64_to_cpu(gd->bg_blkno),
174 le16_to_cpu(gd->bg_bits),
175 le16_to_cpu(gd->bg_free_bits_count));
179 if (le16_to_cpu(gd->bg_bits) > (8 * le16_to_cpu(gd->bg_size))) {
180 ocfs2_error(sb, "Group descriptor # %llu has bit count %u but "
181 "max bitmap bits of %u",
182 (unsigned long long)le64_to_cpu(gd->bg_blkno),
183 le16_to_cpu(gd->bg_bits),
184 8 * le16_to_cpu(gd->bg_size));
191 static int ocfs2_block_group_fill(handle_t *handle,
192 struct inode *alloc_inode,
193 struct buffer_head *bg_bh,
196 struct ocfs2_chain_list *cl)
199 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
200 struct super_block * sb = alloc_inode->i_sb;
204 if (((unsigned long long) bg_bh->b_blocknr) != group_blkno) {
205 ocfs2_error(alloc_inode->i_sb, "group block (%llu) != "
207 (unsigned long long)group_blkno,
208 (unsigned long long) bg_bh->b_blocknr);
213 status = ocfs2_journal_access(handle,
216 OCFS2_JOURNAL_ACCESS_CREATE);
222 memset(bg, 0, sb->s_blocksize);
223 strcpy(bg->bg_signature, OCFS2_GROUP_DESC_SIGNATURE);
224 bg->bg_generation = cpu_to_le32(OCFS2_SB(sb)->fs_generation);
225 bg->bg_size = cpu_to_le16(ocfs2_group_bitmap_size(sb));
226 bg->bg_bits = cpu_to_le16(ocfs2_bits_per_group(cl));
227 bg->bg_chain = cpu_to_le16(my_chain);
228 bg->bg_next_group = cl->cl_recs[my_chain].c_blkno;
229 bg->bg_parent_dinode = cpu_to_le64(OCFS2_I(alloc_inode)->ip_blkno);
230 bg->bg_blkno = cpu_to_le64(group_blkno);
231 /* set the 1st bit in the bitmap to account for the descriptor block */
232 ocfs2_set_bit(0, (unsigned long *)bg->bg_bitmap);
233 bg->bg_free_bits_count = cpu_to_le16(le16_to_cpu(bg->bg_bits) - 1);
235 status = ocfs2_journal_dirty(handle, bg_bh);
239 /* There is no need to zero out or otherwise initialize the
240 * other blocks in a group - All valid FS metadata in a block
241 * group stores the superblock fs_generation value at
242 * allocation time. */
249 static inline u16 ocfs2_find_smallest_chain(struct ocfs2_chain_list *cl)
254 while (curr < le16_to_cpu(cl->cl_count)) {
255 if (le32_to_cpu(cl->cl_recs[best].c_total) >
256 le32_to_cpu(cl->cl_recs[curr].c_total))
264 * We expect the block group allocator to already be locked.
266 static int ocfs2_block_group_alloc(struct ocfs2_super *osb,
267 struct inode *alloc_inode,
268 struct buffer_head *bh)
271 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) bh->b_data;
272 struct ocfs2_chain_list *cl;
273 struct ocfs2_alloc_context *ac = NULL;
274 handle_t *handle = NULL;
275 u32 bit_off, num_bits;
278 struct buffer_head *bg_bh = NULL;
279 struct ocfs2_group_desc *bg;
281 BUG_ON(ocfs2_is_cluster_bitmap(alloc_inode));
285 cl = &fe->id2.i_chain;
286 status = ocfs2_reserve_clusters(osb,
287 le16_to_cpu(cl->cl_cpg),
290 if (status != -ENOSPC)
295 credits = ocfs2_calc_group_alloc_credits(osb->sb,
296 le16_to_cpu(cl->cl_cpg));
297 handle = ocfs2_start_trans(osb, credits);
298 if (IS_ERR(handle)) {
299 status = PTR_ERR(handle);
305 status = ocfs2_claim_clusters(osb,
308 le16_to_cpu(cl->cl_cpg),
312 if (status != -ENOSPC)
317 alloc_rec = ocfs2_find_smallest_chain(cl);
319 /* setup the group */
320 bg_blkno = ocfs2_clusters_to_blocks(osb->sb, bit_off);
321 mlog(0, "new descriptor, record %u, at block %llu\n",
322 alloc_rec, (unsigned long long)bg_blkno);
324 bg_bh = sb_getblk(osb->sb, bg_blkno);
330 ocfs2_set_new_buffer_uptodate(alloc_inode, bg_bh);
332 status = ocfs2_block_group_fill(handle,
343 bg = (struct ocfs2_group_desc *) bg_bh->b_data;
345 status = ocfs2_journal_access(handle, alloc_inode,
346 bh, OCFS2_JOURNAL_ACCESS_WRITE);
352 le32_add_cpu(&cl->cl_recs[alloc_rec].c_free,
353 le16_to_cpu(bg->bg_free_bits_count));
354 le32_add_cpu(&cl->cl_recs[alloc_rec].c_total, le16_to_cpu(bg->bg_bits));
355 cl->cl_recs[alloc_rec].c_blkno = cpu_to_le64(bg_blkno);
356 if (le16_to_cpu(cl->cl_next_free_rec) < le16_to_cpu(cl->cl_count))
357 le16_add_cpu(&cl->cl_next_free_rec, 1);
359 le32_add_cpu(&fe->id1.bitmap1.i_used, le16_to_cpu(bg->bg_bits) -
360 le16_to_cpu(bg->bg_free_bits_count));
361 le32_add_cpu(&fe->id1.bitmap1.i_total, le16_to_cpu(bg->bg_bits));
362 le32_add_cpu(&fe->i_clusters, le16_to_cpu(cl->cl_cpg));
364 status = ocfs2_journal_dirty(handle, bh);
370 spin_lock(&OCFS2_I(alloc_inode)->ip_lock);
371 OCFS2_I(alloc_inode)->ip_clusters = le32_to_cpu(fe->i_clusters);
372 fe->i_size = cpu_to_le64(ocfs2_clusters_to_bytes(alloc_inode->i_sb,
373 le32_to_cpu(fe->i_clusters)));
374 spin_unlock(&OCFS2_I(alloc_inode)->ip_lock);
375 i_size_write(alloc_inode, le64_to_cpu(fe->i_size));
376 alloc_inode->i_blocks = ocfs2_inode_sector_count(alloc_inode);
381 ocfs2_commit_trans(osb, handle);
384 ocfs2_free_alloc_context(ac);
393 static int ocfs2_reserve_suballoc_bits(struct ocfs2_super *osb,
394 struct ocfs2_alloc_context *ac,
399 u32 bits_wanted = ac->ac_bits_wanted;
400 struct inode *alloc_inode;
401 struct buffer_head *bh = NULL;
402 struct ocfs2_dinode *fe;
407 alloc_inode = ocfs2_get_system_file_inode(osb, type, slot);
413 mutex_lock(&alloc_inode->i_mutex);
415 status = ocfs2_meta_lock(alloc_inode, &bh, 1);
417 mutex_unlock(&alloc_inode->i_mutex);
424 ac->ac_inode = alloc_inode;
426 fe = (struct ocfs2_dinode *) bh->b_data;
427 if (!OCFS2_IS_VALID_DINODE(fe)) {
428 OCFS2_RO_ON_INVALID_DINODE(alloc_inode->i_sb, fe);
432 if (!(fe->i_flags & cpu_to_le32(OCFS2_CHAIN_FL))) {
433 ocfs2_error(alloc_inode->i_sb, "Invalid chain allocator %llu",
434 (unsigned long long)le64_to_cpu(fe->i_blkno));
439 free_bits = le32_to_cpu(fe->id1.bitmap1.i_total) -
440 le32_to_cpu(fe->id1.bitmap1.i_used);
442 if (bits_wanted > free_bits) {
443 /* cluster bitmap never grows */
444 if (ocfs2_is_cluster_bitmap(alloc_inode)) {
445 mlog(0, "Disk Full: wanted=%u, free_bits=%u\n",
446 bits_wanted, free_bits);
451 status = ocfs2_block_group_alloc(osb, alloc_inode, bh);
453 if (status != -ENOSPC)
457 atomic_inc(&osb->alloc_stats.bg_extends);
459 /* You should never ask for this much metadata */
461 (le32_to_cpu(fe->id1.bitmap1.i_total)
462 - le32_to_cpu(fe->id1.bitmap1.i_used)));
475 int ocfs2_reserve_new_metadata(struct ocfs2_super *osb,
476 struct ocfs2_dinode *fe,
477 struct ocfs2_alloc_context **ac)
482 *ac = kzalloc(sizeof(struct ocfs2_alloc_context), GFP_KERNEL);
489 (*ac)->ac_bits_wanted = ocfs2_extend_meta_needed(fe);
490 (*ac)->ac_which = OCFS2_AC_USE_META;
491 slot = osb->slot_num;
492 (*ac)->ac_group_search = ocfs2_block_group_search;
494 status = ocfs2_reserve_suballoc_bits(osb, (*ac),
495 EXTENT_ALLOC_SYSTEM_INODE, slot);
497 if (status != -ENOSPC)
504 if ((status < 0) && *ac) {
505 ocfs2_free_alloc_context(*ac);
513 int ocfs2_reserve_new_inode(struct ocfs2_super *osb,
514 struct ocfs2_alloc_context **ac)
518 *ac = kzalloc(sizeof(struct ocfs2_alloc_context), GFP_KERNEL);
525 (*ac)->ac_bits_wanted = 1;
526 (*ac)->ac_which = OCFS2_AC_USE_INODE;
528 (*ac)->ac_group_search = ocfs2_block_group_search;
530 status = ocfs2_reserve_suballoc_bits(osb, *ac,
531 INODE_ALLOC_SYSTEM_INODE,
534 if (status != -ENOSPC)
541 if ((status < 0) && *ac) {
542 ocfs2_free_alloc_context(*ac);
550 /* local alloc code has to do the same thing, so rather than do this
552 int ocfs2_reserve_cluster_bitmap_bits(struct ocfs2_super *osb,
553 struct ocfs2_alloc_context *ac)
557 ac->ac_which = OCFS2_AC_USE_MAIN;
558 ac->ac_group_search = ocfs2_cluster_group_search;
560 status = ocfs2_reserve_suballoc_bits(osb, ac,
561 GLOBAL_BITMAP_SYSTEM_INODE,
563 if (status < 0 && status != -ENOSPC) {
572 /* Callers don't need to care which bitmap (local alloc or main) to
573 * use so we figure it out for them, but unfortunately this clutters
575 int ocfs2_reserve_clusters(struct ocfs2_super *osb,
577 struct ocfs2_alloc_context **ac)
583 *ac = kzalloc(sizeof(struct ocfs2_alloc_context), GFP_KERNEL);
590 (*ac)->ac_bits_wanted = bits_wanted;
593 if (ocfs2_alloc_should_use_local(osb, bits_wanted)) {
594 status = ocfs2_reserve_local_alloc_bits(osb,
597 if ((status < 0) && (status != -ENOSPC)) {
600 } else if (status == -ENOSPC) {
601 /* reserve_local_bits will return enospc with
602 * the local alloc inode still locked, so we
603 * can change this safely here. */
604 mlog(0, "Disabling local alloc\n");
605 /* We set to OCFS2_LA_DISABLED so that umount
606 * can clean up what's left of the local
608 osb->local_alloc_state = OCFS2_LA_DISABLED;
612 if (status == -ENOSPC) {
613 status = ocfs2_reserve_cluster_bitmap_bits(osb, *ac);
615 if (status != -ENOSPC)
623 if ((status < 0) && *ac) {
624 ocfs2_free_alloc_context(*ac);
633 * More or less lifted from ext3. I'll leave their description below:
635 * "For ext3 allocations, we must not reuse any blocks which are
636 * allocated in the bitmap buffer's "last committed data" copy. This
637 * prevents deletes from freeing up the page for reuse until we have
638 * committed the delete transaction.
640 * If we didn't do this, then deleting something and reallocating it as
641 * data would allow the old block to be overwritten before the
642 * transaction committed (because we force data to disk before commit).
643 * This would lead to corruption if we crashed between overwriting the
644 * data and committing the delete.
646 * @@@ We may want to make this allocation behaviour conditional on
647 * data-writes at some point, and disable it for metadata allocations or
650 * Note: OCFS2 already does this differently for metadata vs data
651 * allocations, as those bitmaps are seperate and undo access is never
652 * called on a metadata group descriptor.
654 static int ocfs2_test_bg_bit_allocatable(struct buffer_head *bg_bh,
657 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
659 if (ocfs2_test_bit(nr, (unsigned long *)bg->bg_bitmap))
661 if (!buffer_jbd(bg_bh) || !bh2jh(bg_bh)->b_committed_data)
664 bg = (struct ocfs2_group_desc *) bh2jh(bg_bh)->b_committed_data;
665 return !ocfs2_test_bit(nr, (unsigned long *)bg->bg_bitmap);
668 static int ocfs2_block_group_find_clear_bits(struct ocfs2_super *osb,
669 struct buffer_head *bg_bh,
670 unsigned int bits_wanted,
671 unsigned int total_bits,
676 u16 best_offset, best_size;
677 int offset, start, found, status = 0;
678 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
680 if (!OCFS2_IS_VALID_GROUP_DESC(bg)) {
681 OCFS2_RO_ON_INVALID_GROUP_DESC(osb->sb, bg);
685 found = start = best_offset = best_size = 0;
686 bitmap = bg->bg_bitmap;
688 while((offset = ocfs2_find_next_zero_bit(bitmap, total_bits, start)) != -1) {
689 if (offset == total_bits)
692 if (!ocfs2_test_bg_bit_allocatable(bg_bh, offset)) {
693 /* We found a zero, but we can't use it as it
694 * hasn't been put to disk yet! */
697 } else if (offset == start) {
698 /* we found a zero */
700 /* move start to the next bit to test */
703 /* got a zero after some ones */
707 if (found > best_size) {
709 best_offset = start - found;
711 /* we got everything we needed */
712 if (found == bits_wanted) {
713 /* mlog(0, "Found it all!\n"); */
718 /* XXX: I think the first clause is equivalent to the second
720 if (found == bits_wanted) {
721 *bit_off = start - found;
723 } else if (best_size) {
724 *bit_off = best_offset;
725 *bits_found = best_size;
728 /* No error log here -- see the comment above
729 * ocfs2_test_bg_bit_allocatable */
735 static inline int ocfs2_block_group_set_bits(handle_t *handle,
736 struct inode *alloc_inode,
737 struct ocfs2_group_desc *bg,
738 struct buffer_head *group_bh,
739 unsigned int bit_off,
740 unsigned int num_bits)
743 void *bitmap = bg->bg_bitmap;
744 int journal_type = OCFS2_JOURNAL_ACCESS_WRITE;
748 if (!OCFS2_IS_VALID_GROUP_DESC(bg)) {
749 OCFS2_RO_ON_INVALID_GROUP_DESC(alloc_inode->i_sb, bg);
753 BUG_ON(le16_to_cpu(bg->bg_free_bits_count) < num_bits);
755 mlog(0, "block_group_set_bits: off = %u, num = %u\n", bit_off,
758 if (ocfs2_is_cluster_bitmap(alloc_inode))
759 journal_type = OCFS2_JOURNAL_ACCESS_UNDO;
761 status = ocfs2_journal_access(handle,
770 le16_add_cpu(&bg->bg_free_bits_count, -num_bits);
773 ocfs2_set_bit(bit_off++, bitmap);
775 status = ocfs2_journal_dirty(handle,
787 /* find the one with the most empty bits */
788 static inline u16 ocfs2_find_victim_chain(struct ocfs2_chain_list *cl)
792 BUG_ON(!cl->cl_next_free_rec);
795 while (curr < le16_to_cpu(cl->cl_next_free_rec)) {
796 if (le32_to_cpu(cl->cl_recs[curr].c_free) >
797 le32_to_cpu(cl->cl_recs[best].c_free))
802 BUG_ON(best >= le16_to_cpu(cl->cl_next_free_rec));
806 static int ocfs2_relink_block_group(handle_t *handle,
807 struct inode *alloc_inode,
808 struct buffer_head *fe_bh,
809 struct buffer_head *bg_bh,
810 struct buffer_head *prev_bg_bh,
814 /* there is a really tiny chance the journal calls could fail,
815 * but we wouldn't want inconsistent blocks in *any* case. */
816 u64 fe_ptr, bg_ptr, prev_bg_ptr;
817 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) fe_bh->b_data;
818 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) bg_bh->b_data;
819 struct ocfs2_group_desc *prev_bg = (struct ocfs2_group_desc *) prev_bg_bh->b_data;
821 if (!OCFS2_IS_VALID_DINODE(fe)) {
822 OCFS2_RO_ON_INVALID_DINODE(alloc_inode->i_sb, fe);
826 if (!OCFS2_IS_VALID_GROUP_DESC(bg)) {
827 OCFS2_RO_ON_INVALID_GROUP_DESC(alloc_inode->i_sb, bg);
831 if (!OCFS2_IS_VALID_GROUP_DESC(prev_bg)) {
832 OCFS2_RO_ON_INVALID_GROUP_DESC(alloc_inode->i_sb, prev_bg);
837 mlog(0, "Suballoc %llu, chain %u, move group %llu to top, prev = %llu\n",
838 (unsigned long long)le64_to_cpu(fe->i_blkno), chain,
839 (unsigned long long)le64_to_cpu(bg->bg_blkno),
840 (unsigned long long)le64_to_cpu(prev_bg->bg_blkno));
842 fe_ptr = le64_to_cpu(fe->id2.i_chain.cl_recs[chain].c_blkno);
843 bg_ptr = le64_to_cpu(bg->bg_next_group);
844 prev_bg_ptr = le64_to_cpu(prev_bg->bg_next_group);
846 status = ocfs2_journal_access(handle, alloc_inode, prev_bg_bh,
847 OCFS2_JOURNAL_ACCESS_WRITE);
853 prev_bg->bg_next_group = bg->bg_next_group;
855 status = ocfs2_journal_dirty(handle, prev_bg_bh);
861 status = ocfs2_journal_access(handle, alloc_inode, bg_bh,
862 OCFS2_JOURNAL_ACCESS_WRITE);
868 bg->bg_next_group = fe->id2.i_chain.cl_recs[chain].c_blkno;
870 status = ocfs2_journal_dirty(handle, bg_bh);
876 status = ocfs2_journal_access(handle, alloc_inode, fe_bh,
877 OCFS2_JOURNAL_ACCESS_WRITE);
883 fe->id2.i_chain.cl_recs[chain].c_blkno = bg->bg_blkno;
885 status = ocfs2_journal_dirty(handle, fe_bh);
894 fe->id2.i_chain.cl_recs[chain].c_blkno = cpu_to_le64(fe_ptr);
895 bg->bg_next_group = cpu_to_le64(bg_ptr);
896 prev_bg->bg_next_group = cpu_to_le64(prev_bg_ptr);
903 static inline int ocfs2_block_group_reasonably_empty(struct ocfs2_group_desc *bg,
906 return le16_to_cpu(bg->bg_free_bits_count) > wanted;
909 /* return 0 on success, -ENOSPC to keep searching and any other < 0
911 static int ocfs2_cluster_group_search(struct inode *inode,
912 struct buffer_head *group_bh,
913 u32 bits_wanted, u32 min_bits,
914 u16 *bit_off, u16 *bits_found)
916 int search = -ENOSPC;
918 struct ocfs2_group_desc *gd = (struct ocfs2_group_desc *) group_bh->b_data;
919 u16 tmp_off, tmp_found;
920 unsigned int max_bits, gd_cluster_off;
922 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
924 if (gd->bg_free_bits_count) {
925 max_bits = le16_to_cpu(gd->bg_bits);
927 /* Tail groups in cluster bitmaps which aren't cpg
928 * aligned are prone to partial extention by a failed
929 * fs resize. If the file system resize never got to
930 * update the dinode cluster count, then we don't want
931 * to trust any clusters past it, regardless of what
932 * the group descriptor says. */
933 gd_cluster_off = ocfs2_blocks_to_clusters(inode->i_sb,
934 le64_to_cpu(gd->bg_blkno));
935 if ((gd_cluster_off + max_bits) >
936 OCFS2_I(inode)->ip_clusters) {
937 max_bits = OCFS2_I(inode)->ip_clusters - gd_cluster_off;
938 mlog(0, "Desc %llu, bg_bits %u, clusters %u, use %u\n",
939 (unsigned long long)le64_to_cpu(gd->bg_blkno),
940 le16_to_cpu(gd->bg_bits),
941 OCFS2_I(inode)->ip_clusters, max_bits);
944 ret = ocfs2_block_group_find_clear_bits(OCFS2_SB(inode->i_sb),
945 group_bh, bits_wanted,
947 &tmp_off, &tmp_found);
951 /* ocfs2_block_group_find_clear_bits() might
952 * return success, but we still want to return
953 * -ENOSPC unless it found the minimum number
955 if (min_bits <= tmp_found) {
957 *bits_found = tmp_found;
958 search = 0; /* success */
965 static int ocfs2_block_group_search(struct inode *inode,
966 struct buffer_head *group_bh,
967 u32 bits_wanted, u32 min_bits,
968 u16 *bit_off, u16 *bits_found)
971 struct ocfs2_group_desc *bg = (struct ocfs2_group_desc *) group_bh->b_data;
973 BUG_ON(min_bits != 1);
974 BUG_ON(ocfs2_is_cluster_bitmap(inode));
976 if (bg->bg_free_bits_count)
977 ret = ocfs2_block_group_find_clear_bits(OCFS2_SB(inode->i_sb),
978 group_bh, bits_wanted,
979 le16_to_cpu(bg->bg_bits),
980 bit_off, bits_found);
985 static int ocfs2_alloc_dinode_update_counts(struct inode *inode,
987 struct buffer_head *di_bh,
993 struct ocfs2_dinode *di = (struct ocfs2_dinode *) di_bh->b_data;
994 struct ocfs2_chain_list *cl = (struct ocfs2_chain_list *) &di->id2.i_chain;
996 ret = ocfs2_journal_access(handle, inode, di_bh,
997 OCFS2_JOURNAL_ACCESS_WRITE);
1003 tmp_used = le32_to_cpu(di->id1.bitmap1.i_used);
1004 di->id1.bitmap1.i_used = cpu_to_le32(num_bits + tmp_used);
1005 le32_add_cpu(&cl->cl_recs[chain].c_free, -num_bits);
1007 ret = ocfs2_journal_dirty(handle, di_bh);
1015 static int ocfs2_search_one_group(struct ocfs2_alloc_context *ac,
1020 unsigned int *num_bits,
1026 struct buffer_head *group_bh = NULL;
1027 struct ocfs2_group_desc *gd;
1028 struct inode *alloc_inode = ac->ac_inode;
1030 ret = ocfs2_read_block(OCFS2_SB(alloc_inode->i_sb), gd_blkno,
1031 &group_bh, OCFS2_BH_CACHED, alloc_inode);
1037 gd = (struct ocfs2_group_desc *) group_bh->b_data;
1038 if (!OCFS2_IS_VALID_GROUP_DESC(gd)) {
1039 OCFS2_RO_ON_INVALID_GROUP_DESC(alloc_inode->i_sb, gd);
1044 ret = ac->ac_group_search(alloc_inode, group_bh, bits_wanted, min_bits,
1054 ret = ocfs2_alloc_dinode_update_counts(alloc_inode, handle, ac->ac_bh,
1056 le16_to_cpu(gd->bg_chain));
1062 ret = ocfs2_block_group_set_bits(handle, alloc_inode, gd, group_bh,
1063 *bit_off, *num_bits);
1067 *bits_left = le16_to_cpu(gd->bg_free_bits_count);
1075 static int ocfs2_search_chain(struct ocfs2_alloc_context *ac,
1080 unsigned int *num_bits,
1085 u16 chain, tmp_bits;
1088 struct inode *alloc_inode = ac->ac_inode;
1089 struct buffer_head *group_bh = NULL;
1090 struct buffer_head *prev_group_bh = NULL;
1091 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) ac->ac_bh->b_data;
1092 struct ocfs2_chain_list *cl = (struct ocfs2_chain_list *) &fe->id2.i_chain;
1093 struct ocfs2_group_desc *bg;
1095 chain = ac->ac_chain;
1096 mlog(0, "trying to alloc %u bits from chain %u, inode %llu\n",
1098 (unsigned long long)OCFS2_I(alloc_inode)->ip_blkno);
1100 status = ocfs2_read_block(OCFS2_SB(alloc_inode->i_sb),
1101 le64_to_cpu(cl->cl_recs[chain].c_blkno),
1102 &group_bh, OCFS2_BH_CACHED, alloc_inode);
1107 bg = (struct ocfs2_group_desc *) group_bh->b_data;
1108 status = ocfs2_check_group_descriptor(alloc_inode->i_sb, fe, bg);
1115 /* for now, the chain search is a bit simplistic. We just use
1116 * the 1st group with any empty bits. */
1117 while ((status = ac->ac_group_search(alloc_inode, group_bh,
1118 bits_wanted, min_bits, bit_off,
1119 &tmp_bits)) == -ENOSPC) {
1120 if (!bg->bg_next_group)
1123 if (prev_group_bh) {
1124 brelse(prev_group_bh);
1125 prev_group_bh = NULL;
1127 next_group = le64_to_cpu(bg->bg_next_group);
1128 prev_group_bh = group_bh;
1130 status = ocfs2_read_block(OCFS2_SB(alloc_inode->i_sb),
1131 next_group, &group_bh,
1132 OCFS2_BH_CACHED, alloc_inode);
1137 bg = (struct ocfs2_group_desc *) group_bh->b_data;
1138 status = ocfs2_check_group_descriptor(alloc_inode->i_sb, fe, bg);
1145 if (status != -ENOSPC)
1150 mlog(0, "alloc succeeds: we give %u bits from block group %llu\n",
1151 tmp_bits, (unsigned long long)le64_to_cpu(bg->bg_blkno));
1153 *num_bits = tmp_bits;
1155 BUG_ON(*num_bits == 0);
1158 * Keep track of previous block descriptor read. When
1159 * we find a target, if we have read more than X
1160 * number of descriptors, and the target is reasonably
1161 * empty, relink him to top of his chain.
1163 * We've read 0 extra blocks and only send one more to
1164 * the transaction, yet the next guy to search has a
1167 * Do this *after* figuring out how many bits we're taking out
1168 * of our target group.
1170 if (ac->ac_allow_chain_relink &&
1172 (ocfs2_block_group_reasonably_empty(bg, *num_bits))) {
1173 status = ocfs2_relink_block_group(handle, alloc_inode,
1174 ac->ac_bh, group_bh,
1175 prev_group_bh, chain);
1182 /* Ok, claim our bits now: set the info on dinode, chainlist
1183 * and then the group */
1184 status = ocfs2_journal_access(handle,
1187 OCFS2_JOURNAL_ACCESS_WRITE);
1193 tmp_used = le32_to_cpu(fe->id1.bitmap1.i_used);
1194 fe->id1.bitmap1.i_used = cpu_to_le32(*num_bits + tmp_used);
1195 le32_add_cpu(&cl->cl_recs[chain].c_free, -(*num_bits));
1197 status = ocfs2_journal_dirty(handle,
1204 status = ocfs2_block_group_set_bits(handle,
1215 mlog(0, "Allocated %u bits from suballocator %llu\n", *num_bits,
1216 (unsigned long long)le64_to_cpu(fe->i_blkno));
1218 *bg_blkno = le64_to_cpu(bg->bg_blkno);
1219 *bits_left = le16_to_cpu(bg->bg_free_bits_count);
1224 brelse(prev_group_bh);
1230 /* will give out up to bits_wanted contiguous bits. */
1231 static int ocfs2_claim_suballoc_bits(struct ocfs2_super *osb,
1232 struct ocfs2_alloc_context *ac,
1237 unsigned int *num_bits,
1243 u64 hint_blkno = ac->ac_last_group;
1244 struct ocfs2_chain_list *cl;
1245 struct ocfs2_dinode *fe;
1249 BUG_ON(ac->ac_bits_given >= ac->ac_bits_wanted);
1250 BUG_ON(bits_wanted > (ac->ac_bits_wanted - ac->ac_bits_given));
1253 fe = (struct ocfs2_dinode *) ac->ac_bh->b_data;
1254 if (!OCFS2_IS_VALID_DINODE(fe)) {
1255 OCFS2_RO_ON_INVALID_DINODE(osb->sb, fe);
1259 if (le32_to_cpu(fe->id1.bitmap1.i_used) >=
1260 le32_to_cpu(fe->id1.bitmap1.i_total)) {
1261 ocfs2_error(osb->sb, "Chain allocator dinode %llu has %u used "
1262 "bits but only %u total.",
1263 (unsigned long long)le64_to_cpu(fe->i_blkno),
1264 le32_to_cpu(fe->id1.bitmap1.i_used),
1265 le32_to_cpu(fe->id1.bitmap1.i_total));
1271 /* Attempt to short-circuit the usual search mechanism
1272 * by jumping straight to the most recently used
1273 * allocation group. This helps us mantain some
1274 * contiguousness across allocations. */
1275 status = ocfs2_search_one_group(ac, handle, bits_wanted,
1276 min_bits, bit_off, num_bits,
1277 hint_blkno, &bits_left);
1279 /* Be careful to update *bg_blkno here as the
1280 * caller is expecting it to be filled in, and
1281 * ocfs2_search_one_group() won't do that for
1283 *bg_blkno = hint_blkno;
1286 if (status < 0 && status != -ENOSPC) {
1292 cl = (struct ocfs2_chain_list *) &fe->id2.i_chain;
1294 victim = ocfs2_find_victim_chain(cl);
1295 ac->ac_chain = victim;
1296 ac->ac_allow_chain_relink = 1;
1298 status = ocfs2_search_chain(ac, handle, bits_wanted, min_bits, bit_off,
1299 num_bits, bg_blkno, &bits_left);
1302 if (status < 0 && status != -ENOSPC) {
1307 mlog(0, "Search of victim chain %u came up with nothing, "
1308 "trying all chains now.\n", victim);
1310 /* If we didn't pick a good victim, then just default to
1311 * searching each chain in order. Don't allow chain relinking
1312 * because we only calculate enough journal credits for one
1313 * relink per alloc. */
1314 ac->ac_allow_chain_relink = 0;
1315 for (i = 0; i < le16_to_cpu(cl->cl_next_free_rec); i ++) {
1318 if (!cl->cl_recs[i].c_free)
1322 status = ocfs2_search_chain(ac, handle, bits_wanted, min_bits,
1323 bit_off, num_bits, bg_blkno,
1327 if (status < 0 && status != -ENOSPC) {
1334 if (status != -ENOSPC) {
1335 /* If the next search of this group is not likely to
1336 * yield a suitable extent, then we reset the last
1337 * group hint so as to not waste a disk read */
1338 if (bits_left < min_bits)
1339 ac->ac_last_group = 0;
1341 ac->ac_last_group = *bg_blkno;
1349 int ocfs2_claim_metadata(struct ocfs2_super *osb,
1351 struct ocfs2_alloc_context *ac,
1353 u16 *suballoc_bit_start,
1354 unsigned int *num_bits,
1361 BUG_ON(ac->ac_bits_wanted < (ac->ac_bits_given + bits_wanted));
1362 BUG_ON(ac->ac_which != OCFS2_AC_USE_META);
1364 status = ocfs2_claim_suballoc_bits(osb,
1376 atomic_inc(&osb->alloc_stats.bg_allocs);
1378 *blkno_start = bg_blkno + (u64) *suballoc_bit_start;
1379 ac->ac_bits_given += (*num_bits);
1386 int ocfs2_claim_new_inode(struct ocfs2_super *osb,
1388 struct ocfs2_alloc_context *ac,
1393 unsigned int num_bits;
1399 BUG_ON(ac->ac_bits_given != 0);
1400 BUG_ON(ac->ac_bits_wanted != 1);
1401 BUG_ON(ac->ac_which != OCFS2_AC_USE_INODE);
1403 status = ocfs2_claim_suballoc_bits(osb,
1415 atomic_inc(&osb->alloc_stats.bg_allocs);
1417 BUG_ON(num_bits != 1);
1419 *fe_blkno = bg_blkno + (u64) (*suballoc_bit);
1420 ac->ac_bits_given++;
1427 /* translate a group desc. blkno and it's bitmap offset into
1428 * disk cluster offset. */
1429 static inline u32 ocfs2_desc_bitmap_to_cluster_off(struct inode *inode,
1433 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
1436 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
1438 if (bg_blkno != osb->first_cluster_group_blkno)
1439 cluster = ocfs2_blocks_to_clusters(inode->i_sb, bg_blkno);
1440 cluster += (u32) bg_bit_off;
1444 /* given a cluster offset, calculate which block group it belongs to
1445 * and return that block offset. */
1446 static inline u64 ocfs2_which_cluster_group(struct inode *inode,
1449 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
1452 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
1454 group_no = cluster / osb->bitmap_cpg;
1456 return osb->first_cluster_group_blkno;
1457 return ocfs2_clusters_to_blocks(inode->i_sb,
1458 group_no * osb->bitmap_cpg);
1461 /* given the block number of a cluster start, calculate which cluster
1462 * group and descriptor bitmap offset that corresponds to. */
1463 static inline void ocfs2_block_to_cluster_group(struct inode *inode,
1468 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
1469 u32 data_cluster = ocfs2_blocks_to_clusters(osb->sb, data_blkno);
1471 BUG_ON(!ocfs2_is_cluster_bitmap(inode));
1473 *bg_blkno = ocfs2_which_cluster_group(inode,
1476 if (*bg_blkno == osb->first_cluster_group_blkno)
1477 *bg_bit_off = (u16) data_cluster;
1479 *bg_bit_off = (u16) ocfs2_blocks_to_clusters(osb->sb,
1480 data_blkno - *bg_blkno);
1484 * min_bits - minimum contiguous chunk from this total allocation we
1485 * can handle. set to what we asked for originally for a full
1486 * contig. allocation, set to '1' to indicate we can deal with extents
1489 int __ocfs2_claim_clusters(struct ocfs2_super *osb,
1491 struct ocfs2_alloc_context *ac,
1498 unsigned int bits_wanted = max_clusters;
1504 BUG_ON(ac->ac_bits_given >= ac->ac_bits_wanted);
1506 BUG_ON(ac->ac_which != OCFS2_AC_USE_LOCAL
1507 && ac->ac_which != OCFS2_AC_USE_MAIN);
1509 if (ac->ac_which == OCFS2_AC_USE_LOCAL) {
1510 status = ocfs2_claim_local_alloc_bits(osb,
1517 atomic_inc(&osb->alloc_stats.local_data);
1519 if (min_clusters > (osb->bitmap_cpg - 1)) {
1520 /* The only paths asking for contiguousness
1521 * should know about this already. */
1522 mlog(ML_ERROR, "minimum allocation requested exceeds "
1523 "group bitmap size!");
1527 /* clamp the current request down to a realistic size. */
1528 if (bits_wanted > (osb->bitmap_cpg - 1))
1529 bits_wanted = osb->bitmap_cpg - 1;
1531 status = ocfs2_claim_suballoc_bits(osb,
1541 ocfs2_desc_bitmap_to_cluster_off(ac->ac_inode,
1544 atomic_inc(&osb->alloc_stats.bitmap_data);
1548 if (status != -ENOSPC)
1553 ac->ac_bits_given += *num_clusters;
1560 int ocfs2_claim_clusters(struct ocfs2_super *osb,
1562 struct ocfs2_alloc_context *ac,
1567 unsigned int bits_wanted = ac->ac_bits_wanted - ac->ac_bits_given;
1569 return __ocfs2_claim_clusters(osb, handle, ac, min_clusters,
1570 bits_wanted, cluster_start, num_clusters);
1573 static inline int ocfs2_block_group_clear_bits(handle_t *handle,
1574 struct inode *alloc_inode,
1575 struct ocfs2_group_desc *bg,
1576 struct buffer_head *group_bh,
1577 unsigned int bit_off,
1578 unsigned int num_bits)
1582 int journal_type = OCFS2_JOURNAL_ACCESS_WRITE;
1583 struct ocfs2_group_desc *undo_bg = NULL;
1587 if (!OCFS2_IS_VALID_GROUP_DESC(bg)) {
1588 OCFS2_RO_ON_INVALID_GROUP_DESC(alloc_inode->i_sb, bg);
1593 mlog(0, "off = %u, num = %u\n", bit_off, num_bits);
1595 if (ocfs2_is_cluster_bitmap(alloc_inode))
1596 journal_type = OCFS2_JOURNAL_ACCESS_UNDO;
1598 status = ocfs2_journal_access(handle, alloc_inode, group_bh,
1605 if (ocfs2_is_cluster_bitmap(alloc_inode))
1606 undo_bg = (struct ocfs2_group_desc *) bh2jh(group_bh)->b_committed_data;
1610 ocfs2_clear_bit((bit_off + tmp),
1611 (unsigned long *) bg->bg_bitmap);
1612 if (ocfs2_is_cluster_bitmap(alloc_inode))
1613 ocfs2_set_bit(bit_off + tmp,
1614 (unsigned long *) undo_bg->bg_bitmap);
1616 le16_add_cpu(&bg->bg_free_bits_count, num_bits);
1618 status = ocfs2_journal_dirty(handle, group_bh);
1626 * expects the suballoc inode to already be locked.
1628 int ocfs2_free_suballoc_bits(handle_t *handle,
1629 struct inode *alloc_inode,
1630 struct buffer_head *alloc_bh,
1631 unsigned int start_bit,
1637 struct ocfs2_super *osb = OCFS2_SB(alloc_inode->i_sb);
1638 struct ocfs2_dinode *fe = (struct ocfs2_dinode *) alloc_bh->b_data;
1639 struct ocfs2_chain_list *cl = &fe->id2.i_chain;
1640 struct buffer_head *group_bh = NULL;
1641 struct ocfs2_group_desc *group;
1645 if (!OCFS2_IS_VALID_DINODE(fe)) {
1646 OCFS2_RO_ON_INVALID_DINODE(alloc_inode->i_sb, fe);
1650 BUG_ON((count + start_bit) > ocfs2_bits_per_group(cl));
1652 mlog(0, "%llu: freeing %u bits from group %llu, starting at %u\n",
1653 (unsigned long long)OCFS2_I(alloc_inode)->ip_blkno, count,
1654 (unsigned long long)bg_blkno, start_bit);
1656 status = ocfs2_read_block(osb, bg_blkno, &group_bh, OCFS2_BH_CACHED,
1663 group = (struct ocfs2_group_desc *) group_bh->b_data;
1664 status = ocfs2_check_group_descriptor(alloc_inode->i_sb, fe, group);
1669 BUG_ON((count + start_bit) > le16_to_cpu(group->bg_bits));
1671 status = ocfs2_block_group_clear_bits(handle, alloc_inode,
1679 status = ocfs2_journal_access(handle, alloc_inode, alloc_bh,
1680 OCFS2_JOURNAL_ACCESS_WRITE);
1686 le32_add_cpu(&cl->cl_recs[le16_to_cpu(group->bg_chain)].c_free,
1688 tmp_used = le32_to_cpu(fe->id1.bitmap1.i_used);
1689 fe->id1.bitmap1.i_used = cpu_to_le32(tmp_used - count);
1691 status = ocfs2_journal_dirty(handle, alloc_bh);
1705 int ocfs2_free_dinode(handle_t *handle,
1706 struct inode *inode_alloc_inode,
1707 struct buffer_head *inode_alloc_bh,
1708 struct ocfs2_dinode *di)
1710 u64 blk = le64_to_cpu(di->i_blkno);
1711 u16 bit = le16_to_cpu(di->i_suballoc_bit);
1712 u64 bg_blkno = ocfs2_which_suballoc_group(blk, bit);
1714 return ocfs2_free_suballoc_bits(handle, inode_alloc_inode,
1715 inode_alloc_bh, bit, bg_blkno, 1);
1718 int ocfs2_free_clusters(handle_t *handle,
1719 struct inode *bitmap_inode,
1720 struct buffer_head *bitmap_bh,
1722 unsigned int num_clusters)
1727 struct ocfs2_dinode *fe;
1729 /* You can't ever have a contiguous set of clusters
1730 * bigger than a block group bitmap so we never have to worry
1731 * about looping on them. */
1735 /* This is expensive. We can safely remove once this stuff has
1736 * gotten tested really well. */
1737 BUG_ON(start_blk != ocfs2_clusters_to_blocks(bitmap_inode->i_sb, ocfs2_blocks_to_clusters(bitmap_inode->i_sb, start_blk)));
1739 fe = (struct ocfs2_dinode *) bitmap_bh->b_data;
1741 ocfs2_block_to_cluster_group(bitmap_inode, start_blk, &bg_blkno,
1744 mlog(0, "want to free %u clusters starting at block %llu\n",
1745 num_clusters, (unsigned long long)start_blk);
1746 mlog(0, "bg_blkno = %llu, bg_start_bit = %u\n",
1747 (unsigned long long)bg_blkno, bg_start_bit);
1749 status = ocfs2_free_suballoc_bits(handle, bitmap_inode, bitmap_bh,
1750 bg_start_bit, bg_blkno,
1759 static inline void ocfs2_debug_bg(struct ocfs2_group_desc *bg)
1761 printk("Block Group:\n");
1762 printk("bg_signature: %s\n", bg->bg_signature);
1763 printk("bg_size: %u\n", bg->bg_size);
1764 printk("bg_bits: %u\n", bg->bg_bits);
1765 printk("bg_free_bits_count: %u\n", bg->bg_free_bits_count);
1766 printk("bg_chain: %u\n", bg->bg_chain);
1767 printk("bg_generation: %u\n", le32_to_cpu(bg->bg_generation));
1768 printk("bg_next_group: %llu\n",
1769 (unsigned long long)bg->bg_next_group);
1770 printk("bg_parent_dinode: %llu\n",
1771 (unsigned long long)bg->bg_parent_dinode);
1772 printk("bg_blkno: %llu\n",
1773 (unsigned long long)bg->bg_blkno);
1776 static inline void ocfs2_debug_suballoc_inode(struct ocfs2_dinode *fe)
1780 printk("Suballoc Inode %llu:\n", (unsigned long long)fe->i_blkno);
1781 printk("i_signature: %s\n", fe->i_signature);
1782 printk("i_size: %llu\n",
1783 (unsigned long long)fe->i_size);
1784 printk("i_clusters: %u\n", fe->i_clusters);
1785 printk("i_generation: %u\n",
1786 le32_to_cpu(fe->i_generation));
1787 printk("id1.bitmap1.i_used: %u\n",
1788 le32_to_cpu(fe->id1.bitmap1.i_used));
1789 printk("id1.bitmap1.i_total: %u\n",
1790 le32_to_cpu(fe->id1.bitmap1.i_total));
1791 printk("id2.i_chain.cl_cpg: %u\n", fe->id2.i_chain.cl_cpg);
1792 printk("id2.i_chain.cl_bpc: %u\n", fe->id2.i_chain.cl_bpc);
1793 printk("id2.i_chain.cl_count: %u\n", fe->id2.i_chain.cl_count);
1794 printk("id2.i_chain.cl_next_free_rec: %u\n",
1795 fe->id2.i_chain.cl_next_free_rec);
1796 for(i = 0; i < fe->id2.i_chain.cl_next_free_rec; i++) {
1797 printk("fe->id2.i_chain.cl_recs[%d].c_free: %u\n", i,
1798 fe->id2.i_chain.cl_recs[i].c_free);
1799 printk("fe->id2.i_chain.cl_recs[%d].c_total: %u\n", i,
1800 fe->id2.i_chain.cl_recs[i].c_total);
1801 printk("fe->id2.i_chain.cl_recs[%d].c_blkno: %llu\n", i,
1802 (unsigned long long)fe->id2.i_chain.cl_recs[i].c_blkno);