Commit | Line | Data |
---|---|---|
0a8165d7 | 1 | /* |
6b4ea016 JK |
2 | * fs/f2fs/dir.c |
3 | * | |
4 | * Copyright (c) 2012 Samsung Electronics Co., Ltd. | |
5 | * http://www.samsung.com/ | |
6 | * | |
7 | * This program is free software; you can redistribute it and/or modify | |
8 | * it under the terms of the GNU General Public License version 2 as | |
9 | * published by the Free Software Foundation. | |
10 | */ | |
11 | #include <linux/fs.h> | |
12 | #include <linux/f2fs_fs.h> | |
13 | #include "f2fs.h" | |
398b1ac5 | 14 | #include "node.h" |
6b4ea016 | 15 | #include "acl.h" |
8ae8f162 | 16 | #include "xattr.h" |
6b4ea016 JK |
17 | |
18 | static unsigned long dir_blocks(struct inode *inode) | |
19 | { | |
20 | return ((unsigned long long) (i_size_read(inode) + PAGE_CACHE_SIZE - 1)) | |
21 | >> PAGE_CACHE_SHIFT; | |
22 | } | |
23 | ||
38431545 | 24 | static unsigned int dir_buckets(unsigned int level, int dir_level) |
6b4ea016 | 25 | { |
bfec07d0 | 26 | if (level + dir_level < MAX_DIR_HASH_DEPTH / 2) |
38431545 | 27 | return 1 << (level + dir_level); |
6b4ea016 | 28 | else |
bfec07d0 | 29 | return MAX_DIR_BUCKETS; |
6b4ea016 JK |
30 | } |
31 | ||
32 | static unsigned int bucket_blocks(unsigned int level) | |
33 | { | |
34 | if (level < MAX_DIR_HASH_DEPTH / 2) | |
35 | return 2; | |
36 | else | |
37 | return 4; | |
38 | } | |
39 | ||
dbeacf02 | 40 | unsigned char f2fs_filetype_table[F2FS_FT_MAX] = { |
6b4ea016 JK |
41 | [F2FS_FT_UNKNOWN] = DT_UNKNOWN, |
42 | [F2FS_FT_REG_FILE] = DT_REG, | |
43 | [F2FS_FT_DIR] = DT_DIR, | |
44 | [F2FS_FT_CHRDEV] = DT_CHR, | |
45 | [F2FS_FT_BLKDEV] = DT_BLK, | |
46 | [F2FS_FT_FIFO] = DT_FIFO, | |
47 | [F2FS_FT_SOCK] = DT_SOCK, | |
48 | [F2FS_FT_SYMLINK] = DT_LNK, | |
49 | }; | |
50 | ||
51 | #define S_SHIFT 12 | |
52 | static unsigned char f2fs_type_by_mode[S_IFMT >> S_SHIFT] = { | |
53 | [S_IFREG >> S_SHIFT] = F2FS_FT_REG_FILE, | |
54 | [S_IFDIR >> S_SHIFT] = F2FS_FT_DIR, | |
55 | [S_IFCHR >> S_SHIFT] = F2FS_FT_CHRDEV, | |
56 | [S_IFBLK >> S_SHIFT] = F2FS_FT_BLKDEV, | |
57 | [S_IFIFO >> S_SHIFT] = F2FS_FT_FIFO, | |
58 | [S_IFSOCK >> S_SHIFT] = F2FS_FT_SOCK, | |
59 | [S_IFLNK >> S_SHIFT] = F2FS_FT_SYMLINK, | |
60 | }; | |
61 | ||
dbeacf02 | 62 | void set_de_type(struct f2fs_dir_entry *de, struct inode *inode) |
6b4ea016 | 63 | { |
0ecc833b | 64 | umode_t mode = inode->i_mode; |
6b4ea016 JK |
65 | de->file_type = f2fs_type_by_mode[(mode & S_IFMT) >> S_SHIFT]; |
66 | } | |
67 | ||
38431545 JK |
68 | static unsigned long dir_block_index(unsigned int level, |
69 | int dir_level, unsigned int idx) | |
6b4ea016 JK |
70 | { |
71 | unsigned long i; | |
72 | unsigned long bidx = 0; | |
73 | ||
74 | for (i = 0; i < level; i++) | |
38431545 | 75 | bidx += dir_buckets(i, dir_level) * bucket_blocks(i); |
6b4ea016 JK |
76 | bidx += idx * bucket_blocks(level); |
77 | return bidx; | |
78 | } | |
79 | ||
4e6ebf6d | 80 | static bool early_match_name(size_t namelen, f2fs_hash_t namehash, |
eee6160f | 81 | struct f2fs_dir_entry *de) |
6b4ea016 JK |
82 | { |
83 | if (le16_to_cpu(de->name_len) != namelen) | |
84 | return false; | |
85 | ||
25ca923b | 86 | if (de->hash_code != namehash) |
6b4ea016 JK |
87 | return false; |
88 | ||
89 | return true; | |
90 | } | |
91 | ||
92 | static struct f2fs_dir_entry *find_in_block(struct page *dentry_page, | |
4e6ebf6d JK |
93 | struct qstr *name, int *max_slots, |
94 | struct page **res_page) | |
95 | { | |
96 | struct f2fs_dentry_block *dentry_blk; | |
97 | struct f2fs_dir_entry *de; | |
7b3cd7d6 | 98 | struct f2fs_dentry_ptr d; |
4e6ebf6d JK |
99 | |
100 | dentry_blk = (struct f2fs_dentry_block *)kmap(dentry_page); | |
7b3cd7d6 JK |
101 | |
102 | make_dentry_ptr(&d, (void *)dentry_blk, 1); | |
103 | de = find_target_dentry(name, max_slots, &d); | |
104 | ||
4e6ebf6d JK |
105 | if (de) |
106 | *res_page = dentry_page; | |
107 | else | |
108 | kunmap(dentry_page); | |
109 | ||
110 | /* | |
111 | * For the most part, it should be a bug when name_len is zero. | |
112 | * We stop here for figuring out where the bugs has occurred. | |
113 | */ | |
7b3cd7d6 | 114 | f2fs_bug_on(F2FS_P_SB(dentry_page), d.max < 0); |
4e6ebf6d JK |
115 | return de; |
116 | } | |
117 | ||
118 | struct f2fs_dir_entry *find_target_dentry(struct qstr *name, int *max_slots, | |
7b3cd7d6 | 119 | struct f2fs_dentry_ptr *d) |
6b4ea016 JK |
120 | { |
121 | struct f2fs_dir_entry *de; | |
5d0c6671 | 122 | unsigned long bit_pos = 0; |
4e6ebf6d | 123 | f2fs_hash_t namehash = f2fs_dentry_hash(name); |
5d0c6671 | 124 | int max_len = 0; |
6b4ea016 | 125 | |
7b3cd7d6 JK |
126 | if (max_slots) |
127 | *max_slots = 0; | |
128 | while (bit_pos < d->max) { | |
129 | if (!test_bit_le(bit_pos, d->bitmap)) { | |
5d0c6671 JK |
130 | if (bit_pos == 0) |
131 | max_len = 1; | |
7b3cd7d6 | 132 | else if (!test_bit_le(bit_pos - 1, d->bitmap)) |
5d0c6671 JK |
133 | max_len++; |
134 | bit_pos++; | |
135 | continue; | |
136 | } | |
7b3cd7d6 | 137 | de = &d->dentry[bit_pos]; |
4e6ebf6d | 138 | if (early_match_name(name->len, namehash, de) && |
7b3cd7d6 | 139 | !memcmp(d->filename[bit_pos], name->name, name->len)) |
4e6ebf6d JK |
140 | goto found; |
141 | ||
7b3cd7d6 | 142 | if (max_slots && *max_slots >= 0 && max_len > *max_slots) { |
5d0c6671 JK |
143 | *max_slots = max_len; |
144 | max_len = 0; | |
145 | } | |
81e366f8 | 146 | |
4e6ebf6d JK |
147 | /* remain bug on condition */ |
148 | if (unlikely(!de->name_len)) | |
7b3cd7d6 | 149 | d->max = -1; |
81e366f8 | 150 | |
5d0c6671 | 151 | bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len)); |
6b4ea016 JK |
152 | } |
153 | ||
154 | de = NULL; | |
6b4ea016 | 155 | found: |
7b3cd7d6 | 156 | if (max_slots && max_len > *max_slots) |
5d0c6671 | 157 | *max_slots = max_len; |
6b4ea016 JK |
158 | return de; |
159 | } | |
160 | ||
161 | static struct f2fs_dir_entry *find_in_level(struct inode *dir, | |
eee6160f | 162 | unsigned int level, struct qstr *name, |
6b4ea016 JK |
163 | f2fs_hash_t namehash, struct page **res_page) |
164 | { | |
eee6160f | 165 | int s = GET_DENTRY_SLOTS(name->len); |
6b4ea016 JK |
166 | unsigned int nbucket, nblock; |
167 | unsigned int bidx, end_block; | |
168 | struct page *dentry_page; | |
169 | struct f2fs_dir_entry *de = NULL; | |
170 | bool room = false; | |
4e6ebf6d | 171 | int max_slots; |
6b4ea016 | 172 | |
9850cf4a | 173 | f2fs_bug_on(F2FS_I_SB(dir), level > MAX_DIR_HASH_DEPTH); |
6b4ea016 | 174 | |
38431545 | 175 | nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level); |
6b4ea016 JK |
176 | nblock = bucket_blocks(level); |
177 | ||
38431545 JK |
178 | bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level, |
179 | le32_to_cpu(namehash) % nbucket); | |
6b4ea016 JK |
180 | end_block = bidx + nblock; |
181 | ||
182 | for (; bidx < end_block; bidx++) { | |
183 | /* no need to allocate new dentry pages to all the indices */ | |
c718379b | 184 | dentry_page = find_data_page(dir, bidx, true); |
6b4ea016 JK |
185 | if (IS_ERR(dentry_page)) { |
186 | room = true; | |
187 | continue; | |
188 | } | |
189 | ||
4e6ebf6d | 190 | de = find_in_block(dentry_page, name, &max_slots, res_page); |
6b4ea016 JK |
191 | if (de) |
192 | break; | |
193 | ||
194 | if (max_slots >= s) | |
195 | room = true; | |
196 | f2fs_put_page(dentry_page, 0); | |
197 | } | |
198 | ||
199 | if (!de && room && F2FS_I(dir)->chash != namehash) { | |
200 | F2FS_I(dir)->chash = namehash; | |
201 | F2FS_I(dir)->clevel = level; | |
202 | } | |
203 | ||
204 | return de; | |
205 | } | |
206 | ||
207 | /* | |
208 | * Find an entry in the specified directory with the wanted name. | |
209 | * It returns the page where the entry was found (as a parameter - res_page), | |
210 | * and the entry itself. Page is returned mapped and unlocked. | |
211 | * Entry is guaranteed to be valid. | |
212 | */ | |
213 | struct f2fs_dir_entry *f2fs_find_entry(struct inode *dir, | |
214 | struct qstr *child, struct page **res_page) | |
215 | { | |
6b4ea016 JK |
216 | unsigned long npages = dir_blocks(dir); |
217 | struct f2fs_dir_entry *de = NULL; | |
218 | f2fs_hash_t name_hash; | |
219 | unsigned int max_depth; | |
220 | unsigned int level; | |
221 | ||
b1f73b79 YZ |
222 | *res_page = NULL; |
223 | ||
622f28ae CY |
224 | if (f2fs_has_inline_dentry(dir)) |
225 | return find_in_inline_dir(dir, child, res_page); | |
226 | ||
6b4ea016 JK |
227 | if (npages == 0) |
228 | return NULL; | |
229 | ||
eee6160f | 230 | name_hash = f2fs_dentry_hash(child); |
6b4ea016 JK |
231 | max_depth = F2FS_I(dir)->i_current_depth; |
232 | ||
233 | for (level = 0; level < max_depth; level++) { | |
eee6160f | 234 | de = find_in_level(dir, level, child, name_hash, res_page); |
6b4ea016 JK |
235 | if (de) |
236 | break; | |
237 | } | |
238 | if (!de && F2FS_I(dir)->chash != name_hash) { | |
239 | F2FS_I(dir)->chash = name_hash; | |
240 | F2FS_I(dir)->clevel = level - 1; | |
241 | } | |
242 | return de; | |
243 | } | |
244 | ||
245 | struct f2fs_dir_entry *f2fs_parent_dir(struct inode *dir, struct page **p) | |
246 | { | |
4777f86b NJ |
247 | struct page *page; |
248 | struct f2fs_dir_entry *de; | |
249 | struct f2fs_dentry_block *dentry_blk; | |
6b4ea016 | 250 | |
622f28ae CY |
251 | if (f2fs_has_inline_dentry(dir)) |
252 | return f2fs_parent_inline_dir(dir, p); | |
253 | ||
6b4ea016 JK |
254 | page = get_lock_data_page(dir, 0); |
255 | if (IS_ERR(page)) | |
256 | return NULL; | |
257 | ||
258 | dentry_blk = kmap(page); | |
259 | de = &dentry_blk->dentry[1]; | |
260 | *p = page; | |
261 | unlock_page(page); | |
262 | return de; | |
263 | } | |
264 | ||
265 | ino_t f2fs_inode_by_name(struct inode *dir, struct qstr *qstr) | |
266 | { | |
267 | ino_t res = 0; | |
268 | struct f2fs_dir_entry *de; | |
269 | struct page *page; | |
270 | ||
271 | de = f2fs_find_entry(dir, qstr, &page); | |
272 | if (de) { | |
273 | res = le32_to_cpu(de->ino); | |
9486ba44 | 274 | f2fs_dentry_kunmap(dir, page); |
6b4ea016 JK |
275 | f2fs_put_page(page, 0); |
276 | } | |
277 | ||
278 | return res; | |
279 | } | |
280 | ||
281 | void f2fs_set_link(struct inode *dir, struct f2fs_dir_entry *de, | |
282 | struct page *page, struct inode *inode) | |
283 | { | |
59a06155 | 284 | enum page_type type = f2fs_has_inline_dentry(dir) ? NODE : DATA; |
6b4ea016 | 285 | lock_page(page); |
59a06155 | 286 | f2fs_wait_on_page_writeback(page, type); |
6b4ea016 JK |
287 | de->ino = cpu_to_le32(inode->i_ino); |
288 | set_de_type(de, inode); | |
5df1f1da | 289 | f2fs_dentry_kunmap(dir, page); |
6b4ea016 JK |
290 | set_page_dirty(page); |
291 | dir->i_mtime = dir->i_ctime = CURRENT_TIME; | |
292 | mark_inode_dirty(dir); | |
6666e6aa | 293 | |
6b4ea016 | 294 | f2fs_put_page(page, 1); |
6b4ea016 JK |
295 | } |
296 | ||
44a83ff6 | 297 | static void init_dent_inode(const struct qstr *name, struct page *ipage) |
6b4ea016 | 298 | { |
58bfaf44 | 299 | struct f2fs_inode *ri; |
6b4ea016 | 300 | |
54b591df JK |
301 | f2fs_wait_on_page_writeback(ipage, NODE); |
302 | ||
53dc9a67 | 303 | /* copy name info. to this inode page */ |
58bfaf44 JK |
304 | ri = F2FS_INODE(ipage); |
305 | ri->i_namelen = cpu_to_le32(name->len); | |
306 | memcpy(ri->i_name, name->name, name->len); | |
6b4ea016 JK |
307 | set_page_dirty(ipage); |
308 | } | |
309 | ||
1cd14caf JK |
310 | int update_dent_inode(struct inode *inode, const struct qstr *name) |
311 | { | |
1cd14caf JK |
312 | struct page *page; |
313 | ||
4081363f | 314 | page = get_node_page(F2FS_I_SB(inode), inode->i_ino); |
1cd14caf JK |
315 | if (IS_ERR(page)) |
316 | return PTR_ERR(page); | |
317 | ||
318 | init_dent_inode(name, page); | |
319 | f2fs_put_page(page, 1); | |
320 | ||
321 | return 0; | |
322 | } | |
323 | ||
062a3e7b JK |
324 | void do_make_empty_dir(struct inode *inode, struct inode *parent, |
325 | struct f2fs_dentry_ptr *d) | |
326 | { | |
327 | struct f2fs_dir_entry *de; | |
328 | ||
329 | de = &d->dentry[0]; | |
330 | de->name_len = cpu_to_le16(1); | |
331 | de->hash_code = 0; | |
332 | de->ino = cpu_to_le32(inode->i_ino); | |
333 | memcpy(d->filename[0], ".", 1); | |
334 | set_de_type(de, inode); | |
335 | ||
336 | de = &d->dentry[1]; | |
337 | de->hash_code = 0; | |
338 | de->name_len = cpu_to_le16(2); | |
339 | de->ino = cpu_to_le32(parent->i_ino); | |
340 | memcpy(d->filename[1], "..", 2); | |
341 | set_de_type(de, inode); | |
342 | ||
343 | test_and_set_bit_le(0, (void *)d->bitmap); | |
344 | test_and_set_bit_le(1, (void *)d->bitmap); | |
345 | } | |
346 | ||
44a83ff6 JK |
347 | static int make_empty_dir(struct inode *inode, |
348 | struct inode *parent, struct page *page) | |
39936837 JK |
349 | { |
350 | struct page *dentry_page; | |
351 | struct f2fs_dentry_block *dentry_blk; | |
062a3e7b | 352 | struct f2fs_dentry_ptr d; |
39936837 | 353 | |
622f28ae CY |
354 | if (f2fs_has_inline_dentry(inode)) |
355 | return make_empty_inline_dir(inode, parent, page); | |
356 | ||
44a83ff6 | 357 | dentry_page = get_new_data_page(inode, page, 0, true); |
39936837 JK |
358 | if (IS_ERR(dentry_page)) |
359 | return PTR_ERR(dentry_page); | |
360 | ||
1c3bb978 | 361 | dentry_blk = kmap_atomic(dentry_page); |
39936837 | 362 | |
062a3e7b JK |
363 | make_dentry_ptr(&d, (void *)dentry_blk, 1); |
364 | do_make_empty_dir(inode, parent, &d); | |
39936837 | 365 | |
1c3bb978 | 366 | kunmap_atomic(dentry_blk); |
39936837 JK |
367 | |
368 | set_page_dirty(dentry_page); | |
369 | f2fs_put_page(dentry_page, 1); | |
370 | return 0; | |
371 | } | |
372 | ||
bce8d112 JK |
373 | struct page *init_inode_metadata(struct inode *inode, struct inode *dir, |
374 | const struct qstr *name, struct page *dpage) | |
6b4ea016 | 375 | { |
44a83ff6 JK |
376 | struct page *page; |
377 | int err; | |
378 | ||
b97a9b5d | 379 | if (is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) { |
a014e037 | 380 | page = new_inode_page(inode); |
44a83ff6 JK |
381 | if (IS_ERR(page)) |
382 | return page; | |
6b4ea016 JK |
383 | |
384 | if (S_ISDIR(inode->i_mode)) { | |
44a83ff6 JK |
385 | err = make_empty_dir(inode, dir, page); |
386 | if (err) | |
387 | goto error; | |
6b4ea016 JK |
388 | } |
389 | ||
bce8d112 | 390 | err = f2fs_init_acl(inode, dir, page, dpage); |
44a83ff6 | 391 | if (err) |
a8865372 | 392 | goto put_error; |
44a83ff6 | 393 | |
8ae8f162 JK |
394 | err = f2fs_init_security(inode, dir, name, page); |
395 | if (err) | |
a8865372 | 396 | goto put_error; |
6b4ea016 | 397 | } else { |
4081363f | 398 | page = get_node_page(F2FS_I_SB(dir), inode->i_ino); |
44a83ff6 JK |
399 | if (IS_ERR(page)) |
400 | return page; | |
401 | ||
44a83ff6 | 402 | set_cold_node(inode, page); |
6b4ea016 | 403 | } |
44a83ff6 | 404 | |
b97a9b5d JK |
405 | if (name) |
406 | init_dent_inode(name, page); | |
44a83ff6 | 407 | |
83d5d6f6 JK |
408 | /* |
409 | * This file should be checkpointed during fsync. | |
410 | * We lost i_pino from now on. | |
411 | */ | |
6b4ea016 | 412 | if (is_inode_flag_set(F2FS_I(inode), FI_INC_LINK)) { |
354a3399 | 413 | file_lost_pino(inode); |
50732df0 CY |
414 | /* |
415 | * If link the tmpfile to alias through linkat path, | |
416 | * we should remove this inode from orphan list. | |
417 | */ | |
418 | if (inode->i_nlink == 0) | |
4081363f | 419 | remove_orphan_inode(F2FS_I_SB(dir), inode->i_ino); |
6b4ea016 | 420 | inc_nlink(inode); |
6b4ea016 | 421 | } |
44a83ff6 JK |
422 | return page; |
423 | ||
a8865372 | 424 | put_error: |
44a83ff6 | 425 | f2fs_put_page(page, 1); |
90d72459 | 426 | error: |
bd859c65 JK |
427 | /* once the failed inode becomes a bad inode, i_mode is S_IFREG */ |
428 | truncate_inode_pages(&inode->i_data, 0); | |
764aa3e9 | 429 | truncate_blocks(inode, 0, false); |
bd859c65 | 430 | remove_dirty_dir_inode(inode); |
44a83ff6 JK |
431 | remove_inode_page(inode); |
432 | return ERR_PTR(err); | |
6b4ea016 JK |
433 | } |
434 | ||
dbeacf02 | 435 | void update_parent_metadata(struct inode *dir, struct inode *inode, |
6b4ea016 JK |
436 | unsigned int current_depth) |
437 | { | |
6b4ea016 JK |
438 | if (is_inode_flag_set(F2FS_I(inode), FI_NEW_INODE)) { |
439 | if (S_ISDIR(inode->i_mode)) { | |
440 | inc_nlink(dir); | |
699489bb | 441 | set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR); |
6b4ea016 JK |
442 | } |
443 | clear_inode_flag(F2FS_I(inode), FI_NEW_INODE); | |
444 | } | |
445 | dir->i_mtime = dir->i_ctime = CURRENT_TIME; | |
a18ff063 JK |
446 | mark_inode_dirty(dir); |
447 | ||
6b4ea016 JK |
448 | if (F2FS_I(dir)->i_current_depth != current_depth) { |
449 | F2FS_I(dir)->i_current_depth = current_depth; | |
699489bb | 450 | set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR); |
6b4ea016 JK |
451 | } |
452 | ||
6b4ea016 JK |
453 | if (is_inode_flag_set(F2FS_I(inode), FI_INC_LINK)) |
454 | clear_inode_flag(F2FS_I(inode), FI_INC_LINK); | |
455 | } | |
456 | ||
a82afa20 | 457 | int room_for_filename(const void *bitmap, int slots, int max_slots) |
6b4ea016 JK |
458 | { |
459 | int bit_start = 0; | |
460 | int zero_start, zero_end; | |
461 | next: | |
a82afa20 JK |
462 | zero_start = find_next_zero_bit_le(bitmap, max_slots, bit_start); |
463 | if (zero_start >= max_slots) | |
464 | return max_slots; | |
465 | ||
466 | zero_end = find_next_bit_le(bitmap, max_slots, zero_start); | |
6b4ea016 JK |
467 | if (zero_end - zero_start >= slots) |
468 | return zero_start; | |
469 | ||
470 | bit_start = zero_end + 1; | |
471 | ||
a82afa20 JK |
472 | if (zero_end + 1 >= max_slots) |
473 | return max_slots; | |
6b4ea016 JK |
474 | goto next; |
475 | } | |
476 | ||
3b4d732a CY |
477 | void f2fs_update_dentry(struct inode *inode, struct f2fs_dentry_ptr *d, |
478 | const struct qstr *name, f2fs_hash_t name_hash, | |
479 | unsigned int bit_pos) | |
480 | { | |
481 | struct f2fs_dir_entry *de; | |
482 | int slots = GET_DENTRY_SLOTS(name->len); | |
483 | int i; | |
484 | ||
485 | de = &d->dentry[bit_pos]; | |
486 | de->hash_code = name_hash; | |
487 | de->name_len = cpu_to_le16(name->len); | |
488 | memcpy(d->filename[bit_pos], name->name, name->len); | |
489 | de->ino = cpu_to_le32(inode->i_ino); | |
490 | set_de_type(de, inode); | |
491 | for (i = 0; i < slots; i++) | |
492 | test_and_set_bit_le(bit_pos + i, (void *)d->bitmap); | |
493 | } | |
494 | ||
39936837 | 495 | /* |
4f4124d0 CY |
496 | * Caller should grab and release a rwsem by calling f2fs_lock_op() and |
497 | * f2fs_unlock_op(). | |
39936837 | 498 | */ |
6c311ec6 CF |
499 | int __f2fs_add_link(struct inode *dir, const struct qstr *name, |
500 | struct inode *inode) | |
6b4ea016 JK |
501 | { |
502 | unsigned int bit_pos; | |
503 | unsigned int level; | |
504 | unsigned int current_depth; | |
505 | unsigned long bidx, block; | |
506 | f2fs_hash_t dentry_hash; | |
6b4ea016 | 507 | unsigned int nbucket, nblock; |
b7f7a5e0 | 508 | size_t namelen = name->len; |
6b4ea016 JK |
509 | struct page *dentry_page = NULL; |
510 | struct f2fs_dentry_block *dentry_blk = NULL; | |
3b4d732a | 511 | struct f2fs_dentry_ptr d; |
457d08ee | 512 | int slots = GET_DENTRY_SLOTS(namelen); |
44a83ff6 | 513 | struct page *page; |
6b4ea016 | 514 | int err = 0; |
6b4ea016 | 515 | |
622f28ae CY |
516 | if (f2fs_has_inline_dentry(dir)) { |
517 | err = f2fs_add_inline_entry(dir, name, inode); | |
518 | if (!err || err != -EAGAIN) | |
519 | return err; | |
520 | else | |
521 | err = 0; | |
522 | } | |
523 | ||
eee6160f | 524 | dentry_hash = f2fs_dentry_hash(name); |
6b4ea016 JK |
525 | level = 0; |
526 | current_depth = F2FS_I(dir)->i_current_depth; | |
527 | if (F2FS_I(dir)->chash == dentry_hash) { | |
528 | level = F2FS_I(dir)->clevel; | |
529 | F2FS_I(dir)->chash = 0; | |
530 | } | |
531 | ||
532 | start: | |
cfb271d4 | 533 | if (unlikely(current_depth == MAX_DIR_HASH_DEPTH)) |
6b4ea016 JK |
534 | return -ENOSPC; |
535 | ||
536 | /* Increase the depth, if required */ | |
537 | if (level == current_depth) | |
538 | ++current_depth; | |
539 | ||
38431545 | 540 | nbucket = dir_buckets(level, F2FS_I(dir)->i_dir_level); |
6b4ea016 JK |
541 | nblock = bucket_blocks(level); |
542 | ||
38431545 JK |
543 | bidx = dir_block_index(level, F2FS_I(dir)->i_dir_level, |
544 | (le32_to_cpu(dentry_hash) % nbucket)); | |
6b4ea016 JK |
545 | |
546 | for (block = bidx; block <= (bidx + nblock - 1); block++) { | |
64aa7ed9 | 547 | dentry_page = get_new_data_page(dir, NULL, block, true); |
39936837 | 548 | if (IS_ERR(dentry_page)) |
6b4ea016 | 549 | return PTR_ERR(dentry_page); |
6b4ea016 JK |
550 | |
551 | dentry_blk = kmap(dentry_page); | |
a82afa20 JK |
552 | bit_pos = room_for_filename(&dentry_blk->dentry_bitmap, |
553 | slots, NR_DENTRY_IN_BLOCK); | |
6b4ea016 JK |
554 | if (bit_pos < NR_DENTRY_IN_BLOCK) |
555 | goto add_dentry; | |
556 | ||
557 | kunmap(dentry_page); | |
558 | f2fs_put_page(dentry_page, 1); | |
6b4ea016 JK |
559 | } |
560 | ||
561 | /* Move to next level to find the empty slot for new dentry */ | |
562 | ++level; | |
563 | goto start; | |
564 | add_dentry: | |
3cb5ad15 | 565 | f2fs_wait_on_page_writeback(dentry_page, DATA); |
6b4ea016 | 566 | |
d928bfbf | 567 | down_write(&F2FS_I(inode)->i_sem); |
bce8d112 | 568 | page = init_inode_metadata(inode, dir, name, NULL); |
44a83ff6 JK |
569 | if (IS_ERR(page)) { |
570 | err = PTR_ERR(page); | |
571 | goto fail; | |
572 | } | |
3b4d732a CY |
573 | |
574 | make_dentry_ptr(&d, (void *)dentry_blk, 1); | |
575 | f2fs_update_dentry(inode, &d, name, dentry_hash, bit_pos); | |
576 | ||
6b4ea016 | 577 | set_page_dirty(dentry_page); |
6666e6aa | 578 | |
44a83ff6 | 579 | /* we don't need to mark_inode_dirty now */ |
6666e6aa | 580 | F2FS_I(inode)->i_pino = dir->i_ino; |
44a83ff6 JK |
581 | update_inode(inode, page); |
582 | f2fs_put_page(page, 1); | |
583 | ||
584 | update_parent_metadata(dir, inode, current_depth); | |
6b4ea016 | 585 | fail: |
d928bfbf JK |
586 | up_write(&F2FS_I(inode)->i_sem); |
587 | ||
924a2ddb JK |
588 | if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) { |
589 | update_inode_page(dir); | |
590 | clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR); | |
591 | } | |
6b4ea016 JK |
592 | kunmap(dentry_page); |
593 | f2fs_put_page(dentry_page, 1); | |
6b4ea016 JK |
594 | return err; |
595 | } | |
596 | ||
b97a9b5d JK |
597 | int f2fs_do_tmpfile(struct inode *inode, struct inode *dir) |
598 | { | |
599 | struct page *page; | |
600 | int err = 0; | |
601 | ||
602 | down_write(&F2FS_I(inode)->i_sem); | |
bce8d112 | 603 | page = init_inode_metadata(inode, dir, NULL, NULL); |
b97a9b5d JK |
604 | if (IS_ERR(page)) { |
605 | err = PTR_ERR(page); | |
606 | goto fail; | |
607 | } | |
608 | /* we don't need to mark_inode_dirty now */ | |
609 | update_inode(inode, page); | |
610 | f2fs_put_page(page, 1); | |
611 | ||
612 | clear_inode_flag(F2FS_I(inode), FI_NEW_INODE); | |
613 | fail: | |
614 | up_write(&F2FS_I(inode)->i_sem); | |
615 | return err; | |
616 | } | |
617 | ||
dbeacf02 CY |
618 | void f2fs_drop_nlink(struct inode *dir, struct inode *inode, struct page *page) |
619 | { | |
620 | struct f2fs_sb_info *sbi = F2FS_I_SB(dir); | |
621 | ||
622 | down_write(&F2FS_I(inode)->i_sem); | |
623 | ||
624 | if (S_ISDIR(inode->i_mode)) { | |
625 | drop_nlink(dir); | |
626 | if (page) | |
627 | update_inode(dir, page); | |
628 | else | |
629 | update_inode_page(dir); | |
630 | } | |
631 | inode->i_ctime = CURRENT_TIME; | |
632 | ||
633 | drop_nlink(inode); | |
634 | if (S_ISDIR(inode->i_mode)) { | |
635 | drop_nlink(inode); | |
636 | i_size_write(inode, 0); | |
637 | } | |
638 | up_write(&F2FS_I(inode)->i_sem); | |
639 | update_inode_page(inode); | |
640 | ||
641 | if (inode->i_nlink == 0) | |
642 | add_orphan_inode(sbi, inode->i_ino); | |
643 | else | |
644 | release_orphan_inode(sbi); | |
645 | } | |
646 | ||
0a8165d7 | 647 | /* |
e1c42045 | 648 | * It only removes the dentry from the dentry page, corresponding name |
6b4ea016 JK |
649 | * entry in name page does not need to be touched during deletion. |
650 | */ | |
651 | void f2fs_delete_entry(struct f2fs_dir_entry *dentry, struct page *page, | |
dbeacf02 | 652 | struct inode *dir, struct inode *inode) |
6b4ea016 JK |
653 | { |
654 | struct f2fs_dentry_block *dentry_blk; | |
655 | unsigned int bit_pos; | |
457d08ee | 656 | int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len)); |
6b4ea016 JK |
657 | int i; |
658 | ||
622f28ae CY |
659 | if (f2fs_has_inline_dentry(dir)) |
660 | return f2fs_delete_inline_entry(dentry, page, dir, inode); | |
661 | ||
6b4ea016 | 662 | lock_page(page); |
3cb5ad15 | 663 | f2fs_wait_on_page_writeback(page, DATA); |
6b4ea016 | 664 | |
1c3bb978 GZ |
665 | dentry_blk = page_address(page); |
666 | bit_pos = dentry - dentry_blk->dentry; | |
6b4ea016 | 667 | for (i = 0; i < slots; i++) |
1f7732fe | 668 | clear_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap); |
6b4ea016 JK |
669 | |
670 | /* Let's check and deallocate this dentry page */ | |
671 | bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap, | |
672 | NR_DENTRY_IN_BLOCK, | |
673 | 0); | |
674 | kunmap(page); /* kunmap - pair of f2fs_find_entry */ | |
675 | set_page_dirty(page); | |
676 | ||
677 | dir->i_ctime = dir->i_mtime = CURRENT_TIME; | |
678 | ||
dbeacf02 CY |
679 | if (inode) |
680 | f2fs_drop_nlink(dir, inode, NULL); | |
6b4ea016 JK |
681 | |
682 | if (bit_pos == NR_DENTRY_IN_BLOCK) { | |
6b4ea016 JK |
683 | truncate_hole(dir, page->index, page->index + 1); |
684 | clear_page_dirty_for_io(page); | |
2bca1e23 | 685 | ClearPagePrivate(page); |
6b4ea016 | 686 | ClearPageUptodate(page); |
a7ffdbe2 | 687 | inode_dec_dirty_pages(dir); |
6b4ea016 | 688 | } |
508198be | 689 | f2fs_put_page(page, 1); |
6b4ea016 JK |
690 | } |
691 | ||
692 | bool f2fs_empty_dir(struct inode *dir) | |
693 | { | |
694 | unsigned long bidx; | |
695 | struct page *dentry_page; | |
696 | unsigned int bit_pos; | |
dbeacf02 | 697 | struct f2fs_dentry_block *dentry_blk; |
6b4ea016 JK |
698 | unsigned long nblock = dir_blocks(dir); |
699 | ||
622f28ae CY |
700 | if (f2fs_has_inline_dentry(dir)) |
701 | return f2fs_empty_inline_dir(dir); | |
702 | ||
6b4ea016 | 703 | for (bidx = 0; bidx < nblock; bidx++) { |
6b4ea016 JK |
704 | dentry_page = get_lock_data_page(dir, bidx); |
705 | if (IS_ERR(dentry_page)) { | |
706 | if (PTR_ERR(dentry_page) == -ENOENT) | |
707 | continue; | |
708 | else | |
709 | return false; | |
710 | } | |
711 | ||
1c3bb978 | 712 | dentry_blk = kmap_atomic(dentry_page); |
6b4ea016 JK |
713 | if (bidx == 0) |
714 | bit_pos = 2; | |
715 | else | |
716 | bit_pos = 0; | |
717 | bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap, | |
718 | NR_DENTRY_IN_BLOCK, | |
719 | bit_pos); | |
1c3bb978 | 720 | kunmap_atomic(dentry_blk); |
6b4ea016 JK |
721 | |
722 | f2fs_put_page(dentry_page, 1); | |
723 | ||
724 | if (bit_pos < NR_DENTRY_IN_BLOCK) | |
725 | return false; | |
726 | } | |
727 | return true; | |
728 | } | |
729 | ||
7b3cd7d6 JK |
730 | bool f2fs_fill_dentries(struct dir_context *ctx, struct f2fs_dentry_ptr *d, |
731 | unsigned int start_pos) | |
38594de7 JK |
732 | { |
733 | unsigned char d_type = DT_UNKNOWN; | |
734 | unsigned int bit_pos; | |
735 | struct f2fs_dir_entry *de = NULL; | |
736 | ||
7b3cd7d6 | 737 | bit_pos = ((unsigned long)ctx->pos % d->max); |
38594de7 | 738 | |
7b3cd7d6 JK |
739 | while (bit_pos < d->max) { |
740 | bit_pos = find_next_bit_le(d->bitmap, d->max, bit_pos); | |
741 | if (bit_pos >= d->max) | |
38594de7 JK |
742 | break; |
743 | ||
7b3cd7d6 | 744 | de = &d->dentry[bit_pos]; |
38594de7 JK |
745 | if (de->file_type < F2FS_FT_MAX) |
746 | d_type = f2fs_filetype_table[de->file_type]; | |
747 | else | |
748 | d_type = DT_UNKNOWN; | |
7b3cd7d6 | 749 | if (!dir_emit(ctx, d->filename[bit_pos], |
38594de7 JK |
750 | le16_to_cpu(de->name_len), |
751 | le32_to_cpu(de->ino), d_type)) | |
752 | return true; | |
753 | ||
754 | bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len)); | |
755 | ctx->pos = start_pos + bit_pos; | |
756 | } | |
757 | return false; | |
758 | } | |
759 | ||
6f7f231e | 760 | static int f2fs_readdir(struct file *file, struct dir_context *ctx) |
6b4ea016 | 761 | { |
496ad9aa | 762 | struct inode *inode = file_inode(file); |
6b4ea016 | 763 | unsigned long npages = dir_blocks(inode); |
6b4ea016 | 764 | struct f2fs_dentry_block *dentry_blk = NULL; |
6b4ea016 | 765 | struct page *dentry_page = NULL; |
817202d9 | 766 | struct file_ra_state *ra = &file->f_ra; |
6f7f231e | 767 | unsigned int n = ((unsigned long)ctx->pos / NR_DENTRY_IN_BLOCK); |
7b3cd7d6 | 768 | struct f2fs_dentry_ptr d; |
6b4ea016 | 769 | |
622f28ae CY |
770 | if (f2fs_has_inline_dentry(inode)) |
771 | return f2fs_read_inline_dir(file, ctx); | |
772 | ||
817202d9 CY |
773 | /* readahead for multi pages of dir */ |
774 | if (npages - n > 1 && !ra_has_index(ra, n)) | |
775 | page_cache_sync_readahead(inode->i_mapping, ra, file, n, | |
776 | min(npages - n, (pgoff_t)MAX_DIR_RA_PAGES)); | |
777 | ||
6c311ec6 | 778 | for (; n < npages; n++) { |
6b4ea016 JK |
779 | dentry_page = get_lock_data_page(inode, n); |
780 | if (IS_ERR(dentry_page)) | |
781 | continue; | |
782 | ||
6b4ea016 | 783 | dentry_blk = kmap(dentry_page); |
99b072bb | 784 | |
7b3cd7d6 JK |
785 | make_dentry_ptr(&d, (void *)dentry_blk, 1); |
786 | ||
787 | if (f2fs_fill_dentries(ctx, &d, n * NR_DENTRY_IN_BLOCK)) | |
38594de7 JK |
788 | goto stop; |
789 | ||
6f7f231e | 790 | ctx->pos = (n + 1) * NR_DENTRY_IN_BLOCK; |
6b4ea016 JK |
791 | kunmap(dentry_page); |
792 | f2fs_put_page(dentry_page, 1); | |
793 | dentry_page = NULL; | |
794 | } | |
99b072bb | 795 | stop: |
6b4ea016 JK |
796 | if (dentry_page && !IS_ERR(dentry_page)) { |
797 | kunmap(dentry_page); | |
798 | f2fs_put_page(dentry_page, 1); | |
799 | } | |
800 | ||
801 | return 0; | |
802 | } | |
803 | ||
804 | const struct file_operations f2fs_dir_operations = { | |
805 | .llseek = generic_file_llseek, | |
806 | .read = generic_read_dir, | |
6f7f231e | 807 | .iterate = f2fs_readdir, |
6b4ea016 JK |
808 | .fsync = f2fs_sync_file, |
809 | .unlocked_ioctl = f2fs_ioctl, | |
810 | }; |