fs/bcachefs/btree_iter.h

   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
   8 static inline void btree_iter_set_dirty(struct btree_iter *iter,
   9                                         enum btree_iter_uptodate u)
  10 {
  11         iter->uptodate = max_t(unsigned, iter->uptodate, u);
  12 }
  13
  14 static inline struct btree *btree_iter_node(struct btree_iter *iter,
  15                                             unsigned level)
  16 {
  17         return level < BTREE_MAX_DEPTH ? iter->l[level].b : NULL;
  18 }
  19
  20 static inline bool btree_node_lock_seq_matches(const struct btree_iter *iter,
  21                                         const struct btree *b, unsigned level)
  22 {
  23         /*
  24          * We don't compare the low bits of the lock sequence numbers because
  25          * @iter might have taken a write lock on @b, and we don't want to skip
  26          * the linked iterator if the sequence numbers were equal before taking
  27          * that write lock. The lock sequence number is incremented by taking
  28          * and releasing write locks and is even when unlocked:
  29          */
  30         return iter->l[level].lock_seq >> 1 == b->c.lock.state.seq >> 1;
  31 }
  32
  33 static inline struct btree *btree_node_parent(struct btree_iter *iter,
  34                                               struct btree *b)
  35 {
  36         return btree_iter_node(iter, b->c.level + 1);
  37 }
  38
  39 static inline bool btree_trans_has_multiple_iters(const struct btree_trans *trans)
  40 {
  41         return hweight64(trans->iters_linked) > 1;
  42 }
  43
  44 static inline int btree_iter_err(const struct btree_iter *iter)
  45 {
  46         return iter->flags & BTREE_ITER_ERROR ? -EIO : 0;
  47 }
  48
  49 /* Iterate over iters within a transaction: */
  50
  51 static inline struct btree_iter *
  52 __trans_next_iter(struct btree_trans *trans, unsigned idx)
  53 {
  54         u64 l;
  55
  56         if (idx == BTREE_ITER_MAX)
  57                 return NULL;
  58
  59         l = trans->iters_linked >> idx;
  60         if (!l)
  61                 return NULL;
  62
  63         idx += __ffs64(l);
  64         EBUG_ON(idx >= BTREE_ITER_MAX);
  65         EBUG_ON(trans->iters[idx].idx != idx);
  66         return &trans->iters[idx];
  67 }
  68
  69 #define trans_for_each_iter(_trans, _iter)                              \
  70         for (_iter = __trans_next_iter((_trans), 0);                    \
  71              (_iter);                                                   \
  72              _iter = __trans_next_iter((_trans), (_iter)->idx + 1))
  73
  74 static inline bool __iter_has_node(const struct btree_iter *iter,
  75                                    const struct btree *b)
  76 {
  77         return iter->l[b->c.level].b == b &&
  78                 btree_node_lock_seq_matches(iter, b, b->c.level);
  79 }
  80
  81 static inline struct btree_iter *
  82 __trans_next_iter_with_node(struct btree_trans *trans, struct btree *b,
  83                             unsigned idx)
  84 {
  85         struct btree_iter *iter = __trans_next_iter(trans, idx);
  86
  87         while (iter && !__iter_has_node(iter, b))
  88                 iter = __trans_next_iter(trans, iter->idx + 1);
  89
  90         return iter;
  91 }
  92
  93 #define trans_for_each_iter_with_node(_trans, _b, _iter)                \
  94         for (_iter = __trans_next_iter_with_node((_trans), (_b), 0);    \
  95              (_iter);                                                   \
  96              _iter = __trans_next_iter_with_node((_trans), (_b),        \
  97                                                  (_iter)->idx + 1))
  98
  99 #ifdef CONFIG_BCACHEFS_DEBUG
 100 void bch2_btree_trans_verify_iters(struct btree_trans *, struct btree *);
 101 void bch2_btree_trans_verify_locks(struct btree_trans *);
 102 #else
 103 static inline void bch2_btree_trans_verify_iters(struct btree_trans *trans,
 104                                                  struct btree *b) {}
 105 static inline void bch2_btree_trans_verify_locks(struct btree_trans *iter) {}
 106 #endif
 107
 108 void bch2_btree_iter_fix_key_modified(struct btree_iter *, struct btree *,
 109                                            struct bkey_packed *);
 110 void bch2_btree_node_iter_fix(struct btree_iter *, struct btree *,
 111                               struct btree_node_iter *, struct bkey_packed *,
 112                               unsigned, unsigned);
 113
 114 bool bch2_trans_relock(struct btree_trans *);
 115 void bch2_trans_unlock(struct btree_trans *);
 116
 117 bool __bch2_btree_iter_upgrade(struct btree_iter *, unsigned);
 118
 119 static inline bool bch2_btree_iter_upgrade(struct btree_iter *iter,
 120                                            unsigned new_locks_want)
 121 {
 122         new_locks_want = min(new_locks_want, BTREE_MAX_DEPTH);
 123
 124         return iter->locks_want < new_locks_want
 125                 ? __bch2_btree_iter_upgrade(iter, new_locks_want)
 126                 : iter->uptodate <= BTREE_ITER_NEED_PEEK;
 127 }
 128
 129 void __bch2_btree_iter_downgrade(struct btree_iter *, unsigned);
 130
 131 static inline void bch2_btree_iter_downgrade(struct btree_iter *iter)
 132 {
 133         unsigned new_locks_want = (iter->flags & BTREE_ITER_INTENT ? 1 : 0);
 134
 135         if (iter->locks_want > new_locks_want)
 136                 __bch2_btree_iter_downgrade(iter, new_locks_want);
 137 }
 138
 139 void bch2_trans_downgrade(struct btree_trans *);
 140
 141 void bch2_btree_iter_node_replace(struct btree_iter *, struct btree *);
 142 void bch2_btree_iter_node_drop(struct btree_iter *, struct btree *);
 143
 144 void bch2_btree_iter_reinit_node(struct btree_iter *, struct btree *);
 145
 146 int __must_check bch2_btree_iter_traverse(struct btree_iter *);
 147
 148 int bch2_btree_iter_traverse_all(struct btree_trans *);
 149
 150 struct btree *bch2_btree_iter_peek_node(struct btree_iter *);
 151 struct btree *bch2_btree_iter_next_node(struct btree_iter *);
 152
 153 struct bkey_s_c bch2_btree_iter_peek(struct btree_iter *);
 154 struct bkey_s_c bch2_btree_iter_next(struct btree_iter *);
 155
 156 struct bkey_s_c bch2_btree_iter_peek_with_updates(struct btree_iter *);
 157 struct bkey_s_c bch2_btree_iter_next_with_updates(struct btree_iter *);
 158
 159 struct bkey_s_c bch2_btree_iter_peek_prev(struct btree_iter *);
 160 struct bkey_s_c bch2_btree_iter_prev(struct btree_iter *);
 161
 162 struct bkey_s_c bch2_btree_iter_peek_slot(struct btree_iter *);
 163 struct bkey_s_c bch2_btree_iter_next_slot(struct btree_iter *);
 164 struct bkey_s_c bch2_btree_iter_prev_slot(struct btree_iter *);
 165
 166 struct bkey_s_c bch2_btree_iter_peek_cached(struct btree_iter *);
 167
 168 bool bch2_btree_iter_advance(struct btree_iter *);
 169 bool bch2_btree_iter_rewind(struct btree_iter *);
 170
 171 static inline void bch2_btree_iter_set_pos(struct btree_iter *iter, struct bpos new_pos)
 172 {
 173         if (!(iter->flags & BTREE_ITER_ALL_SNAPSHOTS))
 174                 new_pos.snapshot = iter->snapshot;
 175
 176         iter->k.type = KEY_TYPE_deleted;
 177         iter->k.p.inode         = iter->pos.inode       = new_pos.inode;
 178         iter->k.p.offset        = iter->pos.offset      = new_pos.offset;
 179         iter->k.p.snapshot      = iter->pos.snapshot    = new_pos.snapshot;
 180         iter->k.size = 0;
 181         iter->should_be_locked = false;
 182 }
 183
 184 static inline struct btree_iter *btree_iter_child(struct btree_iter *iter)
 185 {
 186         return iter->child_idx == U8_MAX ? NULL
 187                 : iter->trans->iters + iter->child_idx;
 188 }
 189
 190 /* Sort order for locking btree iterators: */
 191 static inline int btree_iter_lock_cmp(const struct btree_iter *l,
 192                                       const struct btree_iter *r)
 193 {
 194         return   cmp_int(l->btree_id, r->btree_id) ?:
 195                 -cmp_int(btree_iter_is_cached(l), btree_iter_is_cached(r)) ?:
 196                  bkey_cmp(l->real_pos, r->real_pos);
 197 }
 198
 199 /*
 200  * Unlocks before scheduling
 201  * Note: does not revalidate iterator
 202  */
 203 static inline int bch2_trans_cond_resched(struct btree_trans *trans)
 204 {
 205         if (need_resched() || race_fault()) {
 206                 bch2_trans_unlock(trans);
 207                 schedule();
 208                 return bch2_trans_relock(trans) ? 0 : -EINTR;
 209         } else {
 210                 return 0;
 211         }
 212 }
 213
 214 #define __for_each_btree_node(_trans, _iter, _btree_id, _start, \
 215                               _locks_want, _depth, _flags, _b)          \
 216         for (iter = bch2_trans_get_node_iter((_trans), (_btree_id),     \
 217                                 _start, _locks_want, _depth, _flags),   \
 218              _b = bch2_btree_iter_peek_node(_iter);                     \
 219              (_b);                                                      \
 220              (_b) = bch2_btree_iter_next_node(_iter))
 221
 222 #define for_each_btree_node(_trans, _iter, _btree_id, _start,           \
 223                             _flags, _b)                                 \
 224         __for_each_btree_node(_trans, _iter, _btree_id, _start,         \
 225                               0, 0, _flags, _b)
 226
 227 static inline struct bkey_s_c __bch2_btree_iter_peek(struct btree_iter *iter,
 228                                                      unsigned flags)
 229 {
 230         if ((flags & BTREE_ITER_TYPE) == BTREE_ITER_CACHED)
 231                 return bch2_btree_iter_peek_cached(iter);
 232         else
 233                 return flags & BTREE_ITER_SLOTS
 234                         ? bch2_btree_iter_peek_slot(iter)
 235                         : bch2_btree_iter_peek(iter);
 236 }
 237
 238 static inline struct bkey_s_c __bch2_btree_iter_next(struct btree_iter *iter,
 239                                                      unsigned flags)
 240 {
 241         return flags & BTREE_ITER_SLOTS
 242                 ? bch2_btree_iter_next_slot(iter)
 243                 : bch2_btree_iter_next(iter);
 244 }
 245
 246 static inline int bkey_err(struct bkey_s_c k)
 247 {
 248         return PTR_ERR_OR_ZERO(k.k);
 249 }
 250
 251 #define for_each_btree_key(_trans, _iter, _btree_id,                    \
 252                            _start, _flags, _k, _ret)                    \
 253         for ((_iter) = bch2_trans_get_iter((_trans), (_btree_id),       \
 254                                            (_start), (_flags)),         \
 255              (_k) = __bch2_btree_iter_peek(_iter, _flags);              \
 256              !((_ret) = bkey_err(_k)) && (_k).k;                        \
 257              (_k) = __bch2_btree_iter_next(_iter, _flags))
 258
 259 #define for_each_btree_key_continue(_iter, _flags, _k, _ret)            \
 260         for ((_k) = __bch2_btree_iter_peek(_iter, _flags);              \
 261              !((_ret) = bkey_err(_k)) && (_k).k;                        \
 262              (_k) = __bch2_btree_iter_next(_iter, _flags))
 263
 264 /* new multiple iterator interface: */
 265
 266 int bch2_trans_iter_put(struct btree_trans *, struct btree_iter *);
 267 int bch2_trans_iter_free(struct btree_trans *, struct btree_iter *);
 268
 269 void bch2_trans_unlink_iters(struct btree_trans *);
 270
 271 struct btree_iter *__bch2_trans_get_iter(struct btree_trans *, enum btree_id,
 272                                          struct bpos, unsigned,
 273                                          unsigned, unsigned);
 274
 275 static inline struct btree_iter *
 276 bch2_trans_get_iter(struct btree_trans *trans, enum btree_id btree_id,
 277                     struct bpos pos, unsigned flags)
 278 {
 279         struct btree_iter *iter =
 280                 __bch2_trans_get_iter(trans, btree_id, pos,
 281                                       (flags & BTREE_ITER_INTENT) != 0, 0,
 282                                       flags);
 283         iter->ip_allocated = _THIS_IP_;
 284         return iter;
 285 }
 286
 287 struct btree_iter *__bch2_trans_copy_iter(struct btree_trans *,
 288                                         struct btree_iter *);
 289 static inline struct btree_iter *
 290 bch2_trans_copy_iter(struct btree_trans *trans, struct btree_iter *src)
 291 {
 292         struct btree_iter *iter =
 293                 __bch2_trans_copy_iter(trans, src);
 294
 295         iter->ip_allocated = _THIS_IP_;
 296         return iter;
 297 }
 298
 299 struct btree_iter *bch2_trans_get_node_iter(struct btree_trans *,
 300                                 enum btree_id, struct bpos,
 301                                 unsigned, unsigned, unsigned);
 302
 303 static inline bool btree_iter_live(struct btree_trans *trans, struct btree_iter *iter)
 304 {
 305         return (trans->iters_live & (1ULL << iter->idx)) != 0;
 306 }
 307
 308 static inline bool btree_iter_keep(struct btree_trans *trans, struct btree_iter *iter)
 309 {
 310         return btree_iter_live(trans, iter) ||
 311                 (iter->flags & BTREE_ITER_KEEP_UNTIL_COMMIT);
 312 }
 313
 314 static inline void set_btree_iter_dontneed(struct btree_trans *trans, struct btree_iter *iter)
 315 {
 316         trans->iters_touched &= ~(1ULL << iter->idx);
 317 }
 318
 319 #define TRANS_RESET_NOTRAVERSE          (1 << 0)
 320 #define TRANS_RESET_NOUNLOCK            (1 << 1)
 321
 322 void bch2_trans_reset(struct btree_trans *, unsigned);
 323
 324 static inline void bch2_trans_begin(struct btree_trans *trans)
 325 {
 326         return bch2_trans_reset(trans, 0);
 327 }
 328
 329 void *bch2_trans_kmalloc(struct btree_trans *, size_t);
 330 void bch2_trans_init(struct btree_trans *, struct bch_fs *, unsigned, size_t);
 331 int bch2_trans_exit(struct btree_trans *);
 332
 333 void bch2_btree_trans_to_text(struct printbuf *, struct bch_fs *);
 334
 335 void bch2_fs_btree_iter_exit(struct bch_fs *);
 336 int bch2_fs_btree_iter_init(struct bch_fs *);
 337
 338 #endif /* _BCACHEFS_BTREE_ITER_H */