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