1 /* SPDX-License-Identifier: GPL-2.0 */ 2 /* 3 * Copyright (c) 2000,2002,2005 Silicon Graphics, Inc. 4 * Copyright (c) 2013 Red Hat, Inc. 5 * All Rights Reserved. 6 */ 7 #ifndef __XFS_DA_BTREE_H__ 8 #define __XFS_DA_BTREE_H__ 9 10 struct xfs_inode; 11 struct xfs_trans; 12 13 /* 14 * Directory/attribute geometry information. There will be one of these for each 15 * data fork type, and it will be passed around via the xfs_da_args. Global 16 * structures will be attached to the xfs_mount. 17 */ 18 struct xfs_da_geometry { 19 unsigned int blksize; /* da block size in bytes */ 20 unsigned int fsbcount; /* da block size in filesystem blocks */ 21 uint8_t fsblog; /* log2 of _filesystem_ block size */ 22 uint8_t blklog; /* log2 of da block size */ 23 unsigned int node_hdr_size; /* danode header size in bytes */ 24 unsigned int node_ents; /* # of entries in a danode */ 25 unsigned int magicpct; /* 37% of block size in bytes */ 26 xfs_dablk_t datablk; /* blockno of dir data v2 */ 27 unsigned int leaf_hdr_size; /* dir2 leaf header size */ 28 unsigned int leaf_max_ents; /* # of entries in dir2 leaf */ 29 xfs_dablk_t leafblk; /* blockno of leaf data v2 */ 30 unsigned int free_hdr_size; /* dir2 free header size */ 31 unsigned int free_max_bests; /* # of bests entries in dir2 free */ 32 xfs_dablk_t freeblk; /* blockno of free data v2 */ 33 34 xfs_dir2_data_aoff_t data_first_offset; 35 size_t data_entry_offset; 36 }; 37 38 /*======================================================================== 39 * Btree searching and modification structure definitions. 40 *========================================================================*/ 41 42 /* 43 * Search comparison results 44 */ 45 enum xfs_dacmp { 46 XFS_CMP_DIFFERENT, /* names are completely different */ 47 XFS_CMP_EXACT, /* names are exactly the same */ 48 XFS_CMP_CASE /* names are same but differ in case */ 49 }; 50 51 /* 52 * Structure to ease passing around component names. 53 */ 54 typedef struct xfs_da_args { 55 struct xfs_da_geometry *geo; /* da block geometry */ 56 const uint8_t *name; /* string (maybe not NULL terminated) */ 57 int namelen; /* length of string (maybe no NULL) */ 58 uint8_t filetype; /* filetype of inode for directories */ 59 void *value; /* set of bytes (maybe contain NULLs) */ 60 int valuelen; /* length of value */ 61 unsigned int attr_filter; /* XFS_ATTR_{ROOT,SECURE,INCOMPLETE} */ 62 unsigned int attr_flags; /* XATTR_{CREATE,REPLACE} */ 63 xfs_dahash_t hashval; /* hash value of name */ 64 xfs_ino_t inumber; /* input/output inode number */ 65 struct xfs_inode *dp; /* directory inode to manipulate */ 66 struct xfs_trans *trans; /* current trans (changes over time) */ 67 xfs_extlen_t total; /* total blocks needed, for 1st bmap */ 68 int whichfork; /* data or attribute fork */ 69 xfs_dablk_t blkno; /* blkno of attr leaf of interest */ 70 int index; /* index of attr of interest in blk */ 71 xfs_dablk_t rmtblkno; /* remote attr value starting blkno */ 72 int rmtblkcnt; /* remote attr value block count */ 73 int rmtvaluelen; /* remote attr value length in bytes */ 74 xfs_dablk_t blkno2; /* blkno of 2nd attr leaf of interest */ 75 int index2; /* index of 2nd attr in blk */ 76 xfs_dablk_t rmtblkno2; /* remote attr value starting blkno */ 77 int rmtblkcnt2; /* remote attr value block count */ 78 int rmtvaluelen2; /* remote attr value length in bytes */ 79 int op_flags; /* operation flags */ 80 enum xfs_dacmp cmpresult; /* name compare result for lookups */ 81 } xfs_da_args_t; 82 83 /* 84 * Operation flags: 85 */ 86 #define XFS_DA_OP_JUSTCHECK 0x0001 /* check for ok with no space */ 87 #define XFS_DA_OP_RENAME 0x0002 /* this is an atomic rename op */ 88 #define XFS_DA_OP_ADDNAME 0x0004 /* this is an add operation */ 89 #define XFS_DA_OP_OKNOENT 0x0008 /* lookup/add op, ENOENT ok, else die */ 90 #define XFS_DA_OP_CILOOKUP 0x0010 /* lookup to return CI name if found */ 91 #define XFS_DA_OP_NOTIME 0x0020 /* don't update inode timestamps */ 92 93 #define XFS_DA_OP_FLAGS \ 94 { XFS_DA_OP_JUSTCHECK, "JUSTCHECK" }, \ 95 { XFS_DA_OP_RENAME, "RENAME" }, \ 96 { XFS_DA_OP_ADDNAME, "ADDNAME" }, \ 97 { XFS_DA_OP_OKNOENT, "OKNOENT" }, \ 98 { XFS_DA_OP_CILOOKUP, "CILOOKUP" }, \ 99 { XFS_DA_OP_NOTIME, "NOTIME" } 100 101 /* 102 * Storage for holding state during Btree searches and split/join ops. 103 * 104 * Only need space for 5 intermediate nodes. With a minimum of 62-way 105 * fanout to the Btree, we can support over 900 million directory blocks, 106 * which is slightly more than enough. 107 */ 108 typedef struct xfs_da_state_blk { 109 struct xfs_buf *bp; /* buffer containing block */ 110 xfs_dablk_t blkno; /* filesystem blkno of buffer */ 111 xfs_daddr_t disk_blkno; /* on-disk blkno (in BBs) of buffer */ 112 int index; /* relevant index into block */ 113 xfs_dahash_t hashval; /* last hash value in block */ 114 int magic; /* blk's magic number, ie: blk type */ 115 } xfs_da_state_blk_t; 116 117 typedef struct xfs_da_state_path { 118 int active; /* number of active levels */ 119 xfs_da_state_blk_t blk[XFS_DA_NODE_MAXDEPTH]; 120 } xfs_da_state_path_t; 121 122 typedef struct xfs_da_state { 123 xfs_da_args_t *args; /* filename arguments */ 124 struct xfs_mount *mp; /* filesystem mount point */ 125 xfs_da_state_path_t path; /* search/split paths */ 126 xfs_da_state_path_t altpath; /* alternate path for join */ 127 unsigned char inleaf; /* insert into 1->lf, 0->splf */ 128 unsigned char extravalid; /* T/F: extrablk is in use */ 129 unsigned char extraafter; /* T/F: extrablk is after new */ 130 xfs_da_state_blk_t extrablk; /* for double-splits on leaves */ 131 /* for dirv2 extrablk is data */ 132 } xfs_da_state_t; 133 134 /* 135 * In-core version of the node header to abstract the differences in the v2 and 136 * v3 disk format of the headers. Callers need to convert to/from disk format as 137 * appropriate. 138 */ 139 struct xfs_da3_icnode_hdr { 140 uint32_t forw; 141 uint32_t back; 142 uint16_t magic; 143 uint16_t count; 144 uint16_t level; 145 146 /* 147 * Pointer to the on-disk format entries, which are behind the 148 * variable size (v4 vs v5) header in the on-disk block. 149 */ 150 struct xfs_da_node_entry *btree; 151 }; 152 153 /* 154 * Utility macros to aid in logging changed structure fields. 155 */ 156 #define XFS_DA_LOGOFF(BASE, ADDR) ((char *)(ADDR) - (char *)(BASE)) 157 #define XFS_DA_LOGRANGE(BASE, ADDR, SIZE) \ 158 (uint)(XFS_DA_LOGOFF(BASE, ADDR)), \ 159 (uint)(XFS_DA_LOGOFF(BASE, ADDR)+(SIZE)-1) 160 161 /*======================================================================== 162 * Function prototypes. 163 *========================================================================*/ 164 165 /* 166 * Routines used for growing the Btree. 167 */ 168 int xfs_da3_node_create(struct xfs_da_args *args, xfs_dablk_t blkno, 169 int level, struct xfs_buf **bpp, int whichfork); 170 int xfs_da3_split(xfs_da_state_t *state); 171 172 /* 173 * Routines used for shrinking the Btree. 174 */ 175 int xfs_da3_join(xfs_da_state_t *state); 176 void xfs_da3_fixhashpath(struct xfs_da_state *state, 177 struct xfs_da_state_path *path_to_to_fix); 178 179 /* 180 * Routines used for finding things in the Btree. 181 */ 182 int xfs_da3_node_lookup_int(xfs_da_state_t *state, int *result); 183 int xfs_da3_path_shift(xfs_da_state_t *state, xfs_da_state_path_t *path, 184 int forward, int release, int *result); 185 /* 186 * Utility routines. 187 */ 188 int xfs_da3_blk_link(xfs_da_state_t *state, xfs_da_state_blk_t *old_blk, 189 xfs_da_state_blk_t *new_blk); 190 int xfs_da3_node_read(struct xfs_trans *tp, struct xfs_inode *dp, 191 xfs_dablk_t bno, struct xfs_buf **bpp, int whichfork); 192 int xfs_da3_node_read_mapped(struct xfs_trans *tp, struct xfs_inode *dp, 193 xfs_daddr_t mappedbno, struct xfs_buf **bpp, 194 int whichfork); 195 196 /* 197 * Utility routines. 198 */ 199 200 #define XFS_DABUF_MAP_HOLE_OK (1 << 0) 201 202 int xfs_da_grow_inode(xfs_da_args_t *args, xfs_dablk_t *new_blkno); 203 int xfs_da_grow_inode_int(struct xfs_da_args *args, xfs_fileoff_t *bno, 204 int count); 205 int xfs_da_get_buf(struct xfs_trans *trans, struct xfs_inode *dp, 206 xfs_dablk_t bno, struct xfs_buf **bp, int whichfork); 207 int xfs_da_read_buf(struct xfs_trans *trans, struct xfs_inode *dp, 208 xfs_dablk_t bno, unsigned int flags, struct xfs_buf **bpp, 209 int whichfork, const struct xfs_buf_ops *ops); 210 int xfs_da_reada_buf(struct xfs_inode *dp, xfs_dablk_t bno, 211 unsigned int flags, int whichfork, 212 const struct xfs_buf_ops *ops); 213 int xfs_da_shrink_inode(xfs_da_args_t *args, xfs_dablk_t dead_blkno, 214 struct xfs_buf *dead_buf); 215 216 uint xfs_da_hashname(const uint8_t *name_string, int name_length); 217 enum xfs_dacmp xfs_da_compname(struct xfs_da_args *args, 218 const unsigned char *name, int len); 219 220 221 struct xfs_da_state *xfs_da_state_alloc(struct xfs_da_args *args); 222 void xfs_da_state_free(xfs_da_state_t *state); 223 224 void xfs_da3_node_hdr_from_disk(struct xfs_mount *mp, 225 struct xfs_da3_icnode_hdr *to, struct xfs_da_intnode *from); 226 void xfs_da3_node_hdr_to_disk(struct xfs_mount *mp, 227 struct xfs_da_intnode *to, struct xfs_da3_icnode_hdr *from); 228 229 extern struct kmem_cache *xfs_da_state_cache; 230 231 #endif /* __XFS_DA_BTREE_H__ */ 232