Lines Matching refs:p
5 block_t *p; member
12 static inline void add_chain(Indirect *p, struct buffer_head *bh, block_t *v) in add_chain() argument
14 p->key = *(p->p = v); in add_chain()
15 p->bh = bh; in add_chain()
20 while (from <= to && from->key == *from->p) in verify_chain()
37 Indirect *p = chain; in get_branch() local
43 if (!p->key) in get_branch()
46 bh = sb_bread(sb, block_to_cpu(p->key)); in get_branch()
50 if (!verify_chain(chain, p)) in get_branch()
52 add_chain(++p, bh, (block_t *)bh->b_data + *++offsets); in get_branch()
54 if (!p->key) in get_branch()
67 return p; in get_branch()
91 branch[n].p = (block_t*) bh->b_data + offsets[n]; in alloc_branch()
92 *branch[n].p = branch[n].key; in alloc_branch()
119 if (!verify_chain(chain, where-1) || *where->p) in splice_branch()
122 *where->p = where->key; in splice_branch()
209 static inline int all_zeroes(block_t *p, block_t *q) in all_zeroes() argument
211 while (p < q) in all_zeroes()
212 if (*p++) in all_zeroes()
223 Indirect *partial, *p; in find_shared() local
234 if (!partial->key && *partial->p) { in find_shared()
238 for (p=partial;p>chain && all_zeroes((block_t*)p->bh->b_data,p->p);p--) in find_shared()
240 if (p == chain + k - 1 && p > chain) { in find_shared()
241 p->p--; in find_shared()
243 *top = *p->p; in find_shared()
244 *p->p = 0; in find_shared()
248 while(partial > p) in find_shared()
257 static inline void free_data(struct inode *inode, block_t *p, block_t *q) in free_data() argument
261 for ( ; p < q ; p++) { in free_data()
262 nr = block_to_cpu(*p); in free_data()
264 *p = 0; in free_data()
270 static void free_branches(struct inode *inode, block_t *p, block_t *q, int depth) in free_branches() argument
276 for ( ; p < q ; p++) { in free_branches()
277 nr = block_to_cpu(*p); in free_branches()
280 *p = 0; in free_branches()
291 free_data(inode, p, q); in free_branches()
330 free_branches(inode, partial->p + 1, block_end(partial->bh), in truncate()