backing-dev.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869
  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. static ssize_t stable_pages_required_show(struct device *dev,
  190. struct device_attribute *attr,
  191. char *page)
  192. {
  193. struct backing_dev_info *bdi = dev_get_drvdata(dev);
  194. return snprintf(page, PAGE_SIZE-1, "%d\n",
  195. bdi_cap_stable_pages_required(bdi) ? 1 : 0);
  196. }
  197. #define __ATTR_RW(attr) __ATTR(attr, 0644, attr##_show, attr##_store)
  198. static struct device_attribute bdi_dev_attrs[] = {
  199. __ATTR_RW(read_ahead_kb),
  200. __ATTR_RW(min_ratio),
  201. __ATTR_RW(max_ratio),
  202. __ATTR_RO(stable_pages_required),
  203. __ATTR_NULL,
  204. };
  205. static __init int bdi_class_init(void)
  206. {
  207. bdi_class = class_create(THIS_MODULE, "bdi");
  208. if (IS_ERR(bdi_class))
  209. return PTR_ERR(bdi_class);
  210. bdi_class->dev_attrs = bdi_dev_attrs;
  211. bdi_debug_init();
  212. return 0;
  213. }
  214. postcore_initcall(bdi_class_init);
  215. static int __init default_bdi_init(void)
  216. {
  217. int err;
  218. err = bdi_init(&default_backing_dev_info);
  219. if (!err)
  220. bdi_register(&default_backing_dev_info, NULL, "default");
  221. err = bdi_init(&noop_backing_dev_info);
  222. return err;
  223. }
  224. subsys_initcall(default_bdi_init);
  225. int bdi_has_dirty_io(struct backing_dev_info *bdi)
  226. {
  227. return wb_has_dirty_io(&bdi->wb);
  228. }
  229. static void wakeup_timer_fn(unsigned long data)
  230. {
  231. struct backing_dev_info *bdi = (struct backing_dev_info *)data;
  232. spin_lock_bh(&bdi->wb_lock);
  233. if (bdi->wb.task) {
  234. trace_writeback_wake_thread(bdi);
  235. wake_up_process(bdi->wb.task);
  236. } else if (bdi->dev) {
  237. /*
  238. * When bdi tasks are inactive for long time, they are killed.
  239. * In this case we have to wake-up the forker thread which
  240. * should create and run the bdi thread.
  241. */
  242. trace_writeback_wake_forker_thread(bdi);
  243. wake_up_process(default_backing_dev_info.wb.task);
  244. }
  245. spin_unlock_bh(&bdi->wb_lock);
  246. }
  247. /*
  248. * This function is used when the first inode for this bdi is marked dirty. It
  249. * wakes-up the corresponding bdi thread which should then take care of the
  250. * periodic background write-out of dirty inodes. Since the write-out would
  251. * starts only 'dirty_writeback_interval' centisecs from now anyway, we just
  252. * set up a timer which wakes the bdi thread up later.
  253. *
  254. * Note, we wouldn't bother setting up the timer, but this function is on the
  255. * fast-path (used by '__mark_inode_dirty()'), so we save few context switches
  256. * by delaying the wake-up.
  257. */
  258. void bdi_wakeup_thread_delayed(struct backing_dev_info *bdi)
  259. {
  260. unsigned long timeout;
  261. timeout = msecs_to_jiffies(dirty_writeback_interval * 10);
  262. mod_timer(&bdi->wb.wakeup_timer, jiffies + timeout);
  263. }
  264. /*
  265. * Calculate the longest interval (jiffies) bdi threads are allowed to be
  266. * inactive.
  267. */
  268. static unsigned long bdi_longest_inactive(void)
  269. {
  270. unsigned long interval;
  271. interval = msecs_to_jiffies(dirty_writeback_interval * 10);
  272. return max(5UL * 60 * HZ, interval);
  273. }
  274. /*
  275. * Clear pending bit and wakeup anybody waiting for flusher thread creation or
  276. * shutdown
  277. */
  278. static void bdi_clear_pending(struct backing_dev_info *bdi)
  279. {
  280. clear_bit(BDI_pending, &bdi->state);
  281. smp_mb__after_clear_bit();
  282. wake_up_bit(&bdi->state, BDI_pending);
  283. }
  284. static int bdi_forker_thread(void *ptr)
  285. {
  286. struct bdi_writeback *me = ptr;
  287. current->flags |= PF_SWAPWRITE;
  288. set_freezable();
  289. /*
  290. * Our parent may run at a different priority, just set us to normal
  291. */
  292. set_user_nice(current, 0);
  293. for (;;) {
  294. struct task_struct *task = NULL;
  295. struct backing_dev_info *bdi;
  296. enum {
  297. NO_ACTION, /* Nothing to do */
  298. FORK_THREAD, /* Fork bdi thread */
  299. KILL_THREAD, /* Kill inactive bdi thread */
  300. } action = NO_ACTION;
  301. /*
  302. * Temporary measure, we want to make sure we don't see
  303. * dirty data on the default backing_dev_info
  304. */
  305. if (wb_has_dirty_io(me) || !list_empty(&me->bdi->work_list)) {
  306. del_timer(&me->wakeup_timer);
  307. wb_do_writeback(me, 0);
  308. }
  309. spin_lock_bh(&bdi_lock);
  310. /*
  311. * In the following loop we are going to check whether we have
  312. * some work to do without any synchronization with tasks
  313. * waking us up to do work for them. Set the task state here
  314. * so that we don't miss wakeups after verifying conditions.
  315. */
  316. set_current_state(TASK_INTERRUPTIBLE);
  317. list_for_each_entry(bdi, &bdi_list, bdi_list) {
  318. bool have_dirty_io;
  319. if (!bdi_cap_writeback_dirty(bdi) ||
  320. bdi_cap_flush_forker(bdi))
  321. continue;
  322. WARN(!test_bit(BDI_registered, &bdi->state),
  323. "bdi %p/%s is not registered!\n", bdi, bdi->name);
  324. have_dirty_io = !list_empty(&bdi->work_list) ||
  325. wb_has_dirty_io(&bdi->wb);
  326. /*
  327. * If the bdi has work to do, but the thread does not
  328. * exist - create it.
  329. */
  330. if (!bdi->wb.task && have_dirty_io) {
  331. /*
  332. * Set the pending bit - if someone will try to
  333. * unregister this bdi - it'll wait on this bit.
  334. */
  335. set_bit(BDI_pending, &bdi->state);
  336. action = FORK_THREAD;
  337. break;
  338. }
  339. spin_lock(&bdi->wb_lock);
  340. /*
  341. * If there is no work to do and the bdi thread was
  342. * inactive long enough - kill it. The wb_lock is taken
  343. * to make sure no-one adds more work to this bdi and
  344. * wakes the bdi thread up.
  345. */
  346. if (bdi->wb.task && !have_dirty_io &&
  347. time_after(jiffies, bdi->wb.last_active +
  348. bdi_longest_inactive())) {
  349. task = bdi->wb.task;
  350. bdi->wb.task = NULL;
  351. spin_unlock(&bdi->wb_lock);
  352. set_bit(BDI_pending, &bdi->state);
  353. action = KILL_THREAD;
  354. break;
  355. }
  356. spin_unlock(&bdi->wb_lock);
  357. }
  358. spin_unlock_bh(&bdi_lock);
  359. /* Keep working if default bdi still has things to do */
  360. if (!list_empty(&me->bdi->work_list))
  361. __set_current_state(TASK_RUNNING);
  362. switch (action) {
  363. case FORK_THREAD:
  364. __set_current_state(TASK_RUNNING);
  365. task = kthread_create(bdi_writeback_thread, &bdi->wb,
  366. "flush-%s", dev_name(bdi->dev));
  367. if (IS_ERR(task)) {
  368. /*
  369. * If thread creation fails, force writeout of
  370. * the bdi from the thread. Hopefully 1024 is
  371. * large enough for efficient IO.
  372. */
  373. writeback_inodes_wb(&bdi->wb, 1024,
  374. WB_REASON_FORKER_THREAD);
  375. } else {
  376. /*
  377. * The spinlock makes sure we do not lose
  378. * wake-ups when racing with 'bdi_queue_work()'.
  379. * And as soon as the bdi thread is visible, we
  380. * can start it.
  381. */
  382. spin_lock_bh(&bdi->wb_lock);
  383. bdi->wb.task = task;
  384. spin_unlock_bh(&bdi->wb_lock);
  385. wake_up_process(task);
  386. }
  387. bdi_clear_pending(bdi);
  388. break;
  389. case KILL_THREAD:
  390. __set_current_state(TASK_RUNNING);
  391. kthread_stop(task);
  392. bdi_clear_pending(bdi);
  393. break;
  394. case NO_ACTION:
  395. if (!wb_has_dirty_io(me) || !dirty_writeback_interval)
  396. /*
  397. * There are no dirty data. The only thing we
  398. * should now care about is checking for
  399. * inactive bdi threads and killing them. Thus,
  400. * let's sleep for longer time, save energy and
  401. * be friendly for battery-driven devices.
  402. */
  403. schedule_timeout(bdi_longest_inactive());
  404. else
  405. schedule_timeout(msecs_to_jiffies(dirty_writeback_interval * 10));
  406. try_to_freeze();
  407. break;
  408. }
  409. }
  410. return 0;
  411. }
  412. /*
  413. * Remove bdi from bdi_list, and ensure that it is no longer visible
  414. */
  415. static void bdi_remove_from_list(struct backing_dev_info *bdi)
  416. {
  417. spin_lock_bh(&bdi_lock);
  418. list_del_rcu(&bdi->bdi_list);
  419. spin_unlock_bh(&bdi_lock);
  420. synchronize_rcu_expedited();
  421. }
  422. int bdi_register(struct backing_dev_info *bdi, struct device *parent,
  423. const char *fmt, ...)
  424. {
  425. va_list args;
  426. struct device *dev;
  427. if (bdi->dev) /* The driver needs to use separate queues per device */
  428. return 0;
  429. va_start(args, fmt);
  430. dev = device_create_vargs(bdi_class, parent, MKDEV(0, 0), bdi, fmt, args);
  431. va_end(args);
  432. if (IS_ERR(dev))
  433. return PTR_ERR(dev);
  434. bdi->dev = dev;
  435. /*
  436. * Just start the forker thread for our default backing_dev_info,
  437. * and add other bdi's to the list. They will get a thread created
  438. * on-demand when they need it.
  439. */
  440. if (bdi_cap_flush_forker(bdi)) {
  441. struct bdi_writeback *wb = &bdi->wb;
  442. wb->task = kthread_run(bdi_forker_thread, wb, "bdi-%s",
  443. dev_name(dev));
  444. if (IS_ERR(wb->task))
  445. return PTR_ERR(wb->task);
  446. }
  447. bdi_debug_register(bdi, dev_name(dev));
  448. set_bit(BDI_registered, &bdi->state);
  449. spin_lock_bh(&bdi_lock);
  450. list_add_tail_rcu(&bdi->bdi_list, &bdi_list);
  451. spin_unlock_bh(&bdi_lock);
  452. trace_writeback_bdi_register(bdi);
  453. return 0;
  454. }
  455. EXPORT_SYMBOL(bdi_register);
  456. int bdi_register_dev(struct backing_dev_info *bdi, dev_t dev)
  457. {
  458. return bdi_register(bdi, NULL, "%u:%u", MAJOR(dev), MINOR(dev));
  459. }
  460. EXPORT_SYMBOL(bdi_register_dev);
  461. /*
  462. * Remove bdi from the global list and shutdown any threads we have running
  463. */
  464. static void bdi_wb_shutdown(struct backing_dev_info *bdi)
  465. {
  466. struct task_struct *task;
  467. if (!bdi_cap_writeback_dirty(bdi))
  468. return;
  469. /*
  470. * Make sure nobody finds us on the bdi_list anymore
  471. */
  472. bdi_remove_from_list(bdi);
  473. /*
  474. * If setup is pending, wait for that to complete first
  475. */
  476. wait_on_bit(&bdi->state, BDI_pending, bdi_sched_wait,
  477. TASK_UNINTERRUPTIBLE);
  478. /*
  479. * Finally, kill the kernel thread. We don't need to be RCU
  480. * safe anymore, since the bdi is gone from visibility.
  481. */
  482. spin_lock_bh(&bdi->wb_lock);
  483. task = bdi->wb.task;
  484. bdi->wb.task = NULL;
  485. spin_unlock_bh(&bdi->wb_lock);
  486. if (task)
  487. kthread_stop(task);
  488. }
  489. /*
  490. * This bdi is going away now, make sure that no super_blocks point to it
  491. */
  492. static void bdi_prune_sb(struct backing_dev_info *bdi)
  493. {
  494. struct super_block *sb;
  495. spin_lock(&sb_lock);
  496. list_for_each_entry(sb, &super_blocks, s_list) {
  497. if (sb->s_bdi == bdi)
  498. sb->s_bdi = &default_backing_dev_info;
  499. }
  500. spin_unlock(&sb_lock);
  501. }
  502. void bdi_unregister(struct backing_dev_info *bdi)
  503. {
  504. struct device *dev = bdi->dev;
  505. if (dev) {
  506. bdi_set_min_ratio(bdi, 0);
  507. trace_writeback_bdi_unregister(bdi);
  508. bdi_prune_sb(bdi);
  509. del_timer_sync(&bdi->wb.wakeup_timer);
  510. if (!bdi_cap_flush_forker(bdi))
  511. bdi_wb_shutdown(bdi);
  512. bdi_debug_unregister(bdi);
  513. spin_lock_bh(&bdi->wb_lock);
  514. bdi->dev = NULL;
  515. spin_unlock_bh(&bdi->wb_lock);
  516. device_unregister(dev);
  517. }
  518. }
  519. EXPORT_SYMBOL(bdi_unregister);
  520. static void bdi_wb_init(struct bdi_writeback *wb, struct backing_dev_info *bdi)
  521. {
  522. memset(wb, 0, sizeof(*wb));
  523. wb->bdi = bdi;
  524. wb->last_old_flush = jiffies;
  525. INIT_LIST_HEAD(&wb->b_dirty);
  526. INIT_LIST_HEAD(&wb->b_io);
  527. INIT_LIST_HEAD(&wb->b_more_io);
  528. spin_lock_init(&wb->list_lock);
  529. setup_timer(&wb->wakeup_timer, wakeup_timer_fn, (unsigned long)bdi);
  530. }
  531. /*
  532. * Initial write bandwidth: 100 MB/s
  533. */
  534. #define INIT_BW (100 << (20 - PAGE_SHIFT))
  535. int bdi_init(struct backing_dev_info *bdi)
  536. {
  537. int i, err;
  538. bdi->dev = NULL;
  539. bdi->min_ratio = 0;
  540. bdi->max_ratio = 100;
  541. bdi->max_prop_frac = FPROP_FRAC_BASE;
  542. spin_lock_init(&bdi->wb_lock);
  543. INIT_LIST_HEAD(&bdi->bdi_list);
  544. INIT_LIST_HEAD(&bdi->work_list);
  545. bdi_wb_init(&bdi->wb, bdi);
  546. for (i = 0; i < NR_BDI_STAT_ITEMS; i++) {
  547. err = percpu_counter_init(&bdi->bdi_stat[i], 0);
  548. if (err)
  549. goto err;
  550. }
  551. bdi->dirty_exceeded = 0;
  552. bdi->bw_time_stamp = jiffies;
  553. bdi->written_stamp = 0;
  554. bdi->balanced_dirty_ratelimit = INIT_BW;
  555. bdi->dirty_ratelimit = INIT_BW;
  556. bdi->write_bandwidth = INIT_BW;
  557. bdi->avg_write_bandwidth = INIT_BW;
  558. err = fprop_local_init_percpu(&bdi->completions);
  559. if (err) {
  560. err:
  561. while (i--)
  562. percpu_counter_destroy(&bdi->bdi_stat[i]);
  563. }
  564. return err;
  565. }
  566. EXPORT_SYMBOL(bdi_init);
  567. void bdi_destroy(struct backing_dev_info *bdi)
  568. {
  569. int i;
  570. /*
  571. * Splice our entries to the default_backing_dev_info, if this
  572. * bdi disappears
  573. */
  574. if (bdi_has_dirty_io(bdi)) {
  575. struct bdi_writeback *dst = &default_backing_dev_info.wb;
  576. bdi_lock_two(&bdi->wb, dst);
  577. list_splice(&bdi->wb.b_dirty, &dst->b_dirty);
  578. list_splice(&bdi->wb.b_io, &dst->b_io);
  579. list_splice(&bdi->wb.b_more_io, &dst->b_more_io);
  580. spin_unlock(&bdi->wb.list_lock);
  581. spin_unlock(&dst->list_lock);
  582. }
  583. bdi_unregister(bdi);
  584. /*
  585. * If bdi_unregister() had already been called earlier, the
  586. * wakeup_timer could still be armed because bdi_prune_sb()
  587. * can race with the bdi_wakeup_thread_delayed() calls from
  588. * __mark_inode_dirty().
  589. */
  590. del_timer_sync(&bdi->wb.wakeup_timer);
  591. for (i = 0; i < NR_BDI_STAT_ITEMS; i++)
  592. percpu_counter_destroy(&bdi->bdi_stat[i]);
  593. fprop_local_destroy_percpu(&bdi->completions);
  594. }
  595. EXPORT_SYMBOL(bdi_destroy);
  596. /*
  597. * For use from filesystems to quickly init and register a bdi associated
  598. * with dirty writeback
  599. */
  600. int bdi_setup_and_register(struct backing_dev_info *bdi, char *name,
  601. unsigned int cap)
  602. {
  603. char tmp[32];
  604. int err;
  605. bdi->name = name;
  606. bdi->capabilities = cap;
  607. err = bdi_init(bdi);
  608. if (err)
  609. return err;
  610. sprintf(tmp, "%.28s%s", name, "-%d");
  611. err = bdi_register(bdi, NULL, tmp, atomic_long_inc_return(&bdi_seq));
  612. if (err) {
  613. bdi_destroy(bdi);
  614. return err;
  615. }
  616. return 0;
  617. }
  618. EXPORT_SYMBOL(bdi_setup_and_register);
  619. static wait_queue_head_t congestion_wqh[2] = {
  620. __WAIT_QUEUE_HEAD_INITIALIZER(congestion_wqh[0]),
  621. __WAIT_QUEUE_HEAD_INITIALIZER(congestion_wqh[1])
  622. };
  623. static atomic_t nr_bdi_congested[2];
  624. void clear_bdi_congested(struct backing_dev_info *bdi, int sync)
  625. {
  626. enum bdi_state bit;
  627. wait_queue_head_t *wqh = &congestion_wqh[sync];
  628. bit = sync ? BDI_sync_congested : BDI_async_congested;
  629. if (test_and_clear_bit(bit, &bdi->state))
  630. atomic_dec(&nr_bdi_congested[sync]);
  631. smp_mb__after_clear_bit();
  632. if (waitqueue_active(wqh))
  633. wake_up(wqh);
  634. }
  635. EXPORT_SYMBOL(clear_bdi_congested);
  636. void set_bdi_congested(struct backing_dev_info *bdi, int sync)
  637. {
  638. enum bdi_state bit;
  639. bit = sync ? BDI_sync_congested : BDI_async_congested;
  640. if (!test_and_set_bit(bit, &bdi->state))
  641. atomic_inc(&nr_bdi_congested[sync]);
  642. }
  643. EXPORT_SYMBOL(set_bdi_congested);
  644. /**
  645. * congestion_wait - wait for a backing_dev to become uncongested
  646. * @sync: SYNC or ASYNC IO
  647. * @timeout: timeout in jiffies
  648. *
  649. * Waits for up to @timeout jiffies for a backing_dev (any backing_dev) to exit
  650. * write congestion. If no backing_devs are congested then just wait for the
  651. * next write to be completed.
  652. */
  653. long congestion_wait(int sync, long timeout)
  654. {
  655. long ret;
  656. unsigned long start = jiffies;
  657. DEFINE_WAIT(wait);
  658. wait_queue_head_t *wqh = &congestion_wqh[sync];
  659. prepare_to_wait(wqh, &wait, TASK_UNINTERRUPTIBLE);
  660. ret = io_schedule_timeout(timeout);
  661. finish_wait(wqh, &wait);
  662. trace_writeback_congestion_wait(jiffies_to_usecs(timeout),
  663. jiffies_to_usecs(jiffies - start));
  664. return ret;
  665. }
  666. EXPORT_SYMBOL(congestion_wait);
  667. /**
  668. * wait_iff_congested - Conditionally wait for a backing_dev to become uncongested or a zone to complete writes
  669. * @zone: A zone to check if it is heavily congested
  670. * @sync: SYNC or ASYNC IO
  671. * @timeout: timeout in jiffies
  672. *
  673. * In the event of a congested backing_dev (any backing_dev) and the given
  674. * @zone has experienced recent congestion, this waits for up to @timeout
  675. * jiffies for either a BDI to exit congestion of the given @sync queue
  676. * or a write to complete.
  677. *
  678. * In the absence of zone congestion, cond_resched() is called to yield
  679. * the processor if necessary but otherwise does not sleep.
  680. *
  681. * The return value is 0 if the sleep is for the full timeout. Otherwise,
  682. * it is the number of jiffies that were still remaining when the function
  683. * returned. return_value == timeout implies the function did not sleep.
  684. */
  685. long wait_iff_congested(struct zone *zone, int sync, long timeout)
  686. {
  687. long ret;
  688. unsigned long start = jiffies;
  689. DEFINE_WAIT(wait);
  690. wait_queue_head_t *wqh = &congestion_wqh[sync];
  691. /*
  692. * If there is no congestion, or heavy congestion is not being
  693. * encountered in the current zone, yield if necessary instead
  694. * of sleeping on the congestion queue
  695. */
  696. if (atomic_read(&nr_bdi_congested[sync]) == 0 ||
  697. !zone_is_reclaim_congested(zone)) {
  698. cond_resched();
  699. /* In case we scheduled, work out time remaining */
  700. ret = timeout - (jiffies - start);
  701. if (ret < 0)
  702. ret = 0;
  703. goto out;
  704. }
  705. /* Sleep until uncongested or a write happens */
  706. prepare_to_wait(wqh, &wait, TASK_UNINTERRUPTIBLE);
  707. ret = io_schedule_timeout(timeout);
  708. finish_wait(wqh, &wait);
  709. out:
  710. trace_writeback_wait_iff_congested(jiffies_to_usecs(timeout),
  711. jiffies_to_usecs(jiffies - start));
  712. return ret;
  713. }
  714. EXPORT_SYMBOL(wait_iff_congested);
  715. int pdflush_proc_obsolete(struct ctl_table *table, int write,
  716. void __user *buffer, size_t *lenp, loff_t *ppos)
  717. {
  718. char kbuf[] = "0\n";
  719. if (*ppos) {
  720. *lenp = 0;
  721. return 0;
  722. }
  723. if (copy_to_user(buffer, kbuf, sizeof(kbuf)))
  724. return -EFAULT;
  725. printk_once(KERN_WARNING "%s exported in /proc is scheduled for removal\n",
  726. table->procname);
  727. *lenp = 2;
  728. *ppos += *lenp;
  729. return 2;
  730. }