tcp: avoid collapses in tcp_prune_queue() if possible
[linux/fpc-iii.git] / mm / backing-dev.c
blob2e5d3df0853d928021cba0e30c70ff682afeaf68
2 #include <linux/wait.h>
3 #include <linux/backing-dev.h>
4 #include <linux/kthread.h>
5 #include <linux/freezer.h>
6 #include <linux/fs.h>
7 #include <linux/pagemap.h>
8 #include <linux/mm.h>
9 #include <linux/sched.h>
10 #include <linux/module.h>
11 #include <linux/writeback.h>
12 #include <linux/device.h>
13 #include <trace/events/writeback.h>
15 struct backing_dev_info noop_backing_dev_info = {
16 .name = "noop",
17 .capabilities = BDI_CAP_NO_ACCT_AND_WRITEBACK,
19 EXPORT_SYMBOL_GPL(noop_backing_dev_info);
21 static struct class *bdi_class;
24 * bdi_lock protects updates to bdi_list. bdi_list has RCU reader side
25 * locking.
27 DEFINE_SPINLOCK(bdi_lock);
28 LIST_HEAD(bdi_list);
30 /* bdi_wq serves all asynchronous writeback tasks */
31 struct workqueue_struct *bdi_wq;
33 #ifdef CONFIG_DEBUG_FS
34 #include <linux/debugfs.h>
35 #include <linux/seq_file.h>
37 static struct dentry *bdi_debug_root;
39 static void bdi_debug_init(void)
41 bdi_debug_root = debugfs_create_dir("bdi", NULL);
44 static int bdi_debug_stats_show(struct seq_file *m, void *v)
46 struct backing_dev_info *bdi = m->private;
47 struct bdi_writeback *wb = &bdi->wb;
48 unsigned long background_thresh;
49 unsigned long dirty_thresh;
50 unsigned long wb_thresh;
51 unsigned long nr_dirty, nr_io, nr_more_io, nr_dirty_time;
52 struct inode *inode;
54 nr_dirty = nr_io = nr_more_io = nr_dirty_time = 0;
55 spin_lock(&wb->list_lock);
56 list_for_each_entry(inode, &wb->b_dirty, i_io_list)
57 nr_dirty++;
58 list_for_each_entry(inode, &wb->b_io, i_io_list)
59 nr_io++;
60 list_for_each_entry(inode, &wb->b_more_io, i_io_list)
61 nr_more_io++;
62 list_for_each_entry(inode, &wb->b_dirty_time, i_io_list)
63 if (inode->i_state & I_DIRTY_TIME)
64 nr_dirty_time++;
65 spin_unlock(&wb->list_lock);
67 global_dirty_limits(&background_thresh, &dirty_thresh);
68 wb_thresh = wb_calc_thresh(wb, dirty_thresh);
70 #define K(x) ((x) << (PAGE_SHIFT - 10))
71 seq_printf(m,
72 "BdiWriteback: %10lu kB\n"
73 "BdiReclaimable: %10lu kB\n"
74 "BdiDirtyThresh: %10lu kB\n"
75 "DirtyThresh: %10lu kB\n"
76 "BackgroundThresh: %10lu kB\n"
77 "BdiDirtied: %10lu kB\n"
78 "BdiWritten: %10lu kB\n"
79 "BdiWriteBandwidth: %10lu kBps\n"
80 "b_dirty: %10lu\n"
81 "b_io: %10lu\n"
82 "b_more_io: %10lu\n"
83 "b_dirty_time: %10lu\n"
84 "bdi_list: %10u\n"
85 "state: %10lx\n",
86 (unsigned long) K(wb_stat(wb, WB_WRITEBACK)),
87 (unsigned long) K(wb_stat(wb, WB_RECLAIMABLE)),
88 K(wb_thresh),
89 K(dirty_thresh),
90 K(background_thresh),
91 (unsigned long) K(wb_stat(wb, WB_DIRTIED)),
92 (unsigned long) K(wb_stat(wb, WB_WRITTEN)),
93 (unsigned long) K(wb->write_bandwidth),
94 nr_dirty,
95 nr_io,
96 nr_more_io,
97 nr_dirty_time,
98 !list_empty(&bdi->bdi_list), bdi->wb.state);
99 #undef K
101 return 0;
103 DEFINE_SHOW_ATTRIBUTE(bdi_debug_stats);
105 static int bdi_debug_register(struct backing_dev_info *bdi, const char *name)
107 if (!bdi_debug_root)
108 return -ENOMEM;
110 bdi->debug_dir = debugfs_create_dir(name, bdi_debug_root);
111 if (!bdi->debug_dir)
112 return -ENOMEM;
114 bdi->debug_stats = debugfs_create_file("stats", 0444, bdi->debug_dir,
115 bdi, &bdi_debug_stats_fops);
116 if (!bdi->debug_stats) {
117 debugfs_remove(bdi->debug_dir);
118 bdi->debug_dir = NULL;
119 return -ENOMEM;
122 return 0;
125 static void bdi_debug_unregister(struct backing_dev_info *bdi)
127 debugfs_remove(bdi->debug_stats);
128 debugfs_remove(bdi->debug_dir);
130 #else
131 static inline void bdi_debug_init(void)
134 static inline int bdi_debug_register(struct backing_dev_info *bdi,
135 const char *name)
137 return 0;
139 static inline void bdi_debug_unregister(struct backing_dev_info *bdi)
142 #endif
144 static ssize_t read_ahead_kb_store(struct device *dev,
145 struct device_attribute *attr,
146 const char *buf, size_t count)
148 struct backing_dev_info *bdi = dev_get_drvdata(dev);
149 unsigned long read_ahead_kb;
150 ssize_t ret;
152 ret = kstrtoul(buf, 10, &read_ahead_kb);
153 if (ret < 0)
154 return ret;
156 bdi->ra_pages = read_ahead_kb >> (PAGE_SHIFT - 10);
158 return count;
161 #define K(pages) ((pages) << (PAGE_SHIFT - 10))
163 #define BDI_SHOW(name, expr) \
164 static ssize_t name##_show(struct device *dev, \
165 struct device_attribute *attr, char *page) \
167 struct backing_dev_info *bdi = dev_get_drvdata(dev); \
169 return snprintf(page, PAGE_SIZE-1, "%lld\n", (long long)expr); \
171 static DEVICE_ATTR_RW(name);
173 BDI_SHOW(read_ahead_kb, K(bdi->ra_pages))
175 static ssize_t min_ratio_store(struct device *dev,
176 struct device_attribute *attr, const char *buf, size_t count)
178 struct backing_dev_info *bdi = dev_get_drvdata(dev);
179 unsigned int ratio;
180 ssize_t ret;
182 ret = kstrtouint(buf, 10, &ratio);
183 if (ret < 0)
184 return ret;
186 ret = bdi_set_min_ratio(bdi, ratio);
187 if (!ret)
188 ret = count;
190 return ret;
192 BDI_SHOW(min_ratio, bdi->min_ratio)
194 static ssize_t max_ratio_store(struct device *dev,
195 struct device_attribute *attr, const char *buf, size_t count)
197 struct backing_dev_info *bdi = dev_get_drvdata(dev);
198 unsigned int ratio;
199 ssize_t ret;
201 ret = kstrtouint(buf, 10, &ratio);
202 if (ret < 0)
203 return ret;
205 ret = bdi_set_max_ratio(bdi, ratio);
206 if (!ret)
207 ret = count;
209 return ret;
211 BDI_SHOW(max_ratio, bdi->max_ratio)
213 static ssize_t stable_pages_required_show(struct device *dev,
214 struct device_attribute *attr,
215 char *page)
217 struct backing_dev_info *bdi = dev_get_drvdata(dev);
219 return snprintf(page, PAGE_SIZE-1, "%d\n",
220 bdi_cap_stable_pages_required(bdi) ? 1 : 0);
222 static DEVICE_ATTR_RO(stable_pages_required);
224 static struct attribute *bdi_dev_attrs[] = {
225 &dev_attr_read_ahead_kb.attr,
226 &dev_attr_min_ratio.attr,
227 &dev_attr_max_ratio.attr,
228 &dev_attr_stable_pages_required.attr,
229 NULL,
231 ATTRIBUTE_GROUPS(bdi_dev);
233 static __init int bdi_class_init(void)
235 bdi_class = class_create(THIS_MODULE, "bdi");
236 if (IS_ERR(bdi_class))
237 return PTR_ERR(bdi_class);
239 bdi_class->dev_groups = bdi_dev_groups;
240 bdi_debug_init();
242 return 0;
244 postcore_initcall(bdi_class_init);
246 static int bdi_init(struct backing_dev_info *bdi);
248 static int __init default_bdi_init(void)
250 int err;
252 bdi_wq = alloc_workqueue("writeback", WQ_MEM_RECLAIM | WQ_FREEZABLE |
253 WQ_UNBOUND | WQ_SYSFS, 0);
254 if (!bdi_wq)
255 return -ENOMEM;
257 err = bdi_init(&noop_backing_dev_info);
259 return err;
261 subsys_initcall(default_bdi_init);
264 * This function is used when the first inode for this wb is marked dirty. It
265 * wakes-up the corresponding bdi thread which should then take care of the
266 * periodic background write-out of dirty inodes. Since the write-out would
267 * starts only 'dirty_writeback_interval' centisecs from now anyway, we just
268 * set up a timer which wakes the bdi thread up later.
270 * Note, we wouldn't bother setting up the timer, but this function is on the
271 * fast-path (used by '__mark_inode_dirty()'), so we save few context switches
272 * by delaying the wake-up.
274 * We have to be careful not to postpone flush work if it is scheduled for
275 * earlier. Thus we use queue_delayed_work().
277 void wb_wakeup_delayed(struct bdi_writeback *wb)
279 unsigned long timeout;
281 timeout = msecs_to_jiffies(dirty_writeback_interval * 10);
282 spin_lock_bh(&wb->work_lock);
283 if (test_bit(WB_registered, &wb->state))
284 queue_delayed_work(bdi_wq, &wb->dwork, timeout);
285 spin_unlock_bh(&wb->work_lock);
289 * Initial write bandwidth: 100 MB/s
291 #define INIT_BW (100 << (20 - PAGE_SHIFT))
293 static int wb_init(struct bdi_writeback *wb, struct backing_dev_info *bdi,
294 int blkcg_id, gfp_t gfp)
296 int i, err;
298 memset(wb, 0, sizeof(*wb));
300 if (wb != &bdi->wb)
301 bdi_get(bdi);
302 wb->bdi = bdi;
303 wb->last_old_flush = jiffies;
304 INIT_LIST_HEAD(&wb->b_dirty);
305 INIT_LIST_HEAD(&wb->b_io);
306 INIT_LIST_HEAD(&wb->b_more_io);
307 INIT_LIST_HEAD(&wb->b_dirty_time);
308 spin_lock_init(&wb->list_lock);
310 wb->bw_time_stamp = jiffies;
311 wb->balanced_dirty_ratelimit = INIT_BW;
312 wb->dirty_ratelimit = INIT_BW;
313 wb->write_bandwidth = INIT_BW;
314 wb->avg_write_bandwidth = INIT_BW;
316 spin_lock_init(&wb->work_lock);
317 INIT_LIST_HEAD(&wb->work_list);
318 INIT_DELAYED_WORK(&wb->dwork, wb_workfn);
319 wb->dirty_sleep = jiffies;
321 wb->congested = wb_congested_get_create(bdi, blkcg_id, gfp);
322 if (!wb->congested) {
323 err = -ENOMEM;
324 goto out_put_bdi;
327 err = fprop_local_init_percpu(&wb->completions, gfp);
328 if (err)
329 goto out_put_cong;
331 for (i = 0; i < NR_WB_STAT_ITEMS; i++) {
332 err = percpu_counter_init(&wb->stat[i], 0, gfp);
333 if (err)
334 goto out_destroy_stat;
337 return 0;
339 out_destroy_stat:
340 while (i--)
341 percpu_counter_destroy(&wb->stat[i]);
342 fprop_local_destroy_percpu(&wb->completions);
343 out_put_cong:
344 wb_congested_put(wb->congested);
345 out_put_bdi:
346 if (wb != &bdi->wb)
347 bdi_put(bdi);
348 return err;
351 static void cgwb_remove_from_bdi_list(struct bdi_writeback *wb);
354 * Remove bdi from the global list and shutdown any threads we have running
356 static void wb_shutdown(struct bdi_writeback *wb)
358 /* Make sure nobody queues further work */
359 spin_lock_bh(&wb->work_lock);
360 if (!test_and_clear_bit(WB_registered, &wb->state)) {
361 spin_unlock_bh(&wb->work_lock);
362 return;
364 spin_unlock_bh(&wb->work_lock);
366 cgwb_remove_from_bdi_list(wb);
368 * Drain work list and shutdown the delayed_work. !WB_registered
369 * tells wb_workfn() that @wb is dying and its work_list needs to
370 * be drained no matter what.
372 mod_delayed_work(bdi_wq, &wb->dwork, 0);
373 flush_delayed_work(&wb->dwork);
374 WARN_ON(!list_empty(&wb->work_list));
377 static void wb_exit(struct bdi_writeback *wb)
379 int i;
381 WARN_ON(delayed_work_pending(&wb->dwork));
383 for (i = 0; i < NR_WB_STAT_ITEMS; i++)
384 percpu_counter_destroy(&wb->stat[i]);
386 fprop_local_destroy_percpu(&wb->completions);
387 wb_congested_put(wb->congested);
388 if (wb != &wb->bdi->wb)
389 bdi_put(wb->bdi);
392 #ifdef CONFIG_CGROUP_WRITEBACK
394 #include <linux/memcontrol.h>
397 * cgwb_lock protects bdi->cgwb_tree, bdi->cgwb_congested_tree,
398 * blkcg->cgwb_list, and memcg->cgwb_list. bdi->cgwb_tree is also RCU
399 * protected.
401 static DEFINE_SPINLOCK(cgwb_lock);
402 static struct workqueue_struct *cgwb_release_wq;
405 * wb_congested_get_create - get or create a wb_congested
406 * @bdi: associated bdi
407 * @blkcg_id: ID of the associated blkcg
408 * @gfp: allocation mask
410 * Look up the wb_congested for @blkcg_id on @bdi. If missing, create one.
411 * The returned wb_congested has its reference count incremented. Returns
412 * NULL on failure.
414 struct bdi_writeback_congested *
415 wb_congested_get_create(struct backing_dev_info *bdi, int blkcg_id, gfp_t gfp)
417 struct bdi_writeback_congested *new_congested = NULL, *congested;
418 struct rb_node **node, *parent;
419 unsigned long flags;
420 retry:
421 spin_lock_irqsave(&cgwb_lock, flags);
423 node = &bdi->cgwb_congested_tree.rb_node;
424 parent = NULL;
426 while (*node != NULL) {
427 parent = *node;
428 congested = rb_entry(parent, struct bdi_writeback_congested,
429 rb_node);
430 if (congested->blkcg_id < blkcg_id)
431 node = &parent->rb_left;
432 else if (congested->blkcg_id > blkcg_id)
433 node = &parent->rb_right;
434 else
435 goto found;
438 if (new_congested) {
439 /* !found and storage for new one already allocated, insert */
440 congested = new_congested;
441 new_congested = NULL;
442 rb_link_node(&congested->rb_node, parent, node);
443 rb_insert_color(&congested->rb_node, &bdi->cgwb_congested_tree);
444 goto found;
447 spin_unlock_irqrestore(&cgwb_lock, flags);
449 /* allocate storage for new one and retry */
450 new_congested = kzalloc(sizeof(*new_congested), gfp);
451 if (!new_congested)
452 return NULL;
454 atomic_set(&new_congested->refcnt, 0);
455 new_congested->__bdi = bdi;
456 new_congested->blkcg_id = blkcg_id;
457 goto retry;
459 found:
460 atomic_inc(&congested->refcnt);
461 spin_unlock_irqrestore(&cgwb_lock, flags);
462 kfree(new_congested);
463 return congested;
467 * wb_congested_put - put a wb_congested
468 * @congested: wb_congested to put
470 * Put @congested and destroy it if the refcnt reaches zero.
472 void wb_congested_put(struct bdi_writeback_congested *congested)
474 unsigned long flags;
476 local_irq_save(flags);
477 if (!atomic_dec_and_lock(&congested->refcnt, &cgwb_lock)) {
478 local_irq_restore(flags);
479 return;
482 /* bdi might already have been destroyed leaving @congested unlinked */
483 if (congested->__bdi) {
484 rb_erase(&congested->rb_node,
485 &congested->__bdi->cgwb_congested_tree);
486 congested->__bdi = NULL;
489 spin_unlock_irqrestore(&cgwb_lock, flags);
490 kfree(congested);
493 static void cgwb_release_workfn(struct work_struct *work)
495 struct bdi_writeback *wb = container_of(work, struct bdi_writeback,
496 release_work);
498 mutex_lock(&wb->bdi->cgwb_release_mutex);
499 wb_shutdown(wb);
501 css_put(wb->memcg_css);
502 css_put(wb->blkcg_css);
503 mutex_unlock(&wb->bdi->cgwb_release_mutex);
505 fprop_local_destroy_percpu(&wb->memcg_completions);
506 percpu_ref_exit(&wb->refcnt);
507 wb_exit(wb);
508 kfree_rcu(wb, rcu);
511 static void cgwb_release(struct percpu_ref *refcnt)
513 struct bdi_writeback *wb = container_of(refcnt, struct bdi_writeback,
514 refcnt);
515 queue_work(cgwb_release_wq, &wb->release_work);
518 static void cgwb_kill(struct bdi_writeback *wb)
520 lockdep_assert_held(&cgwb_lock);
522 WARN_ON(!radix_tree_delete(&wb->bdi->cgwb_tree, wb->memcg_css->id));
523 list_del(&wb->memcg_node);
524 list_del(&wb->blkcg_node);
525 percpu_ref_kill(&wb->refcnt);
528 static void cgwb_remove_from_bdi_list(struct bdi_writeback *wb)
530 spin_lock_irq(&cgwb_lock);
531 list_del_rcu(&wb->bdi_node);
532 spin_unlock_irq(&cgwb_lock);
535 static int cgwb_create(struct backing_dev_info *bdi,
536 struct cgroup_subsys_state *memcg_css, gfp_t gfp)
538 struct mem_cgroup *memcg;
539 struct cgroup_subsys_state *blkcg_css;
540 struct blkcg *blkcg;
541 struct list_head *memcg_cgwb_list, *blkcg_cgwb_list;
542 struct bdi_writeback *wb;
543 unsigned long flags;
544 int ret = 0;
546 memcg = mem_cgroup_from_css(memcg_css);
547 blkcg_css = cgroup_get_e_css(memcg_css->cgroup, &io_cgrp_subsys);
548 blkcg = css_to_blkcg(blkcg_css);
549 memcg_cgwb_list = &memcg->cgwb_list;
550 blkcg_cgwb_list = &blkcg->cgwb_list;
552 /* look up again under lock and discard on blkcg mismatch */
553 spin_lock_irqsave(&cgwb_lock, flags);
554 wb = radix_tree_lookup(&bdi->cgwb_tree, memcg_css->id);
555 if (wb && wb->blkcg_css != blkcg_css) {
556 cgwb_kill(wb);
557 wb = NULL;
559 spin_unlock_irqrestore(&cgwb_lock, flags);
560 if (wb)
561 goto out_put;
563 /* need to create a new one */
564 wb = kmalloc(sizeof(*wb), gfp);
565 if (!wb) {
566 ret = -ENOMEM;
567 goto out_put;
570 ret = wb_init(wb, bdi, blkcg_css->id, gfp);
571 if (ret)
572 goto err_free;
574 ret = percpu_ref_init(&wb->refcnt, cgwb_release, 0, gfp);
575 if (ret)
576 goto err_wb_exit;
578 ret = fprop_local_init_percpu(&wb->memcg_completions, gfp);
579 if (ret)
580 goto err_ref_exit;
582 wb->memcg_css = memcg_css;
583 wb->blkcg_css = blkcg_css;
584 INIT_WORK(&wb->release_work, cgwb_release_workfn);
585 set_bit(WB_registered, &wb->state);
588 * The root wb determines the registered state of the whole bdi and
589 * memcg_cgwb_list and blkcg_cgwb_list's next pointers indicate
590 * whether they're still online. Don't link @wb if any is dead.
591 * See wb_memcg_offline() and wb_blkcg_offline().
593 ret = -ENODEV;
594 spin_lock_irqsave(&cgwb_lock, flags);
595 if (test_bit(WB_registered, &bdi->wb.state) &&
596 blkcg_cgwb_list->next && memcg_cgwb_list->next) {
597 /* we might have raced another instance of this function */
598 ret = radix_tree_insert(&bdi->cgwb_tree, memcg_css->id, wb);
599 if (!ret) {
600 list_add_tail_rcu(&wb->bdi_node, &bdi->wb_list);
601 list_add(&wb->memcg_node, memcg_cgwb_list);
602 list_add(&wb->blkcg_node, blkcg_cgwb_list);
603 css_get(memcg_css);
604 css_get(blkcg_css);
607 spin_unlock_irqrestore(&cgwb_lock, flags);
608 if (ret) {
609 if (ret == -EEXIST)
610 ret = 0;
611 goto err_fprop_exit;
613 goto out_put;
615 err_fprop_exit:
616 fprop_local_destroy_percpu(&wb->memcg_completions);
617 err_ref_exit:
618 percpu_ref_exit(&wb->refcnt);
619 err_wb_exit:
620 wb_exit(wb);
621 err_free:
622 kfree(wb);
623 out_put:
624 css_put(blkcg_css);
625 return ret;
629 * wb_get_create - get wb for a given memcg, create if necessary
630 * @bdi: target bdi
631 * @memcg_css: cgroup_subsys_state of the target memcg (must have positive ref)
632 * @gfp: allocation mask to use
634 * Try to get the wb for @memcg_css on @bdi. If it doesn't exist, try to
635 * create one. The returned wb has its refcount incremented.
637 * This function uses css_get() on @memcg_css and thus expects its refcnt
638 * to be positive on invocation. IOW, rcu_read_lock() protection on
639 * @memcg_css isn't enough. try_get it before calling this function.
641 * A wb is keyed by its associated memcg. As blkcg implicitly enables
642 * memcg on the default hierarchy, memcg association is guaranteed to be
643 * more specific (equal or descendant to the associated blkcg) and thus can
644 * identify both the memcg and blkcg associations.
646 * Because the blkcg associated with a memcg may change as blkcg is enabled
647 * and disabled closer to root in the hierarchy, each wb keeps track of
648 * both the memcg and blkcg associated with it and verifies the blkcg on
649 * each lookup. On mismatch, the existing wb is discarded and a new one is
650 * created.
652 struct bdi_writeback *wb_get_create(struct backing_dev_info *bdi,
653 struct cgroup_subsys_state *memcg_css,
654 gfp_t gfp)
656 struct bdi_writeback *wb;
658 might_sleep_if(gfpflags_allow_blocking(gfp));
660 if (!memcg_css->parent)
661 return &bdi->wb;
663 do {
664 rcu_read_lock();
665 wb = radix_tree_lookup(&bdi->cgwb_tree, memcg_css->id);
666 if (wb) {
667 struct cgroup_subsys_state *blkcg_css;
669 /* see whether the blkcg association has changed */
670 blkcg_css = cgroup_get_e_css(memcg_css->cgroup,
671 &io_cgrp_subsys);
672 if (unlikely(wb->blkcg_css != blkcg_css ||
673 !wb_tryget(wb)))
674 wb = NULL;
675 css_put(blkcg_css);
677 rcu_read_unlock();
678 } while (!wb && !cgwb_create(bdi, memcg_css, gfp));
680 return wb;
683 static int cgwb_bdi_init(struct backing_dev_info *bdi)
685 int ret;
687 INIT_RADIX_TREE(&bdi->cgwb_tree, GFP_ATOMIC);
688 bdi->cgwb_congested_tree = RB_ROOT;
689 mutex_init(&bdi->cgwb_release_mutex);
691 ret = wb_init(&bdi->wb, bdi, 1, GFP_KERNEL);
692 if (!ret) {
693 bdi->wb.memcg_css = &root_mem_cgroup->css;
694 bdi->wb.blkcg_css = blkcg_root_css;
696 return ret;
699 static void cgwb_bdi_unregister(struct backing_dev_info *bdi)
701 struct radix_tree_iter iter;
702 void **slot;
703 struct bdi_writeback *wb;
705 WARN_ON(test_bit(WB_registered, &bdi->wb.state));
707 spin_lock_irq(&cgwb_lock);
708 radix_tree_for_each_slot(slot, &bdi->cgwb_tree, &iter, 0)
709 cgwb_kill(*slot);
710 spin_unlock_irq(&cgwb_lock);
712 mutex_lock(&bdi->cgwb_release_mutex);
713 spin_lock_irq(&cgwb_lock);
714 while (!list_empty(&bdi->wb_list)) {
715 wb = list_first_entry(&bdi->wb_list, struct bdi_writeback,
716 bdi_node);
717 spin_unlock_irq(&cgwb_lock);
718 wb_shutdown(wb);
719 spin_lock_irq(&cgwb_lock);
721 spin_unlock_irq(&cgwb_lock);
722 mutex_unlock(&bdi->cgwb_release_mutex);
726 * wb_memcg_offline - kill all wb's associated with a memcg being offlined
727 * @memcg: memcg being offlined
729 * Also prevents creation of any new wb's associated with @memcg.
731 void wb_memcg_offline(struct mem_cgroup *memcg)
733 struct list_head *memcg_cgwb_list = &memcg->cgwb_list;
734 struct bdi_writeback *wb, *next;
736 spin_lock_irq(&cgwb_lock);
737 list_for_each_entry_safe(wb, next, memcg_cgwb_list, memcg_node)
738 cgwb_kill(wb);
739 memcg_cgwb_list->next = NULL; /* prevent new wb's */
740 spin_unlock_irq(&cgwb_lock);
744 * wb_blkcg_offline - kill all wb's associated with a blkcg being offlined
745 * @blkcg: blkcg being offlined
747 * Also prevents creation of any new wb's associated with @blkcg.
749 void wb_blkcg_offline(struct blkcg *blkcg)
751 struct bdi_writeback *wb, *next;
753 spin_lock_irq(&cgwb_lock);
754 list_for_each_entry_safe(wb, next, &blkcg->cgwb_list, blkcg_node)
755 cgwb_kill(wb);
756 blkcg->cgwb_list.next = NULL; /* prevent new wb's */
757 spin_unlock_irq(&cgwb_lock);
760 static void cgwb_bdi_exit(struct backing_dev_info *bdi)
762 struct rb_node *rbn;
764 spin_lock_irq(&cgwb_lock);
765 while ((rbn = rb_first(&bdi->cgwb_congested_tree))) {
766 struct bdi_writeback_congested *congested =
767 rb_entry(rbn, struct bdi_writeback_congested, rb_node);
769 rb_erase(rbn, &bdi->cgwb_congested_tree);
770 congested->__bdi = NULL; /* mark @congested unlinked */
772 spin_unlock_irq(&cgwb_lock);
775 static void cgwb_bdi_register(struct backing_dev_info *bdi)
777 spin_lock_irq(&cgwb_lock);
778 list_add_tail_rcu(&bdi->wb.bdi_node, &bdi->wb_list);
779 spin_unlock_irq(&cgwb_lock);
782 static int __init cgwb_init(void)
785 * There can be many concurrent release work items overwhelming
786 * system_wq. Put them in a separate wq and limit concurrency.
787 * There's no point in executing many of these in parallel.
789 cgwb_release_wq = alloc_workqueue("cgwb_release", 0, 1);
790 if (!cgwb_release_wq)
791 return -ENOMEM;
793 return 0;
795 subsys_initcall(cgwb_init);
797 #else /* CONFIG_CGROUP_WRITEBACK */
799 static int cgwb_bdi_init(struct backing_dev_info *bdi)
801 int err;
803 bdi->wb_congested = kzalloc(sizeof(*bdi->wb_congested), GFP_KERNEL);
804 if (!bdi->wb_congested)
805 return -ENOMEM;
807 atomic_set(&bdi->wb_congested->refcnt, 1);
809 err = wb_init(&bdi->wb, bdi, 1, GFP_KERNEL);
810 if (err) {
811 wb_congested_put(bdi->wb_congested);
812 return err;
814 return 0;
817 static void cgwb_bdi_unregister(struct backing_dev_info *bdi) { }
819 static void cgwb_bdi_exit(struct backing_dev_info *bdi)
821 wb_congested_put(bdi->wb_congested);
824 static void cgwb_bdi_register(struct backing_dev_info *bdi)
826 list_add_tail_rcu(&bdi->wb.bdi_node, &bdi->wb_list);
829 static void cgwb_remove_from_bdi_list(struct bdi_writeback *wb)
831 list_del_rcu(&wb->bdi_node);
834 #endif /* CONFIG_CGROUP_WRITEBACK */
836 static int bdi_init(struct backing_dev_info *bdi)
838 int ret;
840 bdi->dev = NULL;
842 kref_init(&bdi->refcnt);
843 bdi->min_ratio = 0;
844 bdi->max_ratio = 100;
845 bdi->max_prop_frac = FPROP_FRAC_BASE;
846 INIT_LIST_HEAD(&bdi->bdi_list);
847 INIT_LIST_HEAD(&bdi->wb_list);
848 init_waitqueue_head(&bdi->wb_waitq);
850 ret = cgwb_bdi_init(bdi);
852 return ret;
855 struct backing_dev_info *bdi_alloc_node(gfp_t gfp_mask, int node_id)
857 struct backing_dev_info *bdi;
859 bdi = kmalloc_node(sizeof(struct backing_dev_info),
860 gfp_mask | __GFP_ZERO, node_id);
861 if (!bdi)
862 return NULL;
864 if (bdi_init(bdi)) {
865 kfree(bdi);
866 return NULL;
868 return bdi;
870 EXPORT_SYMBOL(bdi_alloc_node);
872 int bdi_register_va(struct backing_dev_info *bdi, const char *fmt, va_list args)
874 struct device *dev;
876 if (bdi->dev) /* The driver needs to use separate queues per device */
877 return 0;
879 dev = device_create_vargs(bdi_class, NULL, MKDEV(0, 0), bdi, fmt, args);
880 if (IS_ERR(dev))
881 return PTR_ERR(dev);
883 cgwb_bdi_register(bdi);
884 bdi->dev = dev;
886 bdi_debug_register(bdi, dev_name(dev));
887 set_bit(WB_registered, &bdi->wb.state);
889 spin_lock_bh(&bdi_lock);
890 list_add_tail_rcu(&bdi->bdi_list, &bdi_list);
891 spin_unlock_bh(&bdi_lock);
893 trace_writeback_bdi_register(bdi);
894 return 0;
896 EXPORT_SYMBOL(bdi_register_va);
898 int bdi_register(struct backing_dev_info *bdi, const char *fmt, ...)
900 va_list args;
901 int ret;
903 va_start(args, fmt);
904 ret = bdi_register_va(bdi, fmt, args);
905 va_end(args);
906 return ret;
908 EXPORT_SYMBOL(bdi_register);
910 int bdi_register_owner(struct backing_dev_info *bdi, struct device *owner)
912 int rc;
914 rc = bdi_register(bdi, "%u:%u", MAJOR(owner->devt), MINOR(owner->devt));
915 if (rc)
916 return rc;
917 /* Leaking owner reference... */
918 WARN_ON(bdi->owner);
919 bdi->owner = owner;
920 get_device(owner);
921 return 0;
923 EXPORT_SYMBOL(bdi_register_owner);
926 * Remove bdi from bdi_list, and ensure that it is no longer visible
928 static void bdi_remove_from_list(struct backing_dev_info *bdi)
930 spin_lock_bh(&bdi_lock);
931 list_del_rcu(&bdi->bdi_list);
932 spin_unlock_bh(&bdi_lock);
934 synchronize_rcu_expedited();
937 void bdi_unregister(struct backing_dev_info *bdi)
939 /* make sure nobody finds us on the bdi_list anymore */
940 bdi_remove_from_list(bdi);
941 wb_shutdown(&bdi->wb);
942 cgwb_bdi_unregister(bdi);
944 if (bdi->dev) {
945 bdi_debug_unregister(bdi);
946 device_unregister(bdi->dev);
947 bdi->dev = NULL;
950 if (bdi->owner) {
951 put_device(bdi->owner);
952 bdi->owner = NULL;
956 static void release_bdi(struct kref *ref)
958 struct backing_dev_info *bdi =
959 container_of(ref, struct backing_dev_info, refcnt);
961 if (test_bit(WB_registered, &bdi->wb.state))
962 bdi_unregister(bdi);
963 WARN_ON_ONCE(bdi->dev);
964 wb_exit(&bdi->wb);
965 cgwb_bdi_exit(bdi);
966 kfree(bdi);
969 void bdi_put(struct backing_dev_info *bdi)
971 kref_put(&bdi->refcnt, release_bdi);
973 EXPORT_SYMBOL(bdi_put);
975 static wait_queue_head_t congestion_wqh[2] = {
976 __WAIT_QUEUE_HEAD_INITIALIZER(congestion_wqh[0]),
977 __WAIT_QUEUE_HEAD_INITIALIZER(congestion_wqh[1])
979 static atomic_t nr_wb_congested[2];
981 void clear_wb_congested(struct bdi_writeback_congested *congested, int sync)
983 wait_queue_head_t *wqh = &congestion_wqh[sync];
984 enum wb_congested_state bit;
986 bit = sync ? WB_sync_congested : WB_async_congested;
987 if (test_and_clear_bit(bit, &congested->state))
988 atomic_dec(&nr_wb_congested[sync]);
989 smp_mb__after_atomic();
990 if (waitqueue_active(wqh))
991 wake_up(wqh);
993 EXPORT_SYMBOL(clear_wb_congested);
995 void set_wb_congested(struct bdi_writeback_congested *congested, int sync)
997 enum wb_congested_state bit;
999 bit = sync ? WB_sync_congested : WB_async_congested;
1000 if (!test_and_set_bit(bit, &congested->state))
1001 atomic_inc(&nr_wb_congested[sync]);
1003 EXPORT_SYMBOL(set_wb_congested);
1006 * congestion_wait - wait for a backing_dev to become uncongested
1007 * @sync: SYNC or ASYNC IO
1008 * @timeout: timeout in jiffies
1010 * Waits for up to @timeout jiffies for a backing_dev (any backing_dev) to exit
1011 * write congestion. If no backing_devs are congested then just wait for the
1012 * next write to be completed.
1014 long congestion_wait(int sync, long timeout)
1016 long ret;
1017 unsigned long start = jiffies;
1018 DEFINE_WAIT(wait);
1019 wait_queue_head_t *wqh = &congestion_wqh[sync];
1021 prepare_to_wait(wqh, &wait, TASK_UNINTERRUPTIBLE);
1022 ret = io_schedule_timeout(timeout);
1023 finish_wait(wqh, &wait);
1025 trace_writeback_congestion_wait(jiffies_to_usecs(timeout),
1026 jiffies_to_usecs(jiffies - start));
1028 return ret;
1030 EXPORT_SYMBOL(congestion_wait);
1033 * wait_iff_congested - Conditionally wait for a backing_dev to become uncongested or a pgdat to complete writes
1034 * @sync: SYNC or ASYNC IO
1035 * @timeout: timeout in jiffies
1037 * In the event of a congested backing_dev (any backing_dev) this waits
1038 * for up to @timeout jiffies for either a BDI to exit congestion of the
1039 * given @sync queue or a write to complete.
1041 * The return value is 0 if the sleep is for the full timeout. Otherwise,
1042 * it is the number of jiffies that were still remaining when the function
1043 * returned. return_value == timeout implies the function did not sleep.
1045 long wait_iff_congested(int sync, long timeout)
1047 long ret;
1048 unsigned long start = jiffies;
1049 DEFINE_WAIT(wait);
1050 wait_queue_head_t *wqh = &congestion_wqh[sync];
1053 * If there is no congestion, yield if necessary instead
1054 * of sleeping on the congestion queue
1056 if (atomic_read(&nr_wb_congested[sync]) == 0) {
1057 cond_resched();
1059 /* In case we scheduled, work out time remaining */
1060 ret = timeout - (jiffies - start);
1061 if (ret < 0)
1062 ret = 0;
1064 goto out;
1067 /* Sleep until uncongested or a write happens */
1068 prepare_to_wait(wqh, &wait, TASK_UNINTERRUPTIBLE);
1069 ret = io_schedule_timeout(timeout);
1070 finish_wait(wqh, &wait);
1072 out:
1073 trace_writeback_wait_iff_congested(jiffies_to_usecs(timeout),
1074 jiffies_to_usecs(jiffies - start));
1076 return ret;
1078 EXPORT_SYMBOL(wait_iff_congested);