backing-dev.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858
  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. static atomic_long_t bdi_seq = ATOMIC_LONG_INIT(0);
  14. struct backing_dev_info default_backing_dev_info = {
  15. .name = "default",
  16. .ra_pages = VM_MAX_READAHEAD * 1024 / PAGE_CACHE_SIZE,
  17. .state = 0,
  18. .capabilities = BDI_CAP_MAP_COPY,
  19. };
  20. EXPORT_SYMBOL_GPL(default_backing_dev_info);
  21. struct backing_dev_info noop_backing_dev_info = {
  22. .name = "noop",
  23. .capabilities = BDI_CAP_NO_ACCT_AND_WRITEBACK,
  24. };
  25. EXPORT_SYMBOL_GPL(noop_backing_dev_info);
  26. static struct class *bdi_class;
  27. /*
  28. * bdi_lock protects updates to bdi_list and bdi_pending_list, as well as
  29. * reader side protection for bdi_pending_list. bdi_list has RCU reader side
  30. * locking.
  31. */
  32. DEFINE_SPINLOCK(bdi_lock);
  33. LIST_HEAD(bdi_list);
  34. LIST_HEAD(bdi_pending_list);
  35. void bdi_lock_two(struct bdi_writeback *wb1, struct bdi_writeback *wb2)
  36. {
  37. if (wb1 < wb2) {
  38. spin_lock(&wb1->list_lock);
  39. spin_lock_nested(&wb2->list_lock, 1);
  40. } else {
  41. spin_lock(&wb2->list_lock);
  42. spin_lock_nested(&wb1->list_lock, 1);
  43. }
  44. }
  45. #ifdef CONFIG_DEBUG_FS
  46. #include <linux/debugfs.h>
  47. #include <linux/seq_file.h>
  48. static struct dentry *bdi_debug_root;
  49. static void bdi_debug_init(void)
  50. {
  51. bdi_debug_root = debugfs_create_dir("bdi", NULL);
  52. }
  53. static int bdi_debug_stats_show(struct seq_file *m, void *v)
  54. {
  55. struct backing_dev_info *bdi = m->private;
  56. struct bdi_writeback *wb = &bdi->wb;
  57. unsigned long background_thresh;
  58. unsigned long dirty_thresh;
  59. unsigned long bdi_thresh;
  60. unsigned long nr_dirty, nr_io, nr_more_io;
  61. struct inode *inode;
  62. nr_dirty = nr_io = nr_more_io = 0;
  63. spin_lock(&wb->list_lock);
  64. list_for_each_entry(inode, &wb->b_dirty, i_wb_list)
  65. nr_dirty++;
  66. list_for_each_entry(inode, &wb->b_io, i_wb_list)
  67. nr_io++;
  68. list_for_each_entry(inode, &wb->b_more_io, i_wb_list)
  69. nr_more_io++;
  70. spin_unlock(&wb->list_lock);
  71. global_dirty_limits(&background_thresh, &dirty_thresh);
  72. bdi_thresh = bdi_dirty_limit(bdi, dirty_thresh);
  73. #define K(x) ((x) << (PAGE_SHIFT - 10))
  74. seq_printf(m,
  75. "BdiWriteback: %10lu kB\n"
  76. "BdiReclaimable: %10lu kB\n"
  77. "BdiDirtyThresh: %10lu kB\n"
  78. "DirtyThresh: %10lu kB\n"
  79. "BackgroundThresh: %10lu kB\n"
  80. "BdiDirtied: %10lu kB\n"
  81. "BdiWritten: %10lu kB\n"
  82. "BdiWriteBandwidth: %10lu kBps\n"
  83. "b_dirty: %10lu\n"
  84. "b_io: %10lu\n"
  85. "b_more_io: %10lu\n"
  86. "bdi_list: %10u\n"
  87. "state: %10lx\n",
  88. (unsigned long) K(bdi_stat(bdi, BDI_WRITEBACK)),
  89. (unsigned long) K(bdi_stat(bdi, BDI_RECLAIMABLE)),
  90. K(bdi_thresh),
  91. K(dirty_thresh),
  92. K(background_thresh),
  93. (unsigned long) K(bdi_stat(bdi, BDI_DIRTIED)),
  94. (unsigned long) K(bdi_stat(bdi, BDI_WRITTEN)),
  95. (unsigned long) K(bdi->write_bandwidth),
  96. nr_dirty,
  97. nr_io,
  98. nr_more_io,
  99. !list_empty(&bdi->bdi_list), bdi->state);
  100. #undef K
  101. return 0;
  102. }
  103. static int bdi_debug_stats_open(struct inode *inode, struct file *file)
  104. {
  105. return single_open(file, bdi_debug_stats_show, inode->i_private);
  106. }
  107. static const struct file_operations bdi_debug_stats_fops = {
  108. .open = bdi_debug_stats_open,
  109. .read = seq_read,
  110. .llseek = seq_lseek,
  111. .release = single_release,
  112. };
  113. static void bdi_debug_register(struct backing_dev_info *bdi, const char *name)
  114. {
  115. bdi->debug_dir = debugfs_create_dir(name, bdi_debug_root);
  116. bdi->debug_stats = debugfs_create_file("stats", 0444, bdi->debug_dir,
  117. bdi, &bdi_debug_stats_fops);
  118. }
  119. static void bdi_debug_unregister(struct backing_dev_info *bdi)
  120. {
  121. debugfs_remove(bdi->debug_stats);
  122. debugfs_remove(bdi->debug_dir);
  123. }
  124. #else
  125. static inline void bdi_debug_init(void)
  126. {
  127. }
  128. static inline void bdi_debug_register(struct backing_dev_info *bdi,
  129. const char *name)
  130. {
  131. }
  132. static inline void bdi_debug_unregister(struct backing_dev_info *bdi)
  133. {
  134. }
  135. #endif
  136. static ssize_t read_ahead_kb_store(struct device *dev,
  137. struct device_attribute *attr,
  138. const char *buf, size_t count)
  139. {
  140. struct backing_dev_info *bdi = dev_get_drvdata(dev);
  141. unsigned long read_ahead_kb;
  142. ssize_t ret;
  143. ret = kstrtoul(buf, 10, &read_ahead_kb);
  144. if (ret < 0)
  145. return ret;
  146. bdi->ra_pages = read_ahead_kb >> (PAGE_SHIFT - 10);
  147. return count;
  148. }
  149. #define K(pages) ((pages) << (PAGE_SHIFT - 10))
  150. #define BDI_SHOW(name, expr) \
  151. static ssize_t name##_show(struct device *dev, \
  152. struct device_attribute *attr, char *page) \
  153. { \
  154. struct backing_dev_info *bdi = dev_get_drvdata(dev); \
  155. \
  156. return snprintf(page, PAGE_SIZE-1, "%lld\n", (long long)expr); \
  157. }
  158. BDI_SHOW(read_ahead_kb, K(bdi->ra_pages))
  159. static ssize_t min_ratio_store(struct device *dev,
  160. struct device_attribute *attr, const char *buf, size_t count)
  161. {
  162. struct backing_dev_info *bdi = dev_get_drvdata(dev);
  163. unsigned int ratio;
  164. ssize_t ret;
  165. ret = kstrtouint(buf, 10, &ratio);
  166. if (ret < 0)
  167. return ret;
  168. ret = bdi_set_min_ratio(bdi, ratio);
  169. if (!ret)
  170. ret = count;
  171. return ret;
  172. }
  173. BDI_SHOW(min_ratio, bdi->min_ratio)
  174. static ssize_t max_ratio_store(struct device *dev,
  175. struct device_attribute *attr, const char *buf, size_t count)
  176. {
  177. struct backing_dev_info *bdi = dev_get_drvdata(dev);
  178. unsigned int ratio;
  179. ssize_t ret;
  180. ret = kstrtouint(buf, 10, &ratio);
  181. if (ret < 0)
  182. return ret;
  183. ret = bdi_set_max_ratio(bdi, ratio);
  184. if (!ret)
  185. ret = count;
  186. return ret;
  187. }
  188. BDI_SHOW(max_ratio, bdi->max_ratio)
  189. #define __ATTR_RW(attr) __ATTR(attr, 0644, attr##_show, attr##_store)
  190. static struct device_attribute bdi_dev_attrs[] = {
  191. __ATTR_RW(read_ahead_kb),
  192. __ATTR_RW(min_ratio),
  193. __ATTR_RW(max_ratio),
  194. __ATTR_NULL,
  195. };
  196. static __init int bdi_class_init(void)
  197. {
  198. bdi_class = class_create(THIS_MODULE, "bdi");
  199. if (IS_ERR(bdi_class))
  200. return PTR_ERR(bdi_class);
  201. bdi_class->dev_attrs = bdi_dev_attrs;
  202. bdi_debug_init();
  203. return 0;
  204. }
  205. postcore_initcall(bdi_class_init);
  206. static int __init default_bdi_init(void)
  207. {
  208. int err;
  209. err = bdi_init(&default_backing_dev_info);
  210. if (!err)
  211. bdi_register(&default_backing_dev_info, NULL, "default");
  212. err = bdi_init(&noop_backing_dev_info);
  213. return err;
  214. }
  215. subsys_initcall(default_bdi_init);
  216. int bdi_has_dirty_io(struct backing_dev_info *bdi)
  217. {
  218. return wb_has_dirty_io(&bdi->wb);
  219. }
  220. static void wakeup_timer_fn(unsigned long data)
  221. {
  222. struct backing_dev_info *bdi = (struct backing_dev_info *)data;
  223. spin_lock_bh(&bdi->wb_lock);
  224. if (bdi->wb.task) {
  225. trace_writeback_wake_thread(bdi);
  226. wake_up_process(bdi->wb.task);
  227. } else if (bdi->dev) {
  228. /*
  229. * When bdi tasks are inactive for long time, they are killed.
  230. * In this case we have to wake-up the forker thread which
  231. * should create and run the bdi thread.
  232. */
  233. trace_writeback_wake_forker_thread(bdi);
  234. wake_up_process(default_backing_dev_info.wb.task);
  235. }
  236. spin_unlock_bh(&bdi->wb_lock);
  237. }
  238. /*
  239. * This function is used when the first inode for this bdi is marked dirty. It
  240. * wakes-up the corresponding bdi thread which should then take care of the
  241. * periodic background write-out of dirty inodes. Since the write-out would
  242. * starts only 'dirty_writeback_interval' centisecs from now anyway, we just
  243. * set up a timer which wakes the bdi thread up later.
  244. *
  245. * Note, we wouldn't bother setting up the timer, but this function is on the
  246. * fast-path (used by '__mark_inode_dirty()'), so we save few context switches
  247. * by delaying the wake-up.
  248. */
  249. void bdi_wakeup_thread_delayed(struct backing_dev_info *bdi)
  250. {
  251. unsigned long timeout;
  252. timeout = msecs_to_jiffies(dirty_writeback_interval * 10);
  253. mod_timer(&bdi->wb.wakeup_timer, jiffies + timeout);
  254. }
  255. /*
  256. * Calculate the longest interval (jiffies) bdi threads are allowed to be
  257. * inactive.
  258. */
  259. static unsigned long bdi_longest_inactive(void)
  260. {
  261. unsigned long interval;
  262. interval = msecs_to_jiffies(dirty_writeback_interval * 10);
  263. return max(5UL * 60 * HZ, interval);
  264. }
  265. /*
  266. * Clear pending bit and wakeup anybody waiting for flusher thread creation or
  267. * shutdown
  268. */
  269. static void bdi_clear_pending(struct backing_dev_info *bdi)
  270. {
  271. clear_bit(BDI_pending, &bdi->state);
  272. smp_mb__after_clear_bit();
  273. wake_up_bit(&bdi->state, BDI_pending);
  274. }
  275. static int bdi_forker_thread(void *ptr)
  276. {
  277. struct bdi_writeback *me = ptr;
  278. current->flags |= PF_SWAPWRITE;
  279. set_freezable();
  280. /*
  281. * Our parent may run at a different priority, just set us to normal
  282. */
  283. set_user_nice(current, 0);
  284. for (;;) {
  285. struct task_struct *task = NULL;
  286. struct backing_dev_info *bdi;
  287. enum {
  288. NO_ACTION, /* Nothing to do */
  289. FORK_THREAD, /* Fork bdi thread */
  290. KILL_THREAD, /* Kill inactive bdi thread */
  291. } action = NO_ACTION;
  292. /*
  293. * Temporary measure, we want to make sure we don't see
  294. * dirty data on the default backing_dev_info
  295. */
  296. if (wb_has_dirty_io(me) || !list_empty(&me->bdi->work_list)) {
  297. del_timer(&me->wakeup_timer);
  298. wb_do_writeback(me, 0);
  299. }
  300. spin_lock_bh(&bdi_lock);
  301. /*
  302. * In the following loop we are going to check whether we have
  303. * some work to do without any synchronization with tasks
  304. * waking us up to do work for them. Set the task state here
  305. * so that we don't miss wakeups after verifying conditions.
  306. */
  307. set_current_state(TASK_INTERRUPTIBLE);
  308. list_for_each_entry(bdi, &bdi_list, bdi_list) {
  309. bool have_dirty_io;
  310. if (!bdi_cap_writeback_dirty(bdi) ||
  311. bdi_cap_flush_forker(bdi))
  312. continue;
  313. WARN(!test_bit(BDI_registered, &bdi->state),
  314. "bdi %p/%s is not registered!\n", bdi, bdi->name);
  315. have_dirty_io = !list_empty(&bdi->work_list) ||
  316. wb_has_dirty_io(&bdi->wb);
  317. /*
  318. * If the bdi has work to do, but the thread does not
  319. * exist - create it.
  320. */
  321. if (!bdi->wb.task && have_dirty_io) {
  322. /*
  323. * Set the pending bit - if someone will try to
  324. * unregister this bdi - it'll wait on this bit.
  325. */
  326. set_bit(BDI_pending, &bdi->state);
  327. action = FORK_THREAD;
  328. break;
  329. }
  330. spin_lock(&bdi->wb_lock);
  331. /*
  332. * If there is no work to do and the bdi thread was
  333. * inactive long enough - kill it. The wb_lock is taken
  334. * to make sure no-one adds more work to this bdi and
  335. * wakes the bdi thread up.
  336. */
  337. if (bdi->wb.task && !have_dirty_io &&
  338. time_after(jiffies, bdi->wb.last_active +
  339. bdi_longest_inactive())) {
  340. task = bdi->wb.task;
  341. bdi->wb.task = NULL;
  342. spin_unlock(&bdi->wb_lock);
  343. set_bit(BDI_pending, &bdi->state);
  344. action = KILL_THREAD;
  345. break;
  346. }
  347. spin_unlock(&bdi->wb_lock);
  348. }
  349. spin_unlock_bh(&bdi_lock);
  350. /* Keep working if default bdi still has things to do */
  351. if (!list_empty(&me->bdi->work_list))
  352. __set_current_state(TASK_RUNNING);
  353. switch (action) {
  354. case FORK_THREAD:
  355. __set_current_state(TASK_RUNNING);
  356. task = kthread_create(bdi_writeback_thread, &bdi->wb,
  357. "flush-%s", dev_name(bdi->dev));
  358. if (IS_ERR(task)) {
  359. /*
  360. * If thread creation fails, force writeout of
  361. * the bdi from the thread. Hopefully 1024 is
  362. * large enough for efficient IO.
  363. */
  364. writeback_inodes_wb(&bdi->wb, 1024,
  365. WB_REASON_FORKER_THREAD);
  366. } else {
  367. /*
  368. * The spinlock makes sure we do not lose
  369. * wake-ups when racing with 'bdi_queue_work()'.
  370. * And as soon as the bdi thread is visible, we
  371. * can start it.
  372. */
  373. spin_lock_bh(&bdi->wb_lock);
  374. bdi->wb.task = task;
  375. spin_unlock_bh(&bdi->wb_lock);
  376. wake_up_process(task);
  377. }
  378. bdi_clear_pending(bdi);
  379. break;
  380. case KILL_THREAD:
  381. __set_current_state(TASK_RUNNING);
  382. kthread_stop(task);
  383. bdi_clear_pending(bdi);
  384. break;
  385. case NO_ACTION:
  386. if (!wb_has_dirty_io(me) || !dirty_writeback_interval)
  387. /*
  388. * There are no dirty data. The only thing we
  389. * should now care about is checking for
  390. * inactive bdi threads and killing them. Thus,
  391. * let's sleep for longer time, save energy and
  392. * be friendly for battery-driven devices.
  393. */
  394. schedule_timeout(bdi_longest_inactive());
  395. else
  396. schedule_timeout(msecs_to_jiffies(dirty_writeback_interval * 10));
  397. try_to_freeze();
  398. break;
  399. }
  400. }
  401. return 0;
  402. }
  403. /*
  404. * Remove bdi from bdi_list, and ensure that it is no longer visible
  405. */
  406. static void bdi_remove_from_list(struct backing_dev_info *bdi)
  407. {
  408. spin_lock_bh(&bdi_lock);
  409. list_del_rcu(&bdi->bdi_list);
  410. spin_unlock_bh(&bdi_lock);
  411. synchronize_rcu_expedited();
  412. }
  413. int bdi_register(struct backing_dev_info *bdi, struct device *parent,
  414. const char *fmt, ...)
  415. {
  416. va_list args;
  417. struct device *dev;
  418. if (bdi->dev) /* The driver needs to use separate queues per device */
  419. return 0;
  420. va_start(args, fmt);
  421. dev = device_create_vargs(bdi_class, parent, MKDEV(0, 0), bdi, fmt, args);
  422. va_end(args);
  423. if (IS_ERR(dev))
  424. return PTR_ERR(dev);
  425. bdi->dev = dev;
  426. /*
  427. * Just start the forker thread for our default backing_dev_info,
  428. * and add other bdi's to the list. They will get a thread created
  429. * on-demand when they need it.
  430. */
  431. if (bdi_cap_flush_forker(bdi)) {
  432. struct bdi_writeback *wb = &bdi->wb;
  433. wb->task = kthread_run(bdi_forker_thread, wb, "bdi-%s",
  434. dev_name(dev));
  435. if (IS_ERR(wb->task))
  436. return PTR_ERR(wb->task);
  437. }
  438. bdi_debug_register(bdi, dev_name(dev));
  439. set_bit(BDI_registered, &bdi->state);
  440. spin_lock_bh(&bdi_lock);
  441. list_add_tail_rcu(&bdi->bdi_list, &bdi_list);
  442. spin_unlock_bh(&bdi_lock);
  443. trace_writeback_bdi_register(bdi);
  444. return 0;
  445. }
  446. EXPORT_SYMBOL(bdi_register);
  447. int bdi_register_dev(struct backing_dev_info *bdi, dev_t dev)
  448. {
  449. return bdi_register(bdi, NULL, "%u:%u", MAJOR(dev), MINOR(dev));
  450. }
  451. EXPORT_SYMBOL(bdi_register_dev);
  452. /*
  453. * Remove bdi from the global list and shutdown any threads we have running
  454. */
  455. static void bdi_wb_shutdown(struct backing_dev_info *bdi)
  456. {
  457. struct task_struct *task;
  458. if (!bdi_cap_writeback_dirty(bdi))
  459. return;
  460. /*
  461. * Make sure nobody finds us on the bdi_list anymore
  462. */
  463. bdi_remove_from_list(bdi);
  464. /*
  465. * If setup is pending, wait for that to complete first
  466. */
  467. wait_on_bit(&bdi->state, BDI_pending, bdi_sched_wait,
  468. TASK_UNINTERRUPTIBLE);
  469. /*
  470. * Finally, kill the kernel thread. We don't need to be RCU
  471. * safe anymore, since the bdi is gone from visibility.
  472. */
  473. spin_lock_bh(&bdi->wb_lock);
  474. task = bdi->wb.task;
  475. bdi->wb.task = NULL;
  476. spin_unlock_bh(&bdi->wb_lock);
  477. if (task)
  478. kthread_stop(task);
  479. }
  480. /*
  481. * This bdi is going away now, make sure that no super_blocks point to it
  482. */
  483. static void bdi_prune_sb(struct backing_dev_info *bdi)
  484. {
  485. struct super_block *sb;
  486. spin_lock(&sb_lock);
  487. list_for_each_entry(sb, &super_blocks, s_list) {
  488. if (sb->s_bdi == bdi)
  489. sb->s_bdi = &default_backing_dev_info;
  490. }
  491. spin_unlock(&sb_lock);
  492. }
  493. void bdi_unregister(struct backing_dev_info *bdi)
  494. {
  495. struct device *dev = bdi->dev;
  496. if (dev) {
  497. bdi_set_min_ratio(bdi, 0);
  498. trace_writeback_bdi_unregister(bdi);
  499. bdi_prune_sb(bdi);
  500. del_timer_sync(&bdi->wb.wakeup_timer);
  501. if (!bdi_cap_flush_forker(bdi))
  502. bdi_wb_shutdown(bdi);
  503. bdi_debug_unregister(bdi);
  504. spin_lock_bh(&bdi->wb_lock);
  505. bdi->dev = NULL;
  506. spin_unlock_bh(&bdi->wb_lock);
  507. device_unregister(dev);
  508. }
  509. }
  510. EXPORT_SYMBOL(bdi_unregister);
  511. static void bdi_wb_init(struct bdi_writeback *wb, struct backing_dev_info *bdi)
  512. {
  513. memset(wb, 0, sizeof(*wb));
  514. wb->bdi = bdi;
  515. wb->last_old_flush = jiffies;
  516. INIT_LIST_HEAD(&wb->b_dirty);
  517. INIT_LIST_HEAD(&wb->b_io);
  518. INIT_LIST_HEAD(&wb->b_more_io);
  519. spin_lock_init(&wb->list_lock);
  520. setup_timer(&wb->wakeup_timer, wakeup_timer_fn, (unsigned long)bdi);
  521. }
  522. /*
  523. * Initial write bandwidth: 100 MB/s
  524. */
  525. #define INIT_BW (100 << (20 - PAGE_SHIFT))
  526. int bdi_init(struct backing_dev_info *bdi)
  527. {
  528. int i, err;
  529. bdi->dev = NULL;
  530. bdi->min_ratio = 0;
  531. bdi->max_ratio = 100;
  532. bdi->max_prop_frac = FPROP_FRAC_BASE;
  533. spin_lock_init(&bdi->wb_lock);
  534. INIT_LIST_HEAD(&bdi->bdi_list);
  535. INIT_LIST_HEAD(&bdi->work_list);
  536. bdi_wb_init(&bdi->wb, bdi);
  537. for (i = 0; i < NR_BDI_STAT_ITEMS; i++) {
  538. err = percpu_counter_init(&bdi->bdi_stat[i], 0);
  539. if (err)
  540. goto err;
  541. }
  542. bdi->dirty_exceeded = 0;
  543. bdi->bw_time_stamp = jiffies;
  544. bdi->written_stamp = 0;
  545. bdi->balanced_dirty_ratelimit = INIT_BW;
  546. bdi->dirty_ratelimit = INIT_BW;
  547. bdi->write_bandwidth = INIT_BW;
  548. bdi->avg_write_bandwidth = INIT_BW;
  549. err = fprop_local_init_percpu(&bdi->completions);
  550. if (err) {
  551. err:
  552. while (i--)
  553. percpu_counter_destroy(&bdi->bdi_stat[i]);
  554. }
  555. return err;
  556. }
  557. EXPORT_SYMBOL(bdi_init);
  558. void bdi_destroy(struct backing_dev_info *bdi)
  559. {
  560. int i;
  561. /*
  562. * Splice our entries to the default_backing_dev_info, if this
  563. * bdi disappears
  564. */
  565. if (bdi_has_dirty_io(bdi)) {
  566. struct bdi_writeback *dst = &default_backing_dev_info.wb;
  567. bdi_lock_two(&bdi->wb, dst);
  568. list_splice(&bdi->wb.b_dirty, &dst->b_dirty);
  569. list_splice(&bdi->wb.b_io, &dst->b_io);
  570. list_splice(&bdi->wb.b_more_io, &dst->b_more_io);
  571. spin_unlock(&bdi->wb.list_lock);
  572. spin_unlock(&dst->list_lock);
  573. }
  574. bdi_unregister(bdi);
  575. /*
  576. * If bdi_unregister() had already been called earlier, the
  577. * wakeup_timer could still be armed because bdi_prune_sb()
  578. * can race with the bdi_wakeup_thread_delayed() calls from
  579. * __mark_inode_dirty().
  580. */
  581. del_timer_sync(&bdi->wb.wakeup_timer);
  582. for (i = 0; i < NR_BDI_STAT_ITEMS; i++)
  583. percpu_counter_destroy(&bdi->bdi_stat[i]);
  584. fprop_local_destroy_percpu(&bdi->completions);
  585. }
  586. EXPORT_SYMBOL(bdi_destroy);
  587. /*
  588. * For use from filesystems to quickly init and register a bdi associated
  589. * with dirty writeback
  590. */
  591. int bdi_setup_and_register(struct backing_dev_info *bdi, char *name,
  592. unsigned int cap)
  593. {
  594. char tmp[32];
  595. int err;
  596. bdi->name = name;
  597. bdi->capabilities = cap;
  598. err = bdi_init(bdi);
  599. if (err)
  600. return err;
  601. sprintf(tmp, "%.28s%s", name, "-%d");
  602. err = bdi_register(bdi, NULL, tmp, atomic_long_inc_return(&bdi_seq));
  603. if (err) {
  604. bdi_destroy(bdi);
  605. return err;
  606. }
  607. return 0;
  608. }
  609. EXPORT_SYMBOL(bdi_setup_and_register);
  610. static wait_queue_head_t congestion_wqh[2] = {
  611. __WAIT_QUEUE_HEAD_INITIALIZER(congestion_wqh[0]),
  612. __WAIT_QUEUE_HEAD_INITIALIZER(congestion_wqh[1])
  613. };
  614. static atomic_t nr_bdi_congested[2];
  615. void clear_bdi_congested(struct backing_dev_info *bdi, int sync)
  616. {
  617. enum bdi_state bit;
  618. wait_queue_head_t *wqh = &congestion_wqh[sync];
  619. bit = sync ? BDI_sync_congested : BDI_async_congested;
  620. if (test_and_clear_bit(bit, &bdi->state))
  621. atomic_dec(&nr_bdi_congested[sync]);
  622. smp_mb__after_clear_bit();
  623. if (waitqueue_active(wqh))
  624. wake_up(wqh);
  625. }
  626. EXPORT_SYMBOL(clear_bdi_congested);
  627. void set_bdi_congested(struct backing_dev_info *bdi, int sync)
  628. {
  629. enum bdi_state bit;
  630. bit = sync ? BDI_sync_congested : BDI_async_congested;
  631. if (!test_and_set_bit(bit, &bdi->state))
  632. atomic_inc(&nr_bdi_congested[sync]);
  633. }
  634. EXPORT_SYMBOL(set_bdi_congested);
  635. /**
  636. * congestion_wait - wait for a backing_dev to become uncongested
  637. * @sync: SYNC or ASYNC IO
  638. * @timeout: timeout in jiffies
  639. *
  640. * Waits for up to @timeout jiffies for a backing_dev (any backing_dev) to exit
  641. * write congestion. If no backing_devs are congested then just wait for the
  642. * next write to be completed.
  643. */
  644. long congestion_wait(int sync, long timeout)
  645. {
  646. long ret;
  647. unsigned long start = jiffies;
  648. DEFINE_WAIT(wait);
  649. wait_queue_head_t *wqh = &congestion_wqh[sync];
  650. prepare_to_wait(wqh, &wait, TASK_UNINTERRUPTIBLE);
  651. ret = io_schedule_timeout(timeout);
  652. finish_wait(wqh, &wait);
  653. trace_writeback_congestion_wait(jiffies_to_usecs(timeout),
  654. jiffies_to_usecs(jiffies - start));
  655. return ret;
  656. }
  657. EXPORT_SYMBOL(congestion_wait);
  658. /**
  659. * wait_iff_congested - Conditionally wait for a backing_dev to become uncongested or a zone to complete writes
  660. * @zone: A zone to check if it is heavily congested
  661. * @sync: SYNC or ASYNC IO
  662. * @timeout: timeout in jiffies
  663. *
  664. * In the event of a congested backing_dev (any backing_dev) and the given
  665. * @zone has experienced recent congestion, this waits for up to @timeout
  666. * jiffies for either a BDI to exit congestion of the given @sync queue
  667. * or a write to complete.
  668. *
  669. * In the absence of zone congestion, cond_resched() is called to yield
  670. * the processor if necessary but otherwise does not sleep.
  671. *
  672. * The return value is 0 if the sleep is for the full timeout. Otherwise,
  673. * it is the number of jiffies that were still remaining when the function
  674. * returned. return_value == timeout implies the function did not sleep.
  675. */
  676. long wait_iff_congested(struct zone *zone, int sync, long timeout)
  677. {
  678. long ret;
  679. unsigned long start = jiffies;
  680. DEFINE_WAIT(wait);
  681. wait_queue_head_t *wqh = &congestion_wqh[sync];
  682. /*
  683. * If there is no congestion, or heavy congestion is not being
  684. * encountered in the current zone, yield if necessary instead
  685. * of sleeping on the congestion queue
  686. */
  687. if (atomic_read(&nr_bdi_congested[sync]) == 0 ||
  688. !zone_is_reclaim_congested(zone)) {
  689. cond_resched();
  690. /* In case we scheduled, work out time remaining */
  691. ret = timeout - (jiffies - start);
  692. if (ret < 0)
  693. ret = 0;
  694. goto out;
  695. }
  696. /* Sleep until uncongested or a write happens */
  697. prepare_to_wait(wqh, &wait, TASK_UNINTERRUPTIBLE);
  698. ret = io_schedule_timeout(timeout);
  699. finish_wait(wqh, &wait);
  700. out:
  701. trace_writeback_wait_iff_congested(jiffies_to_usecs(timeout),
  702. jiffies_to_usecs(jiffies - start));
  703. return ret;
  704. }
  705. EXPORT_SYMBOL(wait_iff_congested);
  706. int pdflush_proc_obsolete(struct ctl_table *table, int write,
  707. void __user *buffer, size_t *lenp, loff_t *ppos)
  708. {
  709. char kbuf[] = "0\n";
  710. if (*ppos) {
  711. *lenp = 0;
  712. return 0;
  713. }
  714. if (copy_to_user(buffer, kbuf, sizeof(kbuf)))
  715. return -EFAULT;
  716. printk_once(KERN_WARNING "%s exported in /proc is scheduled for removal\n",
  717. table->procname);
  718. *lenp = 2;
  719. *ppos += *lenp;
  720. return 2;
  721. }