backing-dev.c 17.1 KB
Newer Older
1 2 3

#include <linux/wait.h>
#include <linux/backing-dev.h>
4 5
#include <linux/kthread.h>
#include <linux/freezer.h>
6
#include <linux/fs.h>
7
#include <linux/pagemap.h>
8
#include <linux/mm.h>
9 10
#include <linux/sched.h>
#include <linux/module.h>
11 12
#include <linux/writeback.h>
#include <linux/device.h>
13
#include <trace/events/writeback.h>
14

15 16
static atomic_long_t bdi_seq = ATOMIC_LONG_INIT(0);

17
struct backing_dev_info default_backing_dev_info = {
18
	.name		= "default",
19 20 21 22 23
	.ra_pages	= VM_MAX_READAHEAD * 1024 / PAGE_CACHE_SIZE,
	.state		= 0,
	.capabilities	= BDI_CAP_MAP_COPY,
};
EXPORT_SYMBOL_GPL(default_backing_dev_info);
24

J
Jörn Engel 已提交
25 26
struct backing_dev_info noop_backing_dev_info = {
	.name		= "noop",
27
	.capabilities	= BDI_CAP_NO_ACCT_AND_WRITEBACK,
J
Jörn Engel 已提交
28 29 30
};
EXPORT_SYMBOL_GPL(noop_backing_dev_info);

31
static struct class *bdi_class;
32 33

/*
34
 * bdi_lock protects updates to bdi_list. bdi_list has RCU reader side
35 36
 * locking.
 */
37
DEFINE_SPINLOCK(bdi_lock);
38
LIST_HEAD(bdi_list);
39

40 41 42
/* bdi_wq serves all asynchronous writeback tasks */
struct workqueue_struct *bdi_wq;

43
static void bdi_lock_two(struct bdi_writeback *wb1, struct bdi_writeback *wb2)
44 45 46 47 48 49 50 51 52 53
{
	if (wb1 < wb2) {
		spin_lock(&wb1->list_lock);
		spin_lock_nested(&wb2->list_lock, 1);
	} else {
		spin_lock(&wb2->list_lock);
		spin_lock_nested(&wb1->list_lock, 1);
	}
}

54 55 56 57 58 59 60 61 62 63 64 65 66 67
#ifdef CONFIG_DEBUG_FS
#include <linux/debugfs.h>
#include <linux/seq_file.h>

static struct dentry *bdi_debug_root;

static void bdi_debug_init(void)
{
	bdi_debug_root = debugfs_create_dir("bdi", NULL);
}

