writeback.c 12.4 KB
Newer Older
K
Kent Overstreet 已提交
1 2 3 4 5 6 7 8 9 10 11
/*
 * background writeback - scan btree for dirty data and write it to the backing
 * device
 *
 * Copyright 2010, 2011 Kent Overstreet <kent.overstreet@gmail.com>
 * Copyright 2012 Google, Inc.
 */

#include "bcache.h"
#include "btree.h"
#include "debug.h"
12
#include "writeback.h"
K
Kent Overstreet 已提交
13

14 15
#include <linux/delay.h>
#include <linux/kthread.h>
16
#include <linux/sched/clock.h>
K
Kent Overstreet 已提交
17 18
#include <trace/events/bcache.h>

K
Kent Overstreet 已提交
19 20 21 22 23 24 25 26 27 28 29 30 31 32
/* Rate limiting */

static void __update_writeback_rate(struct cached_dev *dc)
{
	struct cache_set *c = dc->disk.c;
	uint64_t cache_sectors = c->nbuckets * c->sb.bucket_size;
	uint64_t cache_dirty_target =
		div_u64(cache_sectors * dc->writeback_percent, 100);

	int64_t target = div64_u64(cache_dirty_target * bdev_sectors(dc->bdev),
				   c->cached_dev_sectors);

	/* PD controller */

33
	int64_t dirty = bcache_dev_sectors_dirty(&dc->disk);
K
Kent Overstreet 已提交
34
	int64_t derivative = dirty - dc->disk.sectors_dirty_last;
35 36
	int64_t proportional = dirty - target;
	int64_t change;
K
Kent Overstreet 已提交
37 38 39

	dc->disk.sectors_dirty_last = dirty;

40
	/* Scale to sectors per second */
K
Kent Overstreet 已提交
41

42 43
	proportional *= dc->writeback_rate_update_seconds;
	proportional = div_s64(proportional, dc->writeback_rate_p_term_inverse);
K
Kent Overstreet 已提交
44

45
	derivative = div_s64(derivative, dc->writeback_rate_update_seconds);
K
Kent Overstreet 已提交
46

47 48 49 50 51 52
	derivative = ewma_add(dc->disk.sectors_dirty_derivative, derivative,
			      (dc->writeback_rate_d_term /
			       dc->writeback_rate_update_seconds) ?: 1, 0);

	derivative *= dc->writeback_rate_d_term;
	derivative = div_s64(derivative, dc->writeback_rate_p_term_inverse);
K
Kent Overstreet 已提交
53

54
	change = proportional + derivative;
K
Kent Overstreet 已提交
55 56 57 58

	/* Don't increase writeback rate if the device isn't keeping up */
	if (change > 0 &&
	    time_after64(local_clock(),
59
			 dc->writeback_rate.next + NSEC_PER_MSEC))
K
Kent Overstreet 已提交
60 61 62
		change = 0;

	dc->writeback_rate.rate =
63
		clamp_t(int64_t, (int64_t) dc->writeback_rate.rate + change,
K
Kent Overstreet 已提交
64
			1, NSEC_PER_MSEC);
65 66

	dc->writeback_rate_proportional = proportional;
K
Kent Overstreet 已提交
67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84
	dc->writeback_rate_derivative = derivative;
	dc->writeback_rate_change = change;
	dc->writeback_rate_target = target;
}

static void update_writeback_rate(struct work_struct *work)
{
	struct cached_dev *dc = container_of(to_delayed_work(work),
					     struct cached_dev,
					     writeback_rate_update);

	down_read(&dc->writeback_lock);

	if (atomic_read(&dc->has_dirty) &&
	    dc->writeback_percent)
		__update_writeback_rate(dc);

	up_read(&dc->writeback_lock);
85 86 87

	schedule_delayed_work(&dc->writeback_rate_update,
			      dc->writeback_rate_update_seconds * HZ);
K
Kent Overstreet 已提交
88 89 90 91
}

static unsigned writeback_delay(struct cached_dev *dc, unsigned sectors)
{
92
	if (test_bit(BCACHE_DEV_DETACHING, &dc->disk.flags) ||
K
Kent Overstreet 已提交
93 94 95
	    !dc->writeback_percent)
		return 0;

96
	return bch_next_delay(&dc->writeback_rate, sectors);
K
Kent Overstreet 已提交
97 98
}

