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