backing-dev.c 27 KB

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