sched/fair: Do not announce throttled next buddy in dequeue_task_fair()
[linux/fpc-iii.git] / fs / qnx4 / bitmap.c
blob76a7a697b778d7918e5db75bf5a1dd744a073a5d
1 /*
2 * QNX4 file system, Linux implementation.
4 * Version : 0.2.1
6 * Using parts of the xiafs filesystem.
8 * History :
10 * 28-05-1998 by Richard Frowijn : first release.
11 * 20-06-1998 by Frank Denis : basic optimisations.
12 * 25-06-1998 by Frank Denis : qnx4_is_free, qnx4_set_bitmap, qnx4_bmap .
13 * 28-06-1998 by Frank Denis : qnx4_free_inode (to be fixed) .
16 #include <linux/buffer_head.h>
17 #include <linux/bitops.h>
18 #include "qnx4.h"
20 unsigned long qnx4_count_free_blocks(struct super_block *sb)
22 int start = le32_to_cpu(qnx4_sb(sb)->BitMap->di_first_xtnt.xtnt_blk) - 1;
23 int total = 0;
24 int total_free = 0;
25 int offset = 0;
26 int size = le32_to_cpu(qnx4_sb(sb)->BitMap->di_size);
27 struct buffer_head *bh;
29 while (total < size) {
30 int bytes = min(size - total, QNX4_BLOCK_SIZE);
32 if ((bh = sb_bread(sb, start + offset)) == NULL) {
33 printk(KERN_ERR "qnx4: I/O error in counting free blocks\n");
34 break;
36 total_free += bytes * BITS_PER_BYTE -
37 memweight(bh->b_data, bytes);
38 brelse(bh);
39 total += bytes;
40 offset++;
43 return total_free;