/fs/jffs2/ |
D | compr_rubin.c | 42 struct pushpull pp; member 47 static inline void init_pushpull(struct pushpull *pp, char *buf, in init_pushpull() argument 51 pp->buf = buf; in init_pushpull() 52 pp->buflen = buflen; in init_pushpull() 53 pp->ofs = ofs; in init_pushpull() 54 pp->reserve = reserve; in init_pushpull() 57 static inline int pushbit(struct pushpull *pp, int bit, int use_reserved) in pushbit() argument 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() [all …]
|
/fs/freevxfs/ |
D | vxfs_lookup.c | 68 struct page *pp; in vxfs_find_entry() local 72 pp = vxfs_get_page(ip->i_mapping, pos >> PAGE_SHIFT); in vxfs_find_entry() 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 138 de = vxfs_find_entry(dip, dp, &pp); in vxfs_inode_by_name() 141 kunmap(pp); in vxfs_inode_by_name() 142 put_page(pp); in vxfs_inode_by_name() [all …]
|
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()
|
D | vxfs_inode.c | 188 struct page *pp; in __vxfs_iget() local 192 pp = vxfs_get_page(ilistp->i_mapping, ino * VXFS_ISIZE / PAGE_SIZE); in __vxfs_iget() 194 if (!IS_ERR(pp)) { in __vxfs_iget() 196 caddr_t kaddr = (char *)page_address(pp); in __vxfs_iget() 204 vxfs_put_page(pp); in __vxfs_iget() 209 pp, (unsigned long)ino); in __vxfs_iget() 210 return PTR_ERR(pp); in __vxfs_iget()
|
/fs/afs/ |
D | volume.c | 22 struct rb_node *parent = NULL, **pp; in afs_insert_volume_into_cell() local 26 pp = &cell->volumes.rb_node; in afs_insert_volume_into_cell() 27 while (*pp) { in afs_insert_volume_into_cell() 28 parent = *pp; in afs_insert_volume_into_cell() 31 pp = &(*pp)->rb_left; in afs_insert_volume_into_cell() 33 pp = &(*pp)->rb_right; in afs_insert_volume_into_cell() 45 rb_link_node_rcu(&volume->cell_node, parent, pp); in afs_insert_volume_into_cell()
|
D | server.c | 144 struct rb_node **pp, *p; in afs_install_server() local 152 pp = &net->fs_servers.rb_node; in afs_install_server() 154 while (*pp) { in afs_install_server() 155 p = *pp; in afs_install_server() 160 pp = &(*pp)->rb_left; in afs_install_server() 162 pp = &(*pp)->rb_right; in afs_install_server() 186 rb_link_node(&server->uuid_rb, p, pp); in afs_install_server()
|
D | cell.c | 239 struct rb_node *parent, **pp; in afs_lookup_cell() local 269 pp = &net->cells.rb_node; in afs_lookup_cell() 271 while (*pp) { in afs_lookup_cell() 272 parent = *pp; in afs_lookup_cell() 280 pp = &(*pp)->rb_left; in afs_lookup_cell() 282 pp = &(*pp)->rb_right; in afs_lookup_cell() 291 rb_link_node_rcu(&cell->net_node, parent, pp); in afs_lookup_cell()
|
/fs/hpfs/ |
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/scrub/ |
D | btree.c | 269 union xfs_btree_ptr *pp; in xchk_btree_block_check_sibling() local 307 pp = xfs_btree_ptr_addr(ncur, ncur->bc_levels[level + 1].ptr, pblock); in xchk_btree_block_check_sibling() 308 if (!xchk_btree_ptr_ok(bs, level + 1, pp)) in xchk_btree_block_check_sibling() 313 if (xfs_btree_diff_two_ptrs(cur, pp, sibling)) in xchk_btree_block_check_sibling() 589 union xfs_btree_ptr *pp, in xchk_btree_get_block() argument 599 error = xfs_btree_lookup_get_block(bs->cur, level, pp, pblock); in xchk_btree_get_block() 699 union xfs_btree_ptr *pp; in xchk_btree() local 790 pp = xfs_btree_ptr_addr(cur, cur->bc_levels[level].ptr, block); in xchk_btree() 791 if (!xchk_btree_ptr_ok(bs, level, pp)) { in xchk_btree() 796 error = xchk_btree_get_block(bs, level, pp, &block, &bp); in xchk_btree()
|
/fs/xfs/libxfs/ |
D | xfs_btree.c | 1793 const union xfs_btree_ptr *pp, /* ptr to btree block */ in xfs_btree_lookup_get_block() argument 1814 error = xfs_btree_ptr_to_daddr(cur, pp, &daddr); in xfs_btree_lookup_get_block() 1822 error = xfs_btree_read_buf_block(cur, pp, 0, blkp, &bp); in xfs_btree_lookup_get_block() 1889 union xfs_btree_ptr *pp; /* ptr to btree block */ in xfs_btree_lookup() local 1903 pp = &ptr; in xfs_btree_lookup() 1913 error = xfs_btree_lookup_get_block(cur, level, pp, &block); in xfs_btree_lookup() 1988 pp = xfs_btree_ptr_addr(cur, keyno, block); in xfs_btree_lookup() 1990 error = xfs_btree_debug_check_ptr(cur, pp, 0, level); in xfs_btree_lookup() 2983 union xfs_btree_ptr *pp; /* pointer to block addr */ in xfs_btree_new_iroot() local 2996 pp = xfs_btree_ptr_addr(cur, 1, block); in xfs_btree_new_iroot() [all …]
|
D | xfs_bmap.c | 267 __be64 *pp, *thispa; /* pointer to block address */ in xfs_check_block() local 287 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, i, sz); in xfs_check_block() 289 pp = XFS_BMBT_PTR_ADDR(mp, block, i, dmxr); in xfs_check_block() 296 if (*thispa == *pp) { in xfs_check_block() 329 __be64 *pp; /* pointer to block address */ in xfs_bmap_check_leaf_extents() local 350 pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, 1, ifp->if_broot_bytes); in xfs_bmap_check_leaf_extents() 351 bno = be64_to_cpu(*pp); in xfs_bmap_check_leaf_extents() 383 pp = XFS_BMBT_PTR_ADDR(mp, block, 1, mp->m_bmap_dmxr[1]); in xfs_bmap_check_leaf_extents() 384 bno = be64_to_cpu(*pp); in xfs_bmap_check_leaf_extents() 548 __be64 *pp; /* ptr to block address */ in xfs_bmap_btree_to_extents() local [all …]
|
D | xfs_btree.h | 568 const union xfs_btree_ptr *pp, struct xfs_btree_block **blkp);
|
/fs/fuse/ |
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/ |
D | jfs_dmap.c | 2866 int lp, pp, k; in dbAdjTree() local 2898 pp = (lp - 1) >> 2; in dbAdjTree() 2907 if (tp->dmt_stree[pp] == max) in dbAdjTree() 2912 tp->dmt_stree[pp] = max; in dbAdjTree() 2916 lp = pp; in dbAdjTree()
|
D | jfs_dtree.c | 1643 dtpage_t *sp, *pp; in dtExtendPage() local 1668 DT_GETPAGE(ip, parent->bn, pmp, PSIZE, pp, rc); in dtExtendPage() 1844 tpxd = (pxd_t *) & pp->slot[1]; in dtExtendPage()
|