1*4882a593Smuzhiyun /* SPDX-License-Identifier: GPL-2.0 */ 2*4882a593Smuzhiyun /* 3*4882a593Smuzhiyun * Copyright (c) 2000,2002-2003,2005 Silicon Graphics, Inc. 4*4882a593Smuzhiyun * Copyright (c) 2013 Red Hat, Inc. 5*4882a593Smuzhiyun * All Rights Reserved. 6*4882a593Smuzhiyun */ 7*4882a593Smuzhiyun #ifndef __XFS_ATTR_LEAF_H__ 8*4882a593Smuzhiyun #define __XFS_ATTR_LEAF_H__ 9*4882a593Smuzhiyun 10*4882a593Smuzhiyun struct attrlist; 11*4882a593Smuzhiyun struct xfs_attr_list_context; 12*4882a593Smuzhiyun struct xfs_da_args; 13*4882a593Smuzhiyun struct xfs_da_state; 14*4882a593Smuzhiyun struct xfs_da_state_blk; 15*4882a593Smuzhiyun struct xfs_inode; 16*4882a593Smuzhiyun struct xfs_trans; 17*4882a593Smuzhiyun 18*4882a593Smuzhiyun /* 19*4882a593Smuzhiyun * Incore version of the attribute leaf header. 20*4882a593Smuzhiyun */ 21*4882a593Smuzhiyun struct xfs_attr3_icleaf_hdr { 22*4882a593Smuzhiyun uint32_t forw; 23*4882a593Smuzhiyun uint32_t back; 24*4882a593Smuzhiyun uint16_t magic; 25*4882a593Smuzhiyun uint16_t count; 26*4882a593Smuzhiyun uint16_t usedbytes; 27*4882a593Smuzhiyun /* 28*4882a593Smuzhiyun * Firstused is 32-bit here instead of 16-bit like the on-disk variant 29*4882a593Smuzhiyun * to support maximum fsb size of 64k without overflow issues throughout 30*4882a593Smuzhiyun * the attr code. Instead, the overflow condition is handled on 31*4882a593Smuzhiyun * conversion to/from disk. 32*4882a593Smuzhiyun */ 33*4882a593Smuzhiyun uint32_t firstused; 34*4882a593Smuzhiyun __u8 holes; 35*4882a593Smuzhiyun struct { 36*4882a593Smuzhiyun uint16_t base; 37*4882a593Smuzhiyun uint16_t size; 38*4882a593Smuzhiyun } freemap[XFS_ATTR_LEAF_MAPSIZE]; 39*4882a593Smuzhiyun }; 40*4882a593Smuzhiyun 41*4882a593Smuzhiyun /*======================================================================== 42*4882a593Smuzhiyun * Function prototypes for the kernel. 43*4882a593Smuzhiyun *========================================================================*/ 44*4882a593Smuzhiyun 45*4882a593Smuzhiyun /* 46*4882a593Smuzhiyun * Internal routines when attribute fork size < XFS_LITINO(mp). 47*4882a593Smuzhiyun */ 48*4882a593Smuzhiyun void xfs_attr_shortform_create(struct xfs_da_args *args); 49*4882a593Smuzhiyun void xfs_attr_shortform_add(struct xfs_da_args *args, int forkoff); 50*4882a593Smuzhiyun int xfs_attr_shortform_lookup(struct xfs_da_args *args); 51*4882a593Smuzhiyun int xfs_attr_shortform_getvalue(struct xfs_da_args *args); 52*4882a593Smuzhiyun int xfs_attr_shortform_to_leaf(struct xfs_da_args *args, 53*4882a593Smuzhiyun struct xfs_buf **leaf_bp); 54*4882a593Smuzhiyun int xfs_attr_shortform_remove(struct xfs_da_args *args); 55*4882a593Smuzhiyun int xfs_attr_sf_findname(struct xfs_da_args *args, 56*4882a593Smuzhiyun struct xfs_attr_sf_entry **sfep, 57*4882a593Smuzhiyun unsigned int *basep); 58*4882a593Smuzhiyun int xfs_attr_shortform_allfit(struct xfs_buf *bp, struct xfs_inode *dp); 59*4882a593Smuzhiyun int xfs_attr_shortform_bytesfit(struct xfs_inode *dp, int bytes); 60*4882a593Smuzhiyun xfs_failaddr_t xfs_attr_shortform_verify(struct xfs_inode *ip); 61*4882a593Smuzhiyun void xfs_attr_fork_remove(struct xfs_inode *ip, struct xfs_trans *tp); 62*4882a593Smuzhiyun 63*4882a593Smuzhiyun /* 64*4882a593Smuzhiyun * Internal routines when attribute fork size == XFS_LBSIZE(mp). 65*4882a593Smuzhiyun */ 66*4882a593Smuzhiyun int xfs_attr3_leaf_to_node(struct xfs_da_args *args); 67*4882a593Smuzhiyun int xfs_attr3_leaf_to_shortform(struct xfs_buf *bp, 68*4882a593Smuzhiyun struct xfs_da_args *args, int forkoff); 69*4882a593Smuzhiyun int xfs_attr3_leaf_clearflag(struct xfs_da_args *args); 70*4882a593Smuzhiyun int xfs_attr3_leaf_setflag(struct xfs_da_args *args); 71*4882a593Smuzhiyun int xfs_attr3_leaf_flipflags(struct xfs_da_args *args); 72*4882a593Smuzhiyun 73*4882a593Smuzhiyun /* 74*4882a593Smuzhiyun * Routines used for growing the Btree. 75*4882a593Smuzhiyun */ 76*4882a593Smuzhiyun int xfs_attr3_leaf_split(struct xfs_da_state *state, 77*4882a593Smuzhiyun struct xfs_da_state_blk *oldblk, 78*4882a593Smuzhiyun struct xfs_da_state_blk *newblk); 79*4882a593Smuzhiyun int xfs_attr3_leaf_lookup_int(struct xfs_buf *leaf, 80*4882a593Smuzhiyun struct xfs_da_args *args); 81*4882a593Smuzhiyun int xfs_attr3_leaf_getvalue(struct xfs_buf *bp, struct xfs_da_args *args); 82*4882a593Smuzhiyun int xfs_attr3_leaf_add(struct xfs_buf *leaf_buffer, 83*4882a593Smuzhiyun struct xfs_da_args *args); 84*4882a593Smuzhiyun int xfs_attr3_leaf_remove(struct xfs_buf *leaf_buffer, 85*4882a593Smuzhiyun struct xfs_da_args *args); 86*4882a593Smuzhiyun int xfs_attr3_leaf_list_int(struct xfs_buf *bp, 87*4882a593Smuzhiyun struct xfs_attr_list_context *context); 88*4882a593Smuzhiyun 89*4882a593Smuzhiyun /* 90*4882a593Smuzhiyun * Routines used for shrinking the Btree. 91*4882a593Smuzhiyun */ 92*4882a593Smuzhiyun int xfs_attr3_leaf_toosmall(struct xfs_da_state *state, int *retval); 93*4882a593Smuzhiyun void xfs_attr3_leaf_unbalance(struct xfs_da_state *state, 94*4882a593Smuzhiyun struct xfs_da_state_blk *drop_blk, 95*4882a593Smuzhiyun struct xfs_da_state_blk *save_blk); 96*4882a593Smuzhiyun /* 97*4882a593Smuzhiyun * Utility routines. 98*4882a593Smuzhiyun */ 99*4882a593Smuzhiyun xfs_dahash_t xfs_attr_leaf_lasthash(struct xfs_buf *bp, int *count); 100*4882a593Smuzhiyun int xfs_attr_leaf_order(struct xfs_buf *leaf1_bp, 101*4882a593Smuzhiyun struct xfs_buf *leaf2_bp); 102*4882a593Smuzhiyun int xfs_attr_leaf_newentsize(struct xfs_da_args *args, int *local); 103*4882a593Smuzhiyun int xfs_attr3_leaf_read(struct xfs_trans *tp, struct xfs_inode *dp, 104*4882a593Smuzhiyun xfs_dablk_t bno, struct xfs_buf **bpp); 105*4882a593Smuzhiyun void xfs_attr3_leaf_hdr_from_disk(struct xfs_da_geometry *geo, 106*4882a593Smuzhiyun struct xfs_attr3_icleaf_hdr *to, 107*4882a593Smuzhiyun struct xfs_attr_leafblock *from); 108*4882a593Smuzhiyun void xfs_attr3_leaf_hdr_to_disk(struct xfs_da_geometry *geo, 109*4882a593Smuzhiyun struct xfs_attr_leafblock *to, 110*4882a593Smuzhiyun struct xfs_attr3_icleaf_hdr *from); 111*4882a593Smuzhiyun 112*4882a593Smuzhiyun #endif /* __XFS_ATTR_LEAF_H__ */ 113