99 100 101 102 103
struct dirty_io {
	struct closure		cl;
	struct cached_dev	*dc;
	struct bio		bio;
};
K
Kent Overstreet 已提交
104

K
Kent Overstreet 已提交
105 106 107 108 109
static void dirty_init(struct keybuf_key *w)
{
	struct dirty_io *io = w->private;
	struct bio *bio = &io->bio;

110 111
	bio_init(bio, bio->bi_inline_vecs,
		 DIV_ROUND_UP(KEY_SIZE(&w->key), PAGE_SECTORS));
K
Kent Overstreet 已提交
112 113 114
	if (!io->dc->writeback_percent)
		bio_set_prio(bio, IOPRIO_PRIO_VALUE(IOPRIO_CLASS_IDLE, 0));

115
	bio->bi_iter.bi_size	= KEY_SIZE(&w->key) << 9;
K
Kent Overstreet 已提交
116
	bio->bi_private		= w;
117
	bch_bio_map(bio, NULL);
K
Kent Overstreet 已提交
118 119 120 121 122 123 124 125 126 127 128 129 130 131
}

static void dirty_io_destructor(struct closure *cl)
{
	struct dirty_io *io = container_of(cl, struct dirty_io, cl);
	kfree(io);
}

static void write_dirty_finish(struct closure *cl)
{
	struct dirty_io *io = container_of(cl, struct dirty_io, cl);
	struct keybuf_key *w = io->bio.bi_private;
	struct cached_dev *dc = io->dc;

132
	bio_free_pages(&io->bio);
K
Kent Overstreet 已提交
133 134 135

	/* This is kind of a dumb way of signalling errors. */
	if (KEY_DIRTY(&w->key)) {
136
		int ret;
K
Kent Overstreet 已提交
137
		unsigned i;
138 139 140
		struct keylist keys;

		bch_keylist_init(&keys);
K
Kent Overstreet 已提交
141

K
Kent Overstreet 已提交
142 143 144
		bkey_copy(keys.top, &w->key);
		SET_KEY_DIRTY(keys.top, false);
		bch_keylist_push(&keys);
K
Kent Overstreet 已提交
145 146 147 148

		for (i = 0; i < KEY_PTRS(&w->key); i++)
			atomic_inc(&PTR_BUCKET(dc->disk.c, &w->key, i)->pin);

149
		ret = bch_btree_insert(dc->disk.c, &keys, NULL, &w->key);
K
Kent Overstreet 已提交
150

151
		if (ret)
K
Kent Overstreet 已提交
152 153
			trace_bcache_writeback_collision(&w->key);

154
		atomic_long_inc(ret
K
Kent Overstreet 已提交
155 156 157 158 159
				? &dc->disk.c->writeback_keys_failed
				: &dc->disk.c->writeback_keys_done);
	}

	bch_keybuf_del(&dc->writeback_keys, w);
160
	up(&dc->in_flight);
K
Kent Overstreet 已提交
161 162 163 164

	closure_return_with_destructor(cl, dirty_io_destructor);
}

165
static void dirty_endio(struct bio *bio)
K
Kent Overstreet 已提交
166 167 168 169
{
	struct keybuf_key *w = bio->bi_private;
	struct dirty_io *io = w->private;

170
	if (bio->bi_status)
K
Kent Overstreet 已提交
171 172 173 174 175 176 177 178 179 180 181
		SET_KEY_DIRTY(&w->key, false);

	closure_put(&io->cl);
}

static void write_dirty(struct closure *cl)
{
	struct dirty_io *io = container_of(cl, struct dirty_io, cl);
	struct keybuf_key *w = io->bio.bi_private;

	dirty_init(w);
M
Mike Christie 已提交
182
	bio_set_op_attrs(&io->bio, REQ_OP_WRITE, 0);
183
	io->bio.bi_iter.bi_sector = KEY_START(&w->key);
184
	bio_set_dev(&io->bio, io->dc->bdev);
K
Kent Overstreet 已提交
185 186
	io->bio.bi_end_io	= dirty_endio;

187
	closure_bio_submit(&io->bio, cl);
K
Kent Overstreet 已提交
188

189
	continue_at(cl, write_dirty_finish, system_wq);
K
Kent Overstreet 已提交
190 191
}

