62 lines
1.2 KiB
C
62 lines
1.2 KiB
C
|
#include <linux/buffer_head.h>
|
||
|
|
#include "minix.h"
|
||
|
|
|
||
|
|
enum {DEPTH = 3, DIRECT = 7}; /* Only double indirect */
|
||
|
|
|
||
|
|
typedef u16 block_t; /* 16 bit, host order */
|
||
|
|
|
||
|
|
static inline unsigned long block_to_cpu(block_t n)
|
||
|
|
{
|
||
|
|
return n;
|
||
|
|
}
|
||
|
|
|
||
|
|
static inline block_t cpu_to_block(unsigned long n)
|
||
|
|
{
|
||
|
|
return n;
|
||
|
|
}
|
||
|
|
|
||
|
|
static inline block_t *i_data(struct inode *inode)
|
||
|
|
{
|
||
|
|
return (block_t *)minix_i(inode)->u.i1_data;
|
||
|
|
}
|
||
|
|
|
||
|
|
static int block_to_path(struct inode * inode, long block, int offsets[DEPTH])
|
||
|
|
{
|
||
|
|
int n = 0;
|
||
|
|
|
||
|
|
if (block < 0) {
|
||
|
|
printk("minix_bmap: block<0");
|
||
|
|
} else if (block >= (minix_sb(inode->i_sb)->s_max_size/BLOCK_SIZE)) {
|
||
|
|
printk("minix_bmap: block>big");
|
||
|
|
} else if (block < 7) {
|
||
|
|
offsets[n++] = block;
|
||
|
|
} else if ((block -= 7) < 512) {
|
||
|
|
offsets[n++] = 7;
|
||
|
|
offsets[n++] = block;
|
||
|
|
} else {
|
||
|
|
block -= 512;
|
||
|
|
offsets[n++] = 8;
|
||
|
|
offsets[n++] = block>>9;
|
||
|
|
offsets[n++] = block & 511;
|
||
|
|
}
|
||
|
|
return n;
|
||
|
|
}
|
||
|
|
|
||
|
|
#include "itree_common.c"
|
||
|
|
|
||
|
|
int V1_minix_get_block(struct inode * inode, long block,
|
||
|
|
struct buffer_head *bh_result, int create)
|
||
|
|
{
|
||
|
|
return get_block(inode, block, bh_result, create);
|
||
|
|
}
|
||
|
|
|
||
|
|
void V1_minix_truncate(struct inode * inode)
|
||
|
|
{
|
||
|
|
truncate(inode);
|
||
|
|
}
|
||
|
|
|
||
|
|
unsigned V1_minix_blocks(loff_t size)
|
||
|
|
{
|
||
|
|
return nblocks(size);
|
||
|
|
}
|