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