]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blob - mm/backing-dev.c
net: hns3: update coalesce param per second
[mirror_ubuntu-bionic-kernel.git] / mm / backing-dev.c
1
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>
14
15 struct backing_dev_info noop_backing_dev_info = {
16 .name = "noop",
17 .capabilities = BDI_CAP_NO_ACCT_AND_WRITEBACK,
18 };
19 EXPORT_SYMBOL_GPL(noop_backing_dev_info);
20
21 static struct class *bdi_class;
22
23 /*
24 * bdi_lock protects updates to bdi_list. bdi_list has RCU reader side
25 * locking.
26 */
27 DEFINE_SPINLOCK(bdi_lock);
28 LIST_HEAD(bdi_list);
29
30 /* bdi_wq serves all asynchronous writeback tasks */
31 struct workqueue_struct *bdi_wq;
32
33 #ifdef CONFIG_DEBUG_FS
34 #include <linux/debugfs.h>
35 #include <linux/seq_file.h>
36
37 static struct dentry *bdi_debug_root;
38
39 static void bdi_debug_init(void)
40 {
41 bdi_debug_root = debugfs_create_dir("bdi", NULL);
42 }
43
44 static int bdi_debug_stats_show(struct seq_file *m, void *v)
45 {
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;
53
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);
66
67 global_dirty_limits(&background_thresh, &dirty_thresh);
68 wb_thresh = wb_calc_thresh(wb, dirty_thresh);
69
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
100
101 return 0;
102 }
103
104 static int bdi_debug_stats_open(struct inode *inode, struct file *file)
105 {
106 return single_open(file, bdi_debug_stats_show, inode->i_private);
107 }
108
109 static const struct file_operations bdi_debug_stats_fops = {
110 .open = bdi_debug_stats_open,
111 .read = seq_read,
112 .llseek = seq_lseek,
113 .release = single_release,
114 };
115
116 static int bdi_debug_register(struct backing_dev_info *bdi, const char *name)
117 {
118 if (!bdi_debug_root)
119 return -ENOMEM;
120
121 bdi->debug_dir = debugfs_create_dir(name, bdi_debug_root);
122 if (!bdi->debug_dir)
123 return -ENOMEM;
124
125 bdi->debug_stats = debugfs_create_file("stats", 0444, bdi->debug_dir,
126 bdi, &bdi_debug_stats_fops);
127 if (!bdi->debug_stats) {
128 debugfs_remove(bdi->debug_dir);
129 bdi->debug_dir = NULL;
130 return -ENOMEM;
131 }
132
133 return 0;
134 }
135
136 static void bdi_debug_unregister(struct backing_dev_info *bdi)
137 {
138 debugfs_remove(bdi->debug_stats);
139 debugfs_remove(bdi->debug_dir);
140 }
141 #else
142 static inline void bdi_debug_init(void)
143 {
144 }
145 static inline int bdi_debug_register(struct backing_dev_info *bdi,
146 const char *name)
147 {
148 return 0;
149 }
150 static inline void bdi_debug_unregister(struct backing_dev_info *bdi)
151 {
152 }
153 #endif
154
155 static ssize_t read_ahead_kb_store(struct device *dev,
156 struct device_attribute *attr,
157 const char *buf, size_t count)
158 {
159 struct backing_dev_info *bdi = dev_get_drvdata(dev);
160 unsigned long read_ahead_kb;
161 ssize_t ret;
162
163 ret = kstrtoul(buf, 10, &read_ahead_kb);
164 if (ret < 0)
165 return ret;
166
167 bdi->ra_pages = read_ahead_kb >> (PAGE_SHIFT - 10);
168
169 return count;
170 }
171
172 #define K(pages) ((pages) << (PAGE_SHIFT - 10))
173
174 #define BDI_SHOW(name, expr) \
175 static ssize_t name##_show(struct device *dev, \
176 struct device_attribute *attr, char *page) \
177 { \
178 struct backing_dev_info *bdi = dev_get_drvdata(dev); \
179 \
180 return snprintf(page, PAGE_SIZE-1, "%lld\n", (long long)expr); \
181 } \
182 static DEVICE_ATTR_RW(name);
183
184 BDI_SHOW(read_ahead_kb, K(bdi->ra_pages))
185
186 static ssize_t min_ratio_store(struct device *dev,
187 struct device_attribute *attr, const char *buf, size_t count)
188 {
189 struct backing_dev_info *bdi = dev_get_drvdata(dev);
190 unsigned int ratio;
191 ssize_t ret;
192
193 ret = kstrtouint(buf, 10, &ratio);
194 if (ret < 0)
195 return ret;
196
197 ret = bdi_set_min_ratio(bdi, ratio);
198 if (!ret)
199 ret = count;
200
201 return ret;
202 }
203 BDI_SHOW(min_ratio, bdi->min_ratio)
204
205 static ssize_t max_ratio_store(struct device *dev,
206 struct device_attribute *attr, const char *buf, size_t count)
207 {
208 struct backing_dev_info *bdi = dev_get_drvdata(dev);
209 unsigned int ratio;
210 ssize_t ret;
211
212 ret = kstrtouint(buf, 10, &ratio);
213 if (ret < 0)
214 return ret;
215
216 ret = bdi_set_max_ratio(bdi, ratio);
217 if (!ret)
218 ret = count;
219
220 return ret;
221 }
222 BDI_SHOW(max_ratio, bdi->max_ratio)
223
224 static ssize_t stable_pages_required_show(struct device *dev,
225 struct device_attribute *attr,
226 char *page)
227 {
228 struct backing_dev_info *bdi = dev_get_drvdata(dev);
229
230 return snprintf(page, PAGE_SIZE-1, "%d\n",
231 bdi_cap_stable_pages_required(bdi) ? 1 : 0);
232 }
233 static DEVICE_ATTR_RO(stable_pages_required);
234
235 static struct attribute *bdi_dev_attrs[] = {
236 &dev_attr_read_ahead_kb.attr,
237 &dev_attr_min_ratio.attr,
238 &dev_attr_max_ratio.attr,
239 &dev_attr_stable_pages_required.attr,
240 NULL,
241 };
242 ATTRIBUTE_GROUPS(bdi_dev);
243
244 static __init int bdi_class_init(void)
245 {
246 bdi_class = class_create(THIS_MODULE, "bdi");
247 if (IS_ERR(bdi_class))
248 return PTR_ERR(bdi_class);
249
250 bdi_class->dev_groups = bdi_dev_groups;
251 bdi_debug_init();
252
253 return 0;
254 }
255 postcore_initcall(bdi_class_init);
256
257 static int bdi_init(struct backing_dev_info *bdi);
258
259 static int __init default_bdi_init(void)
260 {
261 int err;
262
263 bdi_wq = alloc_workqueue("writeback", WQ_MEM_RECLAIM | WQ_FREEZABLE |
264 WQ_UNBOUND | WQ_SYSFS, 0);
265 if (!bdi_wq)
266 return -ENOMEM;
267
268 err = bdi_init(&noop_backing_dev_info);
269
270 return err;
271 }
272 subsys_initcall(default_bdi_init);
273
274 /*
275 * This function is used when the first inode for this wb is marked dirty. It
276 * wakes-up the corresponding bdi thread which should then take care of the
277 * periodic background write-out of dirty inodes. Since the write-out would
278 * starts only 'dirty_writeback_interval' centisecs from now anyway, we just
279 * set up a timer which wakes the bdi thread up later.
280 *
281 * Note, we wouldn't bother setting up the timer, but this function is on the
282 * fast-path (used by '__mark_inode_dirty()'), so we save few context switches
283 * by delaying the wake-up.
284 *
285 * We have to be careful not to postpone flush work if it is scheduled for
286 * earlier. Thus we use queue_delayed_work().
287 */
288 void wb_wakeup_delayed(struct bdi_writeback *wb)
289 {
290 unsigned long timeout;
291
292 timeout = msecs_to_jiffies(dirty_writeback_interval * 10);
293 spin_lock_bh(&wb->work_lock);
294 if (test_bit(WB_registered, &wb->state))
295 queue_delayed_work(bdi_wq, &wb->dwork, timeout);
296 spin_unlock_bh(&wb->work_lock);
297 }
298
299 /*
300 * Initial write bandwidth: 100 MB/s
301 */
302 #define INIT_BW (100 << (20 - PAGE_SHIFT))
303
304 static int wb_init(struct bdi_writeback *wb, struct backing_dev_info *bdi,
305 int blkcg_id, gfp_t gfp)
306 {
307 int i, err;
308
309 memset(wb, 0, sizeof(*wb));
310
311 if (wb != &bdi->wb)
312 bdi_get(bdi);
313 wb->bdi = bdi;
314 wb->last_old_flush = jiffies;
315 INIT_LIST_HEAD(&wb->b_dirty);
316 INIT_LIST_HEAD(&wb->b_io);
317 INIT_LIST_HEAD(&wb->b_more_io);
318 INIT_LIST_HEAD(&wb->b_dirty_time);
319 spin_lock_init(&wb->list_lock);
320
321 wb->bw_time_stamp = jiffies;
322 wb->balanced_dirty_ratelimit = INIT_BW;
323 wb->dirty_ratelimit = INIT_BW;
324 wb->write_bandwidth = INIT_BW;
325 wb->avg_write_bandwidth = INIT_BW;
326
327 spin_lock_init(&wb->work_lock);
328 INIT_LIST_HEAD(&wb->work_list);
329 INIT_DELAYED_WORK(&wb->dwork, wb_workfn);
330 wb->dirty_sleep = jiffies;
331
332 wb->congested = wb_congested_get_create(bdi, blkcg_id, gfp);
333 if (!wb->congested) {
334 err = -ENOMEM;
335 goto out_put_bdi;
336 }
337
338 err = fprop_local_init_percpu(&wb->completions, gfp);
339 if (err)
340 goto out_put_cong;
341
342 for (i = 0; i < NR_WB_STAT_ITEMS; i++) {
343 err = percpu_counter_init(&wb->stat[i], 0, gfp);
344 if (err)
345 goto out_destroy_stat;
346 }
347
348 return 0;
349
350 out_destroy_stat:
351 while (i--)
352 percpu_counter_destroy(&wb->stat[i]);
353 fprop_local_destroy_percpu(&wb->completions);
354 out_put_cong:
355 wb_congested_put(wb->congested);
356 out_put_bdi:
357 if (wb != &bdi->wb)
358 bdi_put(bdi);
359 return err;
360 }
361
362 static void cgwb_remove_from_bdi_list(struct bdi_writeback *wb);
363
364 /*
365 * Remove bdi from the global list and shutdown any threads we have running
366 */
367 static void wb_shutdown(struct bdi_writeback *wb)
368 {
369 /* Make sure nobody queues further work */
370 spin_lock_bh(&wb->work_lock);
371 if (!test_and_clear_bit(WB_registered, &wb->state)) {
372 spin_unlock_bh(&wb->work_lock);
373 /*
374 * Wait for wb shutdown to finish if someone else is just
375 * running wb_shutdown(). Otherwise we could proceed to wb /
376 * bdi destruction before wb_shutdown() is finished.
377 */
378 wait_on_bit(&wb->state, WB_shutting_down, TASK_UNINTERRUPTIBLE);
379 return;
380 }
381 set_bit(WB_shutting_down, &wb->state);
382 spin_unlock_bh(&wb->work_lock);
383
384 cgwb_remove_from_bdi_list(wb);
385 /*
386 * Drain work list and shutdown the delayed_work. !WB_registered
387 * tells wb_workfn() that @wb is dying and its work_list needs to
388 * be drained no matter what.
389 */
390 mod_delayed_work(bdi_wq, &wb->dwork, 0);
391 flush_delayed_work(&wb->dwork);
392 WARN_ON(!list_empty(&wb->work_list));
393 /*
394 * Make sure bit gets cleared after shutdown is finished. Matches with
395 * the barrier provided by test_and_clear_bit() above.
396 */
397 smp_wmb();
398 clear_and_wake_up_bit(WB_shutting_down, &wb->state);
399 }
400
401 static void wb_exit(struct bdi_writeback *wb)
402 {
403 int i;
404
405 WARN_ON(delayed_work_pending(&wb->dwork));
406
407 for (i = 0; i < NR_WB_STAT_ITEMS; i++)
408 percpu_counter_destroy(&wb->stat[i]);
409
410 fprop_local_destroy_percpu(&wb->completions);
411 wb_congested_put(wb->congested);
412 if (wb != &wb->bdi->wb)
413 bdi_put(wb->bdi);
414 }
415
416 #ifdef CONFIG_CGROUP_WRITEBACK
417
418 #include <linux/memcontrol.h>
419
420 /*
421 * cgwb_lock protects bdi->cgwb_tree, bdi->cgwb_congested_tree,
422 * blkcg->cgwb_list, and memcg->cgwb_list. bdi->cgwb_tree is also RCU
423 * protected.
424 */
425 static DEFINE_SPINLOCK(cgwb_lock);
426 static struct workqueue_struct *cgwb_release_wq;
427
428 /**
429 * wb_congested_get_create - get or create a wb_congested
430 * @bdi: associated bdi
431 * @blkcg_id: ID of the associated blkcg
432 * @gfp: allocation mask
433 *
434 * Look up the wb_congested for @blkcg_id on @bdi. If missing, create one.
435 * The returned wb_congested has its reference count incremented. Returns
436 * NULL on failure.
437 */
438 struct bdi_writeback_congested *
439 wb_congested_get_create(struct backing_dev_info *bdi, int blkcg_id, gfp_t gfp)
440 {
441 struct bdi_writeback_congested *new_congested = NULL, *congested;
442 struct rb_node **node, *parent;
443 unsigned long flags;
444 retry:
445 spin_lock_irqsave(&cgwb_lock, flags);
446
447 node = &bdi->cgwb_congested_tree.rb_node;
448 parent = NULL;
449
450 while (*node != NULL) {
451 parent = *node;
452 congested = rb_entry(parent, struct bdi_writeback_congested,
453 rb_node);
454 if (congested->blkcg_id < blkcg_id)
455 node = &parent->rb_left;
456 else if (congested->blkcg_id > blkcg_id)
457 node = &parent->rb_right;
458 else
459 goto found;
460 }
461
462 if (new_congested) {
463 /* !found and storage for new one already allocated, insert */
464 congested = new_congested;
465 new_congested = NULL;
466 rb_link_node(&congested->rb_node, parent, node);
467 rb_insert_color(&congested->rb_node, &bdi->cgwb_congested_tree);
468 goto found;
469 }
470
471 spin_unlock_irqrestore(&cgwb_lock, flags);
472
473 /* allocate storage for new one and retry */
474 new_congested = kzalloc(sizeof(*new_congested), gfp);
475 if (!new_congested)
476 return NULL;
477
478 atomic_set(&new_congested->refcnt, 0);
479 new_congested->__bdi = bdi;
480 new_congested->blkcg_id = blkcg_id;
481 goto retry;
482
483 found:
484 atomic_inc(&congested->refcnt);
485 spin_unlock_irqrestore(&cgwb_lock, flags);
486 kfree(new_congested);
487 return congested;
488 }
489
490 /**
491 * wb_congested_put - put a wb_congested
492 * @congested: wb_congested to put
493 *
494 * Put @congested and destroy it if the refcnt reaches zero.
495 */
496 void wb_congested_put(struct bdi_writeback_congested *congested)
497 {
498 unsigned long flags;
499
500 local_irq_save(flags);
501 if (!atomic_dec_and_lock(&congested->refcnt, &cgwb_lock)) {
502 local_irq_restore(flags);
503 return;
504 }
505
506 /* bdi might already have been destroyed leaving @congested unlinked */
507 if (congested->__bdi) {
508 rb_erase(&congested->rb_node,
509 &congested->__bdi->cgwb_congested_tree);
510 congested->__bdi = NULL;
511 }
512
513 spin_unlock_irqrestore(&cgwb_lock, flags);
514 kfree(congested);
515 }
516
517 static void cgwb_release_workfn(struct work_struct *work)
518 {
519 struct bdi_writeback *wb = container_of(work, struct bdi_writeback,
520 release_work);
521
522 wb_shutdown(wb);
523
524 css_put(wb->memcg_css);
525 css_put(wb->blkcg_css);
526
527 fprop_local_destroy_percpu(&wb->memcg_completions);
528 percpu_ref_exit(&wb->refcnt);
529 wb_exit(wb);
530 kfree_rcu(wb, rcu);
531 }
532
533 static void cgwb_release(struct percpu_ref *refcnt)
534 {
535 struct bdi_writeback *wb = container_of(refcnt, struct bdi_writeback,
536 refcnt);
537 queue_work(cgwb_release_wq, &wb->release_work);
538 }
539
540 static void cgwb_kill(struct bdi_writeback *wb)
541 {
542 lockdep_assert_held(&cgwb_lock);
543
544 WARN_ON(!radix_tree_delete(&wb->bdi->cgwb_tree, wb->memcg_css->id));
545 list_del(&wb->memcg_node);
546 list_del(&wb->blkcg_node);
547 percpu_ref_kill(&wb->refcnt);
548 }
549
550 static void cgwb_remove_from_bdi_list(struct bdi_writeback *wb)
551 {
552 spin_lock_irq(&cgwb_lock);
553 list_del_rcu(&wb->bdi_node);
554 spin_unlock_irq(&cgwb_lock);
555 }
556
557 static int cgwb_create(struct backing_dev_info *bdi,
558 struct cgroup_subsys_state *memcg_css, gfp_t gfp)
559 {
560 struct mem_cgroup *memcg;
561 struct cgroup_subsys_state *blkcg_css;
562 struct blkcg *blkcg;
563 struct list_head *memcg_cgwb_list, *blkcg_cgwb_list;
564 struct bdi_writeback *wb;
565 unsigned long flags;
566 int ret = 0;
567
568 memcg = mem_cgroup_from_css(memcg_css);
569 blkcg_css = cgroup_get_e_css(memcg_css->cgroup, &io_cgrp_subsys);
570 blkcg = css_to_blkcg(blkcg_css);
571 memcg_cgwb_list = mem_cgroup_cgwb_list(memcg);
572 blkcg_cgwb_list = &blkcg->cgwb_list;
573
574 /* look up again under lock and discard on blkcg mismatch */
575 spin_lock_irqsave(&cgwb_lock, flags);
576 wb = radix_tree_lookup(&bdi->cgwb_tree, memcg_css->id);
577 if (wb && wb->blkcg_css != blkcg_css) {
578 cgwb_kill(wb);
579 wb = NULL;
580 }
581 spin_unlock_irqrestore(&cgwb_lock, flags);
582 if (wb)
583 goto out_put;
584
585 /* need to create a new one */
586 wb = kmalloc(sizeof(*wb), gfp);
587 if (!wb) {
588 ret = -ENOMEM;
589 goto out_put;
590 }
591
592 ret = wb_init(wb, bdi, blkcg_css->id, gfp);
593 if (ret)
594 goto err_free;
595
596 ret = percpu_ref_init(&wb->refcnt, cgwb_release, 0, gfp);
597 if (ret)
598 goto err_wb_exit;
599
600 ret = fprop_local_init_percpu(&wb->memcg_completions, gfp);
601 if (ret)
602 goto err_ref_exit;
603
604 wb->memcg_css = memcg_css;
605 wb->blkcg_css = blkcg_css;
606 INIT_WORK(&wb->release_work, cgwb_release_workfn);
607 set_bit(WB_registered, &wb->state);
608
609 /*
610 * The root wb determines the registered state of the whole bdi and
611 * memcg_cgwb_list and blkcg_cgwb_list's next pointers indicate
612 * whether they're still online. Don't link @wb if any is dead.
613 * See wb_memcg_offline() and wb_blkcg_offline().
614 */
615 ret = -ENODEV;
616 spin_lock_irqsave(&cgwb_lock, flags);
617 if (test_bit(WB_registered, &bdi->wb.state) &&
618 blkcg_cgwb_list->next && memcg_cgwb_list->next) {
619 /* we might have raced another instance of this function */
620 ret = radix_tree_insert(&bdi->cgwb_tree, memcg_css->id, wb);
621 if (!ret) {
622 list_add_tail_rcu(&wb->bdi_node, &bdi->wb_list);
623 list_add(&wb->memcg_node, memcg_cgwb_list);
624 list_add(&wb->blkcg_node, blkcg_cgwb_list);
625 css_get(memcg_css);
626 css_get(blkcg_css);
627 }
628 }
629 spin_unlock_irqrestore(&cgwb_lock, flags);
630 if (ret) {
631 if (ret == -EEXIST)
632 ret = 0;
633 goto err_fprop_exit;
634 }
635 goto out_put;
636
637 err_fprop_exit:
638 fprop_local_destroy_percpu(&wb->memcg_completions);
639 err_ref_exit:
640 percpu_ref_exit(&wb->refcnt);
641 err_wb_exit:
642 wb_exit(wb);
643 err_free:
644 kfree(wb);
645 out_put:
646 css_put(blkcg_css);
647 return ret;
648 }
649
650 /**
651 * wb_get_create - get wb for a given memcg, create if necessary
652 * @bdi: target bdi
653 * @memcg_css: cgroup_subsys_state of the target memcg (must have positive ref)
654 * @gfp: allocation mask to use
655 *
656 * Try to get the wb for @memcg_css on @bdi. If it doesn't exist, try to
657 * create one. The returned wb has its refcount incremented.
658 *
659 * This function uses css_get() on @memcg_css and thus expects its refcnt
660 * to be positive on invocation. IOW, rcu_read_lock() protection on
661 * @memcg_css isn't enough. try_get it before calling this function.
662 *
663 * A wb is keyed by its associated memcg. As blkcg implicitly enables
664 * memcg on the default hierarchy, memcg association is guaranteed to be
665 * more specific (equal or descendant to the associated blkcg) and thus can
666 * identify both the memcg and blkcg associations.
667 *
668 * Because the blkcg associated with a memcg may change as blkcg is enabled
669 * and disabled closer to root in the hierarchy, each wb keeps track of
670 * both the memcg and blkcg associated with it and verifies the blkcg on
671 * each lookup. On mismatch, the existing wb is discarded and a new one is
672 * created.
673 */
674 struct bdi_writeback *wb_get_create(struct backing_dev_info *bdi,
675 struct cgroup_subsys_state *memcg_css,
676 gfp_t gfp)
677 {
678 struct bdi_writeback *wb;
679
680 might_sleep_if(gfpflags_allow_blocking(gfp));
681
682 if (!memcg_css->parent)
683 return &bdi->wb;
684
685 do {
686 rcu_read_lock();
687 wb = radix_tree_lookup(&bdi->cgwb_tree, memcg_css->id);
688 if (wb) {
689 struct cgroup_subsys_state *blkcg_css;
690
691 /* see whether the blkcg association has changed */
692 blkcg_css = cgroup_get_e_css(memcg_css->cgroup,
693 &io_cgrp_subsys);
694 if (unlikely(wb->blkcg_css != blkcg_css ||
695 !wb_tryget(wb)))
696 wb = NULL;
697 css_put(blkcg_css);
698 }
699 rcu_read_unlock();
700 } while (!wb && !cgwb_create(bdi, memcg_css, gfp));
701
702 return wb;
703 }
704
705 static int cgwb_bdi_init(struct backing_dev_info *bdi)
706 {
707 int ret;
708
709 INIT_RADIX_TREE(&bdi->cgwb_tree, GFP_ATOMIC);
710 bdi->cgwb_congested_tree = RB_ROOT;
711
712 ret = wb_init(&bdi->wb, bdi, 1, GFP_KERNEL);
713 if (!ret) {
714 bdi->wb.memcg_css = &root_mem_cgroup->css;
715 bdi->wb.blkcg_css = blkcg_root_css;
716 }
717 return ret;
718 }
719
720 static void cgwb_bdi_unregister(struct backing_dev_info *bdi)
721 {
722 struct radix_tree_iter iter;
723 void **slot;
724 struct bdi_writeback *wb;
725
726 WARN_ON(test_bit(WB_registered, &bdi->wb.state));
727
728 spin_lock_irq(&cgwb_lock);
729 radix_tree_for_each_slot(slot, &bdi->cgwb_tree, &iter, 0)
730 cgwb_kill(*slot);
731
732 while (!list_empty(&bdi->wb_list)) {
733 wb = list_first_entry(&bdi->wb_list, struct bdi_writeback,
734 bdi_node);
735 spin_unlock_irq(&cgwb_lock);
736 wb_shutdown(wb);
737 spin_lock_irq(&cgwb_lock);
738 }
739 spin_unlock_irq(&cgwb_lock);
740 }
741
742 /**
743 * wb_memcg_offline - kill all wb's associated with a memcg being offlined
744 * @memcg: memcg being offlined
745 *
746 * Also prevents creation of any new wb's associated with @memcg.
747 */
748 void wb_memcg_offline(struct mem_cgroup *memcg)
749 {
750 LIST_HEAD(to_destroy);
751 struct list_head *memcg_cgwb_list = mem_cgroup_cgwb_list(memcg);
752 struct bdi_writeback *wb, *next;
753
754 spin_lock_irq(&cgwb_lock);
755 list_for_each_entry_safe(wb, next, memcg_cgwb_list, memcg_node)
756 cgwb_kill(wb);
757 memcg_cgwb_list->next = NULL; /* prevent new wb's */
758 spin_unlock_irq(&cgwb_lock);
759 }
760
761 /**
762 * wb_blkcg_offline - kill all wb's associated with a blkcg being offlined
763 * @blkcg: blkcg being offlined
764 *
765 * Also prevents creation of any new wb's associated with @blkcg.
766 */
767 void wb_blkcg_offline(struct blkcg *blkcg)
768 {
769 LIST_HEAD(to_destroy);
770 struct bdi_writeback *wb, *next;
771
772 spin_lock_irq(&cgwb_lock);
773 list_for_each_entry_safe(wb, next, &blkcg->cgwb_list, blkcg_node)
774 cgwb_kill(wb);
775 blkcg->cgwb_list.next = NULL; /* prevent new wb's */
776 spin_unlock_irq(&cgwb_lock);
777 }
778
779 static void cgwb_bdi_exit(struct backing_dev_info *bdi)
780 {
781 struct rb_node *rbn;
782
783 spin_lock_irq(&cgwb_lock);
784 while ((rbn = rb_first(&bdi->cgwb_congested_tree))) {
785 struct bdi_writeback_congested *congested =
786 rb_entry(rbn, struct bdi_writeback_congested, rb_node);
787
788 rb_erase(rbn, &bdi->cgwb_congested_tree);
789 congested->__bdi = NULL; /* mark @congested unlinked */
790 }
791 spin_unlock_irq(&cgwb_lock);
792 }
793
794 static void cgwb_bdi_register(struct backing_dev_info *bdi)
795 {
796 spin_lock_irq(&cgwb_lock);
797 list_add_tail_rcu(&bdi->wb.bdi_node, &bdi->wb_list);
798 spin_unlock_irq(&cgwb_lock);
799 }
800
801 static int __init cgwb_init(void)
802 {
803 /*
804 * There can be many concurrent release work items overwhelming
805 * system_wq. Put them in a separate wq and limit concurrency.
806 * There's no point in executing many of these in parallel.
807 */
808 cgwb_release_wq = alloc_workqueue("cgwb_release", 0, 1);
809 if (!cgwb_release_wq)
810 return -ENOMEM;
811
812 return 0;
813 }
814 subsys_initcall(cgwb_init);
815
816 #else /* CONFIG_CGROUP_WRITEBACK */
817
818 static int cgwb_bdi_init(struct backing_dev_info *bdi)
819 {
820 int err;
821
822 bdi->wb_congested = kzalloc(sizeof(*bdi->wb_congested), GFP_KERNEL);
823 if (!bdi->wb_congested)
824 return -ENOMEM;
825
826 atomic_set(&bdi->wb_congested->refcnt, 1);
827
828 err = wb_init(&bdi->wb, bdi, 1, GFP_KERNEL);
829 if (err) {
830 wb_congested_put(bdi->wb_congested);
831 return err;
832 }
833 return 0;
834 }
835
836 static void cgwb_bdi_unregister(struct backing_dev_info *bdi) { }
837
838 static void cgwb_bdi_exit(struct backing_dev_info *bdi)
839 {
840 wb_congested_put(bdi->wb_congested);
841 }
842
843 static void cgwb_bdi_register(struct backing_dev_info *bdi)
844 {
845 list_add_tail_rcu(&bdi->wb.bdi_node, &bdi->wb_list);
846 }
847
848 static void cgwb_remove_from_bdi_list(struct bdi_writeback *wb)
849 {
850 list_del_rcu(&wb->bdi_node);
851 }
852
853 #endif /* CONFIG_CGROUP_WRITEBACK */
854
855 static int bdi_init(struct backing_dev_info *bdi)
856 {
857 int ret;
858
859 bdi->dev = NULL;
860
861 kref_init(&bdi->refcnt);
862 bdi->min_ratio = 0;
863 bdi->max_ratio = 100;
864 bdi->max_prop_frac = FPROP_FRAC_BASE;
865 INIT_LIST_HEAD(&bdi->bdi_list);
866 INIT_LIST_HEAD(&bdi->wb_list);
867 init_waitqueue_head(&bdi->wb_waitq);
868
869 ret = cgwb_bdi_init(bdi);
870
871 return ret;
872 }
873
874 struct backing_dev_info *bdi_alloc_node(gfp_t gfp_mask, int node_id)
875 {
876 struct backing_dev_info *bdi;
877
878 bdi = kmalloc_node(sizeof(struct backing_dev_info),
879 gfp_mask | __GFP_ZERO, node_id);
880 if (!bdi)
881 return NULL;
882
883 if (bdi_init(bdi)) {
884 kfree(bdi);
885 return NULL;
886 }
887 return bdi;
888 }
889 EXPORT_SYMBOL(bdi_alloc_node);
890
891 int bdi_register_va(struct backing_dev_info *bdi, const char *fmt, va_list args)
892 {
893 struct device *dev;
894
895 if (bdi->dev) /* The driver needs to use separate queues per device */
896 return 0;
897
898 dev = device_create_vargs(bdi_class, NULL, MKDEV(0, 0), bdi, fmt, args);
899 if (IS_ERR(dev))
900 return PTR_ERR(dev);
901
902 cgwb_bdi_register(bdi);
903 bdi->dev = dev;
904
905 bdi_debug_register(bdi, dev_name(dev));
906 set_bit(WB_registered, &bdi->wb.state);
907
908 spin_lock_bh(&bdi_lock);
909 list_add_tail_rcu(&bdi->bdi_list, &bdi_list);
910 spin_unlock_bh(&bdi_lock);
911
912 trace_writeback_bdi_register(bdi);
913 return 0;
914 }
915 EXPORT_SYMBOL(bdi_register_va);
916
917 int bdi_register(struct backing_dev_info *bdi, const char *fmt, ...)
918 {
919 va_list args;
920 int ret;
921
922 va_start(args, fmt);
923 ret = bdi_register_va(bdi, fmt, args);
924 va_end(args);
925 return ret;
926 }
927 EXPORT_SYMBOL(bdi_register);
928
929 int bdi_register_owner(struct backing_dev_info *bdi, struct device *owner)
930 {
931 int rc;
932
933 rc = bdi_register(bdi, "%u:%u", MAJOR(owner->devt), MINOR(owner->devt));
934 if (rc)
935 return rc;
936 /* Leaking owner reference... */
937 WARN_ON(bdi->owner);
938 bdi->owner = owner;
939 get_device(owner);
940 return 0;
941 }
942 EXPORT_SYMBOL(bdi_register_owner);
943
944 /*
945 * Remove bdi from bdi_list, and ensure that it is no longer visible
946 */
947 static void bdi_remove_from_list(struct backing_dev_info *bdi)
948 {
949 spin_lock_bh(&bdi_lock);
950 list_del_rcu(&bdi->bdi_list);
951 spin_unlock_bh(&bdi_lock);
952
953 synchronize_rcu_expedited();
954 }
955
956 void bdi_unregister(struct backing_dev_info *bdi)
957 {
958 /* make sure nobody finds us on the bdi_list anymore */
959 bdi_remove_from_list(bdi);
960 wb_shutdown(&bdi->wb);
961 cgwb_bdi_unregister(bdi);
962
963 if (bdi->dev) {
964 bdi_debug_unregister(bdi);
965 device_unregister(bdi->dev);
966 bdi->dev = NULL;
967 }
968
969 if (bdi->owner) {
970 put_device(bdi->owner);
971 bdi->owner = NULL;
972 }
973 }
974
975 static void release_bdi(struct kref *ref)
976 {
977 struct backing_dev_info *bdi =
978 container_of(ref, struct backing_dev_info, refcnt);
979
980 if (test_bit(WB_registered, &bdi->wb.state))
981 bdi_unregister(bdi);
982 WARN_ON_ONCE(bdi->dev);
983 wb_exit(&bdi->wb);
984 cgwb_bdi_exit(bdi);
985 kfree(bdi);
986 }
987
988 void bdi_put(struct backing_dev_info *bdi)
989 {
990 kref_put(&bdi->refcnt, release_bdi);
991 }
992 EXPORT_SYMBOL(bdi_put);
993
994 static wait_queue_head_t congestion_wqh[2] = {
995 __WAIT_QUEUE_HEAD_INITIALIZER(congestion_wqh[0]),
996 __WAIT_QUEUE_HEAD_INITIALIZER(congestion_wqh[1])
997 };
998 static atomic_t nr_wb_congested[2];
999
1000 void clear_wb_congested(struct bdi_writeback_congested *congested, int sync)
1001 {
1002 wait_queue_head_t *wqh = &congestion_wqh[sync];
1003 enum wb_congested_state bit;
1004
1005 bit = sync ? WB_sync_congested : WB_async_congested;
1006 if (test_and_clear_bit(bit, &congested->state))
1007 atomic_dec(&nr_wb_congested[sync]);
1008 smp_mb__after_atomic();
1009 if (waitqueue_active(wqh))
1010 wake_up(wqh);
1011 }
1012 EXPORT_SYMBOL(clear_wb_congested);
1013
1014 void set_wb_congested(struct bdi_writeback_congested *congested, int sync)
1015 {
1016 enum wb_congested_state bit;
1017
1018 bit = sync ? WB_sync_congested : WB_async_congested;
1019 if (!test_and_set_bit(bit, &congested->state))
1020 atomic_inc(&nr_wb_congested[sync]);
1021 }
1022 EXPORT_SYMBOL(set_wb_congested);
1023
1024 /**
1025 * congestion_wait - wait for a backing_dev to become uncongested
1026 * @sync: SYNC or ASYNC IO
1027 * @timeout: timeout in jiffies
1028 *
1029 * Waits for up to @timeout jiffies for a backing_dev (any backing_dev) to exit
1030 * write congestion. If no backing_devs are congested then just wait for the
1031 * next write to be completed.
1032 */
1033 long congestion_wait(int sync, long timeout)
1034 {
1035 long ret;
1036 unsigned long start = jiffies;
1037 DEFINE_WAIT(wait);
1038 wait_queue_head_t *wqh = &congestion_wqh[sync];
1039
1040 prepare_to_wait(wqh, &wait, TASK_UNINTERRUPTIBLE);
1041 ret = io_schedule_timeout(timeout);
1042 finish_wait(wqh, &wait);
1043
1044 trace_writeback_congestion_wait(jiffies_to_usecs(timeout),
1045 jiffies_to_usecs(jiffies - start));
1046
1047 return ret;
1048 }
1049 EXPORT_SYMBOL(congestion_wait);
1050
1051 /**
1052 * wait_iff_congested - Conditionally wait for a backing_dev to become uncongested or a pgdat to complete writes
1053 * @pgdat: A pgdat to check if it is heavily congested
1054 * @sync: SYNC or ASYNC IO
1055 * @timeout: timeout in jiffies
1056 *
1057 * In the event of a congested backing_dev (any backing_dev) and the given
1058 * @pgdat has experienced recent congestion, this waits for up to @timeout
1059 * jiffies for either a BDI to exit congestion of the given @sync queue
1060 * or a write to complete.
1061 *
1062 * In the absence of pgdat congestion, cond_resched() is called to yield
1063 * the processor if necessary but otherwise does not sleep.
1064 *
1065 * The return value is 0 if the sleep is for the full timeout. Otherwise,
1066 * it is the number of jiffies that were still remaining when the function
1067 * returned. return_value == timeout implies the function did not sleep.
1068 */
1069 long wait_iff_congested(struct pglist_data *pgdat, int sync, long timeout)
1070 {
1071 long ret;
1072 unsigned long start = jiffies;
1073 DEFINE_WAIT(wait);
1074 wait_queue_head_t *wqh = &congestion_wqh[sync];
1075
1076 /*
1077 * If there is no congestion, or heavy congestion is not being
1078 * encountered in the current pgdat, yield if necessary instead
1079 * of sleeping on the congestion queue
1080 */
1081 if (atomic_read(&nr_wb_congested[sync]) == 0 ||
1082 !test_bit(PGDAT_CONGESTED, &pgdat->flags)) {
1083 cond_resched();
1084
1085 /* In case we scheduled, work out time remaining */
1086 ret = timeout - (jiffies - start);
1087 if (ret < 0)
1088 ret = 0;
1089
1090 goto out;
1091 }
1092
1093 /* Sleep until uncongested or a write happens */
1094 prepare_to_wait(wqh, &wait, TASK_UNINTERRUPTIBLE);
1095 ret = io_schedule_timeout(timeout);
1096 finish_wait(wqh, &wait);
1097
1098 out:
1099 trace_writeback_wait_iff_congested(jiffies_to_usecs(timeout),
1100 jiffies_to_usecs(jiffies - start));
1101
1102 return ret;
1103 }
1104 EXPORT_SYMBOL(wait_iff_congested);