blob: b437fe6257b02adb5520e377c5af045c8a397487 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
Uwe Zeisbergerf30c2262006-10-03 23:01:26 +02002 * mm/page-writeback.c
Linus Torvalds1da177e2005-04-16 15:20:36 -07003 *
4 * Copyright (C) 2002, Linus Torvalds.
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -07005 * Copyright (C) 2007 Red Hat, Inc., Peter Zijlstra <pzijlstr@redhat.com>
Linus Torvalds1da177e2005-04-16 15:20:36 -07006 *
7 * Contains functions related to writing back dirty pages at the
8 * address_space level.
9 *
Francois Camie1f8e872008-10-15 22:01:59 -070010 * 10Apr2002 Andrew Morton
Linus Torvalds1da177e2005-04-16 15:20:36 -070011 * 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>
Andrew Morton55e829a2006-12-10 02:19:27 -080025#include <linux/task_io_accounting_ops.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070026#include <linux/blkdev.h>
27#include <linux/mpage.h>
Peter Zijlstrad08b3852006-09-25 23:30:57 -070028#include <linux/rmap.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070029#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>
David Howellscf9a2ae2006-08-29 19:05:54 +010035#include <linux/buffer_head.h>
David Howells811d7362006-08-29 19:06:09 +010036#include <linux/pagevec.h>
Dave Chinner028c2dd2010-07-07 13:24:07 +100037#include <trace/events/writeback.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070038
39/*
Linus Torvalds1da177e2005-04-16 15:20:36 -070040 * 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
Linus Torvalds1da177e2005-04-16 15:20:36 -070045/*
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.
Wu Fengguang3a2e9a52009-09-23 21:56:00 +080048 * It should be somewhat larger than dirtied pages to ensure that reasonably
Linus Torvalds1da177e2005-04-16 15:20:36 -070049 * large amounts of I/O are submitted.
50 */
Wu Fengguang3a2e9a52009-09-23 21:56:00 +080051static inline long sync_writeback_pages(unsigned long dirtied)
Linus Torvalds1da177e2005-04-16 15:20:36 -070052{
Wu Fengguang3a2e9a52009-09-23 21:56:00 +080053 if (dirtied < ratelimit_pages)
54 dirtied = ratelimit_pages;
55
56 return dirtied + dirtied / 2;
Linus Torvalds1da177e2005-04-16 15:20:36 -070057}
58
59/* The following parameters are exported via /proc/sys/vm */
60
61/*
Jens Axboe5b0830c2009-09-23 19:37:09 +020062 * Start background writeback (via writeback threads) at this percentage
Linus Torvalds1da177e2005-04-16 15:20:36 -070063 */
Wu Fengguang1b5e62b2009-03-23 08:57:38 +080064int dirty_background_ratio = 10;
Linus Torvalds1da177e2005-04-16 15:20:36 -070065
66/*
David Rientjes2da02992009-01-06 14:39:31 -080067 * 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
72/*
Bron Gondwana195cf452008-02-04 22:29:20 -080073 * 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
78/*
Linus Torvalds1da177e2005-04-16 15:20:36 -070079 * The generator of dirty data starts writeback at this percentage
80 */
Wu Fengguang1b5e62b2009-03-23 08:57:38 +080081int vm_dirty_ratio = 20;
Linus Torvalds1da177e2005-04-16 15:20:36 -070082
83/*
David Rientjes2da02992009-01-06 14:39:31 -080084 * 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
89/*
Alexey Dobriyan704503d2009-03-31 15:23:18 -070090 * The interval between `kupdate'-style writebacks
Linus Torvalds1da177e2005-04-16 15:20:36 -070091 */
Toshiyuki Okajima22ef37e2009-05-16 22:56:28 -070092unsigned int dirty_writeback_interval = 5 * 100; /* centiseconds */
Linus Torvalds1da177e2005-04-16 15:20:36 -070093
94/*
Alexey Dobriyan704503d2009-03-31 15:23:18 -070095 * The longest time for which data is allowed to remain dirty
Linus Torvalds1da177e2005-04-16 15:20:36 -070096 */
Toshiyuki Okajima22ef37e2009-05-16 22:56:28 -070097unsigned int dirty_expire_interval = 30 * 100; /* centiseconds */
Linus Torvalds1da177e2005-04-16 15:20:36 -070098
99/*
100 * Flag that makes the machine dump writes/reads and block dirtyings.
101 */
102int block_dump;
103
104/*
Bart Samweled5b43f2006-03-24 03:15:49 -0800105 * 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.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700107 */
108int laptop_mode;
109
110EXPORT_SYMBOL(laptop_mode);
111
112/* End of sysctl-exported parameters */
113
114
Linus Torvalds1da177e2005-04-16 15:20:36 -0700115/*
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700116 * 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;
Peter Zijlstra3e26c142007-10-16 23:25:50 -0700132static struct prop_descriptor vm_dirties;
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700133
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700134/*
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
David Rientjes2da02992009-01-06 14:39:31 -0800143 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;
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700148 return 2 + ilog2(dirty_total - 1);
149}
150
151/*
David Rientjes2da02992009-01-06 14:39:31 -0800152 * update the period when the dirty threshold changes.
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700153 */
David Rientjes2da02992009-01-06 14:39:31 -0800154static 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,
Alexey Dobriyan8d65af72009-09-23 15:57:19 -0700162 void __user *buffer, size_t *lenp,
David Rientjes2da02992009-01-06 14:39:31 -0800163 loff_t *ppos)
164{
165 int ret;
166
Alexey Dobriyan8d65af72009-09-23 15:57:19 -0700167 ret = proc_dointvec_minmax(table, write, buffer, lenp, ppos);
David Rientjes2da02992009-01-06 14:39:31 -0800168 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,
Alexey Dobriyan8d65af72009-09-23 15:57:19 -0700174 void __user *buffer, size_t *lenp,
David Rientjes2da02992009-01-06 14:39:31 -0800175 loff_t *ppos)
176{
177 int ret;
178
Alexey Dobriyan8d65af72009-09-23 15:57:19 -0700179 ret = proc_doulongvec_minmax(table, write, buffer, lenp, ppos);
David Rientjes2da02992009-01-06 14:39:31 -0800180 if (ret == 0 && write)
181 dirty_background_ratio = 0;
182 return ret;
183}
184
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700185int dirty_ratio_handler(struct ctl_table *table, int write,
Alexey Dobriyan8d65af72009-09-23 15:57:19 -0700186 void __user *buffer, size_t *lenp,
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700187 loff_t *ppos)
188{
189 int old_ratio = vm_dirty_ratio;
David Rientjes2da02992009-01-06 14:39:31 -0800190 int ret;
191
Alexey Dobriyan8d65af72009-09-23 15:57:19 -0700192 ret = proc_dointvec_minmax(table, write, buffer, lenp, ppos);
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700193 if (ret == 0 && write && vm_dirty_ratio != old_ratio) {
David Rientjes2da02992009-01-06 14:39:31 -0800194 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,
Alexey Dobriyan8d65af72009-09-23 15:57:19 -0700202 void __user *buffer, size_t *lenp,
David Rientjes2da02992009-01-06 14:39:31 -0800203 loff_t *ppos)
204{
Sven Wegenerfc3501d2009-02-11 13:04:23 -0800205 unsigned long old_bytes = vm_dirty_bytes;
David Rientjes2da02992009-01-06 14:39:31 -0800206 int ret;
207
Alexey Dobriyan8d65af72009-09-23 15:57:19 -0700208 ret = proc_doulongvec_minmax(table, write, buffer, lenp, ppos);
David Rientjes2da02992009-01-06 14:39:31 -0800209 if (ret == 0 && write && vm_dirty_bytes != old_bytes) {
210 update_completion_period();
211 vm_dirty_ratio = 0;
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700212 }
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{
Peter Zijlstraa42dde02008-04-30 00:54:36 -0700222 __prop_inc_percpu_max(&vm_completions, &bdi->completions,
223 bdi->max_prop_frac);
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700224}
225
Miklos Szeredidd5656e2008-04-30 00:54:37 -0700226void 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
Nick Piggin1cf6e7d2009-02-18 14:48:18 -0800236void task_dirty_inc(struct task_struct *tsk)
Peter Zijlstra3e26c142007-10-16 23:25:50 -0700237{
238 prop_inc_single(&vm_dirties, &tsk->dirties);
239}
240
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700241/*
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
Peter Zijlstra3e26c142007-10-16 23:25:50 -0700256static inline void task_dirties_fraction(struct task_struct *tsk,
257 long *numerator, long *denominator)
258{
259 prop_fraction_single(&vm_dirties, &tsk->dirties,
260 numerator, denominator);
261}
262
263/*
Wu Fengguang1babe182010-08-11 14:17:40 -0700264 * task_dirty_limit - scale down dirty throttling threshold for one task
Peter Zijlstra3e26c142007-10-16 23:25:50 -0700265 *
266 * task specific dirty limit:
267 *
268 * dirty -= (dirty/8) * p_{t}
Wu Fengguang1babe182010-08-11 14:17:40 -0700269 *
270 * To protect light/slow dirtying tasks from heavier/fast ones, we start
271 * throttling individual tasks before reaching the bdi dirty limit.
272 * Relatively low thresholds will be allocated to heavy dirtiers. So when
273 * dirty pages grow large, heavy dirtiers will be throttled first, which will
274 * effectively curb the growth of dirty pages. Light dirtiers with high enough
275 * dirty threshold may never get throttled.
Peter Zijlstra3e26c142007-10-16 23:25:50 -0700276 */
Wu Fengguang16c40422010-08-11 14:17:39 -0700277static unsigned long task_dirty_limit(struct task_struct *tsk,
278 unsigned long bdi_dirty)
Peter Zijlstra3e26c142007-10-16 23:25:50 -0700279{
280 long numerator, denominator;
Wu Fengguang16c40422010-08-11 14:17:39 -0700281 unsigned long dirty = bdi_dirty;
Peter Zijlstra3e26c142007-10-16 23:25:50 -0700282 u64 inv = dirty >> 3;
283
284 task_dirties_fraction(tsk, &numerator, &denominator);
285 inv *= numerator;
286 do_div(inv, denominator);
287
288 dirty -= inv;
Peter Zijlstra3e26c142007-10-16 23:25:50 -0700289
Wu Fengguang16c40422010-08-11 14:17:39 -0700290 return max(dirty, bdi_dirty/2);
Peter Zijlstra3e26c142007-10-16 23:25:50 -0700291}
292
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700293/*
Peter Zijlstra189d3c42008-04-30 00:54:35 -0700294 *
295 */
Peter Zijlstra189d3c42008-04-30 00:54:35 -0700296static unsigned int bdi_min_ratio;
297
298int bdi_set_min_ratio(struct backing_dev_info *bdi, unsigned int min_ratio)
299{
300 int ret = 0;
Peter Zijlstra189d3c42008-04-30 00:54:35 -0700301
Jens Axboecfc4ba52009-09-14 13:12:40 +0200302 spin_lock_bh(&bdi_lock);
Peter Zijlstraa42dde02008-04-30 00:54:36 -0700303 if (min_ratio > bdi->max_ratio) {
Peter Zijlstra189d3c42008-04-30 00:54:35 -0700304 ret = -EINVAL;
Peter Zijlstraa42dde02008-04-30 00:54:36 -0700305 } else {
306 min_ratio -= bdi->min_ratio;
307 if (bdi_min_ratio + min_ratio < 100) {
308 bdi_min_ratio += min_ratio;
309 bdi->min_ratio += min_ratio;
310 } else {
311 ret = -EINVAL;
312 }
313 }
Jens Axboecfc4ba52009-09-14 13:12:40 +0200314 spin_unlock_bh(&bdi_lock);
Peter Zijlstra189d3c42008-04-30 00:54:35 -0700315
316 return ret;
317}
318
Peter Zijlstraa42dde02008-04-30 00:54:36 -0700319int bdi_set_max_ratio(struct backing_dev_info *bdi, unsigned max_ratio)
320{
Peter Zijlstraa42dde02008-04-30 00:54:36 -0700321 int ret = 0;
322
323 if (max_ratio > 100)
324 return -EINVAL;
325
Jens Axboecfc4ba52009-09-14 13:12:40 +0200326 spin_lock_bh(&bdi_lock);
Peter Zijlstraa42dde02008-04-30 00:54:36 -0700327 if (bdi->min_ratio > max_ratio) {
328 ret = -EINVAL;
329 } else {
330 bdi->max_ratio = max_ratio;
331 bdi->max_prop_frac = (PROP_FRAC_BASE * max_ratio) / 100;
332 }
Jens Axboecfc4ba52009-09-14 13:12:40 +0200333 spin_unlock_bh(&bdi_lock);
Peter Zijlstraa42dde02008-04-30 00:54:36 -0700334
335 return ret;
336}
337EXPORT_SYMBOL(bdi_set_max_ratio);
338
Peter Zijlstra189d3c42008-04-30 00:54:35 -0700339/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700340 * Work out the current dirty-memory clamping and background writeout
341 * thresholds.
342 *
343 * The main aim here is to lower them aggressively if there is a lot of mapped
344 * memory around. To avoid stressing page reclaim with lots of unreclaimable
345 * pages. It is better to clamp down on writers than to start swapping, and
346 * performing lots of scanning.
347 *
348 * We only allow 1/2 of the currently-unmapped memory to be dirtied.
349 *
350 * We don't permit the clamping level to fall below 5% - that is getting rather
351 * excessive.
352 *
353 * We make sure that the background writeout level is below the adjusted
354 * clamping level.
355 */
Christoph Lameter1b424462007-05-06 14:48:59 -0700356
357static unsigned long highmem_dirtyable_memory(unsigned long total)
358{
359#ifdef CONFIG_HIGHMEM
360 int node;
361 unsigned long x = 0;
362
Lee Schermerhorn37b07e42007-10-16 01:25:39 -0700363 for_each_node_state(node, N_HIGH_MEMORY) {
Christoph Lameter1b424462007-05-06 14:48:59 -0700364 struct zone *z =
365 &NODE_DATA(node)->node_zones[ZONE_HIGHMEM];
366
Wu Fengguangadea02a2009-09-21 17:01:42 -0700367 x += zone_page_state(z, NR_FREE_PAGES) +
368 zone_reclaimable_pages(z);
Christoph Lameter1b424462007-05-06 14:48:59 -0700369 }
370 /*
371 * Make sure that the number of highmem pages is never larger
372 * than the number of the total dirtyable memory. This can only
373 * occur in very strange VM situations but we want to make sure
374 * that this does not occur.
375 */
376 return min(x, total);
377#else
378 return 0;
379#endif
380}
381
Steven Rostedt3eefae92008-05-12 21:21:04 +0200382/**
383 * determine_dirtyable_memory - amount of memory that may be used
384 *
385 * Returns the numebr of pages that can currently be freed and used
386 * by the kernel for direct mappings.
387 */
388unsigned long determine_dirtyable_memory(void)
Christoph Lameter1b424462007-05-06 14:48:59 -0700389{
390 unsigned long x;
391
Wu Fengguangadea02a2009-09-21 17:01:42 -0700392 x = global_page_state(NR_FREE_PAGES) + global_reclaimable_pages();
Bron Gondwana195cf452008-02-04 22:29:20 -0800393
394 if (!vm_highmem_is_dirtyable)
395 x -= highmem_dirtyable_memory(x);
396
Christoph Lameter1b424462007-05-06 14:48:59 -0700397 return x + 1; /* Ensure that we never return 0 */
398}
399
Randy Dunlap03ab4502010-08-14 13:05:17 -0700400/*
Wu Fengguang1babe182010-08-11 14:17:40 -0700401 * global_dirty_limits - background-writeback and dirty-throttling thresholds
402 *
403 * Calculate the dirty thresholds based on sysctl parameters
404 * - vm.dirty_background_ratio or vm.dirty_background_bytes
405 * - vm.dirty_ratio or vm.dirty_bytes
406 * The dirty limits will be lifted by 1/4 for PF_LESS_THROTTLE (ie. nfsd) and
Minchan Kimebd13732011-01-04 01:36:48 +0900407 * real-time tasks.
Wu Fengguang1babe182010-08-11 14:17:40 -0700408 */
Wu Fengguang16c40422010-08-11 14:17:39 -0700409void global_dirty_limits(unsigned long *pbackground, unsigned long *pdirty)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700410{
David Rientjes364aeb22009-01-06 14:39:29 -0800411 unsigned long background;
412 unsigned long dirty;
Minchan Kim240c8792011-01-13 15:46:27 -0800413 unsigned long uninitialized_var(available_memory);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700414 struct task_struct *tsk;
415
Minchan Kim240c8792011-01-13 15:46:27 -0800416 if (!vm_dirty_bytes || !dirty_background_bytes)
417 available_memory = determine_dirtyable_memory();
418
David Rientjes2da02992009-01-06 14:39:31 -0800419 if (vm_dirty_bytes)
420 dirty = DIV_ROUND_UP(vm_dirty_bytes, PAGE_SIZE);
Wu Fengguang4cbec4c2010-10-26 14:21:45 -0700421 else
422 dirty = (vm_dirty_ratio * available_memory) / 100;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700423
David Rientjes2da02992009-01-06 14:39:31 -0800424 if (dirty_background_bytes)
425 background = DIV_ROUND_UP(dirty_background_bytes, PAGE_SIZE);
426 else
427 background = (dirty_background_ratio * available_memory) / 100;
428
429 if (background >= dirty)
430 background = dirty / 2;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700431 tsk = current;
432 if (tsk->flags & PF_LESS_THROTTLE || rt_task(tsk)) {
433 background += background / 4;
434 dirty += dirty / 4;
435 }
436 *pbackground = background;
437 *pdirty = dirty;
Wu Fengguang16c40422010-08-11 14:17:39 -0700438}
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700439
Randy Dunlap03ab4502010-08-14 13:05:17 -0700440/*
Wu Fengguang1babe182010-08-11 14:17:40 -0700441 * bdi_dirty_limit - @bdi's share of dirty throttling threshold
442 *
443 * Allocate high/low dirty limits to fast/slow devices, in order to prevent
444 * - starving fast devices
445 * - piling up dirty pages (that will take long time to sync) on slow devices
446 *
447 * The bdi's share of dirty limit will be adapting to its throughput and
448 * bounded by the bdi->min_ratio and/or bdi->max_ratio parameters, if set.
449 */
450unsigned long bdi_dirty_limit(struct backing_dev_info *bdi, unsigned long dirty)
Wu Fengguang16c40422010-08-11 14:17:39 -0700451{
452 u64 bdi_dirty;
453 long numerator, denominator;
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700454
Wu Fengguang16c40422010-08-11 14:17:39 -0700455 /*
456 * Calculate this BDI's share of the dirty ratio.
457 */
458 bdi_writeout_fraction(bdi, &numerator, &denominator);
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700459
Wu Fengguang16c40422010-08-11 14:17:39 -0700460 bdi_dirty = (dirty * (100 - bdi_min_ratio)) / 100;
461 bdi_dirty *= numerator;
462 do_div(bdi_dirty, denominator);
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700463
Wu Fengguang16c40422010-08-11 14:17:39 -0700464 bdi_dirty += (dirty * bdi->min_ratio) / 100;
465 if (bdi_dirty > (dirty * bdi->max_ratio) / 100)
466 bdi_dirty = dirty * bdi->max_ratio / 100;
467
468 return bdi_dirty;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700469}
470
471/*
472 * balance_dirty_pages() must be called by processes which are generating dirty
473 * data. It looks at the number of dirty pages in the machine and will force
474 * the caller to perform writeback if the system is over `vm_dirty_ratio'.
Jens Axboe5b0830c2009-09-23 19:37:09 +0200475 * If we're over `background_thresh' then the writeback threads are woken to
476 * perform some writeout.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700477 */
Wu Fengguang3a2e9a52009-09-23 21:56:00 +0800478static void balance_dirty_pages(struct address_space *mapping,
479 unsigned long write_chunk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700480{
Peter Zijlstra5fce25a2007-11-14 16:59:15 -0800481 long nr_reclaimable, bdi_nr_reclaimable;
482 long nr_writeback, bdi_nr_writeback;
David Rientjes364aeb22009-01-06 14:39:29 -0800483 unsigned long background_thresh;
484 unsigned long dirty_thresh;
485 unsigned long bdi_thresh;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700486 unsigned long pages_written = 0;
Jens Axboe87c6a9b2009-09-17 19:59:14 +0200487 unsigned long pause = 1;
Wu Fengguange50e3722010-08-11 14:17:37 -0700488 bool dirty_exceeded = false;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700489 struct backing_dev_info *bdi = mapping->backing_dev_info;
490
491 for (;;) {
492 struct writeback_control wbc = {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700493 .sync_mode = WB_SYNC_NONE,
494 .older_than_this = NULL,
495 .nr_to_write = write_chunk,
OGAWA Hirofumi111ebb62006-06-23 02:03:26 -0700496 .range_cyclic = 1,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700497 };
498
Peter Zijlstra5fce25a2007-11-14 16:59:15 -0800499 nr_reclaimable = global_page_state(NR_FILE_DIRTY) +
500 global_page_state(NR_UNSTABLE_NFS);
501 nr_writeback = global_page_state(NR_WRITEBACK);
502
Wu Fengguang16c40422010-08-11 14:17:39 -0700503 global_dirty_limits(&background_thresh, &dirty_thresh);
504
505 /*
506 * Throttle it only when the background writeback cannot
507 * catch-up. This avoids (excessively) small writeouts
508 * when the bdi limits are ramping up.
509 */
Wu Fengguang4cbec4c2010-10-26 14:21:45 -0700510 if (nr_reclaimable + nr_writeback <=
Wu Fengguang16c40422010-08-11 14:17:39 -0700511 (background_thresh + dirty_thresh) / 2)
512 break;
513
514 bdi_thresh = bdi_dirty_limit(bdi, dirty_thresh);
515 bdi_thresh = task_dirty_limit(current, bdi_thresh);
516
Wu Fengguange50e3722010-08-11 14:17:37 -0700517 /*
518 * In order to avoid the stacked BDI deadlock we need
519 * to ensure we accurately count the 'dirty' pages when
520 * the threshold is low.
521 *
522 * Otherwise it would be possible to get thresh+n pages
523 * reported dirty, even though there are thresh-m pages
524 * actually dirty; with m+n sitting in the percpu
525 * deltas.
526 */
527 if (bdi_thresh < 2*bdi_stat_error(bdi)) {
528 bdi_nr_reclaimable = bdi_stat_sum(bdi, BDI_RECLAIMABLE);
529 bdi_nr_writeback = bdi_stat_sum(bdi, BDI_WRITEBACK);
530 } else {
531 bdi_nr_reclaimable = bdi_stat(bdi, BDI_RECLAIMABLE);
532 bdi_nr_writeback = bdi_stat(bdi, BDI_WRITEBACK);
533 }
Peter Zijlstra5fce25a2007-11-14 16:59:15 -0800534
Wu Fengguange50e3722010-08-11 14:17:37 -0700535 /*
536 * The bdi thresh is somehow "soft" limit derived from the
537 * global "hard" limit. The former helps to prevent heavy IO
538 * bdi or process from holding back light ones; The latter is
539 * the last resort safeguard.
540 */
541 dirty_exceeded =
Wu Fengguang4cbec4c2010-10-26 14:21:45 -0700542 (bdi_nr_reclaimable + bdi_nr_writeback > bdi_thresh)
543 || (nr_reclaimable + nr_writeback > dirty_thresh);
Wu Fengguange50e3722010-08-11 14:17:37 -0700544
545 if (!dirty_exceeded)
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700546 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700547
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700548 if (!bdi->dirty_exceeded)
549 bdi->dirty_exceeded = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700550
551 /* Note: nr_reclaimable denotes nr_dirty + nr_unstable.
552 * Unstable writes are a feature of certain networked
553 * filesystems (i.e. NFS) in which data may have been
554 * written to the server's write cache, but has not yet
555 * been flushed to permanent storage.
Richard Kennedyd7831a02009-06-30 11:41:35 -0700556 * Only move pages to writeback if this bdi is over its
557 * threshold otherwise wait until the disk writes catch
558 * up.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700559 */
Dave Chinner028c2dd2010-07-07 13:24:07 +1000560 trace_wbc_balance_dirty_start(&wbc, bdi);
Richard Kennedyd7831a02009-06-30 11:41:35 -0700561 if (bdi_nr_reclaimable > bdi_thresh) {
Christoph Hellwig9c3a8ee2010-06-10 12:07:27 +0200562 writeback_inodes_wb(&bdi->wb, &wbc);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700563 pages_written += write_chunk - wbc.nr_to_write;
Dave Chinner028c2dd2010-07-07 13:24:07 +1000564 trace_wbc_balance_dirty_written(&wbc, bdi);
Wu Fengguange50e3722010-08-11 14:17:37 -0700565 if (pages_written >= write_chunk)
566 break; /* We've done our duty */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700567 }
Dave Chinner028c2dd2010-07-07 13:24:07 +1000568 trace_wbc_balance_dirty_wait(&wbc, bdi);
Wu Fengguangd153ba62010-12-21 17:24:21 -0800569 __set_current_state(TASK_UNINTERRUPTIBLE);
Wu Fengguangd25105e2009-10-09 12:40:42 +0200570 io_schedule_timeout(pause);
Jens Axboe87c6a9b2009-09-17 19:59:14 +0200571
572 /*
573 * Increase the delay for each loop, up to our previous
574 * default of taking a 100ms nap.
575 */
576 pause <<= 1;
577 if (pause > HZ / 10)
578 pause = HZ / 10;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700579 }
580
Wu Fengguange50e3722010-08-11 14:17:37 -0700581 if (!dirty_exceeded && bdi->dirty_exceeded)
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700582 bdi->dirty_exceeded = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700583
584 if (writeback_in_progress(bdi))
Jens Axboe5b0830c2009-09-23 19:37:09 +0200585 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700586
587 /*
588 * In laptop mode, we wait until hitting the higher threshold before
589 * starting background writeout, and then write out all the way down
590 * to the lower threshold. So slow writers cause minimal disk activity.
591 *
592 * In normal mode, we start background writeout at the lower
593 * background_thresh, to keep the amount of dirty memory low.
594 */
595 if ((laptop_mode && pages_written) ||
Wu Fengguange50e3722010-08-11 14:17:37 -0700596 (!laptop_mode && (nr_reclaimable > background_thresh)))
Christoph Hellwigc5444192010-06-08 18:15:15 +0200597 bdi_start_background_writeback(bdi);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700598}
599
Peter Zijlstraa200ee12007-10-08 18:54:37 +0200600void set_page_dirty_balance(struct page *page, int page_mkwrite)
Peter Zijlstraedc79b22006-09-25 23:30:58 -0700601{
Peter Zijlstraa200ee12007-10-08 18:54:37 +0200602 if (set_page_dirty(page) || page_mkwrite) {
Peter Zijlstraedc79b22006-09-25 23:30:58 -0700603 struct address_space *mapping = page_mapping(page);
604
605 if (mapping)
606 balance_dirty_pages_ratelimited(mapping);
607 }
608}
609
Tejun Heo245b2e72009-06-24 15:13:48 +0900610static DEFINE_PER_CPU(unsigned long, bdp_ratelimits) = 0;
611
Linus Torvalds1da177e2005-04-16 15:20:36 -0700612/**
Andrew Mortonfa5a7342006-03-24 03:18:10 -0800613 * balance_dirty_pages_ratelimited_nr - balance dirty memory state
Martin Waitz67be2dd2005-05-01 08:59:26 -0700614 * @mapping: address_space which was dirtied
Martin Waitza5802902006-04-02 13:59:55 +0200615 * @nr_pages_dirtied: number of pages which the caller has just dirtied
Linus Torvalds1da177e2005-04-16 15:20:36 -0700616 *
617 * Processes which are dirtying memory should call in here once for each page
618 * which was newly dirtied. The function will periodically check the system's
619 * dirty state and will initiate writeback if needed.
620 *
621 * On really big machines, get_writeback_state is expensive, so try to avoid
622 * calling it too often (ratelimiting). But once we're over the dirty memory
623 * limit we decrease the ratelimiting by a lot, to prevent individual processes
624 * from overshooting the limit by (ratelimit_pages) each.
625 */
Andrew Mortonfa5a7342006-03-24 03:18:10 -0800626void balance_dirty_pages_ratelimited_nr(struct address_space *mapping,
627 unsigned long nr_pages_dirtied)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700628{
Andrew Mortonfa5a7342006-03-24 03:18:10 -0800629 unsigned long ratelimit;
630 unsigned long *p;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700631
632 ratelimit = ratelimit_pages;
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700633 if (mapping->backing_dev_info->dirty_exceeded)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700634 ratelimit = 8;
635
636 /*
637 * Check the rate limiting. Also, we do not want to throttle real-time
638 * tasks in balance_dirty_pages(). Period.
639 */
Andrew Mortonfa5a7342006-03-24 03:18:10 -0800640 preempt_disable();
Tejun Heo245b2e72009-06-24 15:13:48 +0900641 p = &__get_cpu_var(bdp_ratelimits);
Andrew Mortonfa5a7342006-03-24 03:18:10 -0800642 *p += nr_pages_dirtied;
643 if (unlikely(*p >= ratelimit)) {
Wu Fengguang3a2e9a52009-09-23 21:56:00 +0800644 ratelimit = sync_writeback_pages(*p);
Andrew Mortonfa5a7342006-03-24 03:18:10 -0800645 *p = 0;
646 preempt_enable();
Wu Fengguang3a2e9a52009-09-23 21:56:00 +0800647 balance_dirty_pages(mapping, ratelimit);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700648 return;
649 }
Andrew Mortonfa5a7342006-03-24 03:18:10 -0800650 preempt_enable();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700651}
Andrew Mortonfa5a7342006-03-24 03:18:10 -0800652EXPORT_SYMBOL(balance_dirty_pages_ratelimited_nr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700653
Andrew Morton232ea4d2007-02-28 20:13:21 -0800654void throttle_vm_writeout(gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700655{
David Rientjes364aeb22009-01-06 14:39:29 -0800656 unsigned long background_thresh;
657 unsigned long dirty_thresh;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700658
659 for ( ; ; ) {
Wu Fengguang16c40422010-08-11 14:17:39 -0700660 global_dirty_limits(&background_thresh, &dirty_thresh);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700661
662 /*
663 * Boost the allowable dirty threshold a bit for page
664 * allocators so they don't get DoS'ed by heavy writers
665 */
666 dirty_thresh += dirty_thresh / 10; /* wheeee... */
667
Christoph Lameterc24f21b2006-06-30 01:55:42 -0700668 if (global_page_state(NR_UNSTABLE_NFS) +
669 global_page_state(NR_WRITEBACK) <= dirty_thresh)
670 break;
Jens Axboe8aa7e842009-07-09 14:52:32 +0200671 congestion_wait(BLK_RW_ASYNC, HZ/10);
Fengguang Wu369f2382007-10-16 23:30:45 -0700672
673 /*
674 * The caller might hold locks which can prevent IO completion
675 * or progress in the filesystem. So we cannot just sit here
676 * waiting for IO to complete.
677 */
678 if ((gfp_mask & (__GFP_FS|__GFP_IO)) != (__GFP_FS|__GFP_IO))
679 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700680 }
681}
682
Linus Torvalds1da177e2005-04-16 15:20:36 -0700683/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700684 * sysctl handler for /proc/sys/vm/dirty_writeback_centisecs
685 */
686int dirty_writeback_centisecs_handler(ctl_table *table, int write,
Alexey Dobriyan8d65af72009-09-23 15:57:19 -0700687 void __user *buffer, size_t *length, loff_t *ppos)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700688{
Alexey Dobriyan8d65af72009-09-23 15:57:19 -0700689 proc_dointvec(table, write, buffer, length, ppos);
Jens Axboe64231042010-05-21 20:00:35 +0200690 bdi_arm_supers_timer();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700691 return 0;
692}
693
Jens Axboec2c49862010-05-20 09:18:47 +0200694#ifdef CONFIG_BLOCK
Matthew Garrett31373d02010-04-06 14:25:14 +0200695void laptop_mode_timer_fn(unsigned long data)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700696{
Matthew Garrett31373d02010-04-06 14:25:14 +0200697 struct request_queue *q = (struct request_queue *)data;
698 int nr_pages = global_page_state(NR_FILE_DIRTY) +
699 global_page_state(NR_UNSTABLE_NFS);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700700
Matthew Garrett31373d02010-04-06 14:25:14 +0200701 /*
702 * We want to write everything out, not just down to the dirty
703 * threshold
704 */
Matthew Garrett31373d02010-04-06 14:25:14 +0200705 if (bdi_has_dirty_io(&q->backing_dev_info))
Christoph Hellwigc5444192010-06-08 18:15:15 +0200706 bdi_start_writeback(&q->backing_dev_info, nr_pages);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700707}
708
709/*
710 * We've spun up the disk and we're in laptop mode: schedule writeback
711 * of all dirty data a few seconds from now. If the flush is already scheduled
712 * then push it back - the user is still using the disk.
713 */
Matthew Garrett31373d02010-04-06 14:25:14 +0200714void laptop_io_completion(struct backing_dev_info *info)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700715{
Matthew Garrett31373d02010-04-06 14:25:14 +0200716 mod_timer(&info->laptop_mode_wb_timer, jiffies + laptop_mode);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700717}
718
719/*
720 * We're in laptop mode and we've just synced. The sync's writes will have
721 * caused another writeback to be scheduled by laptop_io_completion.
722 * Nothing needs to be written back anymore, so we unschedule the writeback.
723 */
724void laptop_sync_completion(void)
725{
Matthew Garrett31373d02010-04-06 14:25:14 +0200726 struct backing_dev_info *bdi;
727
728 rcu_read_lock();
729
730 list_for_each_entry_rcu(bdi, &bdi_list, bdi_list)
731 del_timer(&bdi->laptop_mode_wb_timer);
732
733 rcu_read_unlock();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700734}
Jens Axboec2c49862010-05-20 09:18:47 +0200735#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700736
737/*
738 * If ratelimit_pages is too high then we can get into dirty-data overload
739 * if a large number of processes all perform writes at the same time.
740 * If it is too low then SMP machines will call the (expensive)
741 * get_writeback_state too often.
742 *
743 * Here we set ratelimit_pages to a level which ensures that when all CPUs are
744 * dirtying in parallel, we cannot go more than 3% (1/32) over the dirty memory
745 * thresholds before writeback cuts in.
746 *
747 * But the limit should not be set too high. Because it also controls the
748 * amount of memory which the balance_dirty_pages() caller has to write back.
749 * If this is too large then the caller will block on the IO queue all the
750 * time. So limit it to four megabytes - the balance_dirty_pages() caller
751 * will write six megabyte chunks, max.
752 */
753
Chandra Seetharaman2d1d43f2006-09-29 02:01:25 -0700754void writeback_set_ratelimit(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700755{
Chandra Seetharaman40c99aa2006-09-29 02:01:24 -0700756 ratelimit_pages = vm_total_pages / (num_online_cpus() * 32);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700757 if (ratelimit_pages < 16)
758 ratelimit_pages = 16;
759 if (ratelimit_pages * PAGE_CACHE_SIZE > 4096 * 1024)
760 ratelimit_pages = (4096 * 1024) / PAGE_CACHE_SIZE;
761}
762
Chandra Seetharaman26c21432006-06-27 02:54:10 -0700763static int __cpuinit
Linus Torvalds1da177e2005-04-16 15:20:36 -0700764ratelimit_handler(struct notifier_block *self, unsigned long u, void *v)
765{
Chandra Seetharaman2d1d43f2006-09-29 02:01:25 -0700766 writeback_set_ratelimit();
Paul E. McKenneyaa0f0302007-02-10 01:46:37 -0800767 return NOTIFY_DONE;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700768}
769
Chandra Seetharaman74b85f32006-06-27 02:54:09 -0700770static struct notifier_block __cpuinitdata ratelimit_nb = {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700771 .notifier_call = ratelimit_handler,
772 .next = NULL,
773};
774
775/*
Linus Torvaldsdc6e29d2007-01-29 16:37:38 -0800776 * Called early on to tune the page writeback dirty limits.
777 *
778 * We used to scale dirty pages according to how total memory
779 * related to pages that could be allocated for buffers (by
780 * comparing nr_free_buffer_pages() to vm_total_pages.
781 *
782 * However, that was when we used "dirty_ratio" to scale with
783 * all memory, and we don't do that any more. "dirty_ratio"
784 * is now applied to total non-HIGHPAGE memory (by subtracting
785 * totalhigh_pages from vm_total_pages), and as such we can't
786 * get into the old insane situation any more where we had
787 * large amounts of dirty pages compared to a small amount of
788 * non-HIGHMEM memory.
789 *
790 * But we might still want to scale the dirty_ratio by how
791 * much memory the box has..
Linus Torvalds1da177e2005-04-16 15:20:36 -0700792 */
793void __init page_writeback_init(void)
794{
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700795 int shift;
796
Chandra Seetharaman2d1d43f2006-09-29 02:01:25 -0700797 writeback_set_ratelimit();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700798 register_cpu_notifier(&ratelimit_nb);
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -0700799
800 shift = calc_period_shift();
801 prop_descriptor_init(&vm_completions, shift);
Peter Zijlstra3e26c142007-10-16 23:25:50 -0700802 prop_descriptor_init(&vm_dirties, shift);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700803}
804
David Howells811d7362006-08-29 19:06:09 +0100805/**
Jan Karaf446daa2010-08-09 17:19:12 -0700806 * tag_pages_for_writeback - tag pages to be written by write_cache_pages
807 * @mapping: address space structure to write
808 * @start: starting page index
809 * @end: ending page index (inclusive)
810 *
811 * This function scans the page range from @start to @end (inclusive) and tags
812 * all pages that have DIRTY tag set with a special TOWRITE tag. The idea is
813 * that write_cache_pages (or whoever calls this function) will then use
814 * TOWRITE tag to identify pages eligible for writeback. This mechanism is
815 * used to avoid livelocking of writeback by a process steadily creating new
816 * dirty pages in the file (thus it is important for this function to be quick
817 * so that it can tag pages faster than a dirtying process can create them).
818 */
819/*
820 * We tag pages in batches of WRITEBACK_TAG_BATCH to reduce tree_lock latency.
821 */
Jan Karaf446daa2010-08-09 17:19:12 -0700822void tag_pages_for_writeback(struct address_space *mapping,
823 pgoff_t start, pgoff_t end)
824{
Randy Dunlap3c111a02010-08-11 14:17:30 -0700825#define WRITEBACK_TAG_BATCH 4096
Jan Karaf446daa2010-08-09 17:19:12 -0700826 unsigned long tagged;
827
828 do {
829 spin_lock_irq(&mapping->tree_lock);
830 tagged = radix_tree_range_tag_if_tagged(&mapping->page_tree,
831 &start, end, WRITEBACK_TAG_BATCH,
832 PAGECACHE_TAG_DIRTY, PAGECACHE_TAG_TOWRITE);
833 spin_unlock_irq(&mapping->tree_lock);
834 WARN_ON_ONCE(tagged > WRITEBACK_TAG_BATCH);
835 cond_resched();
Jan Karad5ed3a42010-08-19 14:13:33 -0700836 /* We check 'start' to handle wrapping when end == ~0UL */
837 } while (tagged >= WRITEBACK_TAG_BATCH && start);
Jan Karaf446daa2010-08-09 17:19:12 -0700838}
839EXPORT_SYMBOL(tag_pages_for_writeback);
840
841/**
Miklos Szeredi0ea97182007-05-10 22:22:51 -0700842 * write_cache_pages - walk the list of dirty pages of the given address space and write all of them.
David Howells811d7362006-08-29 19:06:09 +0100843 * @mapping: address space structure to write
844 * @wbc: subtract the number of written pages from *@wbc->nr_to_write
Miklos Szeredi0ea97182007-05-10 22:22:51 -0700845 * @writepage: function called for each page
846 * @data: data passed to writepage function
David Howells811d7362006-08-29 19:06:09 +0100847 *
Miklos Szeredi0ea97182007-05-10 22:22:51 -0700848 * If a page is already under I/O, write_cache_pages() skips it, even
David Howells811d7362006-08-29 19:06:09 +0100849 * if it's dirty. This is desirable behaviour for memory-cleaning writeback,
850 * but it is INCORRECT for data-integrity system calls such as fsync(). fsync()
851 * and msync() need to guarantee that all the data which was dirty at the time
852 * the call was made get new I/O started against them. If wbc->sync_mode is
853 * WB_SYNC_ALL then we were called for data integrity and we must wait for
854 * existing IO to complete.
Jan Karaf446daa2010-08-09 17:19:12 -0700855 *
856 * To avoid livelocks (when other process dirties new pages), we first tag
857 * pages which should be written back with TOWRITE tag and only then start
858 * writing them. For data-integrity sync we have to be careful so that we do
859 * not miss some pages (e.g., because some other process has cleared TOWRITE
860 * tag we set). The rule we follow is that TOWRITE tag can be cleared only
861 * by the process clearing the DIRTY tag (and submitting the page for IO).
David Howells811d7362006-08-29 19:06:09 +0100862 */
Miklos Szeredi0ea97182007-05-10 22:22:51 -0700863int write_cache_pages(struct address_space *mapping,
864 struct writeback_control *wbc, writepage_t writepage,
865 void *data)
David Howells811d7362006-08-29 19:06:09 +0100866{
David Howells811d7362006-08-29 19:06:09 +0100867 int ret = 0;
868 int done = 0;
David Howells811d7362006-08-29 19:06:09 +0100869 struct pagevec pvec;
870 int nr_pages;
Nick Piggin31a12662009-01-06 14:39:04 -0800871 pgoff_t uninitialized_var(writeback_index);
David Howells811d7362006-08-29 19:06:09 +0100872 pgoff_t index;
873 pgoff_t end; /* Inclusive */
Nick Pigginbd19e012009-01-06 14:39:06 -0800874 pgoff_t done_index;
Nick Piggin31a12662009-01-06 14:39:04 -0800875 int cycled;
David Howells811d7362006-08-29 19:06:09 +0100876 int range_whole = 0;
Jan Karaf446daa2010-08-09 17:19:12 -0700877 int tag;
David Howells811d7362006-08-29 19:06:09 +0100878
David Howells811d7362006-08-29 19:06:09 +0100879 pagevec_init(&pvec, 0);
880 if (wbc->range_cyclic) {
Nick Piggin31a12662009-01-06 14:39:04 -0800881 writeback_index = mapping->writeback_index; /* prev offset */
882 index = writeback_index;
883 if (index == 0)
884 cycled = 1;
885 else
886 cycled = 0;
David Howells811d7362006-08-29 19:06:09 +0100887 end = -1;
888 } else {
889 index = wbc->range_start >> PAGE_CACHE_SHIFT;
890 end = wbc->range_end >> PAGE_CACHE_SHIFT;
891 if (wbc->range_start == 0 && wbc->range_end == LLONG_MAX)
892 range_whole = 1;
Nick Piggin31a12662009-01-06 14:39:04 -0800893 cycled = 1; /* ignore range_cyclic tests */
David Howells811d7362006-08-29 19:06:09 +0100894 }
Jan Karaf446daa2010-08-09 17:19:12 -0700895 if (wbc->sync_mode == WB_SYNC_ALL)
896 tag = PAGECACHE_TAG_TOWRITE;
897 else
898 tag = PAGECACHE_TAG_DIRTY;
David Howells811d7362006-08-29 19:06:09 +0100899retry:
Jan Karaf446daa2010-08-09 17:19:12 -0700900 if (wbc->sync_mode == WB_SYNC_ALL)
901 tag_pages_for_writeback(mapping, index, end);
Nick Pigginbd19e012009-01-06 14:39:06 -0800902 done_index = index;
Nick Piggin5a3d5c92009-01-06 14:39:09 -0800903 while (!done && (index <= end)) {
904 int i;
905
Jan Karaf446daa2010-08-09 17:19:12 -0700906 nr_pages = pagevec_lookup_tag(&pvec, mapping, &index, tag,
Nick Piggin5a3d5c92009-01-06 14:39:09 -0800907 min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1);
908 if (nr_pages == 0)
909 break;
David Howells811d7362006-08-29 19:06:09 +0100910
David Howells811d7362006-08-29 19:06:09 +0100911 for (i = 0; i < nr_pages; i++) {
912 struct page *page = pvec.pages[i];
913
Nick Piggind5482cd2009-01-06 14:39:11 -0800914 /*
915 * At this point, the page may be truncated or
916 * invalidated (changing page->mapping to NULL), or
917 * even swizzled back from swapper_space to tmpfs file
918 * mapping. However, page->index will not change
919 * because we have a reference on the page.
920 */
921 if (page->index > end) {
922 /*
923 * can't be range_cyclic (1st pass) because
924 * end == -1 in that case.
925 */
926 done = 1;
927 break;
928 }
929
Nick Pigginbd19e012009-01-06 14:39:06 -0800930 done_index = page->index + 1;
931
David Howells811d7362006-08-29 19:06:09 +0100932 lock_page(page);
933
Nick Piggin5a3d5c92009-01-06 14:39:09 -0800934 /*
935 * Page truncated or invalidated. We can freely skip it
936 * then, even for data integrity operations: the page
937 * has disappeared concurrently, so there could be no
938 * real expectation of this data interity operation
939 * even if there is now a new, dirty page at the same
940 * pagecache address.
941 */
David Howells811d7362006-08-29 19:06:09 +0100942 if (unlikely(page->mapping != mapping)) {
Nick Piggin5a3d5c92009-01-06 14:39:09 -0800943continue_unlock:
David Howells811d7362006-08-29 19:06:09 +0100944 unlock_page(page);
945 continue;
946 }
947
Nick Piggin515f4a02009-01-06 14:39:10 -0800948 if (!PageDirty(page)) {
949 /* someone wrote it for us */
950 goto continue_unlock;
951 }
David Howells811d7362006-08-29 19:06:09 +0100952
Nick Piggin515f4a02009-01-06 14:39:10 -0800953 if (PageWriteback(page)) {
954 if (wbc->sync_mode != WB_SYNC_NONE)
955 wait_on_page_writeback(page);
956 else
957 goto continue_unlock;
958 }
959
960 BUG_ON(PageWriteback(page));
961 if (!clear_page_dirty_for_io(page))
Nick Piggin5a3d5c92009-01-06 14:39:09 -0800962 goto continue_unlock;
David Howells811d7362006-08-29 19:06:09 +0100963
Dave Chinner9e094382010-07-07 13:24:08 +1000964 trace_wbc_writepage(wbc, mapping->backing_dev_info);
Miklos Szeredi0ea97182007-05-10 22:22:51 -0700965 ret = (*writepage)(page, wbc, data);
Nick Piggin00266772009-01-06 14:39:06 -0800966 if (unlikely(ret)) {
967 if (ret == AOP_WRITEPAGE_ACTIVATE) {
968 unlock_page(page);
969 ret = 0;
970 } else {
971 /*
972 * done_index is set past this page,
973 * so media errors will not choke
974 * background writeout for the entire
975 * file. This has consequences for
976 * range_cyclic semantics (ie. it may
977 * not be suitable for data integrity
978 * writeout).
979 */
980 done = 1;
981 break;
982 }
Dave Chinner0b564922010-06-09 10:37:18 +1000983 }
David Howells811d7362006-08-29 19:06:09 +0100984
Dave Chinner546a1922010-08-24 11:44:34 +1000985 /*
986 * We stop writing back only if we are not doing
987 * integrity sync. In case of integrity sync we have to
988 * keep going until we have written all the pages
989 * we tagged for writeback prior to entering this loop.
990 */
991 if (--wbc->nr_to_write <= 0 &&
992 wbc->sync_mode == WB_SYNC_NONE) {
993 done = 1;
994 break;
Nick Piggin05fe4782009-01-06 14:39:08 -0800995 }
David Howells811d7362006-08-29 19:06:09 +0100996 }
997 pagevec_release(&pvec);
998 cond_resched();
999 }
Nick Piggin3a4c6802009-02-12 04:34:23 +01001000 if (!cycled && !done) {
David Howells811d7362006-08-29 19:06:09 +01001001 /*
Nick Piggin31a12662009-01-06 14:39:04 -08001002 * range_cyclic:
David Howells811d7362006-08-29 19:06:09 +01001003 * We hit the last page and there is more work to be done: wrap
1004 * back to the start of the file
1005 */
Nick Piggin31a12662009-01-06 14:39:04 -08001006 cycled = 1;
David Howells811d7362006-08-29 19:06:09 +01001007 index = 0;
Nick Piggin31a12662009-01-06 14:39:04 -08001008 end = writeback_index - 1;
David Howells811d7362006-08-29 19:06:09 +01001009 goto retry;
1010 }
Dave Chinner0b564922010-06-09 10:37:18 +10001011 if (wbc->range_cyclic || (range_whole && wbc->nr_to_write > 0))
1012 mapping->writeback_index = done_index;
Aneesh Kumar K.V06d6cf62008-07-11 19:27:31 -04001013
David Howells811d7362006-08-29 19:06:09 +01001014 return ret;
1015}
Miklos Szeredi0ea97182007-05-10 22:22:51 -07001016EXPORT_SYMBOL(write_cache_pages);
1017
1018/*
1019 * Function used by generic_writepages to call the real writepage
1020 * function and set the mapping flags on error
1021 */
1022static int __writepage(struct page *page, struct writeback_control *wbc,
1023 void *data)
1024{
1025 struct address_space *mapping = data;
1026 int ret = mapping->a_ops->writepage(page, wbc);
1027 mapping_set_error(mapping, ret);
1028 return ret;
1029}
1030
1031/**
1032 * generic_writepages - walk the list of dirty pages of the given address space and writepage() all of them.
1033 * @mapping: address space structure to write
1034 * @wbc: subtract the number of written pages from *@wbc->nr_to_write
1035 *
1036 * This is a library function, which implements the writepages()
1037 * address_space_operation.
1038 */
1039int generic_writepages(struct address_space *mapping,
1040 struct writeback_control *wbc)
1041{
1042 /* deal with chardevs and other special file */
1043 if (!mapping->a_ops->writepage)
1044 return 0;
1045
1046 return write_cache_pages(mapping, wbc, __writepage, mapping);
1047}
David Howells811d7362006-08-29 19:06:09 +01001048
1049EXPORT_SYMBOL(generic_writepages);
1050
Linus Torvalds1da177e2005-04-16 15:20:36 -07001051int do_writepages(struct address_space *mapping, struct writeback_control *wbc)
1052{
Andrew Morton22905f72005-11-16 15:07:01 -08001053 int ret;
1054
Linus Torvalds1da177e2005-04-16 15:20:36 -07001055 if (wbc->nr_to_write <= 0)
1056 return 0;
1057 if (mapping->a_ops->writepages)
Peter Zijlstrad08b3852006-09-25 23:30:57 -07001058 ret = mapping->a_ops->writepages(mapping, wbc);
Andrew Morton22905f72005-11-16 15:07:01 -08001059 else
1060 ret = generic_writepages(mapping, wbc);
Andrew Morton22905f72005-11-16 15:07:01 -08001061 return ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001062}
1063
1064/**
1065 * write_one_page - write out a single page and optionally wait on I/O
Martin Waitz67be2dd2005-05-01 08:59:26 -07001066 * @page: the page to write
1067 * @wait: if true, wait on writeout
Linus Torvalds1da177e2005-04-16 15:20:36 -07001068 *
1069 * The page must be locked by the caller and will be unlocked upon return.
1070 *
1071 * write_one_page() returns a negative error code if I/O failed.
1072 */
1073int write_one_page(struct page *page, int wait)
1074{
1075 struct address_space *mapping = page->mapping;
1076 int ret = 0;
1077 struct writeback_control wbc = {
1078 .sync_mode = WB_SYNC_ALL,
1079 .nr_to_write = 1,
1080 };
1081
1082 BUG_ON(!PageLocked(page));
1083
1084 if (wait)
1085 wait_on_page_writeback(page);
1086
1087 if (clear_page_dirty_for_io(page)) {
1088 page_cache_get(page);
1089 ret = mapping->a_ops->writepage(page, &wbc);
1090 if (ret == 0 && wait) {
1091 wait_on_page_writeback(page);
1092 if (PageError(page))
1093 ret = -EIO;
1094 }
1095 page_cache_release(page);
1096 } else {
1097 unlock_page(page);
1098 }
1099 return ret;
1100}
1101EXPORT_SYMBOL(write_one_page);
1102
1103/*
Ken Chen76719322007-02-10 01:43:15 -08001104 * For address_spaces which do not use buffers nor write back.
1105 */
1106int __set_page_dirty_no_writeback(struct page *page)
1107{
1108 if (!PageDirty(page))
Bob Liuc3f0da62011-01-13 15:45:49 -08001109 return !TestSetPageDirty(page);
Ken Chen76719322007-02-10 01:43:15 -08001110 return 0;
1111}
1112
1113/*
Edward Shishkine3a7cca2009-03-31 15:19:39 -07001114 * Helper function for set_page_dirty family.
1115 * NOTE: This relies on being atomic wrt interrupts.
1116 */
1117void account_page_dirtied(struct page *page, struct address_space *mapping)
1118{
1119 if (mapping_cap_account_dirty(mapping)) {
1120 __inc_zone_page_state(page, NR_FILE_DIRTY);
Michael Rubinea941f02010-10-26 14:21:35 -07001121 __inc_zone_page_state(page, NR_DIRTIED);
Edward Shishkine3a7cca2009-03-31 15:19:39 -07001122 __inc_bdi_stat(mapping->backing_dev_info, BDI_RECLAIMABLE);
1123 task_dirty_inc(current);
1124 task_io_account_write(PAGE_CACHE_SIZE);
1125 }
1126}
Michael Rubin679ceac2010-08-20 02:31:26 -07001127EXPORT_SYMBOL(account_page_dirtied);
Edward Shishkine3a7cca2009-03-31 15:19:39 -07001128
1129/*
Michael Rubinf629d1c2010-10-26 14:21:33 -07001130 * Helper function for set_page_writeback family.
1131 * NOTE: Unlike account_page_dirtied this does not rely on being atomic
1132 * wrt interrupts.
1133 */
1134void account_page_writeback(struct page *page)
1135{
1136 inc_zone_page_state(page, NR_WRITEBACK);
Michael Rubinea941f02010-10-26 14:21:35 -07001137 inc_zone_page_state(page, NR_WRITTEN);
Michael Rubinf629d1c2010-10-26 14:21:33 -07001138}
1139EXPORT_SYMBOL(account_page_writeback);
1140
1141/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001142 * For address_spaces which do not use buffers. Just tag the page as dirty in
1143 * its radix tree.
1144 *
1145 * This is also used when a single buffer is being dirtied: we want to set the
1146 * page dirty in that case, but not all the buffers. This is a "bottom-up"
1147 * dirtying, whereas __set_page_dirty_buffers() is a "top-down" dirtying.
1148 *
1149 * Most callers have locked the page, which pins the address_space in memory.
1150 * But zap_pte_range() does not lock the page, however in that case the
1151 * mapping is pinned by the vma's ->vm_file reference.
1152 *
1153 * We take care to handle the case where the page was truncated from the
Simon Arlott183ff222007-10-20 01:27:18 +02001154 * mapping by re-checking page_mapping() inside tree_lock.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001155 */
1156int __set_page_dirty_nobuffers(struct page *page)
1157{
Linus Torvalds1da177e2005-04-16 15:20:36 -07001158 if (!TestSetPageDirty(page)) {
1159 struct address_space *mapping = page_mapping(page);
1160 struct address_space *mapping2;
1161
Andrew Morton8c085402006-12-10 02:19:24 -08001162 if (!mapping)
1163 return 1;
1164
Nick Piggin19fd6232008-07-25 19:45:32 -07001165 spin_lock_irq(&mapping->tree_lock);
Andrew Morton8c085402006-12-10 02:19:24 -08001166 mapping2 = page_mapping(page);
1167 if (mapping2) { /* Race with truncate? */
1168 BUG_ON(mapping2 != mapping);
Nick Piggin787d2212007-07-17 04:03:34 -07001169 WARN_ON_ONCE(!PagePrivate(page) && !PageUptodate(page));
Edward Shishkine3a7cca2009-03-31 15:19:39 -07001170 account_page_dirtied(page, mapping);
Andrew Morton8c085402006-12-10 02:19:24 -08001171 radix_tree_tag_set(&mapping->page_tree,
1172 page_index(page), PAGECACHE_TAG_DIRTY);
1173 }
Nick Piggin19fd6232008-07-25 19:45:32 -07001174 spin_unlock_irq(&mapping->tree_lock);
Andrew Morton8c085402006-12-10 02:19:24 -08001175 if (mapping->host) {
1176 /* !PageAnon && !swapper_space */
1177 __mark_inode_dirty(mapping->host, I_DIRTY_PAGES);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001178 }
Andrew Morton4741c9f2006-03-24 03:18:11 -08001179 return 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001180 }
Andrew Morton4741c9f2006-03-24 03:18:11 -08001181 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001182}
1183EXPORT_SYMBOL(__set_page_dirty_nobuffers);
1184
1185/*
1186 * When a writepage implementation decides that it doesn't want to write this
1187 * page for some reason, it should redirty the locked page via
1188 * redirty_page_for_writepage() and it should then unlock the page and return 0
1189 */
1190int redirty_page_for_writepage(struct writeback_control *wbc, struct page *page)
1191{
1192 wbc->pages_skipped++;
1193 return __set_page_dirty_nobuffers(page);
1194}
1195EXPORT_SYMBOL(redirty_page_for_writepage);
1196
1197/*
Wu Fengguang6746aff2009-09-16 11:50:14 +02001198 * Dirty a page.
1199 *
1200 * For pages with a mapping this should be done under the page lock
1201 * for the benefit of asynchronous memory errors who prefer a consistent
1202 * dirty state. This rule can be broken in some special cases,
1203 * but should be better not to.
1204 *
Linus Torvalds1da177e2005-04-16 15:20:36 -07001205 * If the mapping doesn't provide a set_page_dirty a_op, then
1206 * just fall through and assume that it wants buffer_heads.
1207 */
Nick Piggin1cf6e7d2009-02-18 14:48:18 -08001208int set_page_dirty(struct page *page)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001209{
1210 struct address_space *mapping = page_mapping(page);
1211
1212 if (likely(mapping)) {
1213 int (*spd)(struct page *) = mapping->a_ops->set_page_dirty;
Minchan Kim278df9f2011-03-22 16:32:54 -07001214 /*
1215 * readahead/lru_deactivate_page could remain
1216 * PG_readahead/PG_reclaim due to race with end_page_writeback
1217 * About readahead, if the page is written, the flags would be
1218 * reset. So no problem.
1219 * About lru_deactivate_page, if the page is redirty, the flag
1220 * will be reset. So no problem. but if the page is used by readahead
1221 * it will confuse readahead and make it restart the size rampup
1222 * process. But it's a trivial problem.
1223 */
1224 ClearPageReclaim(page);
David Howells93614012006-09-30 20:45:40 +02001225#ifdef CONFIG_BLOCK
1226 if (!spd)
1227 spd = __set_page_dirty_buffers;
1228#endif
1229 return (*spd)(page);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001230 }
Andrew Morton4741c9f2006-03-24 03:18:11 -08001231 if (!PageDirty(page)) {
1232 if (!TestSetPageDirty(page))
1233 return 1;
1234 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001235 return 0;
1236}
1237EXPORT_SYMBOL(set_page_dirty);
1238
1239/*
1240 * set_page_dirty() is racy if the caller has no reference against
1241 * page->mapping->host, and if the page is unlocked. This is because another
1242 * CPU could truncate the page off the mapping and then free the mapping.
1243 *
1244 * Usually, the page _is_ locked, or the caller is a user-space process which
1245 * holds a reference on the inode by having an open file.
1246 *
1247 * In other cases, the page should be locked before running set_page_dirty().
1248 */
1249int set_page_dirty_lock(struct page *page)
1250{
1251 int ret;
1252
Nick Piggindb376482006-09-25 23:31:24 -07001253 lock_page_nosync(page);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001254 ret = set_page_dirty(page);
1255 unlock_page(page);
1256 return ret;
1257}
1258EXPORT_SYMBOL(set_page_dirty_lock);
1259
1260/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001261 * Clear a page's dirty flag, while caring for dirty memory accounting.
1262 * Returns true if the page was previously dirty.
1263 *
1264 * This is for preparing to put the page under writeout. We leave the page
1265 * tagged as dirty in the radix tree so that a concurrent write-for-sync
1266 * can discover it via a PAGECACHE_TAG_DIRTY walk. The ->writepage
1267 * implementation will run either set_page_writeback() or set_page_dirty(),
1268 * at which stage we bring the page's dirty flag and radix-tree dirty tag
1269 * back into sync.
1270 *
1271 * This incoherency between the page's dirty flag and radix-tree tag is
1272 * unfortunate, but it only exists while the page is locked.
1273 */
1274int clear_page_dirty_for_io(struct page *page)
1275{
1276 struct address_space *mapping = page_mapping(page);
1277
Nick Piggin79352892007-07-19 01:47:22 -07001278 BUG_ON(!PageLocked(page));
1279
Linus Torvalds7658cc22006-12-29 10:00:58 -08001280 if (mapping && mapping_cap_account_dirty(mapping)) {
1281 /*
1282 * Yes, Virginia, this is indeed insane.
1283 *
1284 * We use this sequence to make sure that
1285 * (a) we account for dirty stats properly
1286 * (b) we tell the low-level filesystem to
1287 * mark the whole page dirty if it was
1288 * dirty in a pagetable. Only to then
1289 * (c) clean the page again and return 1 to
1290 * cause the writeback.
1291 *
1292 * This way we avoid all nasty races with the
1293 * dirty bit in multiple places and clearing
1294 * them concurrently from different threads.
1295 *
1296 * Note! Normally the "set_page_dirty(page)"
1297 * has no effect on the actual dirty bit - since
1298 * that will already usually be set. But we
1299 * need the side effects, and it can help us
1300 * avoid races.
1301 *
1302 * We basically use the page "master dirty bit"
1303 * as a serialization point for all the different
1304 * threads doing their things.
Linus Torvalds7658cc22006-12-29 10:00:58 -08001305 */
1306 if (page_mkclean(page))
1307 set_page_dirty(page);
Nick Piggin79352892007-07-19 01:47:22 -07001308 /*
1309 * We carefully synchronise fault handlers against
1310 * installing a dirty pte and marking the page dirty
1311 * at this point. We do this by having them hold the
1312 * page lock at some point after installing their
1313 * pte, but before marking the page dirty.
1314 * Pages are always locked coming in here, so we get
1315 * the desired exclusion. See mm/memory.c:do_wp_page()
1316 * for more comments.
1317 */
Linus Torvalds7658cc22006-12-29 10:00:58 -08001318 if (TestClearPageDirty(page)) {
Andrew Morton8c085402006-12-10 02:19:24 -08001319 dec_zone_page_state(page, NR_FILE_DIRTY);
Peter Zijlstrac9e51e42007-10-16 23:25:47 -07001320 dec_bdi_stat(mapping->backing_dev_info,
1321 BDI_RECLAIMABLE);
Linus Torvalds7658cc22006-12-29 10:00:58 -08001322 return 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001323 }
Linus Torvalds7658cc22006-12-29 10:00:58 -08001324 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001325 }
Linus Torvalds7658cc22006-12-29 10:00:58 -08001326 return TestClearPageDirty(page);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001327}
Hans Reiser58bb01a2005-11-18 01:10:53 -08001328EXPORT_SYMBOL(clear_page_dirty_for_io);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001329
1330int test_clear_page_writeback(struct page *page)
1331{
1332 struct address_space *mapping = page_mapping(page);
1333 int ret;
1334
1335 if (mapping) {
Peter Zijlstra69cb51d2007-10-16 23:25:48 -07001336 struct backing_dev_info *bdi = mapping->backing_dev_info;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001337 unsigned long flags;
1338
Nick Piggin19fd6232008-07-25 19:45:32 -07001339 spin_lock_irqsave(&mapping->tree_lock, flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001340 ret = TestClearPageWriteback(page);
Peter Zijlstra69cb51d2007-10-16 23:25:48 -07001341 if (ret) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001342 radix_tree_tag_clear(&mapping->page_tree,
1343 page_index(page),
1344 PAGECACHE_TAG_WRITEBACK);
Miklos Szeredie4ad08f2008-04-30 00:54:37 -07001345 if (bdi_cap_account_writeback(bdi)) {
Peter Zijlstra69cb51d2007-10-16 23:25:48 -07001346 __dec_bdi_stat(bdi, BDI_WRITEBACK);
Peter Zijlstra04fbfdc2007-10-16 23:25:50 -07001347 __bdi_writeout_inc(bdi);
1348 }
Peter Zijlstra69cb51d2007-10-16 23:25:48 -07001349 }
Nick Piggin19fd6232008-07-25 19:45:32 -07001350 spin_unlock_irqrestore(&mapping->tree_lock, flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001351 } else {
1352 ret = TestClearPageWriteback(page);
1353 }
Andrew Mortond688abf2007-07-19 01:49:17 -07001354 if (ret)
1355 dec_zone_page_state(page, NR_WRITEBACK);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001356 return ret;
1357}
1358
1359int test_set_page_writeback(struct page *page)
1360{
1361 struct address_space *mapping = page_mapping(page);
1362 int ret;
1363
1364 if (mapping) {
Peter Zijlstra69cb51d2007-10-16 23:25:48 -07001365 struct backing_dev_info *bdi = mapping->backing_dev_info;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001366 unsigned long flags;
1367
Nick Piggin19fd6232008-07-25 19:45:32 -07001368 spin_lock_irqsave(&mapping->tree_lock, flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001369 ret = TestSetPageWriteback(page);
Peter Zijlstra69cb51d2007-10-16 23:25:48 -07001370 if (!ret) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001371 radix_tree_tag_set(&mapping->page_tree,
1372 page_index(page),
1373 PAGECACHE_TAG_WRITEBACK);
Miklos Szeredie4ad08f2008-04-30 00:54:37 -07001374 if (bdi_cap_account_writeback(bdi))
Peter Zijlstra69cb51d2007-10-16 23:25:48 -07001375 __inc_bdi_stat(bdi, BDI_WRITEBACK);
1376 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001377 if (!PageDirty(page))
1378 radix_tree_tag_clear(&mapping->page_tree,
1379 page_index(page),
1380 PAGECACHE_TAG_DIRTY);
Jan Karaf446daa2010-08-09 17:19:12 -07001381 radix_tree_tag_clear(&mapping->page_tree,
1382 page_index(page),
1383 PAGECACHE_TAG_TOWRITE);
Nick Piggin19fd6232008-07-25 19:45:32 -07001384 spin_unlock_irqrestore(&mapping->tree_lock, flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001385 } else {
1386 ret = TestSetPageWriteback(page);
1387 }
Andrew Mortond688abf2007-07-19 01:49:17 -07001388 if (!ret)
Michael Rubinf629d1c2010-10-26 14:21:33 -07001389 account_page_writeback(page);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001390 return ret;
1391
1392}
1393EXPORT_SYMBOL(test_set_page_writeback);
1394
1395/*
Nick Piggin00128182007-10-16 01:24:40 -07001396 * Return true if any of the pages in the mapping are marked with the
Linus Torvalds1da177e2005-04-16 15:20:36 -07001397 * passed tag.
1398 */
1399int mapping_tagged(struct address_space *mapping, int tag)
1400{
Linus Torvalds1da177e2005-04-16 15:20:36 -07001401 int ret;
Nick Piggin00128182007-10-16 01:24:40 -07001402 rcu_read_lock();
Linus Torvalds1da177e2005-04-16 15:20:36 -07001403 ret = radix_tree_tagged(&mapping->page_tree, tag);
Nick Piggin00128182007-10-16 01:24:40 -07001404 rcu_read_unlock();
Linus Torvalds1da177e2005-04-16 15:20:36 -07001405 return ret;
1406}
1407EXPORT_SYMBOL(mapping_tagged);