1 #include <linux/buffer_head.h> 2 #include "minix.h" 3 4 enum {DIRECT = 7, DEPTH = 4}; /* Have triple indirect */ 5 6 typedef u32 block_t; /* 32 bit, host order */ 7 8 static inline unsigned long block_to_cpu(block_t n) 9 { 10 return n; 11 } 12 13 static inline block_t cpu_to_block(unsigned long n) 14 { 15 return n; 16 } 17 18 static inline block_t *i_data(struct inode *inode) 19 { 20 return (block_t *)minix_i(inode)->u.i2_data; 21 } 22 23 static int block_to_path(struct inode * inode, long block, int offsets[DEPTH]) 24 { 25 int n = 0; 26 27 if (block < 0) { 28 printk("minix_bmap: block<0"); 29 } else if (block >= (minix_sb(inode->i_sb)->s_max_size/BLOCK_SIZE)) { 30 printk("minix_bmap: block>big"); 31 } else if (block < 7) { 32 offsets[n++] = block; 33 } else if ((block -= 7) < 256) { 34 offsets[n++] = 7; 35 offsets[n++] = block; 36 } else if ((block -= 256) < 256*256) { 37 offsets[n++] = 8; 38 offsets[n++] = block>>8; 39 offsets[n++] = block & 255; 40 } else { 41 block -= 256*256; 42 offsets[n++] = 9; 43 offsets[n++] = block>>16; 44 offsets[n++] = (block>>8) & 255; 45 offsets[n++] = block & 255; 46 } 47 return n; 48 } 49 50 #include "itree_common.c" 51 52 int V2_minix_get_block(struct inode * inode, long block, 53 struct buffer_head *bh_result, int create) 54 { 55 return get_block(inode, block, bh_result, create); 56 } 57 58 void V2_minix_truncate(struct inode * inode) 59 { 60 truncate(inode); 61 } 62 63 unsigned V2_minix_blocks(loff_t size) 64 { 65 return nblocks(size); 66 } 67