1 // SPDX-License-Identifier: GPL-2.0
6 #include "btree_cache.h"
7 #include "btree_journal_iter.h"
8 #include "journal_io.h"
10 #include <linux/sort.h>
13 * For managing keys we read from the journal: until journal replay works normal
14 * btree lookups need to be able to find and return keys from the journal where
15 * they overwrite what's in the btree, so we have a special iterator and
16 * operations for the regular btree iter code to use:
19 static int __journal_key_cmp(enum btree_id l_btree_id,
22 const struct journal_key *r)
24 return (cmp_int(l_btree_id, r->btree_id) ?:
25 cmp_int(l_level, r->level) ?:
26 bpos_cmp(l_pos, r->k->k.p));
29 static int journal_key_cmp(const struct journal_key *l, const struct journal_key *r)
31 return __journal_key_cmp(l->btree_id, l->level, l->k->k.p, r);
34 static inline size_t idx_to_pos(struct journal_keys *keys, size_t idx)
36 size_t gap_size = keys->size - keys->nr;
43 static inline struct journal_key *idx_to_key(struct journal_keys *keys, size_t idx)
45 return keys->data + idx_to_pos(keys, idx);
48 static size_t __bch2_journal_key_search(struct journal_keys *keys,
49 enum btree_id id, unsigned level,
52 size_t l = 0, r = keys->nr, m;
55 m = l + ((r - l) >> 1);
56 if (__journal_key_cmp(id, level, pos, idx_to_key(keys, m)) > 0)
62 BUG_ON(l < keys->nr &&
63 __journal_key_cmp(id, level, pos, idx_to_key(keys, l)) > 0);
66 __journal_key_cmp(id, level, pos, idx_to_key(keys, l - 1)) <= 0);
71 static size_t bch2_journal_key_search(struct journal_keys *keys,
72 enum btree_id id, unsigned level,
75 return idx_to_pos(keys, __bch2_journal_key_search(keys, id, level, pos));
78 /* Returns first non-overwritten key >= search key: */
79 struct bkey_i *bch2_journal_keys_peek_upto(struct bch_fs *c, enum btree_id btree_id,
80 unsigned level, struct bpos pos,
81 struct bpos end_pos, size_t *idx)
83 struct journal_keys *keys = &c->journal_keys;
85 struct journal_key *k;
87 BUG_ON(*idx > keys->nr);
90 *idx = __bch2_journal_key_search(keys, btree_id, level, pos);
93 __journal_key_cmp(btree_id, level, end_pos, idx_to_key(keys, *idx - 1)) <= 0) {
102 while ((k = *idx < keys->nr ? idx_to_key(keys, *idx) : NULL)) {
103 if (__journal_key_cmp(btree_id, level, end_pos, k) < 0)
106 if (k->overwritten) {
111 if (__journal_key_cmp(btree_id, level, pos, k) <= 0)
125 struct bkey_i *bch2_journal_keys_peek_slot(struct bch_fs *c, enum btree_id btree_id,
126 unsigned level, struct bpos pos)
130 return bch2_journal_keys_peek_upto(c, btree_id, level, pos, pos, &idx);
133 static void journal_iters_fix(struct bch_fs *c)
135 struct journal_keys *keys = &c->journal_keys;
136 /* The key we just inserted is immediately before the gap: */
137 size_t gap_end = keys->gap + (keys->size - keys->nr);
138 struct btree_and_journal_iter *iter;
141 * If an iterator points one after the key we just inserted, decrement
142 * the iterator so it points at the key we just inserted - if the
143 * decrement was unnecessary, bch2_btree_and_journal_iter_peek() will
146 list_for_each_entry(iter, &c->journal_iters, journal.list)
147 if (iter->journal.idx == gap_end)
148 iter->journal.idx = keys->gap - 1;
151 static void journal_iters_move_gap(struct bch_fs *c, size_t old_gap, size_t new_gap)
153 struct journal_keys *keys = &c->journal_keys;
154 struct journal_iter *iter;
155 size_t gap_size = keys->size - keys->nr;
157 list_for_each_entry(iter, &c->journal_iters, list) {
158 if (iter->idx > old_gap)
159 iter->idx -= gap_size;
160 if (iter->idx >= new_gap)
161 iter->idx += gap_size;
165 int bch2_journal_key_insert_take(struct bch_fs *c, enum btree_id id,
166 unsigned level, struct bkey_i *k)
168 struct journal_key n = {
174 * Ensure these keys are done last by journal replay, to unblock
177 .journal_seq = U32_MAX,
179 struct journal_keys *keys = &c->journal_keys;
180 size_t idx = bch2_journal_key_search(keys, id, level, k->k.p);
182 BUG_ON(test_bit(BCH_FS_rw, &c->flags));
184 if (idx < keys->size &&
185 journal_key_cmp(&n, &keys->data[idx]) == 0) {
186 if (keys->data[idx].allocated)
187 kfree(keys->data[idx].k);
193 idx -= keys->size - keys->nr;
195 if (keys->nr == keys->size) {
196 struct journal_keys new_keys = {
198 .size = max_t(size_t, keys->size, 8) * 2,
201 new_keys.data = kvmalloc_array(new_keys.size, sizeof(new_keys.data[0]), GFP_KERNEL);
202 if (!new_keys.data) {
203 bch_err(c, "%s: error allocating new key array (size %zu)",
204 __func__, new_keys.size);
205 return -BCH_ERR_ENOMEM_journal_key_insert;
208 /* Since @keys was full, there was no gap: */
209 memcpy(new_keys.data, keys->data, sizeof(keys->data[0]) * keys->nr);
211 keys->data = new_keys.data;
212 keys->nr = new_keys.nr;
213 keys->size = new_keys.size;
215 /* And now the gap is at the end: */
216 keys->gap = keys->nr;
219 journal_iters_move_gap(c, keys->gap, idx);
224 keys->data[keys->gap++] = n;
226 journal_iters_fix(c);
232 * Can only be used from the recovery thread while we're still RO - can't be
233 * used once we've got RW, as journal_keys is at that point used by multiple
236 int bch2_journal_key_insert(struct bch_fs *c, enum btree_id id,
237 unsigned level, struct bkey_i *k)
242 n = kmalloc(bkey_bytes(&k->k), GFP_KERNEL);
244 return -BCH_ERR_ENOMEM_journal_key_insert;
247 ret = bch2_journal_key_insert_take(c, id, level, n);
253 int bch2_journal_key_delete(struct bch_fs *c, enum btree_id id,
254 unsigned level, struct bpos pos)
256 struct bkey_i whiteout;
258 bkey_init(&whiteout.k);
261 return bch2_journal_key_insert(c, id, level, &whiteout);
264 void bch2_journal_key_overwritten(struct bch_fs *c, enum btree_id btree,
265 unsigned level, struct bpos pos)
267 struct journal_keys *keys = &c->journal_keys;
268 size_t idx = bch2_journal_key_search(keys, btree, level, pos);
270 if (idx < keys->size &&
271 keys->data[idx].btree_id == btree &&
272 keys->data[idx].level == level &&
273 bpos_eq(keys->data[idx].k->k.p, pos))
274 keys->data[idx].overwritten = true;
277 static void bch2_journal_iter_advance(struct journal_iter *iter)
279 if (iter->idx < iter->keys->size) {
281 if (iter->idx == iter->keys->gap)
282 iter->idx += iter->keys->size - iter->keys->nr;
286 static struct bkey_s_c bch2_journal_iter_peek(struct journal_iter *iter)
288 struct journal_key *k = iter->keys->data + iter->idx;
290 while (k < iter->keys->data + iter->keys->size &&
291 k->btree_id == iter->btree_id &&
292 k->level == iter->level) {
294 return bkey_i_to_s_c(k->k);
296 bch2_journal_iter_advance(iter);
297 k = iter->keys->data + iter->idx;
300 return bkey_s_c_null;
303 static void bch2_journal_iter_exit(struct journal_iter *iter)
305 list_del(&iter->list);
308 static void bch2_journal_iter_init(struct bch_fs *c,
309 struct journal_iter *iter,
310 enum btree_id id, unsigned level,
315 iter->keys = &c->journal_keys;
316 iter->idx = bch2_journal_key_search(&c->journal_keys, id, level, pos);
319 static struct bkey_s_c bch2_journal_iter_peek_btree(struct btree_and_journal_iter *iter)
321 return bch2_btree_node_iter_peek_unpack(&iter->node_iter,
322 iter->b, &iter->unpacked);
325 static void bch2_journal_iter_advance_btree(struct btree_and_journal_iter *iter)
327 bch2_btree_node_iter_advance(&iter->node_iter, iter->b);
330 void bch2_btree_and_journal_iter_advance(struct btree_and_journal_iter *iter)
332 if (bpos_eq(iter->pos, SPOS_MAX))
335 iter->pos = bpos_successor(iter->pos);
338 static void btree_and_journal_iter_prefetch(struct btree_and_journal_iter *_iter)
340 struct btree_and_journal_iter iter = *_iter;
341 struct bch_fs *c = iter.trans->c;
342 unsigned level = iter.journal.level;
344 unsigned nr = test_bit(BCH_FS_started, &c->flags)
345 ? (level > 1 ? 0 : 2)
346 : (level > 1 ? 1 : 16);
348 iter.prefetch = false;
349 bch2_bkey_buf_init(&tmp);
352 bch2_btree_and_journal_iter_advance(&iter);
353 struct bkey_s_c k = bch2_btree_and_journal_iter_peek(&iter);
357 bch2_bkey_buf_reassemble(&tmp, c, k);
358 bch2_btree_node_prefetch(iter.trans, NULL, tmp.k, iter.journal.btree_id, level - 1);
361 bch2_bkey_buf_exit(&tmp, c);
364 struct bkey_s_c bch2_btree_and_journal_iter_peek(struct btree_and_journal_iter *iter)
366 struct bkey_s_c btree_k, journal_k, ret;
368 if (iter->prefetch && iter->journal.level)
369 btree_and_journal_iter_prefetch(iter);
372 return bkey_s_c_null;
374 while ((btree_k = bch2_journal_iter_peek_btree(iter)).k &&
375 bpos_lt(btree_k.k->p, iter->pos))
376 bch2_journal_iter_advance_btree(iter);
378 while ((journal_k = bch2_journal_iter_peek(&iter->journal)).k &&
379 bpos_lt(journal_k.k->p, iter->pos))
380 bch2_journal_iter_advance(&iter->journal);
383 (!btree_k.k || bpos_le(journal_k.k->p, btree_k.k->p))
387 if (ret.k && iter->b && bpos_gt(ret.k->p, iter->b->data->max_key))
391 iter->pos = ret.k->p;
392 if (bkey_deleted(ret.k)) {
393 bch2_btree_and_journal_iter_advance(iter);
397 iter->pos = SPOS_MAX;
404 void bch2_btree_and_journal_iter_exit(struct btree_and_journal_iter *iter)
406 bch2_journal_iter_exit(&iter->journal);
409 void __bch2_btree_and_journal_iter_init_node_iter(struct btree_trans *trans,
410 struct btree_and_journal_iter *iter,
412 struct btree_node_iter node_iter,
415 memset(iter, 0, sizeof(*iter));
419 iter->node_iter = node_iter;
420 bch2_journal_iter_init(trans->c, &iter->journal, b->c.btree_id, b->c.level, pos);
421 INIT_LIST_HEAD(&iter->journal.list);
422 iter->pos = b->data->min_key;
423 iter->at_end = false;
427 * this version is used by btree_gc before filesystem has gone RW and
428 * multithreaded, so uses the journal_iters list:
430 void bch2_btree_and_journal_iter_init_node_iter(struct btree_trans *trans,
431 struct btree_and_journal_iter *iter,
434 struct btree_node_iter node_iter;
436 bch2_btree_node_iter_init_from_start(&node_iter, b);
437 __bch2_btree_and_journal_iter_init_node_iter(trans, iter, b, node_iter, b->data->min_key);
438 list_add(&iter->journal.list, &trans->c->journal_iters);
441 /* sort and dedup all keys in the journal: */
443 void bch2_journal_entries_free(struct bch_fs *c)
445 struct journal_replay **i;
446 struct genradix_iter iter;
448 genradix_for_each(&c->journal_entries, iter, i)
450 genradix_free(&c->journal_entries);
454 * When keys compare equal, oldest compares first:
456 static int journal_sort_key_cmp(const void *_l, const void *_r)
458 const struct journal_key *l = _l;
459 const struct journal_key *r = _r;
461 return journal_key_cmp(l, r) ?:
462 cmp_int(l->journal_seq, r->journal_seq) ?:
463 cmp_int(l->journal_offset, r->journal_offset);
466 void bch2_journal_keys_put(struct bch_fs *c)
468 struct journal_keys *keys = &c->journal_keys;
470 BUG_ON(atomic_read(&keys->ref) <= 0);
472 if (!atomic_dec_and_test(&keys->ref))
475 move_gap(keys, keys->nr);
477 darray_for_each(*keys, i)
483 keys->nr = keys->gap = keys->size = 0;
485 bch2_journal_entries_free(c);
488 static void __journal_keys_sort(struct journal_keys *keys)
490 sort(keys->data, keys->nr, sizeof(keys->data[0]), journal_sort_key_cmp, NULL);
492 struct journal_key *dst = keys->data;
494 darray_for_each(*keys, src) {
495 if (src + 1 < &darray_top(*keys) &&
496 !journal_key_cmp(src, src + 1))
502 keys->nr = dst - keys->data;
505 int bch2_journal_keys_sort(struct bch_fs *c)
507 struct genradix_iter iter;
508 struct journal_replay *i, **_i;
509 struct journal_keys *keys = &c->journal_keys;
512 genradix_for_each(&c->journal_entries, iter, _i) {
515 if (journal_replay_ignore(i))
520 for_each_jset_key(k, entry, &i->j) {
521 struct journal_key n = (struct journal_key) {
522 .btree_id = entry->btree_id,
523 .level = entry->level,
525 .journal_seq = le64_to_cpu(i->j.seq),
526 .journal_offset = k->_data - i->j._data,
529 if (darray_push(keys, n)) {
530 __journal_keys_sort(keys);
532 if (keys->nr * 8 > keys->size * 7) {
533 bch_err(c, "Too many journal keys for slowpath; have %zu compacted, buf size %zu, processed %zu keys at seq %llu",
534 keys->nr, keys->size, nr_read, le64_to_cpu(i->j.seq));
535 return -BCH_ERR_ENOMEM_journal_keys_sort;
538 BUG_ON(darray_push(keys, n));
545 __journal_keys_sort(keys);
546 keys->gap = keys->nr;
548 bch_verbose(c, "Journal keys: %zu read, %zu after sorting and compacting", nr_read, keys->nr);