bkey_methods.h 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138
  1. /* SPDX-License-Identifier: GPL-2.0 */
  2. #ifndef _BCACHEFS_BKEY_METHODS_H
  3. #define _BCACHEFS_BKEY_METHODS_H
  4. #include "bkey.h"
  5. struct bch_fs;
  6. struct btree;
  7. struct btree_trans;
  8. struct bkey;
  9. enum btree_node_type;
  10. extern const char * const bch2_bkey_types[];
  11. extern const struct bkey_ops bch2_bkey_null_ops;
  12. /*
  13. * key_validate: checks validity of @k, returns 0 if good or -EINVAL if bad. If
  14. * invalid, entire key will be deleted.
  15. *
  16. * When invalid, error string is returned via @err. @rw indicates whether key is
  17. * being read or written; more aggressive checks can be enabled when rw == WRITE.
  18. */
  19. struct bkey_ops {
  20. int (*key_validate)(struct bch_fs *c, struct bkey_s_c k,
  21. enum bch_validate_flags flags);
  22. void (*val_to_text)(struct printbuf *, struct bch_fs *,
  23. struct bkey_s_c);
  24. void (*swab)(struct bkey_s);
  25. bool (*key_normalize)(struct bch_fs *, struct bkey_s);
  26. bool (*key_merge)(struct bch_fs *, struct bkey_s, struct bkey_s_c);
  27. int (*trigger)(struct btree_trans *, enum btree_id, unsigned,
  28. struct bkey_s_c, struct bkey_s,
  29. enum btree_iter_update_trigger_flags);
  30. void (*compat)(enum btree_id id, unsigned version,
  31. unsigned big_endian, int write,
  32. struct bkey_s);
  33. /* Size of value type when first created: */
  34. unsigned min_val_size;
  35. };
  36. extern const struct bkey_ops bch2_bkey_ops[];
  37. static inline const struct bkey_ops *bch2_bkey_type_ops(enum bch_bkey_type type)
  38. {
  39. return likely(type < KEY_TYPE_MAX)
  40. ? &bch2_bkey_ops[type]
  41. : &bch2_bkey_null_ops;
  42. }
  43. int bch2_bkey_val_validate(struct bch_fs *, struct bkey_s_c, enum bch_validate_flags);
  44. int __bch2_bkey_validate(struct bch_fs *, struct bkey_s_c, enum btree_node_type,
  45. enum bch_validate_flags);
  46. int bch2_bkey_validate(struct bch_fs *, struct bkey_s_c, enum btree_node_type,
  47. enum bch_validate_flags);
  48. int bch2_bkey_in_btree_node(struct bch_fs *, struct btree *, struct bkey_s_c,
  49. enum bch_validate_flags);
  50. void bch2_bpos_to_text(struct printbuf *, struct bpos);
  51. void bch2_bkey_to_text(struct printbuf *, const struct bkey *);
  52. void bch2_val_to_text(struct printbuf *, struct bch_fs *,
  53. struct bkey_s_c);
  54. void bch2_bkey_val_to_text(struct printbuf *, struct bch_fs *,
  55. struct bkey_s_c);
  56. void bch2_bkey_swab_val(struct bkey_s);
  57. bool bch2_bkey_normalize(struct bch_fs *, struct bkey_s);
  58. static inline bool bch2_bkey_maybe_mergable(const struct bkey *l, const struct bkey *r)
  59. {
  60. return l->type == r->type &&
  61. !bversion_cmp(l->bversion, r->bversion) &&
  62. bpos_eq(l->p, bkey_start_pos(r));
  63. }
  64. bool bch2_bkey_merge(struct bch_fs *, struct bkey_s, struct bkey_s_c);
  65. static inline int bch2_key_trigger(struct btree_trans *trans,
  66. enum btree_id btree, unsigned level,
  67. struct bkey_s_c old, struct bkey_s new,
  68. enum btree_iter_update_trigger_flags flags)
  69. {
  70. const struct bkey_ops *ops = bch2_bkey_type_ops(old.k->type ?: new.k->type);
  71. return ops->trigger
  72. ? ops->trigger(trans, btree, level, old, new, flags)
  73. : 0;
  74. }
  75. static inline int bch2_key_trigger_old(struct btree_trans *trans,
  76. enum btree_id btree_id, unsigned level,
  77. struct bkey_s_c old,
  78. enum btree_iter_update_trigger_flags flags)
  79. {
  80. struct bkey_i deleted;
  81. bkey_init(&deleted.k);
  82. deleted.k.p = old.k->p;
  83. return bch2_key_trigger(trans, btree_id, level, old, bkey_i_to_s(&deleted),
  84. BTREE_TRIGGER_overwrite|flags);
  85. }
  86. static inline int bch2_key_trigger_new(struct btree_trans *trans,
  87. enum btree_id btree_id, unsigned level,
  88. struct bkey_s new,
  89. enum btree_iter_update_trigger_flags flags)
  90. {
  91. struct bkey_i deleted;
  92. bkey_init(&deleted.k);
  93. deleted.k.p = new.k->p;
  94. return bch2_key_trigger(trans, btree_id, level, bkey_i_to_s_c(&deleted), new,
  95. BTREE_TRIGGER_insert|flags);
  96. }
  97. void bch2_bkey_renumber(enum btree_node_type, struct bkey_packed *, int);
  98. void __bch2_bkey_compat(unsigned, enum btree_id, unsigned, unsigned,
  99. int, struct bkey_format *, struct bkey_packed *);
  100. static inline void bch2_bkey_compat(unsigned level, enum btree_id btree_id,
  101. unsigned version, unsigned big_endian,
  102. int write,
  103. struct bkey_format *f,
  104. struct bkey_packed *k)
  105. {
  106. if (version < bcachefs_metadata_version_current ||
  107. big_endian != CPU_BIG_ENDIAN ||
  108. IS_ENABLED(CONFIG_BCACHEFS_DEBUG))
  109. __bch2_bkey_compat(level, btree_id, version,
  110. big_endian, write, f, k);
  111. }
  112. #endif /* _BCACHEFS_BKEY_METHODS_H */