Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (c) 2003-2006, Cluster File Systems, Inc, info@clusterfs.com |
| 3 | * Written by Alex Tomas <alex@clusterfs.com> |
| 4 | * |
| 5 | * This program is free software; you can redistribute it and/or modify |
| 6 | * it under the terms of the GNU General Public License version 2 as |
| 7 | * published by the Free Software Foundation. |
| 8 | * |
| 9 | * This program is distributed in the hope that it will be useful, |
| 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 12 | * GNU General Public License for more details. |
| 13 | * |
| 14 | * You should have received a copy of the GNU General Public Licens |
| 15 | * along with this program; if not, write to the Free Software |
| 16 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111- |
| 17 | */ |
| 18 | |
Christoph Hellwig | 3dcf545 | 2008-04-29 18:13:32 -0400 | [diff] [blame] | 19 | #ifndef _EXT4_EXTENTS |
| 20 | #define _EXT4_EXTENTS |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 21 | |
Christoph Hellwig | 3dcf545 | 2008-04-29 18:13:32 -0400 | [diff] [blame] | 22 | #include "ext4.h" |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 23 | |
| 24 | /* |
Robert P. J. Day | bbf2f9f | 2007-02-17 19:20:16 +0100 | [diff] [blame] | 25 | * With AGGRESSIVE_TEST defined, the capacity of index/leaf blocks |
Randy Dunlap | d0d856e | 2006-10-11 01:21:07 -0700 | [diff] [blame] | 26 | * becomes very small, so index split, in-depth growing and |
| 27 | * other hard changes happen much more often. |
| 28 | * This is for debug purposes only. |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 29 | */ |
Robert P. J. Day | bbf2f9f | 2007-02-17 19:20:16 +0100 | [diff] [blame] | 30 | #define AGGRESSIVE_TEST_ |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 31 | |
| 32 | /* |
Randy Dunlap | d0d856e | 2006-10-11 01:21:07 -0700 | [diff] [blame] | 33 | * With EXTENTS_STATS defined, the number of blocks and extents |
| 34 | * are collected in the truncate path. They'll be shown at |
| 35 | * umount time. |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 36 | */ |
| 37 | #define EXTENTS_STATS__ |
| 38 | |
| 39 | /* |
Randy Dunlap | d0d856e | 2006-10-11 01:21:07 -0700 | [diff] [blame] | 40 | * If CHECK_BINSEARCH is defined, then the results of the binary search |
| 41 | * will also be checked by linear search. |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 42 | */ |
| 43 | #define CHECK_BINSEARCH__ |
| 44 | |
| 45 | /* |
Randy Dunlap | d0d856e | 2006-10-11 01:21:07 -0700 | [diff] [blame] | 46 | * If EXT_STATS is defined then stats numbers are collected. |
| 47 | * These number will be displayed at umount time. |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 48 | */ |
| 49 | #define EXT_STATS_ |
| 50 | |
| 51 | |
| 52 | /* |
Randy Dunlap | d0d856e | 2006-10-11 01:21:07 -0700 | [diff] [blame] | 53 | * ext4_inode has i_block array (60 bytes total). |
| 54 | * The first 12 bytes store ext4_extent_header; |
| 55 | * the remainder stores an array of ext4_extent. |
Darrick J. Wong | e615391 | 2012-04-29 18:23:10 -0400 | [diff] [blame] | 56 | * For non-inode extent blocks, ext4_extent_tail |
| 57 | * follows the array. |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 58 | */ |
| 59 | |
| 60 | /* |
Darrick J. Wong | e615391 | 2012-04-29 18:23:10 -0400 | [diff] [blame] | 61 | * This is the extent tail on-disk structure. |
| 62 | * All other extent structures are 12 bytes long. It turns out that |
| 63 | * block_size % 12 >= 4 for at least all powers of 2 greater than 512, which |
| 64 | * covers all valid ext4 block sizes. Therefore, this tail structure can be |
| 65 | * crammed into the end of the block without having to rebalance the tree. |
| 66 | */ |
| 67 | struct ext4_extent_tail { |
| 68 | __le32 et_checksum; /* crc32c(uuid+inum+extent_block) */ |
| 69 | }; |
| 70 | |
| 71 | /* |
Randy Dunlap | d0d856e | 2006-10-11 01:21:07 -0700 | [diff] [blame] | 72 | * This is the extent on-disk structure. |
| 73 | * It's used at the bottom of the tree. |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 74 | */ |
| 75 | struct ext4_extent { |
| 76 | __le32 ee_block; /* first logical block extent covers */ |
| 77 | __le16 ee_len; /* number of blocks covered by extent */ |
| 78 | __le16 ee_start_hi; /* high 16 bits of physical block */ |
Aneesh Kumar K.V | b377611 | 2007-10-16 18:38:25 -0400 | [diff] [blame] | 79 | __le32 ee_start_lo; /* low 32 bits of physical block */ |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 80 | }; |
| 81 | |
| 82 | /* |
Randy Dunlap | d0d856e | 2006-10-11 01:21:07 -0700 | [diff] [blame] | 83 | * This is index on-disk structure. |
| 84 | * It's used at all the levels except the bottom. |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 85 | */ |
| 86 | struct ext4_extent_idx { |
| 87 | __le32 ei_block; /* index covers logical blocks from 'block' */ |
Aneesh Kumar K.V | d8dd0b4 | 2007-10-16 18:38:25 -0400 | [diff] [blame] | 88 | __le32 ei_leaf_lo; /* pointer to the physical block of the next * |
Randy Dunlap | d0d856e | 2006-10-11 01:21:07 -0700 | [diff] [blame] | 89 | * level. leaf or next index could be there */ |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 90 | __le16 ei_leaf_hi; /* high 16 bits of physical block */ |
| 91 | __u16 ei_unused; |
| 92 | }; |
| 93 | |
| 94 | /* |
Randy Dunlap | d0d856e | 2006-10-11 01:21:07 -0700 | [diff] [blame] | 95 | * Each block (leaves and indexes), even inode-stored has header. |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 96 | */ |
| 97 | struct ext4_extent_header { |
| 98 | __le16 eh_magic; /* probably will support different formats */ |
| 99 | __le16 eh_entries; /* number of valid entries */ |
| 100 | __le16 eh_max; /* capacity of store in entries */ |
Randy Dunlap | d0d856e | 2006-10-11 01:21:07 -0700 | [diff] [blame] | 101 | __le16 eh_depth; /* has tree real underlying blocks? */ |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 102 | __le32 eh_generation; /* generation of the tree */ |
| 103 | }; |
| 104 | |
| 105 | #define EXT4_EXT_MAGIC cpu_to_le16(0xf30a) |
| 106 | |
Darrick J. Wong | 7ac5990 | 2012-04-29 18:37:10 -0400 | [diff] [blame] | 107 | #define EXT4_EXTENT_TAIL_OFFSET(hdr) \ |
| 108 | (sizeof(struct ext4_extent_header) + \ |
| 109 | (sizeof(struct ext4_extent) * le16_to_cpu((hdr)->eh_max))) |
| 110 | |
| 111 | static inline struct ext4_extent_tail * |
| 112 | find_ext4_extent_tail(struct ext4_extent_header *eh) |
| 113 | { |
| 114 | return (struct ext4_extent_tail *)(((void *)eh) + |
| 115 | EXT4_EXTENT_TAIL_OFFSET(eh)); |
| 116 | } |
| 117 | |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 118 | /* |
Randy Dunlap | d0d856e | 2006-10-11 01:21:07 -0700 | [diff] [blame] | 119 | * Array of ext4_ext_path contains path to some extent. |
| 120 | * Creation/lookup routines use it for traversal/splitting/etc. |
| 121 | * Truncate uses it to simulate recursive walking. |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 122 | */ |
| 123 | struct ext4_ext_path { |
Alex Tomas | f65e6fb | 2006-10-11 01:21:05 -0700 | [diff] [blame] | 124 | ext4_fsblk_t p_block; |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 125 | __u16 p_depth; |
Theodore Ts'o | 10809df8 | 2014-09-01 14:40:09 -0400 | [diff] [blame] | 126 | __u16 p_maxdepth; |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 127 | struct ext4_extent *p_ext; |
| 128 | struct ext4_extent_idx *p_idx; |
| 129 | struct ext4_extent_header *p_hdr; |
| 130 | struct buffer_head *p_bh; |
| 131 | }; |
| 132 | |
| 133 | /* |
| 134 | * structure for external API |
| 135 | */ |
| 136 | |
Eric Sandeen | 6873fa0 | 2008-10-07 00:46:36 -0400 | [diff] [blame] | 137 | /* |
Amit Arora | 749269f | 2007-07-18 09:02:56 -0400 | [diff] [blame] | 138 | * EXT_INIT_MAX_LEN is the maximum number of blocks we can have in an |
| 139 | * initialized extent. This is 2^15 and not (2^16 - 1), since we use the |
| 140 | * MSB of ee_len field in the extent datastructure to signify if this |
Lukas Czerner | 556615d | 2014-04-20 23:45:47 -0400 | [diff] [blame] | 141 | * particular extent is an initialized extent or an unwritten (i.e. |
Amit Arora | 749269f | 2007-07-18 09:02:56 -0400 | [diff] [blame] | 142 | * preallocated). |
Lukas Czerner | 556615d | 2014-04-20 23:45:47 -0400 | [diff] [blame] | 143 | * EXT_UNWRITTEN_MAX_LEN is the maximum number of blocks we can have in an |
| 144 | * unwritten extent. |
Amit Arora | 749269f | 2007-07-18 09:02:56 -0400 | [diff] [blame] | 145 | * If ee_len is <= 0x8000, it is an initialized extent. Otherwise, it is an |
Lukas Czerner | 556615d | 2014-04-20 23:45:47 -0400 | [diff] [blame] | 146 | * unwritten one. In other words, if MSB of ee_len is set, it is an |
| 147 | * unwritten extent with only one special scenario when ee_len = 0x8000. |
| 148 | * In this case we can not have an unwritten extent of zero length and |
Amit Arora | 749269f | 2007-07-18 09:02:56 -0400 | [diff] [blame] | 149 | * thus we make it as a special case of initialized extent with 0x8000 length. |
| 150 | * This way we get better extent-to-group alignment for initialized extents. |
| 151 | * Hence, the maximum number of blocks we can have in an *initialized* |
Lukas Czerner | 556615d | 2014-04-20 23:45:47 -0400 | [diff] [blame] | 152 | * extent is 2^15 (32768) and in an *unwritten* extent is 2^15-1 (32767). |
Amit Arora | 749269f | 2007-07-18 09:02:56 -0400 | [diff] [blame] | 153 | */ |
| 154 | #define EXT_INIT_MAX_LEN (1UL << 15) |
Lukas Czerner | 556615d | 2014-04-20 23:45:47 -0400 | [diff] [blame] | 155 | #define EXT_UNWRITTEN_MAX_LEN (EXT_INIT_MAX_LEN - 1) |
Suparna Bhattacharya | 471d401 | 2006-10-11 01:21:06 -0700 | [diff] [blame] | 156 | |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 157 | |
| 158 | #define EXT_FIRST_EXTENT(__hdr__) \ |
| 159 | ((struct ext4_extent *) (((char *) (__hdr__)) + \ |
| 160 | sizeof(struct ext4_extent_header))) |
| 161 | #define EXT_FIRST_INDEX(__hdr__) \ |
| 162 | ((struct ext4_extent_idx *) (((char *) (__hdr__)) + \ |
| 163 | sizeof(struct ext4_extent_header))) |
| 164 | #define EXT_HAS_FREE_INDEX(__path__) \ |
Dave Kleikamp | 8c55e20 | 2007-05-24 13:04:54 -0400 | [diff] [blame] | 165 | (le16_to_cpu((__path__)->p_hdr->eh_entries) \ |
| 166 | < le16_to_cpu((__path__)->p_hdr->eh_max)) |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 167 | #define EXT_LAST_EXTENT(__hdr__) \ |
| 168 | (EXT_FIRST_EXTENT((__hdr__)) + le16_to_cpu((__hdr__)->eh_entries) - 1) |
| 169 | #define EXT_LAST_INDEX(__hdr__) \ |
| 170 | (EXT_FIRST_INDEX((__hdr__)) + le16_to_cpu((__hdr__)->eh_entries) - 1) |
| 171 | #define EXT_MAX_EXTENT(__hdr__) \ |
| 172 | (EXT_FIRST_EXTENT((__hdr__)) + le16_to_cpu((__hdr__)->eh_max) - 1) |
| 173 | #define EXT_MAX_INDEX(__hdr__) \ |
| 174 | (EXT_FIRST_INDEX((__hdr__)) + le16_to_cpu((__hdr__)->eh_max) - 1) |
| 175 | |
| 176 | static inline struct ext4_extent_header *ext_inode_hdr(struct inode *inode) |
| 177 | { |
| 178 | return (struct ext4_extent_header *) EXT4_I(inode)->i_data; |
| 179 | } |
| 180 | |
| 181 | static inline struct ext4_extent_header *ext_block_hdr(struct buffer_head *bh) |
| 182 | { |
| 183 | return (struct ext4_extent_header *) bh->b_data; |
| 184 | } |
| 185 | |
| 186 | static inline unsigned short ext_depth(struct inode *inode) |
| 187 | { |
| 188 | return le16_to_cpu(ext_inode_hdr(inode)->eh_depth); |
| 189 | } |
| 190 | |
Lukas Czerner | 556615d | 2014-04-20 23:45:47 -0400 | [diff] [blame] | 191 | static inline void ext4_ext_mark_unwritten(struct ext4_extent *ext) |
Amit Arora | a2df2a6 | 2007-07-17 21:42:41 -0400 | [diff] [blame] | 192 | { |
Lukas Czerner | 556615d | 2014-04-20 23:45:47 -0400 | [diff] [blame] | 193 | /* We can not have an unwritten extent of zero length! */ |
Amit Arora | 749269f | 2007-07-18 09:02:56 -0400 | [diff] [blame] | 194 | BUG_ON((le16_to_cpu(ext->ee_len) & ~EXT_INIT_MAX_LEN) == 0); |
| 195 | ext->ee_len |= cpu_to_le16(EXT_INIT_MAX_LEN); |
Amit Arora | a2df2a6 | 2007-07-17 21:42:41 -0400 | [diff] [blame] | 196 | } |
| 197 | |
Lukas Czerner | 556615d | 2014-04-20 23:45:47 -0400 | [diff] [blame] | 198 | static inline int ext4_ext_is_unwritten(struct ext4_extent *ext) |
Amit Arora | a2df2a6 | 2007-07-17 21:42:41 -0400 | [diff] [blame] | 199 | { |
Amit Arora | 749269f | 2007-07-18 09:02:56 -0400 | [diff] [blame] | 200 | /* Extent with ee_len of 0x8000 is treated as an initialized extent */ |
| 201 | return (le16_to_cpu(ext->ee_len) > EXT_INIT_MAX_LEN); |
Amit Arora | a2df2a6 | 2007-07-17 21:42:41 -0400 | [diff] [blame] | 202 | } |
| 203 | |
| 204 | static inline int ext4_ext_get_actual_len(struct ext4_extent *ext) |
| 205 | { |
Amit Arora | 749269f | 2007-07-18 09:02:56 -0400 | [diff] [blame] | 206 | return (le16_to_cpu(ext->ee_len) <= EXT_INIT_MAX_LEN ? |
| 207 | le16_to_cpu(ext->ee_len) : |
| 208 | (le16_to_cpu(ext->ee_len) - EXT_INIT_MAX_LEN)); |
Amit Arora | a2df2a6 | 2007-07-17 21:42:41 -0400 | [diff] [blame] | 209 | } |
| 210 | |
Mingming Cao | 0031462 | 2009-09-28 15:49:08 -0400 | [diff] [blame] | 211 | static inline void ext4_ext_mark_initialized(struct ext4_extent *ext) |
| 212 | { |
| 213 | ext->ee_len = cpu_to_le16(ext4_ext_get_actual_len(ext)); |
| 214 | } |
| 215 | |
Theodore Ts'o | bf89d16 | 2010-10-27 21:30:14 -0400 | [diff] [blame] | 216 | /* |
| 217 | * ext4_ext_pblock: |
| 218 | * combine low and high parts of physical block number into ext4_fsblk_t |
| 219 | */ |
| 220 | static inline ext4_fsblk_t ext4_ext_pblock(struct ext4_extent *ex) |
| 221 | { |
| 222 | ext4_fsblk_t block; |
| 223 | |
| 224 | block = le32_to_cpu(ex->ee_start_lo); |
| 225 | block |= ((ext4_fsblk_t) le16_to_cpu(ex->ee_start_hi) << 31) << 1; |
| 226 | return block; |
| 227 | } |
| 228 | |
| 229 | /* |
| 230 | * ext4_idx_pblock: |
| 231 | * combine low and high parts of a leaf physical block number into ext4_fsblk_t |
| 232 | */ |
| 233 | static inline ext4_fsblk_t ext4_idx_pblock(struct ext4_extent_idx *ix) |
| 234 | { |
| 235 | ext4_fsblk_t block; |
| 236 | |
| 237 | block = le32_to_cpu(ix->ei_leaf_lo); |
| 238 | block |= ((ext4_fsblk_t) le16_to_cpu(ix->ei_leaf_hi) << 31) << 1; |
| 239 | return block; |
| 240 | } |
| 241 | |
| 242 | /* |
| 243 | * ext4_ext_store_pblock: |
| 244 | * stores a large physical block number into an extent struct, |
| 245 | * breaking it into parts |
| 246 | */ |
| 247 | static inline void ext4_ext_store_pblock(struct ext4_extent *ex, |
| 248 | ext4_fsblk_t pb) |
| 249 | { |
| 250 | ex->ee_start_lo = cpu_to_le32((unsigned long) (pb & 0xffffffff)); |
| 251 | ex->ee_start_hi = cpu_to_le16((unsigned long) ((pb >> 31) >> 1) & |
| 252 | 0xffff); |
| 253 | } |
| 254 | |
| 255 | /* |
| 256 | * ext4_idx_store_pblock: |
| 257 | * stores a large physical block number into an index struct, |
| 258 | * breaking it into parts |
| 259 | */ |
| 260 | static inline void ext4_idx_store_pblock(struct ext4_extent_idx *ix, |
| 261 | ext4_fsblk_t pb) |
| 262 | { |
| 263 | ix->ei_leaf_lo = cpu_to_le32((unsigned long) (pb & 0xffffffff)); |
| 264 | ix->ei_leaf_hi = cpu_to_le16((unsigned long) ((pb >> 31) >> 1) & |
| 265 | 0xffff); |
| 266 | } |
| 267 | |
Darrick J. Wong | 2656497 | 2013-04-19 14:04:12 -0400 | [diff] [blame] | 268 | #define ext4_ext_dirty(handle, inode, path) \ |
| 269 | __ext4_ext_dirty(__func__, __LINE__, (handle), (inode), (path)) |
| 270 | int __ext4_ext_dirty(const char *where, unsigned int line, handle_t *handle, |
| 271 | struct inode *inode, struct ext4_ext_path *path); |
| 272 | |
Christoph Hellwig | 3dcf545 | 2008-04-29 18:13:32 -0400 | [diff] [blame] | 273 | #endif /* _EXT4_EXTENTS */ |
Alex Tomas | a86c618 | 2006-10-11 01:21:03 -0700 | [diff] [blame] | 274 | |