11da177e4SLinus Torvalds #include <linux/buffer_head.h> 21da177e4SLinus Torvalds #include "minix.h" 31da177e4SLinus Torvalds 41da177e4SLinus Torvalds enum {DIRECT = 7, DEPTH = 4}; /* Have triple indirect */ 51da177e4SLinus Torvalds 61da177e4SLinus Torvalds typedef u32 block_t; /* 32 bit, host order */ 71da177e4SLinus Torvalds 81da177e4SLinus Torvalds static inline unsigned long block_to_cpu(block_t n) 91da177e4SLinus Torvalds { 101da177e4SLinus Torvalds return n; 111da177e4SLinus Torvalds } 121da177e4SLinus Torvalds 131da177e4SLinus Torvalds static inline block_t cpu_to_block(unsigned long n) 141da177e4SLinus Torvalds { 151da177e4SLinus Torvalds return n; 161da177e4SLinus Torvalds } 171da177e4SLinus Torvalds 181da177e4SLinus Torvalds static inline block_t *i_data(struct inode *inode) 191da177e4SLinus Torvalds { 201da177e4SLinus Torvalds return (block_t *)minix_i(inode)->u.i2_data; 211da177e4SLinus Torvalds } 221da177e4SLinus Torvalds 23*0ab7620aSErik van der Kouwe #define DIRCOUNT 7 24*0ab7620aSErik van der Kouwe #define INDIRCOUNT(sb) (1 << ((sb)->s_blocksize_bits - 2)) 25*0ab7620aSErik van der Kouwe 261da177e4SLinus Torvalds static int block_to_path(struct inode * inode, long block, int offsets[DEPTH]) 271da177e4SLinus Torvalds { 281da177e4SLinus Torvalds int n = 0; 29f44ec6f3SEric Sandeen char b[BDEVNAME_SIZE]; 30939b00dfSAndries Brouwer struct super_block *sb = inode->i_sb; 311da177e4SLinus Torvalds 321da177e4SLinus Torvalds if (block < 0) { 33f44ec6f3SEric Sandeen printk("MINIX-fs: block_to_path: block %ld < 0 on dev %s\n", 34f44ec6f3SEric Sandeen block, bdevname(sb->s_bdev, b)); 35939b00dfSAndries Brouwer } else if (block >= (minix_sb(inode->i_sb)->s_max_size/sb->s_blocksize)) { 36f44ec6f3SEric Sandeen if (printk_ratelimit()) 37f44ec6f3SEric Sandeen printk("MINIX-fs: block_to_path: " 38f44ec6f3SEric Sandeen "block %ld too big on dev %s\n", 39f44ec6f3SEric Sandeen block, bdevname(sb->s_bdev, b)); 40*0ab7620aSErik van der Kouwe } else if (block < DIRCOUNT) { 411da177e4SLinus Torvalds offsets[n++] = block; 42*0ab7620aSErik van der Kouwe } else if ((block -= DIRCOUNT) < INDIRCOUNT(sb)) { 43*0ab7620aSErik van der Kouwe offsets[n++] = DIRCOUNT; 441da177e4SLinus Torvalds offsets[n++] = block; 45*0ab7620aSErik van der Kouwe } else if ((block -= INDIRCOUNT(sb)) < INDIRCOUNT(sb) * INDIRCOUNT(sb)) { 46*0ab7620aSErik van der Kouwe offsets[n++] = DIRCOUNT + 1; 47*0ab7620aSErik van der Kouwe offsets[n++] = block / INDIRCOUNT(sb); 48*0ab7620aSErik van der Kouwe offsets[n++] = block % INDIRCOUNT(sb); 491da177e4SLinus Torvalds } else { 50*0ab7620aSErik van der Kouwe block -= INDIRCOUNT(sb) * INDIRCOUNT(sb); 51*0ab7620aSErik van der Kouwe offsets[n++] = DIRCOUNT + 2; 52*0ab7620aSErik van der Kouwe offsets[n++] = (block / INDIRCOUNT(sb)) / INDIRCOUNT(sb); 53*0ab7620aSErik van der Kouwe offsets[n++] = (block / INDIRCOUNT(sb)) % INDIRCOUNT(sb); 54*0ab7620aSErik van der Kouwe offsets[n++] = block % INDIRCOUNT(sb); 551da177e4SLinus Torvalds } 561da177e4SLinus Torvalds return n; 571da177e4SLinus Torvalds } 581da177e4SLinus Torvalds 591da177e4SLinus Torvalds #include "itree_common.c" 601da177e4SLinus Torvalds 611da177e4SLinus Torvalds int V2_minix_get_block(struct inode * inode, long block, 621da177e4SLinus Torvalds struct buffer_head *bh_result, int create) 631da177e4SLinus Torvalds { 641da177e4SLinus Torvalds return get_block(inode, block, bh_result, create); 651da177e4SLinus Torvalds } 661da177e4SLinus Torvalds 671da177e4SLinus Torvalds void V2_minix_truncate(struct inode * inode) 681da177e4SLinus Torvalds { 691da177e4SLinus Torvalds truncate(inode); 701da177e4SLinus Torvalds } 711da177e4SLinus Torvalds 72939b00dfSAndries Brouwer unsigned V2_minix_blocks(loff_t size, struct super_block *sb) 731da177e4SLinus Torvalds { 74939b00dfSAndries Brouwer return nblocks(size, sb); 751da177e4SLinus Torvalds } 76