static int bdi_debug_stats_show(struct seq_file *m, void *v)
{
	struct backing_dev_info *bdi = m->private;
C
Christoph Hellwig 已提交
68
	struct bdi_writeback *wb = &bdi->wb;
69 70 71
	unsigned long background_thresh;
	unsigned long dirty_thresh;
	unsigned long bdi_thresh;
72
	unsigned long nr_dirty, nr_io, nr_more_io, nr_dirty_time;
73 74
	struct inode *inode;

75
	nr_dirty = nr_io = nr_more_io = nr_dirty_time = 0;
76
	spin_lock(&wb->list_lock);
N
Nick Piggin 已提交
77
	list_for_each_entry(inode, &wb->b_dirty, i_wb_list)
C
Christoph Hellwig 已提交
78
		nr_dirty++;
N
Nick Piggin 已提交
79
	list_for_each_entry(inode, &wb->b_io, i_wb_list)
C
Christoph Hellwig 已提交
80
		nr_io++;
N
Nick Piggin 已提交
81
	list_for_each_entry(inode, &wb->b_more_io, i_wb_list)
C
Christoph Hellwig 已提交
82
		nr_more_io++;
83 84 85
	list_for_each_entry(inode, &wb->b_dirty_time, i_wb_list)
		if (inode->i_state & I_DIRTY_TIME)
			nr_dirty_time++;
86
	spin_unlock(&wb->list_lock);
87

88 89
	global_dirty_limits(&background_thresh, &dirty_thresh);
	bdi_thresh = bdi_dirty_limit(bdi, dirty_thresh);
90 91 92

#define K(x) ((x) << (PAGE_SHIFT - 10))
	seq_printf(m,
93 94 95 96 97
		   "BdiWriteback:       %10lu kB\n"
		   "BdiReclaimable:     %10lu kB\n"
		   "BdiDirtyThresh:     %10lu kB\n"
		   "DirtyThresh:        %10lu kB\n"
		   "BackgroundThresh:   %10lu kB\n"
98
		   "BdiDirtied:         %10lu kB\n"
99 100 101 102 103
		   "BdiWritten:         %10lu kB\n"
		   "BdiWriteBandwidth:  %10lu kBps\n"
		   "b_dirty:            %10lu\n"
		   "b_io:               %10lu\n"
		   "b_more_io:          %10lu\n"
104
		   "b_dirty_time:       %10lu\n"
105 106
		   "bdi_list:           %10u\n"
		   "state:              %10lx\n",
107 108
		   (unsigned long) K(bdi_stat(bdi, BDI_WRITEBACK)),
		   (unsigned long) K(bdi_stat(bdi, BDI_RECLAIMABLE)),
109 110 111
		   K(bdi_thresh),
		   K(dirty_thresh),
		   K(background_thresh),
112
		   (unsigned long) K(bdi_stat(bdi, BDI_DIRTIED)),
113
		   (unsigned long) K(bdi_stat(bdi, BDI_WRITTEN)),
114
		   (unsigned long) K(bdi->write_bandwidth),
115 116 117
		   nr_dirty,
		   nr_io,
		   nr_more_io,
118
		   nr_dirty_time,
C
Christoph Hellwig 已提交
119
		   !list_empty(&bdi->bdi_list), bdi->state);
120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161
#undef K

	return 0;
}

static int bdi_debug_stats_open(struct inode *inode, struct file *file)
{
	return single_open(file, bdi_debug_stats_show, inode->i_private);
}

static const struct file_operations bdi_debug_stats_fops = {
	.open		= bdi_debug_stats_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= single_release,
};

static void bdi_debug_register(struct backing_dev_info *bdi, const char *name)
{
	bdi->debug_dir = debugfs_create_dir(name, bdi_debug_root);
	bdi->debug_stats = debugfs_create_file("stats", 0444, bdi->debug_dir,
					       bdi, &bdi_debug_stats_fops);
}

static void bdi_debug_unregister(struct backing_dev_info *bdi)
{
	debugfs_remove(bdi->debug_stats);
	debugfs_remove(bdi->debug_dir);
}
#else
static inline void bdi_debug_init(void)
{
}
static inline void bdi_debug_register(struct backing_dev_info *bdi,
				      const char *name)
{
}
static inline void bdi_debug_unregister(struct backing_dev_info *bdi)
{
}
#endif

162 163 164 165 166 167
static ssize_t read_ahead_kb_store(struct device *dev,
				  struct device_attribute *attr,
				  const char *buf, size_t count)
{
	struct backing_dev_info *bdi = dev_get_drvdata(dev);
	unsigned long read_ahead_kb;
168
	ssize_t ret;
169

170 171 172 173 174 175 176
	ret = kstrtoul(buf, 10, &read_ahead_kb);
	if (ret < 0)
		return ret;

	bdi->ra_pages = read_ahead_kb >> (PAGE_SHIFT - 10);

	return count;
177 178 179 180 181 182 183 184 185 186 187
}

#define K(pages) ((pages) << (PAGE_SHIFT - 10))

