diff options
| -rw-r--r-- | fs/minix/itree_v2.c | 27 |
1 files changed, 15 insertions, 12 deletions
diff --git a/fs/minix/itree_v2.c b/fs/minix/itree_v2.c index f23010969369..13487ad16894 100644 --- a/fs/minix/itree_v2.c +++ b/fs/minix/itree_v2.c | |||
| @@ -20,6 +20,9 @@ static inline block_t *i_data(struct inode *inode) | |||
| 20 | return (block_t *)minix_i(inode)->u.i2_data; | 20 | return (block_t *)minix_i(inode)->u.i2_data; |
| 21 | } | 21 | } |
| 22 | 22 | ||
| 23 | #define DIRCOUNT 7 | ||
| 24 | #define INDIRCOUNT(sb) (1 << ((sb)->s_blocksize_bits - 2)) | ||
| 25 | |||
| 23 | static int block_to_path(struct inode * inode, long block, int offsets[DEPTH]) | 26 | static int block_to_path(struct inode * inode, long block, int offsets[DEPTH]) |
| 24 | { | 27 | { |
| 25 | int n = 0; | 28 | int n = 0; |
| @@ -34,21 +37,21 @@ static int block_to_path(struct inode * inode, long block, int offsets[DEPTH]) | |||
| 34 | printk("MINIX-fs: block_to_path: " | 37 | printk("MINIX-fs: block_to_path: " |
| 35 | "block %ld too big on dev %s\n", | 38 | "block %ld too big on dev %s\n", |
| 36 | block, bdevname(sb->s_bdev, b)); | 39 | block, bdevname(sb->s_bdev, b)); |
| 37 | } else if (block < 7) { | 40 | } else if (block < DIRCOUNT) { |
| 38 | offsets[n++] = block; | 41 | offsets[n++] = block; |
| 39 | } else if ((block -= 7) < 256) { | 42 | } else if ((block -= DIRCOUNT) < INDIRCOUNT(sb)) { |
| 40 | offsets[n++] = 7; | 43 | offsets[n++] = DIRCOUNT; |
| 41 | offsets[n++] = block; | 44 | offsets[n++] = block; |
| 42 | } else if ((block -= 256) < 256*256) { | 45 | } else if ((block -= INDIRCOUNT(sb)) < INDIRCOUNT(sb) * INDIRCOUNT(sb)) { |
| 43 | offsets[n++] = 8; | 46 | offsets[n++] = DIRCOUNT + 1; |
| 44 | offsets[n++] = block>>8; | 47 | offsets[n++] = block / INDIRCOUNT(sb); |
| 45 | offsets[n++] = block & 255; | 48 | offsets[n++] = block % INDIRCOUNT(sb); |
| 46 | } else { | 49 | } else { |
| 47 | block -= 256*256; | 50 | block -= INDIRCOUNT(sb) * INDIRCOUNT(sb); |
| 48 | offsets[n++] = 9; | 51 | offsets[n++] = DIRCOUNT + 2; |
| 49 | offsets[n++] = block>>16; | 52 | offsets[n++] = (block / INDIRCOUNT(sb)) / INDIRCOUNT(sb); |
| 50 | offsets[n++] = (block>>8) & 255; | 53 | offsets[n++] = (block / INDIRCOUNT(sb)) % INDIRCOUNT(sb); |
| 51 | offsets[n++] = block & 255; | 54 | offsets[n++] = block % INDIRCOUNT(sb); |
| 52 | } | 55 | } |
| 53 | return n; | 56 | return n; |
| 54 | } | 57 | } |
