Lines Matching refs:p

60 	sysv_zone_t     *p;  member
67 static inline void add_chain(Indirect *p, struct buffer_head *bh, sysv_zone_t *v) in add_chain() argument
69 p->key = *(p->p = v); in add_chain()
70 p->bh = bh; in add_chain()
75 while (from <= to && from->key == *from->p) in verify_chain()
92 Indirect *p = chain; in get_branch() local
97 if (!p->key) in get_branch()
100 int block = block_to_cpu(SYSV_SB(sb), p->key); in get_branch()
105 if (!verify_chain(chain, p)) in get_branch()
107 add_chain(++p, bh, (sysv_zone_t*)bh->b_data + *++offsets); in get_branch()
109 if (!p->key) in get_branch()
122 return p; in get_branch()
155 branch[n].p = (sysv_zone_t*) bh->b_data + offsets[n]; in alloc_branch()
156 *branch[n].p = branch[n].key; in alloc_branch()
181 if (!verify_chain(chain, where-1) || *where->p) in splice_branch()
183 *where->p = where->key; in splice_branch()
271 static inline int all_zeroes(sysv_zone_t *p, sysv_zone_t *q) in all_zeroes() argument
273 while (p < q) in all_zeroes()
274 if (*p++) in all_zeroes()
285 Indirect *partial, *p; in find_shared() local
300 if (!partial->key && *partial->p) { in find_shared()
304 for (p=partial; p>chain && all_zeroes((sysv_zone_t*)p->bh->b_data,p->p); p--) in find_shared()
312 if (p == chain + k - 1 && p > chain) { in find_shared()
313 p->p--; in find_shared()
315 *top = *p->p; in find_shared()
316 *p->p = 0; in find_shared()
320 while (partial > p) { in find_shared()
328 static inline void free_data(struct inode *inode, sysv_zone_t *p, sysv_zone_t *q) in free_data() argument
330 for ( ; p < q ; p++) { in free_data()
331 sysv_zone_t nr = *p; in free_data()
333 *p = 0; in free_data()
340 static void free_branches(struct inode *inode, sysv_zone_t *p, sysv_zone_t *q, int depth) in free_branches() argument
346 for ( ; p < q ; p++) { in free_branches()
348 sysv_zone_t nr = *p; in free_branches()
351 *p = 0; in free_branches()
363 free_data(inode, p, q); in free_branches()
407 free_branches(inode, partial->p + 1, block_end(partial->bh), in sysv_truncate()