Staging: vt6655: Integrate drivers/staging/vt6655 into build system.
[linux-2.6/linux-acpi-2.6/ibm-acpi-2.6.git] / mm / page-writeback.c
blob7b0dcea4935bea292730ce7d1926fc0ea00df062
1 /*
2 * mm/page-writeback.c
4 * Copyright (C) 2002, Linus Torvalds.
5 * Copyright (C) 2007 Red Hat, Inc., Peter Zijlstra <pzijlstr@redhat.com>
7 * Contains functions related to writing back dirty pages at the
8 * address_space level.
10 * 10Apr2002 Andrew Morton
11 * Initial version
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>
25 #include <linux/task_io_accounting_ops.h>
26 #include <linux/blkdev.h>
27 #include <linux/mpage.h>
28 #include <linux/rmap.h>
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>
35 #include <linux/buffer_head.h>
36 #include <linux/pagevec.h>
39 * The maximum number of pages to writeout in a single bdflush/kupdate
40 * operation. We do this so we don't hold I_SYNC against an inode for
41 * enormous amounts of time, which would block a userspace task which has
42 * been forced to throttle against that inode. Also, the code reevaluates
43 * the dirty each time it has written this many pages.
45 #define MAX_WRITEBACK_PAGES 1024
48 * After a CPU has dirtied this many pages, balance_dirty_pages_ratelimited
49 * will look to see if it needs to force writeback or throttling.
51 static long ratelimit_pages = 32;
54 * When balance_dirty_pages decides that the caller needs to perform some
55 * non-background writeback, this is how many pages it will attempt to write.
56 * It should be somewhat larger than RATELIMIT_PAGES to ensure that reasonably
57 * large amounts of I/O are submitted.
59 static inline long sync_writeback_pages(void)
61 return ratelimit_pages + ratelimit_pages / 2;
64 /* The following parameters are exported via /proc/sys/vm */
67 * Start background writeback (via pdflush) at this percentage
69 int dirty_background_ratio = 10;
72 * dirty_background_bytes starts at 0 (disabled) so that it is a function of
73 * dirty_background_ratio * the amount of dirtyable memory
75 unsigned long dirty_background_bytes;
78 * free highmem will not be subtracted from the total free memory
79 * for calculating free ratios if vm_highmem_is_dirtyable is true
81 int vm_highmem_is_dirtyable;
84 * The generator of dirty data starts writeback at this percentage
86 int vm_dirty_ratio = 20;
89 * vm_dirty_bytes starts at 0 (disabled) so that it is a function of
90 * vm_dirty_ratio * the amount of dirtyable memory
92 unsigned long vm_dirty_bytes;
95 * The interval between `kupdate'-style writebacks
97 unsigned int dirty_writeback_interval = 5 * 100; /* centiseconds */
100 * The longest time for which data is allowed to remain dirty
102 unsigned int dirty_expire_interval = 30 * 100; /* centiseconds */
105 * Flag that makes the machine dump writes/reads and block dirtyings.
107 int block_dump;
110 * Flag that puts the machine in "laptop mode". Doubles as a timeout in jiffies:
111 * a full sync is triggered after this time elapses without any disk activity.
113 int laptop_mode;
115 EXPORT_SYMBOL(laptop_mode);
117 /* End of sysctl-exported parameters */
120 static void background_writeout(unsigned long _min_pages);
123 * Scale the writeback cache size proportional to the relative writeout speeds.
125 * We do this by keeping a floating proportion between BDIs, based on page
126 * writeback completions [end_page_writeback()]. Those devices that write out
127 * pages fastest will get the larger share, while the slower will get a smaller
128 * share.
130 * We use page writeout completions because we are interested in getting rid of
131 * dirty pages. Having them written out is the primary goal.
133 * We introduce a concept of time, a period over which we measure these events,
134 * because demand can/will vary over time. The length of this period itself is
135 * measured in page writeback completions.
138 static struct prop_descriptor vm_completions;
139 static struct prop_descriptor vm_dirties;
142 * couple the period to the dirty_ratio:
144 * period/2 ~ roundup_pow_of_two(dirty limit)
146 static int calc_period_shift(void)
148 unsigned long dirty_total;
150 if (vm_dirty_bytes)
151 dirty_total = vm_dirty_bytes / PAGE_SIZE;
152 else
153 dirty_total = (vm_dirty_ratio * determine_dirtyable_memory()) /
154 100;
155 return 2 + ilog2(dirty_total - 1);
159 * update the period when the dirty threshold changes.
161 static void update_completion_period(void)
163 int shift = calc_period_shift();
164 prop_change_shift(&vm_completions, shift);
165 prop_change_shift(&vm_dirties, shift);
168 int dirty_background_ratio_handler(struct ctl_table *table, int write,
169 struct file *filp, void __user *buffer, size_t *lenp,
170 loff_t *ppos)
172 int ret;
174 ret = proc_dointvec_minmax(table, write, filp, buffer, lenp, ppos);
175 if (ret == 0 && write)
176 dirty_background_bytes = 0;
177 return ret;
180 int dirty_background_bytes_handler(struct ctl_table *table, int write,
181 struct file *filp, void __user *buffer, size_t *lenp,
182 loff_t *ppos)
184 int ret;
186 ret = proc_doulongvec_minmax(table, write, filp, buffer, lenp, ppos);
187 if (ret == 0 && write)
188 dirty_background_ratio = 0;
189 return ret;
192 int dirty_ratio_handler(struct ctl_table *table, int write,
193 struct file *filp, void __user *buffer, size_t *lenp,
194 loff_t *ppos)
196 int old_ratio = vm_dirty_ratio;
197 int ret;
199 ret = proc_dointvec_minmax(table, write, filp, buffer, lenp, ppos);
200 if (ret == 0 && write && vm_dirty_ratio != old_ratio) {
201 update_completion_period();
202 vm_dirty_bytes = 0;
204 return ret;
208 int dirty_bytes_handler(struct ctl_table *table, int write,
209 struct file *filp, void __user *buffer, size_t *lenp,
210 loff_t *ppos)
212 unsigned long old_bytes = vm_dirty_bytes;
213 int ret;
215 ret = proc_doulongvec_minmax(table, write, filp, buffer, lenp, ppos);
216 if (ret == 0 && write && vm_dirty_bytes != old_bytes) {
217 update_completion_period();
218 vm_dirty_ratio = 0;
220 return ret;
224 * Increment the BDI's writeout completion count and the global writeout
225 * completion count. Called from test_clear_page_writeback().
227 static inline void __bdi_writeout_inc(struct backing_dev_info *bdi)
229 __prop_inc_percpu_max(&vm_completions, &bdi->completions,
230 bdi->max_prop_frac);
233 void bdi_writeout_inc(struct backing_dev_info *bdi)
235 unsigned long flags;
237 local_irq_save(flags);
238 __bdi_writeout_inc(bdi);
239 local_irq_restore(flags);
241 EXPORT_SYMBOL_GPL(bdi_writeout_inc);
243 void task_dirty_inc(struct task_struct *tsk)
245 prop_inc_single(&vm_dirties, &tsk->dirties);
249 * Obtain an accurate fraction of the BDI's portion.
251 static void bdi_writeout_fraction(struct backing_dev_info *bdi,
252 long *numerator, long *denominator)
254 if (bdi_cap_writeback_dirty(bdi)) {
255 prop_fraction_percpu(&vm_completions, &bdi->completions,
256 numerator, denominator);
257 } else {
258 *numerator = 0;
259 *denominator = 1;
264 * Clip the earned share of dirty pages to that which is actually available.
265 * This avoids exceeding the total dirty_limit when the floating averages
266 * fluctuate too quickly.
268 static void clip_bdi_dirty_limit(struct backing_dev_info *bdi,
269 unsigned long dirty, unsigned long *pbdi_dirty)
271 unsigned long avail_dirty;
273 avail_dirty = global_page_state(NR_FILE_DIRTY) +
274 global_page_state(NR_WRITEBACK) +
275 global_page_state(NR_UNSTABLE_NFS) +
276 global_page_state(NR_WRITEBACK_TEMP);
278 if (avail_dirty < dirty)
279 avail_dirty = dirty - avail_dirty;
280 else
281 avail_dirty = 0;
283 avail_dirty += bdi_stat(bdi, BDI_RECLAIMABLE) +
284 bdi_stat(bdi, BDI_WRITEBACK);
286 *pbdi_dirty = min(*pbdi_dirty, avail_dirty);
289 static inline void task_dirties_fraction(struct task_struct *tsk,
290 long *numerator, long *denominator)
292 prop_fraction_single(&vm_dirties, &tsk->dirties,
293 numerator, denominator);
297 * scale the dirty limit
299 * task specific dirty limit:
301 * dirty -= (dirty/8) * p_{t}
303 static void task_dirty_limit(struct task_struct *tsk, unsigned long *pdirty)
305 long numerator, denominator;
306 unsigned long dirty = *pdirty;
307 u64 inv = dirty >> 3;
309 task_dirties_fraction(tsk, &numerator, &denominator);
310 inv *= numerator;
311 do_div(inv, denominator);
313 dirty -= inv;
314 if (dirty < *pdirty/2)
315 dirty = *pdirty/2;
317 *pdirty = dirty;
323 static DEFINE_SPINLOCK(bdi_lock);
324 static unsigned int bdi_min_ratio;
326 int bdi_set_min_ratio(struct backing_dev_info *bdi, unsigned int min_ratio)
328 int ret = 0;
329 unsigned long flags;
331 spin_lock_irqsave(&bdi_lock, flags);
332 if (min_ratio > bdi->max_ratio) {
333 ret = -EINVAL;
334 } else {
335 min_ratio -= bdi->min_ratio;
336 if (bdi_min_ratio + min_ratio < 100) {
337 bdi_min_ratio += min_ratio;
338 bdi->min_ratio += min_ratio;
339 } else {
340 ret = -EINVAL;
343 spin_unlock_irqrestore(&bdi_lock, flags);
345 return ret;
348 int bdi_set_max_ratio(struct backing_dev_info *bdi, unsigned max_ratio)
350 unsigned long flags;
351 int ret = 0;
353 if (max_ratio > 100)
354 return -EINVAL;
356 spin_lock_irqsave(&bdi_lock, flags);
357 if (bdi->min_ratio > max_ratio) {
358 ret = -EINVAL;
359 } else {
360 bdi->max_ratio = max_ratio;
361 bdi->max_prop_frac = (PROP_FRAC_BASE * max_ratio) / 100;
363 spin_unlock_irqrestore(&bdi_lock, flags);
365 return ret;
367 EXPORT_SYMBOL(bdi_set_max_ratio);
370 * Work out the current dirty-memory clamping and background writeout
371 * thresholds.
373 * The main aim here is to lower them aggressively if there is a lot of mapped
374 * memory around. To avoid stressing page reclaim with lots of unreclaimable
375 * pages. It is better to clamp down on writers than to start swapping, and
376 * performing lots of scanning.
378 * We only allow 1/2 of the currently-unmapped memory to be dirtied.
380 * We don't permit the clamping level to fall below 5% - that is getting rather
381 * excessive.
383 * We make sure that the background writeout level is below the adjusted
384 * clamping level.
387 static unsigned long highmem_dirtyable_memory(unsigned long total)
389 #ifdef CONFIG_HIGHMEM
390 int node;
391 unsigned long x = 0;
393 for_each_node_state(node, N_HIGH_MEMORY) {
394 struct zone *z =
395 &NODE_DATA(node)->node_zones[ZONE_HIGHMEM];
397 x += zone_page_state(z, NR_FREE_PAGES) + zone_lru_pages(z);
400 * Make sure that the number of highmem pages is never larger
401 * than the number of the total dirtyable memory. This can only
402 * occur in very strange VM situations but we want to make sure
403 * that this does not occur.
405 return min(x, total);
406 #else
407 return 0;
408 #endif
412 * determine_dirtyable_memory - amount of memory that may be used
414 * Returns the numebr of pages that can currently be freed and used
415 * by the kernel for direct mappings.
417 unsigned long determine_dirtyable_memory(void)
419 unsigned long x;
421 x = global_page_state(NR_FREE_PAGES) + global_lru_pages();
423 if (!vm_highmem_is_dirtyable)
424 x -= highmem_dirtyable_memory(x);
426 return x + 1; /* Ensure that we never return 0 */
429 void
430 get_dirty_limits(unsigned long *pbackground, unsigned long *pdirty,
431 unsigned long *pbdi_dirty, struct backing_dev_info *bdi)
433 unsigned long background;
434 unsigned long dirty;
435 unsigned long available_memory = determine_dirtyable_memory();
436 struct task_struct *tsk;
438 if (vm_dirty_bytes)
439 dirty = DIV_ROUND_UP(vm_dirty_bytes, PAGE_SIZE);
440 else {
441 int dirty_ratio;
443 dirty_ratio = vm_dirty_ratio;
444 if (dirty_ratio < 5)
445 dirty_ratio = 5;
446 dirty = (dirty_ratio * available_memory) / 100;
449 if (dirty_background_bytes)
450 background = DIV_ROUND_UP(dirty_background_bytes, PAGE_SIZE);
451 else
452 background = (dirty_background_ratio * available_memory) / 100;
454 if (background >= dirty)
455 background = dirty / 2;
456 tsk = current;
457 if (tsk->flags & PF_LESS_THROTTLE || rt_task(tsk)) {
458 background += background / 4;
459 dirty += dirty / 4;
461 *pbackground = background;
462 *pdirty = dirty;
464 if (bdi) {
465 u64 bdi_dirty;
466 long numerator, denominator;
469 * Calculate this BDI's share of the dirty ratio.
471 bdi_writeout_fraction(bdi, &numerator, &denominator);
473 bdi_dirty = (dirty * (100 - bdi_min_ratio)) / 100;
474 bdi_dirty *= numerator;
475 do_div(bdi_dirty, denominator);
476 bdi_dirty += (dirty * bdi->min_ratio) / 100;
477 if (bdi_dirty > (dirty * bdi->max_ratio) / 100)
478 bdi_dirty = dirty * bdi->max_ratio / 100;
480 *pbdi_dirty = bdi_dirty;
481 clip_bdi_dirty_limit(bdi, dirty, pbdi_dirty);
482 task_dirty_limit(current, pbdi_dirty);
487 * balance_dirty_pages() must be called by processes which are generating dirty
488 * data. It looks at the number of dirty pages in the machine and will force
489 * the caller to perform writeback if the system is over `vm_dirty_ratio'.
490 * If we're over `background_thresh' then pdflush is woken to perform some
491 * writeout.
493 static void balance_dirty_pages(struct address_space *mapping)
495 long nr_reclaimable, bdi_nr_reclaimable;
496 long nr_writeback, bdi_nr_writeback;
497 unsigned long background_thresh;
498 unsigned long dirty_thresh;
499 unsigned long bdi_thresh;
500 unsigned long pages_written = 0;
501 unsigned long write_chunk = sync_writeback_pages();
503 struct backing_dev_info *bdi = mapping->backing_dev_info;
505 for (;;) {
506 struct writeback_control wbc = {
507 .bdi = bdi,
508 .sync_mode = WB_SYNC_NONE,
509 .older_than_this = NULL,
510 .nr_to_write = write_chunk,
511 .range_cyclic = 1,
514 get_dirty_limits(&background_thresh, &dirty_thresh,
515 &bdi_thresh, bdi);
517 nr_reclaimable = global_page_state(NR_FILE_DIRTY) +
518 global_page_state(NR_UNSTABLE_NFS);
519 nr_writeback = global_page_state(NR_WRITEBACK);
521 bdi_nr_reclaimable = bdi_stat(bdi, BDI_RECLAIMABLE);
522 bdi_nr_writeback = bdi_stat(bdi, BDI_WRITEBACK);
524 if (bdi_nr_reclaimable + bdi_nr_writeback <= bdi_thresh)
525 break;
528 * Throttle it only when the background writeback cannot
529 * catch-up. This avoids (excessively) small writeouts
530 * when the bdi limits are ramping up.
532 if (nr_reclaimable + nr_writeback <
533 (background_thresh + dirty_thresh) / 2)
534 break;
536 if (!bdi->dirty_exceeded)
537 bdi->dirty_exceeded = 1;
539 /* Note: nr_reclaimable denotes nr_dirty + nr_unstable.
540 * Unstable writes are a feature of certain networked
541 * filesystems (i.e. NFS) in which data may have been
542 * written to the server's write cache, but has not yet
543 * been flushed to permanent storage.
545 if (bdi_nr_reclaimable) {
546 writeback_inodes(&wbc);
547 pages_written += write_chunk - wbc.nr_to_write;
548 get_dirty_limits(&background_thresh, &dirty_thresh,
549 &bdi_thresh, bdi);
553 * In order to avoid the stacked BDI deadlock we need
554 * to ensure we accurately count the 'dirty' pages when
555 * the threshold is low.
557 * Otherwise it would be possible to get thresh+n pages
558 * reported dirty, even though there are thresh-m pages
559 * actually dirty; with m+n sitting in the percpu
560 * deltas.
562 if (bdi_thresh < 2*bdi_stat_error(bdi)) {
563 bdi_nr_reclaimable = bdi_stat_sum(bdi, BDI_RECLAIMABLE);
564 bdi_nr_writeback = bdi_stat_sum(bdi, BDI_WRITEBACK);
565 } else if (bdi_nr_reclaimable) {
566 bdi_nr_reclaimable = bdi_stat(bdi, BDI_RECLAIMABLE);
567 bdi_nr_writeback = bdi_stat(bdi, BDI_WRITEBACK);
570 if (bdi_nr_reclaimable + bdi_nr_writeback <= bdi_thresh)
571 break;
572 if (pages_written >= write_chunk)
573 break; /* We've done our duty */
575 congestion_wait(WRITE, HZ/10);
578 if (bdi_nr_reclaimable + bdi_nr_writeback < bdi_thresh &&
579 bdi->dirty_exceeded)
580 bdi->dirty_exceeded = 0;
582 if (writeback_in_progress(bdi))
583 return; /* pdflush is already working this queue */
586 * In laptop mode, we wait until hitting the higher threshold before
587 * starting background writeout, and then write out all the way down
588 * to the lower threshold. So slow writers cause minimal disk activity.
590 * In normal mode, we start background writeout at the lower
591 * background_thresh, to keep the amount of dirty memory low.
593 if ((laptop_mode && pages_written) ||
594 (!laptop_mode && (global_page_state(NR_FILE_DIRTY)
595 + global_page_state(NR_UNSTABLE_NFS)
596 > background_thresh)))
597 pdflush_operation(background_writeout, 0);
600 void set_page_dirty_balance(struct page *page, int page_mkwrite)
602 if (set_page_dirty(page) || page_mkwrite) {
603 struct address_space *mapping = page_mapping(page);
605 if (mapping)
606 balance_dirty_pages_ratelimited(mapping);
611 * balance_dirty_pages_ratelimited_nr - balance dirty memory state
612 * @mapping: address_space which was dirtied
613 * @nr_pages_dirtied: number of pages which the caller has just dirtied
615 * Processes which are dirtying memory should call in here once for each page
616 * which was newly dirtied. The function will periodically check the system's
617 * dirty state and will initiate writeback if needed.
619 * On really big machines, get_writeback_state is expensive, so try to avoid
620 * calling it too often (ratelimiting). But once we're over the dirty memory
621 * limit we decrease the ratelimiting by a lot, to prevent individual processes
622 * from overshooting the limit by (ratelimit_pages) each.
624 void balance_dirty_pages_ratelimited_nr(struct address_space *mapping,
625 unsigned long nr_pages_dirtied)
627 static DEFINE_PER_CPU(unsigned long, ratelimits) = 0;
628 unsigned long ratelimit;
629 unsigned long *p;
631 ratelimit = ratelimit_pages;
632 if (mapping->backing_dev_info->dirty_exceeded)
633 ratelimit = 8;
636 * Check the rate limiting. Also, we do not want to throttle real-time
637 * tasks in balance_dirty_pages(). Period.
639 preempt_disable();
640 p = &__get_cpu_var(ratelimits);
641 *p += nr_pages_dirtied;
642 if (unlikely(*p >= ratelimit)) {
643 *p = 0;
644 preempt_enable();
645 balance_dirty_pages(mapping);
646 return;
648 preempt_enable();
650 EXPORT_SYMBOL(balance_dirty_pages_ratelimited_nr);
652 void throttle_vm_writeout(gfp_t gfp_mask)
654 unsigned long background_thresh;
655 unsigned long dirty_thresh;
657 for ( ; ; ) {
658 get_dirty_limits(&background_thresh, &dirty_thresh, NULL, NULL);
661 * Boost the allowable dirty threshold a bit for page
662 * allocators so they don't get DoS'ed by heavy writers
664 dirty_thresh += dirty_thresh / 10; /* wheeee... */
666 if (global_page_state(NR_UNSTABLE_NFS) +
667 global_page_state(NR_WRITEBACK) <= dirty_thresh)
668 break;
669 congestion_wait(WRITE, HZ/10);
672 * The caller might hold locks which can prevent IO completion
673 * or progress in the filesystem. So we cannot just sit here
674 * waiting for IO to complete.
676 if ((gfp_mask & (__GFP_FS|__GFP_IO)) != (__GFP_FS|__GFP_IO))
677 break;
682 * writeback at least _min_pages, and keep writing until the amount of dirty
683 * memory is less than the background threshold, or until we're all clean.
685 static void background_writeout(unsigned long _min_pages)
687 long min_pages = _min_pages;
688 struct writeback_control wbc = {
689 .bdi = NULL,
690 .sync_mode = WB_SYNC_NONE,
691 .older_than_this = NULL,
692 .nr_to_write = 0,
693 .nonblocking = 1,
694 .range_cyclic = 1,
697 for ( ; ; ) {
698 unsigned long background_thresh;
699 unsigned long dirty_thresh;
701 get_dirty_limits(&background_thresh, &dirty_thresh, NULL, NULL);
702 if (global_page_state(NR_FILE_DIRTY) +
703 global_page_state(NR_UNSTABLE_NFS) < background_thresh
704 && min_pages <= 0)
705 break;
706 wbc.more_io = 0;
707 wbc.encountered_congestion = 0;
708 wbc.nr_to_write = MAX_WRITEBACK_PAGES;
709 wbc.pages_skipped = 0;
710 writeback_inodes(&wbc);
711 min_pages -= MAX_WRITEBACK_PAGES - wbc.nr_to_write;
712 if (wbc.nr_to_write > 0 || wbc.pages_skipped > 0) {
713 /* Wrote less than expected */
714 if (wbc.encountered_congestion || wbc.more_io)
715 congestion_wait(WRITE, HZ/10);
716 else
717 break;
723 * Start writeback of `nr_pages' pages. If `nr_pages' is zero, write back
724 * the whole world. Returns 0 if a pdflush thread was dispatched. Returns
725 * -1 if all pdflush threads were busy.
727 int wakeup_pdflush(long nr_pages)
729 if (nr_pages == 0)
730 nr_pages = global_page_state(NR_FILE_DIRTY) +
731 global_page_state(NR_UNSTABLE_NFS);
732 return pdflush_operation(background_writeout, nr_pages);
735 static void wb_timer_fn(unsigned long unused);
736 static void laptop_timer_fn(unsigned long unused);
738 static DEFINE_TIMER(wb_timer, wb_timer_fn, 0, 0);
739 static DEFINE_TIMER(laptop_mode_wb_timer, laptop_timer_fn, 0, 0);
742 * Periodic writeback of "old" data.
744 * Define "old": the first time one of an inode's pages is dirtied, we mark the
745 * dirtying-time in the inode's address_space. So this periodic writeback code
746 * just walks the superblock inode list, writing back any inodes which are
747 * older than a specific point in time.
749 * Try to run once per dirty_writeback_interval. But if a writeback event
750 * takes longer than a dirty_writeback_interval interval, then leave a
751 * one-second gap.
753 * older_than_this takes precedence over nr_to_write. So we'll only write back
754 * all dirty pages if they are all attached to "old" mappings.
756 static void wb_kupdate(unsigned long arg)
758 unsigned long oldest_jif;
759 unsigned long start_jif;
760 unsigned long next_jif;
761 long nr_to_write;
762 struct writeback_control wbc = {
763 .bdi = NULL,
764 .sync_mode = WB_SYNC_NONE,
765 .older_than_this = &oldest_jif,
766 .nr_to_write = 0,
767 .nonblocking = 1,
768 .for_kupdate = 1,
769 .range_cyclic = 1,
772 sync_supers();
774 oldest_jif = jiffies - msecs_to_jiffies(dirty_expire_interval * 10);
775 start_jif = jiffies;
776 next_jif = start_jif + msecs_to_jiffies(dirty_writeback_interval * 10);
777 nr_to_write = global_page_state(NR_FILE_DIRTY) +
778 global_page_state(NR_UNSTABLE_NFS) +
779 (inodes_stat.nr_inodes - inodes_stat.nr_unused);
780 while (nr_to_write > 0) {
781 wbc.more_io = 0;
782 wbc.encountered_congestion = 0;
783 wbc.nr_to_write = MAX_WRITEBACK_PAGES;
784 writeback_inodes(&wbc);
785 if (wbc.nr_to_write > 0) {
786 if (wbc.encountered_congestion || wbc.more_io)
787 congestion_wait(WRITE, HZ/10);
788 else
789 break; /* All the old data is written */
791 nr_to_write -= MAX_WRITEBACK_PAGES - wbc.nr_to_write;
793 if (time_before(next_jif, jiffies + HZ))
794 next_jif = jiffies + HZ;
795 if (dirty_writeback_interval)
796 mod_timer(&wb_timer, next_jif);
800 * sysctl handler for /proc/sys/vm/dirty_writeback_centisecs
802 int dirty_writeback_centisecs_handler(ctl_table *table, int write,
803 struct file *file, void __user *buffer, size_t *length, loff_t *ppos)
805 proc_dointvec(table, write, file, buffer, length, ppos);
806 if (dirty_writeback_interval)
807 mod_timer(&wb_timer, jiffies +
808 msecs_to_jiffies(dirty_writeback_interval * 10));
809 else
810 del_timer(&wb_timer);
811 return 0;
814 static void wb_timer_fn(unsigned long unused)
816 if (pdflush_operation(wb_kupdate, 0) < 0)
817 mod_timer(&wb_timer, jiffies + HZ); /* delay 1 second */
820 static void laptop_flush(unsigned long unused)
822 sys_sync();
825 static void laptop_timer_fn(unsigned long unused)
827 pdflush_operation(laptop_flush, 0);
831 * We've spun up the disk and we're in laptop mode: schedule writeback
832 * of all dirty data a few seconds from now. If the flush is already scheduled
833 * then push it back - the user is still using the disk.
835 void laptop_io_completion(void)
837 mod_timer(&laptop_mode_wb_timer, jiffies + laptop_mode);
841 * We're in laptop mode and we've just synced. The sync's writes will have
842 * caused another writeback to be scheduled by laptop_io_completion.
843 * Nothing needs to be written back anymore, so we unschedule the writeback.
845 void laptop_sync_completion(void)
847 del_timer(&laptop_mode_wb_timer);
851 * If ratelimit_pages is too high then we can get into dirty-data overload
852 * if a large number of processes all perform writes at the same time.
853 * If it is too low then SMP machines will call the (expensive)
854 * get_writeback_state too often.
856 * Here we set ratelimit_pages to a level which ensures that when all CPUs are
857 * dirtying in parallel, we cannot go more than 3% (1/32) over the dirty memory
858 * thresholds before writeback cuts in.
860 * But the limit should not be set too high. Because it also controls the
861 * amount of memory which the balance_dirty_pages() caller has to write back.
862 * If this is too large then the caller will block on the IO queue all the
863 * time. So limit it to four megabytes - the balance_dirty_pages() caller
864 * will write six megabyte chunks, max.
867 void writeback_set_ratelimit(void)
869 ratelimit_pages = vm_total_pages / (num_online_cpus() * 32);
870 if (ratelimit_pages < 16)
871 ratelimit_pages = 16;
872 if (ratelimit_pages * PAGE_CACHE_SIZE > 4096 * 1024)
873 ratelimit_pages = (4096 * 1024) / PAGE_CACHE_SIZE;
876 static int __cpuinit
877 ratelimit_handler(struct notifier_block *self, unsigned long u, void *v)
879 writeback_set_ratelimit();
880 return NOTIFY_DONE;
883 static struct notifier_block __cpuinitdata ratelimit_nb = {
884 .notifier_call = ratelimit_handler,
885 .next = NULL,
889 * Called early on to tune the page writeback dirty limits.
891 * We used to scale dirty pages according to how total memory
892 * related to pages that could be allocated for buffers (by
893 * comparing nr_free_buffer_pages() to vm_total_pages.
895 * However, that was when we used "dirty_ratio" to scale with
896 * all memory, and we don't do that any more. "dirty_ratio"
897 * is now applied to total non-HIGHPAGE memory (by subtracting
898 * totalhigh_pages from vm_total_pages), and as such we can't
899 * get into the old insane situation any more where we had
900 * large amounts of dirty pages compared to a small amount of
901 * non-HIGHMEM memory.
903 * But we might still want to scale the dirty_ratio by how
904 * much memory the box has..
906 void __init page_writeback_init(void)
908 int shift;
910 mod_timer(&wb_timer,
911 jiffies + msecs_to_jiffies(dirty_writeback_interval * 10));
912 writeback_set_ratelimit();
913 register_cpu_notifier(&ratelimit_nb);
915 shift = calc_period_shift();
916 prop_descriptor_init(&vm_completions, shift);
917 prop_descriptor_init(&vm_dirties, shift);
921 * write_cache_pages - walk the list of dirty pages of the given address space and write all of them.
922 * @mapping: address space structure to write
923 * @wbc: subtract the number of written pages from *@wbc->nr_to_write
924 * @writepage: function called for each page
925 * @data: data passed to writepage function
927 * If a page is already under I/O, write_cache_pages() skips it, even
928 * if it's dirty. This is desirable behaviour for memory-cleaning writeback,
929 * but it is INCORRECT for data-integrity system calls such as fsync(). fsync()
930 * and msync() need to guarantee that all the data which was dirty at the time
931 * the call was made get new I/O started against them. If wbc->sync_mode is
932 * WB_SYNC_ALL then we were called for data integrity and we must wait for
933 * existing IO to complete.
935 int write_cache_pages(struct address_space *mapping,
936 struct writeback_control *wbc, writepage_t writepage,
937 void *data)
939 struct backing_dev_info *bdi = mapping->backing_dev_info;
940 int ret = 0;
941 int done = 0;
942 struct pagevec pvec;
943 int nr_pages;
944 pgoff_t uninitialized_var(writeback_index);
945 pgoff_t index;
946 pgoff_t end; /* Inclusive */
947 pgoff_t done_index;
948 int cycled;
949 int range_whole = 0;
950 long nr_to_write = wbc->nr_to_write;
952 if (wbc->nonblocking && bdi_write_congested(bdi)) {
953 wbc->encountered_congestion = 1;
954 return 0;
957 pagevec_init(&pvec, 0);
958 if (wbc->range_cyclic) {
959 writeback_index = mapping->writeback_index; /* prev offset */
960 index = writeback_index;
961 if (index == 0)
962 cycled = 1;
963 else
964 cycled = 0;
965 end = -1;
966 } else {
967 index = wbc->range_start >> PAGE_CACHE_SHIFT;
968 end = wbc->range_end >> PAGE_CACHE_SHIFT;
969 if (wbc->range_start == 0 && wbc->range_end == LLONG_MAX)
970 range_whole = 1;
971 cycled = 1; /* ignore range_cyclic tests */
973 retry:
974 done_index = index;
975 while (!done && (index <= end)) {
976 int i;
978 nr_pages = pagevec_lookup_tag(&pvec, mapping, &index,
979 PAGECACHE_TAG_DIRTY,
980 min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1);
981 if (nr_pages == 0)
982 break;
984 for (i = 0; i < nr_pages; i++) {
985 struct page *page = pvec.pages[i];
988 * At this point, the page may be truncated or
989 * invalidated (changing page->mapping to NULL), or
990 * even swizzled back from swapper_space to tmpfs file
991 * mapping. However, page->index will not change
992 * because we have a reference on the page.
994 if (page->index > end) {
996 * can't be range_cyclic (1st pass) because
997 * end == -1 in that case.
999 done = 1;
1000 break;
1003 done_index = page->index + 1;
1005 lock_page(page);
1008 * Page truncated or invalidated. We can freely skip it
1009 * then, even for data integrity operations: the page
1010 * has disappeared concurrently, so there could be no
1011 * real expectation of this data interity operation
1012 * even if there is now a new, dirty page at the same
1013 * pagecache address.
1015 if (unlikely(page->mapping != mapping)) {
1016 continue_unlock:
1017 unlock_page(page);
1018 continue;
1021 if (!PageDirty(page)) {
1022 /* someone wrote it for us */
1023 goto continue_unlock;
1026 if (PageWriteback(page)) {
1027 if (wbc->sync_mode != WB_SYNC_NONE)
1028 wait_on_page_writeback(page);
1029 else
1030 goto continue_unlock;
1033 BUG_ON(PageWriteback(page));
1034 if (!clear_page_dirty_for_io(page))
1035 goto continue_unlock;
1037 ret = (*writepage)(page, wbc, data);
1038 if (unlikely(ret)) {
1039 if (ret == AOP_WRITEPAGE_ACTIVATE) {
1040 unlock_page(page);
1041 ret = 0;
1042 } else {
1044 * done_index is set past this page,
1045 * so media errors will not choke
1046 * background writeout for the entire
1047 * file. This has consequences for
1048 * range_cyclic semantics (ie. it may
1049 * not be suitable for data integrity
1050 * writeout).
1052 done = 1;
1053 break;
1057 if (nr_to_write > 0) {
1058 nr_to_write--;
1059 if (nr_to_write == 0 &&
1060 wbc->sync_mode == WB_SYNC_NONE) {
1062 * We stop writing back only if we are
1063 * not doing integrity sync. In case of
1064 * integrity sync we have to keep going
1065 * because someone may be concurrently
1066 * dirtying pages, and we might have
1067 * synced a lot of newly appeared dirty
1068 * pages, but have not synced all of the
1069 * old dirty pages.
1071 done = 1;
1072 break;
1076 if (wbc->nonblocking && bdi_write_congested(bdi)) {
1077 wbc->encountered_congestion = 1;
1078 done = 1;
1079 break;
1082 pagevec_release(&pvec);
1083 cond_resched();
1085 if (!cycled && !done) {
1087 * range_cyclic:
1088 * We hit the last page and there is more work to be done: wrap
1089 * back to the start of the file
1091 cycled = 1;
1092 index = 0;
1093 end = writeback_index - 1;
1094 goto retry;
1096 if (!wbc->no_nrwrite_index_update) {
1097 if (wbc->range_cyclic || (range_whole && nr_to_write > 0))
1098 mapping->writeback_index = done_index;
1099 wbc->nr_to_write = nr_to_write;
1102 return ret;
1104 EXPORT_SYMBOL(write_cache_pages);
1107 * Function used by generic_writepages to call the real writepage
1108 * function and set the mapping flags on error
1110 static int __writepage(struct page *page, struct writeback_control *wbc,
1111 void *data)
1113 struct address_space *mapping = data;
1114 int ret = mapping->a_ops->writepage(page, wbc);
1115 mapping_set_error(mapping, ret);
1116 return ret;
1120 * generic_writepages - walk the list of dirty pages of the given address space and writepage() all of them.
1121 * @mapping: address space structure to write
1122 * @wbc: subtract the number of written pages from *@wbc->nr_to_write
1124 * This is a library function, which implements the writepages()
1125 * address_space_operation.
1127 int generic_writepages(struct address_space *mapping,
1128 struct writeback_control *wbc)
1130 /* deal with chardevs and other special file */
1131 if (!mapping->a_ops->writepage)
1132 return 0;
1134 return write_cache_pages(mapping, wbc, __writepage, mapping);
1137 EXPORT_SYMBOL(generic_writepages);
1139 int do_writepages(struct address_space *mapping, struct writeback_control *wbc)
1141 int ret;
1143 if (wbc->nr_to_write <= 0)
1144 return 0;
1145 wbc->for_writepages = 1;
1146 if (mapping->a_ops->writepages)
1147 ret = mapping->a_ops->writepages(mapping, wbc);
1148 else
1149 ret = generic_writepages(mapping, wbc);
1150 wbc->for_writepages = 0;
1151 return ret;
1155 * write_one_page - write out a single page and optionally wait on I/O
1156 * @page: the page to write
1157 * @wait: if true, wait on writeout
1159 * The page must be locked by the caller and will be unlocked upon return.
1161 * write_one_page() returns a negative error code if I/O failed.
1163 int write_one_page(struct page *page, int wait)
1165 struct address_space *mapping = page->mapping;
1166 int ret = 0;
1167 struct writeback_control wbc = {
1168 .sync_mode = WB_SYNC_ALL,
1169 .nr_to_write = 1,
1172 BUG_ON(!PageLocked(page));
1174 if (wait)
1175 wait_on_page_writeback(page);
1177 if (clear_page_dirty_for_io(page)) {
1178 page_cache_get(page);
1179 ret = mapping->a_ops->writepage(page, &wbc);
1180 if (ret == 0 && wait) {
1181 wait_on_page_writeback(page);
1182 if (PageError(page))
1183 ret = -EIO;
1185 page_cache_release(page);
1186 } else {
1187 unlock_page(page);
1189 return ret;
1191 EXPORT_SYMBOL(write_one_page);
1194 * For address_spaces which do not use buffers nor write back.
1196 int __set_page_dirty_no_writeback(struct page *page)
1198 if (!PageDirty(page))
1199 SetPageDirty(page);
1200 return 0;
1204 * Helper function for set_page_dirty family.
1205 * NOTE: This relies on being atomic wrt interrupts.
1207 void account_page_dirtied(struct page *page, struct address_space *mapping)
1209 if (mapping_cap_account_dirty(mapping)) {
1210 __inc_zone_page_state(page, NR_FILE_DIRTY);
1211 __inc_bdi_stat(mapping->backing_dev_info, BDI_RECLAIMABLE);
1212 task_dirty_inc(current);
1213 task_io_account_write(PAGE_CACHE_SIZE);
1218 * For address_spaces which do not use buffers. Just tag the page as dirty in
1219 * its radix tree.
1221 * This is also used when a single buffer is being dirtied: we want to set the
1222 * page dirty in that case, but not all the buffers. This is a "bottom-up"
1223 * dirtying, whereas __set_page_dirty_buffers() is a "top-down" dirtying.
1225 * Most callers have locked the page, which pins the address_space in memory.
1226 * But zap_pte_range() does not lock the page, however in that case the
1227 * mapping is pinned by the vma's ->vm_file reference.
1229 * We take care to handle the case where the page was truncated from the
1230 * mapping by re-checking page_mapping() inside tree_lock.
1232 int __set_page_dirty_nobuffers(struct page *page)
1234 if (!TestSetPageDirty(page)) {
1235 struct address_space *mapping = page_mapping(page);
1236 struct address_space *mapping2;
1238 if (!mapping)
1239 return 1;
1241 spin_lock_irq(&mapping->tree_lock);
1242 mapping2 = page_mapping(page);
1243 if (mapping2) { /* Race with truncate? */
1244 BUG_ON(mapping2 != mapping);
1245 WARN_ON_ONCE(!PagePrivate(page) && !PageUptodate(page));
1246 account_page_dirtied(page, mapping);
1247 radix_tree_tag_set(&mapping->page_tree,
1248 page_index(page), PAGECACHE_TAG_DIRTY);
1250 spin_unlock_irq(&mapping->tree_lock);
1251 if (mapping->host) {
1252 /* !PageAnon && !swapper_space */
1253 __mark_inode_dirty(mapping->host, I_DIRTY_PAGES);
1255 return 1;
1257 return 0;
1259 EXPORT_SYMBOL(__set_page_dirty_nobuffers);
1262 * When a writepage implementation decides that it doesn't want to write this
1263 * page for some reason, it should redirty the locked page via
1264 * redirty_page_for_writepage() and it should then unlock the page and return 0
1266 int redirty_page_for_writepage(struct writeback_control *wbc, struct page *page)
1268 wbc->pages_skipped++;
1269 return __set_page_dirty_nobuffers(page);
1271 EXPORT_SYMBOL(redirty_page_for_writepage);
1274 * If the mapping doesn't provide a set_page_dirty a_op, then
1275 * just fall through and assume that it wants buffer_heads.
1277 int set_page_dirty(struct page *page)
1279 struct address_space *mapping = page_mapping(page);
1281 if (likely(mapping)) {
1282 int (*spd)(struct page *) = mapping->a_ops->set_page_dirty;
1283 #ifdef CONFIG_BLOCK
1284 if (!spd)
1285 spd = __set_page_dirty_buffers;
1286 #endif
1287 return (*spd)(page);
1289 if (!PageDirty(page)) {
1290 if (!TestSetPageDirty(page))
1291 return 1;
1293 return 0;
1295 EXPORT_SYMBOL(set_page_dirty);
1298 * set_page_dirty() is racy if the caller has no reference against
1299 * page->mapping->host, and if the page is unlocked. This is because another
1300 * CPU could truncate the page off the mapping and then free the mapping.
1302 * Usually, the page _is_ locked, or the caller is a user-space process which
1303 * holds a reference on the inode by having an open file.
1305 * In other cases, the page should be locked before running set_page_dirty().
1307 int set_page_dirty_lock(struct page *page)
1309 int ret;
1311 lock_page_nosync(page);
1312 ret = set_page_dirty(page);
1313 unlock_page(page);
1314 return ret;
1316 EXPORT_SYMBOL(set_page_dirty_lock);
1319 * Clear a page's dirty flag, while caring for dirty memory accounting.
1320 * Returns true if the page was previously dirty.
1322 * This is for preparing to put the page under writeout. We leave the page
1323 * tagged as dirty in the radix tree so that a concurrent write-for-sync
1324 * can discover it via a PAGECACHE_TAG_DIRTY walk. The ->writepage
1325 * implementation will run either set_page_writeback() or set_page_dirty(),
1326 * at which stage we bring the page's dirty flag and radix-tree dirty tag
1327 * back into sync.
1329 * This incoherency between the page's dirty flag and radix-tree tag is
1330 * unfortunate, but it only exists while the page is locked.
1332 int clear_page_dirty_for_io(struct page *page)
1334 struct address_space *mapping = page_mapping(page);
1336 BUG_ON(!PageLocked(page));
1338 ClearPageReclaim(page);
1339 if (mapping && mapping_cap_account_dirty(mapping)) {
1341 * Yes, Virginia, this is indeed insane.
1343 * We use this sequence to make sure that
1344 * (a) we account for dirty stats properly
1345 * (b) we tell the low-level filesystem to
1346 * mark the whole page dirty if it was
1347 * dirty in a pagetable. Only to then
1348 * (c) clean the page again and return 1 to
1349 * cause the writeback.
1351 * This way we avoid all nasty races with the
1352 * dirty bit in multiple places and clearing
1353 * them concurrently from different threads.
1355 * Note! Normally the "set_page_dirty(page)"
1356 * has no effect on the actual dirty bit - since
1357 * that will already usually be set. But we
1358 * need the side effects, and it can help us
1359 * avoid races.
1361 * We basically use the page "master dirty bit"
1362 * as a serialization point for all the different
1363 * threads doing their things.
1365 if (page_mkclean(page))
1366 set_page_dirty(page);
1368 * We carefully synchronise fault handlers against
1369 * installing a dirty pte and marking the page dirty
1370 * at this point. We do this by having them hold the
1371 * page lock at some point after installing their
1372 * pte, but before marking the page dirty.
1373 * Pages are always locked coming in here, so we get
1374 * the desired exclusion. See mm/memory.c:do_wp_page()
1375 * for more comments.
1377 if (TestClearPageDirty(page)) {
1378 dec_zone_page_state(page, NR_FILE_DIRTY);
1379 dec_bdi_stat(mapping->backing_dev_info,
1380 BDI_RECLAIMABLE);
1381 return 1;
1383 return 0;
1385 return TestClearPageDirty(page);
1387 EXPORT_SYMBOL(clear_page_dirty_for_io);
1389 int test_clear_page_writeback(struct page *page)
1391 struct address_space *mapping = page_mapping(page);
1392 int ret;
1394 if (mapping) {
1395 struct backing_dev_info *bdi = mapping->backing_dev_info;
1396 unsigned long flags;
1398 spin_lock_irqsave(&mapping->tree_lock, flags);
1399 ret = TestClearPageWriteback(page);
1400 if (ret) {
1401 radix_tree_tag_clear(&mapping->page_tree,
1402 page_index(page),
1403 PAGECACHE_TAG_WRITEBACK);
1404 if (bdi_cap_account_writeback(bdi)) {
1405 __dec_bdi_stat(bdi, BDI_WRITEBACK);
1406 __bdi_writeout_inc(bdi);
1409 spin_unlock_irqrestore(&mapping->tree_lock, flags);
1410 } else {
1411 ret = TestClearPageWriteback(page);
1413 if (ret)
1414 dec_zone_page_state(page, NR_WRITEBACK);
1415 return ret;
1418 int test_set_page_writeback(struct page *page)
1420 struct address_space *mapping = page_mapping(page);
1421 int ret;
1423 if (mapping) {
1424 struct backing_dev_info *bdi = mapping->backing_dev_info;
1425 unsigned long flags;
1427 spin_lock_irqsave(&mapping->tree_lock, flags);
1428 ret = TestSetPageWriteback(page);
1429 if (!ret) {
1430 radix_tree_tag_set(&mapping->page_tree,
1431 page_index(page),
1432 PAGECACHE_TAG_WRITEBACK);
1433 if (bdi_cap_account_writeback(bdi))
1434 __inc_bdi_stat(bdi, BDI_WRITEBACK);
1436 if (!PageDirty(page))
1437 radix_tree_tag_clear(&mapping->page_tree,
1438 page_index(page),
1439 PAGECACHE_TAG_DIRTY);
1440 spin_unlock_irqrestore(&mapping->tree_lock, flags);
1441 } else {
1442 ret = TestSetPageWriteback(page);
1444 if (!ret)
1445 inc_zone_page_state(page, NR_WRITEBACK);
1446 return ret;
1449 EXPORT_SYMBOL(test_set_page_writeback);
1452 * Return true if any of the pages in the mapping are marked with the
1453 * passed tag.
1455 int mapping_tagged(struct address_space *mapping, int tag)
1457 int ret;
1458 rcu_read_lock();
1459 ret = radix_tree_tagged(&mapping->page_tree, tag);
1460 rcu_read_unlock();
1461 return ret;
1463 EXPORT_SYMBOL(mapping_tagged);