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