| /fs/xfs/scrub/ |
| A D | parent.c | 302 struct xchk_pptrs *pp) in xchk_parent_pptr_and_dotdot() argument
498 pp->pptrs_found++; in xchk_parent_scan_attr()
660 error = xchk_parent_slow_pptr(pp, &pp->xname, &pptr.pptr_rec); in xchk_parent_finish_slow_pptrs()
694 pp->pptrs_found++; in xchk_parent_count_pptr()
717 NULL, pp); in xchk_parent_count_pptrs()
729 pp->pptrs_found++; in xchk_parent_count_pptrs()
743 pp->pptrs_found++; in xchk_parent_count_pptrs()
762 if (!pp) in xchk_parent_pptr()
764 pp->sc = sc; in xchk_parent_pptr()
765 pp->xname.name = pp->namebuf; in xchk_parent_pptr()
[all …]
|
| A D | btree.c | 265 union xfs_btree_ptr *pp; in xchk_btree_block_check_sibling() local
303 pp = xfs_btree_ptr_addr(ncur, ncur->bc_levels[level + 1].ptr, pblock); in xchk_btree_block_check_sibling()
304 if (!xchk_btree_ptr_ok(bs, level + 1, pp)) in xchk_btree_block_check_sibling()
309 if (xfs_btree_cmp_two_ptrs(cur, pp, sibling)) in xchk_btree_block_check_sibling()
583 union xfs_btree_ptr *pp, in xchk_btree_get_block() argument
592 error = xfs_btree_lookup_get_block(bs->cur, level, pp, pblock); in xchk_btree_get_block()
686 union xfs_btree_ptr *pp; in xchk_btree() local
777 pp = xfs_btree_ptr_addr(cur, cur->bc_levels[level].ptr, block); in xchk_btree()
778 if (!xchk_btree_ptr_ok(bs, level, pp)) { in xchk_btree()
783 error = xchk_btree_get_block(bs, level, pp, &block, &bp); in xchk_btree()
|
| /fs/jffs2/ |
| A D | compr_rubin.c | 42 struct pushpull pp; member
51 pp->buf = buf; in init_pushpull()
52 pp->buflen = buflen; in init_pushpull()
53 pp->ofs = ofs; in init_pushpull()
59 if (pp->ofs >= pp->buflen - (use_reserved?0:pp->reserve)) in pushbit()
63 pp->buf[pp->ofs >> 3] |= (1<<(7-(pp->ofs & 7))); in pushbit()
65 pp->buf[pp->ofs >> 3] &= ~(1<<(7-(pp->ofs & 7))); in pushbit()
67 pp->ofs++; in pushbit()
74 return pp->ofs; in pushedbits()
81 bit = (pp->buf[pp->ofs >> 3] >> (7-(pp->ofs & 7))) & 1; in pullbit()
[all …]
|
| /fs/freevxfs/ |
| A D | vxfs_lookup.c | 68 struct page *pp; in vxfs_find_entry() local
73 if (IS_ERR(pp)) in vxfs_find_entry()
75 kaddr = (char *)page_address(pp); in vxfs_find_entry()
105 *ppp = pp; in vxfs_find_entry()
111 vxfs_put_page(pp); in vxfs_find_entry()
135 struct page *pp; in vxfs_inode_by_name() local
141 kunmap(pp); in vxfs_inode_by_name()
142 put_page(pp); in vxfs_inode_by_name()
216 struct page *pp; in vxfs_readdir() local
222 if (IS_ERR(pp)) in vxfs_readdir()
[all …]
|
| A D | vxfs_subr.c | 26 vxfs_put_page(struct page *pp) in vxfs_put_page() argument
28 kunmap(pp); in vxfs_put_page()
29 put_page(pp); in vxfs_put_page()
46 struct page * pp; in vxfs_get_page() local
48 pp = read_mapping_page(mapping, n, NULL); in vxfs_get_page()
50 if (!IS_ERR(pp)) { in vxfs_get_page()
51 kmap(pp); in vxfs_get_page()
56 return (pp); in vxfs_get_page()
|
| A D | vxfs_inode.c | 186 struct page *pp; in __vxfs_iget() local
190 pp = vxfs_get_page(ilistp->i_mapping, ino * VXFS_ISIZE / PAGE_SIZE); in __vxfs_iget()
192 if (!IS_ERR(pp)) { in __vxfs_iget()
194 caddr_t kaddr = (char *)page_address(pp); in __vxfs_iget()
202 vxfs_put_page(pp); in __vxfs_iget()
207 pp, (unsigned long)ino); in __vxfs_iget()
208 return PTR_ERR(pp); in __vxfs_iget()
|
| /fs/afs/ |
| A D | volume.c | 25 struct rb_node *parent = NULL, **pp; in afs_insert_volume_into_cell() local
29 pp = &cell->volumes.rb_node; in afs_insert_volume_into_cell()
30 while (*pp) { in afs_insert_volume_into_cell()
31 parent = *pp; in afs_insert_volume_into_cell()
34 pp = &(*pp)->rb_left; in afs_insert_volume_into_cell()
36 pp = &(*pp)->rb_right; in afs_insert_volume_into_cell()
48 rb_link_node_rcu(&volume->cell_node, parent, pp); in afs_insert_volume_into_cell()
|
| A D | server.c | 74 struct rb_node **pp, *p; in afs_install_server() local
80 pp = &cell->fs_servers.rb_node; in afs_install_server()
82 while (*pp) { in afs_install_server()
83 p = *pp; in afs_install_server()
88 pp = &(*pp)->rb_left; in afs_install_server()
90 pp = &(*pp)->rb_right; in afs_install_server()
97 rb_link_node(&server->uuid_rb, p, pp); in afs_install_server()
|
| A D | cell.c | 246 struct rb_node *parent, **pp; in afs_lookup_cell() local
276 pp = &net->cells.rb_node; in afs_lookup_cell()
278 while (*pp) { in afs_lookup_cell()
279 parent = *pp; in afs_lookup_cell()
287 pp = &(*pp)->rb_left; in afs_lookup_cell()
289 pp = &(*pp)->rb_right; in afs_lookup_cell()
297 rb_link_node_rcu(&cell->net_node, parent, pp); in afs_lookup_cell()
|
| /fs/hpfs/ |
| A D | map.c | 269 unsigned p, pp = 0; in hpfs_map_dnode() local
287 hpfs_error(s, "bad dirent size in dnode %08x, dirent %03x, last %03x", secno, p, pp); in hpfs_map_dnode()
292 …error(s, "namelen does not match dirent size in dnode %08x, dirent %03x, last %03x", secno, p, pp); in hpfs_map_dnode()
298 hpfs_error(s, "bad down pointer in dnode %08x, dirent %03x, last %03x", secno, p, pp); in hpfs_map_dnode()
301 pp = p; in hpfs_map_dnode()
308 if (d[pp + 30] != 1 || d[pp + 31] != 255) { in hpfs_map_dnode()
|
| /fs/xfs/libxfs/ |
| A D | xfs_btree.c | 2008 pp = &ptr; in xfs_btree_lookup()
3104 union xfs_btree_ptr *pp; in xfs_btree_promote_leaf_iroot() local
3134 pp = xfs_btree_ptr_addr(cur, 1, broot); in xfs_btree_promote_leaf_iroot()
3136 xfs_btree_copy_ptrs(cur, pp, cptr, 1); in xfs_btree_promote_leaf_iroot()
3164 union xfs_btree_ptr *pp; in xfs_btree_promote_node_iroot() local
3188 pp = xfs_btree_ptr_addr(cur, 1, block); in xfs_btree_promote_node_iroot()
3204 xfs_btree_copy_ptrs(cur, pp, cptr, 1); in xfs_btree_promote_node_iroot()
3611 union xfs_btree_ptr *pp; in xfs_btree_insrec() local
3857 union xfs_btree_ptr *pp; in xfs_btree_demote_node_child() local
4148 union xfs_btree_ptr *pp; in xfs_btree_delrec() local
[all …]
|
| A D | xfs_bmap.c | 292 __be64 *pp, *thispa; /* pointer to block address */ in xfs_check_block() local
312 pp = xfs_bmap_broot_ptr_addr(mp, block, i, sz); in xfs_check_block()
314 pp = xfs_bmbt_ptr_addr(mp, block, i, dmxr); in xfs_check_block()
321 if (*thispa == *pp) { in xfs_check_block()
354 __be64 *pp; /* pointer to block address */ in xfs_bmap_check_leaf_extents() local
376 bno = be64_to_cpu(*pp); in xfs_bmap_check_leaf_extents()
409 bno = be64_to_cpu(*pp); in xfs_bmap_check_leaf_extents()
574 __be64 *pp; /* ptr to block address */ in xfs_bmap_btree_to_extents() local
589 cbno = be64_to_cpu(*pp); in xfs_bmap_btree_to_extents()
646 xfs_bmbt_ptr_t *pp; /* root block address pointer */ in xfs_bmap_extents_to_btree() local
[all …]
|
| A D | xfs_btree.h | 517 const union xfs_btree_ptr *pp, struct xfs_btree_block **blkp);
|
| /fs/fuse/ |
| A D | cuse.c | 218 static int cuse_parse_one(char **pp, char *end, char **keyp, char **valp) in cuse_parse_one() argument
220 char *p = *pp; in cuse_parse_one()
250 *pp = p; in cuse_parse_one()
|
| /fs/jfs/ |
| A D | jfs_dmap.c | 2866 int lp, pp, k; in dbAdjTree() local
2901 pp = (lp - 1) >> 2; in dbAdjTree()
2910 if (tp->dmt_stree[pp] == max) in dbAdjTree()
2915 tp->dmt_stree[pp] = max; in dbAdjTree()
2919 lp = pp; in dbAdjTree()
|
| A D | jfs_dtree.c | 1644 dtpage_t *sp, *pp; in dtExtendPage() local
1669 DT_GETPAGE(ip, parent->bn, pmp, PSIZE, pp, rc); in dtExtendPage()
1845 tpxd = (pxd_t *) & pp->slot[1]; in dtExtendPage()
|