#define BDI_SHOW(name, expr)						\
static ssize_t name##_show(struct device *dev,				\
			   struct device_attribute *attr, char *page)	\
{									\
	struct backing_dev_info *bdi = dev_get_drvdata(dev);		\
									\
	return snprintf(page, PAGE_SIZE-1, "%lld\n", (long long)expr);	\
188 189
}									\
static DEVICE_ATTR_RW(name);
190 191 192

BDI_SHOW(read_ahead_kb, K(bdi->ra_pages))

193 194 195 196 197
static ssize_t min_ratio_store(struct device *dev,
		struct device_attribute *attr, const char *buf, size_t count)
{
	struct backing_dev_info *bdi = dev_get_drvdata(dev);
	unsigned int ratio;
198 199 200 201 202 203 204 205 206
	ssize_t ret;

	ret = kstrtouint(buf, 10, &ratio);
	if (ret < 0)
		return ret;

	ret = bdi_set_min_ratio(bdi, ratio);
	if (!ret)
		ret = count;
207 208 209 210 211

	return ret;
}
BDI_SHOW(min_ratio, bdi->min_ratio)

212 213 214 215 216
static ssize_t max_ratio_store(struct device *dev,
		struct device_attribute *attr, const char *buf, size_t count)
{
	struct backing_dev_info *bdi = dev_get_drvdata(dev);
	unsigned int ratio;
217 218 219 220 221 222 223 224 225
	ssize_t ret;

	ret = kstrtouint(buf, 10, &ratio);
	if (ret < 0)
		return ret;

	ret = bdi_set_max_ratio(bdi, ratio);
	if (!ret)
		ret = count;
226 227 228 229 230

	return ret;
}
BDI_SHOW(max_ratio, bdi->max_ratio)

231 232 233 234 235 236 237 238 239
static ssize_t stable_pages_required_show(struct device *dev,
					  struct device_attribute *attr,
					  char *page)
{
	struct backing_dev_info *bdi = dev_get_drvdata(dev);

	return snprintf(page, PAGE_SIZE-1, "%d\n",
			bdi_cap_stable_pages_required(bdi) ? 1 : 0);
}
240 241 242 243 244 245 246 247
static DEVICE_ATTR_RO(stable_pages_required);

static struct attribute *bdi_dev_attrs[] = {
	&dev_attr_read_ahead_kb.attr,
	&dev_attr_min_ratio.attr,
	&dev_attr_max_ratio.attr,
	&dev_attr_stable_pages_required.attr,
	NULL,
248
};
249
ATTRIBUTE_GROUPS(bdi_dev);
250 251 252 253

static __init int bdi_class_init(void)
{
	bdi_class = class_create(THIS_MODULE, "bdi");
254 255 256
	if (IS_ERR(bdi_class))
		return PTR_ERR(bdi_class);

257
	bdi_class->dev_groups = bdi_dev_groups;
258
	bdi_debug_init();
259 260
	return 0;
}
261
postcore_initcall(bdi_class_init);
262

263 264 265 266
static int __init default_bdi_init(void)
{
	int err;

267
	bdi_wq = alloc_workqueue("writeback", WQ_MEM_RECLAIM | WQ_FREEZABLE |
268
					      WQ_UNBOUND | WQ_SYSFS, 0);
269 270 271
	if (!bdi_wq)
		return -ENOMEM;

272 273 274
	err = bdi_init(&default_backing_dev_info);
	if (!err)
		bdi_register(&default_backing_dev_info, NULL, "default");
275
	err = bdi_init(&noop_backing_dev_info);
276 277 278 279 280

	return err;
}
subsys_initcall(default_bdi_init);

281 282 283 284 285
int bdi_has_dirty_io(struct backing_dev_info *bdi)
{
	return wb_has_dirty_io(&bdi->wb);
}

