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