2 * background writeback - scan btree for dirty data and write it to the backing
5 * Copyright 2010, 2011 Kent Overstreet <kent.overstreet@gmail.com>
6 * Copyright 2012 Google, Inc.
12 #include "writeback.h"
14 #include <linux/delay.h>
15 #include <linux/freezer.h>
16 #include <linux/kthread.h>
17 #include <trace/events/bcache.h>
21 static void __update_writeback_rate(struct cached_dev *dc)
23 struct cache_set *c = dc->disk.c;
24 uint64_t cache_sectors = c->nbuckets * c->sb.bucket_size;
25 uint64_t cache_dirty_target =
26 div_u64(cache_sectors * dc->writeback_percent, 100);
28 int64_t target = div64_u64(cache_dirty_target * bdev_sectors(dc->bdev),
29 c->cached_dev_sectors);
33 int64_t dirty = bcache_dev_sectors_dirty(&dc->disk);
34 int64_t derivative = dirty - dc->disk.sectors_dirty_last;
35 int64_t proportional = dirty - target;
38 dc->disk.sectors_dirty_last = dirty;
40 /* Scale to sectors per second */
42 proportional *= dc->writeback_rate_update_seconds;
43 proportional = div_s64(proportional, dc->writeback_rate_p_term_inverse);
45 derivative = div_s64(derivative, dc->writeback_rate_update_seconds);
47 derivative = ewma_add(dc->disk.sectors_dirty_derivative, derivative,
48 (dc->writeback_rate_d_term /
49 dc->writeback_rate_update_seconds) ?: 1, 0);
51 derivative *= dc->writeback_rate_d_term;
52 derivative = div_s64(derivative, dc->writeback_rate_p_term_inverse);
54 change = proportional + derivative;
56 /* Don't increase writeback rate if the device isn't keeping up */
58 time_after64(local_clock(),
59 dc->writeback_rate.next + NSEC_PER_MSEC))
62 dc->writeback_rate.rate =
63 clamp_t(int64_t, (int64_t) dc->writeback_rate.rate + change,
66 dc->writeback_rate_proportional = proportional;
67 dc->writeback_rate_derivative = derivative;
68 dc->writeback_rate_change = change;
69 dc->writeback_rate_target = target;
72 static void update_writeback_rate(struct work_struct *work)
74 struct cached_dev *dc = container_of(to_delayed_work(work),
76 writeback_rate_update);
78 down_read(&dc->writeback_lock);
80 if (atomic_read(&dc->has_dirty) &&
81 dc->writeback_percent)
82 __update_writeback_rate(dc);
84 up_read(&dc->writeback_lock);
86 schedule_delayed_work(&dc->writeback_rate_update,
87 dc->writeback_rate_update_seconds * HZ);
90 static unsigned writeback_delay(struct cached_dev *dc, unsigned sectors)
92 if (test_bit(BCACHE_DEV_DETACHING, &dc->disk.flags) ||
93 !dc->writeback_percent)
96 return bch_next_delay(&dc->writeback_rate, sectors);
101 struct cached_dev *dc;
105 static void dirty_init(struct keybuf_key *w)
107 struct dirty_io *io = w->private;
108 struct bio *bio = &io->bio;
111 if (!io->dc->writeback_percent)
112 bio_set_prio(bio, IOPRIO_PRIO_VALUE(IOPRIO_CLASS_IDLE, 0));
114 bio->bi_iter.bi_size = KEY_SIZE(&w->key) << 9;
115 bio->bi_max_vecs = DIV_ROUND_UP(KEY_SIZE(&w->key), PAGE_SECTORS);
117 bio->bi_io_vec = bio->bi_inline_vecs;
118 bch_bio_map(bio, NULL);
121 static void dirty_io_destructor(struct closure *cl)
123 struct dirty_io *io = container_of(cl, struct dirty_io, cl);
127 static void write_dirty_finish(struct closure *cl)
129 struct dirty_io *io = container_of(cl, struct dirty_io, cl);
130 struct keybuf_key *w = io->bio.bi_private;
131 struct cached_dev *dc = io->dc;
135 bio_for_each_segment_all(bv, &io->bio, i)
136 __free_page(bv->bv_page);
138 /* This is kind of a dumb way of signalling errors. */
139 if (KEY_DIRTY(&w->key)) {
144 bch_keylist_init(&keys);
146 bkey_copy(keys.top, &w->key);
147 SET_KEY_DIRTY(keys.top, false);
148 bch_keylist_push(&keys);
150 for (i = 0; i < KEY_PTRS(&w->key); i++)
151 atomic_inc(&PTR_BUCKET(dc->disk.c, &w->key, i)->pin);
153 ret = bch_btree_insert(dc->disk.c, &keys, NULL, &w->key);
156 trace_bcache_writeback_collision(&w->key);
159 ? &dc->disk.c->writeback_keys_failed
160 : &dc->disk.c->writeback_keys_done);
163 bch_keybuf_del(&dc->writeback_keys, w);
166 closure_return_with_destructor(cl, dirty_io_destructor);
169 static void dirty_endio(struct bio *bio, int error)
171 struct keybuf_key *w = bio->bi_private;
172 struct dirty_io *io = w->private;
175 SET_KEY_DIRTY(&w->key, false);
177 closure_put(&io->cl);
180 static void write_dirty(struct closure *cl)
182 struct dirty_io *io = container_of(cl, struct dirty_io, cl);
183 struct keybuf_key *w = io->bio.bi_private;
186 io->bio.bi_rw = WRITE;
187 io->bio.bi_iter.bi_sector = KEY_START(&w->key);
188 io->bio.bi_bdev = io->dc->bdev;
189 io->bio.bi_end_io = dirty_endio;
191 closure_bio_submit(&io->bio, cl, &io->dc->disk);
193 continue_at(cl, write_dirty_finish, system_wq);
196 static void read_dirty_endio(struct bio *bio, int error)
198 struct keybuf_key *w = bio->bi_private;
199 struct dirty_io *io = w->private;
201 bch_count_io_errors(PTR_CACHE(io->dc->disk.c, &w->key, 0),
202 error, "reading dirty data from cache");
204 dirty_endio(bio, error);
207 static void read_dirty_submit(struct closure *cl)
209 struct dirty_io *io = container_of(cl, struct dirty_io, cl);
211 closure_bio_submit(&io->bio, cl, &io->dc->disk);
213 continue_at(cl, write_dirty, system_wq);
216 static void read_dirty(struct cached_dev *dc)
219 struct keybuf_key *w;
223 closure_init_stack(&cl);
226 * XXX: if we error, background writeback just spins. Should use some
230 while (!kthread_should_stop()) {
233 w = bch_keybuf_next(&dc->writeback_keys);
237 BUG_ON(ptr_stale(dc->disk.c, &w->key, 0));
239 if (KEY_START(&w->key) != dc->last_read ||
240 jiffies_to_msecs(delay) > 50)
241 while (!kthread_should_stop() && delay)
242 delay = schedule_timeout_uninterruptible(delay);
244 dc->last_read = KEY_OFFSET(&w->key);
246 io = kzalloc(sizeof(struct dirty_io) + sizeof(struct bio_vec)
247 * DIV_ROUND_UP(KEY_SIZE(&w->key), PAGE_SECTORS),
256 io->bio.bi_iter.bi_sector = PTR_OFFSET(&w->key, 0);
257 io->bio.bi_bdev = PTR_CACHE(dc->disk.c,
259 io->bio.bi_rw = READ;
260 io->bio.bi_end_io = read_dirty_endio;
262 if (bio_alloc_pages(&io->bio, GFP_KERNEL))
265 trace_bcache_writeback(&w->key);
267 down(&dc->in_flight);
268 closure_call(&io->cl, read_dirty_submit, NULL, &cl);
270 delay = writeback_delay(dc, KEY_SIZE(&w->key));
277 bch_keybuf_del(&dc->writeback_keys, w);
281 * Wait for outstanding writeback IOs to finish (and keybuf slots to be
282 * freed) before refilling again
287 /* Scan for dirty data */
289 void bcache_dev_sectors_dirty_add(struct cache_set *c, unsigned inode,
290 uint64_t offset, int nr_sectors)
292 struct bcache_device *d = c->devices[inode];
293 unsigned stripe_offset, stripe, sectors_dirty;
298 stripe = offset_to_stripe(d, offset);
299 stripe_offset = offset & (d->stripe_size - 1);
302 int s = min_t(unsigned, abs(nr_sectors),
303 d->stripe_size - stripe_offset);
308 if (stripe >= d->nr_stripes)
311 sectors_dirty = atomic_add_return(s,
312 d->stripe_sectors_dirty + stripe);
313 if (sectors_dirty == d->stripe_size)
314 set_bit(stripe, d->full_dirty_stripes);
316 clear_bit(stripe, d->full_dirty_stripes);
324 static bool dirty_pred(struct keybuf *buf, struct bkey *k)
329 static void refill_full_stripes(struct cached_dev *dc)
331 struct keybuf *buf = &dc->writeback_keys;
332 unsigned start_stripe, stripe, next_stripe;
333 bool wrapped = false;
335 stripe = offset_to_stripe(&dc->disk, KEY_OFFSET(&buf->last_scanned));
337 if (stripe >= dc->disk.nr_stripes)
340 start_stripe = stripe;
343 stripe = find_next_bit(dc->disk.full_dirty_stripes,
344 dc->disk.nr_stripes, stripe);
346 if (stripe == dc->disk.nr_stripes)
349 next_stripe = find_next_zero_bit(dc->disk.full_dirty_stripes,
350 dc->disk.nr_stripes, stripe);
352 buf->last_scanned = KEY(dc->disk.id,
353 stripe * dc->disk.stripe_size, 0);
355 bch_refill_keybuf(dc->disk.c, buf,
357 next_stripe * dc->disk.stripe_size, 0),
360 if (array_freelist_empty(&buf->freelist))
363 stripe = next_stripe;
365 if (wrapped && stripe > start_stripe)
368 if (stripe == dc->disk.nr_stripes) {
375 static bool refill_dirty(struct cached_dev *dc)
377 struct keybuf *buf = &dc->writeback_keys;
378 struct bkey end = KEY(dc->disk.id, MAX_KEY_OFFSET, 0);
379 bool searched_from_start = false;
381 if (dc->partial_stripes_expensive) {
382 refill_full_stripes(dc);
383 if (array_freelist_empty(&buf->freelist))
387 if (bkey_cmp(&buf->last_scanned, &end) >= 0) {
388 buf->last_scanned = KEY(dc->disk.id, 0, 0);
389 searched_from_start = true;
392 bch_refill_keybuf(dc->disk.c, buf, &end, dirty_pred);
394 return bkey_cmp(&buf->last_scanned, &end) >= 0 && searched_from_start;
397 static int bch_writeback_thread(void *arg)
399 struct cached_dev *dc = arg;
400 bool searched_full_index;
402 while (!kthread_should_stop()) {
403 down_write(&dc->writeback_lock);
404 if (!atomic_read(&dc->has_dirty) ||
405 (!test_bit(BCACHE_DEV_DETACHING, &dc->disk.flags) &&
406 !dc->writeback_running)) {
407 up_write(&dc->writeback_lock);
408 set_current_state(TASK_INTERRUPTIBLE);
410 if (kthread_should_stop())
418 searched_full_index = refill_dirty(dc);
420 if (searched_full_index &&
421 RB_EMPTY_ROOT(&dc->writeback_keys.keys)) {
422 atomic_set(&dc->has_dirty, 0);
424 SET_BDEV_STATE(&dc->sb, BDEV_STATE_CLEAN);
425 bch_write_bdev_super(dc, NULL);
428 up_write(&dc->writeback_lock);
430 bch_ratelimit_reset(&dc->writeback_rate);
433 if (searched_full_index) {
434 unsigned delay = dc->writeback_delay * HZ;
437 !kthread_should_stop() &&
438 !test_bit(BCACHE_DEV_DETACHING, &dc->disk.flags))
439 delay = schedule_timeout_uninterruptible(delay);
448 struct sectors_dirty_init {
453 static int sectors_dirty_init_fn(struct btree_op *_op, struct btree *b,
456 struct sectors_dirty_init *op = container_of(_op,
457 struct sectors_dirty_init, op);
458 if (KEY_INODE(k) > op->inode)
462 bcache_dev_sectors_dirty_add(b->c, KEY_INODE(k),
463 KEY_START(k), KEY_SIZE(k));
468 void bch_sectors_dirty_init(struct cached_dev *dc)
470 struct sectors_dirty_init op;
472 bch_btree_op_init(&op.op, -1);
473 op.inode = dc->disk.id;
475 bch_btree_map_keys(&op.op, dc->disk.c, &KEY(op.inode, 0, 0),
476 sectors_dirty_init_fn, 0);
478 dc->disk.sectors_dirty_last = bcache_dev_sectors_dirty(&dc->disk);
481 int bch_cached_dev_writeback_init(struct cached_dev *dc)
483 sema_init(&dc->in_flight, 64);
484 init_rwsem(&dc->writeback_lock);
485 bch_keybuf_init(&dc->writeback_keys);
487 dc->writeback_metadata = true;
488 dc->writeback_running = true;
489 dc->writeback_percent = 10;
490 dc->writeback_delay = 30;
491 dc->writeback_rate.rate = 1024;
493 dc->writeback_rate_update_seconds = 5;
494 dc->writeback_rate_d_term = 30;
495 dc->writeback_rate_p_term_inverse = 6000;
497 dc->writeback_thread = kthread_create(bch_writeback_thread, dc,
499 if (IS_ERR(dc->writeback_thread))
500 return PTR_ERR(dc->writeback_thread);
502 INIT_DELAYED_WORK(&dc->writeback_rate_update, update_writeback_rate);
503 schedule_delayed_work(&dc->writeback_rate_update,
504 dc->writeback_rate_update_seconds * HZ);