1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _BCACHEFS_BTREE_ITER_H
3 #define _BCACHEFS_BTREE_ITER_H
4
5 #include "bset.h"
6 #include "btree_types.h"
7 #include "trace.h"
8
9 void bch2_trans_updates_to_text(struct printbuf *, struct btree_trans *);
10 void bch2_btree_path_to_text(struct printbuf *, struct btree_trans *, btree_path_idx_t);
11 void bch2_trans_paths_to_text(struct printbuf *, struct btree_trans *);
12 void bch2_dump_trans_updates(struct btree_trans *);
13 void bch2_dump_trans_paths_updates(struct btree_trans *);
14
__bkey_err(const struct bkey * k)15 static inline int __bkey_err(const struct bkey *k)
16 {
17 return PTR_ERR_OR_ZERO(k);
18 }
19
20 #define bkey_err(_k) __bkey_err((_k).k)
21
__btree_path_get(struct btree_trans * trans,struct btree_path * path,bool intent)22 static inline void __btree_path_get(struct btree_trans *trans, struct btree_path *path, bool intent)
23 {
24 unsigned idx = path - trans->paths;
25
26 EBUG_ON(idx >= trans->nr_paths);
27 EBUG_ON(!test_bit(idx, trans->paths_allocated));
28 if (unlikely(path->ref == U8_MAX)) {
29 bch2_dump_trans_paths_updates(trans);
30 panic("path %u refcount overflow\n", idx);
31 }
32
33 path->ref++;
34 path->intent_ref += intent;
35 trace_btree_path_get_ll(trans, path);
36 }
37
__btree_path_put(struct btree_trans * trans,struct btree_path * path,bool intent)38 static inline bool __btree_path_put(struct btree_trans *trans, struct btree_path *path, bool intent)
39 {
40 EBUG_ON(path - trans->paths >= trans->nr_paths);
41 EBUG_ON(!test_bit(path - trans->paths, trans->paths_allocated));
42 EBUG_ON(!path->ref);
43 EBUG_ON(!path->intent_ref && intent);
44
45 trace_btree_path_put_ll(trans, path);
46 path->intent_ref -= intent;
47 return --path->ref == 0;
48 }
49
btree_path_set_dirty(struct btree_path * path,enum btree_path_uptodate u)50 static inline void btree_path_set_dirty(struct btree_path *path,
51 enum btree_path_uptodate u)
52 {
53 path->uptodate = max_t(unsigned, path->uptodate, u);
54 }
55
btree_path_node(struct btree_path * path,unsigned level)56 static inline struct btree *btree_path_node(struct btree_path *path,
57 unsigned level)
58 {
59 return level < BTREE_MAX_DEPTH ? path->l[level].b : NULL;
60 }
61
btree_node_lock_seq_matches(const struct btree_path * path,const struct btree * b,unsigned level)62 static inline bool btree_node_lock_seq_matches(const struct btree_path *path,
63 const struct btree *b, unsigned level)
64 {
65 return path->l[level].lock_seq == six_lock_seq(&b->c.lock);
66 }
67
btree_node_parent(struct btree_path * path,struct btree * b)68 static inline struct btree *btree_node_parent(struct btree_path *path,
69 struct btree *b)
70 {
71 return btree_path_node(path, b->c.level + 1);
72 }
73
74 /* Iterate over paths within a transaction: */
75
76 void __bch2_btree_trans_sort_paths(struct btree_trans *);
77
btree_trans_sort_paths(struct btree_trans * trans)78 static inline void btree_trans_sort_paths(struct btree_trans *trans)
79 {
80 if (!IS_ENABLED(CONFIG_BCACHEFS_DEBUG) &&
81 trans->paths_sorted)
82 return;
83 __bch2_btree_trans_sort_paths(trans);
84 }
85
trans_paths_nr(struct btree_path * paths)86 static inline unsigned long *trans_paths_nr(struct btree_path *paths)
87 {
88 return &container_of(paths, struct btree_trans_paths, paths[0])->nr_paths;
89 }
90
trans_paths_allocated(struct btree_path * paths)91 static inline unsigned long *trans_paths_allocated(struct btree_path *paths)
92 {
93 unsigned long *v = trans_paths_nr(paths);
94 return v - BITS_TO_LONGS(*v);
95 }
96
97 #define trans_for_each_path_idx_from(_paths_allocated, _nr, _idx, _start)\
98 for (_idx = _start; \
99 (_idx = find_next_bit(_paths_allocated, _nr, _idx)) < _nr; \
100 _idx++)
101
102 static inline struct btree_path *
__trans_next_path(struct btree_trans * trans,unsigned * idx)103 __trans_next_path(struct btree_trans *trans, unsigned *idx)
104 {
105 unsigned long *w = trans->paths_allocated + *idx / BITS_PER_LONG;
106 /*
107 * Open coded find_next_bit(), because
108 * - this is fast path, we can't afford the function call
109 * - and we know that nr_paths is a multiple of BITS_PER_LONG,
110 */
111 while (*idx < trans->nr_paths) {
112 unsigned long v = *w >> (*idx & (BITS_PER_LONG - 1));
113 if (v) {
114 *idx += __ffs(v);
115 return trans->paths + *idx;
116 }
117
118 *idx += BITS_PER_LONG;
119 *idx &= ~(BITS_PER_LONG - 1);
120 w++;
121 }
122
123 return NULL;
124 }
125
126 /*
127 * This version is intended to be safe for use on a btree_trans that is owned by
128 * another thread, for bch2_btree_trans_to_text();
129 */
130 #define trans_for_each_path_from(_trans, _path, _idx, _start) \
131 for (_idx = _start; \
132 (_path = __trans_next_path((_trans), &_idx)); \
133 _idx++)
134
135 #define trans_for_each_path(_trans, _path, _idx) \
136 trans_for_each_path_from(_trans, _path, _idx, 1)
137
next_btree_path(struct btree_trans * trans,struct btree_path * path)138 static inline struct btree_path *next_btree_path(struct btree_trans *trans, struct btree_path *path)
139 {
140 unsigned idx = path ? path->sorted_idx + 1 : 0;
141
142 EBUG_ON(idx > trans->nr_sorted);
143
144 return idx < trans->nr_sorted
145 ? trans->paths + trans->sorted[idx]
146 : NULL;
147 }
148
prev_btree_path(struct btree_trans * trans,struct btree_path * path)149 static inline struct btree_path *prev_btree_path(struct btree_trans *trans, struct btree_path *path)
150 {
151 unsigned idx = path ? path->sorted_idx : trans->nr_sorted;
152
153 return idx
154 ? trans->paths + trans->sorted[idx - 1]
155 : NULL;
156 }
157
158 #define trans_for_each_path_idx_inorder(_trans, _iter) \
159 for (_iter = (struct trans_for_each_path_inorder_iter) { 0 }; \
160 (_iter.path_idx = trans->sorted[_iter.sorted_idx], \
161 _iter.sorted_idx < (_trans)->nr_sorted); \
162 _iter.sorted_idx++)
163
164 struct trans_for_each_path_inorder_iter {
165 btree_path_idx_t sorted_idx;
166 btree_path_idx_t path_idx;
167 };
168
169 #define trans_for_each_path_inorder(_trans, _path, _iter) \
170 for (_iter = (struct trans_for_each_path_inorder_iter) { 0 }; \
171 (_iter.path_idx = trans->sorted[_iter.sorted_idx], \
172 _path = (_trans)->paths + _iter.path_idx, \
173 _iter.sorted_idx < (_trans)->nr_sorted); \
174 _iter.sorted_idx++)
175
176 #define trans_for_each_path_inorder_reverse(_trans, _path, _i) \
177 for (_i = trans->nr_sorted - 1; \
178 ((_path) = (_trans)->paths + trans->sorted[_i]), (_i) >= 0;\
179 --_i)
180
__path_has_node(const struct btree_path * path,const struct btree * b)181 static inline bool __path_has_node(const struct btree_path *path,
182 const struct btree *b)
183 {
184 return path->l[b->c.level].b == b &&
185 btree_node_lock_seq_matches(path, b, b->c.level);
186 }
187
188 static inline struct btree_path *
__trans_next_path_with_node(struct btree_trans * trans,struct btree * b,unsigned * idx)189 __trans_next_path_with_node(struct btree_trans *trans, struct btree *b,
190 unsigned *idx)
191 {
192 struct btree_path *path;
193
194 while ((path = __trans_next_path(trans, idx)) &&
195 !__path_has_node(path, b))
196 (*idx)++;
197
198 return path;
199 }
200
201 #define trans_for_each_path_with_node(_trans, _b, _path, _iter) \
202 for (_iter = 1; \
203 (_path = __trans_next_path_with_node((_trans), (_b), &_iter));\
204 _iter++)
205
206 btree_path_idx_t __bch2_btree_path_make_mut(struct btree_trans *, btree_path_idx_t,
207 bool, unsigned long);
208
209 static inline btree_path_idx_t __must_check
bch2_btree_path_make_mut(struct btree_trans * trans,btree_path_idx_t path,bool intent,unsigned long ip)210 bch2_btree_path_make_mut(struct btree_trans *trans,
211 btree_path_idx_t path, bool intent,
212 unsigned long ip)
213 {
214 if (trans->paths[path].ref > 1 ||
215 trans->paths[path].preserve)
216 path = __bch2_btree_path_make_mut(trans, path, intent, ip);
217 trans->paths[path].should_be_locked = false;
218 return path;
219 }
220
221 btree_path_idx_t __must_check
222 __bch2_btree_path_set_pos(struct btree_trans *, btree_path_idx_t,
223 struct bpos, bool, unsigned long);
224
225 static inline btree_path_idx_t __must_check
bch2_btree_path_set_pos(struct btree_trans * trans,btree_path_idx_t path,struct bpos new_pos,bool intent,unsigned long ip)226 bch2_btree_path_set_pos(struct btree_trans *trans,
227 btree_path_idx_t path, struct bpos new_pos,
228 bool intent, unsigned long ip)
229 {
230 return !bpos_eq(new_pos, trans->paths[path].pos)
231 ? __bch2_btree_path_set_pos(trans, path, new_pos, intent, ip)
232 : path;
233 }
234
235 int __must_check bch2_btree_path_traverse_one(struct btree_trans *,
236 btree_path_idx_t,
237 unsigned, unsigned long);
238
239 static inline void bch2_trans_verify_not_unlocked_or_in_restart(struct btree_trans *);
240
bch2_btree_path_traverse(struct btree_trans * trans,btree_path_idx_t path,unsigned flags)241 static inline int __must_check bch2_btree_path_traverse(struct btree_trans *trans,
242 btree_path_idx_t path, unsigned flags)
243 {
244 bch2_trans_verify_not_unlocked_or_in_restart(trans);
245
246 if (trans->paths[path].uptodate < BTREE_ITER_NEED_RELOCK)
247 return 0;
248
249 return bch2_btree_path_traverse_one(trans, path, flags, _RET_IP_);
250 }
251
252 btree_path_idx_t bch2_path_get(struct btree_trans *, enum btree_id, struct bpos,
253 unsigned, unsigned, unsigned, unsigned long);
254 btree_path_idx_t bch2_path_get_unlocked_mut(struct btree_trans *, enum btree_id,
255 unsigned, struct bpos);
256
257 struct bkey_s_c bch2_btree_path_peek_slot(struct btree_path *, struct bkey *);
258
259 /*
260 * bch2_btree_path_peek_slot() for a cached iterator might return a key in a
261 * different snapshot:
262 */
bch2_btree_path_peek_slot_exact(struct btree_path * path,struct bkey * u)263 static inline struct bkey_s_c bch2_btree_path_peek_slot_exact(struct btree_path *path, struct bkey *u)
264 {
265 struct bkey_s_c k = bch2_btree_path_peek_slot(path, u);
266
267 if (k.k && bpos_eq(path->pos, k.k->p))
268 return k;
269
270 bkey_init(u);
271 u->p = path->pos;
272 return (struct bkey_s_c) { u, NULL };
273 }
274
275 struct bkey_i *bch2_btree_journal_peek_slot(struct btree_trans *,
276 struct btree_iter *, struct bpos);
277
278 void bch2_btree_path_level_init(struct btree_trans *, struct btree_path *, struct btree *);
279
280 int __bch2_trans_mutex_lock(struct btree_trans *, struct mutex *);
281
bch2_trans_mutex_lock(struct btree_trans * trans,struct mutex * lock)282 static inline int bch2_trans_mutex_lock(struct btree_trans *trans, struct mutex *lock)
283 {
284 return mutex_trylock(lock)
285 ? 0
286 : __bch2_trans_mutex_lock(trans, lock);
287 }
288
289 #ifdef CONFIG_BCACHEFS_DEBUG
290 void bch2_trans_verify_paths(struct btree_trans *);
291 void bch2_assert_pos_locked(struct btree_trans *, enum btree_id, struct bpos);
292 #else
bch2_trans_verify_paths(struct btree_trans * trans)293 static inline void bch2_trans_verify_paths(struct btree_trans *trans) {}
bch2_assert_pos_locked(struct btree_trans * trans,enum btree_id id,struct bpos pos)294 static inline void bch2_assert_pos_locked(struct btree_trans *trans, enum btree_id id,
295 struct bpos pos) {}
296 #endif
297
298 void bch2_btree_path_fix_key_modified(struct btree_trans *trans,
299 struct btree *, struct bkey_packed *);
300 void bch2_btree_node_iter_fix(struct btree_trans *trans, struct btree_path *,
301 struct btree *, struct btree_node_iter *,
302 struct bkey_packed *, unsigned, unsigned);
303
304 int bch2_btree_path_relock_intent(struct btree_trans *, struct btree_path *);
305
306 void bch2_path_put(struct btree_trans *, btree_path_idx_t, bool);
307
308 int bch2_trans_relock(struct btree_trans *);
309 int bch2_trans_relock_notrace(struct btree_trans *);
310 void bch2_trans_unlock(struct btree_trans *);
311 void bch2_trans_unlock_long(struct btree_trans *);
312
trans_was_restarted(struct btree_trans * trans,u32 restart_count)313 static inline int trans_was_restarted(struct btree_trans *trans, u32 restart_count)
314 {
315 return restart_count != trans->restart_count
316 ? -BCH_ERR_transaction_restart_nested
317 : 0;
318 }
319
320 void __noreturn bch2_trans_restart_error(struct btree_trans *, u32);
321
bch2_trans_verify_not_restarted(struct btree_trans * trans,u32 restart_count)322 static inline void bch2_trans_verify_not_restarted(struct btree_trans *trans,
323 u32 restart_count)
324 {
325 if (trans_was_restarted(trans, restart_count))
326 bch2_trans_restart_error(trans, restart_count);
327 }
328
329 void __noreturn bch2_trans_unlocked_or_in_restart_error(struct btree_trans *);
330
bch2_trans_verify_not_unlocked_or_in_restart(struct btree_trans * trans)331 static inline void bch2_trans_verify_not_unlocked_or_in_restart(struct btree_trans *trans)
332 {
333 if (trans->restarted || !trans->locked)
334 bch2_trans_unlocked_or_in_restart_error(trans);
335 }
336
337 __always_inline
btree_trans_restart_foreign_task(struct btree_trans * trans,int err,unsigned long ip)338 static int btree_trans_restart_foreign_task(struct btree_trans *trans, int err, unsigned long ip)
339 {
340 BUG_ON(err <= 0);
341 BUG_ON(!bch2_err_matches(-err, BCH_ERR_transaction_restart));
342
343 trans->restarted = err;
344 trans->last_restarted_ip = ip;
345 return -err;
346 }
347
348 __always_inline
btree_trans_restart_ip(struct btree_trans * trans,int err,unsigned long ip)349 static int btree_trans_restart_ip(struct btree_trans *trans, int err, unsigned long ip)
350 {
351 btree_trans_restart_foreign_task(trans, err, ip);
352 #ifdef CONFIG_BCACHEFS_DEBUG
353 darray_exit(&trans->last_restarted_trace);
354 bch2_save_backtrace(&trans->last_restarted_trace, current, 0, GFP_NOWAIT);
355 #endif
356 return -err;
357 }
358
359 __always_inline
btree_trans_restart(struct btree_trans * trans,int err)360 static int btree_trans_restart(struct btree_trans *trans, int err)
361 {
362 return btree_trans_restart_ip(trans, err, _THIS_IP_);
363 }
364
trans_maybe_inject_restart(struct btree_trans * trans,unsigned long ip)365 static inline int trans_maybe_inject_restart(struct btree_trans *trans, unsigned long ip)
366 {
367 #ifdef CONFIG_BCACHEFS_INJECT_TRANSACTION_RESTARTS
368 if (!(ktime_get_ns() & ~(~0ULL << min(63, (10 + trans->restart_count_this_trans))))) {
369 trace_and_count(trans->c, trans_restart_injected, trans, ip);
370 return btree_trans_restart_ip(trans,
371 BCH_ERR_transaction_restart_fault_inject, ip);
372 }
373 #endif
374 return 0;
375 }
376
377 bool bch2_btree_node_upgrade(struct btree_trans *,
378 struct btree_path *, unsigned);
379
380 void __bch2_btree_path_downgrade(struct btree_trans *, struct btree_path *, unsigned);
381
bch2_btree_path_downgrade(struct btree_trans * trans,struct btree_path * path)382 static inline void bch2_btree_path_downgrade(struct btree_trans *trans,
383 struct btree_path *path)
384 {
385 unsigned new_locks_want = path->level + !!path->intent_ref;
386
387 if (path->locks_want > new_locks_want)
388 __bch2_btree_path_downgrade(trans, path, new_locks_want);
389 }
390
391 void bch2_trans_downgrade(struct btree_trans *);
392
393 void bch2_trans_node_add(struct btree_trans *trans, struct btree_path *, struct btree *);
394 void bch2_trans_node_drop(struct btree_trans *trans, struct btree *);
395 void bch2_trans_node_reinit_iter(struct btree_trans *, struct btree *);
396
397 int __must_check __bch2_btree_iter_traverse(struct btree_iter *iter);
398 int __must_check bch2_btree_iter_traverse(struct btree_iter *);
399
400 struct btree *bch2_btree_iter_peek_node(struct btree_iter *);
401 struct btree *bch2_btree_iter_peek_node_and_restart(struct btree_iter *);
402 struct btree *bch2_btree_iter_next_node(struct btree_iter *);
403
404 struct bkey_s_c bch2_btree_iter_peek_max(struct btree_iter *, struct bpos);
405 struct bkey_s_c bch2_btree_iter_next(struct btree_iter *);
406
bch2_btree_iter_peek(struct btree_iter * iter)407 static inline struct bkey_s_c bch2_btree_iter_peek(struct btree_iter *iter)
408 {
409 return bch2_btree_iter_peek_max(iter, SPOS_MAX);
410 }
411
412 struct bkey_s_c bch2_btree_iter_peek_prev_min(struct btree_iter *, struct bpos);
413
bch2_btree_iter_peek_prev(struct btree_iter * iter)414 static inline struct bkey_s_c bch2_btree_iter_peek_prev(struct btree_iter *iter)
415 {
416 return bch2_btree_iter_peek_prev_min(iter, POS_MIN);
417 }
418
419 struct bkey_s_c bch2_btree_iter_prev(struct btree_iter *);
420
421 struct bkey_s_c bch2_btree_iter_peek_slot(struct btree_iter *);
422 struct bkey_s_c bch2_btree_iter_next_slot(struct btree_iter *);
423 struct bkey_s_c bch2_btree_iter_prev_slot(struct btree_iter *);
424
425 bool bch2_btree_iter_advance(struct btree_iter *);
426 bool bch2_btree_iter_rewind(struct btree_iter *);
427
__bch2_btree_iter_set_pos(struct btree_iter * iter,struct bpos new_pos)428 static inline void __bch2_btree_iter_set_pos(struct btree_iter *iter, struct bpos new_pos)
429 {
430 iter->k.type = KEY_TYPE_deleted;
431 iter->k.p.inode = iter->pos.inode = new_pos.inode;
432 iter->k.p.offset = iter->pos.offset = new_pos.offset;
433 iter->k.p.snapshot = iter->pos.snapshot = new_pos.snapshot;
434 iter->k.size = 0;
435 }
436
bch2_btree_iter_set_pos(struct btree_iter * iter,struct bpos new_pos)437 static inline void bch2_btree_iter_set_pos(struct btree_iter *iter, struct bpos new_pos)
438 {
439 struct btree_trans *trans = iter->trans;
440
441 if (unlikely(iter->update_path))
442 bch2_path_put(trans, iter->update_path,
443 iter->flags & BTREE_ITER_intent);
444 iter->update_path = 0;
445
446 if (!(iter->flags & BTREE_ITER_all_snapshots))
447 new_pos.snapshot = iter->snapshot;
448
449 __bch2_btree_iter_set_pos(iter, new_pos);
450 }
451
bch2_btree_iter_set_pos_to_extent_start(struct btree_iter * iter)452 static inline void bch2_btree_iter_set_pos_to_extent_start(struct btree_iter *iter)
453 {
454 BUG_ON(!(iter->flags & BTREE_ITER_is_extents));
455 iter->pos = bkey_start_pos(&iter->k);
456 }
457
bch2_btree_iter_set_snapshot(struct btree_iter * iter,u32 snapshot)458 static inline void bch2_btree_iter_set_snapshot(struct btree_iter *iter, u32 snapshot)
459 {
460 struct bpos pos = iter->pos;
461
462 iter->snapshot = snapshot;
463 pos.snapshot = snapshot;
464 bch2_btree_iter_set_pos(iter, pos);
465 }
466
467 void bch2_trans_iter_exit(struct btree_trans *, struct btree_iter *);
468
bch2_btree_iter_flags(struct btree_trans * trans,unsigned btree_id,unsigned level,unsigned flags)469 static inline unsigned bch2_btree_iter_flags(struct btree_trans *trans,
470 unsigned btree_id,
471 unsigned level,
472 unsigned flags)
473 {
474 if (level || !btree_id_cached(trans->c, btree_id)) {
475 flags &= ~BTREE_ITER_cached;
476 flags &= ~BTREE_ITER_with_key_cache;
477 } else if (!(flags & BTREE_ITER_cached))
478 flags |= BTREE_ITER_with_key_cache;
479
480 if (!(flags & (BTREE_ITER_all_snapshots|BTREE_ITER_not_extents)) &&
481 btree_id_is_extents(btree_id))
482 flags |= BTREE_ITER_is_extents;
483
484 if (!(flags & BTREE_ITER_snapshot_field) &&
485 !btree_type_has_snapshot_field(btree_id))
486 flags &= ~BTREE_ITER_all_snapshots;
487
488 if (!(flags & BTREE_ITER_all_snapshots) &&
489 btree_type_has_snapshots(btree_id))
490 flags |= BTREE_ITER_filter_snapshots;
491
492 if (trans->journal_replay_not_finished)
493 flags |= BTREE_ITER_with_journal;
494
495 return flags;
496 }
497
bch2_trans_iter_init_common(struct btree_trans * trans,struct btree_iter * iter,unsigned btree_id,struct bpos pos,unsigned locks_want,unsigned depth,unsigned flags,unsigned long ip)498 static inline void bch2_trans_iter_init_common(struct btree_trans *trans,
499 struct btree_iter *iter,
500 unsigned btree_id, struct bpos pos,
501 unsigned locks_want,
502 unsigned depth,
503 unsigned flags,
504 unsigned long ip)
505 {
506 iter->trans = trans;
507 iter->update_path = 0;
508 iter->key_cache_path = 0;
509 iter->btree_id = btree_id;
510 iter->min_depth = 0;
511 iter->flags = flags;
512 iter->snapshot = pos.snapshot;
513 iter->pos = pos;
514 iter->k = POS_KEY(pos);
515 iter->journal_idx = 0;
516 #ifdef CONFIG_BCACHEFS_DEBUG
517 iter->ip_allocated = ip;
518 #endif
519 iter->path = bch2_path_get(trans, btree_id, iter->pos,
520 locks_want, depth, flags, ip);
521 }
522
523 void bch2_trans_iter_init_outlined(struct btree_trans *, struct btree_iter *,
524 enum btree_id, struct bpos, unsigned);
525
bch2_trans_iter_init(struct btree_trans * trans,struct btree_iter * iter,unsigned btree_id,struct bpos pos,unsigned flags)526 static inline void bch2_trans_iter_init(struct btree_trans *trans,
527 struct btree_iter *iter,
528 unsigned btree_id, struct bpos pos,
529 unsigned flags)
530 {
531 if (__builtin_constant_p(btree_id) &&
532 __builtin_constant_p(flags))
533 bch2_trans_iter_init_common(trans, iter, btree_id, pos, 0, 0,
534 bch2_btree_iter_flags(trans, btree_id, 0, flags),
535 _THIS_IP_);
536 else
537 bch2_trans_iter_init_outlined(trans, iter, btree_id, pos, flags);
538 }
539
540 void bch2_trans_node_iter_init(struct btree_trans *, struct btree_iter *,
541 enum btree_id, struct bpos,
542 unsigned, unsigned, unsigned);
543 void bch2_trans_copy_iter(struct btree_iter *, struct btree_iter *);
544
545 void bch2_set_btree_iter_dontneed(struct btree_iter *);
546
547 void *__bch2_trans_kmalloc(struct btree_trans *, size_t);
548
549 /**
550 * bch2_trans_kmalloc - allocate memory for use by the current transaction
551 *
552 * Must be called after bch2_trans_begin, which on second and further calls
553 * frees all memory allocated in this transaction
554 */
bch2_trans_kmalloc(struct btree_trans * trans,size_t size)555 static inline void *bch2_trans_kmalloc(struct btree_trans *trans, size_t size)
556 {
557 size = roundup(size, 8);
558
559 if (likely(trans->mem_top + size <= trans->mem_bytes)) {
560 void *p = trans->mem + trans->mem_top;
561
562 trans->mem_top += size;
563 memset(p, 0, size);
564 return p;
565 } else {
566 return __bch2_trans_kmalloc(trans, size);
567 }
568 }
569
bch2_trans_kmalloc_nomemzero(struct btree_trans * trans,size_t size)570 static inline void *bch2_trans_kmalloc_nomemzero(struct btree_trans *trans, size_t size)
571 {
572 size = round_up(size, 8);
573
574 if (likely(trans->mem_top + size <= trans->mem_bytes)) {
575 void *p = trans->mem + trans->mem_top;
576
577 trans->mem_top += size;
578 return p;
579 } else {
580 return __bch2_trans_kmalloc(trans, size);
581 }
582 }
583
__bch2_bkey_get_iter(struct btree_trans * trans,struct btree_iter * iter,unsigned btree_id,struct bpos pos,unsigned flags,unsigned type)584 static inline struct bkey_s_c __bch2_bkey_get_iter(struct btree_trans *trans,
585 struct btree_iter *iter,
586 unsigned btree_id, struct bpos pos,
587 unsigned flags, unsigned type)
588 {
589 struct bkey_s_c k;
590
591 bch2_trans_iter_init(trans, iter, btree_id, pos, flags);
592 k = bch2_btree_iter_peek_slot(iter);
593
594 if (!bkey_err(k) && type && k.k->type != type)
595 k = bkey_s_c_err(-BCH_ERR_ENOENT_bkey_type_mismatch);
596 if (unlikely(bkey_err(k)))
597 bch2_trans_iter_exit(trans, iter);
598 return k;
599 }
600
bch2_bkey_get_iter(struct btree_trans * trans,struct btree_iter * iter,unsigned btree_id,struct bpos pos,unsigned flags)601 static inline struct bkey_s_c bch2_bkey_get_iter(struct btree_trans *trans,
602 struct btree_iter *iter,
603 unsigned btree_id, struct bpos pos,
604 unsigned flags)
605 {
606 return __bch2_bkey_get_iter(trans, iter, btree_id, pos, flags, 0);
607 }
608
609 #define bch2_bkey_get_iter_typed(_trans, _iter, _btree_id, _pos, _flags, _type)\
610 bkey_s_c_to_##_type(__bch2_bkey_get_iter(_trans, _iter, \
611 _btree_id, _pos, _flags, KEY_TYPE_##_type))
612
__bkey_val_copy(void * dst_v,unsigned dst_size,struct bkey_s_c src_k)613 static inline void __bkey_val_copy(void *dst_v, unsigned dst_size, struct bkey_s_c src_k)
614 {
615 unsigned b = min_t(unsigned, dst_size, bkey_val_bytes(src_k.k));
616 memcpy(dst_v, src_k.v, b);
617 if (unlikely(b < dst_size))
618 memset(dst_v + b, 0, dst_size - b);
619 }
620
621 #define bkey_val_copy(_dst_v, _src_k) \
622 do { \
623 BUILD_BUG_ON(!__typecheck(*_dst_v, *_src_k.v)); \
624 __bkey_val_copy(_dst_v, sizeof(*_dst_v), _src_k.s_c); \
625 } while (0)
626
__bch2_bkey_get_val_typed(struct btree_trans * trans,unsigned btree_id,struct bpos pos,unsigned flags,unsigned type,unsigned val_size,void * val)627 static inline int __bch2_bkey_get_val_typed(struct btree_trans *trans,
628 unsigned btree_id, struct bpos pos,
629 unsigned flags, unsigned type,
630 unsigned val_size, void *val)
631 {
632 struct btree_iter iter;
633 struct bkey_s_c k = __bch2_bkey_get_iter(trans, &iter, btree_id, pos, flags, type);
634 int ret = bkey_err(k);
635 if (!ret) {
636 __bkey_val_copy(val, val_size, k);
637 bch2_trans_iter_exit(trans, &iter);
638 }
639
640 return ret;
641 }
642
643 #define bch2_bkey_get_val_typed(_trans, _btree_id, _pos, _flags, _type, _val)\
644 __bch2_bkey_get_val_typed(_trans, _btree_id, _pos, _flags, \
645 KEY_TYPE_##_type, sizeof(*_val), _val)
646
647 void bch2_trans_srcu_unlock(struct btree_trans *);
648
649 u32 bch2_trans_begin(struct btree_trans *);
650
651 #define __for_each_btree_node(_trans, _iter, _btree_id, _start, \
652 _locks_want, _depth, _flags, _b, _do) \
653 ({ \
654 bch2_trans_begin((_trans)); \
655 \
656 struct btree_iter _iter; \
657 bch2_trans_node_iter_init((_trans), &_iter, (_btree_id), \
658 _start, _locks_want, _depth, _flags); \
659 int _ret3 = 0; \
660 do { \
661 _ret3 = lockrestart_do((_trans), ({ \
662 struct btree *_b = bch2_btree_iter_peek_node(&_iter); \
663 if (!_b) \
664 break; \
665 \
666 PTR_ERR_OR_ZERO(_b) ?: (_do); \
667 })) ?: \
668 lockrestart_do((_trans), \
669 PTR_ERR_OR_ZERO(bch2_btree_iter_next_node(&_iter))); \
670 } while (!_ret3); \
671 \
672 bch2_trans_iter_exit((_trans), &(_iter)); \
673 _ret3; \
674 })
675
676 #define for_each_btree_node(_trans, _iter, _btree_id, _start, \
677 _flags, _b, _do) \
678 __for_each_btree_node(_trans, _iter, _btree_id, _start, \
679 0, 0, _flags, _b, _do)
680
bch2_btree_iter_peek_prev_type(struct btree_iter * iter,unsigned flags)681 static inline struct bkey_s_c bch2_btree_iter_peek_prev_type(struct btree_iter *iter,
682 unsigned flags)
683 {
684 return flags & BTREE_ITER_slots ? bch2_btree_iter_peek_slot(iter) :
685 bch2_btree_iter_peek_prev(iter);
686 }
687
bch2_btree_iter_peek_type(struct btree_iter * iter,unsigned flags)688 static inline struct bkey_s_c bch2_btree_iter_peek_type(struct btree_iter *iter,
689 unsigned flags)
690 {
691 return flags & BTREE_ITER_slots ? bch2_btree_iter_peek_slot(iter) :
692 bch2_btree_iter_peek(iter);
693 }
694
bch2_btree_iter_peek_max_type(struct btree_iter * iter,struct bpos end,unsigned flags)695 static inline struct bkey_s_c bch2_btree_iter_peek_max_type(struct btree_iter *iter,
696 struct bpos end,
697 unsigned flags)
698 {
699 if (!(flags & BTREE_ITER_slots))
700 return bch2_btree_iter_peek_max(iter, end);
701
702 if (bkey_gt(iter->pos, end))
703 return bkey_s_c_null;
704
705 return bch2_btree_iter_peek_slot(iter);
706 }
707
708 int __bch2_btree_trans_too_many_iters(struct btree_trans *);
709
btree_trans_too_many_iters(struct btree_trans * trans)710 static inline int btree_trans_too_many_iters(struct btree_trans *trans)
711 {
712 if (bitmap_weight(trans->paths_allocated, trans->nr_paths) > BTREE_ITER_NORMAL_LIMIT - 8)
713 return __bch2_btree_trans_too_many_iters(trans);
714
715 return 0;
716 }
717
718 /*
719 * goto instead of loop, so that when used inside for_each_btree_key2()
720 * break/continue work correctly
721 */
722 #define lockrestart_do(_trans, _do) \
723 ({ \
724 __label__ transaction_restart; \
725 u32 _restart_count; \
726 int _ret2; \
727 transaction_restart: \
728 _restart_count = bch2_trans_begin(_trans); \
729 _ret2 = (_do); \
730 \
731 if (bch2_err_matches(_ret2, BCH_ERR_transaction_restart)) \
732 goto transaction_restart; \
733 \
734 if (!_ret2) \
735 bch2_trans_verify_not_restarted(_trans, _restart_count);\
736 _ret2; \
737 })
738
739 /*
740 * nested_lockrestart_do(), nested_commit_do():
741 *
742 * These are like lockrestart_do() and commit_do(), with two differences:
743 *
744 * - We don't call bch2_trans_begin() unless we had a transaction restart
745 * - We return -BCH_ERR_transaction_restart_nested if we succeeded after a
746 * transaction restart
747 */
748 #define nested_lockrestart_do(_trans, _do) \
749 ({ \
750 u32 _restart_count, _orig_restart_count; \
751 int _ret2; \
752 \
753 _restart_count = _orig_restart_count = (_trans)->restart_count; \
754 \
755 while (bch2_err_matches(_ret2 = (_do), BCH_ERR_transaction_restart))\
756 _restart_count = bch2_trans_begin(_trans); \
757 \
758 if (!_ret2) \
759 bch2_trans_verify_not_restarted(_trans, _restart_count);\
760 \
761 _ret2 ?: trans_was_restarted(_trans, _orig_restart_count); \
762 })
763
764 #define for_each_btree_key_max_continue(_trans, _iter, \
765 _end, _flags, _k, _do) \
766 ({ \
767 struct bkey_s_c _k; \
768 int _ret3 = 0; \
769 \
770 do { \
771 _ret3 = lockrestart_do(_trans, ({ \
772 (_k) = bch2_btree_iter_peek_max_type(&(_iter), \
773 _end, (_flags)); \
774 if (!(_k).k) \
775 break; \
776 \
777 bkey_err(_k) ?: (_do); \
778 })); \
779 } while (!_ret3 && bch2_btree_iter_advance(&(_iter))); \
780 \
781 bch2_trans_iter_exit((_trans), &(_iter)); \
782 _ret3; \
783 })
784
785 #define for_each_btree_key_continue(_trans, _iter, _flags, _k, _do) \
786 for_each_btree_key_max_continue(_trans, _iter, SPOS_MAX, _flags, _k, _do)
787
788 #define for_each_btree_key_max(_trans, _iter, _btree_id, \
789 _start, _end, _flags, _k, _do) \
790 ({ \
791 bch2_trans_begin(trans); \
792 \
793 struct btree_iter _iter; \
794 bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
795 (_start), (_flags)); \
796 \
797 for_each_btree_key_max_continue(_trans, _iter, _end, _flags, _k, _do);\
798 })
799
800 #define for_each_btree_key(_trans, _iter, _btree_id, \
801 _start, _flags, _k, _do) \
802 for_each_btree_key_max(_trans, _iter, _btree_id, _start, \
803 SPOS_MAX, _flags, _k, _do)
804
805 #define for_each_btree_key_reverse(_trans, _iter, _btree_id, \
806 _start, _flags, _k, _do) \
807 ({ \
808 struct btree_iter _iter; \
809 struct bkey_s_c _k; \
810 int _ret3 = 0; \
811 \
812 bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
813 (_start), (_flags)); \
814 \
815 do { \
816 _ret3 = lockrestart_do(_trans, ({ \
817 (_k) = bch2_btree_iter_peek_prev_type(&(_iter), \
818 (_flags)); \
819 if (!(_k).k) \
820 break; \
821 \
822 bkey_err(_k) ?: (_do); \
823 })); \
824 } while (!_ret3 && bch2_btree_iter_rewind(&(_iter))); \
825 \
826 bch2_trans_iter_exit((_trans), &(_iter)); \
827 _ret3; \
828 })
829
830 #define for_each_btree_key_commit(_trans, _iter, _btree_id, \
831 _start, _iter_flags, _k, \
832 _disk_res, _journal_seq, _commit_flags,\
833 _do) \
834 for_each_btree_key(_trans, _iter, _btree_id, _start, _iter_flags, _k,\
835 (_do) ?: bch2_trans_commit(_trans, (_disk_res),\
836 (_journal_seq), (_commit_flags)))
837
838 #define for_each_btree_key_reverse_commit(_trans, _iter, _btree_id, \
839 _start, _iter_flags, _k, \
840 _disk_res, _journal_seq, _commit_flags,\
841 _do) \
842 for_each_btree_key_reverse(_trans, _iter, _btree_id, _start, _iter_flags, _k,\
843 (_do) ?: bch2_trans_commit(_trans, (_disk_res),\
844 (_journal_seq), (_commit_flags)))
845
846 #define for_each_btree_key_max_commit(_trans, _iter, _btree_id, \
847 _start, _end, _iter_flags, _k, \
848 _disk_res, _journal_seq, _commit_flags,\
849 _do) \
850 for_each_btree_key_max(_trans, _iter, _btree_id, _start, _end, _iter_flags, _k,\
851 (_do) ?: bch2_trans_commit(_trans, (_disk_res),\
852 (_journal_seq), (_commit_flags)))
853
854 struct bkey_s_c bch2_btree_iter_peek_and_restart_outlined(struct btree_iter *);
855
856 #define for_each_btree_key_max_norestart(_trans, _iter, _btree_id, \
857 _start, _end, _flags, _k, _ret) \
858 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
859 (_start), (_flags)); \
860 (_k) = bch2_btree_iter_peek_max_type(&(_iter), _end, _flags),\
861 !((_ret) = bkey_err(_k)) && (_k).k; \
862 bch2_btree_iter_advance(&(_iter)))
863
864 #define for_each_btree_key_max_continue_norestart(_iter, _end, _flags, _k, _ret)\
865 for (; \
866 (_k) = bch2_btree_iter_peek_max_type(&(_iter), _end, _flags), \
867 !((_ret) = bkey_err(_k)) && (_k).k; \
868 bch2_btree_iter_advance(&(_iter)))
869
870 #define for_each_btree_key_norestart(_trans, _iter, _btree_id, \
871 _start, _flags, _k, _ret) \
872 for_each_btree_key_max_norestart(_trans, _iter, _btree_id, _start,\
873 SPOS_MAX, _flags, _k, _ret)
874
875 #define for_each_btree_key_reverse_norestart(_trans, _iter, _btree_id, \
876 _start, _flags, _k, _ret) \
877 for (bch2_trans_iter_init((_trans), &(_iter), (_btree_id), \
878 (_start), (_flags)); \
879 (_k) = bch2_btree_iter_peek_prev_type(&(_iter), _flags), \
880 !((_ret) = bkey_err(_k)) && (_k).k; \
881 bch2_btree_iter_rewind(&(_iter)))
882
883 #define for_each_btree_key_continue_norestart(_iter, _flags, _k, _ret) \
884 for_each_btree_key_max_continue_norestart(_iter, SPOS_MAX, _flags, _k, _ret)
885
886 /*
887 * This should not be used in a fastpath, without first trying _do in
888 * nonblocking mode - it will cause excessive transaction restarts and
889 * potentially livelocking:
890 */
891 #define drop_locks_do(_trans, _do) \
892 ({ \
893 bch2_trans_unlock(_trans); \
894 (_do) ?: bch2_trans_relock(_trans); \
895 })
896
897 #define allocate_dropping_locks_errcode(_trans, _do) \
898 ({ \
899 gfp_t _gfp = GFP_NOWAIT|__GFP_NOWARN; \
900 int _ret = _do; \
901 \
902 if (bch2_err_matches(_ret, ENOMEM)) { \
903 _gfp = GFP_KERNEL; \
904 _ret = drop_locks_do(_trans, _do); \
905 } \
906 _ret; \
907 })
908
909 #define allocate_dropping_locks(_trans, _ret, _do) \
910 ({ \
911 gfp_t _gfp = GFP_NOWAIT|__GFP_NOWARN; \
912 typeof(_do) _p = _do; \
913 \
914 _ret = 0; \
915 if (unlikely(!_p)) { \
916 _gfp = GFP_KERNEL; \
917 _ret = drop_locks_do(_trans, ((_p = _do), 0)); \
918 } \
919 _p; \
920 })
921
922 #define bch2_trans_run(_c, _do) \
923 ({ \
924 struct btree_trans *trans = bch2_trans_get(_c); \
925 int _ret = (_do); \
926 bch2_trans_put(trans); \
927 _ret; \
928 })
929
930 #define bch2_trans_do(_c, _do) bch2_trans_run(_c, lockrestart_do(trans, _do))
931
932 struct btree_trans *__bch2_trans_get(struct bch_fs *, unsigned);
933 void bch2_trans_put(struct btree_trans *);
934
935 bool bch2_current_has_btree_trans(struct bch_fs *);
936
937 extern const char *bch2_btree_transaction_fns[BCH_TRANSACTIONS_NR];
938 unsigned bch2_trans_get_fn_idx(const char *);
939
940 #define bch2_trans_get(_c) \
941 ({ \
942 static unsigned trans_fn_idx; \
943 \
944 if (unlikely(!trans_fn_idx)) \
945 trans_fn_idx = bch2_trans_get_fn_idx(__func__); \
946 __bch2_trans_get(_c, trans_fn_idx); \
947 })
948
949 void bch2_btree_trans_to_text(struct printbuf *, struct btree_trans *);
950
951 void bch2_fs_btree_iter_exit(struct bch_fs *);
952 void bch2_fs_btree_iter_init_early(struct bch_fs *);
953 int bch2_fs_btree_iter_init(struct bch_fs *);
954
955 #endif /* _BCACHEFS_BTREE_ITER_H */
956