286 287 288 289 290 291 292 293 294 295
/*
 * This function is used when the first inode for this bdi is marked dirty. It
 * wakes-up the corresponding bdi thread which should then take care of the
 * periodic background write-out of dirty inodes. Since the write-out would
 * starts only 'dirty_writeback_interval' centisecs from now anyway, we just
 * set up a timer which wakes the bdi thread up later.
 *
 * Note, we wouldn't bother setting up the timer, but this function is on the
 * fast-path (used by '__mark_inode_dirty()'), so we save few context switches
 * by delaying the wake-up.
296 297 298
 *
 * We have to be careful not to postpone flush work if it is scheduled for
 * earlier. Thus we use queue_delayed_work().
299 300 301 302 303 304
 */
void bdi_wakeup_thread_delayed(struct backing_dev_info *bdi)
{
	unsigned long timeout;

	timeout = msecs_to_jiffies(dirty_writeback_interval * 10);
J
Jan Kara 已提交
305 306 307 308
	spin_lock_bh(&bdi->wb_lock);
	if (test_bit(BDI_registered, &bdi->state))
		queue_delayed_work(bdi_wq, &bdi->wb.dwork, timeout);
	spin_unlock_bh(&bdi->wb_lock);
309 310
}

311 312 313 314 315 316 317 318 319
/*
 * Remove bdi from bdi_list, and ensure that it is no longer visible
 */
static void bdi_remove_from_list(struct backing_dev_info *bdi)
{
	spin_lock_bh(&bdi_lock);
	list_del_rcu(&bdi->bdi_list);
	spin_unlock_bh(&bdi_lock);

320
	synchronize_rcu_expedited();
321 322
}

323 324 325 326 327 328
int bdi_register(struct backing_dev_info *bdi, struct device *parent,
		const char *fmt, ...)
{
	va_list args;
	struct device *dev;

329
	if (bdi->dev)	/* The driver needs to use separate queues per device */
330
		return 0;
331

332
	va_start(args, fmt);
333
	dev = device_create_vargs(bdi_class, parent, MKDEV(0, 0), bdi, fmt, args);
334
	va_end(args);
335 336
	if (IS_ERR(dev))
		return PTR_ERR(dev);
337

338 339
	bdi->dev = dev;

340
	bdi_debug_register(bdi, dev_name(dev));
341
	set_bit(BDI_registered, &bdi->state);
342 343 344 345 346

	spin_lock_bh(&bdi_lock);
	list_add_tail_rcu(&bdi->bdi_list, &bdi_list);
	spin_unlock_bh(&bdi_lock);

347
	trace_writeback_bdi_register(bdi);
348
	return 0;
349 350 351 352 353 354 355 356 357
}
EXPORT_SYMBOL(bdi_register);

int bdi_register_dev(struct backing_dev_info *bdi, dev_t dev)
{
	return bdi_register(bdi, NULL, "%u:%u", MAJOR(dev), MINOR(dev));
}
EXPORT_SYMBOL(bdi_register_dev);

358 359 360 361
/*
 * Remove bdi from the global list and shutdown any threads we have running
 */
static void bdi_wb_shutdown(struct backing_dev_info *bdi)
362
{
363 364 365 366
	if (!bdi_cap_writeback_dirty(bdi))
		return;

	/*
367
	 * Make sure nobody finds us on the bdi_list anymore
368
	 */
369
	bdi_remove_from_list(bdi);
370

J
Jan Kara 已提交
371 372 373 374 375
	/* Make sure nobody queues further work */
	spin_lock_bh(&bdi->wb_lock);
	clear_bit(BDI_registered, &bdi->state);
	spin_unlock_bh(&bdi->wb_lock);

376
	/*
377 378 379
	 * Drain work list and shutdown the delayed_work.  At this point,
	 * @bdi->bdi_list is empty telling bdi_Writeback_workfn() that @bdi
	 * is dying and its work_list needs to be drained no matter what.
380
	 */
381 382 383
	mod_delayed_work(bdi_wq, &bdi->wb.dwork, 0);
	flush_delayed_work(&bdi->wb.dwork);
	WARN_ON(!list_empty(&bdi->work_list));
384
	WARN_ON(delayed_work_pending(&bdi->wb.dwork));
385 386
}

