fs-writeback.c 21 KB

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