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