Commit | Line | Data |
---|---|---|
cafe5635 KO |
1 | /* |
2 | * bcache journalling code, for btree insertions | |
3 | * | |
4 | * Copyright 2012 Google, Inc. | |
5 | */ | |
6 | ||
7 | #include "bcache.h" | |
8 | #include "btree.h" | |
9 | #include "debug.h" | |
cafe5635 | 10 | |
c37511b8 KO |
11 | #include <trace/events/bcache.h> |
12 | ||
cafe5635 KO |
13 | /* |
14 | * Journal replay/recovery: | |
15 | * | |
16 | * This code is all driven from run_cache_set(); we first read the journal | |
17 | * entries, do some other stuff, then we mark all the keys in the journal | |
18 | * entries (same as garbage collection would), then we replay them - reinserting | |
19 | * them into the cache in precisely the same order as they appear in the | |
20 | * journal. | |
21 | * | |
22 | * We only journal keys that go in leaf nodes, which simplifies things quite a | |
23 | * bit. | |
24 | */ | |
25 | ||
26 | static void journal_read_endio(struct bio *bio, int error) | |
27 | { | |
28 | struct closure *cl = bio->bi_private; | |
29 | closure_put(cl); | |
30 | } | |
31 | ||
32 | static int journal_read_bucket(struct cache *ca, struct list_head *list, | |
c18536a7 | 33 | unsigned bucket_index) |
cafe5635 KO |
34 | { |
35 | struct journal_device *ja = &ca->journal; | |
36 | struct bio *bio = &ja->bio; | |
37 | ||
38 | struct journal_replay *i; | |
39 | struct jset *j, *data = ca->set->journal.w[0].data; | |
c18536a7 | 40 | struct closure cl; |
cafe5635 KO |
41 | unsigned len, left, offset = 0; |
42 | int ret = 0; | |
43 | sector_t bucket = bucket_to_sector(ca->set, ca->sb.d[bucket_index]); | |
44 | ||
c18536a7 KO |
45 | closure_init_stack(&cl); |
46 | ||
b3fa7e77 | 47 | pr_debug("reading %u", bucket_index); |
cafe5635 KO |
48 | |
49 | while (offset < ca->sb.bucket_size) { | |
50 | reread: left = ca->sb.bucket_size - offset; | |
b3fa7e77 | 51 | len = min_t(unsigned, left, PAGE_SECTORS << JSET_BITS); |
cafe5635 KO |
52 | |
53 | bio_reset(bio); | |
4f024f37 | 54 | bio->bi_iter.bi_sector = bucket + offset; |
cafe5635 KO |
55 | bio->bi_bdev = ca->bdev; |
56 | bio->bi_rw = READ; | |
4f024f37 | 57 | bio->bi_iter.bi_size = len << 9; |
cafe5635 KO |
58 | |
59 | bio->bi_end_io = journal_read_endio; | |
c18536a7 | 60 | bio->bi_private = &cl; |
169ef1cf | 61 | bch_bio_map(bio, data); |
cafe5635 | 62 | |
c18536a7 KO |
63 | closure_bio_submit(bio, &cl, ca); |
64 | closure_sync(&cl); | |
cafe5635 KO |
65 | |
66 | /* This function could be simpler now since we no longer write | |
67 | * journal entries that overlap bucket boundaries; this means | |
68 | * the start of a bucket will always have a valid journal entry | |
69 | * if it has any journal entries at all. | |
70 | */ | |
71 | ||
72 | j = data; | |
73 | while (len) { | |
74 | struct list_head *where; | |
75 | size_t blocks, bytes = set_bytes(j); | |
76 | ||
b3fa7e77 KO |
77 | if (j->magic != jset_magic(&ca->sb)) { |
78 | pr_debug("%u: bad magic", bucket_index); | |
cafe5635 | 79 | return ret; |
b3fa7e77 | 80 | } |
cafe5635 | 81 | |
b3fa7e77 KO |
82 | if (bytes > left << 9 || |
83 | bytes > PAGE_SIZE << JSET_BITS) { | |
84 | pr_info("%u: too big, %zu bytes, offset %u", | |
85 | bucket_index, bytes, offset); | |
cafe5635 | 86 | return ret; |
b3fa7e77 | 87 | } |
cafe5635 KO |
88 | |
89 | if (bytes > len << 9) | |
90 | goto reread; | |
91 | ||
b3fa7e77 KO |
92 | if (j->csum != csum_set(j)) { |
93 | pr_info("%u: bad csum, %zu bytes, offset %u", | |
94 | bucket_index, bytes, offset); | |
cafe5635 | 95 | return ret; |
b3fa7e77 | 96 | } |
cafe5635 | 97 | |
ee811287 | 98 | blocks = set_blocks(j, block_bytes(ca->set)); |
cafe5635 KO |
99 | |
100 | while (!list_empty(list)) { | |
101 | i = list_first_entry(list, | |
102 | struct journal_replay, list); | |
103 | if (i->j.seq >= j->last_seq) | |
104 | break; | |
105 | list_del(&i->list); | |
106 | kfree(i); | |
107 | } | |
108 | ||
109 | list_for_each_entry_reverse(i, list, list) { | |
110 | if (j->seq == i->j.seq) | |
111 | goto next_set; | |
112 | ||
113 | if (j->seq < i->j.last_seq) | |
114 | goto next_set; | |
115 | ||
116 | if (j->seq > i->j.seq) { | |
117 | where = &i->list; | |
118 | goto add; | |
119 | } | |
120 | } | |
121 | ||
122 | where = list; | |
123 | add: | |
124 | i = kmalloc(offsetof(struct journal_replay, j) + | |
125 | bytes, GFP_KERNEL); | |
126 | if (!i) | |
127 | return -ENOMEM; | |
128 | memcpy(&i->j, j, bytes); | |
129 | list_add(&i->list, where); | |
130 | ret = 1; | |
131 | ||
132 | ja->seq[bucket_index] = j->seq; | |
133 | next_set: | |
134 | offset += blocks * ca->sb.block_size; | |
135 | len -= blocks * ca->sb.block_size; | |
136 | j = ((void *) j) + blocks * block_bytes(ca); | |
137 | } | |
138 | } | |
139 | ||
140 | return ret; | |
141 | } | |
142 | ||
c18536a7 | 143 | int bch_journal_read(struct cache_set *c, struct list_head *list) |
cafe5635 KO |
144 | { |
145 | #define read_bucket(b) \ | |
146 | ({ \ | |
c18536a7 | 147 | int ret = journal_read_bucket(ca, list, b); \ |
cafe5635 KO |
148 | __set_bit(b, bitmap); \ |
149 | if (ret < 0) \ | |
150 | return ret; \ | |
151 | ret; \ | |
152 | }) | |
153 | ||
154 | struct cache *ca; | |
155 | unsigned iter; | |
156 | ||
157 | for_each_cache(ca, c, iter) { | |
158 | struct journal_device *ja = &ca->journal; | |
159 | unsigned long bitmap[SB_JOURNAL_BUCKETS / BITS_PER_LONG]; | |
160 | unsigned i, l, r, m; | |
161 | uint64_t seq; | |
162 | ||
163 | bitmap_zero(bitmap, SB_JOURNAL_BUCKETS); | |
164 | pr_debug("%u journal buckets", ca->sb.njournal_buckets); | |
165 | ||
c426c4fd KO |
166 | /* |
167 | * Read journal buckets ordered by golden ratio hash to quickly | |
cafe5635 KO |
168 | * find a sequence of buckets with valid journal entries |
169 | */ | |
170 | for (i = 0; i < ca->sb.njournal_buckets; i++) { | |
171 | l = (i * 2654435769U) % ca->sb.njournal_buckets; | |
172 | ||
173 | if (test_bit(l, bitmap)) | |
174 | break; | |
175 | ||
176 | if (read_bucket(l)) | |
177 | goto bsearch; | |
178 | } | |
179 | ||
c426c4fd KO |
180 | /* |
181 | * If that fails, check all the buckets we haven't checked | |
cafe5635 KO |
182 | * already |
183 | */ | |
184 | pr_debug("falling back to linear search"); | |
185 | ||
c426c4fd KO |
186 | for (l = find_first_zero_bit(bitmap, ca->sb.njournal_buckets); |
187 | l < ca->sb.njournal_buckets; | |
188 | l = find_next_zero_bit(bitmap, ca->sb.njournal_buckets, l + 1)) | |
cafe5635 KO |
189 | if (read_bucket(l)) |
190 | goto bsearch; | |
c426c4fd KO |
191 | |
192 | if (list_empty(list)) | |
193 | continue; | |
cafe5635 KO |
194 | bsearch: |
195 | /* Binary search */ | |
196 | m = r = find_next_bit(bitmap, ca->sb.njournal_buckets, l + 1); | |
197 | pr_debug("starting binary search, l %u r %u", l, r); | |
198 | ||
199 | while (l + 1 < r) { | |
faa56736 KO |
200 | seq = list_entry(list->prev, struct journal_replay, |
201 | list)->j.seq; | |
202 | ||
cafe5635 | 203 | m = (l + r) >> 1; |
faa56736 | 204 | read_bucket(m); |
cafe5635 | 205 | |
faa56736 KO |
206 | if (seq != list_entry(list->prev, struct journal_replay, |
207 | list)->j.seq) | |
cafe5635 KO |
208 | l = m; |
209 | else | |
210 | r = m; | |
211 | } | |
212 | ||
c426c4fd KO |
213 | /* |
214 | * Read buckets in reverse order until we stop finding more | |
cafe5635 KO |
215 | * journal entries |
216 | */ | |
c426c4fd KO |
217 | pr_debug("finishing up: m %u njournal_buckets %u", |
218 | m, ca->sb.njournal_buckets); | |
cafe5635 KO |
219 | l = m; |
220 | ||
221 | while (1) { | |
222 | if (!l--) | |
223 | l = ca->sb.njournal_buckets - 1; | |
224 | ||
225 | if (l == m) | |
226 | break; | |
227 | ||
228 | if (test_bit(l, bitmap)) | |
229 | continue; | |
230 | ||
231 | if (!read_bucket(l)) | |
232 | break; | |
233 | } | |
234 | ||
235 | seq = 0; | |
236 | ||
237 | for (i = 0; i < ca->sb.njournal_buckets; i++) | |
238 | if (ja->seq[i] > seq) { | |
239 | seq = ja->seq[i]; | |
240 | ja->cur_idx = ja->discard_idx = | |
241 | ja->last_idx = i; | |
242 | ||
243 | } | |
244 | } | |
245 | ||
c426c4fd KO |
246 | if (!list_empty(list)) |
247 | c->journal.seq = list_entry(list->prev, | |
248 | struct journal_replay, | |
249 | list)->j.seq; | |
cafe5635 KO |
250 | |
251 | return 0; | |
252 | #undef read_bucket | |
253 | } | |
254 | ||
255 | void bch_journal_mark(struct cache_set *c, struct list_head *list) | |
256 | { | |
257 | atomic_t p = { 0 }; | |
258 | struct bkey *k; | |
259 | struct journal_replay *i; | |
260 | struct journal *j = &c->journal; | |
261 | uint64_t last = j->seq; | |
262 | ||
263 | /* | |
264 | * journal.pin should never fill up - we never write a journal | |
265 | * entry when it would fill up. But if for some reason it does, we | |
266 | * iterate over the list in reverse order so that we can just skip that | |
267 | * refcount instead of bugging. | |
268 | */ | |
269 | ||
270 | list_for_each_entry_reverse(i, list, list) { | |
271 | BUG_ON(last < i->j.seq); | |
272 | i->pin = NULL; | |
273 | ||
274 | while (last-- != i->j.seq) | |
275 | if (fifo_free(&j->pin) > 1) { | |
276 | fifo_push_front(&j->pin, p); | |
277 | atomic_set(&fifo_front(&j->pin), 0); | |
278 | } | |
279 | ||
280 | if (fifo_free(&j->pin) > 1) { | |
281 | fifo_push_front(&j->pin, p); | |
282 | i->pin = &fifo_front(&j->pin); | |
283 | atomic_set(i->pin, 1); | |
284 | } | |
285 | ||
286 | for (k = i->j.start; | |
fafff81c | 287 | k < bset_bkey_last(&i->j); |
cafe5635 KO |
288 | k = bkey_next(k)) { |
289 | unsigned j; | |
65ddf45a | 290 | struct bucket *g; |
cafe5635 KO |
291 | |
292 | for (j = 0; j < KEY_PTRS(k); j++) { | |
65ddf45a KO |
293 | if (!ptr_available(c, k, j)) |
294 | continue; | |
295 | ||
296 | g = PTR_BUCKET(c, k, j); | |
cafe5635 KO |
297 | atomic_inc(&g->pin); |
298 | ||
299 | if (g->prio == BTREE_PRIO && | |
300 | !ptr_stale(c, k, j)) | |
301 | g->prio = INITIAL_PRIO; | |
302 | } | |
303 | ||
304 | __bch_btree_mark_key(c, 0, k); | |
305 | } | |
306 | } | |
307 | } | |
308 | ||
c18536a7 | 309 | int bch_journal_replay(struct cache_set *s, struct list_head *list) |
cafe5635 KO |
310 | { |
311 | int ret = 0, keys = 0, entries = 0; | |
312 | struct bkey *k; | |
313 | struct journal_replay *i = | |
314 | list_entry(list->prev, struct journal_replay, list); | |
315 | ||
316 | uint64_t start = i->j.last_seq, end = i->j.seq, n = start; | |
0b93207a KO |
317 | struct keylist keylist; |
318 | ||
319 | bch_keylist_init(&keylist); | |
cafe5635 KO |
320 | |
321 | list_for_each_entry(i, list, list) { | |
322 | BUG_ON(i->pin && atomic_read(i->pin) != 1); | |
323 | ||
77c320eb KO |
324 | cache_set_err_on(n != i->j.seq, s, |
325 | "bcache: journal entries %llu-%llu missing! (replaying %llu-%llu)", | |
326 | n, i->j.seq - 1, start, end); | |
cafe5635 KO |
327 | |
328 | for (k = i->j.start; | |
fafff81c | 329 | k < bset_bkey_last(&i->j); |
cafe5635 | 330 | k = bkey_next(k)) { |
c37511b8 KO |
331 | trace_bcache_journal_replay_key(k); |
332 | ||
0b93207a KO |
333 | bkey_copy(keylist.top, k); |
334 | bch_keylist_push(&keylist); | |
cafe5635 | 335 | |
cc7b8819 | 336 | ret = bch_btree_insert(s, &keylist, i->pin, NULL); |
cafe5635 KO |
337 | if (ret) |
338 | goto err; | |
339 | ||
0b93207a | 340 | BUG_ON(!bch_keylist_empty(&keylist)); |
cafe5635 KO |
341 | keys++; |
342 | ||
343 | cond_resched(); | |
344 | } | |
345 | ||
346 | if (i->pin) | |
347 | atomic_dec(i->pin); | |
348 | n = i->j.seq + 1; | |
349 | entries++; | |
350 | } | |
351 | ||
352 | pr_info("journal replay done, %i keys in %i entries, seq %llu", | |
353 | keys, entries, end); | |
b54d6934 | 354 | err: |
cafe5635 KO |
355 | while (!list_empty(list)) { |
356 | i = list_first_entry(list, struct journal_replay, list); | |
357 | list_del(&i->list); | |
358 | kfree(i); | |
359 | } | |
b54d6934 | 360 | |
cafe5635 KO |
361 | return ret; |
362 | } | |
363 | ||
364 | /* Journalling */ | |
365 | ||
366 | static void btree_flush_write(struct cache_set *c) | |
367 | { | |
368 | /* | |
369 | * Try to find the btree node with that references the oldest journal | |
370 | * entry, best is our current candidate and is locked if non NULL: | |
371 | */ | |
a34a8bfd KO |
372 | struct btree *b, *best; |
373 | unsigned i; | |
374 | retry: | |
375 | best = NULL; | |
376 | ||
377 | for_each_cached_btree(b, c, i) | |
378 | if (btree_current_write(b)->journal) { | |
379 | if (!best) | |
380 | best = b; | |
381 | else if (journal_pin_cmp(c, | |
c18536a7 KO |
382 | btree_current_write(best)->journal, |
383 | btree_current_write(b)->journal)) { | |
a34a8bfd KO |
384 | best = b; |
385 | } | |
386 | } | |
cafe5635 | 387 | |
a34a8bfd KO |
388 | b = best; |
389 | if (b) { | |
390 | rw_lock(true, b, b->level); | |
cafe5635 | 391 | |
a34a8bfd | 392 | if (!btree_current_write(b)->journal) { |
cafe5635 | 393 | rw_unlock(true, b); |
a34a8bfd KO |
394 | /* We raced */ |
395 | goto retry; | |
cafe5635 KO |
396 | } |
397 | ||
a34a8bfd KO |
398 | bch_btree_node_write(b, NULL); |
399 | rw_unlock(true, b); | |
cafe5635 | 400 | } |
cafe5635 KO |
401 | } |
402 | ||
403 | #define last_seq(j) ((j)->seq - fifo_used(&(j)->pin) + 1) | |
404 | ||
405 | static void journal_discard_endio(struct bio *bio, int error) | |
406 | { | |
407 | struct journal_device *ja = | |
408 | container_of(bio, struct journal_device, discard_bio); | |
409 | struct cache *ca = container_of(ja, struct cache, journal); | |
410 | ||
411 | atomic_set(&ja->discard_in_flight, DISCARD_DONE); | |
412 | ||
413 | closure_wake_up(&ca->set->journal.wait); | |
414 | closure_put(&ca->set->cl); | |
415 | } | |
416 | ||
417 | static void journal_discard_work(struct work_struct *work) | |
418 | { | |
419 | struct journal_device *ja = | |
420 | container_of(work, struct journal_device, discard_work); | |
421 | ||
422 | submit_bio(0, &ja->discard_bio); | |
423 | } | |
424 | ||
425 | static void do_journal_discard(struct cache *ca) | |
426 | { | |
427 | struct journal_device *ja = &ca->journal; | |
428 | struct bio *bio = &ja->discard_bio; | |
429 | ||
430 | if (!ca->discard) { | |
431 | ja->discard_idx = ja->last_idx; | |
432 | return; | |
433 | } | |
434 | ||
6d9d21e3 | 435 | switch (atomic_read(&ja->discard_in_flight)) { |
cafe5635 KO |
436 | case DISCARD_IN_FLIGHT: |
437 | return; | |
438 | ||
439 | case DISCARD_DONE: | |
440 | ja->discard_idx = (ja->discard_idx + 1) % | |
441 | ca->sb.njournal_buckets; | |
442 | ||
443 | atomic_set(&ja->discard_in_flight, DISCARD_READY); | |
444 | /* fallthrough */ | |
445 | ||
446 | case DISCARD_READY: | |
447 | if (ja->discard_idx == ja->last_idx) | |
448 | return; | |
449 | ||
450 | atomic_set(&ja->discard_in_flight, DISCARD_IN_FLIGHT); | |
451 | ||
452 | bio_init(bio); | |
4f024f37 | 453 | bio->bi_iter.bi_sector = bucket_to_sector(ca->set, |
b1a67b0f | 454 | ca->sb.d[ja->discard_idx]); |
cafe5635 KO |
455 | bio->bi_bdev = ca->bdev; |
456 | bio->bi_rw = REQ_WRITE|REQ_DISCARD; | |
457 | bio->bi_max_vecs = 1; | |
458 | bio->bi_io_vec = bio->bi_inline_vecs; | |
4f024f37 | 459 | bio->bi_iter.bi_size = bucket_bytes(ca); |
cafe5635 KO |
460 | bio->bi_end_io = journal_discard_endio; |
461 | ||
462 | closure_get(&ca->set->cl); | |
463 | INIT_WORK(&ja->discard_work, journal_discard_work); | |
464 | schedule_work(&ja->discard_work); | |
465 | } | |
466 | } | |
467 | ||
468 | static void journal_reclaim(struct cache_set *c) | |
469 | { | |
470 | struct bkey *k = &c->journal.key; | |
471 | struct cache *ca; | |
472 | uint64_t last_seq; | |
473 | unsigned iter, n = 0; | |
474 | atomic_t p; | |
475 | ||
476 | while (!atomic_read(&fifo_front(&c->journal.pin))) | |
477 | fifo_pop(&c->journal.pin, p); | |
478 | ||
479 | last_seq = last_seq(&c->journal); | |
480 | ||
481 | /* Update last_idx */ | |
482 | ||
483 | for_each_cache(ca, c, iter) { | |
484 | struct journal_device *ja = &ca->journal; | |
485 | ||
486 | while (ja->last_idx != ja->cur_idx && | |
487 | ja->seq[ja->last_idx] < last_seq) | |
488 | ja->last_idx = (ja->last_idx + 1) % | |
489 | ca->sb.njournal_buckets; | |
490 | } | |
491 | ||
492 | for_each_cache(ca, c, iter) | |
493 | do_journal_discard(ca); | |
494 | ||
495 | if (c->journal.blocks_free) | |
a34a8bfd | 496 | goto out; |
cafe5635 KO |
497 | |
498 | /* | |
499 | * Allocate: | |
500 | * XXX: Sort by free journal space | |
501 | */ | |
502 | ||
503 | for_each_cache(ca, c, iter) { | |
504 | struct journal_device *ja = &ca->journal; | |
505 | unsigned next = (ja->cur_idx + 1) % ca->sb.njournal_buckets; | |
506 | ||
507 | /* No space available on this device */ | |
508 | if (next == ja->discard_idx) | |
509 | continue; | |
510 | ||
511 | ja->cur_idx = next; | |
512 | k->ptr[n++] = PTR(0, | |
513 | bucket_to_sector(c, ca->sb.d[ja->cur_idx]), | |
514 | ca->sb.nr_this_dev); | |
515 | } | |
516 | ||
517 | bkey_init(k); | |
518 | SET_KEY_PTRS(k, n); | |
519 | ||
520 | if (n) | |
521 | c->journal.blocks_free = c->sb.bucket_size >> c->block_bits; | |
a34a8bfd | 522 | out: |
cafe5635 KO |
523 | if (!journal_full(&c->journal)) |
524 | __closure_wake_up(&c->journal.wait); | |
525 | } | |
526 | ||
527 | void bch_journal_next(struct journal *j) | |
528 | { | |
529 | atomic_t p = { 1 }; | |
530 | ||
531 | j->cur = (j->cur == j->w) | |
532 | ? &j->w[1] | |
533 | : &j->w[0]; | |
534 | ||
535 | /* | |
536 | * The fifo_push() needs to happen at the same time as j->seq is | |
537 | * incremented for last_seq() to be calculated correctly | |
538 | */ | |
539 | BUG_ON(!fifo_push(&j->pin, p)); | |
540 | atomic_set(&fifo_back(&j->pin), 1); | |
541 | ||
542 | j->cur->data->seq = ++j->seq; | |
dabb4433 | 543 | j->cur->dirty = false; |
cafe5635 KO |
544 | j->cur->need_write = false; |
545 | j->cur->data->keys = 0; | |
546 | ||
547 | if (fifo_full(&j->pin)) | |
548 | pr_debug("journal_pin full (%zu)", fifo_used(&j->pin)); | |
549 | } | |
550 | ||
551 | static void journal_write_endio(struct bio *bio, int error) | |
552 | { | |
553 | struct journal_write *w = bio->bi_private; | |
554 | ||
555 | cache_set_err_on(error, w->c, "journal io error"); | |
7857d5d4 | 556 | closure_put(&w->c->journal.io); |
cafe5635 KO |
557 | } |
558 | ||
559 | static void journal_write(struct closure *); | |
560 | ||
561 | static void journal_write_done(struct closure *cl) | |
562 | { | |
7857d5d4 | 563 | struct journal *j = container_of(cl, struct journal, io); |
cafe5635 KO |
564 | struct journal_write *w = (j->cur == j->w) |
565 | ? &j->w[1] | |
566 | : &j->w[0]; | |
567 | ||
568 | __closure_wake_up(&w->wait); | |
7857d5d4 | 569 | continue_at_nobarrier(cl, journal_write, system_wq); |
cafe5635 KO |
570 | } |
571 | ||
cb7a583e KO |
572 | static void journal_write_unlock(struct closure *cl) |
573 | { | |
574 | struct cache_set *c = container_of(cl, struct cache_set, journal.io); | |
575 | ||
576 | c->journal.io_in_flight = 0; | |
577 | spin_unlock(&c->journal.lock); | |
578 | } | |
579 | ||
cafe5635 | 580 | static void journal_write_unlocked(struct closure *cl) |
c19ed23a | 581 | __releases(c->journal.lock) |
cafe5635 | 582 | { |
7857d5d4 | 583 | struct cache_set *c = container_of(cl, struct cache_set, journal.io); |
cafe5635 KO |
584 | struct cache *ca; |
585 | struct journal_write *w = c->journal.cur; | |
586 | struct bkey *k = &c->journal.key; | |
ee811287 KO |
587 | unsigned i, sectors = set_blocks(w->data, block_bytes(c)) * |
588 | c->sb.block_size; | |
cafe5635 KO |
589 | |
590 | struct bio *bio; | |
591 | struct bio_list list; | |
592 | bio_list_init(&list); | |
593 | ||
594 | if (!w->need_write) { | |
cb7a583e | 595 | closure_return_with_destructor(cl, journal_write_unlock); |
cafe5635 KO |
596 | } else if (journal_full(&c->journal)) { |
597 | journal_reclaim(c); | |
598 | spin_unlock(&c->journal.lock); | |
599 | ||
600 | btree_flush_write(c); | |
601 | continue_at(cl, journal_write, system_wq); | |
602 | } | |
603 | ||
ee811287 | 604 | c->journal.blocks_free -= set_blocks(w->data, block_bytes(c)); |
cafe5635 KO |
605 | |
606 | w->data->btree_level = c->root->level; | |
607 | ||
608 | bkey_copy(&w->data->btree_root, &c->root->key); | |
609 | bkey_copy(&w->data->uuid_bucket, &c->uuid_bucket); | |
610 | ||
611 | for_each_cache(ca, c, i) | |
612 | w->data->prio_bucket[ca->sb.nr_this_dev] = ca->prio_buckets[0]; | |
613 | ||
81ab4190 | 614 | w->data->magic = jset_magic(&c->sb); |
cafe5635 KO |
615 | w->data->version = BCACHE_JSET_VERSION; |
616 | w->data->last_seq = last_seq(&c->journal); | |
617 | w->data->csum = csum_set(w->data); | |
618 | ||
619 | for (i = 0; i < KEY_PTRS(k); i++) { | |
620 | ca = PTR_CACHE(c, k, i); | |
621 | bio = &ca->journal.bio; | |
622 | ||
623 | atomic_long_add(sectors, &ca->meta_sectors_written); | |
624 | ||
625 | bio_reset(bio); | |
4f024f37 | 626 | bio->bi_iter.bi_sector = PTR_OFFSET(k, i); |
cafe5635 | 627 | bio->bi_bdev = ca->bdev; |
e49c7c37 | 628 | bio->bi_rw = REQ_WRITE|REQ_SYNC|REQ_META|REQ_FLUSH|REQ_FUA; |
4f024f37 | 629 | bio->bi_iter.bi_size = sectors << 9; |
cafe5635 KO |
630 | |
631 | bio->bi_end_io = journal_write_endio; | |
632 | bio->bi_private = w; | |
169ef1cf | 633 | bch_bio_map(bio, w->data); |
cafe5635 KO |
634 | |
635 | trace_bcache_journal_write(bio); | |
636 | bio_list_add(&list, bio); | |
637 | ||
638 | SET_PTR_OFFSET(k, i, PTR_OFFSET(k, i) + sectors); | |
639 | ||
640 | ca->journal.seq[ca->journal.cur_idx] = w->data->seq; | |
641 | } | |
642 | ||
643 | atomic_dec_bug(&fifo_back(&c->journal.pin)); | |
644 | bch_journal_next(&c->journal); | |
645 | journal_reclaim(c); | |
646 | ||
647 | spin_unlock(&c->journal.lock); | |
648 | ||
649 | while ((bio = bio_list_pop(&list))) | |
650 | closure_bio_submit(bio, cl, c->cache[0]); | |
651 | ||
652 | continue_at(cl, journal_write_done, NULL); | |
653 | } | |
654 | ||
655 | static void journal_write(struct closure *cl) | |
656 | { | |
7857d5d4 | 657 | struct cache_set *c = container_of(cl, struct cache_set, journal.io); |
cafe5635 KO |
658 | |
659 | spin_lock(&c->journal.lock); | |
660 | journal_write_unlocked(cl); | |
661 | } | |
662 | ||
a34a8bfd | 663 | static void journal_try_write(struct cache_set *c) |
c19ed23a | 664 | __releases(c->journal.lock) |
cafe5635 | 665 | { |
7857d5d4 KO |
666 | struct closure *cl = &c->journal.io; |
667 | struct journal_write *w = c->journal.cur; | |
668 | ||
669 | w->need_write = true; | |
cafe5635 | 670 | |
cb7a583e KO |
671 | if (!c->journal.io_in_flight) { |
672 | c->journal.io_in_flight = 1; | |
673 | closure_call(cl, journal_write_unlocked, NULL, &c->cl); | |
674 | } else { | |
a34a8bfd | 675 | spin_unlock(&c->journal.lock); |
cb7a583e | 676 | } |
cafe5635 KO |
677 | } |
678 | ||
a34a8bfd KO |
679 | static struct journal_write *journal_wait_for_write(struct cache_set *c, |
680 | unsigned nkeys) | |
cafe5635 | 681 | { |
a34a8bfd KO |
682 | size_t sectors; |
683 | struct closure cl; | |
5775e213 | 684 | bool wait = false; |
cafe5635 | 685 | |
a34a8bfd KO |
686 | closure_init_stack(&cl); |
687 | ||
688 | spin_lock(&c->journal.lock); | |
689 | ||
690 | while (1) { | |
691 | struct journal_write *w = c->journal.cur; | |
692 | ||
693 | sectors = __set_blocks(w->data, w->data->keys + nkeys, | |
ee811287 | 694 | block_bytes(c)) * c->sb.block_size; |
a34a8bfd KO |
695 | |
696 | if (sectors <= min_t(size_t, | |
697 | c->journal.blocks_free * c->sb.block_size, | |
698 | PAGE_SECTORS << JSET_BITS)) | |
699 | return w; | |
700 | ||
5775e213 KO |
701 | if (wait) |
702 | closure_wait(&c->journal.wait, &cl); | |
703 | ||
a34a8bfd | 704 | if (!journal_full(&c->journal)) { |
5775e213 KO |
705 | if (wait) |
706 | trace_bcache_journal_entry_full(c); | |
a34a8bfd KO |
707 | |
708 | /* | |
709 | * XXX: If we were inserting so many keys that they | |
710 | * won't fit in an _empty_ journal write, we'll | |
711 | * deadlock. For now, handle this in | |
712 | * bch_keylist_realloc() - but something to think about. | |
713 | */ | |
714 | BUG_ON(!w->data->keys); | |
715 | ||
a34a8bfd KO |
716 | journal_try_write(c); /* unlocks */ |
717 | } else { | |
5775e213 KO |
718 | if (wait) |
719 | trace_bcache_journal_full(c); | |
a34a8bfd | 720 | |
a34a8bfd KO |
721 | journal_reclaim(c); |
722 | spin_unlock(&c->journal.lock); | |
cafe5635 | 723 | |
a34a8bfd KO |
724 | btree_flush_write(c); |
725 | } | |
cafe5635 | 726 | |
a34a8bfd KO |
727 | closure_sync(&cl); |
728 | spin_lock(&c->journal.lock); | |
5775e213 | 729 | wait = true; |
cafe5635 KO |
730 | } |
731 | } | |
732 | ||
7857d5d4 KO |
733 | static void journal_write_work(struct work_struct *work) |
734 | { | |
735 | struct cache_set *c = container_of(to_delayed_work(work), | |
736 | struct cache_set, | |
737 | journal.work); | |
738 | spin_lock(&c->journal.lock); | |
dabb4433 KO |
739 | if (c->journal.cur->dirty) |
740 | journal_try_write(c); | |
741 | else | |
742 | spin_unlock(&c->journal.lock); | |
7857d5d4 KO |
743 | } |
744 | ||
cafe5635 KO |
745 | /* |
746 | * Entry point to the journalling code - bio_insert() and btree_invalidate() | |
747 | * pass bch_journal() a list of keys to be journalled, and then | |
748 | * bch_journal() hands those same keys off to btree_insert_async() | |
749 | */ | |
750 | ||
a34a8bfd KO |
751 | atomic_t *bch_journal(struct cache_set *c, |
752 | struct keylist *keys, | |
753 | struct closure *parent) | |
cafe5635 | 754 | { |
cafe5635 | 755 | struct journal_write *w; |
a34a8bfd | 756 | atomic_t *ret; |
cafe5635 | 757 | |
a34a8bfd KO |
758 | if (!CACHE_SYNC(&c->sb)) |
759 | return NULL; | |
cafe5635 | 760 | |
a34a8bfd | 761 | w = journal_wait_for_write(c, bch_keylist_nkeys(keys)); |
c37511b8 | 762 | |
fafff81c | 763 | memcpy(bset_bkey_last(w->data), keys->keys, bch_keylist_bytes(keys)); |
a34a8bfd | 764 | w->data->keys += bch_keylist_nkeys(keys); |
cafe5635 | 765 | |
a34a8bfd KO |
766 | ret = &fifo_back(&c->journal.pin); |
767 | atomic_inc(ret); | |
cafe5635 | 768 | |
a34a8bfd KO |
769 | if (parent) { |
770 | closure_wait(&w->wait, parent); | |
7857d5d4 | 771 | journal_try_write(c); |
dabb4433 KO |
772 | } else if (!w->dirty) { |
773 | w->dirty = true; | |
7857d5d4 KO |
774 | schedule_delayed_work(&c->journal.work, |
775 | msecs_to_jiffies(c->journal_delay_ms)); | |
776 | spin_unlock(&c->journal.lock); | |
777 | } else { | |
778 | spin_unlock(&c->journal.lock); | |
cafe5635 | 779 | } |
a34a8bfd KO |
780 | |
781 | ||
782 | return ret; | |
783 | } | |
784 | ||
785 | void bch_journal_meta(struct cache_set *c, struct closure *cl) | |
786 | { | |
787 | struct keylist keys; | |
788 | atomic_t *ref; | |
789 | ||
790 | bch_keylist_init(&keys); | |
791 | ||
792 | ref = bch_journal(c, &keys, cl); | |
793 | if (ref) | |
794 | atomic_dec_bug(ref); | |
cafe5635 KO |
795 | } |
796 | ||
797 | void bch_journal_free(struct cache_set *c) | |
798 | { | |
799 | free_pages((unsigned long) c->journal.w[1].data, JSET_BITS); | |
800 | free_pages((unsigned long) c->journal.w[0].data, JSET_BITS); | |
801 | free_fifo(&c->journal.pin); | |
802 | } | |
803 | ||
804 | int bch_journal_alloc(struct cache_set *c) | |
805 | { | |
806 | struct journal *j = &c->journal; | |
807 | ||
cafe5635 | 808 | spin_lock_init(&j->lock); |
7857d5d4 | 809 | INIT_DELAYED_WORK(&j->work, journal_write_work); |
cafe5635 KO |
810 | |
811 | c->journal_delay_ms = 100; | |
812 | ||
813 | j->w[0].c = c; | |
814 | j->w[1].c = c; | |
815 | ||
816 | if (!(init_fifo(&j->pin, JOURNAL_PIN, GFP_KERNEL)) || | |
817 | !(j->w[0].data = (void *) __get_free_pages(GFP_KERNEL, JSET_BITS)) || | |
818 | !(j->w[1].data = (void *) __get_free_pages(GFP_KERNEL, JSET_BITS))) | |
819 | return -ENOMEM; | |
820 | ||
821 | return 0; | |
822 | } |