blob: 78e2d93e5c830f33cc370d8ca98262fcfe27e883 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#include <linux/buffer_head.h>
2#include "minix.h"
3
4enum {DIRECT = 7, DEPTH = 4}; /* Have triple indirect */
5
6typedef u32 block_t; /* 32 bit, host order */
7
8static inline unsigned long block_to_cpu(block_t n)
9{
10 return n;
11}
12
13static inline block_t cpu_to_block(unsigned long n)
14{
15 return n;
16}
17
18static inline block_t *i_data(struct inode *inode)
19{
20 return (block_t *)minix_i(inode)->u.i2_data;
21}
22
Erik van der Kouwe0ab76202010-05-26 12:03:23 +020023#define DIRCOUNT 7
24#define INDIRCOUNT(sb) (1 << ((sb)->s_blocksize_bits - 2))
25
Linus Torvalds1da177e2005-04-16 15:20:36 -070026static int block_to_path(struct inode * inode, long block, int offsets[DEPTH])
27{
28 int n = 0;
Eric Sandeenf44ec6f2007-10-16 23:27:15 -070029 char b[BDEVNAME_SIZE];
Andries Brouwer939b00d2007-02-12 00:52:49 -080030 struct super_block *sb = inode->i_sb;
Linus Torvalds1da177e2005-04-16 15:20:36 -070031
32 if (block < 0) {
Eric Sandeenf44ec6f2007-10-16 23:27:15 -070033 printk("MINIX-fs: block_to_path: block %ld < 0 on dev %s\n",
34 block, bdevname(sb->s_bdev, b));
Vladimir Serbinenko6ed6a722012-07-30 14:42:00 -070035 } else if ((u64)block * (u64)sb->s_blocksize >=
36 minix_sb(sb)->s_max_size) {
Eric Sandeenf44ec6f2007-10-16 23:27:15 -070037 if (printk_ratelimit())
38 printk("MINIX-fs: block_to_path: "
39 "block %ld too big on dev %s\n",
40 block, bdevname(sb->s_bdev, b));
Erik van der Kouwe0ab76202010-05-26 12:03:23 +020041 } else if (block < DIRCOUNT) {
Linus Torvalds1da177e2005-04-16 15:20:36 -070042 offsets[n++] = block;
Erik van der Kouwe0ab76202010-05-26 12:03:23 +020043 } else if ((block -= DIRCOUNT) < INDIRCOUNT(sb)) {
44 offsets[n++] = DIRCOUNT;
Linus Torvalds1da177e2005-04-16 15:20:36 -070045 offsets[n++] = block;
Erik van der Kouwe0ab76202010-05-26 12:03:23 +020046 } else if ((block -= INDIRCOUNT(sb)) < INDIRCOUNT(sb) * INDIRCOUNT(sb)) {
47 offsets[n++] = DIRCOUNT + 1;
48 offsets[n++] = block / INDIRCOUNT(sb);
49 offsets[n++] = block % INDIRCOUNT(sb);
Linus Torvalds1da177e2005-04-16 15:20:36 -070050 } else {
Erik van der Kouwe0ab76202010-05-26 12:03:23 +020051 block -= INDIRCOUNT(sb) * INDIRCOUNT(sb);
52 offsets[n++] = DIRCOUNT + 2;
53 offsets[n++] = (block / INDIRCOUNT(sb)) / INDIRCOUNT(sb);
54 offsets[n++] = (block / INDIRCOUNT(sb)) % INDIRCOUNT(sb);
55 offsets[n++] = block % INDIRCOUNT(sb);
Linus Torvalds1da177e2005-04-16 15:20:36 -070056 }
57 return n;
58}
59
60#include "itree_common.c"
61
62int V2_minix_get_block(struct inode * inode, long block,
63 struct buffer_head *bh_result, int create)
64{
65 return get_block(inode, block, bh_result, create);
66}
67
68void V2_minix_truncate(struct inode * inode)
69{
70 truncate(inode);
71}
72
Andries Brouwer939b00d2007-02-12 00:52:49 -080073unsigned V2_minix_blocks(loff_t size, struct super_block *sb)
Linus Torvalds1da177e2005-04-16 15:20:36 -070074{
Andries Brouwer939b00d2007-02-12 00:52:49 -080075 return nblocks(size, sb);
Linus Torvalds1da177e2005-04-16 15:20:36 -070076}