387 388 389 390 391 392 393 394 395 396
/*
 * This bdi is going away now, make sure that no super_blocks point to it
 */
static void bdi_prune_sb(struct backing_dev_info *bdi)
{
	struct super_block *sb;

	spin_lock(&sb_lock);
	list_for_each_entry(sb, &super_blocks, s_list) {
		if (sb->s_bdi == bdi)
397
			sb->s_bdi = &default_backing_dev_info;
398 399 400 401
	}
	spin_unlock(&sb_lock);
}

402 403
void bdi_unregister(struct backing_dev_info *bdi)
{
404
	if (bdi->dev) {
405
		bdi_set_min_ratio(bdi, 0);
406
		trace_writeback_bdi_unregister(bdi);
407 408
		bdi_prune_sb(bdi);

409
		bdi_wb_shutdown(bdi);
410
		bdi_debug_unregister(bdi);
411
		device_unregister(bdi->dev);
412 413 414 415
		bdi->dev = NULL;
	}
}
EXPORT_SYMBOL(bdi_unregister);
416

417 418 419 420 421 422 423 424 425
static void bdi_wb_init(struct bdi_writeback *wb, struct backing_dev_info *bdi)
{
	memset(wb, 0, sizeof(*wb));

	wb->bdi = bdi;
	wb->last_old_flush = jiffies;
	INIT_LIST_HEAD(&wb->b_dirty);
	INIT_LIST_HEAD(&wb->b_io);
	INIT_LIST_HEAD(&wb->b_more_io);
426
	INIT_LIST_HEAD(&wb->b_dirty_time);
427
	spin_lock_init(&wb->list_lock);
428
	INIT_DELAYED_WORK(&wb->dwork, bdi_writeback_workfn);
429 430
}

431 432 433 434 435
/*
 * Initial write bandwidth: 100 MB/s
 */
#define INIT_BW		(100 << (20 - PAGE_SHIFT))

436 437
int bdi_init(struct backing_dev_info *bdi)
{
438
	int i, err;
439

440 441
	bdi->dev = NULL;

442
	bdi->min_ratio = 0;
443
	bdi->max_ratio = 100;
444
	bdi->max_prop_frac = FPROP_FRAC_BASE;
445
	spin_lock_init(&bdi->wb_lock);
446
	INIT_LIST_HEAD(&bdi->bdi_list);
447 448 449 450
	INIT_LIST_HEAD(&bdi->work_list);

	bdi_wb_init(&bdi->wb, bdi);

451
	for (i = 0; i < NR_BDI_STAT_ITEMS; i++) {
452
		err = percpu_counter_init(&bdi->bdi_stat[i], 0, GFP_KERNEL);
P
Peter Zijlstra 已提交
453 454 455 456 457
		if (err)
			goto err;
	}

	bdi->dirty_exceeded = 0;
458 459 460 461

	bdi->bw_time_stamp = jiffies;
	bdi->written_stamp = 0;

462
	bdi->balanced_dirty_ratelimit = INIT_BW;
W
Wu Fengguang 已提交
463
	bdi->dirty_ratelimit = INIT_BW;
464 465 466
	bdi->write_bandwidth = INIT_BW;
	bdi->avg_write_bandwidth = INIT_BW;

467
	err = fprop_local_init_percpu(&bdi->completions, GFP_KERNEL);
P
Peter Zijlstra 已提交
468 469 470

	if (err) {
err:
471
		while (i--)
P
Peter Zijlstra 已提交
472
			percpu_counter_destroy(&bdi->bdi_stat[i]);
473 474 475 476 477 478 479 480 481 482
	}

	return err;
}
EXPORT_SYMBOL(bdi_init);

