mirror of
https://mirrors.bfsu.edu.cn/git/linux.git
synced 2024-11-15 00:04:15 +08:00
39fb2983c5
Previously, BTREE_ID_INODES was special - inodes were indexed by the inode field, which meant the offset field of struct bpos wasn't used, which led to special cases in e.g. the btree iterator code. Now, inodes in the inodes btree are indexed by the offset field. Also: prevously min_key was special for extents btrees, min_key for extents would equal max_key for the previous node. Now, min_key = bkey_successor() of the previous node, same as non extent btrees. This means we can completely get rid of btree_type_sucessor/predecessor. Also make some improvements to the metadata IO validate/compat code. Signed-off-by: Kent Overstreet <kent.overstreet@gmail.com> Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
83 lines
2.5 KiB
C
83 lines
2.5 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef _BCACHEFS_BKEY_METHODS_H
|
|
#define _BCACHEFS_BKEY_METHODS_H
|
|
|
|
#include "bkey.h"
|
|
|
|
struct bch_fs;
|
|
struct btree;
|
|
struct bkey;
|
|
enum btree_node_type;
|
|
|
|
extern const char * const bch2_bkey_types[];
|
|
|
|
enum merge_result {
|
|
BCH_MERGE_NOMERGE,
|
|
|
|
/*
|
|
* The keys were mergeable, but would have overflowed size - so instead
|
|
* l was changed to the maximum size, and both keys were modified:
|
|
*/
|
|
BCH_MERGE_PARTIAL,
|
|
BCH_MERGE_MERGE,
|
|
};
|
|
|
|
struct bkey_ops {
|
|
/* Returns reason for being invalid if invalid, else NULL: */
|
|
const char * (*key_invalid)(const struct bch_fs *,
|
|
struct bkey_s_c);
|
|
void (*key_debugcheck)(struct bch_fs *, struct bkey_s_c);
|
|
void (*val_to_text)(struct printbuf *, struct bch_fs *,
|
|
struct bkey_s_c);
|
|
void (*swab)(struct bkey_s);
|
|
bool (*key_normalize)(struct bch_fs *, struct bkey_s);
|
|
enum merge_result (*key_merge)(struct bch_fs *,
|
|
struct bkey_s, struct bkey_s);
|
|
void (*compat)(enum btree_id id, unsigned version,
|
|
unsigned big_endian, int write,
|
|
struct bkey_s);
|
|
};
|
|
|
|
const char *bch2_bkey_val_invalid(struct bch_fs *, struct bkey_s_c);
|
|
const char *__bch2_bkey_invalid(struct bch_fs *, struct bkey_s_c,
|
|
enum btree_node_type);
|
|
const char *bch2_bkey_invalid(struct bch_fs *, struct bkey_s_c,
|
|
enum btree_node_type);
|
|
const char *bch2_bkey_in_btree_node(struct btree *, struct bkey_s_c);
|
|
|
|
void bch2_bkey_debugcheck(struct bch_fs *, struct btree *, struct bkey_s_c);
|
|
|
|
void bch2_bpos_to_text(struct printbuf *, struct bpos);
|
|
void bch2_bkey_to_text(struct printbuf *, const struct bkey *);
|
|
void bch2_val_to_text(struct printbuf *, struct bch_fs *,
|
|
struct bkey_s_c);
|
|
void bch2_bkey_val_to_text(struct printbuf *, struct bch_fs *,
|
|
struct bkey_s_c);
|
|
|
|
void bch2_bkey_swab_val(struct bkey_s);
|
|
|
|
bool bch2_bkey_normalize(struct bch_fs *, struct bkey_s);
|
|
|
|
enum merge_result bch2_bkey_merge(struct bch_fs *,
|
|
struct bkey_s, struct bkey_s);
|
|
|
|
void bch2_bkey_renumber(enum btree_node_type, struct bkey_packed *, int);
|
|
|
|
void __bch2_bkey_compat(unsigned, enum btree_id, unsigned, unsigned,
|
|
int, struct bkey_format *, struct bkey_packed *);
|
|
|
|
static inline void bch2_bkey_compat(unsigned level, enum btree_id btree_id,
|
|
unsigned version, unsigned big_endian,
|
|
int write,
|
|
struct bkey_format *f,
|
|
struct bkey_packed *k)
|
|
{
|
|
if (version < bcachefs_metadata_version_current ||
|
|
big_endian != CPU_BIG_ENDIAN)
|
|
__bch2_bkey_compat(level, btree_id, version,
|
|
big_endian, write, f, k);
|
|
|
|
}
|
|
|
|
#endif /* _BCACHEFS_BKEY_METHODS_H */
|