192
static void read_dirty_endio(struct bio *bio)
K
Kent Overstreet 已提交
193 194 195 196 197
{
	struct keybuf_key *w = bio->bi_private;
	struct dirty_io *io = w->private;

	bch_count_io_errors(PTR_CACHE(io->dc->disk.c, &w->key, 0),
198
			    bio->bi_status, "reading dirty data from cache");
K
Kent Overstreet 已提交
199

200
	dirty_endio(bio);
K
Kent Overstreet 已提交
201 202 203 204 205 206
}

static void read_dirty_submit(struct closure *cl)
{
	struct dirty_io *io = container_of(cl, struct dirty_io, cl);

207
	closure_bio_submit(&io->bio, cl);
K
Kent Overstreet 已提交
208

209
	continue_at(cl, write_dirty, system_wq);
K
Kent Overstreet 已提交
210 211
}

212
static void read_dirty(struct cached_dev *dc)
K
Kent Overstreet 已提交
213
{
214
	unsigned delay = 0;
K
Kent Overstreet 已提交
215 216
	struct keybuf_key *w;
	struct dirty_io *io;
217 218 219
	struct closure cl;

	closure_init_stack(&cl);
K
Kent Overstreet 已提交
220 221 222 223 224 225

	/*
	 * XXX: if we error, background writeback just spins. Should use some
	 * mempools.
	 */

226 227
	while (!kthread_should_stop()) {

K
Kent Overstreet 已提交
228 229 230 231 232 233
		w = bch_keybuf_next(&dc->writeback_keys);
		if (!w)
			break;

		BUG_ON(ptr_stale(dc->disk.c, &w->key, 0));

234 235 236
		if (KEY_START(&w->key) != dc->last_read ||
		    jiffies_to_msecs(delay) > 50)
			while (!kthread_should_stop() && delay)
237
				delay = schedule_timeout_interruptible(delay);
K
Kent Overstreet 已提交
238 239 240 241 242 243 244 245 246 247 248 249 250

		dc->last_read	= KEY_OFFSET(&w->key);

		io = kzalloc(sizeof(struct dirty_io) + sizeof(struct bio_vec)
			     * DIV_ROUND_UP(KEY_SIZE(&w->key), PAGE_SECTORS),
			     GFP_KERNEL);
		if (!io)
			goto err;

		w->private	= io;
		io->dc		= dc;

		dirty_init(w);
M
Mike Christie 已提交
251
		bio_set_op_attrs(&io->bio, REQ_OP_READ, 0);
252
		io->bio.bi_iter.bi_sector = PTR_OFFSET(&w->key, 0);
253
		bio_set_dev(&io->bio, PTR_CACHE(dc->disk.c, &w->key, 0)->bdev);
K
Kent Overstreet 已提交
254 255
		io->bio.bi_end_io	= read_dirty_endio;

256
		if (bio_alloc_pages(&io->bio, GFP_KERNEL))
K
Kent Overstreet 已提交
257 258
			goto err_free;

K
Kent Overstreet 已提交
259
		trace_bcache_writeback(&w->key);
K
Kent Overstreet 已提交
260

261
		down(&dc->in_flight);
262
		closure_call(&io->cl, read_dirty_submit, NULL, &cl);
K
Kent Overstreet 已提交
263 264 265 266 267 268 269 270 271 272 273

		delay = writeback_delay(dc, KEY_SIZE(&w->key));
	}

	if (0) {
err_free:
		kfree(w->private);
err:
		bch_keybuf_del(&dc->writeback_keys, w);
	}

274 275 276 277
	/*
	 * Wait for outstanding writeback IOs to finish (and keybuf slots to be
	 * freed) before refilling again
	 */
278 279 280 281 282 283 284 285 286
	closure_sync(&cl);
}

/* Scan for dirty data */