void bdi_destroy(struct backing_dev_info *bdi)
{
	int i;

483
	/*
484 485 486 487 488 489 490 491 492 493 494
	 * Splice our entries to the default_backing_dev_info.  This
	 * condition shouldn't happen.  @wb must be empty at this point and
	 * dirty inodes on it might cause other issues.  This workaround is
	 * added by ce5f8e779519 ("writeback: splice dirty inode entries to
	 * default bdi on bdi_destroy()") without root-causing the issue.
	 *
	 * http://lkml.kernel.org/g/1253038617-30204-11-git-send-email-jens.axboe@oracle.com
	 * http://thread.gmane.org/gmane.linux.file-systems/35341/focus=35350
	 *
	 * We should probably add WARN_ON() to find out whether it still
	 * happens and track it down if so.
495 496 497 498
	 */
	if (bdi_has_dirty_io(bdi)) {
		struct bdi_writeback *dst = &default_backing_dev_info.wb;

499
		bdi_lock_two(&bdi->wb, dst);
500 501 502
		list_splice(&bdi->wb.b_dirty, &dst->b_dirty);
		list_splice(&bdi->wb.b_io, &dst->b_io);
		list_splice(&bdi->wb.b_more_io, &dst->b_more_io);
503 504
		spin_unlock(&bdi->wb.list_lock);
		spin_unlock(&dst->list_lock);
505
	}
506

507 508
	bdi_unregister(bdi);

509
	WARN_ON(delayed_work_pending(&bdi->wb.dwork));
510

511 512
	for (i = 0; i < NR_BDI_STAT_ITEMS; i++)
		percpu_counter_destroy(&bdi->bdi_stat[i]);
P
Peter Zijlstra 已提交
513

514
	fprop_local_destroy_percpu(&bdi->completions);
515 516 517
}
EXPORT_SYMBOL(bdi_destroy);

518 519 520 521 522 523 524 525 526 527 528 529 530 531 532
/*
 * For use from filesystems to quickly init and register a bdi associated
 * with dirty writeback
 */
int bdi_setup_and_register(struct backing_dev_info *bdi, char *name,
			   unsigned int cap)
{
	int err;

	bdi->name = name;
	bdi->capabilities = cap;
	err = bdi_init(bdi);
	if (err)
		return err;

533 534
	err = bdi_register(bdi, NULL, "%.28s-%ld", name,
			   atomic_long_inc_return(&bdi_seq));
535 536 537 538 539 540 541 542 543
	if (err) {
		bdi_destroy(bdi);
		return err;
	}

	return 0;
}
EXPORT_SYMBOL(bdi_setup_and_register);

544 545 546 547
static wait_queue_head_t congestion_wqh[2] = {
		__WAIT_QUEUE_HEAD_INITIALIZER(congestion_wqh[0]),
		__WAIT_QUEUE_HEAD_INITIALIZER(congestion_wqh[1])
	};
548
static atomic_t nr_bdi_congested[2];
549

550
void clear_bdi_congested(struct backing_dev_info *bdi, int sync)
551 552
{
	enum bdi_state bit;
553
	wait_queue_head_t *wqh = &congestion_wqh[sync];
554

555
	bit = sync ? BDI_sync_congested : BDI_async_congested;
556 557
	if (test_and_clear_bit(bit, &bdi->state))
		atomic_dec(&nr_bdi_congested[sync]);
558
	smp_mb__after_atomic();
559 560 561 562 563
	if (waitqueue_active(wqh))
		wake_up(wqh);
}
EXPORT_SYMBOL(clear_bdi_congested);

564
void set_bdi_congested(struct backing_dev_info *bdi, int sync)
565 566 567
{
	enum bdi_state bit;

568
	bit = sync ? BDI_sync_congested : BDI_async_congested;
569 570
	if (!test_and_set_bit(bit, &bdi->state))
		atomic_inc(&nr_bdi_congested[sync]);
571 572 573 574 575
}
EXPORT_SYMBOL(set_bdi_congested);

