xref: /OK3568_Linux_fs/kernel/fs/minix/itree_v1.c (revision 4882a59341e53eb6f0b4789bf948001014eff981)
1*4882a593Smuzhiyun // SPDX-License-Identifier: GPL-2.0
2*4882a593Smuzhiyun #include <linux/buffer_head.h>
3*4882a593Smuzhiyun #include <linux/slab.h>
4*4882a593Smuzhiyun #include "minix.h"
5*4882a593Smuzhiyun 
6*4882a593Smuzhiyun enum {DEPTH = 3, DIRECT = 7};	/* Only double indirect */
7*4882a593Smuzhiyun 
8*4882a593Smuzhiyun typedef u16 block_t;	/* 16 bit, host order */
9*4882a593Smuzhiyun 
block_to_cpu(block_t n)10*4882a593Smuzhiyun static inline unsigned long block_to_cpu(block_t n)
11*4882a593Smuzhiyun {
12*4882a593Smuzhiyun 	return n;
13*4882a593Smuzhiyun }
14*4882a593Smuzhiyun 
cpu_to_block(unsigned long n)15*4882a593Smuzhiyun static inline block_t cpu_to_block(unsigned long n)
16*4882a593Smuzhiyun {
17*4882a593Smuzhiyun 	return n;
18*4882a593Smuzhiyun }
19*4882a593Smuzhiyun 
i_data(struct inode * inode)20*4882a593Smuzhiyun static inline block_t *i_data(struct inode *inode)
21*4882a593Smuzhiyun {
22*4882a593Smuzhiyun 	return (block_t *)minix_i(inode)->u.i1_data;
23*4882a593Smuzhiyun }
24*4882a593Smuzhiyun 
block_to_path(struct inode * inode,long block,int offsets[DEPTH])25*4882a593Smuzhiyun static int block_to_path(struct inode * inode, long block, int offsets[DEPTH])
26*4882a593Smuzhiyun {
27*4882a593Smuzhiyun 	int n = 0;
28*4882a593Smuzhiyun 
29*4882a593Smuzhiyun 	if (block < 0) {
30*4882a593Smuzhiyun 		printk("MINIX-fs: block_to_path: block %ld < 0 on dev %pg\n",
31*4882a593Smuzhiyun 			block, inode->i_sb->s_bdev);
32*4882a593Smuzhiyun 		return 0;
33*4882a593Smuzhiyun 	}
34*4882a593Smuzhiyun 	if ((u64)block * BLOCK_SIZE >= inode->i_sb->s_maxbytes)
35*4882a593Smuzhiyun 		return 0;
36*4882a593Smuzhiyun 
37*4882a593Smuzhiyun 	if (block < 7) {
38*4882a593Smuzhiyun 		offsets[n++] = block;
39*4882a593Smuzhiyun 	} else if ((block -= 7) < 512) {
40*4882a593Smuzhiyun 		offsets[n++] = 7;
41*4882a593Smuzhiyun 		offsets[n++] = block;
42*4882a593Smuzhiyun 	} else {
43*4882a593Smuzhiyun 		block -= 512;
44*4882a593Smuzhiyun 		offsets[n++] = 8;
45*4882a593Smuzhiyun 		offsets[n++] = block>>9;
46*4882a593Smuzhiyun 		offsets[n++] = block & 511;
47*4882a593Smuzhiyun 	}
48*4882a593Smuzhiyun 	return n;
49*4882a593Smuzhiyun }
50*4882a593Smuzhiyun 
51*4882a593Smuzhiyun #include "itree_common.c"
52*4882a593Smuzhiyun 
V1_minix_get_block(struct inode * inode,long block,struct buffer_head * bh_result,int create)53*4882a593Smuzhiyun int V1_minix_get_block(struct inode * inode, long block,
54*4882a593Smuzhiyun 			struct buffer_head *bh_result, int create)
55*4882a593Smuzhiyun {
56*4882a593Smuzhiyun 	return get_block(inode, block, bh_result, create);
57*4882a593Smuzhiyun }
58*4882a593Smuzhiyun 
V1_minix_truncate(struct inode * inode)59*4882a593Smuzhiyun void V1_minix_truncate(struct inode * inode)
60*4882a593Smuzhiyun {
61*4882a593Smuzhiyun 	truncate(inode);
62*4882a593Smuzhiyun }
63*4882a593Smuzhiyun 
V1_minix_blocks(loff_t size,struct super_block * sb)64*4882a593Smuzhiyun unsigned V1_minix_blocks(loff_t size, struct super_block *sb)
65*4882a593Smuzhiyun {
66*4882a593Smuzhiyun 	return nblocks(size, sb);
67*4882a593Smuzhiyun }
68