Btrfs: kill BUG_ON in run_delayed_tree_ref
[linux/fpc-iii.git] / mm / backing-dev.c
blob7f80b1a1bc343094533d644e5b39b40cdfbaf651
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 static atomic_long_t bdi_seq = ATOMIC_LONG_INIT(0);
17 struct backing_dev_info noop_backing_dev_info = {
18 .name = "noop",
19 .capabilities = BDI_CAP_NO_ACCT_AND_WRITEBACK,
21 EXPORT_SYMBOL_GPL(noop_backing_dev_info);
23 static struct class *bdi_class;
26 * bdi_lock protects updates to bdi_list. bdi_list has RCU reader side
27 * locking.
29 DEFINE_SPINLOCK(bdi_lock);
30 LIST_HEAD(bdi_list);
32 /* bdi_wq serves all asynchronous writeback tasks */
33 struct workqueue_struct *bdi_wq;
35 #ifdef CONFIG_DEBUG_FS
36 #include <linux/debugfs.h>
37 #include <linux/seq_file.h>
39 static struct dentry *bdi_debug_root;
41 static void bdi_debug_init(void)
43 bdi_debug_root = debugfs_create_dir("bdi", NULL);
46 static int bdi_debug_stats_show(struct seq_file *m, void *v)
48 struct backing_dev_info *bdi = m->private;
49 struct bdi_writeback *wb = &bdi->wb;
50 unsigned long background_thresh;
51 unsigned long dirty_thresh;
52 unsigned long wb_thresh;
53 unsigned long nr_dirty, nr_io, nr_more_io, nr_dirty_time;
54 struct inode *inode;
56 nr_dirty = nr_io = nr_more_io = nr_dirty_time = 0;
57 spin_lock(&wb->list_lock);
58 list_for_each_entry(inode, &wb->b_dirty, i_io_list)
59 nr_dirty++;
60 list_for_each_entry(inode, &wb->b_io, i_io_list)
61 nr_io++;
62 list_for_each_entry(inode, &wb->b_more_io, i_io_list)
63 nr_more_io++;
64 list_for_each_entry(inode, &wb->b_dirty_time, i_io_list)
65 if (inode->i_state & I_DIRTY_TIME)
66 nr_dirty_time++;
67 spin_unlock(&wb->list_lock);
69 global_dirty_limits(&background_thresh, &dirty_thresh);
70 wb_thresh = wb_calc_thresh(wb, dirty_thresh);
72 #define K(x) ((x) << (PAGE_SHIFT - 10))
73 seq_printf(m,
74 "BdiWriteback: %10lu kB\n"
75 "BdiReclaimable: %10lu kB\n"
76 "BdiDirtyThresh: %10lu kB\n"
77 "DirtyThresh: %10lu kB\n"
78 "BackgroundThresh: %10lu kB\n"
79 "BdiDirtied: %10lu kB\n"
80 "BdiWritten: %10lu kB\n"
81 "BdiWriteBandwidth: %10lu kBps\n"
82 "b_dirty: %10lu\n"
83 "b_io: %10lu\n"
84 "b_more_io: %10lu\n"
85 "b_dirty_time: %10lu\n"
86 "bdi_list: %10u\n"
87 "state: %10lx\n",
88 (unsigned long) K(wb_stat(wb, WB_WRITEBACK)),
89 (unsigned long) K(wb_stat(wb, WB_RECLAIMABLE)),
90 K(wb_thresh),
91 K(dirty_thresh),
92 K(background_thresh),
93 (unsigned long) K(wb_stat(wb, WB_DIRTIED)),
94 (unsigned long) K(wb_stat(wb, WB_WRITTEN)),
95 (unsigned long) K(wb->write_bandwidth),
96 nr_dirty,
97 nr_io,
98 nr_more_io,
99 nr_dirty_time,
100 !list_empty(&bdi->bdi_list), bdi->wb.state);
101 #undef K
103 return 0;
106 static int bdi_debug_stats_open(struct inode *inode, struct file *file)
108 return single_open(file, bdi_debug_stats_show, inode->i_private);
111 static const struct file_operations bdi_debug_stats_fops = {
112 .open = bdi_debug_stats_open,
113 .read = seq_read,
114 .llseek = seq_lseek,
115 .release = single_release,
118 static void bdi_debug_register(struct backing_dev_info *bdi, const char *name)
120 bdi->debug_dir = debugfs_create_dir(name, bdi_debug_root);
121 bdi->debug_stats = debugfs_create_file("stats", 0444, bdi->debug_dir,
122 bdi, &bdi_debug_stats_fops);
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 void bdi_debug_register(struct backing_dev_info *bdi,
135 const char *name)
138 static inline void bdi_debug_unregister(struct backing_dev_info *bdi)
141 #endif
143 static ssize_t read_ahead_kb_store(struct device *dev,
144 struct device_attribute *attr,
145 const char *buf, size_t count)
147 struct backing_dev_info *bdi = dev_get_drvdata(dev);
148 unsigned long read_ahead_kb;
149 ssize_t ret;
151 ret = kstrtoul(buf, 10, &read_ahead_kb);
152 if (ret < 0)
153 return ret;
155 bdi->ra_pages = read_ahead_kb >> (PAGE_SHIFT - 10);
157 return count;
160 #define K(pages) ((pages) << (PAGE_SHIFT - 10))
162 #define BDI_SHOW(name, expr) \
163 static ssize_t name##_show(struct device *dev, \
164 struct device_attribute *attr, char *page) \
166 struct backing_dev_info *bdi = dev_get_drvdata(dev); \
168 return snprintf(page, PAGE_SIZE-1, "%lld\n", (long long)expr); \
170 static DEVICE_ATTR_RW(name);
172 BDI_SHOW(read_ahead_kb, K(bdi->ra_pages))
174 static ssize_t min_ratio_store(struct device *dev,
175 struct device_attribute *attr, const char *buf, size_t count)
177 struct backing_dev_info *bdi = dev_get_drvdata(dev);
178 unsigned int ratio;
179 ssize_t ret;
181 ret = kstrtouint(buf, 10, &ratio);
182 if (ret < 0)
183 return ret;
185 ret = bdi_set_min_ratio(bdi, ratio);
186 if (!ret)
187 ret = count;
189 return ret;
191 BDI_SHOW(min_ratio, bdi->min_ratio)
193 static ssize_t max_ratio_store(struct device *dev,
194 struct device_attribute *attr, const char *buf, size_t count)
196 struct backing_dev_info *bdi = dev_get_drvdata(dev);
197 unsigned int ratio;
198 ssize_t ret;
200 ret = kstrtouint(buf, 10, &ratio);
201 if (ret < 0)
202 return ret;
204 ret = bdi_set_max_ratio(bdi, ratio);
205 if (!ret)
206 ret = count;
208 return ret;
210 BDI_SHOW(max_ratio, bdi->max_ratio)
212 static ssize_t stable_pages_required_show(struct device *dev,
213 struct device_attribute *attr,
214 char *page)
216 struct backing_dev_info *bdi = dev_get_drvdata(dev);
218 return snprintf(page, PAGE_SIZE-1, "%d\n",
219 bdi_cap_stable_pages_required(bdi) ? 1 : 0);
221 static DEVICE_ATTR_RO(stable_pages_required);
223 static struct attribute *bdi_dev_attrs[] = {
224 &dev_attr_read_ahead_kb.attr,
225 &dev_attr_min_ratio.attr,
226 &dev_attr_max_ratio.attr,
227 &dev_attr_stable_pages_required.attr,
228 NULL,
230 ATTRIBUTE_GROUPS(bdi_dev);
232 static __init int bdi_class_init(void)
234 bdi_class = class_create(THIS_MODULE, "bdi");
235 if (IS_ERR(bdi_class))
236 return PTR_ERR(bdi_class);
238 bdi_class->dev_groups = bdi_dev_groups;
239 bdi_debug_init();
240 return 0;
242 postcore_initcall(bdi_class_init);
244 static int __init default_bdi_init(void)
246 int err;
248 bdi_wq = alloc_workqueue("writeback", WQ_MEM_RECLAIM | WQ_FREEZABLE |
249 WQ_UNBOUND | WQ_SYSFS, 0);
250 if (!bdi_wq)
251 return -ENOMEM;
253 err = bdi_init(&noop_backing_dev_info);
255 return err;
257 subsys_initcall(default_bdi_init);
260 * This function is used when the first inode for this wb is marked dirty. It
261 * wakes-up the corresponding bdi thread which should then take care of the
262 * periodic background write-out of dirty inodes. Since the write-out would
263 * starts only 'dirty_writeback_interval' centisecs from now anyway, we just
264 * set up a timer which wakes the bdi thread up later.
266 * Note, we wouldn't bother setting up the timer, but this function is on the
267 * fast-path (used by '__mark_inode_dirty()'), so we save few context switches
268 * by delaying the wake-up.
270 * We have to be careful not to postpone flush work if it is scheduled for
271 * earlier. Thus we use queue_delayed_work().
273 void wb_wakeup_delayed(struct bdi_writeback *wb)
275 unsigned long timeout;
277 timeout = msecs_to_jiffies(dirty_writeback_interval * 10);
278 spin_lock_bh(&wb->work_lock);
279 if (test_bit(WB_registered, &wb->state))
280 queue_delayed_work(bdi_wq, &wb->dwork, timeout);
281 spin_unlock_bh(&wb->work_lock);
285 * Initial write bandwidth: 100 MB/s
287 #define INIT_BW (100 << (20 - PAGE_SHIFT))
289 static int wb_init(struct bdi_writeback *wb, struct backing_dev_info *bdi,
290 int blkcg_id, gfp_t gfp)
292 int i, err;
294 memset(wb, 0, sizeof(*wb));
296 wb->bdi = bdi;
297 wb->last_old_flush = jiffies;
298 INIT_LIST_HEAD(&wb->b_dirty);
299 INIT_LIST_HEAD(&wb->b_io);
300 INIT_LIST_HEAD(&wb->b_more_io);
301 INIT_LIST_HEAD(&wb->b_dirty_time);
302 spin_lock_init(&wb->list_lock);
304 wb->bw_time_stamp = jiffies;
305 wb->balanced_dirty_ratelimit = INIT_BW;
306 wb->dirty_ratelimit = INIT_BW;
307 wb->write_bandwidth = INIT_BW;
308 wb->avg_write_bandwidth = INIT_BW;
310 spin_lock_init(&wb->work_lock);
311 INIT_LIST_HEAD(&wb->work_list);
312 INIT_DELAYED_WORK(&wb->dwork, wb_workfn);
314 wb->congested = wb_congested_get_create(bdi, blkcg_id, gfp);
315 if (!wb->congested)
316 return -ENOMEM;
318 err = fprop_local_init_percpu(&wb->completions, gfp);
319 if (err)
320 goto out_put_cong;
322 for (i = 0; i < NR_WB_STAT_ITEMS; i++) {
323 err = percpu_counter_init(&wb->stat[i], 0, gfp);
324 if (err)
325 goto out_destroy_stat;
328 return 0;
330 out_destroy_stat:
331 while (--i)
332 percpu_counter_destroy(&wb->stat[i]);
333 fprop_local_destroy_percpu(&wb->completions);
334 out_put_cong:
335 wb_congested_put(wb->congested);
336 return err;
340 * Remove bdi from the global list and shutdown any threads we have running
342 static void wb_shutdown(struct bdi_writeback *wb)
344 /* Make sure nobody queues further work */
345 spin_lock_bh(&wb->work_lock);
346 if (!test_and_clear_bit(WB_registered, &wb->state)) {
347 spin_unlock_bh(&wb->work_lock);
348 return;
350 spin_unlock_bh(&wb->work_lock);
353 * Drain work list and shutdown the delayed_work. !WB_registered
354 * tells wb_workfn() that @wb is dying and its work_list needs to
355 * be drained no matter what.
357 mod_delayed_work(bdi_wq, &wb->dwork, 0);
358 flush_delayed_work(&wb->dwork);
359 WARN_ON(!list_empty(&wb->work_list));
362 static void wb_exit(struct bdi_writeback *wb)
364 int i;
366 WARN_ON(delayed_work_pending(&wb->dwork));
368 for (i = 0; i < NR_WB_STAT_ITEMS; i++)
369 percpu_counter_destroy(&wb->stat[i]);
371 fprop_local_destroy_percpu(&wb->completions);
372 wb_congested_put(wb->congested);
375 #ifdef CONFIG_CGROUP_WRITEBACK
377 #include <linux/memcontrol.h>
380 * cgwb_lock protects bdi->cgwb_tree, bdi->cgwb_congested_tree,
381 * blkcg->cgwb_list, and memcg->cgwb_list. bdi->cgwb_tree is also RCU
382 * protected. cgwb_release_wait is used to wait for the completion of cgwb
383 * releases from bdi destruction path.
385 static DEFINE_SPINLOCK(cgwb_lock);
386 static DECLARE_WAIT_QUEUE_HEAD(cgwb_release_wait);
389 * wb_congested_get_create - get or create a wb_congested
390 * @bdi: associated bdi
391 * @blkcg_id: ID of the associated blkcg
392 * @gfp: allocation mask
394 * Look up the wb_congested for @blkcg_id on @bdi. If missing, create one.
395 * The returned wb_congested has its reference count incremented. Returns
396 * NULL on failure.
398 struct bdi_writeback_congested *
399 wb_congested_get_create(struct backing_dev_info *bdi, int blkcg_id, gfp_t gfp)
401 struct bdi_writeback_congested *new_congested = NULL, *congested;
402 struct rb_node **node, *parent;
403 unsigned long flags;
404 retry:
405 spin_lock_irqsave(&cgwb_lock, flags);
407 node = &bdi->cgwb_congested_tree.rb_node;
408 parent = NULL;
410 while (*node != NULL) {
411 parent = *node;
412 congested = container_of(parent, struct bdi_writeback_congested,
413 rb_node);
414 if (congested->blkcg_id < blkcg_id)
415 node = &parent->rb_left;
416 else if (congested->blkcg_id > blkcg_id)
417 node = &parent->rb_right;
418 else
419 goto found;
422 if (new_congested) {
423 /* !found and storage for new one already allocated, insert */
424 congested = new_congested;
425 new_congested = NULL;
426 rb_link_node(&congested->rb_node, parent, node);
427 rb_insert_color(&congested->rb_node, &bdi->cgwb_congested_tree);
428 goto found;
431 spin_unlock_irqrestore(&cgwb_lock, flags);
433 /* allocate storage for new one and retry */
434 new_congested = kzalloc(sizeof(*new_congested), gfp);
435 if (!new_congested)
436 return NULL;
438 atomic_set(&new_congested->refcnt, 0);
439 new_congested->bdi = bdi;
440 new_congested->blkcg_id = blkcg_id;
441 goto retry;
443 found:
444 atomic_inc(&congested->refcnt);
445 spin_unlock_irqrestore(&cgwb_lock, flags);
446 kfree(new_congested);
447 return congested;
451 * wb_congested_put - put a wb_congested
452 * @congested: wb_congested to put
454 * Put @congested and destroy it if the refcnt reaches zero.
456 void wb_congested_put(struct bdi_writeback_congested *congested)
458 unsigned long flags;
460 local_irq_save(flags);
461 if (!atomic_dec_and_lock(&congested->refcnt, &cgwb_lock)) {
462 local_irq_restore(flags);
463 return;
466 /* bdi might already have been destroyed leaving @congested unlinked */
467 if (congested->bdi) {
468 rb_erase(&congested->rb_node,
469 &congested->bdi->cgwb_congested_tree);
470 congested->bdi = NULL;
473 spin_unlock_irqrestore(&cgwb_lock, flags);
474 kfree(congested);
477 static void cgwb_release_workfn(struct work_struct *work)
479 struct bdi_writeback *wb = container_of(work, struct bdi_writeback,
480 release_work);
481 struct backing_dev_info *bdi = wb->bdi;
483 spin_lock_irq(&cgwb_lock);
484 list_del_rcu(&wb->bdi_node);
485 spin_unlock_irq(&cgwb_lock);
487 wb_shutdown(wb);
489 css_put(wb->memcg_css);
490 css_put(wb->blkcg_css);
492 fprop_local_destroy_percpu(&wb->memcg_completions);
493 percpu_ref_exit(&wb->refcnt);
494 wb_exit(wb);
495 kfree_rcu(wb, rcu);
497 if (atomic_dec_and_test(&bdi->usage_cnt))
498 wake_up_all(&cgwb_release_wait);
501 static void cgwb_release(struct percpu_ref *refcnt)
503 struct bdi_writeback *wb = container_of(refcnt, struct bdi_writeback,
504 refcnt);
505 schedule_work(&wb->release_work);
508 static void cgwb_kill(struct bdi_writeback *wb)
510 lockdep_assert_held(&cgwb_lock);
512 WARN_ON(!radix_tree_delete(&wb->bdi->cgwb_tree, wb->memcg_css->id));
513 list_del(&wb->memcg_node);
514 list_del(&wb->blkcg_node);
515 percpu_ref_kill(&wb->refcnt);
518 static int cgwb_create(struct backing_dev_info *bdi,
519 struct cgroup_subsys_state *memcg_css, gfp_t gfp)
521 struct mem_cgroup *memcg;
522 struct cgroup_subsys_state *blkcg_css;
523 struct blkcg *blkcg;
524 struct list_head *memcg_cgwb_list, *blkcg_cgwb_list;
525 struct bdi_writeback *wb;
526 unsigned long flags;
527 int ret = 0;
529 memcg = mem_cgroup_from_css(memcg_css);
530 blkcg_css = cgroup_get_e_css(memcg_css->cgroup, &io_cgrp_subsys);
531 blkcg = css_to_blkcg(blkcg_css);
532 memcg_cgwb_list = mem_cgroup_cgwb_list(memcg);
533 blkcg_cgwb_list = &blkcg->cgwb_list;
535 /* look up again under lock and discard on blkcg mismatch */
536 spin_lock_irqsave(&cgwb_lock, flags);
537 wb = radix_tree_lookup(&bdi->cgwb_tree, memcg_css->id);
538 if (wb && wb->blkcg_css != blkcg_css) {
539 cgwb_kill(wb);
540 wb = NULL;
542 spin_unlock_irqrestore(&cgwb_lock, flags);
543 if (wb)
544 goto out_put;
546 /* need to create a new one */
547 wb = kmalloc(sizeof(*wb), gfp);
548 if (!wb)
549 return -ENOMEM;
551 ret = wb_init(wb, bdi, blkcg_css->id, gfp);
552 if (ret)
553 goto err_free;
555 ret = percpu_ref_init(&wb->refcnt, cgwb_release, 0, gfp);
556 if (ret)
557 goto err_wb_exit;
559 ret = fprop_local_init_percpu(&wb->memcg_completions, gfp);
560 if (ret)
561 goto err_ref_exit;
563 wb->memcg_css = memcg_css;
564 wb->blkcg_css = blkcg_css;
565 INIT_WORK(&wb->release_work, cgwb_release_workfn);
566 set_bit(WB_registered, &wb->state);
569 * The root wb determines the registered state of the whole bdi and
570 * memcg_cgwb_list and blkcg_cgwb_list's next pointers indicate
571 * whether they're still online. Don't link @wb if any is dead.
572 * See wb_memcg_offline() and wb_blkcg_offline().
574 ret = -ENODEV;
575 spin_lock_irqsave(&cgwb_lock, flags);
576 if (test_bit(WB_registered, &bdi->wb.state) &&
577 blkcg_cgwb_list->next && memcg_cgwb_list->next) {
578 /* we might have raced another instance of this function */
579 ret = radix_tree_insert(&bdi->cgwb_tree, memcg_css->id, wb);
580 if (!ret) {
581 atomic_inc(&bdi->usage_cnt);
582 list_add_tail_rcu(&wb->bdi_node, &bdi->wb_list);
583 list_add(&wb->memcg_node, memcg_cgwb_list);
584 list_add(&wb->blkcg_node, blkcg_cgwb_list);
585 css_get(memcg_css);
586 css_get(blkcg_css);
589 spin_unlock_irqrestore(&cgwb_lock, flags);
590 if (ret) {
591 if (ret == -EEXIST)
592 ret = 0;
593 goto err_fprop_exit;
595 goto out_put;
597 err_fprop_exit:
598 fprop_local_destroy_percpu(&wb->memcg_completions);
599 err_ref_exit:
600 percpu_ref_exit(&wb->refcnt);
601 err_wb_exit:
602 wb_exit(wb);
603 err_free:
604 kfree(wb);
605 out_put:
606 css_put(blkcg_css);
607 return ret;
611 * wb_get_create - get wb for a given memcg, create if necessary
612 * @bdi: target bdi
613 * @memcg_css: cgroup_subsys_state of the target memcg (must have positive ref)
614 * @gfp: allocation mask to use
616 * Try to get the wb for @memcg_css on @bdi. If it doesn't exist, try to
617 * create one. The returned wb has its refcount incremented.
619 * This function uses css_get() on @memcg_css and thus expects its refcnt
620 * to be positive on invocation. IOW, rcu_read_lock() protection on
621 * @memcg_css isn't enough. try_get it before calling this function.
623 * A wb is keyed by its associated memcg. As blkcg implicitly enables
624 * memcg on the default hierarchy, memcg association is guaranteed to be
625 * more specific (equal or descendant to the associated blkcg) and thus can
626 * identify both the memcg and blkcg associations.
628 * Because the blkcg associated with a memcg may change as blkcg is enabled
629 * and disabled closer to root in the hierarchy, each wb keeps track of
630 * both the memcg and blkcg associated with it and verifies the blkcg on
631 * each lookup. On mismatch, the existing wb is discarded and a new one is
632 * created.
634 struct bdi_writeback *wb_get_create(struct backing_dev_info *bdi,
635 struct cgroup_subsys_state *memcg_css,
636 gfp_t gfp)
638 struct bdi_writeback *wb;
640 might_sleep_if(gfpflags_allow_blocking(gfp));
642 if (!memcg_css->parent)
643 return &bdi->wb;
645 do {
646 rcu_read_lock();
647 wb = radix_tree_lookup(&bdi->cgwb_tree, memcg_css->id);
648 if (wb) {
649 struct cgroup_subsys_state *blkcg_css;
651 /* see whether the blkcg association has changed */
652 blkcg_css = cgroup_get_e_css(memcg_css->cgroup,
653 &io_cgrp_subsys);
654 if (unlikely(wb->blkcg_css != blkcg_css ||
655 !wb_tryget(wb)))
656 wb = NULL;
657 css_put(blkcg_css);
659 rcu_read_unlock();
660 } while (!wb && !cgwb_create(bdi, memcg_css, gfp));
662 return wb;
665 static int cgwb_bdi_init(struct backing_dev_info *bdi)
667 int ret;
669 INIT_RADIX_TREE(&bdi->cgwb_tree, GFP_ATOMIC);
670 bdi->cgwb_congested_tree = RB_ROOT;
671 atomic_set(&bdi->usage_cnt, 1);
673 ret = wb_init(&bdi->wb, bdi, 1, GFP_KERNEL);
674 if (!ret) {
675 bdi->wb.memcg_css = mem_cgroup_root_css;
676 bdi->wb.blkcg_css = blkcg_root_css;
678 return ret;
681 static void cgwb_bdi_destroy(struct backing_dev_info *bdi)
683 struct radix_tree_iter iter;
684 struct rb_node *rbn;
685 void **slot;
687 WARN_ON(test_bit(WB_registered, &bdi->wb.state));
689 spin_lock_irq(&cgwb_lock);
691 radix_tree_for_each_slot(slot, &bdi->cgwb_tree, &iter, 0)
692 cgwb_kill(*slot);
694 while ((rbn = rb_first(&bdi->cgwb_congested_tree))) {
695 struct bdi_writeback_congested *congested =
696 rb_entry(rbn, struct bdi_writeback_congested, rb_node);
698 rb_erase(rbn, &bdi->cgwb_congested_tree);
699 congested->bdi = NULL; /* mark @congested unlinked */
702 spin_unlock_irq(&cgwb_lock);
705 * All cgwb's and their congested states must be shutdown and
706 * released before returning. Drain the usage counter to wait for
707 * all cgwb's and cgwb_congested's ever created on @bdi.
709 atomic_dec(&bdi->usage_cnt);
710 wait_event(cgwb_release_wait, !atomic_read(&bdi->usage_cnt));
714 * wb_memcg_offline - kill all wb's associated with a memcg being offlined
715 * @memcg: memcg being offlined
717 * Also prevents creation of any new wb's associated with @memcg.
719 void wb_memcg_offline(struct mem_cgroup *memcg)
721 LIST_HEAD(to_destroy);
722 struct list_head *memcg_cgwb_list = mem_cgroup_cgwb_list(memcg);
723 struct bdi_writeback *wb, *next;
725 spin_lock_irq(&cgwb_lock);
726 list_for_each_entry_safe(wb, next, memcg_cgwb_list, memcg_node)
727 cgwb_kill(wb);
728 memcg_cgwb_list->next = NULL; /* prevent new wb's */
729 spin_unlock_irq(&cgwb_lock);
733 * wb_blkcg_offline - kill all wb's associated with a blkcg being offlined
734 * @blkcg: blkcg being offlined
736 * Also prevents creation of any new wb's associated with @blkcg.
738 void wb_blkcg_offline(struct blkcg *blkcg)
740 LIST_HEAD(to_destroy);
741 struct bdi_writeback *wb, *next;
743 spin_lock_irq(&cgwb_lock);
744 list_for_each_entry_safe(wb, next, &blkcg->cgwb_list, blkcg_node)
745 cgwb_kill(wb);
746 blkcg->cgwb_list.next = NULL; /* prevent new wb's */
747 spin_unlock_irq(&cgwb_lock);
750 #else /* CONFIG_CGROUP_WRITEBACK */
752 static int cgwb_bdi_init(struct backing_dev_info *bdi)
754 int err;
756 bdi->wb_congested = kzalloc(sizeof(*bdi->wb_congested), GFP_KERNEL);
757 if (!bdi->wb_congested)
758 return -ENOMEM;
760 atomic_set(&bdi->wb_congested->refcnt, 1);
762 err = wb_init(&bdi->wb, bdi, 1, GFP_KERNEL);
763 if (err) {
764 wb_congested_put(bdi->wb_congested);
765 return err;
767 return 0;
770 static void cgwb_bdi_destroy(struct backing_dev_info *bdi)
772 wb_congested_put(bdi->wb_congested);
775 #endif /* CONFIG_CGROUP_WRITEBACK */
777 int bdi_init(struct backing_dev_info *bdi)
779 int ret;
781 bdi->dev = NULL;
783 bdi->min_ratio = 0;
784 bdi->max_ratio = 100;
785 bdi->max_prop_frac = FPROP_FRAC_BASE;
786 INIT_LIST_HEAD(&bdi->bdi_list);
787 INIT_LIST_HEAD(&bdi->wb_list);
788 init_waitqueue_head(&bdi->wb_waitq);
790 ret = cgwb_bdi_init(bdi);
792 list_add_tail_rcu(&bdi->wb.bdi_node, &bdi->wb_list);
794 return ret;
796 EXPORT_SYMBOL(bdi_init);
798 int bdi_register(struct backing_dev_info *bdi, struct device *parent,
799 const char *fmt, ...)
801 va_list args;
802 struct device *dev;
804 if (bdi->dev) /* The driver needs to use separate queues per device */
805 return 0;
807 va_start(args, fmt);
808 dev = device_create_vargs(bdi_class, parent, MKDEV(0, 0), bdi, fmt, args);
809 va_end(args);
810 if (IS_ERR(dev))
811 return PTR_ERR(dev);
813 bdi->dev = dev;
815 bdi_debug_register(bdi, dev_name(dev));
816 set_bit(WB_registered, &bdi->wb.state);
818 spin_lock_bh(&bdi_lock);
819 list_add_tail_rcu(&bdi->bdi_list, &bdi_list);
820 spin_unlock_bh(&bdi_lock);
822 trace_writeback_bdi_register(bdi);
823 return 0;
825 EXPORT_SYMBOL(bdi_register);
827 int bdi_register_dev(struct backing_dev_info *bdi, dev_t dev)
829 return bdi_register(bdi, NULL, "%u:%u", MAJOR(dev), MINOR(dev));
831 EXPORT_SYMBOL(bdi_register_dev);
833 int bdi_register_owner(struct backing_dev_info *bdi, struct device *owner)
835 int rc;
837 rc = bdi_register(bdi, NULL, "%u:%u", MAJOR(owner->devt),
838 MINOR(owner->devt));
839 if (rc)
840 return rc;
841 bdi->owner = owner;
842 get_device(owner);
843 return 0;
845 EXPORT_SYMBOL(bdi_register_owner);
848 * Remove bdi from bdi_list, and ensure that it is no longer visible
850 static void bdi_remove_from_list(struct backing_dev_info *bdi)
852 spin_lock_bh(&bdi_lock);
853 list_del_rcu(&bdi->bdi_list);
854 spin_unlock_bh(&bdi_lock);
856 synchronize_rcu_expedited();
859 void bdi_unregister(struct backing_dev_info *bdi)
861 /* make sure nobody finds us on the bdi_list anymore */
862 bdi_remove_from_list(bdi);
863 wb_shutdown(&bdi->wb);
864 cgwb_bdi_destroy(bdi);
866 if (bdi->dev) {
867 bdi_debug_unregister(bdi);
868 device_unregister(bdi->dev);
869 bdi->dev = NULL;
872 if (bdi->owner) {
873 put_device(bdi->owner);
874 bdi->owner = NULL;
878 void bdi_exit(struct backing_dev_info *bdi)
880 WARN_ON_ONCE(bdi->dev);
881 wb_exit(&bdi->wb);
884 void bdi_destroy(struct backing_dev_info *bdi)
886 bdi_unregister(bdi);
887 bdi_exit(bdi);
889 EXPORT_SYMBOL(bdi_destroy);
892 * For use from filesystems to quickly init and register a bdi associated
893 * with dirty writeback
895 int bdi_setup_and_register(struct backing_dev_info *bdi, char *name)
897 int err;
899 bdi->name = name;
900 bdi->capabilities = 0;
901 err = bdi_init(bdi);
902 if (err)
903 return err;
905 err = bdi_register(bdi, NULL, "%.28s-%ld", name,
906 atomic_long_inc_return(&bdi_seq));
907 if (err) {
908 bdi_destroy(bdi);
909 return err;
912 return 0;
914 EXPORT_SYMBOL(bdi_setup_and_register);
916 static wait_queue_head_t congestion_wqh[2] = {
917 __WAIT_QUEUE_HEAD_INITIALIZER(congestion_wqh[0]),
918 __WAIT_QUEUE_HEAD_INITIALIZER(congestion_wqh[1])
920 static atomic_t nr_wb_congested[2];
922 void clear_wb_congested(struct bdi_writeback_congested *congested, int sync)
924 wait_queue_head_t *wqh = &congestion_wqh[sync];
925 enum wb_congested_state bit;
927 bit = sync ? WB_sync_congested : WB_async_congested;
928 if (test_and_clear_bit(bit, &congested->state))
929 atomic_dec(&nr_wb_congested[sync]);
930 smp_mb__after_atomic();
931 if (waitqueue_active(wqh))
932 wake_up(wqh);
934 EXPORT_SYMBOL(clear_wb_congested);
936 void set_wb_congested(struct bdi_writeback_congested *congested, int sync)
938 enum wb_congested_state bit;
940 bit = sync ? WB_sync_congested : WB_async_congested;
941 if (!test_and_set_bit(bit, &congested->state))
942 atomic_inc(&nr_wb_congested[sync]);
944 EXPORT_SYMBOL(set_wb_congested);
947 * congestion_wait - wait for a backing_dev to become uncongested
948 * @sync: SYNC or ASYNC IO
949 * @timeout: timeout in jiffies
951 * Waits for up to @timeout jiffies for a backing_dev (any backing_dev) to exit
952 * write congestion. If no backing_devs are congested then just wait for the
953 * next write to be completed.
955 long congestion_wait(int sync, long timeout)
957 long ret;
958 unsigned long start = jiffies;
959 DEFINE_WAIT(wait);
960 wait_queue_head_t *wqh = &congestion_wqh[sync];
962 prepare_to_wait(wqh, &wait, TASK_UNINTERRUPTIBLE);
963 ret = io_schedule_timeout(timeout);
964 finish_wait(wqh, &wait);
966 trace_writeback_congestion_wait(jiffies_to_usecs(timeout),
967 jiffies_to_usecs(jiffies - start));
969 return ret;
971 EXPORT_SYMBOL(congestion_wait);
974 * wait_iff_congested - Conditionally wait for a backing_dev to become uncongested or a zone to complete writes
975 * @zone: A zone to check if it is heavily congested
976 * @sync: SYNC or ASYNC IO
977 * @timeout: timeout in jiffies
979 * In the event of a congested backing_dev (any backing_dev) and the given
980 * @zone has experienced recent congestion, this waits for up to @timeout
981 * jiffies for either a BDI to exit congestion of the given @sync queue
982 * or a write to complete.
984 * In the absence of zone congestion, a short sleep or a cond_resched is
985 * performed to yield the processor and to allow other subsystems to make
986 * a forward progress.
988 * The return value is 0 if the sleep is for the full timeout. Otherwise,
989 * it is the number of jiffies that were still remaining when the function
990 * returned. return_value == timeout implies the function did not sleep.
992 long wait_iff_congested(struct zone *zone, int sync, long timeout)
994 long ret;
995 unsigned long start = jiffies;
996 DEFINE_WAIT(wait);
997 wait_queue_head_t *wqh = &congestion_wqh[sync];
1000 * If there is no congestion, or heavy congestion is not being
1001 * encountered in the current zone, yield if necessary instead
1002 * of sleeping on the congestion queue
1004 if (atomic_read(&nr_wb_congested[sync]) == 0 ||
1005 !test_bit(ZONE_CONGESTED, &zone->flags)) {
1008 * Memory allocation/reclaim might be called from a WQ
1009 * context and the current implementation of the WQ
1010 * concurrency control doesn't recognize that a particular
1011 * WQ is congested if the worker thread is looping without
1012 * ever sleeping. Therefore we have to do a short sleep
1013 * here rather than calling cond_resched().
1015 if (current->flags & PF_WQ_WORKER)
1016 schedule_timeout_uninterruptible(1);
1017 else
1018 cond_resched();
1020 /* In case we scheduled, work out time remaining */
1021 ret = timeout - (jiffies - start);
1022 if (ret < 0)
1023 ret = 0;
1025 goto out;
1028 /* Sleep until uncongested or a write happens */
1029 prepare_to_wait(wqh, &wait, TASK_UNINTERRUPTIBLE);
1030 ret = io_schedule_timeout(timeout);
1031 finish_wait(wqh, &wait);
1033 out:
1034 trace_writeback_wait_iff_congested(jiffies_to_usecs(timeout),
1035 jiffies_to_usecs(jiffies - start));
1037 return ret;
1039 EXPORT_SYMBOL(wait_iff_congested);
1041 int pdflush_proc_obsolete(struct ctl_table *table, int write,
1042 void __user *buffer, size_t *lenp, loff_t *ppos)
1044 char kbuf[] = "0\n";
1046 if (*ppos || *lenp < sizeof(kbuf)) {
1047 *lenp = 0;
1048 return 0;
1051 if (copy_to_user(buffer, kbuf, sizeof(kbuf)))
1052 return -EFAULT;
1053 printk_once(KERN_WARNING "%s exported in /proc is scheduled for removal\n",
1054 table->procname);
1056 *lenp = 2;
1057 *ppos += *lenp;
1058 return 2;