page-writeback.c 39 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394
  1. /*
  2. * mm/page-writeback.c
  3. *
  4. * Copyright (C) 2002, Linus Torvalds.
  5. * Copyright (C) 2007 Red Hat, Inc., Peter Zijlstra <pzijlstr@redhat.com>
  6. *
  7. * Contains functions related to writing back dirty pages at the
  8. * address_space level.
  9. *
  10. * 10Apr2002 Andrew Morton
  11. * Initial version
  12. */
  13. #include <linux/kernel.h>
  14. #include <linux/module.h>
  15. #include <linux/spinlock.h>
  16. #include <linux/fs.h>
  17. #include <linux/mm.h>
  18. #include <linux/swap.h>
  19. #include <linux/slab.h>
  20. #include <linux/pagemap.h>
  21. #include <linux/writeback.h>
  22. #include <linux/init.h>
  23. #include <linux/backing-dev.h>
  24. #include <linux/task_io_accounting_ops.h>
  25. #include <linux/blkdev.h>
  26. #include <linux/mpage.h>
  27. #include <linux/rmap.h>
  28. #include <linux/percpu.h>
  29. #include <linux/notifier.h>
  30. #include <linux/smp.h>
  31. #include <linux/sysctl.h>
  32. #include <linux/cpu.h>
  33. #include <linux/syscalls.h>
  34. #include <linux/buffer_head.h>
  35. #include <linux/pagevec.h>
  36. #include <trace/events/writeback.h>
  37. /*
  38. * After a CPU has dirtied this many pages, balance_dirty_pages_ratelimited
  39. * will look to see if it needs to force writeback or throttling.
  40. */
  41. static long ratelimit_pages = 32;
  42. /*
  43. * When balance_dirty_pages decides that the caller needs to perform some
  44. * non-background writeback, this is how many pages it will attempt to write.
  45. * It should be somewhat larger than dirtied pages to ensure that reasonably
  46. * large amounts of I/O are submitted.
  47. */
  48. static inline long sync_writeback_pages(unsigned long dirtied)
  49. {
  50. if (dirtied < ratelimit_pages)
  51. dirtied = ratelimit_pages;
  52. return dirtied + dirtied / 2;
  53. }
  54. /* The following parameters are exported via /proc/sys/vm */
  55. /*
  56. * Start background writeback (via writeback threads) at this percentage
  57. */
  58. int dirty_background_ratio = 10;
  59. /*
  60. * dirty_background_bytes starts at 0 (disabled) so that it is a function of
  61. * dirty_background_ratio * the amount of dirtyable memory
  62. */
  63. unsigned long dirty_background_bytes;
  64. /*
  65. * free highmem will not be subtracted from the total free memory
  66. * for calculating free ratios if vm_highmem_is_dirtyable is true
  67. */
  68. int vm_highmem_is_dirtyable;
  69. /*
  70. * The generator of dirty data starts writeback at this percentage
  71. */
  72. int vm_dirty_ratio = 20;
  73. /*
  74. * vm_dirty_bytes starts at 0 (disabled) so that it is a function of
  75. * vm_dirty_ratio * the amount of dirtyable memory
  76. */
  77. unsigned long vm_dirty_bytes;
  78. /*
  79. * The interval between `kupdate'-style writebacks
  80. */
  81. unsigned int dirty_writeback_interval = 5 * 100; /* centiseconds */
  82. /*
  83. * The longest time for which data is allowed to remain dirty
  84. */
  85. unsigned int dirty_expire_interval = 30 * 100; /* centiseconds */
  86. /*
  87. * Flag that makes the machine dump writes/reads and block dirtyings.
  88. */
  89. int block_dump;
  90. /*
  91. * Flag that puts the machine in "laptop mode". Doubles as a timeout in jiffies:
  92. * a full sync is triggered after this time elapses without any disk activity.
  93. */
  94. int laptop_mode;
  95. EXPORT_SYMBOL(laptop_mode);
  96. /* End of sysctl-exported parameters */
  97. /*
  98. * Scale the writeback cache size proportional to the relative writeout speeds.
  99. *
  100. * We do this by keeping a floating proportion between BDIs, based on page
  101. * writeback completions [end_page_writeback()]. Those devices that write out
  102. * pages fastest will get the larger share, while the slower will get a smaller
  103. * share.
  104. *
  105. * We use page writeout completions because we are interested in getting rid of
  106. * dirty pages. Having them written out is the primary goal.
  107. *
  108. * We introduce a concept of time, a period over which we measure these events,
  109. * because demand can/will vary over time. The length of this period itself is
  110. * measured in page writeback completions.
  111. *
  112. */
  113. static struct prop_descriptor vm_completions;
  114. static struct prop_descriptor vm_dirties;
  115. /*
  116. * couple the period to the dirty_ratio:
  117. *
  118. * period/2 ~ roundup_pow_of_two(dirty limit)
  119. */
  120. static int calc_period_shift(void)
  121. {
  122. unsigned long dirty_total;
  123. if (vm_dirty_bytes)
  124. dirty_total = vm_dirty_bytes / PAGE_SIZE;
  125. else
  126. dirty_total = (vm_dirty_ratio * determine_dirtyable_memory()) /
  127. 100;
  128. return 2 + ilog2(dirty_total - 1);
  129. }
  130. /*
  131. * update the period when the dirty threshold changes.
  132. */
  133. static void update_completion_period(void)
  134. {
  135. int shift = calc_period_shift();
  136. prop_change_shift(&vm_completions, shift);
  137. prop_change_shift(&vm_dirties, shift);
  138. }
  139. int dirty_background_ratio_handler(struct ctl_table *table, int write,
  140. void __user *buffer, size_t *lenp,
  141. loff_t *ppos)
  142. {
  143. int ret;
  144. ret = proc_dointvec_minmax(table, write, buffer, lenp, ppos);
  145. if (ret == 0 && write)
  146. dirty_background_bytes = 0;
  147. return ret;
  148. }
  149. int dirty_background_bytes_handler(struct ctl_table *table, int write,
  150. void __user *buffer, size_t *lenp,
  151. loff_t *ppos)
  152. {
  153. int ret;
  154. ret = proc_doulongvec_minmax(table, write, buffer, lenp, ppos);
  155. if (ret == 0 && write)
  156. dirty_background_ratio = 0;
  157. return ret;
  158. }
  159. int dirty_ratio_handler(struct ctl_table *table, int write,
  160. void __user *buffer, size_t *lenp,
  161. loff_t *ppos)
  162. {
  163. int old_ratio = vm_dirty_ratio;
  164. int ret;
  165. ret = proc_dointvec_minmax(table, write, buffer, lenp, ppos);
  166. if (ret == 0 && write && vm_dirty_ratio != old_ratio) {
  167. update_completion_period();
  168. vm_dirty_bytes = 0;
  169. }
  170. return ret;
  171. }
  172. int dirty_bytes_handler(struct ctl_table *table, int write,
  173. void __user *buffer, size_t *lenp,
  174. loff_t *ppos)
  175. {
  176. unsigned long old_bytes = vm_dirty_bytes;
  177. int ret;
  178. ret = proc_doulongvec_minmax(table, write, buffer, lenp, ppos);
  179. if (ret == 0 && write && vm_dirty_bytes != old_bytes) {
  180. update_completion_period();
  181. vm_dirty_ratio = 0;
  182. }
  183. return ret;
  184. }
  185. /*
  186. * Increment the BDI's writeout completion count and the global writeout
  187. * completion count. Called from test_clear_page_writeback().
  188. */
  189. static inline void __bdi_writeout_inc(struct backing_dev_info *bdi)
  190. {
  191. __prop_inc_percpu_max(&vm_completions, &bdi->completions,
  192. bdi->max_prop_frac);
  193. }
  194. void bdi_writeout_inc(struct backing_dev_info *bdi)
  195. {
  196. unsigned long flags;
  197. local_irq_save(flags);
  198. __bdi_writeout_inc(bdi);
  199. local_irq_restore(flags);
  200. }
  201. EXPORT_SYMBOL_GPL(bdi_writeout_inc);
  202. void task_dirty_inc(struct task_struct *tsk)
  203. {
  204. prop_inc_single(&vm_dirties, &tsk->dirties);
  205. }
  206. /*
  207. * Obtain an accurate fraction of the BDI's portion.
  208. */
  209. static void bdi_writeout_fraction(struct backing_dev_info *bdi,
  210. long *numerator, long *denominator)
  211. {
  212. if (bdi_cap_writeback_dirty(bdi)) {
  213. prop_fraction_percpu(&vm_completions, &bdi->completions,
  214. numerator, denominator);
  215. } else {
  216. *numerator = 0;
  217. *denominator = 1;
  218. }
  219. }
  220. static inline void task_dirties_fraction(struct task_struct *tsk,
  221. long *numerator, long *denominator)
  222. {
  223. prop_fraction_single(&vm_dirties, &tsk->dirties,
  224. numerator, denominator);
  225. }
  226. /*
  227. * task_dirty_limit - scale down dirty throttling threshold for one task
  228. *
  229. * task specific dirty limit:
  230. *
  231. * dirty -= (dirty/8) * p_{t}
  232. *
  233. * To protect light/slow dirtying tasks from heavier/fast ones, we start
  234. * throttling individual tasks before reaching the bdi dirty limit.
  235. * Relatively low thresholds will be allocated to heavy dirtiers. So when
  236. * dirty pages grow large, heavy dirtiers will be throttled first, which will
  237. * effectively curb the growth of dirty pages. Light dirtiers with high enough
  238. * dirty threshold may never get throttled.
  239. */
  240. static unsigned long task_dirty_limit(struct task_struct *tsk,
  241. unsigned long bdi_dirty)
  242. {
  243. long numerator, denominator;
  244. unsigned long dirty = bdi_dirty;
  245. u64 inv = dirty >> 3;
  246. task_dirties_fraction(tsk, &numerator, &denominator);
  247. inv *= numerator;
  248. do_div(inv, denominator);
  249. dirty -= inv;
  250. return max(dirty, bdi_dirty/2);
  251. }
  252. /*
  253. *
  254. */
  255. static unsigned int bdi_min_ratio;
  256. int bdi_set_min_ratio(struct backing_dev_info *bdi, unsigned int min_ratio)
  257. {
  258. int ret = 0;
  259. spin_lock_bh(&bdi_lock);
  260. if (min_ratio > bdi->max_ratio) {
  261. ret = -EINVAL;
  262. } else {
  263. min_ratio -= bdi->min_ratio;
  264. if (bdi_min_ratio + min_ratio < 100) {
  265. bdi_min_ratio += min_ratio;
  266. bdi->min_ratio += min_ratio;
  267. } else {
  268. ret = -EINVAL;
  269. }
  270. }
  271. spin_unlock_bh(&bdi_lock);
  272. return ret;
  273. }
  274. int bdi_set_max_ratio(struct backing_dev_info *bdi, unsigned max_ratio)
  275. {
  276. int ret = 0;
  277. if (max_ratio > 100)
  278. return -EINVAL;
  279. spin_lock_bh(&bdi_lock);
  280. if (bdi->min_ratio > max_ratio) {
  281. ret = -EINVAL;
  282. } else {
  283. bdi->max_ratio = max_ratio;
  284. bdi->max_prop_frac = (PROP_FRAC_BASE * max_ratio) / 100;
  285. }
  286. spin_unlock_bh(&bdi_lock);
  287. return ret;
  288. }
  289. EXPORT_SYMBOL(bdi_set_max_ratio);
  290. /*
  291. * Work out the current dirty-memory clamping and background writeout
  292. * thresholds.
  293. *
  294. * The main aim here is to lower them aggressively if there is a lot of mapped
  295. * memory around. To avoid stressing page reclaim with lots of unreclaimable
  296. * pages. It is better to clamp down on writers than to start swapping, and
  297. * performing lots of scanning.
  298. *
  299. * We only allow 1/2 of the currently-unmapped memory to be dirtied.
  300. *
  301. * We don't permit the clamping level to fall below 5% - that is getting rather
  302. * excessive.
  303. *
  304. * We make sure that the background writeout level is below the adjusted
  305. * clamping level.
  306. */
  307. static unsigned long highmem_dirtyable_memory(unsigned long total)
  308. {
  309. #ifdef CONFIG_HIGHMEM
  310. int node;
  311. unsigned long x = 0;
  312. for_each_node_state(node, N_HIGH_MEMORY) {
  313. struct zone *z =
  314. &NODE_DATA(node)->node_zones[ZONE_HIGHMEM];
  315. x += zone_page_state(z, NR_FREE_PAGES) +
  316. zone_reclaimable_pages(z);
  317. }
  318. /*
  319. * Make sure that the number of highmem pages is never larger
  320. * than the number of the total dirtyable memory. This can only
  321. * occur in very strange VM situations but we want to make sure
  322. * that this does not occur.
  323. */
  324. return min(x, total);
  325. #else
  326. return 0;
  327. #endif
  328. }
  329. /**
  330. * determine_dirtyable_memory - amount of memory that may be used
  331. *
  332. * Returns the numebr of pages that can currently be freed and used
  333. * by the kernel for direct mappings.
  334. */
  335. unsigned long determine_dirtyable_memory(void)
  336. {
  337. unsigned long x;
  338. x = global_page_state(NR_FREE_PAGES) + global_reclaimable_pages();
  339. if (!vm_highmem_is_dirtyable)
  340. x -= highmem_dirtyable_memory(x);
  341. return x + 1; /* Ensure that we never return 0 */
  342. }
  343. /*
  344. * global_dirty_limits - background-writeback and dirty-throttling thresholds
  345. *
  346. * Calculate the dirty thresholds based on sysctl parameters
  347. * - vm.dirty_background_ratio or vm.dirty_background_bytes
  348. * - vm.dirty_ratio or vm.dirty_bytes
  349. * The dirty limits will be lifted by 1/4 for PF_LESS_THROTTLE (ie. nfsd) and
  350. * runtime tasks.
  351. */
  352. void global_dirty_limits(unsigned long *pbackground, unsigned long *pdirty)
  353. {
  354. unsigned long background;
  355. unsigned long dirty;
  356. unsigned long available_memory = determine_dirtyable_memory();
  357. struct task_struct *tsk;
  358. if (vm_dirty_bytes)
  359. dirty = DIV_ROUND_UP(vm_dirty_bytes, PAGE_SIZE);
  360. else
  361. dirty = (vm_dirty_ratio * available_memory) / 100;
  362. if (dirty_background_bytes)
  363. background = DIV_ROUND_UP(dirty_background_bytes, PAGE_SIZE);
  364. else
  365. background = (dirty_background_ratio * available_memory) / 100;
  366. if (background >= dirty)
  367. background = dirty / 2;
  368. tsk = current;
  369. if (tsk->flags & PF_LESS_THROTTLE || rt_task(tsk)) {
  370. background += background / 4;
  371. dirty += dirty / 4;
  372. }
  373. *pbackground = background;
  374. *pdirty = dirty;
  375. }
  376. /*
  377. * bdi_dirty_limit - @bdi's share of dirty throttling threshold
  378. *
  379. * Allocate high/low dirty limits to fast/slow devices, in order to prevent
  380. * - starving fast devices
  381. * - piling up dirty pages (that will take long time to sync) on slow devices
  382. *
  383. * The bdi's share of dirty limit will be adapting to its throughput and
  384. * bounded by the bdi->min_ratio and/or bdi->max_ratio parameters, if set.
  385. */
  386. unsigned long bdi_dirty_limit(struct backing_dev_info *bdi, unsigned long dirty)
  387. {
  388. u64 bdi_dirty;
  389. long numerator, denominator;
  390. /*
  391. * Calculate this BDI's share of the dirty ratio.
  392. */
  393. bdi_writeout_fraction(bdi, &numerator, &denominator);
  394. bdi_dirty = (dirty * (100 - bdi_min_ratio)) / 100;
  395. bdi_dirty *= numerator;
  396. do_div(bdi_dirty, denominator);
  397. bdi_dirty += (dirty * bdi->min_ratio) / 100;
  398. if (bdi_dirty > (dirty * bdi->max_ratio) / 100)
  399. bdi_dirty = dirty * bdi->max_ratio / 100;
  400. return bdi_dirty;
  401. }
  402. /*
  403. * balance_dirty_pages() must be called by processes which are generating dirty
  404. * data. It looks at the number of dirty pages in the machine and will force
  405. * the caller to perform writeback if the system is over `vm_dirty_ratio'.
  406. * If we're over `background_thresh' then the writeback threads are woken to
  407. * perform some writeout.
  408. */
  409. static void balance_dirty_pages(struct address_space *mapping,
  410. unsigned long write_chunk)
  411. {
  412. long nr_reclaimable, bdi_nr_reclaimable;
  413. long nr_writeback, bdi_nr_writeback;
  414. unsigned long background_thresh;
  415. unsigned long dirty_thresh;
  416. unsigned long bdi_thresh;
  417. unsigned long pages_written = 0;
  418. unsigned long pause = 1;
  419. bool dirty_exceeded = false;
  420. struct backing_dev_info *bdi = mapping->backing_dev_info;
  421. for (;;) {
  422. struct writeback_control wbc = {
  423. .sync_mode = WB_SYNC_NONE,
  424. .older_than_this = NULL,
  425. .nr_to_write = write_chunk,
  426. .range_cyclic = 1,
  427. };
  428. nr_reclaimable = global_page_state(NR_FILE_DIRTY) +
  429. global_page_state(NR_UNSTABLE_NFS);
  430. nr_writeback = global_page_state(NR_WRITEBACK);
  431. global_dirty_limits(&background_thresh, &dirty_thresh);
  432. /*
  433. * Throttle it only when the background writeback cannot
  434. * catch-up. This avoids (excessively) small writeouts
  435. * when the bdi limits are ramping up.
  436. */
  437. if (nr_reclaimable + nr_writeback <=
  438. (background_thresh + dirty_thresh) / 2)
  439. break;
  440. bdi_thresh = bdi_dirty_limit(bdi, dirty_thresh);
  441. bdi_thresh = task_dirty_limit(current, bdi_thresh);
  442. /*
  443. * In order to avoid the stacked BDI deadlock we need
  444. * to ensure we accurately count the 'dirty' pages when
  445. * the threshold is low.
  446. *
  447. * Otherwise it would be possible to get thresh+n pages
  448. * reported dirty, even though there are thresh-m pages
  449. * actually dirty; with m+n sitting in the percpu
  450. * deltas.
  451. */
  452. if (bdi_thresh < 2*bdi_stat_error(bdi)) {
  453. bdi_nr_reclaimable = bdi_stat_sum(bdi, BDI_RECLAIMABLE);
  454. bdi_nr_writeback = bdi_stat_sum(bdi, BDI_WRITEBACK);
  455. } else {
  456. bdi_nr_reclaimable = bdi_stat(bdi, BDI_RECLAIMABLE);
  457. bdi_nr_writeback = bdi_stat(bdi, BDI_WRITEBACK);
  458. }
  459. /*
  460. * The bdi thresh is somehow "soft" limit derived from the
  461. * global "hard" limit. The former helps to prevent heavy IO
  462. * bdi or process from holding back light ones; The latter is
  463. * the last resort safeguard.
  464. */
  465. dirty_exceeded =
  466. (bdi_nr_reclaimable + bdi_nr_writeback > bdi_thresh)
  467. || (nr_reclaimable + nr_writeback > dirty_thresh);
  468. if (!dirty_exceeded)
  469. break;
  470. if (!bdi->dirty_exceeded)
  471. bdi->dirty_exceeded = 1;
  472. /* Note: nr_reclaimable denotes nr_dirty + nr_unstable.
  473. * Unstable writes are a feature of certain networked
  474. * filesystems (i.e. NFS) in which data may have been
  475. * written to the server's write cache, but has not yet
  476. * been flushed to permanent storage.
  477. * Only move pages to writeback if this bdi is over its
  478. * threshold otherwise wait until the disk writes catch
  479. * up.
  480. */
  481. trace_wbc_balance_dirty_start(&wbc, bdi);
  482. if (bdi_nr_reclaimable > bdi_thresh) {
  483. writeback_inodes_wb(&bdi->wb, &wbc);
  484. pages_written += write_chunk - wbc.nr_to_write;
  485. trace_wbc_balance_dirty_written(&wbc, bdi);
  486. if (pages_written >= write_chunk)
  487. break; /* We've done our duty */
  488. }
  489. trace_wbc_balance_dirty_wait(&wbc, bdi);
  490. __set_current_state(TASK_INTERRUPTIBLE);
  491. io_schedule_timeout(pause);
  492. /*
  493. * Increase the delay for each loop, up to our previous
  494. * default of taking a 100ms nap.
  495. */
  496. pause <<= 1;
  497. if (pause > HZ / 10)
  498. pause = HZ / 10;
  499. }
  500. if (!dirty_exceeded && bdi->dirty_exceeded)
  501. bdi->dirty_exceeded = 0;
  502. if (writeback_in_progress(bdi))
  503. return;
  504. /*
  505. * In laptop mode, we wait until hitting the higher threshold before
  506. * starting background writeout, and then write out all the way down
  507. * to the lower threshold. So slow writers cause minimal disk activity.
  508. *
  509. * In normal mode, we start background writeout at the lower
  510. * background_thresh, to keep the amount of dirty memory low.
  511. */
  512. if ((laptop_mode && pages_written) ||
  513. (!laptop_mode && (nr_reclaimable > background_thresh)))
  514. bdi_start_background_writeback(bdi);
  515. }
  516. void set_page_dirty_balance(struct page *page, int page_mkwrite)
  517. {
  518. if (set_page_dirty(page) || page_mkwrite) {
  519. struct address_space *mapping = page_mapping(page);
  520. if (mapping)
  521. balance_dirty_pages_ratelimited(mapping);
  522. }
  523. }
  524. static DEFINE_PER_CPU(unsigned long, bdp_ratelimits) = 0;
  525. /**
  526. * balance_dirty_pages_ratelimited_nr - balance dirty memory state
  527. * @mapping: address_space which was dirtied
  528. * @nr_pages_dirtied: number of pages which the caller has just dirtied
  529. *
  530. * Processes which are dirtying memory should call in here once for each page
  531. * which was newly dirtied. The function will periodically check the system's
  532. * dirty state and will initiate writeback if needed.
  533. *
  534. * On really big machines, get_writeback_state is expensive, so try to avoid
  535. * calling it too often (ratelimiting). But once we're over the dirty memory
  536. * limit we decrease the ratelimiting by a lot, to prevent individual processes
  537. * from overshooting the limit by (ratelimit_pages) each.
  538. */
  539. void balance_dirty_pages_ratelimited_nr(struct address_space *mapping,
  540. unsigned long nr_pages_dirtied)
  541. {
  542. unsigned long ratelimit;
  543. unsigned long *p;
  544. ratelimit = ratelimit_pages;
  545. if (mapping->backing_dev_info->dirty_exceeded)
  546. ratelimit = 8;
  547. /*
  548. * Check the rate limiting. Also, we do not want to throttle real-time
  549. * tasks in balance_dirty_pages(). Period.
  550. */
  551. preempt_disable();
  552. p = &__get_cpu_var(bdp_ratelimits);
  553. *p += nr_pages_dirtied;
  554. if (unlikely(*p >= ratelimit)) {
  555. ratelimit = sync_writeback_pages(*p);
  556. *p = 0;
  557. preempt_enable();
  558. balance_dirty_pages(mapping, ratelimit);
  559. return;
  560. }
  561. preempt_enable();
  562. }
  563. EXPORT_SYMBOL(balance_dirty_pages_ratelimited_nr);
  564. void throttle_vm_writeout(gfp_t gfp_mask)
  565. {
  566. unsigned long background_thresh;
  567. unsigned long dirty_thresh;
  568. for ( ; ; ) {
  569. global_dirty_limits(&background_thresh, &dirty_thresh);
  570. /*
  571. * Boost the allowable dirty threshold a bit for page
  572. * allocators so they don't get DoS'ed by heavy writers
  573. */
  574. dirty_thresh += dirty_thresh / 10; /* wheeee... */
  575. if (global_page_state(NR_UNSTABLE_NFS) +
  576. global_page_state(NR_WRITEBACK) <= dirty_thresh)
  577. break;
  578. congestion_wait(BLK_RW_ASYNC, HZ/10);
  579. /*
  580. * The caller might hold locks which can prevent IO completion
  581. * or progress in the filesystem. So we cannot just sit here
  582. * waiting for IO to complete.
  583. */
  584. if ((gfp_mask & (__GFP_FS|__GFP_IO)) != (__GFP_FS|__GFP_IO))
  585. break;
  586. }
  587. }
  588. /*
  589. * sysctl handler for /proc/sys/vm/dirty_writeback_centisecs
  590. */
  591. int dirty_writeback_centisecs_handler(ctl_table *table, int write,
  592. void __user *buffer, size_t *length, loff_t *ppos)
  593. {
  594. proc_dointvec(table, write, buffer, length, ppos);
  595. bdi_arm_supers_timer();
  596. return 0;
  597. }
  598. #ifdef CONFIG_BLOCK
  599. void laptop_mode_timer_fn(unsigned long data)
  600. {
  601. struct request_queue *q = (struct request_queue *)data;
  602. int nr_pages = global_page_state(NR_FILE_DIRTY) +
  603. global_page_state(NR_UNSTABLE_NFS);
  604. /*
  605. * We want to write everything out, not just down to the dirty
  606. * threshold
  607. */
  608. if (bdi_has_dirty_io(&q->backing_dev_info))
  609. bdi_start_writeback(&q->backing_dev_info, nr_pages);
  610. }
  611. /*
  612. * We've spun up the disk and we're in laptop mode: schedule writeback
  613. * of all dirty data a few seconds from now. If the flush is already scheduled
  614. * then push it back - the user is still using the disk.
  615. */
  616. void laptop_io_completion(struct backing_dev_info *info)
  617. {
  618. mod_timer(&info->laptop_mode_wb_timer, jiffies + laptop_mode);
  619. }
  620. /*
  621. * We're in laptop mode and we've just synced. The sync's writes will have
  622. * caused another writeback to be scheduled by laptop_io_completion.
  623. * Nothing needs to be written back anymore, so we unschedule the writeback.
  624. */
  625. void laptop_sync_completion(void)
  626. {
  627. struct backing_dev_info *bdi;
  628. rcu_read_lock();
  629. list_for_each_entry_rcu(bdi, &bdi_list, bdi_list)
  630. del_timer(&bdi->laptop_mode_wb_timer);
  631. rcu_read_unlock();
  632. }
  633. #endif
  634. /*
  635. * If ratelimit_pages is too high then we can get into dirty-data overload
  636. * if a large number of processes all perform writes at the same time.
  637. * If it is too low then SMP machines will call the (expensive)
  638. * get_writeback_state too often.
  639. *
  640. * Here we set ratelimit_pages to a level which ensures that when all CPUs are
  641. * dirtying in parallel, we cannot go more than 3% (1/32) over the dirty memory
  642. * thresholds before writeback cuts in.
  643. *
  644. * But the limit should not be set too high. Because it also controls the
  645. * amount of memory which the balance_dirty_pages() caller has to write back.
  646. * If this is too large then the caller will block on the IO queue all the
  647. * time. So limit it to four megabytes - the balance_dirty_pages() caller
  648. * will write six megabyte chunks, max.
  649. */
  650. void writeback_set_ratelimit(void)
  651. {
  652. ratelimit_pages = vm_total_pages / (num_online_cpus() * 32);
  653. if (ratelimit_pages < 16)
  654. ratelimit_pages = 16;
  655. if (ratelimit_pages * PAGE_CACHE_SIZE > 4096 * 1024)
  656. ratelimit_pages = (4096 * 1024) / PAGE_CACHE_SIZE;
  657. }
  658. static int __cpuinit
  659. ratelimit_handler(struct notifier_block *self, unsigned long u, void *v)
  660. {
  661. writeback_set_ratelimit();
  662. return NOTIFY_DONE;
  663. }
  664. static struct notifier_block __cpuinitdata ratelimit_nb = {
  665. .notifier_call = ratelimit_handler,
  666. .next = NULL,
  667. };
  668. /*
  669. * Called early on to tune the page writeback dirty limits.
  670. *
  671. * We used to scale dirty pages according to how total memory
  672. * related to pages that could be allocated for buffers (by
  673. * comparing nr_free_buffer_pages() to vm_total_pages.
  674. *
  675. * However, that was when we used "dirty_ratio" to scale with
  676. * all memory, and we don't do that any more. "dirty_ratio"
  677. * is now applied to total non-HIGHPAGE memory (by subtracting
  678. * totalhigh_pages from vm_total_pages), and as such we can't
  679. * get into the old insane situation any more where we had
  680. * large amounts of dirty pages compared to a small amount of
  681. * non-HIGHMEM memory.
  682. *
  683. * But we might still want to scale the dirty_ratio by how
  684. * much memory the box has..
  685. */
  686. void __init page_writeback_init(void)
  687. {
  688. int shift;
  689. writeback_set_ratelimit();
  690. register_cpu_notifier(&ratelimit_nb);
  691. shift = calc_period_shift();
  692. prop_descriptor_init(&vm_completions, shift);
  693. prop_descriptor_init(&vm_dirties, shift);
  694. }
  695. /**
  696. * tag_pages_for_writeback - tag pages to be written by write_cache_pages
  697. * @mapping: address space structure to write
  698. * @start: starting page index
  699. * @end: ending page index (inclusive)
  700. *
  701. * This function scans the page range from @start to @end (inclusive) and tags
  702. * all pages that have DIRTY tag set with a special TOWRITE tag. The idea is
  703. * that write_cache_pages (or whoever calls this function) will then use
  704. * TOWRITE tag to identify pages eligible for writeback. This mechanism is
  705. * used to avoid livelocking of writeback by a process steadily creating new
  706. * dirty pages in the file (thus it is important for this function to be quick
  707. * so that it can tag pages faster than a dirtying process can create them).
  708. */
  709. /*
  710. * We tag pages in batches of WRITEBACK_TAG_BATCH to reduce tree_lock latency.
  711. */
  712. void tag_pages_for_writeback(struct address_space *mapping,
  713. pgoff_t start, pgoff_t end)
  714. {
  715. #define WRITEBACK_TAG_BATCH 4096
  716. unsigned long tagged;
  717. do {
  718. spin_lock_irq(&mapping->tree_lock);
  719. tagged = radix_tree_range_tag_if_tagged(&mapping->page_tree,
  720. &start, end, WRITEBACK_TAG_BATCH,
  721. PAGECACHE_TAG_DIRTY, PAGECACHE_TAG_TOWRITE);
  722. spin_unlock_irq(&mapping->tree_lock);
  723. WARN_ON_ONCE(tagged > WRITEBACK_TAG_BATCH);
  724. cond_resched();
  725. /* We check 'start' to handle wrapping when end == ~0UL */
  726. } while (tagged >= WRITEBACK_TAG_BATCH && start);
  727. }
  728. EXPORT_SYMBOL(tag_pages_for_writeback);
  729. /**
  730. * write_cache_pages - walk the list of dirty pages of the given address space and write all of them.
  731. * @mapping: address space structure to write
  732. * @wbc: subtract the number of written pages from *@wbc->nr_to_write
  733. * @writepage: function called for each page
  734. * @data: data passed to writepage function
  735. *
  736. * If a page is already under I/O, write_cache_pages() skips it, even
  737. * if it's dirty. This is desirable behaviour for memory-cleaning writeback,
  738. * but it is INCORRECT for data-integrity system calls such as fsync(). fsync()
  739. * and msync() need to guarantee that all the data which was dirty at the time
  740. * the call was made get new I/O started against them. If wbc->sync_mode is
  741. * WB_SYNC_ALL then we were called for data integrity and we must wait for
  742. * existing IO to complete.
  743. *
  744. * To avoid livelocks (when other process dirties new pages), we first tag
  745. * pages which should be written back with TOWRITE tag and only then start
  746. * writing them. For data-integrity sync we have to be careful so that we do
  747. * not miss some pages (e.g., because some other process has cleared TOWRITE
  748. * tag we set). The rule we follow is that TOWRITE tag can be cleared only
  749. * by the process clearing the DIRTY tag (and submitting the page for IO).
  750. */
  751. int write_cache_pages(struct address_space *mapping,
  752. struct writeback_control *wbc, writepage_t writepage,
  753. void *data)
  754. {
  755. int ret = 0;
  756. int done = 0;
  757. struct pagevec pvec;
  758. int nr_pages;
  759. pgoff_t uninitialized_var(writeback_index);
  760. pgoff_t index;
  761. pgoff_t end; /* Inclusive */
  762. pgoff_t done_index;
  763. int cycled;
  764. int range_whole = 0;
  765. int tag;
  766. pagevec_init(&pvec, 0);
  767. if (wbc->range_cyclic) {
  768. writeback_index = mapping->writeback_index; /* prev offset */
  769. index = writeback_index;
  770. if (index == 0)
  771. cycled = 1;
  772. else
  773. cycled = 0;
  774. end = -1;
  775. } else {
  776. index = wbc->range_start >> PAGE_CACHE_SHIFT;
  777. end = wbc->range_end >> PAGE_CACHE_SHIFT;
  778. if (wbc->range_start == 0 && wbc->range_end == LLONG_MAX)
  779. range_whole = 1;
  780. cycled = 1; /* ignore range_cyclic tests */
  781. }
  782. if (wbc->sync_mode == WB_SYNC_ALL)
  783. tag = PAGECACHE_TAG_TOWRITE;
  784. else
  785. tag = PAGECACHE_TAG_DIRTY;
  786. retry:
  787. if (wbc->sync_mode == WB_SYNC_ALL)
  788. tag_pages_for_writeback(mapping, index, end);
  789. done_index = index;
  790. while (!done && (index <= end)) {
  791. int i;
  792. nr_pages = pagevec_lookup_tag(&pvec, mapping, &index, tag,
  793. min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1);
  794. if (nr_pages == 0)
  795. break;
  796. for (i = 0; i < nr_pages; i++) {
  797. struct page *page = pvec.pages[i];
  798. /*
  799. * At this point, the page may be truncated or
  800. * invalidated (changing page->mapping to NULL), or
  801. * even swizzled back from swapper_space to tmpfs file
  802. * mapping. However, page->index will not change
  803. * because we have a reference on the page.
  804. */
  805. if (page->index > end) {
  806. /*
  807. * can't be range_cyclic (1st pass) because
  808. * end == -1 in that case.
  809. */
  810. done = 1;
  811. break;
  812. }
  813. done_index = page->index + 1;
  814. lock_page(page);
  815. /*
  816. * Page truncated or invalidated. We can freely skip it
  817. * then, even for data integrity operations: the page
  818. * has disappeared concurrently, so there could be no
  819. * real expectation of this data interity operation
  820. * even if there is now a new, dirty page at the same
  821. * pagecache address.
  822. */
  823. if (unlikely(page->mapping != mapping)) {
  824. continue_unlock:
  825. unlock_page(page);
  826. continue;
  827. }
  828. if (!PageDirty(page)) {
  829. /* someone wrote it for us */
  830. goto continue_unlock;
  831. }
  832. if (PageWriteback(page)) {
  833. if (wbc->sync_mode != WB_SYNC_NONE)
  834. wait_on_page_writeback(page);
  835. else
  836. goto continue_unlock;
  837. }
  838. BUG_ON(PageWriteback(page));
  839. if (!clear_page_dirty_for_io(page))
  840. goto continue_unlock;
  841. trace_wbc_writepage(wbc, mapping->backing_dev_info);
  842. ret = (*writepage)(page, wbc, data);
  843. if (unlikely(ret)) {
  844. if (ret == AOP_WRITEPAGE_ACTIVATE) {
  845. unlock_page(page);
  846. ret = 0;
  847. } else {
  848. /*
  849. * done_index is set past this page,
  850. * so media errors will not choke
  851. * background writeout for the entire
  852. * file. This has consequences for
  853. * range_cyclic semantics (ie. it may
  854. * not be suitable for data integrity
  855. * writeout).
  856. */
  857. done = 1;
  858. break;
  859. }
  860. }
  861. /*
  862. * We stop writing back only if we are not doing
  863. * integrity sync. In case of integrity sync we have to
  864. * keep going until we have written all the pages
  865. * we tagged for writeback prior to entering this loop.
  866. */
  867. if (--wbc->nr_to_write <= 0 &&
  868. wbc->sync_mode == WB_SYNC_NONE) {
  869. done = 1;
  870. break;
  871. }
  872. }
  873. pagevec_release(&pvec);
  874. cond_resched();
  875. }
  876. if (!cycled && !done) {
  877. /*
  878. * range_cyclic:
  879. * We hit the last page and there is more work to be done: wrap
  880. * back to the start of the file
  881. */
  882. cycled = 1;
  883. index = 0;
  884. end = writeback_index - 1;
  885. goto retry;
  886. }
  887. if (wbc->range_cyclic || (range_whole && wbc->nr_to_write > 0))
  888. mapping->writeback_index = done_index;
  889. return ret;
  890. }
  891. EXPORT_SYMBOL(write_cache_pages);
  892. /*
  893. * Function used by generic_writepages to call the real writepage
  894. * function and set the mapping flags on error
  895. */
  896. static int __writepage(struct page *page, struct writeback_control *wbc,
  897. void *data)
  898. {
  899. struct address_space *mapping = data;
  900. int ret = mapping->a_ops->writepage(page, wbc);
  901. mapping_set_error(mapping, ret);
  902. return ret;
  903. }
  904. /**
  905. * generic_writepages - walk the list of dirty pages of the given address space and writepage() all of them.
  906. * @mapping: address space structure to write
  907. * @wbc: subtract the number of written pages from *@wbc->nr_to_write
  908. *
  909. * This is a library function, which implements the writepages()
  910. * address_space_operation.
  911. */
  912. int generic_writepages(struct address_space *mapping,
  913. struct writeback_control *wbc)
  914. {
  915. /* deal with chardevs and other special file */
  916. if (!mapping->a_ops->writepage)
  917. return 0;
  918. return write_cache_pages(mapping, wbc, __writepage, mapping);
  919. }
  920. EXPORT_SYMBOL(generic_writepages);
  921. int do_writepages(struct address_space *mapping, struct writeback_control *wbc)
  922. {
  923. int ret;
  924. if (wbc->nr_to_write <= 0)
  925. return 0;
  926. if (mapping->a_ops->writepages)
  927. ret = mapping->a_ops->writepages(mapping, wbc);
  928. else
  929. ret = generic_writepages(mapping, wbc);
  930. return ret;
  931. }
  932. /**
  933. * write_one_page - write out a single page and optionally wait on I/O
  934. * @page: the page to write
  935. * @wait: if true, wait on writeout
  936. *
  937. * The page must be locked by the caller and will be unlocked upon return.
  938. *
  939. * write_one_page() returns a negative error code if I/O failed.
  940. */
  941. int write_one_page(struct page *page, int wait)
  942. {
  943. struct address_space *mapping = page->mapping;
  944. int ret = 0;
  945. struct writeback_control wbc = {
  946. .sync_mode = WB_SYNC_ALL,
  947. .nr_to_write = 1,
  948. };
  949. BUG_ON(!PageLocked(page));
  950. if (wait)
  951. wait_on_page_writeback(page);
  952. if (clear_page_dirty_for_io(page)) {
  953. page_cache_get(page);
  954. ret = mapping->a_ops->writepage(page, &wbc);
  955. if (ret == 0 && wait) {
  956. wait_on_page_writeback(page);
  957. if (PageError(page))
  958. ret = -EIO;
  959. }
  960. page_cache_release(page);
  961. } else {
  962. unlock_page(page);
  963. }
  964. return ret;
  965. }
  966. EXPORT_SYMBOL(write_one_page);
  967. /*
  968. * For address_spaces which do not use buffers nor write back.
  969. */
  970. int __set_page_dirty_no_writeback(struct page *page)
  971. {
  972. if (!PageDirty(page))
  973. SetPageDirty(page);
  974. return 0;
  975. }
  976. /*
  977. * Helper function for set_page_dirty family.
  978. * NOTE: This relies on being atomic wrt interrupts.
  979. */
  980. void account_page_dirtied(struct page *page, struct address_space *mapping)
  981. {
  982. if (mapping_cap_account_dirty(mapping)) {
  983. __inc_zone_page_state(page, NR_FILE_DIRTY);
  984. __inc_zone_page_state(page, NR_DIRTIED);
  985. __inc_bdi_stat(mapping->backing_dev_info, BDI_RECLAIMABLE);
  986. task_dirty_inc(current);
  987. task_io_account_write(PAGE_CACHE_SIZE);
  988. }
  989. }
  990. EXPORT_SYMBOL(account_page_dirtied);
  991. /*
  992. * Helper function for set_page_writeback family.
  993. * NOTE: Unlike account_page_dirtied this does not rely on being atomic
  994. * wrt interrupts.
  995. */
  996. void account_page_writeback(struct page *page)
  997. {
  998. inc_zone_page_state(page, NR_WRITEBACK);
  999. inc_zone_page_state(page, NR_WRITTEN);
  1000. }
  1001. EXPORT_SYMBOL(account_page_writeback);
  1002. /*
  1003. * For address_spaces which do not use buffers. Just tag the page as dirty in
  1004. * its radix tree.
  1005. *
  1006. * This is also used when a single buffer is being dirtied: we want to set the
  1007. * page dirty in that case, but not all the buffers. This is a "bottom-up"
  1008. * dirtying, whereas __set_page_dirty_buffers() is a "top-down" dirtying.
  1009. *
  1010. * Most callers have locked the page, which pins the address_space in memory.
  1011. * But zap_pte_range() does not lock the page, however in that case the
  1012. * mapping is pinned by the vma's ->vm_file reference.
  1013. *
  1014. * We take care to handle the case where the page was truncated from the
  1015. * mapping by re-checking page_mapping() inside tree_lock.
  1016. */
  1017. int __set_page_dirty_nobuffers(struct page *page)
  1018. {
  1019. if (!TestSetPageDirty(page)) {
  1020. struct address_space *mapping = page_mapping(page);
  1021. struct address_space *mapping2;
  1022. if (!mapping)
  1023. return 1;
  1024. spin_lock_irq(&mapping->tree_lock);
  1025. mapping2 = page_mapping(page);
  1026. if (mapping2) { /* Race with truncate? */
  1027. BUG_ON(mapping2 != mapping);
  1028. WARN_ON_ONCE(!PagePrivate(page) && !PageUptodate(page));
  1029. account_page_dirtied(page, mapping);
  1030. radix_tree_tag_set(&mapping->page_tree,
  1031. page_index(page), PAGECACHE_TAG_DIRTY);
  1032. }
  1033. spin_unlock_irq(&mapping->tree_lock);
  1034. if (mapping->host) {
  1035. /* !PageAnon && !swapper_space */
  1036. __mark_inode_dirty(mapping->host, I_DIRTY_PAGES);
  1037. }
  1038. return 1;
  1039. }
  1040. return 0;
  1041. }
  1042. EXPORT_SYMBOL(__set_page_dirty_nobuffers);
  1043. /*
  1044. * When a writepage implementation decides that it doesn't want to write this
  1045. * page for some reason, it should redirty the locked page via
  1046. * redirty_page_for_writepage() and it should then unlock the page and return 0
  1047. */
  1048. int redirty_page_for_writepage(struct writeback_control *wbc, struct page *page)
  1049. {
  1050. wbc->pages_skipped++;
  1051. return __set_page_dirty_nobuffers(page);
  1052. }
  1053. EXPORT_SYMBOL(redirty_page_for_writepage);
  1054. /*
  1055. * Dirty a page.
  1056. *
  1057. * For pages with a mapping this should be done under the page lock
  1058. * for the benefit of asynchronous memory errors who prefer a consistent
  1059. * dirty state. This rule can be broken in some special cases,
  1060. * but should be better not to.
  1061. *
  1062. * If the mapping doesn't provide a set_page_dirty a_op, then
  1063. * just fall through and assume that it wants buffer_heads.
  1064. */
  1065. int set_page_dirty(struct page *page)
  1066. {
  1067. struct address_space *mapping = page_mapping(page);
  1068. if (likely(mapping)) {
  1069. int (*spd)(struct page *) = mapping->a_ops->set_page_dirty;
  1070. #ifdef CONFIG_BLOCK
  1071. if (!spd)
  1072. spd = __set_page_dirty_buffers;
  1073. #endif
  1074. return (*spd)(page);
  1075. }
  1076. if (!PageDirty(page)) {
  1077. if (!TestSetPageDirty(page))
  1078. return 1;
  1079. }
  1080. return 0;
  1081. }
  1082. EXPORT_SYMBOL(set_page_dirty);
  1083. /*
  1084. * set_page_dirty() is racy if the caller has no reference against
  1085. * page->mapping->host, and if the page is unlocked. This is because another
  1086. * CPU could truncate the page off the mapping and then free the mapping.
  1087. *
  1088. * Usually, the page _is_ locked, or the caller is a user-space process which
  1089. * holds a reference on the inode by having an open file.
  1090. *
  1091. * In other cases, the page should be locked before running set_page_dirty().
  1092. */
  1093. int set_page_dirty_lock(struct page *page)
  1094. {
  1095. int ret;
  1096. lock_page_nosync(page);
  1097. ret = set_page_dirty(page);
  1098. unlock_page(page);
  1099. return ret;
  1100. }
  1101. EXPORT_SYMBOL(set_page_dirty_lock);
  1102. /*
  1103. * Clear a page's dirty flag, while caring for dirty memory accounting.
  1104. * Returns true if the page was previously dirty.
  1105. *
  1106. * This is for preparing to put the page under writeout. We leave the page
  1107. * tagged as dirty in the radix tree so that a concurrent write-for-sync
  1108. * can discover it via a PAGECACHE_TAG_DIRTY walk. The ->writepage
  1109. * implementation will run either set_page_writeback() or set_page_dirty(),
  1110. * at which stage we bring the page's dirty flag and radix-tree dirty tag
  1111. * back into sync.
  1112. *
  1113. * This incoherency between the page's dirty flag and radix-tree tag is
  1114. * unfortunate, but it only exists while the page is locked.
  1115. */
  1116. int clear_page_dirty_for_io(struct page *page)
  1117. {
  1118. struct address_space *mapping = page_mapping(page);
  1119. BUG_ON(!PageLocked(page));
  1120. ClearPageReclaim(page);
  1121. if (mapping && mapping_cap_account_dirty(mapping)) {
  1122. /*
  1123. * Yes, Virginia, this is indeed insane.
  1124. *
  1125. * We use this sequence to make sure that
  1126. * (a) we account for dirty stats properly
  1127. * (b) we tell the low-level filesystem to
  1128. * mark the whole page dirty if it was
  1129. * dirty in a pagetable. Only to then
  1130. * (c) clean the page again and return 1 to
  1131. * cause the writeback.
  1132. *
  1133. * This way we avoid all nasty races with the
  1134. * dirty bit in multiple places and clearing
  1135. * them concurrently from different threads.
  1136. *
  1137. * Note! Normally the "set_page_dirty(page)"
  1138. * has no effect on the actual dirty bit - since
  1139. * that will already usually be set. But we
  1140. * need the side effects, and it can help us
  1141. * avoid races.
  1142. *
  1143. * We basically use the page "master dirty bit"
  1144. * as a serialization point for all the different
  1145. * threads doing their things.
  1146. */
  1147. if (page_mkclean(page))
  1148. set_page_dirty(page);
  1149. /*
  1150. * We carefully synchronise fault handlers against
  1151. * installing a dirty pte and marking the page dirty
  1152. * at this point. We do this by having them hold the
  1153. * page lock at some point after installing their
  1154. * pte, but before marking the page dirty.
  1155. * Pages are always locked coming in here, so we get
  1156. * the desired exclusion. See mm/memory.c:do_wp_page()
  1157. * for more comments.
  1158. */
  1159. if (TestClearPageDirty(page)) {
  1160. dec_zone_page_state(page, NR_FILE_DIRTY);
  1161. dec_bdi_stat(mapping->backing_dev_info,
  1162. BDI_RECLAIMABLE);
  1163. return 1;
  1164. }
  1165. return 0;
  1166. }
  1167. return TestClearPageDirty(page);
  1168. }
  1169. EXPORT_SYMBOL(clear_page_dirty_for_io);
  1170. int test_clear_page_writeback(struct page *page)
  1171. {
  1172. struct address_space *mapping = page_mapping(page);
  1173. int ret;
  1174. if (mapping) {
  1175. struct backing_dev_info *bdi = mapping->backing_dev_info;
  1176. unsigned long flags;
  1177. spin_lock_irqsave(&mapping->tree_lock, flags);
  1178. ret = TestClearPageWriteback(page);
  1179. if (ret) {
  1180. radix_tree_tag_clear(&mapping->page_tree,
  1181. page_index(page),
  1182. PAGECACHE_TAG_WRITEBACK);
  1183. if (bdi_cap_account_writeback(bdi)) {
  1184. __dec_bdi_stat(bdi, BDI_WRITEBACK);
  1185. __bdi_writeout_inc(bdi);
  1186. }
  1187. }
  1188. spin_unlock_irqrestore(&mapping->tree_lock, flags);
  1189. } else {
  1190. ret = TestClearPageWriteback(page);
  1191. }
  1192. if (ret)
  1193. dec_zone_page_state(page, NR_WRITEBACK);
  1194. return ret;
  1195. }
  1196. int test_set_page_writeback(struct page *page)
  1197. {
  1198. struct address_space *mapping = page_mapping(page);
  1199. int ret;
  1200. if (mapping) {
  1201. struct backing_dev_info *bdi = mapping->backing_dev_info;
  1202. unsigned long flags;
  1203. spin_lock_irqsave(&mapping->tree_lock, flags);
  1204. ret = TestSetPageWriteback(page);
  1205. if (!ret) {
  1206. radix_tree_tag_set(&mapping->page_tree,
  1207. page_index(page),
  1208. PAGECACHE_TAG_WRITEBACK);
  1209. if (bdi_cap_account_writeback(bdi))
  1210. __inc_bdi_stat(bdi, BDI_WRITEBACK);
  1211. }
  1212. if (!PageDirty(page))
  1213. radix_tree_tag_clear(&mapping->page_tree,
  1214. page_index(page),
  1215. PAGECACHE_TAG_DIRTY);
  1216. radix_tree_tag_clear(&mapping->page_tree,
  1217. page_index(page),
  1218. PAGECACHE_TAG_TOWRITE);
  1219. spin_unlock_irqrestore(&mapping->tree_lock, flags);
  1220. } else {
  1221. ret = TestSetPageWriteback(page);
  1222. }
  1223. if (!ret)
  1224. account_page_writeback(page);
  1225. return ret;
  1226. }
  1227. EXPORT_SYMBOL(test_set_page_writeback);
  1228. /*
  1229. * Return true if any of the pages in the mapping are marked with the
  1230. * passed tag.
  1231. */
  1232. int mapping_tagged(struct address_space *mapping, int tag)
  1233. {
  1234. int ret;
  1235. rcu_read_lock();
  1236. ret = radix_tree_tagged(&mapping->page_tree, tag);
  1237. rcu_read_unlock();
  1238. return ret;
  1239. }
  1240. EXPORT_SYMBOL(mapping_tagged);