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_prep_for_write(struct btree_trans *,
  12                                     struct btree_path *, 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
  17 int bch2_btree_node_flush0(struct journal *, struct journal_entry_pin *, u64);
  18 int bch2_btree_node_flush1(struct journal *, struct journal_entry_pin *, u64);
  19 void bch2_btree_add_journal_pin(struct bch_fs *, struct btree *, u64);
  20
  21 void bch2_btree_insert_key_leaf(struct btree_trans *, struct btree_path *,
  22                                 struct bkey_i *, u64);
  23
  24 enum btree_insert_flags {
  25         /* First two bits for journal watermark: */
  26         __BTREE_INSERT_NOFAIL = 2,
  27         __BTREE_INSERT_NOCHECK_RW,
  28         __BTREE_INSERT_LAZY_RW,
  29         __BTREE_INSERT_USE_RESERVE,
  30         __BTREE_INSERT_JOURNAL_REPLAY,
  31         __BTREE_INSERT_JOURNAL_RECLAIM,
  32         __BTREE_INSERT_NOWAIT,
  33         __BTREE_INSERT_GC_LOCK_HELD,
  34         __BCH_HASH_SET_MUST_CREATE,
  35         __BCH_HASH_SET_MUST_REPLACE,
  36 };
  37
  38 /* Don't check for -ENOSPC: */
  39 #define BTREE_INSERT_NOFAIL             (1 << __BTREE_INSERT_NOFAIL)
  40
  41 #define BTREE_INSERT_NOCHECK_RW         (1 << __BTREE_INSERT_NOCHECK_RW)
  42 #define BTREE_INSERT_LAZY_RW            (1 << __BTREE_INSERT_LAZY_RW)
  43
  44 /* for copygc, or when merging btree nodes */
  45 #define BTREE_INSERT_USE_RESERVE        (1 << __BTREE_INSERT_USE_RESERVE)
  46
  47 /* Insert is for journal replay - don't get journal reservations: */
  48 #define BTREE_INSERT_JOURNAL_REPLAY     (1 << __BTREE_INSERT_JOURNAL_REPLAY)
  49
  50 /* Insert is being called from journal reclaim path: */
  51 #define BTREE_INSERT_JOURNAL_RECLAIM (1 << __BTREE_INSERT_JOURNAL_RECLAIM)
  52
  53 /* Don't block on allocation failure (for new btree nodes: */
  54 #define BTREE_INSERT_NOWAIT             (1 << __BTREE_INSERT_NOWAIT)
  55 #define BTREE_INSERT_GC_LOCK_HELD       (1 << __BTREE_INSERT_GC_LOCK_HELD)
  56
  57 #define BCH_HASH_SET_MUST_CREATE        (1 << __BCH_HASH_SET_MUST_CREATE)
  58 #define BCH_HASH_SET_MUST_REPLACE       (1 << __BCH_HASH_SET_MUST_REPLACE)
  59
  60 int bch2_btree_delete_extent_at(struct btree_trans *, struct btree_iter *,
  61                                 unsigned, unsigned);
  62 int bch2_btree_delete_at(struct btree_trans *, struct btree_iter *, unsigned);
  63 int bch2_btree_delete_at_buffered(struct btree_trans *, enum btree_id, struct bpos);
  64
  65 int bch2_btree_insert_nonextent(struct btree_trans *, enum btree_id,
  66                                 struct bkey_i *, enum btree_update_flags);
  67
  68 int __bch2_btree_insert(struct btree_trans *, enum btree_id, struct bkey_i *,
  69                         enum btree_update_flags);
  70 int bch2_btree_insert(struct bch_fs *, enum btree_id, struct bkey_i *,
  71                      struct disk_reservation *, u64 *, int flags);
  72
  73 int bch2_btree_delete_range_trans(struct btree_trans *, enum btree_id,
  74                                   struct bpos, struct bpos, unsigned, u64 *);
  75 int bch2_btree_delete_range(struct bch_fs *, enum btree_id,
  76                             struct bpos, struct bpos, unsigned, u64 *);
  77
  78 int bch2_btree_node_rewrite(struct btree_trans *, struct btree_iter *,
  79                             struct btree *, unsigned);
  80 void bch2_btree_node_rewrite_async(struct bch_fs *, struct btree *);
  81 int bch2_btree_node_update_key(struct btree_trans *, struct btree_iter *,
  82                                struct btree *, struct bkey_i *, bool);
  83 int bch2_btree_node_update_key_get_iter(struct btree_trans *,
  84                                 struct btree *, struct bkey_i *, bool);
  85
  86 int bch2_trans_update_extent(struct btree_trans *, struct btree_iter *,
  87                              struct bkey_i *, enum btree_update_flags);
  88
  89 int __must_check bch2_trans_update(struct btree_trans *, struct btree_iter *,
  90                                    struct bkey_i *, enum btree_update_flags);
  91 int __must_check bch2_trans_update_buffered(struct btree_trans *,
  92                                             enum btree_id, struct bkey_i *);
  93
  94 void bch2_trans_commit_hook(struct btree_trans *,
  95                             struct btree_trans_commit_hook *);
  96 int __bch2_trans_commit(struct btree_trans *, unsigned);
  97
  98 int bch2_fs_log_msg(struct bch_fs *, const char *, ...);
  99 int bch2_journal_log_msg(struct bch_fs *, const char *, ...);
 100
 101 /**
 102  * bch2_trans_commit - insert keys at given iterator positions
 103  *
 104  * This is main entry point for btree updates.
 105  *
 106  * Return values:
 107  * -EROFS: filesystem read only
 108  * -EIO: journal or btree node IO error
 109  */
 110 static inline int bch2_trans_commit(struct btree_trans *trans,
 111                                     struct disk_reservation *disk_res,
 112                                     u64 *journal_seq,
 113                                     unsigned flags)
 114 {
 115         trans->disk_res         = disk_res;
 116         trans->journal_seq      = journal_seq;
 117
 118         return __bch2_trans_commit(trans, flags);
 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 nested_commit_do(_trans, _disk_res, _journal_seq, _flags, _do)  \
 126         nested_lockrestart_do(_trans, _do ?: bch2_trans_commit(_trans, (_disk_res),\
 127                                         (_journal_seq), (_flags)))
 128
 129 #define bch2_trans_do(_c, _disk_res, _journal_seq, _flags, _do)         \
 130 ({                                                                      \
 131         struct btree_trans trans;                                       \
 132         int _ret;                                                       \
 133                                                                         \
 134         bch2_trans_init(&trans, (_c), 0, 0);                            \
 135         _ret = commit_do(&trans, _disk_res, _journal_seq, _flags, _do); \
 136         bch2_trans_exit(&trans);                                        \
 137                                                                         \
 138         _ret;                                                           \
 139 })
 140
 141 #define bch2_trans_run(_c, _do)                                         \
 142 ({                                                                      \
 143         struct btree_trans trans;                                       \
 144         int _ret;                                                       \
 145                                                                         \
 146         bch2_trans_init(&trans, (_c), 0, 0);                            \
 147         _ret = (_do);                                                   \
 148         bch2_trans_exit(&trans);                                        \
 149                                                                         \
 150         _ret;                                                           \
 151 })
 152
 153 #define trans_for_each_update(_trans, _i)                               \
 154         for ((_i) = (_trans)->updates;                                  \
 155              (_i) < (_trans)->updates + (_trans)->nr_updates;           \
 156              (_i)++)
 157
 158 #define trans_for_each_wb_update(_trans, _i)                            \
 159         for ((_i) = (_trans)->wb_updates;                               \
 160              (_i) < (_trans)->wb_updates + (_trans)->nr_wb_updates;     \
 161              (_i)++)
 162
 163 static inline void bch2_trans_reset_updates(struct btree_trans *trans)
 164 {
 165         struct btree_insert_entry *i;
 166
 167         trans_for_each_update(trans, i)
 168                 bch2_path_put(trans, i->path, true);
 169
 170         trans->extra_journal_res        = 0;
 171         trans->nr_updates               = 0;
 172         trans->nr_wb_updates            = 0;
 173         trans->wb_updates               = NULL;
 174         trans->hooks                    = NULL;
 175         trans->extra_journal_entries.nr = 0;
 176
 177         if (trans->fs_usage_deltas) {
 178                 trans->fs_usage_deltas->used = 0;
 179                 memset((void *) trans->fs_usage_deltas +
 180                        offsetof(struct replicas_delta_list, memset_start), 0,
 181                        (void *) &trans->fs_usage_deltas->memset_end -
 182                        (void *) &trans->fs_usage_deltas->memset_start);
 183         }
 184 }
 185
 186 #endif /* _BCACHEFS_BTREE_UPDATE_H */