5 	block_t	*p;
6 	block_t	key;
12 static inline void add_chain(Indirect *p, struct buffer_head *bh, block_t *v)  in add_chain()
25 static inline block_t *block_end(struct buffer_head *bh)  in block_end()
27 	return (block_t *)((char*)bh->b_data + bh->b_size);  in block_end()
52 		add_chain(++p, bh, (block_t *)bh->b_data + *++offsets);  in get_branch()
97 		branch[n].p = (block_t*) bh->b_data + offsets[n];  in alloc_branch()
215 static inline int all_zeroes(block_t *p, block_t *q)  in all_zeroes()
227 				block_t *top)  in find_shared()
244 	for (p=partial;p>chain && all_zeroes((block_t*)p->bh->b_data,p->p);p--)  in find_shared()
263 static inline void free_data(struct inode *inode, block_t *p, block_t *q)  in free_data()
276 static void free_branches(struct inode *inode, block_t *p, block_t *q, int depth)  in free_branches()
290 			free_branches(inode, (block_t*)bh->b_data,  in free_branches()
303 	block_t *idata = i_data(inode);  in truncate()
307 	block_t nr = 0;  in truncate()
365 		blocks += sb->s_blocksize/sizeof(block_t) - 1;  in nblocks()
366 		blocks /= sb->s_blocksize/sizeof(block_t);  in nblocks()