/**
 * congestion_wait - wait for a backing_dev to become uncongested
576
 * @sync: SYNC or ASYNC IO
577 578 579 580 581 582
 * @timeout: timeout in jiffies
 *
 * Waits for up to @timeout jiffies for a backing_dev (any backing_dev) to exit
 * write congestion.  If no backing_devs are congested then just wait for the
 * next write to be completed.
 */
583
long congestion_wait(int sync, long timeout)
584 585
{
	long ret;
586
	unsigned long start = jiffies;
587
	DEFINE_WAIT(wait);
588
	wait_queue_head_t *wqh = &congestion_wqh[sync];
589 590 591 592

	prepare_to_wait(wqh, &wait, TASK_UNINTERRUPTIBLE);
	ret = io_schedule_timeout(timeout);
	finish_wait(wqh, &wait);
593 594 595 596

	trace_writeback_congestion_wait(jiffies_to_usecs(timeout),
					jiffies_to_usecs(jiffies - start));

597 598 599
	return ret;
}
EXPORT_SYMBOL(congestion_wait);
P
Peter Zijlstra 已提交
600

601 602 603 604 605 606 607 608 609 610 611
/**
 * wait_iff_congested - Conditionally wait for a backing_dev to become uncongested or a zone to complete writes
 * @zone: A zone to check if it is heavily congested
 * @sync: SYNC or ASYNC IO
 * @timeout: timeout in jiffies
 *
 * In the event of a congested backing_dev (any backing_dev) and the given
 * @zone has experienced recent congestion, this waits for up to @timeout
 * jiffies for either a BDI to exit congestion of the given @sync queue
 * or a write to complete.
 *
L
Lucas De Marchi 已提交
612
 * In the absence of zone congestion, cond_resched() is called to yield
613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631
 * the processor if necessary but otherwise does not sleep.
 *
 * The return value is 0 if the sleep is for the full timeout. Otherwise,
 * it is the number of jiffies that were still remaining when the function
 * returned. return_value == timeout implies the function did not sleep.
 */
long wait_iff_congested(struct zone *zone, int sync, long timeout)
{
	long ret;
	unsigned long start = jiffies;
	DEFINE_WAIT(wait);
	wait_queue_head_t *wqh = &congestion_wqh[sync];

	/*
	 * If there is no congestion, or heavy congestion is not being
	 * encountered in the current zone, yield if necessary instead
	 * of sleeping on the congestion queue
	 */
	if (atomic_read(&nr_bdi_congested[sync]) == 0 ||
J
Johannes Weiner 已提交
632
	    !test_bit(ZONE_CONGESTED, &zone->flags)) {
633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654
		cond_resched();

		/* In case we scheduled, work out time remaining */
		ret = timeout - (jiffies - start);
		if (ret < 0)
			ret = 0;

		goto out;
	}

	/* Sleep until uncongested or a write happens */
	prepare_to_wait(wqh, &wait, TASK_UNINTERRUPTIBLE);
	ret = io_schedule_timeout(timeout);
	finish_wait(wqh, &wait);

out:
	trace_writeback_wait_iff_congested(jiffies_to_usecs(timeout),
					jiffies_to_usecs(jiffies - start));

	return ret;
}
EXPORT_SYMBOL(wait_iff_congested);
655 656 657 658 659 660

int pdflush_proc_obsolete(struct ctl_table *table, int write,
			void __user *buffer, size_t *lenp, loff_t *ppos)
{
	char kbuf[] = "0\n";

661
	if (*ppos || *lenp < sizeof(kbuf)) {
662 663 664 665 666 667 668 669 670 671 672 673 674
		*lenp = 0;
		return 0;
	}

	if (copy_to_user(buffer, kbuf, sizeof(kbuf)))
		return -EFAULT;
	printk_once(KERN_WARNING "%s exported in /proc is scheduled for removal\n",
			table->procname);

	*lenp = 2;
	*ppos += *lenp;
	return 2;
}