]>
Commit | Line | Data |
---|---|---|
a86c6181 AT |
1 | /* |
2 | * Copyright (c) 2003-2006, Cluster File Systems, Inc, info@clusterfs.com | |
3 | * Written by Alex Tomas <alex@clusterfs.com> | |
4 | * | |
5 | * Architecture independence: | |
6 | * Copyright (c) 2005, Bull S.A. | |
7 | * Written by Pierre Peiffer <pierre.peiffer@bull.net> | |
8 | * | |
9 | * This program is free software; you can redistribute it and/or modify | |
10 | * it under the terms of the GNU General Public License version 2 as | |
11 | * published by the Free Software Foundation. | |
12 | * | |
13 | * This program is distributed in the hope that it will be useful, | |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | * GNU General Public License for more details. | |
17 | * | |
18 | * You should have received a copy of the GNU General Public Licens | |
19 | * along with this program; if not, write to the Free Software | |
20 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111- | |
21 | */ | |
22 | ||
23 | /* | |
24 | * Extents support for EXT4 | |
25 | * | |
26 | * TODO: | |
27 | * - ext4*_error() should be used in some situations | |
28 | * - analyze all BUG()/BUG_ON(), use -EIO where appropriate | |
29 | * - smart tree reduction | |
30 | */ | |
31 | ||
32 | #include <linux/module.h> | |
33 | #include <linux/fs.h> | |
34 | #include <linux/time.h> | |
cd02ff0b | 35 | #include <linux/jbd2.h> |
a86c6181 AT |
36 | #include <linux/highuid.h> |
37 | #include <linux/pagemap.h> | |
38 | #include <linux/quotaops.h> | |
39 | #include <linux/string.h> | |
40 | #include <linux/slab.h> | |
a2df2a63 | 41 | #include <linux/falloc.h> |
a86c6181 | 42 | #include <asm/uaccess.h> |
6873fa0d | 43 | #include <linux/fiemap.h> |
3dcf5451 CH |
44 | #include "ext4_jbd2.h" |
45 | #include "ext4_extents.h" | |
a86c6181 | 46 | |
0562e0ba JZ |
47 | #include <trace/events/ext4.h> |
48 | ||
487caeef JK |
49 | static int ext4_ext_truncate_extend_restart(handle_t *handle, |
50 | struct inode *inode, | |
51 | int needed) | |
a86c6181 AT |
52 | { |
53 | int err; | |
54 | ||
0390131b FM |
55 | if (!ext4_handle_valid(handle)) |
56 | return 0; | |
a86c6181 | 57 | if (handle->h_buffer_credits > needed) |
9102e4fa SF |
58 | return 0; |
59 | err = ext4_journal_extend(handle, needed); | |
0123c939 | 60 | if (err <= 0) |
9102e4fa | 61 | return err; |
487caeef | 62 | err = ext4_truncate_restart_trans(handle, inode, needed); |
0617b83f DM |
63 | if (err == 0) |
64 | err = -EAGAIN; | |
487caeef JK |
65 | |
66 | return err; | |
a86c6181 AT |
67 | } |
68 | ||
69 | /* | |
70 | * could return: | |
71 | * - EROFS | |
72 | * - ENOMEM | |
73 | */ | |
74 | static int ext4_ext_get_access(handle_t *handle, struct inode *inode, | |
75 | struct ext4_ext_path *path) | |
76 | { | |
77 | if (path->p_bh) { | |
78 | /* path points to block */ | |
79 | return ext4_journal_get_write_access(handle, path->p_bh); | |
80 | } | |
81 | /* path points to leaf/index in inode body */ | |
82 | /* we use in-core data, no need to protect them */ | |
83 | return 0; | |
84 | } | |
85 | ||
86 | /* | |
87 | * could return: | |
88 | * - EROFS | |
89 | * - ENOMEM | |
90 | * - EIO | |
91 | */ | |
92 | static int ext4_ext_dirty(handle_t *handle, struct inode *inode, | |
93 | struct ext4_ext_path *path) | |
94 | { | |
95 | int err; | |
96 | if (path->p_bh) { | |
97 | /* path points to block */ | |
0390131b | 98 | err = ext4_handle_dirty_metadata(handle, inode, path->p_bh); |
a86c6181 AT |
99 | } else { |
100 | /* path points to leaf/index in inode body */ | |
101 | err = ext4_mark_inode_dirty(handle, inode); | |
102 | } | |
103 | return err; | |
104 | } | |
105 | ||
f65e6fba | 106 | static ext4_fsblk_t ext4_ext_find_goal(struct inode *inode, |
a86c6181 | 107 | struct ext4_ext_path *path, |
725d26d3 | 108 | ext4_lblk_t block) |
a86c6181 AT |
109 | { |
110 | struct ext4_inode_info *ei = EXT4_I(inode); | |
f65e6fba | 111 | ext4_fsblk_t bg_start; |
74d3487f | 112 | ext4_fsblk_t last_block; |
f65e6fba | 113 | ext4_grpblk_t colour; |
a4912123 TT |
114 | ext4_group_t block_group; |
115 | int flex_size = ext4_flex_bg_size(EXT4_SB(inode->i_sb)); | |
a86c6181 AT |
116 | int depth; |
117 | ||
118 | if (path) { | |
119 | struct ext4_extent *ex; | |
120 | depth = path->p_depth; | |
121 | ||
ad4fb9ca KM |
122 | /* |
123 | * Try to predict block placement assuming that we are | |
124 | * filling in a file which will eventually be | |
125 | * non-sparse --- i.e., in the case of libbfd writing | |
126 | * an ELF object sections out-of-order but in a way | |
127 | * the eventually results in a contiguous object or | |
128 | * executable file, or some database extending a table | |
129 | * space file. However, this is actually somewhat | |
130 | * non-ideal if we are writing a sparse file such as | |
131 | * qemu or KVM writing a raw image file that is going | |
132 | * to stay fairly sparse, since it will end up | |
133 | * fragmenting the file system's free space. Maybe we | |
134 | * should have some hueristics or some way to allow | |
135 | * userspace to pass a hint to file system, | |
b8d6568a | 136 | * especially if the latter case turns out to be |
ad4fb9ca KM |
137 | * common. |
138 | */ | |
7e028976 | 139 | ex = path[depth].p_ext; |
ad4fb9ca KM |
140 | if (ex) { |
141 | ext4_fsblk_t ext_pblk = ext4_ext_pblock(ex); | |
142 | ext4_lblk_t ext_block = le32_to_cpu(ex->ee_block); | |
143 | ||
144 | if (block > ext_block) | |
145 | return ext_pblk + (block - ext_block); | |
146 | else | |
147 | return ext_pblk - (ext_block - block); | |
148 | } | |
a86c6181 | 149 | |
d0d856e8 RD |
150 | /* it looks like index is empty; |
151 | * try to find starting block from index itself */ | |
a86c6181 AT |
152 | if (path[depth].p_bh) |
153 | return path[depth].p_bh->b_blocknr; | |
154 | } | |
155 | ||
156 | /* OK. use inode's group */ | |
a4912123 TT |
157 | block_group = ei->i_block_group; |
158 | if (flex_size >= EXT4_FLEX_SIZE_DIR_ALLOC_SCHEME) { | |
159 | /* | |
160 | * If there are at least EXT4_FLEX_SIZE_DIR_ALLOC_SCHEME | |
60e6679e TT |
161 | * block groups per flexgroup, reserve the first block |
162 | * group for directories and special files. Regular | |
a4912123 | 163 | * files will start at the second block group. This |
60e6679e | 164 | * tends to speed up directory access and improves |
a4912123 TT |
165 | * fsck times. |
166 | */ | |
167 | block_group &= ~(flex_size-1); | |
168 | if (S_ISREG(inode->i_mode)) | |
169 | block_group++; | |
170 | } | |
5661bd68 | 171 | bg_start = ext4_group_first_block_no(inode->i_sb, block_group); |
74d3487f VC |
172 | last_block = ext4_blocks_count(EXT4_SB(inode->i_sb)->s_es) - 1; |
173 | ||
a4912123 TT |
174 | /* |
175 | * If we are doing delayed allocation, we don't need take | |
176 | * colour into account. | |
177 | */ | |
178 | if (test_opt(inode->i_sb, DELALLOC)) | |
179 | return bg_start; | |
180 | ||
74d3487f VC |
181 | if (bg_start + EXT4_BLOCKS_PER_GROUP(inode->i_sb) <= last_block) |
182 | colour = (current->pid % 16) * | |
a86c6181 | 183 | (EXT4_BLOCKS_PER_GROUP(inode->i_sb) / 16); |
74d3487f VC |
184 | else |
185 | colour = (current->pid % 16) * ((last_block - bg_start) / 16); | |
a86c6181 AT |
186 | return bg_start + colour + block; |
187 | } | |
188 | ||
654b4908 AK |
189 | /* |
190 | * Allocation for a meta data block | |
191 | */ | |
f65e6fba | 192 | static ext4_fsblk_t |
654b4908 | 193 | ext4_ext_new_meta_block(handle_t *handle, struct inode *inode, |
a86c6181 AT |
194 | struct ext4_ext_path *path, |
195 | struct ext4_extent *ex, int *err) | |
196 | { | |
f65e6fba | 197 | ext4_fsblk_t goal, newblock; |
a86c6181 AT |
198 | |
199 | goal = ext4_ext_find_goal(inode, path, le32_to_cpu(ex->ee_block)); | |
97df5d15 | 200 | newblock = ext4_new_meta_blocks(handle, inode, goal, NULL, err); |
a86c6181 AT |
201 | return newblock; |
202 | } | |
203 | ||
55ad63bf | 204 | static inline int ext4_ext_space_block(struct inode *inode, int check) |
a86c6181 AT |
205 | { |
206 | int size; | |
207 | ||
208 | size = (inode->i_sb->s_blocksize - sizeof(struct ext4_extent_header)) | |
209 | / sizeof(struct ext4_extent); | |
55ad63bf | 210 | if (!check) { |
bbf2f9fb | 211 | #ifdef AGGRESSIVE_TEST |
55ad63bf TT |
212 | if (size > 6) |
213 | size = 6; | |
a86c6181 | 214 | #endif |
55ad63bf | 215 | } |
a86c6181 AT |
216 | return size; |
217 | } | |
218 | ||
55ad63bf | 219 | static inline int ext4_ext_space_block_idx(struct inode *inode, int check) |
a86c6181 AT |
220 | { |
221 | int size; | |
222 | ||
223 | size = (inode->i_sb->s_blocksize - sizeof(struct ext4_extent_header)) | |
224 | / sizeof(struct ext4_extent_idx); | |
55ad63bf | 225 | if (!check) { |
bbf2f9fb | 226 | #ifdef AGGRESSIVE_TEST |
55ad63bf TT |
227 | if (size > 5) |
228 | size = 5; | |
a86c6181 | 229 | #endif |
55ad63bf | 230 | } |
a86c6181 AT |
231 | return size; |
232 | } | |
233 | ||
55ad63bf | 234 | static inline int ext4_ext_space_root(struct inode *inode, int check) |
a86c6181 AT |
235 | { |
236 | int size; | |
237 | ||
238 | size = sizeof(EXT4_I(inode)->i_data); | |
239 | size -= sizeof(struct ext4_extent_header); | |
240 | size /= sizeof(struct ext4_extent); | |
55ad63bf | 241 | if (!check) { |
bbf2f9fb | 242 | #ifdef AGGRESSIVE_TEST |
55ad63bf TT |
243 | if (size > 3) |
244 | size = 3; | |
a86c6181 | 245 | #endif |
55ad63bf | 246 | } |
a86c6181 AT |
247 | return size; |
248 | } | |
249 | ||
55ad63bf | 250 | static inline int ext4_ext_space_root_idx(struct inode *inode, int check) |
a86c6181 AT |
251 | { |
252 | int size; | |
253 | ||
254 | size = sizeof(EXT4_I(inode)->i_data); | |
255 | size -= sizeof(struct ext4_extent_header); | |
256 | size /= sizeof(struct ext4_extent_idx); | |
55ad63bf | 257 | if (!check) { |
bbf2f9fb | 258 | #ifdef AGGRESSIVE_TEST |
55ad63bf TT |
259 | if (size > 4) |
260 | size = 4; | |
a86c6181 | 261 | #endif |
55ad63bf | 262 | } |
a86c6181 AT |
263 | return size; |
264 | } | |
265 | ||
d2a17637 MC |
266 | /* |
267 | * Calculate the number of metadata blocks needed | |
268 | * to allocate @blocks | |
269 | * Worse case is one block per extent | |
270 | */ | |
01f49d0b | 271 | int ext4_ext_calc_metadata_amount(struct inode *inode, ext4_lblk_t lblock) |
d2a17637 | 272 | { |
9d0be502 TT |
273 | struct ext4_inode_info *ei = EXT4_I(inode); |
274 | int idxs, num = 0; | |
d2a17637 | 275 | |
9d0be502 TT |
276 | idxs = ((inode->i_sb->s_blocksize - sizeof(struct ext4_extent_header)) |
277 | / sizeof(struct ext4_extent_idx)); | |
d2a17637 MC |
278 | |
279 | /* | |
9d0be502 TT |
280 | * If the new delayed allocation block is contiguous with the |
281 | * previous da block, it can share index blocks with the | |
282 | * previous block, so we only need to allocate a new index | |
283 | * block every idxs leaf blocks. At ldxs**2 blocks, we need | |
284 | * an additional index block, and at ldxs**3 blocks, yet | |
285 | * another index blocks. | |
d2a17637 | 286 | */ |
9d0be502 TT |
287 | if (ei->i_da_metadata_calc_len && |
288 | ei->i_da_metadata_calc_last_lblock+1 == lblock) { | |
289 | if ((ei->i_da_metadata_calc_len % idxs) == 0) | |
290 | num++; | |
291 | if ((ei->i_da_metadata_calc_len % (idxs*idxs)) == 0) | |
292 | num++; | |
293 | if ((ei->i_da_metadata_calc_len % (idxs*idxs*idxs)) == 0) { | |
294 | num++; | |
295 | ei->i_da_metadata_calc_len = 0; | |
296 | } else | |
297 | ei->i_da_metadata_calc_len++; | |
298 | ei->i_da_metadata_calc_last_lblock++; | |
299 | return num; | |
300 | } | |
d2a17637 | 301 | |
9d0be502 TT |
302 | /* |
303 | * In the worst case we need a new set of index blocks at | |
304 | * every level of the inode's extent tree. | |
305 | */ | |
306 | ei->i_da_metadata_calc_len = 1; | |
307 | ei->i_da_metadata_calc_last_lblock = lblock; | |
308 | return ext_depth(inode) + 1; | |
d2a17637 MC |
309 | } |
310 | ||
c29c0ae7 AT |
311 | static int |
312 | ext4_ext_max_entries(struct inode *inode, int depth) | |
313 | { | |
314 | int max; | |
315 | ||
316 | if (depth == ext_depth(inode)) { | |
317 | if (depth == 0) | |
55ad63bf | 318 | max = ext4_ext_space_root(inode, 1); |
c29c0ae7 | 319 | else |
55ad63bf | 320 | max = ext4_ext_space_root_idx(inode, 1); |
c29c0ae7 AT |
321 | } else { |
322 | if (depth == 0) | |
55ad63bf | 323 | max = ext4_ext_space_block(inode, 1); |
c29c0ae7 | 324 | else |
55ad63bf | 325 | max = ext4_ext_space_block_idx(inode, 1); |
c29c0ae7 AT |
326 | } |
327 | ||
328 | return max; | |
329 | } | |
330 | ||
56b19868 AK |
331 | static int ext4_valid_extent(struct inode *inode, struct ext4_extent *ext) |
332 | { | |
bf89d16f | 333 | ext4_fsblk_t block = ext4_ext_pblock(ext); |
56b19868 | 334 | int len = ext4_ext_get_actual_len(ext); |
e84a26ce | 335 | |
6fd058f7 | 336 | return ext4_data_block_valid(EXT4_SB(inode->i_sb), block, len); |
56b19868 AK |
337 | } |
338 | ||
339 | static int ext4_valid_extent_idx(struct inode *inode, | |
340 | struct ext4_extent_idx *ext_idx) | |
341 | { | |
bf89d16f | 342 | ext4_fsblk_t block = ext4_idx_pblock(ext_idx); |
e84a26ce | 343 | |
6fd058f7 | 344 | return ext4_data_block_valid(EXT4_SB(inode->i_sb), block, 1); |
56b19868 AK |
345 | } |
346 | ||
347 | static int ext4_valid_extent_entries(struct inode *inode, | |
348 | struct ext4_extent_header *eh, | |
349 | int depth) | |
350 | { | |
351 | struct ext4_extent *ext; | |
352 | struct ext4_extent_idx *ext_idx; | |
353 | unsigned short entries; | |
354 | if (eh->eh_entries == 0) | |
355 | return 1; | |
356 | ||
357 | entries = le16_to_cpu(eh->eh_entries); | |
358 | ||
359 | if (depth == 0) { | |
360 | /* leaf entries */ | |
361 | ext = EXT_FIRST_EXTENT(eh); | |
362 | while (entries) { | |
363 | if (!ext4_valid_extent(inode, ext)) | |
364 | return 0; | |
365 | ext++; | |
366 | entries--; | |
367 | } | |
368 | } else { | |
369 | ext_idx = EXT_FIRST_INDEX(eh); | |
370 | while (entries) { | |
371 | if (!ext4_valid_extent_idx(inode, ext_idx)) | |
372 | return 0; | |
373 | ext_idx++; | |
374 | entries--; | |
375 | } | |
376 | } | |
377 | return 1; | |
378 | } | |
379 | ||
c398eda0 TT |
380 | static int __ext4_ext_check(const char *function, unsigned int line, |
381 | struct inode *inode, struct ext4_extent_header *eh, | |
382 | int depth) | |
c29c0ae7 AT |
383 | { |
384 | const char *error_msg; | |
385 | int max = 0; | |
386 | ||
387 | if (unlikely(eh->eh_magic != EXT4_EXT_MAGIC)) { | |
388 | error_msg = "invalid magic"; | |
389 | goto corrupted; | |
390 | } | |
391 | if (unlikely(le16_to_cpu(eh->eh_depth) != depth)) { | |
392 | error_msg = "unexpected eh_depth"; | |
393 | goto corrupted; | |
394 | } | |
395 | if (unlikely(eh->eh_max == 0)) { | |
396 | error_msg = "invalid eh_max"; | |
397 | goto corrupted; | |
398 | } | |
399 | max = ext4_ext_max_entries(inode, depth); | |
400 | if (unlikely(le16_to_cpu(eh->eh_max) > max)) { | |
401 | error_msg = "too large eh_max"; | |
402 | goto corrupted; | |
403 | } | |
404 | if (unlikely(le16_to_cpu(eh->eh_entries) > le16_to_cpu(eh->eh_max))) { | |
405 | error_msg = "invalid eh_entries"; | |
406 | goto corrupted; | |
407 | } | |
56b19868 AK |
408 | if (!ext4_valid_extent_entries(inode, eh, depth)) { |
409 | error_msg = "invalid extent entries"; | |
410 | goto corrupted; | |
411 | } | |
c29c0ae7 AT |
412 | return 0; |
413 | ||
414 | corrupted: | |
c398eda0 | 415 | ext4_error_inode(inode, function, line, 0, |
24676da4 | 416 | "bad header/extent: %s - magic %x, " |
c29c0ae7 | 417 | "entries %u, max %u(%u), depth %u(%u)", |
24676da4 | 418 | error_msg, le16_to_cpu(eh->eh_magic), |
c29c0ae7 AT |
419 | le16_to_cpu(eh->eh_entries), le16_to_cpu(eh->eh_max), |
420 | max, le16_to_cpu(eh->eh_depth), depth); | |
421 | ||
422 | return -EIO; | |
423 | } | |
424 | ||
56b19868 | 425 | #define ext4_ext_check(inode, eh, depth) \ |
c398eda0 | 426 | __ext4_ext_check(__func__, __LINE__, inode, eh, depth) |
c29c0ae7 | 427 | |
7a262f7c AK |
428 | int ext4_ext_check_inode(struct inode *inode) |
429 | { | |
430 | return ext4_ext_check(inode, ext_inode_hdr(inode), ext_depth(inode)); | |
431 | } | |
432 | ||
a86c6181 AT |
433 | #ifdef EXT_DEBUG |
434 | static void ext4_ext_show_path(struct inode *inode, struct ext4_ext_path *path) | |
435 | { | |
436 | int k, l = path->p_depth; | |
437 | ||
438 | ext_debug("path:"); | |
439 | for (k = 0; k <= l; k++, path++) { | |
440 | if (path->p_idx) { | |
2ae02107 | 441 | ext_debug(" %d->%llu", le32_to_cpu(path->p_idx->ei_block), |
bf89d16f | 442 | ext4_idx_pblock(path->p_idx)); |
a86c6181 | 443 | } else if (path->p_ext) { |
553f9008 | 444 | ext_debug(" %d:[%d]%d:%llu ", |
a86c6181 | 445 | le32_to_cpu(path->p_ext->ee_block), |
553f9008 | 446 | ext4_ext_is_uninitialized(path->p_ext), |
a2df2a63 | 447 | ext4_ext_get_actual_len(path->p_ext), |
bf89d16f | 448 | ext4_ext_pblock(path->p_ext)); |
a86c6181 AT |
449 | } else |
450 | ext_debug(" []"); | |
451 | } | |
452 | ext_debug("\n"); | |
453 | } | |
454 | ||
455 | static void ext4_ext_show_leaf(struct inode *inode, struct ext4_ext_path *path) | |
456 | { | |
457 | int depth = ext_depth(inode); | |
458 | struct ext4_extent_header *eh; | |
459 | struct ext4_extent *ex; | |
460 | int i; | |
461 | ||
462 | if (!path) | |
463 | return; | |
464 | ||
465 | eh = path[depth].p_hdr; | |
466 | ex = EXT_FIRST_EXTENT(eh); | |
467 | ||
553f9008 M |
468 | ext_debug("Displaying leaf extents for inode %lu\n", inode->i_ino); |
469 | ||
a86c6181 | 470 | for (i = 0; i < le16_to_cpu(eh->eh_entries); i++, ex++) { |
553f9008 M |
471 | ext_debug("%d:[%d]%d:%llu ", le32_to_cpu(ex->ee_block), |
472 | ext4_ext_is_uninitialized(ex), | |
bf89d16f | 473 | ext4_ext_get_actual_len(ex), ext4_ext_pblock(ex)); |
a86c6181 AT |
474 | } |
475 | ext_debug("\n"); | |
476 | } | |
477 | #else | |
af5bc92d TT |
478 | #define ext4_ext_show_path(inode, path) |
479 | #define ext4_ext_show_leaf(inode, path) | |
a86c6181 AT |
480 | #endif |
481 | ||
b35905c1 | 482 | void ext4_ext_drop_refs(struct ext4_ext_path *path) |
a86c6181 AT |
483 | { |
484 | int depth = path->p_depth; | |
485 | int i; | |
486 | ||
487 | for (i = 0; i <= depth; i++, path++) | |
488 | if (path->p_bh) { | |
489 | brelse(path->p_bh); | |
490 | path->p_bh = NULL; | |
491 | } | |
492 | } | |
493 | ||
494 | /* | |
d0d856e8 RD |
495 | * ext4_ext_binsearch_idx: |
496 | * binary search for the closest index of the given block | |
c29c0ae7 | 497 | * the header must be checked before calling this |
a86c6181 AT |
498 | */ |
499 | static void | |
725d26d3 AK |
500 | ext4_ext_binsearch_idx(struct inode *inode, |
501 | struct ext4_ext_path *path, ext4_lblk_t block) | |
a86c6181 AT |
502 | { |
503 | struct ext4_extent_header *eh = path->p_hdr; | |
504 | struct ext4_extent_idx *r, *l, *m; | |
505 | ||
a86c6181 | 506 | |
bba90743 | 507 | ext_debug("binsearch for %u(idx): ", block); |
a86c6181 AT |
508 | |
509 | l = EXT_FIRST_INDEX(eh) + 1; | |
e9f410b1 | 510 | r = EXT_LAST_INDEX(eh); |
a86c6181 AT |
511 | while (l <= r) { |
512 | m = l + (r - l) / 2; | |
513 | if (block < le32_to_cpu(m->ei_block)) | |
514 | r = m - 1; | |
515 | else | |
516 | l = m + 1; | |
26d535ed DM |
517 | ext_debug("%p(%u):%p(%u):%p(%u) ", l, le32_to_cpu(l->ei_block), |
518 | m, le32_to_cpu(m->ei_block), | |
519 | r, le32_to_cpu(r->ei_block)); | |
a86c6181 AT |
520 | } |
521 | ||
522 | path->p_idx = l - 1; | |
f65e6fba | 523 | ext_debug(" -> %d->%lld ", le32_to_cpu(path->p_idx->ei_block), |
bf89d16f | 524 | ext4_idx_pblock(path->p_idx)); |
a86c6181 AT |
525 | |
526 | #ifdef CHECK_BINSEARCH | |
527 | { | |
528 | struct ext4_extent_idx *chix, *ix; | |
529 | int k; | |
530 | ||
531 | chix = ix = EXT_FIRST_INDEX(eh); | |
532 | for (k = 0; k < le16_to_cpu(eh->eh_entries); k++, ix++) { | |
533 | if (k != 0 && | |
534 | le32_to_cpu(ix->ei_block) <= le32_to_cpu(ix[-1].ei_block)) { | |
4776004f TT |
535 | printk(KERN_DEBUG "k=%d, ix=0x%p, " |
536 | "first=0x%p\n", k, | |
537 | ix, EXT_FIRST_INDEX(eh)); | |
538 | printk(KERN_DEBUG "%u <= %u\n", | |
a86c6181 AT |
539 | le32_to_cpu(ix->ei_block), |
540 | le32_to_cpu(ix[-1].ei_block)); | |
541 | } | |
542 | BUG_ON(k && le32_to_cpu(ix->ei_block) | |
8c55e204 | 543 | <= le32_to_cpu(ix[-1].ei_block)); |
a86c6181 AT |
544 | if (block < le32_to_cpu(ix->ei_block)) |
545 | break; | |
546 | chix = ix; | |
547 | } | |
548 | BUG_ON(chix != path->p_idx); | |
549 | } | |
550 | #endif | |
551 | ||
552 | } | |
553 | ||
554 | /* | |
d0d856e8 RD |
555 | * ext4_ext_binsearch: |
556 | * binary search for closest extent of the given block | |
c29c0ae7 | 557 | * the header must be checked before calling this |
a86c6181 AT |
558 | */ |
559 | static void | |
725d26d3 AK |
560 | ext4_ext_binsearch(struct inode *inode, |
561 | struct ext4_ext_path *path, ext4_lblk_t block) | |
a86c6181 AT |
562 | { |
563 | struct ext4_extent_header *eh = path->p_hdr; | |
564 | struct ext4_extent *r, *l, *m; | |
565 | ||
a86c6181 AT |
566 | if (eh->eh_entries == 0) { |
567 | /* | |
d0d856e8 RD |
568 | * this leaf is empty: |
569 | * we get such a leaf in split/add case | |
a86c6181 AT |
570 | */ |
571 | return; | |
572 | } | |
573 | ||
bba90743 | 574 | ext_debug("binsearch for %u: ", block); |
a86c6181 AT |
575 | |
576 | l = EXT_FIRST_EXTENT(eh) + 1; | |
e9f410b1 | 577 | r = EXT_LAST_EXTENT(eh); |
a86c6181 AT |
578 | |
579 | while (l <= r) { | |
580 | m = l + (r - l) / 2; | |
581 | if (block < le32_to_cpu(m->ee_block)) | |
582 | r = m - 1; | |
583 | else | |
584 | l = m + 1; | |
26d535ed DM |
585 | ext_debug("%p(%u):%p(%u):%p(%u) ", l, le32_to_cpu(l->ee_block), |
586 | m, le32_to_cpu(m->ee_block), | |
587 | r, le32_to_cpu(r->ee_block)); | |
a86c6181 AT |
588 | } |
589 | ||
590 | path->p_ext = l - 1; | |
553f9008 | 591 | ext_debug(" -> %d:%llu:[%d]%d ", |
8c55e204 | 592 | le32_to_cpu(path->p_ext->ee_block), |
bf89d16f | 593 | ext4_ext_pblock(path->p_ext), |
553f9008 | 594 | ext4_ext_is_uninitialized(path->p_ext), |
a2df2a63 | 595 | ext4_ext_get_actual_len(path->p_ext)); |
a86c6181 AT |
596 | |
597 | #ifdef CHECK_BINSEARCH | |
598 | { | |
599 | struct ext4_extent *chex, *ex; | |
600 | int k; | |
601 | ||
602 | chex = ex = EXT_FIRST_EXTENT(eh); | |
603 | for (k = 0; k < le16_to_cpu(eh->eh_entries); k++, ex++) { | |
604 | BUG_ON(k && le32_to_cpu(ex->ee_block) | |
8c55e204 | 605 | <= le32_to_cpu(ex[-1].ee_block)); |
a86c6181 AT |
606 | if (block < le32_to_cpu(ex->ee_block)) |
607 | break; | |
608 | chex = ex; | |
609 | } | |
610 | BUG_ON(chex != path->p_ext); | |
611 | } | |
612 | #endif | |
613 | ||
614 | } | |
615 | ||
616 | int ext4_ext_tree_init(handle_t *handle, struct inode *inode) | |
617 | { | |
618 | struct ext4_extent_header *eh; | |
619 | ||
620 | eh = ext_inode_hdr(inode); | |
621 | eh->eh_depth = 0; | |
622 | eh->eh_entries = 0; | |
623 | eh->eh_magic = EXT4_EXT_MAGIC; | |
55ad63bf | 624 | eh->eh_max = cpu_to_le16(ext4_ext_space_root(inode, 0)); |
a86c6181 AT |
625 | ext4_mark_inode_dirty(handle, inode); |
626 | ext4_ext_invalidate_cache(inode); | |
627 | return 0; | |
628 | } | |
629 | ||
630 | struct ext4_ext_path * | |
725d26d3 AK |
631 | ext4_ext_find_extent(struct inode *inode, ext4_lblk_t block, |
632 | struct ext4_ext_path *path) | |
a86c6181 AT |
633 | { |
634 | struct ext4_extent_header *eh; | |
635 | struct buffer_head *bh; | |
636 | short int depth, i, ppos = 0, alloc = 0; | |
637 | ||
638 | eh = ext_inode_hdr(inode); | |
c29c0ae7 | 639 | depth = ext_depth(inode); |
a86c6181 AT |
640 | |
641 | /* account possible depth increase */ | |
642 | if (!path) { | |
5d4958f9 | 643 | path = kzalloc(sizeof(struct ext4_ext_path) * (depth + 2), |
a86c6181 AT |
644 | GFP_NOFS); |
645 | if (!path) | |
646 | return ERR_PTR(-ENOMEM); | |
647 | alloc = 1; | |
648 | } | |
a86c6181 | 649 | path[0].p_hdr = eh; |
1973adcb | 650 | path[0].p_bh = NULL; |
a86c6181 | 651 | |
c29c0ae7 | 652 | i = depth; |
a86c6181 AT |
653 | /* walk through the tree */ |
654 | while (i) { | |
7a262f7c AK |
655 | int need_to_validate = 0; |
656 | ||
a86c6181 AT |
657 | ext_debug("depth %d: num %d, max %d\n", |
658 | ppos, le16_to_cpu(eh->eh_entries), le16_to_cpu(eh->eh_max)); | |
c29c0ae7 | 659 | |
a86c6181 | 660 | ext4_ext_binsearch_idx(inode, path + ppos, block); |
bf89d16f | 661 | path[ppos].p_block = ext4_idx_pblock(path[ppos].p_idx); |
a86c6181 AT |
662 | path[ppos].p_depth = i; |
663 | path[ppos].p_ext = NULL; | |
664 | ||
7a262f7c AK |
665 | bh = sb_getblk(inode->i_sb, path[ppos].p_block); |
666 | if (unlikely(!bh)) | |
a86c6181 | 667 | goto err; |
7a262f7c | 668 | if (!bh_uptodate_or_lock(bh)) { |
0562e0ba JZ |
669 | trace_ext4_ext_load_extent(inode, block, |
670 | path[ppos].p_block); | |
7a262f7c AK |
671 | if (bh_submit_read(bh) < 0) { |
672 | put_bh(bh); | |
673 | goto err; | |
674 | } | |
675 | /* validate the extent entries */ | |
676 | need_to_validate = 1; | |
677 | } | |
a86c6181 AT |
678 | eh = ext_block_hdr(bh); |
679 | ppos++; | |
273df556 FM |
680 | if (unlikely(ppos > depth)) { |
681 | put_bh(bh); | |
682 | EXT4_ERROR_INODE(inode, | |
683 | "ppos %d > depth %d", ppos, depth); | |
684 | goto err; | |
685 | } | |
a86c6181 AT |
686 | path[ppos].p_bh = bh; |
687 | path[ppos].p_hdr = eh; | |
688 | i--; | |
689 | ||
7a262f7c | 690 | if (need_to_validate && ext4_ext_check(inode, eh, i)) |
a86c6181 AT |
691 | goto err; |
692 | } | |
693 | ||
694 | path[ppos].p_depth = i; | |
a86c6181 AT |
695 | path[ppos].p_ext = NULL; |
696 | path[ppos].p_idx = NULL; | |
697 | ||
a86c6181 AT |
698 | /* find extent */ |
699 | ext4_ext_binsearch(inode, path + ppos, block); | |
1973adcb SF |
700 | /* if not an empty leaf */ |
701 | if (path[ppos].p_ext) | |
bf89d16f | 702 | path[ppos].p_block = ext4_ext_pblock(path[ppos].p_ext); |
a86c6181 AT |
703 | |
704 | ext4_ext_show_path(inode, path); | |
705 | ||
706 | return path; | |
707 | ||
708 | err: | |
709 | ext4_ext_drop_refs(path); | |
710 | if (alloc) | |
711 | kfree(path); | |
712 | return ERR_PTR(-EIO); | |
713 | } | |
714 | ||
715 | /* | |
d0d856e8 RD |
716 | * ext4_ext_insert_index: |
717 | * insert new index [@logical;@ptr] into the block at @curp; | |
718 | * check where to insert: before @curp or after @curp | |
a86c6181 | 719 | */ |
1f109d5a TT |
720 | static int ext4_ext_insert_index(handle_t *handle, struct inode *inode, |
721 | struct ext4_ext_path *curp, | |
722 | int logical, ext4_fsblk_t ptr) | |
a86c6181 AT |
723 | { |
724 | struct ext4_extent_idx *ix; | |
725 | int len, err; | |
726 | ||
7e028976 AM |
727 | err = ext4_ext_get_access(handle, inode, curp); |
728 | if (err) | |
a86c6181 AT |
729 | return err; |
730 | ||
273df556 FM |
731 | if (unlikely(logical == le32_to_cpu(curp->p_idx->ei_block))) { |
732 | EXT4_ERROR_INODE(inode, | |
733 | "logical %d == ei_block %d!", | |
734 | logical, le32_to_cpu(curp->p_idx->ei_block)); | |
735 | return -EIO; | |
736 | } | |
a86c6181 AT |
737 | len = EXT_MAX_INDEX(curp->p_hdr) - curp->p_idx; |
738 | if (logical > le32_to_cpu(curp->p_idx->ei_block)) { | |
739 | /* insert after */ | |
740 | if (curp->p_idx != EXT_LAST_INDEX(curp->p_hdr)) { | |
741 | len = (len - 1) * sizeof(struct ext4_extent_idx); | |
742 | len = len < 0 ? 0 : len; | |
26d535ed | 743 | ext_debug("insert new index %d after: %llu. " |
a86c6181 AT |
744 | "move %d from 0x%p to 0x%p\n", |
745 | logical, ptr, len, | |
746 | (curp->p_idx + 1), (curp->p_idx + 2)); | |
747 | memmove(curp->p_idx + 2, curp->p_idx + 1, len); | |
748 | } | |
749 | ix = curp->p_idx + 1; | |
750 | } else { | |
751 | /* insert before */ | |
752 | len = len * sizeof(struct ext4_extent_idx); | |
753 | len = len < 0 ? 0 : len; | |
26d535ed | 754 | ext_debug("insert new index %d before: %llu. " |
a86c6181 AT |
755 | "move %d from 0x%p to 0x%p\n", |
756 | logical, ptr, len, | |
757 | curp->p_idx, (curp->p_idx + 1)); | |
758 | memmove(curp->p_idx + 1, curp->p_idx, len); | |
759 | ix = curp->p_idx; | |
760 | } | |
761 | ||
762 | ix->ei_block = cpu_to_le32(logical); | |
f65e6fba | 763 | ext4_idx_store_pblock(ix, ptr); |
e8546d06 | 764 | le16_add_cpu(&curp->p_hdr->eh_entries, 1); |
a86c6181 | 765 | |
273df556 FM |
766 | if (unlikely(le16_to_cpu(curp->p_hdr->eh_entries) |
767 | > le16_to_cpu(curp->p_hdr->eh_max))) { | |
768 | EXT4_ERROR_INODE(inode, | |
769 | "logical %d == ei_block %d!", | |
770 | logical, le32_to_cpu(curp->p_idx->ei_block)); | |
771 | return -EIO; | |
772 | } | |
773 | if (unlikely(ix > EXT_LAST_INDEX(curp->p_hdr))) { | |
774 | EXT4_ERROR_INODE(inode, "ix > EXT_LAST_INDEX!"); | |
775 | return -EIO; | |
776 | } | |
a86c6181 AT |
777 | |
778 | err = ext4_ext_dirty(handle, inode, curp); | |
779 | ext4_std_error(inode->i_sb, err); | |
780 | ||
781 | return err; | |
782 | } | |
783 | ||
784 | /* | |
d0d856e8 RD |
785 | * ext4_ext_split: |
786 | * inserts new subtree into the path, using free index entry | |
787 | * at depth @at: | |
788 | * - allocates all needed blocks (new leaf and all intermediate index blocks) | |
789 | * - makes decision where to split | |
790 | * - moves remaining extents and index entries (right to the split point) | |
791 | * into the newly allocated blocks | |
792 | * - initializes subtree | |
a86c6181 AT |
793 | */ |
794 | static int ext4_ext_split(handle_t *handle, struct inode *inode, | |
795 | struct ext4_ext_path *path, | |
796 | struct ext4_extent *newext, int at) | |
797 | { | |
798 | struct buffer_head *bh = NULL; | |
799 | int depth = ext_depth(inode); | |
800 | struct ext4_extent_header *neh; | |
801 | struct ext4_extent_idx *fidx; | |
802 | struct ext4_extent *ex; | |
803 | int i = at, k, m, a; | |
f65e6fba | 804 | ext4_fsblk_t newblock, oldblock; |
a86c6181 | 805 | __le32 border; |
f65e6fba | 806 | ext4_fsblk_t *ablocks = NULL; /* array of allocated blocks */ |
a86c6181 AT |
807 | int err = 0; |
808 | ||
809 | /* make decision: where to split? */ | |
d0d856e8 | 810 | /* FIXME: now decision is simplest: at current extent */ |
a86c6181 | 811 | |
d0d856e8 | 812 | /* if current leaf will be split, then we should use |
a86c6181 | 813 | * border from split point */ |
273df556 FM |
814 | if (unlikely(path[depth].p_ext > EXT_MAX_EXTENT(path[depth].p_hdr))) { |
815 | EXT4_ERROR_INODE(inode, "p_ext > EXT_MAX_EXTENT!"); | |
816 | return -EIO; | |
817 | } | |
a86c6181 AT |
818 | if (path[depth].p_ext != EXT_MAX_EXTENT(path[depth].p_hdr)) { |
819 | border = path[depth].p_ext[1].ee_block; | |
d0d856e8 | 820 | ext_debug("leaf will be split." |
a86c6181 | 821 | " next leaf starts at %d\n", |
8c55e204 | 822 | le32_to_cpu(border)); |
a86c6181 AT |
823 | } else { |
824 | border = newext->ee_block; | |
825 | ext_debug("leaf will be added." | |
826 | " next leaf starts at %d\n", | |
8c55e204 | 827 | le32_to_cpu(border)); |
a86c6181 AT |
828 | } |
829 | ||
830 | /* | |
d0d856e8 RD |
831 | * If error occurs, then we break processing |
832 | * and mark filesystem read-only. index won't | |
a86c6181 | 833 | * be inserted and tree will be in consistent |
d0d856e8 | 834 | * state. Next mount will repair buffers too. |
a86c6181 AT |
835 | */ |
836 | ||
837 | /* | |
d0d856e8 RD |
838 | * Get array to track all allocated blocks. |
839 | * We need this to handle errors and free blocks | |
840 | * upon them. | |
a86c6181 | 841 | */ |
5d4958f9 | 842 | ablocks = kzalloc(sizeof(ext4_fsblk_t) * depth, GFP_NOFS); |
a86c6181 AT |
843 | if (!ablocks) |
844 | return -ENOMEM; | |
a86c6181 AT |
845 | |
846 | /* allocate all needed blocks */ | |
847 | ext_debug("allocate %d blocks for indexes/leaf\n", depth - at); | |
848 | for (a = 0; a < depth - at; a++) { | |
654b4908 AK |
849 | newblock = ext4_ext_new_meta_block(handle, inode, path, |
850 | newext, &err); | |
a86c6181 AT |
851 | if (newblock == 0) |
852 | goto cleanup; | |
853 | ablocks[a] = newblock; | |
854 | } | |
855 | ||
856 | /* initialize new leaf */ | |
857 | newblock = ablocks[--a]; | |
273df556 FM |
858 | if (unlikely(newblock == 0)) { |
859 | EXT4_ERROR_INODE(inode, "newblock == 0!"); | |
860 | err = -EIO; | |
861 | goto cleanup; | |
862 | } | |
a86c6181 AT |
863 | bh = sb_getblk(inode->i_sb, newblock); |
864 | if (!bh) { | |
865 | err = -EIO; | |
866 | goto cleanup; | |
867 | } | |
868 | lock_buffer(bh); | |
869 | ||
7e028976 AM |
870 | err = ext4_journal_get_create_access(handle, bh); |
871 | if (err) | |
a86c6181 AT |
872 | goto cleanup; |
873 | ||
874 | neh = ext_block_hdr(bh); | |
875 | neh->eh_entries = 0; | |
55ad63bf | 876 | neh->eh_max = cpu_to_le16(ext4_ext_space_block(inode, 0)); |
a86c6181 AT |
877 | neh->eh_magic = EXT4_EXT_MAGIC; |
878 | neh->eh_depth = 0; | |
879 | ex = EXT_FIRST_EXTENT(neh); | |
880 | ||
d0d856e8 | 881 | /* move remainder of path[depth] to the new leaf */ |
273df556 FM |
882 | if (unlikely(path[depth].p_hdr->eh_entries != |
883 | path[depth].p_hdr->eh_max)) { | |
884 | EXT4_ERROR_INODE(inode, "eh_entries %d != eh_max %d!", | |
885 | path[depth].p_hdr->eh_entries, | |
886 | path[depth].p_hdr->eh_max); | |
887 | err = -EIO; | |
888 | goto cleanup; | |
889 | } | |
a86c6181 AT |
890 | /* start copy from next extent */ |
891 | /* TODO: we could do it by single memmove */ | |
892 | m = 0; | |
893 | path[depth].p_ext++; | |
894 | while (path[depth].p_ext <= | |
895 | EXT_MAX_EXTENT(path[depth].p_hdr)) { | |
553f9008 | 896 | ext_debug("move %d:%llu:[%d]%d in new leaf %llu\n", |
8c55e204 | 897 | le32_to_cpu(path[depth].p_ext->ee_block), |
bf89d16f | 898 | ext4_ext_pblock(path[depth].p_ext), |
553f9008 | 899 | ext4_ext_is_uninitialized(path[depth].p_ext), |
a2df2a63 | 900 | ext4_ext_get_actual_len(path[depth].p_ext), |
a86c6181 AT |
901 | newblock); |
902 | /*memmove(ex++, path[depth].p_ext++, | |
903 | sizeof(struct ext4_extent)); | |
904 | neh->eh_entries++;*/ | |
905 | path[depth].p_ext++; | |
906 | m++; | |
907 | } | |
908 | if (m) { | |
909 | memmove(ex, path[depth].p_ext-m, sizeof(struct ext4_extent)*m); | |
e8546d06 | 910 | le16_add_cpu(&neh->eh_entries, m); |
a86c6181 AT |
911 | } |
912 | ||
913 | set_buffer_uptodate(bh); | |
914 | unlock_buffer(bh); | |
915 | ||
0390131b | 916 | err = ext4_handle_dirty_metadata(handle, inode, bh); |
7e028976 | 917 | if (err) |
a86c6181 AT |
918 | goto cleanup; |
919 | brelse(bh); | |
920 | bh = NULL; | |
921 | ||
922 | /* correct old leaf */ | |
923 | if (m) { | |
7e028976 AM |
924 | err = ext4_ext_get_access(handle, inode, path + depth); |
925 | if (err) | |
a86c6181 | 926 | goto cleanup; |
e8546d06 | 927 | le16_add_cpu(&path[depth].p_hdr->eh_entries, -m); |
7e028976 AM |
928 | err = ext4_ext_dirty(handle, inode, path + depth); |
929 | if (err) | |
a86c6181 AT |
930 | goto cleanup; |
931 | ||
932 | } | |
933 | ||
934 | /* create intermediate indexes */ | |
935 | k = depth - at - 1; | |
273df556 FM |
936 | if (unlikely(k < 0)) { |
937 | EXT4_ERROR_INODE(inode, "k %d < 0!", k); | |
938 | err = -EIO; | |
939 | goto cleanup; | |
940 | } | |
a86c6181 AT |
941 | if (k) |
942 | ext_debug("create %d intermediate indices\n", k); | |
943 | /* insert new index into current index block */ | |
944 | /* current depth stored in i var */ | |
945 | i = depth - 1; | |
946 | while (k--) { | |
947 | oldblock = newblock; | |
948 | newblock = ablocks[--a]; | |
bba90743 | 949 | bh = sb_getblk(inode->i_sb, newblock); |
a86c6181 AT |
950 | if (!bh) { |
951 | err = -EIO; | |
952 | goto cleanup; | |
953 | } | |
954 | lock_buffer(bh); | |
955 | ||
7e028976 AM |
956 | err = ext4_journal_get_create_access(handle, bh); |
957 | if (err) | |
a86c6181 AT |
958 | goto cleanup; |
959 | ||
960 | neh = ext_block_hdr(bh); | |
961 | neh->eh_entries = cpu_to_le16(1); | |
962 | neh->eh_magic = EXT4_EXT_MAGIC; | |
55ad63bf | 963 | neh->eh_max = cpu_to_le16(ext4_ext_space_block_idx(inode, 0)); |
a86c6181 AT |
964 | neh->eh_depth = cpu_to_le16(depth - i); |
965 | fidx = EXT_FIRST_INDEX(neh); | |
966 | fidx->ei_block = border; | |
f65e6fba | 967 | ext4_idx_store_pblock(fidx, oldblock); |
a86c6181 | 968 | |
bba90743 ES |
969 | ext_debug("int.index at %d (block %llu): %u -> %llu\n", |
970 | i, newblock, le32_to_cpu(border), oldblock); | |
a86c6181 AT |
971 | /* copy indexes */ |
972 | m = 0; | |
973 | path[i].p_idx++; | |
974 | ||
975 | ext_debug("cur 0x%p, last 0x%p\n", path[i].p_idx, | |
976 | EXT_MAX_INDEX(path[i].p_hdr)); | |
273df556 FM |
977 | if (unlikely(EXT_MAX_INDEX(path[i].p_hdr) != |
978 | EXT_LAST_INDEX(path[i].p_hdr))) { | |
979 | EXT4_ERROR_INODE(inode, | |
980 | "EXT_MAX_INDEX != EXT_LAST_INDEX ee_block %d!", | |
981 | le32_to_cpu(path[i].p_ext->ee_block)); | |
982 | err = -EIO; | |
983 | goto cleanup; | |
984 | } | |
a86c6181 | 985 | while (path[i].p_idx <= EXT_MAX_INDEX(path[i].p_hdr)) { |
26d535ed | 986 | ext_debug("%d: move %d:%llu in new index %llu\n", i, |
8c55e204 | 987 | le32_to_cpu(path[i].p_idx->ei_block), |
bf89d16f | 988 | ext4_idx_pblock(path[i].p_idx), |
8c55e204 | 989 | newblock); |
a86c6181 AT |
990 | /*memmove(++fidx, path[i].p_idx++, |
991 | sizeof(struct ext4_extent_idx)); | |
992 | neh->eh_entries++; | |
993 | BUG_ON(neh->eh_entries > neh->eh_max);*/ | |
994 | path[i].p_idx++; | |
995 | m++; | |
996 | } | |
997 | if (m) { | |
998 | memmove(++fidx, path[i].p_idx - m, | |
999 | sizeof(struct ext4_extent_idx) * m); | |
e8546d06 | 1000 | le16_add_cpu(&neh->eh_entries, m); |
a86c6181 AT |
1001 | } |
1002 | set_buffer_uptodate(bh); | |
1003 | unlock_buffer(bh); | |
1004 | ||
0390131b | 1005 | err = ext4_handle_dirty_metadata(handle, inode, bh); |
7e028976 | 1006 | if (err) |
a86c6181 AT |
1007 | goto cleanup; |
1008 | brelse(bh); | |
1009 | bh = NULL; | |
1010 | ||
1011 | /* correct old index */ | |
1012 | if (m) { | |
1013 | err = ext4_ext_get_access(handle, inode, path + i); | |
1014 | if (err) | |
1015 | goto cleanup; | |
e8546d06 | 1016 | le16_add_cpu(&path[i].p_hdr->eh_entries, -m); |
a86c6181 AT |
1017 | err = ext4_ext_dirty(handle, inode, path + i); |
1018 | if (err) | |
1019 | goto cleanup; | |
1020 | } | |
1021 | ||
1022 | i--; | |
1023 | } | |
1024 | ||
1025 | /* insert new index */ | |
a86c6181 AT |
1026 | err = ext4_ext_insert_index(handle, inode, path + at, |
1027 | le32_to_cpu(border), newblock); | |
1028 | ||
1029 | cleanup: | |
1030 | if (bh) { | |
1031 | if (buffer_locked(bh)) | |
1032 | unlock_buffer(bh); | |
1033 | brelse(bh); | |
1034 | } | |
1035 | ||
1036 | if (err) { | |
1037 | /* free all allocated blocks in error case */ | |
1038 | for (i = 0; i < depth; i++) { | |
1039 | if (!ablocks[i]) | |
1040 | continue; | |
7dc57615 | 1041 | ext4_free_blocks(handle, inode, NULL, ablocks[i], 1, |
e6362609 | 1042 | EXT4_FREE_BLOCKS_METADATA); |
a86c6181 AT |
1043 | } |
1044 | } | |
1045 | kfree(ablocks); | |
1046 | ||
1047 | return err; | |
1048 | } | |
1049 | ||
1050 | /* | |
d0d856e8 RD |
1051 | * ext4_ext_grow_indepth: |
1052 | * implements tree growing procedure: | |
1053 | * - allocates new block | |
1054 | * - moves top-level data (index block or leaf) into the new block | |
1055 | * - initializes new top-level, creating index that points to the | |
1056 | * just created block | |
a86c6181 AT |
1057 | */ |
1058 | static int ext4_ext_grow_indepth(handle_t *handle, struct inode *inode, | |
1059 | struct ext4_ext_path *path, | |
1060 | struct ext4_extent *newext) | |
1061 | { | |
1062 | struct ext4_ext_path *curp = path; | |
1063 | struct ext4_extent_header *neh; | |
a86c6181 | 1064 | struct buffer_head *bh; |
f65e6fba | 1065 | ext4_fsblk_t newblock; |
a86c6181 AT |
1066 | int err = 0; |
1067 | ||
654b4908 | 1068 | newblock = ext4_ext_new_meta_block(handle, inode, path, newext, &err); |
a86c6181 AT |
1069 | if (newblock == 0) |
1070 | return err; | |
1071 | ||
1072 | bh = sb_getblk(inode->i_sb, newblock); | |
1073 | if (!bh) { | |
1074 | err = -EIO; | |
1075 | ext4_std_error(inode->i_sb, err); | |
1076 | return err; | |
1077 | } | |
1078 | lock_buffer(bh); | |
1079 | ||
7e028976 AM |
1080 | err = ext4_journal_get_create_access(handle, bh); |
1081 | if (err) { | |
a86c6181 AT |
1082 | unlock_buffer(bh); |
1083 | goto out; | |
1084 | } | |
1085 | ||
1086 | /* move top-level index/leaf into new block */ | |
1087 | memmove(bh->b_data, curp->p_hdr, sizeof(EXT4_I(inode)->i_data)); | |
1088 | ||
1089 | /* set size of new block */ | |
1090 | neh = ext_block_hdr(bh); | |
1091 | /* old root could have indexes or leaves | |
1092 | * so calculate e_max right way */ | |
1093 | if (ext_depth(inode)) | |
55ad63bf | 1094 | neh->eh_max = cpu_to_le16(ext4_ext_space_block_idx(inode, 0)); |
a86c6181 | 1095 | else |
55ad63bf | 1096 | neh->eh_max = cpu_to_le16(ext4_ext_space_block(inode, 0)); |
a86c6181 AT |
1097 | neh->eh_magic = EXT4_EXT_MAGIC; |
1098 | set_buffer_uptodate(bh); | |
1099 | unlock_buffer(bh); | |
1100 | ||
0390131b | 1101 | err = ext4_handle_dirty_metadata(handle, inode, bh); |
7e028976 | 1102 | if (err) |
a86c6181 AT |
1103 | goto out; |
1104 | ||
1105 | /* create index in new top-level index: num,max,pointer */ | |
7e028976 AM |
1106 | err = ext4_ext_get_access(handle, inode, curp); |
1107 | if (err) | |
a86c6181 AT |
1108 | goto out; |
1109 | ||
1110 | curp->p_hdr->eh_magic = EXT4_EXT_MAGIC; | |
55ad63bf | 1111 | curp->p_hdr->eh_max = cpu_to_le16(ext4_ext_space_root_idx(inode, 0)); |
a86c6181 AT |
1112 | curp->p_hdr->eh_entries = cpu_to_le16(1); |
1113 | curp->p_idx = EXT_FIRST_INDEX(curp->p_hdr); | |
e9f410b1 DM |
1114 | |
1115 | if (path[0].p_hdr->eh_depth) | |
1116 | curp->p_idx->ei_block = | |
1117 | EXT_FIRST_INDEX(path[0].p_hdr)->ei_block; | |
1118 | else | |
1119 | curp->p_idx->ei_block = | |
1120 | EXT_FIRST_EXTENT(path[0].p_hdr)->ee_block; | |
f65e6fba | 1121 | ext4_idx_store_pblock(curp->p_idx, newblock); |
a86c6181 AT |
1122 | |
1123 | neh = ext_inode_hdr(inode); | |
2ae02107 | 1124 | ext_debug("new root: num %d(%d), lblock %d, ptr %llu\n", |
a86c6181 | 1125 | le16_to_cpu(neh->eh_entries), le16_to_cpu(neh->eh_max), |
5a0790c2 | 1126 | le32_to_cpu(EXT_FIRST_INDEX(neh)->ei_block), |
bf89d16f | 1127 | ext4_idx_pblock(EXT_FIRST_INDEX(neh))); |
a86c6181 AT |
1128 | |
1129 | neh->eh_depth = cpu_to_le16(path->p_depth + 1); | |
1130 | err = ext4_ext_dirty(handle, inode, curp); | |
1131 | out: | |
1132 | brelse(bh); | |
1133 | ||
1134 | return err; | |
1135 | } | |
1136 | ||
1137 | /* | |
d0d856e8 RD |
1138 | * ext4_ext_create_new_leaf: |
1139 | * finds empty index and adds new leaf. | |
1140 | * if no free index is found, then it requests in-depth growing. | |
a86c6181 AT |
1141 | */ |
1142 | static int ext4_ext_create_new_leaf(handle_t *handle, struct inode *inode, | |
1143 | struct ext4_ext_path *path, | |
1144 | struct ext4_extent *newext) | |
1145 | { | |
1146 | struct ext4_ext_path *curp; | |
1147 | int depth, i, err = 0; | |
1148 | ||
1149 | repeat: | |
1150 | i = depth = ext_depth(inode); | |
1151 | ||
1152 | /* walk up to the tree and look for free index entry */ | |
1153 | curp = path + depth; | |
1154 | while (i > 0 && !EXT_HAS_FREE_INDEX(curp)) { | |
1155 | i--; | |
1156 | curp--; | |
1157 | } | |
1158 | ||
d0d856e8 RD |
1159 | /* we use already allocated block for index block, |
1160 | * so subsequent data blocks should be contiguous */ | |
a86c6181 AT |
1161 | if (EXT_HAS_FREE_INDEX(curp)) { |
1162 | /* if we found index with free entry, then use that | |
1163 | * entry: create all needed subtree and add new leaf */ | |
1164 | err = ext4_ext_split(handle, inode, path, newext, i); | |
787e0981 SF |
1165 | if (err) |
1166 | goto out; | |
a86c6181 AT |
1167 | |
1168 | /* refill path */ | |
1169 | ext4_ext_drop_refs(path); | |
1170 | path = ext4_ext_find_extent(inode, | |
725d26d3 AK |
1171 | (ext4_lblk_t)le32_to_cpu(newext->ee_block), |
1172 | path); | |
a86c6181 AT |
1173 | if (IS_ERR(path)) |
1174 | err = PTR_ERR(path); | |
1175 | } else { | |
1176 | /* tree is full, time to grow in depth */ | |
1177 | err = ext4_ext_grow_indepth(handle, inode, path, newext); | |
1178 | if (err) | |
1179 | goto out; | |
1180 | ||
1181 | /* refill path */ | |
1182 | ext4_ext_drop_refs(path); | |
1183 | path = ext4_ext_find_extent(inode, | |
725d26d3 AK |
1184 | (ext4_lblk_t)le32_to_cpu(newext->ee_block), |
1185 | path); | |
a86c6181 AT |
1186 | if (IS_ERR(path)) { |
1187 | err = PTR_ERR(path); | |
1188 | goto out; | |
1189 | } | |
1190 | ||
1191 | /* | |
d0d856e8 RD |
1192 | * only first (depth 0 -> 1) produces free space; |
1193 | * in all other cases we have to split the grown tree | |
a86c6181 AT |
1194 | */ |
1195 | depth = ext_depth(inode); | |
1196 | if (path[depth].p_hdr->eh_entries == path[depth].p_hdr->eh_max) { | |
d0d856e8 | 1197 | /* now we need to split */ |
a86c6181 AT |
1198 | goto repeat; |
1199 | } | |
1200 | } | |
1201 | ||
1202 | out: | |
1203 | return err; | |
1204 | } | |
1205 | ||
1988b51e AT |
1206 | /* |
1207 | * search the closest allocated block to the left for *logical | |
1208 | * and returns it at @logical + it's physical address at @phys | |
1209 | * if *logical is the smallest allocated block, the function | |
1210 | * returns 0 at @phys | |
1211 | * return value contains 0 (success) or error code | |
1212 | */ | |
1f109d5a TT |
1213 | static int ext4_ext_search_left(struct inode *inode, |
1214 | struct ext4_ext_path *path, | |
1215 | ext4_lblk_t *logical, ext4_fsblk_t *phys) | |
1988b51e AT |
1216 | { |
1217 | struct ext4_extent_idx *ix; | |
1218 | struct ext4_extent *ex; | |
b939e376 | 1219 | int depth, ee_len; |
1988b51e | 1220 | |
273df556 FM |
1221 | if (unlikely(path == NULL)) { |
1222 | EXT4_ERROR_INODE(inode, "path == NULL *logical %d!", *logical); | |
1223 | return -EIO; | |
1224 | } | |
1988b51e AT |
1225 | depth = path->p_depth; |
1226 | *phys = 0; | |
1227 | ||
1228 | if (depth == 0 && path->p_ext == NULL) | |
1229 | return 0; | |
1230 | ||
1231 | /* usually extent in the path covers blocks smaller | |
1232 | * then *logical, but it can be that extent is the | |
1233 | * first one in the file */ | |
1234 | ||
1235 | ex = path[depth].p_ext; | |
b939e376 | 1236 | ee_len = ext4_ext_get_actual_len(ex); |
1988b51e | 1237 | if (*logical < le32_to_cpu(ex->ee_block)) { |
273df556 FM |
1238 | if (unlikely(EXT_FIRST_EXTENT(path[depth].p_hdr) != ex)) { |
1239 | EXT4_ERROR_INODE(inode, | |
1240 | "EXT_FIRST_EXTENT != ex *logical %d ee_block %d!", | |
1241 | *logical, le32_to_cpu(ex->ee_block)); | |
1242 | return -EIO; | |
1243 | } | |
1988b51e AT |
1244 | while (--depth >= 0) { |
1245 | ix = path[depth].p_idx; | |
273df556 FM |
1246 | if (unlikely(ix != EXT_FIRST_INDEX(path[depth].p_hdr))) { |
1247 | EXT4_ERROR_INODE(inode, | |
1248 | "ix (%d) != EXT_FIRST_INDEX (%d) (depth %d)!", | |
1249 | ix != NULL ? ix->ei_block : 0, | |
1250 | EXT_FIRST_INDEX(path[depth].p_hdr) != NULL ? | |
1251 | EXT_FIRST_INDEX(path[depth].p_hdr)->ei_block : 0, | |
1252 | depth); | |
1253 | return -EIO; | |
1254 | } | |
1988b51e AT |
1255 | } |
1256 | return 0; | |
1257 | } | |
1258 | ||
273df556 FM |
1259 | if (unlikely(*logical < (le32_to_cpu(ex->ee_block) + ee_len))) { |
1260 | EXT4_ERROR_INODE(inode, | |
1261 | "logical %d < ee_block %d + ee_len %d!", | |
1262 | *logical, le32_to_cpu(ex->ee_block), ee_len); | |
1263 | return -EIO; | |
1264 | } | |
1988b51e | 1265 | |
b939e376 | 1266 | *logical = le32_to_cpu(ex->ee_block) + ee_len - 1; |
bf89d16f | 1267 | *phys = ext4_ext_pblock(ex) + ee_len - 1; |
1988b51e AT |
1268 | return 0; |
1269 | } | |
1270 | ||
1271 | /* | |
1272 | * search the closest allocated block to the right for *logical | |
1273 | * and returns it at @logical + it's physical address at @phys | |
1274 | * if *logical is the smallest allocated block, the function | |
1275 | * returns 0 at @phys | |
1276 | * return value contains 0 (success) or error code | |
1277 | */ | |
1f109d5a TT |
1278 | static int ext4_ext_search_right(struct inode *inode, |
1279 | struct ext4_ext_path *path, | |
1280 | ext4_lblk_t *logical, ext4_fsblk_t *phys) | |
1988b51e AT |
1281 | { |
1282 | struct buffer_head *bh = NULL; | |
1283 | struct ext4_extent_header *eh; | |
1284 | struct ext4_extent_idx *ix; | |
1285 | struct ext4_extent *ex; | |
1286 | ext4_fsblk_t block; | |
395a87bf ES |
1287 | int depth; /* Note, NOT eh_depth; depth from top of tree */ |
1288 | int ee_len; | |
1988b51e | 1289 | |
273df556 FM |
1290 | if (unlikely(path == NULL)) { |
1291 | EXT4_ERROR_INODE(inode, "path == NULL *logical %d!", *logical); | |
1292 | return -EIO; | |
1293 | } | |
1988b51e AT |
1294 | depth = path->p_depth; |
1295 | *phys = 0; | |
1296 | ||
1297 | if (depth == 0 && path->p_ext == NULL) | |
1298 | return 0; | |
1299 | ||
1300 | /* usually extent in the path covers blocks smaller | |
1301 | * then *logical, but it can be that extent is the | |
1302 | * first one in the file */ | |
1303 | ||
1304 | ex = path[depth].p_ext; | |
b939e376 | 1305 | ee_len = ext4_ext_get_actual_len(ex); |
1988b51e | 1306 | if (*logical < le32_to_cpu(ex->ee_block)) { |
273df556 FM |
1307 | if (unlikely(EXT_FIRST_EXTENT(path[depth].p_hdr) != ex)) { |
1308 | EXT4_ERROR_INODE(inode, | |
1309 | "first_extent(path[%d].p_hdr) != ex", | |
1310 | depth); | |
1311 | return -EIO; | |
1312 | } | |
1988b51e AT |
1313 | while (--depth >= 0) { |
1314 | ix = path[depth].p_idx; | |
273df556 FM |
1315 | if (unlikely(ix != EXT_FIRST_INDEX(path[depth].p_hdr))) { |
1316 | EXT4_ERROR_INODE(inode, | |
1317 | "ix != EXT_FIRST_INDEX *logical %d!", | |
1318 | *logical); | |
1319 | return -EIO; | |
1320 | } | |
1988b51e AT |
1321 | } |
1322 | *logical = le32_to_cpu(ex->ee_block); | |
bf89d16f | 1323 | *phys = ext4_ext_pblock(ex); |
1988b51e AT |
1324 | return 0; |
1325 | } | |
1326 | ||
273df556 FM |
1327 | if (unlikely(*logical < (le32_to_cpu(ex->ee_block) + ee_len))) { |
1328 | EXT4_ERROR_INODE(inode, | |
1329 | "logical %d < ee_block %d + ee_len %d!", | |
1330 | *logical, le32_to_cpu(ex->ee_block), ee_len); | |
1331 | return -EIO; | |
1332 | } | |
1988b51e AT |
1333 | |
1334 | if (ex != EXT_LAST_EXTENT(path[depth].p_hdr)) { | |
1335 | /* next allocated block in this leaf */ | |
1336 | ex++; | |
1337 | *logical = le32_to_cpu(ex->ee_block); | |
bf89d16f | 1338 | *phys = ext4_ext_pblock(ex); |
1988b51e AT |
1339 | return 0; |
1340 | } | |
1341 | ||
1342 | /* go up and search for index to the right */ | |
1343 | while (--depth >= 0) { | |
1344 | ix = path[depth].p_idx; | |
1345 | if (ix != EXT_LAST_INDEX(path[depth].p_hdr)) | |
25f1ee3a | 1346 | goto got_index; |
1988b51e AT |
1347 | } |
1348 | ||
25f1ee3a WF |
1349 | /* we've gone up to the root and found no index to the right */ |
1350 | return 0; | |
1988b51e | 1351 | |
25f1ee3a | 1352 | got_index: |
1988b51e AT |
1353 | /* we've found index to the right, let's |
1354 | * follow it and find the closest allocated | |
1355 | * block to the right */ | |
1356 | ix++; | |
bf89d16f | 1357 | block = ext4_idx_pblock(ix); |
1988b51e AT |
1358 | while (++depth < path->p_depth) { |
1359 | bh = sb_bread(inode->i_sb, block); | |
1360 | if (bh == NULL) | |
1361 | return -EIO; | |
1362 | eh = ext_block_hdr(bh); | |
395a87bf | 1363 | /* subtract from p_depth to get proper eh_depth */ |
56b19868 | 1364 | if (ext4_ext_check(inode, eh, path->p_depth - depth)) { |
1988b51e AT |
1365 | put_bh(bh); |
1366 | return -EIO; | |
1367 | } | |
1368 | ix = EXT_FIRST_INDEX(eh); | |
bf89d16f | 1369 | block = ext4_idx_pblock(ix); |
1988b51e AT |
1370 | put_bh(bh); |
1371 | } | |
1372 | ||
1373 | bh = sb_bread(inode->i_sb, block); | |
1374 | if (bh == NULL) | |
1375 | return -EIO; | |
1376 | eh = ext_block_hdr(bh); | |
56b19868 | 1377 | if (ext4_ext_check(inode, eh, path->p_depth - depth)) { |
1988b51e AT |
1378 | put_bh(bh); |
1379 | return -EIO; | |
1380 | } | |
1381 | ex = EXT_FIRST_EXTENT(eh); | |
1382 | *logical = le32_to_cpu(ex->ee_block); | |
bf89d16f | 1383 | *phys = ext4_ext_pblock(ex); |
1988b51e AT |
1384 | put_bh(bh); |
1385 | return 0; | |
1988b51e AT |
1386 | } |
1387 | ||
a86c6181 | 1388 | /* |
d0d856e8 RD |
1389 | * ext4_ext_next_allocated_block: |
1390 | * returns allocated block in subsequent extent or EXT_MAX_BLOCK. | |
1391 | * NOTE: it considers block number from index entry as | |
1392 | * allocated block. Thus, index entries have to be consistent | |
1393 | * with leaves. | |
a86c6181 | 1394 | */ |
725d26d3 | 1395 | static ext4_lblk_t |
a86c6181 AT |
1396 | ext4_ext_next_allocated_block(struct ext4_ext_path *path) |
1397 | { | |
1398 | int depth; | |
1399 | ||
1400 | BUG_ON(path == NULL); | |
1401 | depth = path->p_depth; | |
1402 | ||
1403 | if (depth == 0 && path->p_ext == NULL) | |
1404 | return EXT_MAX_BLOCK; | |
1405 | ||
1406 | while (depth >= 0) { | |
1407 | if (depth == path->p_depth) { | |
1408 | /* leaf */ | |
1409 | if (path[depth].p_ext != | |
1410 | EXT_LAST_EXTENT(path[depth].p_hdr)) | |
1411 | return le32_to_cpu(path[depth].p_ext[1].ee_block); | |
1412 | } else { | |
1413 | /* index */ | |
1414 | if (path[depth].p_idx != | |
1415 | EXT_LAST_INDEX(path[depth].p_hdr)) | |
1416 | return le32_to_cpu(path[depth].p_idx[1].ei_block); | |
1417 | } | |
1418 | depth--; | |
1419 | } | |
1420 | ||
1421 | return EXT_MAX_BLOCK; | |
1422 | } | |
1423 | ||
1424 | /* | |
d0d856e8 | 1425 | * ext4_ext_next_leaf_block: |
a86c6181 AT |
1426 | * returns first allocated block from next leaf or EXT_MAX_BLOCK |
1427 | */ | |
725d26d3 | 1428 | static ext4_lblk_t ext4_ext_next_leaf_block(struct inode *inode, |
63f57933 | 1429 | struct ext4_ext_path *path) |
a86c6181 AT |
1430 | { |
1431 | int depth; | |
1432 | ||
1433 | BUG_ON(path == NULL); | |
1434 | depth = path->p_depth; | |
1435 | ||
1436 | /* zero-tree has no leaf blocks at all */ | |
1437 | if (depth == 0) | |
1438 | return EXT_MAX_BLOCK; | |
1439 | ||
1440 | /* go to index block */ | |
1441 | depth--; | |
1442 | ||
1443 | while (depth >= 0) { | |
1444 | if (path[depth].p_idx != | |
1445 | EXT_LAST_INDEX(path[depth].p_hdr)) | |
725d26d3 AK |
1446 | return (ext4_lblk_t) |
1447 | le32_to_cpu(path[depth].p_idx[1].ei_block); | |
a86c6181 AT |
1448 | depth--; |
1449 | } | |
1450 | ||
1451 | return EXT_MAX_BLOCK; | |
1452 | } | |
1453 | ||
1454 | /* | |
d0d856e8 RD |
1455 | * ext4_ext_correct_indexes: |
1456 | * if leaf gets modified and modified extent is first in the leaf, | |
1457 | * then we have to correct all indexes above. | |
a86c6181 AT |
1458 | * TODO: do we need to correct tree in all cases? |
1459 | */ | |
1d03ec98 | 1460 | static int ext4_ext_correct_indexes(handle_t *handle, struct inode *inode, |
a86c6181 AT |
1461 | struct ext4_ext_path *path) |
1462 | { | |
1463 | struct ext4_extent_header *eh; | |
1464 | int depth = ext_depth(inode); | |
1465 | struct ext4_extent *ex; | |
1466 | __le32 border; | |
1467 | int k, err = 0; | |
1468 | ||
1469 | eh = path[depth].p_hdr; | |
1470 | ex = path[depth].p_ext; | |
273df556 FM |
1471 | |
1472 | if (unlikely(ex == NULL || eh == NULL)) { | |
1473 | EXT4_ERROR_INODE(inode, | |
1474 | "ex %p == NULL or eh %p == NULL", ex, eh); | |
1475 | return -EIO; | |
1476 | } | |
a86c6181 AT |
1477 | |
1478 | if (depth == 0) { | |
1479 | /* there is no tree at all */ | |
1480 | return 0; | |
1481 | } | |
1482 | ||
1483 | if (ex != EXT_FIRST_EXTENT(eh)) { | |
1484 | /* we correct tree if first leaf got modified only */ | |
1485 | return 0; | |
1486 | } | |
1487 | ||
1488 | /* | |
d0d856e8 | 1489 | * TODO: we need correction if border is smaller than current one |
a86c6181 AT |
1490 | */ |
1491 | k = depth - 1; | |
1492 | border = path[depth].p_ext->ee_block; | |
7e028976 AM |
1493 | err = ext4_ext_get_access(handle, inode, path + k); |
1494 | if (err) | |
a86c6181 AT |
1495 | return err; |
1496 | path[k].p_idx->ei_block = border; | |
7e028976 AM |
1497 | err = ext4_ext_dirty(handle, inode, path + k); |
1498 | if (err) | |
a86c6181 AT |
1499 | return err; |
1500 | ||
1501 | while (k--) { | |
1502 | /* change all left-side indexes */ | |
1503 | if (path[k+1].p_idx != EXT_FIRST_INDEX(path[k+1].p_hdr)) | |
1504 | break; | |
7e028976 AM |
1505 | err = ext4_ext_get_access(handle, inode, path + k); |
1506 | if (err) | |
a86c6181 AT |
1507 | break; |
1508 | path[k].p_idx->ei_block = border; | |
7e028976 AM |
1509 | err = ext4_ext_dirty(handle, inode, path + k); |
1510 | if (err) | |
a86c6181 AT |
1511 | break; |
1512 | } | |
1513 | ||
1514 | return err; | |
1515 | } | |
1516 | ||
748de673 | 1517 | int |
a86c6181 AT |
1518 | ext4_can_extents_be_merged(struct inode *inode, struct ext4_extent *ex1, |
1519 | struct ext4_extent *ex2) | |
1520 | { | |
749269fa | 1521 | unsigned short ext1_ee_len, ext2_ee_len, max_len; |
a2df2a63 AA |
1522 | |
1523 | /* | |
1524 | * Make sure that either both extents are uninitialized, or | |
1525 | * both are _not_. | |
1526 | */ | |
1527 | if (ext4_ext_is_uninitialized(ex1) ^ ext4_ext_is_uninitialized(ex2)) | |
1528 | return 0; | |
1529 | ||
749269fa AA |
1530 | if (ext4_ext_is_uninitialized(ex1)) |
1531 | max_len = EXT_UNINIT_MAX_LEN; | |
1532 | else | |
1533 | max_len = EXT_INIT_MAX_LEN; | |
1534 | ||
a2df2a63 AA |
1535 | ext1_ee_len = ext4_ext_get_actual_len(ex1); |
1536 | ext2_ee_len = ext4_ext_get_actual_len(ex2); | |
1537 | ||
1538 | if (le32_to_cpu(ex1->ee_block) + ext1_ee_len != | |
63f57933 | 1539 | le32_to_cpu(ex2->ee_block)) |
a86c6181 AT |
1540 | return 0; |
1541 | ||
471d4011 SB |
1542 | /* |
1543 | * To allow future support for preallocated extents to be added | |
1544 | * as an RO_COMPAT feature, refuse to merge to extents if | |
d0d856e8 | 1545 | * this can result in the top bit of ee_len being set. |
471d4011 | 1546 | */ |
749269fa | 1547 | if (ext1_ee_len + ext2_ee_len > max_len) |
471d4011 | 1548 | return 0; |
bbf2f9fb | 1549 | #ifdef AGGRESSIVE_TEST |
b939e376 | 1550 | if (ext1_ee_len >= 4) |
a86c6181 AT |
1551 | return 0; |
1552 | #endif | |
1553 | ||
bf89d16f | 1554 | if (ext4_ext_pblock(ex1) + ext1_ee_len == ext4_ext_pblock(ex2)) |
a86c6181 AT |
1555 | return 1; |
1556 | return 0; | |
1557 | } | |
1558 | ||
56055d3a AA |
1559 | /* |
1560 | * This function tries to merge the "ex" extent to the next extent in the tree. | |
1561 | * It always tries to merge towards right. If you want to merge towards | |
1562 | * left, pass "ex - 1" as argument instead of "ex". | |
1563 | * Returns 0 if the extents (ex and ex+1) were _not_ merged and returns | |
1564 | * 1 if they got merged. | |
1565 | */ | |
197217a5 | 1566 | static int ext4_ext_try_to_merge_right(struct inode *inode, |
1f109d5a TT |
1567 | struct ext4_ext_path *path, |
1568 | struct ext4_extent *ex) | |
56055d3a AA |
1569 | { |
1570 | struct ext4_extent_header *eh; | |
1571 | unsigned int depth, len; | |
1572 | int merge_done = 0; | |
1573 | int uninitialized = 0; | |
1574 | ||
1575 | depth = ext_depth(inode); | |
1576 | BUG_ON(path[depth].p_hdr == NULL); | |
1577 | eh = path[depth].p_hdr; | |
1578 | ||
1579 | while (ex < EXT_LAST_EXTENT(eh)) { | |
1580 | if (!ext4_can_extents_be_merged(inode, ex, ex + 1)) | |
1581 | break; | |
1582 | /* merge with next extent! */ | |
1583 | if (ext4_ext_is_uninitialized(ex)) | |
1584 | uninitialized = 1; | |
1585 | ex->ee_len = cpu_to_le16(ext4_ext_get_actual_len(ex) | |
1586 | + ext4_ext_get_actual_len(ex + 1)); | |
1587 | if (uninitialized) | |
1588 | ext4_ext_mark_uninitialized(ex); | |
1589 | ||
1590 | if (ex + 1 < EXT_LAST_EXTENT(eh)) { | |
1591 | len = (EXT_LAST_EXTENT(eh) - ex - 1) | |
1592 | * sizeof(struct ext4_extent); | |
1593 | memmove(ex + 1, ex + 2, len); | |
1594 | } | |
e8546d06 | 1595 | le16_add_cpu(&eh->eh_entries, -1); |
56055d3a AA |
1596 | merge_done = 1; |
1597 | WARN_ON(eh->eh_entries == 0); | |
1598 | if (!eh->eh_entries) | |
24676da4 | 1599 | EXT4_ERROR_INODE(inode, "eh->eh_entries = 0!"); |
56055d3a AA |
1600 | } |
1601 | ||
1602 | return merge_done; | |
1603 | } | |
1604 | ||
197217a5 YY |
1605 | /* |
1606 | * This function tries to merge the @ex extent to neighbours in the tree. | |
1607 | * return 1 if merge left else 0. | |
1608 | */ | |
1609 | static int ext4_ext_try_to_merge(struct inode *inode, | |
1610 | struct ext4_ext_path *path, | |
1611 | struct ext4_extent *ex) { | |
1612 | struct ext4_extent_header *eh; | |
1613 | unsigned int depth; | |
1614 | int merge_done = 0; | |
1615 | int ret = 0; | |
1616 | ||
1617 | depth = ext_depth(inode); | |
1618 | BUG_ON(path[depth].p_hdr == NULL); | |
1619 | eh = path[depth].p_hdr; | |
1620 | ||
1621 | if (ex > EXT_FIRST_EXTENT(eh)) | |
1622 | merge_done = ext4_ext_try_to_merge_right(inode, path, ex - 1); | |
1623 | ||
1624 | if (!merge_done) | |
1625 | ret = ext4_ext_try_to_merge_right(inode, path, ex); | |
1626 | ||
1627 | return ret; | |
1628 | } | |
1629 | ||
25d14f98 AA |
1630 | /* |
1631 | * check if a portion of the "newext" extent overlaps with an | |
1632 | * existing extent. | |
1633 | * | |
1634 | * If there is an overlap discovered, it updates the length of the newext | |
1635 | * such that there will be no overlap, and then returns 1. | |
1636 | * If there is no overlap found, it returns 0. | |
1637 | */ | |
1f109d5a TT |
1638 | static unsigned int ext4_ext_check_overlap(struct inode *inode, |
1639 | struct ext4_extent *newext, | |
1640 | struct ext4_ext_path *path) | |
25d14f98 | 1641 | { |
725d26d3 | 1642 | ext4_lblk_t b1, b2; |
25d14f98 AA |
1643 | unsigned int depth, len1; |
1644 | unsigned int ret = 0; | |
1645 | ||
1646 | b1 = le32_to_cpu(newext->ee_block); | |
a2df2a63 | 1647 | len1 = ext4_ext_get_actual_len(newext); |
25d14f98 AA |
1648 | depth = ext_depth(inode); |
1649 | if (!path[depth].p_ext) | |
1650 | goto out; | |
1651 | b2 = le32_to_cpu(path[depth].p_ext->ee_block); | |
1652 | ||
1653 | /* | |
1654 | * get the next allocated block if the extent in the path | |
2b2d6d01 | 1655 | * is before the requested block(s) |
25d14f98 AA |
1656 | */ |
1657 | if (b2 < b1) { | |
1658 | b2 = ext4_ext_next_allocated_block(path); | |
1659 | if (b2 == EXT_MAX_BLOCK) | |
1660 | goto out; | |
1661 | } | |
1662 | ||
725d26d3 | 1663 | /* check for wrap through zero on extent logical start block*/ |
25d14f98 AA |
1664 | if (b1 + len1 < b1) { |
1665 | len1 = EXT_MAX_BLOCK - b1; | |
1666 | newext->ee_len = cpu_to_le16(len1); | |
1667 | ret = 1; | |
1668 | } | |
1669 | ||
1670 | /* check for overlap */ | |
1671 | if (b1 + len1 > b2) { | |
1672 | newext->ee_len = cpu_to_le16(b2 - b1); | |
1673 | ret = 1; | |
1674 | } | |
1675 | out: | |
1676 | return ret; | |
1677 | } | |
1678 | ||
a86c6181 | 1679 | /* |
d0d856e8 RD |
1680 | * ext4_ext_insert_extent: |
1681 | * tries to merge requsted extent into the existing extent or | |
1682 | * inserts requested extent as new one into the tree, | |
1683 | * creating new leaf in the no-space case. | |
a86c6181 AT |
1684 | */ |
1685 | int ext4_ext_insert_extent(handle_t *handle, struct inode *inode, | |
1686 | struct ext4_ext_path *path, | |
0031462b | 1687 | struct ext4_extent *newext, int flag) |
a86c6181 | 1688 | { |
af5bc92d | 1689 | struct ext4_extent_header *eh; |
a86c6181 AT |
1690 | struct ext4_extent *ex, *fex; |
1691 | struct ext4_extent *nearex; /* nearest extent */ | |
1692 | struct ext4_ext_path *npath = NULL; | |
725d26d3 AK |
1693 | int depth, len, err; |
1694 | ext4_lblk_t next; | |
a2df2a63 | 1695 | unsigned uninitialized = 0; |
a86c6181 | 1696 | |
273df556 FM |
1697 | if (unlikely(ext4_ext_get_actual_len(newext) == 0)) { |
1698 | EXT4_ERROR_INODE(inode, "ext4_ext_get_actual_len(newext) == 0"); | |
1699 | return -EIO; | |
1700 | } | |
a86c6181 AT |
1701 | depth = ext_depth(inode); |
1702 | ex = path[depth].p_ext; | |
273df556 FM |
1703 | if (unlikely(path[depth].p_hdr == NULL)) { |
1704 | EXT4_ERROR_INODE(inode, "path[%d].p_hdr == NULL", depth); | |
1705 | return -EIO; | |
1706 | } | |
a86c6181 AT |
1707 | |
1708 | /* try to insert block into found extent and return */ | |
744692dc | 1709 | if (ex && !(flag & EXT4_GET_BLOCKS_PRE_IO) |
0031462b | 1710 | && ext4_can_extents_be_merged(inode, ex, newext)) { |
553f9008 | 1711 | ext_debug("append [%d]%d block to %d:[%d]%d (from %llu)\n", |
bf89d16f TT |
1712 | ext4_ext_is_uninitialized(newext), |
1713 | ext4_ext_get_actual_len(newext), | |
1714 | le32_to_cpu(ex->ee_block), | |
1715 | ext4_ext_is_uninitialized(ex), | |
1716 | ext4_ext_get_actual_len(ex), | |
1717 | ext4_ext_pblock(ex)); | |
7e028976 AM |
1718 | err = ext4_ext_get_access(handle, inode, path + depth); |
1719 | if (err) | |
a86c6181 | 1720 | return err; |
a2df2a63 AA |
1721 | |
1722 | /* | |
1723 | * ext4_can_extents_be_merged should have checked that either | |
1724 | * both extents are uninitialized, or both aren't. Thus we | |
1725 | * need to check only one of them here. | |
1726 | */ | |
1727 | if (ext4_ext_is_uninitialized(ex)) | |
1728 | uninitialized = 1; | |
1729 | ex->ee_len = cpu_to_le16(ext4_ext_get_actual_len(ex) | |
1730 | + ext4_ext_get_actual_len(newext)); | |
1731 | if (uninitialized) | |
1732 | ext4_ext_mark_uninitialized(ex); | |
a86c6181 AT |
1733 | eh = path[depth].p_hdr; |
1734 | nearex = ex; | |
1735 | goto merge; | |
1736 | } | |
1737 | ||
1738 | repeat: | |
1739 | depth = ext_depth(inode); | |
1740 | eh = path[depth].p_hdr; | |
1741 | if (le16_to_cpu(eh->eh_entries) < le16_to_cpu(eh->eh_max)) | |
1742 | goto has_space; | |
1743 | ||
1744 | /* probably next leaf has space for us? */ | |
1745 | fex = EXT_LAST_EXTENT(eh); | |
1746 | next = ext4_ext_next_leaf_block(inode, path); | |
1747 | if (le32_to_cpu(newext->ee_block) > le32_to_cpu(fex->ee_block) | |
1748 | && next != EXT_MAX_BLOCK) { | |
1749 | ext_debug("next leaf block - %d\n", next); | |
1750 | BUG_ON(npath != NULL); | |
1751 | npath = ext4_ext_find_extent(inode, next, NULL); | |
1752 | if (IS_ERR(npath)) | |
1753 | return PTR_ERR(npath); | |
1754 | BUG_ON(npath->p_depth != path->p_depth); | |
1755 | eh = npath[depth].p_hdr; | |
1756 | if (le16_to_cpu(eh->eh_entries) < le16_to_cpu(eh->eh_max)) { | |
25985edc | 1757 | ext_debug("next leaf isn't full(%d)\n", |
a86c6181 AT |
1758 | le16_to_cpu(eh->eh_entries)); |
1759 | path = npath; | |
1760 | goto repeat; | |
1761 | } | |
1762 | ext_debug("next leaf has no free space(%d,%d)\n", | |
1763 | le16_to_cpu(eh->eh_entries), le16_to_cpu(eh->eh_max)); | |
1764 | } | |
1765 | ||
1766 | /* | |
d0d856e8 RD |
1767 | * There is no free space in the found leaf. |
1768 | * We're gonna add a new leaf in the tree. | |
a86c6181 AT |
1769 | */ |
1770 | err = ext4_ext_create_new_leaf(handle, inode, path, newext); | |
1771 | if (err) | |
1772 | goto cleanup; | |
1773 | depth = ext_depth(inode); | |
1774 | eh = path[depth].p_hdr; | |
1775 | ||
1776 | has_space: | |
1777 | nearex = path[depth].p_ext; | |
1778 | ||
7e028976 AM |
1779 | err = ext4_ext_get_access(handle, inode, path + depth); |
1780 | if (err) | |
a86c6181 AT |
1781 | goto cleanup; |
1782 | ||
1783 | if (!nearex) { | |
1784 | /* there is no extent in this leaf, create first one */ | |
553f9008 | 1785 | ext_debug("first extent in the leaf: %d:%llu:[%d]%d\n", |
8c55e204 | 1786 | le32_to_cpu(newext->ee_block), |
bf89d16f | 1787 | ext4_ext_pblock(newext), |
553f9008 | 1788 | ext4_ext_is_uninitialized(newext), |
a2df2a63 | 1789 | ext4_ext_get_actual_len(newext)); |
a86c6181 AT |
1790 | path[depth].p_ext = EXT_FIRST_EXTENT(eh); |
1791 | } else if (le32_to_cpu(newext->ee_block) | |
8c55e204 | 1792 | > le32_to_cpu(nearex->ee_block)) { |
a86c6181 AT |
1793 | /* BUG_ON(newext->ee_block == nearex->ee_block); */ |
1794 | if (nearex != EXT_LAST_EXTENT(eh)) { | |
1795 | len = EXT_MAX_EXTENT(eh) - nearex; | |
1796 | len = (len - 1) * sizeof(struct ext4_extent); | |
1797 | len = len < 0 ? 0 : len; | |
553f9008 | 1798 | ext_debug("insert %d:%llu:[%d]%d after: nearest 0x%p, " |
a86c6181 | 1799 | "move %d from 0x%p to 0x%p\n", |
8c55e204 | 1800 | le32_to_cpu(newext->ee_block), |
bf89d16f | 1801 | ext4_ext_pblock(newext), |
553f9008 | 1802 | ext4_ext_is_uninitialized(newext), |
a2df2a63 | 1803 | ext4_ext_get_actual_len(newext), |
a86c6181 AT |
1804 | nearex, len, nearex + 1, nearex + 2); |
1805 | memmove(nearex + 2, nearex + 1, len); | |
1806 | } | |
1807 | path[depth].p_ext = nearex + 1; | |
1808 | } else { | |
1809 | BUG_ON(newext->ee_block == nearex->ee_block); | |
1810 | len = (EXT_MAX_EXTENT(eh) - nearex) * sizeof(struct ext4_extent); | |
1811 | len = len < 0 ? 0 : len; | |
553f9008 | 1812 | ext_debug("insert %d:%llu:[%d]%d before: nearest 0x%p, " |
a86c6181 AT |
1813 | "move %d from 0x%p to 0x%p\n", |
1814 | le32_to_cpu(newext->ee_block), | |
bf89d16f | 1815 | ext4_ext_pblock(newext), |
553f9008 | 1816 | ext4_ext_is_uninitialized(newext), |
a2df2a63 | 1817 | ext4_ext_get_actual_len(newext), |
a86c6181 AT |
1818 | nearex, len, nearex + 1, nearex + 2); |
1819 | memmove(nearex + 1, nearex, len); | |
1820 | path[depth].p_ext = nearex; | |
1821 | } | |
1822 | ||
e8546d06 | 1823 | le16_add_cpu(&eh->eh_entries, 1); |
a86c6181 AT |
1824 | nearex = path[depth].p_ext; |
1825 | nearex->ee_block = newext->ee_block; | |
bf89d16f | 1826 | ext4_ext_store_pblock(nearex, ext4_ext_pblock(newext)); |
a86c6181 | 1827 | nearex->ee_len = newext->ee_len; |
a86c6181 AT |
1828 | |
1829 | merge: | |
1830 | /* try to merge extents to the right */ | |
744692dc | 1831 | if (!(flag & EXT4_GET_BLOCKS_PRE_IO)) |
0031462b | 1832 | ext4_ext_try_to_merge(inode, path, nearex); |
a86c6181 AT |
1833 | |
1834 | /* try to merge extents to the left */ | |
1835 | ||
1836 | /* time to correct all indexes above */ | |
1837 | err = ext4_ext_correct_indexes(handle, inode, path); | |
1838 | if (err) | |
1839 | goto cleanup; | |
1840 | ||
1841 | err = ext4_ext_dirty(handle, inode, path + depth); | |
1842 | ||
1843 | cleanup: | |
1844 | if (npath) { | |
1845 | ext4_ext_drop_refs(npath); | |
1846 | kfree(npath); | |
1847 | } | |
a86c6181 AT |
1848 | ext4_ext_invalidate_cache(inode); |
1849 | return err; | |
1850 | } | |
1851 | ||
1f109d5a TT |
1852 | static int ext4_ext_walk_space(struct inode *inode, ext4_lblk_t block, |
1853 | ext4_lblk_t num, ext_prepare_callback func, | |
1854 | void *cbdata) | |
6873fa0d ES |
1855 | { |
1856 | struct ext4_ext_path *path = NULL; | |
1857 | struct ext4_ext_cache cbex; | |
1858 | struct ext4_extent *ex; | |
1859 | ext4_lblk_t next, start = 0, end = 0; | |
1860 | ext4_lblk_t last = block + num; | |
1861 | int depth, exists, err = 0; | |
1862 | ||
1863 | BUG_ON(func == NULL); | |
1864 | BUG_ON(inode == NULL); | |
1865 | ||
1866 | while (block < last && block != EXT_MAX_BLOCK) { | |
1867 | num = last - block; | |
1868 | /* find extent for this block */ | |
fab3a549 | 1869 | down_read(&EXT4_I(inode)->i_data_sem); |
6873fa0d | 1870 | path = ext4_ext_find_extent(inode, block, path); |
fab3a549 | 1871 | up_read(&EXT4_I(inode)->i_data_sem); |
6873fa0d ES |
1872 | if (IS_ERR(path)) { |
1873 | err = PTR_ERR(path); | |
1874 | path = NULL; | |
1875 | break; | |
1876 | } | |
1877 | ||
1878 | depth = ext_depth(inode); | |
273df556 FM |
1879 | if (unlikely(path[depth].p_hdr == NULL)) { |
1880 | EXT4_ERROR_INODE(inode, "path[%d].p_hdr == NULL", depth); | |
1881 | err = -EIO; | |
1882 | break; | |
1883 | } | |
6873fa0d ES |
1884 | ex = path[depth].p_ext; |
1885 | next = ext4_ext_next_allocated_block(path); | |
1886 | ||
1887 | exists = 0; | |
1888 | if (!ex) { | |
1889 | /* there is no extent yet, so try to allocate | |
1890 | * all requested space */ | |
1891 | start = block; | |
1892 | end = block + num; | |
1893 | } else if (le32_to_cpu(ex->ee_block) > block) { | |
1894 | /* need to allocate space before found extent */ | |
1895 | start = block; | |
1896 | end = le32_to_cpu(ex->ee_block); | |
1897 | if (block + num < end) | |
1898 | end = block + num; | |
1899 | } else if (block >= le32_to_cpu(ex->ee_block) | |
1900 | + ext4_ext_get_actual_len(ex)) { | |
1901 | /* need to allocate space after found extent */ | |
1902 | start = block; | |
1903 | end = block + num; | |
1904 | if (end >= next) | |
1905 | end = next; | |
1906 | } else if (block >= le32_to_cpu(ex->ee_block)) { | |
1907 | /* | |
1908 | * some part of requested space is covered | |
1909 | * by found extent | |
1910 | */ | |
1911 | start = block; | |
1912 | end = le32_to_cpu(ex->ee_block) | |
1913 | + ext4_ext_get_actual_len(ex); | |
1914 | if (block + num < end) | |
1915 | end = block + num; | |
1916 | exists = 1; | |
1917 | } else { | |
1918 | BUG(); | |
1919 | } | |
1920 | BUG_ON(end <= start); | |
1921 | ||
1922 | if (!exists) { | |
1923 | cbex.ec_block = start; | |
1924 | cbex.ec_len = end - start; | |
1925 | cbex.ec_start = 0; | |
6873fa0d ES |
1926 | } else { |
1927 | cbex.ec_block = le32_to_cpu(ex->ee_block); | |
1928 | cbex.ec_len = ext4_ext_get_actual_len(ex); | |
bf89d16f | 1929 | cbex.ec_start = ext4_ext_pblock(ex); |
6873fa0d ES |
1930 | } |
1931 | ||
273df556 FM |
1932 | if (unlikely(cbex.ec_len == 0)) { |
1933 | EXT4_ERROR_INODE(inode, "cbex.ec_len == 0"); | |
1934 | err = -EIO; | |
1935 | break; | |
1936 | } | |
6873fa0d ES |
1937 | err = func(inode, path, &cbex, ex, cbdata); |
1938 | ext4_ext_drop_refs(path); | |
1939 | ||
1940 | if (err < 0) | |
1941 | break; | |
1942 | ||
1943 | if (err == EXT_REPEAT) | |
1944 | continue; | |
1945 | else if (err == EXT_BREAK) { | |
1946 | err = 0; | |
1947 | break; | |
1948 | } | |
1949 | ||
1950 | if (ext_depth(inode) != depth) { | |
1951 | /* depth was changed. we have to realloc path */ | |
1952 | kfree(path); | |
1953 | path = NULL; | |
1954 | } | |
1955 | ||
1956 | block = cbex.ec_block + cbex.ec_len; | |
1957 | } | |
1958 | ||
1959 | if (path) { | |
1960 | ext4_ext_drop_refs(path); | |
1961 | kfree(path); | |
1962 | } | |
1963 | ||
1964 | return err; | |
1965 | } | |
1966 | ||
09b88252 | 1967 | static void |
725d26d3 | 1968 | ext4_ext_put_in_cache(struct inode *inode, ext4_lblk_t block, |
b05e6ae5 | 1969 | __u32 len, ext4_fsblk_t start) |
a86c6181 AT |
1970 | { |
1971 | struct ext4_ext_cache *cex; | |
1972 | BUG_ON(len == 0); | |
2ec0ae3a | 1973 | spin_lock(&EXT4_I(inode)->i_block_reservation_lock); |
a86c6181 | 1974 | cex = &EXT4_I(inode)->i_cached_extent; |
a86c6181 AT |
1975 | cex->ec_block = block; |
1976 | cex->ec_len = len; | |
1977 | cex->ec_start = start; | |
2ec0ae3a | 1978 | spin_unlock(&EXT4_I(inode)->i_block_reservation_lock); |
a86c6181 AT |
1979 | } |
1980 | ||
1981 | /* | |
d0d856e8 RD |
1982 | * ext4_ext_put_gap_in_cache: |
1983 | * calculate boundaries of the gap that the requested block fits into | |
a86c6181 AT |
1984 | * and cache this gap |
1985 | */ | |
09b88252 | 1986 | static void |
a86c6181 | 1987 | ext4_ext_put_gap_in_cache(struct inode *inode, struct ext4_ext_path *path, |
725d26d3 | 1988 | ext4_lblk_t block) |
a86c6181 AT |
1989 | { |
1990 | int depth = ext_depth(inode); | |
725d26d3 AK |
1991 | unsigned long len; |
1992 | ext4_lblk_t lblock; | |
a86c6181 AT |
1993 | struct ext4_extent *ex; |
1994 | ||
1995 | ex = path[depth].p_ext; | |
1996 | if (ex == NULL) { | |
1997 | /* there is no extent yet, so gap is [0;-] */ | |
1998 | lblock = 0; | |
1999 | len = EXT_MAX_BLOCK; | |
2000 | ext_debug("cache gap(whole file):"); | |
2001 | } else if (block < le32_to_cpu(ex->ee_block)) { | |
2002 | lblock = block; | |
2003 | len = le32_to_cpu(ex->ee_block) - block; | |
bba90743 ES |
2004 | ext_debug("cache gap(before): %u [%u:%u]", |
2005 | block, | |
2006 | le32_to_cpu(ex->ee_block), | |
2007 | ext4_ext_get_actual_len(ex)); | |
a86c6181 | 2008 | } else if (block >= le32_to_cpu(ex->ee_block) |
a2df2a63 | 2009 | + ext4_ext_get_actual_len(ex)) { |
725d26d3 | 2010 | ext4_lblk_t next; |
8c55e204 | 2011 | lblock = le32_to_cpu(ex->ee_block) |
a2df2a63 | 2012 | + ext4_ext_get_actual_len(ex); |
725d26d3 AK |
2013 | |
2014 | next = ext4_ext_next_allocated_block(path); | |
bba90743 ES |
2015 | ext_debug("cache gap(after): [%u:%u] %u", |
2016 | le32_to_cpu(ex->ee_block), | |
2017 | ext4_ext_get_actual_len(ex), | |
2018 | block); | |
725d26d3 AK |
2019 | BUG_ON(next == lblock); |
2020 | len = next - lblock; | |
a86c6181 AT |
2021 | } else { |
2022 | lblock = len = 0; | |
2023 | BUG(); | |
2024 | } | |
2025 | ||
bba90743 | 2026 | ext_debug(" -> %u:%lu\n", lblock, len); |
b05e6ae5 | 2027 | ext4_ext_put_in_cache(inode, lblock, len, 0); |
a86c6181 AT |
2028 | } |
2029 | ||
b05e6ae5 TT |
2030 | /* |
2031 | * Return 0 if cache is invalid; 1 if the cache is valid | |
2032 | */ | |
09b88252 | 2033 | static int |
725d26d3 | 2034 | ext4_ext_in_cache(struct inode *inode, ext4_lblk_t block, |
a86c6181 AT |
2035 | struct ext4_extent *ex) |
2036 | { | |
2037 | struct ext4_ext_cache *cex; | |
77f4135f | 2038 | struct ext4_sb_info *sbi; |
b05e6ae5 | 2039 | int ret = 0; |
a86c6181 | 2040 | |
60e6679e | 2041 | /* |
2ec0ae3a TT |
2042 | * We borrow i_block_reservation_lock to protect i_cached_extent |
2043 | */ | |
2044 | spin_lock(&EXT4_I(inode)->i_block_reservation_lock); | |
a86c6181 | 2045 | cex = &EXT4_I(inode)->i_cached_extent; |
77f4135f | 2046 | sbi = EXT4_SB(inode->i_sb); |
a86c6181 AT |
2047 | |
2048 | /* has cache valid data? */ | |
b05e6ae5 | 2049 | if (cex->ec_len == 0) |
2ec0ae3a | 2050 | goto errout; |
a86c6181 | 2051 | |
731eb1a0 | 2052 | if (in_range(block, cex->ec_block, cex->ec_len)) { |
8c55e204 | 2053 | ex->ee_block = cpu_to_le32(cex->ec_block); |
f65e6fba | 2054 | ext4_ext_store_pblock(ex, cex->ec_start); |
8c55e204 | 2055 | ex->ee_len = cpu_to_le16(cex->ec_len); |
bba90743 ES |
2056 | ext_debug("%u cached by %u:%u:%llu\n", |
2057 | block, | |
2058 | cex->ec_block, cex->ec_len, cex->ec_start); | |
b05e6ae5 | 2059 | ret = 1; |
a86c6181 | 2060 | } |
2ec0ae3a | 2061 | errout: |
77f4135f VH |
2062 | if (!ret) |
2063 | sbi->extent_cache_misses++; | |
2064 | else | |
2065 | sbi->extent_cache_hits++; | |
2ec0ae3a TT |
2066 | spin_unlock(&EXT4_I(inode)->i_block_reservation_lock); |
2067 | return ret; | |
a86c6181 AT |
2068 | } |
2069 | ||
2070 | /* | |
d0d856e8 RD |
2071 | * ext4_ext_rm_idx: |
2072 | * removes index from the index block. | |
2073 | * It's used in truncate case only, thus all requests are for | |
2074 | * last index in the block only. | |
a86c6181 | 2075 | */ |
1d03ec98 | 2076 | static int ext4_ext_rm_idx(handle_t *handle, struct inode *inode, |
a86c6181 AT |
2077 | struct ext4_ext_path *path) |
2078 | { | |
a86c6181 | 2079 | int err; |
f65e6fba | 2080 | ext4_fsblk_t leaf; |
a86c6181 AT |
2081 | |
2082 | /* free index block */ | |
2083 | path--; | |
bf89d16f | 2084 | leaf = ext4_idx_pblock(path->p_idx); |
273df556 FM |
2085 | if (unlikely(path->p_hdr->eh_entries == 0)) { |
2086 | EXT4_ERROR_INODE(inode, "path->p_hdr->eh_entries == 0"); | |
2087 | return -EIO; | |
2088 | } | |
7e028976 AM |
2089 | err = ext4_ext_get_access(handle, inode, path); |
2090 | if (err) | |
a86c6181 | 2091 | return err; |
e8546d06 | 2092 | le16_add_cpu(&path->p_hdr->eh_entries, -1); |
7e028976 AM |
2093 | err = ext4_ext_dirty(handle, inode, path); |
2094 | if (err) | |
a86c6181 | 2095 | return err; |
2ae02107 | 2096 | ext_debug("index is empty, remove it, free block %llu\n", leaf); |
7dc57615 | 2097 | ext4_free_blocks(handle, inode, NULL, leaf, 1, |
e6362609 | 2098 | EXT4_FREE_BLOCKS_METADATA | EXT4_FREE_BLOCKS_FORGET); |
a86c6181 AT |
2099 | return err; |
2100 | } | |
2101 | ||
2102 | /* | |
ee12b630 MC |
2103 | * ext4_ext_calc_credits_for_single_extent: |
2104 | * This routine returns max. credits that needed to insert an extent | |
2105 | * to the extent tree. | |
2106 | * When pass the actual path, the caller should calculate credits | |
2107 | * under i_data_sem. | |
a86c6181 | 2108 | */ |
525f4ed8 | 2109 | int ext4_ext_calc_credits_for_single_extent(struct inode *inode, int nrblocks, |
a86c6181 AT |
2110 | struct ext4_ext_path *path) |
2111 | { | |
a86c6181 | 2112 | if (path) { |
ee12b630 | 2113 | int depth = ext_depth(inode); |
f3bd1f3f | 2114 | int ret = 0; |
ee12b630 | 2115 | |
a86c6181 | 2116 | /* probably there is space in leaf? */ |
a86c6181 | 2117 | if (le16_to_cpu(path[depth].p_hdr->eh_entries) |
ee12b630 | 2118 | < le16_to_cpu(path[depth].p_hdr->eh_max)) { |
a86c6181 | 2119 | |
ee12b630 MC |
2120 | /* |
2121 | * There are some space in the leaf tree, no | |
2122 | * need to account for leaf block credit | |
2123 | * | |
2124 | * bitmaps and block group descriptor blocks | |
2125 | * and other metadat blocks still need to be | |
2126 | * accounted. | |
2127 | */ | |
525f4ed8 | 2128 | /* 1 bitmap, 1 block group descriptor */ |
ee12b630 | 2129 | ret = 2 + EXT4_META_TRANS_BLOCKS(inode->i_sb); |
5887e98b | 2130 | return ret; |
ee12b630 MC |
2131 | } |
2132 | } | |
a86c6181 | 2133 | |
525f4ed8 | 2134 | return ext4_chunk_trans_blocks(inode, nrblocks); |
ee12b630 | 2135 | } |
a86c6181 | 2136 | |
ee12b630 MC |
2137 | /* |
2138 | * How many index/leaf blocks need to change/allocate to modify nrblocks? | |
2139 | * | |
2140 | * if nrblocks are fit in a single extent (chunk flag is 1), then | |
2141 | * in the worse case, each tree level index/leaf need to be changed | |
2142 | * if the tree split due to insert a new extent, then the old tree | |
2143 | * index/leaf need to be updated too | |
2144 | * | |
2145 | * If the nrblocks are discontiguous, they could cause | |
2146 | * the whole tree split more than once, but this is really rare. | |
2147 | */ | |
525f4ed8 | 2148 | int ext4_ext_index_trans_blocks(struct inode *inode, int nrblocks, int chunk) |
ee12b630 MC |
2149 | { |
2150 | int index; | |
2151 | int depth = ext_depth(inode); | |
a86c6181 | 2152 | |
ee12b630 MC |
2153 | if (chunk) |
2154 | index = depth * 2; | |
2155 | else | |
2156 | index = depth * 3; | |
a86c6181 | 2157 | |
ee12b630 | 2158 | return index; |
a86c6181 AT |
2159 | } |
2160 | ||
2161 | static int ext4_remove_blocks(handle_t *handle, struct inode *inode, | |
2162 | struct ext4_extent *ex, | |
725d26d3 | 2163 | ext4_lblk_t from, ext4_lblk_t to) |
a86c6181 | 2164 | { |
a2df2a63 | 2165 | unsigned short ee_len = ext4_ext_get_actual_len(ex); |
e6362609 | 2166 | int flags = EXT4_FREE_BLOCKS_FORGET; |
a86c6181 | 2167 | |
c9de560d | 2168 | if (S_ISDIR(inode->i_mode) || S_ISLNK(inode->i_mode)) |
e6362609 | 2169 | flags |= EXT4_FREE_BLOCKS_METADATA; |
a86c6181 AT |
2170 | #ifdef EXTENTS_STATS |
2171 | { | |
2172 | struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb); | |
a86c6181 AT |
2173 | spin_lock(&sbi->s_ext_stats_lock); |
2174 | sbi->s_ext_blocks += ee_len; | |
2175 | sbi->s_ext_extents++; | |
2176 | if (ee_len < sbi->s_ext_min) | |
2177 | sbi->s_ext_min = ee_len; | |
2178 | if (ee_len > sbi->s_ext_max) | |
2179 | sbi->s_ext_max = ee_len; | |
2180 | if (ext_depth(inode) > sbi->s_depth_max) | |
2181 | sbi->s_depth_max = ext_depth(inode); | |
2182 | spin_unlock(&sbi->s_ext_stats_lock); | |
2183 | } | |
2184 | #endif | |
2185 | if (from >= le32_to_cpu(ex->ee_block) | |
a2df2a63 | 2186 | && to == le32_to_cpu(ex->ee_block) + ee_len - 1) { |
a86c6181 | 2187 | /* tail removal */ |
725d26d3 | 2188 | ext4_lblk_t num; |
f65e6fba | 2189 | ext4_fsblk_t start; |
725d26d3 | 2190 | |
a2df2a63 | 2191 | num = le32_to_cpu(ex->ee_block) + ee_len - from; |
bf89d16f | 2192 | start = ext4_ext_pblock(ex) + ee_len - num; |
725d26d3 | 2193 | ext_debug("free last %u blocks starting %llu\n", num, start); |
7dc57615 | 2194 | ext4_free_blocks(handle, inode, NULL, start, num, flags); |
a86c6181 | 2195 | } else if (from == le32_to_cpu(ex->ee_block) |
a2df2a63 | 2196 | && to <= le32_to_cpu(ex->ee_block) + ee_len - 1) { |
725d26d3 | 2197 | printk(KERN_INFO "strange request: removal %u-%u from %u:%u\n", |
a2df2a63 | 2198 | from, to, le32_to_cpu(ex->ee_block), ee_len); |
a86c6181 | 2199 | } else { |
725d26d3 AK |
2200 | printk(KERN_INFO "strange request: removal(2) " |
2201 | "%u-%u from %u:%u\n", | |
2202 | from, to, le32_to_cpu(ex->ee_block), ee_len); | |
a86c6181 AT |
2203 | } |
2204 | return 0; | |
2205 | } | |
2206 | ||
2207 | static int | |
2208 | ext4_ext_rm_leaf(handle_t *handle, struct inode *inode, | |
725d26d3 | 2209 | struct ext4_ext_path *path, ext4_lblk_t start) |
a86c6181 AT |
2210 | { |
2211 | int err = 0, correct_index = 0; | |
2212 | int depth = ext_depth(inode), credits; | |
2213 | struct ext4_extent_header *eh; | |
725d26d3 AK |
2214 | ext4_lblk_t a, b, block; |
2215 | unsigned num; | |
2216 | ext4_lblk_t ex_ee_block; | |
a86c6181 | 2217 | unsigned short ex_ee_len; |
a2df2a63 | 2218 | unsigned uninitialized = 0; |
a86c6181 AT |
2219 | struct ext4_extent *ex; |
2220 | ||
c29c0ae7 | 2221 | /* the header must be checked already in ext4_ext_remove_space() */ |
725d26d3 | 2222 | ext_debug("truncate since %u in leaf\n", start); |
a86c6181 AT |
2223 | if (!path[depth].p_hdr) |
2224 | path[depth].p_hdr = ext_block_hdr(path[depth].p_bh); | |
2225 | eh = path[depth].p_hdr; | |
273df556 FM |
2226 | if (unlikely(path[depth].p_hdr == NULL)) { |
2227 | EXT4_ERROR_INODE(inode, "path[%d].p_hdr == NULL", depth); | |
2228 | return -EIO; | |
2229 | } | |
a86c6181 AT |
2230 | /* find where to start removing */ |
2231 | ex = EXT_LAST_EXTENT(eh); | |
2232 | ||
2233 | ex_ee_block = le32_to_cpu(ex->ee_block); | |
a2df2a63 | 2234 | ex_ee_len = ext4_ext_get_actual_len(ex); |
a86c6181 AT |
2235 | |
2236 | while (ex >= EXT_FIRST_EXTENT(eh) && | |
2237 | ex_ee_block + ex_ee_len > start) { | |
a41f2071 AK |
2238 | |
2239 | if (ext4_ext_is_uninitialized(ex)) | |
2240 | uninitialized = 1; | |
2241 | else | |
2242 | uninitialized = 0; | |
2243 | ||
553f9008 M |
2244 | ext_debug("remove ext %u:[%d]%d\n", ex_ee_block, |
2245 | uninitialized, ex_ee_len); | |
a86c6181 AT |
2246 | path[depth].p_ext = ex; |
2247 | ||
2248 | a = ex_ee_block > start ? ex_ee_block : start; | |
2249 | b = ex_ee_block + ex_ee_len - 1 < EXT_MAX_BLOCK ? | |
2250 | ex_ee_block + ex_ee_len - 1 : EXT_MAX_BLOCK; | |
2251 | ||
2252 | ext_debug(" border %u:%u\n", a, b); | |
2253 | ||
2254 | if (a != ex_ee_block && b != ex_ee_block + ex_ee_len - 1) { | |
2255 | block = 0; | |
2256 | num = 0; | |
2257 | BUG(); | |
2258 | } else if (a != ex_ee_block) { | |
2259 | /* remove tail of the extent */ | |
2260 | block = ex_ee_block; | |
2261 | num = a - block; | |
2262 | } else if (b != ex_ee_block + ex_ee_len - 1) { | |
2263 | /* remove head of the extent */ | |
2264 | block = a; | |
2265 | num = b - a; | |
2266 | /* there is no "make a hole" API yet */ | |
2267 | BUG(); | |
2268 | } else { | |
2269 | /* remove whole extent: excellent! */ | |
2270 | block = ex_ee_block; | |
2271 | num = 0; | |
2272 | BUG_ON(a != ex_ee_block); | |
2273 | BUG_ON(b != ex_ee_block + ex_ee_len - 1); | |
2274 | } | |
2275 | ||
34071da7 TT |
2276 | /* |
2277 | * 3 for leaf, sb, and inode plus 2 (bmap and group | |
2278 | * descriptor) for each block group; assume two block | |
2279 | * groups plus ex_ee_len/blocks_per_block_group for | |
2280 | * the worst case | |
2281 | */ | |
2282 | credits = 7 + 2*(ex_ee_len/EXT4_BLOCKS_PER_GROUP(inode->i_sb)); | |
a86c6181 AT |
2283 | if (ex == EXT_FIRST_EXTENT(eh)) { |
2284 | correct_index = 1; | |
2285 | credits += (ext_depth(inode)) + 1; | |
2286 | } | |
5aca07eb | 2287 | credits += EXT4_MAXQUOTAS_TRANS_BLOCKS(inode->i_sb); |
a86c6181 | 2288 | |
487caeef | 2289 | err = ext4_ext_truncate_extend_restart(handle, inode, credits); |
9102e4fa | 2290 | if (err) |
a86c6181 | 2291 | goto out; |
a86c6181 AT |
2292 | |
2293 | err = ext4_ext_get_access(handle, inode, path + depth); | |
2294 | if (err) | |
2295 | goto out; | |
2296 | ||
2297 | err = ext4_remove_blocks(handle, inode, ex, a, b); | |
2298 | if (err) | |
2299 | goto out; | |
2300 | ||
2301 | if (num == 0) { | |
d0d856e8 | 2302 | /* this extent is removed; mark slot entirely unused */ |
f65e6fba | 2303 | ext4_ext_store_pblock(ex, 0); |
e8546d06 | 2304 | le16_add_cpu(&eh->eh_entries, -1); |
a86c6181 AT |
2305 | } |
2306 | ||
2307 | ex->ee_block = cpu_to_le32(block); | |
2308 | ex->ee_len = cpu_to_le16(num); | |
749269fa AA |
2309 | /* |
2310 | * Do not mark uninitialized if all the blocks in the | |
2311 | * extent have been removed. | |
2312 | */ | |
2313 | if (uninitialized && num) | |
a2df2a63 | 2314 | ext4_ext_mark_uninitialized(ex); |
a86c6181 AT |
2315 | |
2316 | err = ext4_ext_dirty(handle, inode, path + depth); | |
2317 | if (err) | |
2318 | goto out; | |
2319 | ||
2ae02107 | 2320 | ext_debug("new extent: %u:%u:%llu\n", block, num, |
bf89d16f | 2321 | ext4_ext_pblock(ex)); |
a86c6181 AT |
2322 | ex--; |
2323 | ex_ee_block = le32_to_cpu(ex->ee_block); | |
a2df2a63 | 2324 | ex_ee_len = ext4_ext_get_actual_len(ex); |
a86c6181 AT |
2325 | } |
2326 | ||
2327 | if (correct_index && eh->eh_entries) | |
2328 | err = ext4_ext_correct_indexes(handle, inode, path); | |
2329 | ||
2330 | /* if this leaf is free, then we should | |
2331 | * remove it from index block above */ | |
2332 | if (err == 0 && eh->eh_entries == 0 && path[depth].p_bh != NULL) | |
2333 | err = ext4_ext_rm_idx(handle, inode, path + depth); | |
2334 | ||
2335 | out: | |
2336 | return err; | |
2337 | } | |
2338 | ||
2339 | /* | |
d0d856e8 RD |
2340 | * ext4_ext_more_to_rm: |
2341 | * returns 1 if current index has to be freed (even partial) | |
a86c6181 | 2342 | */ |
09b88252 | 2343 | static int |
a86c6181 AT |
2344 | ext4_ext_more_to_rm(struct ext4_ext_path *path) |
2345 | { | |
2346 | BUG_ON(path->p_idx == NULL); | |
2347 | ||
2348 | if (path->p_idx < EXT_FIRST_INDEX(path->p_hdr)) | |
2349 | return 0; | |
2350 | ||
2351 | /* | |
d0d856e8 | 2352 | * if truncate on deeper level happened, it wasn't partial, |
a86c6181 AT |
2353 | * so we have to consider current index for truncation |
2354 | */ | |
2355 | if (le16_to_cpu(path->p_hdr->eh_entries) == path->p_block) | |
2356 | return 0; | |
2357 | return 1; | |
2358 | } | |
2359 | ||
1d03ec98 | 2360 | static int ext4_ext_remove_space(struct inode *inode, ext4_lblk_t start) |
a86c6181 AT |
2361 | { |
2362 | struct super_block *sb = inode->i_sb; | |
2363 | int depth = ext_depth(inode); | |
2364 | struct ext4_ext_path *path; | |
2365 | handle_t *handle; | |
0617b83f | 2366 | int i, err; |
a86c6181 | 2367 | |
725d26d3 | 2368 | ext_debug("truncate since %u\n", start); |
a86c6181 AT |
2369 | |
2370 | /* probably first extent we're gonna free will be last in block */ | |
2371 | handle = ext4_journal_start(inode, depth + 1); | |
2372 | if (IS_ERR(handle)) | |
2373 | return PTR_ERR(handle); | |
2374 | ||
0617b83f | 2375 | again: |
a86c6181 AT |
2376 | ext4_ext_invalidate_cache(inode); |
2377 | ||
2378 | /* | |
d0d856e8 RD |
2379 | * We start scanning from right side, freeing all the blocks |
2380 | * after i_size and walking into the tree depth-wise. | |
a86c6181 | 2381 | */ |
0617b83f | 2382 | depth = ext_depth(inode); |
216553c4 | 2383 | path = kzalloc(sizeof(struct ext4_ext_path) * (depth + 1), GFP_NOFS); |
a86c6181 AT |
2384 | if (path == NULL) { |
2385 | ext4_journal_stop(handle); | |
2386 | return -ENOMEM; | |
2387 | } | |
0617b83f | 2388 | path[0].p_depth = depth; |
a86c6181 | 2389 | path[0].p_hdr = ext_inode_hdr(inode); |
56b19868 | 2390 | if (ext4_ext_check(inode, path[0].p_hdr, depth)) { |
a86c6181 AT |
2391 | err = -EIO; |
2392 | goto out; | |
2393 | } | |
0617b83f | 2394 | i = err = 0; |
a86c6181 AT |
2395 | |
2396 | while (i >= 0 && err == 0) { | |
2397 | if (i == depth) { | |
2398 | /* this is leaf block */ | |
2399 | err = ext4_ext_rm_leaf(handle, inode, path, start); | |
d0d856e8 | 2400 | /* root level has p_bh == NULL, brelse() eats this */ |
a86c6181 AT |
2401 | brelse(path[i].p_bh); |
2402 | path[i].p_bh = NULL; | |
2403 | i--; | |
2404 | continue; | |
2405 | } | |
2406 | ||
2407 | /* this is index block */ | |
2408 | if (!path[i].p_hdr) { | |
2409 | ext_debug("initialize header\n"); | |
2410 | path[i].p_hdr = ext_block_hdr(path[i].p_bh); | |
a86c6181 AT |
2411 | } |
2412 | ||
a86c6181 | 2413 | if (!path[i].p_idx) { |
d0d856e8 | 2414 | /* this level hasn't been touched yet */ |
a86c6181 AT |
2415 | path[i].p_idx = EXT_LAST_INDEX(path[i].p_hdr); |
2416 | path[i].p_block = le16_to_cpu(path[i].p_hdr->eh_entries)+1; | |
2417 | ext_debug("init index ptr: hdr 0x%p, num %d\n", | |
2418 | path[i].p_hdr, | |
2419 | le16_to_cpu(path[i].p_hdr->eh_entries)); | |
2420 | } else { | |
d0d856e8 | 2421 | /* we were already here, see at next index */ |
a86c6181 AT |
2422 | path[i].p_idx--; |
2423 | } | |
2424 | ||
2425 | ext_debug("level %d - index, first 0x%p, cur 0x%p\n", | |
2426 | i, EXT_FIRST_INDEX(path[i].p_hdr), | |
2427 | path[i].p_idx); | |
2428 | if (ext4_ext_more_to_rm(path + i)) { | |
c29c0ae7 | 2429 | struct buffer_head *bh; |
a86c6181 | 2430 | /* go to the next level */ |
2ae02107 | 2431 | ext_debug("move to level %d (block %llu)\n", |
bf89d16f | 2432 | i + 1, ext4_idx_pblock(path[i].p_idx)); |
a86c6181 | 2433 | memset(path + i + 1, 0, sizeof(*path)); |
bf89d16f | 2434 | bh = sb_bread(sb, ext4_idx_pblock(path[i].p_idx)); |
c29c0ae7 | 2435 | if (!bh) { |
a86c6181 AT |
2436 | /* should we reset i_size? */ |
2437 | err = -EIO; | |
2438 | break; | |
2439 | } | |
c29c0ae7 AT |
2440 | if (WARN_ON(i + 1 > depth)) { |
2441 | err = -EIO; | |
2442 | break; | |
2443 | } | |
56b19868 | 2444 | if (ext4_ext_check(inode, ext_block_hdr(bh), |
c29c0ae7 AT |
2445 | depth - i - 1)) { |
2446 | err = -EIO; | |
2447 | break; | |
2448 | } | |
2449 | path[i + 1].p_bh = bh; | |
a86c6181 | 2450 | |
d0d856e8 RD |
2451 | /* save actual number of indexes since this |
2452 | * number is changed at the next iteration */ | |
a86c6181 AT |
2453 | path[i].p_block = le16_to_cpu(path[i].p_hdr->eh_entries); |
2454 | i++; | |
2455 | } else { | |
d0d856e8 | 2456 | /* we finished processing this index, go up */ |
a86c6181 | 2457 | if (path[i].p_hdr->eh_entries == 0 && i > 0) { |
d0d856e8 | 2458 | /* index is empty, remove it; |
a86c6181 AT |
2459 | * handle must be already prepared by the |
2460 | * truncatei_leaf() */ | |
2461 | err = ext4_ext_rm_idx(handle, inode, path + i); | |
2462 | } | |
d0d856e8 | 2463 | /* root level has p_bh == NULL, brelse() eats this */ |
a86c6181 AT |
2464 | brelse(path[i].p_bh); |
2465 | path[i].p_bh = NULL; | |
2466 | i--; | |
2467 | ext_debug("return to level %d\n", i); | |
2468 | } | |
2469 | } | |
2470 | ||
2471 | /* TODO: flexible tree reduction should be here */ | |
2472 | if (path->p_hdr->eh_entries == 0) { | |
2473 | /* | |
d0d856e8 RD |
2474 | * truncate to zero freed all the tree, |
2475 | * so we need to correct eh_depth | |
a86c6181 AT |
2476 | */ |
2477 | err = ext4_ext_get_access(handle, inode, path); | |
2478 | if (err == 0) { | |
2479 | ext_inode_hdr(inode)->eh_depth = 0; | |
2480 | ext_inode_hdr(inode)->eh_max = | |
55ad63bf | 2481 | cpu_to_le16(ext4_ext_space_root(inode, 0)); |
a86c6181 AT |
2482 | err = ext4_ext_dirty(handle, inode, path); |
2483 | } | |
2484 | } | |
2485 | out: | |
a86c6181 AT |
2486 | ext4_ext_drop_refs(path); |
2487 | kfree(path); | |
0617b83f DM |
2488 | if (err == -EAGAIN) |
2489 | goto again; | |
a86c6181 AT |
2490 | ext4_journal_stop(handle); |
2491 | ||
2492 | return err; | |
2493 | } | |
2494 | ||
2495 | /* | |
2496 | * called at mount time | |
2497 | */ | |
2498 | void ext4_ext_init(struct super_block *sb) | |
2499 | { | |
2500 | /* | |
2501 | * possible initialization would be here | |
2502 | */ | |
2503 | ||
83982b6f | 2504 | if (EXT4_HAS_INCOMPAT_FEATURE(sb, EXT4_FEATURE_INCOMPAT_EXTENTS)) { |
90576c0b | 2505 | #if defined(AGGRESSIVE_TEST) || defined(CHECK_BINSEARCH) || defined(EXTENTS_STATS) |
4776004f | 2506 | printk(KERN_INFO "EXT4-fs: file extents enabled"); |
bbf2f9fb RD |
2507 | #ifdef AGGRESSIVE_TEST |
2508 | printk(", aggressive tests"); | |
a86c6181 AT |
2509 | #endif |
2510 | #ifdef CHECK_BINSEARCH | |
2511 | printk(", check binsearch"); | |
2512 | #endif | |
2513 | #ifdef EXTENTS_STATS | |
2514 | printk(", stats"); | |
2515 | #endif | |
2516 | printk("\n"); | |
90576c0b | 2517 | #endif |
a86c6181 AT |
2518 | #ifdef EXTENTS_STATS |
2519 | spin_lock_init(&EXT4_SB(sb)->s_ext_stats_lock); | |
2520 | EXT4_SB(sb)->s_ext_min = 1 << 30; | |
2521 | EXT4_SB(sb)->s_ext_max = 0; | |
2522 | #endif | |
2523 | } | |
2524 | } | |
2525 | ||
2526 | /* | |
2527 | * called at umount time | |
2528 | */ | |
2529 | void ext4_ext_release(struct super_block *sb) | |
2530 | { | |
83982b6f | 2531 | if (!EXT4_HAS_INCOMPAT_FEATURE(sb, EXT4_FEATURE_INCOMPAT_EXTENTS)) |
a86c6181 AT |
2532 | return; |
2533 | ||
2534 | #ifdef EXTENTS_STATS | |
2535 | if (EXT4_SB(sb)->s_ext_blocks && EXT4_SB(sb)->s_ext_extents) { | |
2536 | struct ext4_sb_info *sbi = EXT4_SB(sb); | |
2537 | printk(KERN_ERR "EXT4-fs: %lu blocks in %lu extents (%lu ave)\n", | |
2538 | sbi->s_ext_blocks, sbi->s_ext_extents, | |
2539 | sbi->s_ext_blocks / sbi->s_ext_extents); | |
2540 | printk(KERN_ERR "EXT4-fs: extents: %lu min, %lu max, max depth %lu\n", | |
2541 | sbi->s_ext_min, sbi->s_ext_max, sbi->s_depth_max); | |
2542 | } | |
2543 | #endif | |
2544 | } | |
2545 | ||
093a088b AK |
2546 | /* FIXME!! we need to try to merge to left or right after zero-out */ |
2547 | static int ext4_ext_zeroout(struct inode *inode, struct ext4_extent *ex) | |
2548 | { | |
2407518d LC |
2549 | ext4_fsblk_t ee_pblock; |
2550 | unsigned int ee_len; | |
b720303d | 2551 | int ret; |
093a088b | 2552 | |
093a088b | 2553 | ee_len = ext4_ext_get_actual_len(ex); |
bf89d16f | 2554 | ee_pblock = ext4_ext_pblock(ex); |
b720303d | 2555 | |
a107e5a3 | 2556 | ret = sb_issue_zeroout(inode->i_sb, ee_pblock, ee_len, GFP_NOFS); |
2407518d LC |
2557 | if (ret > 0) |
2558 | ret = 0; | |
093a088b | 2559 | |
2407518d | 2560 | return ret; |
093a088b AK |
2561 | } |
2562 | ||
47ea3bb5 YY |
2563 | /* |
2564 | * used by extent splitting. | |
2565 | */ | |
2566 | #define EXT4_EXT_MAY_ZEROOUT 0x1 /* safe to zeroout if split fails \ | |
2567 | due to ENOSPC */ | |
2568 | #define EXT4_EXT_MARK_UNINIT1 0x2 /* mark first half uninitialized */ | |
2569 | #define EXT4_EXT_MARK_UNINIT2 0x4 /* mark second half uninitialized */ | |
2570 | ||
2571 | /* | |
2572 | * ext4_split_extent_at() splits an extent at given block. | |
2573 | * | |
2574 | * @handle: the journal handle | |
2575 | * @inode: the file inode | |
2576 | * @path: the path to the extent | |
2577 | * @split: the logical block where the extent is splitted. | |
2578 | * @split_flags: indicates if the extent could be zeroout if split fails, and | |
2579 | * the states(init or uninit) of new extents. | |
2580 | * @flags: flags used to insert new extent to extent tree. | |
2581 | * | |
2582 | * | |
2583 | * Splits extent [a, b] into two extents [a, @split) and [@split, b], states | |
2584 | * of which are deterimined by split_flag. | |
2585 | * | |
2586 | * There are two cases: | |
2587 | * a> the extent are splitted into two extent. | |
2588 | * b> split is not needed, and just mark the extent. | |
2589 | * | |
2590 | * return 0 on success. | |
2591 | */ | |
2592 | static int ext4_split_extent_at(handle_t *handle, | |
2593 | struct inode *inode, | |
2594 | struct ext4_ext_path *path, | |
2595 | ext4_lblk_t split, | |
2596 | int split_flag, | |
2597 | int flags) | |
2598 | { | |
2599 | ext4_fsblk_t newblock; | |
2600 | ext4_lblk_t ee_block; | |
2601 | struct ext4_extent *ex, newex, orig_ex; | |
2602 | struct ext4_extent *ex2 = NULL; | |
2603 | unsigned int ee_len, depth; | |
2604 | int err = 0; | |
2605 | ||
2606 | ext_debug("ext4_split_extents_at: inode %lu, logical" | |
2607 | "block %llu\n", inode->i_ino, (unsigned long long)split); | |
2608 | ||
2609 | ext4_ext_show_leaf(inode, path); | |
2610 | ||
2611 | depth = ext_depth(inode); | |
2612 | ex = path[depth].p_ext; | |
2613 | ee_block = le32_to_cpu(ex->ee_block); | |
2614 | ee_len = ext4_ext_get_actual_len(ex); | |
2615 | newblock = split - ee_block + ext4_ext_pblock(ex); | |
2616 | ||
2617 | BUG_ON(split < ee_block || split >= (ee_block + ee_len)); | |
2618 | ||
2619 | err = ext4_ext_get_access(handle, inode, path + depth); | |
2620 | if (err) | |
2621 | goto out; | |
2622 | ||
2623 | if (split == ee_block) { | |
2624 | /* | |
2625 | * case b: block @split is the block that the extent begins with | |
2626 | * then we just change the state of the extent, and splitting | |
2627 | * is not needed. | |
2628 | */ | |
2629 | if (split_flag & EXT4_EXT_MARK_UNINIT2) | |
2630 | ext4_ext_mark_uninitialized(ex); | |
2631 | else | |
2632 | ext4_ext_mark_initialized(ex); | |
2633 | ||
2634 | if (!(flags & EXT4_GET_BLOCKS_PRE_IO)) | |
2635 | ext4_ext_try_to_merge(inode, path, ex); | |
2636 | ||
2637 | err = ext4_ext_dirty(handle, inode, path + depth); | |
2638 | goto out; | |
2639 | } | |
2640 | ||
2641 | /* case a */ | |
2642 | memcpy(&orig_ex, ex, sizeof(orig_ex)); | |
2643 | ex->ee_len = cpu_to_le16(split - ee_block); | |
2644 | if (split_flag & EXT4_EXT_MARK_UNINIT1) | |
2645 | ext4_ext_mark_uninitialized(ex); | |
2646 | ||
2647 | /* | |
2648 | * path may lead to new leaf, not to original leaf any more | |
2649 | * after ext4_ext_insert_extent() returns, | |
2650 | */ | |
2651 | err = ext4_ext_dirty(handle, inode, path + depth); | |
2652 | if (err) | |
2653 | goto fix_extent_len; | |
2654 | ||
2655 | ex2 = &newex; | |
2656 | ex2->ee_block = cpu_to_le32(split); | |
2657 | ex2->ee_len = cpu_to_le16(ee_len - (split - ee_block)); | |
2658 | ext4_ext_store_pblock(ex2, newblock); | |
2659 | if (split_flag & EXT4_EXT_MARK_UNINIT2) | |
2660 | ext4_ext_mark_uninitialized(ex2); | |
2661 | ||
2662 | err = ext4_ext_insert_extent(handle, inode, path, &newex, flags); | |
2663 | if (err == -ENOSPC && (EXT4_EXT_MAY_ZEROOUT & split_flag)) { | |
2664 | err = ext4_ext_zeroout(inode, &orig_ex); | |
2665 | if (err) | |
2666 | goto fix_extent_len; | |
2667 | /* update the extent length and mark as initialized */ | |
2668 | ex->ee_len = cpu_to_le32(ee_len); | |
2669 | ext4_ext_try_to_merge(inode, path, ex); | |
2670 | err = ext4_ext_dirty(handle, inode, path + depth); | |
2671 | goto out; | |
2672 | } else if (err) | |
2673 | goto fix_extent_len; | |
2674 | ||
2675 | out: | |
2676 | ext4_ext_show_leaf(inode, path); | |
2677 | return err; | |
2678 | ||
2679 | fix_extent_len: | |
2680 | ex->ee_len = orig_ex.ee_len; | |
2681 | ext4_ext_dirty(handle, inode, path + depth); | |
2682 | return err; | |
2683 | } | |
2684 | ||
2685 | /* | |
2686 | * ext4_split_extents() splits an extent and mark extent which is covered | |
2687 | * by @map as split_flags indicates | |
2688 | * | |
2689 | * It may result in splitting the extent into multiple extents (upto three) | |
2690 | * There are three possibilities: | |
2691 | * a> There is no split required | |
2692 | * b> Splits in two extents: Split is happening at either end of the extent | |
2693 | * c> Splits in three extents: Somone is splitting in middle of the extent | |
2694 | * | |
2695 | */ | |
2696 | static int ext4_split_extent(handle_t *handle, | |
2697 | struct inode *inode, | |
2698 | struct ext4_ext_path *path, | |
2699 | struct ext4_map_blocks *map, | |
2700 | int split_flag, | |
2701 | int flags) | |
2702 | { | |
2703 | ext4_lblk_t ee_block; | |
2704 | struct ext4_extent *ex; | |
2705 | unsigned int ee_len, depth; | |
2706 | int err = 0; | |
2707 | int uninitialized; | |
2708 | int split_flag1, flags1; | |
2709 | ||
2710 | depth = ext_depth(inode); | |
2711 | ex = path[depth].p_ext; | |
2712 | ee_block = le32_to_cpu(ex->ee_block); | |
2713 | ee_len = ext4_ext_get_actual_len(ex); | |
2714 | uninitialized = ext4_ext_is_uninitialized(ex); | |
2715 | ||
2716 | if (map->m_lblk + map->m_len < ee_block + ee_len) { | |
2717 | split_flag1 = split_flag & EXT4_EXT_MAY_ZEROOUT ? | |
2718 | EXT4_EXT_MAY_ZEROOUT : 0; | |
2719 | flags1 = flags | EXT4_GET_BLOCKS_PRE_IO; | |
2720 | if (uninitialized) | |
2721 | split_flag1 |= EXT4_EXT_MARK_UNINIT1 | | |
2722 | EXT4_EXT_MARK_UNINIT2; | |
2723 | err = ext4_split_extent_at(handle, inode, path, | |
2724 | map->m_lblk + map->m_len, split_flag1, flags1); | |
93917411 YY |
2725 | if (err) |
2726 | goto out; | |
47ea3bb5 YY |
2727 | } |
2728 | ||
2729 | ext4_ext_drop_refs(path); | |
2730 | path = ext4_ext_find_extent(inode, map->m_lblk, path); | |
2731 | if (IS_ERR(path)) | |
2732 | return PTR_ERR(path); | |
2733 | ||
2734 | if (map->m_lblk >= ee_block) { | |
2735 | split_flag1 = split_flag & EXT4_EXT_MAY_ZEROOUT ? | |
2736 | EXT4_EXT_MAY_ZEROOUT : 0; | |
2737 | if (uninitialized) | |
2738 | split_flag1 |= EXT4_EXT_MARK_UNINIT1; | |
2739 | if (split_flag & EXT4_EXT_MARK_UNINIT2) | |
2740 | split_flag1 |= EXT4_EXT_MARK_UNINIT2; | |
2741 | err = ext4_split_extent_at(handle, inode, path, | |
2742 | map->m_lblk, split_flag1, flags); | |
2743 | if (err) | |
2744 | goto out; | |
2745 | } | |
2746 | ||
2747 | ext4_ext_show_leaf(inode, path); | |
2748 | out: | |
2749 | return err ? err : map->m_len; | |
2750 | } | |
2751 | ||
3977c965 | 2752 | #define EXT4_EXT_ZERO_LEN 7 |
56055d3a | 2753 | /* |
e35fd660 | 2754 | * This function is called by ext4_ext_map_blocks() if someone tries to write |
56055d3a | 2755 | * to an uninitialized extent. It may result in splitting the uninitialized |
25985edc | 2756 | * extent into multiple extents (up to three - one initialized and two |
56055d3a AA |
2757 | * uninitialized). |
2758 | * There are three possibilities: | |
2759 | * a> There is no split required: Entire extent should be initialized | |
2760 | * b> Splits in two extents: Write is happening at either end of the extent | |
2761 | * c> Splits in three extents: Somone is writing in middle of the extent | |
2762 | */ | |
725d26d3 | 2763 | static int ext4_ext_convert_to_initialized(handle_t *handle, |
e35fd660 TT |
2764 | struct inode *inode, |
2765 | struct ext4_map_blocks *map, | |
2766 | struct ext4_ext_path *path) | |
56055d3a | 2767 | { |
667eff35 YY |
2768 | struct ext4_map_blocks split_map; |
2769 | struct ext4_extent zero_ex; | |
2770 | struct ext4_extent *ex; | |
21ca087a | 2771 | ext4_lblk_t ee_block, eof_block; |
725d26d3 | 2772 | unsigned int allocated, ee_len, depth; |
56055d3a | 2773 | int err = 0; |
667eff35 | 2774 | int split_flag = 0; |
21ca087a DM |
2775 | |
2776 | ext_debug("ext4_ext_convert_to_initialized: inode %lu, logical" | |
2777 | "block %llu, max_blocks %u\n", inode->i_ino, | |
e35fd660 | 2778 | (unsigned long long)map->m_lblk, map->m_len); |
21ca087a DM |
2779 | |
2780 | eof_block = (inode->i_size + inode->i_sb->s_blocksize - 1) >> | |
2781 | inode->i_sb->s_blocksize_bits; | |
e35fd660 TT |
2782 | if (eof_block < map->m_lblk + map->m_len) |
2783 | eof_block = map->m_lblk + map->m_len; | |
56055d3a AA |
2784 | |
2785 | depth = ext_depth(inode); | |
56055d3a AA |
2786 | ex = path[depth].p_ext; |
2787 | ee_block = le32_to_cpu(ex->ee_block); | |
2788 | ee_len = ext4_ext_get_actual_len(ex); | |
e35fd660 | 2789 | allocated = ee_len - (map->m_lblk - ee_block); |
56055d3a | 2790 | |
667eff35 | 2791 | WARN_ON(map->m_lblk < ee_block); |
21ca087a DM |
2792 | /* |
2793 | * It is safe to convert extent to initialized via explicit | |
2794 | * zeroout only if extent is fully insde i_size or new_size. | |
2795 | */ | |
667eff35 | 2796 | split_flag |= ee_block + ee_len <= eof_block ? EXT4_EXT_MAY_ZEROOUT : 0; |
21ca087a | 2797 | |
3977c965 | 2798 | /* If extent has less than 2*EXT4_EXT_ZERO_LEN zerout directly */ |
667eff35 YY |
2799 | if (ee_len <= 2*EXT4_EXT_ZERO_LEN && |
2800 | (EXT4_EXT_MAY_ZEROOUT & split_flag)) { | |
2801 | err = ext4_ext_zeroout(inode, ex); | |
3977c965 | 2802 | if (err) |
d03856bd | 2803 | goto out; |
d03856bd AK |
2804 | |
2805 | err = ext4_ext_get_access(handle, inode, path + depth); | |
2806 | if (err) | |
2807 | goto out; | |
667eff35 YY |
2808 | ext4_ext_mark_initialized(ex); |
2809 | ext4_ext_try_to_merge(inode, path, ex); | |
2810 | err = ext4_ext_dirty(handle, inode, path + depth); | |
2811 | goto out; | |
56055d3a | 2812 | } |
667eff35 | 2813 | |
56055d3a | 2814 | /* |
667eff35 YY |
2815 | * four cases: |
2816 | * 1. split the extent into three extents. | |
2817 | * 2. split the extent into two extents, zeroout the first half. | |
2818 | * 3. split the extent into two extents, zeroout the second half. | |
2819 | * 4. split the extent into two extents with out zeroout. | |
56055d3a | 2820 | */ |
667eff35 YY |
2821 | split_map.m_lblk = map->m_lblk; |
2822 | split_map.m_len = map->m_len; | |
2823 | ||
2824 | if (allocated > map->m_len) { | |
2825 | if (allocated <= EXT4_EXT_ZERO_LEN && | |
2826 | (EXT4_EXT_MAY_ZEROOUT & split_flag)) { | |
2827 | /* case 3 */ | |
2828 | zero_ex.ee_block = | |
9b940f8e AH |
2829 | cpu_to_le32(map->m_lblk); |
2830 | zero_ex.ee_len = cpu_to_le16(allocated); | |
667eff35 YY |
2831 | ext4_ext_store_pblock(&zero_ex, |
2832 | ext4_ext_pblock(ex) + map->m_lblk - ee_block); | |
2833 | err = ext4_ext_zeroout(inode, &zero_ex); | |
56055d3a AA |
2834 | if (err) |
2835 | goto out; | |
667eff35 YY |
2836 | split_map.m_lblk = map->m_lblk; |
2837 | split_map.m_len = allocated; | |
2838 | } else if ((map->m_lblk - ee_block + map->m_len < | |
2839 | EXT4_EXT_ZERO_LEN) && | |
2840 | (EXT4_EXT_MAY_ZEROOUT & split_flag)) { | |
2841 | /* case 2 */ | |
2842 | if (map->m_lblk != ee_block) { | |
2843 | zero_ex.ee_block = ex->ee_block; | |
2844 | zero_ex.ee_len = cpu_to_le16(map->m_lblk - | |
2845 | ee_block); | |
2846 | ext4_ext_store_pblock(&zero_ex, | |
2847 | ext4_ext_pblock(ex)); | |
2848 | err = ext4_ext_zeroout(inode, &zero_ex); | |
2849 | if (err) | |
2850 | goto out; | |
2851 | } | |
2852 | ||
667eff35 | 2853 | split_map.m_lblk = ee_block; |
9b940f8e AH |
2854 | split_map.m_len = map->m_lblk - ee_block + map->m_len; |
2855 | allocated = map->m_len; | |
56055d3a AA |
2856 | } |
2857 | } | |
667eff35 YY |
2858 | |
2859 | allocated = ext4_split_extent(handle, inode, path, | |
2860 | &split_map, split_flag, 0); | |
2861 | if (allocated < 0) | |
2862 | err = allocated; | |
2863 | ||
56055d3a AA |
2864 | out: |
2865 | return err ? err : allocated; | |
2866 | } | |
2867 | ||
0031462b | 2868 | /* |
e35fd660 | 2869 | * This function is called by ext4_ext_map_blocks() from |
0031462b MC |
2870 | * ext4_get_blocks_dio_write() when DIO to write |
2871 | * to an uninitialized extent. | |
2872 | * | |
fd018fe8 | 2873 | * Writing to an uninitialized extent may result in splitting the uninitialized |
b595076a | 2874 | * extent into multiple /initialized uninitialized extents (up to three) |
0031462b MC |
2875 | * There are three possibilities: |
2876 | * a> There is no split required: Entire extent should be uninitialized | |
2877 | * b> Splits in two extents: Write is happening at either end of the extent | |
2878 | * c> Splits in three extents: Somone is writing in middle of the extent | |
2879 | * | |
2880 | * One of more index blocks maybe needed if the extent tree grow after | |
b595076a | 2881 | * the uninitialized extent split. To prevent ENOSPC occur at the IO |
0031462b | 2882 | * complete, we need to split the uninitialized extent before DIO submit |
421f91d2 | 2883 | * the IO. The uninitialized extent called at this time will be split |
0031462b MC |
2884 | * into three uninitialized extent(at most). After IO complete, the part |
2885 | * being filled will be convert to initialized by the end_io callback function | |
2886 | * via ext4_convert_unwritten_extents(). | |
ba230c3f M |
2887 | * |
2888 | * Returns the size of uninitialized extent to be written on success. | |
0031462b MC |
2889 | */ |
2890 | static int ext4_split_unwritten_extents(handle_t *handle, | |
2891 | struct inode *inode, | |
e35fd660 | 2892 | struct ext4_map_blocks *map, |
0031462b | 2893 | struct ext4_ext_path *path, |
0031462b MC |
2894 | int flags) |
2895 | { | |
667eff35 YY |
2896 | ext4_lblk_t eof_block; |
2897 | ext4_lblk_t ee_block; | |
2898 | struct ext4_extent *ex; | |
2899 | unsigned int ee_len; | |
2900 | int split_flag = 0, depth; | |
21ca087a DM |
2901 | |
2902 | ext_debug("ext4_split_unwritten_extents: inode %lu, logical" | |
2903 | "block %llu, max_blocks %u\n", inode->i_ino, | |
e35fd660 | 2904 | (unsigned long long)map->m_lblk, map->m_len); |
21ca087a DM |
2905 | |
2906 | eof_block = (inode->i_size + inode->i_sb->s_blocksize - 1) >> | |
2907 | inode->i_sb->s_blocksize_bits; | |
e35fd660 TT |
2908 | if (eof_block < map->m_lblk + map->m_len) |
2909 | eof_block = map->m_lblk + map->m_len; | |
21ca087a DM |
2910 | /* |
2911 | * It is safe to convert extent to initialized via explicit | |
2912 | * zeroout only if extent is fully insde i_size or new_size. | |
2913 | */ | |
667eff35 YY |
2914 | depth = ext_depth(inode); |
2915 | ex = path[depth].p_ext; | |
2916 | ee_block = le32_to_cpu(ex->ee_block); | |
2917 | ee_len = ext4_ext_get_actual_len(ex); | |
0031462b | 2918 | |
667eff35 YY |
2919 | split_flag |= ee_block + ee_len <= eof_block ? EXT4_EXT_MAY_ZEROOUT : 0; |
2920 | split_flag |= EXT4_EXT_MARK_UNINIT2; | |
0031462b | 2921 | |
667eff35 YY |
2922 | flags |= EXT4_GET_BLOCKS_PRE_IO; |
2923 | return ext4_split_extent(handle, inode, path, map, split_flag, flags); | |
0031462b | 2924 | } |
197217a5 | 2925 | |
c7064ef1 | 2926 | static int ext4_convert_unwritten_extents_endio(handle_t *handle, |
0031462b MC |
2927 | struct inode *inode, |
2928 | struct ext4_ext_path *path) | |
2929 | { | |
2930 | struct ext4_extent *ex; | |
2931 | struct ext4_extent_header *eh; | |
2932 | int depth; | |
2933 | int err = 0; | |
0031462b MC |
2934 | |
2935 | depth = ext_depth(inode); | |
2936 | eh = path[depth].p_hdr; | |
2937 | ex = path[depth].p_ext; | |
2938 | ||
197217a5 YY |
2939 | ext_debug("ext4_convert_unwritten_extents_endio: inode %lu, logical" |
2940 | "block %llu, max_blocks %u\n", inode->i_ino, | |
2941 | (unsigned long long)le32_to_cpu(ex->ee_block), | |
2942 | ext4_ext_get_actual_len(ex)); | |
2943 | ||
0031462b MC |
2944 | err = ext4_ext_get_access(handle, inode, path + depth); |
2945 | if (err) | |
2946 | goto out; | |
2947 | /* first mark the extent as initialized */ | |
2948 | ext4_ext_mark_initialized(ex); | |
2949 | ||
197217a5 YY |
2950 | /* note: ext4_ext_correct_indexes() isn't needed here because |
2951 | * borders are not changed | |
0031462b | 2952 | */ |
197217a5 YY |
2953 | ext4_ext_try_to_merge(inode, path, ex); |
2954 | ||
0031462b MC |
2955 | /* Mark modified extent as dirty */ |
2956 | err = ext4_ext_dirty(handle, inode, path + depth); | |
2957 | out: | |
2958 | ext4_ext_show_leaf(inode, path); | |
2959 | return err; | |
2960 | } | |
2961 | ||
515f41c3 AK |
2962 | static void unmap_underlying_metadata_blocks(struct block_device *bdev, |
2963 | sector_t block, int count) | |
2964 | { | |
2965 | int i; | |
2966 | for (i = 0; i < count; i++) | |
2967 | unmap_underlying_metadata(bdev, block + i); | |
2968 | } | |
2969 | ||
58590b06 TT |
2970 | /* |
2971 | * Handle EOFBLOCKS_FL flag, clearing it if necessary | |
2972 | */ | |
2973 | static int check_eofblocks_fl(handle_t *handle, struct inode *inode, | |
d002ebf1 | 2974 | ext4_lblk_t lblk, |
58590b06 TT |
2975 | struct ext4_ext_path *path, |
2976 | unsigned int len) | |
2977 | { | |
2978 | int i, depth; | |
2979 | struct ext4_extent_header *eh; | |
65922cb5 | 2980 | struct ext4_extent *last_ex; |
58590b06 TT |
2981 | |
2982 | if (!ext4_test_inode_flag(inode, EXT4_INODE_EOFBLOCKS)) | |
2983 | return 0; | |
2984 | ||
2985 | depth = ext_depth(inode); | |
2986 | eh = path[depth].p_hdr; | |
58590b06 TT |
2987 | |
2988 | if (unlikely(!eh->eh_entries)) { | |
2989 | EXT4_ERROR_INODE(inode, "eh->eh_entries == 0 and " | |
2990 | "EOFBLOCKS_FL set"); | |
2991 | return -EIO; | |
2992 | } | |
2993 | last_ex = EXT_LAST_EXTENT(eh); | |
2994 | /* | |
2995 | * We should clear the EOFBLOCKS_FL flag if we are writing the | |
2996 | * last block in the last extent in the file. We test this by | |
2997 | * first checking to see if the caller to | |
2998 | * ext4_ext_get_blocks() was interested in the last block (or | |
2999 | * a block beyond the last block) in the current extent. If | |
3000 | * this turns out to be false, we can bail out from this | |
3001 | * function immediately. | |
3002 | */ | |
d002ebf1 | 3003 | if (lblk + len < le32_to_cpu(last_ex->ee_block) + |
58590b06 TT |
3004 | ext4_ext_get_actual_len(last_ex)) |
3005 | return 0; | |
3006 | /* | |
3007 | * If the caller does appear to be planning to write at or | |
3008 | * beyond the end of the current extent, we then test to see | |
3009 | * if the current extent is the last extent in the file, by | |
3010 | * checking to make sure it was reached via the rightmost node | |
3011 | * at each level of the tree. | |
3012 | */ | |
3013 | for (i = depth-1; i >= 0; i--) | |
3014 | if (path[i].p_idx != EXT_LAST_INDEX(path[i].p_hdr)) | |
3015 | return 0; | |
3016 | ext4_clear_inode_flag(inode, EXT4_INODE_EOFBLOCKS); | |
3017 | return ext4_mark_inode_dirty(handle, inode); | |
3018 | } | |
3019 | ||
0031462b MC |
3020 | static int |
3021 | ext4_ext_handle_uninitialized_extents(handle_t *handle, struct inode *inode, | |
e35fd660 | 3022 | struct ext4_map_blocks *map, |
0031462b | 3023 | struct ext4_ext_path *path, int flags, |
e35fd660 | 3024 | unsigned int allocated, ext4_fsblk_t newblock) |
0031462b MC |
3025 | { |
3026 | int ret = 0; | |
3027 | int err = 0; | |
8d5d02e6 | 3028 | ext4_io_end_t *io = EXT4_I(inode)->cur_aio_dio; |
0031462b MC |
3029 | |
3030 | ext_debug("ext4_ext_handle_uninitialized_extents: inode %lu, logical" | |
3031 | "block %llu, max_blocks %u, flags %d, allocated %u", | |
e35fd660 | 3032 | inode->i_ino, (unsigned long long)map->m_lblk, map->m_len, |
0031462b MC |
3033 | flags, allocated); |
3034 | ext4_ext_show_leaf(inode, path); | |
3035 | ||
c7064ef1 | 3036 | /* get_block() before submit the IO, split the extent */ |
744692dc | 3037 | if ((flags & EXT4_GET_BLOCKS_PRE_IO)) { |
e35fd660 TT |
3038 | ret = ext4_split_unwritten_extents(handle, inode, map, |
3039 | path, flags); | |
5f524950 M |
3040 | /* |
3041 | * Flag the inode(non aio case) or end_io struct (aio case) | |
25985edc | 3042 | * that this IO needs to conversion to written when IO is |
5f524950 M |
3043 | * completed |
3044 | */ | |
e9e3bcec | 3045 | if (io && !(io->flag & EXT4_IO_END_UNWRITTEN)) { |
bd2d0210 | 3046 | io->flag = EXT4_IO_END_UNWRITTEN; |
e9e3bcec ES |
3047 | atomic_inc(&EXT4_I(inode)->i_aiodio_unwritten); |
3048 | } else | |
19f5fb7a | 3049 | ext4_set_inode_state(inode, EXT4_STATE_DIO_UNWRITTEN); |
744692dc | 3050 | if (ext4_should_dioread_nolock(inode)) |
e35fd660 | 3051 | map->m_flags |= EXT4_MAP_UNINIT; |
0031462b MC |
3052 | goto out; |
3053 | } | |
c7064ef1 | 3054 | /* IO end_io complete, convert the filled extent to written */ |
744692dc | 3055 | if ((flags & EXT4_GET_BLOCKS_CONVERT)) { |
c7064ef1 | 3056 | ret = ext4_convert_unwritten_extents_endio(handle, inode, |
0031462b | 3057 | path); |
58590b06 | 3058 | if (ret >= 0) { |
b436b9be | 3059 | ext4_update_inode_fsync_trans(handle, inode, 1); |
d002ebf1 ES |
3060 | err = check_eofblocks_fl(handle, inode, map->m_lblk, |
3061 | path, map->m_len); | |
58590b06 TT |
3062 | } else |
3063 | err = ret; | |
0031462b MC |
3064 | goto out2; |
3065 | } | |
3066 | /* buffered IO case */ | |
3067 | /* | |
3068 | * repeat fallocate creation request | |
3069 | * we already have an unwritten extent | |
3070 | */ | |
3071 | if (flags & EXT4_GET_BLOCKS_UNINIT_EXT) | |
3072 | goto map_out; | |
3073 | ||
3074 | /* buffered READ or buffered write_begin() lookup */ | |
3075 | if ((flags & EXT4_GET_BLOCKS_CREATE) == 0) { | |
3076 | /* | |
3077 | * We have blocks reserved already. We | |
3078 | * return allocated blocks so that delalloc | |
3079 | * won't do block reservation for us. But | |
3080 | * the buffer head will be unmapped so that | |
3081 | * a read from the block returns 0s. | |
3082 | */ | |
e35fd660 | 3083 | map->m_flags |= EXT4_MAP_UNWRITTEN; |
0031462b MC |
3084 | goto out1; |
3085 | } | |
3086 | ||
3087 | /* buffered write, writepage time, convert*/ | |
e35fd660 | 3088 | ret = ext4_ext_convert_to_initialized(handle, inode, map, path); |
58590b06 | 3089 | if (ret >= 0) { |
b436b9be | 3090 | ext4_update_inode_fsync_trans(handle, inode, 1); |
d002ebf1 ES |
3091 | err = check_eofblocks_fl(handle, inode, map->m_lblk, path, |
3092 | map->m_len); | |
58590b06 TT |
3093 | if (err < 0) |
3094 | goto out2; | |
3095 | } | |
3096 | ||
0031462b MC |
3097 | out: |
3098 | if (ret <= 0) { | |
3099 | err = ret; | |
3100 | goto out2; | |
3101 | } else | |
3102 | allocated = ret; | |
e35fd660 | 3103 | map->m_flags |= EXT4_MAP_NEW; |
515f41c3 AK |
3104 | /* |
3105 | * if we allocated more blocks than requested | |
3106 | * we need to make sure we unmap the extra block | |
3107 | * allocated. The actual needed block will get | |
3108 | * unmapped later when we find the buffer_head marked | |
3109 | * new. | |
3110 | */ | |
e35fd660 | 3111 | if (allocated > map->m_len) { |
515f41c3 | 3112 | unmap_underlying_metadata_blocks(inode->i_sb->s_bdev, |
e35fd660 TT |
3113 | newblock + map->m_len, |
3114 | allocated - map->m_len); | |
3115 | allocated = map->m_len; | |
515f41c3 | 3116 | } |
5f634d06 AK |
3117 | |
3118 | /* | |
3119 | * If we have done fallocate with the offset that is already | |
3120 | * delayed allocated, we would have block reservation | |
3121 | * and quota reservation done in the delayed write path. | |
3122 | * But fallocate would have already updated quota and block | |
3123 | * count for this offset. So cancel these reservation | |
3124 | */ | |
1296cc85 | 3125 | if (flags & EXT4_GET_BLOCKS_DELALLOC_RESERVE) |
5f634d06 AK |
3126 | ext4_da_update_reserve_space(inode, allocated, 0); |
3127 | ||
0031462b | 3128 | map_out: |
e35fd660 | 3129 | map->m_flags |= EXT4_MAP_MAPPED; |
0031462b | 3130 | out1: |
e35fd660 TT |
3131 | if (allocated > map->m_len) |
3132 | allocated = map->m_len; | |
0031462b | 3133 | ext4_ext_show_leaf(inode, path); |
e35fd660 TT |
3134 | map->m_pblk = newblock; |
3135 | map->m_len = allocated; | |
0031462b MC |
3136 | out2: |
3137 | if (path) { | |
3138 | ext4_ext_drop_refs(path); | |
3139 | kfree(path); | |
3140 | } | |
3141 | return err ? err : allocated; | |
3142 | } | |
58590b06 | 3143 | |
c278bfec | 3144 | /* |
f5ab0d1f MC |
3145 | * Block allocation/map/preallocation routine for extents based files |
3146 | * | |
3147 | * | |
c278bfec | 3148 | * Need to be called with |
0e855ac8 AK |
3149 | * down_read(&EXT4_I(inode)->i_data_sem) if not allocating file system block |
3150 | * (ie, create is zero). Otherwise down_write(&EXT4_I(inode)->i_data_sem) | |
f5ab0d1f MC |
3151 | * |
3152 | * return > 0, number of of blocks already mapped/allocated | |
3153 | * if create == 0 and these are pre-allocated blocks | |
3154 | * buffer head is unmapped | |
3155 | * otherwise blocks are mapped | |
3156 | * | |
3157 | * return = 0, if plain look up failed (blocks have not been allocated) | |
3158 | * buffer head is unmapped | |
3159 | * | |
3160 | * return < 0, error case. | |
c278bfec | 3161 | */ |
e35fd660 TT |
3162 | int ext4_ext_map_blocks(handle_t *handle, struct inode *inode, |
3163 | struct ext4_map_blocks *map, int flags) | |
a86c6181 AT |
3164 | { |
3165 | struct ext4_ext_path *path = NULL; | |
58590b06 | 3166 | struct ext4_extent newex, *ex; |
0562e0ba | 3167 | ext4_fsblk_t newblock = 0; |
b05e6ae5 | 3168 | int err = 0, depth, ret; |
498e5f24 | 3169 | unsigned int allocated = 0; |
c9de560d | 3170 | struct ext4_allocation_request ar; |
8d5d02e6 | 3171 | ext4_io_end_t *io = EXT4_I(inode)->cur_aio_dio; |
a86c6181 | 3172 | |
84fe3bef | 3173 | ext_debug("blocks %u/%u requested for inode %lu\n", |
e35fd660 | 3174 | map->m_lblk, map->m_len, inode->i_ino); |
0562e0ba | 3175 | trace_ext4_ext_map_blocks_enter(inode, map->m_lblk, map->m_len, flags); |
a86c6181 AT |
3176 | |
3177 | /* check in cache */ | |
b05e6ae5 TT |
3178 | if (ext4_ext_in_cache(inode, map->m_lblk, &newex)) { |
3179 | if (!newex.ee_start_lo && !newex.ee_start_hi) { | |
c2177057 | 3180 | if ((flags & EXT4_GET_BLOCKS_CREATE) == 0) { |
56055d3a AA |
3181 | /* |
3182 | * block isn't allocated yet and | |
3183 | * user doesn't want to allocate it | |
3184 | */ | |
a86c6181 AT |
3185 | goto out2; |
3186 | } | |
3187 | /* we should allocate requested block */ | |
b05e6ae5 | 3188 | } else { |
a86c6181 | 3189 | /* block is already allocated */ |
e35fd660 | 3190 | newblock = map->m_lblk |
8c55e204 | 3191 | - le32_to_cpu(newex.ee_block) |
bf89d16f | 3192 | + ext4_ext_pblock(&newex); |
d0d856e8 | 3193 | /* number of remaining blocks in the extent */ |
b939e376 | 3194 | allocated = ext4_ext_get_actual_len(&newex) - |
e35fd660 | 3195 | (map->m_lblk - le32_to_cpu(newex.ee_block)); |
a86c6181 | 3196 | goto out; |
a86c6181 AT |
3197 | } |
3198 | } | |
3199 | ||
3200 | /* find extent for this block */ | |
e35fd660 | 3201 | path = ext4_ext_find_extent(inode, map->m_lblk, NULL); |
a86c6181 AT |
3202 | if (IS_ERR(path)) { |
3203 | err = PTR_ERR(path); | |
3204 | path = NULL; | |
3205 | goto out2; | |
3206 | } | |
3207 | ||
3208 | depth = ext_depth(inode); | |
3209 | ||
3210 | /* | |
d0d856e8 RD |
3211 | * consistent leaf must not be empty; |
3212 | * this situation is possible, though, _during_ tree modification; | |
a86c6181 AT |
3213 | * this is why assert can't be put in ext4_ext_find_extent() |
3214 | */ | |
273df556 FM |
3215 | if (unlikely(path[depth].p_ext == NULL && depth != 0)) { |
3216 | EXT4_ERROR_INODE(inode, "bad extent address " | |
f70f362b TT |
3217 | "lblock: %lu, depth: %d pblock %lld", |
3218 | (unsigned long) map->m_lblk, depth, | |
3219 | path[depth].p_block); | |
034fb4c9 SP |
3220 | err = -EIO; |
3221 | goto out2; | |
3222 | } | |
a86c6181 | 3223 | |
7e028976 AM |
3224 | ex = path[depth].p_ext; |
3225 | if (ex) { | |
725d26d3 | 3226 | ext4_lblk_t ee_block = le32_to_cpu(ex->ee_block); |
bf89d16f | 3227 | ext4_fsblk_t ee_start = ext4_ext_pblock(ex); |
a2df2a63 | 3228 | unsigned short ee_len; |
471d4011 SB |
3229 | |
3230 | /* | |
471d4011 | 3231 | * Uninitialized extents are treated as holes, except that |
56055d3a | 3232 | * we split out initialized portions during a write. |
471d4011 | 3233 | */ |
a2df2a63 | 3234 | ee_len = ext4_ext_get_actual_len(ex); |
d0d856e8 | 3235 | /* if found extent covers block, simply return it */ |
e35fd660 TT |
3236 | if (in_range(map->m_lblk, ee_block, ee_len)) { |
3237 | newblock = map->m_lblk - ee_block + ee_start; | |
d0d856e8 | 3238 | /* number of remaining blocks in the extent */ |
e35fd660 TT |
3239 | allocated = ee_len - (map->m_lblk - ee_block); |
3240 | ext_debug("%u fit into %u:%d -> %llu\n", map->m_lblk, | |
3241 | ee_block, ee_len, newblock); | |
56055d3a | 3242 | |
a2df2a63 | 3243 | /* Do not put uninitialized extent in the cache */ |
56055d3a | 3244 | if (!ext4_ext_is_uninitialized(ex)) { |
a2df2a63 | 3245 | ext4_ext_put_in_cache(inode, ee_block, |
b05e6ae5 | 3246 | ee_len, ee_start); |
56055d3a AA |
3247 | goto out; |
3248 | } | |
0031462b | 3249 | ret = ext4_ext_handle_uninitialized_extents(handle, |
e35fd660 TT |
3250 | inode, map, path, flags, allocated, |
3251 | newblock); | |
0031462b | 3252 | return ret; |
a86c6181 AT |
3253 | } |
3254 | } | |
3255 | ||
3256 | /* | |
d0d856e8 | 3257 | * requested block isn't allocated yet; |
a86c6181 AT |
3258 | * we couldn't try to create block if create flag is zero |
3259 | */ | |
c2177057 | 3260 | if ((flags & EXT4_GET_BLOCKS_CREATE) == 0) { |
56055d3a AA |
3261 | /* |
3262 | * put just found gap into cache to speed up | |
3263 | * subsequent requests | |
3264 | */ | |
e35fd660 | 3265 | ext4_ext_put_gap_in_cache(inode, path, map->m_lblk); |
a86c6181 AT |
3266 | goto out2; |
3267 | } | |
3268 | /* | |
c2ea3fde | 3269 | * Okay, we need to do block allocation. |
63f57933 | 3270 | */ |
a86c6181 | 3271 | |
c9de560d | 3272 | /* find neighbour allocated blocks */ |
e35fd660 | 3273 | ar.lleft = map->m_lblk; |
c9de560d AT |
3274 | err = ext4_ext_search_left(inode, path, &ar.lleft, &ar.pleft); |
3275 | if (err) | |
3276 | goto out2; | |
e35fd660 | 3277 | ar.lright = map->m_lblk; |
c9de560d AT |
3278 | err = ext4_ext_search_right(inode, path, &ar.lright, &ar.pright); |
3279 | if (err) | |
3280 | goto out2; | |
25d14f98 | 3281 | |
749269fa AA |
3282 | /* |
3283 | * See if request is beyond maximum number of blocks we can have in | |
3284 | * a single extent. For an initialized extent this limit is | |
3285 | * EXT_INIT_MAX_LEN and for an uninitialized extent this limit is | |
3286 | * EXT_UNINIT_MAX_LEN. | |
3287 | */ | |
e35fd660 | 3288 | if (map->m_len > EXT_INIT_MAX_LEN && |
c2177057 | 3289 | !(flags & EXT4_GET_BLOCKS_UNINIT_EXT)) |
e35fd660 TT |
3290 | map->m_len = EXT_INIT_MAX_LEN; |
3291 | else if (map->m_len > EXT_UNINIT_MAX_LEN && | |
c2177057 | 3292 | (flags & EXT4_GET_BLOCKS_UNINIT_EXT)) |
e35fd660 | 3293 | map->m_len = EXT_UNINIT_MAX_LEN; |
749269fa | 3294 | |
e35fd660 TT |
3295 | /* Check if we can really insert (m_lblk)::(m_lblk + m_len) extent */ |
3296 | newex.ee_block = cpu_to_le32(map->m_lblk); | |
3297 | newex.ee_len = cpu_to_le16(map->m_len); | |
25d14f98 AA |
3298 | err = ext4_ext_check_overlap(inode, &newex, path); |
3299 | if (err) | |
b939e376 | 3300 | allocated = ext4_ext_get_actual_len(&newex); |
25d14f98 | 3301 | else |
e35fd660 | 3302 | allocated = map->m_len; |
c9de560d AT |
3303 | |
3304 | /* allocate new block */ | |
3305 | ar.inode = inode; | |
e35fd660 TT |
3306 | ar.goal = ext4_ext_find_goal(inode, path, map->m_lblk); |
3307 | ar.logical = map->m_lblk; | |
c9de560d AT |
3308 | ar.len = allocated; |
3309 | if (S_ISREG(inode->i_mode)) | |
3310 | ar.flags = EXT4_MB_HINT_DATA; | |
3311 | else | |
3312 | /* disable in-core preallocation for non-regular files */ | |
3313 | ar.flags = 0; | |
3314 | newblock = ext4_mb_new_blocks(handle, &ar, &err); | |
a86c6181 AT |
3315 | if (!newblock) |
3316 | goto out2; | |
84fe3bef | 3317 | ext_debug("allocate new block: goal %llu, found %llu/%u\n", |
498e5f24 | 3318 | ar.goal, newblock, allocated); |
a86c6181 AT |
3319 | |
3320 | /* try to insert new extent into found leaf and return */ | |
f65e6fba | 3321 | ext4_ext_store_pblock(&newex, newblock); |
c9de560d | 3322 | newex.ee_len = cpu_to_le16(ar.len); |
8d5d02e6 MC |
3323 | /* Mark uninitialized */ |
3324 | if (flags & EXT4_GET_BLOCKS_UNINIT_EXT){ | |
a2df2a63 | 3325 | ext4_ext_mark_uninitialized(&newex); |
8d5d02e6 | 3326 | /* |
744692dc | 3327 | * io_end structure was created for every IO write to an |
25985edc | 3328 | * uninitialized extent. To avoid unnecessary conversion, |
744692dc | 3329 | * here we flag the IO that really needs the conversion. |
5f524950 | 3330 | * For non asycn direct IO case, flag the inode state |
25985edc | 3331 | * that we need to perform conversion when IO is done. |
8d5d02e6 | 3332 | */ |
744692dc | 3333 | if ((flags & EXT4_GET_BLOCKS_PRE_IO)) { |
e9e3bcec | 3334 | if (io && !(io->flag & EXT4_IO_END_UNWRITTEN)) { |
bd2d0210 | 3335 | io->flag = EXT4_IO_END_UNWRITTEN; |
e9e3bcec ES |
3336 | atomic_inc(&EXT4_I(inode)->i_aiodio_unwritten); |
3337 | } else | |
19f5fb7a TT |
3338 | ext4_set_inode_state(inode, |
3339 | EXT4_STATE_DIO_UNWRITTEN); | |
5f524950 | 3340 | } |
744692dc | 3341 | if (ext4_should_dioread_nolock(inode)) |
e35fd660 | 3342 | map->m_flags |= EXT4_MAP_UNINIT; |
8d5d02e6 | 3343 | } |
c8d46e41 | 3344 | |
d002ebf1 | 3345 | err = check_eofblocks_fl(handle, inode, map->m_lblk, path, ar.len); |
58590b06 TT |
3346 | if (err) |
3347 | goto out2; | |
3348 | ||
0031462b | 3349 | err = ext4_ext_insert_extent(handle, inode, path, &newex, flags); |
315054f0 AT |
3350 | if (err) { |
3351 | /* free data blocks we just allocated */ | |
c9de560d AT |
3352 | /* not a good idea to call discard here directly, |
3353 | * but otherwise we'd need to call it every free() */ | |
c2ea3fde | 3354 | ext4_discard_preallocations(inode); |
7dc57615 | 3355 | ext4_free_blocks(handle, inode, NULL, ext4_ext_pblock(&newex), |
e6362609 | 3356 | ext4_ext_get_actual_len(&newex), 0); |
a86c6181 | 3357 | goto out2; |
315054f0 | 3358 | } |
a86c6181 | 3359 | |
a86c6181 | 3360 | /* previous routine could use block we allocated */ |
bf89d16f | 3361 | newblock = ext4_ext_pblock(&newex); |
b939e376 | 3362 | allocated = ext4_ext_get_actual_len(&newex); |
e35fd660 TT |
3363 | if (allocated > map->m_len) |
3364 | allocated = map->m_len; | |
3365 | map->m_flags |= EXT4_MAP_NEW; | |
a86c6181 | 3366 | |
5f634d06 AK |
3367 | /* |
3368 | * Update reserved blocks/metadata blocks after successful | |
3369 | * block allocation which had been deferred till now. | |
3370 | */ | |
1296cc85 | 3371 | if (flags & EXT4_GET_BLOCKS_DELALLOC_RESERVE) |
5f634d06 AK |
3372 | ext4_da_update_reserve_space(inode, allocated, 1); |
3373 | ||
b436b9be JK |
3374 | /* |
3375 | * Cache the extent and update transaction to commit on fdatasync only | |
3376 | * when it is _not_ an uninitialized extent. | |
3377 | */ | |
3378 | if ((flags & EXT4_GET_BLOCKS_UNINIT_EXT) == 0) { | |
b05e6ae5 | 3379 | ext4_ext_put_in_cache(inode, map->m_lblk, allocated, newblock); |
b436b9be JK |
3380 | ext4_update_inode_fsync_trans(handle, inode, 1); |
3381 | } else | |
3382 | ext4_update_inode_fsync_trans(handle, inode, 0); | |
a86c6181 | 3383 | out: |
e35fd660 TT |
3384 | if (allocated > map->m_len) |
3385 | allocated = map->m_len; | |
a86c6181 | 3386 | ext4_ext_show_leaf(inode, path); |
e35fd660 TT |
3387 | map->m_flags |= EXT4_MAP_MAPPED; |
3388 | map->m_pblk = newblock; | |
3389 | map->m_len = allocated; | |
a86c6181 AT |
3390 | out2: |
3391 | if (path) { | |
3392 | ext4_ext_drop_refs(path); | |
3393 | kfree(path); | |
3394 | } | |
0562e0ba JZ |
3395 | trace_ext4_ext_map_blocks_exit(inode, map->m_lblk, |
3396 | newblock, map->m_len, err ? err : allocated); | |
a86c6181 AT |
3397 | return err ? err : allocated; |
3398 | } | |
3399 | ||
cf108bca | 3400 | void ext4_ext_truncate(struct inode *inode) |
a86c6181 AT |
3401 | { |
3402 | struct address_space *mapping = inode->i_mapping; | |
3403 | struct super_block *sb = inode->i_sb; | |
725d26d3 | 3404 | ext4_lblk_t last_block; |
a86c6181 AT |
3405 | handle_t *handle; |
3406 | int err = 0; | |
3407 | ||
3889fd57 JZ |
3408 | /* |
3409 | * finish any pending end_io work so we won't run the risk of | |
3410 | * converting any truncated blocks to initialized later | |
3411 | */ | |
3412 | ext4_flush_completed_IO(inode); | |
3413 | ||
a86c6181 AT |
3414 | /* |
3415 | * probably first extent we're gonna free will be last in block | |
3416 | */ | |
f3bd1f3f | 3417 | err = ext4_writepage_trans_blocks(inode); |
a86c6181 | 3418 | handle = ext4_journal_start(inode, err); |
cf108bca | 3419 | if (IS_ERR(handle)) |
a86c6181 | 3420 | return; |
a86c6181 | 3421 | |
cf108bca JK |
3422 | if (inode->i_size & (sb->s_blocksize - 1)) |
3423 | ext4_block_truncate_page(handle, mapping, inode->i_size); | |
a86c6181 | 3424 | |
9ddfc3dc JK |
3425 | if (ext4_orphan_add(handle, inode)) |
3426 | goto out_stop; | |
3427 | ||
0e855ac8 | 3428 | down_write(&EXT4_I(inode)->i_data_sem); |
a86c6181 AT |
3429 | ext4_ext_invalidate_cache(inode); |
3430 | ||
c2ea3fde | 3431 | ext4_discard_preallocations(inode); |
c9de560d | 3432 | |
a86c6181 | 3433 | /* |
d0d856e8 RD |
3434 | * TODO: optimization is possible here. |
3435 | * Probably we need not scan at all, | |
3436 | * because page truncation is enough. | |
a86c6181 | 3437 | */ |
a86c6181 AT |
3438 | |
3439 | /* we have to know where to truncate from in crash case */ | |
3440 | EXT4_I(inode)->i_disksize = inode->i_size; | |
3441 | ext4_mark_inode_dirty(handle, inode); | |
3442 | ||
3443 | last_block = (inode->i_size + sb->s_blocksize - 1) | |
3444 | >> EXT4_BLOCK_SIZE_BITS(sb); | |
3445 | err = ext4_ext_remove_space(inode, last_block); | |
3446 | ||
3447 | /* In a multi-transaction truncate, we only make the final | |
56055d3a AA |
3448 | * transaction synchronous. |
3449 | */ | |
a86c6181 | 3450 | if (IS_SYNC(inode)) |
0390131b | 3451 | ext4_handle_sync(handle); |
a86c6181 AT |
3452 | |
3453 | out_stop: | |
9ddfc3dc | 3454 | up_write(&EXT4_I(inode)->i_data_sem); |
a86c6181 | 3455 | /* |
d0d856e8 | 3456 | * If this was a simple ftruncate() and the file will remain alive, |
a86c6181 AT |
3457 | * then we need to clear up the orphan record which we created above. |
3458 | * However, if this was a real unlink then we were called by | |
3459 | * ext4_delete_inode(), and we allow that function to clean up the | |
3460 | * orphan info for us. | |
3461 | */ | |
3462 | if (inode->i_nlink) | |
3463 | ext4_orphan_del(handle, inode); | |
3464 | ||
ef737728 SR |
3465 | inode->i_mtime = inode->i_ctime = ext4_current_time(inode); |
3466 | ext4_mark_inode_dirty(handle, inode); | |
a86c6181 AT |
3467 | ext4_journal_stop(handle); |
3468 | } | |
3469 | ||
fd28784a AK |
3470 | static void ext4_falloc_update_inode(struct inode *inode, |
3471 | int mode, loff_t new_size, int update_ctime) | |
3472 | { | |
3473 | struct timespec now; | |
3474 | ||
3475 | if (update_ctime) { | |
3476 | now = current_fs_time(inode->i_sb); | |
3477 | if (!timespec_equal(&inode->i_ctime, &now)) | |
3478 | inode->i_ctime = now; | |
3479 | } | |
3480 | /* | |
3481 | * Update only when preallocation was requested beyond | |
3482 | * the file size. | |
3483 | */ | |
cf17fea6 AK |
3484 | if (!(mode & FALLOC_FL_KEEP_SIZE)) { |
3485 | if (new_size > i_size_read(inode)) | |
3486 | i_size_write(inode, new_size); | |
3487 | if (new_size > EXT4_I(inode)->i_disksize) | |
3488 | ext4_update_i_disksize(inode, new_size); | |
c8d46e41 JZ |
3489 | } else { |
3490 | /* | |
3491 | * Mark that we allocate beyond EOF so the subsequent truncate | |
3492 | * can proceed even if the new size is the same as i_size. | |
3493 | */ | |
3494 | if (new_size > i_size_read(inode)) | |
12e9b892 | 3495 | ext4_set_inode_flag(inode, EXT4_INODE_EOFBLOCKS); |
fd28784a AK |
3496 | } |
3497 | ||
3498 | } | |
3499 | ||
a2df2a63 | 3500 | /* |
2fe17c10 | 3501 | * preallocate space for a file. This implements ext4's fallocate file |
a2df2a63 AA |
3502 | * operation, which gets called from sys_fallocate system call. |
3503 | * For block-mapped files, posix_fallocate should fall back to the method | |
3504 | * of writing zeroes to the required new blocks (the same behavior which is | |
3505 | * expected for file systems which do not support fallocate() system call). | |
3506 | */ | |
2fe17c10 | 3507 | long ext4_fallocate(struct file *file, int mode, loff_t offset, loff_t len) |
a2df2a63 | 3508 | { |
2fe17c10 | 3509 | struct inode *inode = file->f_path.dentry->d_inode; |
a2df2a63 | 3510 | handle_t *handle; |
fd28784a | 3511 | loff_t new_size; |
498e5f24 | 3512 | unsigned int max_blocks; |
a2df2a63 AA |
3513 | int ret = 0; |
3514 | int ret2 = 0; | |
3515 | int retries = 0; | |
2ed88685 | 3516 | struct ext4_map_blocks map; |
a2df2a63 AA |
3517 | unsigned int credits, blkbits = inode->i_blkbits; |
3518 | ||
d6dc8462 | 3519 | /* We only support the FALLOC_FL_KEEP_SIZE mode */ |
64c23e86 | 3520 | if (mode & ~FALLOC_FL_KEEP_SIZE) |
d6dc8462 JB |
3521 | return -EOPNOTSUPP; |
3522 | ||
a2df2a63 AA |
3523 | /* |
3524 | * currently supporting (pre)allocate mode for extent-based | |
3525 | * files _only_ | |
3526 | */ | |
12e9b892 | 3527 | if (!(ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS))) |
a2df2a63 AA |
3528 | return -EOPNOTSUPP; |
3529 | ||
0562e0ba | 3530 | trace_ext4_fallocate_enter(inode, offset, len, mode); |
2ed88685 | 3531 | map.m_lblk = offset >> blkbits; |
fd28784a AK |
3532 | /* |
3533 | * We can't just convert len to max_blocks because | |
3534 | * If blocksize = 4096 offset = 3072 and len = 2048 | |
3535 | */ | |
a2df2a63 | 3536 | max_blocks = (EXT4_BLOCK_ALIGN(len + offset, blkbits) >> blkbits) |
2ed88685 | 3537 | - map.m_lblk; |
a2df2a63 | 3538 | /* |
f3bd1f3f | 3539 | * credits to insert 1 extent into extent tree |
a2df2a63 | 3540 | */ |
f3bd1f3f | 3541 | credits = ext4_chunk_trans_blocks(inode, max_blocks); |
55bd725a | 3542 | mutex_lock(&inode->i_mutex); |
6d19c42b NK |
3543 | ret = inode_newsize_ok(inode, (len + offset)); |
3544 | if (ret) { | |
3545 | mutex_unlock(&inode->i_mutex); | |
0562e0ba | 3546 | trace_ext4_fallocate_exit(inode, offset, max_blocks, ret); |
6d19c42b NK |
3547 | return ret; |
3548 | } | |
a2df2a63 AA |
3549 | retry: |
3550 | while (ret >= 0 && ret < max_blocks) { | |
2ed88685 TT |
3551 | map.m_lblk = map.m_lblk + ret; |
3552 | map.m_len = max_blocks = max_blocks - ret; | |
a2df2a63 AA |
3553 | handle = ext4_journal_start(inode, credits); |
3554 | if (IS_ERR(handle)) { | |
3555 | ret = PTR_ERR(handle); | |
3556 | break; | |
3557 | } | |
2ed88685 | 3558 | ret = ext4_map_blocks(handle, inode, &map, |
c2177057 | 3559 | EXT4_GET_BLOCKS_CREATE_UNINIT_EXT); |
221879c9 | 3560 | if (ret <= 0) { |
2c98615d AK |
3561 | #ifdef EXT4FS_DEBUG |
3562 | WARN_ON(ret <= 0); | |
e35fd660 | 3563 | printk(KERN_ERR "%s: ext4_ext_map_blocks " |
2c98615d | 3564 | "returned error inode#%lu, block=%u, " |
9fd9784c | 3565 | "max_blocks=%u", __func__, |
a6371b63 | 3566 | inode->i_ino, map.m_lblk, max_blocks); |
2c98615d | 3567 | #endif |
a2df2a63 AA |
3568 | ext4_mark_inode_dirty(handle, inode); |
3569 | ret2 = ext4_journal_stop(handle); | |
3570 | break; | |
3571 | } | |
2ed88685 | 3572 | if ((map.m_lblk + ret) >= (EXT4_BLOCK_ALIGN(offset + len, |
fd28784a AK |
3573 | blkbits) >> blkbits)) |
3574 | new_size = offset + len; | |
3575 | else | |
2ed88685 | 3576 | new_size = (map.m_lblk + ret) << blkbits; |
a2df2a63 | 3577 | |
fd28784a | 3578 | ext4_falloc_update_inode(inode, mode, new_size, |
2ed88685 | 3579 | (map.m_flags & EXT4_MAP_NEW)); |
a2df2a63 AA |
3580 | ext4_mark_inode_dirty(handle, inode); |
3581 | ret2 = ext4_journal_stop(handle); | |
3582 | if (ret2) | |
3583 | break; | |
3584 | } | |
fd28784a AK |
3585 | if (ret == -ENOSPC && |
3586 | ext4_should_retry_alloc(inode->i_sb, &retries)) { | |
3587 | ret = 0; | |
a2df2a63 | 3588 | goto retry; |
a2df2a63 | 3589 | } |
55bd725a | 3590 | mutex_unlock(&inode->i_mutex); |
0562e0ba JZ |
3591 | trace_ext4_fallocate_exit(inode, offset, max_blocks, |
3592 | ret > 0 ? ret2 : ret); | |
a2df2a63 AA |
3593 | return ret > 0 ? ret2 : ret; |
3594 | } | |
6873fa0d | 3595 | |
0031462b MC |
3596 | /* |
3597 | * This function convert a range of blocks to written extents | |
3598 | * The caller of this function will pass the start offset and the size. | |
3599 | * all unwritten extents within this range will be converted to | |
3600 | * written extents. | |
3601 | * | |
3602 | * This function is called from the direct IO end io call back | |
3603 | * function, to convert the fallocated extents after IO is completed. | |
109f5565 | 3604 | * Returns 0 on success. |
0031462b MC |
3605 | */ |
3606 | int ext4_convert_unwritten_extents(struct inode *inode, loff_t offset, | |
a1de02dc | 3607 | ssize_t len) |
0031462b MC |
3608 | { |
3609 | handle_t *handle; | |
0031462b MC |
3610 | unsigned int max_blocks; |
3611 | int ret = 0; | |
3612 | int ret2 = 0; | |
2ed88685 | 3613 | struct ext4_map_blocks map; |
0031462b MC |
3614 | unsigned int credits, blkbits = inode->i_blkbits; |
3615 | ||
2ed88685 | 3616 | map.m_lblk = offset >> blkbits; |
0031462b MC |
3617 | /* |
3618 | * We can't just convert len to max_blocks because | |
3619 | * If blocksize = 4096 offset = 3072 and len = 2048 | |
3620 | */ | |
2ed88685 TT |
3621 | max_blocks = ((EXT4_BLOCK_ALIGN(len + offset, blkbits) >> blkbits) - |
3622 | map.m_lblk); | |
0031462b MC |
3623 | /* |
3624 | * credits to insert 1 extent into extent tree | |
3625 | */ | |
3626 | credits = ext4_chunk_trans_blocks(inode, max_blocks); | |
3627 | while (ret >= 0 && ret < max_blocks) { | |
2ed88685 TT |
3628 | map.m_lblk += ret; |
3629 | map.m_len = (max_blocks -= ret); | |
0031462b MC |
3630 | handle = ext4_journal_start(inode, credits); |
3631 | if (IS_ERR(handle)) { | |
3632 | ret = PTR_ERR(handle); | |
3633 | break; | |
3634 | } | |
2ed88685 | 3635 | ret = ext4_map_blocks(handle, inode, &map, |
c7064ef1 | 3636 | EXT4_GET_BLOCKS_IO_CONVERT_EXT); |
0031462b MC |
3637 | if (ret <= 0) { |
3638 | WARN_ON(ret <= 0); | |
e35fd660 | 3639 | printk(KERN_ERR "%s: ext4_ext_map_blocks " |
0031462b MC |
3640 | "returned error inode#%lu, block=%u, " |
3641 | "max_blocks=%u", __func__, | |
2ed88685 | 3642 | inode->i_ino, map.m_lblk, map.m_len); |
0031462b MC |
3643 | } |
3644 | ext4_mark_inode_dirty(handle, inode); | |
3645 | ret2 = ext4_journal_stop(handle); | |
3646 | if (ret <= 0 || ret2 ) | |
3647 | break; | |
3648 | } | |
3649 | return ret > 0 ? ret2 : ret; | |
3650 | } | |
6d9c85eb | 3651 | |
6873fa0d ES |
3652 | /* |
3653 | * Callback function called for each extent to gather FIEMAP information. | |
3654 | */ | |
3a06d778 | 3655 | static int ext4_ext_fiemap_cb(struct inode *inode, struct ext4_ext_path *path, |
6873fa0d ES |
3656 | struct ext4_ext_cache *newex, struct ext4_extent *ex, |
3657 | void *data) | |
3658 | { | |
6873fa0d ES |
3659 | __u64 logical; |
3660 | __u64 physical; | |
3661 | __u64 length; | |
6d9c85eb | 3662 | loff_t size; |
6873fa0d | 3663 | __u32 flags = 0; |
6d9c85eb YY |
3664 | int ret = 0; |
3665 | struct fiemap_extent_info *fieinfo = data; | |
3666 | unsigned char blksize_bits; | |
6873fa0d | 3667 | |
6d9c85eb YY |
3668 | blksize_bits = inode->i_sb->s_blocksize_bits; |
3669 | logical = (__u64)newex->ec_block << blksize_bits; | |
6873fa0d | 3670 | |
b05e6ae5 | 3671 | if (newex->ec_start == 0) { |
6d9c85eb YY |
3672 | /* |
3673 | * No extent in extent-tree contains block @newex->ec_start, | |
3674 | * then the block may stay in 1)a hole or 2)delayed-extent. | |
3675 | * | |
3676 | * Holes or delayed-extents are processed as follows. | |
3677 | * 1. lookup dirty pages with specified range in pagecache. | |
3678 | * If no page is got, then there is no delayed-extent and | |
3679 | * return with EXT_CONTINUE. | |
3680 | * 2. find the 1st mapped buffer, | |
3681 | * 3. check if the mapped buffer is both in the request range | |
3682 | * and a delayed buffer. If not, there is no delayed-extent, | |
3683 | * then return. | |
3684 | * 4. a delayed-extent is found, the extent will be collected. | |
3685 | */ | |
3686 | ext4_lblk_t end = 0; | |
3687 | pgoff_t last_offset; | |
3688 | pgoff_t offset; | |
3689 | pgoff_t index; | |
3690 | struct page **pages = NULL; | |
6873fa0d | 3691 | struct buffer_head *bh = NULL; |
6d9c85eb YY |
3692 | struct buffer_head *head = NULL; |
3693 | unsigned int nr_pages = PAGE_SIZE / sizeof(struct page *); | |
3694 | ||
3695 | pages = kmalloc(PAGE_SIZE, GFP_KERNEL); | |
3696 | if (pages == NULL) | |
3697 | return -ENOMEM; | |
6873fa0d ES |
3698 | |
3699 | offset = logical >> PAGE_SHIFT; | |
6d9c85eb YY |
3700 | repeat: |
3701 | last_offset = offset; | |
3702 | head = NULL; | |
3703 | ret = find_get_pages_tag(inode->i_mapping, &offset, | |
3704 | PAGECACHE_TAG_DIRTY, nr_pages, pages); | |
3705 | ||
3706 | if (!(flags & FIEMAP_EXTENT_DELALLOC)) { | |
3707 | /* First time, try to find a mapped buffer. */ | |
3708 | if (ret == 0) { | |
3709 | out: | |
3710 | for (index = 0; index < ret; index++) | |
3711 | page_cache_release(pages[index]); | |
3712 | /* just a hole. */ | |
3713 | kfree(pages); | |
3714 | return EXT_CONTINUE; | |
3715 | } | |
6873fa0d | 3716 | |
6d9c85eb YY |
3717 | /* Try to find the 1st mapped buffer. */ |
3718 | end = ((__u64)pages[0]->index << PAGE_SHIFT) >> | |
3719 | blksize_bits; | |
3720 | if (!page_has_buffers(pages[0])) | |
3721 | goto out; | |
3722 | head = page_buffers(pages[0]); | |
3723 | if (!head) | |
3724 | goto out; | |
6873fa0d | 3725 | |
6d9c85eb YY |
3726 | bh = head; |
3727 | do { | |
3728 | if (buffer_mapped(bh)) { | |
3729 | /* get the 1st mapped buffer. */ | |
3730 | if (end > newex->ec_block + | |
3731 | newex->ec_len) | |
3732 | /* The buffer is out of | |
3733 | * the request range. | |
3734 | */ | |
3735 | goto out; | |
3736 | goto found_mapped_buffer; | |
3737 | } | |
3738 | bh = bh->b_this_page; | |
3739 | end++; | |
3740 | } while (bh != head); | |
6873fa0d | 3741 | |
6d9c85eb YY |
3742 | /* No mapped buffer found. */ |
3743 | goto out; | |
6873fa0d | 3744 | } else { |
6d9c85eb YY |
3745 | /*Find contiguous delayed buffers. */ |
3746 | if (ret > 0 && pages[0]->index == last_offset) | |
3747 | head = page_buffers(pages[0]); | |
3748 | bh = head; | |
6873fa0d | 3749 | } |
6d9c85eb YY |
3750 | |
3751 | found_mapped_buffer: | |
3752 | if (bh != NULL && buffer_delay(bh)) { | |
3753 | /* 1st or contiguous delayed buffer found. */ | |
3754 | if (!(flags & FIEMAP_EXTENT_DELALLOC)) { | |
3755 | /* | |
3756 | * 1st delayed buffer found, record | |
3757 | * the start of extent. | |
3758 | */ | |
3759 | flags |= FIEMAP_EXTENT_DELALLOC; | |
3760 | newex->ec_block = end; | |
3761 | logical = (__u64)end << blksize_bits; | |
3762 | } | |
3763 | /* Find contiguous delayed buffers. */ | |
3764 | do { | |
3765 | if (!buffer_delay(bh)) | |
3766 | goto found_delayed_extent; | |
3767 | bh = bh->b_this_page; | |
3768 | end++; | |
3769 | } while (bh != head); | |
3770 | ||
3771 | for (index = 1; index < ret; index++) { | |
3772 | if (!page_has_buffers(pages[index])) { | |
3773 | bh = NULL; | |
3774 | break; | |
3775 | } | |
3776 | head = page_buffers(pages[index]); | |
3777 | if (!head) { | |
3778 | bh = NULL; | |
3779 | break; | |
3780 | } | |
3781 | if (pages[index]->index != | |
3782 | pages[0]->index + index) { | |
3783 | /* Blocks are not contiguous. */ | |
3784 | bh = NULL; | |
3785 | break; | |
3786 | } | |
3787 | bh = head; | |
3788 | do { | |
3789 | if (!buffer_delay(bh)) | |
3790 | /* Delayed-extent ends. */ | |
3791 | goto found_delayed_extent; | |
3792 | bh = bh->b_this_page; | |
3793 | end++; | |
3794 | } while (bh != head); | |
3795 | } | |
3796 | } else if (!(flags & FIEMAP_EXTENT_DELALLOC)) | |
3797 | /* a hole found. */ | |
3798 | goto out; | |
3799 | ||
3800 | found_delayed_extent: | |
3801 | newex->ec_len = min(end - newex->ec_block, | |
3802 | (ext4_lblk_t)EXT_INIT_MAX_LEN); | |
3803 | if (ret == nr_pages && bh != NULL && | |
3804 | newex->ec_len < EXT_INIT_MAX_LEN && | |
3805 | buffer_delay(bh)) { | |
3806 | /* Have not collected an extent and continue. */ | |
3807 | for (index = 0; index < ret; index++) | |
3808 | page_cache_release(pages[index]); | |
3809 | goto repeat; | |
6873fa0d | 3810 | } |
6d9c85eb YY |
3811 | |
3812 | for (index = 0; index < ret; index++) | |
3813 | page_cache_release(pages[index]); | |
3814 | kfree(pages); | |
6873fa0d ES |
3815 | } |
3816 | ||
3817 | physical = (__u64)newex->ec_start << blksize_bits; | |
3818 | length = (__u64)newex->ec_len << blksize_bits; | |
3819 | ||
3820 | if (ex && ext4_ext_is_uninitialized(ex)) | |
3821 | flags |= FIEMAP_EXTENT_UNWRITTEN; | |
3822 | ||
6d9c85eb YY |
3823 | size = i_size_read(inode); |
3824 | if (logical + length >= size) | |
6873fa0d ES |
3825 | flags |= FIEMAP_EXTENT_LAST; |
3826 | ||
6d9c85eb | 3827 | ret = fiemap_fill_next_extent(fieinfo, logical, physical, |
6873fa0d | 3828 | length, flags); |
6d9c85eb YY |
3829 | if (ret < 0) |
3830 | return ret; | |
3831 | if (ret == 1) | |
6873fa0d | 3832 | return EXT_BREAK; |
6873fa0d ES |
3833 | return EXT_CONTINUE; |
3834 | } | |
3835 | ||
3836 | /* fiemap flags we can handle specified here */ | |
3837 | #define EXT4_FIEMAP_FLAGS (FIEMAP_FLAG_SYNC|FIEMAP_FLAG_XATTR) | |
3838 | ||
3a06d778 AK |
3839 | static int ext4_xattr_fiemap(struct inode *inode, |
3840 | struct fiemap_extent_info *fieinfo) | |
6873fa0d ES |
3841 | { |
3842 | __u64 physical = 0; | |
3843 | __u64 length; | |
3844 | __u32 flags = FIEMAP_EXTENT_LAST; | |
3845 | int blockbits = inode->i_sb->s_blocksize_bits; | |
3846 | int error = 0; | |
3847 | ||
3848 | /* in-inode? */ | |
19f5fb7a | 3849 | if (ext4_test_inode_state(inode, EXT4_STATE_XATTR)) { |
6873fa0d ES |
3850 | struct ext4_iloc iloc; |
3851 | int offset; /* offset of xattr in inode */ | |
3852 | ||
3853 | error = ext4_get_inode_loc(inode, &iloc); | |
3854 | if (error) | |
3855 | return error; | |
3856 | physical = iloc.bh->b_blocknr << blockbits; | |
3857 | offset = EXT4_GOOD_OLD_INODE_SIZE + | |
3858 | EXT4_I(inode)->i_extra_isize; | |
3859 | physical += offset; | |
3860 | length = EXT4_SB(inode->i_sb)->s_inode_size - offset; | |
3861 | flags |= FIEMAP_EXTENT_DATA_INLINE; | |
fd2dd9fb | 3862 | brelse(iloc.bh); |
6873fa0d ES |
3863 | } else { /* external block */ |
3864 | physical = EXT4_I(inode)->i_file_acl << blockbits; | |
3865 | length = inode->i_sb->s_blocksize; | |
3866 | } | |
3867 | ||
3868 | if (physical) | |
3869 | error = fiemap_fill_next_extent(fieinfo, 0, physical, | |
3870 | length, flags); | |
3871 | return (error < 0 ? error : 0); | |
3872 | } | |
3873 | ||
3874 | int ext4_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo, | |
3875 | __u64 start, __u64 len) | |
3876 | { | |
3877 | ext4_lblk_t start_blk; | |
6873fa0d ES |
3878 | int error = 0; |
3879 | ||
3880 | /* fallback to generic here if not in extents fmt */ | |
12e9b892 | 3881 | if (!(ext4_test_inode_flag(inode, EXT4_INODE_EXTENTS))) |
6873fa0d ES |
3882 | return generic_block_fiemap(inode, fieinfo, start, len, |
3883 | ext4_get_block); | |
3884 | ||
3885 | if (fiemap_check_flags(fieinfo, EXT4_FIEMAP_FLAGS)) | |
3886 | return -EBADR; | |
3887 | ||
3888 | if (fieinfo->fi_flags & FIEMAP_FLAG_XATTR) { | |
3889 | error = ext4_xattr_fiemap(inode, fieinfo); | |
3890 | } else { | |
aca92ff6 LM |
3891 | ext4_lblk_t len_blks; |
3892 | __u64 last_blk; | |
3893 | ||
6873fa0d | 3894 | start_blk = start >> inode->i_sb->s_blocksize_bits; |
aca92ff6 LM |
3895 | last_blk = (start + len - 1) >> inode->i_sb->s_blocksize_bits; |
3896 | if (last_blk >= EXT_MAX_BLOCK) | |
3897 | last_blk = EXT_MAX_BLOCK-1; | |
3898 | len_blks = ((ext4_lblk_t) last_blk) - start_blk + 1; | |
6873fa0d ES |
3899 | |
3900 | /* | |
3901 | * Walk the extent tree gathering extent information. | |
3902 | * ext4_ext_fiemap_cb will push extents back to user. | |
3903 | */ | |
6873fa0d ES |
3904 | error = ext4_ext_walk_space(inode, start_blk, len_blks, |
3905 | ext4_ext_fiemap_cb, fieinfo); | |
6873fa0d ES |
3906 | } |
3907 | ||
3908 | return error; | |
3909 | } |