diff options
Diffstat (limited to 'fs/minix/bitmap.c')
| -rw-r--r-- | fs/minix/bitmap.c | 55 |
1 files changed, 24 insertions, 31 deletions
diff --git a/fs/minix/bitmap.c b/fs/minix/bitmap.c index 3f32bcb0d9bd..ef175cb8cfd8 100644 --- a/fs/minix/bitmap.c +++ b/fs/minix/bitmap.c | |||
| @@ -16,38 +16,26 @@ | |||
| 16 | #include <linux/bitops.h> | 16 | #include <linux/bitops.h> |
| 17 | #include <linux/sched.h> | 17 | #include <linux/sched.h> |
| 18 | 18 | ||
| 19 | static const int nibblemap[] = { 4,3,3,2,3,2,2,1,3,2,2,1,2,1,1,0 }; | ||
| 20 | |||
| 21 | static DEFINE_SPINLOCK(bitmap_lock); | 19 | static DEFINE_SPINLOCK(bitmap_lock); |
| 22 | 20 | ||
| 23 | static unsigned long count_free(struct buffer_head *map[], unsigned numblocks, __u32 numbits) | 21 | /* |
| 22 | * bitmap consists of blocks filled with 16bit words | ||
| 23 | * bit set == busy, bit clear == free | ||
| 24 | * endianness is a mess, but for counting zero bits it really doesn't matter... | ||
| 25 | */ | ||
| 26 | static __u32 count_free(struct buffer_head *map[], unsigned blocksize, __u32 numbits) | ||
| 24 | { | 27 | { |
| 25 | unsigned i, j, sum = 0; | 28 | __u32 sum = 0; |
| 26 | struct buffer_head *bh; | 29 | unsigned blocks = DIV_ROUND_UP(numbits, blocksize * 8); |
| 27 | |||
| 28 | for (i=0; i<numblocks-1; i++) { | ||
| 29 | if (!(bh=map[i])) | ||
| 30 | return(0); | ||
| 31 | for (j=0; j<bh->b_size; j++) | ||
| 32 | sum += nibblemap[bh->b_data[j] & 0xf] | ||
| 33 | + nibblemap[(bh->b_data[j]>>4) & 0xf]; | ||
| 34 | } | ||
| 35 | 30 | ||
| 36 | if (numblocks==0 || !(bh=map[numblocks-1])) | 31 | while (blocks--) { |
| 37 | return(0); | 32 | unsigned words = blocksize / 2; |
| 38 | i = ((numbits - (numblocks-1) * bh->b_size * 8) / 16) * 2; | 33 | __u16 *p = (__u16 *)(*map++)->b_data; |
| 39 | for (j=0; j<i; j++) { | 34 | while (words--) |
| 40 | sum += nibblemap[bh->b_data[j] & 0xf] | 35 | sum += 16 - hweight16(*p++); |
| 41 | + nibblemap[(bh->b_data[j]>>4) & 0xf]; | ||
| 42 | } | 36 | } |
| 43 | 37 | ||
| 44 | i = numbits%16; | 38 | return sum; |
| 45 | if (i!=0) { | ||
| 46 | i = *(__u16 *)(&bh->b_data[j]) | ~((1<<i) - 1); | ||
| 47 | sum += nibblemap[i & 0xf] + nibblemap[(i>>4) & 0xf]; | ||
| 48 | sum += nibblemap[(i>>8) & 0xf] + nibblemap[(i>>12) & 0xf]; | ||
| 49 | } | ||
| 50 | return(sum); | ||
| 51 | } | 39 | } |
| 52 | 40 | ||
| 53 | void minix_free_block(struct inode *inode, unsigned long block) | 41 | void minix_free_block(struct inode *inode, unsigned long block) |
| @@ -105,10 +93,12 @@ int minix_new_block(struct inode * inode) | |||
| 105 | return 0; | 93 | return 0; |
| 106 | } | 94 | } |
| 107 | 95 | ||
| 108 | unsigned long minix_count_free_blocks(struct minix_sb_info *sbi) | 96 | unsigned long minix_count_free_blocks(struct super_block *sb) |
| 109 | { | 97 | { |
| 110 | return (count_free(sbi->s_zmap, sbi->s_zmap_blocks, | 98 | struct minix_sb_info *sbi = minix_sb(sb); |
| 111 | sbi->s_nzones - sbi->s_firstdatazone + 1) | 99 | u32 bits = sbi->s_nzones - (sbi->s_firstdatazone + 1); |
| 100 | |||
| 101 | return (count_free(sbi->s_zmap, sb->s_blocksize, bits) | ||
| 112 | << sbi->s_log_zone_size); | 102 | << sbi->s_log_zone_size); |
| 113 | } | 103 | } |
| 114 | 104 | ||
| @@ -273,7 +263,10 @@ struct inode *minix_new_inode(const struct inode *dir, int mode, int *error) | |||
| 273 | return inode; | 263 | return inode; |
| 274 | } | 264 | } |
| 275 | 265 | ||
| 276 | unsigned long minix_count_free_inodes(struct minix_sb_info *sbi) | 266 | unsigned long minix_count_free_inodes(struct super_block *sb) |
| 277 | { | 267 | { |
| 278 | return count_free(sbi->s_imap, sbi->s_imap_blocks, sbi->s_ninodes + 1); | 268 | struct minix_sb_info *sbi = minix_sb(sb); |
| 269 | u32 bits = sbi->s_ninodes + 1; | ||
| 270 | |||
| 271 | return count_free(sbi->s_imap, sb->s_blocksize, bits); | ||
| 279 | } | 272 | } |
