]>
Commit | Line | Data |
---|---|---|
ac27a0ec | 1 | /* |
617ba13b | 2 | * linux/fs/ext4/namei.c |
ac27a0ec DK |
3 | * |
4 | * Copyright (C) 1992, 1993, 1994, 1995 | |
5 | * Remy Card (card@masi.ibp.fr) | |
6 | * Laboratoire MASI - Institut Blaise Pascal | |
7 | * Universite Pierre et Marie Curie (Paris VI) | |
8 | * | |
9 | * from | |
10 | * | |
11 | * linux/fs/minix/namei.c | |
12 | * | |
13 | * Copyright (C) 1991, 1992 Linus Torvalds | |
14 | * | |
15 | * Big-endian to little-endian byte-swapping/bitmaps by | |
16 | * David S. Miller (davem@caip.rutgers.edu), 1995 | |
17 | * Directory entry file type support and forward compatibility hooks | |
18 | * for B-tree directories by Theodore Ts'o (tytso@mit.edu), 1998 | |
19 | * Hash Tree Directory indexing (c) | |
20 | * Daniel Phillips, 2001 | |
21 | * Hash Tree Directory indexing porting | |
22 | * Christopher Li, 2002 | |
23 | * Hash Tree Directory indexing cleanup | |
24 | * Theodore Ts'o, 2002 | |
25 | */ | |
26 | ||
27 | #include <linux/fs.h> | |
28 | #include <linux/pagemap.h> | |
ac27a0ec | 29 | #include <linux/time.h> |
ac27a0ec DK |
30 | #include <linux/fcntl.h> |
31 | #include <linux/stat.h> | |
32 | #include <linux/string.h> | |
33 | #include <linux/quotaops.h> | |
34 | #include <linux/buffer_head.h> | |
35 | #include <linux/bio.h> | |
3dcf5451 CH |
36 | #include "ext4.h" |
37 | #include "ext4_jbd2.h" | |
ac27a0ec | 38 | |
ac27a0ec DK |
39 | #include "xattr.h" |
40 | #include "acl.h" | |
41 | ||
0562e0ba | 42 | #include <trace/events/ext4.h> |
ac27a0ec DK |
43 | /* |
44 | * define how far ahead to read directories while searching them. | |
45 | */ | |
46 | #define NAMEI_RA_CHUNKS 2 | |
47 | #define NAMEI_RA_BLOCKS 4 | |
8c55e204 | 48 | #define NAMEI_RA_SIZE (NAMEI_RA_CHUNKS * NAMEI_RA_BLOCKS) |
ac27a0ec | 49 | |
617ba13b | 50 | static struct buffer_head *ext4_append(handle_t *handle, |
ac27a0ec | 51 | struct inode *inode, |
0f70b406 | 52 | ext4_lblk_t *block) |
ac27a0ec DK |
53 | { |
54 | struct buffer_head *bh; | |
1c215028 | 55 | int err; |
ac27a0ec | 56 | |
df981d03 TT |
57 | if (unlikely(EXT4_SB(inode->i_sb)->s_max_dir_size_kb && |
58 | ((inode->i_size >> 10) >= | |
0f70b406 TT |
59 | EXT4_SB(inode->i_sb)->s_max_dir_size_kb))) |
60 | return ERR_PTR(-ENOSPC); | |
df981d03 | 61 | |
ac27a0ec DK |
62 | *block = inode->i_size >> inode->i_sb->s_blocksize_bits; |
63 | ||
1c215028 TT |
64 | bh = ext4_bread(handle, inode, *block, 1); |
65 | if (IS_ERR(bh)) | |
66 | return bh; | |
0f70b406 TT |
67 | inode->i_size += inode->i_sb->s_blocksize; |
68 | EXT4_I(inode)->i_disksize = inode->i_size; | |
5d601255 | 69 | BUFFER_TRACE(bh, "get_write_access"); |
0f70b406 TT |
70 | err = ext4_journal_get_write_access(handle, bh); |
71 | if (err) { | |
72 | brelse(bh); | |
73 | ext4_std_error(inode->i_sb, err); | |
74 | return ERR_PTR(err); | |
6d1ab10e | 75 | } |
ac27a0ec DK |
76 | return bh; |
77 | } | |
78 | ||
dc6982ff TT |
79 | static int ext4_dx_csum_verify(struct inode *inode, |
80 | struct ext4_dir_entry *dirent); | |
81 | ||
82 | typedef enum { | |
83 | EITHER, INDEX, DIRENT | |
84 | } dirblock_type_t; | |
85 | ||
86 | #define ext4_read_dirblock(inode, block, type) \ | |
87 | __ext4_read_dirblock((inode), (block), (type), __LINE__) | |
88 | ||
89 | static struct buffer_head *__ext4_read_dirblock(struct inode *inode, | |
90 | ext4_lblk_t block, | |
91 | dirblock_type_t type, | |
92 | unsigned int line) | |
93 | { | |
94 | struct buffer_head *bh; | |
95 | struct ext4_dir_entry *dirent; | |
1c215028 | 96 | int is_dx_block = 0; |
dc6982ff | 97 | |
1c215028 TT |
98 | bh = ext4_bread(NULL, inode, block, 0); |
99 | if (IS_ERR(bh)) { | |
dc6982ff | 100 | __ext4_warning(inode->i_sb, __func__, line, |
1c215028 TT |
101 | "error %ld reading directory block " |
102 | "(ino %lu, block %lu)", PTR_ERR(bh), inode->i_ino, | |
dc6982ff | 103 | (unsigned long) block); |
1c215028 TT |
104 | |
105 | return bh; | |
106 | } | |
107 | if (!bh) { | |
108 | ext4_error_inode(inode, __func__, line, block, "Directory hole found"); | |
109 | return ERR_PTR(-EIO); | |
dc6982ff TT |
110 | } |
111 | dirent = (struct ext4_dir_entry *) bh->b_data; | |
112 | /* Determine whether or not we have an index block */ | |
113 | if (is_dx(inode)) { | |
114 | if (block == 0) | |
115 | is_dx_block = 1; | |
116 | else if (ext4_rec_len_from_disk(dirent->rec_len, | |
117 | inode->i_sb->s_blocksize) == | |
118 | inode->i_sb->s_blocksize) | |
119 | is_dx_block = 1; | |
120 | } | |
121 | if (!is_dx_block && type == INDEX) { | |
122 | ext4_error_inode(inode, __func__, line, block, | |
123 | "directory leaf block found instead of index block"); | |
124 | return ERR_PTR(-EIO); | |
125 | } | |
9aa5d32b | 126 | if (!ext4_has_metadata_csum(inode->i_sb) || |
dc6982ff TT |
127 | buffer_verified(bh)) |
128 | return bh; | |
129 | ||
130 | /* | |
131 | * An empty leaf block can get mistaken for a index block; for | |
132 | * this reason, we can only check the index checksum when the | |
133 | * caller is sure it should be an index block. | |
134 | */ | |
135 | if (is_dx_block && type == INDEX) { | |
136 | if (ext4_dx_csum_verify(inode, dirent)) | |
137 | set_buffer_verified(bh); | |
138 | else { | |
139 | ext4_error_inode(inode, __func__, line, block, | |
140 | "Directory index failed checksum"); | |
a871611b | 141 | brelse(bh); |
dc6982ff | 142 | return ERR_PTR(-EIO); |
a871611b | 143 | } |
ac27a0ec | 144 | } |
dc6982ff TT |
145 | if (!is_dx_block) { |
146 | if (ext4_dirent_csum_verify(inode, dirent)) | |
147 | set_buffer_verified(bh); | |
148 | else { | |
149 | ext4_error_inode(inode, __func__, line, block, | |
150 | "Directory block failed checksum"); | |
151 | brelse(bh); | |
152 | return ERR_PTR(-EIO); | |
153 | } | |
6d1ab10e | 154 | } |
ac27a0ec DK |
155 | return bh; |
156 | } | |
157 | ||
158 | #ifndef assert | |
159 | #define assert(test) J_ASSERT(test) | |
160 | #endif | |
161 | ||
ac27a0ec DK |
162 | #ifdef DX_DEBUG |
163 | #define dxtrace(command) command | |
164 | #else | |
165 | #define dxtrace(command) | |
166 | #endif | |
167 | ||
168 | struct fake_dirent | |
169 | { | |
170 | __le32 inode; | |
171 | __le16 rec_len; | |
172 | u8 name_len; | |
173 | u8 file_type; | |
174 | }; | |
175 | ||
176 | struct dx_countlimit | |
177 | { | |
178 | __le16 limit; | |
179 | __le16 count; | |
180 | }; | |
181 | ||
182 | struct dx_entry | |
183 | { | |
184 | __le32 hash; | |
185 | __le32 block; | |
186 | }; | |
187 | ||
188 | /* | |
189 | * dx_root_info is laid out so that if it should somehow get overlaid by a | |
190 | * dirent the two low bits of the hash version will be zero. Therefore, the | |
191 | * hash version mod 4 should never be 0. Sincerely, the paranoia department. | |
192 | */ | |
193 | ||
194 | struct dx_root | |
195 | { | |
196 | struct fake_dirent dot; | |
197 | char dot_name[4]; | |
198 | struct fake_dirent dotdot; | |
199 | char dotdot_name[4]; | |
200 | struct dx_root_info | |
201 | { | |
202 | __le32 reserved_zero; | |
203 | u8 hash_version; | |
204 | u8 info_length; /* 8 */ | |
205 | u8 indirect_levels; | |
206 | u8 unused_flags; | |
207 | } | |
208 | info; | |
209 | struct dx_entry entries[0]; | |
210 | }; | |
211 | ||
212 | struct dx_node | |
213 | { | |
214 | struct fake_dirent fake; | |
215 | struct dx_entry entries[0]; | |
216 | }; | |
217 | ||
218 | ||
219 | struct dx_frame | |
220 | { | |
221 | struct buffer_head *bh; | |
222 | struct dx_entry *entries; | |
223 | struct dx_entry *at; | |
224 | }; | |
225 | ||
226 | struct dx_map_entry | |
227 | { | |
228 | u32 hash; | |
ef2b02d3 ES |
229 | u16 offs; |
230 | u16 size; | |
ac27a0ec DK |
231 | }; |
232 | ||
e6153918 DW |
233 | /* |
234 | * This goes at the end of each htree block. | |
235 | */ | |
236 | struct dx_tail { | |
237 | u32 dt_reserved; | |
238 | __le32 dt_checksum; /* crc32c(uuid+inum+dirblock) */ | |
239 | }; | |
240 | ||
725d26d3 AK |
241 | static inline ext4_lblk_t dx_get_block(struct dx_entry *entry); |
242 | static void dx_set_block(struct dx_entry *entry, ext4_lblk_t value); | |
af5bc92d TT |
243 | static inline unsigned dx_get_hash(struct dx_entry *entry); |
244 | static void dx_set_hash(struct dx_entry *entry, unsigned value); | |
245 | static unsigned dx_get_count(struct dx_entry *entries); | |
246 | static unsigned dx_get_limit(struct dx_entry *entries); | |
247 | static void dx_set_count(struct dx_entry *entries, unsigned value); | |
248 | static void dx_set_limit(struct dx_entry *entries, unsigned value); | |
249 | static unsigned dx_root_limit(struct inode *dir, unsigned infosize); | |
250 | static unsigned dx_node_limit(struct inode *dir); | |
f702ba0f | 251 | static struct dx_frame *dx_probe(const struct qstr *d_name, |
ac27a0ec DK |
252 | struct inode *dir, |
253 | struct dx_hash_info *hinfo, | |
dd73b5d5 | 254 | struct dx_frame *frame); |
af5bc92d | 255 | static void dx_release(struct dx_frame *frames); |
8bad4597 | 256 | static int dx_make_map(struct ext4_dir_entry_2 *de, unsigned blocksize, |
af5bc92d | 257 | struct dx_hash_info *hinfo, struct dx_map_entry map[]); |
ac27a0ec | 258 | static void dx_sort_map(struct dx_map_entry *map, unsigned count); |
af5bc92d | 259 | static struct ext4_dir_entry_2 *dx_move_dirents(char *from, char *to, |
3d0518f4 | 260 | struct dx_map_entry *offsets, int count, unsigned blocksize); |
8bad4597 | 261 | static struct ext4_dir_entry_2* dx_pack_dirents(char *base, unsigned blocksize); |
725d26d3 AK |
262 | static void dx_insert_block(struct dx_frame *frame, |
263 | u32 hash, ext4_lblk_t block); | |
617ba13b | 264 | static int ext4_htree_next_block(struct inode *dir, __u32 hash, |
ac27a0ec DK |
265 | struct dx_frame *frame, |
266 | struct dx_frame *frames, | |
267 | __u32 *start_hash); | |
f702ba0f TT |
268 | static struct buffer_head * ext4_dx_find_entry(struct inode *dir, |
269 | const struct qstr *d_name, | |
537d8f93 | 270 | struct ext4_dir_entry_2 **res_dir); |
617ba13b | 271 | static int ext4_dx_add_entry(handle_t *handle, struct dentry *dentry, |
ac27a0ec DK |
272 | struct inode *inode); |
273 | ||
dbe89444 | 274 | /* checksumming functions */ |
3c47d541 TM |
275 | void initialize_dirent_tail(struct ext4_dir_entry_tail *t, |
276 | unsigned int blocksize) | |
b0336e8d DW |
277 | { |
278 | memset(t, 0, sizeof(struct ext4_dir_entry_tail)); | |
279 | t->det_rec_len = ext4_rec_len_to_disk( | |
280 | sizeof(struct ext4_dir_entry_tail), blocksize); | |
281 | t->det_reserved_ft = EXT4_FT_DIR_CSUM; | |
282 | } | |
283 | ||
284 | /* Walk through a dirent block to find a checksum "dirent" at the tail */ | |
285 | static struct ext4_dir_entry_tail *get_dirent_tail(struct inode *inode, | |
286 | struct ext4_dir_entry *de) | |
287 | { | |
288 | struct ext4_dir_entry_tail *t; | |
289 | ||
290 | #ifdef PARANOID | |
291 | struct ext4_dir_entry *d, *top; | |
292 | ||
293 | d = de; | |
294 | top = (struct ext4_dir_entry *)(((void *)de) + | |
295 | (EXT4_BLOCK_SIZE(inode->i_sb) - | |
296 | sizeof(struct ext4_dir_entry_tail))); | |
297 | while (d < top && d->rec_len) | |
298 | d = (struct ext4_dir_entry *)(((void *)d) + | |
299 | le16_to_cpu(d->rec_len)); | |
300 | ||
301 | if (d != top) | |
302 | return NULL; | |
303 | ||
304 | t = (struct ext4_dir_entry_tail *)d; | |
305 | #else | |
306 | t = EXT4_DIRENT_TAIL(de, EXT4_BLOCK_SIZE(inode->i_sb)); | |
307 | #endif | |
308 | ||
309 | if (t->det_reserved_zero1 || | |
310 | le16_to_cpu(t->det_rec_len) != sizeof(struct ext4_dir_entry_tail) || | |
311 | t->det_reserved_zero2 || | |
312 | t->det_reserved_ft != EXT4_FT_DIR_CSUM) | |
313 | return NULL; | |
314 | ||
315 | return t; | |
316 | } | |
317 | ||
318 | static __le32 ext4_dirent_csum(struct inode *inode, | |
319 | struct ext4_dir_entry *dirent, int size) | |
320 | { | |
321 | struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb); | |
322 | struct ext4_inode_info *ei = EXT4_I(inode); | |
323 | __u32 csum; | |
324 | ||
325 | csum = ext4_chksum(sbi, ei->i_csum_seed, (__u8 *)dirent, size); | |
326 | return cpu_to_le32(csum); | |
327 | } | |
328 | ||
dffe9d8d TT |
329 | static void warn_no_space_for_csum(struct inode *inode) |
330 | { | |
331 | ext4_warning(inode->i_sb, "no space in directory inode %lu leaf for " | |
332 | "checksum. Please run e2fsck -D.", inode->i_ino); | |
333 | } | |
334 | ||
b0336e8d DW |
335 | int ext4_dirent_csum_verify(struct inode *inode, struct ext4_dir_entry *dirent) |
336 | { | |
337 | struct ext4_dir_entry_tail *t; | |
338 | ||
9aa5d32b | 339 | if (!ext4_has_metadata_csum(inode->i_sb)) |
b0336e8d DW |
340 | return 1; |
341 | ||
342 | t = get_dirent_tail(inode, dirent); | |
343 | if (!t) { | |
dffe9d8d | 344 | warn_no_space_for_csum(inode); |
b0336e8d DW |
345 | return 0; |
346 | } | |
347 | ||
348 | if (t->det_checksum != ext4_dirent_csum(inode, dirent, | |
349 | (void *)t - (void *)dirent)) | |
350 | return 0; | |
351 | ||
352 | return 1; | |
353 | } | |
354 | ||
355 | static void ext4_dirent_csum_set(struct inode *inode, | |
356 | struct ext4_dir_entry *dirent) | |
357 | { | |
358 | struct ext4_dir_entry_tail *t; | |
359 | ||
9aa5d32b | 360 | if (!ext4_has_metadata_csum(inode->i_sb)) |
b0336e8d DW |
361 | return; |
362 | ||
363 | t = get_dirent_tail(inode, dirent); | |
364 | if (!t) { | |
dffe9d8d | 365 | warn_no_space_for_csum(inode); |
b0336e8d DW |
366 | return; |
367 | } | |
368 | ||
369 | t->det_checksum = ext4_dirent_csum(inode, dirent, | |
370 | (void *)t - (void *)dirent); | |
371 | } | |
372 | ||
3c47d541 TM |
373 | int ext4_handle_dirty_dirent_node(handle_t *handle, |
374 | struct inode *inode, | |
375 | struct buffer_head *bh) | |
b0336e8d DW |
376 | { |
377 | ext4_dirent_csum_set(inode, (struct ext4_dir_entry *)bh->b_data); | |
378 | return ext4_handle_dirty_metadata(handle, inode, bh); | |
379 | } | |
380 | ||
dbe89444 DW |
381 | static struct dx_countlimit *get_dx_countlimit(struct inode *inode, |
382 | struct ext4_dir_entry *dirent, | |
383 | int *offset) | |
384 | { | |
385 | struct ext4_dir_entry *dp; | |
386 | struct dx_root_info *root; | |
387 | int count_offset; | |
388 | ||
389 | if (le16_to_cpu(dirent->rec_len) == EXT4_BLOCK_SIZE(inode->i_sb)) | |
390 | count_offset = 8; | |
391 | else if (le16_to_cpu(dirent->rec_len) == 12) { | |
392 | dp = (struct ext4_dir_entry *)(((void *)dirent) + 12); | |
393 | if (le16_to_cpu(dp->rec_len) != | |
394 | EXT4_BLOCK_SIZE(inode->i_sb) - 12) | |
395 | return NULL; | |
396 | root = (struct dx_root_info *)(((void *)dp + 12)); | |
397 | if (root->reserved_zero || | |
398 | root->info_length != sizeof(struct dx_root_info)) | |
399 | return NULL; | |
400 | count_offset = 32; | |
401 | } else | |
402 | return NULL; | |
403 | ||
404 | if (offset) | |
405 | *offset = count_offset; | |
406 | return (struct dx_countlimit *)(((void *)dirent) + count_offset); | |
407 | } | |
408 | ||
409 | static __le32 ext4_dx_csum(struct inode *inode, struct ext4_dir_entry *dirent, | |
410 | int count_offset, int count, struct dx_tail *t) | |
411 | { | |
412 | struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb); | |
413 | struct ext4_inode_info *ei = EXT4_I(inode); | |
d6a77105 TT |
414 | __u32 csum; |
415 | __le32 save_csum; | |
dbe89444 DW |
416 | int size; |
417 | ||
418 | size = count_offset + (count * sizeof(struct dx_entry)); | |
d6a77105 | 419 | save_csum = t->dt_checksum; |
dbe89444 DW |
420 | t->dt_checksum = 0; |
421 | csum = ext4_chksum(sbi, ei->i_csum_seed, (__u8 *)dirent, size); | |
422 | csum = ext4_chksum(sbi, csum, (__u8 *)t, sizeof(struct dx_tail)); | |
d6a77105 | 423 | t->dt_checksum = save_csum; |
dbe89444 DW |
424 | |
425 | return cpu_to_le32(csum); | |
426 | } | |
427 | ||
428 | static int ext4_dx_csum_verify(struct inode *inode, | |
429 | struct ext4_dir_entry *dirent) | |
430 | { | |
431 | struct dx_countlimit *c; | |
432 | struct dx_tail *t; | |
433 | int count_offset, limit, count; | |
434 | ||
9aa5d32b | 435 | if (!ext4_has_metadata_csum(inode->i_sb)) |
dbe89444 DW |
436 | return 1; |
437 | ||
438 | c = get_dx_countlimit(inode, dirent, &count_offset); | |
439 | if (!c) { | |
440 | EXT4_ERROR_INODE(inode, "dir seems corrupt? Run e2fsck -D."); | |
441 | return 1; | |
442 | } | |
443 | limit = le16_to_cpu(c->limit); | |
444 | count = le16_to_cpu(c->count); | |
445 | if (count_offset + (limit * sizeof(struct dx_entry)) > | |
446 | EXT4_BLOCK_SIZE(inode->i_sb) - sizeof(struct dx_tail)) { | |
dffe9d8d | 447 | warn_no_space_for_csum(inode); |
dbe89444 DW |
448 | return 1; |
449 | } | |
450 | t = (struct dx_tail *)(((struct dx_entry *)c) + limit); | |
451 | ||
452 | if (t->dt_checksum != ext4_dx_csum(inode, dirent, count_offset, | |
453 | count, t)) | |
454 | return 0; | |
455 | return 1; | |
456 | } | |
457 | ||
458 | static void ext4_dx_csum_set(struct inode *inode, struct ext4_dir_entry *dirent) | |
459 | { | |
460 | struct dx_countlimit *c; | |
461 | struct dx_tail *t; | |
462 | int count_offset, limit, count; | |
463 | ||
9aa5d32b | 464 | if (!ext4_has_metadata_csum(inode->i_sb)) |
dbe89444 DW |
465 | return; |
466 | ||
467 | c = get_dx_countlimit(inode, dirent, &count_offset); | |
468 | if (!c) { | |
469 | EXT4_ERROR_INODE(inode, "dir seems corrupt? Run e2fsck -D."); | |
470 | return; | |
471 | } | |
472 | limit = le16_to_cpu(c->limit); | |
473 | count = le16_to_cpu(c->count); | |
474 | if (count_offset + (limit * sizeof(struct dx_entry)) > | |
475 | EXT4_BLOCK_SIZE(inode->i_sb) - sizeof(struct dx_tail)) { | |
dffe9d8d | 476 | warn_no_space_for_csum(inode); |
dbe89444 DW |
477 | return; |
478 | } | |
479 | t = (struct dx_tail *)(((struct dx_entry *)c) + limit); | |
480 | ||
481 | t->dt_checksum = ext4_dx_csum(inode, dirent, count_offset, count, t); | |
482 | } | |
483 | ||
484 | static inline int ext4_handle_dirty_dx_node(handle_t *handle, | |
485 | struct inode *inode, | |
486 | struct buffer_head *bh) | |
487 | { | |
488 | ext4_dx_csum_set(inode, (struct ext4_dir_entry *)bh->b_data); | |
489 | return ext4_handle_dirty_metadata(handle, inode, bh); | |
490 | } | |
491 | ||
f795e140 LZ |
492 | /* |
493 | * p is at least 6 bytes before the end of page | |
494 | */ | |
495 | static inline struct ext4_dir_entry_2 * | |
3d0518f4 | 496 | ext4_next_entry(struct ext4_dir_entry_2 *p, unsigned long blocksize) |
f795e140 LZ |
497 | { |
498 | return (struct ext4_dir_entry_2 *)((char *)p + | |
3d0518f4 | 499 | ext4_rec_len_from_disk(p->rec_len, blocksize)); |
f795e140 LZ |
500 | } |
501 | ||
ac27a0ec DK |
502 | /* |
503 | * Future: use high four bits of block for coalesce-on-delete flags | |
504 | * Mask them off for now. | |
505 | */ | |
506 | ||
725d26d3 | 507 | static inline ext4_lblk_t dx_get_block(struct dx_entry *entry) |
ac27a0ec DK |
508 | { |
509 | return le32_to_cpu(entry->block) & 0x00ffffff; | |
510 | } | |
511 | ||
725d26d3 | 512 | static inline void dx_set_block(struct dx_entry *entry, ext4_lblk_t value) |
ac27a0ec DK |
513 | { |
514 | entry->block = cpu_to_le32(value); | |
515 | } | |
516 | ||
af5bc92d | 517 | static inline unsigned dx_get_hash(struct dx_entry *entry) |
ac27a0ec DK |
518 | { |
519 | return le32_to_cpu(entry->hash); | |
520 | } | |
521 | ||
af5bc92d | 522 | static inline void dx_set_hash(struct dx_entry *entry, unsigned value) |
ac27a0ec DK |
523 | { |
524 | entry->hash = cpu_to_le32(value); | |
525 | } | |
526 | ||
af5bc92d | 527 | static inline unsigned dx_get_count(struct dx_entry *entries) |
ac27a0ec DK |
528 | { |
529 | return le16_to_cpu(((struct dx_countlimit *) entries)->count); | |
530 | } | |
531 | ||
af5bc92d | 532 | static inline unsigned dx_get_limit(struct dx_entry *entries) |
ac27a0ec DK |
533 | { |
534 | return le16_to_cpu(((struct dx_countlimit *) entries)->limit); | |
535 | } | |
536 | ||
af5bc92d | 537 | static inline void dx_set_count(struct dx_entry *entries, unsigned value) |
ac27a0ec DK |
538 | { |
539 | ((struct dx_countlimit *) entries)->count = cpu_to_le16(value); | |
540 | } | |
541 | ||
af5bc92d | 542 | static inline void dx_set_limit(struct dx_entry *entries, unsigned value) |
ac27a0ec DK |
543 | { |
544 | ((struct dx_countlimit *) entries)->limit = cpu_to_le16(value); | |
545 | } | |
546 | ||
af5bc92d | 547 | static inline unsigned dx_root_limit(struct inode *dir, unsigned infosize) |
ac27a0ec | 548 | { |
617ba13b MC |
549 | unsigned entry_space = dir->i_sb->s_blocksize - EXT4_DIR_REC_LEN(1) - |
550 | EXT4_DIR_REC_LEN(2) - infosize; | |
dbe89444 | 551 | |
9aa5d32b | 552 | if (ext4_has_metadata_csum(dir->i_sb)) |
dbe89444 | 553 | entry_space -= sizeof(struct dx_tail); |
d9c769b7 | 554 | return entry_space / sizeof(struct dx_entry); |
ac27a0ec DK |
555 | } |
556 | ||
af5bc92d | 557 | static inline unsigned dx_node_limit(struct inode *dir) |
ac27a0ec | 558 | { |
617ba13b | 559 | unsigned entry_space = dir->i_sb->s_blocksize - EXT4_DIR_REC_LEN(0); |
dbe89444 | 560 | |
9aa5d32b | 561 | if (ext4_has_metadata_csum(dir->i_sb)) |
dbe89444 | 562 | entry_space -= sizeof(struct dx_tail); |
d9c769b7 | 563 | return entry_space / sizeof(struct dx_entry); |
ac27a0ec DK |
564 | } |
565 | ||
566 | /* | |
567 | * Debug | |
568 | */ | |
569 | #ifdef DX_DEBUG | |
4776004f | 570 | static void dx_show_index(char * label, struct dx_entry *entries) |
ac27a0ec | 571 | { |
63f57933 | 572 | int i, n = dx_get_count (entries); |
4776004f | 573 | printk(KERN_DEBUG "%s index ", label); |
63f57933 | 574 | for (i = 0; i < n; i++) { |
4776004f | 575 | printk("%x->%lu ", i ? dx_get_hash(entries + i) : |
725d26d3 | 576 | 0, (unsigned long)dx_get_block(entries + i)); |
63f57933 AM |
577 | } |
578 | printk("\n"); | |
ac27a0ec DK |
579 | } |
580 | ||
581 | struct stats | |
582 | { | |
583 | unsigned names; | |
584 | unsigned space; | |
585 | unsigned bcount; | |
586 | }; | |
587 | ||
617ba13b | 588 | static struct stats dx_show_leaf(struct dx_hash_info *hinfo, struct ext4_dir_entry_2 *de, |
ac27a0ec DK |
589 | int size, int show_names) |
590 | { | |
591 | unsigned names = 0, space = 0; | |
592 | char *base = (char *) de; | |
593 | struct dx_hash_info h = *hinfo; | |
594 | ||
595 | printk("names: "); | |
596 | while ((char *) de < base + size) | |
597 | { | |
598 | if (de->inode) | |
599 | { | |
600 | if (show_names) | |
601 | { | |
602 | int len = de->name_len; | |
603 | char *name = de->name; | |
604 | while (len--) printk("%c", *name++); | |
617ba13b | 605 | ext4fs_dirhash(de->name, de->name_len, &h); |
ac27a0ec | 606 | printk(":%x.%u ", h.hash, |
265c6a0f | 607 | (unsigned) ((char *) de - base)); |
ac27a0ec | 608 | } |
617ba13b | 609 | space += EXT4_DIR_REC_LEN(de->name_len); |
ac27a0ec DK |
610 | names++; |
611 | } | |
3d0518f4 | 612 | de = ext4_next_entry(de, size); |
ac27a0ec DK |
613 | } |
614 | printk("(%i)\n", names); | |
615 | return (struct stats) { names, space, 1 }; | |
616 | } | |
617 | ||
618 | struct stats dx_show_entries(struct dx_hash_info *hinfo, struct inode *dir, | |
619 | struct dx_entry *entries, int levels) | |
620 | { | |
621 | unsigned blocksize = dir->i_sb->s_blocksize; | |
af5bc92d | 622 | unsigned count = dx_get_count(entries), names = 0, space = 0, i; |
ac27a0ec DK |
623 | unsigned bcount = 0; |
624 | struct buffer_head *bh; | |
625 | int err; | |
626 | printk("%i indexed blocks...\n", count); | |
627 | for (i = 0; i < count; i++, entries++) | |
628 | { | |
725d26d3 AK |
629 | ext4_lblk_t block = dx_get_block(entries); |
630 | ext4_lblk_t hash = i ? dx_get_hash(entries): 0; | |
ac27a0ec DK |
631 | u32 range = i < count - 1? (dx_get_hash(entries + 1) - hash): ~hash; |
632 | struct stats stats; | |
633 | printk("%s%3u:%03u hash %8x/%8x ",levels?"":" ", i, block, hash, range); | |
1c215028 TT |
634 | bh = ext4_bread(NULL,dir, block, 0); |
635 | if (!bh || IS_ERR(bh)) | |
636 | continue; | |
ac27a0ec DK |
637 | stats = levels? |
638 | dx_show_entries(hinfo, dir, ((struct dx_node *) bh->b_data)->entries, levels - 1): | |
617ba13b | 639 | dx_show_leaf(hinfo, (struct ext4_dir_entry_2 *) bh->b_data, blocksize, 0); |
ac27a0ec DK |
640 | names += stats.names; |
641 | space += stats.space; | |
642 | bcount += stats.bcount; | |
af5bc92d | 643 | brelse(bh); |
ac27a0ec DK |
644 | } |
645 | if (bcount) | |
60e6679e | 646 | printk(KERN_DEBUG "%snames %u, fullness %u (%u%%)\n", |
4776004f TT |
647 | levels ? "" : " ", names, space/bcount, |
648 | (space/bcount)*100/blocksize); | |
ac27a0ec DK |
649 | return (struct stats) { names, space, bcount}; |
650 | } | |
651 | #endif /* DX_DEBUG */ | |
652 | ||
653 | /* | |
654 | * Probe for a directory leaf block to search. | |
655 | * | |
656 | * dx_probe can return ERR_BAD_DX_DIR, which means there was a format | |
657 | * error in the directory index, and the caller should fall back to | |
658 | * searching the directory normally. The callers of dx_probe **MUST** | |
659 | * check for this error code, and make sure it never gets reflected | |
660 | * back to userspace. | |
661 | */ | |
662 | static struct dx_frame * | |
f702ba0f | 663 | dx_probe(const struct qstr *d_name, struct inode *dir, |
dd73b5d5 | 664 | struct dx_hash_info *hinfo, struct dx_frame *frame_in) |
ac27a0ec DK |
665 | { |
666 | unsigned count, indirect; | |
667 | struct dx_entry *at, *entries, *p, *q, *m; | |
668 | struct dx_root *root; | |
ac27a0ec | 669 | struct dx_frame *frame = frame_in; |
dd73b5d5 | 670 | struct dx_frame *ret_err = ERR_PTR(ERR_BAD_DX_DIR); |
ac27a0ec DK |
671 | u32 hash; |
672 | ||
dd73b5d5 TT |
673 | frame->bh = ext4_read_dirblock(dir, 0, INDEX); |
674 | if (IS_ERR(frame->bh)) | |
675 | return (struct dx_frame *) frame->bh; | |
676 | ||
677 | root = (struct dx_root *) frame->bh->b_data; | |
ac27a0ec DK |
678 | if (root->info.hash_version != DX_HASH_TEA && |
679 | root->info.hash_version != DX_HASH_HALF_MD4 && | |
680 | root->info.hash_version != DX_HASH_LEGACY) { | |
12062ddd | 681 | ext4_warning(dir->i_sb, "Unrecognised inode hash code %d", |
ac27a0ec | 682 | root->info.hash_version); |
ac27a0ec DK |
683 | goto fail; |
684 | } | |
685 | hinfo->hash_version = root->info.hash_version; | |
f99b2589 TT |
686 | if (hinfo->hash_version <= DX_HASH_TEA) |
687 | hinfo->hash_version += EXT4_SB(dir->i_sb)->s_hash_unsigned; | |
617ba13b | 688 | hinfo->seed = EXT4_SB(dir->i_sb)->s_hash_seed; |
f702ba0f TT |
689 | if (d_name) |
690 | ext4fs_dirhash(d_name->name, d_name->len, hinfo); | |
ac27a0ec DK |
691 | hash = hinfo->hash; |
692 | ||
693 | if (root->info.unused_flags & 1) { | |
12062ddd | 694 | ext4_warning(dir->i_sb, "Unimplemented inode hash flags: %#06x", |
ac27a0ec | 695 | root->info.unused_flags); |
ac27a0ec DK |
696 | goto fail; |
697 | } | |
698 | ||
699 | if ((indirect = root->info.indirect_levels) > 1) { | |
12062ddd | 700 | ext4_warning(dir->i_sb, "Unimplemented inode hash depth: %#06x", |
ac27a0ec | 701 | root->info.indirect_levels); |
ac27a0ec DK |
702 | goto fail; |
703 | } | |
704 | ||
705 | entries = (struct dx_entry *) (((char *)&root->info) + | |
706 | root->info.info_length); | |
3d82abae ES |
707 | |
708 | if (dx_get_limit(entries) != dx_root_limit(dir, | |
709 | root->info.info_length)) { | |
12062ddd | 710 | ext4_warning(dir->i_sb, "dx entry: limit != root limit"); |
3d82abae ES |
711 | goto fail; |
712 | } | |
713 | ||
af5bc92d | 714 | dxtrace(printk("Look up %x", hash)); |
dd73b5d5 | 715 | while (1) { |
ac27a0ec | 716 | count = dx_get_count(entries); |
3d82abae | 717 | if (!count || count > dx_get_limit(entries)) { |
12062ddd | 718 | ext4_warning(dir->i_sb, |
3d82abae | 719 | "dx entry: no count or count > limit"); |
dd73b5d5 | 720 | goto fail; |
3d82abae ES |
721 | } |
722 | ||
ac27a0ec DK |
723 | p = entries + 1; |
724 | q = entries + count - 1; | |
dd73b5d5 | 725 | while (p <= q) { |
ac27a0ec DK |
726 | m = p + (q - p)/2; |
727 | dxtrace(printk(".")); | |
728 | if (dx_get_hash(m) > hash) | |
729 | q = m - 1; | |
730 | else | |
731 | p = m + 1; | |
732 | } | |
733 | ||
dd73b5d5 | 734 | if (0) { // linear search cross check |
ac27a0ec DK |
735 | unsigned n = count - 1; |
736 | at = entries; | |
737 | while (n--) | |
738 | { | |
739 | dxtrace(printk(",")); | |
740 | if (dx_get_hash(++at) > hash) | |
741 | { | |
742 | at--; | |
743 | break; | |
744 | } | |
745 | } | |
746 | assert (at == p - 1); | |
747 | } | |
748 | ||
749 | at = p - 1; | |
750 | dxtrace(printk(" %x->%u\n", at == entries? 0: dx_get_hash(at), dx_get_block(at))); | |
ac27a0ec DK |
751 | frame->entries = entries; |
752 | frame->at = at; | |
dd73b5d5 TT |
753 | if (!indirect--) |
754 | return frame; | |
755 | frame++; | |
756 | frame->bh = ext4_read_dirblock(dir, dx_get_block(at), INDEX); | |
757 | if (IS_ERR(frame->bh)) { | |
758 | ret_err = (struct dx_frame *) frame->bh; | |
759 | frame->bh = NULL; | |
760 | goto fail; | |
dbe89444 | 761 | } |
dd73b5d5 | 762 | entries = ((struct dx_node *) frame->bh->b_data)->entries; |
dbe89444 | 763 | |
3d82abae | 764 | if (dx_get_limit(entries) != dx_node_limit (dir)) { |
12062ddd | 765 | ext4_warning(dir->i_sb, |
3d82abae | 766 | "dx entry: limit != node limit"); |
dd73b5d5 | 767 | goto fail; |
3d82abae | 768 | } |
ac27a0ec | 769 | } |
dd73b5d5 | 770 | fail: |
ac27a0ec DK |
771 | while (frame >= frame_in) { |
772 | brelse(frame->bh); | |
773 | frame--; | |
774 | } | |
dd73b5d5 | 775 | if (ret_err == ERR_PTR(ERR_BAD_DX_DIR)) |
12062ddd | 776 | ext4_warning(dir->i_sb, |
9ee49302 | 777 | "Corrupt dir inode %lu, running e2fsck is " |
3d82abae | 778 | "recommended.", dir->i_ino); |
dd73b5d5 | 779 | return ret_err; |
ac27a0ec DK |
780 | } |
781 | ||
782 | static void dx_release (struct dx_frame *frames) | |
783 | { | |
784 | if (frames[0].bh == NULL) | |
785 | return; | |
786 | ||
787 | if (((struct dx_root *) frames[0].bh->b_data)->info.indirect_levels) | |
788 | brelse(frames[1].bh); | |
789 | brelse(frames[0].bh); | |
790 | } | |
791 | ||
792 | /* | |
793 | * This function increments the frame pointer to search the next leaf | |
794 | * block, and reads in the necessary intervening nodes if the search | |
795 | * should be necessary. Whether or not the search is necessary is | |
796 | * controlled by the hash parameter. If the hash value is even, then | |
797 | * the search is only continued if the next block starts with that | |
798 | * hash value. This is used if we are searching for a specific file. | |
799 | * | |
800 | * If the hash value is HASH_NB_ALWAYS, then always go to the next block. | |
801 | * | |
802 | * This function returns 1 if the caller should continue to search, | |
803 | * or 0 if it should not. If there is an error reading one of the | |
804 | * index blocks, it will a negative error code. | |
805 | * | |
806 | * If start_hash is non-null, it will be filled in with the starting | |
807 | * hash of the next page. | |
808 | */ | |
617ba13b | 809 | static int ext4_htree_next_block(struct inode *dir, __u32 hash, |
ac27a0ec DK |
810 | struct dx_frame *frame, |
811 | struct dx_frame *frames, | |
812 | __u32 *start_hash) | |
813 | { | |
814 | struct dx_frame *p; | |
815 | struct buffer_head *bh; | |
dc6982ff | 816 | int num_frames = 0; |
ac27a0ec DK |
817 | __u32 bhash; |
818 | ||
819 | p = frame; | |
820 | /* | |
821 | * Find the next leaf page by incrementing the frame pointer. | |
822 | * If we run out of entries in the interior node, loop around and | |
823 | * increment pointer in the parent node. When we break out of | |
824 | * this loop, num_frames indicates the number of interior | |
825 | * nodes need to be read. | |
826 | */ | |
827 | while (1) { | |
828 | if (++(p->at) < p->entries + dx_get_count(p->entries)) | |
829 | break; | |
830 | if (p == frames) | |
831 | return 0; | |
832 | num_frames++; | |
833 | p--; | |
834 | } | |
835 | ||
836 | /* | |
837 | * If the hash is 1, then continue only if the next page has a | |
838 | * continuation hash of any value. This is used for readdir | |
839 | * handling. Otherwise, check to see if the hash matches the | |
840 | * desired contiuation hash. If it doesn't, return since | |
841 | * there's no point to read in the successive index pages. | |
842 | */ | |
843 | bhash = dx_get_hash(p->at); | |
844 | if (start_hash) | |
845 | *start_hash = bhash; | |
846 | if ((hash & 1) == 0) { | |
847 | if ((bhash & ~1) != hash) | |
848 | return 0; | |
849 | } | |
850 | /* | |
851 | * If the hash is HASH_NB_ALWAYS, we always go to the next | |
852 | * block so no check is necessary | |
853 | */ | |
854 | while (num_frames--) { | |
dc6982ff TT |
855 | bh = ext4_read_dirblock(dir, dx_get_block(p->at), INDEX); |
856 | if (IS_ERR(bh)) | |
857 | return PTR_ERR(bh); | |
ac27a0ec | 858 | p++; |
af5bc92d | 859 | brelse(p->bh); |
ac27a0ec DK |
860 | p->bh = bh; |
861 | p->at = p->entries = ((struct dx_node *) bh->b_data)->entries; | |
862 | } | |
863 | return 1; | |
864 | } | |
865 | ||
866 | ||
ac27a0ec DK |
867 | /* |
868 | * This function fills a red-black tree with information from a | |
869 | * directory block. It returns the number directory entries loaded | |
870 | * into the tree. If there is an error it is returned in err. | |
871 | */ | |
872 | static int htree_dirblock_to_tree(struct file *dir_file, | |
725d26d3 | 873 | struct inode *dir, ext4_lblk_t block, |
ac27a0ec DK |
874 | struct dx_hash_info *hinfo, |
875 | __u32 start_hash, __u32 start_minor_hash) | |
876 | { | |
877 | struct buffer_head *bh; | |
617ba13b | 878 | struct ext4_dir_entry_2 *de, *top; |
90b0a973 | 879 | int err = 0, count = 0; |
ac27a0ec | 880 | |
725d26d3 AK |
881 | dxtrace(printk(KERN_INFO "In htree dirblock_to_tree: block %lu\n", |
882 | (unsigned long)block)); | |
dc6982ff TT |
883 | bh = ext4_read_dirblock(dir, block, DIRENT); |
884 | if (IS_ERR(bh)) | |
885 | return PTR_ERR(bh); | |
b0336e8d | 886 | |
617ba13b MC |
887 | de = (struct ext4_dir_entry_2 *) bh->b_data; |
888 | top = (struct ext4_dir_entry_2 *) ((char *) de + | |
ac27a0ec | 889 | dir->i_sb->s_blocksize - |
617ba13b | 890 | EXT4_DIR_REC_LEN(0)); |
3d0518f4 | 891 | for (; de < top; de = ext4_next_entry(de, dir->i_sb->s_blocksize)) { |
f7c21177 | 892 | if (ext4_check_dir_entry(dir, NULL, de, bh, |
226ba972 | 893 | bh->b_data, bh->b_size, |
cad3f007 TT |
894 | (block<<EXT4_BLOCK_SIZE_BITS(dir->i_sb)) |
895 | + ((char *)de - bh->b_data))) { | |
64cb9273 AV |
896 | /* silently ignore the rest of the block */ |
897 | break; | |
e6c40211 | 898 | } |
617ba13b | 899 | ext4fs_dirhash(de->name, de->name_len, hinfo); |
ac27a0ec DK |
900 | if ((hinfo->hash < start_hash) || |
901 | ((hinfo->hash == start_hash) && | |
902 | (hinfo->minor_hash < start_minor_hash))) | |
903 | continue; | |
904 | if (de->inode == 0) | |
905 | continue; | |
617ba13b | 906 | if ((err = ext4_htree_store_dirent(dir_file, |
ac27a0ec DK |
907 | hinfo->hash, hinfo->minor_hash, de)) != 0) { |
908 | brelse(bh); | |
909 | return err; | |
910 | } | |
911 | count++; | |
912 | } | |
913 | brelse(bh); | |
914 | return count; | |
915 | } | |
916 | ||
917 | ||
918 | /* | |
919 | * This function fills a red-black tree with information from a | |
920 | * directory. We start scanning the directory in hash order, starting | |
921 | * at start_hash and start_minor_hash. | |
922 | * | |
923 | * This function returns the number of entries inserted into the tree, | |
924 | * or a negative error code. | |
925 | */ | |
617ba13b | 926 | int ext4_htree_fill_tree(struct file *dir_file, __u32 start_hash, |
ac27a0ec DK |
927 | __u32 start_minor_hash, __u32 *next_hash) |
928 | { | |
929 | struct dx_hash_info hinfo; | |
617ba13b | 930 | struct ext4_dir_entry_2 *de; |
ac27a0ec DK |
931 | struct dx_frame frames[2], *frame; |
932 | struct inode *dir; | |
725d26d3 | 933 | ext4_lblk_t block; |
ac27a0ec | 934 | int count = 0; |
725d26d3 | 935 | int ret, err; |
ac27a0ec DK |
936 | __u32 hashval; |
937 | ||
60e6679e | 938 | dxtrace(printk(KERN_DEBUG "In htree_fill_tree, start hash: %x:%x\n", |
4776004f | 939 | start_hash, start_minor_hash)); |
496ad9aa | 940 | dir = file_inode(dir_file); |
12e9b892 | 941 | if (!(ext4_test_inode_flag(dir, EXT4_INODE_INDEX))) { |
617ba13b | 942 | hinfo.hash_version = EXT4_SB(dir->i_sb)->s_def_hash_version; |
f99b2589 TT |
943 | if (hinfo.hash_version <= DX_HASH_TEA) |
944 | hinfo.hash_version += | |
945 | EXT4_SB(dir->i_sb)->s_hash_unsigned; | |
617ba13b | 946 | hinfo.seed = EXT4_SB(dir->i_sb)->s_hash_seed; |
8af0f082 TM |
947 | if (ext4_has_inline_data(dir)) { |
948 | int has_inline_data = 1; | |
949 | count = htree_inlinedir_to_tree(dir_file, dir, 0, | |
950 | &hinfo, start_hash, | |
951 | start_minor_hash, | |
952 | &has_inline_data); | |
953 | if (has_inline_data) { | |
954 | *next_hash = ~0; | |
955 | return count; | |
956 | } | |
957 | } | |
ac27a0ec DK |
958 | count = htree_dirblock_to_tree(dir_file, dir, 0, &hinfo, |
959 | start_hash, start_minor_hash); | |
960 | *next_hash = ~0; | |
961 | return count; | |
962 | } | |
963 | hinfo.hash = start_hash; | |
964 | hinfo.minor_hash = 0; | |
dd73b5d5 TT |
965 | frame = dx_probe(NULL, dir, &hinfo, frames); |
966 | if (IS_ERR(frame)) | |
967 | return PTR_ERR(frame); | |
ac27a0ec DK |
968 | |
969 | /* Add '.' and '..' from the htree header */ | |
970 | if (!start_hash && !start_minor_hash) { | |
617ba13b MC |
971 | de = (struct ext4_dir_entry_2 *) frames[0].bh->b_data; |
972 | if ((err = ext4_htree_store_dirent(dir_file, 0, 0, de)) != 0) | |
ac27a0ec DK |
973 | goto errout; |
974 | count++; | |
975 | } | |
976 | if (start_hash < 2 || (start_hash ==2 && start_minor_hash==0)) { | |
617ba13b | 977 | de = (struct ext4_dir_entry_2 *) frames[0].bh->b_data; |
3d0518f4 | 978 | de = ext4_next_entry(de, dir->i_sb->s_blocksize); |
617ba13b | 979 | if ((err = ext4_htree_store_dirent(dir_file, 2, 0, de)) != 0) |
ac27a0ec DK |
980 | goto errout; |
981 | count++; | |
982 | } | |
983 | ||
984 | while (1) { | |
985 | block = dx_get_block(frame->at); | |
986 | ret = htree_dirblock_to_tree(dir_file, dir, block, &hinfo, | |
987 | start_hash, start_minor_hash); | |
988 | if (ret < 0) { | |
989 | err = ret; | |
990 | goto errout; | |
991 | } | |
992 | count += ret; | |
993 | hashval = ~0; | |
617ba13b | 994 | ret = ext4_htree_next_block(dir, HASH_NB_ALWAYS, |
ac27a0ec DK |
995 | frame, frames, &hashval); |
996 | *next_hash = hashval; | |
997 | if (ret < 0) { | |
998 | err = ret; | |
999 | goto errout; | |
1000 | } | |
1001 | /* | |
1002 | * Stop if: (a) there are no more entries, or | |
1003 | * (b) we have inserted at least one entry and the | |
1004 | * next hash value is not a continuation | |
1005 | */ | |
1006 | if ((ret == 0) || | |
1007 | (count && ((hashval & 1) == 0))) | |
1008 | break; | |
1009 | } | |
1010 | dx_release(frames); | |
4776004f TT |
1011 | dxtrace(printk(KERN_DEBUG "Fill tree: returned %d entries, " |
1012 | "next hash: %x\n", count, *next_hash)); | |
ac27a0ec DK |
1013 | return count; |
1014 | errout: | |
1015 | dx_release(frames); | |
1016 | return (err); | |
1017 | } | |
1018 | ||
7335cd3b TM |
1019 | static inline int search_dirblock(struct buffer_head *bh, |
1020 | struct inode *dir, | |
1021 | const struct qstr *d_name, | |
1022 | unsigned int offset, | |
1023 | struct ext4_dir_entry_2 **res_dir) | |
1024 | { | |
1025 | return search_dir(bh, bh->b_data, dir->i_sb->s_blocksize, dir, | |
1026 | d_name, offset, res_dir); | |
1027 | } | |
1028 | ||
ac27a0ec DK |
1029 | /* |
1030 | * Directory block splitting, compacting | |
1031 | */ | |
1032 | ||
ef2b02d3 ES |
1033 | /* |
1034 | * Create map of hash values, offsets, and sizes, stored at end of block. | |
1035 | * Returns number of entries mapped. | |
1036 | */ | |
8bad4597 TT |
1037 | static int dx_make_map(struct ext4_dir_entry_2 *de, unsigned blocksize, |
1038 | struct dx_hash_info *hinfo, | |
1039 | struct dx_map_entry *map_tail) | |
ac27a0ec DK |
1040 | { |
1041 | int count = 0; | |
1042 | char *base = (char *) de; | |
1043 | struct dx_hash_info h = *hinfo; | |
1044 | ||
8bad4597 | 1045 | while ((char *) de < base + blocksize) { |
ac27a0ec | 1046 | if (de->name_len && de->inode) { |
617ba13b | 1047 | ext4fs_dirhash(de->name, de->name_len, &h); |
ac27a0ec DK |
1048 | map_tail--; |
1049 | map_tail->hash = h.hash; | |
9aee2286 | 1050 | map_tail->offs = ((char *) de - base)>>2; |
ef2b02d3 | 1051 | map_tail->size = le16_to_cpu(de->rec_len); |
ac27a0ec DK |
1052 | count++; |
1053 | cond_resched(); | |
1054 | } | |
1055 | /* XXX: do we need to check rec_len == 0 case? -Chris */ | |
3d0518f4 | 1056 | de = ext4_next_entry(de, blocksize); |
ac27a0ec DK |
1057 | } |
1058 | return count; | |
1059 | } | |
1060 | ||
ef2b02d3 | 1061 | /* Sort map by hash value */ |
ac27a0ec DK |
1062 | static void dx_sort_map (struct dx_map_entry *map, unsigned count) |
1063 | { | |
63f57933 AM |
1064 | struct dx_map_entry *p, *q, *top = map + count - 1; |
1065 | int more; | |
1066 | /* Combsort until bubble sort doesn't suck */ | |
1067 | while (count > 2) { | |
1068 | count = count*10/13; | |
1069 | if (count - 9 < 2) /* 9, 10 -> 11 */ | |
1070 | count = 11; | |
1071 | for (p = top, q = p - count; q >= map; p--, q--) | |
1072 | if (p->hash < q->hash) | |
1073 | swap(*p, *q); | |
1074 | } | |
1075 | /* Garden variety bubble sort */ | |
1076 | do { | |
1077 | more = 0; | |
1078 | q = top; | |
1079 | while (q-- > map) { | |
1080 | if (q[1].hash >= q[0].hash) | |
ac27a0ec | 1081 | continue; |
63f57933 AM |
1082 | swap(*(q+1), *q); |
1083 | more = 1; | |
ac27a0ec DK |
1084 | } |
1085 | } while(more); | |
1086 | } | |
1087 | ||
725d26d3 | 1088 | static void dx_insert_block(struct dx_frame *frame, u32 hash, ext4_lblk_t block) |
ac27a0ec DK |
1089 | { |
1090 | struct dx_entry *entries = frame->entries; | |
1091 | struct dx_entry *old = frame->at, *new = old + 1; | |
1092 | int count = dx_get_count(entries); | |
1093 | ||
1094 | assert(count < dx_get_limit(entries)); | |
1095 | assert(old < entries + count); | |
1096 | memmove(new + 1, new, (char *)(entries + count) - (char *)(new)); | |
1097 | dx_set_hash(new, hash); | |
1098 | dx_set_block(new, block); | |
1099 | dx_set_count(entries, count + 1); | |
1100 | } | |
ac27a0ec | 1101 | |
ac27a0ec | 1102 | /* |
617ba13b | 1103 | * NOTE! unlike strncmp, ext4_match returns 1 for success, 0 for failure. |
ac27a0ec | 1104 | * |
617ba13b | 1105 | * `len <= EXT4_NAME_LEN' is guaranteed by caller. |
ac27a0ec DK |
1106 | * `de != NULL' is guaranteed by caller. |
1107 | */ | |
617ba13b MC |
1108 | static inline int ext4_match (int len, const char * const name, |
1109 | struct ext4_dir_entry_2 * de) | |
ac27a0ec DK |
1110 | { |
1111 | if (len != de->name_len) | |
1112 | return 0; | |
1113 | if (!de->inode) | |
1114 | return 0; | |
1115 | return !memcmp(name, de->name, len); | |
1116 | } | |
1117 | ||
1118 | /* | |
1119 | * Returns 0 if not found, -1 on failure, and 1 on success | |
1120 | */ | |
7335cd3b TM |
1121 | int search_dir(struct buffer_head *bh, |
1122 | char *search_buf, | |
1123 | int buf_size, | |
1124 | struct inode *dir, | |
1125 | const struct qstr *d_name, | |
1126 | unsigned int offset, | |
1127 | struct ext4_dir_entry_2 **res_dir) | |
ac27a0ec | 1128 | { |
617ba13b | 1129 | struct ext4_dir_entry_2 * de; |
ac27a0ec DK |
1130 | char * dlimit; |
1131 | int de_len; | |
f702ba0f TT |
1132 | const char *name = d_name->name; |
1133 | int namelen = d_name->len; | |
ac27a0ec | 1134 | |
7335cd3b TM |
1135 | de = (struct ext4_dir_entry_2 *)search_buf; |
1136 | dlimit = search_buf + buf_size; | |
ac27a0ec DK |
1137 | while ((char *) de < dlimit) { |
1138 | /* this code is executed quadratically often */ | |
1139 | /* do minimal checking `by hand' */ | |
1140 | ||
1141 | if ((char *) de + namelen <= dlimit && | |
617ba13b | 1142 | ext4_match (namelen, name, de)) { |
ac27a0ec | 1143 | /* found a match - just to be sure, do a full check */ |
226ba972 TM |
1144 | if (ext4_check_dir_entry(dir, NULL, de, bh, bh->b_data, |
1145 | bh->b_size, offset)) | |
ac27a0ec DK |
1146 | return -1; |
1147 | *res_dir = de; | |
1148 | return 1; | |
1149 | } | |
1150 | /* prevent looping on a bad block */ | |
3d0518f4 WY |
1151 | de_len = ext4_rec_len_from_disk(de->rec_len, |
1152 | dir->i_sb->s_blocksize); | |
ac27a0ec DK |
1153 | if (de_len <= 0) |
1154 | return -1; | |
1155 | offset += de_len; | |
617ba13b | 1156 | de = (struct ext4_dir_entry_2 *) ((char *) de + de_len); |
ac27a0ec DK |
1157 | } |
1158 | return 0; | |
1159 | } | |
1160 | ||
c6af8803 DW |
1161 | static int is_dx_internal_node(struct inode *dir, ext4_lblk_t block, |
1162 | struct ext4_dir_entry *de) | |
1163 | { | |
1164 | struct super_block *sb = dir->i_sb; | |
1165 | ||
1166 | if (!is_dx(dir)) | |
1167 | return 0; | |
1168 | if (block == 0) | |
1169 | return 1; | |
1170 | if (de->inode == 0 && | |
1171 | ext4_rec_len_from_disk(de->rec_len, sb->s_blocksize) == | |
1172 | sb->s_blocksize) | |
1173 | return 1; | |
1174 | return 0; | |
1175 | } | |
ac27a0ec DK |
1176 | |
1177 | /* | |
617ba13b | 1178 | * ext4_find_entry() |
ac27a0ec DK |
1179 | * |
1180 | * finds an entry in the specified directory with the wanted name. It | |
1181 | * returns the cache buffer in which the entry was found, and the entry | |
1182 | * itself (as a parameter - res_dir). It does NOT read the inode of the | |
1183 | * entry - you'll have to do that yourself if you want to. | |
1184 | * | |
1185 | * The returned buffer_head has ->b_count elevated. The caller is expected | |
1186 | * to brelse() it when appropriate. | |
1187 | */ | |
f702ba0f TT |
1188 | static struct buffer_head * ext4_find_entry (struct inode *dir, |
1189 | const struct qstr *d_name, | |
32f7f22c TM |
1190 | struct ext4_dir_entry_2 **res_dir, |
1191 | int *inlined) | |
ac27a0ec | 1192 | { |
af5bc92d TT |
1193 | struct super_block *sb; |
1194 | struct buffer_head *bh_use[NAMEI_RA_SIZE]; | |
1195 | struct buffer_head *bh, *ret = NULL; | |
725d26d3 | 1196 | ext4_lblk_t start, block, b; |
8941ec8b | 1197 | const u8 *name = d_name->name; |
ac27a0ec DK |
1198 | int ra_max = 0; /* Number of bh's in the readahead |
1199 | buffer, bh_use[] */ | |
1200 | int ra_ptr = 0; /* Current index into readahead | |
1201 | buffer */ | |
1202 | int num = 0; | |
725d26d3 | 1203 | ext4_lblk_t nblocks; |
10560082 | 1204 | int i, namelen; |
ac27a0ec DK |
1205 | |
1206 | *res_dir = NULL; | |
1207 | sb = dir->i_sb; | |
f702ba0f | 1208 | namelen = d_name->len; |
617ba13b | 1209 | if (namelen > EXT4_NAME_LEN) |
ac27a0ec | 1210 | return NULL; |
e8e948e7 TM |
1211 | |
1212 | if (ext4_has_inline_data(dir)) { | |
1213 | int has_inline_data = 1; | |
1214 | ret = ext4_find_inline_entry(dir, d_name, res_dir, | |
1215 | &has_inline_data); | |
32f7f22c TM |
1216 | if (has_inline_data) { |
1217 | if (inlined) | |
1218 | *inlined = 1; | |
e8e948e7 | 1219 | return ret; |
32f7f22c | 1220 | } |
e8e948e7 TM |
1221 | } |
1222 | ||
8941ec8b | 1223 | if ((namelen <= 2) && (name[0] == '.') && |
6d5c3aa8 | 1224 | (name[1] == '.' || name[1] == '\0')) { |
8941ec8b TT |
1225 | /* |
1226 | * "." or ".." will only be in the first block | |
1227 | * NFS may look up ".."; "." should be handled by the VFS | |
1228 | */ | |
1229 | block = start = 0; | |
1230 | nblocks = 1; | |
1231 | goto restart; | |
1232 | } | |
ac27a0ec | 1233 | if (is_dx(dir)) { |
537d8f93 | 1234 | bh = ext4_dx_find_entry(dir, d_name, res_dir); |
ac27a0ec DK |
1235 | /* |
1236 | * On success, or if the error was file not found, | |
1237 | * return. Otherwise, fall back to doing a search the | |
1238 | * old fashioned way. | |
1239 | */ | |
537d8f93 | 1240 | if (!IS_ERR(bh) || PTR_ERR(bh) != ERR_BAD_DX_DIR) |
ac27a0ec | 1241 | return bh; |
4776004f TT |
1242 | dxtrace(printk(KERN_DEBUG "ext4_find_entry: dx failed, " |
1243 | "falling back\n")); | |
ac27a0ec | 1244 | } |
617ba13b MC |
1245 | nblocks = dir->i_size >> EXT4_BLOCK_SIZE_BITS(sb); |
1246 | start = EXT4_I(dir)->i_dir_start_lookup; | |
ac27a0ec DK |
1247 | if (start >= nblocks) |
1248 | start = 0; | |
1249 | block = start; | |
1250 | restart: | |
1251 | do { | |
1252 | /* | |
1253 | * We deal with the read-ahead logic here. | |
1254 | */ | |
1255 | if (ra_ptr >= ra_max) { | |
1256 | /* Refill the readahead buffer */ | |
1257 | ra_ptr = 0; | |
1258 | b = block; | |
1259 | for (ra_max = 0; ra_max < NAMEI_RA_SIZE; ra_max++) { | |
1260 | /* | |
1261 | * Terminate if we reach the end of the | |
1262 | * directory and must wrap, or if our | |
1263 | * search has finished at this block. | |
1264 | */ | |
1265 | if (b >= nblocks || (num && block == start)) { | |
1266 | bh_use[ra_max] = NULL; | |
1267 | break; | |
1268 | } | |
1269 | num++; | |
10560082 TT |
1270 | bh = ext4_getblk(NULL, dir, b++, 0); |
1271 | if (unlikely(IS_ERR(bh))) { | |
36de9286 | 1272 | if (ra_max == 0) |
10560082 | 1273 | return bh; |
36de9286 TT |
1274 | break; |
1275 | } | |
ac27a0ec DK |
1276 | bh_use[ra_max] = bh; |
1277 | if (bh) | |
65299a3b CH |
1278 | ll_rw_block(READ | REQ_META | REQ_PRIO, |
1279 | 1, &bh); | |
ac27a0ec DK |
1280 | } |
1281 | } | |
1282 | if ((bh = bh_use[ra_ptr++]) == NULL) | |
1283 | goto next; | |
1284 | wait_on_buffer(bh); | |
1285 | if (!buffer_uptodate(bh)) { | |
1286 | /* read error, skip block & hope for the best */ | |
24676da4 TT |
1287 | EXT4_ERROR_INODE(dir, "reading directory lblock %lu", |
1288 | (unsigned long) block); | |
ac27a0ec DK |
1289 | brelse(bh); |
1290 | goto next; | |
1291 | } | |
b0336e8d | 1292 | if (!buffer_verified(bh) && |
c6af8803 DW |
1293 | !is_dx_internal_node(dir, block, |
1294 | (struct ext4_dir_entry *)bh->b_data) && | |
b0336e8d DW |
1295 | !ext4_dirent_csum_verify(dir, |
1296 | (struct ext4_dir_entry *)bh->b_data)) { | |
1297 | EXT4_ERROR_INODE(dir, "checksumming directory " | |
1298 | "block %lu", (unsigned long)block); | |
1299 | brelse(bh); | |
1300 | goto next; | |
1301 | } | |
1302 | set_buffer_verified(bh); | |
f702ba0f | 1303 | i = search_dirblock(bh, dir, d_name, |
617ba13b | 1304 | block << EXT4_BLOCK_SIZE_BITS(sb), res_dir); |
ac27a0ec | 1305 | if (i == 1) { |
617ba13b | 1306 | EXT4_I(dir)->i_dir_start_lookup = block; |
ac27a0ec DK |
1307 | ret = bh; |
1308 | goto cleanup_and_exit; | |
1309 | } else { | |
1310 | brelse(bh); | |
1311 | if (i < 0) | |
1312 | goto cleanup_and_exit; | |
1313 | } | |
1314 | next: | |
1315 | if (++block >= nblocks) | |
1316 | block = 0; | |
1317 | } while (block != start); | |
1318 | ||
1319 | /* | |
1320 | * If the directory has grown while we were searching, then | |
1321 | * search the last part of the directory before giving up. | |
1322 | */ | |
1323 | block = nblocks; | |
617ba13b | 1324 | nblocks = dir->i_size >> EXT4_BLOCK_SIZE_BITS(sb); |
ac27a0ec DK |
1325 | if (block < nblocks) { |
1326 | start = 0; | |
1327 | goto restart; | |
1328 | } | |
1329 | ||
1330 | cleanup_and_exit: | |
1331 | /* Clean up the read-ahead blocks */ | |
1332 | for (; ra_ptr < ra_max; ra_ptr++) | |
af5bc92d | 1333 | brelse(bh_use[ra_ptr]); |
ac27a0ec DK |
1334 | return ret; |
1335 | } | |
1336 | ||
f702ba0f | 1337 | static struct buffer_head * ext4_dx_find_entry(struct inode *dir, const struct qstr *d_name, |
537d8f93 | 1338 | struct ext4_dir_entry_2 **res_dir) |
ac27a0ec | 1339 | { |
8941ec8b | 1340 | struct super_block * sb = dir->i_sb; |
ac27a0ec | 1341 | struct dx_hash_info hinfo; |
ac27a0ec | 1342 | struct dx_frame frames[2], *frame; |
ac27a0ec | 1343 | struct buffer_head *bh; |
725d26d3 | 1344 | ext4_lblk_t block; |
ac27a0ec | 1345 | int retval; |
ac27a0ec | 1346 | |
dd73b5d5 TT |
1347 | frame = dx_probe(d_name, dir, &hinfo, frames); |
1348 | if (IS_ERR(frame)) | |
1349 | return (struct buffer_head *) frame; | |
ac27a0ec DK |
1350 | do { |
1351 | block = dx_get_block(frame->at); | |
dc6982ff | 1352 | bh = ext4_read_dirblock(dir, block, DIRENT); |
537d8f93 | 1353 | if (IS_ERR(bh)) |
b0336e8d | 1354 | goto errout; |
537d8f93 | 1355 | |
7845c049 TT |
1356 | retval = search_dirblock(bh, dir, d_name, |
1357 | block << EXT4_BLOCK_SIZE_BITS(sb), | |
1358 | res_dir); | |
537d8f93 TT |
1359 | if (retval == 1) |
1360 | goto success; | |
af5bc92d | 1361 | brelse(bh); |
7845c049 | 1362 | if (retval == -1) { |
537d8f93 | 1363 | bh = ERR_PTR(ERR_BAD_DX_DIR); |
7845c049 TT |
1364 | goto errout; |
1365 | } | |
1366 | ||
ac27a0ec | 1367 | /* Check to see if we should continue to search */ |
8941ec8b | 1368 | retval = ext4_htree_next_block(dir, hinfo.hash, frame, |
ac27a0ec DK |
1369 | frames, NULL); |
1370 | if (retval < 0) { | |
12062ddd | 1371 | ext4_warning(sb, |
537d8f93 TT |
1372 | "error %d reading index page in directory #%lu", |
1373 | retval, dir->i_ino); | |
1374 | bh = ERR_PTR(retval); | |
ac27a0ec DK |
1375 | goto errout; |
1376 | } | |
1377 | } while (retval == 1); | |
1378 | ||
537d8f93 | 1379 | bh = NULL; |
ac27a0ec | 1380 | errout: |
265c6a0f | 1381 | dxtrace(printk(KERN_DEBUG "%s not found\n", d_name->name)); |
537d8f93 TT |
1382 | success: |
1383 | dx_release(frames); | |
1384 | return bh; | |
ac27a0ec | 1385 | } |
ac27a0ec | 1386 | |
00cd8dd3 | 1387 | static struct dentry *ext4_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags) |
ac27a0ec | 1388 | { |
af5bc92d TT |
1389 | struct inode *inode; |
1390 | struct ext4_dir_entry_2 *de; | |
1391 | struct buffer_head *bh; | |
ac27a0ec | 1392 | |
617ba13b | 1393 | if (dentry->d_name.len > EXT4_NAME_LEN) |
ac27a0ec DK |
1394 | return ERR_PTR(-ENAMETOOLONG); |
1395 | ||
32f7f22c | 1396 | bh = ext4_find_entry(dir, &dentry->d_name, &de, NULL); |
36de9286 TT |
1397 | if (IS_ERR(bh)) |
1398 | return (struct dentry *) bh; | |
ac27a0ec DK |
1399 | inode = NULL; |
1400 | if (bh) { | |
498e5f24 | 1401 | __u32 ino = le32_to_cpu(de->inode); |
af5bc92d | 1402 | brelse(bh); |
617ba13b | 1403 | if (!ext4_valid_inum(dir->i_sb, ino)) { |
24676da4 | 1404 | EXT4_ERROR_INODE(dir, "bad inode number: %u", ino); |
1d1fe1ee | 1405 | return ERR_PTR(-EIO); |
a6c15c2b | 1406 | } |
7e936b73 | 1407 | if (unlikely(ino == dir->i_ino)) { |
a34e15cc DH |
1408 | EXT4_ERROR_INODE(dir, "'%pd' linked to parent dir", |
1409 | dentry); | |
7e936b73 AD |
1410 | return ERR_PTR(-EIO); |
1411 | } | |
f4bb2981 | 1412 | inode = ext4_iget_normal(dir->i_sb, ino); |
a9049376 AV |
1413 | if (inode == ERR_PTR(-ESTALE)) { |
1414 | EXT4_ERROR_INODE(dir, | |
1415 | "deleted inode referenced: %u", | |
1416 | ino); | |
1417 | return ERR_PTR(-EIO); | |
e6f009b0 | 1418 | } |
d9cdc903 TT |
1419 | if (!IS_ERR(inode) && ext4_encrypted_inode(dir) && |
1420 | (S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) || | |
1421 | S_ISLNK(inode->i_mode)) && | |
1422 | !ext4_is_child_context_consistent_with_parent(dir, | |
1423 | inode)) { | |
1424 | iput(inode); | |
1425 | ext4_warning(inode->i_sb, | |
1426 | "Inconsistent encryption contexts: %lu/%lu\n", | |
1427 | (unsigned long) dir->i_ino, | |
1428 | (unsigned long) inode->i_ino); | |
1429 | return ERR_PTR(-EPERM); | |
1430 | } | |
ac27a0ec DK |
1431 | } |
1432 | return d_splice_alias(inode, dentry); | |
1433 | } | |
1434 | ||
1435 | ||
617ba13b | 1436 | struct dentry *ext4_get_parent(struct dentry *child) |
ac27a0ec | 1437 | { |
498e5f24 | 1438 | __u32 ino; |
26fe5750 | 1439 | static const struct qstr dotdot = QSTR_INIT("..", 2); |
617ba13b | 1440 | struct ext4_dir_entry_2 * de; |
ac27a0ec DK |
1441 | struct buffer_head *bh; |
1442 | ||
32f7f22c | 1443 | bh = ext4_find_entry(child->d_inode, &dotdot, &de, NULL); |
36de9286 TT |
1444 | if (IS_ERR(bh)) |
1445 | return (struct dentry *) bh; | |
ac27a0ec DK |
1446 | if (!bh) |
1447 | return ERR_PTR(-ENOENT); | |
1448 | ino = le32_to_cpu(de->inode); | |
1449 | brelse(bh); | |
1450 | ||
617ba13b | 1451 | if (!ext4_valid_inum(child->d_inode->i_sb, ino)) { |
24676da4 TT |
1452 | EXT4_ERROR_INODE(child->d_inode, |
1453 | "bad parent inode number: %u", ino); | |
1d1fe1ee | 1454 | return ERR_PTR(-EIO); |
a6c15c2b VA |
1455 | } |
1456 | ||
f4bb2981 | 1457 | return d_obtain_alias(ext4_iget_normal(child->d_inode->i_sb, ino)); |
ac27a0ec DK |
1458 | } |
1459 | ||
ef2b02d3 ES |
1460 | /* |
1461 | * Move count entries from end of map between two memory locations. | |
1462 | * Returns pointer to last entry moved. | |
1463 | */ | |
617ba13b | 1464 | static struct ext4_dir_entry_2 * |
3d0518f4 WY |
1465 | dx_move_dirents(char *from, char *to, struct dx_map_entry *map, int count, |
1466 | unsigned blocksize) | |
ac27a0ec DK |
1467 | { |
1468 | unsigned rec_len = 0; | |
1469 | ||
1470 | while (count--) { | |
60e6679e | 1471 | struct ext4_dir_entry_2 *de = (struct ext4_dir_entry_2 *) |
9aee2286 | 1472 | (from + (map->offs<<2)); |
617ba13b | 1473 | rec_len = EXT4_DIR_REC_LEN(de->name_len); |
ac27a0ec | 1474 | memcpy (to, de, rec_len); |
617ba13b | 1475 | ((struct ext4_dir_entry_2 *) to)->rec_len = |
3d0518f4 | 1476 | ext4_rec_len_to_disk(rec_len, blocksize); |
ac27a0ec DK |
1477 | de->inode = 0; |
1478 | map++; | |
1479 | to += rec_len; | |
1480 | } | |
617ba13b | 1481 | return (struct ext4_dir_entry_2 *) (to - rec_len); |
ac27a0ec DK |
1482 | } |
1483 | ||
ef2b02d3 ES |
1484 | /* |
1485 | * Compact each dir entry in the range to the minimal rec_len. | |
1486 | * Returns pointer to last entry in range. | |
1487 | */ | |
8bad4597 | 1488 | static struct ext4_dir_entry_2* dx_pack_dirents(char *base, unsigned blocksize) |
ac27a0ec | 1489 | { |
617ba13b | 1490 | struct ext4_dir_entry_2 *next, *to, *prev, *de = (struct ext4_dir_entry_2 *) base; |
ac27a0ec DK |
1491 | unsigned rec_len = 0; |
1492 | ||
1493 | prev = to = de; | |
8bad4597 | 1494 | while ((char*)de < base + blocksize) { |
3d0518f4 | 1495 | next = ext4_next_entry(de, blocksize); |
ac27a0ec | 1496 | if (de->inode && de->name_len) { |
617ba13b | 1497 | rec_len = EXT4_DIR_REC_LEN(de->name_len); |
ac27a0ec DK |
1498 | if (de > to) |
1499 | memmove(to, de, rec_len); | |
3d0518f4 | 1500 | to->rec_len = ext4_rec_len_to_disk(rec_len, blocksize); |
ac27a0ec | 1501 | prev = to; |
617ba13b | 1502 | to = (struct ext4_dir_entry_2 *) (((char *) to) + rec_len); |
ac27a0ec DK |
1503 | } |
1504 | de = next; | |
1505 | } | |
1506 | return prev; | |
1507 | } | |
1508 | ||
ef2b02d3 ES |
1509 | /* |
1510 | * Split a full leaf block to make room for a new dir entry. | |
1511 | * Allocate a new block, and move entries so that they are approx. equally full. | |
1512 | * Returns pointer to de in block into which the new entry will be inserted. | |
1513 | */ | |
617ba13b | 1514 | static struct ext4_dir_entry_2 *do_split(handle_t *handle, struct inode *dir, |
ac27a0ec | 1515 | struct buffer_head **bh,struct dx_frame *frame, |
f8b3b59d | 1516 | struct dx_hash_info *hinfo) |
ac27a0ec DK |
1517 | { |
1518 | unsigned blocksize = dir->i_sb->s_blocksize; | |
1519 | unsigned count, continued; | |
1520 | struct buffer_head *bh2; | |
725d26d3 | 1521 | ext4_lblk_t newblock; |
ac27a0ec DK |
1522 | u32 hash2; |
1523 | struct dx_map_entry *map; | |
1524 | char *data1 = (*bh)->b_data, *data2; | |
59e315b4 | 1525 | unsigned split, move, size; |
617ba13b | 1526 | struct ext4_dir_entry_2 *de = NULL, *de2; |
b0336e8d DW |
1527 | struct ext4_dir_entry_tail *t; |
1528 | int csum_size = 0; | |
59e315b4 | 1529 | int err = 0, i; |
ac27a0ec | 1530 | |
9aa5d32b | 1531 | if (ext4_has_metadata_csum(dir->i_sb)) |
b0336e8d DW |
1532 | csum_size = sizeof(struct ext4_dir_entry_tail); |
1533 | ||
0f70b406 TT |
1534 | bh2 = ext4_append(handle, dir, &newblock); |
1535 | if (IS_ERR(bh2)) { | |
ac27a0ec DK |
1536 | brelse(*bh); |
1537 | *bh = NULL; | |
f8b3b59d | 1538 | return (struct ext4_dir_entry_2 *) bh2; |
ac27a0ec DK |
1539 | } |
1540 | ||
1541 | BUFFER_TRACE(*bh, "get_write_access"); | |
617ba13b | 1542 | err = ext4_journal_get_write_access(handle, *bh); |
fedee54d DM |
1543 | if (err) |
1544 | goto journal_error; | |
1545 | ||
ac27a0ec | 1546 | BUFFER_TRACE(frame->bh, "get_write_access"); |
617ba13b | 1547 | err = ext4_journal_get_write_access(handle, frame->bh); |
ac27a0ec DK |
1548 | if (err) |
1549 | goto journal_error; | |
1550 | ||
1551 | data2 = bh2->b_data; | |
1552 | ||
1553 | /* create map in the end of data2 block */ | |
1554 | map = (struct dx_map_entry *) (data2 + blocksize); | |
af5bc92d | 1555 | count = dx_make_map((struct ext4_dir_entry_2 *) data1, |
ac27a0ec DK |
1556 | blocksize, hinfo, map); |
1557 | map -= count; | |
af5bc92d | 1558 | dx_sort_map(map, count); |
ef2b02d3 ES |
1559 | /* Split the existing block in the middle, size-wise */ |
1560 | size = 0; | |
1561 | move = 0; | |
1562 | for (i = count-1; i >= 0; i--) { | |
1563 | /* is more than half of this entry in 2nd half of the block? */ | |
1564 | if (size + map[i].size/2 > blocksize/2) | |
1565 | break; | |
1566 | size += map[i].size; | |
1567 | move++; | |
1568 | } | |
1569 | /* map index at which we will split */ | |
1570 | split = count - move; | |
ac27a0ec DK |
1571 | hash2 = map[split].hash; |
1572 | continued = hash2 == map[split - 1].hash; | |
725d26d3 AK |
1573 | dxtrace(printk(KERN_INFO "Split block %lu at %x, %i/%i\n", |
1574 | (unsigned long)dx_get_block(frame->at), | |
1575 | hash2, split, count-split)); | |
ac27a0ec DK |
1576 | |
1577 | /* Fancy dance to stay within two buffers */ | |
3d0518f4 | 1578 | de2 = dx_move_dirents(data1, data2, map + split, count - split, blocksize); |
af5bc92d | 1579 | de = dx_pack_dirents(data1, blocksize); |
b0336e8d DW |
1580 | de->rec_len = ext4_rec_len_to_disk(data1 + (blocksize - csum_size) - |
1581 | (char *) de, | |
3d0518f4 | 1582 | blocksize); |
b0336e8d DW |
1583 | de2->rec_len = ext4_rec_len_to_disk(data2 + (blocksize - csum_size) - |
1584 | (char *) de2, | |
3d0518f4 | 1585 | blocksize); |
b0336e8d DW |
1586 | if (csum_size) { |
1587 | t = EXT4_DIRENT_TAIL(data2, blocksize); | |
1588 | initialize_dirent_tail(t, blocksize); | |
1589 | ||
1590 | t = EXT4_DIRENT_TAIL(data1, blocksize); | |
1591 | initialize_dirent_tail(t, blocksize); | |
1592 | } | |
1593 | ||
617ba13b MC |
1594 | dxtrace(dx_show_leaf (hinfo, (struct ext4_dir_entry_2 *) data1, blocksize, 1)); |
1595 | dxtrace(dx_show_leaf (hinfo, (struct ext4_dir_entry_2 *) data2, blocksize, 1)); | |
ac27a0ec DK |
1596 | |
1597 | /* Which block gets the new entry? */ | |
f8b3b59d | 1598 | if (hinfo->hash >= hash2) { |
ac27a0ec DK |
1599 | swap(*bh, bh2); |
1600 | de = de2; | |
1601 | } | |
af5bc92d | 1602 | dx_insert_block(frame, hash2 + continued, newblock); |
b0336e8d | 1603 | err = ext4_handle_dirty_dirent_node(handle, dir, bh2); |
ac27a0ec DK |
1604 | if (err) |
1605 | goto journal_error; | |
dbe89444 | 1606 | err = ext4_handle_dirty_dx_node(handle, dir, frame->bh); |
ac27a0ec DK |
1607 | if (err) |
1608 | goto journal_error; | |
af5bc92d TT |
1609 | brelse(bh2); |
1610 | dxtrace(dx_show_index("frame", frame->entries)); | |
ac27a0ec | 1611 | return de; |
fedee54d DM |
1612 | |
1613 | journal_error: | |
1614 | brelse(*bh); | |
1615 | brelse(bh2); | |
1616 | *bh = NULL; | |
1617 | ext4_std_error(dir->i_sb, err); | |
f8b3b59d | 1618 | return ERR_PTR(err); |
ac27a0ec | 1619 | } |
ac27a0ec | 1620 | |
978fef91 TM |
1621 | int ext4_find_dest_de(struct inode *dir, struct inode *inode, |
1622 | struct buffer_head *bh, | |
1623 | void *buf, int buf_size, | |
1624 | const char *name, int namelen, | |
1625 | struct ext4_dir_entry_2 **dest_de) | |
1626 | { | |
1627 | struct ext4_dir_entry_2 *de; | |
1628 | unsigned short reclen = EXT4_DIR_REC_LEN(namelen); | |
1629 | int nlen, rlen; | |
1630 | unsigned int offset = 0; | |
1631 | char *top; | |
1632 | ||
1633 | de = (struct ext4_dir_entry_2 *)buf; | |
1634 | top = buf + buf_size - reclen; | |
1635 | while ((char *) de <= top) { | |
1636 | if (ext4_check_dir_entry(dir, NULL, de, bh, | |
1637 | buf, buf_size, offset)) | |
1638 | return -EIO; | |
1639 | if (ext4_match(namelen, name, de)) | |
1640 | return -EEXIST; | |
1641 | nlen = EXT4_DIR_REC_LEN(de->name_len); | |
1642 | rlen = ext4_rec_len_from_disk(de->rec_len, buf_size); | |
1643 | if ((de->inode ? rlen - nlen : rlen) >= reclen) | |
1644 | break; | |
1645 | de = (struct ext4_dir_entry_2 *)((char *)de + rlen); | |
1646 | offset += rlen; | |
1647 | } | |
1648 | if ((char *) de > top) | |
1649 | return -ENOSPC; | |
1650 | ||
1651 | *dest_de = de; | |
1652 | return 0; | |
1653 | } | |
1654 | ||
1655 | void ext4_insert_dentry(struct inode *inode, | |
1656 | struct ext4_dir_entry_2 *de, | |
1657 | int buf_size, | |
1658 | const char *name, int namelen) | |
1659 | { | |
1660 | ||
1661 | int nlen, rlen; | |
1662 | ||
1663 | nlen = EXT4_DIR_REC_LEN(de->name_len); | |
1664 | rlen = ext4_rec_len_from_disk(de->rec_len, buf_size); | |
1665 | if (de->inode) { | |
1666 | struct ext4_dir_entry_2 *de1 = | |
1667 | (struct ext4_dir_entry_2 *)((char *)de + nlen); | |
1668 | de1->rec_len = ext4_rec_len_to_disk(rlen - nlen, buf_size); | |
1669 | de->rec_len = ext4_rec_len_to_disk(nlen, buf_size); | |
1670 | de = de1; | |
1671 | } | |
1672 | de->file_type = EXT4_FT_UNKNOWN; | |
1673 | de->inode = cpu_to_le32(inode->i_ino); | |
1674 | ext4_set_de_type(inode->i_sb, de, inode->i_mode); | |
1675 | de->name_len = namelen; | |
1676 | memcpy(de->name, name, namelen); | |
1677 | } | |
ac27a0ec DK |
1678 | /* |
1679 | * Add a new entry into a directory (leaf) block. If de is non-NULL, | |
1680 | * it points to a directory entry which is guaranteed to be large | |
1681 | * enough for new directory entry. If de is NULL, then | |
1682 | * add_dirent_to_buf will attempt search the directory block for | |
1683 | * space. It will return -ENOSPC if no space is available, and -EIO | |
1684 | * and -EEXIST if directory entry already exists. | |
ac27a0ec DK |
1685 | */ |
1686 | static int add_dirent_to_buf(handle_t *handle, struct dentry *dentry, | |
617ba13b | 1687 | struct inode *inode, struct ext4_dir_entry_2 *de, |
af5bc92d | 1688 | struct buffer_head *bh) |
ac27a0ec DK |
1689 | { |
1690 | struct inode *dir = dentry->d_parent->d_inode; | |
1691 | const char *name = dentry->d_name.name; | |
1692 | int namelen = dentry->d_name.len; | |
3d0518f4 | 1693 | unsigned int blocksize = dir->i_sb->s_blocksize; |
b0336e8d | 1694 | int csum_size = 0; |
978fef91 | 1695 | int err; |
b0336e8d | 1696 | |
9aa5d32b | 1697 | if (ext4_has_metadata_csum(inode->i_sb)) |
b0336e8d | 1698 | csum_size = sizeof(struct ext4_dir_entry_tail); |
ac27a0ec | 1699 | |
ac27a0ec | 1700 | if (!de) { |
978fef91 TM |
1701 | err = ext4_find_dest_de(dir, inode, |
1702 | bh, bh->b_data, blocksize - csum_size, | |
1703 | name, namelen, &de); | |
1704 | if (err) | |
1705 | return err; | |
ac27a0ec DK |
1706 | } |
1707 | BUFFER_TRACE(bh, "get_write_access"); | |
617ba13b | 1708 | err = ext4_journal_get_write_access(handle, bh); |
ac27a0ec | 1709 | if (err) { |
617ba13b | 1710 | ext4_std_error(dir->i_sb, err); |
ac27a0ec DK |
1711 | return err; |
1712 | } | |
1713 | ||
1714 | /* By now the buffer is marked for journaling */ | |
978fef91 TM |
1715 | ext4_insert_dentry(inode, de, blocksize, name, namelen); |
1716 | ||
ac27a0ec DK |
1717 | /* |
1718 | * XXX shouldn't update any times until successful | |
1719 | * completion of syscall, but too many callers depend | |
1720 | * on this. | |
1721 | * | |
1722 | * XXX similarly, too many callers depend on | |
617ba13b | 1723 | * ext4_new_inode() setting the times, but error |
ac27a0ec DK |
1724 | * recovery deletes the inode, so the worst that can |
1725 | * happen is that the times are slightly out of date | |
1726 | * and/or different from the directory change time. | |
1727 | */ | |
ef7f3835 | 1728 | dir->i_mtime = dir->i_ctime = ext4_current_time(dir); |
617ba13b | 1729 | ext4_update_dx_flag(dir); |
ac27a0ec | 1730 | dir->i_version++; |
617ba13b | 1731 | ext4_mark_inode_dirty(handle, dir); |
0390131b | 1732 | BUFFER_TRACE(bh, "call ext4_handle_dirty_metadata"); |
b0336e8d | 1733 | err = ext4_handle_dirty_dirent_node(handle, dir, bh); |
ac27a0ec | 1734 | if (err) |
617ba13b | 1735 | ext4_std_error(dir->i_sb, err); |
ac27a0ec DK |
1736 | return 0; |
1737 | } | |
1738 | ||
ac27a0ec DK |
1739 | /* |
1740 | * This converts a one block unindexed directory to a 3 block indexed | |
1741 | * directory, and adds the dentry to the indexed directory. | |
1742 | */ | |
1743 | static int make_indexed_dir(handle_t *handle, struct dentry *dentry, | |
1744 | struct inode *inode, struct buffer_head *bh) | |
1745 | { | |
1746 | struct inode *dir = dentry->d_parent->d_inode; | |
1747 | const char *name = dentry->d_name.name; | |
1748 | int namelen = dentry->d_name.len; | |
1749 | struct buffer_head *bh2; | |
1750 | struct dx_root *root; | |
1751 | struct dx_frame frames[2], *frame; | |
1752 | struct dx_entry *entries; | |
617ba13b | 1753 | struct ext4_dir_entry_2 *de, *de2; |
b0336e8d | 1754 | struct ext4_dir_entry_tail *t; |
ac27a0ec DK |
1755 | char *data1, *top; |
1756 | unsigned len; | |
1757 | int retval; | |
1758 | unsigned blocksize; | |
1759 | struct dx_hash_info hinfo; | |
725d26d3 | 1760 | ext4_lblk_t block; |
ac27a0ec | 1761 | struct fake_dirent *fde; |
b0336e8d DW |
1762 | int csum_size = 0; |
1763 | ||
9aa5d32b | 1764 | if (ext4_has_metadata_csum(inode->i_sb)) |
b0336e8d | 1765 | csum_size = sizeof(struct ext4_dir_entry_tail); |
ac27a0ec DK |
1766 | |
1767 | blocksize = dir->i_sb->s_blocksize; | |
e6b8bc09 | 1768 | dxtrace(printk(KERN_DEBUG "Creating index: inode %lu\n", dir->i_ino)); |
5d601255 | 1769 | BUFFER_TRACE(bh, "get_write_access"); |
617ba13b | 1770 | retval = ext4_journal_get_write_access(handle, bh); |
ac27a0ec | 1771 | if (retval) { |
617ba13b | 1772 | ext4_std_error(dir->i_sb, retval); |
ac27a0ec DK |
1773 | brelse(bh); |
1774 | return retval; | |
1775 | } | |
1776 | root = (struct dx_root *) bh->b_data; | |
1777 | ||
e6b8bc09 TT |
1778 | /* The 0th block becomes the root, move the dirents out */ |
1779 | fde = &root->dotdot; | |
1780 | de = (struct ext4_dir_entry_2 *)((char *)fde + | |
3d0518f4 | 1781 | ext4_rec_len_from_disk(fde->rec_len, blocksize)); |
e6b8bc09 | 1782 | if ((char *) de >= (((char *) root) + blocksize)) { |
24676da4 | 1783 | EXT4_ERROR_INODE(dir, "invalid rec_len for '..'"); |
e6b8bc09 TT |
1784 | brelse(bh); |
1785 | return -EIO; | |
1786 | } | |
b0336e8d | 1787 | len = ((char *) root) + (blocksize - csum_size) - (char *) de; |
e6b8bc09 TT |
1788 | |
1789 | /* Allocate new block for the 0th block's dirents */ | |
0f70b406 TT |
1790 | bh2 = ext4_append(handle, dir, &block); |
1791 | if (IS_ERR(bh2)) { | |
ac27a0ec | 1792 | brelse(bh); |
0f70b406 | 1793 | return PTR_ERR(bh2); |
ac27a0ec | 1794 | } |
12e9b892 | 1795 | ext4_set_inode_flag(dir, EXT4_INODE_INDEX); |
ac27a0ec DK |
1796 | data1 = bh2->b_data; |
1797 | ||
ac27a0ec | 1798 | memcpy (data1, de, len); |
617ba13b | 1799 | de = (struct ext4_dir_entry_2 *) data1; |
ac27a0ec | 1800 | top = data1 + len; |
3d0518f4 | 1801 | while ((char *)(de2 = ext4_next_entry(de, blocksize)) < top) |
ac27a0ec | 1802 | de = de2; |
b0336e8d DW |
1803 | de->rec_len = ext4_rec_len_to_disk(data1 + (blocksize - csum_size) - |
1804 | (char *) de, | |
3d0518f4 | 1805 | blocksize); |
b0336e8d DW |
1806 | |
1807 | if (csum_size) { | |
1808 | t = EXT4_DIRENT_TAIL(data1, blocksize); | |
1809 | initialize_dirent_tail(t, blocksize); | |
1810 | } | |
1811 | ||
ac27a0ec | 1812 | /* Initialize the root; the dot dirents already exist */ |
617ba13b | 1813 | de = (struct ext4_dir_entry_2 *) (&root->dotdot); |
3d0518f4 WY |
1814 | de->rec_len = ext4_rec_len_to_disk(blocksize - EXT4_DIR_REC_LEN(2), |
1815 | blocksize); | |
ac27a0ec DK |
1816 | memset (&root->info, 0, sizeof(root->info)); |
1817 | root->info.info_length = sizeof(root->info); | |
617ba13b | 1818 | root->info.hash_version = EXT4_SB(dir->i_sb)->s_def_hash_version; |
ac27a0ec | 1819 | entries = root->entries; |
af5bc92d TT |
1820 | dx_set_block(entries, 1); |
1821 | dx_set_count(entries, 1); | |
1822 | dx_set_limit(entries, dx_root_limit(dir, sizeof(root->info))); | |
ac27a0ec DK |
1823 | |
1824 | /* Initialize as for dx_probe */ | |
1825 | hinfo.hash_version = root->info.hash_version; | |
f99b2589 TT |
1826 | if (hinfo.hash_version <= DX_HASH_TEA) |
1827 | hinfo.hash_version += EXT4_SB(dir->i_sb)->s_hash_unsigned; | |
617ba13b MC |
1828 | hinfo.seed = EXT4_SB(dir->i_sb)->s_hash_seed; |
1829 | ext4fs_dirhash(name, namelen, &hinfo); | |
6050d47a | 1830 | memset(frames, 0, sizeof(frames)); |
ac27a0ec DK |
1831 | frame = frames; |
1832 | frame->entries = entries; | |
1833 | frame->at = entries; | |
1834 | frame->bh = bh; | |
1835 | bh = bh2; | |
6976a6f2 | 1836 | |
6050d47a JK |
1837 | retval = ext4_handle_dirty_dx_node(handle, dir, frame->bh); |
1838 | if (retval) | |
1839 | goto out_frames; | |
1840 | retval = ext4_handle_dirty_dirent_node(handle, dir, bh); | |
1841 | if (retval) | |
1842 | goto out_frames; | |
6976a6f2 | 1843 | |
f8b3b59d TT |
1844 | de = do_split(handle,dir, &bh, frame, &hinfo); |
1845 | if (IS_ERR(de)) { | |
6050d47a JK |
1846 | retval = PTR_ERR(de); |
1847 | goto out_frames; | |
7ad8e4e6 JK |
1848 | } |
1849 | dx_release(frames); | |
ac27a0ec | 1850 | |
2de770a4 TT |
1851 | retval = add_dirent_to_buf(handle, dentry, inode, de, bh); |
1852 | brelse(bh); | |
1853 | return retval; | |
6050d47a JK |
1854 | out_frames: |
1855 | /* | |
1856 | * Even if the block split failed, we have to properly write | |
1857 | * out all the changes we did so far. Otherwise we can end up | |
1858 | * with corrupted filesystem. | |
1859 | */ | |
1860 | ext4_mark_inode_dirty(handle, dir); | |
1861 | dx_release(frames); | |
1862 | return retval; | |
ac27a0ec | 1863 | } |
ac27a0ec DK |
1864 | |
1865 | /* | |
617ba13b | 1866 | * ext4_add_entry() |
ac27a0ec DK |
1867 | * |
1868 | * adds a file entry to the specified directory, using the same | |
617ba13b | 1869 | * semantics as ext4_find_entry(). It returns NULL if it failed. |
ac27a0ec DK |
1870 | * |
1871 | * NOTE!! The inode part of 'de' is left at 0 - which means you | |
1872 | * may not sleep between calling this and putting something into | |
1873 | * the entry, as someone else might have used it while you slept. | |
1874 | */ | |
af5bc92d TT |
1875 | static int ext4_add_entry(handle_t *handle, struct dentry *dentry, |
1876 | struct inode *inode) | |
ac27a0ec DK |
1877 | { |
1878 | struct inode *dir = dentry->d_parent->d_inode; | |
e12fb972 | 1879 | struct buffer_head *bh = NULL; |
617ba13b | 1880 | struct ext4_dir_entry_2 *de; |
b0336e8d | 1881 | struct ext4_dir_entry_tail *t; |
af5bc92d | 1882 | struct super_block *sb; |
ac27a0ec | 1883 | int retval; |
ac27a0ec | 1884 | int dx_fallback=0; |
ac27a0ec | 1885 | unsigned blocksize; |
725d26d3 | 1886 | ext4_lblk_t block, blocks; |
b0336e8d DW |
1887 | int csum_size = 0; |
1888 | ||
9aa5d32b | 1889 | if (ext4_has_metadata_csum(inode->i_sb)) |
b0336e8d | 1890 | csum_size = sizeof(struct ext4_dir_entry_tail); |
ac27a0ec DK |
1891 | |
1892 | sb = dir->i_sb; | |
1893 | blocksize = sb->s_blocksize; | |
1894 | if (!dentry->d_name.len) | |
1895 | return -EINVAL; | |
3c47d541 TM |
1896 | |
1897 | if (ext4_has_inline_data(dir)) { | |
1898 | retval = ext4_try_add_inline_entry(handle, dentry, inode); | |
1899 | if (retval < 0) | |
1900 | return retval; | |
1901 | if (retval == 1) { | |
1902 | retval = 0; | |
e12fb972 | 1903 | goto out; |
3c47d541 TM |
1904 | } |
1905 | } | |
1906 | ||
ac27a0ec | 1907 | if (is_dx(dir)) { |
617ba13b | 1908 | retval = ext4_dx_add_entry(handle, dentry, inode); |
ac27a0ec | 1909 | if (!retval || (retval != ERR_BAD_DX_DIR)) |
e12fb972 | 1910 | goto out; |
12e9b892 | 1911 | ext4_clear_inode_flag(dir, EXT4_INODE_INDEX); |
ac27a0ec | 1912 | dx_fallback++; |
617ba13b | 1913 | ext4_mark_inode_dirty(handle, dir); |
ac27a0ec | 1914 | } |
ac27a0ec | 1915 | blocks = dir->i_size >> sb->s_blocksize_bits; |
498e5f24 | 1916 | for (block = 0; block < blocks; block++) { |
dc6982ff TT |
1917 | bh = ext4_read_dirblock(dir, block, DIRENT); |
1918 | if (IS_ERR(bh)) | |
1919 | return PTR_ERR(bh); | |
1920 | ||
ac27a0ec | 1921 | retval = add_dirent_to_buf(handle, dentry, inode, NULL, bh); |
e12fb972 LC |
1922 | if (retval != -ENOSPC) |
1923 | goto out; | |
ac27a0ec | 1924 | |
ac27a0ec | 1925 | if (blocks == 1 && !dx_fallback && |
e12fb972 LC |
1926 | EXT4_HAS_COMPAT_FEATURE(sb, EXT4_FEATURE_COMPAT_DIR_INDEX)) { |
1927 | retval = make_indexed_dir(handle, dentry, inode, bh); | |
1928 | bh = NULL; /* make_indexed_dir releases bh */ | |
1929 | goto out; | |
1930 | } | |
ac27a0ec DK |
1931 | brelse(bh); |
1932 | } | |
0f70b406 TT |
1933 | bh = ext4_append(handle, dir, &block); |
1934 | if (IS_ERR(bh)) | |
1935 | return PTR_ERR(bh); | |
617ba13b | 1936 | de = (struct ext4_dir_entry_2 *) bh->b_data; |
ac27a0ec | 1937 | de->inode = 0; |
b0336e8d DW |
1938 | de->rec_len = ext4_rec_len_to_disk(blocksize - csum_size, blocksize); |
1939 | ||
1940 | if (csum_size) { | |
1941 | t = EXT4_DIRENT_TAIL(bh->b_data, blocksize); | |
1942 | initialize_dirent_tail(t, blocksize); | |
1943 | } | |
1944 | ||
2de770a4 | 1945 | retval = add_dirent_to_buf(handle, dentry, inode, de, bh); |
e12fb972 | 1946 | out: |
2de770a4 | 1947 | brelse(bh); |
14ece102 FM |
1948 | if (retval == 0) |
1949 | ext4_set_inode_state(inode, EXT4_STATE_NEWENTRY); | |
2de770a4 | 1950 | return retval; |
ac27a0ec DK |
1951 | } |
1952 | ||
ac27a0ec DK |
1953 | /* |
1954 | * Returns 0 for success, or a negative error value | |
1955 | */ | |
617ba13b | 1956 | static int ext4_dx_add_entry(handle_t *handle, struct dentry *dentry, |
ac27a0ec DK |
1957 | struct inode *inode) |
1958 | { | |
1959 | struct dx_frame frames[2], *frame; | |
1960 | struct dx_entry *entries, *at; | |
1961 | struct dx_hash_info hinfo; | |
af5bc92d | 1962 | struct buffer_head *bh; |
ac27a0ec | 1963 | struct inode *dir = dentry->d_parent->d_inode; |
af5bc92d | 1964 | struct super_block *sb = dir->i_sb; |
617ba13b | 1965 | struct ext4_dir_entry_2 *de; |
ac27a0ec DK |
1966 | int err; |
1967 | ||
dd73b5d5 TT |
1968 | frame = dx_probe(&dentry->d_name, dir, &hinfo, frames); |
1969 | if (IS_ERR(frame)) | |
1970 | return PTR_ERR(frame); | |
ac27a0ec DK |
1971 | entries = frame->entries; |
1972 | at = frame->at; | |
dc6982ff TT |
1973 | bh = ext4_read_dirblock(dir, dx_get_block(frame->at), DIRENT); |
1974 | if (IS_ERR(bh)) { | |
1975 | err = PTR_ERR(bh); | |
1976 | bh = NULL; | |
ac27a0ec | 1977 | goto cleanup; |
6d1ab10e | 1978 | } |
ac27a0ec DK |
1979 | |
1980 | BUFFER_TRACE(bh, "get_write_access"); | |
617ba13b | 1981 | err = ext4_journal_get_write_access(handle, bh); |
ac27a0ec DK |
1982 | if (err) |
1983 | goto journal_error; | |
1984 | ||
1985 | err = add_dirent_to_buf(handle, dentry, inode, NULL, bh); | |
2de770a4 | 1986 | if (err != -ENOSPC) |
ac27a0ec | 1987 | goto cleanup; |
ac27a0ec DK |
1988 | |
1989 | /* Block full, should compress but for now just split */ | |
4776004f | 1990 | dxtrace(printk(KERN_DEBUG "using %u of %u node entries\n", |
ac27a0ec DK |
1991 | dx_get_count(entries), dx_get_limit(entries))); |
1992 | /* Need to split index? */ | |
1993 | if (dx_get_count(entries) == dx_get_limit(entries)) { | |
725d26d3 | 1994 | ext4_lblk_t newblock; |
ac27a0ec DK |
1995 | unsigned icount = dx_get_count(entries); |
1996 | int levels = frame - frames; | |
1997 | struct dx_entry *entries2; | |
1998 | struct dx_node *node2; | |
1999 | struct buffer_head *bh2; | |
2000 | ||
2001 | if (levels && (dx_get_count(frames->entries) == | |
2002 | dx_get_limit(frames->entries))) { | |
12062ddd | 2003 | ext4_warning(sb, "Directory index full!"); |
ac27a0ec DK |
2004 | err = -ENOSPC; |
2005 | goto cleanup; | |
2006 | } | |
0f70b406 TT |
2007 | bh2 = ext4_append(handle, dir, &newblock); |
2008 | if (IS_ERR(bh2)) { | |
2009 | err = PTR_ERR(bh2); | |
ac27a0ec | 2010 | goto cleanup; |
0f70b406 | 2011 | } |
ac27a0ec DK |
2012 | node2 = (struct dx_node *)(bh2->b_data); |
2013 | entries2 = node2->entries; | |
1f7bebb9 | 2014 | memset(&node2->fake, 0, sizeof(struct fake_dirent)); |
3d0518f4 WY |
2015 | node2->fake.rec_len = ext4_rec_len_to_disk(sb->s_blocksize, |
2016 | sb->s_blocksize); | |
ac27a0ec | 2017 | BUFFER_TRACE(frame->bh, "get_write_access"); |
617ba13b | 2018 | err = ext4_journal_get_write_access(handle, frame->bh); |
ac27a0ec DK |
2019 | if (err) |
2020 | goto journal_error; | |
2021 | if (levels) { | |
2022 | unsigned icount1 = icount/2, icount2 = icount - icount1; | |
2023 | unsigned hash2 = dx_get_hash(entries + icount1); | |
4776004f TT |
2024 | dxtrace(printk(KERN_DEBUG "Split index %i/%i\n", |
2025 | icount1, icount2)); | |
ac27a0ec DK |
2026 | |
2027 | BUFFER_TRACE(frame->bh, "get_write_access"); /* index root */ | |
617ba13b | 2028 | err = ext4_journal_get_write_access(handle, |
ac27a0ec DK |
2029 | frames[0].bh); |
2030 | if (err) | |
2031 | goto journal_error; | |
2032 | ||
af5bc92d TT |
2033 | memcpy((char *) entries2, (char *) (entries + icount1), |
2034 | icount2 * sizeof(struct dx_entry)); | |
2035 | dx_set_count(entries, icount1); | |
2036 | dx_set_count(entries2, icount2); | |
2037 | dx_set_limit(entries2, dx_node_limit(dir)); | |
ac27a0ec DK |
2038 | |
2039 | /* Which index block gets the new entry? */ | |
2040 | if (at - entries >= icount1) { | |
2041 | frame->at = at = at - entries - icount1 + entries2; | |
2042 | frame->entries = entries = entries2; | |
2043 | swap(frame->bh, bh2); | |
2044 | } | |
af5bc92d TT |
2045 | dx_insert_block(frames + 0, hash2, newblock); |
2046 | dxtrace(dx_show_index("node", frames[1].entries)); | |
2047 | dxtrace(dx_show_index("node", | |
ac27a0ec | 2048 | ((struct dx_node *) bh2->b_data)->entries)); |
dbe89444 | 2049 | err = ext4_handle_dirty_dx_node(handle, dir, bh2); |
ac27a0ec DK |
2050 | if (err) |
2051 | goto journal_error; | |
2052 | brelse (bh2); | |
2053 | } else { | |
4776004f TT |
2054 | dxtrace(printk(KERN_DEBUG |
2055 | "Creating second level index...\n")); | |
ac27a0ec DK |
2056 | memcpy((char *) entries2, (char *) entries, |
2057 | icount * sizeof(struct dx_entry)); | |
2058 | dx_set_limit(entries2, dx_node_limit(dir)); | |
2059 | ||
2060 | /* Set up root */ | |
2061 | dx_set_count(entries, 1); | |
2062 | dx_set_block(entries + 0, newblock); | |
2063 | ((struct dx_root *) frames[0].bh->b_data)->info.indirect_levels = 1; | |
2064 | ||
2065 | /* Add new access path frame */ | |
2066 | frame = frames + 1; | |
2067 | frame->at = at = at - entries + entries2; | |
2068 | frame->entries = entries = entries2; | |
2069 | frame->bh = bh2; | |
617ba13b | 2070 | err = ext4_journal_get_write_access(handle, |
ac27a0ec DK |
2071 | frame->bh); |
2072 | if (err) | |
2073 | goto journal_error; | |
2074 | } | |
dbe89444 | 2075 | err = ext4_handle_dirty_dx_node(handle, dir, frames[0].bh); |
b4097142 TT |
2076 | if (err) { |
2077 | ext4_std_error(inode->i_sb, err); | |
2078 | goto cleanup; | |
2079 | } | |
ac27a0ec | 2080 | } |
f8b3b59d TT |
2081 | de = do_split(handle, dir, &bh, frame, &hinfo); |
2082 | if (IS_ERR(de)) { | |
2083 | err = PTR_ERR(de); | |
ac27a0ec | 2084 | goto cleanup; |
f8b3b59d | 2085 | } |
ac27a0ec | 2086 | err = add_dirent_to_buf(handle, dentry, inode, de, bh); |
ac27a0ec DK |
2087 | goto cleanup; |
2088 | ||
2089 | journal_error: | |
617ba13b | 2090 | ext4_std_error(dir->i_sb, err); |
ac27a0ec | 2091 | cleanup: |
b1deefc9 | 2092 | brelse(bh); |
ac27a0ec DK |
2093 | dx_release(frames); |
2094 | return err; | |
2095 | } | |
ac27a0ec DK |
2096 | |
2097 | /* | |
05019a9e TM |
2098 | * ext4_generic_delete_entry deletes a directory entry by merging it |
2099 | * with the previous entry | |
ac27a0ec | 2100 | */ |
05019a9e TM |
2101 | int ext4_generic_delete_entry(handle_t *handle, |
2102 | struct inode *dir, | |
2103 | struct ext4_dir_entry_2 *de_del, | |
2104 | struct buffer_head *bh, | |
2105 | void *entry_buf, | |
2106 | int buf_size, | |
2107 | int csum_size) | |
ac27a0ec | 2108 | { |
af5bc92d | 2109 | struct ext4_dir_entry_2 *de, *pde; |
3d0518f4 | 2110 | unsigned int blocksize = dir->i_sb->s_blocksize; |
05019a9e | 2111 | int i; |
b0336e8d | 2112 | |
ac27a0ec DK |
2113 | i = 0; |
2114 | pde = NULL; | |
05019a9e TM |
2115 | de = (struct ext4_dir_entry_2 *)entry_buf; |
2116 | while (i < buf_size - csum_size) { | |
226ba972 TM |
2117 | if (ext4_check_dir_entry(dir, NULL, de, bh, |
2118 | bh->b_data, bh->b_size, i)) | |
ac27a0ec DK |
2119 | return -EIO; |
2120 | if (de == de_del) { | |
ac27a0ec | 2121 | if (pde) |
a72d7f83 | 2122 | pde->rec_len = ext4_rec_len_to_disk( |
3d0518f4 WY |
2123 | ext4_rec_len_from_disk(pde->rec_len, |
2124 | blocksize) + | |
2125 | ext4_rec_len_from_disk(de->rec_len, | |
2126 | blocksize), | |
2127 | blocksize); | |
ac27a0ec DK |
2128 | else |
2129 | de->inode = 0; | |
2130 | dir->i_version++; | |
ac27a0ec DK |
2131 | return 0; |
2132 | } | |
3d0518f4 | 2133 | i += ext4_rec_len_from_disk(de->rec_len, blocksize); |
ac27a0ec | 2134 | pde = de; |
3d0518f4 | 2135 | de = ext4_next_entry(de, blocksize); |
ac27a0ec DK |
2136 | } |
2137 | return -ENOENT; | |
2138 | } | |
2139 | ||
05019a9e TM |
2140 | static int ext4_delete_entry(handle_t *handle, |
2141 | struct inode *dir, | |
2142 | struct ext4_dir_entry_2 *de_del, | |
2143 | struct buffer_head *bh) | |
2144 | { | |
2145 | int err, csum_size = 0; | |
2146 | ||
9f40fe54 TM |
2147 | if (ext4_has_inline_data(dir)) { |
2148 | int has_inline_data = 1; | |
2149 | err = ext4_delete_inline_entry(handle, dir, de_del, bh, | |
2150 | &has_inline_data); | |
2151 | if (has_inline_data) | |
2152 | return err; | |
2153 | } | |
2154 | ||
9aa5d32b | 2155 | if (ext4_has_metadata_csum(dir->i_sb)) |
05019a9e TM |
2156 | csum_size = sizeof(struct ext4_dir_entry_tail); |
2157 | ||
2158 | BUFFER_TRACE(bh, "get_write_access"); | |
2159 | err = ext4_journal_get_write_access(handle, bh); | |
2160 | if (unlikely(err)) | |
2161 | goto out; | |
2162 | ||
2163 | err = ext4_generic_delete_entry(handle, dir, de_del, | |
2164 | bh, bh->b_data, | |
2165 | dir->i_sb->s_blocksize, csum_size); | |
2166 | if (err) | |
2167 | goto out; | |
2168 | ||
2169 | BUFFER_TRACE(bh, "call ext4_handle_dirty_metadata"); | |
2170 | err = ext4_handle_dirty_dirent_node(handle, dir, bh); | |
2171 | if (unlikely(err)) | |
2172 | goto out; | |
2173 | ||
2174 | return 0; | |
2175 | out: | |
2176 | if (err != -ENOENT) | |
2177 | ext4_std_error(dir->i_sb, err); | |
2178 | return err; | |
2179 | } | |
2180 | ||
f8628a14 AD |
2181 | /* |
2182 | * DIR_NLINK feature is set if 1) nlinks > EXT4_LINK_MAX or 2) nlinks == 2, | |
2183 | * since this indicates that nlinks count was previously 1. | |
2184 | */ | |
2185 | static void ext4_inc_count(handle_t *handle, struct inode *inode) | |
2186 | { | |
2187 | inc_nlink(inode); | |
2188 | if (is_dx(inode) && inode->i_nlink > 1) { | |
2189 | /* limit is 16-bit i_links_count */ | |
2190 | if (inode->i_nlink >= EXT4_LINK_MAX || inode->i_nlink == 2) { | |
bfe86848 | 2191 | set_nlink(inode, 1); |
f8628a14 AD |
2192 | EXT4_SET_RO_COMPAT_FEATURE(inode->i_sb, |
2193 | EXT4_FEATURE_RO_COMPAT_DIR_NLINK); | |
2194 | } | |
2195 | } | |
2196 | } | |
2197 | ||
2198 | /* | |
2199 | * If a directory had nlink == 1, then we should let it be 1. This indicates | |
2200 | * directory has >EXT4_LINK_MAX subdirs. | |
2201 | */ | |
2202 | static void ext4_dec_count(handle_t *handle, struct inode *inode) | |
2203 | { | |
909a4cf1 AD |
2204 | if (!S_ISDIR(inode->i_mode) || inode->i_nlink > 2) |
2205 | drop_nlink(inode); | |
f8628a14 AD |
2206 | } |
2207 | ||
2208 | ||
617ba13b | 2209 | static int ext4_add_nondir(handle_t *handle, |
ac27a0ec DK |
2210 | struct dentry *dentry, struct inode *inode) |
2211 | { | |
617ba13b | 2212 | int err = ext4_add_entry(handle, dentry, inode); |
ac27a0ec | 2213 | if (!err) { |
617ba13b | 2214 | ext4_mark_inode_dirty(handle, inode); |
6b38e842 | 2215 | unlock_new_inode(inode); |
8fc37ec5 | 2216 | d_instantiate(dentry, inode); |
ac27a0ec DK |
2217 | return 0; |
2218 | } | |
731b9a54 | 2219 | drop_nlink(inode); |
6b38e842 | 2220 | unlock_new_inode(inode); |
ac27a0ec DK |
2221 | iput(inode); |
2222 | return err; | |
2223 | } | |
2224 | ||
2225 | /* | |
2226 | * By the time this is called, we already have created | |
2227 | * the directory cache entry for the new file, but it | |
2228 | * is so far negative - it has no inode. | |
2229 | * | |
2230 | * If the create succeeds, we fill in the inode information | |
2231 | * with d_instantiate(). | |
2232 | */ | |
4acdaf27 | 2233 | static int ext4_create(struct inode *dir, struct dentry *dentry, umode_t mode, |
ebfc3b49 | 2234 | bool excl) |
ac27a0ec DK |
2235 | { |
2236 | handle_t *handle; | |
af5bc92d | 2237 | struct inode *inode; |
1139575a | 2238 | int err, credits, retries = 0; |
ac27a0ec | 2239 | |
871a2931 | 2240 | dquot_initialize(dir); |
907f4554 | 2241 | |
1139575a | 2242 | credits = (EXT4_DATA_TRANS_BLOCKS(dir->i_sb) + |
eb9cc7e1 | 2243 | EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3); |
ac27a0ec | 2244 | retry: |
1139575a TT |
2245 | inode = ext4_new_inode_start_handle(dir, mode, &dentry->d_name, 0, |
2246 | NULL, EXT4_HT_DIR, credits); | |
2247 | handle = ext4_journal_current_handle(); | |
ac27a0ec DK |
2248 | err = PTR_ERR(inode); |
2249 | if (!IS_ERR(inode)) { | |
617ba13b | 2250 | inode->i_op = &ext4_file_inode_operations; |
923ae0ff RZ |
2251 | if (test_opt(inode->i_sb, DAX)) |
2252 | inode->i_fop = &ext4_dax_file_operations; | |
2253 | else | |
2254 | inode->i_fop = &ext4_file_operations; | |
617ba13b MC |
2255 | ext4_set_aops(inode); |
2256 | err = ext4_add_nondir(handle, dentry, inode); | |
1139575a TT |
2257 | if (!err && IS_DIRSYNC(dir)) |
2258 | ext4_handle_sync(handle); | |
ac27a0ec | 2259 | } |
1139575a TT |
2260 | if (handle) |
2261 | ext4_journal_stop(handle); | |
617ba13b | 2262 | if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries)) |
ac27a0ec DK |
2263 | goto retry; |
2264 | return err; | |
2265 | } | |
2266 | ||
af5bc92d | 2267 | static int ext4_mknod(struct inode *dir, struct dentry *dentry, |
1a67aafb | 2268 | umode_t mode, dev_t rdev) |
ac27a0ec DK |
2269 | { |
2270 | handle_t *handle; | |
2271 | struct inode *inode; | |
1139575a | 2272 | int err, credits, retries = 0; |
ac27a0ec DK |
2273 | |
2274 | if (!new_valid_dev(rdev)) | |
2275 | return -EINVAL; | |
2276 | ||
871a2931 | 2277 | dquot_initialize(dir); |
907f4554 | 2278 | |
1139575a | 2279 | credits = (EXT4_DATA_TRANS_BLOCKS(dir->i_sb) + |
eb9cc7e1 | 2280 | EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3); |
ac27a0ec | 2281 | retry: |
1139575a TT |
2282 | inode = ext4_new_inode_start_handle(dir, mode, &dentry->d_name, 0, |
2283 | NULL, EXT4_HT_DIR, credits); | |
2284 | handle = ext4_journal_current_handle(); | |
ac27a0ec DK |
2285 | err = PTR_ERR(inode); |
2286 | if (!IS_ERR(inode)) { | |
2287 | init_special_inode(inode, inode->i_mode, rdev); | |
617ba13b | 2288 | inode->i_op = &ext4_special_inode_operations; |
617ba13b | 2289 | err = ext4_add_nondir(handle, dentry, inode); |
1139575a TT |
2290 | if (!err && IS_DIRSYNC(dir)) |
2291 | ext4_handle_sync(handle); | |
ac27a0ec | 2292 | } |
1139575a TT |
2293 | if (handle) |
2294 | ext4_journal_stop(handle); | |
617ba13b | 2295 | if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries)) |
ac27a0ec DK |
2296 | goto retry; |
2297 | return err; | |
2298 | } | |
2299 | ||
af51a2ac AV |
2300 | static int ext4_tmpfile(struct inode *dir, struct dentry *dentry, umode_t mode) |
2301 | { | |
2302 | handle_t *handle; | |
2303 | struct inode *inode; | |
2304 | int err, retries = 0; | |
2305 | ||
2306 | dquot_initialize(dir); | |
2307 | ||
2308 | retry: | |
2309 | inode = ext4_new_inode_start_handle(dir, mode, | |
2310 | NULL, 0, NULL, | |
2311 | EXT4_HT_DIR, | |
2312 | EXT4_MAXQUOTAS_INIT_BLOCKS(dir->i_sb) + | |
2313 | 4 + EXT4_XATTR_TRANS_BLOCKS); | |
2314 | handle = ext4_journal_current_handle(); | |
2315 | err = PTR_ERR(inode); | |
2316 | if (!IS_ERR(inode)) { | |
2317 | inode->i_op = &ext4_file_inode_operations; | |
923ae0ff RZ |
2318 | if (test_opt(inode->i_sb, DAX)) |
2319 | inode->i_fop = &ext4_dax_file_operations; | |
2320 | else | |
2321 | inode->i_fop = &ext4_file_operations; | |
af51a2ac | 2322 | ext4_set_aops(inode); |
e94bd349 | 2323 | d_tmpfile(dentry, inode); |
af51a2ac AV |
2324 | err = ext4_orphan_add(handle, inode); |
2325 | if (err) | |
43ae9e3f | 2326 | goto err_unlock_inode; |
af51a2ac | 2327 | mark_inode_dirty(inode); |
af51a2ac AV |
2328 | unlock_new_inode(inode); |
2329 | } | |
2330 | if (handle) | |
2331 | ext4_journal_stop(handle); | |
2332 | if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries)) | |
2333 | goto retry; | |
2334 | return err; | |
43ae9e3f | 2335 | err_unlock_inode: |
af51a2ac AV |
2336 | ext4_journal_stop(handle); |
2337 | unlock_new_inode(inode); | |
af51a2ac AV |
2338 | return err; |
2339 | } | |
2340 | ||
a774f9c2 TM |
2341 | struct ext4_dir_entry_2 *ext4_init_dot_dotdot(struct inode *inode, |
2342 | struct ext4_dir_entry_2 *de, | |
2343 | int blocksize, int csum_size, | |
2344 | unsigned int parent_ino, int dotdot_real_len) | |
2345 | { | |
2346 | de->inode = cpu_to_le32(inode->i_ino); | |
2347 | de->name_len = 1; | |
2348 | de->rec_len = ext4_rec_len_to_disk(EXT4_DIR_REC_LEN(de->name_len), | |
2349 | blocksize); | |
2350 | strcpy(de->name, "."); | |
2351 | ext4_set_de_type(inode->i_sb, de, S_IFDIR); | |
2352 | ||
2353 | de = ext4_next_entry(de, blocksize); | |
2354 | de->inode = cpu_to_le32(parent_ino); | |
2355 | de->name_len = 2; | |
2356 | if (!dotdot_real_len) | |
2357 | de->rec_len = ext4_rec_len_to_disk(blocksize - | |
2358 | (csum_size + EXT4_DIR_REC_LEN(1)), | |
2359 | blocksize); | |
2360 | else | |
2361 | de->rec_len = ext4_rec_len_to_disk( | |
2362 | EXT4_DIR_REC_LEN(de->name_len), blocksize); | |
2363 | strcpy(de->name, ".."); | |
2364 | ext4_set_de_type(inode->i_sb, de, S_IFDIR); | |
2365 | ||
2366 | return ext4_next_entry(de, blocksize); | |
2367 | } | |
2368 | ||
2369 | static int ext4_init_new_dir(handle_t *handle, struct inode *dir, | |
2370 | struct inode *inode) | |
ac27a0ec | 2371 | { |
dabd991f | 2372 | struct buffer_head *dir_block = NULL; |
af5bc92d | 2373 | struct ext4_dir_entry_2 *de; |
b0336e8d | 2374 | struct ext4_dir_entry_tail *t; |
dc6982ff | 2375 | ext4_lblk_t block = 0; |
3d0518f4 | 2376 | unsigned int blocksize = dir->i_sb->s_blocksize; |
b0336e8d | 2377 | int csum_size = 0; |
a774f9c2 | 2378 | int err; |
ac27a0ec | 2379 | |
9aa5d32b | 2380 | if (ext4_has_metadata_csum(dir->i_sb)) |
b0336e8d DW |
2381 | csum_size = sizeof(struct ext4_dir_entry_tail); |
2382 | ||
3c47d541 TM |
2383 | if (ext4_test_inode_state(inode, EXT4_STATE_MAY_INLINE_DATA)) { |
2384 | err = ext4_try_create_inline_dir(handle, dir, inode); | |
2385 | if (err < 0 && err != -ENOSPC) | |
2386 | goto out; | |
2387 | if (!err) | |
2388 | goto out; | |
2389 | } | |
2390 | ||
dc6982ff | 2391 | inode->i_size = 0; |
0f70b406 TT |
2392 | dir_block = ext4_append(handle, inode, &block); |
2393 | if (IS_ERR(dir_block)) | |
2394 | return PTR_ERR(dir_block); | |
a774f9c2 TM |
2395 | de = (struct ext4_dir_entry_2 *)dir_block->b_data; |
2396 | ext4_init_dot_dotdot(inode, de, blocksize, csum_size, dir->i_ino, 0); | |
2397 | set_nlink(inode, 2); | |
2398 | if (csum_size) { | |
2399 | t = EXT4_DIRENT_TAIL(dir_block->b_data, blocksize); | |
2400 | initialize_dirent_tail(t, blocksize); | |
2401 | } | |
2402 | ||
2403 | BUFFER_TRACE(dir_block, "call ext4_handle_dirty_metadata"); | |
2404 | err = ext4_handle_dirty_dirent_node(handle, inode, dir_block); | |
2405 | if (err) | |
2406 | goto out; | |
2407 | set_buffer_verified(dir_block); | |
2408 | out: | |
2409 | brelse(dir_block); | |
2410 | return err; | |
2411 | } | |
2412 | ||
2413 | static int ext4_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode) | |
2414 | { | |
2415 | handle_t *handle; | |
2416 | struct inode *inode; | |
1139575a | 2417 | int err, credits, retries = 0; |
a774f9c2 | 2418 | |
f8628a14 | 2419 | if (EXT4_DIR_LINK_MAX(dir)) |
ac27a0ec DK |
2420 | return -EMLINK; |
2421 | ||
871a2931 | 2422 | dquot_initialize(dir); |
907f4554 | 2423 | |
1139575a | 2424 | credits = (EXT4_DATA_TRANS_BLOCKS(dir->i_sb) + |
eb9cc7e1 | 2425 | EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3); |
ac27a0ec | 2426 | retry: |
1139575a TT |
2427 | inode = ext4_new_inode_start_handle(dir, S_IFDIR | mode, |
2428 | &dentry->d_name, | |
2429 | 0, NULL, EXT4_HT_DIR, credits); | |
2430 | handle = ext4_journal_current_handle(); | |
ac27a0ec DK |
2431 | err = PTR_ERR(inode); |
2432 | if (IS_ERR(inode)) | |
2433 | goto out_stop; | |
2434 | ||
617ba13b MC |
2435 | inode->i_op = &ext4_dir_inode_operations; |
2436 | inode->i_fop = &ext4_dir_operations; | |
a774f9c2 | 2437 | err = ext4_init_new_dir(handle, dir, inode); |
dabd991f NK |
2438 | if (err) |
2439 | goto out_clear_inode; | |
2440 | err = ext4_mark_inode_dirty(handle, inode); | |
2441 | if (!err) | |
2442 | err = ext4_add_entry(handle, dentry, inode); | |
ac27a0ec | 2443 | if (err) { |
4cdeed86 AK |
2444 | out_clear_inode: |
2445 | clear_nlink(inode); | |
6b38e842 | 2446 | unlock_new_inode(inode); |
617ba13b | 2447 | ext4_mark_inode_dirty(handle, inode); |
af5bc92d | 2448 | iput(inode); |
ac27a0ec DK |
2449 | goto out_stop; |
2450 | } | |
f8628a14 | 2451 | ext4_inc_count(handle, dir); |
617ba13b | 2452 | ext4_update_dx_flag(dir); |
dabd991f NK |
2453 | err = ext4_mark_inode_dirty(handle, dir); |
2454 | if (err) | |
2455 | goto out_clear_inode; | |
6b38e842 | 2456 | unlock_new_inode(inode); |
8fc37ec5 | 2457 | d_instantiate(dentry, inode); |
1139575a TT |
2458 | if (IS_DIRSYNC(dir)) |
2459 | ext4_handle_sync(handle); | |
2460 | ||
ac27a0ec | 2461 | out_stop: |
1139575a TT |
2462 | if (handle) |
2463 | ext4_journal_stop(handle); | |
617ba13b | 2464 | if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries)) |
ac27a0ec DK |
2465 | goto retry; |
2466 | return err; | |
2467 | } | |
2468 | ||
2469 | /* | |
2470 | * routine to check that the specified directory is empty (for rmdir) | |
2471 | */ | |
e875a2dd | 2472 | int ext4_empty_dir(struct inode *inode) |
ac27a0ec | 2473 | { |
498e5f24 | 2474 | unsigned int offset; |
af5bc92d TT |
2475 | struct buffer_head *bh; |
2476 | struct ext4_dir_entry_2 *de, *de1; | |
2477 | struct super_block *sb; | |
ac27a0ec DK |
2478 | int err = 0; |
2479 | ||
61f86638 TM |
2480 | if (ext4_has_inline_data(inode)) { |
2481 | int has_inline_data = 1; | |
2482 | ||
2483 | err = empty_inline_dir(inode, &has_inline_data); | |
2484 | if (has_inline_data) | |
2485 | return err; | |
2486 | } | |
2487 | ||
ac27a0ec | 2488 | sb = inode->i_sb; |
dc6982ff TT |
2489 | if (inode->i_size < EXT4_DIR_REC_LEN(1) + EXT4_DIR_REC_LEN(2)) { |
2490 | EXT4_ERROR_INODE(inode, "invalid size"); | |
ac27a0ec DK |
2491 | return 1; |
2492 | } | |
dc6982ff TT |
2493 | bh = ext4_read_dirblock(inode, 0, EITHER); |
2494 | if (IS_ERR(bh)) | |
2495 | return 1; | |
2496 | ||
617ba13b | 2497 | de = (struct ext4_dir_entry_2 *) bh->b_data; |
3d0518f4 | 2498 | de1 = ext4_next_entry(de, sb->s_blocksize); |
ac27a0ec DK |
2499 | if (le32_to_cpu(de->inode) != inode->i_ino || |
2500 | !le32_to_cpu(de1->inode) || | |
af5bc92d TT |
2501 | strcmp(".", de->name) || |
2502 | strcmp("..", de1->name)) { | |
12062ddd | 2503 | ext4_warning(inode->i_sb, |
af5bc92d TT |
2504 | "bad directory (dir #%lu) - no `.' or `..'", |
2505 | inode->i_ino); | |
2506 | brelse(bh); | |
ac27a0ec DK |
2507 | return 1; |
2508 | } | |
3d0518f4 WY |
2509 | offset = ext4_rec_len_from_disk(de->rec_len, sb->s_blocksize) + |
2510 | ext4_rec_len_from_disk(de1->rec_len, sb->s_blocksize); | |
2511 | de = ext4_next_entry(de1, sb->s_blocksize); | |
af5bc92d | 2512 | while (offset < inode->i_size) { |
236f5ecb | 2513 | if ((void *) de >= (void *) (bh->b_data+sb->s_blocksize)) { |
24676da4 | 2514 | unsigned int lblock; |
ac27a0ec | 2515 | err = 0; |
af5bc92d | 2516 | brelse(bh); |
24676da4 | 2517 | lblock = offset >> EXT4_BLOCK_SIZE_BITS(sb); |
dc6982ff TT |
2518 | bh = ext4_read_dirblock(inode, lblock, EITHER); |
2519 | if (IS_ERR(bh)) | |
2520 | return 1; | |
617ba13b | 2521 | de = (struct ext4_dir_entry_2 *) bh->b_data; |
ac27a0ec | 2522 | } |
226ba972 TM |
2523 | if (ext4_check_dir_entry(inode, NULL, de, bh, |
2524 | bh->b_data, bh->b_size, offset)) { | |
617ba13b | 2525 | de = (struct ext4_dir_entry_2 *)(bh->b_data + |
ac27a0ec DK |
2526 | sb->s_blocksize); |
2527 | offset = (offset | (sb->s_blocksize - 1)) + 1; | |
2528 | continue; | |
2529 | } | |
2530 | if (le32_to_cpu(de->inode)) { | |
af5bc92d | 2531 | brelse(bh); |
ac27a0ec DK |
2532 | return 0; |
2533 | } | |
3d0518f4 WY |
2534 | offset += ext4_rec_len_from_disk(de->rec_len, sb->s_blocksize); |
2535 | de = ext4_next_entry(de, sb->s_blocksize); | |
ac27a0ec | 2536 | } |
af5bc92d | 2537 | brelse(bh); |
ac27a0ec DK |
2538 | return 1; |
2539 | } | |
2540 | ||
d745a8c2 JK |
2541 | /* |
2542 | * ext4_orphan_add() links an unlinked or truncated inode into a list of | |
ac27a0ec DK |
2543 | * such inodes, starting at the superblock, in case we crash before the |
2544 | * file is closed/deleted, or in case the inode truncate spans multiple | |
2545 | * transactions and the last transaction is not recovered after a crash. | |
2546 | * | |
2547 | * At filesystem recovery time, we walk this list deleting unlinked | |
617ba13b | 2548 | * inodes and truncating linked inodes in ext4_orphan_cleanup(). |
d745a8c2 JK |
2549 | * |
2550 | * Orphan list manipulation functions must be called under i_mutex unless | |
2551 | * we are just creating the inode or deleting it. | |
ac27a0ec | 2552 | */ |
617ba13b | 2553 | int ext4_orphan_add(handle_t *handle, struct inode *inode) |
ac27a0ec DK |
2554 | { |
2555 | struct super_block *sb = inode->i_sb; | |
cd2c080c | 2556 | struct ext4_sb_info *sbi = EXT4_SB(sb); |
617ba13b | 2557 | struct ext4_iloc iloc; |
ac27a0ec | 2558 | int err = 0, rc; |
d745a8c2 | 2559 | bool dirty = false; |
ac27a0ec | 2560 | |
e2bfb088 | 2561 | if (!sbi->s_journal || is_bad_inode(inode)) |
0390131b FM |
2562 | return 0; |
2563 | ||
d745a8c2 JK |
2564 | WARN_ON_ONCE(!(inode->i_state & (I_NEW | I_FREEING)) && |
2565 | !mutex_is_locked(&inode->i_mutex)); | |
2566 | /* | |
2567 | * Exit early if inode already is on orphan list. This is a big speedup | |
2568 | * since we don't have to contend on the global s_orphan_lock. | |
2569 | */ | |
617ba13b | 2570 | if (!list_empty(&EXT4_I(inode)->i_orphan)) |
d745a8c2 | 2571 | return 0; |
ac27a0ec | 2572 | |
afb86178 LC |
2573 | /* |
2574 | * Orphan handling is only valid for files with data blocks | |
2575 | * being truncated, or files being unlinked. Note that we either | |
2576 | * hold i_mutex, or the inode can not be referenced from outside, | |
2577 | * so i_nlink should not be bumped due to race | |
ac27a0ec | 2578 | */ |
af5bc92d TT |
2579 | J_ASSERT((S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) || |
2580 | S_ISLNK(inode->i_mode)) || inode->i_nlink == 0); | |
ac27a0ec | 2581 | |
cd2c080c JK |
2582 | BUFFER_TRACE(sbi->s_sbh, "get_write_access"); |
2583 | err = ext4_journal_get_write_access(handle, sbi->s_sbh); | |
ac27a0ec | 2584 | if (err) |
d745a8c2 | 2585 | goto out; |
ac27a0ec | 2586 | |
617ba13b | 2587 | err = ext4_reserve_inode_write(handle, inode, &iloc); |
ac27a0ec | 2588 | if (err) |
d745a8c2 JK |
2589 | goto out; |
2590 | ||
2591 | mutex_lock(&sbi->s_orphan_lock); | |
6e3617e5 DM |
2592 | /* |
2593 | * Due to previous errors inode may be already a part of on-disk | |
2594 | * orphan list. If so skip on-disk list modification. | |
2595 | */ | |
d745a8c2 JK |
2596 | if (!NEXT_ORPHAN(inode) || NEXT_ORPHAN(inode) > |
2597 | (le32_to_cpu(sbi->s_es->s_inodes_count))) { | |
2598 | /* Insert this inode at the head of the on-disk orphan list */ | |
2599 | NEXT_ORPHAN(inode) = le32_to_cpu(sbi->s_es->s_last_orphan); | |
2600 | sbi->s_es->s_last_orphan = cpu_to_le32(inode->i_ino); | |
2601 | dirty = true; | |
2602 | } | |
2603 | list_add(&EXT4_I(inode)->i_orphan, &sbi->s_orphan); | |
2604 | mutex_unlock(&sbi->s_orphan_lock); | |
ac27a0ec | 2605 | |
d745a8c2 JK |
2606 | if (dirty) { |
2607 | err = ext4_handle_dirty_super(handle, sb); | |
2608 | rc = ext4_mark_iloc_dirty(handle, inode, &iloc); | |
2609 | if (!err) | |
2610 | err = rc; | |
2611 | if (err) { | |
2612 | /* | |
2613 | * We have to remove inode from in-memory list if | |
2614 | * addition to on disk orphan list failed. Stray orphan | |
2615 | * list entries can cause panics at unmount time. | |
2616 | */ | |
2617 | mutex_lock(&sbi->s_orphan_lock); | |
2618 | list_del(&EXT4_I(inode)->i_orphan); | |
2619 | mutex_unlock(&sbi->s_orphan_lock); | |
2620 | } | |
2621 | } | |
ac27a0ec DK |
2622 | jbd_debug(4, "superblock will point to %lu\n", inode->i_ino); |
2623 | jbd_debug(4, "orphan inode %lu will point to %d\n", | |
2624 | inode->i_ino, NEXT_ORPHAN(inode)); | |
d745a8c2 | 2625 | out: |
cd2c080c | 2626 | ext4_std_error(sb, err); |
ac27a0ec DK |
2627 | return err; |
2628 | } | |
2629 | ||
2630 | /* | |
617ba13b | 2631 | * ext4_orphan_del() removes an unlinked or truncated inode from the list |
ac27a0ec DK |
2632 | * of such inodes stored on disk, because it is finally being cleaned up. |
2633 | */ | |
617ba13b | 2634 | int ext4_orphan_del(handle_t *handle, struct inode *inode) |
ac27a0ec DK |
2635 | { |
2636 | struct list_head *prev; | |
617ba13b | 2637 | struct ext4_inode_info *ei = EXT4_I(inode); |
cd2c080c | 2638 | struct ext4_sb_info *sbi = EXT4_SB(inode->i_sb); |
498e5f24 | 2639 | __u32 ino_next; |
617ba13b | 2640 | struct ext4_iloc iloc; |
ac27a0ec DK |
2641 | int err = 0; |
2642 | ||
cd2c080c | 2643 | if (!sbi->s_journal && !(sbi->s_mount_state & EXT4_ORPHAN_FS)) |
0390131b FM |
2644 | return 0; |
2645 | ||
d745a8c2 JK |
2646 | WARN_ON_ONCE(!(inode->i_state & (I_NEW | I_FREEING)) && |
2647 | !mutex_is_locked(&inode->i_mutex)); | |
2648 | /* Do this quick check before taking global s_orphan_lock. */ | |
3b9d4ed2 | 2649 | if (list_empty(&ei->i_orphan)) |
d745a8c2 | 2650 | return 0; |
ac27a0ec | 2651 | |
d745a8c2 JK |
2652 | if (handle) { |
2653 | /* Grab inode buffer early before taking global s_orphan_lock */ | |
2654 | err = ext4_reserve_inode_write(handle, inode, &iloc); | |
2655 | } | |
ac27a0ec | 2656 | |
d745a8c2 | 2657 | mutex_lock(&sbi->s_orphan_lock); |
ac27a0ec DK |
2658 | jbd_debug(4, "remove inode %lu from orphan list\n", inode->i_ino); |
2659 | ||
d745a8c2 | 2660 | prev = ei->i_orphan.prev; |
ac27a0ec DK |
2661 | list_del_init(&ei->i_orphan); |
2662 | ||
2663 | /* If we're on an error path, we may not have a valid | |
2664 | * transaction handle with which to update the orphan list on | |
2665 | * disk, but we still need to remove the inode from the linked | |
2666 | * list in memory. */ | |
d745a8c2 JK |
2667 | if (!handle || err) { |
2668 | mutex_unlock(&sbi->s_orphan_lock); | |
ac27a0ec | 2669 | goto out_err; |
d745a8c2 | 2670 | } |
ac27a0ec | 2671 | |
d745a8c2 | 2672 | ino_next = NEXT_ORPHAN(inode); |
ac27a0ec | 2673 | if (prev == &sbi->s_orphan) { |
498e5f24 | 2674 | jbd_debug(4, "superblock will point to %u\n", ino_next); |
ac27a0ec | 2675 | BUFFER_TRACE(sbi->s_sbh, "get_write_access"); |
617ba13b | 2676 | err = ext4_journal_get_write_access(handle, sbi->s_sbh); |
d745a8c2 JK |
2677 | if (err) { |
2678 | mutex_unlock(&sbi->s_orphan_lock); | |
ac27a0ec | 2679 | goto out_brelse; |
d745a8c2 | 2680 | } |
ac27a0ec | 2681 | sbi->s_es->s_last_orphan = cpu_to_le32(ino_next); |
d745a8c2 | 2682 | mutex_unlock(&sbi->s_orphan_lock); |
b50924c2 | 2683 | err = ext4_handle_dirty_super(handle, inode->i_sb); |
ac27a0ec | 2684 | } else { |
617ba13b | 2685 | struct ext4_iloc iloc2; |
ac27a0ec | 2686 | struct inode *i_prev = |
617ba13b | 2687 | &list_entry(prev, struct ext4_inode_info, i_orphan)->vfs_inode; |
ac27a0ec | 2688 | |
498e5f24 | 2689 | jbd_debug(4, "orphan inode %lu will point to %u\n", |
ac27a0ec | 2690 | i_prev->i_ino, ino_next); |
617ba13b | 2691 | err = ext4_reserve_inode_write(handle, i_prev, &iloc2); |
d745a8c2 JK |
2692 | if (err) { |
2693 | mutex_unlock(&sbi->s_orphan_lock); | |
ac27a0ec | 2694 | goto out_brelse; |
d745a8c2 | 2695 | } |
ac27a0ec | 2696 | NEXT_ORPHAN(i_prev) = ino_next; |
617ba13b | 2697 | err = ext4_mark_iloc_dirty(handle, i_prev, &iloc2); |
d745a8c2 | 2698 | mutex_unlock(&sbi->s_orphan_lock); |
ac27a0ec DK |
2699 | } |
2700 | if (err) | |
2701 | goto out_brelse; | |
2702 | NEXT_ORPHAN(inode) = 0; | |
617ba13b | 2703 | err = ext4_mark_iloc_dirty(handle, inode, &iloc); |
ac27a0ec | 2704 | out_err: |
617ba13b | 2705 | ext4_std_error(inode->i_sb, err); |
ac27a0ec DK |
2706 | return err; |
2707 | ||
2708 | out_brelse: | |
2709 | brelse(iloc.bh); | |
2710 | goto out_err; | |
2711 | } | |
2712 | ||
af5bc92d | 2713 | static int ext4_rmdir(struct inode *dir, struct dentry *dentry) |
ac27a0ec DK |
2714 | { |
2715 | int retval; | |
af5bc92d TT |
2716 | struct inode *inode; |
2717 | struct buffer_head *bh; | |
2718 | struct ext4_dir_entry_2 *de; | |
8dcfaad2 | 2719 | handle_t *handle = NULL; |
ac27a0ec DK |
2720 | |
2721 | /* Initialize quotas before so that eventual writes go in | |
2722 | * separate transaction */ | |
871a2931 CH |
2723 | dquot_initialize(dir); |
2724 | dquot_initialize(dentry->d_inode); | |
907f4554 | 2725 | |
ac27a0ec | 2726 | retval = -ENOENT; |
32f7f22c | 2727 | bh = ext4_find_entry(dir, &dentry->d_name, &de, NULL); |
36de9286 TT |
2728 | if (IS_ERR(bh)) |
2729 | return PTR_ERR(bh); | |
ac27a0ec DK |
2730 | if (!bh) |
2731 | goto end_rmdir; | |
2732 | ||
ac27a0ec DK |
2733 | inode = dentry->d_inode; |
2734 | ||
2735 | retval = -EIO; | |
2736 | if (le32_to_cpu(de->inode) != inode->i_ino) | |
2737 | goto end_rmdir; | |
2738 | ||
2739 | retval = -ENOTEMPTY; | |
e875a2dd | 2740 | if (!ext4_empty_dir(inode)) |
ac27a0ec DK |
2741 | goto end_rmdir; |
2742 | ||
8dcfaad2 | 2743 | handle = ext4_journal_start(dir, EXT4_HT_DIR, |
64044abf | 2744 | EXT4_DATA_TRANS_BLOCKS(dir->i_sb)); |
8dcfaad2 TT |
2745 | if (IS_ERR(handle)) { |
2746 | retval = PTR_ERR(handle); | |
2747 | handle = NULL; | |
2748 | goto end_rmdir; | |
2749 | } | |
2750 | ||
2751 | if (IS_DIRSYNC(dir)) | |
2752 | ext4_handle_sync(handle); | |
2753 | ||
617ba13b | 2754 | retval = ext4_delete_entry(handle, dir, de, bh); |
ac27a0ec DK |
2755 | if (retval) |
2756 | goto end_rmdir; | |
f8628a14 | 2757 | if (!EXT4_DIR_LINK_EMPTY(inode)) |
12062ddd | 2758 | ext4_warning(inode->i_sb, |
af5bc92d TT |
2759 | "empty directory has too many links (%d)", |
2760 | inode->i_nlink); | |
ac27a0ec DK |
2761 | inode->i_version++; |
2762 | clear_nlink(inode); | |
2763 | /* There's no need to set i_disksize: the fact that i_nlink is | |
2764 | * zero will ensure that the right thing happens during any | |
2765 | * recovery. */ | |
2766 | inode->i_size = 0; | |
617ba13b | 2767 | ext4_orphan_add(handle, inode); |
ef7f3835 | 2768 | inode->i_ctime = dir->i_ctime = dir->i_mtime = ext4_current_time(inode); |
617ba13b | 2769 | ext4_mark_inode_dirty(handle, inode); |
f8628a14 | 2770 | ext4_dec_count(handle, dir); |
617ba13b MC |
2771 | ext4_update_dx_flag(dir); |
2772 | ext4_mark_inode_dirty(handle, dir); | |
ac27a0ec DK |
2773 | |
2774 | end_rmdir: | |
af5bc92d | 2775 | brelse(bh); |
8dcfaad2 TT |
2776 | if (handle) |
2777 | ext4_journal_stop(handle); | |
ac27a0ec DK |
2778 | return retval; |
2779 | } | |
2780 | ||
af5bc92d | 2781 | static int ext4_unlink(struct inode *dir, struct dentry *dentry) |
ac27a0ec DK |
2782 | { |
2783 | int retval; | |
af5bc92d TT |
2784 | struct inode *inode; |
2785 | struct buffer_head *bh; | |
2786 | struct ext4_dir_entry_2 *de; | |
931b6864 | 2787 | handle_t *handle = NULL; |
ac27a0ec | 2788 | |
0562e0ba | 2789 | trace_ext4_unlink_enter(dir, dentry); |
ac27a0ec DK |
2790 | /* Initialize quotas before so that eventual writes go |
2791 | * in separate transaction */ | |
871a2931 CH |
2792 | dquot_initialize(dir); |
2793 | dquot_initialize(dentry->d_inode); | |
907f4554 | 2794 | |
ac27a0ec | 2795 | retval = -ENOENT; |
32f7f22c | 2796 | bh = ext4_find_entry(dir, &dentry->d_name, &de, NULL); |
36de9286 TT |
2797 | if (IS_ERR(bh)) |
2798 | return PTR_ERR(bh); | |
ac27a0ec DK |
2799 | if (!bh) |
2800 | goto end_unlink; | |
2801 | ||
2802 | inode = dentry->d_inode; | |
2803 | ||
2804 | retval = -EIO; | |
2805 | if (le32_to_cpu(de->inode) != inode->i_ino) | |
2806 | goto end_unlink; | |
2807 | ||
931b6864 | 2808 | handle = ext4_journal_start(dir, EXT4_HT_DIR, |
64044abf | 2809 | EXT4_DATA_TRANS_BLOCKS(dir->i_sb)); |
931b6864 TT |
2810 | if (IS_ERR(handle)) { |
2811 | retval = PTR_ERR(handle); | |
2812 | handle = NULL; | |
2813 | goto end_unlink; | |
2814 | } | |
2815 | ||
2816 | if (IS_DIRSYNC(dir)) | |
2817 | ext4_handle_sync(handle); | |
2818 | ||
ac27a0ec | 2819 | if (!inode->i_nlink) { |
12062ddd | 2820 | ext4_warning(inode->i_sb, |
af5bc92d TT |
2821 | "Deleting nonexistent file (%lu), %d", |
2822 | inode->i_ino, inode->i_nlink); | |
bfe86848 | 2823 | set_nlink(inode, 1); |
ac27a0ec | 2824 | } |
617ba13b | 2825 | retval = ext4_delete_entry(handle, dir, de, bh); |
ac27a0ec DK |
2826 | if (retval) |
2827 | goto end_unlink; | |
ef7f3835 | 2828 | dir->i_ctime = dir->i_mtime = ext4_current_time(dir); |
617ba13b MC |
2829 | ext4_update_dx_flag(dir); |
2830 | ext4_mark_inode_dirty(handle, dir); | |
825f1481 | 2831 | drop_nlink(inode); |
ac27a0ec | 2832 | if (!inode->i_nlink) |
617ba13b | 2833 | ext4_orphan_add(handle, inode); |
ef7f3835 | 2834 | inode->i_ctime = ext4_current_time(inode); |
617ba13b | 2835 | ext4_mark_inode_dirty(handle, inode); |
ac27a0ec DK |
2836 | |
2837 | end_unlink: | |
af5bc92d | 2838 | brelse(bh); |
931b6864 TT |
2839 | if (handle) |
2840 | ext4_journal_stop(handle); | |
0562e0ba | 2841 | trace_ext4_unlink_exit(dentry, retval); |
ac27a0ec DK |
2842 | return retval; |
2843 | } | |
2844 | ||
af5bc92d TT |
2845 | static int ext4_symlink(struct inode *dir, |
2846 | struct dentry *dentry, const char *symname) | |
ac27a0ec DK |
2847 | { |
2848 | handle_t *handle; | |
af5bc92d | 2849 | struct inode *inode; |
ac27a0ec | 2850 | int l, err, retries = 0; |
df5e6223 | 2851 | int credits; |
ac27a0ec DK |
2852 | |
2853 | l = strlen(symname)+1; | |
2854 | if (l > dir->i_sb->s_blocksize) | |
2855 | return -ENAMETOOLONG; | |
2856 | ||
871a2931 | 2857 | dquot_initialize(dir); |
907f4554 | 2858 | |
df5e6223 JK |
2859 | if (l > EXT4_N_BLOCKS * 4) { |
2860 | /* | |
2861 | * For non-fast symlinks, we just allocate inode and put it on | |
2862 | * orphan list in the first transaction => we need bitmap, | |
8c208719 ES |
2863 | * group descriptor, sb, inode block, quota blocks, and |
2864 | * possibly selinux xattr blocks. | |
df5e6223 | 2865 | */ |
8c208719 ES |
2866 | credits = 4 + EXT4_MAXQUOTAS_INIT_BLOCKS(dir->i_sb) + |
2867 | EXT4_XATTR_TRANS_BLOCKS; | |
df5e6223 JK |
2868 | } else { |
2869 | /* | |
2870 | * Fast symlink. We have to add entry to directory | |
2871 | * (EXT4_DATA_TRANS_BLOCKS + EXT4_INDEX_EXTRA_TRANS_BLOCKS), | |
2872 | * allocate new inode (bitmap, group descriptor, inode block, | |
2873 | * quota blocks, sb is already counted in previous macros). | |
2874 | */ | |
2875 | credits = EXT4_DATA_TRANS_BLOCKS(dir->i_sb) + | |
eb9cc7e1 | 2876 | EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3; |
df5e6223 | 2877 | } |
ac27a0ec | 2878 | retry: |
1139575a TT |
2879 | inode = ext4_new_inode_start_handle(dir, S_IFLNK|S_IRWXUGO, |
2880 | &dentry->d_name, 0, NULL, | |
2881 | EXT4_HT_DIR, credits); | |
2882 | handle = ext4_journal_current_handle(); | |
ac27a0ec DK |
2883 | err = PTR_ERR(inode); |
2884 | if (IS_ERR(inode)) | |
2885 | goto out_stop; | |
2886 | ||
df5e6223 | 2887 | if (l > EXT4_N_BLOCKS * 4) { |
617ba13b MC |
2888 | inode->i_op = &ext4_symlink_inode_operations; |
2889 | ext4_set_aops(inode); | |
ac27a0ec | 2890 | /* |
df5e6223 JK |
2891 | * We cannot call page_symlink() with transaction started |
2892 | * because it calls into ext4_write_begin() which can wait | |
2893 | * for transaction commit if we are running out of space | |
2894 | * and thus we deadlock. So we have to stop transaction now | |
2895 | * and restart it when symlink contents is written. | |
2896 | * | |
2897 | * To keep fs consistent in case of crash, we have to put inode | |
2898 | * to orphan list in the mean time. | |
ac27a0ec | 2899 | */ |
df5e6223 JK |
2900 | drop_nlink(inode); |
2901 | err = ext4_orphan_add(handle, inode); | |
2902 | ext4_journal_stop(handle); | |
2903 | if (err) | |
2904 | goto err_drop_inode; | |
54566b2c | 2905 | err = __page_symlink(inode, symname, l, 1); |
df5e6223 JK |
2906 | if (err) |
2907 | goto err_drop_inode; | |
2908 | /* | |
2909 | * Now inode is being linked into dir (EXT4_DATA_TRANS_BLOCKS | |
2910 | * + EXT4_INDEX_EXTRA_TRANS_BLOCKS), inode is also modified | |
2911 | */ | |
9924a92a | 2912 | handle = ext4_journal_start(dir, EXT4_HT_DIR, |
df5e6223 JK |
2913 | EXT4_DATA_TRANS_BLOCKS(dir->i_sb) + |
2914 | EXT4_INDEX_EXTRA_TRANS_BLOCKS + 1); | |
2915 | if (IS_ERR(handle)) { | |
2916 | err = PTR_ERR(handle); | |
2917 | goto err_drop_inode; | |
2918 | } | |
0ce8c010 | 2919 | set_nlink(inode, 1); |
df5e6223 | 2920 | err = ext4_orphan_del(handle, inode); |
ac27a0ec | 2921 | if (err) { |
df5e6223 | 2922 | ext4_journal_stop(handle); |
825f1481 | 2923 | clear_nlink(inode); |
df5e6223 | 2924 | goto err_drop_inode; |
ac27a0ec DK |
2925 | } |
2926 | } else { | |
e65187e6 | 2927 | /* clear the extent format for fast symlink */ |
12e9b892 | 2928 | ext4_clear_inode_flag(inode, EXT4_INODE_EXTENTS); |
617ba13b | 2929 | inode->i_op = &ext4_fast_symlink_inode_operations; |
af5bc92d | 2930 | memcpy((char *)&EXT4_I(inode)->i_data, symname, l); |
ac27a0ec DK |
2931 | inode->i_size = l-1; |
2932 | } | |
617ba13b MC |
2933 | EXT4_I(inode)->i_disksize = inode->i_size; |
2934 | err = ext4_add_nondir(handle, dentry, inode); | |
1139575a TT |
2935 | if (!err && IS_DIRSYNC(dir)) |
2936 | ext4_handle_sync(handle); | |
2937 | ||
ac27a0ec | 2938 | out_stop: |
1139575a TT |
2939 | if (handle) |
2940 | ext4_journal_stop(handle); | |
617ba13b | 2941 | if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries)) |
ac27a0ec DK |
2942 | goto retry; |
2943 | return err; | |
df5e6223 JK |
2944 | err_drop_inode: |
2945 | unlock_new_inode(inode); | |
2946 | iput(inode); | |
2947 | return err; | |
ac27a0ec DK |
2948 | } |
2949 | ||
af5bc92d TT |
2950 | static int ext4_link(struct dentry *old_dentry, |
2951 | struct inode *dir, struct dentry *dentry) | |
ac27a0ec DK |
2952 | { |
2953 | handle_t *handle; | |
2954 | struct inode *inode = old_dentry->d_inode; | |
2955 | int err, retries = 0; | |
2956 | ||
b05ab1dc | 2957 | if (inode->i_nlink >= EXT4_LINK_MAX) |
ac27a0ec | 2958 | return -EMLINK; |
d9cdc903 TT |
2959 | if (ext4_encrypted_inode(dir) && |
2960 | !ext4_is_child_context_consistent_with_parent(dir, inode)) | |
2961 | return -EPERM; | |
871a2931 | 2962 | dquot_initialize(dir); |
907f4554 | 2963 | |
ac27a0ec | 2964 | retry: |
9924a92a TT |
2965 | handle = ext4_journal_start(dir, EXT4_HT_DIR, |
2966 | (EXT4_DATA_TRANS_BLOCKS(dir->i_sb) + | |
af51a2ac | 2967 | EXT4_INDEX_EXTRA_TRANS_BLOCKS) + 1); |
ac27a0ec DK |
2968 | if (IS_ERR(handle)) |
2969 | return PTR_ERR(handle); | |
2970 | ||
2971 | if (IS_DIRSYNC(dir)) | |
0390131b | 2972 | ext4_handle_sync(handle); |
ac27a0ec | 2973 | |
ef7f3835 | 2974 | inode->i_ctime = ext4_current_time(inode); |
f8628a14 | 2975 | ext4_inc_count(handle, inode); |
7de9c6ee | 2976 | ihold(inode); |
ac27a0ec | 2977 | |
6b38e842 AV |
2978 | err = ext4_add_entry(handle, dentry, inode); |
2979 | if (!err) { | |
2980 | ext4_mark_inode_dirty(handle, inode); | |
af51a2ac AV |
2981 | /* this can happen only for tmpfile being |
2982 | * linked the first time | |
2983 | */ | |
2984 | if (inode->i_nlink == 1) | |
2985 | ext4_orphan_del(handle, inode); | |
6b38e842 AV |
2986 | d_instantiate(dentry, inode); |
2987 | } else { | |
2988 | drop_nlink(inode); | |
2989 | iput(inode); | |
2990 | } | |
617ba13b MC |
2991 | ext4_journal_stop(handle); |
2992 | if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries)) | |
ac27a0ec DK |
2993 | goto retry; |
2994 | return err; | |
2995 | } | |
2996 | ||
32f7f22c TM |
2997 | |
2998 | /* | |
2999 | * Try to find buffer head where contains the parent block. | |
3000 | * It should be the inode block if it is inlined or the 1st block | |
3001 | * if it is a normal dir. | |
3002 | */ | |
3003 | static struct buffer_head *ext4_get_first_dir_block(handle_t *handle, | |
3004 | struct inode *inode, | |
3005 | int *retval, | |
3006 | struct ext4_dir_entry_2 **parent_de, | |
3007 | int *inlined) | |
3008 | { | |
3009 | struct buffer_head *bh; | |
3010 | ||
3011 | if (!ext4_has_inline_data(inode)) { | |
dc6982ff TT |
3012 | bh = ext4_read_dirblock(inode, 0, EITHER); |
3013 | if (IS_ERR(bh)) { | |
3014 | *retval = PTR_ERR(bh); | |
32f7f22c TM |
3015 | return NULL; |
3016 | } | |
3017 | *parent_de = ext4_next_entry( | |
3018 | (struct ext4_dir_entry_2 *)bh->b_data, | |
3019 | inode->i_sb->s_blocksize); | |
3020 | return bh; | |
3021 | } | |
3022 | ||
3023 | *inlined = 1; | |
3024 | return ext4_get_first_inline_block(inode, parent_de, retval); | |
3025 | } | |
ac27a0ec | 3026 | |
c0d268c3 MS |
3027 | struct ext4_renament { |
3028 | struct inode *dir; | |
3029 | struct dentry *dentry; | |
3030 | struct inode *inode; | |
bd42998a MS |
3031 | bool is_dir; |
3032 | int dir_nlink_delta; | |
c0d268c3 MS |
3033 | |
3034 | /* entry for "dentry" */ | |
3035 | struct buffer_head *bh; | |
3036 | struct ext4_dir_entry_2 *de; | |
3037 | int inlined; | |
3038 | ||
3039 | /* entry for ".." in inode if it's a directory */ | |
3040 | struct buffer_head *dir_bh; | |
3041 | struct ext4_dir_entry_2 *parent_de; | |
3042 | int dir_inlined; | |
3043 | }; | |
3044 | ||
bd1af145 MS |
3045 | static int ext4_rename_dir_prepare(handle_t *handle, struct ext4_renament *ent) |
3046 | { | |
3047 | int retval; | |
3048 | ||
3049 | ent->dir_bh = ext4_get_first_dir_block(handle, ent->inode, | |
3050 | &retval, &ent->parent_de, | |
3051 | &ent->dir_inlined); | |
3052 | if (!ent->dir_bh) | |
3053 | return retval; | |
3054 | if (le32_to_cpu(ent->parent_de->inode) != ent->dir->i_ino) | |
3055 | return -EIO; | |
3056 | BUFFER_TRACE(ent->dir_bh, "get_write_access"); | |
3057 | return ext4_journal_get_write_access(handle, ent->dir_bh); | |
3058 | } | |
3059 | ||
3060 | static int ext4_rename_dir_finish(handle_t *handle, struct ext4_renament *ent, | |
3061 | unsigned dir_ino) | |
3062 | { | |
3063 | int retval; | |
3064 | ||
3065 | ent->parent_de->inode = cpu_to_le32(dir_ino); | |
3066 | BUFFER_TRACE(ent->dir_bh, "call ext4_handle_dirty_metadata"); | |
3067 | if (!ent->dir_inlined) { | |
3068 | if (is_dx(ent->inode)) { | |
3069 | retval = ext4_handle_dirty_dx_node(handle, | |
3070 | ent->inode, | |
3071 | ent->dir_bh); | |
3072 | } else { | |
3073 | retval = ext4_handle_dirty_dirent_node(handle, | |
3074 | ent->inode, | |
3075 | ent->dir_bh); | |
3076 | } | |
3077 | } else { | |
3078 | retval = ext4_mark_inode_dirty(handle, ent->inode); | |
3079 | } | |
3080 | if (retval) { | |
3081 | ext4_std_error(ent->dir->i_sb, retval); | |
3082 | return retval; | |
3083 | } | |
3084 | return 0; | |
3085 | } | |
3086 | ||
3087 | static int ext4_setent(handle_t *handle, struct ext4_renament *ent, | |
3088 | unsigned ino, unsigned file_type) | |
3089 | { | |
3090 | int retval; | |
3091 | ||
3092 | BUFFER_TRACE(ent->bh, "get write access"); | |
3093 | retval = ext4_journal_get_write_access(handle, ent->bh); | |
3094 | if (retval) | |
3095 | return retval; | |
3096 | ent->de->inode = cpu_to_le32(ino); | |
3097 | if (EXT4_HAS_INCOMPAT_FEATURE(ent->dir->i_sb, | |
3098 | EXT4_FEATURE_INCOMPAT_FILETYPE)) | |
3099 | ent->de->file_type = file_type; | |
3100 | ent->dir->i_version++; | |
3101 | ent->dir->i_ctime = ent->dir->i_mtime = | |
3102 | ext4_current_time(ent->dir); | |
3103 | ext4_mark_inode_dirty(handle, ent->dir); | |
3104 | BUFFER_TRACE(ent->bh, "call ext4_handle_dirty_metadata"); | |
3105 | if (!ent->inlined) { | |
3106 | retval = ext4_handle_dirty_dirent_node(handle, | |
3107 | ent->dir, ent->bh); | |
3108 | if (unlikely(retval)) { | |
3109 | ext4_std_error(ent->dir->i_sb, retval); | |
3110 | return retval; | |
3111 | } | |
3112 | } | |
3113 | brelse(ent->bh); | |
3114 | ent->bh = NULL; | |
3115 | ||
3116 | return 0; | |
3117 | } | |
3118 | ||
3119 | static int ext4_find_delete_entry(handle_t *handle, struct inode *dir, | |
3120 | const struct qstr *d_name) | |
3121 | { | |
3122 | int retval = -ENOENT; | |
3123 | struct buffer_head *bh; | |
3124 | struct ext4_dir_entry_2 *de; | |
3125 | ||
3126 | bh = ext4_find_entry(dir, d_name, &de, NULL); | |
36de9286 TT |
3127 | if (IS_ERR(bh)) |
3128 | return PTR_ERR(bh); | |
bd1af145 MS |
3129 | if (bh) { |
3130 | retval = ext4_delete_entry(handle, dir, de, bh); | |
3131 | brelse(bh); | |
3132 | } | |
3133 | return retval; | |
3134 | } | |
3135 | ||
d80d448c DW |
3136 | static void ext4_rename_delete(handle_t *handle, struct ext4_renament *ent, |
3137 | int force_reread) | |
bd1af145 MS |
3138 | { |
3139 | int retval; | |
3140 | /* | |
3141 | * ent->de could have moved from under us during htree split, so make | |
3142 | * sure that we are deleting the right entry. We might also be pointing | |
3143 | * to a stale entry in the unused part of ent->bh so just checking inum | |
3144 | * and the name isn't enough. | |
3145 | */ | |
3146 | if (le32_to_cpu(ent->de->inode) != ent->inode->i_ino || | |
3147 | ent->de->name_len != ent->dentry->d_name.len || | |
3148 | strncmp(ent->de->name, ent->dentry->d_name.name, | |
d80d448c DW |
3149 | ent->de->name_len) || |
3150 | force_reread) { | |
bd1af145 MS |
3151 | retval = ext4_find_delete_entry(handle, ent->dir, |
3152 | &ent->dentry->d_name); | |
3153 | } else { | |
3154 | retval = ext4_delete_entry(handle, ent->dir, ent->de, ent->bh); | |
3155 | if (retval == -ENOENT) { | |
3156 | retval = ext4_find_delete_entry(handle, ent->dir, | |
3157 | &ent->dentry->d_name); | |
3158 | } | |
3159 | } | |
3160 | ||
3161 | if (retval) { | |
3162 | ext4_warning(ent->dir->i_sb, | |
3163 | "Deleting old file (%lu), %d, error=%d", | |
3164 | ent->dir->i_ino, ent->dir->i_nlink, retval); | |
3165 | } | |
3166 | } | |
3167 | ||
bd42998a MS |
3168 | static void ext4_update_dir_count(handle_t *handle, struct ext4_renament *ent) |
3169 | { | |
3170 | if (ent->dir_nlink_delta) { | |
3171 | if (ent->dir_nlink_delta == -1) | |
3172 | ext4_dec_count(handle, ent->dir); | |
3173 | else | |
3174 | ext4_inc_count(handle, ent->dir); | |
3175 | ext4_mark_inode_dirty(handle, ent->dir); | |
3176 | } | |
3177 | } | |
3178 | ||
cd808dec MS |
3179 | static struct inode *ext4_whiteout_for_rename(struct ext4_renament *ent, |
3180 | int credits, handle_t **h) | |
3181 | { | |
3182 | struct inode *wh; | |
3183 | handle_t *handle; | |
3184 | int retries = 0; | |
3185 | ||
3186 | /* | |
3187 | * for inode block, sb block, group summaries, | |
3188 | * and inode bitmap | |
3189 | */ | |
3190 | credits += (EXT4_MAXQUOTAS_TRANS_BLOCKS(ent->dir->i_sb) + | |
3191 | EXT4_XATTR_TRANS_BLOCKS + 4); | |
3192 | retry: | |
3193 | wh = ext4_new_inode_start_handle(ent->dir, S_IFCHR | WHITEOUT_MODE, | |
3194 | &ent->dentry->d_name, 0, NULL, | |
3195 | EXT4_HT_DIR, credits); | |
3196 | ||
3197 | handle = ext4_journal_current_handle(); | |
3198 | if (IS_ERR(wh)) { | |
3199 | if (handle) | |
3200 | ext4_journal_stop(handle); | |
3201 | if (PTR_ERR(wh) == -ENOSPC && | |
3202 | ext4_should_retry_alloc(ent->dir->i_sb, &retries)) | |
3203 | goto retry; | |
3204 | } else { | |
3205 | *h = handle; | |
3206 | init_special_inode(wh, wh->i_mode, WHITEOUT_DEV); | |
3207 | wh->i_op = &ext4_special_inode_operations; | |
3208 | } | |
3209 | return wh; | |
3210 | } | |
3211 | ||
ac27a0ec DK |
3212 | /* |
3213 | * Anybody can rename anything with this: the permission checks are left to the | |
3214 | * higher-level routines. | |
0e202704 TT |
3215 | * |
3216 | * n.b. old_{dentry,inode) refers to the source dentry/inode | |
3217 | * while new_{dentry,inode) refers to the destination dentry/inode | |
3218 | * This comes from rename(const char *oldpath, const char *newpath) | |
ac27a0ec | 3219 | */ |
af5bc92d | 3220 | static int ext4_rename(struct inode *old_dir, struct dentry *old_dentry, |
cd808dec MS |
3221 | struct inode *new_dir, struct dentry *new_dentry, |
3222 | unsigned int flags) | |
ac27a0ec | 3223 | { |
5b61de75 | 3224 | handle_t *handle = NULL; |
c0d268c3 MS |
3225 | struct ext4_renament old = { |
3226 | .dir = old_dir, | |
3227 | .dentry = old_dentry, | |
3228 | .inode = old_dentry->d_inode, | |
3229 | }; | |
3230 | struct ext4_renament new = { | |
3231 | .dir = new_dir, | |
3232 | .dentry = new_dentry, | |
3233 | .inode = new_dentry->d_inode, | |
3234 | }; | |
d80d448c | 3235 | int force_reread; |
0e202704 | 3236 | int retval; |
cd808dec MS |
3237 | struct inode *whiteout = NULL; |
3238 | int credits; | |
3239 | u8 old_file_type; | |
907f4554 | 3240 | |
c0d268c3 MS |
3241 | dquot_initialize(old.dir); |
3242 | dquot_initialize(new.dir); | |
ac27a0ec DK |
3243 | |
3244 | /* Initialize quotas before so that eventual writes go | |
3245 | * in separate transaction */ | |
c0d268c3 MS |
3246 | if (new.inode) |
3247 | dquot_initialize(new.inode); | |
ac27a0ec | 3248 | |
c0d268c3 | 3249 | old.bh = ext4_find_entry(old.dir, &old.dentry->d_name, &old.de, NULL); |
36de9286 TT |
3250 | if (IS_ERR(old.bh)) |
3251 | return PTR_ERR(old.bh); | |
ac27a0ec DK |
3252 | /* |
3253 | * Check for inode number is _not_ due to possible IO errors. | |
3254 | * We might rmdir the source, keep it as pwd of some process | |
3255 | * and merrily kill the link to whatever was created under the | |
3256 | * same name. Goodbye sticky bit ;-< | |
3257 | */ | |
ac27a0ec | 3258 | retval = -ENOENT; |
c0d268c3 | 3259 | if (!old.bh || le32_to_cpu(old.de->inode) != old.inode->i_ino) |
ac27a0ec DK |
3260 | goto end_rename; |
3261 | ||
d9cdc903 TT |
3262 | if ((old.dir != new.dir) && |
3263 | ext4_encrypted_inode(new.dir) && | |
3264 | !ext4_is_child_context_consistent_with_parent(new.dir, | |
3265 | old.inode)) { | |
3266 | retval = -EPERM; | |
3267 | goto end_rename; | |
3268 | } | |
3269 | ||
c0d268c3 MS |
3270 | new.bh = ext4_find_entry(new.dir, &new.dentry->d_name, |
3271 | &new.de, &new.inlined); | |
36de9286 TT |
3272 | if (IS_ERR(new.bh)) { |
3273 | retval = PTR_ERR(new.bh); | |
a9cfcd63 | 3274 | new.bh = NULL; |
36de9286 TT |
3275 | goto end_rename; |
3276 | } | |
c0d268c3 MS |
3277 | if (new.bh) { |
3278 | if (!new.inode) { | |
3279 | brelse(new.bh); | |
3280 | new.bh = NULL; | |
ac27a0ec DK |
3281 | } |
3282 | } | |
c0d268c3 MS |
3283 | if (new.inode && !test_opt(new.dir->i_sb, NO_AUTO_DA_ALLOC)) |
3284 | ext4_alloc_da_blocks(old.inode); | |
5b61de75 | 3285 | |
cd808dec MS |
3286 | credits = (2 * EXT4_DATA_TRANS_BLOCKS(old.dir->i_sb) + |
3287 | EXT4_INDEX_EXTRA_TRANS_BLOCKS + 2); | |
3288 | if (!(flags & RENAME_WHITEOUT)) { | |
3289 | handle = ext4_journal_start(old.dir, EXT4_HT_DIR, credits); | |
7071b715 KK |
3290 | if (IS_ERR(handle)) { |
3291 | retval = PTR_ERR(handle); | |
3292 | handle = NULL; | |
3293 | goto end_rename; | |
3294 | } | |
cd808dec MS |
3295 | } else { |
3296 | whiteout = ext4_whiteout_for_rename(&old, credits, &handle); | |
7071b715 KK |
3297 | if (IS_ERR(whiteout)) { |
3298 | retval = PTR_ERR(whiteout); | |
3299 | whiteout = NULL; | |
3300 | goto end_rename; | |
3301 | } | |
cd808dec | 3302 | } |
5b61de75 | 3303 | |
c0d268c3 | 3304 | if (IS_DIRSYNC(old.dir) || IS_DIRSYNC(new.dir)) |
5b61de75 TT |
3305 | ext4_handle_sync(handle); |
3306 | ||
c0d268c3 MS |
3307 | if (S_ISDIR(old.inode->i_mode)) { |
3308 | if (new.inode) { | |
ac27a0ec | 3309 | retval = -ENOTEMPTY; |
e875a2dd | 3310 | if (!ext4_empty_dir(new.inode)) |
ac27a0ec | 3311 | goto end_rename; |
0d7d5d67 MS |
3312 | } else { |
3313 | retval = -EMLINK; | |
3314 | if (new.dir != old.dir && EXT4_DIR_LINK_MAX(new.dir)) | |
3315 | goto end_rename; | |
ac27a0ec | 3316 | } |
bd1af145 | 3317 | retval = ext4_rename_dir_prepare(handle, &old); |
ef607893 AG |
3318 | if (retval) |
3319 | goto end_rename; | |
ac27a0ec | 3320 | } |
d80d448c DW |
3321 | /* |
3322 | * If we're renaming a file within an inline_data dir and adding or | |
3323 | * setting the new dirent causes a conversion from inline_data to | |
3324 | * extents/blockmap, we need to force the dirent delete code to | |
3325 | * re-read the directory, or else we end up trying to delete a dirent | |
3326 | * from what is now the extent tree root (or a block map). | |
3327 | */ | |
3328 | force_reread = (new.dir->i_ino == old.dir->i_ino && | |
3329 | ext4_test_inode_flag(new.dir, EXT4_INODE_INLINE_DATA)); | |
cd808dec MS |
3330 | |
3331 | old_file_type = old.de->file_type; | |
3332 | if (whiteout) { | |
3333 | /* | |
3334 | * Do this before adding a new entry, so the old entry is sure | |
3335 | * to be still pointing to the valid old entry. | |
3336 | */ | |
3337 | retval = ext4_setent(handle, &old, whiteout->i_ino, | |
3338 | EXT4_FT_CHRDEV); | |
3339 | if (retval) | |
3340 | goto end_rename; | |
3341 | ext4_mark_inode_dirty(handle, whiteout); | |
3342 | } | |
c0d268c3 MS |
3343 | if (!new.bh) { |
3344 | retval = ext4_add_entry(handle, new.dentry, old.inode); | |
ac27a0ec DK |
3345 | if (retval) |
3346 | goto end_rename; | |
3347 | } else { | |
bd1af145 | 3348 | retval = ext4_setent(handle, &new, |
cd808dec | 3349 | old.inode->i_ino, old_file_type); |
ef607893 AG |
3350 | if (retval) |
3351 | goto end_rename; | |
ac27a0ec | 3352 | } |
d80d448c DW |
3353 | if (force_reread) |
3354 | force_reread = !ext4_test_inode_flag(new.dir, | |
3355 | EXT4_INODE_INLINE_DATA); | |
ac27a0ec DK |
3356 | |
3357 | /* | |
3358 | * Like most other Unix systems, set the ctime for inodes on a | |
3359 | * rename. | |
3360 | */ | |
c0d268c3 MS |
3361 | old.inode->i_ctime = ext4_current_time(old.inode); |
3362 | ext4_mark_inode_dirty(handle, old.inode); | |
ac27a0ec | 3363 | |
cd808dec MS |
3364 | if (!whiteout) { |
3365 | /* | |
3366 | * ok, that's it | |
3367 | */ | |
3368 | ext4_rename_delete(handle, &old, force_reread); | |
3369 | } | |
ac27a0ec | 3370 | |
c0d268c3 MS |
3371 | if (new.inode) { |
3372 | ext4_dec_count(handle, new.inode); | |
3373 | new.inode->i_ctime = ext4_current_time(new.inode); | |
ac27a0ec | 3374 | } |
c0d268c3 MS |
3375 | old.dir->i_ctime = old.dir->i_mtime = ext4_current_time(old.dir); |
3376 | ext4_update_dx_flag(old.dir); | |
3377 | if (old.dir_bh) { | |
bd1af145 MS |
3378 | retval = ext4_rename_dir_finish(handle, &old, new.dir->i_ino); |
3379 | if (retval) | |
b4097142 | 3380 | goto end_rename; |
bd1af145 | 3381 | |
c0d268c3 MS |
3382 | ext4_dec_count(handle, old.dir); |
3383 | if (new.inode) { | |
e875a2dd MH |
3384 | /* checked ext4_empty_dir above, can't have another |
3385 | * parent, ext4_dec_count() won't work for many-linked | |
3386 | * dirs */ | |
c0d268c3 | 3387 | clear_nlink(new.inode); |
ac27a0ec | 3388 | } else { |
c0d268c3 MS |
3389 | ext4_inc_count(handle, new.dir); |
3390 | ext4_update_dx_flag(new.dir); | |
3391 | ext4_mark_inode_dirty(handle, new.dir); | |
ac27a0ec DK |
3392 | } |
3393 | } | |
c0d268c3 MS |
3394 | ext4_mark_inode_dirty(handle, old.dir); |
3395 | if (new.inode) { | |
3396 | ext4_mark_inode_dirty(handle, new.inode); | |
3397 | if (!new.inode->i_nlink) | |
3398 | ext4_orphan_add(handle, new.inode); | |
ac27a0ec DK |
3399 | } |
3400 | retval = 0; | |
3401 | ||
3402 | end_rename: | |
c0d268c3 MS |
3403 | brelse(old.dir_bh); |
3404 | brelse(old.bh); | |
3405 | brelse(new.bh); | |
cd808dec MS |
3406 | if (whiteout) { |
3407 | if (retval) | |
3408 | drop_nlink(whiteout); | |
3409 | unlock_new_inode(whiteout); | |
3410 | iput(whiteout); | |
3411 | } | |
5b61de75 TT |
3412 | if (handle) |
3413 | ext4_journal_stop(handle); | |
ac27a0ec DK |
3414 | return retval; |
3415 | } | |
3416 | ||
bd42998a MS |
3417 | static int ext4_cross_rename(struct inode *old_dir, struct dentry *old_dentry, |
3418 | struct inode *new_dir, struct dentry *new_dentry) | |
3419 | { | |
3420 | handle_t *handle = NULL; | |
3421 | struct ext4_renament old = { | |
3422 | .dir = old_dir, | |
3423 | .dentry = old_dentry, | |
3424 | .inode = old_dentry->d_inode, | |
3425 | }; | |
3426 | struct ext4_renament new = { | |
3427 | .dir = new_dir, | |
3428 | .dentry = new_dentry, | |
3429 | .inode = new_dentry->d_inode, | |
3430 | }; | |
3431 | u8 new_file_type; | |
3432 | int retval; | |
3433 | ||
3434 | dquot_initialize(old.dir); | |
3435 | dquot_initialize(new.dir); | |
3436 | ||
3437 | old.bh = ext4_find_entry(old.dir, &old.dentry->d_name, | |
3438 | &old.de, &old.inlined); | |
36de9286 TT |
3439 | if (IS_ERR(old.bh)) |
3440 | return PTR_ERR(old.bh); | |
bd42998a MS |
3441 | /* |
3442 | * Check for inode number is _not_ due to possible IO errors. | |
3443 | * We might rmdir the source, keep it as pwd of some process | |
3444 | * and merrily kill the link to whatever was created under the | |
3445 | * same name. Goodbye sticky bit ;-< | |
3446 | */ | |
3447 | retval = -ENOENT; | |
3448 | if (!old.bh || le32_to_cpu(old.de->inode) != old.inode->i_ino) | |
3449 | goto end_rename; | |
3450 | ||
3451 | new.bh = ext4_find_entry(new.dir, &new.dentry->d_name, | |
3452 | &new.de, &new.inlined); | |
36de9286 TT |
3453 | if (IS_ERR(new.bh)) { |
3454 | retval = PTR_ERR(new.bh); | |
a9cfcd63 | 3455 | new.bh = NULL; |
36de9286 TT |
3456 | goto end_rename; |
3457 | } | |
bd42998a MS |
3458 | |
3459 | /* RENAME_EXCHANGE case: old *and* new must both exist */ | |
3460 | if (!new.bh || le32_to_cpu(new.de->inode) != new.inode->i_ino) | |
3461 | goto end_rename; | |
3462 | ||
3463 | handle = ext4_journal_start(old.dir, EXT4_HT_DIR, | |
3464 | (2 * EXT4_DATA_TRANS_BLOCKS(old.dir->i_sb) + | |
3465 | 2 * EXT4_INDEX_EXTRA_TRANS_BLOCKS + 2)); | |
7071b715 KK |
3466 | if (IS_ERR(handle)) { |
3467 | retval = PTR_ERR(handle); | |
3468 | handle = NULL; | |
3469 | goto end_rename; | |
3470 | } | |
bd42998a MS |
3471 | |
3472 | if (IS_DIRSYNC(old.dir) || IS_DIRSYNC(new.dir)) | |
3473 | ext4_handle_sync(handle); | |
3474 | ||
3475 | if (S_ISDIR(old.inode->i_mode)) { | |
3476 | old.is_dir = true; | |
3477 | retval = ext4_rename_dir_prepare(handle, &old); | |
3478 | if (retval) | |
3479 | goto end_rename; | |
3480 | } | |
3481 | if (S_ISDIR(new.inode->i_mode)) { | |
3482 | new.is_dir = true; | |
3483 | retval = ext4_rename_dir_prepare(handle, &new); | |
3484 | if (retval) | |
3485 | goto end_rename; | |
3486 | } | |
3487 | ||
3488 | /* | |
3489 | * Other than the special case of overwriting a directory, parents' | |
3490 | * nlink only needs to be modified if this is a cross directory rename. | |
3491 | */ | |
3492 | if (old.dir != new.dir && old.is_dir != new.is_dir) { | |
3493 | old.dir_nlink_delta = old.is_dir ? -1 : 1; | |
3494 | new.dir_nlink_delta = -old.dir_nlink_delta; | |
3495 | retval = -EMLINK; | |
3496 | if ((old.dir_nlink_delta > 0 && EXT4_DIR_LINK_MAX(old.dir)) || | |
3497 | (new.dir_nlink_delta > 0 && EXT4_DIR_LINK_MAX(new.dir))) | |
3498 | goto end_rename; | |
3499 | } | |
3500 | ||
3501 | new_file_type = new.de->file_type; | |
3502 | retval = ext4_setent(handle, &new, old.inode->i_ino, old.de->file_type); | |
3503 | if (retval) | |
3504 | goto end_rename; | |
3505 | ||
3506 | retval = ext4_setent(handle, &old, new.inode->i_ino, new_file_type); | |
3507 | if (retval) | |
3508 | goto end_rename; | |
3509 | ||
3510 | /* | |
3511 | * Like most other Unix systems, set the ctime for inodes on a | |
3512 | * rename. | |
3513 | */ | |
3514 | old.inode->i_ctime = ext4_current_time(old.inode); | |
3515 | new.inode->i_ctime = ext4_current_time(new.inode); | |
3516 | ext4_mark_inode_dirty(handle, old.inode); | |
3517 | ext4_mark_inode_dirty(handle, new.inode); | |
3518 | ||
3519 | if (old.dir_bh) { | |
3520 | retval = ext4_rename_dir_finish(handle, &old, new.dir->i_ino); | |
3521 | if (retval) | |
3522 | goto end_rename; | |
3523 | } | |
3524 | if (new.dir_bh) { | |
3525 | retval = ext4_rename_dir_finish(handle, &new, old.dir->i_ino); | |
3526 | if (retval) | |
3527 | goto end_rename; | |
3528 | } | |
3529 | ext4_update_dir_count(handle, &old); | |
3530 | ext4_update_dir_count(handle, &new); | |
3531 | retval = 0; | |
3532 | ||
3533 | end_rename: | |
3534 | brelse(old.dir_bh); | |
3535 | brelse(new.dir_bh); | |
3536 | brelse(old.bh); | |
3537 | brelse(new.bh); | |
3538 | if (handle) | |
3539 | ext4_journal_stop(handle); | |
3540 | return retval; | |
3541 | } | |
3542 | ||
0a7c3937 MS |
3543 | static int ext4_rename2(struct inode *old_dir, struct dentry *old_dentry, |
3544 | struct inode *new_dir, struct dentry *new_dentry, | |
3545 | unsigned int flags) | |
3546 | { | |
cd808dec | 3547 | if (flags & ~(RENAME_NOREPLACE | RENAME_EXCHANGE | RENAME_WHITEOUT)) |
0a7c3937 MS |
3548 | return -EINVAL; |
3549 | ||
bd42998a MS |
3550 | if (flags & RENAME_EXCHANGE) { |
3551 | return ext4_cross_rename(old_dir, old_dentry, | |
3552 | new_dir, new_dentry); | |
3553 | } | |
cd808dec MS |
3554 | |
3555 | return ext4_rename(old_dir, old_dentry, new_dir, new_dentry, flags); | |
0a7c3937 MS |
3556 | } |
3557 | ||
ac27a0ec DK |
3558 | /* |
3559 | * directories can handle most operations... | |
3560 | */ | |
754661f1 | 3561 | const struct inode_operations ext4_dir_inode_operations = { |
617ba13b MC |
3562 | .create = ext4_create, |
3563 | .lookup = ext4_lookup, | |
3564 | .link = ext4_link, | |
3565 | .unlink = ext4_unlink, | |
3566 | .symlink = ext4_symlink, | |
3567 | .mkdir = ext4_mkdir, | |
3568 | .rmdir = ext4_rmdir, | |
3569 | .mknod = ext4_mknod, | |
af51a2ac | 3570 | .tmpfile = ext4_tmpfile, |
0a7c3937 | 3571 | .rename2 = ext4_rename2, |
617ba13b | 3572 | .setattr = ext4_setattr, |
ac27a0ec DK |
3573 | .setxattr = generic_setxattr, |
3574 | .getxattr = generic_getxattr, | |
617ba13b | 3575 | .listxattr = ext4_listxattr, |
ac27a0ec | 3576 | .removexattr = generic_removexattr, |
4e34e719 | 3577 | .get_acl = ext4_get_acl, |
64e178a7 | 3578 | .set_acl = ext4_set_acl, |
abc8746e | 3579 | .fiemap = ext4_fiemap, |
ac27a0ec DK |
3580 | }; |
3581 | ||
754661f1 | 3582 | const struct inode_operations ext4_special_inode_operations = { |
617ba13b | 3583 | .setattr = ext4_setattr, |
ac27a0ec DK |
3584 | .setxattr = generic_setxattr, |
3585 | .getxattr = generic_getxattr, | |
617ba13b | 3586 | .listxattr = ext4_listxattr, |
ac27a0ec | 3587 | .removexattr = generic_removexattr, |
4e34e719 | 3588 | .get_acl = ext4_get_acl, |
64e178a7 | 3589 | .set_acl = ext4_set_acl, |
ac27a0ec | 3590 | }; |