git.sesse.net Git - bcachefs-tools-debian/blob - libbcachefs/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_btree_iter_relock(struct btree_iter *, bool);
 115 bool bch2_trans_relock(struct btree_trans *);
 116 void bch2_trans_unlock(struct btree_trans *);
 117
 118 bool __bch2_btree_iter_upgrade(struct btree_iter *, unsigned);
 119
 120 static inline bool bch2_btree_iter_upgrade(struct btree_iter *iter,
 121                                            unsigned new_locks_want)
 122 {
 123         new_locks_want = min(new_locks_want, BTREE_MAX_DEPTH);
 124
 125         return iter->locks_want < new_locks_want
 126                 ? __bch2_btree_iter_upgrade(iter, new_locks_want)
 127                 : iter->uptodate <= BTREE_ITER_NEED_PEEK;
 128 }
 129
 130 void __bch2_btree_iter_downgrade(struct btree_iter *, unsigned);
 131
 132 static inline void bch2_btree_iter_downgrade(struct btree_iter *iter)
 133 {
 134         unsigned new_locks_want = (iter->flags & BTREE_ITER_INTENT ? 1 : 0);
 135
 136         if (iter->locks_want > new_locks_want)
 137                 __bch2_btree_iter_downgrade(iter, new_locks_want);
 138 }
 139
 140 void bch2_trans_downgrade(struct btree_trans *);
 141
 142 void bch2_btree_iter_node_replace(struct btree_iter *, struct btree *);
 143 void bch2_btree_iter_node_drop(struct btree_iter *, struct btree *);
 144
 145 void bch2_btree_iter_reinit_node(struct btree_iter *, struct btree *);
 146
 147 int __must_check bch2_btree_iter_traverse(struct btree_iter *);
 148
 149 int bch2_btree_iter_traverse_all(struct btree_trans *);
 150
 151 struct btree *bch2_btree_iter_peek_node(struct btree_iter *);
 152 struct btree *bch2_btree_iter_next_node(struct btree_iter *);
 153
 154 struct bkey_s_c bch2_btree_iter_peek(struct btree_iter *);
 155 struct bkey_s_c bch2_btree_iter_next(struct btree_iter *);
 156
 157 struct bkey_s_c bch2_btree_iter_peek_with_updates(struct btree_iter *);
 158 struct bkey_s_c bch2_btree_iter_next_with_updates(struct btree_iter *);
 159
 160 struct bkey_s_c bch2_btree_iter_peek_prev(struct btree_iter *);
 161 struct bkey_s_c bch2_btree_iter_prev(struct btree_iter *);
 162
 163 struct bkey_s_c bch2_btree_iter_peek_slot(struct btree_iter *);
 164 struct bkey_s_c bch2_btree_iter_next_slot(struct btree_iter *);
 165 struct bkey_s_c bch2_btree_iter_prev_slot(struct btree_iter *);
 166
 167 struct bkey_s_c bch2_btree_iter_peek_cached(struct btree_iter *);
 168
 169 bool bch2_btree_iter_advance(struct btree_iter *);
 170 bool bch2_btree_iter_rewind(struct btree_iter *);
 171
 172 static inline void bch2_btree_iter_set_pos(struct btree_iter *iter, struct bpos new_pos)
 173 {
 174         if (!(iter->flags & BTREE_ITER_ALL_SNAPSHOTS))
 175                 new_pos.snapshot = iter->snapshot;
 176
 177         iter->k.type = KEY_TYPE_deleted;
 178         iter->k.p.inode         = iter->pos.inode       = new_pos.inode;
 179         iter->k.p.offset        = iter->pos.offset      = new_pos.offset;
 180         iter->k.p.snapshot      = iter->pos.snapshot    = new_pos.snapshot;
 181         iter->k.size = 0;
 182 }
 183
 184 /* Sort order for locking btree iterators: */
 185 static inline int btree_iter_lock_cmp(const struct btree_iter *l,
 186                                       const struct btree_iter *r)
 187 {
 188         return   cmp_int(l->btree_id, r->btree_id) ?:
 189                 -cmp_int(btree_iter_is_cached(l), btree_iter_is_cached(r)) ?:
 190                  bkey_cmp(l->pos, r->pos);
 191 }
 192
 193 /*
 194  * Unlocks before scheduling
 195  * Note: does not revalidate iterator
 196  */
 197 static inline int bch2_trans_cond_resched(struct btree_trans *trans)
 198 {
 199         if (need_resched() || race_fault()) {
 200                 bch2_trans_unlock(trans);
 201                 schedule();
 202                 return bch2_trans_relock(trans) ? 0 : -EINTR;
 203         } else {
 204                 return 0;
 205         }
 206 }
 207
 208 #define __for_each_btree_node(_trans, _iter, _btree_id, _start, \
 209                               _locks_want, _depth, _flags, _b)          \
 210         for (iter = bch2_trans_get_node_iter((_trans), (_btree_id),     \
 211                                 _start, _locks_want, _depth, _flags),   \
 212              _b = bch2_btree_iter_peek_node(_iter);                     \
 213              (_b);                                                      \
 214              (_b) = bch2_btree_iter_next_node(_iter))
 215
 216 #define for_each_btree_node(_trans, _iter, _btree_id, _start,           \
 217                             _flags, _b)                                 \
 218         __for_each_btree_node(_trans, _iter, _btree_id, _start,         \
 219                               0, 0, _flags, _b)
 220
 221 static inline struct bkey_s_c __bch2_btree_iter_peek(struct btree_iter *iter,
 222                                                      unsigned flags)
 223 {
 224         if ((flags & BTREE_ITER_TYPE) == BTREE_ITER_CACHED)
 225                 return bch2_btree_iter_peek_cached(iter);
 226         else
 227                 return flags & BTREE_ITER_SLOTS
 228                         ? bch2_btree_iter_peek_slot(iter)
 229                         : bch2_btree_iter_peek(iter);
 230 }
 231
 232 static inline struct bkey_s_c __bch2_btree_iter_next(struct btree_iter *iter,
 233                                                      unsigned flags)
 234 {
 235         return flags & BTREE_ITER_SLOTS
 236                 ? bch2_btree_iter_next_slot(iter)
 237                 : bch2_btree_iter_next(iter);
 238 }
 239
 240 static inline int bkey_err(struct bkey_s_c k)
 241 {
 242         return PTR_ERR_OR_ZERO(k.k);
 243 }
 244
 245 #define for_each_btree_key(_trans, _iter, _btree_id,                    \
 246                            _start, _flags, _k, _ret)                    \
 247         for ((_iter) = bch2_trans_get_iter((_trans), (_btree_id),       \
 248                                            (_start), (_flags)),         \
 249              (_k) = __bch2_btree_iter_peek(_iter, _flags);              \
 250              !((_ret) = bkey_err(_k)) && (_k).k;                        \
 251              (_k) = __bch2_btree_iter_next(_iter, _flags))
 252
 253 #define for_each_btree_key_continue(_iter, _flags, _k, _ret)            \
 254         for ((_k) = __bch2_btree_iter_peek(_iter, _flags);              \
 255              !((_ret) = bkey_err(_k)) && (_k).k;                        \
 256              (_k) = __bch2_btree_iter_next(_iter, _flags))
 257
 258 /* new multiple iterator interface: */
 259
 260 int bch2_trans_iter_put(struct btree_trans *, struct btree_iter *);
 261 int bch2_trans_iter_free(struct btree_trans *, struct btree_iter *);
 262
 263 void bch2_trans_unlink_iters(struct btree_trans *);
 264
 265 struct btree_iter *__bch2_trans_get_iter(struct btree_trans *, enum btree_id,
 266                                          struct bpos, unsigned,
 267                                          unsigned, unsigned);
 268
 269 static inline struct btree_iter *
 270 bch2_trans_get_iter(struct btree_trans *trans, enum btree_id btree_id,
 271                     struct bpos pos, unsigned flags)
 272 {
 273         struct btree_iter *iter =
 274                 __bch2_trans_get_iter(trans, btree_id, pos,
 275                                       (flags & BTREE_ITER_INTENT) != 0, 0,
 276                                       flags);
 277         iter->ip_allocated = _THIS_IP_;
 278         return iter;
 279 }
 280
 281 struct btree_iter *__bch2_trans_copy_iter(struct btree_trans *,
 282                                         struct btree_iter *);
 283 static inline struct btree_iter *
 284 bch2_trans_copy_iter(struct btree_trans *trans, struct btree_iter *src)
 285 {
 286         struct btree_iter *iter =
 287                 __bch2_trans_copy_iter(trans, src);
 288
 289         iter->ip_allocated = _THIS_IP_;
 290         return iter;
 291 }
 292
 293 struct btree_iter *bch2_trans_get_node_iter(struct btree_trans *,
 294                                 enum btree_id, struct bpos,
 295                                 unsigned, unsigned, unsigned);
 296
 297 static inline bool btree_iter_live(struct btree_trans *trans, struct btree_iter *iter)
 298 {
 299         return (trans->iters_live & (1ULL << iter->idx)) != 0;
 300 }
 301
 302 static inline bool btree_iter_keep(struct btree_trans *trans, struct btree_iter *iter)
 303 {
 304         return btree_iter_live(trans, iter) ||
 305                 (iter->flags & BTREE_ITER_KEEP_UNTIL_COMMIT);
 306 }
 307
 308 static inline void set_btree_iter_dontneed(struct btree_trans *trans, struct btree_iter *iter)
 309 {
 310         trans->iters_touched &= ~(1ULL << iter->idx);
 311 }
 312
 313 #define TRANS_RESET_NOTRAVERSE          (1 << 0)
 314 #define TRANS_RESET_NOUNLOCK            (1 << 1)
 315
 316 void bch2_trans_reset(struct btree_trans *, unsigned);
 317
 318 static inline void bch2_trans_begin(struct btree_trans *trans)
 319 {
 320         return bch2_trans_reset(trans, 0);
 321 }
 322
 323 void *bch2_trans_kmalloc(struct btree_trans *, size_t);
 324 void bch2_trans_init(struct btree_trans *, struct bch_fs *, unsigned, size_t);
 325 int bch2_trans_exit(struct btree_trans *);
 326
 327 void bch2_btree_trans_to_text(struct printbuf *, struct bch_fs *);
 328
 329 void bch2_fs_btree_iter_exit(struct bch_fs *);
 330 int bch2_fs_btree_iter_init(struct bch_fs *);
 331
 332 #endif /* _BCACHEFS_BTREE_ITER_H */