mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git
synced 2024-09-18 00:24:39 +00:00
990d42d187
We have two radix trees of stripes - one that mirrors some information from the stripes btree in normal operation, and another that GC uses to recalculate block usage counts. The normal one is now only used for finding partially empty stripes in order to reuse them - the normal stripes radix tree and the GC stripes radix tree are used significantly differently, so this patch splits them into separate types. In an upcoming patch we'll be replacing c->stripes with a btree that indexes stripes by the order we want to reuse them. Signed-off-by: Kent Overstreet <kent.overstreet@gmail.com>
46 lines
896 B
C
46 lines
896 B
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef _BCACHEFS_EC_TYPES_H
|
|
#define _BCACHEFS_EC_TYPES_H
|
|
|
|
#include <linux/llist.h>
|
|
|
|
struct bch_replicas_padded {
|
|
struct bch_replicas_entry e;
|
|
u8 pad[BCH_BKEY_PTRS_MAX];
|
|
};
|
|
|
|
struct stripe {
|
|
size_t heap_idx;
|
|
|
|
u16 sectors;
|
|
u8 algorithm;
|
|
|
|
u8 nr_blocks;
|
|
u8 nr_redundant;
|
|
|
|
unsigned alive:1; /* does a corresponding key exist in stripes btree? */
|
|
unsigned on_heap:1;
|
|
u8 blocks_nonempty;
|
|
};
|
|
|
|
struct gc_stripe {
|
|
u16 sectors;
|
|
|
|
u8 nr_blocks;
|
|
u8 nr_redundant;
|
|
|
|
unsigned alive:1; /* does a corresponding key exist in stripes btree? */
|
|
u16 block_sectors[BCH_BKEY_PTRS_MAX];
|
|
struct bch_extent_ptr ptrs[BCH_BKEY_PTRS_MAX];
|
|
|
|
struct bch_replicas_padded r;
|
|
};
|
|
|
|
struct ec_stripe_heap_entry {
|
|
size_t idx;
|
|
unsigned blocks_nonempty;
|
|
};
|
|
|
|
typedef HEAP(struct ec_stripe_heap_entry) ec_stripes_heap;
|
|
|
|
#endif /* _BCACHEFS_EC_TYPES_H */
|