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