void bcache_dev_sectors_dirty_add(struct cache_set *c, unsigned inode,
				  uint64_t offset, int nr_sectors)
{
	struct bcache_device *d = c->devices[inode];
287
	unsigned stripe_offset, stripe, sectors_dirty;
288 289 290 291

	if (!d)
		return;

292
	stripe = offset_to_stripe(d, offset);
293 294 295 296 297 298 299 300 301
	stripe_offset = offset & (d->stripe_size - 1);

	while (nr_sectors) {
		int s = min_t(unsigned, abs(nr_sectors),
			      d->stripe_size - stripe_offset);

		if (nr_sectors < 0)
			s = -s;

302 303 304 305 306 307 308 309 310 311
		if (stripe >= d->nr_stripes)
			return;

		sectors_dirty = atomic_add_return(s,
					d->stripe_sectors_dirty + stripe);
		if (sectors_dirty == d->stripe_size)
			set_bit(stripe, d->full_dirty_stripes);
		else
			clear_bit(stripe, d->full_dirty_stripes);

312 313 314 315 316 317 318 319
		nr_sectors -= s;
		stripe_offset = 0;
		stripe++;
	}
}

static bool dirty_pred(struct keybuf *buf, struct bkey *k)
{
320 321 322 323
	struct cached_dev *dc = container_of(buf, struct cached_dev, writeback_keys);

	BUG_ON(KEY_INODE(k) != dc->disk.id);

324 325 326
	return KEY_DIRTY(k);
}

327
static void refill_full_stripes(struct cached_dev *dc)
328
{
329 330 331 332 333
	struct keybuf *buf = &dc->writeback_keys;
	unsigned start_stripe, stripe, next_stripe;
	bool wrapped = false;

	stripe = offset_to_stripe(&dc->disk, KEY_OFFSET(&buf->last_scanned));
334

335 336
	if (stripe >= dc->disk.nr_stripes)
		stripe = 0;
337

338
	start_stripe = stripe;
339 340

	while (1) {
341 342
		stripe = find_next_bit(dc->disk.full_dirty_stripes,
				       dc->disk.nr_stripes, stripe);
343

344 345
		if (stripe == dc->disk.nr_stripes)
			goto next;
346

347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369
		next_stripe = find_next_zero_bit(dc->disk.full_dirty_stripes,
						 dc->disk.nr_stripes, stripe);

		buf->last_scanned = KEY(dc->disk.id,
					stripe * dc->disk.stripe_size, 0);

		bch_refill_keybuf(dc->disk.c, buf,
				  &KEY(dc->disk.id,
				       next_stripe * dc->disk.stripe_size, 0),
				  dirty_pred);

		if (array_freelist_empty(&buf->freelist))
			return;

		stripe = next_stripe;
next:
		if (wrapped && stripe > start_stripe)
			return;

		if (stripe == dc->disk.nr_stripes) {
			stripe = 0;
			wrapped = true;
		}
370 371 372
	}
}

373 374 375
/*
 * Returns true if we scanned the entire disk
 */
376 377 378
static bool refill_dirty(struct cached_dev *dc)
{
	struct keybuf *buf = &dc->writeback_keys;
379
	struct bkey start = KEY(dc->disk.id, 0, 0);
380
	struct bkey end = KEY(dc->disk.id, MAX_KEY_OFFSET, 0);
381 382 383 384 385 386 387 388 389 390
	struct bkey start_pos;

	/*
	 * make sure keybuf pos is inside the range for this disk - at bringup
	 * we might not be attached yet so this disk's inode nr isn't
	 * initialized then
	 */
	if (bkey_cmp(&buf->last_scanned, &start) < 0 ||
	    bkey_cmp(&buf->last_scanned, &end) > 0)
		buf->last_scanned = start;
391 392 393 394 395 396

	if (dc->partial_stripes_expensive) {
		refill_full_stripes(dc);
		if (array_freelist_empty(&buf->freelist))
			return false;
	}
397

398
	start_pos = buf->last_scanned;
399
	bch_refill_keybuf(dc->disk.c, buf, &end, dirty_pred);
400

401 402 403 404 405 406 407 408 409 410 411
	if (bkey_cmp(&buf->last_scanned, &end) < 0)
		return false;

	/*
	 * If we get to the end start scanning again from the beginning, and
	 * only scan up to where we initially started scanning from:
	 */
	buf->last_scanned = start;
	bch_refill_keybuf(dc->disk.c, buf, &start_pos, dirty_pred);

	return bkey_cmp(&buf->last_scanned, &start_pos) >= 0;
412 413 414 415 416 417 418 419 420 421
}

