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