4 	block_t	*p;  member
11 static inline void add_chain(Indirect *p, struct buffer_head *bh, block_t *v)  in add_chain()  argument
13 	p->key = *(p->p = v);  in add_chain()
14 	p->bh = bh;  in add_chain()
19 	while (from <= to && from->key == *from->p)  in verify_chain()
36 	Indirect *p = chain;  in get_branch()  local
42 	if (!p->key)  in get_branch()
45 		bh = sb_bread(sb, block_to_cpu(p->key));  in get_branch()
49 		if (!verify_chain(chain, p))  in get_branch()
51 		add_chain(++p, bh, (block_t *)bh->b_data + *++offsets);  in get_branch()
53 		if (!p->key)  in get_branch()
66 	return p;  in get_branch()
90 		branch[n].p = (block_t*) bh->b_data + offsets[n];  in alloc_branch()
91 		*branch[n].p = branch[n].key;  in alloc_branch()
118 	if (!verify_chain(chain, where-1) || *where->p)  in splice_branch()
121 	*where->p = where->key;  in splice_branch()
208 static inline int all_zeroes(block_t *p, block_t *q)  in all_zeroes()  argument
210 	while (p < q)  in all_zeroes()
211 		if (*p++)  in all_zeroes()
222 	Indirect *partial, *p;  in find_shared()  local
233 	if (!partial->key && *partial->p) {  in find_shared()
237 	for (p=partial;p>chain && all_zeroes((block_t*)p->bh->b_data,p->p);p--)  in find_shared()
239 	if (p == chain + k - 1 && p > chain) {  in find_shared()
240 		p->p--;  in find_shared()
242 		*top = *p->p;  in find_shared()
243 		*p->p = 0;  in find_shared()
247 	while(partial > p)  in find_shared()
256 static inline void free_data(struct inode *inode, block_t *p, block_t *q)  in free_data()  argument
260 	for ( ; p < q ; p++) {  in free_data()
261 		nr = block_to_cpu(*p);  in free_data()
263 			*p = 0;  in free_data()
269 static void free_branches(struct inode *inode, block_t *p, block_t *q, int depth)  in free_branches()  argument
275 		for ( ; p < q ; p++) {  in free_branches()
276 			nr = block_to_cpu(*p);  in free_branches()
279 			*p = 0;  in free_branches()
290 		free_data(inode, p, q);  in free_branches()
329 		free_branches(inode, partial->p + 1, block_end(partial->bh),  in truncate()