Commit | Line | Data |
---|---|---|
1c6fdbd8 KO |
1 | // SPDX-License-Identifier: GPL-2.0 |
2 | /* | |
3 | * Copyright (C) 2010 Kent Overstreet <kent.overstreet@gmail.com> | |
4 | * Copyright (C) 2014 Datera Inc. | |
5 | */ | |
6 | ||
7 | #include "bcachefs.h" | |
7b3f84ea | 8 | #include "alloc_background.h" |
ef337c54 | 9 | #include "alloc_foreground.h" |
1c6fdbd8 | 10 | #include "bkey_methods.h" |
07a1006a | 11 | #include "bkey_buf.h" |
401585fe | 12 | #include "btree_journal_iter.h" |
ec061b21 | 13 | #include "btree_key_cache.h" |
1c6fdbd8 KO |
14 | #include "btree_locking.h" |
15 | #include "btree_update_interior.h" | |
16 | #include "btree_io.h" | |
17 | #include "btree_gc.h" | |
18 | #include "buckets.h" | |
19 | #include "clock.h" | |
20 | #include "debug.h" | |
cd575ddf | 21 | #include "ec.h" |
1c6fdbd8 KO |
22 | #include "error.h" |
23 | #include "extents.h" | |
24 | #include "journal.h" | |
25 | #include "keylist.h" | |
26 | #include "move.h" | |
d0734356 | 27 | #include "recovery.h" |
890b74f0 | 28 | #include "reflink.h" |
1c6fdbd8 KO |
29 | #include "replicas.h" |
30 | #include "super-io.h" | |
31 | #include "trace.h" | |
32 | ||
33 | #include <linux/slab.h> | |
34 | #include <linux/bitops.h> | |
35 | #include <linux/freezer.h> | |
36 | #include <linux/kthread.h> | |
37 | #include <linux/preempt.h> | |
38 | #include <linux/rcupdate.h> | |
39 | #include <linux/sched/task.h> | |
40 | ||
4351d3ec KO |
41 | #define DROP_THIS_NODE 10 |
42 | #define DROP_PREV_NODE 11 | |
43 | ||
ad00bce0 KO |
44 | static struct bkey_s unsafe_bkey_s_c_to_s(struct bkey_s_c k) |
45 | { | |
46 | return (struct bkey_s) {{{ | |
47 | (struct bkey *) k.k, | |
48 | (struct bch_val *) k.v | |
49 | }}}; | |
50 | } | |
51 | ||
922bc5a0 KO |
52 | static bool should_restart_for_topology_repair(struct bch_fs *c) |
53 | { | |
54 | return c->opts.fix_errors != FSCK_FIX_no && | |
0ed4ca14 | 55 | !(c->recovery_passes_complete & BIT_ULL(BCH_RECOVERY_PASS_check_topology)); |
922bc5a0 KO |
56 | } |
57 | ||
2252aa27 KO |
58 | static inline void __gc_pos_set(struct bch_fs *c, struct gc_pos new_pos) |
59 | { | |
60 | preempt_disable(); | |
61 | write_seqcount_begin(&c->gc_pos_lock); | |
62 | c->gc_pos = new_pos; | |
63 | write_seqcount_end(&c->gc_pos_lock); | |
64 | preempt_enable(); | |
65 | } | |
66 | ||
67 | static inline void gc_pos_set(struct bch_fs *c, struct gc_pos new_pos) | |
68 | { | |
69 | BUG_ON(gc_pos_cmp(new_pos, c->gc_pos) <= 0); | |
70 | __gc_pos_set(c, new_pos); | |
71 | } | |
72 | ||
a0b73c1c KO |
73 | /* |
74 | * Missing: if an interior btree node is empty, we need to do something - | |
75 | * perhaps just kill it | |
76 | */ | |
d06c1a0c | 77 | static int bch2_gc_check_topology(struct bch_fs *c, |
a66f7989 KO |
78 | struct btree *b, |
79 | struct bkey_buf *prev, | |
80 | struct bkey_buf cur, | |
d06c1a0c | 81 | bool is_last) |
1c6fdbd8 | 82 | { |
a66f7989 KO |
83 | struct bpos node_start = b->data->min_key; |
84 | struct bpos node_end = b->data->max_key; | |
85 | struct bpos expected_start = bkey_deleted(&prev->k->k) | |
86 | ? node_start | |
e751c01a | 87 | : bpos_successor(prev->k->k.p); |
fa8e94fa | 88 | struct printbuf buf1 = PRINTBUF, buf2 = PRINTBUF; |
d06c1a0c | 89 | int ret = 0; |
1c6fdbd8 | 90 | |
a66f7989 KO |
91 | if (cur.k->k.type == KEY_TYPE_btree_ptr_v2) { |
92 | struct bkey_i_btree_ptr_v2 *bp = bkey_i_to_btree_ptr_v2(cur.k); | |
1c6fdbd8 | 93 | |
e88a75eb | 94 | if (!bpos_eq(expected_start, bp->v.min_key)) { |
aae15aaf KO |
95 | bch2_topology_error(c); |
96 | ||
fa8e94fa | 97 | if (bkey_deleted(&prev->k->k)) { |
401ec4db | 98 | prt_printf(&buf1, "start of node: "); |
fa8e94fa KO |
99 | bch2_bpos_to_text(&buf1, node_start); |
100 | } else { | |
101 | bch2_bkey_val_to_text(&buf1, c, bkey_i_to_s_c(prev->k)); | |
102 | } | |
103 | bch2_bkey_val_to_text(&buf2, c, bkey_i_to_s_c(cur.k)); | |
104 | ||
08061519 | 105 | if (__fsck_err(c, |
b65db750 KO |
106 | FSCK_CAN_FIX| |
107 | FSCK_CAN_IGNORE| | |
108 | FSCK_NO_RATELIMIT, | |
109 | btree_node_topology_bad_min_key, | |
110 | "btree node with incorrect min_key at btree %s level %u:\n" | |
111 | " prev %s\n" | |
112 | " cur %s", | |
113 | bch2_btree_id_str(b->c.btree_id), b->c.level, | |
114 | buf1.buf, buf2.buf) && should_restart_for_topology_repair(c)) { | |
aae15aaf | 115 | bch_info(c, "Halting mark and sweep to start topology repair pass"); |
922bc5a0 | 116 | ret = bch2_run_explicit_recovery_pass(c, BCH_RECOVERY_PASS_check_topology); |
fa8e94fa | 117 | goto err; |
aae15aaf | 118 | } else { |
3c471b65 | 119 | set_bit(BCH_FS_initial_gc_unfixed, &c->flags); |
aae15aaf KO |
120 | } |
121 | } | |
122 | } | |
123 | ||
e88a75eb | 124 | if (is_last && !bpos_eq(cur.k->k.p, node_end)) { |
aae15aaf KO |
125 | bch2_topology_error(c); |
126 | ||
fa8e94fa KO |
127 | printbuf_reset(&buf1); |
128 | printbuf_reset(&buf2); | |
129 | ||
130 | bch2_bkey_val_to_text(&buf1, c, bkey_i_to_s_c(cur.k)); | |
131 | bch2_bpos_to_text(&buf2, node_end); | |
132 | ||
b65db750 KO |
133 | if (__fsck_err(c, FSCK_CAN_FIX|FSCK_CAN_IGNORE|FSCK_NO_RATELIMIT, |
134 | btree_node_topology_bad_max_key, | |
08061519 KO |
135 | "btree node with incorrect max_key at btree %s level %u:\n" |
136 | " %s\n" | |
137 | " expected %s", | |
88dfe193 | 138 | bch2_btree_id_str(b->c.btree_id), b->c.level, |
fa8e94fa | 139 | buf1.buf, buf2.buf) && |
922bc5a0 | 140 | should_restart_for_topology_repair(c)) { |
aae15aaf | 141 | bch_info(c, "Halting mark and sweep to start topology repair pass"); |
922bc5a0 | 142 | ret = bch2_run_explicit_recovery_pass(c, BCH_RECOVERY_PASS_check_topology); |
fa8e94fa | 143 | goto err; |
aae15aaf | 144 | } else { |
3c471b65 | 145 | set_bit(BCH_FS_initial_gc_unfixed, &c->flags); |
aae15aaf KO |
146 | } |
147 | } | |
148 | ||
149 | bch2_bkey_buf_copy(prev, c, cur.k); | |
fa8e94fa | 150 | err: |
aae15aaf | 151 | fsck_err: |
fa8e94fa KO |
152 | printbuf_exit(&buf2); |
153 | printbuf_exit(&buf1); | |
aae15aaf KO |
154 | return ret; |
155 | } | |
156 | ||
157 | static void btree_ptr_to_v2(struct btree *b, struct bkey_i_btree_ptr_v2 *dst) | |
158 | { | |
159 | switch (b->key.k.type) { | |
160 | case KEY_TYPE_btree_ptr: { | |
161 | struct bkey_i_btree_ptr *src = bkey_i_to_btree_ptr(&b->key); | |
162 | ||
163 | dst->k.p = src->k.p; | |
164 | dst->v.mem_ptr = 0; | |
165 | dst->v.seq = b->data->keys.seq; | |
166 | dst->v.sectors_written = 0; | |
167 | dst->v.flags = 0; | |
168 | dst->v.min_key = b->data->min_key; | |
169 | set_bkey_val_bytes(&dst->k, sizeof(dst->v) + bkey_val_bytes(&src->k)); | |
170 | memcpy(dst->v.start, src->v.start, bkey_val_bytes(&src->k)); | |
171 | break; | |
172 | } | |
173 | case KEY_TYPE_btree_ptr_v2: | |
174 | bkey_copy(&dst->k_i, &b->key); | |
175 | break; | |
176 | default: | |
177 | BUG(); | |
178 | } | |
179 | } | |
180 | ||
ca7d8fca | 181 | static void bch2_btree_node_update_key_early(struct btree_trans *trans, |
4e08446d KO |
182 | enum btree_id btree, unsigned level, |
183 | struct bkey_s_c old, struct bkey_i *new) | |
184 | { | |
ca7d8fca | 185 | struct bch_fs *c = trans->c; |
4e08446d KO |
186 | struct btree *b; |
187 | struct bkey_buf tmp; | |
188 | int ret; | |
189 | ||
190 | bch2_bkey_buf_init(&tmp); | |
191 | bch2_bkey_buf_reassemble(&tmp, c, old); | |
192 | ||
ca7d8fca | 193 | b = bch2_btree_node_get_noiter(trans, tmp.k, btree, level, true); |
4e08446d KO |
194 | if (!IS_ERR_OR_NULL(b)) { |
195 | mutex_lock(&c->btree_cache.lock); | |
196 | ||
197 | bch2_btree_node_hash_remove(&c->btree_cache, b); | |
198 | ||
199 | bkey_copy(&b->key, new); | |
200 | ret = __bch2_btree_node_hash_insert(&c->btree_cache, b); | |
201 | BUG_ON(ret); | |
202 | ||
203 | mutex_unlock(&c->btree_cache.lock); | |
204 | six_unlock_read(&b->c.lock); | |
205 | } | |
206 | ||
207 | bch2_bkey_buf_exit(&tmp, c); | |
208 | } | |
209 | ||
aae15aaf KO |
210 | static int set_node_min(struct bch_fs *c, struct btree *b, struct bpos new_min) |
211 | { | |
212 | struct bkey_i_btree_ptr_v2 *new; | |
213 | int ret; | |
214 | ||
a1019576 | 215 | new = kmalloc_array(BKEY_BTREE_PTR_U64s_MAX, sizeof(u64), GFP_KERNEL); |
aae15aaf | 216 | if (!new) |
65d48e35 | 217 | return -BCH_ERR_ENOMEM_gc_repair_key; |
aae15aaf KO |
218 | |
219 | btree_ptr_to_v2(b, new); | |
220 | b->data->min_key = new_min; | |
221 | new->v.min_key = new_min; | |
222 | SET_BTREE_PTR_RANGE_UPDATED(&new->v, true); | |
223 | ||
e75b2d4c | 224 | ret = bch2_journal_key_insert_take(c, b->c.btree_id, b->c.level + 1, &new->k_i); |
aae15aaf KO |
225 | if (ret) { |
226 | kfree(new); | |
227 | return ret; | |
d06c1a0c | 228 | } |
1c6fdbd8 | 229 | |
aae15aaf | 230 | bch2_btree_node_drop_keys_outside_node(b); |
48620e51 | 231 | bkey_copy(&b->key, &new->k_i); |
aae15aaf KO |
232 | return 0; |
233 | } | |
234 | ||
235 | static int set_node_max(struct bch_fs *c, struct btree *b, struct bpos new_max) | |
236 | { | |
237 | struct bkey_i_btree_ptr_v2 *new; | |
238 | int ret; | |
239 | ||
240 | ret = bch2_journal_key_delete(c, b->c.btree_id, b->c.level + 1, b->key.k.p); | |
241 | if (ret) | |
242 | return ret; | |
243 | ||
a1019576 | 244 | new = kmalloc_array(BKEY_BTREE_PTR_U64s_MAX, sizeof(u64), GFP_KERNEL); |
aae15aaf | 245 | if (!new) |
65d48e35 | 246 | return -BCH_ERR_ENOMEM_gc_repair_key; |
aae15aaf KO |
247 | |
248 | btree_ptr_to_v2(b, new); | |
249 | b->data->max_key = new_max; | |
250 | new->k.p = new_max; | |
251 | SET_BTREE_PTR_RANGE_UPDATED(&new->v, true); | |
252 | ||
e75b2d4c | 253 | ret = bch2_journal_key_insert_take(c, b->c.btree_id, b->c.level + 1, &new->k_i); |
aae15aaf KO |
254 | if (ret) { |
255 | kfree(new); | |
256 | return ret; | |
257 | } | |
258 | ||
259 | bch2_btree_node_drop_keys_outside_node(b); | |
260 | ||
261 | mutex_lock(&c->btree_cache.lock); | |
262 | bch2_btree_node_hash_remove(&c->btree_cache, b); | |
263 | ||
264 | bkey_copy(&b->key, &new->k_i); | |
265 | ret = __bch2_btree_node_hash_insert(&c->btree_cache, b); | |
266 | BUG_ON(ret); | |
267 | mutex_unlock(&c->btree_cache.lock); | |
268 | return 0; | |
269 | } | |
270 | ||
4351d3ec KO |
271 | static int btree_repair_node_boundaries(struct bch_fs *c, struct btree *b, |
272 | struct btree *prev, struct btree *cur) | |
aae15aaf KO |
273 | { |
274 | struct bpos expected_start = !prev | |
275 | ? b->data->min_key | |
276 | : bpos_successor(prev->key.k.p); | |
fa8e94fa | 277 | struct printbuf buf1 = PRINTBUF, buf2 = PRINTBUF; |
aae15aaf KO |
278 | int ret = 0; |
279 | ||
280 | if (!prev) { | |
401ec4db | 281 | prt_printf(&buf1, "start of node: "); |
fa8e94fa | 282 | bch2_bpos_to_text(&buf1, b->data->min_key); |
aae15aaf | 283 | } else { |
fa8e94fa | 284 | bch2_bkey_val_to_text(&buf1, c, bkey_i_to_s_c(&prev->key)); |
aae15aaf KO |
285 | } |
286 | ||
fa8e94fa | 287 | bch2_bkey_val_to_text(&buf2, c, bkey_i_to_s_c(&cur->key)); |
4351d3ec KO |
288 | |
289 | if (prev && | |
e88a75eb | 290 | bpos_gt(expected_start, cur->data->min_key) && |
4351d3ec KO |
291 | BTREE_NODE_SEQ(cur->data) > BTREE_NODE_SEQ(prev->data)) { |
292 | /* cur overwrites prev: */ | |
293 | ||
e88a75eb KO |
294 | if (mustfix_fsck_err_on(bpos_ge(prev->data->min_key, |
295 | cur->data->min_key), c, | |
b65db750 | 296 | btree_node_topology_overwritten_by_next_node, |
4351d3ec KO |
297 | "btree node overwritten by next node at btree %s level %u:\n" |
298 | " node %s\n" | |
299 | " next %s", | |
88dfe193 | 300 | bch2_btree_id_str(b->c.btree_id), b->c.level, |
fa8e94fa KO |
301 | buf1.buf, buf2.buf)) { |
302 | ret = DROP_PREV_NODE; | |
303 | goto out; | |
304 | } | |
4351d3ec | 305 | |
e88a75eb | 306 | if (mustfix_fsck_err_on(!bpos_eq(prev->key.k.p, |
4351d3ec | 307 | bpos_predecessor(cur->data->min_key)), c, |
b65db750 | 308 | btree_node_topology_bad_max_key, |
4351d3ec KO |
309 | "btree node with incorrect max_key at btree %s level %u:\n" |
310 | " node %s\n" | |
311 | " next %s", | |
88dfe193 | 312 | bch2_btree_id_str(b->c.btree_id), b->c.level, |
fa8e94fa | 313 | buf1.buf, buf2.buf)) |
aae15aaf | 314 | ret = set_node_max(c, prev, |
4351d3ec KO |
315 | bpos_predecessor(cur->data->min_key)); |
316 | } else { | |
317 | /* prev overwrites cur: */ | |
318 | ||
e88a75eb KO |
319 | if (mustfix_fsck_err_on(bpos_ge(expected_start, |
320 | cur->data->max_key), c, | |
b65db750 | 321 | btree_node_topology_overwritten_by_prev_node, |
4351d3ec KO |
322 | "btree node overwritten by prev node at btree %s level %u:\n" |
323 | " prev %s\n" | |
324 | " node %s", | |
88dfe193 | 325 | bch2_btree_id_str(b->c.btree_id), b->c.level, |
fa8e94fa KO |
326 | buf1.buf, buf2.buf)) { |
327 | ret = DROP_THIS_NODE; | |
328 | goto out; | |
329 | } | |
4351d3ec | 330 | |
e88a75eb | 331 | if (mustfix_fsck_err_on(!bpos_eq(expected_start, cur->data->min_key), c, |
b65db750 | 332 | btree_node_topology_bad_min_key, |
4351d3ec KO |
333 | "btree node with incorrect min_key at btree %s level %u:\n" |
334 | " prev %s\n" | |
335 | " node %s", | |
88dfe193 | 336 | bch2_btree_id_str(b->c.btree_id), b->c.level, |
fa8e94fa | 337 | buf1.buf, buf2.buf)) |
3e3e02e6 | 338 | ret = set_node_min(c, cur, expected_start); |
aae15aaf | 339 | } |
fa8e94fa | 340 | out: |
aae15aaf | 341 | fsck_err: |
fa8e94fa KO |
342 | printbuf_exit(&buf2); |
343 | printbuf_exit(&buf1); | |
aae15aaf KO |
344 | return ret; |
345 | } | |
346 | ||
347 | static int btree_repair_node_end(struct bch_fs *c, struct btree *b, | |
348 | struct btree *child) | |
349 | { | |
fa8e94fa | 350 | struct printbuf buf1 = PRINTBUF, buf2 = PRINTBUF; |
aae15aaf KO |
351 | int ret = 0; |
352 | ||
fa8e94fa KO |
353 | bch2_bkey_val_to_text(&buf1, c, bkey_i_to_s_c(&child->key)); |
354 | bch2_bpos_to_text(&buf2, b->key.k.p); | |
355 | ||
e88a75eb | 356 | if (mustfix_fsck_err_on(!bpos_eq(child->key.k.p, b->key.k.p), c, |
b65db750 | 357 | btree_node_topology_bad_max_key, |
a0b73c1c KO |
358 | "btree node with incorrect max_key at btree %s level %u:\n" |
359 | " %s\n" | |
360 | " expected %s", | |
88dfe193 | 361 | bch2_btree_id_str(b->c.btree_id), b->c.level, |
fa8e94fa | 362 | buf1.buf, buf2.buf)) { |
aae15aaf KO |
363 | ret = set_node_max(c, child, b->key.k.p); |
364 | if (ret) | |
fa8e94fa | 365 | goto err; |
aae15aaf | 366 | } |
fa8e94fa | 367 | err: |
aae15aaf | 368 | fsck_err: |
fa8e94fa KO |
369 | printbuf_exit(&buf2); |
370 | printbuf_exit(&buf1); | |
aae15aaf KO |
371 | return ret; |
372 | } | |
a66f7989 | 373 | |
ca7d8fca | 374 | static int bch2_btree_repair_topology_recurse(struct btree_trans *trans, struct btree *b) |
aae15aaf | 375 | { |
ca7d8fca | 376 | struct bch_fs *c = trans->c; |
aae15aaf KO |
377 | struct btree_and_journal_iter iter; |
378 | struct bkey_s_c k; | |
4351d3ec | 379 | struct bkey_buf prev_k, cur_k; |
aae15aaf KO |
380 | struct btree *prev = NULL, *cur = NULL; |
381 | bool have_child, dropped_children = false; | |
48620e51 | 382 | struct printbuf buf = PRINTBUF; |
aae15aaf KO |
383 | int ret = 0; |
384 | ||
385 | if (!b->c.level) | |
386 | return 0; | |
387 | again: | |
4351d3ec | 388 | prev = NULL; |
aae15aaf | 389 | have_child = dropped_children = false; |
4351d3ec KO |
390 | bch2_bkey_buf_init(&prev_k); |
391 | bch2_bkey_buf_init(&cur_k); | |
aae15aaf KO |
392 | bch2_btree_and_journal_iter_init_node_iter(&iter, c, b); |
393 | ||
394 | while ((k = bch2_btree_and_journal_iter_peek(&iter)).k) { | |
e88a75eb KO |
395 | BUG_ON(bpos_lt(k.k->p, b->data->min_key)); |
396 | BUG_ON(bpos_gt(k.k->p, b->data->max_key)); | |
a0b73c1c | 397 | |
aae15aaf | 398 | bch2_btree_and_journal_iter_advance(&iter); |
4351d3ec | 399 | bch2_bkey_buf_reassemble(&cur_k, c, k); |
aae15aaf | 400 | |
ca7d8fca | 401 | cur = bch2_btree_node_get_noiter(trans, cur_k.k, |
aae15aaf KO |
402 | b->c.btree_id, b->c.level - 1, |
403 | false); | |
404 | ret = PTR_ERR_OR_ZERO(cur); | |
405 | ||
fa8e94fa KO |
406 | printbuf_reset(&buf); |
407 | bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(cur_k.k)); | |
408 | ||
aae15aaf | 409 | if (mustfix_fsck_err_on(ret == -EIO, c, |
b65db750 | 410 | btree_node_unreadable, |
48620e51 | 411 | "Topology repair: unreadable btree node at btree %s level %u:\n" |
aae15aaf | 412 | " %s", |
88dfe193 | 413 | bch2_btree_id_str(b->c.btree_id), |
aae15aaf | 414 | b->c.level - 1, |
fa8e94fa | 415 | buf.buf)) { |
ca7d8fca | 416 | bch2_btree_node_evict(trans, cur_k.k); |
a0b73c1c | 417 | ret = bch2_journal_key_delete(c, b->c.btree_id, |
4351d3ec | 418 | b->c.level, cur_k.k->k.p); |
2817d453 | 419 | cur = NULL; |
a0b73c1c | 420 | if (ret) |
4351d3ec | 421 | break; |
aae15aaf | 422 | continue; |
a0b73c1c KO |
423 | } |
424 | ||
cf904c8d KO |
425 | bch_err_msg(c, ret, "getting btree node"); |
426 | if (ret) | |
aae15aaf | 427 | break; |
a0b73c1c | 428 | |
4351d3ec KO |
429 | ret = btree_repair_node_boundaries(c, b, prev, cur); |
430 | ||
431 | if (ret == DROP_THIS_NODE) { | |
432 | six_unlock_read(&cur->c.lock); | |
ca7d8fca | 433 | bch2_btree_node_evict(trans, cur_k.k); |
4351d3ec KO |
434 | ret = bch2_journal_key_delete(c, b->c.btree_id, |
435 | b->c.level, cur_k.k->k.p); | |
2817d453 | 436 | cur = NULL; |
4351d3ec KO |
437 | if (ret) |
438 | break; | |
439 | continue; | |
440 | } | |
441 | ||
aae15aaf KO |
442 | if (prev) |
443 | six_unlock_read(&prev->c.lock); | |
4351d3ec | 444 | prev = NULL; |
aae15aaf | 445 | |
4351d3ec | 446 | if (ret == DROP_PREV_NODE) { |
ca7d8fca | 447 | bch2_btree_node_evict(trans, prev_k.k); |
4351d3ec KO |
448 | ret = bch2_journal_key_delete(c, b->c.btree_id, |
449 | b->c.level, prev_k.k->k.p); | |
450 | if (ret) | |
451 | break; | |
452 | ||
453 | bch2_btree_and_journal_iter_exit(&iter); | |
454 | bch2_bkey_buf_exit(&prev_k, c); | |
455 | bch2_bkey_buf_exit(&cur_k, c); | |
456 | goto again; | |
457 | } else if (ret) | |
aae15aaf | 458 | break; |
4351d3ec KO |
459 | |
460 | prev = cur; | |
461 | cur = NULL; | |
462 | bch2_bkey_buf_copy(&prev_k, c, cur_k.k); | |
aae15aaf KO |
463 | } |
464 | ||
465 | if (!ret && !IS_ERR_OR_NULL(prev)) { | |
466 | BUG_ON(cur); | |
467 | ret = btree_repair_node_end(c, b, prev); | |
468 | } | |
469 | ||
470 | if (!IS_ERR_OR_NULL(prev)) | |
471 | six_unlock_read(&prev->c.lock); | |
472 | prev = NULL; | |
473 | if (!IS_ERR_OR_NULL(cur)) | |
474 | six_unlock_read(&cur->c.lock); | |
475 | cur = NULL; | |
a0b73c1c | 476 | |
aae15aaf KO |
477 | if (ret) |
478 | goto err; | |
479 | ||
480 | bch2_btree_and_journal_iter_exit(&iter); | |
481 | bch2_btree_and_journal_iter_init_node_iter(&iter, c, b); | |
482 | ||
483 | while ((k = bch2_btree_and_journal_iter_peek(&iter)).k) { | |
4351d3ec | 484 | bch2_bkey_buf_reassemble(&cur_k, c, k); |
aae15aaf | 485 | bch2_btree_and_journal_iter_advance(&iter); |
a0b73c1c | 486 | |
ca7d8fca | 487 | cur = bch2_btree_node_get_noiter(trans, cur_k.k, |
aae15aaf KO |
488 | b->c.btree_id, b->c.level - 1, |
489 | false); | |
490 | ret = PTR_ERR_OR_ZERO(cur); | |
a0b73c1c | 491 | |
cf904c8d KO |
492 | bch_err_msg(c, ret, "getting btree node"); |
493 | if (ret) | |
aae15aaf | 494 | goto err; |
a0b73c1c | 495 | |
ca7d8fca | 496 | ret = bch2_btree_repair_topology_recurse(trans, cur); |
aae15aaf KO |
497 | six_unlock_read(&cur->c.lock); |
498 | cur = NULL; | |
499 | ||
500 | if (ret == DROP_THIS_NODE) { | |
ca7d8fca | 501 | bch2_btree_node_evict(trans, cur_k.k); |
aae15aaf | 502 | ret = bch2_journal_key_delete(c, b->c.btree_id, |
4351d3ec | 503 | b->c.level, cur_k.k->k.p); |
aae15aaf | 504 | dropped_children = true; |
a0b73c1c | 505 | } |
aae15aaf KO |
506 | |
507 | if (ret) | |
508 | goto err; | |
509 | ||
510 | have_child = true; | |
a0b73c1c | 511 | } |
aae15aaf | 512 | |
fa8e94fa KO |
513 | printbuf_reset(&buf); |
514 | bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&b->key)); | |
515 | ||
aae15aaf | 516 | if (mustfix_fsck_err_on(!have_child, c, |
b65db750 | 517 | btree_node_topology_interior_node_empty, |
aae15aaf KO |
518 | "empty interior btree node at btree %s level %u\n" |
519 | " %s", | |
88dfe193 | 520 | bch2_btree_id_str(b->c.btree_id), |
fa8e94fa | 521 | b->c.level, buf.buf)) |
aae15aaf KO |
522 | ret = DROP_THIS_NODE; |
523 | err: | |
d06c1a0c | 524 | fsck_err: |
aae15aaf KO |
525 | if (!IS_ERR_OR_NULL(prev)) |
526 | six_unlock_read(&prev->c.lock); | |
527 | if (!IS_ERR_OR_NULL(cur)) | |
528 | six_unlock_read(&cur->c.lock); | |
529 | ||
530 | bch2_btree_and_journal_iter_exit(&iter); | |
4351d3ec KO |
531 | bch2_bkey_buf_exit(&prev_k, c); |
532 | bch2_bkey_buf_exit(&cur_k, c); | |
aae15aaf KO |
533 | |
534 | if (!ret && dropped_children) | |
535 | goto again; | |
536 | ||
fa8e94fa | 537 | printbuf_exit(&buf); |
aae15aaf KO |
538 | return ret; |
539 | } | |
540 | ||
922bc5a0 | 541 | int bch2_check_topology(struct bch_fs *c) |
aae15aaf | 542 | { |
6bd68ec2 | 543 | struct btree_trans *trans = bch2_trans_get(c); |
aae15aaf KO |
544 | struct btree *b; |
545 | unsigned i; | |
546 | int ret = 0; | |
547 | ||
1e81f89b | 548 | for (i = 0; i < btree_id_nr_alive(c) && !ret; i++) { |
faa6cb6c KO |
549 | struct btree_root *r = bch2_btree_id_root(c, i); |
550 | ||
551 | if (!r->alive) | |
552 | continue; | |
553 | ||
554 | b = r->b; | |
aae15aaf KO |
555 | if (btree_node_fake(b)) |
556 | continue; | |
557 | ||
6bd68ec2 KO |
558 | btree_node_lock_nopath_nofail(trans, &b->c, SIX_LOCK_read); |
559 | ret = bch2_btree_repair_topology_recurse(trans, b); | |
aae15aaf KO |
560 | six_unlock_read(&b->c.lock); |
561 | ||
562 | if (ret == DROP_THIS_NODE) { | |
563 | bch_err(c, "empty btree root - repair unimplemented"); | |
1ed0a5d2 | 564 | ret = -BCH_ERR_fsck_repair_unimplemented; |
aae15aaf KO |
565 | } |
566 | } | |
567 | ||
6bd68ec2 | 568 | bch2_trans_put(trans); |
ca7d8fca | 569 | |
d06c1a0c | 570 | return ret; |
1c6fdbd8 KO |
571 | } |
572 | ||
ca7d8fca | 573 | static int bch2_check_fix_ptrs(struct btree_trans *trans, enum btree_id btree_id, |
5fc70d3a KO |
574 | unsigned level, bool is_root, |
575 | struct bkey_s_c *k) | |
576 | { | |
ca7d8fca | 577 | struct bch_fs *c = trans->c; |
96dea3d5 KO |
578 | struct bkey_ptrs_c ptrs_c = bch2_bkey_ptrs_c(*k); |
579 | const union bch_extent_entry *entry_c; | |
33a391a2 | 580 | struct extent_ptr_decoded p = { 0 }; |
5fc70d3a | 581 | bool do_update = false; |
fa8e94fa | 582 | struct printbuf buf = PRINTBUF; |
5fc70d3a KO |
583 | int ret = 0; |
584 | ||
e5464a37 KO |
585 | /* |
586 | * XXX | |
587 | * use check_bucket_ref here | |
588 | */ | |
96dea3d5 | 589 | bkey_for_each_ptr_decode(k->k, ptrs_c, p, entry_c) { |
0507962f | 590 | struct bch_dev *ca = bch_dev_bkey_exists(c, p.ptr.dev); |
47ac34ec | 591 | struct bucket *g = PTR_GC_BUCKET(ca, &p.ptr); |
96dea3d5 | 592 | enum bch_data_type data_type = bch2_bkey_ptr_data_type(*k, &entry_c->ptr); |
e1036ce5 | 593 | |
330970c2 KO |
594 | if (!g->gen_valid && |
595 | (c->opts.reconstruct_alloc || | |
b65db750 KO |
596 | fsck_err(c, ptr_to_missing_alloc_key, |
597 | "bucket %u:%zu data type %s ptr gen %u missing in alloc btree\n" | |
330970c2 KO |
598 | "while marking %s", |
599 | p.ptr.dev, PTR_BUCKET_NR(ca, &p.ptr), | |
e58f963c | 600 | bch2_data_type_str(ptr_data_type(k->k, &p.ptr)), |
330970c2 KO |
601 | p.ptr.gen, |
602 | (printbuf_reset(&buf), | |
603 | bch2_bkey_val_to_text(&buf, c, *k), buf.buf)))) { | |
0507962f | 604 | if (!p.ptr.cached) { |
ec061b21 | 605 | g->gen_valid = true; |
66d90823 | 606 | g->gen = p.ptr.gen; |
5fc70d3a KO |
607 | } else { |
608 | do_update = true; | |
609 | } | |
610 | } | |
611 | ||
330970c2 KO |
612 | if (gen_cmp(p.ptr.gen, g->gen) > 0 && |
613 | (c->opts.reconstruct_alloc || | |
b65db750 KO |
614 | fsck_err(c, ptr_gen_newer_than_bucket_gen, |
615 | "bucket %u:%zu data type %s ptr gen in the future: %u > %u\n" | |
330970c2 KO |
616 | "while marking %s", |
617 | p.ptr.dev, PTR_BUCKET_NR(ca, &p.ptr), | |
e58f963c | 618 | bch2_data_type_str(ptr_data_type(k->k, &p.ptr)), |
330970c2 KO |
619 | p.ptr.gen, g->gen, |
620 | (printbuf_reset(&buf), | |
621 | bch2_bkey_val_to_text(&buf, c, *k), buf.buf)))) { | |
0507962f | 622 | if (!p.ptr.cached) { |
ec061b21 | 623 | g->gen_valid = true; |
66d90823 KO |
624 | g->gen = p.ptr.gen; |
625 | g->data_type = 0; | |
626 | g->dirty_sectors = 0; | |
627 | g->cached_sectors = 0; | |
3c471b65 | 628 | set_bit(BCH_FS_need_another_gc, &c->flags); |
5fc70d3a KO |
629 | } else { |
630 | do_update = true; | |
631 | } | |
632 | } | |
633 | ||
330970c2 KO |
634 | if (gen_cmp(g->gen, p.ptr.gen) > BUCKET_GC_GEN_MAX && |
635 | (c->opts.reconstruct_alloc || | |
b65db750 KO |
636 | fsck_err(c, ptr_gen_newer_than_bucket_gen, |
637 | "bucket %u:%zu gen %u data type %s: ptr gen %u too stale\n" | |
330970c2 KO |
638 | "while marking %s", |
639 | p.ptr.dev, PTR_BUCKET_NR(ca, &p.ptr), g->gen, | |
e58f963c | 640 | bch2_data_type_str(ptr_data_type(k->k, &p.ptr)), |
330970c2 KO |
641 | p.ptr.gen, |
642 | (printbuf_reset(&buf), | |
643 | bch2_bkey_val_to_text(&buf, c, *k), buf.buf)))) | |
e5464a37 KO |
644 | do_update = true; |
645 | ||
330970c2 KO |
646 | if (!p.ptr.cached && gen_cmp(p.ptr.gen, g->gen) < 0 && |
647 | (c->opts.reconstruct_alloc || | |
b65db750 KO |
648 | fsck_err(c, stale_dirty_ptr, |
649 | "bucket %u:%zu data type %s stale dirty ptr: %u < %u\n" | |
330970c2 KO |
650 | "while marking %s", |
651 | p.ptr.dev, PTR_BUCKET_NR(ca, &p.ptr), | |
e58f963c | 652 | bch2_data_type_str(ptr_data_type(k->k, &p.ptr)), |
330970c2 KO |
653 | p.ptr.gen, g->gen, |
654 | (printbuf_reset(&buf), | |
655 | bch2_bkey_val_to_text(&buf, c, *k), buf.buf)))) | |
5fc70d3a | 656 | do_update = true; |
0507962f | 657 | |
66d90823 | 658 | if (data_type != BCH_DATA_btree && p.ptr.gen != g->gen) |
e59a4d78 KO |
659 | continue; |
660 | ||
91065976 KO |
661 | if (fsck_err_on(bucket_data_type(g->data_type) && |
662 | bucket_data_type(g->data_type) != data_type, c, | |
b65db750 | 663 | ptr_bucket_data_type_mismatch, |
e59a4d78 KO |
664 | "bucket %u:%zu different types of data in same bucket: %s, %s\n" |
665 | "while marking %s", | |
666 | p.ptr.dev, PTR_BUCKET_NR(ca, &p.ptr), | |
e58f963c KO |
667 | bch2_data_type_str(g->data_type), |
668 | bch2_data_type_str(data_type), | |
fa8e94fa KO |
669 | (printbuf_reset(&buf), |
670 | bch2_bkey_val_to_text(&buf, c, *k), buf.buf))) { | |
e59a4d78 | 671 | if (data_type == BCH_DATA_btree) { |
66d90823 | 672 | g->data_type = data_type; |
3c471b65 | 673 | set_bit(BCH_FS_need_another_gc, &c->flags); |
e59a4d78 KO |
674 | } else { |
675 | do_update = true; | |
676 | } | |
677 | } | |
678 | ||
0507962f | 679 | if (p.has_ec) { |
990d42d1 | 680 | struct gc_stripe *m = genradix_ptr(&c->gc_stripes, p.ec.idx); |
0507962f KO |
681 | |
682 | if (fsck_err_on(!m || !m->alive, c, | |
b65db750 | 683 | ptr_to_missing_stripe, |
e1036ce5 KO |
684 | "pointer to nonexistent stripe %llu\n" |
685 | "while marking %s", | |
686 | (u64) p.ec.idx, | |
fa8e94fa KO |
687 | (printbuf_reset(&buf), |
688 | bch2_bkey_val_to_text(&buf, c, *k), buf.buf))) | |
0507962f | 689 | do_update = true; |
b3b66e30 | 690 | |
7546c78d | 691 | if (fsck_err_on(m && m->alive && !bch2_ptr_matches_stripe_m(m, p), c, |
b65db750 | 692 | ptr_to_incorrect_stripe, |
e1036ce5 KO |
693 | "pointer does not match stripe %llu\n" |
694 | "while marking %s", | |
695 | (u64) p.ec.idx, | |
fa8e94fa KO |
696 | (printbuf_reset(&buf), |
697 | bch2_bkey_val_to_text(&buf, c, *k), buf.buf))) | |
b3b66e30 | 698 | do_update = true; |
0507962f | 699 | } |
5fc70d3a KO |
700 | } |
701 | ||
702 | if (do_update) { | |
0507962f KO |
703 | struct bkey_ptrs ptrs; |
704 | union bch_extent_entry *entry; | |
5fc70d3a KO |
705 | struct bch_extent_ptr *ptr; |
706 | struct bkey_i *new; | |
707 | ||
708 | if (is_root) { | |
709 | bch_err(c, "cannot update btree roots yet"); | |
fa8e94fa KO |
710 | ret = -EINVAL; |
711 | goto err; | |
5fc70d3a KO |
712 | } |
713 | ||
714 | new = kmalloc(bkey_bytes(k->k), GFP_KERNEL); | |
dab9ef0d | 715 | if (!new) { |
65d48e35 | 716 | ret = -BCH_ERR_ENOMEM_gc_repair_key; |
cf904c8d | 717 | bch_err_msg(c, ret, "allocating new key"); |
fa8e94fa | 718 | goto err; |
dab9ef0d | 719 | } |
5fc70d3a KO |
720 | |
721 | bkey_reassemble(new, *k); | |
722 | ||
006d69aa KO |
723 | if (level) { |
724 | /* | |
725 | * We don't want to drop btree node pointers - if the | |
726 | * btree node isn't there anymore, the read path will | |
727 | * sort it out: | |
728 | */ | |
729 | ptrs = bch2_bkey_ptrs(bkey_i_to_s(new)); | |
730 | bkey_for_each_ptr(ptrs, ptr) { | |
731 | struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev); | |
47ac34ec | 732 | struct bucket *g = PTR_GC_BUCKET(ca, ptr); |
006d69aa | 733 | |
66d90823 | 734 | ptr->gen = g->gen; |
006d69aa KO |
735 | } |
736 | } else { | |
737 | bch2_bkey_drop_ptrs(bkey_i_to_s(new), ptr, ({ | |
738 | struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev); | |
47ac34ec | 739 | struct bucket *g = PTR_GC_BUCKET(ca, ptr); |
e1036ce5 | 740 | enum bch_data_type data_type = bch2_bkey_ptr_data_type(*k, ptr); |
006d69aa KO |
741 | |
742 | (ptr->cached && | |
66d90823 | 743 | (!g->gen_valid || gen_cmp(ptr->gen, g->gen) > 0)) || |
006d69aa | 744 | (!ptr->cached && |
66d90823 KO |
745 | gen_cmp(ptr->gen, g->gen) < 0) || |
746 | gen_cmp(g->gen, ptr->gen) > BUCKET_GC_GEN_MAX || | |
747 | (g->data_type && | |
748 | g->data_type != data_type); | |
006d69aa | 749 | })); |
0507962f | 750 | again: |
006d69aa KO |
751 | ptrs = bch2_bkey_ptrs(bkey_i_to_s(new)); |
752 | bkey_extent_entry_for_each(ptrs, entry) { | |
753 | if (extent_entry_type(entry) == BCH_EXTENT_ENTRY_stripe_ptr) { | |
990d42d1 | 754 | struct gc_stripe *m = genradix_ptr(&c->gc_stripes, |
006d69aa | 755 | entry->stripe_ptr.idx); |
b3b66e30 KO |
756 | union bch_extent_entry *next_ptr; |
757 | ||
758 | bkey_extent_entry_for_each_from(ptrs, next_ptr, entry) | |
759 | if (extent_entry_type(next_ptr) == BCH_EXTENT_ENTRY_ptr) | |
760 | goto found; | |
761 | next_ptr = NULL; | |
762 | found: | |
763 | if (!next_ptr) { | |
764 | bch_err(c, "aieee, found stripe ptr with no data ptr"); | |
765 | continue; | |
766 | } | |
006d69aa | 767 | |
b3b66e30 KO |
768 | if (!m || !m->alive || |
769 | !__bch2_ptr_matches_stripe(&m->ptrs[entry->stripe_ptr.block], | |
770 | &next_ptr->ptr, | |
771 | m->sectors)) { | |
006d69aa KO |
772 | bch2_bkey_extent_entry_drop(new, entry); |
773 | goto again; | |
774 | } | |
0507962f KO |
775 | } |
776 | } | |
777 | } | |
5fc70d3a | 778 | |
e75b2d4c | 779 | ret = bch2_journal_key_insert_take(c, btree_id, level, new); |
4e08446d | 780 | if (ret) { |
5fc70d3a | 781 | kfree(new); |
fa8e94fa | 782 | goto err; |
2a84de33 | 783 | } |
4e08446d KO |
784 | |
785 | if (level) | |
ca7d8fca | 786 | bch2_btree_node_update_key_early(trans, btree_id, level - 1, *k, new); |
4e08446d | 787 | |
330970c2 | 788 | if (0) { |
1534ebb7 KO |
789 | printbuf_reset(&buf); |
790 | bch2_bkey_val_to_text(&buf, c, *k); | |
791 | bch_info(c, "updated %s", buf.buf); | |
792 | ||
793 | printbuf_reset(&buf); | |
794 | bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(new)); | |
795 | bch_info(c, "new key %s", buf.buf); | |
796 | } | |
fa8e94fa | 797 | |
4e08446d | 798 | *k = bkey_i_to_s_c(new); |
5fc70d3a | 799 | } |
fa8e94fa | 800 | err: |
5fc70d3a | 801 | fsck_err: |
fa8e94fa | 802 | printbuf_exit(&buf); |
5fc70d3a KO |
803 | return ret; |
804 | } | |
805 | ||
2252aa27 KO |
806 | /* marking of btree keys/nodes: */ |
807 | ||
904823de | 808 | static int bch2_gc_mark_key(struct btree_trans *trans, enum btree_id btree_id, |
5fc70d3a | 809 | unsigned level, bool is_root, |
d065472c | 810 | struct bkey_s_c *k, |
c929f230 | 811 | bool initial) |
2252aa27 | 812 | { |
904823de | 813 | struct bch_fs *c = trans->c; |
58e1ea4b KO |
814 | struct bkey deleted = KEY(0, 0, 0); |
815 | struct bkey_s_c old = (struct bkey_s_c) { &deleted, NULL }; | |
2252aa27 KO |
816 | int ret = 0; |
817 | ||
58e1ea4b KO |
818 | deleted.p = k->k->p; |
819 | ||
91f8b567 | 820 | if (initial) { |
29364f34 | 821 | BUG_ON(bch2_journal_seq_verify && |
f0a3a2cc | 822 | k->k->version.lo > atomic64_read(&c->journal.seq)); |
91f8b567 | 823 | |
ca7d8fca | 824 | ret = bch2_check_fix_ptrs(trans, btree_id, level, is_root, k); |
1c8441be KO |
825 | if (ret) |
826 | goto err; | |
827 | ||
d065472c | 828 | if (fsck_err_on(k->k->version.lo > atomic64_read(&c->key_version), c, |
b65db750 | 829 | bkey_version_in_future, |
a9bc0a51 | 830 | "key version number higher than recorded: %llu > %llu", |
d065472c | 831 | k->k->version.lo, |
a9bc0a51 | 832 | atomic64_read(&c->key_version))) |
d065472c | 833 | atomic64_set(&c->key_version, k->k->version.lo); |
2252aa27 KO |
834 | } |
835 | ||
e68914ca | 836 | ret = commit_do(trans, NULL, NULL, 0, |
f0431c5f | 837 | bch2_key_trigger(trans, btree_id, level, old, unsafe_bkey_s_c_to_s(*k), BTREE_TRIGGER_GC)); |
91f8b567 | 838 | fsck_err: |
dab9ef0d | 839 | err: |
cf904c8d | 840 | bch_err_fn(c, ret); |
2252aa27 KO |
841 | return ret; |
842 | } | |
843 | ||
c929f230 | 844 | static int btree_gc_mark_node(struct btree_trans *trans, struct btree *b, bool initial) |
1c6fdbd8 | 845 | { |
904823de | 846 | struct bch_fs *c = trans->c; |
1c6fdbd8 KO |
847 | struct btree_node_iter iter; |
848 | struct bkey unpacked; | |
849 | struct bkey_s_c k; | |
a66f7989 | 850 | struct bkey_buf prev, cur; |
d034c09b KO |
851 | int ret = 0; |
852 | ||
26609b61 | 853 | if (!btree_node_type_needs_gc(btree_node_type(b))) |
2252aa27 | 854 | return 0; |
1c6fdbd8 | 855 | |
d06c1a0c | 856 | bch2_btree_node_iter_init_from_start(&iter, b); |
a66f7989 KO |
857 | bch2_bkey_buf_init(&prev); |
858 | bch2_bkey_buf_init(&cur); | |
859 | bkey_init(&prev.k->k); | |
d06c1a0c KO |
860 | |
861 | while ((k = bch2_btree_node_iter_peek_unpack(&iter, b, &unpacked)).k) { | |
904823de | 862 | ret = bch2_gc_mark_key(trans, b->c.btree_id, b->c.level, false, |
c929f230 | 863 | &k, initial); |
d034c09b KO |
864 | if (ret) |
865 | break; | |
d06c1a0c KO |
866 | |
867 | bch2_btree_node_iter_advance(&iter, b); | |
868 | ||
869 | if (b->c.level) { | |
a66f7989 KO |
870 | bch2_bkey_buf_reassemble(&cur, c, k); |
871 | ||
872 | ret = bch2_gc_check_topology(c, b, &prev, cur, | |
d06c1a0c KO |
873 | bch2_btree_node_iter_end(&iter)); |
874 | if (ret) | |
875 | break; | |
876 | } | |
2252aa27 KO |
877 | } |
878 | ||
a66f7989 KO |
879 | bch2_bkey_buf_exit(&cur, c); |
880 | bch2_bkey_buf_exit(&prev, c); | |
d034c09b | 881 | return ret; |
1c6fdbd8 KO |
882 | } |
883 | ||
904823de | 884 | static int bch2_gc_btree(struct btree_trans *trans, enum btree_id btree_id, |
41e37786 | 885 | bool initial, bool metadata_only) |
1c6fdbd8 | 886 | { |
904823de | 887 | struct bch_fs *c = trans->c; |
67e0dd8f | 888 | struct btree_iter iter; |
1c6fdbd8 | 889 | struct btree *b; |
7a47d099 | 890 | unsigned depth = metadata_only ? 1 : 0; |
1c6fdbd8 KO |
891 | int ret = 0; |
892 | ||
893 | gc_pos_set(c, gc_pos_btree(btree_id, POS_MIN, 0)); | |
894 | ||
904823de | 895 | __for_each_btree_node(trans, iter, btree_id, POS_MIN, |
d355c6f4 | 896 | 0, depth, BTREE_ITER_PREFETCH, b, ret) { |
1c6fdbd8 KO |
897 | bch2_verify_btree_nr_keys(b); |
898 | ||
8777210b KO |
899 | gc_pos_set(c, gc_pos_btree_node(b)); |
900 | ||
c929f230 | 901 | ret = btree_gc_mark_node(trans, b, initial); |
d034c09b KO |
902 | if (ret) |
903 | break; | |
1c6fdbd8 | 904 | } |
904823de | 905 | bch2_trans_iter_exit(trans, &iter); |
50dc0f69 | 906 | |
1c6fdbd8 KO |
907 | if (ret) |
908 | return ret; | |
909 | ||
910 | mutex_lock(&c->btree_root_lock); | |
faa6cb6c | 911 | b = bch2_btree_id_root(c, btree_id)->b; |
d065472c KO |
912 | if (!btree_node_fake(b)) { |
913 | struct bkey_s_c k = bkey_i_to_s_c(&b->key); | |
914 | ||
2611a041 | 915 | ret = bch2_gc_mark_key(trans, b->c.btree_id, b->c.level + 1, |
c929f230 | 916 | true, &k, initial); |
d065472c | 917 | } |
c43a6ef9 | 918 | gc_pos_set(c, gc_pos_btree_root(b->c.btree_id)); |
1c6fdbd8 | 919 | mutex_unlock(&c->btree_root_lock); |
8b2b9d11 KO |
920 | |
921 | return ret; | |
1c6fdbd8 KO |
922 | } |
923 | ||
904823de | 924 | static int bch2_gc_btree_init_recurse(struct btree_trans *trans, struct btree *b, |
d06c1a0c | 925 | unsigned target_depth) |
e62d65f2 | 926 | { |
904823de | 927 | struct bch_fs *c = trans->c; |
e62d65f2 KO |
928 | struct btree_and_journal_iter iter; |
929 | struct bkey_s_c k; | |
a66f7989 | 930 | struct bkey_buf cur, prev; |
fa8e94fa | 931 | struct printbuf buf = PRINTBUF; |
e62d65f2 KO |
932 | int ret = 0; |
933 | ||
5b593ee1 | 934 | bch2_btree_and_journal_iter_init_node_iter(&iter, c, b); |
a66f7989 KO |
935 | bch2_bkey_buf_init(&prev); |
936 | bch2_bkey_buf_init(&cur); | |
937 | bkey_init(&prev.k->k); | |
e62d65f2 KO |
938 | |
939 | while ((k = bch2_btree_and_journal_iter_peek(&iter)).k) { | |
e88a75eb KO |
940 | BUG_ON(bpos_lt(k.k->p, b->data->min_key)); |
941 | BUG_ON(bpos_gt(k.k->p, b->data->max_key)); | |
d06c1a0c | 942 | |
c929f230 KO |
943 | ret = bch2_gc_mark_key(trans, b->c.btree_id, b->c.level, |
944 | false, &k, true); | |
1bb3c2a9 | 945 | if (ret) |
aae15aaf | 946 | goto fsck_err; |
e62d65f2 | 947 | |
d06c1a0c | 948 | if (b->c.level) { |
a66f7989 KO |
949 | bch2_bkey_buf_reassemble(&cur, c, k); |
950 | k = bkey_i_to_s_c(cur.k); | |
d06c1a0c KO |
951 | |
952 | bch2_btree_and_journal_iter_advance(&iter); | |
e62d65f2 | 953 | |
a66f7989 KO |
954 | ret = bch2_gc_check_topology(c, b, |
955 | &prev, cur, | |
d06c1a0c | 956 | !bch2_btree_and_journal_iter_peek(&iter).k); |
e62d65f2 | 957 | if (ret) |
aae15aaf | 958 | goto fsck_err; |
a0b73c1c KO |
959 | } else { |
960 | bch2_btree_and_journal_iter_advance(&iter); | |
961 | } | |
962 | } | |
e62d65f2 | 963 | |
a0b73c1c KO |
964 | if (b->c.level > target_depth) { |
965 | bch2_btree_and_journal_iter_exit(&iter); | |
966 | bch2_btree_and_journal_iter_init_node_iter(&iter, c, b); | |
967 | ||
968 | while ((k = bch2_btree_and_journal_iter_peek(&iter)).k) { | |
969 | struct btree *child; | |
970 | ||
971 | bch2_bkey_buf_reassemble(&cur, c, k); | |
972 | bch2_btree_and_journal_iter_advance(&iter); | |
e62d65f2 | 973 | |
ca7d8fca | 974 | child = bch2_btree_node_get_noiter(trans, cur.k, |
a0b73c1c KO |
975 | b->c.btree_id, b->c.level - 1, |
976 | false); | |
977 | ret = PTR_ERR_OR_ZERO(child); | |
d06c1a0c | 978 | |
aae15aaf KO |
979 | if (ret == -EIO) { |
980 | bch2_topology_error(c); | |
981 | ||
08061519 KO |
982 | if (__fsck_err(c, |
983 | FSCK_CAN_FIX| | |
984 | FSCK_CAN_IGNORE| | |
985 | FSCK_NO_RATELIMIT, | |
b65db750 | 986 | btree_node_read_error, |
08061519 KO |
987 | "Unreadable btree node at btree %s level %u:\n" |
988 | " %s", | |
88dfe193 | 989 | bch2_btree_id_str(b->c.btree_id), |
08061519 | 990 | b->c.level - 1, |
fa8e94fa KO |
991 | (printbuf_reset(&buf), |
992 | bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(cur.k)), buf.buf)) && | |
922bc5a0 | 993 | should_restart_for_topology_repair(c)) { |
aae15aaf | 994 | bch_info(c, "Halting mark and sweep to start topology repair pass"); |
922bc5a0 | 995 | ret = bch2_run_explicit_recovery_pass(c, BCH_RECOVERY_PASS_check_topology); |
aae15aaf KO |
996 | goto fsck_err; |
997 | } else { | |
998 | /* Continue marking when opted to not | |
999 | * fix the error: */ | |
1000 | ret = 0; | |
3c471b65 | 1001 | set_bit(BCH_FS_initial_gc_unfixed, &c->flags); |
aae15aaf KO |
1002 | continue; |
1003 | } | |
1004 | } else if (ret) { | |
1bb3c2a9 | 1005 | bch_err_msg(c, ret, "getting btree node"); |
a0b73c1c | 1006 | break; |
dab9ef0d | 1007 | } |
a0b73c1c | 1008 | |
904823de | 1009 | ret = bch2_gc_btree_init_recurse(trans, child, |
a0b73c1c KO |
1010 | target_depth); |
1011 | six_unlock_read(&child->c.lock); | |
1012 | ||
1013 | if (ret) | |
1014 | break; | |
d06c1a0c | 1015 | } |
e62d65f2 | 1016 | } |
a0b73c1c | 1017 | fsck_err: |
a66f7989 KO |
1018 | bch2_bkey_buf_exit(&cur, c); |
1019 | bch2_bkey_buf_exit(&prev, c); | |
5b593ee1 | 1020 | bch2_btree_and_journal_iter_exit(&iter); |
fa8e94fa | 1021 | printbuf_exit(&buf); |
e62d65f2 KO |
1022 | return ret; |
1023 | } | |
1024 | ||
904823de | 1025 | static int bch2_gc_btree_init(struct btree_trans *trans, |
41e37786 KO |
1026 | enum btree_id btree_id, |
1027 | bool metadata_only) | |
e62d65f2 | 1028 | { |
904823de | 1029 | struct bch_fs *c = trans->c; |
e62d65f2 | 1030 | struct btree *b; |
7a47d099 | 1031 | unsigned target_depth = metadata_only ? 1 : 0; |
fa8e94fa | 1032 | struct printbuf buf = PRINTBUF; |
e62d65f2 KO |
1033 | int ret = 0; |
1034 | ||
faa6cb6c | 1035 | b = bch2_btree_id_root(c, btree_id)->b; |
e62d65f2 KO |
1036 | |
1037 | if (btree_node_fake(b)) | |
1038 | return 0; | |
1039 | ||
1040 | six_lock_read(&b->c.lock, NULL, NULL); | |
fa8e94fa KO |
1041 | printbuf_reset(&buf); |
1042 | bch2_bpos_to_text(&buf, b->data->min_key); | |
e88a75eb | 1043 | if (mustfix_fsck_err_on(!bpos_eq(b->data->min_key, POS_MIN), c, |
b65db750 | 1044 | btree_root_bad_min_key, |
fa8e94fa | 1045 | "btree root with incorrect min_key: %s", buf.buf)) { |
aae15aaf | 1046 | bch_err(c, "repair unimplemented"); |
1ed0a5d2 | 1047 | ret = -BCH_ERR_fsck_repair_unimplemented; |
aae15aaf | 1048 | goto fsck_err; |
d06c1a0c KO |
1049 | } |
1050 | ||
fa8e94fa KO |
1051 | printbuf_reset(&buf); |
1052 | bch2_bpos_to_text(&buf, b->data->max_key); | |
e88a75eb | 1053 | if (mustfix_fsck_err_on(!bpos_eq(b->data->max_key, SPOS_MAX), c, |
b65db750 | 1054 | btree_root_bad_max_key, |
fa8e94fa | 1055 | "btree root with incorrect max_key: %s", buf.buf)) { |
aae15aaf | 1056 | bch_err(c, "repair unimplemented"); |
1ed0a5d2 | 1057 | ret = -BCH_ERR_fsck_repair_unimplemented; |
aae15aaf | 1058 | goto fsck_err; |
d06c1a0c KO |
1059 | } |
1060 | ||
e62d65f2 | 1061 | if (b->c.level >= target_depth) |
904823de | 1062 | ret = bch2_gc_btree_init_recurse(trans, b, target_depth); |
e62d65f2 | 1063 | |
d065472c KO |
1064 | if (!ret) { |
1065 | struct bkey_s_c k = bkey_i_to_s_c(&b->key); | |
1066 | ||
2611a041 | 1067 | ret = bch2_gc_mark_key(trans, b->c.btree_id, b->c.level + 1, true, |
c929f230 | 1068 | &k, true); |
d065472c | 1069 | } |
d06c1a0c | 1070 | fsck_err: |
e62d65f2 KO |
1071 | six_unlock_read(&b->c.lock); |
1072 | ||
cf904c8d | 1073 | bch_err_fn(c, ret); |
fa8e94fa | 1074 | printbuf_exit(&buf); |
e62d65f2 KO |
1075 | return ret; |
1076 | } | |
1077 | ||
cd575ddf KO |
1078 | static inline int btree_id_gc_phase_cmp(enum btree_id l, enum btree_id r) |
1079 | { | |
1080 | return (int) btree_id_to_gc_phase(l) - | |
1081 | (int) btree_id_to_gc_phase(r); | |
1082 | } | |
1083 | ||
41e37786 | 1084 | static int bch2_gc_btrees(struct bch_fs *c, bool initial, bool metadata_only) |
2252aa27 | 1085 | { |
6bd68ec2 | 1086 | struct btree_trans *trans = bch2_trans_get(c); |
cd575ddf | 1087 | enum btree_id ids[BTREE_ID_NR]; |
2252aa27 | 1088 | unsigned i; |
aae15aaf | 1089 | int ret = 0; |
2252aa27 | 1090 | |
cd575ddf KO |
1091 | for (i = 0; i < BTREE_ID_NR; i++) |
1092 | ids[i] = i; | |
1093 | bubble_sort(ids, BTREE_ID_NR, btree_id_gc_phase_cmp); | |
1094 | ||
aae15aaf KO |
1095 | for (i = 0; i < BTREE_ID_NR && !ret; i++) |
1096 | ret = initial | |
6bd68ec2 KO |
1097 | ? bch2_gc_btree_init(trans, ids[i], metadata_only) |
1098 | : bch2_gc_btree(trans, ids[i], initial, metadata_only); | |
2252aa27 | 1099 | |
faa6cb6c KO |
1100 | for (i = BTREE_ID_NR; i < btree_id_nr_alive(c) && !ret; i++) { |
1101 | if (!bch2_btree_id_root(c, i)->alive) | |
1102 | continue; | |
1103 | ||
1104 | ret = initial | |
6bd68ec2 KO |
1105 | ? bch2_gc_btree_init(trans, i, metadata_only) |
1106 | : bch2_gc_btree(trans, i, initial, metadata_only); | |
faa6cb6c KO |
1107 | } |
1108 | ||
6bd68ec2 | 1109 | bch2_trans_put(trans); |
cf904c8d | 1110 | bch_err_fn(c, ret); |
aae15aaf | 1111 | return ret; |
2252aa27 KO |
1112 | } |
1113 | ||
1c6fdbd8 KO |
1114 | static void mark_metadata_sectors(struct bch_fs *c, struct bch_dev *ca, |
1115 | u64 start, u64 end, | |
1116 | enum bch_data_type type, | |
1117 | unsigned flags) | |
1118 | { | |
1119 | u64 b = sector_to_bucket(ca, start); | |
1120 | ||
1121 | do { | |
1122 | unsigned sectors = | |
1123 | min_t(u64, bucket_to_sector(ca, b + 1), end) - start; | |
1124 | ||
1125 | bch2_mark_metadata_bucket(c, ca, b, type, sectors, | |
1126 | gc_phase(GC_PHASE_SB), flags); | |
1127 | b++; | |
1128 | start += sectors; | |
1129 | } while (start < end); | |
1130 | } | |
1131 | ||
77170d0d KO |
1132 | static void bch2_mark_dev_superblock(struct bch_fs *c, struct bch_dev *ca, |
1133 | unsigned flags) | |
1c6fdbd8 KO |
1134 | { |
1135 | struct bch_sb_layout *layout = &ca->disk_sb.sb->layout; | |
1136 | unsigned i; | |
1137 | u64 b; | |
1138 | ||
1c6fdbd8 KO |
1139 | for (i = 0; i < layout->nr_superblocks; i++) { |
1140 | u64 offset = le64_to_cpu(layout->sb_offset[i]); | |
1141 | ||
1142 | if (offset == BCH_SB_SECTOR) | |
1143 | mark_metadata_sectors(c, ca, 0, BCH_SB_SECTOR, | |
89fd25be | 1144 | BCH_DATA_sb, flags); |
1c6fdbd8 KO |
1145 | |
1146 | mark_metadata_sectors(c, ca, offset, | |
1147 | offset + (1 << layout->sb_max_size_bits), | |
89fd25be | 1148 | BCH_DATA_sb, flags); |
1c6fdbd8 KO |
1149 | } |
1150 | ||
1c6fdbd8 KO |
1151 | for (i = 0; i < ca->journal.nr; i++) { |
1152 | b = ca->journal.buckets[i]; | |
89fd25be | 1153 | bch2_mark_metadata_bucket(c, ca, b, BCH_DATA_journal, |
1c6fdbd8 KO |
1154 | ca->mi.bucket_size, |
1155 | gc_phase(GC_PHASE_SB), flags); | |
1156 | } | |
1c6fdbd8 KO |
1157 | } |
1158 | ||
1159 | static void bch2_mark_superblocks(struct bch_fs *c) | |
1160 | { | |
1c6fdbd8 KO |
1161 | mutex_lock(&c->sb_lock); |
1162 | gc_pos_set(c, gc_phase(GC_PHASE_SB)); | |
1163 | ||
9fea2274 | 1164 | for_each_online_member(c, ca) |
2d594dfb | 1165 | bch2_mark_dev_superblock(c, ca, BTREE_TRIGGER_GC); |
1c6fdbd8 KO |
1166 | mutex_unlock(&c->sb_lock); |
1167 | } | |
1168 | ||
00b8ccf7 | 1169 | #if 0 |
1c6fdbd8 KO |
1170 | /* Also see bch2_pending_btree_node_free_insert_done() */ |
1171 | static void bch2_mark_pending_btree_node_frees(struct bch_fs *c) | |
1172 | { | |
1c6fdbd8 KO |
1173 | struct btree_update *as; |
1174 | struct pending_btree_node_free *d; | |
1175 | ||
1176 | mutex_lock(&c->btree_interior_update_lock); | |
1177 | gc_pos_set(c, gc_phase(GC_PHASE_PENDING_DELETE)); | |
1178 | ||
1179 | for_each_pending_btree_node_free(c, as, d) | |
1180 | if (d->index_update_done) | |
2debb1b8 | 1181 | bch2_mark_key(c, bkey_i_to_s_c(&d->key), BTREE_TRIGGER_GC); |
1c6fdbd8 KO |
1182 | |
1183 | mutex_unlock(&c->btree_interior_update_lock); | |
1184 | } | |
00b8ccf7 | 1185 | #endif |
1c6fdbd8 | 1186 | |
9ca53b55 KO |
1187 | static void bch2_gc_free(struct bch_fs *c) |
1188 | { | |
990d42d1 KO |
1189 | genradix_free(&c->reflink_gc_table); |
1190 | genradix_free(&c->gc_stripes); | |
dfe9bfb3 | 1191 | |
9fea2274 | 1192 | for_each_member_device(c, ca) { |
5735608c | 1193 | kvpfree(rcu_dereference_protected(ca->buckets_gc, 1), |
9ca53b55 KO |
1194 | sizeof(struct bucket_array) + |
1195 | ca->mi.nbuckets * sizeof(struct bucket)); | |
5735608c | 1196 | ca->buckets_gc = NULL; |
9ca53b55 | 1197 | |
180fb49d KO |
1198 | free_percpu(ca->usage_gc); |
1199 | ca->usage_gc = NULL; | |
9ca53b55 KO |
1200 | } |
1201 | ||
5e82a9a1 KO |
1202 | free_percpu(c->usage_gc); |
1203 | c->usage_gc = NULL; | |
06b7345c KO |
1204 | } |
1205 | ||
a1d58243 | 1206 | static int bch2_gc_done(struct bch_fs *c, |
41e37786 | 1207 | bool initial, bool metadata_only) |
9ca53b55 | 1208 | { |
3a402c8d | 1209 | struct bch_dev *ca = NULL; |
fa8e94fa | 1210 | struct printbuf buf = PRINTBUF; |
80b3bf33 KO |
1211 | bool verify = !metadata_only && |
1212 | !c->opts.reconstruct_alloc && | |
1213 | (!initial || (c->sb.compat & (1ULL << BCH_COMPAT_alloc_info))); | |
9fea2274 | 1214 | unsigned i; |
cccf4e6d | 1215 | int ret = 0; |
9ca53b55 | 1216 | |
ec061b21 KO |
1217 | percpu_down_write(&c->mark_lock); |
1218 | ||
b65db750 | 1219 | #define copy_field(_err, _f, _msg, ...) \ |
80b3bf33 KO |
1220 | if (dst->_f != src->_f && \ |
1221 | (!verify || \ | |
b65db750 | 1222 | fsck_err(c, _err, _msg ": got %llu, should be %llu" \ |
80b3bf33 KO |
1223 | , ##__VA_ARGS__, dst->_f, src->_f))) \ |
1224 | dst->_f = src->_f | |
b65db750 | 1225 | #define copy_dev_field(_err, _f, _msg, ...) \ |
9fea2274 | 1226 | copy_field(_err, _f, "dev %u has wrong " _msg, ca->dev_idx, ##__VA_ARGS__) |
b65db750 KO |
1227 | #define copy_fs_field(_err, _f, _msg, ...) \ |
1228 | copy_field(_err, _f, "fs has wrong " _msg, ##__VA_ARGS__) | |
9ca53b55 | 1229 | |
180fb49d KO |
1230 | for (i = 0; i < ARRAY_SIZE(c->usage); i++) |
1231 | bch2_fs_usage_acc_to_base(c, i); | |
1232 | ||
9fea2274 | 1233 | __for_each_member_device(c, ca) { |
ec061b21 KO |
1234 | struct bch_dev_usage *dst = ca->usage_base; |
1235 | struct bch_dev_usage *src = (void *) | |
73bd774d | 1236 | bch2_acc_percpu_u64s((u64 __percpu *) ca->usage_gc, |
ec061b21 KO |
1237 | dev_usage_u64s()); |
1238 | ||
ec061b21 | 1239 | for (i = 0; i < BCH_DATA_NR; i++) { |
b65db750 | 1240 | copy_dev_field(dev_usage_buckets_wrong, |
e58f963c | 1241 | d[i].buckets, "%s buckets", bch2_data_type_str(i)); |
b65db750 | 1242 | copy_dev_field(dev_usage_sectors_wrong, |
e58f963c | 1243 | d[i].sectors, "%s sectors", bch2_data_type_str(i)); |
b65db750 | 1244 | copy_dev_field(dev_usage_fragmented_wrong, |
e58f963c | 1245 | d[i].fragmented, "%s fragmented", bch2_data_type_str(i)); |
180fb49d | 1246 | } |
b5e85d4d | 1247 | } |
9ca53b55 KO |
1248 | |
1249 | { | |
ecf37a4a | 1250 | unsigned nr = fs_usage_u64s(c); |
5e82a9a1 | 1251 | struct bch_fs_usage *dst = c->usage_base; |
23f80d2b | 1252 | struct bch_fs_usage *src = (void *) |
73bd774d | 1253 | bch2_acc_percpu_u64s((u64 __percpu *) c->usage_gc, nr); |
9ca53b55 | 1254 | |
b65db750 KO |
1255 | copy_fs_field(fs_usage_hidden_wrong, |
1256 | hidden, "hidden"); | |
1257 | copy_fs_field(fs_usage_btree_wrong, | |
1258 | btree, "btree"); | |
06b7345c | 1259 | |
41e37786 | 1260 | if (!metadata_only) { |
b65db750 KO |
1261 | copy_fs_field(fs_usage_data_wrong, |
1262 | data, "data"); | |
1263 | copy_fs_field(fs_usage_cached_wrong, | |
1264 | cached, "cached"); | |
1265 | copy_fs_field(fs_usage_reserved_wrong, | |
1266 | reserved, "reserved"); | |
1267 | copy_fs_field(fs_usage_nr_inodes_wrong, | |
1268 | nr_inodes,"nr_inodes"); | |
41e37786 KO |
1269 | |
1270 | for (i = 0; i < BCH_REPLICAS_MAX; i++) | |
b65db750 KO |
1271 | copy_fs_field(fs_usage_persistent_reserved_wrong, |
1272 | persistent_reserved[i], | |
41e37786 KO |
1273 | "persistent_reserved[%i]", i); |
1274 | } | |
9ca53b55 | 1275 | |
7ef2a73a | 1276 | for (i = 0; i < c->replicas.nr; i++) { |
086a52f7 | 1277 | struct bch_replicas_entry_v1 *e = |
8777210b | 1278 | cpu_replicas_entry(&c->replicas, i); |
8777210b | 1279 | |
41e37786 KO |
1280 | if (metadata_only && |
1281 | (e->data_type == BCH_DATA_user || | |
1282 | e->data_type == BCH_DATA_cached)) | |
1283 | continue; | |
1284 | ||
fa8e94fa KO |
1285 | printbuf_reset(&buf); |
1286 | bch2_replicas_entry_to_text(&buf, e); | |
8777210b | 1287 | |
b65db750 KO |
1288 | copy_fs_field(fs_usage_replicas_wrong, |
1289 | replicas[i], "%s", buf.buf); | |
7ef2a73a | 1290 | } |
9ca53b55 | 1291 | } |
76f4c7b0 | 1292 | |
9ca53b55 KO |
1293 | #undef copy_fs_field |
1294 | #undef copy_dev_field | |
dfe9bfb3 KO |
1295 | #undef copy_stripe_field |
1296 | #undef copy_field | |
cccf4e6d | 1297 | fsck_err: |
3a402c8d KO |
1298 | if (ca) |
1299 | percpu_ref_put(&ca->ref); | |
cf904c8d | 1300 | bch_err_fn(c, ret); |
ec061b21 KO |
1301 | |
1302 | percpu_up_write(&c->mark_lock); | |
fa8e94fa | 1303 | printbuf_exit(&buf); |
cccf4e6d | 1304 | return ret; |
9ca53b55 KO |
1305 | } |
1306 | ||
14d7d61f | 1307 | static int bch2_gc_start(struct bch_fs *c) |
9ca53b55 | 1308 | { |
5e82a9a1 | 1309 | BUG_ON(c->usage_gc); |
9ca53b55 | 1310 | |
5e82a9a1 | 1311 | c->usage_gc = __alloc_percpu_gfp(fs_usage_u64s(c) * sizeof(u64), |
ecf37a4a | 1312 | sizeof(u64), GFP_KERNEL); |
1e1a31c4 KO |
1313 | if (!c->usage_gc) { |
1314 | bch_err(c, "error allocating c->usage_gc"); | |
65d48e35 | 1315 | return -BCH_ERR_ENOMEM_gc_start; |
1e1a31c4 | 1316 | } |
9ca53b55 | 1317 | |
9fea2274 | 1318 | for_each_member_device(c, ca) { |
180fb49d | 1319 | BUG_ON(ca->usage_gc); |
9ca53b55 | 1320 | |
180fb49d KO |
1321 | ca->usage_gc = alloc_percpu(struct bch_dev_usage); |
1322 | if (!ca->usage_gc) { | |
1323 | bch_err(c, "error allocating ca->usage_gc"); | |
9ca53b55 | 1324 | percpu_ref_put(&ca->ref); |
65d48e35 | 1325 | return -BCH_ERR_ENOMEM_gc_start; |
1c6fdbd8 | 1326 | } |
822835ff KO |
1327 | |
1328 | this_cpu_write(ca->usage_gc->d[BCH_DATA_free].buckets, | |
1329 | ca->mi.nbuckets - ca->mi.first_bucket); | |
1c6fdbd8 | 1330 | } |
9ca53b55 | 1331 | |
ec061b21 KO |
1332 | return 0; |
1333 | } | |
1334 | ||
14d7d61f KO |
1335 | static int bch2_gc_reset(struct bch_fs *c) |
1336 | { | |
9fea2274 | 1337 | for_each_member_device(c, ca) { |
14d7d61f KO |
1338 | free_percpu(ca->usage_gc); |
1339 | ca->usage_gc = NULL; | |
1340 | } | |
1341 | ||
1342 | free_percpu(c->usage_gc); | |
1343 | c->usage_gc = NULL; | |
1344 | ||
1345 | return bch2_gc_start(c); | |
1346 | } | |
1347 | ||
3d48a7f8 KO |
1348 | /* returns true if not equal */ |
1349 | static inline bool bch2_alloc_v4_cmp(struct bch_alloc_v4 l, | |
1350 | struct bch_alloc_v4 r) | |
1351 | { | |
1352 | return l.gen != r.gen || | |
1353 | l.oldest_gen != r.oldest_gen || | |
1354 | l.data_type != r.data_type || | |
1355 | l.dirty_sectors != r.dirty_sectors || | |
1356 | l.cached_sectors != r.cached_sectors || | |
1357 | l.stripe_redundancy != r.stripe_redundancy || | |
1358 | l.stripe != r.stripe; | |
1359 | } | |
1360 | ||
ec061b21 KO |
1361 | static int bch2_alloc_write_key(struct btree_trans *trans, |
1362 | struct btree_iter *iter, | |
326568f1 | 1363 | struct bkey_s_c k, |
78c8fe20 | 1364 | bool metadata_only) |
ec061b21 KO |
1365 | { |
1366 | struct bch_fs *c = trans->c; | |
1367 | struct bch_dev *ca = bch_dev_bkey_exists(c, iter->pos.inode); | |
822835ff | 1368 | struct bucket gc, *b; |
3d48a7f8 | 1369 | struct bkey_i_alloc_v4 *a; |
19a614d2 KO |
1370 | struct bch_alloc_v4 old_convert, new; |
1371 | const struct bch_alloc_v4 *old; | |
822835ff | 1372 | enum bch_data_type type; |
ec061b21 KO |
1373 | int ret; |
1374 | ||
19a614d2 KO |
1375 | old = bch2_alloc_to_v4(k, &old_convert); |
1376 | new = *old; | |
ec061b21 KO |
1377 | |
1378 | percpu_down_read(&c->mark_lock); | |
822835ff KO |
1379 | b = gc_bucket(ca, iter->pos.offset); |
1380 | ||
1381 | /* | |
1382 | * b->data_type doesn't yet include need_discard & need_gc_gen states - | |
1383 | * fix that here: | |
1384 | */ | |
1385 | type = __alloc_data_type(b->dirty_sectors, | |
1386 | b->cached_sectors, | |
1387 | b->stripe, | |
19a614d2 | 1388 | *old, |
822835ff KO |
1389 | b->data_type); |
1390 | if (b->data_type != type) { | |
1391 | struct bch_dev_usage *u; | |
1392 | ||
1393 | preempt_disable(); | |
1394 | u = this_cpu_ptr(ca->usage_gc); | |
1395 | u->d[b->data_type].buckets--; | |
1396 | b->data_type = type; | |
1397 | u->d[b->data_type].buckets++; | |
1398 | preempt_enable(); | |
1399 | } | |
1400 | ||
1401 | gc = *b; | |
ec061b21 KO |
1402 | percpu_up_read(&c->mark_lock); |
1403 | ||
1404 | if (metadata_only && | |
3d48a7f8 KO |
1405 | gc.data_type != BCH_DATA_sb && |
1406 | gc.data_type != BCH_DATA_journal && | |
1407 | gc.data_type != BCH_DATA_btree) | |
ec061b21 KO |
1408 | return 0; |
1409 | ||
19a614d2 | 1410 | if (gen_after(old->gen, gc.gen)) |
ec061b21 KO |
1411 | return 0; |
1412 | ||
91065976 KO |
1413 | if (c->opts.reconstruct_alloc || |
1414 | fsck_err_on(new.data_type != gc.data_type, c, | |
b65db750 | 1415 | alloc_key_data_type_wrong, |
91065976 KO |
1416 | "bucket %llu:%llu gen %u has wrong data_type" |
1417 | ": got %s, should be %s", | |
1418 | iter->pos.inode, iter->pos.offset, | |
1419 | gc.gen, | |
e58f963c KO |
1420 | bch2_data_type_str(new.data_type), |
1421 | bch2_data_type_str(gc.data_type))) | |
91065976 KO |
1422 | new.data_type = gc.data_type; |
1423 | ||
b65db750 | 1424 | #define copy_bucket_field(_errtype, _f) \ |
80b3bf33 | 1425 | if (c->opts.reconstruct_alloc || \ |
b65db750 | 1426 | fsck_err_on(new._f != gc._f, c, _errtype, \ |
ec061b21 KO |
1427 | "bucket %llu:%llu gen %u data type %s has wrong " #_f \ |
1428 | ": got %u, should be %u", \ | |
1429 | iter->pos.inode, iter->pos.offset, \ | |
66d90823 | 1430 | gc.gen, \ |
e58f963c | 1431 | bch2_data_type_str(gc.data_type), \ |
3d48a7f8 KO |
1432 | new._f, gc._f)) \ |
1433 | new._f = gc._f; \ | |
ec061b21 | 1434 | |
b65db750 KO |
1435 | copy_bucket_field(alloc_key_gen_wrong, |
1436 | gen); | |
1437 | copy_bucket_field(alloc_key_dirty_sectors_wrong, | |
1438 | dirty_sectors); | |
1439 | copy_bucket_field(alloc_key_cached_sectors_wrong, | |
1440 | cached_sectors); | |
1441 | copy_bucket_field(alloc_key_stripe_wrong, | |
1442 | stripe); | |
1443 | copy_bucket_field(alloc_key_stripe_redundancy_wrong, | |
1444 | stripe_redundancy); | |
ec061b21 KO |
1445 | #undef copy_bucket_field |
1446 | ||
19a614d2 | 1447 | if (!bch2_alloc_v4_cmp(*old, new)) |
ec061b21 KO |
1448 | return 0; |
1449 | ||
3d48a7f8 KO |
1450 | a = bch2_alloc_to_v4_mut(trans, k); |
1451 | ret = PTR_ERR_OR_ZERO(a); | |
1452 | if (ret) | |
1453 | return ret; | |
1454 | ||
1455 | a->v = new; | |
ec061b21 | 1456 | |
7003589d KO |
1457 | /* |
1458 | * The trigger normally makes sure this is set, but we're not running | |
1459 | * triggers: | |
1460 | */ | |
1461 | if (a->v.data_type == BCH_DATA_cached && !a->v.io_time[READ]) | |
1462 | a->v.io_time[READ] = max_t(u64, 1, atomic64_read(&c->io_clock[READ].now)); | |
1463 | ||
3d48a7f8 | 1464 | ret = bch2_trans_update(trans, iter, &a->k_i, BTREE_TRIGGER_NORUN); |
ec061b21 KO |
1465 | fsck_err: |
1466 | return ret; | |
1467 | } | |
1468 | ||
78c8fe20 | 1469 | static int bch2_gc_alloc_done(struct bch_fs *c, bool metadata_only) |
ec061b21 | 1470 | { |
ec061b21 KO |
1471 | int ret = 0; |
1472 | ||
9fea2274 KO |
1473 | for_each_member_device(c, ca) { |
1474 | ret = bch2_trans_run(c, | |
1475 | for_each_btree_key_upto_commit(trans, iter, BTREE_ID_alloc, | |
1476 | POS(ca->dev_idx, ca->mi.first_bucket), | |
1477 | POS(ca->dev_idx, ca->mi.nbuckets - 1), | |
1478 | BTREE_ITER_SLOTS|BTREE_ITER_PREFETCH, k, | |
1479 | NULL, NULL, BCH_TRANS_COMMIT_lazy_rw, | |
1480 | bch2_alloc_write_key(trans, &iter, k, metadata_only))); | |
1481 | if (ret) { | |
ec061b21 KO |
1482 | percpu_ref_put(&ca->ref); |
1483 | break; | |
1484 | } | |
1485 | } | |
a1d58243 | 1486 | |
9fea2274 KO |
1487 | bch_err_fn(c, ret); |
1488 | return ret; | |
ec061b21 | 1489 | } |
41e37786 | 1490 | |
78c8fe20 | 1491 | static int bch2_gc_alloc_start(struct bch_fs *c, bool metadata_only) |
ec061b21 | 1492 | { |
9fea2274 | 1493 | for_each_member_device(c, ca) { |
ec061b21 KO |
1494 | struct bucket_array *buckets = kvpmalloc(sizeof(struct bucket_array) + |
1495 | ca->mi.nbuckets * sizeof(struct bucket), | |
1496 | GFP_KERNEL|__GFP_ZERO); | |
1497 | if (!buckets) { | |
1498 | percpu_ref_put(&ca->ref); | |
ec061b21 | 1499 | bch_err(c, "error allocating ca->buckets[gc]"); |
9fea2274 | 1500 | return -BCH_ERR_ENOMEM_gc_alloc_start; |
28062d32 | 1501 | } |
9ca53b55 | 1502 | |
ec061b21 KO |
1503 | buckets->first_bucket = ca->mi.first_bucket; |
1504 | buckets->nbuckets = ca->mi.nbuckets; | |
5735608c | 1505 | rcu_assign_pointer(ca->buckets_gc, buckets); |
b5e85d4d | 1506 | } |
0741d378 | 1507 | |
9fea2274 KO |
1508 | int ret = bch2_trans_run(c, |
1509 | for_each_btree_key(trans, iter, BTREE_ID_alloc, POS_MIN, | |
1510 | BTREE_ITER_PREFETCH, k, ({ | |
1511 | struct bch_dev *ca = bch_dev_bkey_exists(c, k.k->p.inode); | |
1512 | struct bucket *g = gc_bucket(ca, k.k->p.offset); | |
463086d9 | 1513 | |
9fea2274 KO |
1514 | struct bch_alloc_v4 a_convert; |
1515 | const struct bch_alloc_v4 *a = bch2_alloc_to_v4(k, &a_convert); | |
1516 | ||
1517 | g->gen_valid = 1; | |
1518 | g->gen = a->gen; | |
1519 | ||
1520 | if (metadata_only && | |
1521 | (a->data_type == BCH_DATA_user || | |
1522 | a->data_type == BCH_DATA_cached || | |
1523 | a->data_type == BCH_DATA_parity)) { | |
1524 | g->data_type = a->data_type; | |
1525 | g->dirty_sectors = a->dirty_sectors; | |
1526 | g->cached_sectors = a->cached_sectors; | |
1527 | g->stripe = a->stripe; | |
1528 | g->stripe_redundancy = a->stripe_redundancy; | |
1529 | } | |
1530 | ||
1531 | 0; | |
1532 | }))); | |
cf904c8d | 1533 | bch_err_fn(c, ret); |
5735608c | 1534 | return ret; |
1c6fdbd8 KO |
1535 | } |
1536 | ||
78c8fe20 | 1537 | static void bch2_gc_alloc_reset(struct bch_fs *c, bool metadata_only) |
8f11548e | 1538 | { |
9fea2274 | 1539 | for_each_member_device(c, ca) { |
5735608c | 1540 | struct bucket_array *buckets = gc_bucket_array(ca); |
8f11548e KO |
1541 | struct bucket *g; |
1542 | ||
1543 | for_each_bucket(g, buckets) { | |
1544 | if (metadata_only && | |
66d90823 KO |
1545 | (g->data_type == BCH_DATA_user || |
1546 | g->data_type == BCH_DATA_cached || | |
1547 | g->data_type == BCH_DATA_parity)) | |
8f11548e | 1548 | continue; |
48620e51 | 1549 | g->data_type = 0; |
66d90823 KO |
1550 | g->dirty_sectors = 0; |
1551 | g->cached_sectors = 0; | |
8f11548e | 1552 | } |
b5e85d4d | 1553 | } |
8f11548e KO |
1554 | } |
1555 | ||
326568f1 KO |
1556 | static int bch2_gc_write_reflink_key(struct btree_trans *trans, |
1557 | struct btree_iter *iter, | |
1558 | struct bkey_s_c k, | |
1559 | size_t *idx) | |
890b74f0 | 1560 | { |
326568f1 KO |
1561 | struct bch_fs *c = trans->c; |
1562 | const __le64 *refcount = bkey_refcount_c(k); | |
fa8e94fa | 1563 | struct printbuf buf = PRINTBUF; |
326568f1 | 1564 | struct reflink_gc *r; |
890b74f0 KO |
1565 | int ret = 0; |
1566 | ||
326568f1 | 1567 | if (!refcount) |
890b74f0 KO |
1568 | return 0; |
1569 | ||
326568f1 KO |
1570 | while ((r = genradix_ptr(&c->reflink_gc_table, *idx)) && |
1571 | r->offset < k.k->p.offset) | |
1572 | ++*idx; | |
904823de | 1573 | |
326568f1 KO |
1574 | if (!r || |
1575 | r->offset != k.k->p.offset || | |
1576 | r->size != k.k->size) { | |
1577 | bch_err(c, "unexpected inconsistency walking reflink table at gc finish"); | |
1578 | return -EINVAL; | |
1579 | } | |
890b74f0 | 1580 | |
326568f1 | 1581 | if (fsck_err_on(r->refcount != le64_to_cpu(*refcount), c, |
b65db750 | 1582 | reflink_v_refcount_wrong, |
326568f1 KO |
1583 | "reflink key has wrong refcount:\n" |
1584 | " %s\n" | |
1585 | " should be %u", | |
1586 | (bch2_bkey_val_to_text(&buf, c, k), buf.buf), | |
1587 | r->refcount)) { | |
0fb3355d | 1588 | struct bkey_i *new = bch2_bkey_make_mut(trans, iter, &k, 0); |
890b74f0 | 1589 | |
326568f1 KO |
1590 | ret = PTR_ERR_OR_ZERO(new); |
1591 | if (ret) | |
1592 | return ret; | |
890b74f0 | 1593 | |
326568f1 KO |
1594 | if (!r->refcount) |
1595 | new->k.type = KEY_TYPE_deleted; | |
1596 | else | |
717296c3 | 1597 | *bkey_refcount(bkey_i_to_s(new)) = cpu_to_le64(r->refcount); |
326568f1 KO |
1598 | } |
1599 | fsck_err: | |
1600 | printbuf_exit(&buf); | |
1601 | return ret; | |
1602 | } | |
890b74f0 | 1603 | |
326568f1 KO |
1604 | static int bch2_gc_reflink_done(struct bch_fs *c, bool metadata_only) |
1605 | { | |
326568f1 | 1606 | size_t idx = 0; |
890b74f0 | 1607 | |
326568f1 KO |
1608 | if (metadata_only) |
1609 | return 0; | |
1610 | ||
80eab7a7 KO |
1611 | int ret = bch2_trans_run(c, |
1612 | for_each_btree_key_commit(trans, iter, | |
1613 | BTREE_ID_reflink, POS_MIN, | |
1614 | BTREE_ITER_PREFETCH, k, | |
1615 | NULL, NULL, BCH_TRANS_COMMIT_no_enospc, | |
1616 | bch2_gc_write_reflink_key(trans, &iter, k, &idx))); | |
890b74f0 KO |
1617 | c->reflink_gc_nr = 0; |
1618 | return ret; | |
1619 | } | |
1620 | ||
78c8fe20 | 1621 | static int bch2_gc_reflink_start(struct bch_fs *c, |
8f11548e KO |
1622 | bool metadata_only) |
1623 | { | |
8f11548e KO |
1624 | |
1625 | if (metadata_only) | |
1626 | return 0; | |
1627 | ||
8f11548e KO |
1628 | c->reflink_gc_nr = 0; |
1629 | ||
80eab7a7 | 1630 | int ret = bch2_trans_run(c, |
5028b907 KO |
1631 | for_each_btree_key(trans, iter, BTREE_ID_reflink, POS_MIN, |
1632 | BTREE_ITER_PREFETCH, k, ({ | |
27b2df98 | 1633 | const __le64 *refcount = bkey_refcount_c(k); |
8f11548e | 1634 | |
27b2df98 KO |
1635 | if (!refcount) |
1636 | continue; | |
8f11548e | 1637 | |
80eab7a7 KO |
1638 | struct reflink_gc *r = genradix_ptr_alloc(&c->reflink_gc_table, |
1639 | c->reflink_gc_nr++, GFP_KERNEL); | |
27b2df98 KO |
1640 | if (!r) { |
1641 | ret = -BCH_ERR_ENOMEM_gc_reflink_start; | |
1642 | break; | |
1643 | } | |
8f11548e | 1644 | |
27b2df98 KO |
1645 | r->offset = k.k->p.offset; |
1646 | r->size = k.k->size; | |
1647 | r->refcount = 0; | |
1648 | 0; | |
1649 | }))); | |
8f11548e | 1650 | |
27b2df98 | 1651 | bch_err_fn(c, ret); |
8f11548e KO |
1652 | return ret; |
1653 | } | |
1654 | ||
78c8fe20 | 1655 | static void bch2_gc_reflink_reset(struct bch_fs *c, bool metadata_only) |
8f11548e KO |
1656 | { |
1657 | struct genradix_iter iter; | |
1658 | struct reflink_gc *r; | |
1659 | ||
1660 | genradix_for_each(&c->reflink_gc_table, iter, r) | |
1661 | r->refcount = 0; | |
1662 | } | |
1663 | ||
326568f1 KO |
1664 | static int bch2_gc_write_stripes_key(struct btree_trans *trans, |
1665 | struct btree_iter *iter, | |
1666 | struct bkey_s_c k) | |
990d42d1 | 1667 | { |
326568f1 | 1668 | struct bch_fs *c = trans->c; |
fa8e94fa | 1669 | struct printbuf buf = PRINTBUF; |
326568f1 KO |
1670 | const struct bch_stripe *s; |
1671 | struct gc_stripe *m; | |
d57c9add | 1672 | bool bad = false; |
990d42d1 KO |
1673 | unsigned i; |
1674 | int ret = 0; | |
1675 | ||
326568f1 | 1676 | if (k.k->type != KEY_TYPE_stripe) |
990d42d1 KO |
1677 | return 0; |
1678 | ||
326568f1 KO |
1679 | s = bkey_s_c_to_stripe(k).v; |
1680 | m = genradix_ptr(&c->gc_stripes, k.k->p.offset); | |
5222a460 | 1681 | |
d57c9add KO |
1682 | for (i = 0; i < s->nr_blocks; i++) { |
1683 | u32 old = stripe_blockcount_get(s, i); | |
1684 | u32 new = (m ? m->block_sectors[i] : 0); | |
1685 | ||
1686 | if (old != new) { | |
1687 | prt_printf(&buf, "stripe block %u has wrong sector count: got %u, should be %u\n", | |
1688 | i, old, new); | |
1689 | bad = true; | |
1690 | } | |
1691 | } | |
1692 | ||
1693 | if (bad) | |
1694 | bch2_bkey_val_to_text(&buf, c, k); | |
1695 | ||
b65db750 KO |
1696 | if (fsck_err_on(bad, c, stripe_sector_count_wrong, |
1697 | "%s", buf.buf)) { | |
326568f1 KO |
1698 | struct bkey_i_stripe *new; |
1699 | ||
1700 | new = bch2_trans_kmalloc(trans, bkey_bytes(k.k)); | |
1701 | ret = PTR_ERR_OR_ZERO(new); | |
1702 | if (ret) | |
1703 | return ret; | |
990d42d1 | 1704 | |
326568f1 | 1705 | bkey_reassemble(&new->k_i, k); |
990d42d1 | 1706 | |
326568f1 KO |
1707 | for (i = 0; i < new->v.nr_blocks; i++) |
1708 | stripe_blockcount_set(&new->v, i, m ? m->block_sectors[i] : 0); | |
990d42d1 | 1709 | |
326568f1 | 1710 | ret = bch2_trans_update(trans, iter, &new->k_i, 0); |
990d42d1 KO |
1711 | } |
1712 | fsck_err: | |
326568f1 KO |
1713 | printbuf_exit(&buf); |
1714 | return ret; | |
1715 | } | |
990d42d1 | 1716 | |
326568f1 KO |
1717 | static int bch2_gc_stripes_done(struct bch_fs *c, bool metadata_only) |
1718 | { | |
326568f1 KO |
1719 | if (metadata_only) |
1720 | return 0; | |
1721 | ||
80eab7a7 KO |
1722 | return bch2_trans_run(c, |
1723 | for_each_btree_key_commit(trans, iter, | |
1724 | BTREE_ID_stripes, POS_MIN, | |
1725 | BTREE_ITER_PREFETCH, k, | |
1726 | NULL, NULL, BCH_TRANS_COMMIT_no_enospc, | |
1727 | bch2_gc_write_stripes_key(trans, &iter, k))); | |
990d42d1 KO |
1728 | } |
1729 | ||
78c8fe20 | 1730 | static void bch2_gc_stripes_reset(struct bch_fs *c, bool metadata_only) |
890b74f0 | 1731 | { |
8f11548e | 1732 | genradix_free(&c->gc_stripes); |
890b74f0 KO |
1733 | } |
1734 | ||
1c6fdbd8 | 1735 | /** |
9ca53b55 KO |
1736 | * bch2_gc - walk _all_ references to buckets, and recompute them: |
1737 | * | |
96dea3d5 KO |
1738 | * @c: filesystem object |
1739 | * @initial: are we in recovery? | |
1740 | * @metadata_only: are we just checking metadata references, or everything? | |
1741 | * | |
1742 | * Returns: 0 on success, or standard errcode on failure | |
1743 | * | |
9ca53b55 KO |
1744 | * Order matters here: |
1745 | * - Concurrent GC relies on the fact that we have a total ordering for | |
1746 | * everything that GC walks - see gc_will_visit_node(), | |
1747 | * gc_will_visit_root() | |
1748 | * | |
1749 | * - also, references move around in the course of index updates and | |
1750 | * various other crap: everything needs to agree on the ordering | |
1751 | * references are allowed to move around in - e.g., we're allowed to | |
1752 | * start with a reference owned by an open_bucket (the allocator) and | |
1753 | * move it to the btree, but not the reverse. | |
1754 | * | |
1755 | * This is necessary to ensure that gc doesn't miss references that | |
1756 | * move around - if references move backwards in the ordering GC | |
1757 | * uses, GC could skip past them | |
1c6fdbd8 | 1758 | */ |
41e37786 | 1759 | int bch2_gc(struct bch_fs *c, bool initial, bool metadata_only) |
1c6fdbd8 | 1760 | { |
f25d8215 | 1761 | unsigned iter = 0; |
2252aa27 | 1762 | int ret; |
1c6fdbd8 | 1763 | |
1ada1606 | 1764 | lockdep_assert_held(&c->state_lock); |
1c6fdbd8 | 1765 | |
1c6fdbd8 | 1766 | down_write(&c->gc_lock); |
00b8ccf7 | 1767 | |
c0960603 | 1768 | bch2_btree_interior_updates_flush(c); |
8f11548e | 1769 | |
14d7d61f | 1770 | ret = bch2_gc_start(c) ?: |
78c8fe20 KO |
1771 | bch2_gc_alloc_start(c, metadata_only) ?: |
1772 | bch2_gc_reflink_start(c, metadata_only); | |
9ca53b55 | 1773 | if (ret) |
1c6fdbd8 | 1774 | goto out; |
8f11548e KO |
1775 | again: |
1776 | gc_pos_set(c, gc_phase(GC_PHASE_START)); | |
1c6fdbd8 | 1777 | |
1c6fdbd8 KO |
1778 | bch2_mark_superblocks(c); |
1779 | ||
41e37786 | 1780 | ret = bch2_gc_btrees(c, initial, metadata_only); |
aae15aaf | 1781 | |
9ca53b55 | 1782 | if (ret) |
2252aa27 | 1783 | goto out; |
1c6fdbd8 | 1784 | |
00b8ccf7 | 1785 | #if 0 |
1c6fdbd8 | 1786 | bch2_mark_pending_btree_node_frees(c); |
00b8ccf7 | 1787 | #endif |
1c6fdbd8 | 1788 | c->gc_count++; |
a0b73c1c | 1789 | |
3c471b65 | 1790 | if (test_bit(BCH_FS_need_another_gc, &c->flags) || |
a0b73c1c | 1791 | (!iter && bch2_test_restart_gc)) { |
8f11548e KO |
1792 | if (iter++ > 2) { |
1793 | bch_info(c, "Unable to fix bucket gens, looping"); | |
1794 | ret = -EINVAL; | |
1795 | goto out; | |
1796 | } | |
1797 | ||
9ca53b55 KO |
1798 | /* |
1799 | * XXX: make sure gens we fixed got saved | |
1800 | */ | |
8f11548e | 1801 | bch_info(c, "Second GC pass needed, restarting:"); |
3c471b65 | 1802 | clear_bit(BCH_FS_need_another_gc, &c->flags); |
8f11548e | 1803 | __gc_pos_set(c, gc_phase(GC_PHASE_NOT_RUNNING)); |
05b3d5ac | 1804 | |
78c8fe20 KO |
1805 | bch2_gc_stripes_reset(c, metadata_only); |
1806 | bch2_gc_alloc_reset(c, metadata_only); | |
1807 | bch2_gc_reflink_reset(c, metadata_only); | |
14d7d61f KO |
1808 | ret = bch2_gc_reset(c); |
1809 | if (ret) | |
1810 | goto out; | |
9ca53b55 | 1811 | |
8f11548e KO |
1812 | /* flush fsck errors, reset counters */ |
1813 | bch2_flush_fsck_errs(c); | |
1814 | goto again; | |
9ca53b55 | 1815 | } |
a0b73c1c | 1816 | out: |
5e82a9a1 KO |
1817 | if (!ret) { |
1818 | bch2_journal_block(&c->journal); | |
05b3d5ac | 1819 | |
78c8fe20 KO |
1820 | ret = bch2_gc_stripes_done(c, metadata_only) ?: |
1821 | bch2_gc_reflink_done(c, metadata_only) ?: | |
1822 | bch2_gc_alloc_done(c, metadata_only) ?: | |
890b74f0 | 1823 | bch2_gc_done(c, initial, metadata_only); |
9ca53b55 | 1824 | |
5e82a9a1 | 1825 | bch2_journal_unblock(&c->journal); |
5e82a9a1 KO |
1826 | } |
1827 | ||
ec061b21 | 1828 | percpu_down_write(&c->mark_lock); |
9ca53b55 | 1829 | /* Indicates that gc is no longer in progress: */ |
dfe9bfb3 | 1830 | __gc_pos_set(c, gc_phase(GC_PHASE_NOT_RUNNING)); |
9ca53b55 KO |
1831 | |
1832 | bch2_gc_free(c); | |
05b3d5ac KO |
1833 | percpu_up_write(&c->mark_lock); |
1834 | ||
1c6fdbd8 | 1835 | up_write(&c->gc_lock); |
9ca53b55 | 1836 | |
1c6fdbd8 KO |
1837 | /* |
1838 | * At startup, allocations can happen directly instead of via the | |
1839 | * allocator thread - issue wakeup in case they blocked on gc_lock: | |
1840 | */ | |
1841 | closure_wake_up(&c->freelist_wait); | |
cf904c8d | 1842 | bch_err_fn(c, ret); |
9ca53b55 | 1843 | return ret; |
1c6fdbd8 KO |
1844 | } |
1845 | ||
a1783320 KO |
1846 | static int gc_btree_gens_key(struct btree_trans *trans, |
1847 | struct btree_iter *iter, | |
1848 | struct bkey_s_c k) | |
c47c50f8 | 1849 | { |
a1783320 | 1850 | struct bch_fs *c = trans->c; |
c47c50f8 | 1851 | struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k); |
a1783320 KO |
1852 | struct bkey_i *u; |
1853 | int ret; | |
c47c50f8 KO |
1854 | |
1855 | percpu_down_read(&c->mark_lock); | |
1856 | bkey_for_each_ptr(ptrs, ptr) { | |
1857 | struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev); | |
c47c50f8 | 1858 | |
c45c8667 | 1859 | if (ptr_stale(ca, ptr) > 16) { |
c47c50f8 | 1860 | percpu_up_read(&c->mark_lock); |
a1783320 | 1861 | goto update; |
c47c50f8 KO |
1862 | } |
1863 | } | |
1864 | ||
1865 | bkey_for_each_ptr(ptrs, ptr) { | |
1866 | struct bch_dev *ca = bch_dev_bkey_exists(c, ptr->dev); | |
c45c8667 | 1867 | u8 *gen = &ca->oldest_gen[PTR_BUCKET_NR(ca, ptr)]; |
c47c50f8 | 1868 | |
c45c8667 KO |
1869 | if (gen_after(*gen, ptr->gen)) |
1870 | *gen = ptr->gen; | |
c47c50f8 KO |
1871 | } |
1872 | percpu_up_read(&c->mark_lock); | |
a1783320 KO |
1873 | return 0; |
1874 | update: | |
0fb3355d | 1875 | u = bch2_bkey_make_mut(trans, iter, &k, 0); |
a1783320 KO |
1876 | ret = PTR_ERR_OR_ZERO(u); |
1877 | if (ret) | |
1878 | return ret; | |
c47c50f8 | 1879 | |
a1783320 | 1880 | bch2_extent_normalize(c, bkey_i_to_s(u)); |
dbda63bb | 1881 | return 0; |
451570a5 KO |
1882 | } |
1883 | ||
a1783320 KO |
1884 | static int bch2_alloc_write_oldest_gen(struct btree_trans *trans, struct btree_iter *iter, |
1885 | struct bkey_s_c k) | |
c45c8667 KO |
1886 | { |
1887 | struct bch_dev *ca = bch_dev_bkey_exists(trans->c, iter->pos.inode); | |
19a614d2 KO |
1888 | struct bch_alloc_v4 a_convert; |
1889 | const struct bch_alloc_v4 *a = bch2_alloc_to_v4(k, &a_convert); | |
3d48a7f8 | 1890 | struct bkey_i_alloc_v4 *a_mut; |
c45c8667 KO |
1891 | int ret; |
1892 | ||
19a614d2 | 1893 | if (a->oldest_gen == ca->oldest_gen[iter->pos.offset]) |
c45c8667 KO |
1894 | return 0; |
1895 | ||
3d48a7f8 KO |
1896 | a_mut = bch2_alloc_to_v4_mut(trans, k); |
1897 | ret = PTR_ERR_OR_ZERO(a_mut); | |
1898 | if (ret) | |
1899 | return ret; | |
1900 | ||
1901 | a_mut->v.oldest_gen = ca->oldest_gen[iter->pos.offset]; | |
822835ff | 1902 | a_mut->v.data_type = alloc_data_type(a_mut->v, a_mut->v.data_type); |
c45c8667 | 1903 | |
3d48a7f8 | 1904 | return bch2_trans_update(trans, iter, &a_mut->k_i, 0); |
c45c8667 KO |
1905 | } |
1906 | ||
451570a5 KO |
1907 | int bch2_gc_gens(struct bch_fs *c) |
1908 | { | |
c45c8667 | 1909 | u64 b, start_time = local_clock(); |
451570a5 KO |
1910 | int ret; |
1911 | ||
b9c3d139 KO |
1912 | /* |
1913 | * Ideally we would be using state_lock and not gc_lock here, but that | |
1914 | * introduces a deadlock in the RO path - we currently take the state | |
1915 | * lock at the start of going RO, thus the gc thread may get stuck: | |
1916 | */ | |
c45c8667 KO |
1917 | if (!mutex_trylock(&c->gc_gens_lock)) |
1918 | return 0; | |
1919 | ||
674cfc26 | 1920 | trace_and_count(c, gc_gens_start, c); |
b9c3d139 | 1921 | down_read(&c->gc_lock); |
451570a5 | 1922 | |
9fea2274 | 1923 | for_each_member_device(c, ca) { |
253ba178 | 1924 | struct bucket_gens *gens = bucket_gens(ca); |
c45c8667 KO |
1925 | |
1926 | BUG_ON(ca->oldest_gen); | |
1927 | ||
253ba178 | 1928 | ca->oldest_gen = kvmalloc(gens->nbuckets, GFP_KERNEL); |
c45c8667 KO |
1929 | if (!ca->oldest_gen) { |
1930 | percpu_ref_put(&ca->ref); | |
65d48e35 | 1931 | ret = -BCH_ERR_ENOMEM_gc_gens; |
c45c8667 KO |
1932 | goto err; |
1933 | } | |
1934 | ||
c45c8667 KO |
1935 | for (b = gens->first_bucket; |
1936 | b < gens->nbuckets; b++) | |
1937 | ca->oldest_gen[b] = gens->b[b]; | |
451570a5 KO |
1938 | } |
1939 | ||
9fea2274 | 1940 | for (unsigned i = 0; i < BTREE_ID_NR; i++) |
2da671dc | 1941 | if (btree_type_has_ptrs(i)) { |
ac516d0e KO |
1942 | c->gc_gens_btree = i; |
1943 | c->gc_gens_pos = POS_MIN; | |
96dea3d5 | 1944 | |
9fea2274 KO |
1945 | ret = bch2_trans_run(c, |
1946 | for_each_btree_key_commit(trans, iter, i, | |
1947 | POS_MIN, | |
1948 | BTREE_ITER_PREFETCH|BTREE_ITER_ALL_SNAPSHOTS, | |
1949 | k, | |
1950 | NULL, NULL, | |
1951 | BCH_TRANS_COMMIT_no_enospc, | |
1952 | gc_btree_gens_key(trans, &iter, k))); | |
5f659376 | 1953 | if (ret) |
451570a5 KO |
1954 | goto err; |
1955 | } | |
1956 | ||
9fea2274 KO |
1957 | ret = bch2_trans_run(c, |
1958 | for_each_btree_key_commit(trans, iter, BTREE_ID_alloc, | |
1959 | POS_MIN, | |
1960 | BTREE_ITER_PREFETCH, | |
1961 | k, | |
1962 | NULL, NULL, | |
1963 | BCH_TRANS_COMMIT_no_enospc, | |
1964 | bch2_alloc_write_oldest_gen(trans, &iter, k))); | |
5f659376 | 1965 | if (ret) |
a1783320 | 1966 | goto err; |
74ed7e56 | 1967 | |
ac516d0e KO |
1968 | c->gc_gens_btree = 0; |
1969 | c->gc_gens_pos = POS_MIN; | |
1970 | ||
74ed7e56 | 1971 | c->gc_count++; |
991ba021 KO |
1972 | |
1973 | bch2_time_stats_update(&c->times[BCH_TIME_btree_gc], start_time); | |
674cfc26 | 1974 | trace_and_count(c, gc_gens_end, c); |
451570a5 | 1975 | err: |
9fea2274 | 1976 | for_each_member_device(c, ca) { |
c45c8667 KO |
1977 | kvfree(ca->oldest_gen); |
1978 | ca->oldest_gen = NULL; | |
1979 | } | |
1980 | ||
b9c3d139 | 1981 | up_read(&c->gc_lock); |
c45c8667 | 1982 | mutex_unlock(&c->gc_gens_lock); |
9fea2274 KO |
1983 | if (!bch2_err_matches(ret, EROFS)) |
1984 | bch_err_fn(c, ret); | |
451570a5 KO |
1985 | return ret; |
1986 | } | |
1987 | ||
1c6fdbd8 KO |
1988 | static int bch2_gc_thread(void *arg) |
1989 | { | |
1990 | struct bch_fs *c = arg; | |
1991 | struct io_clock *clock = &c->io_clock[WRITE]; | |
2abe5420 | 1992 | unsigned long last = atomic64_read(&clock->now); |
1c6fdbd8 KO |
1993 | unsigned last_kick = atomic_read(&c->kick_gc); |
1994 | ||
1995 | set_freezable(); | |
1996 | ||
1997 | while (1) { | |
1998 | while (1) { | |
1999 | set_current_state(TASK_INTERRUPTIBLE); | |
2000 | ||
2001 | if (kthread_should_stop()) { | |
2002 | __set_current_state(TASK_RUNNING); | |
2003 | return 0; | |
2004 | } | |
2005 | ||
2006 | if (atomic_read(&c->kick_gc) != last_kick) | |
2007 | break; | |
2008 | ||
2009 | if (c->btree_gc_periodic) { | |
2010 | unsigned long next = last + c->capacity / 16; | |
2011 | ||
2abe5420 | 2012 | if (atomic64_read(&clock->now) >= next) |
1c6fdbd8 KO |
2013 | break; |
2014 | ||
2015 | bch2_io_clock_schedule_timeout(clock, next); | |
2016 | } else { | |
2017 | schedule(); | |
2018 | } | |
2019 | ||
2020 | try_to_freeze(); | |
2021 | } | |
2022 | __set_current_state(TASK_RUNNING); | |
2023 | ||
2abe5420 | 2024 | last = atomic64_read(&clock->now); |
1c6fdbd8 KO |
2025 | last_kick = atomic_read(&c->kick_gc); |
2026 | ||
451570a5 KO |
2027 | /* |
2028 | * Full gc is currently incompatible with btree key cache: | |
2029 | */ | |
2030 | #if 0 | |
5b593ee1 | 2031 | ret = bch2_gc(c, false, false); |
451570a5 | 2032 | #else |
cf904c8d | 2033 | bch2_gc_gens(c); |
451570a5 | 2034 | #endif |
1c6fdbd8 KO |
2035 | debug_check_no_locks_held(); |
2036 | } | |
2037 | ||
2038 | return 0; | |
2039 | } | |
2040 | ||
2041 | void bch2_gc_thread_stop(struct bch_fs *c) | |
2042 | { | |
2043 | struct task_struct *p; | |
2044 | ||
2045 | p = c->gc_thread; | |
2046 | c->gc_thread = NULL; | |
2047 | ||
2048 | if (p) { | |
2049 | kthread_stop(p); | |
2050 | put_task_struct(p); | |
2051 | } | |
2052 | } | |
2053 | ||
2054 | int bch2_gc_thread_start(struct bch_fs *c) | |
2055 | { | |
2056 | struct task_struct *p; | |
2057 | ||
a4805d66 KO |
2058 | if (c->gc_thread) |
2059 | return 0; | |
1c6fdbd8 | 2060 | |
b7a9bbfc | 2061 | p = kthread_create(bch2_gc_thread, c, "bch-gc/%s", c->name); |
dab9ef0d | 2062 | if (IS_ERR(p)) { |
e46c181a | 2063 | bch_err_fn(c, PTR_ERR(p)); |
1c6fdbd8 | 2064 | return PTR_ERR(p); |
dab9ef0d | 2065 | } |
1c6fdbd8 KO |
2066 | |
2067 | get_task_struct(p); | |
2068 | c->gc_thread = p; | |
2069 | wake_up_process(p); | |
2070 | return 0; | |
2071 | } |