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