Blame view
fs/inode.c
40.2 KB
1da177e4c Linux-2.6.12-rc2 |
1 2 3 4 5 |
/* * linux/fs/inode.c * * (C) 1997 Linus Torvalds */ |
1da177e4c Linux-2.6.12-rc2 |
6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 |
#include <linux/fs.h> #include <linux/mm.h> #include <linux/dcache.h> #include <linux/init.h> #include <linux/quotaops.h> #include <linux/slab.h> #include <linux/writeback.h> #include <linux/module.h> #include <linux/backing-dev.h> #include <linux/wait.h> #include <linux/hash.h> #include <linux/swap.h> #include <linux/security.h> #include <linux/pagemap.h> #include <linux/cdev.h> #include <linux/bootmem.h> |
0eeca2830 [PATCH] inotify |
22 |
#include <linux/inotify.h> |
fc33a7bb9 [PATCH] per-mount... |
23 |
#include <linux/mount.h> |
efaee1920 async: make the f... |
24 |
#include <linux/async.h> |
1da177e4c Linux-2.6.12-rc2 |
25 26 27 28 29 |
/* * This is needed for the following functions: * - inode_has_buffers * - invalidate_inode_buffers |
1da177e4c Linux-2.6.12-rc2 |
30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 |
* - invalidate_bdev * * FIXME: remove all knowledge of the buffer layer from this file */ #include <linux/buffer_head.h> /* * New inode.c implementation. * * This implementation has the basic premise of trying * to be extremely low-overhead and SMP-safe, yet be * simple enough to be "obviously correct". * * Famous last words. */ /* inode dynamic allocation 1999, Andrea Arcangeli <andrea@suse.de> */ /* #define INODE_PARANOIA 1 */ /* #define INODE_DEBUG 1 */ /* * Inode lookup is no longer as critical as it used to be: * most of the lookups are going to be through the dcache. */ #define I_HASHBITS i_hash_shift #define I_HASHMASK i_hash_mask |
fa3536cc1 [PATCH] Use __rea... |
57 58 |
static unsigned int i_hash_mask __read_mostly; static unsigned int i_hash_shift __read_mostly; |
1da177e4c Linux-2.6.12-rc2 |
59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 |
/* * Each inode can be on two separate lists. One is * the hash list of the inode, used for lookups. The * other linked list is the "type" list: * "in_use" - valid inode, i_count > 0, i_nlink > 0 * "dirty" - as "in_use" but also dirty * "unused" - valid inode, i_count = 0 * * A "dirty" list is maintained for each super block, * allowing for low-overhead inode sync() operations. */ LIST_HEAD(inode_in_use); LIST_HEAD(inode_unused); |
fa3536cc1 [PATCH] Use __rea... |
74 |
static struct hlist_head *inode_hashtable __read_mostly; |
1da177e4c Linux-2.6.12-rc2 |
75 76 77 78 79 80 81 82 83 84 |
/* * A simple spinlock to protect the list manipulations. * * NOTE! You also have to own the lock if you change * the i_state of an inode while it is in use.. */ DEFINE_SPINLOCK(inode_lock); /* |
f24075bd0 [PATCH] sem2mutex... |
85 |
* iprune_mutex provides exclusion between the kswapd or try_to_free_pages |
1da177e4c Linux-2.6.12-rc2 |
86 87 88 89 90 91 |
* icache shrinking path, and the umount path. Without this exclusion, * by the time prune_icache calls iput for the inode whose pages it has * been invalidating, or by the time it calls clear_inode & destroy_inode * from its final dispose_list, the struct super_block they refer to * (for inode->i_sb->s_op) may already have been freed and reused. */ |
bdfc32661 [PATCH] fs/inode.... |
92 |
static DEFINE_MUTEX(iprune_mutex); |
1da177e4c Linux-2.6.12-rc2 |
93 94 95 96 97 |
/* * Statistics gathering.. */ struct inodes_stat_t inodes_stat; |
e18b890bb [PATCH] slab: rem... |
98 |
static struct kmem_cache * inode_cachep __read_mostly; |
1da177e4c Linux-2.6.12-rc2 |
99 |
|
1c0eeaf56 introduce I_SYNC |
100 101 102 103 104 105 106 107 |
static void wake_up_inode(struct inode *inode) { /* * Prevent speculative execution through spin_unlock(&inode_lock); */ smp_mb(); wake_up_bit(&inode->i_state, __I_LOCK); } |
2cb1599f9 Inode: Allow exte... |
108 109 |
/** * inode_init_always - perform inode structure intialisation |
0bc02f3fa fs/inode: fix ker... |
110 111 |
* @sb: superblock inode belongs to * @inode: inode to initialise |
2cb1599f9 Inode: Allow exte... |
112 113 114 115 116 |
* * These are initializations that need to be done on every inode * allocation as the fields are not initialised by slab allocation. */ struct inode *inode_init_always(struct super_block *sb, struct inode *inode) |
1da177e4c Linux-2.6.12-rc2 |
117 |
{ |
f5e54d6e5 [PATCH] mark addr... |
118 |
static const struct address_space_operations empty_aops; |
1da177e4c Linux-2.6.12-rc2 |
119 |
static struct inode_operations empty_iops; |
99ac48f54 [PATCH] mark f_op... |
120 |
static const struct file_operations empty_fops; |
1da177e4c Linux-2.6.12-rc2 |
121 |
|
2cb1599f9 Inode: Allow exte... |
122 123 124 125 126 127 128 129 130 |
struct address_space * const mapping = &inode->i_data; inode->i_sb = sb; inode->i_blkbits = sb->s_blocksize_bits; inode->i_flags = 0; atomic_set(&inode->i_count, 1); inode->i_op = &empty_iops; inode->i_fop = &empty_fops; inode->i_nlink = 1; |
56ff5efad zero i_uid/i_gid ... |
131 132 |
inode->i_uid = 0; inode->i_gid = 0; |
2cb1599f9 Inode: Allow exte... |
133 134 135 136 137 |
atomic_set(&inode->i_writecount, 0); inode->i_size = 0; inode->i_blocks = 0; inode->i_bytes = 0; inode->i_generation = 0; |
1da177e4c Linux-2.6.12-rc2 |
138 |
#ifdef CONFIG_QUOTA |
2cb1599f9 Inode: Allow exte... |
139 |
memset(&inode->i_dquot, 0, sizeof(inode->i_dquot)); |
1da177e4c Linux-2.6.12-rc2 |
140 |
#endif |
2cb1599f9 Inode: Allow exte... |
141 142 143 144 145 146 147 148 149 150 151 |
inode->i_pipe = NULL; inode->i_bdev = NULL; inode->i_cdev = NULL; inode->i_rdev = 0; inode->dirtied_when = 0; if (security_inode_alloc(inode)) { if (inode->i_sb->s_op->destroy_inode) inode->i_sb->s_op->destroy_inode(inode); else kmem_cache_free(inode_cachep, (inode)); return NULL; |
1da177e4c Linux-2.6.12-rc2 |
152 |
} |
2cb1599f9 Inode: Allow exte... |
153 154 155 156 157 158 159 160 161 162 163 164 165 |
spin_lock_init(&inode->i_lock); lockdep_set_class(&inode->i_lock, &sb->s_type->i_lock_key); mutex_init(&inode->i_mutex); lockdep_set_class(&inode->i_mutex, &sb->s_type->i_mutex_key); init_rwsem(&inode->i_alloc_sem); lockdep_set_class(&inode->i_alloc_sem, &sb->s_type->i_alloc_sem_key); mapping->a_ops = &empty_aops; mapping->host = inode; mapping->flags = 0; |
3c1d43787 mm: remove GFP_HI... |
166 |
mapping_set_gfp_mask(mapping, GFP_HIGHUSER_MOVABLE); |
2cb1599f9 Inode: Allow exte... |
167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 |
mapping->assoc_mapping = NULL; mapping->backing_dev_info = &default_backing_dev_info; mapping->writeback_index = 0; /* * If the block_device provides a backing_dev_info for client * inodes then use that. Otherwise the inode share the bdev's * backing_dev_info. */ if (sb->s_bdev) { struct backing_dev_info *bdi; bdi = sb->s_bdev->bd_inode_backing_dev_info; if (!bdi) bdi = sb->s_bdev->bd_inode->i_mapping->backing_dev_info; mapping->backing_dev_info = bdi; } inode->i_private = NULL; inode->i_mapping = mapping; |
1da177e4c Linux-2.6.12-rc2 |
186 187 |
return inode; } |
2cb1599f9 Inode: Allow exte... |
188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 |
EXPORT_SYMBOL(inode_init_always); static struct inode *alloc_inode(struct super_block *sb) { struct inode *inode; if (sb->s_op->alloc_inode) inode = sb->s_op->alloc_inode(sb); else inode = kmem_cache_alloc(inode_cachep, GFP_KERNEL); if (inode) return inode_init_always(sb, inode); return NULL; } |
1da177e4c Linux-2.6.12-rc2 |
203 204 205 |
void destroy_inode(struct inode *inode) { |
b7542f8c7 BUG_ON() Conversi... |
206 |
BUG_ON(inode_has_buffers(inode)); |
1da177e4c Linux-2.6.12-rc2 |
207 208 209 210 211 212 |
security_inode_free(inode); if (inode->i_sb->s_op->destroy_inode) inode->i_sb->s_op->destroy_inode(inode); else kmem_cache_free(inode_cachep, (inode)); } |
087e3b046 Inode: export sym... |
213 |
EXPORT_SYMBOL(destroy_inode); |
1da177e4c Linux-2.6.12-rc2 |
214 215 216 217 218 219 220 221 222 223 224 225 226 |
/* * These are initializations that only need to be done * once, because the fields are idempotent across use * of the inode, so let the slab aware of that. */ void inode_init_once(struct inode *inode) { memset(inode, 0, sizeof(*inode)); INIT_HLIST_NODE(&inode->i_hash); INIT_LIST_HEAD(&inode->i_dentry); INIT_LIST_HEAD(&inode->i_devices); |
1da177e4c Linux-2.6.12-rc2 |
227 |
INIT_RADIX_TREE(&inode->i_data.page_tree, GFP_ATOMIC); |
19fd62312 mm: spinlock tree... |
228 |
spin_lock_init(&inode->i_data.tree_lock); |
1da177e4c Linux-2.6.12-rc2 |
229 230 231 232 233 |
spin_lock_init(&inode->i_data.i_mmap_lock); INIT_LIST_HEAD(&inode->i_data.private_list); spin_lock_init(&inode->i_data.private_lock); INIT_RAW_PRIO_TREE_ROOT(&inode->i_data.i_mmap); INIT_LIST_HEAD(&inode->i_data.i_mmap_nonlinear); |
1da177e4c Linux-2.6.12-rc2 |
234 |
i_size_ordered_init(inode); |
0eeca2830 [PATCH] inotify |
235 236 |
#ifdef CONFIG_INOTIFY INIT_LIST_HEAD(&inode->inotify_watches); |
d4f9af9da [PATCH] sem2mutex... |
237 |
mutex_init(&inode->inotify_mutex); |
0eeca2830 [PATCH] inotify |
238 |
#endif |
1da177e4c Linux-2.6.12-rc2 |
239 240 241 |
} EXPORT_SYMBOL(inode_init_once); |
51cc50685 SL*B: drop kmem c... |
242 |
static void init_once(void *foo) |
1da177e4c Linux-2.6.12-rc2 |
243 244 |
{ struct inode * inode = (struct inode *) foo; |
a35afb830 Remove SLAB_CTOR_... |
245 |
inode_init_once(inode); |
1da177e4c Linux-2.6.12-rc2 |
246 247 248 249 250 251 252 253 254 255 256 257 |
} /* * inode_lock must be held */ void __iget(struct inode * inode) { if (atomic_read(&inode->i_count)) { atomic_inc(&inode->i_count); return; } atomic_inc(&inode->i_count); |
1c0eeaf56 introduce I_SYNC |
258 |
if (!(inode->i_state & (I_DIRTY|I_SYNC))) |
1da177e4c Linux-2.6.12-rc2 |
259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 |
list_move(&inode->i_list, &inode_in_use); inodes_stat.nr_unused--; } /** * clear_inode - clear an inode * @inode: inode to clear * * This is called by the filesystem to tell us * that the inode is no longer useful. We just * terminate it with extreme prejudice. */ void clear_inode(struct inode *inode) { might_sleep(); invalidate_inode_buffers(inode); |
b7542f8c7 BUG_ON() Conversi... |
276 277 278 |
BUG_ON(inode->i_data.nrpages); BUG_ON(!(inode->i_state & I_FREEING)); BUG_ON(inode->i_state & I_CLEAR); |
1c0eeaf56 introduce I_SYNC |
279 |
inode_sync_wait(inode); |
1da177e4c Linux-2.6.12-rc2 |
280 |
DQUOT_DROP(inode); |
acb0c854f vfs: remove super... |
281 |
if (inode->i_sb->s_op->clear_inode) |
1da177e4c Linux-2.6.12-rc2 |
282 |
inode->i_sb->s_op->clear_inode(inode); |
eaf796e7e [PATCH] inode-die... |
283 |
if (S_ISBLK(inode->i_mode) && inode->i_bdev) |
1da177e4c Linux-2.6.12-rc2 |
284 |
bd_forget(inode); |
577c4eb09 [PATCH] inode-die... |
285 |
if (S_ISCHR(inode->i_mode) && inode->i_cdev) |
1da177e4c Linux-2.6.12-rc2 |
286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 |
cd_forget(inode); inode->i_state = I_CLEAR; } EXPORT_SYMBOL(clear_inode); /* * dispose_list - dispose of the contents of a local list * @head: the head of the list to free * * Dispose-list gets a local list with local inodes in it, so it doesn't * need to worry about list corruption and SMP locks. */ static void dispose_list(struct list_head *head) { int nr_disposed = 0; while (!list_empty(head)) { struct inode *inode; |
b5e618181 Introduce a handy... |
305 |
inode = list_first_entry(head, struct inode, i_list); |
1da177e4c Linux-2.6.12-rc2 |
306 307 308 309 310 |
list_del(&inode->i_list); if (inode->i_data.nrpages) truncate_inode_pages(&inode->i_data, 0); clear_inode(inode); |
4120db471 [PATCH] bugfix: t... |
311 312 313 314 315 316 317 |
spin_lock(&inode_lock); hlist_del_init(&inode->i_hash); list_del_init(&inode->i_sb_list); spin_unlock(&inode_lock); wake_up_inode(inode); |
1da177e4c Linux-2.6.12-rc2 |
318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 |
destroy_inode(inode); nr_disposed++; } spin_lock(&inode_lock); inodes_stat.nr_inodes -= nr_disposed; spin_unlock(&inode_lock); } /* * Invalidate all inodes for a device. */ static int invalidate_list(struct list_head *head, struct list_head *dispose) { struct list_head *next; int busy = 0, count = 0; next = head->next; for (;;) { struct list_head * tmp = next; struct inode * inode; /* * We can reschedule here without worrying about the list's * consistency because the per-sb list of inodes must not |
f24075bd0 [PATCH] sem2mutex... |
342 |
* change during umount anymore, and because iprune_mutex keeps |
1da177e4c Linux-2.6.12-rc2 |
343 344 345 346 347 348 349 350 351 352 |
* shrink_icache_memory() away. */ cond_resched_lock(&inode_lock); next = next->next; if (tmp == head) break; inode = list_entry(tmp, struct inode, i_sb_list); invalidate_inode_buffers(inode); if (!atomic_read(&inode->i_count)) { |
1da177e4c Linux-2.6.12-rc2 |
353 354 355 356 357 358 359 360 361 362 363 |
list_move(&inode->i_list, dispose); inode->i_state |= I_FREEING; count++; continue; } busy = 1; } /* only unused inodes may be cached with i_count zero */ inodes_stat.nr_unused -= count; return busy; } |
1da177e4c Linux-2.6.12-rc2 |
364 365 366 367 368 369 370 371 372 373 374 375 |
/** * invalidate_inodes - discard the inodes on a device * @sb: superblock * * Discard all of the inodes for a given superblock. If the discard * fails because there are busy inodes then a non zero value is returned. * If the discard is successful all the inodes have been discarded. */ int invalidate_inodes(struct super_block * sb) { int busy; LIST_HEAD(throw_away); |
f24075bd0 [PATCH] sem2mutex... |
376 |
mutex_lock(&iprune_mutex); |
1da177e4c Linux-2.6.12-rc2 |
377 |
spin_lock(&inode_lock); |
0eeca2830 [PATCH] inotify |
378 |
inotify_unmount_inodes(&sb->s_inodes); |
1da177e4c Linux-2.6.12-rc2 |
379 380 381 382 |
busy = invalidate_list(&sb->s_inodes, &throw_away); spin_unlock(&inode_lock); dispose_list(&throw_away); |
f24075bd0 [PATCH] sem2mutex... |
383 |
mutex_unlock(&iprune_mutex); |
1da177e4c Linux-2.6.12-rc2 |
384 385 386 387 388 |
return busy; } EXPORT_SYMBOL(invalidate_inodes); |
1da177e4c Linux-2.6.12-rc2 |
389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 |
static int can_unuse(struct inode *inode) { if (inode->i_state) return 0; if (inode_has_buffers(inode)) return 0; if (atomic_read(&inode->i_count)) return 0; if (inode->i_data.nrpages) return 0; return 1; } /* * Scan `goal' inodes on the unused list for freeable ones. They are moved to * a temporary list and then are freed outside inode_lock by dispose_list(). * * Any inodes which are pinned purely because of attached pagecache have their * pagecache removed. We expect the final iput() on that inode to add it to * the front of the inode_unused list. So look for it there and if the * inode is still freeable, proceed. The right inode is found 99.9% of the * time in testing on a 4-way. * * If the inode has metadata buffers attached to mapping->private_list then * try to remove them. */ static void prune_icache(int nr_to_scan) { LIST_HEAD(freeable); int nr_pruned = 0; int nr_scanned; unsigned long reap = 0; |
f24075bd0 [PATCH] sem2mutex... |
422 |
mutex_lock(&iprune_mutex); |
1da177e4c Linux-2.6.12-rc2 |
423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 |
spin_lock(&inode_lock); for (nr_scanned = 0; nr_scanned < nr_to_scan; nr_scanned++) { struct inode *inode; if (list_empty(&inode_unused)) break; inode = list_entry(inode_unused.prev, struct inode, i_list); if (inode->i_state || atomic_read(&inode->i_count)) { list_move(&inode->i_list, &inode_unused); continue; } if (inode_has_buffers(inode) || inode->i_data.nrpages) { __iget(inode); spin_unlock(&inode_lock); if (remove_inode_buffers(inode)) |
fc0ecff69 [PATCH] remove in... |
440 441 |
reap += invalidate_mapping_pages(&inode->i_data, 0, -1); |
1da177e4c Linux-2.6.12-rc2 |
442 443 444 445 446 447 448 449 450 |
iput(inode); spin_lock(&inode_lock); if (inode != list_entry(inode_unused.next, struct inode, i_list)) continue; /* wrong inode or list_empty */ if (!can_unuse(inode)) continue; } |
1da177e4c Linux-2.6.12-rc2 |
451 452 453 454 455 |
list_move(&inode->i_list, &freeable); inode->i_state |= I_FREEING; nr_pruned++; } inodes_stat.nr_unused -= nr_pruned; |
f8891e5e1 [PATCH] Light wei... |
456 457 458 459 |
if (current_is_kswapd()) __count_vm_events(KSWAPD_INODESTEAL, reap); else __count_vm_events(PGINODESTEAL, reap); |
1da177e4c Linux-2.6.12-rc2 |
460 461 462 |
spin_unlock(&inode_lock); dispose_list(&freeable); |
f24075bd0 [PATCH] sem2mutex... |
463 |
mutex_unlock(&iprune_mutex); |
1da177e4c Linux-2.6.12-rc2 |
464 465 466 467 468 469 470 471 472 473 474 |
} /* * shrink_icache_memory() will attempt to reclaim some unused inodes. Here, * "unused" means that no dentries are referring to the inodes: the files are * not open and the dcache references to those inodes have already been * reclaimed. * * This function is passed the number of inodes to scan, and it returns the * total number of remaining possibly-reclaimable inodes. */ |
27496a8c6 [PATCH] gfp_t: fs/* |
475 |
static int shrink_icache_memory(int nr, gfp_t gfp_mask) |
1da177e4c Linux-2.6.12-rc2 |
476 477 478 479 480 481 482 483 484 485 486 487 488 |
{ if (nr) { /* * Nasty deadlock avoidance. We may hold various FS locks, * and we don't want to recurse into the FS that called us * in clear_inode() and friends.. */ if (!(gfp_mask & __GFP_FS)) return -1; prune_icache(nr); } return (inodes_stat.nr_unused / 100) * sysctl_vfs_cache_pressure; } |
8e1f936b7 mm: clean up and ... |
489 490 491 492 |
static struct shrinker icache_shrinker = { .shrink = shrink_icache_memory, .seeks = DEFAULT_SEEKS, }; |
1da177e4c Linux-2.6.12-rc2 |
493 494 495 496 497 498 499 500 501 502 503 504 505 |
static void __wait_on_freeing_inode(struct inode *inode); /* * Called with the inode lock held. * NOTE: we are not increasing the inode-refcount, you must call __iget() * by hand after calling find_inode now! This simplifies iunique and won't * add any additional branch in the common code. */ static struct inode * find_inode(struct super_block * sb, struct hlist_head *head, int (*test)(struct inode *, void *), void *data) { struct hlist_node *node; struct inode * inode = NULL; repeat: |
c5c8be3ce fs/inode.c: use h... |
506 |
hlist_for_each_entry(inode, node, head, i_hash) { |
1da177e4c Linux-2.6.12-rc2 |
507 508 509 510 |
if (inode->i_sb != sb) continue; if (!test(inode, data)) continue; |
991114c6f [PATCH] fix for p... |
511 |
if (inode->i_state & (I_FREEING|I_CLEAR|I_WILL_FREE)) { |
1da177e4c Linux-2.6.12-rc2 |
512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 |
__wait_on_freeing_inode(inode); goto repeat; } break; } return node ? inode : NULL; } /* * find_inode_fast is the fast path version of find_inode, see the comment at * iget_locked for details. */ static struct inode * find_inode_fast(struct super_block * sb, struct hlist_head *head, unsigned long ino) { struct hlist_node *node; struct inode * inode = NULL; repeat: |
c5c8be3ce fs/inode.c: use h... |
530 |
hlist_for_each_entry(inode, node, head, i_hash) { |
1da177e4c Linux-2.6.12-rc2 |
531 532 533 534 |
if (inode->i_ino != ino) continue; if (inode->i_sb != sb) continue; |
991114c6f [PATCH] fix for p... |
535 |
if (inode->i_state & (I_FREEING|I_CLEAR|I_WILL_FREE)) { |
1da177e4c Linux-2.6.12-rc2 |
536 537 538 539 540 541 542 |
__wait_on_freeing_inode(inode); goto repeat; } break; } return node ? inode : NULL; } |
8290c35f8 Inode: Allow exte... |
543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 |
static unsigned long hash(struct super_block *sb, unsigned long hashval) { unsigned long tmp; tmp = (hashval * (unsigned long)sb) ^ (GOLDEN_RATIO_PRIME + hashval) / L1_CACHE_BYTES; tmp = tmp ^ ((tmp ^ GOLDEN_RATIO_PRIME) >> I_HASHBITS); return tmp & I_HASHMASK; } static inline void __inode_add_to_lists(struct super_block *sb, struct hlist_head *head, struct inode *inode) { inodes_stat.nr_inodes++; list_add(&inode->i_list, &inode_in_use); list_add(&inode->i_sb_list, &sb->s_inodes); if (head) hlist_add_head(&inode->i_hash, head); } /** * inode_add_to_lists - add a new inode to relevant lists |
0bc02f3fa fs/inode: fix ker... |
566 567 |
* @sb: superblock inode belongs to * @inode: inode to mark in use |
8290c35f8 Inode: Allow exte... |
568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 |
* * When an inode is allocated it needs to be accounted for, added to the in use * list, the owning superblock and the inode hash. This needs to be done under * the inode_lock, so export a function to do this rather than the inode lock * itself. We calculate the hash list to add to here so it is all internal * which requires the caller to have already set up the inode number in the * inode to add. */ void inode_add_to_lists(struct super_block *sb, struct inode *inode) { struct hlist_head *head = inode_hashtable + hash(sb, inode->i_ino); spin_lock(&inode_lock); __inode_add_to_lists(sb, head, inode); spin_unlock(&inode_lock); } EXPORT_SYMBOL_GPL(inode_add_to_lists); |
1da177e4c Linux-2.6.12-rc2 |
585 586 587 588 |
/** * new_inode - obtain an inode * @sb: superblock * |
769848c03 Add __GFP_MOVABLE... |
589 |
* Allocates a new inode for given superblock. The default gfp_mask |
3c1d43787 mm: remove GFP_HI... |
590 |
* for allocations related to inode->i_mapping is GFP_HIGHUSER_MOVABLE. |
769848c03 Add __GFP_MOVABLE... |
591 592 593 594 595 |
* If HIGHMEM pages are unsuitable or it is known that pages allocated * for the page cache are not reclaimable or migratable, * mapping_set_gfp_mask() must be called with suitable flags on the * newly created inode's mapping * |
1da177e4c Linux-2.6.12-rc2 |
596 597 598 |
*/ struct inode *new_inode(struct super_block *sb) { |
866b04fcc inode numbering: ... |
599 600 601 602 603 604 |
/* * On a 32bit, non LFS stat() call, glibc will generate an EOVERFLOW * error if st_ino won't fit in target struct field. Use 32bit counter * here to attempt to avoid that. */ static unsigned int last_ino; |
1da177e4c Linux-2.6.12-rc2 |
605 606 607 608 609 610 611 |
struct inode * inode; spin_lock_prefetch(&inode_lock); inode = alloc_inode(sb); if (inode) { spin_lock(&inode_lock); |
8290c35f8 Inode: Allow exte... |
612 |
__inode_add_to_lists(sb, NULL, inode); |
1da177e4c Linux-2.6.12-rc2 |
613 614 615 616 617 618 619 620 621 622 623 |
inode->i_ino = ++last_ino; inode->i_state = 0; spin_unlock(&inode_lock); } return inode; } EXPORT_SYMBOL(new_inode); void unlock_new_inode(struct inode *inode) { |
14358e6dd lockdep: annotate... |
624 |
#ifdef CONFIG_DEBUG_LOCK_ALLOC |
1e89a5e15 lockdep: fixup th... |
625 626 627 628 629 630 631 632 |
if (inode->i_mode & S_IFDIR) { struct file_system_type *type = inode->i_sb->s_type; /* * ensure nobody is actually holding i_mutex */ mutex_destroy(&inode->i_mutex); mutex_init(&inode->i_mutex); |
14358e6dd lockdep: annotate... |
633 |
lockdep_set_class(&inode->i_mutex, &type->i_mutex_dir_key); |
1e89a5e15 lockdep: fixup th... |
634 |
} |
14358e6dd lockdep: annotate... |
635 |
#endif |
1da177e4c Linux-2.6.12-rc2 |
636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 |
/* * This is special! We do not need the spinlock * when clearing I_LOCK, because we're guaranteed * that nobody else tries to do anything about the * state of the inode when it is locked, as we * just created it (so there can be no old holders * that haven't tested I_LOCK). */ inode->i_state &= ~(I_LOCK|I_NEW); wake_up_inode(inode); } EXPORT_SYMBOL(unlock_new_inode); /* * This is called without the inode lock held.. Be careful. * * We no longer cache the sb_flags in i_flags - see fs.h * -- rmk@arm.uk.linux.org */ static struct inode * get_new_inode(struct super_block *sb, struct hlist_head *head, int (*test)(struct inode *, void *), int (*set)(struct inode *, void *), void *data) { struct inode * inode; inode = alloc_inode(sb); if (inode) { struct inode * old; spin_lock(&inode_lock); /* We released the lock, so.. */ old = find_inode(sb, head, test, data); if (!old) { if (set(inode, data)) goto set_failed; |
8290c35f8 Inode: Allow exte... |
670 |
__inode_add_to_lists(sb, head, inode); |
1da177e4c Linux-2.6.12-rc2 |
671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 |
inode->i_state = I_LOCK|I_NEW; spin_unlock(&inode_lock); /* Return the locked inode with I_NEW set, the * caller is responsible for filling in the contents */ return inode; } /* * Uhhuh, somebody else created the same inode under * us. Use the old inode instead of the one we just * allocated. */ __iget(old); spin_unlock(&inode_lock); destroy_inode(inode); inode = old; wait_on_inode(inode); } return inode; set_failed: spin_unlock(&inode_lock); destroy_inode(inode); return NULL; } /* * get_new_inode_fast is the fast path version of get_new_inode, see the * comment at iget_locked for details. */ static struct inode * get_new_inode_fast(struct super_block *sb, struct hlist_head *head, unsigned long ino) { struct inode * inode; inode = alloc_inode(sb); if (inode) { struct inode * old; spin_lock(&inode_lock); /* We released the lock, so.. */ old = find_inode_fast(sb, head, ino); if (!old) { inode->i_ino = ino; |
8290c35f8 Inode: Allow exte... |
716 |
__inode_add_to_lists(sb, head, inode); |
1da177e4c Linux-2.6.12-rc2 |
717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 |
inode->i_state = I_LOCK|I_NEW; spin_unlock(&inode_lock); /* Return the locked inode with I_NEW set, the * caller is responsible for filling in the contents */ return inode; } /* * Uhhuh, somebody else created the same inode under * us. Use the old inode instead of the one we just * allocated. */ __iget(old); spin_unlock(&inode_lock); destroy_inode(inode); inode = old; wait_on_inode(inode); } return inode; } |
1da177e4c Linux-2.6.12-rc2 |
739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 |
/** * iunique - get a unique inode number * @sb: superblock * @max_reserved: highest reserved inode number * * Obtain an inode number that is unique on the system for a given * superblock. This is used by file systems that have no natural * permanent inode numbering system. An inode number is returned that * is higher than the reserved limit but unique. * * BUGS: * With a large number of inodes live on the file system this function * currently becomes quite slow. */ ino_t iunique(struct super_block *sb, ino_t max_reserved) { |
866b04fcc inode numbering: ... |
755 756 757 758 759 760 |
/* * On a 32bit, non LFS stat() call, glibc will generate an EOVERFLOW * error if st_ino won't fit in target struct field. Use 32bit counter * here to attempt to avoid that. */ static unsigned int counter; |
1da177e4c Linux-2.6.12-rc2 |
761 |
struct inode *inode; |
3361c7beb make iunique use ... |
762 |
struct hlist_head *head; |
1da177e4c Linux-2.6.12-rc2 |
763 |
ino_t res; |
3361c7beb make iunique use ... |
764 |
|
1da177e4c Linux-2.6.12-rc2 |
765 |
spin_lock(&inode_lock); |
3361c7beb make iunique use ... |
766 767 768 |
do { if (counter <= max_reserved) counter = max_reserved + 1; |
1da177e4c Linux-2.6.12-rc2 |
769 |
res = counter++; |
3361c7beb make iunique use ... |
770 |
head = inode_hashtable + hash(sb, res); |
1da177e4c Linux-2.6.12-rc2 |
771 |
inode = find_inode_fast(sb, head, res); |
3361c7beb make iunique use ... |
772 773 |
} while (inode != NULL); spin_unlock(&inode_lock); |
1da177e4c Linux-2.6.12-rc2 |
774 |
|
3361c7beb make iunique use ... |
775 776 |
return res; } |
1da177e4c Linux-2.6.12-rc2 |
777 778 779 780 781 |
EXPORT_SYMBOL(iunique); struct inode *igrab(struct inode *inode) { spin_lock(&inode_lock); |
4a3b0a490 [PATCH] igrab() s... |
782 |
if (!(inode->i_state & (I_FREEING|I_CLEAR|I_WILL_FREE))) |
1da177e4c Linux-2.6.12-rc2 |
783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 |
__iget(inode); else /* * Handle the case where s_op->clear_inode is not been * called yet, and somebody is calling igrab * while the inode is getting freed. */ inode = NULL; spin_unlock(&inode_lock); return inode; } EXPORT_SYMBOL(igrab); /** * ifind - internal function, you want ilookup5() or iget5(). * @sb: super block of file system to search * @head: the head of the list to search * @test: callback used for comparisons between inodes * @data: opaque data pointer to pass to @test |
88bd5121d [PATCH] Fix soft ... |
803 |
* @wait: if true wait for the inode to be unlocked, if false do not |
1da177e4c Linux-2.6.12-rc2 |
804 805 806 807 808 809 810 811 812 813 814 815 |
* * ifind() searches for the inode specified by @data in the inode * cache. This is a generalized version of ifind_fast() for file systems where * the inode number is not sufficient for unique identification of an inode. * * If the inode is in the cache, the inode is returned with an incremented * reference count. * * Otherwise NULL is returned. * * Note, @test is called with the inode_lock held, so can't sleep. */ |
5d2bea458 [PATCH] tiny: Uni... |
816 |
static struct inode *ifind(struct super_block *sb, |
1da177e4c Linux-2.6.12-rc2 |
817 |
struct hlist_head *head, int (*test)(struct inode *, void *), |
88bd5121d [PATCH] Fix soft ... |
818 |
void *data, const int wait) |
1da177e4c Linux-2.6.12-rc2 |
819 820 821 822 823 824 825 826 |
{ struct inode *inode; spin_lock(&inode_lock); inode = find_inode(sb, head, test, data); if (inode) { __iget(inode); spin_unlock(&inode_lock); |
88bd5121d [PATCH] Fix soft ... |
827 828 |
if (likely(wait)) wait_on_inode(inode); |
1da177e4c Linux-2.6.12-rc2 |
829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 |
return inode; } spin_unlock(&inode_lock); return NULL; } /** * ifind_fast - internal function, you want ilookup() or iget(). * @sb: super block of file system to search * @head: head of the list to search * @ino: inode number to search for * * ifind_fast() searches for the inode @ino in the inode cache. This is for * file systems where the inode number is sufficient for unique identification * of an inode. * * If the inode is in the cache, the inode is returned with an incremented * reference count. * * Otherwise NULL is returned. */ |
5d2bea458 [PATCH] tiny: Uni... |
850 |
static struct inode *ifind_fast(struct super_block *sb, |
1da177e4c Linux-2.6.12-rc2 |
851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 |
struct hlist_head *head, unsigned long ino) { struct inode *inode; spin_lock(&inode_lock); inode = find_inode_fast(sb, head, ino); if (inode) { __iget(inode); spin_unlock(&inode_lock); wait_on_inode(inode); return inode; } spin_unlock(&inode_lock); return NULL; } /** |
88bd5121d [PATCH] Fix soft ... |
868 |
* ilookup5_nowait - search for an inode in the inode cache |
1da177e4c Linux-2.6.12-rc2 |
869 870 871 872 873 874 875 876 877 878 879 |
* @sb: super block of file system to search * @hashval: hash value (usually inode number) to search for * @test: callback used for comparisons between inodes * @data: opaque data pointer to pass to @test * * ilookup5() uses ifind() to search for the inode specified by @hashval and * @data in the inode cache. This is a generalized version of ilookup() for * file systems where the inode number is not sufficient for unique * identification of an inode. * * If the inode is in the cache, the inode is returned with an incremented |
88bd5121d [PATCH] Fix soft ... |
880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 |
* reference count. Note, the inode lock is not waited upon so you have to be * very careful what you do with the returned inode. You probably should be * using ilookup5() instead. * * Otherwise NULL is returned. * * Note, @test is called with the inode_lock held, so can't sleep. */ struct inode *ilookup5_nowait(struct super_block *sb, unsigned long hashval, int (*test)(struct inode *, void *), void *data) { struct hlist_head *head = inode_hashtable + hash(sb, hashval); return ifind(sb, head, test, data, 0); } EXPORT_SYMBOL(ilookup5_nowait); /** * ilookup5 - search for an inode in the inode cache * @sb: super block of file system to search * @hashval: hash value (usually inode number) to search for * @test: callback used for comparisons between inodes * @data: opaque data pointer to pass to @test * * ilookup5() uses ifind() to search for the inode specified by @hashval and * @data in the inode cache. This is a generalized version of ilookup() for * file systems where the inode number is not sufficient for unique * identification of an inode. * * If the inode is in the cache, the inode lock is waited upon and the inode is * returned with an incremented reference count. |
1da177e4c Linux-2.6.12-rc2 |
912 913 914 915 916 917 918 919 920 |
* * Otherwise NULL is returned. * * Note, @test is called with the inode_lock held, so can't sleep. */ struct inode *ilookup5(struct super_block *sb, unsigned long hashval, int (*test)(struct inode *, void *), void *data) { struct hlist_head *head = inode_hashtable + hash(sb, hashval); |
88bd5121d [PATCH] Fix soft ... |
921 |
return ifind(sb, head, test, data, 1); |
1da177e4c Linux-2.6.12-rc2 |
922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 |
} EXPORT_SYMBOL(ilookup5); /** * ilookup - search for an inode in the inode cache * @sb: super block of file system to search * @ino: inode number to search for * * ilookup() uses ifind_fast() to search for the inode @ino in the inode cache. * This is for file systems where the inode number is sufficient for unique * identification of an inode. * * If the inode is in the cache, the inode is returned with an incremented * reference count. * * Otherwise NULL is returned. */ struct inode *ilookup(struct super_block *sb, unsigned long ino) { struct hlist_head *head = inode_hashtable + hash(sb, ino); return ifind_fast(sb, head, ino); } EXPORT_SYMBOL(ilookup); /** * iget5_locked - obtain an inode from a mounted file system * @sb: super block of file system * @hashval: hash value (usually inode number) to get * @test: callback used for comparisons between inodes * @set: callback used to initialize a new struct inode * @data: opaque data pointer to pass to @test and @set * |
1da177e4c Linux-2.6.12-rc2 |
957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 |
* iget5_locked() uses ifind() to search for the inode specified by @hashval * and @data in the inode cache and if present it is returned with an increased * reference count. This is a generalized version of iget_locked() for file * systems where the inode number is not sufficient for unique identification * of an inode. * * If the inode is not in cache, get_new_inode() is called to allocate a new * inode and this is returned locked, hashed, and with the I_NEW flag set. The * file system gets to fill it in before unlocking it via unlock_new_inode(). * * Note both @test and @set are called with the inode_lock held, so can't sleep. */ struct inode *iget5_locked(struct super_block *sb, unsigned long hashval, int (*test)(struct inode *, void *), int (*set)(struct inode *, void *), void *data) { struct hlist_head *head = inode_hashtable + hash(sb, hashval); struct inode *inode; |
88bd5121d [PATCH] Fix soft ... |
975 |
inode = ifind(sb, head, test, data, 1); |
1da177e4c Linux-2.6.12-rc2 |
976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 |
if (inode) return inode; /* * get_new_inode() will do the right thing, re-trying the search * in case it had to block at any point. */ return get_new_inode(sb, head, test, set, data); } EXPORT_SYMBOL(iget5_locked); /** * iget_locked - obtain an inode from a mounted file system * @sb: super block of file system * @ino: inode number to get * |
1da177e4c Linux-2.6.12-rc2 |
992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 |
* iget_locked() uses ifind_fast() to search for the inode specified by @ino in * the inode cache and if present it is returned with an increased reference * count. This is for file systems where the inode number is sufficient for * unique identification of an inode. * * If the inode is not in cache, get_new_inode_fast() is called to allocate a * new inode and this is returned locked, hashed, and with the I_NEW flag set. * The file system gets to fill it in before unlocking it via * unlock_new_inode(). */ struct inode *iget_locked(struct super_block *sb, unsigned long ino) { struct hlist_head *head = inode_hashtable + hash(sb, ino); struct inode *inode; inode = ifind_fast(sb, head, ino); if (inode) return inode; /* * get_new_inode_fast() will do the right thing, re-trying the search * in case it had to block at any point. */ return get_new_inode_fast(sb, head, ino); } EXPORT_SYMBOL(iget_locked); |
261bca86e nfsd/create race ... |
1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 |
int insert_inode_locked(struct inode *inode) { struct super_block *sb = inode->i_sb; ino_t ino = inode->i_ino; struct hlist_head *head = inode_hashtable + hash(sb, ino); struct inode *old; inode->i_state |= I_LOCK|I_NEW; while (1) { spin_lock(&inode_lock); old = find_inode_fast(sb, head, ino); if (likely(!old)) { hlist_add_head(&inode->i_hash, head); spin_unlock(&inode_lock); return 0; } __iget(old); spin_unlock(&inode_lock); wait_on_inode(old); if (unlikely(!hlist_unhashed(&old->i_hash))) { iput(old); return -EBUSY; } iput(old); } } EXPORT_SYMBOL(insert_inode_locked); int insert_inode_locked4(struct inode *inode, unsigned long hashval, int (*test)(struct inode *, void *), void *data) { struct super_block *sb = inode->i_sb; struct hlist_head *head = inode_hashtable + hash(sb, hashval); struct inode *old; inode->i_state |= I_LOCK|I_NEW; while (1) { spin_lock(&inode_lock); old = find_inode(sb, head, test, data); if (likely(!old)) { hlist_add_head(&inode->i_hash, head); spin_unlock(&inode_lock); return 0; } __iget(old); spin_unlock(&inode_lock); wait_on_inode(old); if (unlikely(!hlist_unhashed(&old->i_hash))) { iput(old); return -EBUSY; } iput(old); } } EXPORT_SYMBOL(insert_inode_locked4); |
1da177e4c Linux-2.6.12-rc2 |
1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 |
/** * __insert_inode_hash - hash an inode * @inode: unhashed inode * @hashval: unsigned long value used to locate this object in the * inode_hashtable. * * Add an inode to the inode hash for this superblock. */ void __insert_inode_hash(struct inode *inode, unsigned long hashval) { struct hlist_head *head = inode_hashtable + hash(inode->i_sb, hashval); spin_lock(&inode_lock); hlist_add_head(&inode->i_hash, head); spin_unlock(&inode_lock); } EXPORT_SYMBOL(__insert_inode_hash); /** * remove_inode_hash - remove an inode from the hash * @inode: inode to unhash * * Remove an inode from the superblock. */ void remove_inode_hash(struct inode *inode) { spin_lock(&inode_lock); hlist_del_init(&inode->i_hash); spin_unlock(&inode_lock); } EXPORT_SYMBOL(remove_inode_hash); /* * Tell the filesystem that this inode is no longer of any interest and should * be completely destroyed. * * We leave the inode in the inode hash table until *after* the filesystem's * ->delete_inode completes. This ensures that an iget (such as nfsd might * instigate) will always find up-to-date information either in the hash or on * disk. * * I_FREEING is set so that no-one will take a new reference to the inode while * it is being deleted. */ |
b32714ba2 partial revert of... |
1121 |
void generic_delete_inode(struct inode *inode) |
1da177e4c Linux-2.6.12-rc2 |
1122 |
{ |
ee9b6d61a [PATCH] Mark stru... |
1123 |
const struct super_operations *op = inode->i_sb->s_op; |
1da177e4c Linux-2.6.12-rc2 |
1124 |
|
b32714ba2 partial revert of... |
1125 1126 1127 1128 1129 |
list_del_init(&inode->i_list); list_del_init(&inode->i_sb_list); inode->i_state |= I_FREEING; inodes_stat.nr_inodes--; spin_unlock(&inode_lock); |
1da177e4c Linux-2.6.12-rc2 |
1130 1131 1132 1133 1134 1135 |
security_inode_delete(inode); if (op->delete_inode) { void (*delete)(struct inode *) = op->delete_inode; if (!is_bad_inode(inode)) DQUOT_INIT(inode); |
e85b56523 [PATCH] move trun... |
1136 1137 1138 1139 |
/* Filesystems implementing their own * s_op->delete_inode are required to call * truncate_inode_pages and clear_inode() * internally */ |
1da177e4c Linux-2.6.12-rc2 |
1140 |
delete(inode); |
e85b56523 [PATCH] move trun... |
1141 1142 |
} else { truncate_inode_pages(&inode->i_data, 0); |
1da177e4c Linux-2.6.12-rc2 |
1143 |
clear_inode(inode); |
e85b56523 [PATCH] move trun... |
1144 |
} |
1da177e4c Linux-2.6.12-rc2 |
1145 1146 1147 1148 |
spin_lock(&inode_lock); hlist_del_init(&inode->i_hash); spin_unlock(&inode_lock); wake_up_inode(inode); |
b7542f8c7 BUG_ON() Conversi... |
1149 |
BUG_ON(inode->i_state != I_CLEAR); |
1da177e4c Linux-2.6.12-rc2 |
1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 |
destroy_inode(inode); } EXPORT_SYMBOL(generic_delete_inode); static void generic_forget_inode(struct inode *inode) { struct super_block *sb = inode->i_sb; if (!hlist_unhashed(&inode->i_hash)) { |
1c0eeaf56 introduce I_SYNC |
1160 |
if (!(inode->i_state & (I_DIRTY|I_SYNC))) |
1da177e4c Linux-2.6.12-rc2 |
1161 1162 |
list_move(&inode->i_list, &inode_unused); inodes_stat.nr_unused++; |
acb0c854f vfs: remove super... |
1163 |
if (sb->s_flags & MS_ACTIVE) { |
991114c6f [PATCH] fix for p... |
1164 |
spin_unlock(&inode_lock); |
1da177e4c Linux-2.6.12-rc2 |
1165 |
return; |
991114c6f [PATCH] fix for p... |
1166 1167 1168 |
} inode->i_state |= I_WILL_FREE; spin_unlock(&inode_lock); |
1da177e4c Linux-2.6.12-rc2 |
1169 1170 |
write_inode_now(inode, 1); spin_lock(&inode_lock); |
991114c6f [PATCH] fix for p... |
1171 |
inode->i_state &= ~I_WILL_FREE; |
1da177e4c Linux-2.6.12-rc2 |
1172 1173 1174 1175 1176 |
inodes_stat.nr_unused--; hlist_del_init(&inode->i_hash); } list_del_init(&inode->i_list); list_del_init(&inode->i_sb_list); |
991114c6f [PATCH] fix for p... |
1177 |
inode->i_state |= I_FREEING; |
1da177e4c Linux-2.6.12-rc2 |
1178 1179 1180 1181 1182 |
inodes_stat.nr_inodes--; spin_unlock(&inode_lock); if (inode->i_data.nrpages) truncate_inode_pages(&inode->i_data, 0); clear_inode(inode); |
7f04c26d7 [PATCH] fix nr_un... |
1183 |
wake_up_inode(inode); |
1da177e4c Linux-2.6.12-rc2 |
1184 1185 1186 1187 1188 1189 1190 1191 |
destroy_inode(inode); } /* * Normal UNIX filesystem behaviour: delete the * inode when the usage count drops to zero, and * i_nlink is zero. */ |
cb2c02337 [PATCH] export ge... |
1192 |
void generic_drop_inode(struct inode *inode) |
1da177e4c Linux-2.6.12-rc2 |
1193 1194 1195 1196 1197 1198 |
{ if (!inode->i_nlink) generic_delete_inode(inode); else generic_forget_inode(inode); } |
cb2c02337 [PATCH] export ge... |
1199 |
EXPORT_SYMBOL_GPL(generic_drop_inode); |
1da177e4c Linux-2.6.12-rc2 |
1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 |
/* * Called when we're dropping the last reference * to an inode. * * Call the FS "drop()" function, defaulting to * the legacy UNIX filesystem behaviour.. * * NOTE! NOTE! NOTE! We're called with the inode lock * held, and the drop function is supposed to release * the lock! */ static inline void iput_final(struct inode *inode) { |
ee9b6d61a [PATCH] Mark stru... |
1213 |
const struct super_operations *op = inode->i_sb->s_op; |
1da177e4c Linux-2.6.12-rc2 |
1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 |
void (*drop)(struct inode *) = generic_drop_inode; if (op && op->drop_inode) drop = op->drop_inode; drop(inode); } /** * iput - put an inode * @inode: inode to put * * Puts an inode, dropping its usage count. If the inode use count hits * zero, the inode is then freed and may also be destroyed. * * Consequently, iput() can sleep. */ void iput(struct inode *inode) { if (inode) { |
1da177e4c Linux-2.6.12-rc2 |
1233 |
BUG_ON(inode->i_state == I_CLEAR); |
1da177e4c Linux-2.6.12-rc2 |
1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 |
if (atomic_dec_and_lock(&inode->i_count, &inode_lock)) iput_final(inode); } } EXPORT_SYMBOL(iput); /** * bmap - find a block number in a file * @inode: inode of file * @block: block to find * * Returns the block number on the device holding the inode that * is the disk block number for the block of the file requested. * That is, asked for block 4 of inode 1 the function will return the * disk block relative to the disk start that holds that block of the * file. */ sector_t bmap(struct inode * inode, sector_t block) { sector_t res = 0; if (inode->i_mapping->a_ops->bmap) res = inode->i_mapping->a_ops->bmap(inode->i_mapping, block); return res; } |
1da177e4c Linux-2.6.12-rc2 |
1259 1260 1261 |
EXPORT_SYMBOL(bmap); /** |
869243a0f [PATCH] remove up... |
1262 1263 |
* touch_atime - update the access time * @mnt: mount the inode is accessed on |
7045f37b1 [PATCH] DocBook: ... |
1264 |
* @dentry: dentry accessed |
1da177e4c Linux-2.6.12-rc2 |
1265 1266 1267 1268 1269 |
* * Update the accessed time on an inode and mark it for writeback. * This function automatically handles read only file systems and media, * as well as the "noatime" flag and inode specific "noatime" markers. */ |
869243a0f [PATCH] remove up... |
1270 |
void touch_atime(struct vfsmount *mnt, struct dentry *dentry) |
1da177e4c Linux-2.6.12-rc2 |
1271 |
{ |
869243a0f [PATCH] remove up... |
1272 |
struct inode *inode = dentry->d_inode; |
1da177e4c Linux-2.6.12-rc2 |
1273 |
struct timespec now; |
cdb70f3f7 [PATCH] r/o bind ... |
1274 |
if (mnt_want_write(mnt)) |
b22761384 [PATCH] touch_ati... |
1275 |
return; |
cdb70f3f7 [PATCH] r/o bind ... |
1276 1277 |
if (inode->i_flags & S_NOATIME) goto out; |
37756ced1 [PATCH] avoid one... |
1278 |
if (IS_NOATIME(inode)) |
cdb70f3f7 [PATCH] r/o bind ... |
1279 |
goto out; |
b22761384 [PATCH] touch_ati... |
1280 |
if ((inode->i_sb->s_flags & MS_NODIRATIME) && S_ISDIR(inode->i_mode)) |
cdb70f3f7 [PATCH] r/o bind ... |
1281 |
goto out; |
47ae32d6a [PATCH] relative ... |
1282 |
|
cdb70f3f7 [PATCH] r/o bind ... |
1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 |
if (mnt->mnt_flags & MNT_NOATIME) goto out; if ((mnt->mnt_flags & MNT_NODIRATIME) && S_ISDIR(inode->i_mode)) goto out; if (mnt->mnt_flags & MNT_RELATIME) { /* * With relative atime, only update atime if the previous * atime is earlier than either the ctime or mtime. */ if (timespec_compare(&inode->i_mtime, &inode->i_atime) < 0 && timespec_compare(&inode->i_ctime, &inode->i_atime) < 0) goto out; |
b22761384 [PATCH] touch_ati... |
1295 |
} |
1da177e4c Linux-2.6.12-rc2 |
1296 1297 |
now = current_fs_time(inode->i_sb); |
47ae32d6a [PATCH] relative ... |
1298 |
if (timespec_equal(&inode->i_atime, &now)) |
cdb70f3f7 [PATCH] r/o bind ... |
1299 |
goto out; |
47ae32d6a [PATCH] relative ... |
1300 1301 1302 |
inode->i_atime = now; mark_inode_dirty_sync(inode); |
cdb70f3f7 [PATCH] r/o bind ... |
1303 1304 |
out: mnt_drop_write(mnt); |
1da177e4c Linux-2.6.12-rc2 |
1305 |
} |
869243a0f [PATCH] remove up... |
1306 |
EXPORT_SYMBOL(touch_atime); |
1da177e4c Linux-2.6.12-rc2 |
1307 1308 |
/** |
870f48179 [PATCH] replace i... |
1309 1310 |
* file_update_time - update mtime and ctime time * @file: file accessed |
1da177e4c Linux-2.6.12-rc2 |
1311 |
* |
870f48179 [PATCH] replace i... |
1312 1313 1314 1315 1316 1317 |
* Update the mtime and ctime members of an inode and mark the inode * for writeback. Note that this function is meant exclusively for * usage in the file write path of filesystems, and filesystems may * choose to explicitly ignore update via this function with the * S_NOCTIME inode flag, e.g. for network filesystem where these * timestamps are handled by the server. |
1da177e4c Linux-2.6.12-rc2 |
1318 |
*/ |
870f48179 [PATCH] replace i... |
1319 |
void file_update_time(struct file *file) |
1da177e4c Linux-2.6.12-rc2 |
1320 |
{ |
0f7fc9e4d [PATCH] VFS: chan... |
1321 |
struct inode *inode = file->f_path.dentry->d_inode; |
1da177e4c Linux-2.6.12-rc2 |
1322 1323 |
struct timespec now; int sync_it = 0; |
20ddee2c7 [PATCH] r/o bind ... |
1324 |
int err; |
1da177e4c Linux-2.6.12-rc2 |
1325 1326 1327 |
if (IS_NOCMTIME(inode)) return; |
20ddee2c7 [PATCH] r/o bind ... |
1328 1329 1330 |
err = mnt_want_write(file->f_path.mnt); if (err) |
1da177e4c Linux-2.6.12-rc2 |
1331 1332 1333 |
return; now = current_fs_time(inode->i_sb); |
ed97bd37e [PATCH] fs/inode.... |
1334 1335 |
if (!timespec_equal(&inode->i_mtime, &now)) { inode->i_mtime = now; |
1da177e4c Linux-2.6.12-rc2 |
1336 |
sync_it = 1; |
ed97bd37e [PATCH] fs/inode.... |
1337 |
} |
1da177e4c Linux-2.6.12-rc2 |
1338 |
|
ed97bd37e [PATCH] fs/inode.... |
1339 1340 |
if (!timespec_equal(&inode->i_ctime, &now)) { inode->i_ctime = now; |
870f48179 [PATCH] replace i... |
1341 |
sync_it = 1; |
ed97bd37e [PATCH] fs/inode.... |
1342 |
} |
870f48179 [PATCH] replace i... |
1343 |
|
7a224228e vfs: Add 64 bit i... |
1344 1345 1346 1347 |
if (IS_I_VERSION(inode)) { inode_inc_iversion(inode); sync_it = 1; } |
1da177e4c Linux-2.6.12-rc2 |
1348 1349 |
if (sync_it) mark_inode_dirty_sync(inode); |
20ddee2c7 [PATCH] r/o bind ... |
1350 |
mnt_drop_write(file->f_path.mnt); |
1da177e4c Linux-2.6.12-rc2 |
1351 |
} |
870f48179 [PATCH] replace i... |
1352 |
EXPORT_SYMBOL(file_update_time); |
1da177e4c Linux-2.6.12-rc2 |
1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 |
int inode_needs_sync(struct inode *inode) { if (IS_SYNC(inode)) return 1; if (S_ISDIR(inode->i_mode) && IS_DIRSYNC(inode)) return 1; return 0; } EXPORT_SYMBOL(inode_needs_sync); |
1da177e4c Linux-2.6.12-rc2 |
1364 1365 1366 1367 1368 |
int inode_wait(void *word) { schedule(); return 0; } |
d44dab8d1 fs: xfs needs ino... |
1369 |
EXPORT_SYMBOL(inode_wait); |
1da177e4c Linux-2.6.12-rc2 |
1370 1371 |
/* |
168a9fd6a [PATCH] __wait_on... |
1372 1373 1374 1375 1376 1377 1378 1379 1380 |
* If we try to find an inode in the inode hash while it is being * deleted, we have to wait until the filesystem completes its * deletion before reporting that it isn't found. This function waits * until the deletion _might_ have completed. Callers are responsible * to recheck inode state. * * It doesn't matter if I_LOCK is not set initially, a call to * wake_up_inode() after removing from the hash list will DTRT. * |
1da177e4c Linux-2.6.12-rc2 |
1381 1382 1383 1384 1385 1386 |
* This is called with inode_lock held. */ static void __wait_on_freeing_inode(struct inode *inode) { wait_queue_head_t *wq; DEFINE_WAIT_BIT(wait, &inode->i_state, __I_LOCK); |
1da177e4c Linux-2.6.12-rc2 |
1387 1388 1389 1390 1391 1392 1393 |
wq = bit_waitqueue(&inode->i_state, __I_LOCK); prepare_to_wait(wq, &wait.wait, TASK_UNINTERRUPTIBLE); spin_unlock(&inode_lock); schedule(); finish_wait(wq, &wait.wait); spin_lock(&inode_lock); } |
62752ee19 [PATCH] Take i_mu... |
1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 |
/* * We rarely want to lock two inodes that do not have a parent/child * relationship (such as directory, child inode) simultaneously. The * vast majority of file systems should be able to get along fine * without this. Do not use these functions except as a last resort. */ void inode_double_lock(struct inode *inode1, struct inode *inode2) { if (inode1 == NULL || inode2 == NULL || inode1 == inode2) { if (inode1) mutex_lock(&inode1->i_mutex); else if (inode2) mutex_lock(&inode2->i_mutex); return; } if (inode1 < inode2) { mutex_lock_nested(&inode1->i_mutex, I_MUTEX_PARENT); mutex_lock_nested(&inode2->i_mutex, I_MUTEX_CHILD); } else { mutex_lock_nested(&inode2->i_mutex, I_MUTEX_PARENT); mutex_lock_nested(&inode1->i_mutex, I_MUTEX_CHILD); } } EXPORT_SYMBOL(inode_double_lock); void inode_double_unlock(struct inode *inode1, struct inode *inode2) { if (inode1) mutex_unlock(&inode1->i_mutex); if (inode2 && inode2 != inode1) mutex_unlock(&inode2->i_mutex); } EXPORT_SYMBOL(inode_double_unlock); |
1da177e4c Linux-2.6.12-rc2 |
1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 |
static __initdata unsigned long ihash_entries; static int __init set_ihash_entries(char *str) { if (!str) return 0; ihash_entries = simple_strtoul(str, &str, 0); return 1; } __setup("ihash_entries=", set_ihash_entries); /* * Initialize the waitqueues and inode hash table. */ void __init inode_init_early(void) { int loop; /* If hashes are distributed across NUMA nodes, defer * hash allocation until vmalloc space is available. */ if (hashdist) return; inode_hashtable = alloc_large_system_hash("Inode-cache", sizeof(struct hlist_head), ihash_entries, 14, HASH_EARLY, &i_hash_shift, &i_hash_mask, 0); for (loop = 0; loop < (1 << i_hash_shift); loop++) INIT_HLIST_HEAD(&inode_hashtable[loop]); } |
74bf17cff fs: remove the un... |
1465 |
void __init inode_init(void) |
1da177e4c Linux-2.6.12-rc2 |
1466 1467 1468 1469 |
{ int loop; /* inode slab cache */ |
b0196009d [PATCH] cpuset me... |
1470 1471 1472 1473 1474 |
inode_cachep = kmem_cache_create("inode_cache", sizeof(struct inode), 0, (SLAB_RECLAIM_ACCOUNT|SLAB_PANIC| SLAB_MEM_SPREAD), |
20c2df83d mm: Remove slab d... |
1475 |
init_once); |
8e1f936b7 mm: clean up and ... |
1476 |
register_shrinker(&icache_shrinker); |
1da177e4c Linux-2.6.12-rc2 |
1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 |
/* Hash may have been set up in inode_init_early */ if (!hashdist) return; inode_hashtable = alloc_large_system_hash("Inode-cache", sizeof(struct hlist_head), ihash_entries, 14, 0, &i_hash_shift, &i_hash_mask, 0); for (loop = 0; loop < (1 << i_hash_shift); loop++) INIT_HLIST_HEAD(&inode_hashtable[loop]); } void init_special_inode(struct inode *inode, umode_t mode, dev_t rdev) { inode->i_mode = mode; if (S_ISCHR(mode)) { inode->i_fop = &def_chr_fops; inode->i_rdev = rdev; } else if (S_ISBLK(mode)) { inode->i_fop = &def_blk_fops; inode->i_rdev = rdev; } else if (S_ISFIFO(mode)) inode->i_fop = &def_fifo_fops; else if (S_ISSOCK(mode)) inode->i_fop = &bad_sock_fops; else printk(KERN_DEBUG "init_special_inode: bogus i_mode (%o) ", mode); } EXPORT_SYMBOL(init_special_inode); |