block_t 4 fs/minix/itree_common.c block_t *p; block_t 5 fs/minix/itree_common.c block_t key; block_t 11 fs/minix/itree_common.c static inline void add_chain(Indirect *p, struct buffer_head *bh, block_t *v) block_t 24 fs/minix/itree_common.c static inline block_t *block_end(struct buffer_head *bh) block_t 26 fs/minix/itree_common.c return (block_t *)((char*)bh->b_data + bh->b_size); block_t 51 fs/minix/itree_common.c add_chain(++p, bh, (block_t *)bh->b_data + *++offsets); block_t 90 fs/minix/itree_common.c branch[n].p = (block_t*) bh->b_data + offsets[n]; block_t 208 fs/minix/itree_common.c static inline int all_zeroes(block_t *p, block_t *q) block_t 220 fs/minix/itree_common.c block_t *top) block_t 237 fs/minix/itree_common.c for (p=partial;p>chain && all_zeroes((block_t*)p->bh->b_data,p->p);p--) block_t 256 fs/minix/itree_common.c static inline void free_data(struct inode *inode, block_t *p, block_t *q) block_t 269 fs/minix/itree_common.c static void free_branches(struct inode *inode, block_t *p, block_t *q, int depth) block_t 283 fs/minix/itree_common.c free_branches(inode, (block_t*)bh->b_data, block_t 296 fs/minix/itree_common.c block_t *idata = i_data(inode); block_t 300 fs/minix/itree_common.c block_t nr = 0; block_t 358 fs/minix/itree_common.c blocks += sb->s_blocksize/sizeof(block_t) - 1; block_t 359 fs/minix/itree_common.c blocks /= sb->s_blocksize/sizeof(block_t); block_t 8 fs/minix/itree_v1.c static inline unsigned long block_to_cpu(block_t n) block_t 13 fs/minix/itree_v1.c static inline block_t cpu_to_block(unsigned long n) block_t 18 fs/minix/itree_v1.c static inline block_t *i_data(struct inode *inode) block_t 20 fs/minix/itree_v1.c return (block_t *)minix_i(inode)->u.i1_data; block_t 8 fs/minix/itree_v2.c static inline unsigned long block_to_cpu(block_t n) block_t 13 fs/minix/itree_v2.c static inline block_t cpu_to_block(unsigned long n) block_t 18 fs/minix/itree_v2.c static inline block_t *i_data(struct inode *inode) block_t 20 fs/minix/itree_v2.c return (block_t *)minix_i(inode)->u.i2_data;