Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | /* |
| 2 | * fs/fs-writeback.c |
| 3 | * |
| 4 | * Copyright (C) 2002, Linus Torvalds. |
| 5 | * |
| 6 | * Contains all the functions related to writing back and waiting |
| 7 | * upon dirty inodes against superblocks, and writing back dirty |
| 8 | * pages against inodes. ie: data writeback. Writeout of the |
| 9 | * inode itself is not handled here. |
| 10 | * |
| 11 | * 10Apr2002 akpm@zip.com.au |
| 12 | * Split out of fs/inode.c |
| 13 | * Additions for address_space-based writeback |
| 14 | */ |
| 15 | |
| 16 | #include <linux/kernel.h> |
Jens Axboe | f5ff842 | 2007-09-21 09:19:54 +0200 | [diff] [blame] | 17 | #include <linux/module.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 18 | #include <linux/spinlock.h> |
| 19 | #include <linux/sched.h> |
| 20 | #include <linux/fs.h> |
| 21 | #include <linux/mm.h> |
| 22 | #include <linux/writeback.h> |
| 23 | #include <linux/blkdev.h> |
| 24 | #include <linux/backing-dev.h> |
| 25 | #include <linux/buffer_head.h> |
David Howells | 07f3f05c | 2006-09-30 20:52:18 +0200 | [diff] [blame] | 26 | #include "internal.h" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 27 | |
| 28 | /** |
| 29 | * __mark_inode_dirty - internal function |
| 30 | * @inode: inode to mark |
| 31 | * @flags: what kind of dirty (i.e. I_DIRTY_SYNC) |
| 32 | * Mark an inode as dirty. Callers should use mark_inode_dirty or |
| 33 | * mark_inode_dirty_sync. |
| 34 | * |
| 35 | * Put the inode on the super block's dirty list. |
| 36 | * |
| 37 | * CAREFUL! We mark it dirty unconditionally, but move it onto the |
| 38 | * dirty list only if it is hashed or if it refers to a blockdev. |
| 39 | * If it was not hashed, it will never be added to the dirty list |
| 40 | * even if it is later hashed, as it will have been marked dirty already. |
| 41 | * |
| 42 | * In short, make sure you hash any inodes _before_ you start marking |
| 43 | * them dirty. |
| 44 | * |
| 45 | * This function *must* be atomic for the I_DIRTY_PAGES case - |
| 46 | * set_page_dirty() is called under spinlock in several places. |
| 47 | * |
| 48 | * Note that for blockdevs, inode->dirtied_when represents the dirtying time of |
| 49 | * the block-special inode (/dev/hda1) itself. And the ->dirtied_when field of |
| 50 | * the kernel-internal blockdev inode represents the dirtying time of the |
| 51 | * blockdev's pages. This is why for I_DIRTY_PAGES we always use |
| 52 | * page->mapping->host, so the page-dirtying time is recorded in the internal |
| 53 | * blockdev inode. |
| 54 | */ |
| 55 | void __mark_inode_dirty(struct inode *inode, int flags) |
| 56 | { |
| 57 | struct super_block *sb = inode->i_sb; |
| 58 | |
| 59 | /* |
| 60 | * Don't do this for I_DIRTY_PAGES - that doesn't actually |
| 61 | * dirty the inode itself |
| 62 | */ |
| 63 | if (flags & (I_DIRTY_SYNC | I_DIRTY_DATASYNC)) { |
| 64 | if (sb->s_op->dirty_inode) |
| 65 | sb->s_op->dirty_inode(inode); |
| 66 | } |
| 67 | |
| 68 | /* |
| 69 | * make sure that changes are seen by all cpus before we test i_state |
| 70 | * -- mikulas |
| 71 | */ |
| 72 | smp_mb(); |
| 73 | |
| 74 | /* avoid the locking if we can */ |
| 75 | if ((inode->i_state & flags) == flags) |
| 76 | return; |
| 77 | |
| 78 | if (unlikely(block_dump)) { |
| 79 | struct dentry *dentry = NULL; |
| 80 | const char *name = "?"; |
| 81 | |
| 82 | if (!list_empty(&inode->i_dentry)) { |
| 83 | dentry = list_entry(inode->i_dentry.next, |
| 84 | struct dentry, d_alias); |
| 85 | if (dentry && dentry->d_name.name) |
| 86 | name = (const char *) dentry->d_name.name; |
| 87 | } |
| 88 | |
| 89 | if (inode->i_ino || strcmp(inode->i_sb->s_id, "bdev")) |
| 90 | printk(KERN_DEBUG |
| 91 | "%s(%d): dirtied inode %lu (%s) on %s\n", |
| 92 | current->comm, current->pid, inode->i_ino, |
| 93 | name, inode->i_sb->s_id); |
| 94 | } |
| 95 | |
| 96 | spin_lock(&inode_lock); |
| 97 | if ((inode->i_state & flags) != flags) { |
| 98 | const int was_dirty = inode->i_state & I_DIRTY; |
| 99 | |
| 100 | inode->i_state |= flags; |
| 101 | |
| 102 | /* |
| 103 | * If the inode is locked, just update its dirty state. |
| 104 | * The unlocker will place the inode on the appropriate |
| 105 | * superblock list, based upon its state. |
| 106 | */ |
| 107 | if (inode->i_state & I_LOCK) |
| 108 | goto out; |
| 109 | |
| 110 | /* |
| 111 | * Only add valid (hashed) inodes to the superblock's |
| 112 | * dirty list. Add blockdev inodes as well. |
| 113 | */ |
| 114 | if (!S_ISBLK(inode->i_mode)) { |
| 115 | if (hlist_unhashed(&inode->i_hash)) |
| 116 | goto out; |
| 117 | } |
| 118 | if (inode->i_state & (I_FREEING|I_CLEAR)) |
| 119 | goto out; |
| 120 | |
| 121 | /* |
Fengguang Wu | 2c13657 | 2007-10-16 23:30:39 -0700 | [diff] [blame^] | 122 | * If the inode was already on s_dirty/s_io/s_more_io, don't |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 123 | * reposition it (that would break s_dirty time-ordering). |
| 124 | */ |
| 125 | if (!was_dirty) { |
| 126 | inode->dirtied_when = jiffies; |
| 127 | list_move(&inode->i_list, &sb->s_dirty); |
| 128 | } |
| 129 | } |
| 130 | out: |
| 131 | spin_unlock(&inode_lock); |
| 132 | } |
| 133 | |
| 134 | EXPORT_SYMBOL(__mark_inode_dirty); |
| 135 | |
| 136 | static int write_inode(struct inode *inode, int sync) |
| 137 | { |
| 138 | if (inode->i_sb->s_op->write_inode && !is_bad_inode(inode)) |
| 139 | return inode->i_sb->s_op->write_inode(inode, sync); |
| 140 | return 0; |
| 141 | } |
| 142 | |
| 143 | /* |
Andrew Morton | 6610a0b | 2007-10-16 23:30:32 -0700 | [diff] [blame] | 144 | * Redirty an inode: set its when-it-was dirtied timestamp and move it to the |
| 145 | * furthest end of its superblock's dirty-inode list. |
| 146 | * |
| 147 | * Before stamping the inode's ->dirtied_when, we check to see whether it is |
| 148 | * already the most-recently-dirtied inode on the s_dirty list. If that is |
| 149 | * the case then the inode must have been redirtied while it was being written |
| 150 | * out and we don't reset its dirtied_when. |
| 151 | */ |
| 152 | static void redirty_tail(struct inode *inode) |
| 153 | { |
| 154 | struct super_block *sb = inode->i_sb; |
| 155 | |
| 156 | if (!list_empty(&sb->s_dirty)) { |
| 157 | struct inode *tail_inode; |
| 158 | |
| 159 | tail_inode = list_entry(sb->s_dirty.next, struct inode, i_list); |
| 160 | if (!time_after_eq(inode->dirtied_when, |
| 161 | tail_inode->dirtied_when)) |
| 162 | inode->dirtied_when = jiffies; |
| 163 | } |
| 164 | list_move(&inode->i_list, &sb->s_dirty); |
| 165 | } |
| 166 | |
| 167 | /* |
Ken Chen | 0e0f4fc | 2007-10-16 23:30:38 -0700 | [diff] [blame] | 168 | * requeue inode for re-scanning after sb->s_io list is exhausted. |
Andrew Morton | c986d1e | 2007-10-16 23:30:34 -0700 | [diff] [blame] | 169 | */ |
Ken Chen | 0e0f4fc | 2007-10-16 23:30:38 -0700 | [diff] [blame] | 170 | static void requeue_io(struct inode *inode) |
Andrew Morton | c986d1e | 2007-10-16 23:30:34 -0700 | [diff] [blame] | 171 | { |
Ken Chen | 0e0f4fc | 2007-10-16 23:30:38 -0700 | [diff] [blame] | 172 | list_move(&inode->i_list, &inode->i_sb->s_more_io); |
Andrew Morton | c986d1e | 2007-10-16 23:30:34 -0700 | [diff] [blame] | 173 | } |
| 174 | |
| 175 | /* |
Fengguang Wu | 2c13657 | 2007-10-16 23:30:39 -0700 | [diff] [blame^] | 176 | * Move expired dirty inodes from @delaying_queue to @dispatch_queue. |
| 177 | */ |
| 178 | static void move_expired_inodes(struct list_head *delaying_queue, |
| 179 | struct list_head *dispatch_queue, |
| 180 | unsigned long *older_than_this) |
| 181 | { |
| 182 | while (!list_empty(delaying_queue)) { |
| 183 | struct inode *inode = list_entry(delaying_queue->prev, |
| 184 | struct inode, i_list); |
| 185 | if (older_than_this && |
| 186 | time_after(inode->dirtied_when, *older_than_this)) |
| 187 | break; |
| 188 | list_move(&inode->i_list, dispatch_queue); |
| 189 | } |
| 190 | } |
| 191 | |
| 192 | /* |
| 193 | * Queue all expired dirty inodes for io, eldest first. |
| 194 | */ |
| 195 | static void queue_io(struct super_block *sb, |
| 196 | unsigned long *older_than_this) |
| 197 | { |
| 198 | list_splice_init(&sb->s_more_io, sb->s_io.prev); |
| 199 | move_expired_inodes(&sb->s_dirty, &sb->s_io, older_than_this); |
| 200 | } |
| 201 | |
| 202 | /* |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 203 | * Write a single inode's dirty pages and inode data out to disk. |
| 204 | * If `wait' is set, wait on the writeout. |
| 205 | * |
| 206 | * The whole writeout design is quite complex and fragile. We want to avoid |
| 207 | * starvation of particular inodes when others are being redirtied, prevent |
| 208 | * livelocks, etc. |
| 209 | * |
| 210 | * Called under inode_lock. |
| 211 | */ |
| 212 | static int |
| 213 | __sync_single_inode(struct inode *inode, struct writeback_control *wbc) |
| 214 | { |
| 215 | unsigned dirty; |
| 216 | struct address_space *mapping = inode->i_mapping; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 217 | int wait = wbc->sync_mode == WB_SYNC_ALL; |
| 218 | int ret; |
| 219 | |
| 220 | BUG_ON(inode->i_state & I_LOCK); |
| 221 | |
| 222 | /* Set I_LOCK, reset I_DIRTY */ |
| 223 | dirty = inode->i_state & I_DIRTY; |
| 224 | inode->i_state |= I_LOCK; |
| 225 | inode->i_state &= ~I_DIRTY; |
| 226 | |
| 227 | spin_unlock(&inode_lock); |
| 228 | |
| 229 | ret = do_writepages(mapping, wbc); |
| 230 | |
| 231 | /* Don't write the inode if only I_DIRTY_PAGES was set */ |
| 232 | if (dirty & (I_DIRTY_SYNC | I_DIRTY_DATASYNC)) { |
| 233 | int err = write_inode(inode, wait); |
| 234 | if (ret == 0) |
| 235 | ret = err; |
| 236 | } |
| 237 | |
| 238 | if (wait) { |
| 239 | int err = filemap_fdatawait(mapping); |
| 240 | if (ret == 0) |
| 241 | ret = err; |
| 242 | } |
| 243 | |
| 244 | spin_lock(&inode_lock); |
| 245 | inode->i_state &= ~I_LOCK; |
| 246 | if (!(inode->i_state & I_FREEING)) { |
| 247 | if (!(inode->i_state & I_DIRTY) && |
| 248 | mapping_tagged(mapping, PAGECACHE_TAG_DIRTY)) { |
| 249 | /* |
| 250 | * We didn't write back all the pages. nfs_writepages() |
| 251 | * sometimes bales out without doing anything. Redirty |
Fengguang Wu | 2c13657 | 2007-10-16 23:30:39 -0700 | [diff] [blame^] | 252 | * the inode; Move it from s_io onto s_more_io/s_dirty. |
Andrew Morton | 1b43ef9 | 2007-10-16 23:30:35 -0700 | [diff] [blame] | 253 | */ |
| 254 | /* |
| 255 | * akpm: if the caller was the kupdate function we put |
| 256 | * this inode at the head of s_dirty so it gets first |
| 257 | * consideration. Otherwise, move it to the tail, for |
| 258 | * the reasons described there. I'm not really sure |
| 259 | * how much sense this makes. Presumably I had a good |
| 260 | * reasons for doing it this way, and I'd rather not |
| 261 | * muck with it at present. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 262 | */ |
| 263 | if (wbc->for_kupdate) { |
| 264 | /* |
Fengguang Wu | 2c13657 | 2007-10-16 23:30:39 -0700 | [diff] [blame^] | 265 | * For the kupdate function we move the inode |
| 266 | * to s_more_io so it will get more writeout as |
| 267 | * soon as the queue becomes uncongested. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 268 | */ |
| 269 | inode->i_state |= I_DIRTY_PAGES; |
Ken Chen | 0e0f4fc | 2007-10-16 23:30:38 -0700 | [diff] [blame] | 270 | requeue_io(inode); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 271 | } else { |
| 272 | /* |
| 273 | * Otherwise fully redirty the inode so that |
| 274 | * other inodes on this superblock will get some |
| 275 | * writeout. Otherwise heavy writing to one |
| 276 | * file would indefinitely suspend writeout of |
| 277 | * all the other files. |
| 278 | */ |
| 279 | inode->i_state |= I_DIRTY_PAGES; |
Andrew Morton | 1b43ef9 | 2007-10-16 23:30:35 -0700 | [diff] [blame] | 280 | redirty_tail(inode); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 281 | } |
| 282 | } else if (inode->i_state & I_DIRTY) { |
| 283 | /* |
| 284 | * Someone redirtied the inode while were writing back |
| 285 | * the pages. |
| 286 | */ |
Andrew Morton | 6610a0b | 2007-10-16 23:30:32 -0700 | [diff] [blame] | 287 | redirty_tail(inode); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 288 | } else if (atomic_read(&inode->i_count)) { |
| 289 | /* |
| 290 | * The inode is clean, inuse |
| 291 | */ |
| 292 | list_move(&inode->i_list, &inode_in_use); |
| 293 | } else { |
| 294 | /* |
| 295 | * The inode is clean, unused |
| 296 | */ |
| 297 | list_move(&inode->i_list, &inode_unused); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 298 | } |
| 299 | } |
| 300 | wake_up_inode(inode); |
| 301 | return ret; |
| 302 | } |
| 303 | |
| 304 | /* |
Andrea Arcangeli | 7f04c26 | 2005-10-30 15:03:05 -0800 | [diff] [blame] | 305 | * Write out an inode's dirty pages. Called under inode_lock. Either the |
| 306 | * caller has ref on the inode (either via __iget or via syscall against an fd) |
| 307 | * or the inode has I_WILL_FREE set (via generic_forget_inode) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 308 | */ |
| 309 | static int |
Andrea Arcangeli | 7f04c26 | 2005-10-30 15:03:05 -0800 | [diff] [blame] | 310 | __writeback_single_inode(struct inode *inode, struct writeback_control *wbc) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 311 | { |
| 312 | wait_queue_head_t *wqh; |
| 313 | |
Andrea Arcangeli | 7f04c26 | 2005-10-30 15:03:05 -0800 | [diff] [blame] | 314 | if (!atomic_read(&inode->i_count)) |
Andrea Arcangeli | 659603e | 2005-10-31 14:08:54 -0800 | [diff] [blame] | 315 | WARN_ON(!(inode->i_state & (I_WILL_FREE|I_FREEING))); |
Andrea Arcangeli | 7f04c26 | 2005-10-30 15:03:05 -0800 | [diff] [blame] | 316 | else |
| 317 | WARN_ON(inode->i_state & I_WILL_FREE); |
| 318 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 319 | if ((wbc->sync_mode != WB_SYNC_ALL) && (inode->i_state & I_LOCK)) { |
Linus Torvalds | 4b89eed9 | 2007-01-26 12:53:20 -0800 | [diff] [blame] | 320 | struct address_space *mapping = inode->i_mapping; |
| 321 | int ret; |
| 322 | |
Andrew Morton | 65cb9b4 | 2007-10-16 23:30:37 -0700 | [diff] [blame] | 323 | /* |
| 324 | * We're skipping this inode because it's locked, and we're not |
Fengguang Wu | 2c13657 | 2007-10-16 23:30:39 -0700 | [diff] [blame^] | 325 | * doing writeback-for-data-integrity. Move it to s_more_io so |
| 326 | * that writeback can proceed with the other inodes on s_io. |
| 327 | * We'll have another go at writing back this inode when we |
| 328 | * completed a full scan of s_io. |
Andrew Morton | 65cb9b4 | 2007-10-16 23:30:37 -0700 | [diff] [blame] | 329 | */ |
Ken Chen | 0e0f4fc | 2007-10-16 23:30:38 -0700 | [diff] [blame] | 330 | requeue_io(inode); |
Linus Torvalds | 4b89eed9 | 2007-01-26 12:53:20 -0800 | [diff] [blame] | 331 | |
| 332 | /* |
| 333 | * Even if we don't actually write the inode itself here, |
| 334 | * we can at least start some of the data writeout.. |
| 335 | */ |
| 336 | spin_unlock(&inode_lock); |
| 337 | ret = do_writepages(mapping, wbc); |
| 338 | spin_lock(&inode_lock); |
| 339 | return ret; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 340 | } |
| 341 | |
| 342 | /* |
| 343 | * It's a data-integrity sync. We must wait. |
| 344 | */ |
| 345 | if (inode->i_state & I_LOCK) { |
| 346 | DEFINE_WAIT_BIT(wq, &inode->i_state, __I_LOCK); |
| 347 | |
| 348 | wqh = bit_waitqueue(&inode->i_state, __I_LOCK); |
| 349 | do { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 350 | spin_unlock(&inode_lock); |
| 351 | __wait_on_bit(wqh, &wq, inode_wait, |
| 352 | TASK_UNINTERRUPTIBLE); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 353 | spin_lock(&inode_lock); |
| 354 | } while (inode->i_state & I_LOCK); |
| 355 | } |
| 356 | return __sync_single_inode(inode, wbc); |
| 357 | } |
| 358 | |
| 359 | /* |
| 360 | * Write out a superblock's list of dirty inodes. A wait will be performed |
| 361 | * upon no inodes, all inodes or the final one, depending upon sync_mode. |
| 362 | * |
| 363 | * If older_than_this is non-NULL, then only write out inodes which |
| 364 | * had their first dirtying at a time earlier than *older_than_this. |
| 365 | * |
| 366 | * If we're a pdlfush thread, then implement pdflush collision avoidance |
| 367 | * against the entire list. |
| 368 | * |
| 369 | * WB_SYNC_HOLD is a hack for sys_sync(): reattach the inode to sb->s_dirty so |
| 370 | * that it can be located for waiting on in __writeback_single_inode(). |
| 371 | * |
| 372 | * Called under inode_lock. |
| 373 | * |
| 374 | * If `bdi' is non-zero then we're being asked to writeback a specific queue. |
| 375 | * This function assumes that the blockdev superblock's inodes are backed by |
| 376 | * a variety of queues, so all inodes are searched. For other superblocks, |
| 377 | * assume that all inodes are backed by the same queue. |
| 378 | * |
| 379 | * FIXME: this linear search could get expensive with many fileystems. But |
| 380 | * how to fix? We need to go from an address_space to all inodes which share |
| 381 | * a queue with that address_space. (Easy: have a global "dirty superblocks" |
| 382 | * list). |
| 383 | * |
| 384 | * The inodes to be written are parked on sb->s_io. They are moved back onto |
| 385 | * sb->s_dirty as they are selected for writing. This way, none can be missed |
| 386 | * on the writer throttling path, and we get decent balancing between many |
| 387 | * throttled threads: we don't want them all piling up on __wait_on_inode. |
| 388 | */ |
| 389 | static void |
| 390 | sync_sb_inodes(struct super_block *sb, struct writeback_control *wbc) |
| 391 | { |
| 392 | const unsigned long start = jiffies; /* livelock avoidance */ |
| 393 | |
| 394 | if (!wbc->for_kupdate || list_empty(&sb->s_io)) |
Fengguang Wu | 2c13657 | 2007-10-16 23:30:39 -0700 | [diff] [blame^] | 395 | queue_io(sb, wbc->older_than_this); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 396 | |
| 397 | while (!list_empty(&sb->s_io)) { |
| 398 | struct inode *inode = list_entry(sb->s_io.prev, |
| 399 | struct inode, i_list); |
| 400 | struct address_space *mapping = inode->i_mapping; |
| 401 | struct backing_dev_info *bdi = mapping->backing_dev_info; |
| 402 | long pages_skipped; |
| 403 | |
| 404 | if (!bdi_cap_writeback_dirty(bdi)) { |
Andrew Morton | 9852a0e7 | 2007-10-16 23:30:33 -0700 | [diff] [blame] | 405 | redirty_tail(inode); |
David Howells | 7b0de42 | 2006-08-29 19:06:07 +0100 | [diff] [blame] | 406 | if (sb_is_blkdev_sb(sb)) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 407 | /* |
| 408 | * Dirty memory-backed blockdev: the ramdisk |
| 409 | * driver does this. Skip just this inode |
| 410 | */ |
| 411 | continue; |
| 412 | } |
| 413 | /* |
| 414 | * Dirty memory-backed inode against a filesystem other |
| 415 | * than the kernel-internal bdev filesystem. Skip the |
| 416 | * entire superblock. |
| 417 | */ |
| 418 | break; |
| 419 | } |
| 420 | |
| 421 | if (wbc->nonblocking && bdi_write_congested(bdi)) { |
| 422 | wbc->encountered_congestion = 1; |
David Howells | 7b0de42 | 2006-08-29 19:06:07 +0100 | [diff] [blame] | 423 | if (!sb_is_blkdev_sb(sb)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 424 | break; /* Skip a congested fs */ |
Ken Chen | 0e0f4fc | 2007-10-16 23:30:38 -0700 | [diff] [blame] | 425 | requeue_io(inode); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 426 | continue; /* Skip a congested blockdev */ |
| 427 | } |
| 428 | |
| 429 | if (wbc->bdi && bdi != wbc->bdi) { |
David Howells | 7b0de42 | 2006-08-29 19:06:07 +0100 | [diff] [blame] | 430 | if (!sb_is_blkdev_sb(sb)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 431 | break; /* fs has the wrong queue */ |
Ken Chen | 0e0f4fc | 2007-10-16 23:30:38 -0700 | [diff] [blame] | 432 | requeue_io(inode); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 433 | continue; /* blockdev has wrong queue */ |
| 434 | } |
| 435 | |
| 436 | /* Was this inode dirtied after sync_sb_inodes was called? */ |
| 437 | if (time_after(inode->dirtied_when, start)) |
| 438 | break; |
| 439 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 440 | /* Is another pdflush already flushing this queue? */ |
| 441 | if (current_is_pdflush() && !writeback_acquire(bdi)) |
| 442 | break; |
| 443 | |
| 444 | BUG_ON(inode->i_state & I_FREEING); |
| 445 | __iget(inode); |
| 446 | pages_skipped = wbc->pages_skipped; |
| 447 | __writeback_single_inode(inode, wbc); |
| 448 | if (wbc->sync_mode == WB_SYNC_HOLD) { |
| 449 | inode->dirtied_when = jiffies; |
| 450 | list_move(&inode->i_list, &sb->s_dirty); |
| 451 | } |
| 452 | if (current_is_pdflush()) |
| 453 | writeback_release(bdi); |
| 454 | if (wbc->pages_skipped != pages_skipped) { |
| 455 | /* |
| 456 | * writeback is not making progress due to locked |
| 457 | * buffers. Skip this inode for now. |
| 458 | */ |
Andrew Morton | f57b9b7 | 2007-10-16 23:30:34 -0700 | [diff] [blame] | 459 | redirty_tail(inode); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 460 | } |
| 461 | spin_unlock(&inode_lock); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 462 | iput(inode); |
OGAWA Hirofumi | 4ffc844 | 2006-03-25 03:07:44 -0800 | [diff] [blame] | 463 | cond_resched(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 464 | spin_lock(&inode_lock); |
| 465 | if (wbc->nr_to_write <= 0) |
| 466 | break; |
| 467 | } |
| 468 | return; /* Leave any unwritten inodes on s_io */ |
| 469 | } |
| 470 | |
| 471 | /* |
| 472 | * Start writeback of dirty pagecache data against all unlocked inodes. |
| 473 | * |
| 474 | * Note: |
| 475 | * We don't need to grab a reference to superblock here. If it has non-empty |
| 476 | * ->s_dirty it's hadn't been killed yet and kill_super() won't proceed |
Fengguang Wu | 2c13657 | 2007-10-16 23:30:39 -0700 | [diff] [blame^] | 477 | * past sync_inodes_sb() until the ->s_dirty/s_io/s_more_io lists are all |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 478 | * empty. Since __sync_single_inode() regains inode_lock before it finally moves |
| 479 | * inode from superblock lists we are OK. |
| 480 | * |
| 481 | * If `older_than_this' is non-zero then only flush inodes which have a |
| 482 | * flushtime older than *older_than_this. |
| 483 | * |
| 484 | * If `bdi' is non-zero then we will scan the first inode against each |
| 485 | * superblock until we find the matching ones. One group will be the dirty |
| 486 | * inodes against a filesystem. Then when we hit the dummy blockdev superblock, |
| 487 | * sync_sb_inodes will seekout the blockdev which matches `bdi'. Maybe not |
| 488 | * super-efficient but we're about to do a ton of I/O... |
| 489 | */ |
| 490 | void |
| 491 | writeback_inodes(struct writeback_control *wbc) |
| 492 | { |
| 493 | struct super_block *sb; |
| 494 | |
| 495 | might_sleep(); |
| 496 | spin_lock(&sb_lock); |
| 497 | restart: |
| 498 | sb = sb_entry(super_blocks.prev); |
| 499 | for (; sb != sb_entry(&super_blocks); sb = sb_entry(sb->s_list.prev)) { |
| 500 | if (!list_empty(&sb->s_dirty) || !list_empty(&sb->s_io)) { |
| 501 | /* we're making our own get_super here */ |
| 502 | sb->s_count++; |
| 503 | spin_unlock(&sb_lock); |
| 504 | /* |
| 505 | * If we can't get the readlock, there's no sense in |
| 506 | * waiting around, most of the time the FS is going to |
| 507 | * be unmounted by the time it is released. |
| 508 | */ |
| 509 | if (down_read_trylock(&sb->s_umount)) { |
| 510 | if (sb->s_root) { |
| 511 | spin_lock(&inode_lock); |
| 512 | sync_sb_inodes(sb, wbc); |
| 513 | spin_unlock(&inode_lock); |
| 514 | } |
| 515 | up_read(&sb->s_umount); |
| 516 | } |
| 517 | spin_lock(&sb_lock); |
| 518 | if (__put_super_and_need_restart(sb)) |
| 519 | goto restart; |
| 520 | } |
| 521 | if (wbc->nr_to_write <= 0) |
| 522 | break; |
| 523 | } |
| 524 | spin_unlock(&sb_lock); |
| 525 | } |
| 526 | |
| 527 | /* |
| 528 | * writeback and wait upon the filesystem's dirty inodes. The caller will |
| 529 | * do this in two passes - one to write, and one to wait. WB_SYNC_HOLD is |
| 530 | * used to park the written inodes on sb->s_dirty for the wait pass. |
| 531 | * |
| 532 | * A finite limit is set on the number of pages which will be written. |
| 533 | * To prevent infinite livelock of sys_sync(). |
| 534 | * |
| 535 | * We add in the number of potentially dirty inodes, because each inode write |
| 536 | * can dirty pagecache in the underlying blockdev. |
| 537 | */ |
| 538 | void sync_inodes_sb(struct super_block *sb, int wait) |
| 539 | { |
| 540 | struct writeback_control wbc = { |
| 541 | .sync_mode = wait ? WB_SYNC_ALL : WB_SYNC_HOLD, |
OGAWA Hirofumi | 111ebb6 | 2006-06-23 02:03:26 -0700 | [diff] [blame] | 542 | .range_start = 0, |
| 543 | .range_end = LLONG_MAX, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 544 | }; |
Christoph Lameter | b1e7a8f | 2006-06-30 01:55:39 -0700 | [diff] [blame] | 545 | unsigned long nr_dirty = global_page_state(NR_FILE_DIRTY); |
Christoph Lameter | fd39fc8 | 2006-06-30 01:55:40 -0700 | [diff] [blame] | 546 | unsigned long nr_unstable = global_page_state(NR_UNSTABLE_NFS); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 547 | |
| 548 | wbc.nr_to_write = nr_dirty + nr_unstable + |
| 549 | (inodes_stat.nr_inodes - inodes_stat.nr_unused) + |
| 550 | nr_dirty + nr_unstable; |
| 551 | wbc.nr_to_write += wbc.nr_to_write / 2; /* Bit more for luck */ |
| 552 | spin_lock(&inode_lock); |
| 553 | sync_sb_inodes(sb, &wbc); |
| 554 | spin_unlock(&inode_lock); |
| 555 | } |
| 556 | |
| 557 | /* |
| 558 | * Rather lame livelock avoidance. |
| 559 | */ |
| 560 | static void set_sb_syncing(int val) |
| 561 | { |
| 562 | struct super_block *sb; |
| 563 | spin_lock(&sb_lock); |
| 564 | sb = sb_entry(super_blocks.prev); |
| 565 | for (; sb != sb_entry(&super_blocks); sb = sb_entry(sb->s_list.prev)) { |
| 566 | sb->s_syncing = val; |
| 567 | } |
| 568 | spin_unlock(&sb_lock); |
| 569 | } |
| 570 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 571 | /** |
Martin Waitz | 67be2dd | 2005-05-01 08:59:26 -0700 | [diff] [blame] | 572 | * sync_inodes - writes all inodes to disk |
| 573 | * @wait: wait for completion |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 574 | * |
| 575 | * sync_inodes() goes through each super block's dirty inode list, writes the |
| 576 | * inodes out, waits on the writeout and puts the inodes back on the normal |
| 577 | * list. |
| 578 | * |
| 579 | * This is for sys_sync(). fsync_dev() uses the same algorithm. The subtle |
| 580 | * part of the sync functions is that the blockdev "superblock" is processed |
| 581 | * last. This is because the write_inode() function of a typical fs will |
| 582 | * perform no I/O, but will mark buffers in the blockdev mapping as dirty. |
| 583 | * What we want to do is to perform all that dirtying first, and then write |
| 584 | * back all those inode blocks via the blockdev mapping in one sweep. So the |
| 585 | * additional (somewhat redundant) sync_blockdev() calls here are to make |
| 586 | * sure that really happens. Because if we call sync_inodes_sb(wait=1) with |
| 587 | * outstanding dirty inodes, the writeback goes block-at-a-time within the |
| 588 | * filesystem's write_inode(). This is extremely slow. |
| 589 | */ |
Kirill Korotaev | 618f063 | 2005-06-23 00:09:54 -0700 | [diff] [blame] | 590 | static void __sync_inodes(int wait) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 591 | { |
| 592 | struct super_block *sb; |
| 593 | |
Kirill Korotaev | 618f063 | 2005-06-23 00:09:54 -0700 | [diff] [blame] | 594 | spin_lock(&sb_lock); |
| 595 | restart: |
| 596 | list_for_each_entry(sb, &super_blocks, s_list) { |
| 597 | if (sb->s_syncing) |
| 598 | continue; |
| 599 | sb->s_syncing = 1; |
| 600 | sb->s_count++; |
| 601 | spin_unlock(&sb_lock); |
| 602 | down_read(&sb->s_umount); |
| 603 | if (sb->s_root) { |
| 604 | sync_inodes_sb(sb, wait); |
| 605 | sync_blockdev(sb->s_bdev); |
| 606 | } |
| 607 | up_read(&sb->s_umount); |
| 608 | spin_lock(&sb_lock); |
| 609 | if (__put_super_and_need_restart(sb)) |
| 610 | goto restart; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 611 | } |
Kirill Korotaev | 618f063 | 2005-06-23 00:09:54 -0700 | [diff] [blame] | 612 | spin_unlock(&sb_lock); |
| 613 | } |
| 614 | |
| 615 | void sync_inodes(int wait) |
| 616 | { |
| 617 | set_sb_syncing(0); |
| 618 | __sync_inodes(0); |
| 619 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 620 | if (wait) { |
| 621 | set_sb_syncing(0); |
Kirill Korotaev | 618f063 | 2005-06-23 00:09:54 -0700 | [diff] [blame] | 622 | __sync_inodes(1); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 623 | } |
| 624 | } |
| 625 | |
| 626 | /** |
Andrea Arcangeli | 7f04c26 | 2005-10-30 15:03:05 -0800 | [diff] [blame] | 627 | * write_inode_now - write an inode to disk |
| 628 | * @inode: inode to write to disk |
| 629 | * @sync: whether the write should be synchronous or not |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 630 | * |
Andrea Arcangeli | 7f04c26 | 2005-10-30 15:03:05 -0800 | [diff] [blame] | 631 | * This function commits an inode to disk immediately if it is dirty. This is |
| 632 | * primarily needed by knfsd. |
| 633 | * |
| 634 | * The caller must either have a ref on the inode or must have set I_WILL_FREE. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 635 | */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 636 | int write_inode_now(struct inode *inode, int sync) |
| 637 | { |
| 638 | int ret; |
| 639 | struct writeback_control wbc = { |
| 640 | .nr_to_write = LONG_MAX, |
| 641 | .sync_mode = WB_SYNC_ALL, |
OGAWA Hirofumi | 111ebb6 | 2006-06-23 02:03:26 -0700 | [diff] [blame] | 642 | .range_start = 0, |
| 643 | .range_end = LLONG_MAX, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 644 | }; |
| 645 | |
| 646 | if (!mapping_cap_writeback_dirty(inode->i_mapping)) |
Andrew Morton | 49364ce | 2005-11-07 00:59:15 -0800 | [diff] [blame] | 647 | wbc.nr_to_write = 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 648 | |
| 649 | might_sleep(); |
| 650 | spin_lock(&inode_lock); |
| 651 | ret = __writeback_single_inode(inode, &wbc); |
| 652 | spin_unlock(&inode_lock); |
| 653 | if (sync) |
| 654 | wait_on_inode(inode); |
| 655 | return ret; |
| 656 | } |
| 657 | EXPORT_SYMBOL(write_inode_now); |
| 658 | |
| 659 | /** |
| 660 | * sync_inode - write an inode and its pages to disk. |
| 661 | * @inode: the inode to sync |
| 662 | * @wbc: controls the writeback mode |
| 663 | * |
| 664 | * sync_inode() will write an inode and its pages to disk. It will also |
| 665 | * correctly update the inode on its superblock's dirty inode lists and will |
| 666 | * update inode->i_state. |
| 667 | * |
| 668 | * The caller must have a ref on the inode. |
| 669 | */ |
| 670 | int sync_inode(struct inode *inode, struct writeback_control *wbc) |
| 671 | { |
| 672 | int ret; |
| 673 | |
| 674 | spin_lock(&inode_lock); |
| 675 | ret = __writeback_single_inode(inode, wbc); |
| 676 | spin_unlock(&inode_lock); |
| 677 | return ret; |
| 678 | } |
| 679 | EXPORT_SYMBOL(sync_inode); |
| 680 | |
| 681 | /** |
| 682 | * generic_osync_inode - flush all dirty data for a given inode to disk |
| 683 | * @inode: inode to write |
Martin Waitz | 67be2dd | 2005-05-01 08:59:26 -0700 | [diff] [blame] | 684 | * @mapping: the address_space that should be flushed |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 685 | * @what: what to write and wait upon |
| 686 | * |
| 687 | * This can be called by file_write functions for files which have the |
| 688 | * O_SYNC flag set, to flush dirty writes to disk. |
| 689 | * |
| 690 | * @what is a bitmask, specifying which part of the inode's data should be |
Randy Dunlap | b8887e6 | 2005-11-07 01:01:07 -0800 | [diff] [blame] | 691 | * written and waited upon. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 692 | * |
| 693 | * OSYNC_DATA: i_mapping's dirty data |
| 694 | * OSYNC_METADATA: the buffers at i_mapping->private_list |
| 695 | * OSYNC_INODE: the inode itself |
| 696 | */ |
| 697 | |
| 698 | int generic_osync_inode(struct inode *inode, struct address_space *mapping, int what) |
| 699 | { |
| 700 | int err = 0; |
| 701 | int need_write_inode_now = 0; |
| 702 | int err2; |
| 703 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 704 | if (what & OSYNC_DATA) |
| 705 | err = filemap_fdatawrite(mapping); |
| 706 | if (what & (OSYNC_METADATA|OSYNC_DATA)) { |
| 707 | err2 = sync_mapping_buffers(mapping); |
| 708 | if (!err) |
| 709 | err = err2; |
| 710 | } |
| 711 | if (what & OSYNC_DATA) { |
| 712 | err2 = filemap_fdatawait(mapping); |
| 713 | if (!err) |
| 714 | err = err2; |
| 715 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 716 | |
| 717 | spin_lock(&inode_lock); |
| 718 | if ((inode->i_state & I_DIRTY) && |
| 719 | ((what & OSYNC_INODE) || (inode->i_state & I_DIRTY_DATASYNC))) |
| 720 | need_write_inode_now = 1; |
| 721 | spin_unlock(&inode_lock); |
| 722 | |
| 723 | if (need_write_inode_now) { |
| 724 | err2 = write_inode_now(inode, 1); |
| 725 | if (!err) |
| 726 | err = err2; |
| 727 | } |
| 728 | else |
| 729 | wait_on_inode(inode); |
| 730 | |
| 731 | return err; |
| 732 | } |
| 733 | |
| 734 | EXPORT_SYMBOL(generic_osync_inode); |
| 735 | |
| 736 | /** |
| 737 | * writeback_acquire: attempt to get exclusive writeback access to a device |
| 738 | * @bdi: the device's backing_dev_info structure |
| 739 | * |
| 740 | * It is a waste of resources to have more than one pdflush thread blocked on |
| 741 | * a single request queue. Exclusion at the request_queue level is obtained |
| 742 | * via a flag in the request_queue's backing_dev_info.state. |
| 743 | * |
| 744 | * Non-request_queue-backed address_spaces will share default_backing_dev_info, |
| 745 | * unless they implement their own. Which is somewhat inefficient, as this |
| 746 | * may prevent concurrent writeback against multiple devices. |
| 747 | */ |
| 748 | int writeback_acquire(struct backing_dev_info *bdi) |
| 749 | { |
| 750 | return !test_and_set_bit(BDI_pdflush, &bdi->state); |
| 751 | } |
| 752 | |
| 753 | /** |
| 754 | * writeback_in_progress: determine whether there is writeback in progress |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 755 | * @bdi: the device's backing_dev_info structure. |
Randy Dunlap | b8887e6 | 2005-11-07 01:01:07 -0800 | [diff] [blame] | 756 | * |
| 757 | * Determine whether there is writeback in progress against a backing device. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 758 | */ |
| 759 | int writeback_in_progress(struct backing_dev_info *bdi) |
| 760 | { |
| 761 | return test_bit(BDI_pdflush, &bdi->state); |
| 762 | } |
| 763 | |
| 764 | /** |
| 765 | * writeback_release: relinquish exclusive writeback access against a device. |
| 766 | * @bdi: the device's backing_dev_info structure |
| 767 | */ |
| 768 | void writeback_release(struct backing_dev_info *bdi) |
| 769 | { |
| 770 | BUG_ON(!writeback_in_progress(bdi)); |
| 771 | clear_bit(BDI_pdflush, &bdi->state); |
| 772 | } |