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 | */ | |
61572bb1 YZ |
475 | if (dentry->d_flags & DCACHE_OP_PRUNE) |
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) { |
dc0474be | 730 | __dget_dlock(dentry); |
1da177e4 LT |
731 | __d_drop(dentry); |
732 | spin_unlock(&dentry->d_lock); | |
873feea0 | 733 | spin_unlock(&inode->i_lock); |
1da177e4 LT |
734 | dput(dentry); |
735 | goto restart; | |
736 | } | |
737 | spin_unlock(&dentry->d_lock); | |
738 | } | |
873feea0 | 739 | spin_unlock(&inode->i_lock); |
1da177e4 | 740 | } |
ec4f8605 | 741 | EXPORT_SYMBOL(d_prune_aliases); |
1da177e4 LT |
742 | |
743 | /* | |
77812a1e NP |
744 | * Try to throw away a dentry - free the inode, dput the parent. |
745 | * Requires dentry->d_lock is held, and dentry->d_count == 0. | |
746 | * Releases dentry->d_lock. | |
d702ccb3 | 747 | * |
77812a1e | 748 | * This may fail if locks cannot be acquired no problem, just try again. |
1da177e4 | 749 | */ |
77812a1e | 750 | static void try_prune_one_dentry(struct dentry *dentry) |
31f3e0b3 | 751 | __releases(dentry->d_lock) |
1da177e4 | 752 | { |
77812a1e | 753 | struct dentry *parent; |
d52b9086 | 754 | |
77812a1e | 755 | parent = dentry_kill(dentry, 0); |
d52b9086 | 756 | /* |
77812a1e NP |
757 | * If dentry_kill returns NULL, we have nothing more to do. |
758 | * if it returns the same dentry, trylocks failed. In either | |
759 | * case, just loop again. | |
760 | * | |
761 | * Otherwise, we need to prune ancestors too. This is necessary | |
762 | * to prevent quadratic behavior of shrink_dcache_parent(), but | |
763 | * is also expected to be beneficial in reducing dentry cache | |
764 | * fragmentation. | |
d52b9086 | 765 | */ |
77812a1e NP |
766 | if (!parent) |
767 | return; | |
768 | if (parent == dentry) | |
769 | return; | |
770 | ||
771 | /* Prune ancestors. */ | |
772 | dentry = parent; | |
d52b9086 | 773 | while (dentry) { |
98474236 | 774 | if (lockref_put_or_lock(&dentry->d_lockref)) |
89e60548 | 775 | return; |
77812a1e | 776 | dentry = dentry_kill(dentry, 1); |
d52b9086 | 777 | } |
1da177e4 LT |
778 | } |
779 | ||
3049cfe2 | 780 | static void shrink_dentry_list(struct list_head *list) |
1da177e4 | 781 | { |
da3bbdd4 | 782 | struct dentry *dentry; |
da3bbdd4 | 783 | |
ec33679d NP |
784 | rcu_read_lock(); |
785 | for (;;) { | |
ec33679d NP |
786 | dentry = list_entry_rcu(list->prev, struct dentry, d_lru); |
787 | if (&dentry->d_lru == list) | |
788 | break; /* empty */ | |
789 | spin_lock(&dentry->d_lock); | |
790 | if (dentry != list_entry(list->prev, struct dentry, d_lru)) { | |
791 | spin_unlock(&dentry->d_lock); | |
23044507 NP |
792 | continue; |
793 | } | |
794 | ||
1da177e4 LT |
795 | /* |
796 | * We found an inuse dentry which was not removed from | |
da3bbdd4 KM |
797 | * the LRU because of laziness during lookup. Do not free |
798 | * it - just keep it off the LRU list. | |
1da177e4 | 799 | */ |
98474236 | 800 | if (dentry->d_lockref.count) { |
ec33679d | 801 | dentry_lru_del(dentry); |
da3bbdd4 | 802 | spin_unlock(&dentry->d_lock); |
1da177e4 LT |
803 | continue; |
804 | } | |
ec33679d | 805 | |
ec33679d | 806 | rcu_read_unlock(); |
77812a1e NP |
807 | |
808 | try_prune_one_dentry(dentry); | |
809 | ||
ec33679d | 810 | rcu_read_lock(); |
da3bbdd4 | 811 | } |
ec33679d | 812 | rcu_read_unlock(); |
3049cfe2 CH |
813 | } |
814 | ||
815 | /** | |
b48f03b3 DC |
816 | * prune_dcache_sb - shrink the dcache |
817 | * @sb: superblock | |
818 | * @count: number of entries to try to free | |
819 | * | |
820 | * Attempt to shrink the superblock dcache LRU by @count entries. This is | |
821 | * done when we need more memory an called from the superblock shrinker | |
822 | * function. | |
3049cfe2 | 823 | * |
b48f03b3 DC |
824 | * This function may fail to free any resources if all the dentries are in |
825 | * use. | |
3049cfe2 | 826 | */ |
b48f03b3 | 827 | void prune_dcache_sb(struct super_block *sb, int count) |
3049cfe2 | 828 | { |
3049cfe2 CH |
829 | struct dentry *dentry; |
830 | LIST_HEAD(referenced); | |
831 | LIST_HEAD(tmp); | |
3049cfe2 | 832 | |
23044507 NP |
833 | relock: |
834 | spin_lock(&dcache_lru_lock); | |
3049cfe2 CH |
835 | while (!list_empty(&sb->s_dentry_lru)) { |
836 | dentry = list_entry(sb->s_dentry_lru.prev, | |
837 | struct dentry, d_lru); | |
838 | BUG_ON(dentry->d_sb != sb); | |
839 | ||
23044507 NP |
840 | if (!spin_trylock(&dentry->d_lock)) { |
841 | spin_unlock(&dcache_lru_lock); | |
842 | cpu_relax(); | |
843 | goto relock; | |
844 | } | |
845 | ||
b48f03b3 | 846 | if (dentry->d_flags & DCACHE_REFERENCED) { |
23044507 NP |
847 | dentry->d_flags &= ~DCACHE_REFERENCED; |
848 | list_move(&dentry->d_lru, &referenced); | |
3049cfe2 | 849 | spin_unlock(&dentry->d_lock); |
23044507 NP |
850 | } else { |
851 | list_move_tail(&dentry->d_lru, &tmp); | |
eaf5f907 | 852 | dentry->d_flags |= DCACHE_SHRINK_LIST; |
23044507 | 853 | spin_unlock(&dentry->d_lock); |
b0d40c92 | 854 | if (!--count) |
23044507 | 855 | break; |
3049cfe2 | 856 | } |
ec33679d | 857 | cond_resched_lock(&dcache_lru_lock); |
3049cfe2 | 858 | } |
da3bbdd4 KM |
859 | if (!list_empty(&referenced)) |
860 | list_splice(&referenced, &sb->s_dentry_lru); | |
23044507 | 861 | spin_unlock(&dcache_lru_lock); |
ec33679d NP |
862 | |
863 | shrink_dentry_list(&tmp); | |
da3bbdd4 KM |
864 | } |
865 | ||
1da177e4 LT |
866 | /** |
867 | * shrink_dcache_sb - shrink dcache for a superblock | |
868 | * @sb: superblock | |
869 | * | |
3049cfe2 CH |
870 | * Shrink the dcache for the specified super block. This is used to free |
871 | * the dcache before unmounting a file system. | |
1da177e4 | 872 | */ |
3049cfe2 | 873 | void shrink_dcache_sb(struct super_block *sb) |
1da177e4 | 874 | { |
3049cfe2 CH |
875 | LIST_HEAD(tmp); |
876 | ||
23044507 | 877 | spin_lock(&dcache_lru_lock); |
3049cfe2 CH |
878 | while (!list_empty(&sb->s_dentry_lru)) { |
879 | list_splice_init(&sb->s_dentry_lru, &tmp); | |
ec33679d | 880 | spin_unlock(&dcache_lru_lock); |
3049cfe2 | 881 | shrink_dentry_list(&tmp); |
ec33679d | 882 | spin_lock(&dcache_lru_lock); |
3049cfe2 | 883 | } |
23044507 | 884 | spin_unlock(&dcache_lru_lock); |
1da177e4 | 885 | } |
ec4f8605 | 886 | EXPORT_SYMBOL(shrink_dcache_sb); |
1da177e4 | 887 | |
c636ebdb DH |
888 | /* |
889 | * destroy a single subtree of dentries for unmount | |
890 | * - see the comments on shrink_dcache_for_umount() for a description of the | |
891 | * locking | |
892 | */ | |
893 | static void shrink_dcache_for_umount_subtree(struct dentry *dentry) | |
894 | { | |
895 | struct dentry *parent; | |
896 | ||
897 | BUG_ON(!IS_ROOT(dentry)); | |
898 | ||
c636ebdb DH |
899 | for (;;) { |
900 | /* descend to the first leaf in the current subtree */ | |
43c1c9cd | 901 | while (!list_empty(&dentry->d_subdirs)) |
c636ebdb DH |
902 | dentry = list_entry(dentry->d_subdirs.next, |
903 | struct dentry, d_u.d_child); | |
c636ebdb DH |
904 | |
905 | /* consume the dentries from this leaf up through its parents | |
906 | * until we find one with children or run out altogether */ | |
907 | do { | |
908 | struct inode *inode; | |
909 | ||
f0023bc6 | 910 | /* |
61572bb1 | 911 | * inform the fs that this dentry is about to be |
f0023bc6 SW |
912 | * unhashed and destroyed. |
913 | */ | |
61572bb1 YZ |
914 | if (dentry->d_flags & DCACHE_OP_PRUNE) |
915 | dentry->d_op->d_prune(dentry); | |
916 | ||
917 | dentry_lru_del(dentry); | |
43c1c9cd DH |
918 | __d_shrink(dentry); |
919 | ||
98474236 | 920 | if (dentry->d_lockref.count != 0) { |
c636ebdb DH |
921 | printk(KERN_ERR |
922 | "BUG: Dentry %p{i=%lx,n=%s}" | |
923 | " still in use (%d)" | |
924 | " [unmount of %s %s]\n", | |
925 | dentry, | |
926 | dentry->d_inode ? | |
927 | dentry->d_inode->i_ino : 0UL, | |
928 | dentry->d_name.name, | |
98474236 | 929 | dentry->d_lockref.count, |
c636ebdb DH |
930 | dentry->d_sb->s_type->name, |
931 | dentry->d_sb->s_id); | |
932 | BUG(); | |
933 | } | |
934 | ||
2fd6b7f5 | 935 | if (IS_ROOT(dentry)) { |
c636ebdb | 936 | parent = NULL; |
2fd6b7f5 NP |
937 | list_del(&dentry->d_u.d_child); |
938 | } else { | |
871c0067 | 939 | parent = dentry->d_parent; |
98474236 | 940 | parent->d_lockref.count--; |
2fd6b7f5 | 941 | list_del(&dentry->d_u.d_child); |
871c0067 | 942 | } |
c636ebdb | 943 | |
c636ebdb DH |
944 | inode = dentry->d_inode; |
945 | if (inode) { | |
946 | dentry->d_inode = NULL; | |
b3d9b7a3 | 947 | hlist_del_init(&dentry->d_alias); |
c636ebdb DH |
948 | if (dentry->d_op && dentry->d_op->d_iput) |
949 | dentry->d_op->d_iput(dentry, inode); | |
950 | else | |
951 | iput(inode); | |
952 | } | |
953 | ||
954 | d_free(dentry); | |
955 | ||
956 | /* finished when we fall off the top of the tree, | |
957 | * otherwise we ascend to the parent and move to the | |
958 | * next sibling if there is one */ | |
959 | if (!parent) | |
312d3ca8 | 960 | return; |
c636ebdb | 961 | dentry = parent; |
c636ebdb DH |
962 | } while (list_empty(&dentry->d_subdirs)); |
963 | ||
964 | dentry = list_entry(dentry->d_subdirs.next, | |
965 | struct dentry, d_u.d_child); | |
966 | } | |
967 | } | |
968 | ||
969 | /* | |
970 | * destroy the dentries attached to a superblock on unmounting | |
b5c84bf6 | 971 | * - we don't need to use dentry->d_lock because: |
c636ebdb DH |
972 | * - the superblock is detached from all mountings and open files, so the |
973 | * dentry trees will not be rearranged by the VFS | |
974 | * - s_umount is write-locked, so the memory pressure shrinker will ignore | |
975 | * any dentries belonging to this superblock that it comes across | |
976 | * - the filesystem itself is no longer permitted to rearrange the dentries | |
977 | * in this superblock | |
978 | */ | |
979 | void shrink_dcache_for_umount(struct super_block *sb) | |
980 | { | |
981 | struct dentry *dentry; | |
982 | ||
983 | if (down_read_trylock(&sb->s_umount)) | |
984 | BUG(); | |
985 | ||
986 | dentry = sb->s_root; | |
987 | sb->s_root = NULL; | |
98474236 | 988 | dentry->d_lockref.count--; |
c636ebdb DH |
989 | shrink_dcache_for_umount_subtree(dentry); |
990 | ||
ceb5bdc2 NP |
991 | while (!hlist_bl_empty(&sb->s_anon)) { |
992 | dentry = hlist_bl_entry(hlist_bl_first(&sb->s_anon), struct dentry, d_hash); | |
c636ebdb DH |
993 | shrink_dcache_for_umount_subtree(dentry); |
994 | } | |
995 | } | |
996 | ||
c826cb7d LT |
997 | /* |
998 | * This tries to ascend one level of parenthood, but | |
999 | * we can race with renaming, so we need to re-check | |
1000 | * the parenthood after dropping the lock and check | |
1001 | * that the sequence number still matches. | |
1002 | */ | |
1003 | static struct dentry *try_to_ascend(struct dentry *old, int locked, unsigned seq) | |
1004 | { | |
1005 | struct dentry *new = old->d_parent; | |
1006 | ||
1007 | rcu_read_lock(); | |
1008 | spin_unlock(&old->d_lock); | |
1009 | spin_lock(&new->d_lock); | |
1010 | ||
1011 | /* | |
1012 | * might go back up the wrong parent if we have had a rename | |
1013 | * or deletion | |
1014 | */ | |
1015 | if (new != old->d_parent || | |
b161dfa6 | 1016 | (old->d_flags & DCACHE_DENTRY_KILLED) || |
c826cb7d LT |
1017 | (!locked && read_seqretry(&rename_lock, seq))) { |
1018 | spin_unlock(&new->d_lock); | |
1019 | new = NULL; | |
1020 | } | |
1021 | rcu_read_unlock(); | |
1022 | return new; | |
1023 | } | |
1024 | ||
1025 | ||
1da177e4 LT |
1026 | /* |
1027 | * Search for at least 1 mount point in the dentry's subdirs. | |
1028 | * We descend to the next level whenever the d_subdirs | |
1029 | * list is non-empty and continue searching. | |
1030 | */ | |
1031 | ||
1032 | /** | |
1033 | * have_submounts - check for mounts over a dentry | |
1034 | * @parent: dentry to check. | |
1035 | * | |
1036 | * Return true if the parent or its subdirectories contain | |
1037 | * a mount point | |
1038 | */ | |
1da177e4 LT |
1039 | int have_submounts(struct dentry *parent) |
1040 | { | |
949854d0 | 1041 | struct dentry *this_parent; |
1da177e4 | 1042 | struct list_head *next; |
949854d0 | 1043 | unsigned seq; |
58db63d0 | 1044 | int locked = 0; |
949854d0 | 1045 | |
949854d0 | 1046 | seq = read_seqbegin(&rename_lock); |
58db63d0 NP |
1047 | again: |
1048 | this_parent = parent; | |
1da177e4 | 1049 | |
1da177e4 LT |
1050 | if (d_mountpoint(parent)) |
1051 | goto positive; | |
2fd6b7f5 | 1052 | spin_lock(&this_parent->d_lock); |
1da177e4 LT |
1053 | repeat: |
1054 | next = this_parent->d_subdirs.next; | |
1055 | resume: | |
1056 | while (next != &this_parent->d_subdirs) { | |
1057 | struct list_head *tmp = next; | |
5160ee6f | 1058 | struct dentry *dentry = list_entry(tmp, struct dentry, d_u.d_child); |
1da177e4 | 1059 | next = tmp->next; |
2fd6b7f5 NP |
1060 | |
1061 | spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED); | |
1da177e4 | 1062 | /* Have we found a mount point ? */ |
2fd6b7f5 NP |
1063 | if (d_mountpoint(dentry)) { |
1064 | spin_unlock(&dentry->d_lock); | |
1065 | spin_unlock(&this_parent->d_lock); | |
1da177e4 | 1066 | goto positive; |
2fd6b7f5 | 1067 | } |
1da177e4 | 1068 | if (!list_empty(&dentry->d_subdirs)) { |
2fd6b7f5 NP |
1069 | spin_unlock(&this_parent->d_lock); |
1070 | spin_release(&dentry->d_lock.dep_map, 1, _RET_IP_); | |
1da177e4 | 1071 | this_parent = dentry; |
2fd6b7f5 | 1072 | spin_acquire(&this_parent->d_lock.dep_map, 0, 1, _RET_IP_); |
1da177e4 LT |
1073 | goto repeat; |
1074 | } | |
2fd6b7f5 | 1075 | spin_unlock(&dentry->d_lock); |
1da177e4 LT |
1076 | } |
1077 | /* | |
1078 | * All done at this level ... ascend and resume the search. | |
1079 | */ | |
1080 | if (this_parent != parent) { | |
c826cb7d LT |
1081 | struct dentry *child = this_parent; |
1082 | this_parent = try_to_ascend(this_parent, locked, seq); | |
1083 | if (!this_parent) | |
949854d0 | 1084 | goto rename_retry; |
949854d0 | 1085 | next = child->d_u.d_child.next; |
1da177e4 LT |
1086 | goto resume; |
1087 | } | |
2fd6b7f5 | 1088 | spin_unlock(&this_parent->d_lock); |
58db63d0 | 1089 | if (!locked && read_seqretry(&rename_lock, seq)) |
949854d0 | 1090 | goto rename_retry; |
58db63d0 NP |
1091 | if (locked) |
1092 | write_sequnlock(&rename_lock); | |
1da177e4 LT |
1093 | return 0; /* No mount points found in tree */ |
1094 | positive: | |
58db63d0 | 1095 | if (!locked && read_seqretry(&rename_lock, seq)) |
949854d0 | 1096 | goto rename_retry; |
58db63d0 NP |
1097 | if (locked) |
1098 | write_sequnlock(&rename_lock); | |
1da177e4 | 1099 | return 1; |
58db63d0 NP |
1100 | |
1101 | rename_retry: | |
8110e16d MS |
1102 | if (locked) |
1103 | goto again; | |
58db63d0 NP |
1104 | locked = 1; |
1105 | write_seqlock(&rename_lock); | |
1106 | goto again; | |
1da177e4 | 1107 | } |
ec4f8605 | 1108 | EXPORT_SYMBOL(have_submounts); |
1da177e4 LT |
1109 | |
1110 | /* | |
fd517909 | 1111 | * Search the dentry child list of the specified parent, |
1da177e4 LT |
1112 | * and move any unused dentries to the end of the unused |
1113 | * list for prune_dcache(). We descend to the next level | |
1114 | * whenever the d_subdirs list is non-empty and continue | |
1115 | * searching. | |
1116 | * | |
1117 | * It returns zero iff there are no unused children, | |
1118 | * otherwise it returns the number of children moved to | |
1119 | * the end of the unused list. This may not be the total | |
1120 | * number of unused children, because select_parent can | |
1121 | * drop the lock and return early due to latency | |
1122 | * constraints. | |
1123 | */ | |
b48f03b3 | 1124 | static int select_parent(struct dentry *parent, struct list_head *dispose) |
1da177e4 | 1125 | { |
949854d0 | 1126 | struct dentry *this_parent; |
1da177e4 | 1127 | struct list_head *next; |
949854d0 | 1128 | unsigned seq; |
1da177e4 | 1129 | int found = 0; |
58db63d0 | 1130 | int locked = 0; |
1da177e4 | 1131 | |
949854d0 | 1132 | seq = read_seqbegin(&rename_lock); |
58db63d0 NP |
1133 | again: |
1134 | this_parent = parent; | |
2fd6b7f5 | 1135 | spin_lock(&this_parent->d_lock); |
1da177e4 LT |
1136 | repeat: |
1137 | next = this_parent->d_subdirs.next; | |
1138 | resume: | |
1139 | while (next != &this_parent->d_subdirs) { | |
1140 | struct list_head *tmp = next; | |
5160ee6f | 1141 | struct dentry *dentry = list_entry(tmp, struct dentry, d_u.d_child); |
1da177e4 LT |
1142 | next = tmp->next; |
1143 | ||
2fd6b7f5 | 1144 | spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED); |
23044507 | 1145 | |
b48f03b3 DC |
1146 | /* |
1147 | * move only zero ref count dentries to the dispose list. | |
eaf5f907 MS |
1148 | * |
1149 | * Those which are presently on the shrink list, being processed | |
1150 | * by shrink_dentry_list(), shouldn't be moved. Otherwise the | |
1151 | * loop in shrink_dcache_parent() might not make any progress | |
1152 | * and loop forever. | |
1da177e4 | 1153 | */ |
98474236 | 1154 | if (dentry->d_lockref.count) { |
eaf5f907 MS |
1155 | dentry_lru_del(dentry); |
1156 | } else if (!(dentry->d_flags & DCACHE_SHRINK_LIST)) { | |
b48f03b3 | 1157 | dentry_lru_move_list(dentry, dispose); |
eaf5f907 | 1158 | dentry->d_flags |= DCACHE_SHRINK_LIST; |
1da177e4 LT |
1159 | found++; |
1160 | } | |
1da177e4 LT |
1161 | /* |
1162 | * We can return to the caller if we have found some (this | |
1163 | * ensures forward progress). We'll be coming back to find | |
1164 | * the rest. | |
1165 | */ | |
2fd6b7f5 NP |
1166 | if (found && need_resched()) { |
1167 | spin_unlock(&dentry->d_lock); | |
1da177e4 | 1168 | goto out; |
2fd6b7f5 | 1169 | } |
1da177e4 LT |
1170 | |
1171 | /* | |
1172 | * Descend a level if the d_subdirs list is non-empty. | |
1173 | */ | |
1174 | if (!list_empty(&dentry->d_subdirs)) { | |
2fd6b7f5 NP |
1175 | spin_unlock(&this_parent->d_lock); |
1176 | spin_release(&dentry->d_lock.dep_map, 1, _RET_IP_); | |
1da177e4 | 1177 | this_parent = dentry; |
2fd6b7f5 | 1178 | spin_acquire(&this_parent->d_lock.dep_map, 0, 1, _RET_IP_); |
1da177e4 LT |
1179 | goto repeat; |
1180 | } | |
2fd6b7f5 NP |
1181 | |
1182 | spin_unlock(&dentry->d_lock); | |
1da177e4 LT |
1183 | } |
1184 | /* | |
1185 | * All done at this level ... ascend and resume the search. | |
1186 | */ | |
1187 | if (this_parent != parent) { | |
c826cb7d LT |
1188 | struct dentry *child = this_parent; |
1189 | this_parent = try_to_ascend(this_parent, locked, seq); | |
1190 | if (!this_parent) | |
949854d0 | 1191 | goto rename_retry; |
949854d0 | 1192 | next = child->d_u.d_child.next; |
1da177e4 LT |
1193 | goto resume; |
1194 | } | |
1195 | out: | |
2fd6b7f5 | 1196 | spin_unlock(&this_parent->d_lock); |
58db63d0 | 1197 | if (!locked && read_seqretry(&rename_lock, seq)) |
949854d0 | 1198 | goto rename_retry; |
58db63d0 NP |
1199 | if (locked) |
1200 | write_sequnlock(&rename_lock); | |
1da177e4 | 1201 | return found; |
58db63d0 NP |
1202 | |
1203 | rename_retry: | |
1204 | if (found) | |
1205 | return found; | |
8110e16d MS |
1206 | if (locked) |
1207 | goto again; | |
58db63d0 NP |
1208 | locked = 1; |
1209 | write_seqlock(&rename_lock); | |
1210 | goto again; | |
1da177e4 LT |
1211 | } |
1212 | ||
1213 | /** | |
1214 | * shrink_dcache_parent - prune dcache | |
1215 | * @parent: parent of entries to prune | |
1216 | * | |
1217 | * Prune the dcache to remove unused children of the parent dentry. | |
1218 | */ | |
1da177e4 LT |
1219 | void shrink_dcache_parent(struct dentry * parent) |
1220 | { | |
b48f03b3 | 1221 | LIST_HEAD(dispose); |
1da177e4 LT |
1222 | int found; |
1223 | ||
421348f1 | 1224 | while ((found = select_parent(parent, &dispose)) != 0) { |
b48f03b3 | 1225 | shrink_dentry_list(&dispose); |
421348f1 GT |
1226 | cond_resched(); |
1227 | } | |
1da177e4 | 1228 | } |
ec4f8605 | 1229 | EXPORT_SYMBOL(shrink_dcache_parent); |
1da177e4 | 1230 | |
1da177e4 | 1231 | /** |
a4464dbc AV |
1232 | * __d_alloc - allocate a dcache entry |
1233 | * @sb: filesystem it will belong to | |
1da177e4 LT |
1234 | * @name: qstr of the name |
1235 | * | |
1236 | * Allocates a dentry. It returns %NULL if there is insufficient memory | |
1237 | * available. On a success the dentry is returned. The name passed in is | |
1238 | * copied and the copy passed in may be reused after this call. | |
1239 | */ | |
1240 | ||
a4464dbc | 1241 | struct dentry *__d_alloc(struct super_block *sb, const struct qstr *name) |
1da177e4 LT |
1242 | { |
1243 | struct dentry *dentry; | |
1244 | char *dname; | |
1245 | ||
e12ba74d | 1246 | dentry = kmem_cache_alloc(dentry_cache, GFP_KERNEL); |
1da177e4 LT |
1247 | if (!dentry) |
1248 | return NULL; | |
1249 | ||
6326c71f LT |
1250 | /* |
1251 | * We guarantee that the inline name is always NUL-terminated. | |
1252 | * This way the memcpy() done by the name switching in rename | |
1253 | * will still always have a NUL at the end, even if we might | |
1254 | * be overwriting an internal NUL character | |
1255 | */ | |
1256 | dentry->d_iname[DNAME_INLINE_LEN-1] = 0; | |
1da177e4 LT |
1257 | if (name->len > DNAME_INLINE_LEN-1) { |
1258 | dname = kmalloc(name->len + 1, GFP_KERNEL); | |
1259 | if (!dname) { | |
1260 | kmem_cache_free(dentry_cache, dentry); | |
1261 | return NULL; | |
1262 | } | |
1263 | } else { | |
1264 | dname = dentry->d_iname; | |
1265 | } | |
1da177e4 LT |
1266 | |
1267 | dentry->d_name.len = name->len; | |
1268 | dentry->d_name.hash = name->hash; | |
1269 | memcpy(dname, name->name, name->len); | |
1270 | dname[name->len] = 0; | |
1271 | ||
6326c71f LT |
1272 | /* Make sure we always see the terminating NUL character */ |
1273 | smp_wmb(); | |
1274 | dentry->d_name.name = dname; | |
1275 | ||
98474236 | 1276 | dentry->d_lockref.count = 1; |
dea3667b | 1277 | dentry->d_flags = 0; |
1da177e4 | 1278 | spin_lock_init(&dentry->d_lock); |
31e6b01f | 1279 | seqcount_init(&dentry->d_seq); |
1da177e4 | 1280 | dentry->d_inode = NULL; |
a4464dbc AV |
1281 | dentry->d_parent = dentry; |
1282 | dentry->d_sb = sb; | |
1da177e4 LT |
1283 | dentry->d_op = NULL; |
1284 | dentry->d_fsdata = NULL; | |
ceb5bdc2 | 1285 | INIT_HLIST_BL_NODE(&dentry->d_hash); |
1da177e4 LT |
1286 | INIT_LIST_HEAD(&dentry->d_lru); |
1287 | INIT_LIST_HEAD(&dentry->d_subdirs); | |
b3d9b7a3 | 1288 | INIT_HLIST_NODE(&dentry->d_alias); |
2fd6b7f5 | 1289 | INIT_LIST_HEAD(&dentry->d_u.d_child); |
a4464dbc | 1290 | d_set_d_op(dentry, dentry->d_sb->s_d_op); |
1da177e4 | 1291 | |
3e880fb5 | 1292 | this_cpu_inc(nr_dentry); |
312d3ca8 | 1293 | |
1da177e4 LT |
1294 | return dentry; |
1295 | } | |
a4464dbc AV |
1296 | |
1297 | /** | |
1298 | * d_alloc - allocate a dcache entry | |
1299 | * @parent: parent of entry to allocate | |
1300 | * @name: qstr of the name | |
1301 | * | |
1302 | * Allocates a dentry. It returns %NULL if there is insufficient memory | |
1303 | * available. On a success the dentry is returned. The name passed in is | |
1304 | * copied and the copy passed in may be reused after this call. | |
1305 | */ | |
1306 | struct dentry *d_alloc(struct dentry * parent, const struct qstr *name) | |
1307 | { | |
1308 | struct dentry *dentry = __d_alloc(parent->d_sb, name); | |
1309 | if (!dentry) | |
1310 | return NULL; | |
1311 | ||
1312 | spin_lock(&parent->d_lock); | |
1313 | /* | |
1314 | * don't need child lock because it is not subject | |
1315 | * to concurrency here | |
1316 | */ | |
1317 | __dget_dlock(parent); | |
1318 | dentry->d_parent = parent; | |
1319 | list_add(&dentry->d_u.d_child, &parent->d_subdirs); | |
1320 | spin_unlock(&parent->d_lock); | |
1321 | ||
1322 | return dentry; | |
1323 | } | |
ec4f8605 | 1324 | EXPORT_SYMBOL(d_alloc); |
1da177e4 | 1325 | |
4b936885 NP |
1326 | struct dentry *d_alloc_pseudo(struct super_block *sb, const struct qstr *name) |
1327 | { | |
a4464dbc AV |
1328 | struct dentry *dentry = __d_alloc(sb, name); |
1329 | if (dentry) | |
4b936885 | 1330 | dentry->d_flags |= DCACHE_DISCONNECTED; |
4b936885 NP |
1331 | return dentry; |
1332 | } | |
1333 | EXPORT_SYMBOL(d_alloc_pseudo); | |
1334 | ||
1da177e4 LT |
1335 | struct dentry *d_alloc_name(struct dentry *parent, const char *name) |
1336 | { | |
1337 | struct qstr q; | |
1338 | ||
1339 | q.name = name; | |
1340 | q.len = strlen(name); | |
1341 | q.hash = full_name_hash(q.name, q.len); | |
1342 | return d_alloc(parent, &q); | |
1343 | } | |
ef26ca97 | 1344 | EXPORT_SYMBOL(d_alloc_name); |
1da177e4 | 1345 | |
fb045adb NP |
1346 | void d_set_d_op(struct dentry *dentry, const struct dentry_operations *op) |
1347 | { | |
6f7f7caa LT |
1348 | WARN_ON_ONCE(dentry->d_op); |
1349 | WARN_ON_ONCE(dentry->d_flags & (DCACHE_OP_HASH | | |
fb045adb NP |
1350 | DCACHE_OP_COMPARE | |
1351 | DCACHE_OP_REVALIDATE | | |
ecf3d1f1 | 1352 | DCACHE_OP_WEAK_REVALIDATE | |
fb045adb NP |
1353 | DCACHE_OP_DELETE )); |
1354 | dentry->d_op = op; | |
1355 | if (!op) | |
1356 | return; | |
1357 | if (op->d_hash) | |
1358 | dentry->d_flags |= DCACHE_OP_HASH; | |
1359 | if (op->d_compare) | |
1360 | dentry->d_flags |= DCACHE_OP_COMPARE; | |
1361 | if (op->d_revalidate) | |
1362 | dentry->d_flags |= DCACHE_OP_REVALIDATE; | |
ecf3d1f1 JL |
1363 | if (op->d_weak_revalidate) |
1364 | dentry->d_flags |= DCACHE_OP_WEAK_REVALIDATE; | |
fb045adb NP |
1365 | if (op->d_delete) |
1366 | dentry->d_flags |= DCACHE_OP_DELETE; | |
f0023bc6 SW |
1367 | if (op->d_prune) |
1368 | dentry->d_flags |= DCACHE_OP_PRUNE; | |
fb045adb NP |
1369 | |
1370 | } | |
1371 | EXPORT_SYMBOL(d_set_d_op); | |
1372 | ||
360da900 OH |
1373 | static void __d_instantiate(struct dentry *dentry, struct inode *inode) |
1374 | { | |
b23fb0a6 | 1375 | spin_lock(&dentry->d_lock); |
9875cf80 DH |
1376 | if (inode) { |
1377 | if (unlikely(IS_AUTOMOUNT(inode))) | |
1378 | dentry->d_flags |= DCACHE_NEED_AUTOMOUNT; | |
b3d9b7a3 | 1379 | hlist_add_head(&dentry->d_alias, &inode->i_dentry); |
9875cf80 | 1380 | } |
360da900 | 1381 | dentry->d_inode = inode; |
31e6b01f | 1382 | dentry_rcuwalk_barrier(dentry); |
b23fb0a6 | 1383 | spin_unlock(&dentry->d_lock); |
360da900 OH |
1384 | fsnotify_d_instantiate(dentry, inode); |
1385 | } | |
1386 | ||
1da177e4 LT |
1387 | /** |
1388 | * d_instantiate - fill in inode information for a dentry | |
1389 | * @entry: dentry to complete | |
1390 | * @inode: inode to attach to this dentry | |
1391 | * | |
1392 | * Fill in inode information in the entry. | |
1393 | * | |
1394 | * This turns negative dentries into productive full members | |
1395 | * of society. | |
1396 | * | |
1397 | * NOTE! This assumes that the inode count has been incremented | |
1398 | * (or otherwise set) by the caller to indicate that it is now | |
1399 | * in use by the dcache. | |
1400 | */ | |
1401 | ||
1402 | void d_instantiate(struct dentry *entry, struct inode * inode) | |
1403 | { | |
b3d9b7a3 | 1404 | BUG_ON(!hlist_unhashed(&entry->d_alias)); |
873feea0 NP |
1405 | if (inode) |
1406 | spin_lock(&inode->i_lock); | |
360da900 | 1407 | __d_instantiate(entry, inode); |
873feea0 NP |
1408 | if (inode) |
1409 | spin_unlock(&inode->i_lock); | |
1da177e4 LT |
1410 | security_d_instantiate(entry, inode); |
1411 | } | |
ec4f8605 | 1412 | EXPORT_SYMBOL(d_instantiate); |
1da177e4 LT |
1413 | |
1414 | /** | |
1415 | * d_instantiate_unique - instantiate a non-aliased dentry | |
1416 | * @entry: dentry to instantiate | |
1417 | * @inode: inode to attach to this dentry | |
1418 | * | |
1419 | * Fill in inode information in the entry. On success, it returns NULL. | |
1420 | * If an unhashed alias of "entry" already exists, then we return the | |
e866cfa9 | 1421 | * aliased dentry instead and drop one reference to inode. |
1da177e4 LT |
1422 | * |
1423 | * Note that in order to avoid conflicts with rename() etc, the caller | |
1424 | * had better be holding the parent directory semaphore. | |
e866cfa9 OD |
1425 | * |
1426 | * This also assumes that the inode count has been incremented | |
1427 | * (or otherwise set) by the caller to indicate that it is now | |
1428 | * in use by the dcache. | |
1da177e4 | 1429 | */ |
770bfad8 DH |
1430 | static struct dentry *__d_instantiate_unique(struct dentry *entry, |
1431 | struct inode *inode) | |
1da177e4 LT |
1432 | { |
1433 | struct dentry *alias; | |
1434 | int len = entry->d_name.len; | |
1435 | const char *name = entry->d_name.name; | |
1436 | unsigned int hash = entry->d_name.hash; | |
1437 | ||
770bfad8 | 1438 | if (!inode) { |
360da900 | 1439 | __d_instantiate(entry, NULL); |
770bfad8 DH |
1440 | return NULL; |
1441 | } | |
1442 | ||
b67bfe0d | 1443 | hlist_for_each_entry(alias, &inode->i_dentry, d_alias) { |
9abca360 NP |
1444 | /* |
1445 | * Don't need alias->d_lock here, because aliases with | |
1446 | * d_parent == entry->d_parent are not subject to name or | |
1447 | * parent changes, because the parent inode i_mutex is held. | |
1448 | */ | |
12f8ad4b | 1449 | if (alias->d_name.hash != hash) |
1da177e4 LT |
1450 | continue; |
1451 | if (alias->d_parent != entry->d_parent) | |
1452 | continue; | |
ee983e89 LT |
1453 | if (alias->d_name.len != len) |
1454 | continue; | |
12f8ad4b | 1455 | if (dentry_cmp(alias, name, len)) |
1da177e4 | 1456 | continue; |
dc0474be | 1457 | __dget(alias); |
1da177e4 LT |
1458 | return alias; |
1459 | } | |
770bfad8 | 1460 | |
360da900 | 1461 | __d_instantiate(entry, inode); |
1da177e4 LT |
1462 | return NULL; |
1463 | } | |
770bfad8 DH |
1464 | |
1465 | struct dentry *d_instantiate_unique(struct dentry *entry, struct inode *inode) | |
1466 | { | |
1467 | struct dentry *result; | |
1468 | ||
b3d9b7a3 | 1469 | BUG_ON(!hlist_unhashed(&entry->d_alias)); |
770bfad8 | 1470 | |
873feea0 NP |
1471 | if (inode) |
1472 | spin_lock(&inode->i_lock); | |
770bfad8 | 1473 | result = __d_instantiate_unique(entry, inode); |
873feea0 NP |
1474 | if (inode) |
1475 | spin_unlock(&inode->i_lock); | |
770bfad8 DH |
1476 | |
1477 | if (!result) { | |
1478 | security_d_instantiate(entry, inode); | |
1479 | return NULL; | |
1480 | } | |
1481 | ||
1482 | BUG_ON(!d_unhashed(result)); | |
1483 | iput(inode); | |
1484 | return result; | |
1485 | } | |
1486 | ||
1da177e4 LT |
1487 | EXPORT_SYMBOL(d_instantiate_unique); |
1488 | ||
adc0e91a AV |
1489 | struct dentry *d_make_root(struct inode *root_inode) |
1490 | { | |
1491 | struct dentry *res = NULL; | |
1492 | ||
1493 | if (root_inode) { | |
26fe5750 | 1494 | static const struct qstr name = QSTR_INIT("/", 1); |
adc0e91a AV |
1495 | |
1496 | res = __d_alloc(root_inode->i_sb, &name); | |
1497 | if (res) | |
1498 | d_instantiate(res, root_inode); | |
1499 | else | |
1500 | iput(root_inode); | |
1501 | } | |
1502 | return res; | |
1503 | } | |
1504 | EXPORT_SYMBOL(d_make_root); | |
1505 | ||
d891eedb BF |
1506 | static struct dentry * __d_find_any_alias(struct inode *inode) |
1507 | { | |
1508 | struct dentry *alias; | |
1509 | ||
b3d9b7a3 | 1510 | if (hlist_empty(&inode->i_dentry)) |
d891eedb | 1511 | return NULL; |
b3d9b7a3 | 1512 | alias = hlist_entry(inode->i_dentry.first, struct dentry, d_alias); |
d891eedb BF |
1513 | __dget(alias); |
1514 | return alias; | |
1515 | } | |
1516 | ||
46f72b34 SW |
1517 | /** |
1518 | * d_find_any_alias - find any alias for a given inode | |
1519 | * @inode: inode to find an alias for | |
1520 | * | |
1521 | * If any aliases exist for the given inode, take and return a | |
1522 | * reference for one of them. If no aliases exist, return %NULL. | |
1523 | */ | |
1524 | struct dentry *d_find_any_alias(struct inode *inode) | |
d891eedb BF |
1525 | { |
1526 | struct dentry *de; | |
1527 | ||
1528 | spin_lock(&inode->i_lock); | |
1529 | de = __d_find_any_alias(inode); | |
1530 | spin_unlock(&inode->i_lock); | |
1531 | return de; | |
1532 | } | |
46f72b34 | 1533 | EXPORT_SYMBOL(d_find_any_alias); |
d891eedb | 1534 | |
4ea3ada2 CH |
1535 | /** |
1536 | * d_obtain_alias - find or allocate a dentry for a given inode | |
1537 | * @inode: inode to allocate the dentry for | |
1538 | * | |
1539 | * Obtain a dentry for an inode resulting from NFS filehandle conversion or | |
1540 | * similar open by handle operations. The returned dentry may be anonymous, | |
1541 | * or may have a full name (if the inode was already in the cache). | |
1542 | * | |
1543 | * When called on a directory inode, we must ensure that the inode only ever | |
1544 | * has one dentry. If a dentry is found, that is returned instead of | |
1545 | * allocating a new one. | |
1546 | * | |
1547 | * On successful return, the reference to the inode has been transferred | |
44003728 CH |
1548 | * to the dentry. In case of an error the reference on the inode is released. |
1549 | * To make it easier to use in export operations a %NULL or IS_ERR inode may | |
1550 | * be passed in and will be the error will be propagate to the return value, | |
1551 | * with a %NULL @inode replaced by ERR_PTR(-ESTALE). | |
4ea3ada2 CH |
1552 | */ |
1553 | struct dentry *d_obtain_alias(struct inode *inode) | |
1554 | { | |
b911a6bd | 1555 | static const struct qstr anonstring = QSTR_INIT("/", 1); |
9308a612 CH |
1556 | struct dentry *tmp; |
1557 | struct dentry *res; | |
4ea3ada2 CH |
1558 | |
1559 | if (!inode) | |
44003728 | 1560 | return ERR_PTR(-ESTALE); |
4ea3ada2 CH |
1561 | if (IS_ERR(inode)) |
1562 | return ERR_CAST(inode); | |
1563 | ||
d891eedb | 1564 | res = d_find_any_alias(inode); |
9308a612 CH |
1565 | if (res) |
1566 | goto out_iput; | |
1567 | ||
a4464dbc | 1568 | tmp = __d_alloc(inode->i_sb, &anonstring); |
9308a612 CH |
1569 | if (!tmp) { |
1570 | res = ERR_PTR(-ENOMEM); | |
1571 | goto out_iput; | |
4ea3ada2 | 1572 | } |
b5c84bf6 | 1573 | |
873feea0 | 1574 | spin_lock(&inode->i_lock); |
d891eedb | 1575 | res = __d_find_any_alias(inode); |
9308a612 | 1576 | if (res) { |
873feea0 | 1577 | spin_unlock(&inode->i_lock); |
9308a612 CH |
1578 | dput(tmp); |
1579 | goto out_iput; | |
1580 | } | |
1581 | ||
1582 | /* attach a disconnected dentry */ | |
1583 | spin_lock(&tmp->d_lock); | |
9308a612 CH |
1584 | tmp->d_inode = inode; |
1585 | tmp->d_flags |= DCACHE_DISCONNECTED; | |
b3d9b7a3 | 1586 | hlist_add_head(&tmp->d_alias, &inode->i_dentry); |
1879fd6a | 1587 | hlist_bl_lock(&tmp->d_sb->s_anon); |
ceb5bdc2 | 1588 | hlist_bl_add_head(&tmp->d_hash, &tmp->d_sb->s_anon); |
1879fd6a | 1589 | hlist_bl_unlock(&tmp->d_sb->s_anon); |
9308a612 | 1590 | spin_unlock(&tmp->d_lock); |
873feea0 | 1591 | spin_unlock(&inode->i_lock); |
24ff6663 | 1592 | security_d_instantiate(tmp, inode); |
9308a612 | 1593 | |
9308a612 CH |
1594 | return tmp; |
1595 | ||
1596 | out_iput: | |
24ff6663 JB |
1597 | if (res && !IS_ERR(res)) |
1598 | security_d_instantiate(res, inode); | |
9308a612 CH |
1599 | iput(inode); |
1600 | return res; | |
4ea3ada2 | 1601 | } |
adc48720 | 1602 | EXPORT_SYMBOL(d_obtain_alias); |
1da177e4 LT |
1603 | |
1604 | /** | |
1605 | * d_splice_alias - splice a disconnected dentry into the tree if one exists | |
1606 | * @inode: the inode which may have a disconnected dentry | |
1607 | * @dentry: a negative dentry which we want to point to the inode. | |
1608 | * | |
1609 | * If inode is a directory and has a 'disconnected' dentry (i.e. IS_ROOT and | |
1610 | * DCACHE_DISCONNECTED), then d_move that in place of the given dentry | |
1611 | * and return it, else simply d_add the inode to the dentry and return NULL. | |
1612 | * | |
1613 | * This is needed in the lookup routine of any filesystem that is exportable | |
1614 | * (via knfsd) so that we can build dcache paths to directories effectively. | |
1615 | * | |
1616 | * If a dentry was found and moved, then it is returned. Otherwise NULL | |
1617 | * is returned. This matches the expected return value of ->lookup. | |
1618 | * | |
6d4ade98 SW |
1619 | * Cluster filesystems may call this function with a negative, hashed dentry. |
1620 | * In that case, we know that the inode will be a regular file, and also this | |
1621 | * will only occur during atomic_open. So we need to check for the dentry | |
1622 | * being already hashed only in the final case. | |
1da177e4 LT |
1623 | */ |
1624 | struct dentry *d_splice_alias(struct inode *inode, struct dentry *dentry) | |
1625 | { | |
1626 | struct dentry *new = NULL; | |
1627 | ||
a9049376 AV |
1628 | if (IS_ERR(inode)) |
1629 | return ERR_CAST(inode); | |
1630 | ||
21c0d8fd | 1631 | if (inode && S_ISDIR(inode->i_mode)) { |
873feea0 | 1632 | spin_lock(&inode->i_lock); |
32ba9c3f | 1633 | new = __d_find_alias(inode, 1); |
1da177e4 | 1634 | if (new) { |
32ba9c3f | 1635 | BUG_ON(!(new->d_flags & DCACHE_DISCONNECTED)); |
873feea0 | 1636 | spin_unlock(&inode->i_lock); |
1da177e4 | 1637 | security_d_instantiate(new, inode); |
1da177e4 LT |
1638 | d_move(new, dentry); |
1639 | iput(inode); | |
1640 | } else { | |
873feea0 | 1641 | /* already taking inode->i_lock, so d_add() by hand */ |
360da900 | 1642 | __d_instantiate(dentry, inode); |
873feea0 | 1643 | spin_unlock(&inode->i_lock); |
1da177e4 LT |
1644 | security_d_instantiate(dentry, inode); |
1645 | d_rehash(dentry); | |
1646 | } | |
6d4ade98 SW |
1647 | } else { |
1648 | d_instantiate(dentry, inode); | |
1649 | if (d_unhashed(dentry)) | |
1650 | d_rehash(dentry); | |
1651 | } | |
1da177e4 LT |
1652 | return new; |
1653 | } | |
ec4f8605 | 1654 | EXPORT_SYMBOL(d_splice_alias); |
1da177e4 | 1655 | |
9403540c BN |
1656 | /** |
1657 | * d_add_ci - lookup or allocate new dentry with case-exact name | |
1658 | * @inode: the inode case-insensitive lookup has found | |
1659 | * @dentry: the negative dentry that was passed to the parent's lookup func | |
1660 | * @name: the case-exact name to be associated with the returned dentry | |
1661 | * | |
1662 | * This is to avoid filling the dcache with case-insensitive names to the | |
1663 | * same inode, only the actual correct case is stored in the dcache for | |
1664 | * case-insensitive filesystems. | |
1665 | * | |
1666 | * For a case-insensitive lookup match and if the the case-exact dentry | |
1667 | * already exists in in the dcache, use it and return it. | |
1668 | * | |
1669 | * If no entry exists with the exact case name, allocate new dentry with | |
1670 | * the exact case, and return the spliced entry. | |
1671 | */ | |
e45b590b | 1672 | struct dentry *d_add_ci(struct dentry *dentry, struct inode *inode, |
9403540c BN |
1673 | struct qstr *name) |
1674 | { | |
9403540c BN |
1675 | struct dentry *found; |
1676 | struct dentry *new; | |
1677 | ||
b6520c81 CH |
1678 | /* |
1679 | * First check if a dentry matching the name already exists, | |
1680 | * if not go ahead and create it now. | |
1681 | */ | |
9403540c | 1682 | found = d_hash_and_lookup(dentry->d_parent, name); |
4f522a24 AV |
1683 | if (unlikely(IS_ERR(found))) |
1684 | goto err_out; | |
9403540c BN |
1685 | if (!found) { |
1686 | new = d_alloc(dentry->d_parent, name); | |
1687 | if (!new) { | |
4f522a24 | 1688 | found = ERR_PTR(-ENOMEM); |
9403540c BN |
1689 | goto err_out; |
1690 | } | |
b6520c81 | 1691 | |
9403540c BN |
1692 | found = d_splice_alias(inode, new); |
1693 | if (found) { | |
1694 | dput(new); | |
1695 | return found; | |
1696 | } | |
1697 | return new; | |
1698 | } | |
b6520c81 CH |
1699 | |
1700 | /* | |
1701 | * If a matching dentry exists, and it's not negative use it. | |
1702 | * | |
1703 | * Decrement the reference count to balance the iget() done | |
1704 | * earlier on. | |
1705 | */ | |
9403540c BN |
1706 | if (found->d_inode) { |
1707 | if (unlikely(found->d_inode != inode)) { | |
1708 | /* This can't happen because bad inodes are unhashed. */ | |
1709 | BUG_ON(!is_bad_inode(inode)); | |
1710 | BUG_ON(!is_bad_inode(found->d_inode)); | |
1711 | } | |
9403540c BN |
1712 | iput(inode); |
1713 | return found; | |
1714 | } | |
b6520c81 | 1715 | |
9403540c | 1716 | /* |
9403540c | 1717 | * Negative dentry: instantiate it unless the inode is a directory and |
b6520c81 | 1718 | * already has a dentry. |
9403540c | 1719 | */ |
4513d899 AV |
1720 | new = d_splice_alias(inode, found); |
1721 | if (new) { | |
1722 | dput(found); | |
1723 | found = new; | |
9403540c | 1724 | } |
4513d899 | 1725 | return found; |
9403540c BN |
1726 | |
1727 | err_out: | |
1728 | iput(inode); | |
4f522a24 | 1729 | return found; |
9403540c | 1730 | } |
ec4f8605 | 1731 | EXPORT_SYMBOL(d_add_ci); |
1da177e4 | 1732 | |
12f8ad4b LT |
1733 | /* |
1734 | * Do the slow-case of the dentry name compare. | |
1735 | * | |
1736 | * Unlike the dentry_cmp() function, we need to atomically | |
da53be12 | 1737 | * load the name and length information, so that the |
12f8ad4b LT |
1738 | * filesystem can rely on them, and can use the 'name' and |
1739 | * 'len' information without worrying about walking off the | |
1740 | * end of memory etc. | |
1741 | * | |
1742 | * Thus the read_seqcount_retry() and the "duplicate" info | |
1743 | * in arguments (the low-level filesystem should not look | |
1744 | * at the dentry inode or name contents directly, since | |
1745 | * rename can change them while we're in RCU mode). | |
1746 | */ | |
1747 | enum slow_d_compare { | |
1748 | D_COMP_OK, | |
1749 | D_COMP_NOMATCH, | |
1750 | D_COMP_SEQRETRY, | |
1751 | }; | |
1752 | ||
1753 | static noinline enum slow_d_compare slow_dentry_cmp( | |
1754 | const struct dentry *parent, | |
12f8ad4b LT |
1755 | struct dentry *dentry, |
1756 | unsigned int seq, | |
1757 | const struct qstr *name) | |
1758 | { | |
1759 | int tlen = dentry->d_name.len; | |
1760 | const char *tname = dentry->d_name.name; | |
12f8ad4b LT |
1761 | |
1762 | if (read_seqcount_retry(&dentry->d_seq, seq)) { | |
1763 | cpu_relax(); | |
1764 | return D_COMP_SEQRETRY; | |
1765 | } | |
da53be12 | 1766 | if (parent->d_op->d_compare(parent, dentry, tlen, tname, name)) |
12f8ad4b LT |
1767 | return D_COMP_NOMATCH; |
1768 | return D_COMP_OK; | |
1769 | } | |
1770 | ||
31e6b01f NP |
1771 | /** |
1772 | * __d_lookup_rcu - search for a dentry (racy, store-free) | |
1773 | * @parent: parent dentry | |
1774 | * @name: qstr of name we wish to find | |
1f1e6e52 | 1775 | * @seqp: returns d_seq value at the point where the dentry was found |
31e6b01f NP |
1776 | * Returns: dentry, or NULL |
1777 | * | |
1778 | * __d_lookup_rcu is the dcache lookup function for rcu-walk name | |
1779 | * resolution (store-free path walking) design described in | |
1780 | * Documentation/filesystems/path-lookup.txt. | |
1781 | * | |
1782 | * This is not to be used outside core vfs. | |
1783 | * | |
1784 | * __d_lookup_rcu must only be used in rcu-walk mode, ie. with vfsmount lock | |
1785 | * held, and rcu_read_lock held. The returned dentry must not be stored into | |
1786 | * without taking d_lock and checking d_seq sequence count against @seq | |
1787 | * returned here. | |
1788 | * | |
1789 | * A refcount may be taken on the found dentry with the __d_rcu_to_refcount | |
1790 | * function. | |
1791 | * | |
1792 | * Alternatively, __d_lookup_rcu may be called again to look up the child of | |
1793 | * the returned dentry, so long as its parent's seqlock is checked after the | |
1794 | * child is looked up. Thus, an interlocking stepping of sequence lock checks | |
1795 | * is formed, giving integrity down the path walk. | |
12f8ad4b LT |
1796 | * |
1797 | * NOTE! The caller *has* to check the resulting dentry against the sequence | |
1798 | * number we've returned before using any of the resulting dentry state! | |
31e6b01f | 1799 | */ |
8966be90 LT |
1800 | struct dentry *__d_lookup_rcu(const struct dentry *parent, |
1801 | const struct qstr *name, | |
da53be12 | 1802 | unsigned *seqp) |
31e6b01f | 1803 | { |
26fe5750 | 1804 | u64 hashlen = name->hash_len; |
31e6b01f | 1805 | const unsigned char *str = name->name; |
26fe5750 | 1806 | struct hlist_bl_head *b = d_hash(parent, hashlen_hash(hashlen)); |
ceb5bdc2 | 1807 | struct hlist_bl_node *node; |
31e6b01f NP |
1808 | struct dentry *dentry; |
1809 | ||
1810 | /* | |
1811 | * Note: There is significant duplication with __d_lookup_rcu which is | |
1812 | * required to prevent single threaded performance regressions | |
1813 | * especially on architectures where smp_rmb (in seqcounts) are costly. | |
1814 | * Keep the two functions in sync. | |
1815 | */ | |
1816 | ||
1817 | /* | |
1818 | * The hash list is protected using RCU. | |
1819 | * | |
1820 | * Carefully use d_seq when comparing a candidate dentry, to avoid | |
1821 | * races with d_move(). | |
1822 | * | |
1823 | * It is possible that concurrent renames can mess up our list | |
1824 | * walk here and result in missing our dentry, resulting in the | |
1825 | * false-negative result. d_lookup() protects against concurrent | |
1826 | * renames using rename_lock seqlock. | |
1827 | * | |
b0a4bb83 | 1828 | * See Documentation/filesystems/path-lookup.txt for more details. |
31e6b01f | 1829 | */ |
b07ad996 | 1830 | hlist_bl_for_each_entry_rcu(dentry, node, b, d_hash) { |
8966be90 | 1831 | unsigned seq; |
31e6b01f | 1832 | |
31e6b01f | 1833 | seqretry: |
12f8ad4b LT |
1834 | /* |
1835 | * The dentry sequence count protects us from concurrent | |
da53be12 | 1836 | * renames, and thus protects parent and name fields. |
12f8ad4b LT |
1837 | * |
1838 | * The caller must perform a seqcount check in order | |
da53be12 | 1839 | * to do anything useful with the returned dentry. |
12f8ad4b LT |
1840 | * |
1841 | * NOTE! We do a "raw" seqcount_begin here. That means that | |
1842 | * we don't wait for the sequence count to stabilize if it | |
1843 | * is in the middle of a sequence change. If we do the slow | |
1844 | * dentry compare, we will do seqretries until it is stable, | |
1845 | * and if we end up with a successful lookup, we actually | |
1846 | * want to exit RCU lookup anyway. | |
1847 | */ | |
1848 | seq = raw_seqcount_begin(&dentry->d_seq); | |
31e6b01f NP |
1849 | if (dentry->d_parent != parent) |
1850 | continue; | |
2e321806 LT |
1851 | if (d_unhashed(dentry)) |
1852 | continue; | |
12f8ad4b | 1853 | |
830c0f0e | 1854 | if (unlikely(parent->d_flags & DCACHE_OP_COMPARE)) { |
26fe5750 LT |
1855 | if (dentry->d_name.hash != hashlen_hash(hashlen)) |
1856 | continue; | |
da53be12 LT |
1857 | *seqp = seq; |
1858 | switch (slow_dentry_cmp(parent, dentry, seq, name)) { | |
12f8ad4b LT |
1859 | case D_COMP_OK: |
1860 | return dentry; | |
1861 | case D_COMP_NOMATCH: | |
31e6b01f | 1862 | continue; |
12f8ad4b LT |
1863 | default: |
1864 | goto seqretry; | |
1865 | } | |
31e6b01f | 1866 | } |
12f8ad4b | 1867 | |
26fe5750 | 1868 | if (dentry->d_name.hash_len != hashlen) |
ee983e89 | 1869 | continue; |
da53be12 | 1870 | *seqp = seq; |
26fe5750 | 1871 | if (!dentry_cmp(dentry, str, hashlen_len(hashlen))) |
12f8ad4b | 1872 | return dentry; |
31e6b01f NP |
1873 | } |
1874 | return NULL; | |
1875 | } | |
1876 | ||
1da177e4 LT |
1877 | /** |
1878 | * d_lookup - search for a dentry | |
1879 | * @parent: parent dentry | |
1880 | * @name: qstr of name we wish to find | |
b04f784e | 1881 | * Returns: dentry, or NULL |
1da177e4 | 1882 | * |
b04f784e NP |
1883 | * d_lookup searches the children of the parent dentry for the name in |
1884 | * question. If the dentry is found its reference count is incremented and the | |
1885 | * dentry is returned. The caller must use dput to free the entry when it has | |
1886 | * finished using it. %NULL is returned if the dentry does not exist. | |
1da177e4 | 1887 | */ |
da2d8455 | 1888 | struct dentry *d_lookup(const struct dentry *parent, const struct qstr *name) |
1da177e4 | 1889 | { |
31e6b01f | 1890 | struct dentry *dentry; |
949854d0 | 1891 | unsigned seq; |
1da177e4 LT |
1892 | |
1893 | do { | |
1894 | seq = read_seqbegin(&rename_lock); | |
1895 | dentry = __d_lookup(parent, name); | |
1896 | if (dentry) | |
1897 | break; | |
1898 | } while (read_seqretry(&rename_lock, seq)); | |
1899 | return dentry; | |
1900 | } | |
ec4f8605 | 1901 | EXPORT_SYMBOL(d_lookup); |
1da177e4 | 1902 | |
31e6b01f | 1903 | /** |
b04f784e NP |
1904 | * __d_lookup - search for a dentry (racy) |
1905 | * @parent: parent dentry | |
1906 | * @name: qstr of name we wish to find | |
1907 | * Returns: dentry, or NULL | |
1908 | * | |
1909 | * __d_lookup is like d_lookup, however it may (rarely) return a | |
1910 | * false-negative result due to unrelated rename activity. | |
1911 | * | |
1912 | * __d_lookup is slightly faster by avoiding rename_lock read seqlock, | |
1913 | * however it must be used carefully, eg. with a following d_lookup in | |
1914 | * the case of failure. | |
1915 | * | |
1916 | * __d_lookup callers must be commented. | |
1917 | */ | |
a713ca2a | 1918 | struct dentry *__d_lookup(const struct dentry *parent, const struct qstr *name) |
1da177e4 LT |
1919 | { |
1920 | unsigned int len = name->len; | |
1921 | unsigned int hash = name->hash; | |
1922 | const unsigned char *str = name->name; | |
b07ad996 | 1923 | struct hlist_bl_head *b = d_hash(parent, hash); |
ceb5bdc2 | 1924 | struct hlist_bl_node *node; |
31e6b01f | 1925 | struct dentry *found = NULL; |
665a7583 | 1926 | struct dentry *dentry; |
1da177e4 | 1927 | |
31e6b01f NP |
1928 | /* |
1929 | * Note: There is significant duplication with __d_lookup_rcu which is | |
1930 | * required to prevent single threaded performance regressions | |
1931 | * especially on architectures where smp_rmb (in seqcounts) are costly. | |
1932 | * Keep the two functions in sync. | |
1933 | */ | |
1934 | ||
b04f784e NP |
1935 | /* |
1936 | * The hash list is protected using RCU. | |
1937 | * | |
1938 | * Take d_lock when comparing a candidate dentry, to avoid races | |
1939 | * with d_move(). | |
1940 | * | |
1941 | * It is possible that concurrent renames can mess up our list | |
1942 | * walk here and result in missing our dentry, resulting in the | |
1943 | * false-negative result. d_lookup() protects against concurrent | |
1944 | * renames using rename_lock seqlock. | |
1945 | * | |
b0a4bb83 | 1946 | * See Documentation/filesystems/path-lookup.txt for more details. |
b04f784e | 1947 | */ |
1da177e4 LT |
1948 | rcu_read_lock(); |
1949 | ||
b07ad996 | 1950 | hlist_bl_for_each_entry_rcu(dentry, node, b, d_hash) { |
1da177e4 | 1951 | |
1da177e4 LT |
1952 | if (dentry->d_name.hash != hash) |
1953 | continue; | |
1da177e4 LT |
1954 | |
1955 | spin_lock(&dentry->d_lock); | |
1da177e4 LT |
1956 | if (dentry->d_parent != parent) |
1957 | goto next; | |
d0185c08 LT |
1958 | if (d_unhashed(dentry)) |
1959 | goto next; | |
1960 | ||
1da177e4 LT |
1961 | /* |
1962 | * It is safe to compare names since d_move() cannot | |
1963 | * change the qstr (protected by d_lock). | |
1964 | */ | |
fb045adb | 1965 | if (parent->d_flags & DCACHE_OP_COMPARE) { |
12f8ad4b LT |
1966 | int tlen = dentry->d_name.len; |
1967 | const char *tname = dentry->d_name.name; | |
da53be12 | 1968 | if (parent->d_op->d_compare(parent, dentry, tlen, tname, name)) |
1da177e4 LT |
1969 | goto next; |
1970 | } else { | |
ee983e89 LT |
1971 | if (dentry->d_name.len != len) |
1972 | goto next; | |
12f8ad4b | 1973 | if (dentry_cmp(dentry, str, len)) |
1da177e4 LT |
1974 | goto next; |
1975 | } | |
1976 | ||
98474236 | 1977 | dentry->d_lockref.count++; |
d0185c08 | 1978 | found = dentry; |
1da177e4 LT |
1979 | spin_unlock(&dentry->d_lock); |
1980 | break; | |
1981 | next: | |
1982 | spin_unlock(&dentry->d_lock); | |
1983 | } | |
1984 | rcu_read_unlock(); | |
1985 | ||
1986 | return found; | |
1987 | } | |
1988 | ||
3e7e241f EB |
1989 | /** |
1990 | * d_hash_and_lookup - hash the qstr then search for a dentry | |
1991 | * @dir: Directory to search in | |
1992 | * @name: qstr of name we wish to find | |
1993 | * | |
4f522a24 | 1994 | * On lookup failure NULL is returned; on bad name - ERR_PTR(-error) |
3e7e241f EB |
1995 | */ |
1996 | struct dentry *d_hash_and_lookup(struct dentry *dir, struct qstr *name) | |
1997 | { | |
3e7e241f EB |
1998 | /* |
1999 | * Check for a fs-specific hash function. Note that we must | |
2000 | * calculate the standard hash first, as the d_op->d_hash() | |
2001 | * routine may choose to leave the hash value unchanged. | |
2002 | */ | |
2003 | name->hash = full_name_hash(name->name, name->len); | |
fb045adb | 2004 | if (dir->d_flags & DCACHE_OP_HASH) { |
da53be12 | 2005 | int err = dir->d_op->d_hash(dir, name); |
4f522a24 AV |
2006 | if (unlikely(err < 0)) |
2007 | return ERR_PTR(err); | |
3e7e241f | 2008 | } |
4f522a24 | 2009 | return d_lookup(dir, name); |
3e7e241f | 2010 | } |
4f522a24 | 2011 | EXPORT_SYMBOL(d_hash_and_lookup); |
3e7e241f | 2012 | |
1da177e4 | 2013 | /** |
786a5e15 | 2014 | * d_validate - verify dentry provided from insecure source (deprecated) |
1da177e4 | 2015 | * @dentry: The dentry alleged to be valid child of @dparent |
ff5fdb61 | 2016 | * @dparent: The parent dentry (known to be valid) |
1da177e4 LT |
2017 | * |
2018 | * An insecure source has sent us a dentry, here we verify it and dget() it. | |
2019 | * This is used by ncpfs in its readdir implementation. | |
2020 | * Zero is returned in the dentry is invalid. | |
786a5e15 NP |
2021 | * |
2022 | * This function is slow for big directories, and deprecated, do not use it. | |
1da177e4 | 2023 | */ |
d3a23e16 | 2024 | int d_validate(struct dentry *dentry, struct dentry *dparent) |
1da177e4 | 2025 | { |
786a5e15 | 2026 | struct dentry *child; |
d3a23e16 | 2027 | |
2fd6b7f5 | 2028 | spin_lock(&dparent->d_lock); |
786a5e15 NP |
2029 | list_for_each_entry(child, &dparent->d_subdirs, d_u.d_child) { |
2030 | if (dentry == child) { | |
2fd6b7f5 | 2031 | spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED); |
dc0474be | 2032 | __dget_dlock(dentry); |
2fd6b7f5 NP |
2033 | spin_unlock(&dentry->d_lock); |
2034 | spin_unlock(&dparent->d_lock); | |
1da177e4 LT |
2035 | return 1; |
2036 | } | |
2037 | } | |
2fd6b7f5 | 2038 | spin_unlock(&dparent->d_lock); |
786a5e15 | 2039 | |
1da177e4 LT |
2040 | return 0; |
2041 | } | |
ec4f8605 | 2042 | EXPORT_SYMBOL(d_validate); |
1da177e4 LT |
2043 | |
2044 | /* | |
2045 | * When a file is deleted, we have two options: | |
2046 | * - turn this dentry into a negative dentry | |
2047 | * - unhash this dentry and free it. | |
2048 | * | |
2049 | * Usually, we want to just turn this into | |
2050 | * a negative dentry, but if anybody else is | |
2051 | * currently using the dentry or the inode | |
2052 | * we can't do that and we fall back on removing | |
2053 | * it from the hash queues and waiting for | |
2054 | * it to be deleted later when it has no users | |
2055 | */ | |
2056 | ||
2057 | /** | |
2058 | * d_delete - delete a dentry | |
2059 | * @dentry: The dentry to delete | |
2060 | * | |
2061 | * Turn the dentry into a negative dentry if possible, otherwise | |
2062 | * remove it from the hash queues so it can be deleted later | |
2063 | */ | |
2064 | ||
2065 | void d_delete(struct dentry * dentry) | |
2066 | { | |
873feea0 | 2067 | struct inode *inode; |
7a91bf7f | 2068 | int isdir = 0; |
1da177e4 LT |
2069 | /* |
2070 | * Are we the only user? | |
2071 | */ | |
357f8e65 | 2072 | again: |
1da177e4 | 2073 | spin_lock(&dentry->d_lock); |
873feea0 NP |
2074 | inode = dentry->d_inode; |
2075 | isdir = S_ISDIR(inode->i_mode); | |
98474236 | 2076 | if (dentry->d_lockref.count == 1) { |
1fe0c023 | 2077 | if (!spin_trylock(&inode->i_lock)) { |
357f8e65 NP |
2078 | spin_unlock(&dentry->d_lock); |
2079 | cpu_relax(); | |
2080 | goto again; | |
2081 | } | |
13e3c5e5 | 2082 | dentry->d_flags &= ~DCACHE_CANT_MOUNT; |
31e6b01f | 2083 | dentry_unlink_inode(dentry); |
7a91bf7f | 2084 | fsnotify_nameremove(dentry, isdir); |
1da177e4 LT |
2085 | return; |
2086 | } | |
2087 | ||
2088 | if (!d_unhashed(dentry)) | |
2089 | __d_drop(dentry); | |
2090 | ||
2091 | spin_unlock(&dentry->d_lock); | |
7a91bf7f JM |
2092 | |
2093 | fsnotify_nameremove(dentry, isdir); | |
1da177e4 | 2094 | } |
ec4f8605 | 2095 | EXPORT_SYMBOL(d_delete); |
1da177e4 | 2096 | |
b07ad996 | 2097 | static void __d_rehash(struct dentry * entry, struct hlist_bl_head *b) |
1da177e4 | 2098 | { |
ceb5bdc2 | 2099 | BUG_ON(!d_unhashed(entry)); |
1879fd6a | 2100 | hlist_bl_lock(b); |
dea3667b | 2101 | entry->d_flags |= DCACHE_RCUACCESS; |
b07ad996 | 2102 | hlist_bl_add_head_rcu(&entry->d_hash, b); |
1879fd6a | 2103 | hlist_bl_unlock(b); |
1da177e4 LT |
2104 | } |
2105 | ||
770bfad8 DH |
2106 | static void _d_rehash(struct dentry * entry) |
2107 | { | |
2108 | __d_rehash(entry, d_hash(entry->d_parent, entry->d_name.hash)); | |
2109 | } | |
2110 | ||
1da177e4 LT |
2111 | /** |
2112 | * d_rehash - add an entry back to the hash | |
2113 | * @entry: dentry to add to the hash | |
2114 | * | |
2115 | * Adds a dentry to the hash according to its name. | |
2116 | */ | |
2117 | ||
2118 | void d_rehash(struct dentry * entry) | |
2119 | { | |
1da177e4 | 2120 | spin_lock(&entry->d_lock); |
770bfad8 | 2121 | _d_rehash(entry); |
1da177e4 | 2122 | spin_unlock(&entry->d_lock); |
1da177e4 | 2123 | } |
ec4f8605 | 2124 | EXPORT_SYMBOL(d_rehash); |
1da177e4 | 2125 | |
fb2d5b86 NP |
2126 | /** |
2127 | * dentry_update_name_case - update case insensitive dentry with a new name | |
2128 | * @dentry: dentry to be updated | |
2129 | * @name: new name | |
2130 | * | |
2131 | * Update a case insensitive dentry with new case of name. | |
2132 | * | |
2133 | * dentry must have been returned by d_lookup with name @name. Old and new | |
2134 | * name lengths must match (ie. no d_compare which allows mismatched name | |
2135 | * lengths). | |
2136 | * | |
2137 | * Parent inode i_mutex must be held over d_lookup and into this call (to | |
2138 | * keep renames and concurrent inserts, and readdir(2) away). | |
2139 | */ | |
2140 | void dentry_update_name_case(struct dentry *dentry, struct qstr *name) | |
2141 | { | |
7ebfa57f | 2142 | BUG_ON(!mutex_is_locked(&dentry->d_parent->d_inode->i_mutex)); |
fb2d5b86 NP |
2143 | BUG_ON(dentry->d_name.len != name->len); /* d_lookup gives this */ |
2144 | ||
fb2d5b86 | 2145 | spin_lock(&dentry->d_lock); |
31e6b01f | 2146 | write_seqcount_begin(&dentry->d_seq); |
fb2d5b86 | 2147 | memcpy((unsigned char *)dentry->d_name.name, name->name, name->len); |
31e6b01f | 2148 | write_seqcount_end(&dentry->d_seq); |
fb2d5b86 | 2149 | spin_unlock(&dentry->d_lock); |
fb2d5b86 NP |
2150 | } |
2151 | EXPORT_SYMBOL(dentry_update_name_case); | |
2152 | ||
1da177e4 LT |
2153 | static void switch_names(struct dentry *dentry, struct dentry *target) |
2154 | { | |
2155 | if (dname_external(target)) { | |
2156 | if (dname_external(dentry)) { | |
2157 | /* | |
2158 | * Both external: swap the pointers | |
2159 | */ | |
9a8d5bb4 | 2160 | swap(target->d_name.name, dentry->d_name.name); |
1da177e4 LT |
2161 | } else { |
2162 | /* | |
2163 | * dentry:internal, target:external. Steal target's | |
2164 | * storage and make target internal. | |
2165 | */ | |
321bcf92 BF |
2166 | memcpy(target->d_iname, dentry->d_name.name, |
2167 | dentry->d_name.len + 1); | |
1da177e4 LT |
2168 | dentry->d_name.name = target->d_name.name; |
2169 | target->d_name.name = target->d_iname; | |
2170 | } | |
2171 | } else { | |
2172 | if (dname_external(dentry)) { | |
2173 | /* | |
2174 | * dentry:external, target:internal. Give dentry's | |
2175 | * storage to target and make dentry internal | |
2176 | */ | |
2177 | memcpy(dentry->d_iname, target->d_name.name, | |
2178 | target->d_name.len + 1); | |
2179 | target->d_name.name = dentry->d_name.name; | |
2180 | dentry->d_name.name = dentry->d_iname; | |
2181 | } else { | |
2182 | /* | |
2183 | * Both are internal. Just copy target to dentry | |
2184 | */ | |
2185 | memcpy(dentry->d_iname, target->d_name.name, | |
2186 | target->d_name.len + 1); | |
dc711ca3 AV |
2187 | dentry->d_name.len = target->d_name.len; |
2188 | return; | |
1da177e4 LT |
2189 | } |
2190 | } | |
9a8d5bb4 | 2191 | swap(dentry->d_name.len, target->d_name.len); |
1da177e4 LT |
2192 | } |
2193 | ||
2fd6b7f5 NP |
2194 | static void dentry_lock_for_move(struct dentry *dentry, struct dentry *target) |
2195 | { | |
2196 | /* | |
2197 | * XXXX: do we really need to take target->d_lock? | |
2198 | */ | |
2199 | if (IS_ROOT(dentry) || dentry->d_parent == target->d_parent) | |
2200 | spin_lock(&target->d_parent->d_lock); | |
2201 | else { | |
2202 | if (d_ancestor(dentry->d_parent, target->d_parent)) { | |
2203 | spin_lock(&dentry->d_parent->d_lock); | |
2204 | spin_lock_nested(&target->d_parent->d_lock, | |
2205 | DENTRY_D_LOCK_NESTED); | |
2206 | } else { | |
2207 | spin_lock(&target->d_parent->d_lock); | |
2208 | spin_lock_nested(&dentry->d_parent->d_lock, | |
2209 | DENTRY_D_LOCK_NESTED); | |
2210 | } | |
2211 | } | |
2212 | if (target < dentry) { | |
2213 | spin_lock_nested(&target->d_lock, 2); | |
2214 | spin_lock_nested(&dentry->d_lock, 3); | |
2215 | } else { | |
2216 | spin_lock_nested(&dentry->d_lock, 2); | |
2217 | spin_lock_nested(&target->d_lock, 3); | |
2218 | } | |
2219 | } | |
2220 | ||
2221 | static void dentry_unlock_parents_for_move(struct dentry *dentry, | |
2222 | struct dentry *target) | |
2223 | { | |
2224 | if (target->d_parent != dentry->d_parent) | |
2225 | spin_unlock(&dentry->d_parent->d_lock); | |
2226 | if (target->d_parent != target) | |
2227 | spin_unlock(&target->d_parent->d_lock); | |
2228 | } | |
2229 | ||
1da177e4 | 2230 | /* |
2fd6b7f5 NP |
2231 | * When switching names, the actual string doesn't strictly have to |
2232 | * be preserved in the target - because we're dropping the target | |
2233 | * anyway. As such, we can just do a simple memcpy() to copy over | |
2234 | * the new name before we switch. | |
2235 | * | |
2236 | * Note that we have to be a lot more careful about getting the hash | |
2237 | * switched - we have to switch the hash value properly even if it | |
2238 | * then no longer matches the actual (corrupted) string of the target. | |
2239 | * The hash value has to match the hash queue that the dentry is on.. | |
1da177e4 | 2240 | */ |
9eaef27b | 2241 | /* |
18367501 | 2242 | * __d_move - move a dentry |
1da177e4 LT |
2243 | * @dentry: entry to move |
2244 | * @target: new dentry | |
2245 | * | |
2246 | * Update the dcache to reflect the move of a file name. Negative | |
c46c8877 JL |
2247 | * dcache entries should not be moved in this way. Caller must hold |
2248 | * rename_lock, the i_mutex of the source and target directories, | |
2249 | * and the sb->s_vfs_rename_mutex if they differ. See lock_rename(). | |
1da177e4 | 2250 | */ |
18367501 | 2251 | static void __d_move(struct dentry * dentry, struct dentry * target) |
1da177e4 | 2252 | { |
1da177e4 LT |
2253 | if (!dentry->d_inode) |
2254 | printk(KERN_WARNING "VFS: moving negative dcache entry\n"); | |
2255 | ||
2fd6b7f5 NP |
2256 | BUG_ON(d_ancestor(dentry, target)); |
2257 | BUG_ON(d_ancestor(target, dentry)); | |
2258 | ||
2fd6b7f5 | 2259 | dentry_lock_for_move(dentry, target); |
1da177e4 | 2260 | |
31e6b01f NP |
2261 | write_seqcount_begin(&dentry->d_seq); |
2262 | write_seqcount_begin(&target->d_seq); | |
2263 | ||
ceb5bdc2 NP |
2264 | /* __d_drop does write_seqcount_barrier, but they're OK to nest. */ |
2265 | ||
2266 | /* | |
2267 | * Move the dentry to the target hash queue. Don't bother checking | |
2268 | * for the same hash queue because of how unlikely it is. | |
2269 | */ | |
2270 | __d_drop(dentry); | |
789680d1 | 2271 | __d_rehash(dentry, d_hash(target->d_parent, target->d_name.hash)); |
1da177e4 LT |
2272 | |
2273 | /* Unhash the target: dput() will then get rid of it */ | |
2274 | __d_drop(target); | |
2275 | ||
5160ee6f ED |
2276 | list_del(&dentry->d_u.d_child); |
2277 | list_del(&target->d_u.d_child); | |
1da177e4 LT |
2278 | |
2279 | /* Switch the names.. */ | |
2280 | switch_names(dentry, target); | |
9a8d5bb4 | 2281 | swap(dentry->d_name.hash, target->d_name.hash); |
1da177e4 LT |
2282 | |
2283 | /* ... and switch the parents */ | |
2284 | if (IS_ROOT(dentry)) { | |
2285 | dentry->d_parent = target->d_parent; | |
2286 | target->d_parent = target; | |
5160ee6f | 2287 | INIT_LIST_HEAD(&target->d_u.d_child); |
1da177e4 | 2288 | } else { |
9a8d5bb4 | 2289 | swap(dentry->d_parent, target->d_parent); |
1da177e4 LT |
2290 | |
2291 | /* And add them back to the (new) parent lists */ | |
5160ee6f | 2292 | list_add(&target->d_u.d_child, &target->d_parent->d_subdirs); |
1da177e4 LT |
2293 | } |
2294 | ||
5160ee6f | 2295 | list_add(&dentry->d_u.d_child, &dentry->d_parent->d_subdirs); |
2fd6b7f5 | 2296 | |
31e6b01f NP |
2297 | write_seqcount_end(&target->d_seq); |
2298 | write_seqcount_end(&dentry->d_seq); | |
2299 | ||
2fd6b7f5 | 2300 | dentry_unlock_parents_for_move(dentry, target); |
1da177e4 | 2301 | spin_unlock(&target->d_lock); |
c32ccd87 | 2302 | fsnotify_d_move(dentry); |
1da177e4 | 2303 | spin_unlock(&dentry->d_lock); |
18367501 AV |
2304 | } |
2305 | ||
2306 | /* | |
2307 | * d_move - move a dentry | |
2308 | * @dentry: entry to move | |
2309 | * @target: new dentry | |
2310 | * | |
2311 | * Update the dcache to reflect the move of a file name. Negative | |
c46c8877 JL |
2312 | * dcache entries should not be moved in this way. See the locking |
2313 | * requirements for __d_move. | |
18367501 AV |
2314 | */ |
2315 | void d_move(struct dentry *dentry, struct dentry *target) | |
2316 | { | |
2317 | write_seqlock(&rename_lock); | |
2318 | __d_move(dentry, target); | |
1da177e4 | 2319 | write_sequnlock(&rename_lock); |
9eaef27b | 2320 | } |
ec4f8605 | 2321 | EXPORT_SYMBOL(d_move); |
1da177e4 | 2322 | |
e2761a11 OH |
2323 | /** |
2324 | * d_ancestor - search for an ancestor | |
2325 | * @p1: ancestor dentry | |
2326 | * @p2: child dentry | |
2327 | * | |
2328 | * Returns the ancestor dentry of p2 which is a child of p1, if p1 is | |
2329 | * an ancestor of p2, else NULL. | |
9eaef27b | 2330 | */ |
e2761a11 | 2331 | struct dentry *d_ancestor(struct dentry *p1, struct dentry *p2) |
9eaef27b TM |
2332 | { |
2333 | struct dentry *p; | |
2334 | ||
871c0067 | 2335 | for (p = p2; !IS_ROOT(p); p = p->d_parent) { |
9eaef27b | 2336 | if (p->d_parent == p1) |
e2761a11 | 2337 | return p; |
9eaef27b | 2338 | } |
e2761a11 | 2339 | return NULL; |
9eaef27b TM |
2340 | } |
2341 | ||
2342 | /* | |
2343 | * This helper attempts to cope with remotely renamed directories | |
2344 | * | |
2345 | * It assumes that the caller is already holding | |
18367501 | 2346 | * dentry->d_parent->d_inode->i_mutex, inode->i_lock and rename_lock |
9eaef27b TM |
2347 | * |
2348 | * Note: If ever the locking in lock_rename() changes, then please | |
2349 | * remember to update this too... | |
9eaef27b | 2350 | */ |
873feea0 NP |
2351 | static struct dentry *__d_unalias(struct inode *inode, |
2352 | struct dentry *dentry, struct dentry *alias) | |
9eaef27b TM |
2353 | { |
2354 | struct mutex *m1 = NULL, *m2 = NULL; | |
ee3efa91 | 2355 | struct dentry *ret = ERR_PTR(-EBUSY); |
9eaef27b TM |
2356 | |
2357 | /* If alias and dentry share a parent, then no extra locks required */ | |
2358 | if (alias->d_parent == dentry->d_parent) | |
2359 | goto out_unalias; | |
2360 | ||
9eaef27b | 2361 | /* See lock_rename() */ |
9eaef27b TM |
2362 | if (!mutex_trylock(&dentry->d_sb->s_vfs_rename_mutex)) |
2363 | goto out_err; | |
2364 | m1 = &dentry->d_sb->s_vfs_rename_mutex; | |
2365 | if (!mutex_trylock(&alias->d_parent->d_inode->i_mutex)) | |
2366 | goto out_err; | |
2367 | m2 = &alias->d_parent->d_inode->i_mutex; | |
2368 | out_unalias: | |
ee3efa91 AV |
2369 | if (likely(!d_mountpoint(alias))) { |
2370 | __d_move(alias, dentry); | |
2371 | ret = alias; | |
2372 | } | |
9eaef27b | 2373 | out_err: |
873feea0 | 2374 | spin_unlock(&inode->i_lock); |
9eaef27b TM |
2375 | if (m2) |
2376 | mutex_unlock(m2); | |
2377 | if (m1) | |
2378 | mutex_unlock(m1); | |
2379 | return ret; | |
2380 | } | |
2381 | ||
770bfad8 DH |
2382 | /* |
2383 | * Prepare an anonymous dentry for life in the superblock's dentry tree as a | |
2384 | * named dentry in place of the dentry to be replaced. | |
2fd6b7f5 | 2385 | * returns with anon->d_lock held! |
770bfad8 DH |
2386 | */ |
2387 | static void __d_materialise_dentry(struct dentry *dentry, struct dentry *anon) | |
2388 | { | |
740da42e | 2389 | struct dentry *dparent; |
770bfad8 | 2390 | |
2fd6b7f5 | 2391 | dentry_lock_for_move(anon, dentry); |
770bfad8 | 2392 | |
31e6b01f NP |
2393 | write_seqcount_begin(&dentry->d_seq); |
2394 | write_seqcount_begin(&anon->d_seq); | |
2395 | ||
770bfad8 | 2396 | dparent = dentry->d_parent; |
770bfad8 | 2397 | |
2fd6b7f5 NP |
2398 | switch_names(dentry, anon); |
2399 | swap(dentry->d_name.hash, anon->d_name.hash); | |
2400 | ||
740da42e AV |
2401 | dentry->d_parent = dentry; |
2402 | list_del_init(&dentry->d_u.d_child); | |
2403 | anon->d_parent = dparent; | |
9ed53b12 | 2404 | list_move(&anon->d_u.d_child, &dparent->d_subdirs); |
770bfad8 | 2405 | |
31e6b01f NP |
2406 | write_seqcount_end(&dentry->d_seq); |
2407 | write_seqcount_end(&anon->d_seq); | |
2408 | ||
2fd6b7f5 NP |
2409 | dentry_unlock_parents_for_move(anon, dentry); |
2410 | spin_unlock(&dentry->d_lock); | |
2411 | ||
2412 | /* anon->d_lock still locked, returns locked */ | |
770bfad8 DH |
2413 | anon->d_flags &= ~DCACHE_DISCONNECTED; |
2414 | } | |
2415 | ||
2416 | /** | |
2417 | * d_materialise_unique - introduce an inode into the tree | |
2418 | * @dentry: candidate dentry | |
2419 | * @inode: inode to bind to the dentry, to which aliases may be attached | |
2420 | * | |
2421 | * Introduces an dentry into the tree, substituting an extant disconnected | |
c46c8877 JL |
2422 | * root directory alias in its place if there is one. Caller must hold the |
2423 | * i_mutex of the parent directory. | |
770bfad8 DH |
2424 | */ |
2425 | struct dentry *d_materialise_unique(struct dentry *dentry, struct inode *inode) | |
2426 | { | |
9eaef27b | 2427 | struct dentry *actual; |
770bfad8 DH |
2428 | |
2429 | BUG_ON(!d_unhashed(dentry)); | |
2430 | ||
770bfad8 DH |
2431 | if (!inode) { |
2432 | actual = dentry; | |
360da900 | 2433 | __d_instantiate(dentry, NULL); |
357f8e65 NP |
2434 | d_rehash(actual); |
2435 | goto out_nolock; | |
770bfad8 DH |
2436 | } |
2437 | ||
873feea0 | 2438 | spin_lock(&inode->i_lock); |
357f8e65 | 2439 | |
9eaef27b TM |
2440 | if (S_ISDIR(inode->i_mode)) { |
2441 | struct dentry *alias; | |
2442 | ||
2443 | /* Does an aliased dentry already exist? */ | |
32ba9c3f | 2444 | alias = __d_find_alias(inode, 0); |
9eaef27b TM |
2445 | if (alias) { |
2446 | actual = alias; | |
18367501 AV |
2447 | write_seqlock(&rename_lock); |
2448 | ||
2449 | if (d_ancestor(alias, dentry)) { | |
2450 | /* Check for loops */ | |
2451 | actual = ERR_PTR(-ELOOP); | |
b18dafc8 | 2452 | spin_unlock(&inode->i_lock); |
18367501 AV |
2453 | } else if (IS_ROOT(alias)) { |
2454 | /* Is this an anonymous mountpoint that we | |
2455 | * could splice into our tree? */ | |
9eaef27b | 2456 | __d_materialise_dentry(dentry, alias); |
18367501 | 2457 | write_sequnlock(&rename_lock); |
9eaef27b TM |
2458 | __d_drop(alias); |
2459 | goto found; | |
18367501 AV |
2460 | } else { |
2461 | /* Nope, but we must(!) avoid directory | |
b18dafc8 | 2462 | * aliasing. This drops inode->i_lock */ |
18367501 | 2463 | actual = __d_unalias(inode, dentry, alias); |
9eaef27b | 2464 | } |
18367501 | 2465 | write_sequnlock(&rename_lock); |
dd179946 DH |
2466 | if (IS_ERR(actual)) { |
2467 | if (PTR_ERR(actual) == -ELOOP) | |
2468 | pr_warn_ratelimited( | |
2469 | "VFS: Lookup of '%s' in %s %s" | |
2470 | " would have caused loop\n", | |
2471 | dentry->d_name.name, | |
2472 | inode->i_sb->s_type->name, | |
2473 | inode->i_sb->s_id); | |
9eaef27b | 2474 | dput(alias); |
dd179946 | 2475 | } |
9eaef27b TM |
2476 | goto out_nolock; |
2477 | } | |
770bfad8 DH |
2478 | } |
2479 | ||
2480 | /* Add a unique reference */ | |
2481 | actual = __d_instantiate_unique(dentry, inode); | |
2482 | if (!actual) | |
2483 | actual = dentry; | |
357f8e65 NP |
2484 | else |
2485 | BUG_ON(!d_unhashed(actual)); | |
770bfad8 | 2486 | |
770bfad8 DH |
2487 | spin_lock(&actual->d_lock); |
2488 | found: | |
2489 | _d_rehash(actual); | |
2490 | spin_unlock(&actual->d_lock); | |
873feea0 | 2491 | spin_unlock(&inode->i_lock); |
9eaef27b | 2492 | out_nolock: |
770bfad8 DH |
2493 | if (actual == dentry) { |
2494 | security_d_instantiate(dentry, inode); | |
2495 | return NULL; | |
2496 | } | |
2497 | ||
2498 | iput(inode); | |
2499 | return actual; | |
770bfad8 | 2500 | } |
ec4f8605 | 2501 | EXPORT_SYMBOL_GPL(d_materialise_unique); |
770bfad8 | 2502 | |
cdd16d02 | 2503 | static int prepend(char **buffer, int *buflen, const char *str, int namelen) |
6092d048 RP |
2504 | { |
2505 | *buflen -= namelen; | |
2506 | if (*buflen < 0) | |
2507 | return -ENAMETOOLONG; | |
2508 | *buffer -= namelen; | |
2509 | memcpy(*buffer, str, namelen); | |
2510 | return 0; | |
2511 | } | |
2512 | ||
cdd16d02 MS |
2513 | static int prepend_name(char **buffer, int *buflen, struct qstr *name) |
2514 | { | |
2515 | return prepend(buffer, buflen, name->name, name->len); | |
2516 | } | |
2517 | ||
1da177e4 | 2518 | /** |
208898c1 | 2519 | * prepend_path - Prepend path string to a buffer |
9d1bc601 | 2520 | * @path: the dentry/vfsmount to report |
02125a82 | 2521 | * @root: root vfsmnt/dentry |
f2eb6575 MS |
2522 | * @buffer: pointer to the end of the buffer |
2523 | * @buflen: pointer to buffer length | |
552ce544 | 2524 | * |
949854d0 | 2525 | * Caller holds the rename_lock. |
1da177e4 | 2526 | */ |
02125a82 AV |
2527 | static int prepend_path(const struct path *path, |
2528 | const struct path *root, | |
f2eb6575 | 2529 | char **buffer, int *buflen) |
1da177e4 | 2530 | { |
9d1bc601 MS |
2531 | struct dentry *dentry = path->dentry; |
2532 | struct vfsmount *vfsmnt = path->mnt; | |
0714a533 | 2533 | struct mount *mnt = real_mount(vfsmnt); |
f2eb6575 MS |
2534 | bool slash = false; |
2535 | int error = 0; | |
6092d048 | 2536 | |
f2eb6575 | 2537 | while (dentry != root->dentry || vfsmnt != root->mnt) { |
1da177e4 LT |
2538 | struct dentry * parent; |
2539 | ||
1da177e4 | 2540 | if (dentry == vfsmnt->mnt_root || IS_ROOT(dentry)) { |
552ce544 | 2541 | /* Global root? */ |
676da58d | 2542 | if (!mnt_has_parent(mnt)) |
1da177e4 | 2543 | goto global_root; |
a73324da | 2544 | dentry = mnt->mnt_mountpoint; |
0714a533 AV |
2545 | mnt = mnt->mnt_parent; |
2546 | vfsmnt = &mnt->mnt; | |
1da177e4 LT |
2547 | continue; |
2548 | } | |
2549 | parent = dentry->d_parent; | |
2550 | prefetch(parent); | |
9abca360 | 2551 | spin_lock(&dentry->d_lock); |
f2eb6575 | 2552 | error = prepend_name(buffer, buflen, &dentry->d_name); |
9abca360 | 2553 | spin_unlock(&dentry->d_lock); |
f2eb6575 MS |
2554 | if (!error) |
2555 | error = prepend(buffer, buflen, "/", 1); | |
2556 | if (error) | |
2557 | break; | |
2558 | ||
2559 | slash = true; | |
1da177e4 LT |
2560 | dentry = parent; |
2561 | } | |
2562 | ||
f2eb6575 MS |
2563 | if (!error && !slash) |
2564 | error = prepend(buffer, buflen, "/", 1); | |
2565 | ||
f2eb6575 | 2566 | return error; |
1da177e4 LT |
2567 | |
2568 | global_root: | |
98dc568b MS |
2569 | /* |
2570 | * Filesystems needing to implement special "root names" | |
2571 | * should do so with ->d_dname() | |
2572 | */ | |
2573 | if (IS_ROOT(dentry) && | |
2574 | (dentry->d_name.len != 1 || dentry->d_name.name[0] != '/')) { | |
2575 | WARN(1, "Root dentry has weird name <%.*s>\n", | |
2576 | (int) dentry->d_name.len, dentry->d_name.name); | |
2577 | } | |
02125a82 AV |
2578 | if (!slash) |
2579 | error = prepend(buffer, buflen, "/", 1); | |
2580 | if (!error) | |
f7a99c5b | 2581 | error = is_mounted(vfsmnt) ? 1 : 2; |
7ea600b5 | 2582 | return error; |
f2eb6575 | 2583 | } |
be285c71 | 2584 | |
f2eb6575 MS |
2585 | /** |
2586 | * __d_path - return the path of a dentry | |
2587 | * @path: the dentry/vfsmount to report | |
02125a82 | 2588 | * @root: root vfsmnt/dentry |
cd956a1c | 2589 | * @buf: buffer to return value in |
f2eb6575 MS |
2590 | * @buflen: buffer length |
2591 | * | |
ffd1f4ed | 2592 | * Convert a dentry into an ASCII path name. |
f2eb6575 MS |
2593 | * |
2594 | * Returns a pointer into the buffer or an error code if the | |
2595 | * path was too long. | |
2596 | * | |
be148247 | 2597 | * "buflen" should be positive. |
f2eb6575 | 2598 | * |
02125a82 | 2599 | * If the path is not reachable from the supplied root, return %NULL. |
f2eb6575 | 2600 | */ |
02125a82 AV |
2601 | char *__d_path(const struct path *path, |
2602 | const struct path *root, | |
f2eb6575 MS |
2603 | char *buf, int buflen) |
2604 | { | |
2605 | char *res = buf + buflen; | |
2606 | int error; | |
2607 | ||
2608 | prepend(&res, &buflen, "\0", 1); | |
7ea600b5 | 2609 | br_read_lock(&vfsmount_lock); |
949854d0 | 2610 | write_seqlock(&rename_lock); |
f2eb6575 | 2611 | error = prepend_path(path, root, &res, &buflen); |
949854d0 | 2612 | write_sequnlock(&rename_lock); |
7ea600b5 | 2613 | br_read_unlock(&vfsmount_lock); |
be148247 | 2614 | |
02125a82 AV |
2615 | if (error < 0) |
2616 | return ERR_PTR(error); | |
2617 | if (error > 0) | |
2618 | return NULL; | |
2619 | return res; | |
2620 | } | |
2621 | ||
2622 | char *d_absolute_path(const struct path *path, | |
2623 | char *buf, int buflen) | |
2624 | { | |
2625 | struct path root = {}; | |
2626 | char *res = buf + buflen; | |
2627 | int error; | |
2628 | ||
2629 | prepend(&res, &buflen, "\0", 1); | |
7ea600b5 | 2630 | br_read_lock(&vfsmount_lock); |
02125a82 AV |
2631 | write_seqlock(&rename_lock); |
2632 | error = prepend_path(path, &root, &res, &buflen); | |
2633 | write_sequnlock(&rename_lock); | |
7ea600b5 | 2634 | br_read_unlock(&vfsmount_lock); |
02125a82 AV |
2635 | |
2636 | if (error > 1) | |
2637 | error = -EINVAL; | |
2638 | if (error < 0) | |
f2eb6575 | 2639 | return ERR_PTR(error); |
f2eb6575 | 2640 | return res; |
1da177e4 LT |
2641 | } |
2642 | ||
ffd1f4ed MS |
2643 | /* |
2644 | * same as __d_path but appends "(deleted)" for unlinked files. | |
2645 | */ | |
02125a82 AV |
2646 | static int path_with_deleted(const struct path *path, |
2647 | const struct path *root, | |
2648 | char **buf, int *buflen) | |
ffd1f4ed MS |
2649 | { |
2650 | prepend(buf, buflen, "\0", 1); | |
2651 | if (d_unlinked(path->dentry)) { | |
2652 | int error = prepend(buf, buflen, " (deleted)", 10); | |
2653 | if (error) | |
2654 | return error; | |
2655 | } | |
2656 | ||
2657 | return prepend_path(path, root, buf, buflen); | |
2658 | } | |
2659 | ||
8df9d1a4 MS |
2660 | static int prepend_unreachable(char **buffer, int *buflen) |
2661 | { | |
2662 | return prepend(buffer, buflen, "(unreachable)", 13); | |
2663 | } | |
2664 | ||
a03a8a70 JB |
2665 | /** |
2666 | * d_path - return the path of a dentry | |
cf28b486 | 2667 | * @path: path to report |
a03a8a70 JB |
2668 | * @buf: buffer to return value in |
2669 | * @buflen: buffer length | |
2670 | * | |
2671 | * Convert a dentry into an ASCII path name. If the entry has been deleted | |
2672 | * the string " (deleted)" is appended. Note that this is ambiguous. | |
2673 | * | |
52afeefb AV |
2674 | * Returns a pointer into the buffer or an error code if the path was |
2675 | * too long. Note: Callers should use the returned pointer, not the passed | |
2676 | * in buffer, to use the name! The implementation often starts at an offset | |
2677 | * into the buffer, and may leave 0 bytes at the start. | |
a03a8a70 | 2678 | * |
31f3e0b3 | 2679 | * "buflen" should be positive. |
a03a8a70 | 2680 | */ |
20d4fdc1 | 2681 | char *d_path(const struct path *path, char *buf, int buflen) |
1da177e4 | 2682 | { |
ffd1f4ed | 2683 | char *res = buf + buflen; |
6ac08c39 | 2684 | struct path root; |
ffd1f4ed | 2685 | int error; |
1da177e4 | 2686 | |
c23fbb6b ED |
2687 | /* |
2688 | * We have various synthetic filesystems that never get mounted. On | |
2689 | * these filesystems dentries are never used for lookup purposes, and | |
2690 | * thus don't need to be hashed. They also don't need a name until a | |
2691 | * user wants to identify the object in /proc/pid/fd/. The little hack | |
2692 | * below allows us to generate a name for these objects on demand: | |
2693 | */ | |
cf28b486 JB |
2694 | if (path->dentry->d_op && path->dentry->d_op->d_dname) |
2695 | return path->dentry->d_op->d_dname(path->dentry, buf, buflen); | |
c23fbb6b | 2696 | |
f7ad3c6b | 2697 | get_fs_root(current->fs, &root); |
7ea600b5 | 2698 | br_read_lock(&vfsmount_lock); |
949854d0 | 2699 | write_seqlock(&rename_lock); |
02125a82 | 2700 | error = path_with_deleted(path, &root, &res, &buflen); |
7ea600b5 AV |
2701 | write_sequnlock(&rename_lock); |
2702 | br_read_unlock(&vfsmount_lock); | |
02125a82 | 2703 | if (error < 0) |
ffd1f4ed | 2704 | res = ERR_PTR(error); |
6ac08c39 | 2705 | path_put(&root); |
1da177e4 LT |
2706 | return res; |
2707 | } | |
ec4f8605 | 2708 | EXPORT_SYMBOL(d_path); |
1da177e4 | 2709 | |
c23fbb6b ED |
2710 | /* |
2711 | * Helper function for dentry_operations.d_dname() members | |
2712 | */ | |
2713 | char *dynamic_dname(struct dentry *dentry, char *buffer, int buflen, | |
2714 | const char *fmt, ...) | |
2715 | { | |
2716 | va_list args; | |
2717 | char temp[64]; | |
2718 | int sz; | |
2719 | ||
2720 | va_start(args, fmt); | |
2721 | sz = vsnprintf(temp, sizeof(temp), fmt, args) + 1; | |
2722 | va_end(args); | |
2723 | ||
2724 | if (sz > sizeof(temp) || sz > buflen) | |
2725 | return ERR_PTR(-ENAMETOOLONG); | |
2726 | ||
2727 | buffer += buflen - sz; | |
2728 | return memcpy(buffer, temp, sz); | |
2729 | } | |
2730 | ||
118b2302 AV |
2731 | char *simple_dname(struct dentry *dentry, char *buffer, int buflen) |
2732 | { | |
2733 | char *end = buffer + buflen; | |
2734 | /* these dentries are never renamed, so d_lock is not needed */ | |
2735 | if (prepend(&end, &buflen, " (deleted)", 11) || | |
2736 | prepend_name(&end, &buflen, &dentry->d_name) || | |
2737 | prepend(&end, &buflen, "/", 1)) | |
2738 | end = ERR_PTR(-ENAMETOOLONG); | |
2739 | return end; | |
2740 | } | |
2741 | ||
6092d048 RP |
2742 | /* |
2743 | * Write full pathname from the root of the filesystem into the buffer. | |
2744 | */ | |
ec2447c2 | 2745 | static char *__dentry_path(struct dentry *dentry, char *buf, int buflen) |
6092d048 RP |
2746 | { |
2747 | char *end = buf + buflen; | |
2748 | char *retval; | |
2749 | ||
6092d048 | 2750 | prepend(&end, &buflen, "\0", 1); |
6092d048 RP |
2751 | if (buflen < 1) |
2752 | goto Elong; | |
2753 | /* Get '/' right */ | |
2754 | retval = end-1; | |
2755 | *retval = '/'; | |
2756 | ||
cdd16d02 MS |
2757 | while (!IS_ROOT(dentry)) { |
2758 | struct dentry *parent = dentry->d_parent; | |
9abca360 | 2759 | int error; |
6092d048 | 2760 | |
6092d048 | 2761 | prefetch(parent); |
9abca360 NP |
2762 | spin_lock(&dentry->d_lock); |
2763 | error = prepend_name(&end, &buflen, &dentry->d_name); | |
2764 | spin_unlock(&dentry->d_lock); | |
2765 | if (error != 0 || prepend(&end, &buflen, "/", 1) != 0) | |
6092d048 RP |
2766 | goto Elong; |
2767 | ||
2768 | retval = end; | |
2769 | dentry = parent; | |
2770 | } | |
c103135c AV |
2771 | return retval; |
2772 | Elong: | |
2773 | return ERR_PTR(-ENAMETOOLONG); | |
2774 | } | |
ec2447c2 NP |
2775 | |
2776 | char *dentry_path_raw(struct dentry *dentry, char *buf, int buflen) | |
2777 | { | |
2778 | char *retval; | |
2779 | ||
949854d0 | 2780 | write_seqlock(&rename_lock); |
ec2447c2 | 2781 | retval = __dentry_path(dentry, buf, buflen); |
949854d0 | 2782 | write_sequnlock(&rename_lock); |
ec2447c2 NP |
2783 | |
2784 | return retval; | |
2785 | } | |
2786 | EXPORT_SYMBOL(dentry_path_raw); | |
c103135c AV |
2787 | |
2788 | char *dentry_path(struct dentry *dentry, char *buf, int buflen) | |
2789 | { | |
2790 | char *p = NULL; | |
2791 | char *retval; | |
2792 | ||
949854d0 | 2793 | write_seqlock(&rename_lock); |
c103135c AV |
2794 | if (d_unlinked(dentry)) { |
2795 | p = buf + buflen; | |
2796 | if (prepend(&p, &buflen, "//deleted", 10) != 0) | |
2797 | goto Elong; | |
2798 | buflen++; | |
2799 | } | |
2800 | retval = __dentry_path(dentry, buf, buflen); | |
949854d0 | 2801 | write_sequnlock(&rename_lock); |
c103135c AV |
2802 | if (!IS_ERR(retval) && p) |
2803 | *p = '/'; /* restore '/' overriden with '\0' */ | |
6092d048 RP |
2804 | return retval; |
2805 | Elong: | |
6092d048 RP |
2806 | return ERR_PTR(-ENAMETOOLONG); |
2807 | } | |
2808 | ||
1da177e4 LT |
2809 | /* |
2810 | * NOTE! The user-level library version returns a | |
2811 | * character pointer. The kernel system call just | |
2812 | * returns the length of the buffer filled (which | |
2813 | * includes the ending '\0' character), or a negative | |
2814 | * error value. So libc would do something like | |
2815 | * | |
2816 | * char *getcwd(char * buf, size_t size) | |
2817 | * { | |
2818 | * int retval; | |
2819 | * | |
2820 | * retval = sys_getcwd(buf, size); | |
2821 | * if (retval >= 0) | |
2822 | * return buf; | |
2823 | * errno = -retval; | |
2824 | * return NULL; | |
2825 | * } | |
2826 | */ | |
3cdad428 | 2827 | SYSCALL_DEFINE2(getcwd, char __user *, buf, unsigned long, size) |
1da177e4 | 2828 | { |
552ce544 | 2829 | int error; |
6ac08c39 | 2830 | struct path pwd, root; |
552ce544 | 2831 | char *page = (char *) __get_free_page(GFP_USER); |
1da177e4 LT |
2832 | |
2833 | if (!page) | |
2834 | return -ENOMEM; | |
2835 | ||
f7ad3c6b | 2836 | get_fs_root_and_pwd(current->fs, &root, &pwd); |
1da177e4 | 2837 | |
552ce544 | 2838 | error = -ENOENT; |
7ea600b5 | 2839 | br_read_lock(&vfsmount_lock); |
949854d0 | 2840 | write_seqlock(&rename_lock); |
f3da392e | 2841 | if (!d_unlinked(pwd.dentry)) { |
552ce544 | 2842 | unsigned long len; |
8df9d1a4 MS |
2843 | char *cwd = page + PAGE_SIZE; |
2844 | int buflen = PAGE_SIZE; | |
1da177e4 | 2845 | |
8df9d1a4 | 2846 | prepend(&cwd, &buflen, "\0", 1); |
02125a82 | 2847 | error = prepend_path(&pwd, &root, &cwd, &buflen); |
949854d0 | 2848 | write_sequnlock(&rename_lock); |
7ea600b5 | 2849 | br_read_unlock(&vfsmount_lock); |
552ce544 | 2850 | |
02125a82 | 2851 | if (error < 0) |
552ce544 LT |
2852 | goto out; |
2853 | ||
8df9d1a4 | 2854 | /* Unreachable from current root */ |
02125a82 | 2855 | if (error > 0) { |
8df9d1a4 MS |
2856 | error = prepend_unreachable(&cwd, &buflen); |
2857 | if (error) | |
2858 | goto out; | |
2859 | } | |
2860 | ||
552ce544 LT |
2861 | error = -ERANGE; |
2862 | len = PAGE_SIZE + page - cwd; | |
2863 | if (len <= size) { | |
2864 | error = len; | |
2865 | if (copy_to_user(buf, cwd, len)) | |
2866 | error = -EFAULT; | |
2867 | } | |
949854d0 NP |
2868 | } else { |
2869 | write_sequnlock(&rename_lock); | |
7ea600b5 | 2870 | br_read_unlock(&vfsmount_lock); |
949854d0 | 2871 | } |
1da177e4 LT |
2872 | |
2873 | out: | |
6ac08c39 JB |
2874 | path_put(&pwd); |
2875 | path_put(&root); | |
1da177e4 LT |
2876 | free_page((unsigned long) page); |
2877 | return error; | |
2878 | } | |
2879 | ||
2880 | /* | |
2881 | * Test whether new_dentry is a subdirectory of old_dentry. | |
2882 | * | |
2883 | * Trivially implemented using the dcache structure | |
2884 | */ | |
2885 | ||
2886 | /** | |
2887 | * is_subdir - is new dentry a subdirectory of old_dentry | |
2888 | * @new_dentry: new dentry | |
2889 | * @old_dentry: old dentry | |
2890 | * | |
2891 | * Returns 1 if new_dentry is a subdirectory of the parent (at any depth). | |
2892 | * Returns 0 otherwise. | |
2893 | * Caller must ensure that "new_dentry" is pinned before calling is_subdir() | |
2894 | */ | |
2895 | ||
e2761a11 | 2896 | int is_subdir(struct dentry *new_dentry, struct dentry *old_dentry) |
1da177e4 LT |
2897 | { |
2898 | int result; | |
949854d0 | 2899 | unsigned seq; |
1da177e4 | 2900 | |
e2761a11 OH |
2901 | if (new_dentry == old_dentry) |
2902 | return 1; | |
2903 | ||
e2761a11 | 2904 | do { |
1da177e4 | 2905 | /* for restarting inner loop in case of seq retry */ |
1da177e4 | 2906 | seq = read_seqbegin(&rename_lock); |
949854d0 NP |
2907 | /* |
2908 | * Need rcu_readlock to protect against the d_parent trashing | |
2909 | * due to d_move | |
2910 | */ | |
2911 | rcu_read_lock(); | |
e2761a11 | 2912 | if (d_ancestor(old_dentry, new_dentry)) |
1da177e4 | 2913 | result = 1; |
e2761a11 OH |
2914 | else |
2915 | result = 0; | |
949854d0 | 2916 | rcu_read_unlock(); |
1da177e4 | 2917 | } while (read_seqretry(&rename_lock, seq)); |
1da177e4 LT |
2918 | |
2919 | return result; | |
2920 | } | |
2921 | ||
2922 | void d_genocide(struct dentry *root) | |
2923 | { | |
949854d0 | 2924 | struct dentry *this_parent; |
1da177e4 | 2925 | struct list_head *next; |
949854d0 | 2926 | unsigned seq; |
58db63d0 | 2927 | int locked = 0; |
1da177e4 | 2928 | |
949854d0 | 2929 | seq = read_seqbegin(&rename_lock); |
58db63d0 NP |
2930 | again: |
2931 | this_parent = root; | |
2fd6b7f5 | 2932 | spin_lock(&this_parent->d_lock); |
1da177e4 LT |
2933 | repeat: |
2934 | next = this_parent->d_subdirs.next; | |
2935 | resume: | |
2936 | while (next != &this_parent->d_subdirs) { | |
2937 | struct list_head *tmp = next; | |
5160ee6f | 2938 | struct dentry *dentry = list_entry(tmp, struct dentry, d_u.d_child); |
1da177e4 | 2939 | next = tmp->next; |
949854d0 | 2940 | |
da502956 NP |
2941 | spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED); |
2942 | if (d_unhashed(dentry) || !dentry->d_inode) { | |
2943 | spin_unlock(&dentry->d_lock); | |
1da177e4 | 2944 | continue; |
da502956 | 2945 | } |
1da177e4 | 2946 | if (!list_empty(&dentry->d_subdirs)) { |
2fd6b7f5 NP |
2947 | spin_unlock(&this_parent->d_lock); |
2948 | spin_release(&dentry->d_lock.dep_map, 1, _RET_IP_); | |
1da177e4 | 2949 | this_parent = dentry; |
2fd6b7f5 | 2950 | spin_acquire(&this_parent->d_lock.dep_map, 0, 1, _RET_IP_); |
1da177e4 LT |
2951 | goto repeat; |
2952 | } | |
949854d0 NP |
2953 | if (!(dentry->d_flags & DCACHE_GENOCIDE)) { |
2954 | dentry->d_flags |= DCACHE_GENOCIDE; | |
98474236 | 2955 | dentry->d_lockref.count--; |
949854d0 | 2956 | } |
b7ab39f6 | 2957 | spin_unlock(&dentry->d_lock); |
1da177e4 LT |
2958 | } |
2959 | if (this_parent != root) { | |
c826cb7d | 2960 | struct dentry *child = this_parent; |
949854d0 NP |
2961 | if (!(this_parent->d_flags & DCACHE_GENOCIDE)) { |
2962 | this_parent->d_flags |= DCACHE_GENOCIDE; | |
98474236 | 2963 | this_parent->d_lockref.count--; |
949854d0 | 2964 | } |
c826cb7d LT |
2965 | this_parent = try_to_ascend(this_parent, locked, seq); |
2966 | if (!this_parent) | |
949854d0 | 2967 | goto rename_retry; |
949854d0 | 2968 | next = child->d_u.d_child.next; |
1da177e4 LT |
2969 | goto resume; |
2970 | } | |
2fd6b7f5 | 2971 | spin_unlock(&this_parent->d_lock); |
58db63d0 | 2972 | if (!locked && read_seqretry(&rename_lock, seq)) |
949854d0 | 2973 | goto rename_retry; |
58db63d0 NP |
2974 | if (locked) |
2975 | write_sequnlock(&rename_lock); | |
2976 | return; | |
2977 | ||
2978 | rename_retry: | |
8110e16d MS |
2979 | if (locked) |
2980 | goto again; | |
58db63d0 NP |
2981 | locked = 1; |
2982 | write_seqlock(&rename_lock); | |
2983 | goto again; | |
1da177e4 LT |
2984 | } |
2985 | ||
60545d0d | 2986 | void d_tmpfile(struct dentry *dentry, struct inode *inode) |
1da177e4 | 2987 | { |
60545d0d AV |
2988 | inode_dec_link_count(inode); |
2989 | BUG_ON(dentry->d_name.name != dentry->d_iname || | |
2990 | !hlist_unhashed(&dentry->d_alias) || | |
2991 | !d_unlinked(dentry)); | |
2992 | spin_lock(&dentry->d_parent->d_lock); | |
2993 | spin_lock_nested(&dentry->d_lock, DENTRY_D_LOCK_NESTED); | |
2994 | dentry->d_name.len = sprintf(dentry->d_iname, "#%llu", | |
2995 | (unsigned long long)inode->i_ino); | |
2996 | spin_unlock(&dentry->d_lock); | |
2997 | spin_unlock(&dentry->d_parent->d_lock); | |
2998 | d_instantiate(dentry, inode); | |
1da177e4 | 2999 | } |
60545d0d | 3000 | EXPORT_SYMBOL(d_tmpfile); |
1da177e4 LT |
3001 | |
3002 | static __initdata unsigned long dhash_entries; | |
3003 | static int __init set_dhash_entries(char *str) | |
3004 | { | |
3005 | if (!str) | |
3006 | return 0; | |
3007 | dhash_entries = simple_strtoul(str, &str, 0); | |
3008 | return 1; | |
3009 | } | |
3010 | __setup("dhash_entries=", set_dhash_entries); | |
3011 | ||
3012 | static void __init dcache_init_early(void) | |
3013 | { | |
074b8517 | 3014 | unsigned int loop; |
1da177e4 LT |
3015 | |
3016 | /* If hashes are distributed across NUMA nodes, defer | |
3017 | * hash allocation until vmalloc space is available. | |
3018 | */ | |
3019 | if (hashdist) | |
3020 | return; | |
3021 | ||
3022 | dentry_hashtable = | |
3023 | alloc_large_system_hash("Dentry cache", | |
b07ad996 | 3024 | sizeof(struct hlist_bl_head), |
1da177e4 LT |
3025 | dhash_entries, |
3026 | 13, | |
3027 | HASH_EARLY, | |
3028 | &d_hash_shift, | |
3029 | &d_hash_mask, | |
31fe62b9 | 3030 | 0, |
1da177e4 LT |
3031 | 0); |
3032 | ||
074b8517 | 3033 | for (loop = 0; loop < (1U << d_hash_shift); loop++) |
b07ad996 | 3034 | INIT_HLIST_BL_HEAD(dentry_hashtable + loop); |
1da177e4 LT |
3035 | } |
3036 | ||
74bf17cf | 3037 | static void __init dcache_init(void) |
1da177e4 | 3038 | { |
074b8517 | 3039 | unsigned int loop; |
1da177e4 LT |
3040 | |
3041 | /* | |
3042 | * A constructor could be added for stable state like the lists, | |
3043 | * but it is probably not worth it because of the cache nature | |
3044 | * of the dcache. | |
3045 | */ | |
0a31bd5f CL |
3046 | dentry_cache = KMEM_CACHE(dentry, |
3047 | SLAB_RECLAIM_ACCOUNT|SLAB_PANIC|SLAB_MEM_SPREAD); | |
1da177e4 LT |
3048 | |
3049 | /* Hash may have been set up in dcache_init_early */ | |
3050 | if (!hashdist) | |
3051 | return; | |
3052 | ||
3053 | dentry_hashtable = | |
3054 | alloc_large_system_hash("Dentry cache", | |
b07ad996 | 3055 | sizeof(struct hlist_bl_head), |
1da177e4 LT |
3056 | dhash_entries, |
3057 | 13, | |
3058 | 0, | |
3059 | &d_hash_shift, | |
3060 | &d_hash_mask, | |
31fe62b9 | 3061 | 0, |
1da177e4 LT |
3062 | 0); |
3063 | ||
074b8517 | 3064 | for (loop = 0; loop < (1U << d_hash_shift); loop++) |
b07ad996 | 3065 | INIT_HLIST_BL_HEAD(dentry_hashtable + loop); |
1da177e4 LT |
3066 | } |
3067 | ||
3068 | /* SLAB cache for __getname() consumers */ | |
e18b890b | 3069 | struct kmem_cache *names_cachep __read_mostly; |
ec4f8605 | 3070 | EXPORT_SYMBOL(names_cachep); |
1da177e4 | 3071 | |
1da177e4 LT |
3072 | EXPORT_SYMBOL(d_genocide); |
3073 | ||
1da177e4 LT |
3074 | void __init vfs_caches_init_early(void) |
3075 | { | |
3076 | dcache_init_early(); | |
3077 | inode_init_early(); | |
3078 | } | |
3079 | ||
3080 | void __init vfs_caches_init(unsigned long mempages) | |
3081 | { | |
3082 | unsigned long reserve; | |
3083 | ||
3084 | /* Base hash sizes on available memory, with a reserve equal to | |
3085 | 150% of current kernel size */ | |
3086 | ||
3087 | reserve = min((mempages - nr_free_pages()) * 3/2, mempages - 1); | |
3088 | mempages -= reserve; | |
3089 | ||
3090 | names_cachep = kmem_cache_create("names_cache", PATH_MAX, 0, | |
20c2df83 | 3091 | SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL); |
1da177e4 | 3092 | |
74bf17cf DC |
3093 | dcache_init(); |
3094 | inode_init(); | |
1da177e4 | 3095 | files_init(mempages); |
74bf17cf | 3096 | mnt_init(); |
1da177e4 LT |
3097 | bdev_cache_init(); |
3098 | chrdev_init(); | |
3099 | } |