static int bch_writeback_thread(void *arg)
{
	struct cached_dev *dc = arg;
	bool searched_full_index;

	while (!kthread_should_stop()) {
		down_write(&dc->writeback_lock);
		if (!atomic_read(&dc->has_dirty) ||
422
		    (!test_bit(BCACHE_DEV_DETACHING, &dc->disk.flags) &&
423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453
		     !dc->writeback_running)) {
			up_write(&dc->writeback_lock);
			set_current_state(TASK_INTERRUPTIBLE);

			if (kthread_should_stop())
				return 0;

			schedule();
			continue;
		}

		searched_full_index = refill_dirty(dc);

		if (searched_full_index &&
		    RB_EMPTY_ROOT(&dc->writeback_keys.keys)) {
			atomic_set(&dc->has_dirty, 0);
			cached_dev_put(dc);
			SET_BDEV_STATE(&dc->sb, BDEV_STATE_CLEAN);
			bch_write_bdev_super(dc, NULL);
		}

		up_write(&dc->writeback_lock);

		bch_ratelimit_reset(&dc->writeback_rate);
		read_dirty(dc);

		if (searched_full_index) {
			unsigned delay = dc->writeback_delay * HZ;

			while (delay &&
			       !kthread_should_stop() &&
454
			       !test_bit(BCACHE_DEV_DETACHING, &dc->disk.flags))
455
				delay = schedule_timeout_interruptible(delay);
456 457 458 459
		}
	}

	return 0;
K
Kent Overstreet 已提交
460 461
}

462 463
/* Init */

K
Kent Overstreet 已提交
464 465 466 467 468 469
struct sectors_dirty_init {
	struct btree_op	op;
	unsigned	inode;
};

static int sectors_dirty_init_fn(struct btree_op *_op, struct btree *b,
470
				 struct bkey *k)
471
{
K
Kent Overstreet 已提交
472 473
	struct sectors_dirty_init *op = container_of(_op,
						struct sectors_dirty_init, op);
474 475
	if (KEY_INODE(k) > op->inode)
		return MAP_DONE;
476

477 478 479 480 481
	if (KEY_DIRTY(k))
		bcache_dev_sectors_dirty_add(b->c, KEY_INODE(k),
					     KEY_START(k), KEY_SIZE(k));

	return MAP_CONTINUE;
482 483 484 485
}

void bch_sectors_dirty_init(struct cached_dev *dc)
{
K
Kent Overstreet 已提交
486
	struct sectors_dirty_init op;
487

K
Kent Overstreet 已提交
488
	bch_btree_op_init(&op.op, -1);
489 490
	op.inode = dc->disk.id;

K
Kent Overstreet 已提交
491
	bch_btree_map_keys(&op.op, dc->disk.c, &KEY(op.inode, 0, 0),
492
			   sectors_dirty_init_fn, 0);
493 494

	dc->disk.sectors_dirty_last = bcache_dev_sectors_dirty(&dc->disk);
495 496
}

497
void bch_cached_dev_writeback_init(struct cached_dev *dc)
K
Kent Overstreet 已提交
498
{
499
	sema_init(&dc->in_flight, 64);
K
Kent Overstreet 已提交
500
	init_rwsem(&dc->writeback_lock);
K
Kent Overstreet 已提交
501
	bch_keybuf_init(&dc->writeback_keys);
K
Kent Overstreet 已提交
502 503 504 505 506 507 508

	dc->writeback_metadata		= true;
	dc->writeback_running		= true;
	dc->writeback_percent		= 10;
	dc->writeback_delay		= 30;
	dc->writeback_rate.rate		= 1024;

509 510 511
	dc->writeback_rate_update_seconds = 5;
	dc->writeback_rate_d_term	= 30;
	dc->writeback_rate_p_term_inverse = 6000;
K
Kent Overstreet 已提交
512

513 514 515 516 517
	INIT_DELAYED_WORK(&dc->writeback_rate_update, update_writeback_rate);
}

int bch_cached_dev_writeback_start(struct cached_dev *dc)
{
518 519 520 521 522
	dc->writeback_thread = kthread_create(bch_writeback_thread, dc,
					      "bcache_writeback");
	if (IS_ERR(dc->writeback_thread))
		return PTR_ERR(dc->writeback_thread);

K
Kent Overstreet 已提交
523 524 525
	schedule_delayed_work(&dc->writeback_rate_update,
			      dc->writeback_rate_update_seconds * HZ);

526 527
	bch_writeback_queue(dc);

K
Kent Overstreet 已提交
528 529
	return 0;
}