1 #include <linux/buffer_head.h>
4 enum {DIRECT
= 7, DEPTH
= 4}; /* Have triple indirect */
6 typedef u32 block_t
; /* 32 bit, host order */
8 static inline unsigned long block_to_cpu(block_t n
)
13 static inline block_t
cpu_to_block(unsigned long n
)
18 static inline block_t
*i_data(struct inode
*inode
)
20 return (block_t
*)minix_i(inode
)->u
.i2_data
;
23 static int block_to_path(struct inode
* inode
, long block
, int offsets
[DEPTH
])
26 struct super_block
*sb
= inode
->i_sb
;
29 printk("minix_bmap: block<0\n");
30 } else if (block
>= (minix_sb(inode
->i_sb
)->s_max_size
/sb
->s_blocksize
)) {
31 printk("minix_bmap: block>big\n");
32 } else if (block
< 7) {
34 } else if ((block
-= 7) < 256) {
37 } else if ((block
-= 256) < 256*256) {
39 offsets
[n
++] = block
>>8;
40 offsets
[n
++] = block
& 255;
44 offsets
[n
++] = block
>>16;
45 offsets
[n
++] = (block
>>8) & 255;
46 offsets
[n
++] = block
& 255;
51 #include "itree_common.c"
53 int V2_minix_get_block(struct inode
* inode
, long block
,
54 struct buffer_head
*bh_result
, int create
)
56 return get_block(inode
, block
, bh_result
, create
);
59 void V2_minix_truncate(struct inode
* inode
)
64 unsigned V2_minix_blocks(loff_t size
, struct super_block
*sb
)
66 return nblocks(size
, sb
);