backing-dev.c 21 KB

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