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