blob: 98fb0c119c6827dd50b86ac3521f216bba41170c [file] [log] [blame]
Theodore Ts'of5166762017-12-17 22:00:59 -05001// SPDX-License-Identifier: GPL-2.0
Alex Tomasa86c6182006-10-11 01:21:03 -07002/*
3 * Copyright (c) 2003-2006, Cluster File Systems, Inc, info@clusterfs.com
4 * Written by Alex Tomas <alex@clusterfs.com>
Alex Tomasa86c6182006-10-11 01:21:03 -07005 */
6
Christoph Hellwig3dcf5452008-04-29 18:13:32 -04007#ifndef _EXT4_EXTENTS
8#define _EXT4_EXTENTS
Alex Tomasa86c6182006-10-11 01:21:03 -07009
Christoph Hellwig3dcf5452008-04-29 18:13:32 -040010#include "ext4.h"
Alex Tomasa86c6182006-10-11 01:21:03 -070011
12/*
Robert P. J. Daybbf2f9f2007-02-17 19:20:16 +010013 * With AGGRESSIVE_TEST defined, the capacity of index/leaf blocks
Randy Dunlapd0d856e2006-10-11 01:21:07 -070014 * becomes very small, so index split, in-depth growing and
15 * other hard changes happen much more often.
16 * This is for debug purposes only.
Alex Tomasa86c6182006-10-11 01:21:03 -070017 */
Robert P. J. Daybbf2f9f2007-02-17 19:20:16 +010018#define AGGRESSIVE_TEST_
Alex Tomasa86c6182006-10-11 01:21:03 -070019
20/*
Randy Dunlapd0d856e2006-10-11 01:21:07 -070021 * With EXTENTS_STATS defined, the number of blocks and extents
22 * are collected in the truncate path. They'll be shown at
23 * umount time.
Alex Tomasa86c6182006-10-11 01:21:03 -070024 */
25#define EXTENTS_STATS__
26
27/*
Randy Dunlapd0d856e2006-10-11 01:21:07 -070028 * If CHECK_BINSEARCH is defined, then the results of the binary search
29 * will also be checked by linear search.
Alex Tomasa86c6182006-10-11 01:21:03 -070030 */
31#define CHECK_BINSEARCH__
32
33/*
Randy Dunlapd0d856e2006-10-11 01:21:07 -070034 * If EXT_STATS is defined then stats numbers are collected.
35 * These number will be displayed at umount time.
Alex Tomasa86c6182006-10-11 01:21:03 -070036 */
37#define EXT_STATS_
38
39
40/*
Randy Dunlapd0d856e2006-10-11 01:21:07 -070041 * ext4_inode has i_block array (60 bytes total).
42 * The first 12 bytes store ext4_extent_header;
43 * the remainder stores an array of ext4_extent.
Darrick J. Wonge6153912012-04-29 18:23:10 -040044 * For non-inode extent blocks, ext4_extent_tail
45 * follows the array.
Alex Tomasa86c6182006-10-11 01:21:03 -070046 */
47
48/*
Darrick J. Wonge6153912012-04-29 18:23:10 -040049 * This is the extent tail on-disk structure.
50 * All other extent structures are 12 bytes long. It turns out that
51 * block_size % 12 >= 4 for at least all powers of 2 greater than 512, which
52 * covers all valid ext4 block sizes. Therefore, this tail structure can be
53 * crammed into the end of the block without having to rebalance the tree.
54 */
55struct ext4_extent_tail {
56 __le32 et_checksum; /* crc32c(uuid+inum+extent_block) */
57};
58
59/*
Randy Dunlapd0d856e2006-10-11 01:21:07 -070060 * This is the extent on-disk structure.
61 * It's used at the bottom of the tree.
Alex Tomasa86c6182006-10-11 01:21:03 -070062 */
63struct ext4_extent {
64 __le32 ee_block; /* first logical block extent covers */
65 __le16 ee_len; /* number of blocks covered by extent */
66 __le16 ee_start_hi; /* high 16 bits of physical block */
Aneesh Kumar K.Vb3776112007-10-16 18:38:25 -040067 __le32 ee_start_lo; /* low 32 bits of physical block */
Alex Tomasa86c6182006-10-11 01:21:03 -070068};
69
70/*
Randy Dunlapd0d856e2006-10-11 01:21:07 -070071 * This is index on-disk structure.
72 * It's used at all the levels except the bottom.
Alex Tomasa86c6182006-10-11 01:21:03 -070073 */
74struct ext4_extent_idx {
75 __le32 ei_block; /* index covers logical blocks from 'block' */
Aneesh Kumar K.Vd8dd0b42007-10-16 18:38:25 -040076 __le32 ei_leaf_lo; /* pointer to the physical block of the next *
Randy Dunlapd0d856e2006-10-11 01:21:07 -070077 * level. leaf or next index could be there */
Alex Tomasa86c6182006-10-11 01:21:03 -070078 __le16 ei_leaf_hi; /* high 16 bits of physical block */
79 __u16 ei_unused;
80};
81
82/*
Randy Dunlapd0d856e2006-10-11 01:21:07 -070083 * Each block (leaves and indexes), even inode-stored has header.
Alex Tomasa86c6182006-10-11 01:21:03 -070084 */
85struct ext4_extent_header {
86 __le16 eh_magic; /* probably will support different formats */
87 __le16 eh_entries; /* number of valid entries */
88 __le16 eh_max; /* capacity of store in entries */
Randy Dunlapd0d856e2006-10-11 01:21:07 -070089 __le16 eh_depth; /* has tree real underlying blocks? */
Alex Tomasa86c6182006-10-11 01:21:03 -070090 __le32 eh_generation; /* generation of the tree */
91};
92
93#define EXT4_EXT_MAGIC cpu_to_le16(0xf30a)
94
Darrick J. Wong7ac59902012-04-29 18:37:10 -040095#define EXT4_EXTENT_TAIL_OFFSET(hdr) \
96 (sizeof(struct ext4_extent_header) + \
97 (sizeof(struct ext4_extent) * le16_to_cpu((hdr)->eh_max)))
98
99static inline struct ext4_extent_tail *
100find_ext4_extent_tail(struct ext4_extent_header *eh)
101{
102 return (struct ext4_extent_tail *)(((void *)eh) +
103 EXT4_EXTENT_TAIL_OFFSET(eh));
104}
105
Alex Tomasa86c6182006-10-11 01:21:03 -0700106/*
Randy Dunlapd0d856e2006-10-11 01:21:07 -0700107 * Array of ext4_ext_path contains path to some extent.
108 * Creation/lookup routines use it for traversal/splitting/etc.
109 * Truncate uses it to simulate recursive walking.
Alex Tomasa86c6182006-10-11 01:21:03 -0700110 */
111struct ext4_ext_path {
Alex Tomasf65e6fb2006-10-11 01:21:05 -0700112 ext4_fsblk_t p_block;
Alex Tomasa86c6182006-10-11 01:21:03 -0700113 __u16 p_depth;
Theodore Ts'o10809df82014-09-01 14:40:09 -0400114 __u16 p_maxdepth;
Alex Tomasa86c6182006-10-11 01:21:03 -0700115 struct ext4_extent *p_ext;
116 struct ext4_extent_idx *p_idx;
117 struct ext4_extent_header *p_hdr;
118 struct buffer_head *p_bh;
119};
120
121/*
122 * structure for external API
123 */
124
Eric Sandeen6873fa02008-10-07 00:46:36 -0400125/*
Amit Arora749269f2007-07-18 09:02:56 -0400126 * EXT_INIT_MAX_LEN is the maximum number of blocks we can have in an
127 * initialized extent. This is 2^15 and not (2^16 - 1), since we use the
128 * MSB of ee_len field in the extent datastructure to signify if this
Lukas Czerner556615d2014-04-20 23:45:47 -0400129 * particular extent is an initialized extent or an unwritten (i.e.
Amit Arora749269f2007-07-18 09:02:56 -0400130 * preallocated).
Lukas Czerner556615d2014-04-20 23:45:47 -0400131 * EXT_UNWRITTEN_MAX_LEN is the maximum number of blocks we can have in an
132 * unwritten extent.
Amit Arora749269f2007-07-18 09:02:56 -0400133 * If ee_len is <= 0x8000, it is an initialized extent. Otherwise, it is an
Lukas Czerner556615d2014-04-20 23:45:47 -0400134 * unwritten one. In other words, if MSB of ee_len is set, it is an
135 * unwritten extent with only one special scenario when ee_len = 0x8000.
136 * In this case we can not have an unwritten extent of zero length and
Amit Arora749269f2007-07-18 09:02:56 -0400137 * thus we make it as a special case of initialized extent with 0x8000 length.
138 * This way we get better extent-to-group alignment for initialized extents.
139 * Hence, the maximum number of blocks we can have in an *initialized*
Lukas Czerner556615d2014-04-20 23:45:47 -0400140 * extent is 2^15 (32768) and in an *unwritten* extent is 2^15-1 (32767).
Amit Arora749269f2007-07-18 09:02:56 -0400141 */
142#define EXT_INIT_MAX_LEN (1UL << 15)
Lukas Czerner556615d2014-04-20 23:45:47 -0400143#define EXT_UNWRITTEN_MAX_LEN (EXT_INIT_MAX_LEN - 1)
Suparna Bhattacharya471d4012006-10-11 01:21:06 -0700144
Alex Tomasa86c6182006-10-11 01:21:03 -0700145
146#define EXT_FIRST_EXTENT(__hdr__) \
147 ((struct ext4_extent *) (((char *) (__hdr__)) + \
148 sizeof(struct ext4_extent_header)))
149#define EXT_FIRST_INDEX(__hdr__) \
150 ((struct ext4_extent_idx *) (((char *) (__hdr__)) + \
151 sizeof(struct ext4_extent_header)))
152#define EXT_HAS_FREE_INDEX(__path__) \
Dave Kleikamp8c55e202007-05-24 13:04:54 -0400153 (le16_to_cpu((__path__)->p_hdr->eh_entries) \
154 < le16_to_cpu((__path__)->p_hdr->eh_max))
Alex Tomasa86c6182006-10-11 01:21:03 -0700155#define EXT_LAST_EXTENT(__hdr__) \
156 (EXT_FIRST_EXTENT((__hdr__)) + le16_to_cpu((__hdr__)->eh_entries) - 1)
157#define EXT_LAST_INDEX(__hdr__) \
158 (EXT_FIRST_INDEX((__hdr__)) + le16_to_cpu((__hdr__)->eh_entries) - 1)
159#define EXT_MAX_EXTENT(__hdr__) \
160 (EXT_FIRST_EXTENT((__hdr__)) + le16_to_cpu((__hdr__)->eh_max) - 1)
161#define EXT_MAX_INDEX(__hdr__) \
162 (EXT_FIRST_INDEX((__hdr__)) + le16_to_cpu((__hdr__)->eh_max) - 1)
163
164static inline struct ext4_extent_header *ext_inode_hdr(struct inode *inode)
165{
166 return (struct ext4_extent_header *) EXT4_I(inode)->i_data;
167}
168
169static inline struct ext4_extent_header *ext_block_hdr(struct buffer_head *bh)
170{
171 return (struct ext4_extent_header *) bh->b_data;
172}
173
174static inline unsigned short ext_depth(struct inode *inode)
175{
176 return le16_to_cpu(ext_inode_hdr(inode)->eh_depth);
177}
178
Lukas Czerner556615d2014-04-20 23:45:47 -0400179static inline void ext4_ext_mark_unwritten(struct ext4_extent *ext)
Amit Aroraa2df2a62007-07-17 21:42:41 -0400180{
Lukas Czerner556615d2014-04-20 23:45:47 -0400181 /* We can not have an unwritten extent of zero length! */
Amit Arora749269f2007-07-18 09:02:56 -0400182 BUG_ON((le16_to_cpu(ext->ee_len) & ~EXT_INIT_MAX_LEN) == 0);
183 ext->ee_len |= cpu_to_le16(EXT_INIT_MAX_LEN);
Amit Aroraa2df2a62007-07-17 21:42:41 -0400184}
185
Lukas Czerner556615d2014-04-20 23:45:47 -0400186static inline int ext4_ext_is_unwritten(struct ext4_extent *ext)
Amit Aroraa2df2a62007-07-17 21:42:41 -0400187{
Amit Arora749269f2007-07-18 09:02:56 -0400188 /* Extent with ee_len of 0x8000 is treated as an initialized extent */
189 return (le16_to_cpu(ext->ee_len) > EXT_INIT_MAX_LEN);
Amit Aroraa2df2a62007-07-17 21:42:41 -0400190}
191
192static inline int ext4_ext_get_actual_len(struct ext4_extent *ext)
193{
Amit Arora749269f2007-07-18 09:02:56 -0400194 return (le16_to_cpu(ext->ee_len) <= EXT_INIT_MAX_LEN ?
195 le16_to_cpu(ext->ee_len) :
196 (le16_to_cpu(ext->ee_len) - EXT_INIT_MAX_LEN));
Amit Aroraa2df2a62007-07-17 21:42:41 -0400197}
198
Mingming Cao00314622009-09-28 15:49:08 -0400199static inline void ext4_ext_mark_initialized(struct ext4_extent *ext)
200{
201 ext->ee_len = cpu_to_le16(ext4_ext_get_actual_len(ext));
202}
203
Theodore Ts'obf89d162010-10-27 21:30:14 -0400204/*
205 * ext4_ext_pblock:
206 * combine low and high parts of physical block number into ext4_fsblk_t
207 */
208static inline ext4_fsblk_t ext4_ext_pblock(struct ext4_extent *ex)
209{
210 ext4_fsblk_t block;
211
212 block = le32_to_cpu(ex->ee_start_lo);
213 block |= ((ext4_fsblk_t) le16_to_cpu(ex->ee_start_hi) << 31) << 1;
214 return block;
215}
216
217/*
218 * ext4_idx_pblock:
219 * combine low and high parts of a leaf physical block number into ext4_fsblk_t
220 */
221static inline ext4_fsblk_t ext4_idx_pblock(struct ext4_extent_idx *ix)
222{
223 ext4_fsblk_t block;
224
225 block = le32_to_cpu(ix->ei_leaf_lo);
226 block |= ((ext4_fsblk_t) le16_to_cpu(ix->ei_leaf_hi) << 31) << 1;
227 return block;
228}
229
230/*
231 * ext4_ext_store_pblock:
232 * stores a large physical block number into an extent struct,
233 * breaking it into parts
234 */
235static inline void ext4_ext_store_pblock(struct ext4_extent *ex,
236 ext4_fsblk_t pb)
237{
238 ex->ee_start_lo = cpu_to_le32((unsigned long) (pb & 0xffffffff));
239 ex->ee_start_hi = cpu_to_le16((unsigned long) ((pb >> 31) >> 1) &
240 0xffff);
241}
242
243/*
244 * ext4_idx_store_pblock:
245 * stores a large physical block number into an index struct,
246 * breaking it into parts
247 */
248static inline void ext4_idx_store_pblock(struct ext4_extent_idx *ix,
249 ext4_fsblk_t pb)
250{
251 ix->ei_leaf_lo = cpu_to_le32((unsigned long) (pb & 0xffffffff));
252 ix->ei_leaf_hi = cpu_to_le16((unsigned long) ((pb >> 31) >> 1) &
253 0xffff);
254}
255
Darrick J. Wong26564972013-04-19 14:04:12 -0400256#define ext4_ext_dirty(handle, inode, path) \
257 __ext4_ext_dirty(__func__, __LINE__, (handle), (inode), (path))
258int __ext4_ext_dirty(const char *where, unsigned int line, handle_t *handle,
259 struct inode *inode, struct ext4_ext_path *path);
260
Christoph Hellwig3dcf5452008-04-29 18:13:32 -0400261#endif /* _EXT4_EXTENTS */
Alex Tomasa86c6182006-10-11 01:21:03 -0700262