Commit | Line | Data |
---|---|---|
457c8996 | 1 | // SPDX-License-Identifier: GPL-2.0-only |
1da177e4 LT |
2 | /* |
3 | * fs/dcache.c | |
4 | * | |
5 | * Complete reimplementation | |
6 | * (C) 1997 Thomas Schoebel-Theuer, | |
7 | * with heavy changes by Linus Torvalds | |
8 | */ | |
9 | ||
10 | /* | |
11 | * Notes on the allocation strategy: | |
12 | * | |
13 | * The dcache is a master of the icache - whenever a dcache entry | |
14 | * exists, the inode will always exist. "iput()" is done either when | |
15 | * the dcache entry is deleted or garbage collected. | |
16 | */ | |
17 | ||
7a5cf791 | 18 | #include <linux/ratelimit.h> |
1da177e4 LT |
19 | #include <linux/string.h> |
20 | #include <linux/mm.h> | |
21 | #include <linux/fs.h> | |
0bf3d5c1 | 22 | #include <linux/fscrypt.h> |
7a91bf7f | 23 | #include <linux/fsnotify.h> |
1da177e4 LT |
24 | #include <linux/slab.h> |
25 | #include <linux/init.h> | |
1da177e4 LT |
26 | #include <linux/hash.h> |
27 | #include <linux/cache.h> | |
630d9c47 | 28 | #include <linux/export.h> |
1da177e4 LT |
29 | #include <linux/security.h> |
30 | #include <linux/seqlock.h> | |
57c8a661 | 31 | #include <linux/memblock.h> |
ceb5bdc2 NP |
32 | #include <linux/bit_spinlock.h> |
33 | #include <linux/rculist_bl.h> | |
f6041567 | 34 | #include <linux/list_lru.h> |
07f3f05c | 35 | #include "internal.h" |
b2dba1af | 36 | #include "mount.h" |
1da177e4 | 37 | |
789680d1 NP |
38 | /* |
39 | * Usage: | |
873feea0 | 40 | * dcache->d_inode->i_lock protects: |
946e51f2 | 41 | * - i_dentry, d_u.d_alias, d_inode of aliases |
ceb5bdc2 NP |
42 | * dcache_hash_bucket lock protects: |
43 | * - the dcache hash table | |
f1ee6162 N |
44 | * s_roots bl list spinlock protects: |
45 | * - the s_roots list (see __d_drop) | |
19156840 | 46 | * dentry->d_sb->s_dentry_lru_lock protects: |
23044507 NP |
47 | * - the dcache lru lists and counters |
48 | * d_lock protects: | |
49 | * - d_flags | |
50 | * - d_name | |
51 | * - d_lru | |
b7ab39f6 | 52 | * - d_count |
da502956 | 53 | * - d_unhashed() |
2fd6b7f5 NP |
54 | * - d_parent and d_subdirs |
55 | * - childrens' d_child and d_parent | |
946e51f2 | 56 | * - d_u.d_alias, d_inode |
789680d1 NP |
57 | * |
58 | * Ordering: | |
873feea0 | 59 | * dentry->d_inode->i_lock |
b5c84bf6 | 60 | * dentry->d_lock |
19156840 | 61 | * dentry->d_sb->s_dentry_lru_lock |
ceb5bdc2 | 62 | * dcache_hash_bucket lock |
f1ee6162 | 63 | * s_roots lock |
789680d1 | 64 | * |
da502956 NP |
65 | * If there is an ancestor relationship: |
66 | * dentry->d_parent->...->d_parent->d_lock | |
67 | * ... | |
68 | * dentry->d_parent->d_lock | |
69 | * dentry->d_lock | |
70 | * | |
71 | * If no ancestor relationship: | |
076515fc | 72 | * arbitrary, since it's serialized on rename_lock |
789680d1 | 73 | */ |
fa3536cc | 74 | int sysctl_vfs_cache_pressure __read_mostly = 100; |
1da177e4 LT |
75 | EXPORT_SYMBOL_GPL(sysctl_vfs_cache_pressure); |
76 | ||
74c3cbe3 | 77 | __cacheline_aligned_in_smp DEFINE_SEQLOCK(rename_lock); |
1da177e4 | 78 | |
949854d0 | 79 | EXPORT_SYMBOL(rename_lock); |
1da177e4 | 80 | |
e18b890b | 81 | static struct kmem_cache *dentry_cache __read_mostly; |
1da177e4 | 82 | |
cdf01226 DH |
83 | const struct qstr empty_name = QSTR_INIT("", 0); |
84 | EXPORT_SYMBOL(empty_name); | |
85 | const struct qstr slash_name = QSTR_INIT("/", 1); | |
86 | EXPORT_SYMBOL(slash_name); | |
80e5d1ff AV |
87 | const struct qstr dotdot_name = QSTR_INIT("..", 2); |
88 | EXPORT_SYMBOL(dotdot_name); | |
cdf01226 | 89 | |
1da177e4 LT |
90 | /* |
91 | * This is the single most critical data structure when it comes | |
92 | * to the dcache: the hashtable for lookups. Somebody should try | |
93 | * to make this good - I've just made it work. | |
94 | * | |
95 | * This hash-function tries to avoid losing too many bits of hash | |
96 | * information, yet avoid using a prime hash-size or similar. | |
97 | */ | |
1da177e4 | 98 | |
fa3536cc | 99 | static unsigned int d_hash_shift __read_mostly; |
ceb5bdc2 | 100 | |
b07ad996 | 101 | static struct hlist_bl_head *dentry_hashtable __read_mostly; |
ceb5bdc2 | 102 | |
8387ff25 | 103 | static inline struct hlist_bl_head *d_hash(unsigned int hash) |
ceb5bdc2 | 104 | { |
854d3e63 | 105 | return dentry_hashtable + (hash >> d_hash_shift); |
ceb5bdc2 NP |
106 | } |
107 | ||
94bdd655 AV |
108 | #define IN_LOOKUP_SHIFT 10 |
109 | static struct hlist_bl_head in_lookup_hashtable[1 << IN_LOOKUP_SHIFT]; | |
110 | ||
111 | static inline struct hlist_bl_head *in_lookup_hash(const struct dentry *parent, | |
112 | unsigned int hash) | |
113 | { | |
114 | hash += (unsigned long) parent / L1_CACHE_BYTES; | |
115 | return in_lookup_hashtable + hash_32(hash, IN_LOOKUP_SHIFT); | |
116 | } | |
117 | ||
c8c0c239 LC |
118 | struct dentry_stat_t { |
119 | long nr_dentry; | |
120 | long nr_unused; | |
121 | long age_limit; /* age in seconds */ | |
122 | long want_pages; /* pages requested by system */ | |
123 | long nr_negative; /* # of unused negative dentries */ | |
124 | long dummy; /* Reserved for future use */ | |
1da177e4 LT |
125 | }; |
126 | ||
3942c07c | 127 | static DEFINE_PER_CPU(long, nr_dentry); |
62d36c77 | 128 | static DEFINE_PER_CPU(long, nr_dentry_unused); |
af0c9af1 | 129 | static DEFINE_PER_CPU(long, nr_dentry_negative); |
312d3ca8 CH |
130 | |
131 | #if defined(CONFIG_SYSCTL) && defined(CONFIG_PROC_FS) | |
c8c0c239 LC |
132 | /* Statistics gathering. */ |
133 | static struct dentry_stat_t dentry_stat = { | |
134 | .age_limit = 45, | |
135 | }; | |
62d36c77 DC |
136 | |
137 | /* | |
138 | * Here we resort to our own counters instead of using generic per-cpu counters | |
139 | * for consistency with what the vfs inode code does. We are expected to harvest | |
140 | * better code and performance by having our own specialized counters. | |
141 | * | |
142 | * Please note that the loop is done over all possible CPUs, not over all online | |
143 | * CPUs. The reason for this is that we don't want to play games with CPUs going | |
144 | * on and off. If one of them goes off, we will just keep their counters. | |
145 | * | |
146 | * glommer: See cffbc8a for details, and if you ever intend to change this, | |
147 | * please update all vfs counters to match. | |
148 | */ | |
3942c07c | 149 | static long get_nr_dentry(void) |
3e880fb5 NP |
150 | { |
151 | int i; | |
3942c07c | 152 | long sum = 0; |
3e880fb5 NP |
153 | for_each_possible_cpu(i) |
154 | sum += per_cpu(nr_dentry, i); | |
155 | return sum < 0 ? 0 : sum; | |
156 | } | |
157 | ||
62d36c77 DC |
158 | static long get_nr_dentry_unused(void) |
159 | { | |
160 | int i; | |
161 | long sum = 0; | |
162 | for_each_possible_cpu(i) | |
163 | sum += per_cpu(nr_dentry_unused, i); | |
164 | return sum < 0 ? 0 : sum; | |
165 | } | |
166 | ||
af0c9af1 WL |
167 | static long get_nr_dentry_negative(void) |
168 | { | |
169 | int i; | |
170 | long sum = 0; | |
171 | ||
172 | for_each_possible_cpu(i) | |
173 | sum += per_cpu(nr_dentry_negative, i); | |
174 | return sum < 0 ? 0 : sum; | |
175 | } | |
176 | ||
c8c0c239 LC |
177 | static int proc_nr_dentry(struct ctl_table *table, int write, void *buffer, |
178 | size_t *lenp, loff_t *ppos) | |
312d3ca8 | 179 | { |
3e880fb5 | 180 | dentry_stat.nr_dentry = get_nr_dentry(); |
62d36c77 | 181 | dentry_stat.nr_unused = get_nr_dentry_unused(); |
af0c9af1 | 182 | dentry_stat.nr_negative = get_nr_dentry_negative(); |
3942c07c | 183 | return proc_doulongvec_minmax(table, write, buffer, lenp, ppos); |
312d3ca8 | 184 | } |
c8c0c239 LC |
185 | |
186 | static struct ctl_table fs_dcache_sysctls[] = { | |
187 | { | |
188 | .procname = "dentry-state", | |
189 | .data = &dentry_stat, | |
190 | .maxlen = 6*sizeof(long), | |
191 | .mode = 0444, | |
192 | .proc_handler = proc_nr_dentry, | |
193 | }, | |
194 | { } | |
195 | }; | |
196 | ||
197 | static int __init init_fs_dcache_sysctls(void) | |
198 | { | |
199 | register_sysctl_init("fs", fs_dcache_sysctls); | |
200 | return 0; | |
201 | } | |
202 | fs_initcall(init_fs_dcache_sysctls); | |
312d3ca8 CH |
203 | #endif |
204 | ||
5483f18e LT |
205 | /* |
206 | * Compare 2 name strings, return 0 if they match, otherwise non-zero. | |
207 | * The strings are both count bytes long, and count is non-zero. | |
208 | */ | |
e419b4cc LT |
209 | #ifdef CONFIG_DCACHE_WORD_ACCESS |
210 | ||
211 | #include <asm/word-at-a-time.h> | |
212 | /* | |
213 | * NOTE! 'cs' and 'scount' come from a dentry, so it has a | |
214 | * aligned allocation for this particular component. We don't | |
215 | * strictly need the load_unaligned_zeropad() safety, but it | |
216 | * doesn't hurt either. | |
217 | * | |
218 | * In contrast, 'ct' and 'tcount' can be from a pathname, and do | |
219 | * need the careful unaligned handling. | |
220 | */ | |
94753db5 | 221 | static inline int dentry_string_cmp(const unsigned char *cs, const unsigned char *ct, unsigned tcount) |
5483f18e | 222 | { |
bfcfaa77 | 223 | unsigned long a,b,mask; |
bfcfaa77 LT |
224 | |
225 | for (;;) { | |
bfe7aa6c | 226 | a = read_word_at_a_time(cs); |
e419b4cc | 227 | b = load_unaligned_zeropad(ct); |
bfcfaa77 LT |
228 | if (tcount < sizeof(unsigned long)) |
229 | break; | |
230 | if (unlikely(a != b)) | |
231 | return 1; | |
232 | cs += sizeof(unsigned long); | |
233 | ct += sizeof(unsigned long); | |
234 | tcount -= sizeof(unsigned long); | |
235 | if (!tcount) | |
236 | return 0; | |
237 | } | |
a5c21dce | 238 | mask = bytemask_from_count(tcount); |
bfcfaa77 | 239 | return unlikely(!!((a ^ b) & mask)); |
e419b4cc LT |
240 | } |
241 | ||
bfcfaa77 | 242 | #else |
e419b4cc | 243 | |
94753db5 | 244 | static inline int dentry_string_cmp(const unsigned char *cs, const unsigned char *ct, unsigned tcount) |
e419b4cc | 245 | { |
5483f18e LT |
246 | do { |
247 | if (*cs != *ct) | |
248 | return 1; | |
249 | cs++; | |
250 | ct++; | |
251 | tcount--; | |
252 | } while (tcount); | |
253 | return 0; | |
254 | } | |
255 | ||
e419b4cc LT |
256 | #endif |
257 | ||
94753db5 LT |
258 | static inline int dentry_cmp(const struct dentry *dentry, const unsigned char *ct, unsigned tcount) |
259 | { | |
94753db5 LT |
260 | /* |
261 | * Be careful about RCU walk racing with rename: | |
506458ef | 262 | * use 'READ_ONCE' to fetch the name pointer. |
94753db5 LT |
263 | * |
264 | * NOTE! Even if a rename will mean that the length | |
265 | * was not loaded atomically, we don't care. The | |
266 | * RCU walk will check the sequence count eventually, | |
267 | * and catch it. And we won't overrun the buffer, | |
268 | * because we're reading the name pointer atomically, | |
269 | * and a dentry name is guaranteed to be properly | |
270 | * terminated with a NUL byte. | |
271 | * | |
272 | * End result: even if 'len' is wrong, we'll exit | |
273 | * early because the data cannot match (there can | |
274 | * be no NUL in the ct/tcount data) | |
275 | */ | |
506458ef | 276 | const unsigned char *cs = READ_ONCE(dentry->d_name.name); |
ae0a843c | 277 | |
6326c71f | 278 | return dentry_string_cmp(cs, ct, tcount); |
94753db5 LT |
279 | } |
280 | ||
8d85b484 AV |
281 | struct external_name { |
282 | union { | |
283 | atomic_t count; | |
284 | struct rcu_head head; | |
285 | } u; | |
286 | unsigned char name[]; | |
287 | }; | |
288 | ||
289 | static inline struct external_name *external_name(struct dentry *dentry) | |
290 | { | |
291 | return container_of(dentry->d_name.name, struct external_name, name[0]); | |
292 | } | |
293 | ||
9c82ab9c | 294 | static void __d_free(struct rcu_head *head) |
1da177e4 | 295 | { |
9c82ab9c CH |
296 | struct dentry *dentry = container_of(head, struct dentry, d_u.d_rcu); |
297 | ||
8d85b484 AV |
298 | kmem_cache_free(dentry_cache, dentry); |
299 | } | |
300 | ||
301 | static void __d_free_external(struct rcu_head *head) | |
302 | { | |
303 | struct dentry *dentry = container_of(head, struct dentry, d_u.d_rcu); | |
2e03b4bc | 304 | kfree(external_name(dentry)); |
f1782c9b | 305 | kmem_cache_free(dentry_cache, dentry); |
1da177e4 LT |
306 | } |
307 | ||
810bb172 AV |
308 | static inline int dname_external(const struct dentry *dentry) |
309 | { | |
310 | return dentry->d_name.name != dentry->d_iname; | |
311 | } | |
312 | ||
49d31c2f AV |
313 | void take_dentry_name_snapshot(struct name_snapshot *name, struct dentry *dentry) |
314 | { | |
315 | spin_lock(&dentry->d_lock); | |
230c6402 | 316 | name->name = dentry->d_name; |
49d31c2f | 317 | if (unlikely(dname_external(dentry))) { |
230c6402 | 318 | atomic_inc(&external_name(dentry)->u.count); |
49d31c2f | 319 | } else { |
6cd00a01 TH |
320 | memcpy(name->inline_name, dentry->d_iname, |
321 | dentry->d_name.len + 1); | |
230c6402 | 322 | name->name.name = name->inline_name; |
49d31c2f | 323 | } |
230c6402 | 324 | spin_unlock(&dentry->d_lock); |
49d31c2f AV |
325 | } |
326 | EXPORT_SYMBOL(take_dentry_name_snapshot); | |
327 | ||
328 | void release_dentry_name_snapshot(struct name_snapshot *name) | |
329 | { | |
230c6402 | 330 | if (unlikely(name->name.name != name->inline_name)) { |
49d31c2f | 331 | struct external_name *p; |
230c6402 | 332 | p = container_of(name->name.name, struct external_name, name[0]); |
49d31c2f | 333 | if (unlikely(atomic_dec_and_test(&p->u.count))) |
2e03b4bc | 334 | kfree_rcu(p, u.head); |
49d31c2f AV |
335 | } |
336 | } | |
337 | EXPORT_SYMBOL(release_dentry_name_snapshot); | |
338 | ||
4bf46a27 DH |
339 | static inline void __d_set_inode_and_type(struct dentry *dentry, |
340 | struct inode *inode, | |
341 | unsigned type_flags) | |
342 | { | |
343 | unsigned flags; | |
344 | ||
345 | dentry->d_inode = inode; | |
4bf46a27 DH |
346 | flags = READ_ONCE(dentry->d_flags); |
347 | flags &= ~(DCACHE_ENTRY_TYPE | DCACHE_FALLTHRU); | |
348 | flags |= type_flags; | |
2fa6b1e0 | 349 | smp_store_release(&dentry->d_flags, flags); |
4bf46a27 DH |
350 | } |
351 | ||
4bf46a27 DH |
352 | static inline void __d_clear_type_and_inode(struct dentry *dentry) |
353 | { | |
354 | unsigned flags = READ_ONCE(dentry->d_flags); | |
355 | ||
356 | flags &= ~(DCACHE_ENTRY_TYPE | DCACHE_FALLTHRU); | |
357 | WRITE_ONCE(dentry->d_flags, flags); | |
4bf46a27 | 358 | dentry->d_inode = NULL; |
af0c9af1 WL |
359 | if (dentry->d_flags & DCACHE_LRU_LIST) |
360 | this_cpu_inc(nr_dentry_negative); | |
4bf46a27 DH |
361 | } |
362 | ||
b4f0354e AV |
363 | static void dentry_free(struct dentry *dentry) |
364 | { | |
946e51f2 | 365 | WARN_ON(!hlist_unhashed(&dentry->d_u.d_alias)); |
8d85b484 AV |
366 | if (unlikely(dname_external(dentry))) { |
367 | struct external_name *p = external_name(dentry); | |
368 | if (likely(atomic_dec_and_test(&p->u.count))) { | |
369 | call_rcu(&dentry->d_u.d_rcu, __d_free_external); | |
370 | return; | |
371 | } | |
372 | } | |
b4f0354e | 373 | /* if dentry was never visible to RCU, immediate free is OK */ |
5467a68c | 374 | if (dentry->d_flags & DCACHE_NORCU) |
b4f0354e AV |
375 | __d_free(&dentry->d_u.d_rcu); |
376 | else | |
377 | call_rcu(&dentry->d_u.d_rcu, __d_free); | |
378 | } | |
379 | ||
1da177e4 LT |
380 | /* |
381 | * Release the dentry's inode, using the filesystem | |
550dce01 | 382 | * d_iput() operation if defined. |
31e6b01f NP |
383 | */ |
384 | static void dentry_unlink_inode(struct dentry * dentry) | |
385 | __releases(dentry->d_lock) | |
873feea0 | 386 | __releases(dentry->d_inode->i_lock) |
31e6b01f NP |
387 | { |
388 | struct inode *inode = dentry->d_inode; | |
a528aca7 | 389 | |
4c0d7cd5 | 390 | raw_write_seqcount_begin(&dentry->d_seq); |
4bf46a27 | 391 | __d_clear_type_and_inode(dentry); |
946e51f2 | 392 | hlist_del_init(&dentry->d_u.d_alias); |
4c0d7cd5 | 393 | raw_write_seqcount_end(&dentry->d_seq); |
31e6b01f | 394 | spin_unlock(&dentry->d_lock); |
873feea0 | 395 | spin_unlock(&inode->i_lock); |
31e6b01f NP |
396 | if (!inode->i_nlink) |
397 | fsnotify_inoderemove(inode); | |
398 | if (dentry->d_op && dentry->d_op->d_iput) | |
399 | dentry->d_op->d_iput(dentry, inode); | |
400 | else | |
401 | iput(inode); | |
402 | } | |
403 | ||
89dc77bc LT |
404 | /* |
405 | * The DCACHE_LRU_LIST bit is set whenever the 'd_lru' entry | |
406 | * is in use - which includes both the "real" per-superblock | |
407 | * LRU list _and_ the DCACHE_SHRINK_LIST use. | |
408 | * | |
409 | * The DCACHE_SHRINK_LIST bit is set whenever the dentry is | |
410 | * on the shrink list (ie not on the superblock LRU list). | |
411 | * | |
412 | * The per-cpu "nr_dentry_unused" counters are updated with | |
413 | * the DCACHE_LRU_LIST bit. | |
414 | * | |
af0c9af1 WL |
415 | * The per-cpu "nr_dentry_negative" counters are only updated |
416 | * when deleted from or added to the per-superblock LRU list, not | |
417 | * from/to the shrink list. That is to avoid an unneeded dec/inc | |
418 | * pair when moving from LRU to shrink list in select_collect(). | |
419 | * | |
89dc77bc LT |
420 | * These helper functions make sure we always follow the |
421 | * rules. d_lock must be held by the caller. | |
422 | */ | |
423 | #define D_FLAG_VERIFY(dentry,x) WARN_ON_ONCE(((dentry)->d_flags & (DCACHE_LRU_LIST | DCACHE_SHRINK_LIST)) != (x)) | |
424 | static void d_lru_add(struct dentry *dentry) | |
425 | { | |
426 | D_FLAG_VERIFY(dentry, 0); | |
427 | dentry->d_flags |= DCACHE_LRU_LIST; | |
428 | this_cpu_inc(nr_dentry_unused); | |
af0c9af1 WL |
429 | if (d_is_negative(dentry)) |
430 | this_cpu_inc(nr_dentry_negative); | |
89dc77bc LT |
431 | WARN_ON_ONCE(!list_lru_add(&dentry->d_sb->s_dentry_lru, &dentry->d_lru)); |
432 | } | |
433 | ||
434 | static void d_lru_del(struct dentry *dentry) | |
435 | { | |
436 | D_FLAG_VERIFY(dentry, DCACHE_LRU_LIST); | |
437 | dentry->d_flags &= ~DCACHE_LRU_LIST; | |
438 | this_cpu_dec(nr_dentry_unused); | |
af0c9af1 WL |
439 | if (d_is_negative(dentry)) |
440 | this_cpu_dec(nr_dentry_negative); | |
89dc77bc LT |
441 | WARN_ON_ONCE(!list_lru_del(&dentry->d_sb->s_dentry_lru, &dentry->d_lru)); |
442 | } | |
443 | ||
444 | static void d_shrink_del(struct dentry *dentry) | |
445 | { | |
446 | D_FLAG_VERIFY(dentry, DCACHE_SHRINK_LIST | DCACHE_LRU_LIST); | |
447 | list_del_init(&dentry->d_lru); | |
448 | dentry->d_flags &= ~(DCACHE_SHRINK_LIST | DCACHE_LRU_LIST); | |
449 | this_cpu_dec(nr_dentry_unused); | |
450 | } | |
451 | ||
452 | static void d_shrink_add(struct dentry *dentry, struct list_head *list) | |
453 | { | |
454 | D_FLAG_VERIFY(dentry, 0); | |
455 | list_add(&dentry->d_lru, list); | |
456 | dentry->d_flags |= DCACHE_SHRINK_LIST | DCACHE_LRU_LIST; | |
457 | this_cpu_inc(nr_dentry_unused); | |
458 | } | |
459 | ||
460 | /* | |
461 | * These can only be called under the global LRU lock, ie during the | |
462 | * callback for freeing the LRU list. "isolate" removes it from the | |
463 | * LRU lists entirely, while shrink_move moves it to the indicated | |
464 | * private list. | |
465 | */ | |
3f97b163 | 466 | static void d_lru_isolate(struct list_lru_one *lru, struct dentry *dentry) |
89dc77bc LT |
467 | { |
468 | D_FLAG_VERIFY(dentry, DCACHE_LRU_LIST); | |
469 | dentry->d_flags &= ~DCACHE_LRU_LIST; | |
470 | this_cpu_dec(nr_dentry_unused); | |
af0c9af1 WL |
471 | if (d_is_negative(dentry)) |
472 | this_cpu_dec(nr_dentry_negative); | |
3f97b163 | 473 | list_lru_isolate(lru, &dentry->d_lru); |
89dc77bc LT |
474 | } |
475 | ||
3f97b163 VD |
476 | static void d_lru_shrink_move(struct list_lru_one *lru, struct dentry *dentry, |
477 | struct list_head *list) | |
89dc77bc LT |
478 | { |
479 | D_FLAG_VERIFY(dentry, DCACHE_LRU_LIST); | |
480 | dentry->d_flags |= DCACHE_SHRINK_LIST; | |
af0c9af1 WL |
481 | if (d_is_negative(dentry)) |
482 | this_cpu_dec(nr_dentry_negative); | |
3f97b163 | 483 | list_lru_isolate_move(lru, &dentry->d_lru, list); |
89dc77bc LT |
484 | } |
485 | ||
61647823 | 486 | static void ___d_drop(struct dentry *dentry) |
789680d1 | 487 | { |
0632a9ac AV |
488 | struct hlist_bl_head *b; |
489 | /* | |
490 | * Hashed dentries are normally on the dentry hashtable, | |
491 | * with the exception of those newly allocated by | |
492 | * d_obtain_root, which are always IS_ROOT: | |
493 | */ | |
494 | if (unlikely(IS_ROOT(dentry))) | |
495 | b = &dentry->d_sb->s_roots; | |
496 | else | |
497 | b = d_hash(dentry->d_name.hash); | |
b61625d2 | 498 | |
0632a9ac AV |
499 | hlist_bl_lock(b); |
500 | __hlist_bl_del(&dentry->d_hash); | |
501 | hlist_bl_unlock(b); | |
789680d1 | 502 | } |
61647823 N |
503 | |
504 | void __d_drop(struct dentry *dentry) | |
505 | { | |
0632a9ac AV |
506 | if (!d_unhashed(dentry)) { |
507 | ___d_drop(dentry); | |
508 | dentry->d_hash.pprev = NULL; | |
509 | write_seqcount_invalidate(&dentry->d_seq); | |
510 | } | |
61647823 | 511 | } |
789680d1 NP |
512 | EXPORT_SYMBOL(__d_drop); |
513 | ||
961f3c89 MCC |
514 | /** |
515 | * d_drop - drop a dentry | |
516 | * @dentry: dentry to drop | |
517 | * | |
518 | * d_drop() unhashes the entry from the parent dentry hashes, so that it won't | |
519 | * be found through a VFS lookup any more. Note that this is different from | |
520 | * deleting the dentry - d_delete will try to mark the dentry negative if | |
521 | * possible, giving a successful _negative_ lookup, while d_drop will | |
522 | * just make the cache lookup fail. | |
523 | * | |
524 | * d_drop() is used mainly for stuff that wants to invalidate a dentry for some | |
525 | * reason (NFS timeouts or autofs deletes). | |
526 | * | |
527 | * __d_drop requires dentry->d_lock | |
528 | * | |
529 | * ___d_drop doesn't mark dentry as "unhashed" | |
530 | * (dentry->d_hash.pprev will be LIST_POISON2, not NULL). | |
531 | */ | |
789680d1 NP |
532 | void d_drop(struct dentry *dentry) |
533 | { | |
789680d1 NP |
534 | spin_lock(&dentry->d_lock); |
535 | __d_drop(dentry); | |
536 | spin_unlock(&dentry->d_lock); | |
789680d1 NP |
537 | } |
538 | EXPORT_SYMBOL(d_drop); | |
539 | ||
ba65dc5e AV |
540 | static inline void dentry_unlist(struct dentry *dentry, struct dentry *parent) |
541 | { | |
542 | struct dentry *next; | |
543 | /* | |
544 | * Inform d_walk() and shrink_dentry_list() that we are no longer | |
545 | * attached to the dentry tree | |
546 | */ | |
547 | dentry->d_flags |= DCACHE_DENTRY_KILLED; | |
548 | if (unlikely(list_empty(&dentry->d_child))) | |
549 | return; | |
550 | __list_del_entry(&dentry->d_child); | |
551 | /* | |
552 | * Cursors can move around the list of children. While we'd been | |
553 | * a normal list member, it didn't matter - ->d_child.next would've | |
554 | * been updated. However, from now on it won't be and for the | |
555 | * things like d_walk() it might end up with a nasty surprise. | |
556 | * Normally d_walk() doesn't care about cursors moving around - | |
557 | * ->d_lock on parent prevents that and since a cursor has no children | |
558 | * of its own, we get through it without ever unlocking the parent. | |
559 | * There is one exception, though - if we ascend from a child that | |
560 | * gets killed as soon as we unlock it, the next sibling is found | |
561 | * using the value left in its ->d_child.next. And if _that_ | |
562 | * pointed to a cursor, and cursor got moved (e.g. by lseek()) | |
563 | * before d_walk() regains parent->d_lock, we'll end up skipping | |
564 | * everything the cursor had been moved past. | |
565 | * | |
566 | * Solution: make sure that the pointer left behind in ->d_child.next | |
567 | * points to something that won't be moving around. I.e. skip the | |
568 | * cursors. | |
569 | */ | |
570 | while (dentry->d_child.next != &parent->d_subdirs) { | |
571 | next = list_entry(dentry->d_child.next, struct dentry, d_child); | |
572 | if (likely(!(next->d_flags & DCACHE_DENTRY_CURSOR))) | |
573 | break; | |
574 | dentry->d_child.next = next->d_child.next; | |
575 | } | |
576 | } | |
577 | ||
e55fd011 | 578 | static void __dentry_kill(struct dentry *dentry) |
77812a1e | 579 | { |
41edf278 AV |
580 | struct dentry *parent = NULL; |
581 | bool can_free = true; | |
41edf278 | 582 | if (!IS_ROOT(dentry)) |
77812a1e | 583 | parent = dentry->d_parent; |
31e6b01f | 584 | |
0d98439e LT |
585 | /* |
586 | * The dentry is now unrecoverably dead to the world. | |
587 | */ | |
588 | lockref_mark_dead(&dentry->d_lockref); | |
589 | ||
f0023bc6 | 590 | /* |
f0023bc6 SW |
591 | * inform the fs via d_prune that this dentry is about to be |
592 | * unhashed and destroyed. | |
593 | */ | |
29266201 | 594 | if (dentry->d_flags & DCACHE_OP_PRUNE) |
61572bb1 YZ |
595 | dentry->d_op->d_prune(dentry); |
596 | ||
01b60351 AV |
597 | if (dentry->d_flags & DCACHE_LRU_LIST) { |
598 | if (!(dentry->d_flags & DCACHE_SHRINK_LIST)) | |
599 | d_lru_del(dentry); | |
01b60351 | 600 | } |
77812a1e NP |
601 | /* if it was on the hash then remove it */ |
602 | __d_drop(dentry); | |
ba65dc5e | 603 | dentry_unlist(dentry, parent); |
03b3b889 AV |
604 | if (parent) |
605 | spin_unlock(&parent->d_lock); | |
550dce01 AV |
606 | if (dentry->d_inode) |
607 | dentry_unlink_inode(dentry); | |
608 | else | |
609 | spin_unlock(&dentry->d_lock); | |
03b3b889 AV |
610 | this_cpu_dec(nr_dentry); |
611 | if (dentry->d_op && dentry->d_op->d_release) | |
612 | dentry->d_op->d_release(dentry); | |
613 | ||
41edf278 AV |
614 | spin_lock(&dentry->d_lock); |
615 | if (dentry->d_flags & DCACHE_SHRINK_LIST) { | |
616 | dentry->d_flags |= DCACHE_MAY_FREE; | |
617 | can_free = false; | |
618 | } | |
619 | spin_unlock(&dentry->d_lock); | |
41edf278 AV |
620 | if (likely(can_free)) |
621 | dentry_free(dentry); | |
9c5f1d30 | 622 | cond_resched(); |
e55fd011 AV |
623 | } |
624 | ||
8b987a46 | 625 | static struct dentry *__lock_parent(struct dentry *dentry) |
046b961b | 626 | { |
8b987a46 | 627 | struct dentry *parent; |
046b961b | 628 | rcu_read_lock(); |
c2338f2d | 629 | spin_unlock(&dentry->d_lock); |
046b961b | 630 | again: |
66702eb5 | 631 | parent = READ_ONCE(dentry->d_parent); |
046b961b AV |
632 | spin_lock(&parent->d_lock); |
633 | /* | |
634 | * We can't blindly lock dentry until we are sure | |
635 | * that we won't violate the locking order. | |
636 | * Any changes of dentry->d_parent must have | |
637 | * been done with parent->d_lock held, so | |
638 | * spin_lock() above is enough of a barrier | |
639 | * for checking if it's still our child. | |
640 | */ | |
641 | if (unlikely(parent != dentry->d_parent)) { | |
642 | spin_unlock(&parent->d_lock); | |
643 | goto again; | |
644 | } | |
65d8eb5a AV |
645 | rcu_read_unlock(); |
646 | if (parent != dentry) | |
9f12600f | 647 | spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED); |
65d8eb5a | 648 | else |
046b961b AV |
649 | parent = NULL; |
650 | return parent; | |
651 | } | |
652 | ||
8b987a46 AV |
653 | static inline struct dentry *lock_parent(struct dentry *dentry) |
654 | { | |
655 | struct dentry *parent = dentry->d_parent; | |
656 | if (IS_ROOT(dentry)) | |
657 | return NULL; | |
658 | if (likely(spin_trylock(&parent->d_lock))) | |
659 | return parent; | |
660 | return __lock_parent(dentry); | |
661 | } | |
662 | ||
a338579f AV |
663 | static inline bool retain_dentry(struct dentry *dentry) |
664 | { | |
665 | WARN_ON(d_in_lookup(dentry)); | |
666 | ||
667 | /* Unreachable? Get rid of it */ | |
668 | if (unlikely(d_unhashed(dentry))) | |
669 | return false; | |
670 | ||
671 | if (unlikely(dentry->d_flags & DCACHE_DISCONNECTED)) | |
672 | return false; | |
673 | ||
674 | if (unlikely(dentry->d_flags & DCACHE_OP_DELETE)) { | |
675 | if (dentry->d_op->d_delete(dentry)) | |
676 | return false; | |
677 | } | |
2c567af4 IW |
678 | |
679 | if (unlikely(dentry->d_flags & DCACHE_DONTCACHE)) | |
680 | return false; | |
681 | ||
62d9956c AV |
682 | /* retain; LRU fodder */ |
683 | dentry->d_lockref.count--; | |
684 | if (unlikely(!(dentry->d_flags & DCACHE_LRU_LIST))) | |
685 | d_lru_add(dentry); | |
686 | else if (unlikely(!(dentry->d_flags & DCACHE_REFERENCED))) | |
687 | dentry->d_flags |= DCACHE_REFERENCED; | |
a338579f AV |
688 | return true; |
689 | } | |
690 | ||
2c567af4 IW |
691 | void d_mark_dontcache(struct inode *inode) |
692 | { | |
693 | struct dentry *de; | |
694 | ||
695 | spin_lock(&inode->i_lock); | |
696 | hlist_for_each_entry(de, &inode->i_dentry, d_u.d_alias) { | |
697 | spin_lock(&de->d_lock); | |
698 | de->d_flags |= DCACHE_DONTCACHE; | |
699 | spin_unlock(&de->d_lock); | |
700 | } | |
701 | inode->i_state |= I_DONTCACHE; | |
702 | spin_unlock(&inode->i_lock); | |
703 | } | |
704 | EXPORT_SYMBOL(d_mark_dontcache); | |
705 | ||
c1d0c1a2 JO |
706 | /* |
707 | * Finish off a dentry we've decided to kill. | |
708 | * dentry->d_lock must be held, returns with it unlocked. | |
709 | * Returns dentry requiring refcount drop, or NULL if we're done. | |
710 | */ | |
711 | static struct dentry *dentry_kill(struct dentry *dentry) | |
712 | __releases(dentry->d_lock) | |
713 | { | |
714 | struct inode *inode = dentry->d_inode; | |
715 | struct dentry *parent = NULL; | |
716 | ||
717 | if (inode && unlikely(!spin_trylock(&inode->i_lock))) | |
f657a666 | 718 | goto slow_positive; |
c1d0c1a2 JO |
719 | |
720 | if (!IS_ROOT(dentry)) { | |
721 | parent = dentry->d_parent; | |
722 | if (unlikely(!spin_trylock(&parent->d_lock))) { | |
f657a666 AV |
723 | parent = __lock_parent(dentry); |
724 | if (likely(inode || !dentry->d_inode)) | |
725 | goto got_locks; | |
726 | /* negative that became positive */ | |
727 | if (parent) | |
728 | spin_unlock(&parent->d_lock); | |
729 | inode = dentry->d_inode; | |
730 | goto slow_positive; | |
c1d0c1a2 JO |
731 | } |
732 | } | |
c1d0c1a2 JO |
733 | __dentry_kill(dentry); |
734 | return parent; | |
735 | ||
f657a666 AV |
736 | slow_positive: |
737 | spin_unlock(&dentry->d_lock); | |
738 | spin_lock(&inode->i_lock); | |
739 | spin_lock(&dentry->d_lock); | |
740 | parent = lock_parent(dentry); | |
741 | got_locks: | |
742 | if (unlikely(dentry->d_lockref.count != 1)) { | |
743 | dentry->d_lockref.count--; | |
744 | } else if (likely(!retain_dentry(dentry))) { | |
745 | __dentry_kill(dentry); | |
746 | return parent; | |
747 | } | |
748 | /* we are keeping it, after all */ | |
749 | if (inode) | |
750 | spin_unlock(&inode->i_lock); | |
751 | if (parent) | |
752 | spin_unlock(&parent->d_lock); | |
c1d0c1a2 | 753 | spin_unlock(&dentry->d_lock); |
f657a666 | 754 | return NULL; |
c1d0c1a2 JO |
755 | } |
756 | ||
360f5479 LT |
757 | /* |
758 | * Try to do a lockless dput(), and return whether that was successful. | |
759 | * | |
760 | * If unsuccessful, we return false, having already taken the dentry lock. | |
761 | * | |
762 | * The caller needs to hold the RCU read lock, so that the dentry is | |
763 | * guaranteed to stay around even if the refcount goes down to zero! | |
764 | */ | |
765 | static inline bool fast_dput(struct dentry *dentry) | |
766 | { | |
767 | int ret; | |
768 | unsigned int d_flags; | |
769 | ||
770 | /* | |
771 | * If we have a d_op->d_delete() operation, we sould not | |
75a6f82a | 772 | * let the dentry count go to zero, so use "put_or_lock". |
360f5479 LT |
773 | */ |
774 | if (unlikely(dentry->d_flags & DCACHE_OP_DELETE)) | |
775 | return lockref_put_or_lock(&dentry->d_lockref); | |
776 | ||
777 | /* | |
778 | * .. otherwise, we can try to just decrement the | |
779 | * lockref optimistically. | |
780 | */ | |
781 | ret = lockref_put_return(&dentry->d_lockref); | |
782 | ||
783 | /* | |
784 | * If the lockref_put_return() failed due to the lock being held | |
785 | * by somebody else, the fast path has failed. We will need to | |
786 | * get the lock, and then check the count again. | |
787 | */ | |
788 | if (unlikely(ret < 0)) { | |
789 | spin_lock(&dentry->d_lock); | |
790 | if (dentry->d_lockref.count > 1) { | |
791 | dentry->d_lockref.count--; | |
792 | spin_unlock(&dentry->d_lock); | |
7964410f | 793 | return true; |
360f5479 | 794 | } |
7964410f | 795 | return false; |
360f5479 LT |
796 | } |
797 | ||
798 | /* | |
799 | * If we weren't the last ref, we're done. | |
800 | */ | |
801 | if (ret) | |
7964410f | 802 | return true; |
360f5479 LT |
803 | |
804 | /* | |
805 | * Careful, careful. The reference count went down | |
806 | * to zero, but we don't hold the dentry lock, so | |
807 | * somebody else could get it again, and do another | |
808 | * dput(), and we need to not race with that. | |
809 | * | |
810 | * However, there is a very special and common case | |
811 | * where we don't care, because there is nothing to | |
812 | * do: the dentry is still hashed, it does not have | |
813 | * a 'delete' op, and it's referenced and already on | |
814 | * the LRU list. | |
815 | * | |
816 | * NOTE! Since we aren't locked, these values are | |
817 | * not "stable". However, it is sufficient that at | |
818 | * some point after we dropped the reference the | |
819 | * dentry was hashed and the flags had the proper | |
820 | * value. Other dentry users may have re-gotten | |
821 | * a reference to the dentry and change that, but | |
822 | * our work is done - we can leave the dentry | |
823 | * around with a zero refcount. | |
77573fa3 HL |
824 | * |
825 | * Nevertheless, there are two cases that we should kill | |
826 | * the dentry anyway. | |
827 | * 1. free disconnected dentries as soon as their refcount | |
828 | * reached zero. | |
829 | * 2. free dentries if they should not be cached. | |
360f5479 LT |
830 | */ |
831 | smp_rmb(); | |
66702eb5 | 832 | d_flags = READ_ONCE(dentry->d_flags); |
77573fa3 HL |
833 | d_flags &= DCACHE_REFERENCED | DCACHE_LRU_LIST | |
834 | DCACHE_DISCONNECTED | DCACHE_DONTCACHE; | |
360f5479 LT |
835 | |
836 | /* Nothing to do? Dropping the reference was all we needed? */ | |
837 | if (d_flags == (DCACHE_REFERENCED | DCACHE_LRU_LIST) && !d_unhashed(dentry)) | |
7964410f | 838 | return true; |
360f5479 LT |
839 | |
840 | /* | |
841 | * Not the fast normal case? Get the lock. We've already decremented | |
842 | * the refcount, but we'll need to re-check the situation after | |
843 | * getting the lock. | |
844 | */ | |
845 | spin_lock(&dentry->d_lock); | |
846 | ||
847 | /* | |
848 | * Did somebody else grab a reference to it in the meantime, and | |
849 | * we're no longer the last user after all? Alternatively, somebody | |
850 | * else could have killed it and marked it dead. Either way, we | |
851 | * don't need to do anything else. | |
852 | */ | |
853 | if (dentry->d_lockref.count) { | |
854 | spin_unlock(&dentry->d_lock); | |
7964410f | 855 | return true; |
360f5479 LT |
856 | } |
857 | ||
858 | /* | |
859 | * Re-get the reference we optimistically dropped. We hold the | |
860 | * lock, and we just tested that it was zero, so we can just | |
861 | * set it to 1. | |
862 | */ | |
863 | dentry->d_lockref.count = 1; | |
7964410f | 864 | return false; |
360f5479 LT |
865 | } |
866 | ||
867 | ||
1da177e4 LT |
868 | /* |
869 | * This is dput | |
870 | * | |
871 | * This is complicated by the fact that we do not want to put | |
872 | * dentries that are no longer on any hash chain on the unused | |
873 | * list: we'd much rather just get rid of them immediately. | |
874 | * | |
875 | * However, that implies that we have to traverse the dentry | |
876 | * tree upwards to the parents which might _also_ now be | |
877 | * scheduled for deletion (it may have been only waiting for | |
878 | * its last child to go away). | |
879 | * | |
880 | * This tail recursion is done by hand as we don't want to depend | |
881 | * on the compiler to always get this right (gcc generally doesn't). | |
882 | * Real recursion would eat up our stack space. | |
883 | */ | |
884 | ||
885 | /* | |
886 | * dput - release a dentry | |
887 | * @dentry: dentry to release | |
888 | * | |
889 | * Release a dentry. This will drop the usage count and if appropriate | |
890 | * call the dentry unlink method as well as removing it from the queues and | |
891 | * releasing its resources. If the parent dentries were scheduled for release | |
892 | * they too may now get deleted. | |
1da177e4 | 893 | */ |
1da177e4 LT |
894 | void dput(struct dentry *dentry) |
895 | { | |
1088a640 AV |
896 | while (dentry) { |
897 | might_sleep(); | |
1da177e4 | 898 | |
1088a640 AV |
899 | rcu_read_lock(); |
900 | if (likely(fast_dput(dentry))) { | |
901 | rcu_read_unlock(); | |
902 | return; | |
903 | } | |
47be6184 | 904 | |
1088a640 | 905 | /* Slow case: now with the dentry lock held */ |
360f5479 | 906 | rcu_read_unlock(); |
360f5479 | 907 | |
1088a640 AV |
908 | if (likely(retain_dentry(dentry))) { |
909 | spin_unlock(&dentry->d_lock); | |
910 | return; | |
911 | } | |
265ac902 | 912 | |
1088a640 | 913 | dentry = dentry_kill(dentry); |
47be6184 | 914 | } |
1da177e4 | 915 | } |
ec4f8605 | 916 | EXPORT_SYMBOL(dput); |
1da177e4 | 917 | |
9bdebc2b AV |
918 | static void __dput_to_list(struct dentry *dentry, struct list_head *list) |
919 | __must_hold(&dentry->d_lock) | |
920 | { | |
921 | if (dentry->d_flags & DCACHE_SHRINK_LIST) { | |
922 | /* let the owner of the list it's on deal with it */ | |
923 | --dentry->d_lockref.count; | |
924 | } else { | |
925 | if (dentry->d_flags & DCACHE_LRU_LIST) | |
926 | d_lru_del(dentry); | |
927 | if (!--dentry->d_lockref.count) | |
928 | d_shrink_add(dentry, list); | |
929 | } | |
930 | } | |
931 | ||
932 | void dput_to_list(struct dentry *dentry, struct list_head *list) | |
933 | { | |
934 | rcu_read_lock(); | |
935 | if (likely(fast_dput(dentry))) { | |
936 | rcu_read_unlock(); | |
937 | return; | |
938 | } | |
939 | rcu_read_unlock(); | |
940 | if (!retain_dentry(dentry)) | |
941 | __dput_to_list(dentry, list); | |
942 | spin_unlock(&dentry->d_lock); | |
943 | } | |
1da177e4 | 944 | |
b5c84bf6 | 945 | /* This must be called with d_lock held */ |
dc0474be | 946 | static inline void __dget_dlock(struct dentry *dentry) |
23044507 | 947 | { |
98474236 | 948 | dentry->d_lockref.count++; |
23044507 NP |
949 | } |
950 | ||
dc0474be | 951 | static inline void __dget(struct dentry *dentry) |
1da177e4 | 952 | { |
98474236 | 953 | lockref_get(&dentry->d_lockref); |
1da177e4 LT |
954 | } |
955 | ||
b7ab39f6 NP |
956 | struct dentry *dget_parent(struct dentry *dentry) |
957 | { | |
df3d0bbc | 958 | int gotref; |
b7ab39f6 | 959 | struct dentry *ret; |
e8400933 | 960 | unsigned seq; |
b7ab39f6 | 961 | |
df3d0bbc WL |
962 | /* |
963 | * Do optimistic parent lookup without any | |
964 | * locking. | |
965 | */ | |
966 | rcu_read_lock(); | |
e8400933 | 967 | seq = raw_seqcount_begin(&dentry->d_seq); |
66702eb5 | 968 | ret = READ_ONCE(dentry->d_parent); |
df3d0bbc WL |
969 | gotref = lockref_get_not_zero(&ret->d_lockref); |
970 | rcu_read_unlock(); | |
971 | if (likely(gotref)) { | |
e8400933 | 972 | if (!read_seqcount_retry(&dentry->d_seq, seq)) |
df3d0bbc WL |
973 | return ret; |
974 | dput(ret); | |
975 | } | |
976 | ||
b7ab39f6 | 977 | repeat: |
a734eb45 NP |
978 | /* |
979 | * Don't need rcu_dereference because we re-check it was correct under | |
980 | * the lock. | |
981 | */ | |
982 | rcu_read_lock(); | |
b7ab39f6 | 983 | ret = dentry->d_parent; |
a734eb45 NP |
984 | spin_lock(&ret->d_lock); |
985 | if (unlikely(ret != dentry->d_parent)) { | |
986 | spin_unlock(&ret->d_lock); | |
987 | rcu_read_unlock(); | |
b7ab39f6 NP |
988 | goto repeat; |
989 | } | |
a734eb45 | 990 | rcu_read_unlock(); |
98474236 WL |
991 | BUG_ON(!ret->d_lockref.count); |
992 | ret->d_lockref.count++; | |
b7ab39f6 | 993 | spin_unlock(&ret->d_lock); |
b7ab39f6 NP |
994 | return ret; |
995 | } | |
996 | EXPORT_SYMBOL(dget_parent); | |
997 | ||
61fec493 AV |
998 | static struct dentry * __d_find_any_alias(struct inode *inode) |
999 | { | |
1000 | struct dentry *alias; | |
1001 | ||
1002 | if (hlist_empty(&inode->i_dentry)) | |
1003 | return NULL; | |
1004 | alias = hlist_entry(inode->i_dentry.first, struct dentry, d_u.d_alias); | |
1005 | __dget(alias); | |
1006 | return alias; | |
1007 | } | |
1008 | ||
1009 | /** | |
1010 | * d_find_any_alias - find any alias for a given inode | |
1011 | * @inode: inode to find an alias for | |
1012 | * | |
1013 | * If any aliases exist for the given inode, take and return a | |
1014 | * reference for one of them. If no aliases exist, return %NULL. | |
1015 | */ | |
1016 | struct dentry *d_find_any_alias(struct inode *inode) | |
1017 | { | |
1018 | struct dentry *de; | |
1019 | ||
1020 | spin_lock(&inode->i_lock); | |
1021 | de = __d_find_any_alias(inode); | |
1022 | spin_unlock(&inode->i_lock); | |
1023 | return de; | |
1024 | } | |
1025 | EXPORT_SYMBOL(d_find_any_alias); | |
1026 | ||
52ed46f0 | 1027 | static struct dentry *__d_find_alias(struct inode *inode) |
1da177e4 | 1028 | { |
61fec493 AV |
1029 | struct dentry *alias; |
1030 | ||
1031 | if (S_ISDIR(inode->i_mode)) | |
1032 | return __d_find_any_alias(inode); | |
1da177e4 | 1033 | |
946e51f2 | 1034 | hlist_for_each_entry(alias, &inode->i_dentry, d_u.d_alias) { |
da502956 | 1035 | spin_lock(&alias->d_lock); |
61fec493 | 1036 | if (!d_unhashed(alias)) { |
8d80d7da BF |
1037 | __dget_dlock(alias); |
1038 | spin_unlock(&alias->d_lock); | |
1039 | return alias; | |
1da177e4 | 1040 | } |
da502956 | 1041 | spin_unlock(&alias->d_lock); |
1da177e4 | 1042 | } |
da502956 | 1043 | return NULL; |
1da177e4 LT |
1044 | } |
1045 | ||
961f3c89 MCC |
1046 | /** |
1047 | * d_find_alias - grab a hashed alias of inode | |
1048 | * @inode: inode in question | |
1049 | * | |
1050 | * If inode has a hashed alias, or is a directory and has any alias, | |
1051 | * acquire the reference to alias and return it. Otherwise return NULL. | |
1052 | * Notice that if inode is a directory there can be only one alias and | |
1053 | * it can be unhashed only if it has no children, or if it is the root | |
1054 | * of a filesystem, or if the directory was renamed and d_revalidate | |
1055 | * was the first vfs operation to notice. | |
1056 | * | |
1057 | * If the inode has an IS_ROOT, DCACHE_DISCONNECTED alias, then prefer | |
1058 | * any other hashed alias over that one. | |
1059 | */ | |
da502956 | 1060 | struct dentry *d_find_alias(struct inode *inode) |
1da177e4 | 1061 | { |
214fda1f DH |
1062 | struct dentry *de = NULL; |
1063 | ||
b3d9b7a3 | 1064 | if (!hlist_empty(&inode->i_dentry)) { |
873feea0 | 1065 | spin_lock(&inode->i_lock); |
52ed46f0 | 1066 | de = __d_find_alias(inode); |
873feea0 | 1067 | spin_unlock(&inode->i_lock); |
214fda1f | 1068 | } |
1da177e4 LT |
1069 | return de; |
1070 | } | |
ec4f8605 | 1071 | EXPORT_SYMBOL(d_find_alias); |
1da177e4 | 1072 | |
bca585d2 AV |
1073 | /* |
1074 | * Caller MUST be holding rcu_read_lock() and be guaranteed | |
1075 | * that inode won't get freed until rcu_read_unlock(). | |
1076 | */ | |
1077 | struct dentry *d_find_alias_rcu(struct inode *inode) | |
1078 | { | |
1079 | struct hlist_head *l = &inode->i_dentry; | |
1080 | struct dentry *de = NULL; | |
1081 | ||
1082 | spin_lock(&inode->i_lock); | |
1083 | // ->i_dentry and ->i_rcu are colocated, but the latter won't be | |
1084 | // used without having I_FREEING set, which means no aliases left | |
1085 | if (likely(!(inode->i_state & I_FREEING) && !hlist_empty(l))) { | |
1086 | if (S_ISDIR(inode->i_mode)) { | |
1087 | de = hlist_entry(l->first, struct dentry, d_u.d_alias); | |
1088 | } else { | |
1089 | hlist_for_each_entry(de, l, d_u.d_alias) | |
1090 | if (!d_unhashed(de)) | |
1091 | break; | |
1092 | } | |
1093 | } | |
1094 | spin_unlock(&inode->i_lock); | |
1095 | return de; | |
1096 | } | |
1097 | ||
1da177e4 LT |
1098 | /* |
1099 | * Try to kill dentries associated with this inode. | |
1100 | * WARNING: you must own a reference to inode. | |
1101 | */ | |
1102 | void d_prune_aliases(struct inode *inode) | |
1103 | { | |
0cdca3f9 | 1104 | struct dentry *dentry; |
1da177e4 | 1105 | restart: |
873feea0 | 1106 | spin_lock(&inode->i_lock); |
946e51f2 | 1107 | hlist_for_each_entry(dentry, &inode->i_dentry, d_u.d_alias) { |
1da177e4 | 1108 | spin_lock(&dentry->d_lock); |
98474236 | 1109 | if (!dentry->d_lockref.count) { |
29355c39 AV |
1110 | struct dentry *parent = lock_parent(dentry); |
1111 | if (likely(!dentry->d_lockref.count)) { | |
1112 | __dentry_kill(dentry); | |
4a7795d3 | 1113 | dput(parent); |
29355c39 AV |
1114 | goto restart; |
1115 | } | |
1116 | if (parent) | |
1117 | spin_unlock(&parent->d_lock); | |
1da177e4 LT |
1118 | } |
1119 | spin_unlock(&dentry->d_lock); | |
1120 | } | |
873feea0 | 1121 | spin_unlock(&inode->i_lock); |
1da177e4 | 1122 | } |
ec4f8605 | 1123 | EXPORT_SYMBOL(d_prune_aliases); |
1da177e4 | 1124 | |
3b3f09f4 AV |
1125 | /* |
1126 | * Lock a dentry from shrink list. | |
8f04da2a JO |
1127 | * Called under rcu_read_lock() and dentry->d_lock; the former |
1128 | * guarantees that nothing we access will be freed under us. | |
3b3f09f4 | 1129 | * Note that dentry is *not* protected from concurrent dentry_kill(), |
8f04da2a JO |
1130 | * d_delete(), etc. |
1131 | * | |
3b3f09f4 AV |
1132 | * Return false if dentry has been disrupted or grabbed, leaving |
1133 | * the caller to kick it off-list. Otherwise, return true and have | |
1134 | * that dentry's inode and parent both locked. | |
1135 | */ | |
1136 | static bool shrink_lock_dentry(struct dentry *dentry) | |
1da177e4 | 1137 | { |
3b3f09f4 AV |
1138 | struct inode *inode; |
1139 | struct dentry *parent; | |
da3bbdd4 | 1140 | |
3b3f09f4 AV |
1141 | if (dentry->d_lockref.count) |
1142 | return false; | |
1143 | ||
1144 | inode = dentry->d_inode; | |
1145 | if (inode && unlikely(!spin_trylock(&inode->i_lock))) { | |
3b3f09f4 AV |
1146 | spin_unlock(&dentry->d_lock); |
1147 | spin_lock(&inode->i_lock); | |
ec33679d | 1148 | spin_lock(&dentry->d_lock); |
3b3f09f4 AV |
1149 | if (unlikely(dentry->d_lockref.count)) |
1150 | goto out; | |
1151 | /* changed inode means that somebody had grabbed it */ | |
1152 | if (unlikely(inode != dentry->d_inode)) | |
1153 | goto out; | |
3b3f09f4 | 1154 | } |
046b961b | 1155 | |
3b3f09f4 AV |
1156 | parent = dentry->d_parent; |
1157 | if (IS_ROOT(dentry) || likely(spin_trylock(&parent->d_lock))) | |
1158 | return true; | |
dd1f6b2e | 1159 | |
3b3f09f4 | 1160 | spin_unlock(&dentry->d_lock); |
3b3f09f4 AV |
1161 | spin_lock(&parent->d_lock); |
1162 | if (unlikely(parent != dentry->d_parent)) { | |
1163 | spin_unlock(&parent->d_lock); | |
1164 | spin_lock(&dentry->d_lock); | |
1165 | goto out; | |
1166 | } | |
1167 | spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED); | |
8f04da2a | 1168 | if (likely(!dentry->d_lockref.count)) |
3b3f09f4 | 1169 | return true; |
3b3f09f4 AV |
1170 | spin_unlock(&parent->d_lock); |
1171 | out: | |
1172 | if (inode) | |
1173 | spin_unlock(&inode->i_lock); | |
3b3f09f4 AV |
1174 | return false; |
1175 | } | |
77812a1e | 1176 | |
9bdebc2b | 1177 | void shrink_dentry_list(struct list_head *list) |
3b3f09f4 AV |
1178 | { |
1179 | while (!list_empty(list)) { | |
1180 | struct dentry *dentry, *parent; | |
64fd72e0 | 1181 | |
3b3f09f4 AV |
1182 | dentry = list_entry(list->prev, struct dentry, d_lru); |
1183 | spin_lock(&dentry->d_lock); | |
8f04da2a | 1184 | rcu_read_lock(); |
3b3f09f4 AV |
1185 | if (!shrink_lock_dentry(dentry)) { |
1186 | bool can_free = false; | |
8f04da2a | 1187 | rcu_read_unlock(); |
3b3f09f4 AV |
1188 | d_shrink_del(dentry); |
1189 | if (dentry->d_lockref.count < 0) | |
1190 | can_free = dentry->d_flags & DCACHE_MAY_FREE; | |
64fd72e0 AV |
1191 | spin_unlock(&dentry->d_lock); |
1192 | if (can_free) | |
1193 | dentry_free(dentry); | |
1194 | continue; | |
1195 | } | |
8f04da2a | 1196 | rcu_read_unlock(); |
3b3f09f4 AV |
1197 | d_shrink_del(dentry); |
1198 | parent = dentry->d_parent; | |
9bdebc2b AV |
1199 | if (parent != dentry) |
1200 | __dput_to_list(parent, list); | |
ff2fde99 | 1201 | __dentry_kill(dentry); |
da3bbdd4 | 1202 | } |
3049cfe2 CH |
1203 | } |
1204 | ||
3f97b163 VD |
1205 | static enum lru_status dentry_lru_isolate(struct list_head *item, |
1206 | struct list_lru_one *lru, spinlock_t *lru_lock, void *arg) | |
f6041567 DC |
1207 | { |
1208 | struct list_head *freeable = arg; | |
1209 | struct dentry *dentry = container_of(item, struct dentry, d_lru); | |
1210 | ||
1211 | ||
1212 | /* | |
1213 | * we are inverting the lru lock/dentry->d_lock here, | |
1214 | * so use a trylock. If we fail to get the lock, just skip | |
1215 | * it | |
1216 | */ | |
1217 | if (!spin_trylock(&dentry->d_lock)) | |
1218 | return LRU_SKIP; | |
1219 | ||
1220 | /* | |
1221 | * Referenced dentries are still in use. If they have active | |
1222 | * counts, just remove them from the LRU. Otherwise give them | |
1223 | * another pass through the LRU. | |
1224 | */ | |
1225 | if (dentry->d_lockref.count) { | |
3f97b163 | 1226 | d_lru_isolate(lru, dentry); |
f6041567 DC |
1227 | spin_unlock(&dentry->d_lock); |
1228 | return LRU_REMOVED; | |
1229 | } | |
1230 | ||
1231 | if (dentry->d_flags & DCACHE_REFERENCED) { | |
1232 | dentry->d_flags &= ~DCACHE_REFERENCED; | |
1233 | spin_unlock(&dentry->d_lock); | |
1234 | ||
1235 | /* | |
1236 | * The list move itself will be made by the common LRU code. At | |
1237 | * this point, we've dropped the dentry->d_lock but keep the | |
1238 | * lru lock. This is safe to do, since every list movement is | |
1239 | * protected by the lru lock even if both locks are held. | |
1240 | * | |
1241 | * This is guaranteed by the fact that all LRU management | |
1242 | * functions are intermediated by the LRU API calls like | |
1243 | * list_lru_add and list_lru_del. List movement in this file | |
1244 | * only ever occur through this functions or through callbacks | |
1245 | * like this one, that are called from the LRU API. | |
1246 | * | |
1247 | * The only exceptions to this are functions like | |
1248 | * shrink_dentry_list, and code that first checks for the | |
1249 | * DCACHE_SHRINK_LIST flag. Those are guaranteed to be | |
1250 | * operating only with stack provided lists after they are | |
1251 | * properly isolated from the main list. It is thus, always a | |
1252 | * local access. | |
1253 | */ | |
1254 | return LRU_ROTATE; | |
1255 | } | |
1256 | ||
3f97b163 | 1257 | d_lru_shrink_move(lru, dentry, freeable); |
f6041567 DC |
1258 | spin_unlock(&dentry->d_lock); |
1259 | ||
1260 | return LRU_REMOVED; | |
1261 | } | |
1262 | ||
3049cfe2 | 1263 | /** |
b48f03b3 DC |
1264 | * prune_dcache_sb - shrink the dcache |
1265 | * @sb: superblock | |
503c358c | 1266 | * @sc: shrink control, passed to list_lru_shrink_walk() |
b48f03b3 | 1267 | * |
503c358c VD |
1268 | * Attempt to shrink the superblock dcache LRU by @sc->nr_to_scan entries. This |
1269 | * is done when we need more memory and called from the superblock shrinker | |
b48f03b3 | 1270 | * function. |
3049cfe2 | 1271 | * |
b48f03b3 DC |
1272 | * This function may fail to free any resources if all the dentries are in |
1273 | * use. | |
3049cfe2 | 1274 | */ |
503c358c | 1275 | long prune_dcache_sb(struct super_block *sb, struct shrink_control *sc) |
3049cfe2 | 1276 | { |
f6041567 DC |
1277 | LIST_HEAD(dispose); |
1278 | long freed; | |
3049cfe2 | 1279 | |
503c358c VD |
1280 | freed = list_lru_shrink_walk(&sb->s_dentry_lru, sc, |
1281 | dentry_lru_isolate, &dispose); | |
f6041567 | 1282 | shrink_dentry_list(&dispose); |
0a234c6d | 1283 | return freed; |
da3bbdd4 | 1284 | } |
23044507 | 1285 | |
4e717f5c | 1286 | static enum lru_status dentry_lru_isolate_shrink(struct list_head *item, |
3f97b163 | 1287 | struct list_lru_one *lru, spinlock_t *lru_lock, void *arg) |
dd1f6b2e | 1288 | { |
4e717f5c GC |
1289 | struct list_head *freeable = arg; |
1290 | struct dentry *dentry = container_of(item, struct dentry, d_lru); | |
dd1f6b2e | 1291 | |
4e717f5c GC |
1292 | /* |
1293 | * we are inverting the lru lock/dentry->d_lock here, | |
1294 | * so use a trylock. If we fail to get the lock, just skip | |
1295 | * it | |
1296 | */ | |
1297 | if (!spin_trylock(&dentry->d_lock)) | |
1298 | return LRU_SKIP; | |
1299 | ||
3f97b163 | 1300 | d_lru_shrink_move(lru, dentry, freeable); |
4e717f5c | 1301 | spin_unlock(&dentry->d_lock); |
ec33679d | 1302 | |
4e717f5c | 1303 | return LRU_REMOVED; |
da3bbdd4 KM |
1304 | } |
1305 | ||
4e717f5c | 1306 | |
1da177e4 LT |
1307 | /** |
1308 | * shrink_dcache_sb - shrink dcache for a superblock | |
1309 | * @sb: superblock | |
1310 | * | |
3049cfe2 CH |
1311 | * Shrink the dcache for the specified super block. This is used to free |
1312 | * the dcache before unmounting a file system. | |
1da177e4 | 1313 | */ |
3049cfe2 | 1314 | void shrink_dcache_sb(struct super_block *sb) |
1da177e4 | 1315 | { |
4e717f5c GC |
1316 | do { |
1317 | LIST_HEAD(dispose); | |
1318 | ||
1dbd449c | 1319 | list_lru_walk(&sb->s_dentry_lru, |
b17c070f | 1320 | dentry_lru_isolate_shrink, &dispose, 1024); |
4e717f5c | 1321 | shrink_dentry_list(&dispose); |
b17c070f | 1322 | } while (list_lru_count(&sb->s_dentry_lru) > 0); |
1da177e4 | 1323 | } |
ec4f8605 | 1324 | EXPORT_SYMBOL(shrink_dcache_sb); |
1da177e4 | 1325 | |
db14fc3a MS |
1326 | /** |
1327 | * enum d_walk_ret - action to talke during tree walk | |
1328 | * @D_WALK_CONTINUE: contrinue walk | |
1329 | * @D_WALK_QUIT: quit walk | |
1330 | * @D_WALK_NORETRY: quit when retry is needed | |
1331 | * @D_WALK_SKIP: skip this dentry and its children | |
1332 | */ | |
1333 | enum d_walk_ret { | |
1334 | D_WALK_CONTINUE, | |
1335 | D_WALK_QUIT, | |
1336 | D_WALK_NORETRY, | |
1337 | D_WALK_SKIP, | |
1338 | }; | |
c826cb7d | 1339 | |
1da177e4 | 1340 | /** |
db14fc3a MS |
1341 | * d_walk - walk the dentry tree |
1342 | * @parent: start of walk | |
1343 | * @data: data passed to @enter() and @finish() | |
1344 | * @enter: callback when first entering the dentry | |
1da177e4 | 1345 | * |
3a8e3611 | 1346 | * The @enter() callbacks are called with d_lock held. |
1da177e4 | 1347 | */ |
db14fc3a | 1348 | static void d_walk(struct dentry *parent, void *data, |
3a8e3611 | 1349 | enum d_walk_ret (*enter)(void *, struct dentry *)) |
1da177e4 | 1350 | { |
949854d0 | 1351 | struct dentry *this_parent; |
1da177e4 | 1352 | struct list_head *next; |
48f5ec21 | 1353 | unsigned seq = 0; |
db14fc3a MS |
1354 | enum d_walk_ret ret; |
1355 | bool retry = true; | |
949854d0 | 1356 | |
58db63d0 | 1357 | again: |
48f5ec21 | 1358 | read_seqbegin_or_lock(&rename_lock, &seq); |
58db63d0 | 1359 | this_parent = parent; |
2fd6b7f5 | 1360 | spin_lock(&this_parent->d_lock); |
db14fc3a MS |
1361 | |
1362 | ret = enter(data, this_parent); | |
1363 | switch (ret) { | |
1364 | case D_WALK_CONTINUE: | |
1365 | break; | |
1366 | case D_WALK_QUIT: | |
1367 | case D_WALK_SKIP: | |
1368 | goto out_unlock; | |
1369 | case D_WALK_NORETRY: | |
1370 | retry = false; | |
1371 | break; | |
1372 | } | |
1da177e4 LT |
1373 | repeat: |
1374 | next = this_parent->d_subdirs.next; | |
1375 | resume: | |
1376 | while (next != &this_parent->d_subdirs) { | |
1377 | struct list_head *tmp = next; | |
946e51f2 | 1378 | struct dentry *dentry = list_entry(tmp, struct dentry, d_child); |
1da177e4 | 1379 | next = tmp->next; |
2fd6b7f5 | 1380 | |
ba65dc5e AV |
1381 | if (unlikely(dentry->d_flags & DCACHE_DENTRY_CURSOR)) |
1382 | continue; | |
1383 | ||
2fd6b7f5 | 1384 | spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED); |
db14fc3a MS |
1385 | |
1386 | ret = enter(data, dentry); | |
1387 | switch (ret) { | |
1388 | case D_WALK_CONTINUE: | |
1389 | break; | |
1390 | case D_WALK_QUIT: | |
2fd6b7f5 | 1391 | spin_unlock(&dentry->d_lock); |
db14fc3a MS |
1392 | goto out_unlock; |
1393 | case D_WALK_NORETRY: | |
1394 | retry = false; | |
1395 | break; | |
1396 | case D_WALK_SKIP: | |
1397 | spin_unlock(&dentry->d_lock); | |
1398 | continue; | |
2fd6b7f5 | 1399 | } |
db14fc3a | 1400 | |
1da177e4 | 1401 | if (!list_empty(&dentry->d_subdirs)) { |
2fd6b7f5 | 1402 | spin_unlock(&this_parent->d_lock); |
5facae4f | 1403 | spin_release(&dentry->d_lock.dep_map, _RET_IP_); |
1da177e4 | 1404 | this_parent = dentry; |
2fd6b7f5 | 1405 | spin_acquire(&this_parent->d_lock.dep_map, 0, 1, _RET_IP_); |
1da177e4 LT |
1406 | goto repeat; |
1407 | } | |
2fd6b7f5 | 1408 | spin_unlock(&dentry->d_lock); |
1da177e4 LT |
1409 | } |
1410 | /* | |
1411 | * All done at this level ... ascend and resume the search. | |
1412 | */ | |
ca5358ef AV |
1413 | rcu_read_lock(); |
1414 | ascend: | |
1da177e4 | 1415 | if (this_parent != parent) { |
c826cb7d | 1416 | struct dentry *child = this_parent; |
31dec132 AV |
1417 | this_parent = child->d_parent; |
1418 | ||
31dec132 AV |
1419 | spin_unlock(&child->d_lock); |
1420 | spin_lock(&this_parent->d_lock); | |
1421 | ||
ca5358ef AV |
1422 | /* might go back up the wrong parent if we have had a rename. */ |
1423 | if (need_seqretry(&rename_lock, seq)) | |
949854d0 | 1424 | goto rename_retry; |
2159184e AV |
1425 | /* go into the first sibling still alive */ |
1426 | do { | |
1427 | next = child->d_child.next; | |
ca5358ef AV |
1428 | if (next == &this_parent->d_subdirs) |
1429 | goto ascend; | |
1430 | child = list_entry(next, struct dentry, d_child); | |
2159184e | 1431 | } while (unlikely(child->d_flags & DCACHE_DENTRY_KILLED)); |
31dec132 | 1432 | rcu_read_unlock(); |
1da177e4 LT |
1433 | goto resume; |
1434 | } | |
ca5358ef | 1435 | if (need_seqretry(&rename_lock, seq)) |
949854d0 | 1436 | goto rename_retry; |
ca5358ef | 1437 | rcu_read_unlock(); |
db14fc3a MS |
1438 | |
1439 | out_unlock: | |
1440 | spin_unlock(&this_parent->d_lock); | |
48f5ec21 | 1441 | done_seqretry(&rename_lock, seq); |
db14fc3a | 1442 | return; |
58db63d0 NP |
1443 | |
1444 | rename_retry: | |
ca5358ef AV |
1445 | spin_unlock(&this_parent->d_lock); |
1446 | rcu_read_unlock(); | |
1447 | BUG_ON(seq & 1); | |
db14fc3a MS |
1448 | if (!retry) |
1449 | return; | |
48f5ec21 | 1450 | seq = 1; |
58db63d0 | 1451 | goto again; |
1da177e4 | 1452 | } |
db14fc3a | 1453 | |
01619491 IK |
1454 | struct check_mount { |
1455 | struct vfsmount *mnt; | |
1456 | unsigned int mounted; | |
1457 | }; | |
1458 | ||
1459 | static enum d_walk_ret path_check_mount(void *data, struct dentry *dentry) | |
1460 | { | |
1461 | struct check_mount *info = data; | |
1462 | struct path path = { .mnt = info->mnt, .dentry = dentry }; | |
1463 | ||
1464 | if (likely(!d_mountpoint(dentry))) | |
1465 | return D_WALK_CONTINUE; | |
1466 | if (__path_is_mountpoint(&path)) { | |
1467 | info->mounted = 1; | |
1468 | return D_WALK_QUIT; | |
1469 | } | |
1470 | return D_WALK_CONTINUE; | |
1471 | } | |
1472 | ||
1473 | /** | |
1474 | * path_has_submounts - check for mounts over a dentry in the | |
1475 | * current namespace. | |
1476 | * @parent: path to check. | |
1477 | * | |
1478 | * Return true if the parent or its subdirectories contain | |
1479 | * a mount point in the current namespace. | |
1480 | */ | |
1481 | int path_has_submounts(const struct path *parent) | |
1482 | { | |
1483 | struct check_mount data = { .mnt = parent->mnt, .mounted = 0 }; | |
1484 | ||
1485 | read_seqlock_excl(&mount_lock); | |
3a8e3611 | 1486 | d_walk(parent->dentry, &data, path_check_mount); |
01619491 IK |
1487 | read_sequnlock_excl(&mount_lock); |
1488 | ||
1489 | return data.mounted; | |
1490 | } | |
1491 | EXPORT_SYMBOL(path_has_submounts); | |
1492 | ||
eed81007 MS |
1493 | /* |
1494 | * Called by mount code to set a mountpoint and check if the mountpoint is | |
1495 | * reachable (e.g. NFS can unhash a directory dentry and then the complete | |
1496 | * subtree can become unreachable). | |
1497 | * | |
1ffe46d1 | 1498 | * Only one of d_invalidate() and d_set_mounted() must succeed. For |
eed81007 MS |
1499 | * this reason take rename_lock and d_lock on dentry and ancestors. |
1500 | */ | |
1501 | int d_set_mounted(struct dentry *dentry) | |
1502 | { | |
1503 | struct dentry *p; | |
1504 | int ret = -ENOENT; | |
1505 | write_seqlock(&rename_lock); | |
1506 | for (p = dentry->d_parent; !IS_ROOT(p); p = p->d_parent) { | |
1ffe46d1 | 1507 | /* Need exclusion wrt. d_invalidate() */ |
eed81007 MS |
1508 | spin_lock(&p->d_lock); |
1509 | if (unlikely(d_unhashed(p))) { | |
1510 | spin_unlock(&p->d_lock); | |
1511 | goto out; | |
1512 | } | |
1513 | spin_unlock(&p->d_lock); | |
1514 | } | |
1515 | spin_lock(&dentry->d_lock); | |
1516 | if (!d_unlinked(dentry)) { | |
3895dbf8 EB |
1517 | ret = -EBUSY; |
1518 | if (!d_mountpoint(dentry)) { | |
1519 | dentry->d_flags |= DCACHE_MOUNTED; | |
1520 | ret = 0; | |
1521 | } | |
eed81007 MS |
1522 | } |
1523 | spin_unlock(&dentry->d_lock); | |
1524 | out: | |
1525 | write_sequnlock(&rename_lock); | |
1526 | return ret; | |
1527 | } | |
1528 | ||
1da177e4 | 1529 | /* |
fd517909 | 1530 | * Search the dentry child list of the specified parent, |
1da177e4 LT |
1531 | * and move any unused dentries to the end of the unused |
1532 | * list for prune_dcache(). We descend to the next level | |
1533 | * whenever the d_subdirs list is non-empty and continue | |
1534 | * searching. | |
1535 | * | |
1536 | * It returns zero iff there are no unused children, | |
1537 | * otherwise it returns the number of children moved to | |
1538 | * the end of the unused list. This may not be the total | |
1539 | * number of unused children, because select_parent can | |
1540 | * drop the lock and return early due to latency | |
1541 | * constraints. | |
1542 | */ | |
1da177e4 | 1543 | |
db14fc3a MS |
1544 | struct select_data { |
1545 | struct dentry *start; | |
9bdebc2b AV |
1546 | union { |
1547 | long found; | |
1548 | struct dentry *victim; | |
1549 | }; | |
db14fc3a | 1550 | struct list_head dispose; |
db14fc3a | 1551 | }; |
23044507 | 1552 | |
db14fc3a MS |
1553 | static enum d_walk_ret select_collect(void *_data, struct dentry *dentry) |
1554 | { | |
1555 | struct select_data *data = _data; | |
1556 | enum d_walk_ret ret = D_WALK_CONTINUE; | |
1da177e4 | 1557 | |
db14fc3a MS |
1558 | if (data->start == dentry) |
1559 | goto out; | |
2fd6b7f5 | 1560 | |
fe91522a | 1561 | if (dentry->d_flags & DCACHE_SHRINK_LIST) { |
db14fc3a | 1562 | data->found++; |
fe91522a AV |
1563 | } else { |
1564 | if (dentry->d_flags & DCACHE_LRU_LIST) | |
1565 | d_lru_del(dentry); | |
1566 | if (!dentry->d_lockref.count) { | |
1567 | d_shrink_add(dentry, &data->dispose); | |
1568 | data->found++; | |
1569 | } | |
1da177e4 | 1570 | } |
db14fc3a MS |
1571 | /* |
1572 | * We can return to the caller if we have found some (this | |
1573 | * ensures forward progress). We'll be coming back to find | |
1574 | * the rest. | |
1575 | */ | |
fe91522a AV |
1576 | if (!list_empty(&data->dispose)) |
1577 | ret = need_resched() ? D_WALK_QUIT : D_WALK_NORETRY; | |
1da177e4 | 1578 | out: |
db14fc3a | 1579 | return ret; |
1da177e4 LT |
1580 | } |
1581 | ||
9bdebc2b AV |
1582 | static enum d_walk_ret select_collect2(void *_data, struct dentry *dentry) |
1583 | { | |
1584 | struct select_data *data = _data; | |
1585 | enum d_walk_ret ret = D_WALK_CONTINUE; | |
1586 | ||
1587 | if (data->start == dentry) | |
1588 | goto out; | |
1589 | ||
1590 | if (dentry->d_flags & DCACHE_SHRINK_LIST) { | |
1591 | if (!dentry->d_lockref.count) { | |
1592 | rcu_read_lock(); | |
1593 | data->victim = dentry; | |
1594 | return D_WALK_QUIT; | |
1595 | } | |
1596 | } else { | |
1597 | if (dentry->d_flags & DCACHE_LRU_LIST) | |
1598 | d_lru_del(dentry); | |
1599 | if (!dentry->d_lockref.count) | |
1600 | d_shrink_add(dentry, &data->dispose); | |
1601 | } | |
1602 | /* | |
1603 | * We can return to the caller if we have found some (this | |
1604 | * ensures forward progress). We'll be coming back to find | |
1605 | * the rest. | |
1606 | */ | |
1607 | if (!list_empty(&data->dispose)) | |
1608 | ret = need_resched() ? D_WALK_QUIT : D_WALK_NORETRY; | |
1609 | out: | |
1610 | return ret; | |
1611 | } | |
1612 | ||
1da177e4 LT |
1613 | /** |
1614 | * shrink_dcache_parent - prune dcache | |
1615 | * @parent: parent of entries to prune | |
1616 | * | |
1617 | * Prune the dcache to remove unused children of the parent dentry. | |
1618 | */ | |
db14fc3a | 1619 | void shrink_dcache_parent(struct dentry *parent) |
1da177e4 | 1620 | { |
db14fc3a | 1621 | for (;;) { |
9bdebc2b | 1622 | struct select_data data = {.start = parent}; |
1da177e4 | 1623 | |
db14fc3a | 1624 | INIT_LIST_HEAD(&data.dispose); |
3a8e3611 | 1625 | d_walk(parent, &data, select_collect); |
4fb48871 AV |
1626 | |
1627 | if (!list_empty(&data.dispose)) { | |
1628 | shrink_dentry_list(&data.dispose); | |
1629 | continue; | |
1630 | } | |
1631 | ||
1632 | cond_resched(); | |
db14fc3a MS |
1633 | if (!data.found) |
1634 | break; | |
9bdebc2b AV |
1635 | data.victim = NULL; |
1636 | d_walk(parent, &data, select_collect2); | |
1637 | if (data.victim) { | |
1638 | struct dentry *parent; | |
1639 | spin_lock(&data.victim->d_lock); | |
1640 | if (!shrink_lock_dentry(data.victim)) { | |
1641 | spin_unlock(&data.victim->d_lock); | |
1642 | rcu_read_unlock(); | |
1643 | } else { | |
1644 | rcu_read_unlock(); | |
1645 | parent = data.victim->d_parent; | |
1646 | if (parent != data.victim) | |
1647 | __dput_to_list(parent, &data.dispose); | |
1648 | __dentry_kill(data.victim); | |
1649 | } | |
1650 | } | |
1651 | if (!list_empty(&data.dispose)) | |
1652 | shrink_dentry_list(&data.dispose); | |
421348f1 | 1653 | } |
1da177e4 | 1654 | } |
ec4f8605 | 1655 | EXPORT_SYMBOL(shrink_dcache_parent); |
1da177e4 | 1656 | |
9c8c10e2 | 1657 | static enum d_walk_ret umount_check(void *_data, struct dentry *dentry) |
42c32608 | 1658 | { |
9c8c10e2 AV |
1659 | /* it has busy descendents; complain about those instead */ |
1660 | if (!list_empty(&dentry->d_subdirs)) | |
1661 | return D_WALK_CONTINUE; | |
42c32608 | 1662 | |
9c8c10e2 AV |
1663 | /* root with refcount 1 is fine */ |
1664 | if (dentry == _data && dentry->d_lockref.count == 1) | |
1665 | return D_WALK_CONTINUE; | |
1666 | ||
8c8e7dba | 1667 | WARN(1, "BUG: Dentry %p{i=%lx,n=%pd} " |
9c8c10e2 | 1668 | " still in use (%d) [unmount of %s %s]\n", |
42c32608 AV |
1669 | dentry, |
1670 | dentry->d_inode ? | |
1671 | dentry->d_inode->i_ino : 0UL, | |
9c8c10e2 | 1672 | dentry, |
42c32608 AV |
1673 | dentry->d_lockref.count, |
1674 | dentry->d_sb->s_type->name, | |
1675 | dentry->d_sb->s_id); | |
9c8c10e2 AV |
1676 | return D_WALK_CONTINUE; |
1677 | } | |
1678 | ||
1679 | static void do_one_tree(struct dentry *dentry) | |
1680 | { | |
1681 | shrink_dcache_parent(dentry); | |
3a8e3611 | 1682 | d_walk(dentry, dentry, umount_check); |
9c8c10e2 AV |
1683 | d_drop(dentry); |
1684 | dput(dentry); | |
42c32608 AV |
1685 | } |
1686 | ||
1687 | /* | |
1688 | * destroy the dentries attached to a superblock on unmounting | |
1689 | */ | |
1690 | void shrink_dcache_for_umount(struct super_block *sb) | |
1691 | { | |
1692 | struct dentry *dentry; | |
1693 | ||
9c8c10e2 | 1694 | WARN(down_read_trylock(&sb->s_umount), "s_umount should've been locked"); |
42c32608 AV |
1695 | |
1696 | dentry = sb->s_root; | |
1697 | sb->s_root = NULL; | |
9c8c10e2 | 1698 | do_one_tree(dentry); |
42c32608 | 1699 | |
f1ee6162 N |
1700 | while (!hlist_bl_empty(&sb->s_roots)) { |
1701 | dentry = dget(hlist_bl_entry(hlist_bl_first(&sb->s_roots), struct dentry, d_hash)); | |
9c8c10e2 | 1702 | do_one_tree(dentry); |
42c32608 AV |
1703 | } |
1704 | } | |
1705 | ||
ff17fa56 | 1706 | static enum d_walk_ret find_submount(void *_data, struct dentry *dentry) |
848ac114 | 1707 | { |
ff17fa56 | 1708 | struct dentry **victim = _data; |
848ac114 | 1709 | if (d_mountpoint(dentry)) { |
8ed936b5 | 1710 | __dget_dlock(dentry); |
ff17fa56 | 1711 | *victim = dentry; |
848ac114 MS |
1712 | return D_WALK_QUIT; |
1713 | } | |
ff17fa56 | 1714 | return D_WALK_CONTINUE; |
848ac114 MS |
1715 | } |
1716 | ||
1717 | /** | |
1ffe46d1 EB |
1718 | * d_invalidate - detach submounts, prune dcache, and drop |
1719 | * @dentry: dentry to invalidate (aka detach, prune and drop) | |
848ac114 | 1720 | */ |
5542aa2f | 1721 | void d_invalidate(struct dentry *dentry) |
848ac114 | 1722 | { |
ff17fa56 | 1723 | bool had_submounts = false; |
1ffe46d1 EB |
1724 | spin_lock(&dentry->d_lock); |
1725 | if (d_unhashed(dentry)) { | |
1726 | spin_unlock(&dentry->d_lock); | |
5542aa2f | 1727 | return; |
1ffe46d1 | 1728 | } |
ff17fa56 | 1729 | __d_drop(dentry); |
1ffe46d1 EB |
1730 | spin_unlock(&dentry->d_lock); |
1731 | ||
848ac114 | 1732 | /* Negative dentries can be dropped without further checks */ |
ff17fa56 | 1733 | if (!dentry->d_inode) |
5542aa2f | 1734 | return; |
848ac114 | 1735 | |
ff17fa56 | 1736 | shrink_dcache_parent(dentry); |
848ac114 | 1737 | for (;;) { |
ff17fa56 | 1738 | struct dentry *victim = NULL; |
3a8e3611 | 1739 | d_walk(dentry, &victim, find_submount); |
ff17fa56 AV |
1740 | if (!victim) { |
1741 | if (had_submounts) | |
1742 | shrink_dcache_parent(dentry); | |
81be24d2 | 1743 | return; |
8ed936b5 | 1744 | } |
ff17fa56 AV |
1745 | had_submounts = true; |
1746 | detach_mounts(victim); | |
1747 | dput(victim); | |
848ac114 | 1748 | } |
848ac114 | 1749 | } |
1ffe46d1 | 1750 | EXPORT_SYMBOL(d_invalidate); |
848ac114 | 1751 | |
1da177e4 | 1752 | /** |
a4464dbc AV |
1753 | * __d_alloc - allocate a dcache entry |
1754 | * @sb: filesystem it will belong to | |
1da177e4 LT |
1755 | * @name: qstr of the name |
1756 | * | |
1757 | * Allocates a dentry. It returns %NULL if there is insufficient memory | |
1758 | * available. On a success the dentry is returned. The name passed in is | |
1759 | * copied and the copy passed in may be reused after this call. | |
1760 | */ | |
1761 | ||
5c8b0dfc | 1762 | static struct dentry *__d_alloc(struct super_block *sb, const struct qstr *name) |
1da177e4 LT |
1763 | { |
1764 | struct dentry *dentry; | |
1765 | char *dname; | |
285b102d | 1766 | int err; |
1da177e4 | 1767 | |
f53bf711 MS |
1768 | dentry = kmem_cache_alloc_lru(dentry_cache, &sb->s_dentry_lru, |
1769 | GFP_KERNEL); | |
1da177e4 LT |
1770 | if (!dentry) |
1771 | return NULL; | |
1772 | ||
6326c71f LT |
1773 | /* |
1774 | * We guarantee that the inline name is always NUL-terminated. | |
1775 | * This way the memcpy() done by the name switching in rename | |
1776 | * will still always have a NUL at the end, even if we might | |
1777 | * be overwriting an internal NUL character | |
1778 | */ | |
1779 | dentry->d_iname[DNAME_INLINE_LEN-1] = 0; | |
798434bd | 1780 | if (unlikely(!name)) { |
cdf01226 | 1781 | name = &slash_name; |
798434bd AV |
1782 | dname = dentry->d_iname; |
1783 | } else if (name->len > DNAME_INLINE_LEN-1) { | |
8d85b484 | 1784 | size_t size = offsetof(struct external_name, name[1]); |
2e03b4bc VB |
1785 | struct external_name *p = kmalloc(size + name->len, |
1786 | GFP_KERNEL_ACCOUNT | | |
1787 | __GFP_RECLAIMABLE); | |
1788 | if (!p) { | |
1da177e4 LT |
1789 | kmem_cache_free(dentry_cache, dentry); |
1790 | return NULL; | |
1791 | } | |
2e03b4bc VB |
1792 | atomic_set(&p->u.count, 1); |
1793 | dname = p->name; | |
1da177e4 LT |
1794 | } else { |
1795 | dname = dentry->d_iname; | |
1796 | } | |
1da177e4 LT |
1797 | |
1798 | dentry->d_name.len = name->len; | |
1799 | dentry->d_name.hash = name->hash; | |
1800 | memcpy(dname, name->name, name->len); | |
1801 | dname[name->len] = 0; | |
1802 | ||
6326c71f | 1803 | /* Make sure we always see the terminating NUL character */ |
7088efa9 | 1804 | smp_store_release(&dentry->d_name.name, dname); /* ^^^ */ |
6326c71f | 1805 | |
98474236 | 1806 | dentry->d_lockref.count = 1; |
dea3667b | 1807 | dentry->d_flags = 0; |
1da177e4 | 1808 | spin_lock_init(&dentry->d_lock); |
26475371 | 1809 | seqcount_spinlock_init(&dentry->d_seq, &dentry->d_lock); |
1da177e4 | 1810 | dentry->d_inode = NULL; |
a4464dbc AV |
1811 | dentry->d_parent = dentry; |
1812 | dentry->d_sb = sb; | |
1da177e4 LT |
1813 | dentry->d_op = NULL; |
1814 | dentry->d_fsdata = NULL; | |
ceb5bdc2 | 1815 | INIT_HLIST_BL_NODE(&dentry->d_hash); |
1da177e4 LT |
1816 | INIT_LIST_HEAD(&dentry->d_lru); |
1817 | INIT_LIST_HEAD(&dentry->d_subdirs); | |
946e51f2 AV |
1818 | INIT_HLIST_NODE(&dentry->d_u.d_alias); |
1819 | INIT_LIST_HEAD(&dentry->d_child); | |
a4464dbc | 1820 | d_set_d_op(dentry, dentry->d_sb->s_d_op); |
1da177e4 | 1821 | |
285b102d MS |
1822 | if (dentry->d_op && dentry->d_op->d_init) { |
1823 | err = dentry->d_op->d_init(dentry); | |
1824 | if (err) { | |
1825 | if (dname_external(dentry)) | |
1826 | kfree(external_name(dentry)); | |
1827 | kmem_cache_free(dentry_cache, dentry); | |
1828 | return NULL; | |
1829 | } | |
1830 | } | |
1831 | ||
3e880fb5 | 1832 | this_cpu_inc(nr_dentry); |
312d3ca8 | 1833 | |
1da177e4 LT |
1834 | return dentry; |
1835 | } | |
a4464dbc AV |
1836 | |
1837 | /** | |
1838 | * d_alloc - allocate a dcache entry | |
1839 | * @parent: parent of entry to allocate | |
1840 | * @name: qstr of the name | |
1841 | * | |
1842 | * Allocates a dentry. It returns %NULL if there is insufficient memory | |
1843 | * available. On a success the dentry is returned. The name passed in is | |
1844 | * copied and the copy passed in may be reused after this call. | |
1845 | */ | |
1846 | struct dentry *d_alloc(struct dentry * parent, const struct qstr *name) | |
1847 | { | |
1848 | struct dentry *dentry = __d_alloc(parent->d_sb, name); | |
1849 | if (!dentry) | |
1850 | return NULL; | |
a4464dbc AV |
1851 | spin_lock(&parent->d_lock); |
1852 | /* | |
1853 | * don't need child lock because it is not subject | |
1854 | * to concurrency here | |
1855 | */ | |
1856 | __dget_dlock(parent); | |
1857 | dentry->d_parent = parent; | |
946e51f2 | 1858 | list_add(&dentry->d_child, &parent->d_subdirs); |
a4464dbc AV |
1859 | spin_unlock(&parent->d_lock); |
1860 | ||
1861 | return dentry; | |
1862 | } | |
ec4f8605 | 1863 | EXPORT_SYMBOL(d_alloc); |
1da177e4 | 1864 | |
f9c34674 MS |
1865 | struct dentry *d_alloc_anon(struct super_block *sb) |
1866 | { | |
1867 | return __d_alloc(sb, NULL); | |
1868 | } | |
1869 | EXPORT_SYMBOL(d_alloc_anon); | |
1870 | ||
ba65dc5e AV |
1871 | struct dentry *d_alloc_cursor(struct dentry * parent) |
1872 | { | |
f9c34674 | 1873 | struct dentry *dentry = d_alloc_anon(parent->d_sb); |
ba65dc5e | 1874 | if (dentry) { |
5467a68c | 1875 | dentry->d_flags |= DCACHE_DENTRY_CURSOR; |
ba65dc5e AV |
1876 | dentry->d_parent = dget(parent); |
1877 | } | |
1878 | return dentry; | |
1879 | } | |
1880 | ||
e1a24bb0 BF |
1881 | /** |
1882 | * d_alloc_pseudo - allocate a dentry (for lookup-less filesystems) | |
1883 | * @sb: the superblock | |
1884 | * @name: qstr of the name | |
1885 | * | |
1886 | * For a filesystem that just pins its dentries in memory and never | |
1887 | * performs lookups at all, return an unhashed IS_ROOT dentry. | |
5467a68c AV |
1888 | * This is used for pipes, sockets et.al. - the stuff that should |
1889 | * never be anyone's children or parents. Unlike all other | |
1890 | * dentries, these will not have RCU delay between dropping the | |
1891 | * last reference and freeing them. | |
ab1152dd AV |
1892 | * |
1893 | * The only user is alloc_file_pseudo() and that's what should | |
1894 | * be considered a public interface. Don't use directly. | |
e1a24bb0 | 1895 | */ |
4b936885 NP |
1896 | struct dentry *d_alloc_pseudo(struct super_block *sb, const struct qstr *name) |
1897 | { | |
5467a68c AV |
1898 | struct dentry *dentry = __d_alloc(sb, name); |
1899 | if (likely(dentry)) | |
1900 | dentry->d_flags |= DCACHE_NORCU; | |
1901 | return dentry; | |
4b936885 | 1902 | } |
4b936885 | 1903 | |
1da177e4 LT |
1904 | struct dentry *d_alloc_name(struct dentry *parent, const char *name) |
1905 | { | |
1906 | struct qstr q; | |
1907 | ||
1908 | q.name = name; | |
8387ff25 | 1909 | q.hash_len = hashlen_string(parent, name); |
1da177e4 LT |
1910 | return d_alloc(parent, &q); |
1911 | } | |
ef26ca97 | 1912 | EXPORT_SYMBOL(d_alloc_name); |
1da177e4 | 1913 | |
fb045adb NP |
1914 | void d_set_d_op(struct dentry *dentry, const struct dentry_operations *op) |
1915 | { | |
6f7f7caa LT |
1916 | WARN_ON_ONCE(dentry->d_op); |
1917 | WARN_ON_ONCE(dentry->d_flags & (DCACHE_OP_HASH | | |
fb045adb NP |
1918 | DCACHE_OP_COMPARE | |
1919 | DCACHE_OP_REVALIDATE | | |
ecf3d1f1 | 1920 | DCACHE_OP_WEAK_REVALIDATE | |
4bacc9c9 | 1921 | DCACHE_OP_DELETE | |
d101a125 | 1922 | DCACHE_OP_REAL)); |
fb045adb NP |
1923 | dentry->d_op = op; |
1924 | if (!op) | |
1925 | return; | |
1926 | if (op->d_hash) | |
1927 | dentry->d_flags |= DCACHE_OP_HASH; | |
1928 | if (op->d_compare) | |
1929 | dentry->d_flags |= DCACHE_OP_COMPARE; | |
1930 | if (op->d_revalidate) | |
1931 | dentry->d_flags |= DCACHE_OP_REVALIDATE; | |
ecf3d1f1 JL |
1932 | if (op->d_weak_revalidate) |
1933 | dentry->d_flags |= DCACHE_OP_WEAK_REVALIDATE; | |
fb045adb NP |
1934 | if (op->d_delete) |
1935 | dentry->d_flags |= DCACHE_OP_DELETE; | |
f0023bc6 SW |
1936 | if (op->d_prune) |
1937 | dentry->d_flags |= DCACHE_OP_PRUNE; | |
d101a125 MS |
1938 | if (op->d_real) |
1939 | dentry->d_flags |= DCACHE_OP_REAL; | |
fb045adb NP |
1940 | |
1941 | } | |
1942 | EXPORT_SYMBOL(d_set_d_op); | |
1943 | ||
df1a085a DH |
1944 | |
1945 | /* | |
1946 | * d_set_fallthru - Mark a dentry as falling through to a lower layer | |
1947 | * @dentry - The dentry to mark | |
1948 | * | |
1949 | * Mark a dentry as falling through to the lower layer (as set with | |
1950 | * d_pin_lower()). This flag may be recorded on the medium. | |
1951 | */ | |
1952 | void d_set_fallthru(struct dentry *dentry) | |
1953 | { | |
1954 | spin_lock(&dentry->d_lock); | |
1955 | dentry->d_flags |= DCACHE_FALLTHRU; | |
1956 | spin_unlock(&dentry->d_lock); | |
1957 | } | |
1958 | EXPORT_SYMBOL(d_set_fallthru); | |
1959 | ||
b18825a7 DH |
1960 | static unsigned d_flags_for_inode(struct inode *inode) |
1961 | { | |
44bdb5e5 | 1962 | unsigned add_flags = DCACHE_REGULAR_TYPE; |
b18825a7 DH |
1963 | |
1964 | if (!inode) | |
1965 | return DCACHE_MISS_TYPE; | |
1966 | ||
1967 | if (S_ISDIR(inode->i_mode)) { | |
1968 | add_flags = DCACHE_DIRECTORY_TYPE; | |
1969 | if (unlikely(!(inode->i_opflags & IOP_LOOKUP))) { | |
1970 | if (unlikely(!inode->i_op->lookup)) | |
1971 | add_flags = DCACHE_AUTODIR_TYPE; | |
1972 | else | |
1973 | inode->i_opflags |= IOP_LOOKUP; | |
1974 | } | |
44bdb5e5 DH |
1975 | goto type_determined; |
1976 | } | |
1977 | ||
1978 | if (unlikely(!(inode->i_opflags & IOP_NOFOLLOW))) { | |
6b255391 | 1979 | if (unlikely(inode->i_op->get_link)) { |
b18825a7 | 1980 | add_flags = DCACHE_SYMLINK_TYPE; |
44bdb5e5 DH |
1981 | goto type_determined; |
1982 | } | |
1983 | inode->i_opflags |= IOP_NOFOLLOW; | |
b18825a7 DH |
1984 | } |
1985 | ||
44bdb5e5 DH |
1986 | if (unlikely(!S_ISREG(inode->i_mode))) |
1987 | add_flags = DCACHE_SPECIAL_TYPE; | |
1988 | ||
1989 | type_determined: | |
b18825a7 DH |
1990 | if (unlikely(IS_AUTOMOUNT(inode))) |
1991 | add_flags |= DCACHE_NEED_AUTOMOUNT; | |
1992 | return add_flags; | |
1993 | } | |
1994 | ||
360da900 OH |
1995 | static void __d_instantiate(struct dentry *dentry, struct inode *inode) |
1996 | { | |
b18825a7 | 1997 | unsigned add_flags = d_flags_for_inode(inode); |
85c7f810 | 1998 | WARN_ON(d_in_lookup(dentry)); |
b18825a7 | 1999 | |
b23fb0a6 | 2000 | spin_lock(&dentry->d_lock); |
af0c9af1 WL |
2001 | /* |
2002 | * Decrement negative dentry count if it was in the LRU list. | |
2003 | */ | |
2004 | if (dentry->d_flags & DCACHE_LRU_LIST) | |
2005 | this_cpu_dec(nr_dentry_negative); | |
de689f5e | 2006 | hlist_add_head(&dentry->d_u.d_alias, &inode->i_dentry); |
a528aca7 | 2007 | raw_write_seqcount_begin(&dentry->d_seq); |
4bf46a27 | 2008 | __d_set_inode_and_type(dentry, inode, add_flags); |
a528aca7 | 2009 | raw_write_seqcount_end(&dentry->d_seq); |
affda484 | 2010 | fsnotify_update_flags(dentry); |
b23fb0a6 | 2011 | spin_unlock(&dentry->d_lock); |
360da900 OH |
2012 | } |
2013 | ||
1da177e4 LT |
2014 | /** |
2015 | * d_instantiate - fill in inode information for a dentry | |
2016 | * @entry: dentry to complete | |
2017 | * @inode: inode to attach to this dentry | |
2018 | * | |
2019 | * Fill in inode information in the entry. | |
2020 | * | |
2021 | * This turns negative dentries into productive full members | |
2022 | * of society. | |
2023 | * | |
2024 | * NOTE! This assumes that the inode count has been incremented | |
2025 | * (or otherwise set) by the caller to indicate that it is now | |
2026 | * in use by the dcache. | |
2027 | */ | |
2028 | ||
2029 | void d_instantiate(struct dentry *entry, struct inode * inode) | |
2030 | { | |
946e51f2 | 2031 | BUG_ON(!hlist_unhashed(&entry->d_u.d_alias)); |
de689f5e | 2032 | if (inode) { |
b9680917 | 2033 | security_d_instantiate(entry, inode); |
873feea0 | 2034 | spin_lock(&inode->i_lock); |
de689f5e | 2035 | __d_instantiate(entry, inode); |
873feea0 | 2036 | spin_unlock(&inode->i_lock); |
de689f5e | 2037 | } |
1da177e4 | 2038 | } |
ec4f8605 | 2039 | EXPORT_SYMBOL(d_instantiate); |
1da177e4 | 2040 | |
1e2e547a AV |
2041 | /* |
2042 | * This should be equivalent to d_instantiate() + unlock_new_inode(), | |
2043 | * with lockdep-related part of unlock_new_inode() done before | |
2044 | * anything else. Use that instead of open-coding d_instantiate()/ | |
2045 | * unlock_new_inode() combinations. | |
2046 | */ | |
2047 | void d_instantiate_new(struct dentry *entry, struct inode *inode) | |
2048 | { | |
2049 | BUG_ON(!hlist_unhashed(&entry->d_u.d_alias)); | |
2050 | BUG_ON(!inode); | |
2051 | lockdep_annotate_inode_mutex_key(inode); | |
2052 | security_d_instantiate(entry, inode); | |
2053 | spin_lock(&inode->i_lock); | |
2054 | __d_instantiate(entry, inode); | |
2055 | WARN_ON(!(inode->i_state & I_NEW)); | |
c2b6d621 | 2056 | inode->i_state &= ~I_NEW & ~I_CREATING; |
1e2e547a AV |
2057 | smp_mb(); |
2058 | wake_up_bit(&inode->i_state, __I_NEW); | |
2059 | spin_unlock(&inode->i_lock); | |
2060 | } | |
2061 | EXPORT_SYMBOL(d_instantiate_new); | |
2062 | ||
adc0e91a AV |
2063 | struct dentry *d_make_root(struct inode *root_inode) |
2064 | { | |
2065 | struct dentry *res = NULL; | |
2066 | ||
2067 | if (root_inode) { | |
f9c34674 | 2068 | res = d_alloc_anon(root_inode->i_sb); |
5467a68c | 2069 | if (res) |
adc0e91a | 2070 | d_instantiate(res, root_inode); |
5467a68c | 2071 | else |
adc0e91a AV |
2072 | iput(root_inode); |
2073 | } | |
2074 | return res; | |
2075 | } | |
2076 | EXPORT_SYMBOL(d_make_root); | |
2077 | ||
f9c34674 MS |
2078 | static struct dentry *__d_instantiate_anon(struct dentry *dentry, |
2079 | struct inode *inode, | |
2080 | bool disconnected) | |
4ea3ada2 | 2081 | { |
9308a612 | 2082 | struct dentry *res; |
b18825a7 | 2083 | unsigned add_flags; |
4ea3ada2 | 2084 | |
f9c34674 | 2085 | security_d_instantiate(dentry, inode); |
873feea0 | 2086 | spin_lock(&inode->i_lock); |
d891eedb | 2087 | res = __d_find_any_alias(inode); |
9308a612 | 2088 | if (res) { |
873feea0 | 2089 | spin_unlock(&inode->i_lock); |
f9c34674 | 2090 | dput(dentry); |
9308a612 CH |
2091 | goto out_iput; |
2092 | } | |
2093 | ||
2094 | /* attach a disconnected dentry */ | |
1a0a397e BF |
2095 | add_flags = d_flags_for_inode(inode); |
2096 | ||
2097 | if (disconnected) | |
2098 | add_flags |= DCACHE_DISCONNECTED; | |
b18825a7 | 2099 | |
f9c34674 MS |
2100 | spin_lock(&dentry->d_lock); |
2101 | __d_set_inode_and_type(dentry, inode, add_flags); | |
2102 | hlist_add_head(&dentry->d_u.d_alias, &inode->i_dentry); | |
f1ee6162 | 2103 | if (!disconnected) { |
139351f1 LT |
2104 | hlist_bl_lock(&dentry->d_sb->s_roots); |
2105 | hlist_bl_add_head(&dentry->d_hash, &dentry->d_sb->s_roots); | |
2106 | hlist_bl_unlock(&dentry->d_sb->s_roots); | |
f1ee6162 | 2107 | } |
f9c34674 | 2108 | spin_unlock(&dentry->d_lock); |
873feea0 | 2109 | spin_unlock(&inode->i_lock); |
9308a612 | 2110 | |
f9c34674 | 2111 | return dentry; |
9308a612 CH |
2112 | |
2113 | out_iput: | |
2114 | iput(inode); | |
2115 | return res; | |
4ea3ada2 | 2116 | } |
1a0a397e | 2117 | |
f9c34674 MS |
2118 | struct dentry *d_instantiate_anon(struct dentry *dentry, struct inode *inode) |
2119 | { | |
2120 | return __d_instantiate_anon(dentry, inode, true); | |
2121 | } | |
2122 | EXPORT_SYMBOL(d_instantiate_anon); | |
2123 | ||
2124 | static struct dentry *__d_obtain_alias(struct inode *inode, bool disconnected) | |
2125 | { | |
2126 | struct dentry *tmp; | |
2127 | struct dentry *res; | |
2128 | ||
2129 | if (!inode) | |
2130 | return ERR_PTR(-ESTALE); | |
2131 | if (IS_ERR(inode)) | |
2132 | return ERR_CAST(inode); | |
2133 | ||
2134 | res = d_find_any_alias(inode); | |
2135 | if (res) | |
2136 | goto out_iput; | |
2137 | ||
2138 | tmp = d_alloc_anon(inode->i_sb); | |
2139 | if (!tmp) { | |
2140 | res = ERR_PTR(-ENOMEM); | |
2141 | goto out_iput; | |
2142 | } | |
2143 | ||
2144 | return __d_instantiate_anon(tmp, inode, disconnected); | |
2145 | ||
2146 | out_iput: | |
2147 | iput(inode); | |
2148 | return res; | |
2149 | } | |
2150 | ||
1a0a397e BF |
2151 | /** |
2152 | * d_obtain_alias - find or allocate a DISCONNECTED dentry for a given inode | |
2153 | * @inode: inode to allocate the dentry for | |
2154 | * | |
2155 | * Obtain a dentry for an inode resulting from NFS filehandle conversion or | |
2156 | * similar open by handle operations. The returned dentry may be anonymous, | |
2157 | * or may have a full name (if the inode was already in the cache). | |
2158 | * | |
2159 | * When called on a directory inode, we must ensure that the inode only ever | |
2160 | * has one dentry. If a dentry is found, that is returned instead of | |
2161 | * allocating a new one. | |
2162 | * | |
2163 | * On successful return, the reference to the inode has been transferred | |
2164 | * to the dentry. In case of an error the reference on the inode is released. | |
2165 | * To make it easier to use in export operations a %NULL or IS_ERR inode may | |
2166 | * be passed in and the error will be propagated to the return value, | |
2167 | * with a %NULL @inode replaced by ERR_PTR(-ESTALE). | |
2168 | */ | |
2169 | struct dentry *d_obtain_alias(struct inode *inode) | |
2170 | { | |
f9c34674 | 2171 | return __d_obtain_alias(inode, true); |
1a0a397e | 2172 | } |
adc48720 | 2173 | EXPORT_SYMBOL(d_obtain_alias); |
1da177e4 | 2174 | |
1a0a397e BF |
2175 | /** |
2176 | * d_obtain_root - find or allocate a dentry for a given inode | |
2177 | * @inode: inode to allocate the dentry for | |
2178 | * | |
2179 | * Obtain an IS_ROOT dentry for the root of a filesystem. | |
2180 | * | |
2181 | * We must ensure that directory inodes only ever have one dentry. If a | |
2182 | * dentry is found, that is returned instead of allocating a new one. | |
2183 | * | |
2184 | * On successful return, the reference to the inode has been transferred | |
2185 | * to the dentry. In case of an error the reference on the inode is | |
2186 | * released. A %NULL or IS_ERR inode may be passed in and will be the | |
2187 | * error will be propagate to the return value, with a %NULL @inode | |
2188 | * replaced by ERR_PTR(-ESTALE). | |
2189 | */ | |
2190 | struct dentry *d_obtain_root(struct inode *inode) | |
2191 | { | |
f9c34674 | 2192 | return __d_obtain_alias(inode, false); |
1a0a397e BF |
2193 | } |
2194 | EXPORT_SYMBOL(d_obtain_root); | |
2195 | ||
9403540c BN |
2196 | /** |
2197 | * d_add_ci - lookup or allocate new dentry with case-exact name | |
2198 | * @inode: the inode case-insensitive lookup has found | |
2199 | * @dentry: the negative dentry that was passed to the parent's lookup func | |
2200 | * @name: the case-exact name to be associated with the returned dentry | |
2201 | * | |
2202 | * This is to avoid filling the dcache with case-insensitive names to the | |
2203 | * same inode, only the actual correct case is stored in the dcache for | |
2204 | * case-insensitive filesystems. | |
2205 | * | |
3d742d4b RD |
2206 | * For a case-insensitive lookup match and if the case-exact dentry |
2207 | * already exists in the dcache, use it and return it. | |
9403540c BN |
2208 | * |
2209 | * If no entry exists with the exact case name, allocate new dentry with | |
2210 | * the exact case, and return the spliced entry. | |
2211 | */ | |
e45b590b | 2212 | struct dentry *d_add_ci(struct dentry *dentry, struct inode *inode, |
9403540c BN |
2213 | struct qstr *name) |
2214 | { | |
d9171b93 | 2215 | struct dentry *found, *res; |
9403540c | 2216 | |
b6520c81 CH |
2217 | /* |
2218 | * First check if a dentry matching the name already exists, | |
2219 | * if not go ahead and create it now. | |
2220 | */ | |
9403540c | 2221 | found = d_hash_and_lookup(dentry->d_parent, name); |
d9171b93 AV |
2222 | if (found) { |
2223 | iput(inode); | |
2224 | return found; | |
2225 | } | |
2226 | if (d_in_lookup(dentry)) { | |
2227 | found = d_alloc_parallel(dentry->d_parent, name, | |
2228 | dentry->d_wait); | |
2229 | if (IS_ERR(found) || !d_in_lookup(found)) { | |
2230 | iput(inode); | |
2231 | return found; | |
9403540c | 2232 | } |
d9171b93 AV |
2233 | } else { |
2234 | found = d_alloc(dentry->d_parent, name); | |
2235 | if (!found) { | |
2236 | iput(inode); | |
2237 | return ERR_PTR(-ENOMEM); | |
2238 | } | |
2239 | } | |
2240 | res = d_splice_alias(inode, found); | |
2241 | if (res) { | |
40a3cb0d | 2242 | d_lookup_done(found); |
d9171b93 AV |
2243 | dput(found); |
2244 | return res; | |
9403540c | 2245 | } |
4f522a24 | 2246 | return found; |
9403540c | 2247 | } |
ec4f8605 | 2248 | EXPORT_SYMBOL(d_add_ci); |
1da177e4 | 2249 | |
4f48d5da XL |
2250 | /** |
2251 | * d_same_name - compare dentry name with case-exact name | |
2252 | * @parent: parent dentry | |
2253 | * @dentry: the negative dentry that was passed to the parent's lookup func | |
2254 | * @name: the case-exact name to be associated with the returned dentry | |
2255 | * | |
2256 | * Return: true if names are same, or false | |
2257 | */ | |
2258 | bool d_same_name(const struct dentry *dentry, const struct dentry *parent, | |
2259 | const struct qstr *name) | |
12f8ad4b | 2260 | { |
d4c91a8f AV |
2261 | if (likely(!(parent->d_flags & DCACHE_OP_COMPARE))) { |
2262 | if (dentry->d_name.len != name->len) | |
2263 | return false; | |
2264 | return dentry_cmp(dentry, name->name, name->len) == 0; | |
12f8ad4b | 2265 | } |
6fa67e70 | 2266 | return parent->d_op->d_compare(dentry, |
d4c91a8f AV |
2267 | dentry->d_name.len, dentry->d_name.name, |
2268 | name) == 0; | |
12f8ad4b | 2269 | } |
4f48d5da | 2270 | EXPORT_SYMBOL_GPL(d_same_name); |
12f8ad4b | 2271 | |
ae2a8236 LT |
2272 | /* |
2273 | * This is __d_lookup_rcu() when the parent dentry has | |
2274 | * DCACHE_OP_COMPARE, which makes things much nastier. | |
2275 | */ | |
2276 | static noinline struct dentry *__d_lookup_rcu_op_compare( | |
2277 | const struct dentry *parent, | |
2278 | const struct qstr *name, | |
2279 | unsigned *seqp) | |
2280 | { | |
2281 | u64 hashlen = name->hash_len; | |
2282 | struct hlist_bl_head *b = d_hash(hashlen_hash(hashlen)); | |
2283 | struct hlist_bl_node *node; | |
2284 | struct dentry *dentry; | |
2285 | ||
2286 | hlist_bl_for_each_entry_rcu(dentry, node, b, d_hash) { | |
2287 | int tlen; | |
2288 | const char *tname; | |
2289 | unsigned seq; | |
2290 | ||
2291 | seqretry: | |
2292 | seq = raw_seqcount_begin(&dentry->d_seq); | |
2293 | if (dentry->d_parent != parent) | |
2294 | continue; | |
2295 | if (d_unhashed(dentry)) | |
2296 | continue; | |
2297 | if (dentry->d_name.hash != hashlen_hash(hashlen)) | |
2298 | continue; | |
2299 | tlen = dentry->d_name.len; | |
2300 | tname = dentry->d_name.name; | |
2301 | /* we want a consistent (name,len) pair */ | |
2302 | if (read_seqcount_retry(&dentry->d_seq, seq)) { | |
2303 | cpu_relax(); | |
2304 | goto seqretry; | |
2305 | } | |
2306 | if (parent->d_op->d_compare(dentry, tlen, tname, name) != 0) | |
2307 | continue; | |
2308 | *seqp = seq; | |
2309 | return dentry; | |
2310 | } | |
2311 | return NULL; | |
2312 | } | |
2313 | ||
31e6b01f NP |
2314 | /** |
2315 | * __d_lookup_rcu - search for a dentry (racy, store-free) | |
2316 | * @parent: parent dentry | |
2317 | * @name: qstr of name we wish to find | |
1f1e6e52 | 2318 | * @seqp: returns d_seq value at the point where the dentry was found |
31e6b01f NP |
2319 | * Returns: dentry, or NULL |
2320 | * | |
2321 | * __d_lookup_rcu is the dcache lookup function for rcu-walk name | |
2322 | * resolution (store-free path walking) design described in | |
2323 | * Documentation/filesystems/path-lookup.txt. | |
2324 | * | |
2325 | * This is not to be used outside core vfs. | |
2326 | * | |
2327 | * __d_lookup_rcu must only be used in rcu-walk mode, ie. with vfsmount lock | |
2328 | * held, and rcu_read_lock held. The returned dentry must not be stored into | |
2329 | * without taking d_lock and checking d_seq sequence count against @seq | |
2330 | * returned here. | |
2331 | * | |
15570086 | 2332 | * A refcount may be taken on the found dentry with the d_rcu_to_refcount |
31e6b01f NP |
2333 | * function. |
2334 | * | |
2335 | * Alternatively, __d_lookup_rcu may be called again to look up the child of | |
2336 | * the returned dentry, so long as its parent's seqlock is checked after the | |
2337 | * child is looked up. Thus, an interlocking stepping of sequence lock checks | |
2338 | * is formed, giving integrity down the path walk. | |
12f8ad4b LT |
2339 | * |
2340 | * NOTE! The caller *has* to check the resulting dentry against the sequence | |
2341 | * number we've returned before using any of the resulting dentry state! | |
31e6b01f | 2342 | */ |
8966be90 LT |
2343 | struct dentry *__d_lookup_rcu(const struct dentry *parent, |
2344 | const struct qstr *name, | |
da53be12 | 2345 | unsigned *seqp) |
31e6b01f | 2346 | { |
26fe5750 | 2347 | u64 hashlen = name->hash_len; |
31e6b01f | 2348 | const unsigned char *str = name->name; |
8387ff25 | 2349 | struct hlist_bl_head *b = d_hash(hashlen_hash(hashlen)); |
ceb5bdc2 | 2350 | struct hlist_bl_node *node; |
31e6b01f NP |
2351 | struct dentry *dentry; |
2352 | ||
2353 | /* | |
2354 | * Note: There is significant duplication with __d_lookup_rcu which is | |
2355 | * required to prevent single threaded performance regressions | |
2356 | * especially on architectures where smp_rmb (in seqcounts) are costly. | |
2357 | * Keep the two functions in sync. | |
2358 | */ | |
2359 | ||
ae2a8236 LT |
2360 | if (unlikely(parent->d_flags & DCACHE_OP_COMPARE)) |
2361 | return __d_lookup_rcu_op_compare(parent, name, seqp); | |
2362 | ||
31e6b01f NP |
2363 | /* |
2364 | * The hash list is protected using RCU. | |
2365 | * | |
2366 | * Carefully use d_seq when comparing a candidate dentry, to avoid | |
2367 | * races with d_move(). | |
2368 | * | |
2369 | * It is possible that concurrent renames can mess up our list | |
2370 | * walk here and result in missing our dentry, resulting in the | |
2371 | * false-negative result. d_lookup() protects against concurrent | |
2372 | * renames using rename_lock seqlock. | |
2373 | * | |
b0a4bb83 | 2374 | * See Documentation/filesystems/path-lookup.txt for more details. |
31e6b01f | 2375 | */ |
b07ad996 | 2376 | hlist_bl_for_each_entry_rcu(dentry, node, b, d_hash) { |
8966be90 | 2377 | unsigned seq; |
31e6b01f | 2378 | |
12f8ad4b LT |
2379 | /* |
2380 | * The dentry sequence count protects us from concurrent | |
da53be12 | 2381 | * renames, and thus protects parent and name fields. |
12f8ad4b LT |
2382 | * |
2383 | * The caller must perform a seqcount check in order | |
da53be12 | 2384 | * to do anything useful with the returned dentry. |
12f8ad4b LT |
2385 | * |
2386 | * NOTE! We do a "raw" seqcount_begin here. That means that | |
2387 | * we don't wait for the sequence count to stabilize if it | |
2388 | * is in the middle of a sequence change. If we do the slow | |
2389 | * dentry compare, we will do seqretries until it is stable, | |
2390 | * and if we end up with a successful lookup, we actually | |
2391 | * want to exit RCU lookup anyway. | |
d4c91a8f AV |
2392 | * |
2393 | * Note that raw_seqcount_begin still *does* smp_rmb(), so | |
2394 | * we are still guaranteed NUL-termination of ->d_name.name. | |
12f8ad4b LT |
2395 | */ |
2396 | seq = raw_seqcount_begin(&dentry->d_seq); | |
31e6b01f NP |
2397 | if (dentry->d_parent != parent) |
2398 | continue; | |
2e321806 LT |
2399 | if (d_unhashed(dentry)) |
2400 | continue; | |
ae2a8236 LT |
2401 | if (dentry->d_name.hash_len != hashlen) |
2402 | continue; | |
2403 | if (dentry_cmp(dentry, str, hashlen_len(hashlen)) != 0) | |
2404 | continue; | |
da53be12 | 2405 | *seqp = seq; |
d4c91a8f | 2406 | return dentry; |
31e6b01f NP |
2407 | } |
2408 | return NULL; | |
2409 | } | |
2410 | ||
1da177e4 LT |
2411 | /** |
2412 | * d_lookup - search for a dentry | |
2413 | * @parent: parent dentry | |
2414 | * @name: qstr of name we wish to find | |
b04f784e | 2415 | * Returns: dentry, or NULL |
1da177e4 | 2416 | * |
b04f784e NP |
2417 | * d_lookup searches the children of the parent dentry for the name in |
2418 | * question. If the dentry is found its reference count is incremented and the | |
2419 | * dentry is returned. The caller must use dput to free the entry when it has | |
2420 | * finished using it. %NULL is returned if the dentry does not exist. | |
1da177e4 | 2421 | */ |
da2d8455 | 2422 | struct dentry *d_lookup(const struct dentry *parent, const struct qstr *name) |
1da177e4 | 2423 | { |
31e6b01f | 2424 | struct dentry *dentry; |
949854d0 | 2425 | unsigned seq; |
1da177e4 | 2426 | |
b8314f93 DY |
2427 | do { |
2428 | seq = read_seqbegin(&rename_lock); | |
2429 | dentry = __d_lookup(parent, name); | |
2430 | if (dentry) | |
1da177e4 LT |
2431 | break; |
2432 | } while (read_seqretry(&rename_lock, seq)); | |
2433 | return dentry; | |
2434 | } | |
ec4f8605 | 2435 | EXPORT_SYMBOL(d_lookup); |
1da177e4 | 2436 | |
31e6b01f | 2437 | /** |
b04f784e NP |
2438 | * __d_lookup - search for a dentry (racy) |
2439 | * @parent: parent dentry | |
2440 | * @name: qstr of name we wish to find | |
2441 | * Returns: dentry, or NULL | |
2442 | * | |
2443 | * __d_lookup is like d_lookup, however it may (rarely) return a | |
2444 | * false-negative result due to unrelated rename activity. | |
2445 | * | |
2446 | * __d_lookup is slightly faster by avoiding rename_lock read seqlock, | |
2447 | * however it must be used carefully, eg. with a following d_lookup in | |
2448 | * the case of failure. | |
2449 | * | |
2450 | * __d_lookup callers must be commented. | |
2451 | */ | |
a713ca2a | 2452 | struct dentry *__d_lookup(const struct dentry *parent, const struct qstr *name) |
1da177e4 | 2453 | { |
1da177e4 | 2454 | unsigned int hash = name->hash; |
8387ff25 | 2455 | struct hlist_bl_head *b = d_hash(hash); |
ceb5bdc2 | 2456 | struct hlist_bl_node *node; |
31e6b01f | 2457 | struct dentry *found = NULL; |
665a7583 | 2458 | struct dentry *dentry; |
1da177e4 | 2459 | |
31e6b01f NP |
2460 | /* |
2461 | * Note: There is significant duplication with __d_lookup_rcu which is | |
2462 | * required to prevent single threaded performance regressions | |
2463 | * especially on architectures where smp_rmb (in seqcounts) are costly. | |
2464 | * Keep the two functions in sync. | |
2465 | */ | |
2466 | ||
b04f784e NP |
2467 | /* |
2468 | * The hash list is protected using RCU. | |
2469 | * | |
2470 | * Take d_lock when comparing a candidate dentry, to avoid races | |
2471 | * with d_move(). | |
2472 | * | |
2473 | * It is possible that concurrent renames can mess up our list | |
2474 | * walk here and result in missing our dentry, resulting in the | |
2475 | * false-negative result. d_lookup() protects against concurrent | |
2476 | * renames using rename_lock seqlock. | |
2477 | * | |
b0a4bb83 | 2478 | * See Documentation/filesystems/path-lookup.txt for more details. |
b04f784e | 2479 | */ |
1da177e4 LT |
2480 | rcu_read_lock(); |
2481 | ||
b07ad996 | 2482 | hlist_bl_for_each_entry_rcu(dentry, node, b, d_hash) { |
1da177e4 | 2483 | |
1da177e4 LT |
2484 | if (dentry->d_name.hash != hash) |
2485 | continue; | |
1da177e4 LT |
2486 | |
2487 | spin_lock(&dentry->d_lock); | |
1da177e4 LT |
2488 | if (dentry->d_parent != parent) |
2489 | goto next; | |
d0185c08 LT |
2490 | if (d_unhashed(dentry)) |
2491 | goto next; | |
2492 | ||
d4c91a8f AV |
2493 | if (!d_same_name(dentry, parent, name)) |
2494 | goto next; | |
1da177e4 | 2495 | |
98474236 | 2496 | dentry->d_lockref.count++; |
d0185c08 | 2497 | found = dentry; |
1da177e4 LT |
2498 | spin_unlock(&dentry->d_lock); |
2499 | break; | |
2500 | next: | |
2501 | spin_unlock(&dentry->d_lock); | |
2502 | } | |
2503 | rcu_read_unlock(); | |
2504 | ||
2505 | return found; | |
2506 | } | |
2507 | ||
3e7e241f EB |
2508 | /** |
2509 | * d_hash_and_lookup - hash the qstr then search for a dentry | |
2510 | * @dir: Directory to search in | |
2511 | * @name: qstr of name we wish to find | |
2512 | * | |
4f522a24 | 2513 | * On lookup failure NULL is returned; on bad name - ERR_PTR(-error) |
3e7e241f EB |
2514 | */ |
2515 | struct dentry *d_hash_and_lookup(struct dentry *dir, struct qstr *name) | |
2516 | { | |
3e7e241f EB |
2517 | /* |
2518 | * Check for a fs-specific hash function. Note that we must | |
2519 | * calculate the standard hash first, as the d_op->d_hash() | |
2520 | * routine may choose to leave the hash value unchanged. | |
2521 | */ | |
8387ff25 | 2522 | name->hash = full_name_hash(dir, name->name, name->len); |
fb045adb | 2523 | if (dir->d_flags & DCACHE_OP_HASH) { |
da53be12 | 2524 | int err = dir->d_op->d_hash(dir, name); |
4f522a24 AV |
2525 | if (unlikely(err < 0)) |
2526 | return ERR_PTR(err); | |
3e7e241f | 2527 | } |
4f522a24 | 2528 | return d_lookup(dir, name); |
3e7e241f | 2529 | } |
4f522a24 | 2530 | EXPORT_SYMBOL(d_hash_and_lookup); |
3e7e241f | 2531 | |
1da177e4 LT |
2532 | /* |
2533 | * When a file is deleted, we have two options: | |
2534 | * - turn this dentry into a negative dentry | |
2535 | * - unhash this dentry and free it. | |
2536 | * | |
2537 | * Usually, we want to just turn this into | |
2538 | * a negative dentry, but if anybody else is | |
2539 | * currently using the dentry or the inode | |
2540 | * we can't do that and we fall back on removing | |
2541 | * it from the hash queues and waiting for | |
2542 | * it to be deleted later when it has no users | |
2543 | */ | |
2544 | ||
2545 | /** | |
2546 | * d_delete - delete a dentry | |
2547 | * @dentry: The dentry to delete | |
2548 | * | |
2549 | * Turn the dentry into a negative dentry if possible, otherwise | |
2550 | * remove it from the hash queues so it can be deleted later | |
2551 | */ | |
2552 | ||
2553 | void d_delete(struct dentry * dentry) | |
2554 | { | |
c19457f0 | 2555 | struct inode *inode = dentry->d_inode; |
c19457f0 AV |
2556 | |
2557 | spin_lock(&inode->i_lock); | |
2558 | spin_lock(&dentry->d_lock); | |
1da177e4 LT |
2559 | /* |
2560 | * Are we the only user? | |
2561 | */ | |
98474236 | 2562 | if (dentry->d_lockref.count == 1) { |
13e3c5e5 | 2563 | dentry->d_flags &= ~DCACHE_CANT_MOUNT; |
31e6b01f | 2564 | dentry_unlink_inode(dentry); |
c19457f0 | 2565 | } else { |
1da177e4 | 2566 | __d_drop(dentry); |
c19457f0 AV |
2567 | spin_unlock(&dentry->d_lock); |
2568 | spin_unlock(&inode->i_lock); | |
2569 | } | |
1da177e4 | 2570 | } |
ec4f8605 | 2571 | EXPORT_SYMBOL(d_delete); |
1da177e4 | 2572 | |
15d3c589 | 2573 | static void __d_rehash(struct dentry *entry) |
1da177e4 | 2574 | { |
15d3c589 | 2575 | struct hlist_bl_head *b = d_hash(entry->d_name.hash); |
61647823 | 2576 | |
1879fd6a | 2577 | hlist_bl_lock(b); |
b07ad996 | 2578 | hlist_bl_add_head_rcu(&entry->d_hash, b); |
1879fd6a | 2579 | hlist_bl_unlock(b); |
1da177e4 LT |
2580 | } |
2581 | ||
2582 | /** | |
2583 | * d_rehash - add an entry back to the hash | |
2584 | * @entry: dentry to add to the hash | |
2585 | * | |
2586 | * Adds a dentry to the hash according to its name. | |
2587 | */ | |
2588 | ||
2589 | void d_rehash(struct dentry * entry) | |
2590 | { | |
1da177e4 | 2591 | spin_lock(&entry->d_lock); |
15d3c589 | 2592 | __d_rehash(entry); |
1da177e4 | 2593 | spin_unlock(&entry->d_lock); |
1da177e4 | 2594 | } |
ec4f8605 | 2595 | EXPORT_SYMBOL(d_rehash); |
1da177e4 | 2596 | |
84e710da AV |
2597 | static inline unsigned start_dir_add(struct inode *dir) |
2598 | { | |
93f6d4e1 | 2599 | preempt_disable_nested(); |
84e710da AV |
2600 | for (;;) { |
2601 | unsigned n = dir->i_dir_seq; | |
2602 | if (!(n & 1) && cmpxchg(&dir->i_dir_seq, n, n + 1) == n) | |
2603 | return n; | |
2604 | cpu_relax(); | |
2605 | } | |
2606 | } | |
2607 | ||
50417d22 SAS |
2608 | static inline void end_dir_add(struct inode *dir, unsigned int n, |
2609 | wait_queue_head_t *d_wait) | |
84e710da AV |
2610 | { |
2611 | smp_store_release(&dir->i_dir_seq, n + 2); | |
93f6d4e1 | 2612 | preempt_enable_nested(); |
50417d22 | 2613 | wake_up_all(d_wait); |
84e710da AV |
2614 | } |
2615 | ||
d9171b93 AV |
2616 | static void d_wait_lookup(struct dentry *dentry) |
2617 | { | |
2618 | if (d_in_lookup(dentry)) { | |
2619 | DECLARE_WAITQUEUE(wait, current); | |
2620 | add_wait_queue(dentry->d_wait, &wait); | |
2621 | do { | |
2622 | set_current_state(TASK_UNINTERRUPTIBLE); | |
2623 | spin_unlock(&dentry->d_lock); | |
2624 | schedule(); | |
2625 | spin_lock(&dentry->d_lock); | |
2626 | } while (d_in_lookup(dentry)); | |
2627 | } | |
2628 | } | |
2629 | ||
94bdd655 | 2630 | struct dentry *d_alloc_parallel(struct dentry *parent, |
d9171b93 AV |
2631 | const struct qstr *name, |
2632 | wait_queue_head_t *wq) | |
94bdd655 | 2633 | { |
94bdd655 | 2634 | unsigned int hash = name->hash; |
94bdd655 AV |
2635 | struct hlist_bl_head *b = in_lookup_hash(parent, hash); |
2636 | struct hlist_bl_node *node; | |
2637 | struct dentry *new = d_alloc(parent, name); | |
2638 | struct dentry *dentry; | |
2639 | unsigned seq, r_seq, d_seq; | |
2640 | ||
2641 | if (unlikely(!new)) | |
2642 | return ERR_PTR(-ENOMEM); | |
2643 | ||
2644 | retry: | |
2645 | rcu_read_lock(); | |
015555fd | 2646 | seq = smp_load_acquire(&parent->d_inode->i_dir_seq); |
94bdd655 AV |
2647 | r_seq = read_seqbegin(&rename_lock); |
2648 | dentry = __d_lookup_rcu(parent, name, &d_seq); | |
2649 | if (unlikely(dentry)) { | |
2650 | if (!lockref_get_not_dead(&dentry->d_lockref)) { | |
2651 | rcu_read_unlock(); | |
2652 | goto retry; | |
2653 | } | |
2654 | if (read_seqcount_retry(&dentry->d_seq, d_seq)) { | |
2655 | rcu_read_unlock(); | |
2656 | dput(dentry); | |
2657 | goto retry; | |
2658 | } | |
2659 | rcu_read_unlock(); | |
2660 | dput(new); | |
2661 | return dentry; | |
2662 | } | |
2663 | if (unlikely(read_seqretry(&rename_lock, r_seq))) { | |
2664 | rcu_read_unlock(); | |
2665 | goto retry; | |
2666 | } | |
015555fd WD |
2667 | |
2668 | if (unlikely(seq & 1)) { | |
2669 | rcu_read_unlock(); | |
2670 | goto retry; | |
2671 | } | |
2672 | ||
94bdd655 | 2673 | hlist_bl_lock(b); |
8cc07c80 | 2674 | if (unlikely(READ_ONCE(parent->d_inode->i_dir_seq) != seq)) { |
94bdd655 AV |
2675 | hlist_bl_unlock(b); |
2676 | rcu_read_unlock(); | |
2677 | goto retry; | |
2678 | } | |
94bdd655 AV |
2679 | /* |
2680 | * No changes for the parent since the beginning of d_lookup(). | |
2681 | * Since all removals from the chain happen with hlist_bl_lock(), | |
2682 | * any potential in-lookup matches are going to stay here until | |
2683 | * we unlock the chain. All fields are stable in everything | |
2684 | * we encounter. | |
2685 | */ | |
2686 | hlist_bl_for_each_entry(dentry, node, b, d_u.d_in_lookup_hash) { | |
2687 | if (dentry->d_name.hash != hash) | |
2688 | continue; | |
2689 | if (dentry->d_parent != parent) | |
2690 | continue; | |
d4c91a8f AV |
2691 | if (!d_same_name(dentry, parent, name)) |
2692 | continue; | |
94bdd655 | 2693 | hlist_bl_unlock(b); |
e7d6ef97 AV |
2694 | /* now we can try to grab a reference */ |
2695 | if (!lockref_get_not_dead(&dentry->d_lockref)) { | |
2696 | rcu_read_unlock(); | |
2697 | goto retry; | |
2698 | } | |
2699 | ||
2700 | rcu_read_unlock(); | |
2701 | /* | |
2702 | * somebody is likely to be still doing lookup for it; | |
2703 | * wait for them to finish | |
2704 | */ | |
d9171b93 AV |
2705 | spin_lock(&dentry->d_lock); |
2706 | d_wait_lookup(dentry); | |
2707 | /* | |
2708 | * it's not in-lookup anymore; in principle we should repeat | |
2709 | * everything from dcache lookup, but it's likely to be what | |
2710 | * d_lookup() would've found anyway. If it is, just return it; | |
2711 | * otherwise we really have to repeat the whole thing. | |
2712 | */ | |
2713 | if (unlikely(dentry->d_name.hash != hash)) | |
2714 | goto mismatch; | |
2715 | if (unlikely(dentry->d_parent != parent)) | |
2716 | goto mismatch; | |
2717 | if (unlikely(d_unhashed(dentry))) | |
2718 | goto mismatch; | |
d4c91a8f AV |
2719 | if (unlikely(!d_same_name(dentry, parent, name))) |
2720 | goto mismatch; | |
d9171b93 AV |
2721 | /* OK, it *is* a hashed match; return it */ |
2722 | spin_unlock(&dentry->d_lock); | |
94bdd655 AV |
2723 | dput(new); |
2724 | return dentry; | |
2725 | } | |
e7d6ef97 | 2726 | rcu_read_unlock(); |
94bdd655 AV |
2727 | /* we can't take ->d_lock here; it's OK, though. */ |
2728 | new->d_flags |= DCACHE_PAR_LOOKUP; | |
d9171b93 | 2729 | new->d_wait = wq; |
94bdd655 AV |
2730 | hlist_bl_add_head_rcu(&new->d_u.d_in_lookup_hash, b); |
2731 | hlist_bl_unlock(b); | |
2732 | return new; | |
d9171b93 AV |
2733 | mismatch: |
2734 | spin_unlock(&dentry->d_lock); | |
2735 | dput(dentry); | |
2736 | goto retry; | |
94bdd655 AV |
2737 | } |
2738 | EXPORT_SYMBOL(d_alloc_parallel); | |
2739 | ||
45f78b0a SAS |
2740 | /* |
2741 | * - Unhash the dentry | |
2742 | * - Retrieve and clear the waitqueue head in dentry | |
2743 | * - Return the waitqueue head | |
2744 | */ | |
2745 | static wait_queue_head_t *__d_lookup_unhash(struct dentry *dentry) | |
85c7f810 | 2746 | { |
45f78b0a SAS |
2747 | wait_queue_head_t *d_wait; |
2748 | struct hlist_bl_head *b; | |
2749 | ||
2750 | lockdep_assert_held(&dentry->d_lock); | |
2751 | ||
2752 | b = in_lookup_hash(dentry->d_parent, dentry->d_name.hash); | |
94bdd655 | 2753 | hlist_bl_lock(b); |
85c7f810 | 2754 | dentry->d_flags &= ~DCACHE_PAR_LOOKUP; |
94bdd655 | 2755 | __hlist_bl_del(&dentry->d_u.d_in_lookup_hash); |
45f78b0a | 2756 | d_wait = dentry->d_wait; |
d9171b93 | 2757 | dentry->d_wait = NULL; |
94bdd655 AV |
2758 | hlist_bl_unlock(b); |
2759 | INIT_HLIST_NODE(&dentry->d_u.d_alias); | |
d9171b93 | 2760 | INIT_LIST_HEAD(&dentry->d_lru); |
45f78b0a SAS |
2761 | return d_wait; |
2762 | } | |
2763 | ||
2764 | void __d_lookup_unhash_wake(struct dentry *dentry) | |
2765 | { | |
2766 | spin_lock(&dentry->d_lock); | |
2767 | wake_up_all(__d_lookup_unhash(dentry)); | |
2768 | spin_unlock(&dentry->d_lock); | |
85c7f810 | 2769 | } |
45f78b0a | 2770 | EXPORT_SYMBOL(__d_lookup_unhash_wake); |
ed782b5a AV |
2771 | |
2772 | /* inode->i_lock held if inode is non-NULL */ | |
2773 | ||
2774 | static inline void __d_add(struct dentry *dentry, struct inode *inode) | |
2775 | { | |
45f78b0a | 2776 | wait_queue_head_t *d_wait; |
84e710da AV |
2777 | struct inode *dir = NULL; |
2778 | unsigned n; | |
0568d705 | 2779 | spin_lock(&dentry->d_lock); |
84e710da AV |
2780 | if (unlikely(d_in_lookup(dentry))) { |
2781 | dir = dentry->d_parent->d_inode; | |
2782 | n = start_dir_add(dir); | |
45f78b0a | 2783 | d_wait = __d_lookup_unhash(dentry); |
84e710da | 2784 | } |
ed782b5a | 2785 | if (inode) { |
0568d705 AV |
2786 | unsigned add_flags = d_flags_for_inode(inode); |
2787 | hlist_add_head(&dentry->d_u.d_alias, &inode->i_dentry); | |
2788 | raw_write_seqcount_begin(&dentry->d_seq); | |
2789 | __d_set_inode_and_type(dentry, inode, add_flags); | |
2790 | raw_write_seqcount_end(&dentry->d_seq); | |
affda484 | 2791 | fsnotify_update_flags(dentry); |
ed782b5a | 2792 | } |
15d3c589 | 2793 | __d_rehash(dentry); |
84e710da | 2794 | if (dir) |
50417d22 | 2795 | end_dir_add(dir, n, d_wait); |
0568d705 AV |
2796 | spin_unlock(&dentry->d_lock); |
2797 | if (inode) | |
2798 | spin_unlock(&inode->i_lock); | |
ed782b5a AV |
2799 | } |
2800 | ||
34d0d19d AV |
2801 | /** |
2802 | * d_add - add dentry to hash queues | |
2803 | * @entry: dentry to add | |
2804 | * @inode: The inode to attach to this dentry | |
2805 | * | |
2806 | * This adds the entry to the hash queues and initializes @inode. | |
2807 | * The entry was actually filled in earlier during d_alloc(). | |
2808 | */ | |
2809 | ||
2810 | void d_add(struct dentry *entry, struct inode *inode) | |
2811 | { | |
b9680917 AV |
2812 | if (inode) { |
2813 | security_d_instantiate(entry, inode); | |
ed782b5a | 2814 | spin_lock(&inode->i_lock); |
b9680917 | 2815 | } |
ed782b5a | 2816 | __d_add(entry, inode); |
34d0d19d AV |
2817 | } |
2818 | EXPORT_SYMBOL(d_add); | |
2819 | ||
668d0cd5 AV |
2820 | /** |
2821 | * d_exact_alias - find and hash an exact unhashed alias | |
2822 | * @entry: dentry to add | |
2823 | * @inode: The inode to go with this dentry | |
2824 | * | |
2825 | * If an unhashed dentry with the same name/parent and desired | |
2826 | * inode already exists, hash and return it. Otherwise, return | |
2827 | * NULL. | |
2828 | * | |
2829 | * Parent directory should be locked. | |
2830 | */ | |
2831 | struct dentry *d_exact_alias(struct dentry *entry, struct inode *inode) | |
2832 | { | |
2833 | struct dentry *alias; | |
668d0cd5 AV |
2834 | unsigned int hash = entry->d_name.hash; |
2835 | ||
2836 | spin_lock(&inode->i_lock); | |
2837 | hlist_for_each_entry(alias, &inode->i_dentry, d_u.d_alias) { | |
2838 | /* | |
2839 | * Don't need alias->d_lock here, because aliases with | |
2840 | * d_parent == entry->d_parent are not subject to name or | |
2841 | * parent changes, because the parent inode i_mutex is held. | |
2842 | */ | |
2843 | if (alias->d_name.hash != hash) | |
2844 | continue; | |
2845 | if (alias->d_parent != entry->d_parent) | |
2846 | continue; | |
d4c91a8f | 2847 | if (!d_same_name(alias, entry->d_parent, &entry->d_name)) |
668d0cd5 AV |
2848 | continue; |
2849 | spin_lock(&alias->d_lock); | |
2850 | if (!d_unhashed(alias)) { | |
2851 | spin_unlock(&alias->d_lock); | |
2852 | alias = NULL; | |
2853 | } else { | |
2854 | __dget_dlock(alias); | |
15d3c589 | 2855 | __d_rehash(alias); |
668d0cd5 AV |
2856 | spin_unlock(&alias->d_lock); |
2857 | } | |
2858 | spin_unlock(&inode->i_lock); | |
2859 | return alias; | |
2860 | } | |
2861 | spin_unlock(&inode->i_lock); | |
2862 | return NULL; | |
2863 | } | |
2864 | EXPORT_SYMBOL(d_exact_alias); | |
2865 | ||
8d85b484 | 2866 | static void swap_names(struct dentry *dentry, struct dentry *target) |
1da177e4 | 2867 | { |
8d85b484 AV |
2868 | if (unlikely(dname_external(target))) { |
2869 | if (unlikely(dname_external(dentry))) { | |
1da177e4 LT |
2870 | /* |
2871 | * Both external: swap the pointers | |
2872 | */ | |
9a8d5bb4 | 2873 | swap(target->d_name.name, dentry->d_name.name); |
1da177e4 LT |
2874 | } else { |
2875 | /* | |
2876 | * dentry:internal, target:external. Steal target's | |
2877 | * storage and make target internal. | |
2878 | */ | |
321bcf92 BF |
2879 | memcpy(target->d_iname, dentry->d_name.name, |
2880 | dentry->d_name.len + 1); | |
1da177e4 LT |
2881 | dentry->d_name.name = target->d_name.name; |
2882 | target->d_name.name = target->d_iname; | |
2883 | } | |
2884 | } else { | |
8d85b484 | 2885 | if (unlikely(dname_external(dentry))) { |
1da177e4 LT |
2886 | /* |
2887 | * dentry:external, target:internal. Give dentry's | |
2888 | * storage to target and make dentry internal | |
2889 | */ | |
2890 | memcpy(dentry->d_iname, target->d_name.name, | |
2891 | target->d_name.len + 1); | |
2892 | target->d_name.name = dentry->d_name.name; | |
2893 | dentry->d_name.name = dentry->d_iname; | |
2894 | } else { | |
2895 | /* | |
da1ce067 | 2896 | * Both are internal. |
1da177e4 | 2897 | */ |
da1ce067 MS |
2898 | unsigned int i; |
2899 | BUILD_BUG_ON(!IS_ALIGNED(DNAME_INLINE_LEN, sizeof(long))); | |
2900 | for (i = 0; i < DNAME_INLINE_LEN / sizeof(long); i++) { | |
2901 | swap(((long *) &dentry->d_iname)[i], | |
2902 | ((long *) &target->d_iname)[i]); | |
2903 | } | |
1da177e4 LT |
2904 | } |
2905 | } | |
a28ddb87 | 2906 | swap(dentry->d_name.hash_len, target->d_name.hash_len); |
1da177e4 LT |
2907 | } |
2908 | ||
8d85b484 AV |
2909 | static void copy_name(struct dentry *dentry, struct dentry *target) |
2910 | { | |
2911 | struct external_name *old_name = NULL; | |
2912 | if (unlikely(dname_external(dentry))) | |
2913 | old_name = external_name(dentry); | |
2914 | if (unlikely(dname_external(target))) { | |
2915 | atomic_inc(&external_name(target)->u.count); | |
2916 | dentry->d_name = target->d_name; | |
2917 | } else { | |
2918 | memcpy(dentry->d_iname, target->d_name.name, | |
2919 | target->d_name.len + 1); | |
2920 | dentry->d_name.name = dentry->d_iname; | |
2921 | dentry->d_name.hash_len = target->d_name.hash_len; | |
2922 | } | |
2923 | if (old_name && likely(atomic_dec_and_test(&old_name->u.count))) | |
2e03b4bc | 2924 | kfree_rcu(old_name, u.head); |
8d85b484 AV |
2925 | } |
2926 | ||
9eaef27b | 2927 | /* |
18367501 | 2928 | * __d_move - move a dentry |
1da177e4 LT |
2929 | * @dentry: entry to move |
2930 | * @target: new dentry | |
da1ce067 | 2931 | * @exchange: exchange the two dentries |
1da177e4 LT |
2932 | * |
2933 | * Update the dcache to reflect the move of a file name. Negative | |
c46c8877 JL |
2934 | * dcache entries should not be moved in this way. Caller must hold |
2935 | * rename_lock, the i_mutex of the source and target directories, | |
2936 | * and the sb->s_vfs_rename_mutex if they differ. See lock_rename(). | |
1da177e4 | 2937 | */ |
da1ce067 MS |
2938 | static void __d_move(struct dentry *dentry, struct dentry *target, |
2939 | bool exchange) | |
1da177e4 | 2940 | { |
42177007 | 2941 | struct dentry *old_parent, *p; |
45f78b0a | 2942 | wait_queue_head_t *d_wait; |
84e710da AV |
2943 | struct inode *dir = NULL; |
2944 | unsigned n; | |
1da177e4 | 2945 | |
42177007 AV |
2946 | WARN_ON(!dentry->d_inode); |
2947 | if (WARN_ON(dentry == target)) | |
2948 | return; | |
2949 | ||
2fd6b7f5 | 2950 | BUG_ON(d_ancestor(target, dentry)); |
42177007 AV |
2951 | old_parent = dentry->d_parent; |
2952 | p = d_ancestor(old_parent, target); | |
2953 | if (IS_ROOT(dentry)) { | |
2954 | BUG_ON(p); | |
2955 | spin_lock(&target->d_parent->d_lock); | |
2956 | } else if (!p) { | |
2957 | /* target is not a descendent of dentry->d_parent */ | |
2958 | spin_lock(&target->d_parent->d_lock); | |
2959 | spin_lock_nested(&old_parent->d_lock, DENTRY_D_LOCK_NESTED); | |
2960 | } else { | |
2961 | BUG_ON(p == dentry); | |
2962 | spin_lock(&old_parent->d_lock); | |
2963 | if (p != target) | |
2964 | spin_lock_nested(&target->d_parent->d_lock, | |
2965 | DENTRY_D_LOCK_NESTED); | |
2966 | } | |
2967 | spin_lock_nested(&dentry->d_lock, 2); | |
2968 | spin_lock_nested(&target->d_lock, 3); | |
2fd6b7f5 | 2969 | |
84e710da AV |
2970 | if (unlikely(d_in_lookup(target))) { |
2971 | dir = target->d_parent->d_inode; | |
2972 | n = start_dir_add(dir); | |
45f78b0a | 2973 | d_wait = __d_lookup_unhash(target); |
84e710da | 2974 | } |
1da177e4 | 2975 | |
31e6b01f | 2976 | write_seqcount_begin(&dentry->d_seq); |
1ca7d67c | 2977 | write_seqcount_begin_nested(&target->d_seq, DENTRY_D_LOCK_NESTED); |
31e6b01f | 2978 | |
15d3c589 | 2979 | /* unhash both */ |
0632a9ac AV |
2980 | if (!d_unhashed(dentry)) |
2981 | ___d_drop(dentry); | |
2982 | if (!d_unhashed(target)) | |
2983 | ___d_drop(target); | |
1da177e4 | 2984 | |
076515fc AV |
2985 | /* ... and switch them in the tree */ |
2986 | dentry->d_parent = target->d_parent; | |
2987 | if (!exchange) { | |
8d85b484 | 2988 | copy_name(dentry, target); |
61647823 | 2989 | target->d_hash.pprev = NULL; |
076515fc | 2990 | dentry->d_parent->d_lockref.count++; |
5467a68c | 2991 | if (dentry != old_parent) /* wasn't IS_ROOT */ |
076515fc | 2992 | WARN_ON(!--old_parent->d_lockref.count); |
1da177e4 | 2993 | } else { |
076515fc AV |
2994 | target->d_parent = old_parent; |
2995 | swap_names(dentry, target); | |
946e51f2 | 2996 | list_move(&target->d_child, &target->d_parent->d_subdirs); |
076515fc AV |
2997 | __d_rehash(target); |
2998 | fsnotify_update_flags(target); | |
1da177e4 | 2999 | } |
076515fc AV |
3000 | list_move(&dentry->d_child, &dentry->d_parent->d_subdirs); |
3001 | __d_rehash(dentry); | |
3002 | fsnotify_update_flags(dentry); | |
0bf3d5c1 | 3003 | fscrypt_handle_d_move(dentry); |
1da177e4 | 3004 | |
31e6b01f NP |
3005 | write_seqcount_end(&target->d_seq); |
3006 | write_seqcount_end(&dentry->d_seq); | |
3007 | ||
84e710da | 3008 | if (dir) |
50417d22 | 3009 | end_dir_add(dir, n, d_wait); |
076515fc AV |
3010 | |
3011 | if (dentry->d_parent != old_parent) | |
3012 | spin_unlock(&dentry->d_parent->d_lock); | |
3013 | if (dentry != old_parent) | |
3014 | spin_unlock(&old_parent->d_lock); | |
3015 | spin_unlock(&target->d_lock); | |
3016 | spin_unlock(&dentry->d_lock); | |
18367501 AV |
3017 | } |
3018 | ||
3019 | /* | |
3020 | * d_move - move a dentry | |
3021 | * @dentry: entry to move | |
3022 | * @target: new dentry | |
3023 | * | |
3024 | * Update the dcache to reflect the move of a file name. Negative | |
c46c8877 JL |
3025 | * dcache entries should not be moved in this way. See the locking |
3026 | * requirements for __d_move. | |
18367501 AV |
3027 | */ |
3028 | void d_move(struct dentry *dentry, struct dentry *target) | |
3029 | { | |
3030 | write_seqlock(&rename_lock); | |
da1ce067 | 3031 | __d_move(dentry, target, false); |
1da177e4 | 3032 | write_sequnlock(&rename_lock); |
9eaef27b | 3033 | } |
ec4f8605 | 3034 | EXPORT_SYMBOL(d_move); |
1da177e4 | 3035 | |
da1ce067 MS |
3036 | /* |
3037 | * d_exchange - exchange two dentries | |
3038 | * @dentry1: first dentry | |
3039 | * @dentry2: second dentry | |
3040 | */ | |
3041 | void d_exchange(struct dentry *dentry1, struct dentry *dentry2) | |
3042 | { | |
3043 | write_seqlock(&rename_lock); | |
3044 | ||
3045 | WARN_ON(!dentry1->d_inode); | |
3046 | WARN_ON(!dentry2->d_inode); | |
3047 | WARN_ON(IS_ROOT(dentry1)); | |
3048 | WARN_ON(IS_ROOT(dentry2)); | |
3049 | ||
3050 | __d_move(dentry1, dentry2, true); | |
3051 | ||
3052 | write_sequnlock(&rename_lock); | |
3053 | } | |
3054 | ||
e2761a11 OH |
3055 | /** |
3056 | * d_ancestor - search for an ancestor | |
3057 | * @p1: ancestor dentry | |
3058 | * @p2: child dentry | |
3059 | * | |
3060 | * Returns the ancestor dentry of p2 which is a child of p1, if p1 is | |
3061 | * an ancestor of p2, else NULL. | |
9eaef27b | 3062 | */ |
e2761a11 | 3063 | struct dentry *d_ancestor(struct dentry *p1, struct dentry *p2) |
9eaef27b TM |
3064 | { |
3065 | struct dentry *p; | |
3066 | ||
871c0067 | 3067 | for (p = p2; !IS_ROOT(p); p = p->d_parent) { |
9eaef27b | 3068 | if (p->d_parent == p1) |
e2761a11 | 3069 | return p; |
9eaef27b | 3070 | } |
e2761a11 | 3071 | return NULL; |
9eaef27b TM |
3072 | } |
3073 | ||
3074 | /* | |
3075 | * This helper attempts to cope with remotely renamed directories | |
3076 | * | |
3077 | * It assumes that the caller is already holding | |
a03e283b | 3078 | * dentry->d_parent->d_inode->i_mutex, and rename_lock |
9eaef27b TM |
3079 | * |
3080 | * Note: If ever the locking in lock_rename() changes, then please | |
3081 | * remember to update this too... | |
9eaef27b | 3082 | */ |
b5ae6b15 | 3083 | static int __d_unalias(struct inode *inode, |
873feea0 | 3084 | struct dentry *dentry, struct dentry *alias) |
9eaef27b | 3085 | { |
9902af79 AV |
3086 | struct mutex *m1 = NULL; |
3087 | struct rw_semaphore *m2 = NULL; | |
3d330dc1 | 3088 | int ret = -ESTALE; |
9eaef27b TM |
3089 | |
3090 | /* If alias and dentry share a parent, then no extra locks required */ | |
3091 | if (alias->d_parent == dentry->d_parent) | |
3092 | goto out_unalias; | |
3093 | ||
9eaef27b | 3094 | /* See lock_rename() */ |
9eaef27b TM |
3095 | if (!mutex_trylock(&dentry->d_sb->s_vfs_rename_mutex)) |
3096 | goto out_err; | |
3097 | m1 = &dentry->d_sb->s_vfs_rename_mutex; | |
9902af79 | 3098 | if (!inode_trylock_shared(alias->d_parent->d_inode)) |
9eaef27b | 3099 | goto out_err; |
9902af79 | 3100 | m2 = &alias->d_parent->d_inode->i_rwsem; |
9eaef27b | 3101 | out_unalias: |
8ed936b5 | 3102 | __d_move(alias, dentry, false); |
b5ae6b15 | 3103 | ret = 0; |
9eaef27b | 3104 | out_err: |
9eaef27b | 3105 | if (m2) |
9902af79 | 3106 | up_read(m2); |
9eaef27b TM |
3107 | if (m1) |
3108 | mutex_unlock(m1); | |
3109 | return ret; | |
3110 | } | |
3111 | ||
3f70bd51 BF |
3112 | /** |
3113 | * d_splice_alias - splice a disconnected dentry into the tree if one exists | |
3114 | * @inode: the inode which may have a disconnected dentry | |
3115 | * @dentry: a negative dentry which we want to point to the inode. | |
3116 | * | |
da093a9b BF |
3117 | * If inode is a directory and has an IS_ROOT alias, then d_move that in |
3118 | * place of the given dentry and return it, else simply d_add the inode | |
3119 | * to the dentry and return NULL. | |
3f70bd51 | 3120 | * |
908790fa BF |
3121 | * If a non-IS_ROOT directory is found, the filesystem is corrupt, and |
3122 | * we should error out: directories can't have multiple aliases. | |
3123 | * | |
3f70bd51 BF |
3124 | * This is needed in the lookup routine of any filesystem that is exportable |
3125 | * (via knfsd) so that we can build dcache paths to directories effectively. | |
3126 | * | |
3127 | * If a dentry was found and moved, then it is returned. Otherwise NULL | |
3128 | * is returned. This matches the expected return value of ->lookup. | |
3129 | * | |
3130 | * Cluster filesystems may call this function with a negative, hashed dentry. | |
3131 | * In that case, we know that the inode will be a regular file, and also this | |
3132 | * will only occur during atomic_open. So we need to check for the dentry | |
3133 | * being already hashed only in the final case. | |
3134 | */ | |
3135 | struct dentry *d_splice_alias(struct inode *inode, struct dentry *dentry) | |
3136 | { | |
3f70bd51 BF |
3137 | if (IS_ERR(inode)) |
3138 | return ERR_CAST(inode); | |
3139 | ||
770bfad8 DH |
3140 | BUG_ON(!d_unhashed(dentry)); |
3141 | ||
de689f5e | 3142 | if (!inode) |
b5ae6b15 | 3143 | goto out; |
de689f5e | 3144 | |
b9680917 | 3145 | security_d_instantiate(dentry, inode); |
873feea0 | 3146 | spin_lock(&inode->i_lock); |
9eaef27b | 3147 | if (S_ISDIR(inode->i_mode)) { |
b5ae6b15 AV |
3148 | struct dentry *new = __d_find_any_alias(inode); |
3149 | if (unlikely(new)) { | |
a03e283b EB |
3150 | /* The reference to new ensures it remains an alias */ |
3151 | spin_unlock(&inode->i_lock); | |
18367501 | 3152 | write_seqlock(&rename_lock); |
b5ae6b15 AV |
3153 | if (unlikely(d_ancestor(new, dentry))) { |
3154 | write_sequnlock(&rename_lock); | |
b5ae6b15 AV |
3155 | dput(new); |
3156 | new = ERR_PTR(-ELOOP); | |
3157 | pr_warn_ratelimited( | |
3158 | "VFS: Lookup of '%s' in %s %s" | |
3159 | " would have caused loop\n", | |
3160 | dentry->d_name.name, | |
3161 | inode->i_sb->s_type->name, | |
3162 | inode->i_sb->s_id); | |
3163 | } else if (!IS_ROOT(new)) { | |
076515fc | 3164 | struct dentry *old_parent = dget(new->d_parent); |
b5ae6b15 | 3165 | int err = __d_unalias(inode, dentry, new); |
18367501 | 3166 | write_sequnlock(&rename_lock); |
b5ae6b15 AV |
3167 | if (err) { |
3168 | dput(new); | |
3169 | new = ERR_PTR(err); | |
3170 | } | |
076515fc | 3171 | dput(old_parent); |
18367501 | 3172 | } else { |
b5ae6b15 AV |
3173 | __d_move(new, dentry, false); |
3174 | write_sequnlock(&rename_lock); | |
dd179946 | 3175 | } |
b5ae6b15 AV |
3176 | iput(inode); |
3177 | return new; | |
9eaef27b | 3178 | } |
770bfad8 | 3179 | } |
b5ae6b15 | 3180 | out: |
ed782b5a | 3181 | __d_add(dentry, inode); |
b5ae6b15 | 3182 | return NULL; |
770bfad8 | 3183 | } |
b5ae6b15 | 3184 | EXPORT_SYMBOL(d_splice_alias); |
770bfad8 | 3185 | |
1da177e4 LT |
3186 | /* |
3187 | * Test whether new_dentry is a subdirectory of old_dentry. | |
3188 | * | |
3189 | * Trivially implemented using the dcache structure | |
3190 | */ | |
3191 | ||
3192 | /** | |
3193 | * is_subdir - is new dentry a subdirectory of old_dentry | |
3194 | * @new_dentry: new dentry | |
3195 | * @old_dentry: old dentry | |
3196 | * | |
a6e5787f YB |
3197 | * Returns true if new_dentry is a subdirectory of the parent (at any depth). |
3198 | * Returns false otherwise. | |
1da177e4 LT |
3199 | * Caller must ensure that "new_dentry" is pinned before calling is_subdir() |
3200 | */ | |
3201 | ||
a6e5787f | 3202 | bool is_subdir(struct dentry *new_dentry, struct dentry *old_dentry) |
1da177e4 | 3203 | { |
a6e5787f | 3204 | bool result; |
949854d0 | 3205 | unsigned seq; |
1da177e4 | 3206 | |
e2761a11 | 3207 | if (new_dentry == old_dentry) |
a6e5787f | 3208 | return true; |
e2761a11 | 3209 | |
e2761a11 | 3210 | do { |
1da177e4 | 3211 | /* for restarting inner loop in case of seq retry */ |
1da177e4 | 3212 | seq = read_seqbegin(&rename_lock); |
949854d0 NP |
3213 | /* |
3214 | * Need rcu_readlock to protect against the d_parent trashing | |
3215 | * due to d_move | |
3216 | */ | |
3217 | rcu_read_lock(); | |
e2761a11 | 3218 | if (d_ancestor(old_dentry, new_dentry)) |
a6e5787f | 3219 | result = true; |
e2761a11 | 3220 | else |
a6e5787f | 3221 | result = false; |
949854d0 | 3222 | rcu_read_unlock(); |
1da177e4 | 3223 | } while (read_seqretry(&rename_lock, seq)); |
1da177e4 LT |
3224 | |
3225 | return result; | |
3226 | } | |
e8f9e5b7 | 3227 | EXPORT_SYMBOL(is_subdir); |
1da177e4 | 3228 | |
db14fc3a | 3229 | static enum d_walk_ret d_genocide_kill(void *data, struct dentry *dentry) |
1da177e4 | 3230 | { |
db14fc3a MS |
3231 | struct dentry *root = data; |
3232 | if (dentry != root) { | |
3233 | if (d_unhashed(dentry) || !dentry->d_inode) | |
3234 | return D_WALK_SKIP; | |
1da177e4 | 3235 | |
01ddc4ed MS |
3236 | if (!(dentry->d_flags & DCACHE_GENOCIDE)) { |
3237 | dentry->d_flags |= DCACHE_GENOCIDE; | |
3238 | dentry->d_lockref.count--; | |
3239 | } | |
1da177e4 | 3240 | } |
db14fc3a MS |
3241 | return D_WALK_CONTINUE; |
3242 | } | |
58db63d0 | 3243 | |
db14fc3a MS |
3244 | void d_genocide(struct dentry *parent) |
3245 | { | |
3a8e3611 | 3246 | d_walk(parent, parent, d_genocide_kill); |
1da177e4 LT |
3247 | } |
3248 | ||
863f144f | 3249 | void d_tmpfile(struct file *file, struct inode *inode) |
1da177e4 | 3250 | { |
863f144f MS |
3251 | struct dentry *dentry = file->f_path.dentry; |
3252 | ||
60545d0d AV |
3253 | inode_dec_link_count(inode); |
3254 | BUG_ON(dentry->d_name.name != dentry->d_iname || | |
946e51f2 | 3255 | !hlist_unhashed(&dentry->d_u.d_alias) || |
60545d0d AV |
3256 | !d_unlinked(dentry)); |
3257 | spin_lock(&dentry->d_parent->d_lock); | |
3258 | spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED); | |
3259 | dentry->d_name.len = sprintf(dentry->d_iname, "#%llu", | |
3260 | (unsigned long long)inode->i_ino); | |
3261 | spin_unlock(&dentry->d_lock); | |
3262 | spin_unlock(&dentry->d_parent->d_lock); | |
3263 | d_instantiate(dentry, inode); | |
1da177e4 | 3264 | } |
60545d0d | 3265 | EXPORT_SYMBOL(d_tmpfile); |
1da177e4 LT |
3266 | |
3267 | static __initdata unsigned long dhash_entries; | |
3268 | static int __init set_dhash_entries(char *str) | |
3269 | { | |
3270 | if (!str) | |
3271 | return 0; | |
3272 | dhash_entries = simple_strtoul(str, &str, 0); | |
3273 | return 1; | |
3274 | } | |
3275 | __setup("dhash_entries=", set_dhash_entries); | |
3276 | ||
3277 | static void __init dcache_init_early(void) | |
3278 | { | |
1da177e4 LT |
3279 | /* If hashes are distributed across NUMA nodes, defer |
3280 | * hash allocation until vmalloc space is available. | |
3281 | */ | |
3282 | if (hashdist) | |
3283 | return; | |
3284 | ||
3285 | dentry_hashtable = | |
3286 | alloc_large_system_hash("Dentry cache", | |
b07ad996 | 3287 | sizeof(struct hlist_bl_head), |
1da177e4 LT |
3288 | dhash_entries, |
3289 | 13, | |
3d375d78 | 3290 | HASH_EARLY | HASH_ZERO, |
1da177e4 | 3291 | &d_hash_shift, |
b35d786b | 3292 | NULL, |
31fe62b9 | 3293 | 0, |
1da177e4 | 3294 | 0); |
854d3e63 | 3295 | d_hash_shift = 32 - d_hash_shift; |
1da177e4 LT |
3296 | } |
3297 | ||
74bf17cf | 3298 | static void __init dcache_init(void) |
1da177e4 | 3299 | { |
3d375d78 | 3300 | /* |
1da177e4 LT |
3301 | * A constructor could be added for stable state like the lists, |
3302 | * but it is probably not worth it because of the cache nature | |
3d375d78 | 3303 | * of the dcache. |
1da177e4 | 3304 | */ |
80344266 DW |
3305 | dentry_cache = KMEM_CACHE_USERCOPY(dentry, |
3306 | SLAB_RECLAIM_ACCOUNT|SLAB_PANIC|SLAB_MEM_SPREAD|SLAB_ACCOUNT, | |
3307 | d_iname); | |
1da177e4 LT |
3308 | |
3309 | /* Hash may have been set up in dcache_init_early */ | |
3310 | if (!hashdist) | |
3311 | return; | |
3312 | ||
3313 | dentry_hashtable = | |
3314 | alloc_large_system_hash("Dentry cache", | |
b07ad996 | 3315 | sizeof(struct hlist_bl_head), |
1da177e4 LT |
3316 | dhash_entries, |
3317 | 13, | |
3d375d78 | 3318 | HASH_ZERO, |
1da177e4 | 3319 | &d_hash_shift, |
b35d786b | 3320 | NULL, |
31fe62b9 | 3321 | 0, |
1da177e4 | 3322 | 0); |
854d3e63 | 3323 | d_hash_shift = 32 - d_hash_shift; |
1da177e4 LT |
3324 | } |
3325 | ||
3326 | /* SLAB cache for __getname() consumers */ | |
e18b890b | 3327 | struct kmem_cache *names_cachep __read_mostly; |
ec4f8605 | 3328 | EXPORT_SYMBOL(names_cachep); |
1da177e4 | 3329 | |
1da177e4 LT |
3330 | void __init vfs_caches_init_early(void) |
3331 | { | |
6916363f SAS |
3332 | int i; |
3333 | ||
3334 | for (i = 0; i < ARRAY_SIZE(in_lookup_hashtable); i++) | |
3335 | INIT_HLIST_BL_HEAD(&in_lookup_hashtable[i]); | |
3336 | ||
1da177e4 LT |
3337 | dcache_init_early(); |
3338 | inode_init_early(); | |
3339 | } | |
3340 | ||
4248b0da | 3341 | void __init vfs_caches_init(void) |
1da177e4 | 3342 | { |
6a9b8820 DW |
3343 | names_cachep = kmem_cache_create_usercopy("names_cache", PATH_MAX, 0, |
3344 | SLAB_HWCACHE_ALIGN|SLAB_PANIC, 0, PATH_MAX, NULL); | |
1da177e4 | 3345 | |
74bf17cf DC |
3346 | dcache_init(); |
3347 | inode_init(); | |
4248b0da MG |
3348 | files_init(); |
3349 | files_maxfiles_init(); | |
74bf17cf | 3350 | mnt_init(); |
1da177e4 LT |
3351 | bdev_cache_init(); |
3352 | chrdev_init(); | |
3353 | } |