git.sesse.net Git - bcachefs-tools-debian/blob - libbcachefs/btree_update.h

   1 /* SPDX-License-Identifier: GPL-2.0 */
   2 #ifndef _BCACHEFS_BTREE_UPDATE_H
   3 #define _BCACHEFS_BTREE_UPDATE_H
   4
   5 #include "btree_iter.h"
   6 #include "journal.h"
   7
   8 struct bch_fs;
   9 struct btree;
  10
  11 void bch2_btree_node_lock_for_insert(struct btree_trans *, struct btree_path *,
  12                                      struct btree *);
  13 bool bch2_btree_bset_insert_key(struct btree_trans *, struct btree_path *,
  14                                 struct btree *, struct btree_node_iter *,
  15                                 struct bkey_i *);
  16 void bch2_btree_add_journal_pin(struct bch_fs *, struct btree *, u64);
  17
  18 enum btree_insert_flags {
  19         /* First two bits for journal watermark: */
  20         __BTREE_INSERT_NOFAIL = 2,
  21         __BTREE_INSERT_NOCHECK_RW,
  22         __BTREE_INSERT_LAZY_RW,
  23         __BTREE_INSERT_USE_RESERVE,
  24         __BTREE_INSERT_JOURNAL_REPLAY,
  25         __BTREE_INSERT_JOURNAL_RECLAIM,
  26         __BTREE_INSERT_NOWAIT,
  27         __BTREE_INSERT_GC_LOCK_HELD,
  28         __BCH_HASH_SET_MUST_CREATE,
  29         __BCH_HASH_SET_MUST_REPLACE,
  30 };
  31
  32 /* Don't check for -ENOSPC: */
  33 #define BTREE_INSERT_NOFAIL             (1 << __BTREE_INSERT_NOFAIL)
  34
  35 #define BTREE_INSERT_NOCHECK_RW         (1 << __BTREE_INSERT_NOCHECK_RW)
  36 #define BTREE_INSERT_LAZY_RW            (1 << __BTREE_INSERT_LAZY_RW)
  37
  38 /* for copygc, or when merging btree nodes */
  39 #define BTREE_INSERT_USE_RESERVE        (1 << __BTREE_INSERT_USE_RESERVE)
  40
  41 /* Insert is for journal replay - don't get journal reservations: */
  42 #define BTREE_INSERT_JOURNAL_REPLAY     (1 << __BTREE_INSERT_JOURNAL_REPLAY)
  43
  44 /* Insert is being called from journal reclaim path: */
  45 #define BTREE_INSERT_JOURNAL_RECLAIM (1 << __BTREE_INSERT_JOURNAL_RECLAIM)
  46
  47 /* Don't block on allocation failure (for new btree nodes: */
  48 #define BTREE_INSERT_NOWAIT             (1 << __BTREE_INSERT_NOWAIT)
  49 #define BTREE_INSERT_GC_LOCK_HELD       (1 << __BTREE_INSERT_GC_LOCK_HELD)
  50
  51 #define BCH_HASH_SET_MUST_CREATE        (1 << __BCH_HASH_SET_MUST_CREATE)
  52 #define BCH_HASH_SET_MUST_REPLACE       (1 << __BCH_HASH_SET_MUST_REPLACE)
  53
  54 int bch2_btree_delete_extent_at(struct btree_trans *, struct btree_iter *,
  55                                 unsigned, unsigned);
  56 int bch2_btree_delete_at(struct btree_trans *, struct btree_iter *, unsigned);
  57
  58 int __bch2_btree_insert(struct btree_trans *, enum btree_id, struct bkey_i *);
  59 int bch2_btree_insert(struct bch_fs *, enum btree_id, struct bkey_i *,
  60                      struct disk_reservation *, u64 *, int flags);
  61
  62 int bch2_btree_delete_range_trans(struct btree_trans *, enum btree_id,
  63                                   struct bpos, struct bpos, unsigned, u64 *);
  64 int bch2_btree_delete_range(struct bch_fs *, enum btree_id,
  65                             struct bpos, struct bpos, unsigned, u64 *);
  66
  67 int bch2_btree_node_rewrite(struct btree_trans *, struct btree_iter *,
  68                             struct btree *, unsigned);
  69 void bch2_btree_node_rewrite_async(struct bch_fs *, struct btree *);
  70 int bch2_btree_node_update_key(struct btree_trans *, struct btree_iter *,
  71                                struct btree *, struct bkey_i *, bool);
  72 int bch2_btree_node_update_key_get_iter(struct btree_trans *,
  73                                 struct btree *, struct bkey_i *, bool);
  74
  75 int bch2_trans_update_extent(struct btree_trans *, struct btree_iter *,
  76                              struct bkey_i *, enum btree_update_flags);
  77
  78 int __must_check bch2_trans_update(struct btree_trans *, struct btree_iter *,
  79                                    struct bkey_i *, enum btree_update_flags);
  80
  81 void bch2_trans_commit_hook(struct btree_trans *,
  82                             struct btree_trans_commit_hook *);
  83 int __bch2_trans_commit(struct btree_trans *);
  84
  85 int bch2_trans_log_msg(struct btree_trans *, const char *);
  86
  87 /**
  88  * bch2_trans_commit - insert keys at given iterator positions
  89  *
  90  * This is main entry point for btree updates.
  91  *
  92  * Return values:
  93  * -EINTR: locking changed, this function should be called again.
  94  * -EROFS: filesystem read only
  95  * -EIO: journal or btree node IO error
  96  */
  97 static inline int bch2_trans_commit(struct btree_trans *trans,
  98                                     struct disk_reservation *disk_res,
  99                                     u64 *journal_seq,
 100                                     unsigned flags)
 101 {
 102         trans->disk_res         = disk_res;
 103         trans->journal_seq      = journal_seq;
 104         trans->flags            = flags;
 105
 106         return __bch2_trans_commit(trans);
 107 }
 108
 109 #define lockrestart_do(_trans, _do)                                     \
 110 ({                                                                      \
 111         int _ret;                                                       \
 112                                                                         \
 113         do {                                                            \
 114                 bch2_trans_begin(_trans);                               \
 115                 _ret = (_do);                                           \
 116         } while (_ret == -EINTR);                                       \
 117                                                                         \
 118         _ret;                                                           \
 119 })
 120
 121 #define commit_do(_trans, _disk_res, _journal_seq, _flags, _do) \
 122         lockrestart_do(_trans, _do ?: bch2_trans_commit(_trans, (_disk_res),\
 123                                         (_journal_seq), (_flags)))
 124
 125 #define bch2_trans_do(_c, _disk_res, _journal_seq, _flags, _do)         \
 126 ({                                                                      \
 127         struct btree_trans trans;                                       \
 128         int _ret;                                                       \
 129                                                                         \
 130         bch2_trans_init(&trans, (_c), 0, 0);                            \
 131         _ret = commit_do(&trans, _disk_res, _journal_seq, _flags, _do); \
 132         bch2_trans_exit(&trans);                                        \
 133                                                                         \
 134         _ret;                                                           \
 135 })
 136
 137 #define trans_for_each_update(_trans, _i)                               \
 138         for ((_i) = (_trans)->updates;                                  \
 139              (_i) < (_trans)->updates + (_trans)->nr_updates;           \
 140              (_i)++)
 141
 142 static inline void bch2_trans_reset_updates(struct btree_trans *trans)
 143 {
 144         struct btree_insert_entry *i;
 145
 146         trans_for_each_update(trans, i)
 147                 bch2_path_put(trans, i->path, true);
 148
 149         trans->extra_journal_res        = 0;
 150         trans->nr_updates               = 0;
 151         trans->hooks                    = NULL;
 152         trans->extra_journal_entries.nr = 0;
 153 }
 154
 155 #endif /* _BCACHEFS_BTREE_UPDATE_H */