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