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> | |
dab291af | 29 | #include <linux/jbd2.h> |
ac27a0ec | 30 | #include <linux/time.h> |
617ba13b | 31 | #include <linux/ext4_fs.h> |
dab291af | 32 | #include <linux/ext4_jbd2.h> |
ac27a0ec DK |
33 | #include <linux/fcntl.h> |
34 | #include <linux/stat.h> | |
35 | #include <linux/string.h> | |
36 | #include <linux/quotaops.h> | |
37 | #include <linux/buffer_head.h> | |
38 | #include <linux/bio.h> | |
ac27a0ec DK |
39 | |
40 | #include "namei.h" | |
41 | #include "xattr.h" | |
42 | #include "acl.h" | |
43 | ||
44 | /* | |
45 | * define how far ahead to read directories while searching them. | |
46 | */ | |
47 | #define NAMEI_RA_CHUNKS 2 | |
48 | #define NAMEI_RA_BLOCKS 4 | |
8c55e204 | 49 | #define NAMEI_RA_SIZE (NAMEI_RA_CHUNKS * NAMEI_RA_BLOCKS) |
ac27a0ec DK |
50 | #define NAMEI_RA_INDEX(c,b) (((c) * NAMEI_RA_BLOCKS) + (b)) |
51 | ||
617ba13b | 52 | static struct buffer_head *ext4_append(handle_t *handle, |
ac27a0ec | 53 | struct inode *inode, |
725d26d3 | 54 | ext4_lblk_t *block, int *err) |
ac27a0ec DK |
55 | { |
56 | struct buffer_head *bh; | |
57 | ||
58 | *block = inode->i_size >> inode->i_sb->s_blocksize_bits; | |
59 | ||
617ba13b | 60 | if ((bh = ext4_bread(handle, inode, *block, 1, err))) { |
ac27a0ec | 61 | inode->i_size += inode->i_sb->s_blocksize; |
617ba13b MC |
62 | EXT4_I(inode)->i_disksize = inode->i_size; |
63 | ext4_journal_get_write_access(handle,bh); | |
ac27a0ec DK |
64 | } |
65 | return bh; | |
66 | } | |
67 | ||
68 | #ifndef assert | |
69 | #define assert(test) J_ASSERT(test) | |
70 | #endif | |
71 | ||
72 | #ifndef swap | |
73 | #define swap(x, y) do { typeof(x) z = x; x = y; y = z; } while (0) | |
74 | #endif | |
75 | ||
76 | #ifdef DX_DEBUG | |
77 | #define dxtrace(command) command | |
78 | #else | |
79 | #define dxtrace(command) | |
80 | #endif | |
81 | ||
82 | struct fake_dirent | |
83 | { | |
84 | __le32 inode; | |
85 | __le16 rec_len; | |
86 | u8 name_len; | |
87 | u8 file_type; | |
88 | }; | |
89 | ||
90 | struct dx_countlimit | |
91 | { | |
92 | __le16 limit; | |
93 | __le16 count; | |
94 | }; | |
95 | ||
96 | struct dx_entry | |
97 | { | |
98 | __le32 hash; | |
99 | __le32 block; | |
100 | }; | |
101 | ||
102 | /* | |
103 | * dx_root_info is laid out so that if it should somehow get overlaid by a | |
104 | * dirent the two low bits of the hash version will be zero. Therefore, the | |
105 | * hash version mod 4 should never be 0. Sincerely, the paranoia department. | |
106 | */ | |
107 | ||
108 | struct dx_root | |
109 | { | |
110 | struct fake_dirent dot; | |
111 | char dot_name[4]; | |
112 | struct fake_dirent dotdot; | |
113 | char dotdot_name[4]; | |
114 | struct dx_root_info | |
115 | { | |
116 | __le32 reserved_zero; | |
117 | u8 hash_version; | |
118 | u8 info_length; /* 8 */ | |
119 | u8 indirect_levels; | |
120 | u8 unused_flags; | |
121 | } | |
122 | info; | |
123 | struct dx_entry entries[0]; | |
124 | }; | |
125 | ||
126 | struct dx_node | |
127 | { | |
128 | struct fake_dirent fake; | |
129 | struct dx_entry entries[0]; | |
130 | }; | |
131 | ||
132 | ||
133 | struct dx_frame | |
134 | { | |
135 | struct buffer_head *bh; | |
136 | struct dx_entry *entries; | |
137 | struct dx_entry *at; | |
138 | }; | |
139 | ||
140 | struct dx_map_entry | |
141 | { | |
142 | u32 hash; | |
ef2b02d3 ES |
143 | u16 offs; |
144 | u16 size; | |
ac27a0ec DK |
145 | }; |
146 | ||
725d26d3 AK |
147 | static inline ext4_lblk_t dx_get_block(struct dx_entry *entry); |
148 | static void dx_set_block(struct dx_entry *entry, ext4_lblk_t value); | |
ac27a0ec DK |
149 | static inline unsigned dx_get_hash (struct dx_entry *entry); |
150 | static void dx_set_hash (struct dx_entry *entry, unsigned value); | |
151 | static unsigned dx_get_count (struct dx_entry *entries); | |
152 | static unsigned dx_get_limit (struct dx_entry *entries); | |
153 | static void dx_set_count (struct dx_entry *entries, unsigned value); | |
154 | static void dx_set_limit (struct dx_entry *entries, unsigned value); | |
155 | static unsigned dx_root_limit (struct inode *dir, unsigned infosize); | |
156 | static unsigned dx_node_limit (struct inode *dir); | |
157 | static struct dx_frame *dx_probe(struct dentry *dentry, | |
158 | struct inode *dir, | |
159 | struct dx_hash_info *hinfo, | |
160 | struct dx_frame *frame, | |
161 | int *err); | |
162 | static void dx_release (struct dx_frame *frames); | |
617ba13b | 163 | static int dx_make_map (struct ext4_dir_entry_2 *de, int size, |
ac27a0ec DK |
164 | struct dx_hash_info *hinfo, struct dx_map_entry map[]); |
165 | static void dx_sort_map(struct dx_map_entry *map, unsigned count); | |
617ba13b | 166 | static struct ext4_dir_entry_2 *dx_move_dirents (char *from, char *to, |
ac27a0ec | 167 | struct dx_map_entry *offsets, int count); |
617ba13b | 168 | static struct ext4_dir_entry_2* dx_pack_dirents (char *base, int size); |
725d26d3 AK |
169 | static void dx_insert_block(struct dx_frame *frame, |
170 | u32 hash, ext4_lblk_t block); | |
617ba13b | 171 | static int ext4_htree_next_block(struct inode *dir, __u32 hash, |
ac27a0ec DK |
172 | struct dx_frame *frame, |
173 | struct dx_frame *frames, | |
174 | __u32 *start_hash); | |
617ba13b MC |
175 | static struct buffer_head * ext4_dx_find_entry(struct dentry *dentry, |
176 | struct ext4_dir_entry_2 **res_dir, int *err); | |
177 | static int ext4_dx_add_entry(handle_t *handle, struct dentry *dentry, | |
ac27a0ec DK |
178 | struct inode *inode); |
179 | ||
180 | /* | |
181 | * Future: use high four bits of block for coalesce-on-delete flags | |
182 | * Mask them off for now. | |
183 | */ | |
184 | ||
725d26d3 | 185 | static inline ext4_lblk_t dx_get_block(struct dx_entry *entry) |
ac27a0ec DK |
186 | { |
187 | return le32_to_cpu(entry->block) & 0x00ffffff; | |
188 | } | |
189 | ||
725d26d3 | 190 | static inline void dx_set_block(struct dx_entry *entry, ext4_lblk_t value) |
ac27a0ec DK |
191 | { |
192 | entry->block = cpu_to_le32(value); | |
193 | } | |
194 | ||
195 | static inline unsigned dx_get_hash (struct dx_entry *entry) | |
196 | { | |
197 | return le32_to_cpu(entry->hash); | |
198 | } | |
199 | ||
200 | static inline void dx_set_hash (struct dx_entry *entry, unsigned value) | |
201 | { | |
202 | entry->hash = cpu_to_le32(value); | |
203 | } | |
204 | ||
205 | static inline unsigned dx_get_count (struct dx_entry *entries) | |
206 | { | |
207 | return le16_to_cpu(((struct dx_countlimit *) entries)->count); | |
208 | } | |
209 | ||
210 | static inline unsigned dx_get_limit (struct dx_entry *entries) | |
211 | { | |
212 | return le16_to_cpu(((struct dx_countlimit *) entries)->limit); | |
213 | } | |
214 | ||
215 | static inline void dx_set_count (struct dx_entry *entries, unsigned value) | |
216 | { | |
217 | ((struct dx_countlimit *) entries)->count = cpu_to_le16(value); | |
218 | } | |
219 | ||
220 | static inline void dx_set_limit (struct dx_entry *entries, unsigned value) | |
221 | { | |
222 | ((struct dx_countlimit *) entries)->limit = cpu_to_le16(value); | |
223 | } | |
224 | ||
225 | static inline unsigned dx_root_limit (struct inode *dir, unsigned infosize) | |
226 | { | |
617ba13b MC |
227 | unsigned entry_space = dir->i_sb->s_blocksize - EXT4_DIR_REC_LEN(1) - |
228 | EXT4_DIR_REC_LEN(2) - infosize; | |
ac27a0ec DK |
229 | return 0? 20: entry_space / sizeof(struct dx_entry); |
230 | } | |
231 | ||
232 | static inline unsigned dx_node_limit (struct inode *dir) | |
233 | { | |
617ba13b | 234 | unsigned entry_space = dir->i_sb->s_blocksize - EXT4_DIR_REC_LEN(0); |
ac27a0ec DK |
235 | return 0? 22: entry_space / sizeof(struct dx_entry); |
236 | } | |
237 | ||
238 | /* | |
239 | * Debug | |
240 | */ | |
241 | #ifdef DX_DEBUG | |
242 | static void dx_show_index (char * label, struct dx_entry *entries) | |
243 | { | |
63f57933 | 244 | int i, n = dx_get_count (entries); |
8c55e204 | 245 | printk("%s index ", label); |
63f57933 | 246 | for (i = 0; i < n; i++) { |
725d26d3 AK |
247 | printk("%x->%lu ", i? dx_get_hash(entries + i) : |
248 | 0, (unsigned long)dx_get_block(entries + i)); | |
63f57933 AM |
249 | } |
250 | printk("\n"); | |
ac27a0ec DK |
251 | } |
252 | ||
253 | struct stats | |
254 | { | |
255 | unsigned names; | |
256 | unsigned space; | |
257 | unsigned bcount; | |
258 | }; | |
259 | ||
617ba13b | 260 | static struct stats dx_show_leaf(struct dx_hash_info *hinfo, struct ext4_dir_entry_2 *de, |
ac27a0ec DK |
261 | int size, int show_names) |
262 | { | |
263 | unsigned names = 0, space = 0; | |
264 | char *base = (char *) de; | |
265 | struct dx_hash_info h = *hinfo; | |
266 | ||
267 | printk("names: "); | |
268 | while ((char *) de < base + size) | |
269 | { | |
270 | if (de->inode) | |
271 | { | |
272 | if (show_names) | |
273 | { | |
274 | int len = de->name_len; | |
275 | char *name = de->name; | |
276 | while (len--) printk("%c", *name++); | |
617ba13b | 277 | ext4fs_dirhash(de->name, de->name_len, &h); |
ac27a0ec DK |
278 | printk(":%x.%u ", h.hash, |
279 | ((char *) de - base)); | |
280 | } | |
617ba13b | 281 | space += EXT4_DIR_REC_LEN(de->name_len); |
ac27a0ec DK |
282 | names++; |
283 | } | |
a72d7f83 | 284 | de = ext4_next_entry(de); |
ac27a0ec DK |
285 | } |
286 | printk("(%i)\n", names); | |
287 | return (struct stats) { names, space, 1 }; | |
288 | } | |
289 | ||
290 | struct stats dx_show_entries(struct dx_hash_info *hinfo, struct inode *dir, | |
291 | struct dx_entry *entries, int levels) | |
292 | { | |
293 | unsigned blocksize = dir->i_sb->s_blocksize; | |
294 | unsigned count = dx_get_count (entries), names = 0, space = 0, i; | |
295 | unsigned bcount = 0; | |
296 | struct buffer_head *bh; | |
297 | int err; | |
298 | printk("%i indexed blocks...\n", count); | |
299 | for (i = 0; i < count; i++, entries++) | |
300 | { | |
725d26d3 AK |
301 | ext4_lblk_t block = dx_get_block(entries); |
302 | ext4_lblk_t hash = i ? dx_get_hash(entries): 0; | |
ac27a0ec DK |
303 | u32 range = i < count - 1? (dx_get_hash(entries + 1) - hash): ~hash; |
304 | struct stats stats; | |
305 | printk("%s%3u:%03u hash %8x/%8x ",levels?"":" ", i, block, hash, range); | |
617ba13b | 306 | if (!(bh = ext4_bread (NULL,dir, block, 0,&err))) continue; |
ac27a0ec DK |
307 | stats = levels? |
308 | dx_show_entries(hinfo, dir, ((struct dx_node *) bh->b_data)->entries, levels - 1): | |
617ba13b | 309 | dx_show_leaf(hinfo, (struct ext4_dir_entry_2 *) bh->b_data, blocksize, 0); |
ac27a0ec DK |
310 | names += stats.names; |
311 | space += stats.space; | |
312 | bcount += stats.bcount; | |
313 | brelse (bh); | |
314 | } | |
315 | if (bcount) | |
316 | printk("%snames %u, fullness %u (%u%%)\n", levels?"":" ", | |
317 | names, space/bcount,(space/bcount)*100/blocksize); | |
318 | return (struct stats) { names, space, bcount}; | |
319 | } | |
320 | #endif /* DX_DEBUG */ | |
321 | ||
322 | /* | |
323 | * Probe for a directory leaf block to search. | |
324 | * | |
325 | * dx_probe can return ERR_BAD_DX_DIR, which means there was a format | |
326 | * error in the directory index, and the caller should fall back to | |
327 | * searching the directory normally. The callers of dx_probe **MUST** | |
328 | * check for this error code, and make sure it never gets reflected | |
329 | * back to userspace. | |
330 | */ | |
331 | static struct dx_frame * | |
332 | dx_probe(struct dentry *dentry, struct inode *dir, | |
333 | struct dx_hash_info *hinfo, struct dx_frame *frame_in, int *err) | |
334 | { | |
335 | unsigned count, indirect; | |
336 | struct dx_entry *at, *entries, *p, *q, *m; | |
337 | struct dx_root *root; | |
338 | struct buffer_head *bh; | |
339 | struct dx_frame *frame = frame_in; | |
340 | u32 hash; | |
341 | ||
342 | frame->bh = NULL; | |
343 | if (dentry) | |
344 | dir = dentry->d_parent->d_inode; | |
617ba13b | 345 | if (!(bh = ext4_bread (NULL,dir, 0, 0, err))) |
ac27a0ec DK |
346 | goto fail; |
347 | root = (struct dx_root *) bh->b_data; | |
348 | if (root->info.hash_version != DX_HASH_TEA && | |
349 | root->info.hash_version != DX_HASH_HALF_MD4 && | |
350 | root->info.hash_version != DX_HASH_LEGACY) { | |
617ba13b | 351 | ext4_warning(dir->i_sb, __FUNCTION__, |
ac27a0ec DK |
352 | "Unrecognised inode hash code %d", |
353 | root->info.hash_version); | |
354 | brelse(bh); | |
355 | *err = ERR_BAD_DX_DIR; | |
356 | goto fail; | |
357 | } | |
358 | hinfo->hash_version = root->info.hash_version; | |
617ba13b | 359 | hinfo->seed = EXT4_SB(dir->i_sb)->s_hash_seed; |
ac27a0ec | 360 | if (dentry) |
617ba13b | 361 | ext4fs_dirhash(dentry->d_name.name, dentry->d_name.len, hinfo); |
ac27a0ec DK |
362 | hash = hinfo->hash; |
363 | ||
364 | if (root->info.unused_flags & 1) { | |
617ba13b | 365 | ext4_warning(dir->i_sb, __FUNCTION__, |
ac27a0ec DK |
366 | "Unimplemented inode hash flags: %#06x", |
367 | root->info.unused_flags); | |
368 | brelse(bh); | |
369 | *err = ERR_BAD_DX_DIR; | |
370 | goto fail; | |
371 | } | |
372 | ||
373 | if ((indirect = root->info.indirect_levels) > 1) { | |
617ba13b | 374 | ext4_warning(dir->i_sb, __FUNCTION__, |
ac27a0ec DK |
375 | "Unimplemented inode hash depth: %#06x", |
376 | root->info.indirect_levels); | |
377 | brelse(bh); | |
378 | *err = ERR_BAD_DX_DIR; | |
379 | goto fail; | |
380 | } | |
381 | ||
382 | entries = (struct dx_entry *) (((char *)&root->info) + | |
383 | root->info.info_length); | |
3d82abae ES |
384 | |
385 | if (dx_get_limit(entries) != dx_root_limit(dir, | |
386 | root->info.info_length)) { | |
387 | ext4_warning(dir->i_sb, __FUNCTION__, | |
388 | "dx entry: limit != root limit"); | |
389 | brelse(bh); | |
390 | *err = ERR_BAD_DX_DIR; | |
391 | goto fail; | |
392 | } | |
393 | ||
ac27a0ec DK |
394 | dxtrace (printk("Look up %x", hash)); |
395 | while (1) | |
396 | { | |
397 | count = dx_get_count(entries); | |
3d82abae ES |
398 | if (!count || count > dx_get_limit(entries)) { |
399 | ext4_warning(dir->i_sb, __FUNCTION__, | |
400 | "dx entry: no count or count > limit"); | |
401 | brelse(bh); | |
402 | *err = ERR_BAD_DX_DIR; | |
403 | goto fail2; | |
404 | } | |
405 | ||
ac27a0ec DK |
406 | p = entries + 1; |
407 | q = entries + count - 1; | |
408 | while (p <= q) | |
409 | { | |
410 | m = p + (q - p)/2; | |
411 | dxtrace(printk(".")); | |
412 | if (dx_get_hash(m) > hash) | |
413 | q = m - 1; | |
414 | else | |
415 | p = m + 1; | |
416 | } | |
417 | ||
418 | if (0) // linear search cross check | |
419 | { | |
420 | unsigned n = count - 1; | |
421 | at = entries; | |
422 | while (n--) | |
423 | { | |
424 | dxtrace(printk(",")); | |
425 | if (dx_get_hash(++at) > hash) | |
426 | { | |
427 | at--; | |
428 | break; | |
429 | } | |
430 | } | |
431 | assert (at == p - 1); | |
432 | } | |
433 | ||
434 | at = p - 1; | |
435 | dxtrace(printk(" %x->%u\n", at == entries? 0: dx_get_hash(at), dx_get_block(at))); | |
436 | frame->bh = bh; | |
437 | frame->entries = entries; | |
438 | frame->at = at; | |
439 | if (!indirect--) return frame; | |
617ba13b | 440 | if (!(bh = ext4_bread (NULL,dir, dx_get_block(at), 0, err))) |
ac27a0ec DK |
441 | goto fail2; |
442 | at = entries = ((struct dx_node *) bh->b_data)->entries; | |
3d82abae ES |
443 | if (dx_get_limit(entries) != dx_node_limit (dir)) { |
444 | ext4_warning(dir->i_sb, __FUNCTION__, | |
445 | "dx entry: limit != node limit"); | |
446 | brelse(bh); | |
447 | *err = ERR_BAD_DX_DIR; | |
448 | goto fail2; | |
449 | } | |
ac27a0ec | 450 | frame++; |
3d82abae | 451 | frame->bh = NULL; |
ac27a0ec DK |
452 | } |
453 | fail2: | |
454 | while (frame >= frame_in) { | |
455 | brelse(frame->bh); | |
456 | frame--; | |
457 | } | |
458 | fail: | |
3d82abae ES |
459 | if (*err == ERR_BAD_DX_DIR) |
460 | ext4_warning(dir->i_sb, __FUNCTION__, | |
461 | "Corrupt dir inode %ld, running e2fsck is " | |
462 | "recommended.", dir->i_ino); | |
ac27a0ec DK |
463 | return NULL; |
464 | } | |
465 | ||
466 | static void dx_release (struct dx_frame *frames) | |
467 | { | |
468 | if (frames[0].bh == NULL) | |
469 | return; | |
470 | ||
471 | if (((struct dx_root *) frames[0].bh->b_data)->info.indirect_levels) | |
472 | brelse(frames[1].bh); | |
473 | brelse(frames[0].bh); | |
474 | } | |
475 | ||
476 | /* | |
477 | * This function increments the frame pointer to search the next leaf | |
478 | * block, and reads in the necessary intervening nodes if the search | |
479 | * should be necessary. Whether or not the search is necessary is | |
480 | * controlled by the hash parameter. If the hash value is even, then | |
481 | * the search is only continued if the next block starts with that | |
482 | * hash value. This is used if we are searching for a specific file. | |
483 | * | |
484 | * If the hash value is HASH_NB_ALWAYS, then always go to the next block. | |
485 | * | |
486 | * This function returns 1 if the caller should continue to search, | |
487 | * or 0 if it should not. If there is an error reading one of the | |
488 | * index blocks, it will a negative error code. | |
489 | * | |
490 | * If start_hash is non-null, it will be filled in with the starting | |
491 | * hash of the next page. | |
492 | */ | |
617ba13b | 493 | static int ext4_htree_next_block(struct inode *dir, __u32 hash, |
ac27a0ec DK |
494 | struct dx_frame *frame, |
495 | struct dx_frame *frames, | |
496 | __u32 *start_hash) | |
497 | { | |
498 | struct dx_frame *p; | |
499 | struct buffer_head *bh; | |
500 | int err, num_frames = 0; | |
501 | __u32 bhash; | |
502 | ||
503 | p = frame; | |
504 | /* | |
505 | * Find the next leaf page by incrementing the frame pointer. | |
506 | * If we run out of entries in the interior node, loop around and | |
507 | * increment pointer in the parent node. When we break out of | |
508 | * this loop, num_frames indicates the number of interior | |
509 | * nodes need to be read. | |
510 | */ | |
511 | while (1) { | |
512 | if (++(p->at) < p->entries + dx_get_count(p->entries)) | |
513 | break; | |
514 | if (p == frames) | |
515 | return 0; | |
516 | num_frames++; | |
517 | p--; | |
518 | } | |
519 | ||
520 | /* | |
521 | * If the hash is 1, then continue only if the next page has a | |
522 | * continuation hash of any value. This is used for readdir | |
523 | * handling. Otherwise, check to see if the hash matches the | |
524 | * desired contiuation hash. If it doesn't, return since | |
525 | * there's no point to read in the successive index pages. | |
526 | */ | |
527 | bhash = dx_get_hash(p->at); | |
528 | if (start_hash) | |
529 | *start_hash = bhash; | |
530 | if ((hash & 1) == 0) { | |
531 | if ((bhash & ~1) != hash) | |
532 | return 0; | |
533 | } | |
534 | /* | |
535 | * If the hash is HASH_NB_ALWAYS, we always go to the next | |
536 | * block so no check is necessary | |
537 | */ | |
538 | while (num_frames--) { | |
617ba13b | 539 | if (!(bh = ext4_bread(NULL, dir, dx_get_block(p->at), |
ac27a0ec DK |
540 | 0, &err))) |
541 | return err; /* Failure */ | |
542 | p++; | |
543 | brelse (p->bh); | |
544 | p->bh = bh; | |
545 | p->at = p->entries = ((struct dx_node *) bh->b_data)->entries; | |
546 | } | |
547 | return 1; | |
548 | } | |
549 | ||
550 | ||
551 | /* | |
552 | * p is at least 6 bytes before the end of page | |
553 | */ | |
617ba13b | 554 | static inline struct ext4_dir_entry_2 *ext4_next_entry(struct ext4_dir_entry_2 *p) |
ac27a0ec | 555 | { |
a72d7f83 JK |
556 | return (struct ext4_dir_entry_2 *)((char *)p + |
557 | ext4_rec_len_from_disk(p->rec_len)); | |
ac27a0ec DK |
558 | } |
559 | ||
560 | /* | |
561 | * This function fills a red-black tree with information from a | |
562 | * directory block. It returns the number directory entries loaded | |
563 | * into the tree. If there is an error it is returned in err. | |
564 | */ | |
565 | static int htree_dirblock_to_tree(struct file *dir_file, | |
725d26d3 | 566 | struct inode *dir, ext4_lblk_t block, |
ac27a0ec DK |
567 | struct dx_hash_info *hinfo, |
568 | __u32 start_hash, __u32 start_minor_hash) | |
569 | { | |
570 | struct buffer_head *bh; | |
617ba13b | 571 | struct ext4_dir_entry_2 *de, *top; |
ac27a0ec DK |
572 | int err, count = 0; |
573 | ||
725d26d3 AK |
574 | dxtrace(printk(KERN_INFO "In htree dirblock_to_tree: block %lu\n", |
575 | (unsigned long)block)); | |
617ba13b | 576 | if (!(bh = ext4_bread (NULL, dir, block, 0, &err))) |
ac27a0ec DK |
577 | return err; |
578 | ||
617ba13b MC |
579 | de = (struct ext4_dir_entry_2 *) bh->b_data; |
580 | top = (struct ext4_dir_entry_2 *) ((char *) de + | |
ac27a0ec | 581 | dir->i_sb->s_blocksize - |
617ba13b MC |
582 | EXT4_DIR_REC_LEN(0)); |
583 | for (; de < top; de = ext4_next_entry(de)) { | |
e6c40211 ES |
584 | if (!ext4_check_dir_entry("htree_dirblock_to_tree", dir, de, bh, |
585 | (block<<EXT4_BLOCK_SIZE_BITS(dir->i_sb)) | |
586 | +((char *)de - bh->b_data))) { | |
587 | /* On error, skip the f_pos to the next block. */ | |
588 | dir_file->f_pos = (dir_file->f_pos | | |
589 | (dir->i_sb->s_blocksize - 1)) + 1; | |
590 | brelse (bh); | |
591 | return count; | |
592 | } | |
617ba13b | 593 | ext4fs_dirhash(de->name, de->name_len, hinfo); |
ac27a0ec DK |
594 | if ((hinfo->hash < start_hash) || |
595 | ((hinfo->hash == start_hash) && | |
596 | (hinfo->minor_hash < start_minor_hash))) | |
597 | continue; | |
598 | if (de->inode == 0) | |
599 | continue; | |
617ba13b | 600 | if ((err = ext4_htree_store_dirent(dir_file, |
ac27a0ec DK |
601 | hinfo->hash, hinfo->minor_hash, de)) != 0) { |
602 | brelse(bh); | |
603 | return err; | |
604 | } | |
605 | count++; | |
606 | } | |
607 | brelse(bh); | |
608 | return count; | |
609 | } | |
610 | ||
611 | ||
612 | /* | |
613 | * This function fills a red-black tree with information from a | |
614 | * directory. We start scanning the directory in hash order, starting | |
615 | * at start_hash and start_minor_hash. | |
616 | * | |
617 | * This function returns the number of entries inserted into the tree, | |
618 | * or a negative error code. | |
619 | */ | |
617ba13b | 620 | int ext4_htree_fill_tree(struct file *dir_file, __u32 start_hash, |
ac27a0ec DK |
621 | __u32 start_minor_hash, __u32 *next_hash) |
622 | { | |
623 | struct dx_hash_info hinfo; | |
617ba13b | 624 | struct ext4_dir_entry_2 *de; |
ac27a0ec DK |
625 | struct dx_frame frames[2], *frame; |
626 | struct inode *dir; | |
725d26d3 | 627 | ext4_lblk_t block; |
ac27a0ec | 628 | int count = 0; |
725d26d3 | 629 | int ret, err; |
ac27a0ec DK |
630 | __u32 hashval; |
631 | ||
632 | dxtrace(printk("In htree_fill_tree, start hash: %x:%x\n", start_hash, | |
633 | start_minor_hash)); | |
9d549890 | 634 | dir = dir_file->f_path.dentry->d_inode; |
617ba13b MC |
635 | if (!(EXT4_I(dir)->i_flags & EXT4_INDEX_FL)) { |
636 | hinfo.hash_version = EXT4_SB(dir->i_sb)->s_def_hash_version; | |
637 | hinfo.seed = EXT4_SB(dir->i_sb)->s_hash_seed; | |
ac27a0ec DK |
638 | count = htree_dirblock_to_tree(dir_file, dir, 0, &hinfo, |
639 | start_hash, start_minor_hash); | |
640 | *next_hash = ~0; | |
641 | return count; | |
642 | } | |
643 | hinfo.hash = start_hash; | |
644 | hinfo.minor_hash = 0; | |
9d549890 | 645 | frame = dx_probe(NULL, dir_file->f_path.dentry->d_inode, &hinfo, frames, &err); |
ac27a0ec DK |
646 | if (!frame) |
647 | return err; | |
648 | ||
649 | /* Add '.' and '..' from the htree header */ | |
650 | if (!start_hash && !start_minor_hash) { | |
617ba13b MC |
651 | de = (struct ext4_dir_entry_2 *) frames[0].bh->b_data; |
652 | if ((err = ext4_htree_store_dirent(dir_file, 0, 0, de)) != 0) | |
ac27a0ec DK |
653 | goto errout; |
654 | count++; | |
655 | } | |
656 | if (start_hash < 2 || (start_hash ==2 && start_minor_hash==0)) { | |
617ba13b MC |
657 | de = (struct ext4_dir_entry_2 *) frames[0].bh->b_data; |
658 | de = ext4_next_entry(de); | |
659 | if ((err = ext4_htree_store_dirent(dir_file, 2, 0, de)) != 0) | |
ac27a0ec DK |
660 | goto errout; |
661 | count++; | |
662 | } | |
663 | ||
664 | while (1) { | |
665 | block = dx_get_block(frame->at); | |
666 | ret = htree_dirblock_to_tree(dir_file, dir, block, &hinfo, | |
667 | start_hash, start_minor_hash); | |
668 | if (ret < 0) { | |
669 | err = ret; | |
670 | goto errout; | |
671 | } | |
672 | count += ret; | |
673 | hashval = ~0; | |
617ba13b | 674 | ret = ext4_htree_next_block(dir, HASH_NB_ALWAYS, |
ac27a0ec DK |
675 | frame, frames, &hashval); |
676 | *next_hash = hashval; | |
677 | if (ret < 0) { | |
678 | err = ret; | |
679 | goto errout; | |
680 | } | |
681 | /* | |
682 | * Stop if: (a) there are no more entries, or | |
683 | * (b) we have inserted at least one entry and the | |
684 | * next hash value is not a continuation | |
685 | */ | |
686 | if ((ret == 0) || | |
687 | (count && ((hashval & 1) == 0))) | |
688 | break; | |
689 | } | |
690 | dx_release(frames); | |
691 | dxtrace(printk("Fill tree: returned %d entries, next hash: %x\n", | |
692 | count, *next_hash)); | |
693 | return count; | |
694 | errout: | |
695 | dx_release(frames); | |
696 | return (err); | |
697 | } | |
698 | ||
699 | ||
700 | /* | |
701 | * Directory block splitting, compacting | |
702 | */ | |
703 | ||
ef2b02d3 ES |
704 | /* |
705 | * Create map of hash values, offsets, and sizes, stored at end of block. | |
706 | * Returns number of entries mapped. | |
707 | */ | |
617ba13b | 708 | static int dx_make_map (struct ext4_dir_entry_2 *de, int size, |
ac27a0ec DK |
709 | struct dx_hash_info *hinfo, struct dx_map_entry *map_tail) |
710 | { | |
711 | int count = 0; | |
712 | char *base = (char *) de; | |
713 | struct dx_hash_info h = *hinfo; | |
714 | ||
715 | while ((char *) de < base + size) | |
716 | { | |
717 | if (de->name_len && de->inode) { | |
617ba13b | 718 | ext4fs_dirhash(de->name, de->name_len, &h); |
ac27a0ec DK |
719 | map_tail--; |
720 | map_tail->hash = h.hash; | |
ef2b02d3 ES |
721 | map_tail->offs = (u16) ((char *) de - base); |
722 | map_tail->size = le16_to_cpu(de->rec_len); | |
ac27a0ec DK |
723 | count++; |
724 | cond_resched(); | |
725 | } | |
726 | /* XXX: do we need to check rec_len == 0 case? -Chris */ | |
a72d7f83 | 727 | de = ext4_next_entry(de); |
ac27a0ec DK |
728 | } |
729 | return count; | |
730 | } | |
731 | ||
ef2b02d3 | 732 | /* Sort map by hash value */ |
ac27a0ec DK |
733 | static void dx_sort_map (struct dx_map_entry *map, unsigned count) |
734 | { | |
63f57933 AM |
735 | struct dx_map_entry *p, *q, *top = map + count - 1; |
736 | int more; | |
737 | /* Combsort until bubble sort doesn't suck */ | |
738 | while (count > 2) { | |
739 | count = count*10/13; | |
740 | if (count - 9 < 2) /* 9, 10 -> 11 */ | |
741 | count = 11; | |
742 | for (p = top, q = p - count; q >= map; p--, q--) | |
743 | if (p->hash < q->hash) | |
744 | swap(*p, *q); | |
745 | } | |
746 | /* Garden variety bubble sort */ | |
747 | do { | |
748 | more = 0; | |
749 | q = top; | |
750 | while (q-- > map) { | |
751 | if (q[1].hash >= q[0].hash) | |
ac27a0ec | 752 | continue; |
63f57933 AM |
753 | swap(*(q+1), *q); |
754 | more = 1; | |
ac27a0ec DK |
755 | } |
756 | } while(more); | |
757 | } | |
758 | ||
725d26d3 | 759 | static void dx_insert_block(struct dx_frame *frame, u32 hash, ext4_lblk_t block) |
ac27a0ec DK |
760 | { |
761 | struct dx_entry *entries = frame->entries; | |
762 | struct dx_entry *old = frame->at, *new = old + 1; | |
763 | int count = dx_get_count(entries); | |
764 | ||
765 | assert(count < dx_get_limit(entries)); | |
766 | assert(old < entries + count); | |
767 | memmove(new + 1, new, (char *)(entries + count) - (char *)(new)); | |
768 | dx_set_hash(new, hash); | |
769 | dx_set_block(new, block); | |
770 | dx_set_count(entries, count + 1); | |
771 | } | |
ac27a0ec | 772 | |
617ba13b | 773 | static void ext4_update_dx_flag(struct inode *inode) |
ac27a0ec | 774 | { |
617ba13b MC |
775 | if (!EXT4_HAS_COMPAT_FEATURE(inode->i_sb, |
776 | EXT4_FEATURE_COMPAT_DIR_INDEX)) | |
777 | EXT4_I(inode)->i_flags &= ~EXT4_INDEX_FL; | |
ac27a0ec DK |
778 | } |
779 | ||
780 | /* | |
617ba13b | 781 | * NOTE! unlike strncmp, ext4_match returns 1 for success, 0 for failure. |
ac27a0ec | 782 | * |
617ba13b | 783 | * `len <= EXT4_NAME_LEN' is guaranteed by caller. |
ac27a0ec DK |
784 | * `de != NULL' is guaranteed by caller. |
785 | */ | |
617ba13b MC |
786 | static inline int ext4_match (int len, const char * const name, |
787 | struct ext4_dir_entry_2 * de) | |
ac27a0ec DK |
788 | { |
789 | if (len != de->name_len) | |
790 | return 0; | |
791 | if (!de->inode) | |
792 | return 0; | |
793 | return !memcmp(name, de->name, len); | |
794 | } | |
795 | ||
796 | /* | |
797 | * Returns 0 if not found, -1 on failure, and 1 on success | |
798 | */ | |
799 | static inline int search_dirblock(struct buffer_head * bh, | |
800 | struct inode *dir, | |
801 | struct dentry *dentry, | |
802 | unsigned long offset, | |
617ba13b | 803 | struct ext4_dir_entry_2 ** res_dir) |
ac27a0ec | 804 | { |
617ba13b | 805 | struct ext4_dir_entry_2 * de; |
ac27a0ec DK |
806 | char * dlimit; |
807 | int de_len; | |
808 | const char *name = dentry->d_name.name; | |
809 | int namelen = dentry->d_name.len; | |
810 | ||
617ba13b | 811 | de = (struct ext4_dir_entry_2 *) bh->b_data; |
ac27a0ec DK |
812 | dlimit = bh->b_data + dir->i_sb->s_blocksize; |
813 | while ((char *) de < dlimit) { | |
814 | /* this code is executed quadratically often */ | |
815 | /* do minimal checking `by hand' */ | |
816 | ||
817 | if ((char *) de + namelen <= dlimit && | |
617ba13b | 818 | ext4_match (namelen, name, de)) { |
ac27a0ec | 819 | /* found a match - just to be sure, do a full check */ |
617ba13b | 820 | if (!ext4_check_dir_entry("ext4_find_entry", |
ac27a0ec DK |
821 | dir, de, bh, offset)) |
822 | return -1; | |
823 | *res_dir = de; | |
824 | return 1; | |
825 | } | |
826 | /* prevent looping on a bad block */ | |
a72d7f83 | 827 | de_len = ext4_rec_len_from_disk(de->rec_len); |
ac27a0ec DK |
828 | if (de_len <= 0) |
829 | return -1; | |
830 | offset += de_len; | |
617ba13b | 831 | de = (struct ext4_dir_entry_2 *) ((char *) de + de_len); |
ac27a0ec DK |
832 | } |
833 | return 0; | |
834 | } | |
835 | ||
836 | ||
837 | /* | |
617ba13b | 838 | * ext4_find_entry() |
ac27a0ec DK |
839 | * |
840 | * finds an entry in the specified directory with the wanted name. It | |
841 | * returns the cache buffer in which the entry was found, and the entry | |
842 | * itself (as a parameter - res_dir). It does NOT read the inode of the | |
843 | * entry - you'll have to do that yourself if you want to. | |
844 | * | |
845 | * The returned buffer_head has ->b_count elevated. The caller is expected | |
846 | * to brelse() it when appropriate. | |
847 | */ | |
617ba13b MC |
848 | static struct buffer_head * ext4_find_entry (struct dentry *dentry, |
849 | struct ext4_dir_entry_2 ** res_dir) | |
ac27a0ec DK |
850 | { |
851 | struct super_block * sb; | |
852 | struct buffer_head * bh_use[NAMEI_RA_SIZE]; | |
853 | struct buffer_head * bh, *ret = NULL; | |
725d26d3 | 854 | ext4_lblk_t start, block, b; |
ac27a0ec DK |
855 | int ra_max = 0; /* Number of bh's in the readahead |
856 | buffer, bh_use[] */ | |
857 | int ra_ptr = 0; /* Current index into readahead | |
858 | buffer */ | |
859 | int num = 0; | |
725d26d3 AK |
860 | ext4_lblk_t nblocks; |
861 | int i, err; | |
ac27a0ec DK |
862 | struct inode *dir = dentry->d_parent->d_inode; |
863 | int namelen; | |
ac27a0ec DK |
864 | |
865 | *res_dir = NULL; | |
866 | sb = dir->i_sb; | |
ac27a0ec | 867 | namelen = dentry->d_name.len; |
617ba13b | 868 | if (namelen > EXT4_NAME_LEN) |
ac27a0ec | 869 | return NULL; |
ac27a0ec | 870 | if (is_dx(dir)) { |
617ba13b | 871 | bh = ext4_dx_find_entry(dentry, res_dir, &err); |
ac27a0ec DK |
872 | /* |
873 | * On success, or if the error was file not found, | |
874 | * return. Otherwise, fall back to doing a search the | |
875 | * old fashioned way. | |
876 | */ | |
877 | if (bh || (err != ERR_BAD_DX_DIR)) | |
878 | return bh; | |
617ba13b | 879 | dxtrace(printk("ext4_find_entry: dx failed, falling back\n")); |
ac27a0ec | 880 | } |
617ba13b MC |
881 | nblocks = dir->i_size >> EXT4_BLOCK_SIZE_BITS(sb); |
882 | start = EXT4_I(dir)->i_dir_start_lookup; | |
ac27a0ec DK |
883 | if (start >= nblocks) |
884 | start = 0; | |
885 | block = start; | |
886 | restart: | |
887 | do { | |
888 | /* | |
889 | * We deal with the read-ahead logic here. | |
890 | */ | |
891 | if (ra_ptr >= ra_max) { | |
892 | /* Refill the readahead buffer */ | |
893 | ra_ptr = 0; | |
894 | b = block; | |
895 | for (ra_max = 0; ra_max < NAMEI_RA_SIZE; ra_max++) { | |
896 | /* | |
897 | * Terminate if we reach the end of the | |
898 | * directory and must wrap, or if our | |
899 | * search has finished at this block. | |
900 | */ | |
901 | if (b >= nblocks || (num && block == start)) { | |
902 | bh_use[ra_max] = NULL; | |
903 | break; | |
904 | } | |
905 | num++; | |
617ba13b | 906 | bh = ext4_getblk(NULL, dir, b++, 0, &err); |
ac27a0ec DK |
907 | bh_use[ra_max] = bh; |
908 | if (bh) | |
909 | ll_rw_block(READ_META, 1, &bh); | |
910 | } | |
911 | } | |
912 | if ((bh = bh_use[ra_ptr++]) == NULL) | |
913 | goto next; | |
914 | wait_on_buffer(bh); | |
915 | if (!buffer_uptodate(bh)) { | |
916 | /* read error, skip block & hope for the best */ | |
617ba13b | 917 | ext4_error(sb, __FUNCTION__, "reading directory #%lu " |
725d26d3 AK |
918 | "offset %lu", dir->i_ino, |
919 | (unsigned long)block); | |
ac27a0ec DK |
920 | brelse(bh); |
921 | goto next; | |
922 | } | |
923 | i = search_dirblock(bh, dir, dentry, | |
617ba13b | 924 | block << EXT4_BLOCK_SIZE_BITS(sb), res_dir); |
ac27a0ec | 925 | if (i == 1) { |
617ba13b | 926 | EXT4_I(dir)->i_dir_start_lookup = block; |
ac27a0ec DK |
927 | ret = bh; |
928 | goto cleanup_and_exit; | |
929 | } else { | |
930 | brelse(bh); | |
931 | if (i < 0) | |
932 | goto cleanup_and_exit; | |
933 | } | |
934 | next: | |
935 | if (++block >= nblocks) | |
936 | block = 0; | |
937 | } while (block != start); | |
938 | ||
939 | /* | |
940 | * If the directory has grown while we were searching, then | |
941 | * search the last part of the directory before giving up. | |
942 | */ | |
943 | block = nblocks; | |
617ba13b | 944 | nblocks = dir->i_size >> EXT4_BLOCK_SIZE_BITS(sb); |
ac27a0ec DK |
945 | if (block < nblocks) { |
946 | start = 0; | |
947 | goto restart; | |
948 | } | |
949 | ||
950 | cleanup_and_exit: | |
951 | /* Clean up the read-ahead blocks */ | |
952 | for (; ra_ptr < ra_max; ra_ptr++) | |
953 | brelse (bh_use[ra_ptr]); | |
954 | return ret; | |
955 | } | |
956 | ||
617ba13b MC |
957 | static struct buffer_head * ext4_dx_find_entry(struct dentry *dentry, |
958 | struct ext4_dir_entry_2 **res_dir, int *err) | |
ac27a0ec DK |
959 | { |
960 | struct super_block * sb; | |
961 | struct dx_hash_info hinfo; | |
962 | u32 hash; | |
963 | struct dx_frame frames[2], *frame; | |
617ba13b | 964 | struct ext4_dir_entry_2 *de, *top; |
ac27a0ec | 965 | struct buffer_head *bh; |
725d26d3 | 966 | ext4_lblk_t block; |
ac27a0ec DK |
967 | int retval; |
968 | int namelen = dentry->d_name.len; | |
969 | const u8 *name = dentry->d_name.name; | |
970 | struct inode *dir = dentry->d_parent->d_inode; | |
971 | ||
972 | sb = dir->i_sb; | |
973 | /* NFS may look up ".." - look at dx_root directory block */ | |
974 | if (namelen > 2 || name[0] != '.'||(name[1] != '.' && name[1] != '\0')){ | |
975 | if (!(frame = dx_probe(dentry, NULL, &hinfo, frames, err))) | |
976 | return NULL; | |
977 | } else { | |
978 | frame = frames; | |
979 | frame->bh = NULL; /* for dx_release() */ | |
980 | frame->at = (struct dx_entry *)frames; /* hack for zero entry*/ | |
981 | dx_set_block(frame->at, 0); /* dx_root block is 0 */ | |
982 | } | |
983 | hash = hinfo.hash; | |
984 | do { | |
985 | block = dx_get_block(frame->at); | |
617ba13b | 986 | if (!(bh = ext4_bread (NULL,dir, block, 0, err))) |
ac27a0ec | 987 | goto errout; |
617ba13b MC |
988 | de = (struct ext4_dir_entry_2 *) bh->b_data; |
989 | top = (struct ext4_dir_entry_2 *) ((char *) de + sb->s_blocksize - | |
990 | EXT4_DIR_REC_LEN(0)); | |
991 | for (; de < top; de = ext4_next_entry(de)) | |
992 | if (ext4_match (namelen, name, de)) { | |
993 | if (!ext4_check_dir_entry("ext4_find_entry", | |
ac27a0ec | 994 | dir, de, bh, |
617ba13b | 995 | (block<<EXT4_BLOCK_SIZE_BITS(sb)) |
ac27a0ec DK |
996 | +((char *)de - bh->b_data))) { |
997 | brelse (bh); | |
fedee54d | 998 | *err = ERR_BAD_DX_DIR; |
ac27a0ec DK |
999 | goto errout; |
1000 | } | |
1001 | *res_dir = de; | |
1002 | dx_release (frames); | |
1003 | return bh; | |
1004 | } | |
1005 | brelse (bh); | |
1006 | /* Check to see if we should continue to search */ | |
617ba13b | 1007 | retval = ext4_htree_next_block(dir, hash, frame, |
ac27a0ec DK |
1008 | frames, NULL); |
1009 | if (retval < 0) { | |
617ba13b | 1010 | ext4_warning(sb, __FUNCTION__, |
ac27a0ec DK |
1011 | "error reading index page in directory #%lu", |
1012 | dir->i_ino); | |
1013 | *err = retval; | |
1014 | goto errout; | |
1015 | } | |
1016 | } while (retval == 1); | |
1017 | ||
1018 | *err = -ENOENT; | |
1019 | errout: | |
1020 | dxtrace(printk("%s not found\n", name)); | |
1021 | dx_release (frames); | |
1022 | return NULL; | |
1023 | } | |
ac27a0ec | 1024 | |
617ba13b | 1025 | static struct dentry *ext4_lookup(struct inode * dir, struct dentry *dentry, struct nameidata *nd) |
ac27a0ec DK |
1026 | { |
1027 | struct inode * inode; | |
617ba13b | 1028 | struct ext4_dir_entry_2 * de; |
ac27a0ec DK |
1029 | struct buffer_head * bh; |
1030 | ||
617ba13b | 1031 | if (dentry->d_name.len > EXT4_NAME_LEN) |
ac27a0ec DK |
1032 | return ERR_PTR(-ENAMETOOLONG); |
1033 | ||
617ba13b | 1034 | bh = ext4_find_entry(dentry, &de); |
ac27a0ec DK |
1035 | inode = NULL; |
1036 | if (bh) { | |
1037 | unsigned long ino = le32_to_cpu(de->inode); | |
1038 | brelse (bh); | |
617ba13b MC |
1039 | if (!ext4_valid_inum(dir->i_sb, ino)) { |
1040 | ext4_error(dir->i_sb, "ext4_lookup", | |
ac27a0ec | 1041 | "bad inode number: %lu", ino); |
1d1fe1ee | 1042 | return ERR_PTR(-EIO); |
a6c15c2b | 1043 | } |
1d1fe1ee DH |
1044 | inode = ext4_iget(dir->i_sb, ino); |
1045 | if (IS_ERR(inode)) | |
1046 | return ERR_CAST(inode); | |
ac27a0ec DK |
1047 | } |
1048 | return d_splice_alias(inode, dentry); | |
1049 | } | |
1050 | ||
1051 | ||
617ba13b | 1052 | struct dentry *ext4_get_parent(struct dentry *child) |
ac27a0ec DK |
1053 | { |
1054 | unsigned long ino; | |
1055 | struct dentry *parent; | |
1056 | struct inode *inode; | |
1057 | struct dentry dotdot; | |
617ba13b | 1058 | struct ext4_dir_entry_2 * de; |
ac27a0ec DK |
1059 | struct buffer_head *bh; |
1060 | ||
1061 | dotdot.d_name.name = ".."; | |
1062 | dotdot.d_name.len = 2; | |
1063 | dotdot.d_parent = child; /* confusing, isn't it! */ | |
1064 | ||
617ba13b | 1065 | bh = ext4_find_entry(&dotdot, &de); |
ac27a0ec DK |
1066 | inode = NULL; |
1067 | if (!bh) | |
1068 | return ERR_PTR(-ENOENT); | |
1069 | ino = le32_to_cpu(de->inode); | |
1070 | brelse(bh); | |
1071 | ||
617ba13b MC |
1072 | if (!ext4_valid_inum(child->d_inode->i_sb, ino)) { |
1073 | ext4_error(child->d_inode->i_sb, "ext4_get_parent", | |
ac27a0ec | 1074 | "bad inode number: %lu", ino); |
1d1fe1ee | 1075 | return ERR_PTR(-EIO); |
a6c15c2b VA |
1076 | } |
1077 | ||
1d1fe1ee DH |
1078 | inode = ext4_iget(child->d_inode->i_sb, ino); |
1079 | if (IS_ERR(inode)) | |
1080 | return ERR_CAST(inode); | |
1081 | ||
ac27a0ec DK |
1082 | parent = d_alloc_anon(inode); |
1083 | if (!parent) { | |
1084 | iput(inode); | |
1085 | parent = ERR_PTR(-ENOMEM); | |
1086 | } | |
1087 | return parent; | |
1088 | } | |
1089 | ||
1090 | #define S_SHIFT 12 | |
617ba13b MC |
1091 | static unsigned char ext4_type_by_mode[S_IFMT >> S_SHIFT] = { |
1092 | [S_IFREG >> S_SHIFT] = EXT4_FT_REG_FILE, | |
1093 | [S_IFDIR >> S_SHIFT] = EXT4_FT_DIR, | |
1094 | [S_IFCHR >> S_SHIFT] = EXT4_FT_CHRDEV, | |
1095 | [S_IFBLK >> S_SHIFT] = EXT4_FT_BLKDEV, | |
1096 | [S_IFIFO >> S_SHIFT] = EXT4_FT_FIFO, | |
1097 | [S_IFSOCK >> S_SHIFT] = EXT4_FT_SOCK, | |
1098 | [S_IFLNK >> S_SHIFT] = EXT4_FT_SYMLINK, | |
ac27a0ec DK |
1099 | }; |
1100 | ||
617ba13b MC |
1101 | static inline void ext4_set_de_type(struct super_block *sb, |
1102 | struct ext4_dir_entry_2 *de, | |
ac27a0ec | 1103 | umode_t mode) { |
617ba13b MC |
1104 | if (EXT4_HAS_INCOMPAT_FEATURE(sb, EXT4_FEATURE_INCOMPAT_FILETYPE)) |
1105 | de->file_type = ext4_type_by_mode[(mode & S_IFMT)>>S_SHIFT]; | |
ac27a0ec DK |
1106 | } |
1107 | ||
ef2b02d3 ES |
1108 | /* |
1109 | * Move count entries from end of map between two memory locations. | |
1110 | * Returns pointer to last entry moved. | |
1111 | */ | |
617ba13b | 1112 | static struct ext4_dir_entry_2 * |
ac27a0ec DK |
1113 | dx_move_dirents(char *from, char *to, struct dx_map_entry *map, int count) |
1114 | { | |
1115 | unsigned rec_len = 0; | |
1116 | ||
1117 | while (count--) { | |
617ba13b MC |
1118 | struct ext4_dir_entry_2 *de = (struct ext4_dir_entry_2 *) (from + map->offs); |
1119 | rec_len = EXT4_DIR_REC_LEN(de->name_len); | |
ac27a0ec | 1120 | memcpy (to, de, rec_len); |
617ba13b | 1121 | ((struct ext4_dir_entry_2 *) to)->rec_len = |
a72d7f83 | 1122 | ext4_rec_len_to_disk(rec_len); |
ac27a0ec DK |
1123 | de->inode = 0; |
1124 | map++; | |
1125 | to += rec_len; | |
1126 | } | |
617ba13b | 1127 | return (struct ext4_dir_entry_2 *) (to - rec_len); |
ac27a0ec DK |
1128 | } |
1129 | ||
ef2b02d3 ES |
1130 | /* |
1131 | * Compact each dir entry in the range to the minimal rec_len. | |
1132 | * Returns pointer to last entry in range. | |
1133 | */ | |
617ba13b | 1134 | static struct ext4_dir_entry_2* dx_pack_dirents(char *base, int size) |
ac27a0ec | 1135 | { |
617ba13b | 1136 | struct ext4_dir_entry_2 *next, *to, *prev, *de = (struct ext4_dir_entry_2 *) base; |
ac27a0ec DK |
1137 | unsigned rec_len = 0; |
1138 | ||
1139 | prev = to = de; | |
1140 | while ((char*)de < base + size) { | |
a72d7f83 | 1141 | next = ext4_next_entry(de); |
ac27a0ec | 1142 | if (de->inode && de->name_len) { |
617ba13b | 1143 | rec_len = EXT4_DIR_REC_LEN(de->name_len); |
ac27a0ec DK |
1144 | if (de > to) |
1145 | memmove(to, de, rec_len); | |
a72d7f83 | 1146 | to->rec_len = ext4_rec_len_to_disk(rec_len); |
ac27a0ec | 1147 | prev = to; |
617ba13b | 1148 | to = (struct ext4_dir_entry_2 *) (((char *) to) + rec_len); |
ac27a0ec DK |
1149 | } |
1150 | de = next; | |
1151 | } | |
1152 | return prev; | |
1153 | } | |
1154 | ||
ef2b02d3 ES |
1155 | /* |
1156 | * Split a full leaf block to make room for a new dir entry. | |
1157 | * Allocate a new block, and move entries so that they are approx. equally full. | |
1158 | * Returns pointer to de in block into which the new entry will be inserted. | |
1159 | */ | |
617ba13b | 1160 | static struct ext4_dir_entry_2 *do_split(handle_t *handle, struct inode *dir, |
ac27a0ec DK |
1161 | struct buffer_head **bh,struct dx_frame *frame, |
1162 | struct dx_hash_info *hinfo, int *error) | |
1163 | { | |
1164 | unsigned blocksize = dir->i_sb->s_blocksize; | |
1165 | unsigned count, continued; | |
1166 | struct buffer_head *bh2; | |
725d26d3 | 1167 | ext4_lblk_t newblock; |
ac27a0ec DK |
1168 | u32 hash2; |
1169 | struct dx_map_entry *map; | |
1170 | char *data1 = (*bh)->b_data, *data2; | |
ef2b02d3 | 1171 | unsigned split, move, size, i; |
617ba13b | 1172 | struct ext4_dir_entry_2 *de = NULL, *de2; |
fedee54d | 1173 | int err = 0; |
ac27a0ec | 1174 | |
fedee54d | 1175 | bh2 = ext4_append (handle, dir, &newblock, &err); |
ac27a0ec DK |
1176 | if (!(bh2)) { |
1177 | brelse(*bh); | |
1178 | *bh = NULL; | |
1179 | goto errout; | |
1180 | } | |
1181 | ||
1182 | BUFFER_TRACE(*bh, "get_write_access"); | |
617ba13b | 1183 | err = ext4_journal_get_write_access(handle, *bh); |
fedee54d DM |
1184 | if (err) |
1185 | goto journal_error; | |
1186 | ||
ac27a0ec | 1187 | BUFFER_TRACE(frame->bh, "get_write_access"); |
617ba13b | 1188 | err = ext4_journal_get_write_access(handle, frame->bh); |
ac27a0ec DK |
1189 | if (err) |
1190 | goto journal_error; | |
1191 | ||
1192 | data2 = bh2->b_data; | |
1193 | ||
1194 | /* create map in the end of data2 block */ | |
1195 | map = (struct dx_map_entry *) (data2 + blocksize); | |
617ba13b | 1196 | count = dx_make_map ((struct ext4_dir_entry_2 *) data1, |
ac27a0ec DK |
1197 | blocksize, hinfo, map); |
1198 | map -= count; | |
ac27a0ec | 1199 | dx_sort_map (map, count); |
ef2b02d3 ES |
1200 | /* Split the existing block in the middle, size-wise */ |
1201 | size = 0; | |
1202 | move = 0; | |
1203 | for (i = count-1; i >= 0; i--) { | |
1204 | /* is more than half of this entry in 2nd half of the block? */ | |
1205 | if (size + map[i].size/2 > blocksize/2) | |
1206 | break; | |
1207 | size += map[i].size; | |
1208 | move++; | |
1209 | } | |
1210 | /* map index at which we will split */ | |
1211 | split = count - move; | |
ac27a0ec DK |
1212 | hash2 = map[split].hash; |
1213 | continued = hash2 == map[split - 1].hash; | |
725d26d3 AK |
1214 | dxtrace(printk(KERN_INFO "Split block %lu at %x, %i/%i\n", |
1215 | (unsigned long)dx_get_block(frame->at), | |
1216 | hash2, split, count-split)); | |
ac27a0ec DK |
1217 | |
1218 | /* Fancy dance to stay within two buffers */ | |
1219 | de2 = dx_move_dirents(data1, data2, map + split, count - split); | |
1220 | de = dx_pack_dirents(data1,blocksize); | |
a72d7f83 JK |
1221 | de->rec_len = ext4_rec_len_to_disk(data1 + blocksize - (char *) de); |
1222 | de2->rec_len = ext4_rec_len_to_disk(data2 + blocksize - (char *) de2); | |
617ba13b MC |
1223 | dxtrace(dx_show_leaf (hinfo, (struct ext4_dir_entry_2 *) data1, blocksize, 1)); |
1224 | dxtrace(dx_show_leaf (hinfo, (struct ext4_dir_entry_2 *) data2, blocksize, 1)); | |
ac27a0ec DK |
1225 | |
1226 | /* Which block gets the new entry? */ | |
1227 | if (hinfo->hash >= hash2) | |
1228 | { | |
1229 | swap(*bh, bh2); | |
1230 | de = de2; | |
1231 | } | |
1232 | dx_insert_block (frame, hash2 + continued, newblock); | |
617ba13b | 1233 | err = ext4_journal_dirty_metadata (handle, bh2); |
ac27a0ec DK |
1234 | if (err) |
1235 | goto journal_error; | |
617ba13b | 1236 | err = ext4_journal_dirty_metadata (handle, frame->bh); |
ac27a0ec DK |
1237 | if (err) |
1238 | goto journal_error; | |
1239 | brelse (bh2); | |
1240 | dxtrace(dx_show_index ("frame", frame->entries)); | |
ac27a0ec | 1241 | return de; |
fedee54d DM |
1242 | |
1243 | journal_error: | |
1244 | brelse(*bh); | |
1245 | brelse(bh2); | |
1246 | *bh = NULL; | |
1247 | ext4_std_error(dir->i_sb, err); | |
1248 | errout: | |
1249 | *error = err; | |
1250 | return NULL; | |
ac27a0ec | 1251 | } |
ac27a0ec DK |
1252 | |
1253 | /* | |
1254 | * Add a new entry into a directory (leaf) block. If de is non-NULL, | |
1255 | * it points to a directory entry which is guaranteed to be large | |
1256 | * enough for new directory entry. If de is NULL, then | |
1257 | * add_dirent_to_buf will attempt search the directory block for | |
1258 | * space. It will return -ENOSPC if no space is available, and -EIO | |
1259 | * and -EEXIST if directory entry already exists. | |
1260 | * | |
1261 | * NOTE! bh is NOT released in the case where ENOSPC is returned. In | |
1262 | * all other cases bh is released. | |
1263 | */ | |
1264 | static int add_dirent_to_buf(handle_t *handle, struct dentry *dentry, | |
617ba13b | 1265 | struct inode *inode, struct ext4_dir_entry_2 *de, |
ac27a0ec DK |
1266 | struct buffer_head * bh) |
1267 | { | |
1268 | struct inode *dir = dentry->d_parent->d_inode; | |
1269 | const char *name = dentry->d_name.name; | |
1270 | int namelen = dentry->d_name.len; | |
1271 | unsigned long offset = 0; | |
1272 | unsigned short reclen; | |
1273 | int nlen, rlen, err; | |
1274 | char *top; | |
1275 | ||
617ba13b | 1276 | reclen = EXT4_DIR_REC_LEN(namelen); |
ac27a0ec | 1277 | if (!de) { |
617ba13b | 1278 | de = (struct ext4_dir_entry_2 *)bh->b_data; |
ac27a0ec DK |
1279 | top = bh->b_data + dir->i_sb->s_blocksize - reclen; |
1280 | while ((char *) de <= top) { | |
617ba13b | 1281 | if (!ext4_check_dir_entry("ext4_add_entry", dir, de, |
ac27a0ec DK |
1282 | bh, offset)) { |
1283 | brelse (bh); | |
1284 | return -EIO; | |
1285 | } | |
617ba13b | 1286 | if (ext4_match (namelen, name, de)) { |
ac27a0ec DK |
1287 | brelse (bh); |
1288 | return -EEXIST; | |
1289 | } | |
617ba13b | 1290 | nlen = EXT4_DIR_REC_LEN(de->name_len); |
a72d7f83 | 1291 | rlen = ext4_rec_len_from_disk(de->rec_len); |
ac27a0ec DK |
1292 | if ((de->inode? rlen - nlen: rlen) >= reclen) |
1293 | break; | |
617ba13b | 1294 | de = (struct ext4_dir_entry_2 *)((char *)de + rlen); |
ac27a0ec DK |
1295 | offset += rlen; |
1296 | } | |
1297 | if ((char *) de > top) | |
1298 | return -ENOSPC; | |
1299 | } | |
1300 | BUFFER_TRACE(bh, "get_write_access"); | |
617ba13b | 1301 | err = ext4_journal_get_write_access(handle, bh); |
ac27a0ec | 1302 | if (err) { |
617ba13b | 1303 | ext4_std_error(dir->i_sb, err); |
ac27a0ec DK |
1304 | brelse(bh); |
1305 | return err; | |
1306 | } | |
1307 | ||
1308 | /* By now the buffer is marked for journaling */ | |
617ba13b | 1309 | nlen = EXT4_DIR_REC_LEN(de->name_len); |
a72d7f83 | 1310 | rlen = ext4_rec_len_from_disk(de->rec_len); |
ac27a0ec | 1311 | if (de->inode) { |
617ba13b | 1312 | struct ext4_dir_entry_2 *de1 = (struct ext4_dir_entry_2 *)((char *)de + nlen); |
a72d7f83 JK |
1313 | de1->rec_len = ext4_rec_len_to_disk(rlen - nlen); |
1314 | de->rec_len = ext4_rec_len_to_disk(nlen); | |
ac27a0ec DK |
1315 | de = de1; |
1316 | } | |
617ba13b | 1317 | de->file_type = EXT4_FT_UNKNOWN; |
ac27a0ec DK |
1318 | if (inode) { |
1319 | de->inode = cpu_to_le32(inode->i_ino); | |
617ba13b | 1320 | ext4_set_de_type(dir->i_sb, de, inode->i_mode); |
ac27a0ec DK |
1321 | } else |
1322 | de->inode = 0; | |
1323 | de->name_len = namelen; | |
1324 | memcpy (de->name, name, namelen); | |
1325 | /* | |
1326 | * XXX shouldn't update any times until successful | |
1327 | * completion of syscall, but too many callers depend | |
1328 | * on this. | |
1329 | * | |
1330 | * XXX similarly, too many callers depend on | |
617ba13b | 1331 | * ext4_new_inode() setting the times, but error |
ac27a0ec DK |
1332 | * recovery deletes the inode, so the worst that can |
1333 | * happen is that the times are slightly out of date | |
1334 | * and/or different from the directory change time. | |
1335 | */ | |
ef7f3835 | 1336 | dir->i_mtime = dir->i_ctime = ext4_current_time(dir); |
617ba13b | 1337 | ext4_update_dx_flag(dir); |
ac27a0ec | 1338 | dir->i_version++; |
617ba13b MC |
1339 | ext4_mark_inode_dirty(handle, dir); |
1340 | BUFFER_TRACE(bh, "call ext4_journal_dirty_metadata"); | |
1341 | err = ext4_journal_dirty_metadata(handle, bh); | |
ac27a0ec | 1342 | if (err) |
617ba13b | 1343 | ext4_std_error(dir->i_sb, err); |
ac27a0ec DK |
1344 | brelse(bh); |
1345 | return 0; | |
1346 | } | |
1347 | ||
ac27a0ec DK |
1348 | /* |
1349 | * This converts a one block unindexed directory to a 3 block indexed | |
1350 | * directory, and adds the dentry to the indexed directory. | |
1351 | */ | |
1352 | static int make_indexed_dir(handle_t *handle, struct dentry *dentry, | |
1353 | struct inode *inode, struct buffer_head *bh) | |
1354 | { | |
1355 | struct inode *dir = dentry->d_parent->d_inode; | |
1356 | const char *name = dentry->d_name.name; | |
1357 | int namelen = dentry->d_name.len; | |
1358 | struct buffer_head *bh2; | |
1359 | struct dx_root *root; | |
1360 | struct dx_frame frames[2], *frame; | |
1361 | struct dx_entry *entries; | |
617ba13b | 1362 | struct ext4_dir_entry_2 *de, *de2; |
ac27a0ec DK |
1363 | char *data1, *top; |
1364 | unsigned len; | |
1365 | int retval; | |
1366 | unsigned blocksize; | |
1367 | struct dx_hash_info hinfo; | |
725d26d3 | 1368 | ext4_lblk_t block; |
ac27a0ec DK |
1369 | struct fake_dirent *fde; |
1370 | ||
1371 | blocksize = dir->i_sb->s_blocksize; | |
1372 | dxtrace(printk("Creating index\n")); | |
617ba13b | 1373 | retval = ext4_journal_get_write_access(handle, bh); |
ac27a0ec | 1374 | if (retval) { |
617ba13b | 1375 | ext4_std_error(dir->i_sb, retval); |
ac27a0ec DK |
1376 | brelse(bh); |
1377 | return retval; | |
1378 | } | |
1379 | root = (struct dx_root *) bh->b_data; | |
1380 | ||
617ba13b | 1381 | bh2 = ext4_append (handle, dir, &block, &retval); |
ac27a0ec DK |
1382 | if (!(bh2)) { |
1383 | brelse(bh); | |
1384 | return retval; | |
1385 | } | |
617ba13b | 1386 | EXT4_I(dir)->i_flags |= EXT4_INDEX_FL; |
ac27a0ec DK |
1387 | data1 = bh2->b_data; |
1388 | ||
1389 | /* The 0th block becomes the root, move the dirents out */ | |
1390 | fde = &root->dotdot; | |
a72d7f83 JK |
1391 | de = (struct ext4_dir_entry_2 *)((char *)fde + |
1392 | ext4_rec_len_from_disk(fde->rec_len)); | |
ac27a0ec DK |
1393 | len = ((char *) root) + blocksize - (char *) de; |
1394 | memcpy (data1, de, len); | |
617ba13b | 1395 | de = (struct ext4_dir_entry_2 *) data1; |
ac27a0ec | 1396 | top = data1 + len; |
a72d7f83 | 1397 | while ((char *)(de2 = ext4_next_entry(de)) < top) |
ac27a0ec | 1398 | de = de2; |
a72d7f83 | 1399 | de->rec_len = ext4_rec_len_to_disk(data1 + blocksize - (char *) de); |
ac27a0ec | 1400 | /* Initialize the root; the dot dirents already exist */ |
617ba13b | 1401 | de = (struct ext4_dir_entry_2 *) (&root->dotdot); |
a72d7f83 | 1402 | de->rec_len = ext4_rec_len_to_disk(blocksize - EXT4_DIR_REC_LEN(2)); |
ac27a0ec DK |
1403 | memset (&root->info, 0, sizeof(root->info)); |
1404 | root->info.info_length = sizeof(root->info); | |
617ba13b | 1405 | root->info.hash_version = EXT4_SB(dir->i_sb)->s_def_hash_version; |
ac27a0ec DK |
1406 | entries = root->entries; |
1407 | dx_set_block (entries, 1); | |
1408 | dx_set_count (entries, 1); | |
1409 | dx_set_limit (entries, dx_root_limit(dir, sizeof(root->info))); | |
1410 | ||
1411 | /* Initialize as for dx_probe */ | |
1412 | hinfo.hash_version = root->info.hash_version; | |
617ba13b MC |
1413 | hinfo.seed = EXT4_SB(dir->i_sb)->s_hash_seed; |
1414 | ext4fs_dirhash(name, namelen, &hinfo); | |
ac27a0ec DK |
1415 | frame = frames; |
1416 | frame->entries = entries; | |
1417 | frame->at = entries; | |
1418 | frame->bh = bh; | |
1419 | bh = bh2; | |
1420 | de = do_split(handle,dir, &bh, frame, &hinfo, &retval); | |
1421 | dx_release (frames); | |
1422 | if (!(de)) | |
1423 | return retval; | |
1424 | ||
1425 | return add_dirent_to_buf(handle, dentry, inode, de, bh); | |
1426 | } | |
ac27a0ec DK |
1427 | |
1428 | /* | |
617ba13b | 1429 | * ext4_add_entry() |
ac27a0ec DK |
1430 | * |
1431 | * adds a file entry to the specified directory, using the same | |
617ba13b | 1432 | * semantics as ext4_find_entry(). It returns NULL if it failed. |
ac27a0ec DK |
1433 | * |
1434 | * NOTE!! The inode part of 'de' is left at 0 - which means you | |
1435 | * may not sleep between calling this and putting something into | |
1436 | * the entry, as someone else might have used it while you slept. | |
1437 | */ | |
617ba13b | 1438 | static int ext4_add_entry (handle_t *handle, struct dentry *dentry, |
ac27a0ec DK |
1439 | struct inode *inode) |
1440 | { | |
1441 | struct inode *dir = dentry->d_parent->d_inode; | |
1442 | unsigned long offset; | |
1443 | struct buffer_head * bh; | |
617ba13b | 1444 | struct ext4_dir_entry_2 *de; |
ac27a0ec DK |
1445 | struct super_block * sb; |
1446 | int retval; | |
ac27a0ec | 1447 | int dx_fallback=0; |
ac27a0ec | 1448 | unsigned blocksize; |
725d26d3 | 1449 | ext4_lblk_t block, blocks; |
ac27a0ec DK |
1450 | |
1451 | sb = dir->i_sb; | |
1452 | blocksize = sb->s_blocksize; | |
1453 | if (!dentry->d_name.len) | |
1454 | return -EINVAL; | |
ac27a0ec | 1455 | if (is_dx(dir)) { |
617ba13b | 1456 | retval = ext4_dx_add_entry(handle, dentry, inode); |
ac27a0ec DK |
1457 | if (!retval || (retval != ERR_BAD_DX_DIR)) |
1458 | return retval; | |
617ba13b | 1459 | EXT4_I(dir)->i_flags &= ~EXT4_INDEX_FL; |
ac27a0ec | 1460 | dx_fallback++; |
617ba13b | 1461 | ext4_mark_inode_dirty(handle, dir); |
ac27a0ec | 1462 | } |
ac27a0ec DK |
1463 | blocks = dir->i_size >> sb->s_blocksize_bits; |
1464 | for (block = 0, offset = 0; block < blocks; block++) { | |
617ba13b | 1465 | bh = ext4_bread(handle, dir, block, 0, &retval); |
ac27a0ec DK |
1466 | if(!bh) |
1467 | return retval; | |
1468 | retval = add_dirent_to_buf(handle, dentry, inode, NULL, bh); | |
1469 | if (retval != -ENOSPC) | |
1470 | return retval; | |
1471 | ||
ac27a0ec | 1472 | if (blocks == 1 && !dx_fallback && |
617ba13b | 1473 | EXT4_HAS_COMPAT_FEATURE(sb, EXT4_FEATURE_COMPAT_DIR_INDEX)) |
ac27a0ec | 1474 | return make_indexed_dir(handle, dentry, inode, bh); |
ac27a0ec DK |
1475 | brelse(bh); |
1476 | } | |
617ba13b | 1477 | bh = ext4_append(handle, dir, &block, &retval); |
ac27a0ec DK |
1478 | if (!bh) |
1479 | return retval; | |
617ba13b | 1480 | de = (struct ext4_dir_entry_2 *) bh->b_data; |
ac27a0ec | 1481 | de->inode = 0; |
a72d7f83 | 1482 | de->rec_len = ext4_rec_len_to_disk(blocksize); |
ac27a0ec DK |
1483 | return add_dirent_to_buf(handle, dentry, inode, de, bh); |
1484 | } | |
1485 | ||
ac27a0ec DK |
1486 | /* |
1487 | * Returns 0 for success, or a negative error value | |
1488 | */ | |
617ba13b | 1489 | static int ext4_dx_add_entry(handle_t *handle, struct dentry *dentry, |
ac27a0ec DK |
1490 | struct inode *inode) |
1491 | { | |
1492 | struct dx_frame frames[2], *frame; | |
1493 | struct dx_entry *entries, *at; | |
1494 | struct dx_hash_info hinfo; | |
1495 | struct buffer_head * bh; | |
1496 | struct inode *dir = dentry->d_parent->d_inode; | |
1497 | struct super_block * sb = dir->i_sb; | |
617ba13b | 1498 | struct ext4_dir_entry_2 *de; |
ac27a0ec DK |
1499 | int err; |
1500 | ||
1501 | frame = dx_probe(dentry, NULL, &hinfo, frames, &err); | |
1502 | if (!frame) | |
1503 | return err; | |
1504 | entries = frame->entries; | |
1505 | at = frame->at; | |
1506 | ||
617ba13b | 1507 | if (!(bh = ext4_bread(handle,dir, dx_get_block(frame->at), 0, &err))) |
ac27a0ec DK |
1508 | goto cleanup; |
1509 | ||
1510 | BUFFER_TRACE(bh, "get_write_access"); | |
617ba13b | 1511 | err = ext4_journal_get_write_access(handle, bh); |
ac27a0ec DK |
1512 | if (err) |
1513 | goto journal_error; | |
1514 | ||
1515 | err = add_dirent_to_buf(handle, dentry, inode, NULL, bh); | |
1516 | if (err != -ENOSPC) { | |
1517 | bh = NULL; | |
1518 | goto cleanup; | |
1519 | } | |
1520 | ||
1521 | /* Block full, should compress but for now just split */ | |
1522 | dxtrace(printk("using %u of %u node entries\n", | |
1523 | dx_get_count(entries), dx_get_limit(entries))); | |
1524 | /* Need to split index? */ | |
1525 | if (dx_get_count(entries) == dx_get_limit(entries)) { | |
725d26d3 | 1526 | ext4_lblk_t newblock; |
ac27a0ec DK |
1527 | unsigned icount = dx_get_count(entries); |
1528 | int levels = frame - frames; | |
1529 | struct dx_entry *entries2; | |
1530 | struct dx_node *node2; | |
1531 | struct buffer_head *bh2; | |
1532 | ||
1533 | if (levels && (dx_get_count(frames->entries) == | |
1534 | dx_get_limit(frames->entries))) { | |
617ba13b | 1535 | ext4_warning(sb, __FUNCTION__, |
ac27a0ec DK |
1536 | "Directory index full!"); |
1537 | err = -ENOSPC; | |
1538 | goto cleanup; | |
1539 | } | |
617ba13b | 1540 | bh2 = ext4_append (handle, dir, &newblock, &err); |
ac27a0ec DK |
1541 | if (!(bh2)) |
1542 | goto cleanup; | |
1543 | node2 = (struct dx_node *)(bh2->b_data); | |
1544 | entries2 = node2->entries; | |
a72d7f83 | 1545 | node2->fake.rec_len = ext4_rec_len_to_disk(sb->s_blocksize); |
ac27a0ec DK |
1546 | node2->fake.inode = 0; |
1547 | BUFFER_TRACE(frame->bh, "get_write_access"); | |
617ba13b | 1548 | err = ext4_journal_get_write_access(handle, frame->bh); |
ac27a0ec DK |
1549 | if (err) |
1550 | goto journal_error; | |
1551 | if (levels) { | |
1552 | unsigned icount1 = icount/2, icount2 = icount - icount1; | |
1553 | unsigned hash2 = dx_get_hash(entries + icount1); | |
1554 | dxtrace(printk("Split index %i/%i\n", icount1, icount2)); | |
1555 | ||
1556 | BUFFER_TRACE(frame->bh, "get_write_access"); /* index root */ | |
617ba13b | 1557 | err = ext4_journal_get_write_access(handle, |
ac27a0ec DK |
1558 | frames[0].bh); |
1559 | if (err) | |
1560 | goto journal_error; | |
1561 | ||
1562 | memcpy ((char *) entries2, (char *) (entries + icount1), | |
1563 | icount2 * sizeof(struct dx_entry)); | |
1564 | dx_set_count (entries, icount1); | |
1565 | dx_set_count (entries2, icount2); | |
1566 | dx_set_limit (entries2, dx_node_limit(dir)); | |
1567 | ||
1568 | /* Which index block gets the new entry? */ | |
1569 | if (at - entries >= icount1) { | |
1570 | frame->at = at = at - entries - icount1 + entries2; | |
1571 | frame->entries = entries = entries2; | |
1572 | swap(frame->bh, bh2); | |
1573 | } | |
1574 | dx_insert_block (frames + 0, hash2, newblock); | |
1575 | dxtrace(dx_show_index ("node", frames[1].entries)); | |
1576 | dxtrace(dx_show_index ("node", | |
1577 | ((struct dx_node *) bh2->b_data)->entries)); | |
617ba13b | 1578 | err = ext4_journal_dirty_metadata(handle, bh2); |
ac27a0ec DK |
1579 | if (err) |
1580 | goto journal_error; | |
1581 | brelse (bh2); | |
1582 | } else { | |
1583 | dxtrace(printk("Creating second level index...\n")); | |
1584 | memcpy((char *) entries2, (char *) entries, | |
1585 | icount * sizeof(struct dx_entry)); | |
1586 | dx_set_limit(entries2, dx_node_limit(dir)); | |
1587 | ||
1588 | /* Set up root */ | |
1589 | dx_set_count(entries, 1); | |
1590 | dx_set_block(entries + 0, newblock); | |
1591 | ((struct dx_root *) frames[0].bh->b_data)->info.indirect_levels = 1; | |
1592 | ||
1593 | /* Add new access path frame */ | |
1594 | frame = frames + 1; | |
1595 | frame->at = at = at - entries + entries2; | |
1596 | frame->entries = entries = entries2; | |
1597 | frame->bh = bh2; | |
617ba13b | 1598 | err = ext4_journal_get_write_access(handle, |
ac27a0ec DK |
1599 | frame->bh); |
1600 | if (err) | |
1601 | goto journal_error; | |
1602 | } | |
617ba13b | 1603 | ext4_journal_dirty_metadata(handle, frames[0].bh); |
ac27a0ec DK |
1604 | } |
1605 | de = do_split(handle, dir, &bh, frame, &hinfo, &err); | |
1606 | if (!de) | |
1607 | goto cleanup; | |
1608 | err = add_dirent_to_buf(handle, dentry, inode, de, bh); | |
1609 | bh = NULL; | |
1610 | goto cleanup; | |
1611 | ||
1612 | journal_error: | |
617ba13b | 1613 | ext4_std_error(dir->i_sb, err); |
ac27a0ec DK |
1614 | cleanup: |
1615 | if (bh) | |
1616 | brelse(bh); | |
1617 | dx_release(frames); | |
1618 | return err; | |
1619 | } | |
ac27a0ec DK |
1620 | |
1621 | /* | |
617ba13b | 1622 | * ext4_delete_entry deletes a directory entry by merging it with the |
ac27a0ec DK |
1623 | * previous entry |
1624 | */ | |
617ba13b | 1625 | static int ext4_delete_entry (handle_t *handle, |
ac27a0ec | 1626 | struct inode * dir, |
617ba13b | 1627 | struct ext4_dir_entry_2 * de_del, |
ac27a0ec DK |
1628 | struct buffer_head * bh) |
1629 | { | |
617ba13b | 1630 | struct ext4_dir_entry_2 * de, * pde; |
ac27a0ec DK |
1631 | int i; |
1632 | ||
1633 | i = 0; | |
1634 | pde = NULL; | |
617ba13b | 1635 | de = (struct ext4_dir_entry_2 *) bh->b_data; |
ac27a0ec | 1636 | while (i < bh->b_size) { |
617ba13b | 1637 | if (!ext4_check_dir_entry("ext4_delete_entry", dir, de, bh, i)) |
ac27a0ec DK |
1638 | return -EIO; |
1639 | if (de == de_del) { | |
1640 | BUFFER_TRACE(bh, "get_write_access"); | |
617ba13b | 1641 | ext4_journal_get_write_access(handle, bh); |
ac27a0ec | 1642 | if (pde) |
a72d7f83 JK |
1643 | pde->rec_len = ext4_rec_len_to_disk( |
1644 | ext4_rec_len_from_disk(pde->rec_len) + | |
1645 | ext4_rec_len_from_disk(de->rec_len)); | |
ac27a0ec DK |
1646 | else |
1647 | de->inode = 0; | |
1648 | dir->i_version++; | |
617ba13b MC |
1649 | BUFFER_TRACE(bh, "call ext4_journal_dirty_metadata"); |
1650 | ext4_journal_dirty_metadata(handle, bh); | |
ac27a0ec DK |
1651 | return 0; |
1652 | } | |
a72d7f83 | 1653 | i += ext4_rec_len_from_disk(de->rec_len); |
ac27a0ec | 1654 | pde = de; |
a72d7f83 | 1655 | de = ext4_next_entry(de); |
ac27a0ec DK |
1656 | } |
1657 | return -ENOENT; | |
1658 | } | |
1659 | ||
f8628a14 AD |
1660 | /* |
1661 | * DIR_NLINK feature is set if 1) nlinks > EXT4_LINK_MAX or 2) nlinks == 2, | |
1662 | * since this indicates that nlinks count was previously 1. | |
1663 | */ | |
1664 | static void ext4_inc_count(handle_t *handle, struct inode *inode) | |
1665 | { | |
1666 | inc_nlink(inode); | |
1667 | if (is_dx(inode) && inode->i_nlink > 1) { | |
1668 | /* limit is 16-bit i_links_count */ | |
1669 | if (inode->i_nlink >= EXT4_LINK_MAX || inode->i_nlink == 2) { | |
1670 | inode->i_nlink = 1; | |
1671 | EXT4_SET_RO_COMPAT_FEATURE(inode->i_sb, | |
1672 | EXT4_FEATURE_RO_COMPAT_DIR_NLINK); | |
1673 | } | |
1674 | } | |
1675 | } | |
1676 | ||
1677 | /* | |
1678 | * If a directory had nlink == 1, then we should let it be 1. This indicates | |
1679 | * directory has >EXT4_LINK_MAX subdirs. | |
1680 | */ | |
1681 | static void ext4_dec_count(handle_t *handle, struct inode *inode) | |
1682 | { | |
1683 | drop_nlink(inode); | |
1684 | if (S_ISDIR(inode->i_mode) && inode->i_nlink == 0) | |
1685 | inc_nlink(inode); | |
1686 | } | |
1687 | ||
1688 | ||
617ba13b | 1689 | static int ext4_add_nondir(handle_t *handle, |
ac27a0ec DK |
1690 | struct dentry *dentry, struct inode *inode) |
1691 | { | |
617ba13b | 1692 | int err = ext4_add_entry(handle, dentry, inode); |
ac27a0ec | 1693 | if (!err) { |
617ba13b | 1694 | ext4_mark_inode_dirty(handle, inode); |
ac27a0ec DK |
1695 | d_instantiate(dentry, inode); |
1696 | return 0; | |
1697 | } | |
731b9a54 | 1698 | drop_nlink(inode); |
ac27a0ec DK |
1699 | iput(inode); |
1700 | return err; | |
1701 | } | |
1702 | ||
1703 | /* | |
1704 | * By the time this is called, we already have created | |
1705 | * the directory cache entry for the new file, but it | |
1706 | * is so far negative - it has no inode. | |
1707 | * | |
1708 | * If the create succeeds, we fill in the inode information | |
1709 | * with d_instantiate(). | |
1710 | */ | |
617ba13b | 1711 | static int ext4_create (struct inode * dir, struct dentry * dentry, int mode, |
ac27a0ec DK |
1712 | struct nameidata *nd) |
1713 | { | |
1714 | handle_t *handle; | |
1715 | struct inode * inode; | |
1716 | int err, retries = 0; | |
1717 | ||
1718 | retry: | |
617ba13b MC |
1719 | handle = ext4_journal_start(dir, EXT4_DATA_TRANS_BLOCKS(dir->i_sb) + |
1720 | EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3 + | |
1721 | 2*EXT4_QUOTA_INIT_BLOCKS(dir->i_sb)); | |
ac27a0ec DK |
1722 | if (IS_ERR(handle)) |
1723 | return PTR_ERR(handle); | |
1724 | ||
1725 | if (IS_DIRSYNC(dir)) | |
1726 | handle->h_sync = 1; | |
1727 | ||
617ba13b | 1728 | inode = ext4_new_inode (handle, dir, mode); |
ac27a0ec DK |
1729 | err = PTR_ERR(inode); |
1730 | if (!IS_ERR(inode)) { | |
617ba13b MC |
1731 | inode->i_op = &ext4_file_inode_operations; |
1732 | inode->i_fop = &ext4_file_operations; | |
1733 | ext4_set_aops(inode); | |
1734 | err = ext4_add_nondir(handle, dentry, inode); | |
ac27a0ec | 1735 | } |
617ba13b MC |
1736 | ext4_journal_stop(handle); |
1737 | if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries)) | |
ac27a0ec DK |
1738 | goto retry; |
1739 | return err; | |
1740 | } | |
1741 | ||
617ba13b | 1742 | static int ext4_mknod (struct inode * dir, struct dentry *dentry, |
ac27a0ec DK |
1743 | int mode, dev_t rdev) |
1744 | { | |
1745 | handle_t *handle; | |
1746 | struct inode *inode; | |
1747 | int err, retries = 0; | |
1748 | ||
1749 | if (!new_valid_dev(rdev)) | |
1750 | return -EINVAL; | |
1751 | ||
1752 | retry: | |
617ba13b MC |
1753 | handle = ext4_journal_start(dir, EXT4_DATA_TRANS_BLOCKS(dir->i_sb) + |
1754 | EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3 + | |
1755 | 2*EXT4_QUOTA_INIT_BLOCKS(dir->i_sb)); | |
ac27a0ec DK |
1756 | if (IS_ERR(handle)) |
1757 | return PTR_ERR(handle); | |
1758 | ||
1759 | if (IS_DIRSYNC(dir)) | |
1760 | handle->h_sync = 1; | |
1761 | ||
617ba13b | 1762 | inode = ext4_new_inode (handle, dir, mode); |
ac27a0ec DK |
1763 | err = PTR_ERR(inode); |
1764 | if (!IS_ERR(inode)) { | |
1765 | init_special_inode(inode, inode->i_mode, rdev); | |
617ba13b MC |
1766 | #ifdef CONFIG_EXT4DEV_FS_XATTR |
1767 | inode->i_op = &ext4_special_inode_operations; | |
ac27a0ec | 1768 | #endif |
617ba13b | 1769 | err = ext4_add_nondir(handle, dentry, inode); |
ac27a0ec | 1770 | } |
617ba13b MC |
1771 | ext4_journal_stop(handle); |
1772 | if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries)) | |
ac27a0ec DK |
1773 | goto retry; |
1774 | return err; | |
1775 | } | |
1776 | ||
617ba13b | 1777 | static int ext4_mkdir(struct inode * dir, struct dentry * dentry, int mode) |
ac27a0ec DK |
1778 | { |
1779 | handle_t *handle; | |
1780 | struct inode * inode; | |
1781 | struct buffer_head * dir_block; | |
617ba13b | 1782 | struct ext4_dir_entry_2 * de; |
ac27a0ec DK |
1783 | int err, retries = 0; |
1784 | ||
f8628a14 | 1785 | if (EXT4_DIR_LINK_MAX(dir)) |
ac27a0ec DK |
1786 | return -EMLINK; |
1787 | ||
1788 | retry: | |
617ba13b MC |
1789 | handle = ext4_journal_start(dir, EXT4_DATA_TRANS_BLOCKS(dir->i_sb) + |
1790 | EXT4_INDEX_EXTRA_TRANS_BLOCKS + 3 + | |
1791 | 2*EXT4_QUOTA_INIT_BLOCKS(dir->i_sb)); | |
ac27a0ec DK |
1792 | if (IS_ERR(handle)) |
1793 | return PTR_ERR(handle); | |
1794 | ||
1795 | if (IS_DIRSYNC(dir)) | |
1796 | handle->h_sync = 1; | |
1797 | ||
617ba13b | 1798 | inode = ext4_new_inode (handle, dir, S_IFDIR | mode); |
ac27a0ec DK |
1799 | err = PTR_ERR(inode); |
1800 | if (IS_ERR(inode)) | |
1801 | goto out_stop; | |
1802 | ||
617ba13b MC |
1803 | inode->i_op = &ext4_dir_inode_operations; |
1804 | inode->i_fop = &ext4_dir_operations; | |
1805 | inode->i_size = EXT4_I(inode)->i_disksize = inode->i_sb->s_blocksize; | |
1806 | dir_block = ext4_bread (handle, inode, 0, 1, &err); | |
ac27a0ec | 1807 | if (!dir_block) { |
f8628a14 | 1808 | ext4_dec_count(handle, inode); /* is this nlink == 0? */ |
617ba13b | 1809 | ext4_mark_inode_dirty(handle, inode); |
ac27a0ec DK |
1810 | iput (inode); |
1811 | goto out_stop; | |
1812 | } | |
1813 | BUFFER_TRACE(dir_block, "get_write_access"); | |
617ba13b MC |
1814 | ext4_journal_get_write_access(handle, dir_block); |
1815 | de = (struct ext4_dir_entry_2 *) dir_block->b_data; | |
ac27a0ec DK |
1816 | de->inode = cpu_to_le32(inode->i_ino); |
1817 | de->name_len = 1; | |
a72d7f83 | 1818 | de->rec_len = ext4_rec_len_to_disk(EXT4_DIR_REC_LEN(de->name_len)); |
ac27a0ec | 1819 | strcpy (de->name, "."); |
617ba13b | 1820 | ext4_set_de_type(dir->i_sb, de, S_IFDIR); |
a72d7f83 | 1821 | de = ext4_next_entry(de); |
ac27a0ec | 1822 | de->inode = cpu_to_le32(dir->i_ino); |
a72d7f83 JK |
1823 | de->rec_len = ext4_rec_len_to_disk(inode->i_sb->s_blocksize - |
1824 | EXT4_DIR_REC_LEN(1)); | |
ac27a0ec DK |
1825 | de->name_len = 2; |
1826 | strcpy (de->name, ".."); | |
617ba13b | 1827 | ext4_set_de_type(dir->i_sb, de, S_IFDIR); |
ac27a0ec | 1828 | inode->i_nlink = 2; |
617ba13b MC |
1829 | BUFFER_TRACE(dir_block, "call ext4_journal_dirty_metadata"); |
1830 | ext4_journal_dirty_metadata(handle, dir_block); | |
ac27a0ec | 1831 | brelse (dir_block); |
617ba13b MC |
1832 | ext4_mark_inode_dirty(handle, inode); |
1833 | err = ext4_add_entry (handle, dentry, inode); | |
ac27a0ec DK |
1834 | if (err) { |
1835 | inode->i_nlink = 0; | |
617ba13b | 1836 | ext4_mark_inode_dirty(handle, inode); |
ac27a0ec DK |
1837 | iput (inode); |
1838 | goto out_stop; | |
1839 | } | |
f8628a14 | 1840 | ext4_inc_count(handle, dir); |
617ba13b MC |
1841 | ext4_update_dx_flag(dir); |
1842 | ext4_mark_inode_dirty(handle, dir); | |
ac27a0ec DK |
1843 | d_instantiate(dentry, inode); |
1844 | out_stop: | |
617ba13b MC |
1845 | ext4_journal_stop(handle); |
1846 | if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries)) | |
ac27a0ec DK |
1847 | goto retry; |
1848 | return err; | |
1849 | } | |
1850 | ||
1851 | /* | |
1852 | * routine to check that the specified directory is empty (for rmdir) | |
1853 | */ | |
1854 | static int empty_dir (struct inode * inode) | |
1855 | { | |
1856 | unsigned long offset; | |
1857 | struct buffer_head * bh; | |
617ba13b | 1858 | struct ext4_dir_entry_2 * de, * de1; |
ac27a0ec DK |
1859 | struct super_block * sb; |
1860 | int err = 0; | |
1861 | ||
1862 | sb = inode->i_sb; | |
617ba13b MC |
1863 | if (inode->i_size < EXT4_DIR_REC_LEN(1) + EXT4_DIR_REC_LEN(2) || |
1864 | !(bh = ext4_bread (NULL, inode, 0, 0, &err))) { | |
ac27a0ec | 1865 | if (err) |
617ba13b | 1866 | ext4_error(inode->i_sb, __FUNCTION__, |
ac27a0ec DK |
1867 | "error %d reading directory #%lu offset 0", |
1868 | err, inode->i_ino); | |
1869 | else | |
617ba13b | 1870 | ext4_warning(inode->i_sb, __FUNCTION__, |
ac27a0ec DK |
1871 | "bad directory (dir #%lu) - no data block", |
1872 | inode->i_ino); | |
1873 | return 1; | |
1874 | } | |
617ba13b | 1875 | de = (struct ext4_dir_entry_2 *) bh->b_data; |
a72d7f83 | 1876 | de1 = ext4_next_entry(de); |
ac27a0ec DK |
1877 | if (le32_to_cpu(de->inode) != inode->i_ino || |
1878 | !le32_to_cpu(de1->inode) || | |
1879 | strcmp (".", de->name) || | |
1880 | strcmp ("..", de1->name)) { | |
617ba13b | 1881 | ext4_warning (inode->i_sb, "empty_dir", |
ac27a0ec DK |
1882 | "bad directory (dir #%lu) - no `.' or `..'", |
1883 | inode->i_ino); | |
1884 | brelse (bh); | |
1885 | return 1; | |
1886 | } | |
a72d7f83 JK |
1887 | offset = ext4_rec_len_from_disk(de->rec_len) + |
1888 | ext4_rec_len_from_disk(de1->rec_len); | |
1889 | de = ext4_next_entry(de1); | |
ac27a0ec DK |
1890 | while (offset < inode->i_size ) { |
1891 | if (!bh || | |
1892 | (void *) de >= (void *) (bh->b_data+sb->s_blocksize)) { | |
1893 | err = 0; | |
1894 | brelse (bh); | |
617ba13b MC |
1895 | bh = ext4_bread (NULL, inode, |
1896 | offset >> EXT4_BLOCK_SIZE_BITS(sb), 0, &err); | |
ac27a0ec DK |
1897 | if (!bh) { |
1898 | if (err) | |
617ba13b | 1899 | ext4_error(sb, __FUNCTION__, |
ac27a0ec DK |
1900 | "error %d reading directory" |
1901 | " #%lu offset %lu", | |
1902 | err, inode->i_ino, offset); | |
1903 | offset += sb->s_blocksize; | |
1904 | continue; | |
1905 | } | |
617ba13b | 1906 | de = (struct ext4_dir_entry_2 *) bh->b_data; |
ac27a0ec | 1907 | } |
617ba13b MC |
1908 | if (!ext4_check_dir_entry("empty_dir", inode, de, bh, offset)) { |
1909 | de = (struct ext4_dir_entry_2 *)(bh->b_data + | |
ac27a0ec DK |
1910 | sb->s_blocksize); |
1911 | offset = (offset | (sb->s_blocksize - 1)) + 1; | |
1912 | continue; | |
1913 | } | |
1914 | if (le32_to_cpu(de->inode)) { | |
1915 | brelse (bh); | |
1916 | return 0; | |
1917 | } | |
a72d7f83 JK |
1918 | offset += ext4_rec_len_from_disk(de->rec_len); |
1919 | de = ext4_next_entry(de); | |
ac27a0ec DK |
1920 | } |
1921 | brelse (bh); | |
1922 | return 1; | |
1923 | } | |
1924 | ||
617ba13b | 1925 | /* ext4_orphan_add() links an unlinked or truncated inode into a list of |
ac27a0ec DK |
1926 | * such inodes, starting at the superblock, in case we crash before the |
1927 | * file is closed/deleted, or in case the inode truncate spans multiple | |
1928 | * transactions and the last transaction is not recovered after a crash. | |
1929 | * | |
1930 | * At filesystem recovery time, we walk this list deleting unlinked | |
617ba13b | 1931 | * inodes and truncating linked inodes in ext4_orphan_cleanup(). |
ac27a0ec | 1932 | */ |
617ba13b | 1933 | int ext4_orphan_add(handle_t *handle, struct inode *inode) |
ac27a0ec DK |
1934 | { |
1935 | struct super_block *sb = inode->i_sb; | |
617ba13b | 1936 | struct ext4_iloc iloc; |
ac27a0ec DK |
1937 | int err = 0, rc; |
1938 | ||
1939 | lock_super(sb); | |
617ba13b | 1940 | if (!list_empty(&EXT4_I(inode)->i_orphan)) |
ac27a0ec DK |
1941 | goto out_unlock; |
1942 | ||
1943 | /* Orphan handling is only valid for files with data blocks | |
1944 | * being truncated, or files being unlinked. */ | |
1945 | ||
1946 | /* @@@ FIXME: Observation from aviro: | |
617ba13b MC |
1947 | * I think I can trigger J_ASSERT in ext4_orphan_add(). We block |
1948 | * here (on lock_super()), so race with ext4_link() which might bump | |
ac27a0ec DK |
1949 | * ->i_nlink. For, say it, character device. Not a regular file, |
1950 | * not a directory, not a symlink and ->i_nlink > 0. | |
1951 | */ | |
1952 | J_ASSERT ((S_ISREG(inode->i_mode) || S_ISDIR(inode->i_mode) || | |
1953 | S_ISLNK(inode->i_mode)) || inode->i_nlink == 0); | |
1954 | ||
617ba13b MC |
1955 | BUFFER_TRACE(EXT4_SB(sb)->s_sbh, "get_write_access"); |
1956 | err = ext4_journal_get_write_access(handle, EXT4_SB(sb)->s_sbh); | |
ac27a0ec DK |
1957 | if (err) |
1958 | goto out_unlock; | |
1959 | ||
617ba13b | 1960 | err = ext4_reserve_inode_write(handle, inode, &iloc); |
ac27a0ec DK |
1961 | if (err) |
1962 | goto out_unlock; | |
1963 | ||
1964 | /* Insert this inode at the head of the on-disk orphan list... */ | |
617ba13b MC |
1965 | NEXT_ORPHAN(inode) = le32_to_cpu(EXT4_SB(sb)->s_es->s_last_orphan); |
1966 | EXT4_SB(sb)->s_es->s_last_orphan = cpu_to_le32(inode->i_ino); | |
1967 | err = ext4_journal_dirty_metadata(handle, EXT4_SB(sb)->s_sbh); | |
1968 | rc = ext4_mark_iloc_dirty(handle, inode, &iloc); | |
ac27a0ec DK |
1969 | if (!err) |
1970 | err = rc; | |
1971 | ||
1972 | /* Only add to the head of the in-memory list if all the | |
1973 | * previous operations succeeded. If the orphan_add is going to | |
1974 | * fail (possibly taking the journal offline), we can't risk | |
1975 | * leaving the inode on the orphan list: stray orphan-list | |
1976 | * entries can cause panics at unmount time. | |
1977 | * | |
1978 | * This is safe: on error we're going to ignore the orphan list | |
1979 | * anyway on the next recovery. */ | |
1980 | if (!err) | |
617ba13b | 1981 | list_add(&EXT4_I(inode)->i_orphan, &EXT4_SB(sb)->s_orphan); |
ac27a0ec DK |
1982 | |
1983 | jbd_debug(4, "superblock will point to %lu\n", inode->i_ino); | |
1984 | jbd_debug(4, "orphan inode %lu will point to %d\n", | |
1985 | inode->i_ino, NEXT_ORPHAN(inode)); | |
1986 | out_unlock: | |
1987 | unlock_super(sb); | |
617ba13b | 1988 | ext4_std_error(inode->i_sb, err); |
ac27a0ec DK |
1989 | return err; |
1990 | } | |
1991 | ||
1992 | /* | |
617ba13b | 1993 | * ext4_orphan_del() removes an unlinked or truncated inode from the list |
ac27a0ec DK |
1994 | * of such inodes stored on disk, because it is finally being cleaned up. |
1995 | */ | |
617ba13b | 1996 | int ext4_orphan_del(handle_t *handle, struct inode *inode) |
ac27a0ec DK |
1997 | { |
1998 | struct list_head *prev; | |
617ba13b MC |
1999 | struct ext4_inode_info *ei = EXT4_I(inode); |
2000 | struct ext4_sb_info *sbi; | |
ac27a0ec | 2001 | unsigned long ino_next; |
617ba13b | 2002 | struct ext4_iloc iloc; |
ac27a0ec DK |
2003 | int err = 0; |
2004 | ||
2005 | lock_super(inode->i_sb); | |
2006 | if (list_empty(&ei->i_orphan)) { | |
2007 | unlock_super(inode->i_sb); | |
2008 | return 0; | |
2009 | } | |
2010 | ||
2011 | ino_next = NEXT_ORPHAN(inode); | |
2012 | prev = ei->i_orphan.prev; | |
617ba13b | 2013 | sbi = EXT4_SB(inode->i_sb); |
ac27a0ec DK |
2014 | |
2015 | jbd_debug(4, "remove inode %lu from orphan list\n", inode->i_ino); | |
2016 | ||
2017 | list_del_init(&ei->i_orphan); | |
2018 | ||
2019 | /* If we're on an error path, we may not have a valid | |
2020 | * transaction handle with which to update the orphan list on | |
2021 | * disk, but we still need to remove the inode from the linked | |
2022 | * list in memory. */ | |
2023 | if (!handle) | |
2024 | goto out; | |
2025 | ||
617ba13b | 2026 | err = ext4_reserve_inode_write(handle, inode, &iloc); |
ac27a0ec DK |
2027 | if (err) |
2028 | goto out_err; | |
2029 | ||
2030 | if (prev == &sbi->s_orphan) { | |
2031 | jbd_debug(4, "superblock will point to %lu\n", ino_next); | |
2032 | BUFFER_TRACE(sbi->s_sbh, "get_write_access"); | |
617ba13b | 2033 | err = ext4_journal_get_write_access(handle, sbi->s_sbh); |
ac27a0ec DK |
2034 | if (err) |
2035 | goto out_brelse; | |
2036 | sbi->s_es->s_last_orphan = cpu_to_le32(ino_next); | |
617ba13b | 2037 | err = ext4_journal_dirty_metadata(handle, sbi->s_sbh); |
ac27a0ec | 2038 | } else { |
617ba13b | 2039 | struct ext4_iloc iloc2; |
ac27a0ec | 2040 | struct inode *i_prev = |
617ba13b | 2041 | &list_entry(prev, struct ext4_inode_info, i_orphan)->vfs_inode; |
ac27a0ec DK |
2042 | |
2043 | jbd_debug(4, "orphan inode %lu will point to %lu\n", | |
2044 | i_prev->i_ino, ino_next); | |
617ba13b | 2045 | err = ext4_reserve_inode_write(handle, i_prev, &iloc2); |
ac27a0ec DK |
2046 | if (err) |
2047 | goto out_brelse; | |
2048 | NEXT_ORPHAN(i_prev) = ino_next; | |
617ba13b | 2049 | err = ext4_mark_iloc_dirty(handle, i_prev, &iloc2); |
ac27a0ec DK |
2050 | } |
2051 | if (err) | |
2052 | goto out_brelse; | |
2053 | NEXT_ORPHAN(inode) = 0; | |
617ba13b | 2054 | err = ext4_mark_iloc_dirty(handle, inode, &iloc); |
ac27a0ec DK |
2055 | |
2056 | out_err: | |
617ba13b | 2057 | ext4_std_error(inode->i_sb, err); |
ac27a0ec DK |
2058 | out: |
2059 | unlock_super(inode->i_sb); | |
2060 | return err; | |
2061 | ||
2062 | out_brelse: | |
2063 | brelse(iloc.bh); | |
2064 | goto out_err; | |
2065 | } | |
2066 | ||
617ba13b | 2067 | static int ext4_rmdir (struct inode * dir, struct dentry *dentry) |
ac27a0ec DK |
2068 | { |
2069 | int retval; | |
2070 | struct inode * inode; | |
2071 | struct buffer_head * bh; | |
617ba13b | 2072 | struct ext4_dir_entry_2 * de; |
ac27a0ec DK |
2073 | handle_t *handle; |
2074 | ||
2075 | /* Initialize quotas before so that eventual writes go in | |
2076 | * separate transaction */ | |
2077 | DQUOT_INIT(dentry->d_inode); | |
617ba13b | 2078 | handle = ext4_journal_start(dir, EXT4_DELETE_TRANS_BLOCKS(dir->i_sb)); |
ac27a0ec DK |
2079 | if (IS_ERR(handle)) |
2080 | return PTR_ERR(handle); | |
2081 | ||
2082 | retval = -ENOENT; | |
617ba13b | 2083 | bh = ext4_find_entry (dentry, &de); |
ac27a0ec DK |
2084 | if (!bh) |
2085 | goto end_rmdir; | |
2086 | ||
2087 | if (IS_DIRSYNC(dir)) | |
2088 | handle->h_sync = 1; | |
2089 | ||
2090 | inode = dentry->d_inode; | |
2091 | ||
2092 | retval = -EIO; | |
2093 | if (le32_to_cpu(de->inode) != inode->i_ino) | |
2094 | goto end_rmdir; | |
2095 | ||
2096 | retval = -ENOTEMPTY; | |
2097 | if (!empty_dir (inode)) | |
2098 | goto end_rmdir; | |
2099 | ||
617ba13b | 2100 | retval = ext4_delete_entry(handle, dir, de, bh); |
ac27a0ec DK |
2101 | if (retval) |
2102 | goto end_rmdir; | |
f8628a14 | 2103 | if (!EXT4_DIR_LINK_EMPTY(inode)) |
617ba13b | 2104 | ext4_warning (inode->i_sb, "ext4_rmdir", |
f8628a14 | 2105 | "empty directory has too many links (%d)", |
ac27a0ec DK |
2106 | inode->i_nlink); |
2107 | inode->i_version++; | |
2108 | clear_nlink(inode); | |
2109 | /* There's no need to set i_disksize: the fact that i_nlink is | |
2110 | * zero will ensure that the right thing happens during any | |
2111 | * recovery. */ | |
2112 | inode->i_size = 0; | |
617ba13b | 2113 | ext4_orphan_add(handle, inode); |
ef7f3835 | 2114 | inode->i_ctime = dir->i_ctime = dir->i_mtime = ext4_current_time(inode); |
617ba13b | 2115 | ext4_mark_inode_dirty(handle, inode); |
f8628a14 | 2116 | ext4_dec_count(handle, dir); |
617ba13b MC |
2117 | ext4_update_dx_flag(dir); |
2118 | ext4_mark_inode_dirty(handle, dir); | |
ac27a0ec DK |
2119 | |
2120 | end_rmdir: | |
617ba13b | 2121 | ext4_journal_stop(handle); |
ac27a0ec DK |
2122 | brelse (bh); |
2123 | return retval; | |
2124 | } | |
2125 | ||
617ba13b | 2126 | static int ext4_unlink(struct inode * dir, struct dentry *dentry) |
ac27a0ec DK |
2127 | { |
2128 | int retval; | |
2129 | struct inode * inode; | |
2130 | struct buffer_head * bh; | |
617ba13b | 2131 | struct ext4_dir_entry_2 * de; |
ac27a0ec DK |
2132 | handle_t *handle; |
2133 | ||
2134 | /* Initialize quotas before so that eventual writes go | |
2135 | * in separate transaction */ | |
2136 | DQUOT_INIT(dentry->d_inode); | |
617ba13b | 2137 | handle = ext4_journal_start(dir, EXT4_DELETE_TRANS_BLOCKS(dir->i_sb)); |
ac27a0ec DK |
2138 | if (IS_ERR(handle)) |
2139 | return PTR_ERR(handle); | |
2140 | ||
2141 | if (IS_DIRSYNC(dir)) | |
2142 | handle->h_sync = 1; | |
2143 | ||
2144 | retval = -ENOENT; | |
617ba13b | 2145 | bh = ext4_find_entry (dentry, &de); |
ac27a0ec DK |
2146 | if (!bh) |
2147 | goto end_unlink; | |
2148 | ||
2149 | inode = dentry->d_inode; | |
2150 | ||
2151 | retval = -EIO; | |
2152 | if (le32_to_cpu(de->inode) != inode->i_ino) | |
2153 | goto end_unlink; | |
2154 | ||
2155 | if (!inode->i_nlink) { | |
617ba13b | 2156 | ext4_warning (inode->i_sb, "ext4_unlink", |
ac27a0ec DK |
2157 | "Deleting nonexistent file (%lu), %d", |
2158 | inode->i_ino, inode->i_nlink); | |
2159 | inode->i_nlink = 1; | |
2160 | } | |
617ba13b | 2161 | retval = ext4_delete_entry(handle, dir, de, bh); |
ac27a0ec DK |
2162 | if (retval) |
2163 | goto end_unlink; | |
ef7f3835 | 2164 | dir->i_ctime = dir->i_mtime = ext4_current_time(dir); |
617ba13b MC |
2165 | ext4_update_dx_flag(dir); |
2166 | ext4_mark_inode_dirty(handle, dir); | |
f8628a14 | 2167 | ext4_dec_count(handle, inode); |
ac27a0ec | 2168 | if (!inode->i_nlink) |
617ba13b | 2169 | ext4_orphan_add(handle, inode); |
ef7f3835 | 2170 | inode->i_ctime = ext4_current_time(inode); |
617ba13b | 2171 | ext4_mark_inode_dirty(handle, inode); |
ac27a0ec DK |
2172 | retval = 0; |
2173 | ||
2174 | end_unlink: | |
617ba13b | 2175 | ext4_journal_stop(handle); |
ac27a0ec DK |
2176 | brelse (bh); |
2177 | return retval; | |
2178 | } | |
2179 | ||
617ba13b | 2180 | static int ext4_symlink (struct inode * dir, |
ac27a0ec DK |
2181 | struct dentry *dentry, const char * symname) |
2182 | { | |
2183 | handle_t *handle; | |
2184 | struct inode * inode; | |
2185 | int l, err, retries = 0; | |
2186 | ||
2187 | l = strlen(symname)+1; | |
2188 | if (l > dir->i_sb->s_blocksize) | |
2189 | return -ENAMETOOLONG; | |
2190 | ||
2191 | retry: | |
617ba13b MC |
2192 | handle = ext4_journal_start(dir, EXT4_DATA_TRANS_BLOCKS(dir->i_sb) + |
2193 | EXT4_INDEX_EXTRA_TRANS_BLOCKS + 5 + | |
2194 | 2*EXT4_QUOTA_INIT_BLOCKS(dir->i_sb)); | |
ac27a0ec DK |
2195 | if (IS_ERR(handle)) |
2196 | return PTR_ERR(handle); | |
2197 | ||
2198 | if (IS_DIRSYNC(dir)) | |
2199 | handle->h_sync = 1; | |
2200 | ||
617ba13b | 2201 | inode = ext4_new_inode (handle, dir, S_IFLNK|S_IRWXUGO); |
ac27a0ec DK |
2202 | err = PTR_ERR(inode); |
2203 | if (IS_ERR(inode)) | |
2204 | goto out_stop; | |
2205 | ||
617ba13b MC |
2206 | if (l > sizeof (EXT4_I(inode)->i_data)) { |
2207 | inode->i_op = &ext4_symlink_inode_operations; | |
2208 | ext4_set_aops(inode); | |
ac27a0ec | 2209 | /* |
617ba13b | 2210 | * page_symlink() calls into ext4_prepare/commit_write. |
ac27a0ec DK |
2211 | * We have a transaction open. All is sweetness. It also sets |
2212 | * i_size in generic_commit_write(). | |
2213 | */ | |
2214 | err = __page_symlink(inode, symname, l, | |
2215 | mapping_gfp_mask(inode->i_mapping) & ~__GFP_FS); | |
2216 | if (err) { | |
f8628a14 | 2217 | ext4_dec_count(handle, inode); |
617ba13b | 2218 | ext4_mark_inode_dirty(handle, inode); |
ac27a0ec DK |
2219 | iput (inode); |
2220 | goto out_stop; | |
2221 | } | |
2222 | } else { | |
617ba13b MC |
2223 | inode->i_op = &ext4_fast_symlink_inode_operations; |
2224 | memcpy((char*)&EXT4_I(inode)->i_data,symname,l); | |
ac27a0ec | 2225 | inode->i_size = l-1; |
b8356c46 | 2226 | EXT4_I(inode)->i_flags &= ~EXT4_EXTENTS_FL; |
ac27a0ec | 2227 | } |
617ba13b MC |
2228 | EXT4_I(inode)->i_disksize = inode->i_size; |
2229 | err = ext4_add_nondir(handle, dentry, inode); | |
ac27a0ec | 2230 | out_stop: |
617ba13b MC |
2231 | ext4_journal_stop(handle); |
2232 | if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries)) | |
ac27a0ec DK |
2233 | goto retry; |
2234 | return err; | |
2235 | } | |
2236 | ||
617ba13b | 2237 | static int ext4_link (struct dentry * old_dentry, |
ac27a0ec DK |
2238 | struct inode * dir, struct dentry *dentry) |
2239 | { | |
2240 | handle_t *handle; | |
2241 | struct inode *inode = old_dentry->d_inode; | |
2242 | int err, retries = 0; | |
2243 | ||
f8628a14 | 2244 | if (EXT4_DIR_LINK_MAX(inode)) |
ac27a0ec | 2245 | return -EMLINK; |
f8628a14 | 2246 | |
2988a774 ES |
2247 | /* |
2248 | * Return -ENOENT if we've raced with unlink and i_nlink is 0. Doing | |
2249 | * otherwise has the potential to corrupt the orphan inode list. | |
2250 | */ | |
2251 | if (inode->i_nlink == 0) | |
2252 | return -ENOENT; | |
ac27a0ec DK |
2253 | |
2254 | retry: | |
617ba13b MC |
2255 | handle = ext4_journal_start(dir, EXT4_DATA_TRANS_BLOCKS(dir->i_sb) + |
2256 | EXT4_INDEX_EXTRA_TRANS_BLOCKS); | |
ac27a0ec DK |
2257 | if (IS_ERR(handle)) |
2258 | return PTR_ERR(handle); | |
2259 | ||
2260 | if (IS_DIRSYNC(dir)) | |
2261 | handle->h_sync = 1; | |
2262 | ||
ef7f3835 | 2263 | inode->i_ctime = ext4_current_time(inode); |
f8628a14 | 2264 | ext4_inc_count(handle, inode); |
ac27a0ec DK |
2265 | atomic_inc(&inode->i_count); |
2266 | ||
617ba13b MC |
2267 | err = ext4_add_nondir(handle, dentry, inode); |
2268 | ext4_journal_stop(handle); | |
2269 | if (err == -ENOSPC && ext4_should_retry_alloc(dir->i_sb, &retries)) | |
ac27a0ec DK |
2270 | goto retry; |
2271 | return err; | |
2272 | } | |
2273 | ||
2274 | #define PARENT_INO(buffer) \ | |
a72d7f83 | 2275 | (ext4_next_entry((struct ext4_dir_entry_2 *)(buffer))->inode) |
ac27a0ec DK |
2276 | |
2277 | /* | |
2278 | * Anybody can rename anything with this: the permission checks are left to the | |
2279 | * higher-level routines. | |
2280 | */ | |
617ba13b | 2281 | static int ext4_rename (struct inode * old_dir, struct dentry *old_dentry, |
ac27a0ec DK |
2282 | struct inode * new_dir,struct dentry *new_dentry) |
2283 | { | |
2284 | handle_t *handle; | |
2285 | struct inode * old_inode, * new_inode; | |
2286 | struct buffer_head * old_bh, * new_bh, * dir_bh; | |
617ba13b | 2287 | struct ext4_dir_entry_2 * old_de, * new_de; |
ac27a0ec DK |
2288 | int retval; |
2289 | ||
2290 | old_bh = new_bh = dir_bh = NULL; | |
2291 | ||
2292 | /* Initialize quotas before so that eventual writes go | |
2293 | * in separate transaction */ | |
2294 | if (new_dentry->d_inode) | |
2295 | DQUOT_INIT(new_dentry->d_inode); | |
617ba13b MC |
2296 | handle = ext4_journal_start(old_dir, 2 * |
2297 | EXT4_DATA_TRANS_BLOCKS(old_dir->i_sb) + | |
2298 | EXT4_INDEX_EXTRA_TRANS_BLOCKS + 2); | |
ac27a0ec DK |
2299 | if (IS_ERR(handle)) |
2300 | return PTR_ERR(handle); | |
2301 | ||
2302 | if (IS_DIRSYNC(old_dir) || IS_DIRSYNC(new_dir)) | |
2303 | handle->h_sync = 1; | |
2304 | ||
617ba13b | 2305 | old_bh = ext4_find_entry (old_dentry, &old_de); |
ac27a0ec DK |
2306 | /* |
2307 | * Check for inode number is _not_ due to possible IO errors. | |
2308 | * We might rmdir the source, keep it as pwd of some process | |
2309 | * and merrily kill the link to whatever was created under the | |
2310 | * same name. Goodbye sticky bit ;-< | |
2311 | */ | |
2312 | old_inode = old_dentry->d_inode; | |
2313 | retval = -ENOENT; | |
2314 | if (!old_bh || le32_to_cpu(old_de->inode) != old_inode->i_ino) | |
2315 | goto end_rename; | |
2316 | ||
2317 | new_inode = new_dentry->d_inode; | |
617ba13b | 2318 | new_bh = ext4_find_entry (new_dentry, &new_de); |
ac27a0ec DK |
2319 | if (new_bh) { |
2320 | if (!new_inode) { | |
2321 | brelse (new_bh); | |
2322 | new_bh = NULL; | |
2323 | } | |
2324 | } | |
2325 | if (S_ISDIR(old_inode->i_mode)) { | |
2326 | if (new_inode) { | |
2327 | retval = -ENOTEMPTY; | |
2328 | if (!empty_dir (new_inode)) | |
2329 | goto end_rename; | |
2330 | } | |
2331 | retval = -EIO; | |
617ba13b | 2332 | dir_bh = ext4_bread (handle, old_inode, 0, 0, &retval); |
ac27a0ec DK |
2333 | if (!dir_bh) |
2334 | goto end_rename; | |
2335 | if (le32_to_cpu(PARENT_INO(dir_bh->b_data)) != old_dir->i_ino) | |
2336 | goto end_rename; | |
2337 | retval = -EMLINK; | |
2338 | if (!new_inode && new_dir!=old_dir && | |
617ba13b | 2339 | new_dir->i_nlink >= EXT4_LINK_MAX) |
ac27a0ec DK |
2340 | goto end_rename; |
2341 | } | |
2342 | if (!new_bh) { | |
617ba13b | 2343 | retval = ext4_add_entry (handle, new_dentry, old_inode); |
ac27a0ec DK |
2344 | if (retval) |
2345 | goto end_rename; | |
2346 | } else { | |
2347 | BUFFER_TRACE(new_bh, "get write access"); | |
617ba13b | 2348 | ext4_journal_get_write_access(handle, new_bh); |
ac27a0ec | 2349 | new_de->inode = cpu_to_le32(old_inode->i_ino); |
617ba13b MC |
2350 | if (EXT4_HAS_INCOMPAT_FEATURE(new_dir->i_sb, |
2351 | EXT4_FEATURE_INCOMPAT_FILETYPE)) | |
ac27a0ec DK |
2352 | new_de->file_type = old_de->file_type; |
2353 | new_dir->i_version++; | |
617ba13b MC |
2354 | BUFFER_TRACE(new_bh, "call ext4_journal_dirty_metadata"); |
2355 | ext4_journal_dirty_metadata(handle, new_bh); | |
ac27a0ec DK |
2356 | brelse(new_bh); |
2357 | new_bh = NULL; | |
2358 | } | |
2359 | ||
2360 | /* | |
2361 | * Like most other Unix systems, set the ctime for inodes on a | |
2362 | * rename. | |
2363 | */ | |
ef7f3835 | 2364 | old_inode->i_ctime = ext4_current_time(old_inode); |
617ba13b | 2365 | ext4_mark_inode_dirty(handle, old_inode); |
ac27a0ec DK |
2366 | |
2367 | /* | |
2368 | * ok, that's it | |
2369 | */ | |
2370 | if (le32_to_cpu(old_de->inode) != old_inode->i_ino || | |
2371 | old_de->name_len != old_dentry->d_name.len || | |
2372 | strncmp(old_de->name, old_dentry->d_name.name, old_de->name_len) || | |
617ba13b | 2373 | (retval = ext4_delete_entry(handle, old_dir, |
ac27a0ec DK |
2374 | old_de, old_bh)) == -ENOENT) { |
2375 | /* old_de could have moved from under us during htree split, so | |
2376 | * make sure that we are deleting the right entry. We might | |
2377 | * also be pointing to a stale entry in the unused part of | |
2378 | * old_bh so just checking inum and the name isn't enough. */ | |
2379 | struct buffer_head *old_bh2; | |
617ba13b | 2380 | struct ext4_dir_entry_2 *old_de2; |
ac27a0ec | 2381 | |
617ba13b | 2382 | old_bh2 = ext4_find_entry(old_dentry, &old_de2); |
ac27a0ec | 2383 | if (old_bh2) { |
617ba13b | 2384 | retval = ext4_delete_entry(handle, old_dir, |
ac27a0ec DK |
2385 | old_de2, old_bh2); |
2386 | brelse(old_bh2); | |
2387 | } | |
2388 | } | |
2389 | if (retval) { | |
617ba13b | 2390 | ext4_warning(old_dir->i_sb, "ext4_rename", |
ac27a0ec DK |
2391 | "Deleting old file (%lu), %d, error=%d", |
2392 | old_dir->i_ino, old_dir->i_nlink, retval); | |
2393 | } | |
2394 | ||
2395 | if (new_inode) { | |
f8628a14 | 2396 | ext4_dec_count(handle, new_inode); |
ef7f3835 | 2397 | new_inode->i_ctime = ext4_current_time(new_inode); |
ac27a0ec | 2398 | } |
ef7f3835 | 2399 | old_dir->i_ctime = old_dir->i_mtime = ext4_current_time(old_dir); |
617ba13b | 2400 | ext4_update_dx_flag(old_dir); |
ac27a0ec DK |
2401 | if (dir_bh) { |
2402 | BUFFER_TRACE(dir_bh, "get_write_access"); | |
617ba13b | 2403 | ext4_journal_get_write_access(handle, dir_bh); |
ac27a0ec | 2404 | PARENT_INO(dir_bh->b_data) = cpu_to_le32(new_dir->i_ino); |
617ba13b MC |
2405 | BUFFER_TRACE(dir_bh, "call ext4_journal_dirty_metadata"); |
2406 | ext4_journal_dirty_metadata(handle, dir_bh); | |
f8628a14 | 2407 | ext4_dec_count(handle, old_dir); |
ac27a0ec | 2408 | if (new_inode) { |
f8628a14 AD |
2409 | /* checked empty_dir above, can't have another parent, |
2410 | * ext3_dec_count() won't work for many-linked dirs */ | |
2411 | new_inode->i_nlink = 0; | |
ac27a0ec | 2412 | } else { |
f8628a14 | 2413 | ext4_inc_count(handle, new_dir); |
617ba13b MC |
2414 | ext4_update_dx_flag(new_dir); |
2415 | ext4_mark_inode_dirty(handle, new_dir); | |
ac27a0ec DK |
2416 | } |
2417 | } | |
617ba13b | 2418 | ext4_mark_inode_dirty(handle, old_dir); |
ac27a0ec | 2419 | if (new_inode) { |
617ba13b | 2420 | ext4_mark_inode_dirty(handle, new_inode); |
ac27a0ec | 2421 | if (!new_inode->i_nlink) |
617ba13b | 2422 | ext4_orphan_add(handle, new_inode); |
ac27a0ec DK |
2423 | } |
2424 | retval = 0; | |
2425 | ||
2426 | end_rename: | |
2427 | brelse (dir_bh); | |
2428 | brelse (old_bh); | |
2429 | brelse (new_bh); | |
617ba13b | 2430 | ext4_journal_stop(handle); |
ac27a0ec DK |
2431 | return retval; |
2432 | } | |
2433 | ||
2434 | /* | |
2435 | * directories can handle most operations... | |
2436 | */ | |
754661f1 | 2437 | const struct inode_operations ext4_dir_inode_operations = { |
617ba13b MC |
2438 | .create = ext4_create, |
2439 | .lookup = ext4_lookup, | |
2440 | .link = ext4_link, | |
2441 | .unlink = ext4_unlink, | |
2442 | .symlink = ext4_symlink, | |
2443 | .mkdir = ext4_mkdir, | |
2444 | .rmdir = ext4_rmdir, | |
2445 | .mknod = ext4_mknod, | |
2446 | .rename = ext4_rename, | |
2447 | .setattr = ext4_setattr, | |
2448 | #ifdef CONFIG_EXT4DEV_FS_XATTR | |
ac27a0ec DK |
2449 | .setxattr = generic_setxattr, |
2450 | .getxattr = generic_getxattr, | |
617ba13b | 2451 | .listxattr = ext4_listxattr, |
ac27a0ec DK |
2452 | .removexattr = generic_removexattr, |
2453 | #endif | |
617ba13b | 2454 | .permission = ext4_permission, |
ac27a0ec DK |
2455 | }; |
2456 | ||
754661f1 | 2457 | const struct inode_operations ext4_special_inode_operations = { |
617ba13b MC |
2458 | .setattr = ext4_setattr, |
2459 | #ifdef CONFIG_EXT4DEV_FS_XATTR | |
ac27a0ec DK |
2460 | .setxattr = generic_setxattr, |
2461 | .getxattr = generic_getxattr, | |
617ba13b | 2462 | .listxattr = ext4_listxattr, |
ac27a0ec DK |
2463 | .removexattr = generic_removexattr, |
2464 | #endif | |
617ba13b | 2465 | .permission = ext4_permission, |
ac27a0ec | 2466 | }; |