page-writeback.c 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831
  1. /*
  2. * mm/page-writeback.c.
  3. *
  4. * Copyright (C) 2002, Linus Torvalds.
  5. *
  6. * Contains functions related to writing back dirty pages at the
  7. * address_space level.
  8. *
  9. * 10Apr2002 akpm@zip.com.au
  10. * Initial version
  11. */
  12. #include <linux/kernel.h>
  13. #include <linux/module.h>
  14. #include <linux/spinlock.h>
  15. #include <linux/fs.h>
  16. #include <linux/mm.h>
  17. #include <linux/swap.h>
  18. #include <linux/slab.h>
  19. #include <linux/pagemap.h>
  20. #include <linux/writeback.h>
  21. #include <linux/init.h>
  22. #include <linux/backing-dev.h>
  23. #include <linux/blkdev.h>
  24. #include <linux/mpage.h>
  25. #include <linux/percpu.h>
  26. #include <linux/notifier.h>
  27. #include <linux/smp.h>
  28. #include <linux/sysctl.h>
  29. #include <linux/cpu.h>
  30. #include <linux/syscalls.h>
  31. /*
  32. * The maximum number of pages to writeout in a single bdflush/kupdate
  33. * operation. We do this so we don't hold I_LOCK against an inode for
  34. * enormous amounts of time, which would block a userspace task which has
  35. * been forced to throttle against that inode. Also, the code reevaluates
  36. * the dirty each time it has written this many pages.
  37. */
  38. #define MAX_WRITEBACK_PAGES 1024
  39. /*
  40. * After a CPU has dirtied this many pages, balance_dirty_pages_ratelimited
  41. * will look to see if it needs to force writeback or throttling.
  42. */
  43. static long ratelimit_pages = 32;
  44. static long total_pages; /* The total number of pages in the machine. */
  45. static int dirty_exceeded __cacheline_aligned_in_smp; /* Dirty mem may be over limit */
  46. /*
  47. * When balance_dirty_pages decides that the caller needs to perform some
  48. * non-background writeback, this is how many pages it will attempt to write.
  49. * It should be somewhat larger than RATELIMIT_PAGES to ensure that reasonably
  50. * large amounts of I/O are submitted.
  51. */
  52. static inline long sync_writeback_pages(void)
  53. {
  54. return ratelimit_pages + ratelimit_pages / 2;
  55. }
  56. /* The following parameters are exported via /proc/sys/vm */
  57. /*
  58. * Start background writeback (via pdflush) at this percentage
  59. */
  60. int dirty_background_ratio = 10;
  61. /*
  62. * The generator of dirty data starts writeback at this percentage
  63. */
  64. int vm_dirty_ratio = 40;
  65. /*
  66. * The interval between `kupdate'-style writebacks, in jiffies
  67. */
  68. int dirty_writeback_interval = 5 * HZ;
  69. /*
  70. * The longest number of jiffies for which data is allowed to remain dirty
  71. */
  72. int dirty_expire_interval = 30 * HZ;
  73. /*
  74. * Flag that makes the machine dump writes/reads and block dirtyings.
  75. */
  76. int block_dump;
  77. /*
  78. * Flag that puts the machine in "laptop mode". Doubles as a timeout in jiffies:
  79. * a full sync is triggered after this time elapses without any disk activity.
  80. */
  81. int laptop_mode;
  82. EXPORT_SYMBOL(laptop_mode);
  83. /* End of sysctl-exported parameters */
  84. static void background_writeout(unsigned long _min_pages);
  85. struct writeback_state
  86. {
  87. unsigned long nr_dirty;
  88. unsigned long nr_unstable;
  89. unsigned long nr_mapped;
  90. unsigned long nr_writeback;
  91. };
  92. static void get_writeback_state(struct writeback_state *wbs)
  93. {
  94. wbs->nr_dirty = read_page_state(nr_dirty);
  95. wbs->nr_unstable = read_page_state(nr_unstable);
  96. wbs->nr_mapped = read_page_state(nr_mapped);
  97. wbs->nr_writeback = read_page_state(nr_writeback);
  98. }
  99. /*
  100. * Work out the current dirty-memory clamping and background writeout
  101. * thresholds.
  102. *
  103. * The main aim here is to lower them aggressively if there is a lot of mapped
  104. * memory around. To avoid stressing page reclaim with lots of unreclaimable
  105. * pages. It is better to clamp down on writers than to start swapping, and
  106. * performing lots of scanning.
  107. *
  108. * We only allow 1/2 of the currently-unmapped memory to be dirtied.
  109. *
  110. * We don't permit the clamping level to fall below 5% - that is getting rather
  111. * excessive.
  112. *
  113. * We make sure that the background writeout level is below the adjusted
  114. * clamping level.
  115. */
  116. static void
  117. get_dirty_limits(struct writeback_state *wbs, long *pbackground, long *pdirty,
  118. struct address_space *mapping)
  119. {
  120. int background_ratio; /* Percentages */
  121. int dirty_ratio;
  122. int unmapped_ratio;
  123. long background;
  124. long dirty;
  125. unsigned long available_memory = total_pages;
  126. struct task_struct *tsk;
  127. get_writeback_state(wbs);
  128. #ifdef CONFIG_HIGHMEM
  129. /*
  130. * If this mapping can only allocate from low memory,
  131. * we exclude high memory from our count.
  132. */
  133. if (mapping && !(mapping_gfp_mask(mapping) & __GFP_HIGHMEM))
  134. available_memory -= totalhigh_pages;
  135. #endif
  136. unmapped_ratio = 100 - (wbs->nr_mapped * 100) / total_pages;
  137. dirty_ratio = vm_dirty_ratio;
  138. if (dirty_ratio > unmapped_ratio / 2)
  139. dirty_ratio = unmapped_ratio / 2;
  140. if (dirty_ratio < 5)
  141. dirty_ratio = 5;
  142. background_ratio = dirty_background_ratio;
  143. if (background_ratio >= dirty_ratio)
  144. background_ratio = dirty_ratio / 2;
  145. background = (background_ratio * available_memory) / 100;
  146. dirty = (dirty_ratio * available_memory) / 100;
  147. tsk = current;
  148. if (tsk->flags & PF_LESS_THROTTLE || rt_task(tsk)) {
  149. background += background / 4;
  150. dirty += dirty / 4;
  151. }
  152. *pbackground = background;
  153. *pdirty = dirty;
  154. }
  155. /*
  156. * balance_dirty_pages() must be called by processes which are generating dirty
  157. * data. It looks at the number of dirty pages in the machine and will force
  158. * the caller to perform writeback if the system is over `vm_dirty_ratio'.
  159. * If we're over `background_thresh' then pdflush is woken to perform some
  160. * writeout.
  161. */
  162. static void balance_dirty_pages(struct address_space *mapping)
  163. {
  164. struct writeback_state wbs;
  165. long nr_reclaimable;
  166. long background_thresh;
  167. long dirty_thresh;
  168. unsigned long pages_written = 0;
  169. unsigned long write_chunk = sync_writeback_pages();
  170. struct backing_dev_info *bdi = mapping->backing_dev_info;
  171. for (;;) {
  172. struct writeback_control wbc = {
  173. .bdi = bdi,
  174. .sync_mode = WB_SYNC_NONE,
  175. .older_than_this = NULL,
  176. .nr_to_write = write_chunk,
  177. };
  178. get_dirty_limits(&wbs, &background_thresh,
  179. &dirty_thresh, mapping);
  180. nr_reclaimable = wbs.nr_dirty + wbs.nr_unstable;
  181. if (nr_reclaimable + wbs.nr_writeback <= dirty_thresh)
  182. break;
  183. if (!dirty_exceeded)
  184. dirty_exceeded = 1;
  185. /* Note: nr_reclaimable denotes nr_dirty + nr_unstable.
  186. * Unstable writes are a feature of certain networked
  187. * filesystems (i.e. NFS) in which data may have been
  188. * written to the server's write cache, but has not yet
  189. * been flushed to permanent storage.
  190. */
  191. if (nr_reclaimable) {
  192. writeback_inodes(&wbc);
  193. get_dirty_limits(&wbs, &background_thresh,
  194. &dirty_thresh, mapping);
  195. nr_reclaimable = wbs.nr_dirty + wbs.nr_unstable;
  196. if (nr_reclaimable + wbs.nr_writeback <= dirty_thresh)
  197. break;
  198. pages_written += write_chunk - wbc.nr_to_write;
  199. if (pages_written >= write_chunk)
  200. break; /* We've done our duty */
  201. }
  202. blk_congestion_wait(WRITE, HZ/10);
  203. }
  204. if (nr_reclaimable + wbs.nr_writeback <= dirty_thresh && dirty_exceeded)
  205. dirty_exceeded = 0;
  206. if (writeback_in_progress(bdi))
  207. return; /* pdflush is already working this queue */
  208. /*
  209. * In laptop mode, we wait until hitting the higher threshold before
  210. * starting background writeout, and then write out all the way down
  211. * to the lower threshold. So slow writers cause minimal disk activity.
  212. *
  213. * In normal mode, we start background writeout at the lower
  214. * background_thresh, to keep the amount of dirty memory low.
  215. */
  216. if ((laptop_mode && pages_written) ||
  217. (!laptop_mode && (nr_reclaimable > background_thresh)))
  218. pdflush_operation(background_writeout, 0);
  219. }
  220. /**
  221. * balance_dirty_pages_ratelimited_nr - balance dirty memory state
  222. * @mapping: address_space which was dirtied
  223. * @nr_pages_dirtied: number of pages which the caller has just dirtied
  224. *
  225. * Processes which are dirtying memory should call in here once for each page
  226. * which was newly dirtied. The function will periodically check the system's
  227. * dirty state and will initiate writeback if needed.
  228. *
  229. * On really big machines, get_writeback_state is expensive, so try to avoid
  230. * calling it too often (ratelimiting). But once we're over the dirty memory
  231. * limit we decrease the ratelimiting by a lot, to prevent individual processes
  232. * from overshooting the limit by (ratelimit_pages) each.
  233. */
  234. void balance_dirty_pages_ratelimited_nr(struct address_space *mapping,
  235. unsigned long nr_pages_dirtied)
  236. {
  237. static DEFINE_PER_CPU(unsigned long, ratelimits) = 0;
  238. unsigned long ratelimit;
  239. unsigned long *p;
  240. ratelimit = ratelimit_pages;
  241. if (dirty_exceeded)
  242. ratelimit = 8;
  243. /*
  244. * Check the rate limiting. Also, we do not want to throttle real-time
  245. * tasks in balance_dirty_pages(). Period.
  246. */
  247. preempt_disable();
  248. p = &__get_cpu_var(ratelimits);
  249. *p += nr_pages_dirtied;
  250. if (unlikely(*p >= ratelimit)) {
  251. *p = 0;
  252. preempt_enable();
  253. balance_dirty_pages(mapping);
  254. return;
  255. }
  256. preempt_enable();
  257. }
  258. EXPORT_SYMBOL(balance_dirty_pages_ratelimited_nr);
  259. void throttle_vm_writeout(void)
  260. {
  261. struct writeback_state wbs;
  262. long background_thresh;
  263. long dirty_thresh;
  264. for ( ; ; ) {
  265. get_dirty_limits(&wbs, &background_thresh, &dirty_thresh, NULL);
  266. /*
  267. * Boost the allowable dirty threshold a bit for page
  268. * allocators so they don't get DoS'ed by heavy writers
  269. */
  270. dirty_thresh += dirty_thresh / 10; /* wheeee... */
  271. if (wbs.nr_unstable + wbs.nr_writeback <= dirty_thresh)
  272. break;
  273. blk_congestion_wait(WRITE, HZ/10);
  274. }
  275. }
  276. /*
  277. * writeback at least _min_pages, and keep writing until the amount of dirty
  278. * memory is less than the background threshold, or until we're all clean.
  279. */
  280. static void background_writeout(unsigned long _min_pages)
  281. {
  282. long min_pages = _min_pages;
  283. struct writeback_control wbc = {
  284. .bdi = NULL,
  285. .sync_mode = WB_SYNC_NONE,
  286. .older_than_this = NULL,
  287. .nr_to_write = 0,
  288. .nonblocking = 1,
  289. };
  290. for ( ; ; ) {
  291. struct writeback_state wbs;
  292. long background_thresh;
  293. long dirty_thresh;
  294. get_dirty_limits(&wbs, &background_thresh, &dirty_thresh, NULL);
  295. if (wbs.nr_dirty + wbs.nr_unstable < background_thresh
  296. && min_pages <= 0)
  297. break;
  298. wbc.encountered_congestion = 0;
  299. wbc.nr_to_write = MAX_WRITEBACK_PAGES;
  300. wbc.pages_skipped = 0;
  301. writeback_inodes(&wbc);
  302. min_pages -= MAX_WRITEBACK_PAGES - wbc.nr_to_write;
  303. if (wbc.nr_to_write > 0 || wbc.pages_skipped > 0) {
  304. /* Wrote less than expected */
  305. blk_congestion_wait(WRITE, HZ/10);
  306. if (!wbc.encountered_congestion)
  307. break;
  308. }
  309. }
  310. }
  311. /*
  312. * Start writeback of `nr_pages' pages. If `nr_pages' is zero, write back
  313. * the whole world. Returns 0 if a pdflush thread was dispatched. Returns
  314. * -1 if all pdflush threads were busy.
  315. */
  316. int wakeup_pdflush(long nr_pages)
  317. {
  318. if (nr_pages == 0) {
  319. struct writeback_state wbs;
  320. get_writeback_state(&wbs);
  321. nr_pages = wbs.nr_dirty + wbs.nr_unstable;
  322. }
  323. return pdflush_operation(background_writeout, nr_pages);
  324. }
  325. static void wb_timer_fn(unsigned long unused);
  326. static void laptop_timer_fn(unsigned long unused);
  327. static DEFINE_TIMER(wb_timer, wb_timer_fn, 0, 0);
  328. static DEFINE_TIMER(laptop_mode_wb_timer, laptop_timer_fn, 0, 0);
  329. /*
  330. * Periodic writeback of "old" data.
  331. *
  332. * Define "old": the first time one of an inode's pages is dirtied, we mark the
  333. * dirtying-time in the inode's address_space. So this periodic writeback code
  334. * just walks the superblock inode list, writing back any inodes which are
  335. * older than a specific point in time.
  336. *
  337. * Try to run once per dirty_writeback_interval. But if a writeback event
  338. * takes longer than a dirty_writeback_interval interval, then leave a
  339. * one-second gap.
  340. *
  341. * older_than_this takes precedence over nr_to_write. So we'll only write back
  342. * all dirty pages if they are all attached to "old" mappings.
  343. */
  344. static void wb_kupdate(unsigned long arg)
  345. {
  346. unsigned long oldest_jif;
  347. unsigned long start_jif;
  348. unsigned long next_jif;
  349. long nr_to_write;
  350. struct writeback_state wbs;
  351. struct writeback_control wbc = {
  352. .bdi = NULL,
  353. .sync_mode = WB_SYNC_NONE,
  354. .older_than_this = &oldest_jif,
  355. .nr_to_write = 0,
  356. .nonblocking = 1,
  357. .for_kupdate = 1,
  358. };
  359. sync_supers();
  360. get_writeback_state(&wbs);
  361. oldest_jif = jiffies - dirty_expire_interval;
  362. start_jif = jiffies;
  363. next_jif = start_jif + dirty_writeback_interval;
  364. nr_to_write = wbs.nr_dirty + wbs.nr_unstable +
  365. (inodes_stat.nr_inodes - inodes_stat.nr_unused);
  366. while (nr_to_write > 0) {
  367. wbc.encountered_congestion = 0;
  368. wbc.nr_to_write = MAX_WRITEBACK_PAGES;
  369. writeback_inodes(&wbc);
  370. if (wbc.nr_to_write > 0) {
  371. if (wbc.encountered_congestion)
  372. blk_congestion_wait(WRITE, HZ/10);
  373. else
  374. break; /* All the old data is written */
  375. }
  376. nr_to_write -= MAX_WRITEBACK_PAGES - wbc.nr_to_write;
  377. }
  378. if (time_before(next_jif, jiffies + HZ))
  379. next_jif = jiffies + HZ;
  380. if (dirty_writeback_interval)
  381. mod_timer(&wb_timer, next_jif);
  382. }
  383. /*
  384. * sysctl handler for /proc/sys/vm/dirty_writeback_centisecs
  385. */
  386. int dirty_writeback_centisecs_handler(ctl_table *table, int write,
  387. struct file *file, void __user *buffer, size_t *length, loff_t *ppos)
  388. {
  389. proc_dointvec_userhz_jiffies(table, write, file, buffer, length, ppos);
  390. if (dirty_writeback_interval) {
  391. mod_timer(&wb_timer,
  392. jiffies + dirty_writeback_interval);
  393. } else {
  394. del_timer(&wb_timer);
  395. }
  396. return 0;
  397. }
  398. static void wb_timer_fn(unsigned long unused)
  399. {
  400. if (pdflush_operation(wb_kupdate, 0) < 0)
  401. mod_timer(&wb_timer, jiffies + HZ); /* delay 1 second */
  402. }
  403. static void laptop_flush(unsigned long unused)
  404. {
  405. sys_sync();
  406. }
  407. static void laptop_timer_fn(unsigned long unused)
  408. {
  409. pdflush_operation(laptop_flush, 0);
  410. }
  411. /*
  412. * We've spun up the disk and we're in laptop mode: schedule writeback
  413. * of all dirty data a few seconds from now. If the flush is already scheduled
  414. * then push it back - the user is still using the disk.
  415. */
  416. void laptop_io_completion(void)
  417. {
  418. mod_timer(&laptop_mode_wb_timer, jiffies + laptop_mode);
  419. }
  420. /*
  421. * We're in laptop mode and we've just synced. The sync's writes will have
  422. * caused another writeback to be scheduled by laptop_io_completion.
  423. * Nothing needs to be written back anymore, so we unschedule the writeback.
  424. */
  425. void laptop_sync_completion(void)
  426. {
  427. del_timer(&laptop_mode_wb_timer);
  428. }
  429. /*
  430. * If ratelimit_pages is too high then we can get into dirty-data overload
  431. * if a large number of processes all perform writes at the same time.
  432. * If it is too low then SMP machines will call the (expensive)
  433. * get_writeback_state too often.
  434. *
  435. * Here we set ratelimit_pages to a level which ensures that when all CPUs are
  436. * dirtying in parallel, we cannot go more than 3% (1/32) over the dirty memory
  437. * thresholds before writeback cuts in.
  438. *
  439. * But the limit should not be set too high. Because it also controls the
  440. * amount of memory which the balance_dirty_pages() caller has to write back.
  441. * If this is too large then the caller will block on the IO queue all the
  442. * time. So limit it to four megabytes - the balance_dirty_pages() caller
  443. * will write six megabyte chunks, max.
  444. */
  445. static void set_ratelimit(void)
  446. {
  447. ratelimit_pages = total_pages / (num_online_cpus() * 32);
  448. if (ratelimit_pages < 16)
  449. ratelimit_pages = 16;
  450. if (ratelimit_pages * PAGE_CACHE_SIZE > 4096 * 1024)
  451. ratelimit_pages = (4096 * 1024) / PAGE_CACHE_SIZE;
  452. }
  453. static int
  454. ratelimit_handler(struct notifier_block *self, unsigned long u, void *v)
  455. {
  456. set_ratelimit();
  457. return 0;
  458. }
  459. static struct notifier_block ratelimit_nb = {
  460. .notifier_call = ratelimit_handler,
  461. .next = NULL,
  462. };
  463. /*
  464. * If the machine has a large highmem:lowmem ratio then scale back the default
  465. * dirty memory thresholds: allowing too much dirty highmem pins an excessive
  466. * number of buffer_heads.
  467. */
  468. void __init page_writeback_init(void)
  469. {
  470. long buffer_pages = nr_free_buffer_pages();
  471. long correction;
  472. total_pages = nr_free_pagecache_pages();
  473. correction = (100 * 4 * buffer_pages) / total_pages;
  474. if (correction < 100) {
  475. dirty_background_ratio *= correction;
  476. dirty_background_ratio /= 100;
  477. vm_dirty_ratio *= correction;
  478. vm_dirty_ratio /= 100;
  479. if (dirty_background_ratio <= 0)
  480. dirty_background_ratio = 1;
  481. if (vm_dirty_ratio <= 0)
  482. vm_dirty_ratio = 1;
  483. }
  484. mod_timer(&wb_timer, jiffies + dirty_writeback_interval);
  485. set_ratelimit();
  486. register_cpu_notifier(&ratelimit_nb);
  487. }
  488. int do_writepages(struct address_space *mapping, struct writeback_control *wbc)
  489. {
  490. int ret;
  491. if (wbc->nr_to_write <= 0)
  492. return 0;
  493. wbc->for_writepages = 1;
  494. if (mapping->a_ops->writepages)
  495. ret = mapping->a_ops->writepages(mapping, wbc);
  496. else
  497. ret = generic_writepages(mapping, wbc);
  498. wbc->for_writepages = 0;
  499. return ret;
  500. }
  501. /**
  502. * write_one_page - write out a single page and optionally wait on I/O
  503. *
  504. * @page: the page to write
  505. * @wait: if true, wait on writeout
  506. *
  507. * The page must be locked by the caller and will be unlocked upon return.
  508. *
  509. * write_one_page() returns a negative error code if I/O failed.
  510. */
  511. int write_one_page(struct page *page, int wait)
  512. {
  513. struct address_space *mapping = page->mapping;
  514. int ret = 0;
  515. struct writeback_control wbc = {
  516. .sync_mode = WB_SYNC_ALL,
  517. .nr_to_write = 1,
  518. };
  519. BUG_ON(!PageLocked(page));
  520. if (wait)
  521. wait_on_page_writeback(page);
  522. if (clear_page_dirty_for_io(page)) {
  523. page_cache_get(page);
  524. ret = mapping->a_ops->writepage(page, &wbc);
  525. if (ret == 0 && wait) {
  526. wait_on_page_writeback(page);
  527. if (PageError(page))
  528. ret = -EIO;
  529. }
  530. page_cache_release(page);
  531. } else {
  532. unlock_page(page);
  533. }
  534. return ret;
  535. }
  536. EXPORT_SYMBOL(write_one_page);
  537. /*
  538. * For address_spaces which do not use buffers. Just tag the page as dirty in
  539. * its radix tree.
  540. *
  541. * This is also used when a single buffer is being dirtied: we want to set the
  542. * page dirty in that case, but not all the buffers. This is a "bottom-up"
  543. * dirtying, whereas __set_page_dirty_buffers() is a "top-down" dirtying.
  544. *
  545. * Most callers have locked the page, which pins the address_space in memory.
  546. * But zap_pte_range() does not lock the page, however in that case the
  547. * mapping is pinned by the vma's ->vm_file reference.
  548. *
  549. * We take care to handle the case where the page was truncated from the
  550. * mapping by re-checking page_mapping() insode tree_lock.
  551. */
  552. int __set_page_dirty_nobuffers(struct page *page)
  553. {
  554. if (!TestSetPageDirty(page)) {
  555. struct address_space *mapping = page_mapping(page);
  556. struct address_space *mapping2;
  557. if (mapping) {
  558. write_lock_irq(&mapping->tree_lock);
  559. mapping2 = page_mapping(page);
  560. if (mapping2) { /* Race with truncate? */
  561. BUG_ON(mapping2 != mapping);
  562. if (mapping_cap_account_dirty(mapping))
  563. inc_page_state(nr_dirty);
  564. radix_tree_tag_set(&mapping->page_tree,
  565. page_index(page), PAGECACHE_TAG_DIRTY);
  566. }
  567. write_unlock_irq(&mapping->tree_lock);
  568. if (mapping->host) {
  569. /* !PageAnon && !swapper_space */
  570. __mark_inode_dirty(mapping->host,
  571. I_DIRTY_PAGES);
  572. }
  573. }
  574. return 1;
  575. }
  576. return 0;
  577. }
  578. EXPORT_SYMBOL(__set_page_dirty_nobuffers);
  579. /*
  580. * When a writepage implementation decides that it doesn't want to write this
  581. * page for some reason, it should redirty the locked page via
  582. * redirty_page_for_writepage() and it should then unlock the page and return 0
  583. */
  584. int redirty_page_for_writepage(struct writeback_control *wbc, struct page *page)
  585. {
  586. wbc->pages_skipped++;
  587. return __set_page_dirty_nobuffers(page);
  588. }
  589. EXPORT_SYMBOL(redirty_page_for_writepage);
  590. /*
  591. * If the mapping doesn't provide a set_page_dirty a_op, then
  592. * just fall through and assume that it wants buffer_heads.
  593. */
  594. int fastcall set_page_dirty(struct page *page)
  595. {
  596. struct address_space *mapping = page_mapping(page);
  597. if (likely(mapping)) {
  598. int (*spd)(struct page *) = mapping->a_ops->set_page_dirty;
  599. if (spd)
  600. return (*spd)(page);
  601. return __set_page_dirty_buffers(page);
  602. }
  603. if (!PageDirty(page)) {
  604. if (!TestSetPageDirty(page))
  605. return 1;
  606. }
  607. return 0;
  608. }
  609. EXPORT_SYMBOL(set_page_dirty);
  610. /*
  611. * set_page_dirty() is racy if the caller has no reference against
  612. * page->mapping->host, and if the page is unlocked. This is because another
  613. * CPU could truncate the page off the mapping and then free the mapping.
  614. *
  615. * Usually, the page _is_ locked, or the caller is a user-space process which
  616. * holds a reference on the inode by having an open file.
  617. *
  618. * In other cases, the page should be locked before running set_page_dirty().
  619. */
  620. int set_page_dirty_lock(struct page *page)
  621. {
  622. int ret;
  623. lock_page(page);
  624. ret = set_page_dirty(page);
  625. unlock_page(page);
  626. return ret;
  627. }
  628. EXPORT_SYMBOL(set_page_dirty_lock);
  629. /*
  630. * Clear a page's dirty flag, while caring for dirty memory accounting.
  631. * Returns true if the page was previously dirty.
  632. */
  633. int test_clear_page_dirty(struct page *page)
  634. {
  635. struct address_space *mapping = page_mapping(page);
  636. unsigned long flags;
  637. if (mapping) {
  638. write_lock_irqsave(&mapping->tree_lock, flags);
  639. if (TestClearPageDirty(page)) {
  640. radix_tree_tag_clear(&mapping->page_tree,
  641. page_index(page),
  642. PAGECACHE_TAG_DIRTY);
  643. write_unlock_irqrestore(&mapping->tree_lock, flags);
  644. if (mapping_cap_account_dirty(mapping))
  645. dec_page_state(nr_dirty);
  646. return 1;
  647. }
  648. write_unlock_irqrestore(&mapping->tree_lock, flags);
  649. return 0;
  650. }
  651. return TestClearPageDirty(page);
  652. }
  653. EXPORT_SYMBOL(test_clear_page_dirty);
  654. /*
  655. * Clear a page's dirty flag, while caring for dirty memory accounting.
  656. * Returns true if the page was previously dirty.
  657. *
  658. * This is for preparing to put the page under writeout. We leave the page
  659. * tagged as dirty in the radix tree so that a concurrent write-for-sync
  660. * can discover it via a PAGECACHE_TAG_DIRTY walk. The ->writepage
  661. * implementation will run either set_page_writeback() or set_page_dirty(),
  662. * at which stage we bring the page's dirty flag and radix-tree dirty tag
  663. * back into sync.
  664. *
  665. * This incoherency between the page's dirty flag and radix-tree tag is
  666. * unfortunate, but it only exists while the page is locked.
  667. */
  668. int clear_page_dirty_for_io(struct page *page)
  669. {
  670. struct address_space *mapping = page_mapping(page);
  671. if (mapping) {
  672. if (TestClearPageDirty(page)) {
  673. if (mapping_cap_account_dirty(mapping))
  674. dec_page_state(nr_dirty);
  675. return 1;
  676. }
  677. return 0;
  678. }
  679. return TestClearPageDirty(page);
  680. }
  681. EXPORT_SYMBOL(clear_page_dirty_for_io);
  682. int test_clear_page_writeback(struct page *page)
  683. {
  684. struct address_space *mapping = page_mapping(page);
  685. int ret;
  686. if (mapping) {
  687. unsigned long flags;
  688. write_lock_irqsave(&mapping->tree_lock, flags);
  689. ret = TestClearPageWriteback(page);
  690. if (ret)
  691. radix_tree_tag_clear(&mapping->page_tree,
  692. page_index(page),
  693. PAGECACHE_TAG_WRITEBACK);
  694. write_unlock_irqrestore(&mapping->tree_lock, flags);
  695. } else {
  696. ret = TestClearPageWriteback(page);
  697. }
  698. return ret;
  699. }
  700. int test_set_page_writeback(struct page *page)
  701. {
  702. struct address_space *mapping = page_mapping(page);
  703. int ret;
  704. if (mapping) {
  705. unsigned long flags;
  706. write_lock_irqsave(&mapping->tree_lock, flags);
  707. ret = TestSetPageWriteback(page);
  708. if (!ret)
  709. radix_tree_tag_set(&mapping->page_tree,
  710. page_index(page),
  711. PAGECACHE_TAG_WRITEBACK);
  712. if (!PageDirty(page))
  713. radix_tree_tag_clear(&mapping->page_tree,
  714. page_index(page),
  715. PAGECACHE_TAG_DIRTY);
  716. write_unlock_irqrestore(&mapping->tree_lock, flags);
  717. } else {
  718. ret = TestSetPageWriteback(page);
  719. }
  720. return ret;
  721. }
  722. EXPORT_SYMBOL(test_set_page_writeback);
  723. /*
  724. * Return true if any of the pages in the mapping are marged with the
  725. * passed tag.
  726. */
  727. int mapping_tagged(struct address_space *mapping, int tag)
  728. {
  729. unsigned long flags;
  730. int ret;
  731. read_lock_irqsave(&mapping->tree_lock, flags);
  732. ret = radix_tree_tagged(&mapping->page_tree, tag);
  733. read_unlock_irqrestore(&mapping->tree_lock, flags);
  734. return ret;
  735. }
  736. EXPORT_SYMBOL(mapping_tagged);