2017-03-17 06:18:50 +00:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
|
|
|
#ifndef _BCACHEFS_EXTENTS_H
|
|
|
|
#define _BCACHEFS_EXTENTS_H
|
|
|
|
|
|
|
|
#include "bcachefs.h"
|
|
|
|
#include "bkey.h"
|
|
|
|
#include "extents_types.h"
|
|
|
|
|
|
|
|
struct bch_fs;
|
2019-03-14 02:44:04 +00:00
|
|
|
struct btree_trans;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
/* extent entries: */
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-07-25 17:52:14 +00:00
|
|
|
#define extent_entry_last(_e) \
|
|
|
|
((typeof(&(_e).v->start[0])) bkey_val_end(_e))
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
#define entry_to_ptr(_entry) \
|
|
|
|
({ \
|
|
|
|
EBUG_ON((_entry) && !extent_entry_is_ptr(_entry)); \
|
|
|
|
\
|
|
|
|
__builtin_choose_expr( \
|
|
|
|
type_is_exact(_entry, const union bch_extent_entry *), \
|
|
|
|
(const struct bch_extent_ptr *) (_entry), \
|
|
|
|
(struct bch_extent_ptr *) (_entry)); \
|
|
|
|
})
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
/* downcast, preserves const */
|
|
|
|
#define to_entry(_entry) \
|
|
|
|
({ \
|
|
|
|
BUILD_BUG_ON(!type_is(_entry, union bch_extent_crc *) && \
|
|
|
|
!type_is(_entry, struct bch_extent_ptr *) && \
|
|
|
|
!type_is(_entry, struct bch_extent_stripe_ptr *)); \
|
|
|
|
\
|
|
|
|
__builtin_choose_expr( \
|
|
|
|
(type_is_exact(_entry, const union bch_extent_crc *) || \
|
|
|
|
type_is_exact(_entry, const struct bch_extent_ptr *) ||\
|
|
|
|
type_is_exact(_entry, const struct bch_extent_stripe_ptr *)),\
|
|
|
|
(const union bch_extent_entry *) (_entry), \
|
|
|
|
(union bch_extent_entry *) (_entry)); \
|
|
|
|
})
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
#define extent_entry_next(_entry) \
|
|
|
|
((typeof(_entry)) ((void *) (_entry) + extent_entry_bytes(_entry)))
|
|
|
|
|
2017-03-17 06:18:50 +00:00
|
|
|
static inline unsigned
|
|
|
|
__extent_entry_type(const union bch_extent_entry *e)
|
|
|
|
{
|
|
|
|
return e->type ? __ffs(e->type) : BCH_EXTENT_ENTRY_MAX;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline enum bch_extent_entry_type
|
|
|
|
extent_entry_type(const union bch_extent_entry *e)
|
|
|
|
{
|
|
|
|
int ret = __ffs(e->type);
|
|
|
|
|
|
|
|
EBUG_ON(ret < 0 || ret >= BCH_EXTENT_ENTRY_MAX);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline size_t extent_entry_bytes(const union bch_extent_entry *entry)
|
|
|
|
{
|
|
|
|
switch (extent_entry_type(entry)) {
|
2018-09-30 22:39:20 +00:00
|
|
|
#define x(f, n) \
|
|
|
|
case BCH_EXTENT_ENTRY_##f: \
|
|
|
|
return sizeof(struct bch_extent_##f);
|
|
|
|
BCH_EXTENT_ENTRY_TYPES()
|
|
|
|
#undef x
|
2017-03-17 06:18:50 +00:00
|
|
|
default:
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline size_t extent_entry_u64s(const union bch_extent_entry *entry)
|
|
|
|
{
|
|
|
|
return extent_entry_bytes(entry) / sizeof(u64);
|
|
|
|
}
|
|
|
|
|
2023-02-22 22:57:59 +00:00
|
|
|
static inline void __extent_entry_insert(struct bkey_i *k,
|
|
|
|
union bch_extent_entry *dst,
|
|
|
|
union bch_extent_entry *new)
|
|
|
|
{
|
|
|
|
union bch_extent_entry *end = bkey_val_end(bkey_i_to_s(k));
|
|
|
|
|
|
|
|
memmove_u64s_up_small((u64 *) dst + extent_entry_u64s(new),
|
|
|
|
dst, (u64 *) end - (u64 *) dst);
|
|
|
|
k->k.u64s += extent_entry_u64s(new);
|
|
|
|
memcpy_u64s_small(dst, new, extent_entry_u64s(new));
|
|
|
|
}
|
|
|
|
|
2017-03-17 06:18:50 +00:00
|
|
|
static inline bool extent_entry_is_ptr(const union bch_extent_entry *e)
|
|
|
|
{
|
2021-10-13 17:12:26 +00:00
|
|
|
return extent_entry_type(e) == BCH_EXTENT_ENTRY_ptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline bool extent_entry_is_stripe_ptr(const union bch_extent_entry *e)
|
|
|
|
{
|
|
|
|
return extent_entry_type(e) == BCH_EXTENT_ENTRY_stripe_ptr;
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline bool extent_entry_is_crc(const union bch_extent_entry *e)
|
|
|
|
{
|
2018-09-28 01:08:39 +00:00
|
|
|
switch (extent_entry_type(e)) {
|
|
|
|
case BCH_EXTENT_ENTRY_crc32:
|
|
|
|
case BCH_EXTENT_ENTRY_crc64:
|
|
|
|
case BCH_EXTENT_ENTRY_crc128:
|
|
|
|
return true;
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
union bch_extent_crc {
|
|
|
|
u8 type;
|
|
|
|
struct bch_extent_crc32 crc32;
|
|
|
|
struct bch_extent_crc64 crc64;
|
|
|
|
struct bch_extent_crc128 crc128;
|
|
|
|
};
|
|
|
|
|
|
|
|
#define __entry_to_crc(_entry) \
|
|
|
|
__builtin_choose_expr( \
|
|
|
|
type_is_exact(_entry, const union bch_extent_entry *), \
|
|
|
|
(const union bch_extent_crc *) (_entry), \
|
|
|
|
(union bch_extent_crc *) (_entry))
|
|
|
|
|
|
|
|
#define entry_to_crc(_entry) \
|
|
|
|
({ \
|
|
|
|
EBUG_ON((_entry) && !extent_entry_is_crc(_entry)); \
|
|
|
|
\
|
|
|
|
__entry_to_crc(_entry); \
|
|
|
|
})
|
|
|
|
|
|
|
|
static inline struct bch_extent_crc_unpacked
|
|
|
|
bch2_extent_crc_unpack(const struct bkey *k, const union bch_extent_crc *crc)
|
|
|
|
{
|
|
|
|
#define common_fields(_crc) \
|
|
|
|
.csum_type = _crc.csum_type, \
|
|
|
|
.compression_type = _crc.compression_type, \
|
|
|
|
.compressed_size = _crc._compressed_size + 1, \
|
|
|
|
.uncompressed_size = _crc._uncompressed_size + 1, \
|
|
|
|
.offset = _crc.offset, \
|
|
|
|
.live_size = k->size
|
|
|
|
|
2018-10-02 20:40:12 +00:00
|
|
|
if (!crc)
|
2017-03-17 06:18:50 +00:00
|
|
|
return (struct bch_extent_crc_unpacked) {
|
|
|
|
.compressed_size = k->size,
|
|
|
|
.uncompressed_size = k->size,
|
|
|
|
.live_size = k->size,
|
|
|
|
};
|
2018-10-02 20:40:12 +00:00
|
|
|
|
|
|
|
switch (extent_entry_type(to_entry(crc))) {
|
|
|
|
case BCH_EXTENT_ENTRY_crc32: {
|
2017-03-17 06:18:50 +00:00
|
|
|
struct bch_extent_crc_unpacked ret = (struct bch_extent_crc_unpacked) {
|
|
|
|
common_fields(crc->crc32),
|
|
|
|
};
|
|
|
|
|
|
|
|
*((__le32 *) &ret.csum.lo) = crc->crc32.csum;
|
|
|
|
|
|
|
|
memcpy(&ret.csum.lo, &crc->crc32.csum,
|
|
|
|
sizeof(crc->crc32.csum));
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2018-10-02 20:40:12 +00:00
|
|
|
case BCH_EXTENT_ENTRY_crc64: {
|
2017-03-17 06:18:50 +00:00
|
|
|
struct bch_extent_crc_unpacked ret = (struct bch_extent_crc_unpacked) {
|
|
|
|
common_fields(crc->crc64),
|
|
|
|
.nonce = crc->crc64.nonce,
|
|
|
|
.csum.lo = (__force __le64) crc->crc64.csum_lo,
|
|
|
|
};
|
|
|
|
|
|
|
|
*((__le16 *) &ret.csum.hi) = crc->crc64.csum_hi;
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2018-10-02 20:40:12 +00:00
|
|
|
case BCH_EXTENT_ENTRY_crc128: {
|
2017-03-17 06:18:50 +00:00
|
|
|
struct bch_extent_crc_unpacked ret = (struct bch_extent_crc_unpacked) {
|
|
|
|
common_fields(crc->crc128),
|
|
|
|
.nonce = crc->crc128.nonce,
|
|
|
|
.csum = crc->crc128.csum,
|
|
|
|
};
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
#undef common_fields
|
|
|
|
}
|
|
|
|
|
2018-02-23 21:26:10 +00:00
|
|
|
static inline bool crc_is_compressed(struct bch_extent_crc_unpacked crc)
|
|
|
|
{
|
|
|
|
return (crc.compression_type != BCH_COMPRESSION_TYPE_none &&
|
|
|
|
crc.compression_type != BCH_COMPRESSION_TYPE_incompressible);
|
|
|
|
}
|
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
/* bkey_ptrs: generically over any key type that has ptrs */
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
struct bkey_ptrs_c {
|
|
|
|
const union bch_extent_entry *start;
|
|
|
|
const union bch_extent_entry *end;
|
|
|
|
};
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
struct bkey_ptrs {
|
|
|
|
union bch_extent_entry *start;
|
|
|
|
union bch_extent_entry *end;
|
|
|
|
};
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
static inline struct bkey_ptrs_c bch2_bkey_ptrs_c(struct bkey_s_c k)
|
|
|
|
{
|
|
|
|
switch (k.k->type) {
|
|
|
|
case KEY_TYPE_btree_ptr: {
|
|
|
|
struct bkey_s_c_btree_ptr e = bkey_s_c_to_btree_ptr(k);
|
2022-10-22 19:59:53 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
return (struct bkey_ptrs_c) {
|
|
|
|
to_entry(&e.v->start[0]),
|
|
|
|
to_entry(extent_entry_last(e))
|
|
|
|
};
|
|
|
|
}
|
|
|
|
case KEY_TYPE_extent: {
|
|
|
|
struct bkey_s_c_extent e = bkey_s_c_to_extent(k);
|
2022-10-22 19:59:53 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
return (struct bkey_ptrs_c) {
|
|
|
|
e.v->start,
|
|
|
|
extent_entry_last(e)
|
|
|
|
};
|
|
|
|
}
|
|
|
|
case KEY_TYPE_stripe: {
|
|
|
|
struct bkey_s_c_stripe s = bkey_s_c_to_stripe(k);
|
2022-10-22 19:59:53 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
return (struct bkey_ptrs_c) {
|
|
|
|
to_entry(&s.v->ptrs[0]),
|
|
|
|
to_entry(&s.v->ptrs[s.v->nr_blocks]),
|
|
|
|
};
|
|
|
|
}
|
|
|
|
case KEY_TYPE_reflink_v: {
|
|
|
|
struct bkey_s_c_reflink_v r = bkey_s_c_to_reflink_v(k);
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
return (struct bkey_ptrs_c) {
|
|
|
|
r.v->start,
|
|
|
|
bkey_val_end(r),
|
|
|
|
};
|
|
|
|
}
|
2020-02-07 18:38:02 +00:00
|
|
|
case KEY_TYPE_btree_ptr_v2: {
|
|
|
|
struct bkey_s_c_btree_ptr_v2 e = bkey_s_c_to_btree_ptr_v2(k);
|
2022-10-22 19:59:53 +00:00
|
|
|
|
2020-02-07 18:38:02 +00:00
|
|
|
return (struct bkey_ptrs_c) {
|
|
|
|
to_entry(&e.v->start[0]),
|
|
|
|
to_entry(extent_entry_last(e))
|
|
|
|
};
|
|
|
|
}
|
2019-11-16 21:25:58 +00:00
|
|
|
default:
|
|
|
|
return (struct bkey_ptrs_c) { NULL, NULL };
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline struct bkey_ptrs bch2_bkey_ptrs(struct bkey_s k)
|
|
|
|
{
|
|
|
|
struct bkey_ptrs_c p = bch2_bkey_ptrs_c(k.s_c);
|
|
|
|
|
|
|
|
return (struct bkey_ptrs) {
|
|
|
|
(void *) p.start,
|
|
|
|
(void *) p.end
|
|
|
|
};
|
|
|
|
}
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
#define __bkey_extent_entry_for_each_from(_start, _end, _entry) \
|
|
|
|
for ((_entry) = (_start); \
|
|
|
|
(_entry) < (_end); \
|
|
|
|
(_entry) = extent_entry_next(_entry))
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
#define __bkey_ptr_next(_ptr, _end) \
|
2017-03-17 06:18:50 +00:00
|
|
|
({ \
|
2018-11-01 19:10:01 +00:00
|
|
|
typeof(_end) _entry; \
|
2017-03-17 06:18:50 +00:00
|
|
|
\
|
2018-11-01 19:10:01 +00:00
|
|
|
__bkey_extent_entry_for_each_from(to_entry(_ptr), _end, _entry) \
|
2018-09-28 01:08:39 +00:00
|
|
|
if (extent_entry_is_ptr(_entry)) \
|
|
|
|
break; \
|
2017-03-17 06:18:50 +00:00
|
|
|
\
|
2018-11-01 19:10:01 +00:00
|
|
|
_entry < (_end) ? entry_to_ptr(_entry) : NULL; \
|
2017-03-17 06:18:50 +00:00
|
|
|
})
|
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
#define bkey_extent_entry_for_each_from(_p, _entry, _start) \
|
|
|
|
__bkey_extent_entry_for_each_from(_start, (_p).end, _entry)
|
2018-09-28 01:08:39 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
#define bkey_extent_entry_for_each(_p, _entry) \
|
|
|
|
bkey_extent_entry_for_each_from(_p, _entry, _p.start)
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
#define __bkey_for_each_ptr(_start, _end, _ptr) \
|
|
|
|
for ((_ptr) = (_start); \
|
|
|
|
((_ptr) = __bkey_ptr_next(_ptr, _end)); \
|
|
|
|
(_ptr)++)
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
#define bkey_ptr_next(_p, _ptr) \
|
|
|
|
__bkey_ptr_next(_ptr, (_p).end)
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
#define bkey_for_each_ptr(_p, _ptr) \
|
|
|
|
__bkey_for_each_ptr(&(_p).start->ptr, (_p).end, _ptr)
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
#define __bkey_ptr_next_decode(_k, _end, _ptr, _entry) \
|
2017-03-17 06:18:50 +00:00
|
|
|
({ \
|
|
|
|
__label__ out; \
|
|
|
|
\
|
2018-11-01 19:13:19 +00:00
|
|
|
(_ptr).idx = 0; \
|
2019-10-08 22:45:29 +00:00
|
|
|
(_ptr).has_ec = false; \
|
2018-11-01 19:13:19 +00:00
|
|
|
\
|
2018-11-01 19:10:01 +00:00
|
|
|
__bkey_extent_entry_for_each_from(_entry, _end, _entry) \
|
2018-09-28 01:08:39 +00:00
|
|
|
switch (extent_entry_type(_entry)) { \
|
|
|
|
case BCH_EXTENT_ENTRY_ptr: \
|
|
|
|
(_ptr).ptr = _entry->ptr; \
|
2017-03-17 06:18:50 +00:00
|
|
|
goto out; \
|
2018-09-28 01:08:39 +00:00
|
|
|
case BCH_EXTENT_ENTRY_crc32: \
|
|
|
|
case BCH_EXTENT_ENTRY_crc64: \
|
|
|
|
case BCH_EXTENT_ENTRY_crc128: \
|
2018-11-01 19:10:01 +00:00
|
|
|
(_ptr).crc = bch2_extent_crc_unpack(_k, \
|
2018-09-28 01:08:39 +00:00
|
|
|
entry_to_crc(_entry)); \
|
|
|
|
break; \
|
2018-11-01 19:13:19 +00:00
|
|
|
case BCH_EXTENT_ENTRY_stripe_ptr: \
|
2019-10-08 22:45:29 +00:00
|
|
|
(_ptr).ec = _entry->stripe_ptr; \
|
|
|
|
(_ptr).has_ec = true; \
|
2018-11-01 19:13:19 +00:00
|
|
|
break; \
|
2017-03-17 06:18:50 +00:00
|
|
|
} \
|
|
|
|
out: \
|
2018-11-01 19:10:01 +00:00
|
|
|
_entry < (_end); \
|
2017-03-17 06:18:50 +00:00
|
|
|
})
|
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
#define __bkey_for_each_ptr_decode(_k, _start, _end, _ptr, _entry) \
|
|
|
|
for ((_ptr).crc = bch2_extent_crc_unpack(_k, NULL), \
|
|
|
|
(_entry) = _start; \
|
|
|
|
__bkey_ptr_next_decode(_k, _end, _ptr, _entry); \
|
2018-09-28 01:08:39 +00:00
|
|
|
(_entry) = extent_entry_next(_entry))
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
#define bkey_for_each_ptr_decode(_k, _p, _ptr, _entry) \
|
|
|
|
__bkey_for_each_ptr_decode(_k, (_p).start, (_p).end, \
|
|
|
|
_ptr, _entry)
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-07-25 17:52:14 +00:00
|
|
|
#define bkey_crc_next(_k, _start, _end, _crc, _iter) \
|
|
|
|
({ \
|
|
|
|
__bkey_extent_entry_for_each_from(_iter, _end, _iter) \
|
|
|
|
if (extent_entry_is_crc(_iter)) { \
|
|
|
|
(_crc) = bch2_extent_crc_unpack(_k, \
|
|
|
|
entry_to_crc(_iter)); \
|
|
|
|
break; \
|
|
|
|
} \
|
|
|
|
\
|
|
|
|
(_iter) < (_end); \
|
|
|
|
})
|
|
|
|
|
|
|
|
#define __bkey_for_each_crc(_k, _start, _end, _crc, _iter) \
|
|
|
|
for ((_crc) = bch2_extent_crc_unpack(_k, NULL), \
|
|
|
|
(_iter) = (_start); \
|
|
|
|
bkey_crc_next(_k, _start, _end, _crc, _iter); \
|
|
|
|
(_iter) = extent_entry_next(_iter))
|
|
|
|
|
|
|
|
#define bkey_for_each_crc(_k, _p, _crc, _iter) \
|
|
|
|
__bkey_for_each_crc(_k, (_p).start, (_p).end, _crc, _iter)
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
/* Iterate over pointers in KEY_TYPE_extent: */
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
#define extent_for_each_entry_from(_e, _entry, _start) \
|
|
|
|
__bkey_extent_entry_for_each_from(_start, \
|
2022-10-22 19:59:53 +00:00
|
|
|
extent_entry_last(_e), _entry)
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
#define extent_for_each_entry(_e, _entry) \
|
|
|
|
extent_for_each_entry_from(_e, _entry, (_e).v->start)
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
#define extent_ptr_next(_e, _ptr) \
|
|
|
|
__bkey_ptr_next(_ptr, extent_entry_last(_e))
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
#define extent_for_each_ptr(_e, _ptr) \
|
|
|
|
__bkey_for_each_ptr(&(_e).v->start->ptr, extent_entry_last(_e), _ptr)
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
#define extent_for_each_ptr_decode(_e, _ptr, _entry) \
|
|
|
|
__bkey_for_each_ptr_decode((_e).k, (_e).v->start, \
|
|
|
|
extent_entry_last(_e), _ptr, _entry)
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
/* utility code common to all keys with pointers: */
|
2018-11-01 19:10:01 +00:00
|
|
|
|
|
|
|
void bch2_mark_io_failure(struct bch_io_failures *,
|
|
|
|
struct extent_ptr_decoded *);
|
|
|
|
int bch2_bkey_pick_read_device(struct bch_fs *, struct bkey_s_c,
|
|
|
|
struct bch_io_failures *,
|
|
|
|
struct extent_ptr_decoded *);
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
/* KEY_TYPE_btree_ptr: */
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2022-12-21 00:58:16 +00:00
|
|
|
int bch2_btree_ptr_invalid(const struct bch_fs *, struct bkey_s_c, unsigned, struct printbuf *);
|
2018-11-01 19:10:01 +00:00
|
|
|
void bch2_btree_ptr_to_text(struct printbuf *, struct bch_fs *,
|
|
|
|
struct bkey_s_c);
|
2020-03-31 20:25:30 +00:00
|
|
|
|
2022-12-21 00:58:16 +00:00
|
|
|
int bch2_btree_ptr_v2_invalid(const struct bch_fs *, struct bkey_s_c, unsigned, struct printbuf *);
|
2022-04-03 21:50:01 +00:00
|
|
|
void bch2_btree_ptr_v2_to_text(struct printbuf *, struct bch_fs *, struct bkey_s_c);
|
2020-01-07 18:29:32 +00:00
|
|
|
void bch2_btree_ptr_v2_compat(enum btree_id, unsigned, unsigned,
|
|
|
|
int, struct bkey_s);
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2022-10-22 19:59:53 +00:00
|
|
|
#define bch2_bkey_ops_btree_ptr ((struct bkey_ops) { \
|
2018-11-01 19:10:01 +00:00
|
|
|
.key_invalid = bch2_btree_ptr_invalid, \
|
|
|
|
.val_to_text = bch2_btree_ptr_to_text, \
|
|
|
|
.swab = bch2_ptr_swab, \
|
2022-03-13 05:26:52 +00:00
|
|
|
.trans_trigger = bch2_trans_mark_extent, \
|
|
|
|
.atomic_trigger = bch2_mark_extent, \
|
2022-10-22 19:59:53 +00:00
|
|
|
})
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2022-10-22 19:59:53 +00:00
|
|
|
#define bch2_bkey_ops_btree_ptr_v2 ((struct bkey_ops) { \
|
2021-03-22 21:23:30 +00:00
|
|
|
.key_invalid = bch2_btree_ptr_v2_invalid, \
|
2020-03-31 20:25:30 +00:00
|
|
|
.val_to_text = bch2_btree_ptr_v2_to_text, \
|
2020-02-07 18:38:02 +00:00
|
|
|
.swab = bch2_ptr_swab, \
|
2020-01-07 18:29:32 +00:00
|
|
|
.compat = bch2_btree_ptr_v2_compat, \
|
2022-03-13 05:26:52 +00:00
|
|
|
.trans_trigger = bch2_trans_mark_extent, \
|
|
|
|
.atomic_trigger = bch2_mark_extent, \
|
2023-04-29 17:24:18 +00:00
|
|
|
.min_val_size = 40, \
|
2022-10-22 19:59:53 +00:00
|
|
|
})
|
2020-02-07 18:38:02 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
/* KEY_TYPE_extent: */
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2021-04-29 03:49:30 +00:00
|
|
|
bool bch2_extent_merge(struct bch_fs *, struct bkey_s, struct bkey_s_c);
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2022-10-22 19:59:53 +00:00
|
|
|
#define bch2_bkey_ops_extent ((struct bkey_ops) { \
|
2022-04-03 21:50:01 +00:00
|
|
|
.key_invalid = bch2_bkey_ptrs_invalid, \
|
|
|
|
.val_to_text = bch2_bkey_ptrs_to_text, \
|
2018-11-01 19:10:01 +00:00
|
|
|
.swab = bch2_ptr_swab, \
|
|
|
|
.key_normalize = bch2_extent_normalize, \
|
|
|
|
.key_merge = bch2_extent_merge, \
|
2022-03-13 05:26:52 +00:00
|
|
|
.trans_trigger = bch2_trans_mark_extent, \
|
|
|
|
.atomic_trigger = bch2_mark_extent, \
|
2022-10-22 19:59:53 +00:00
|
|
|
})
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
/* KEY_TYPE_reservation: */
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2022-04-04 01:50:25 +00:00
|
|
|
int bch2_reservation_invalid(const struct bch_fs *, struct bkey_s_c,
|
2022-12-21 00:58:16 +00:00
|
|
|
unsigned, struct printbuf *);
|
2018-11-01 19:10:01 +00:00
|
|
|
void bch2_reservation_to_text(struct printbuf *, struct bch_fs *, struct bkey_s_c);
|
2021-04-29 03:49:30 +00:00
|
|
|
bool bch2_reservation_merge(struct bch_fs *, struct bkey_s, struct bkey_s_c);
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2022-10-22 19:59:53 +00:00
|
|
|
#define bch2_bkey_ops_reservation ((struct bkey_ops) { \
|
2018-11-01 19:10:01 +00:00
|
|
|
.key_invalid = bch2_reservation_invalid, \
|
|
|
|
.val_to_text = bch2_reservation_to_text, \
|
|
|
|
.key_merge = bch2_reservation_merge, \
|
2022-03-13 05:26:52 +00:00
|
|
|
.trans_trigger = bch2_trans_mark_reservation, \
|
|
|
|
.atomic_trigger = bch2_mark_reservation, \
|
2023-04-29 17:24:18 +00:00
|
|
|
.min_val_size = 8, \
|
2022-10-22 19:59:53 +00:00
|
|
|
})
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
/* Extent checksum entries: */
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
bool bch2_can_narrow_extent_crcs(struct bkey_s_c,
|
|
|
|
struct bch_extent_crc_unpacked);
|
|
|
|
bool bch2_bkey_narrow_crcs(struct bkey_i *, struct bch_extent_crc_unpacked);
|
|
|
|
void bch2_extent_crc_append(struct bkey_i *,
|
|
|
|
struct bch_extent_crc_unpacked);
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
/* Generic code for keys with pointers: */
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2021-06-11 01:44:27 +00:00
|
|
|
static inline bool bkey_is_btree_ptr(const struct bkey *k)
|
|
|
|
{
|
|
|
|
switch (k->type) {
|
|
|
|
case KEY_TYPE_btree_ptr:
|
|
|
|
case KEY_TYPE_btree_ptr_v2:
|
|
|
|
return true;
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-09-07 20:13:20 +00:00
|
|
|
static inline bool bkey_extent_is_direct_data(const struct bkey *k)
|
2018-11-01 19:10:01 +00:00
|
|
|
{
|
|
|
|
switch (k->type) {
|
|
|
|
case KEY_TYPE_btree_ptr:
|
2020-02-07 18:38:02 +00:00
|
|
|
case KEY_TYPE_btree_ptr_v2:
|
2018-11-01 19:10:01 +00:00
|
|
|
case KEY_TYPE_extent:
|
2019-08-16 13:59:56 +00:00
|
|
|
case KEY_TYPE_reflink_v:
|
2018-11-01 19:10:01 +00:00
|
|
|
return true;
|
2017-03-17 06:18:50 +00:00
|
|
|
default:
|
2018-11-01 19:10:01 +00:00
|
|
|
return false;
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-10-24 23:51:34 +00:00
|
|
|
static inline bool bkey_extent_is_inline_data(const struct bkey *k)
|
|
|
|
{
|
|
|
|
return k->type == KEY_TYPE_inline_data ||
|
|
|
|
k->type == KEY_TYPE_indirect_inline_data;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline unsigned bkey_inline_data_offset(const struct bkey *k)
|
|
|
|
{
|
|
|
|
switch (k->type) {
|
|
|
|
case KEY_TYPE_inline_data:
|
|
|
|
return sizeof(struct bch_inline_data);
|
|
|
|
case KEY_TYPE_indirect_inline_data:
|
|
|
|
return sizeof(struct bch_indirect_inline_data);
|
|
|
|
default:
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline unsigned bkey_inline_data_bytes(const struct bkey *k)
|
|
|
|
{
|
|
|
|
return bkey_val_bytes(k) - bkey_inline_data_offset(k);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define bkey_inline_data_p(_k) (((void *) (_k).v) + bkey_inline_data_offset((_k).k))
|
|
|
|
|
2019-09-07 20:13:20 +00:00
|
|
|
static inline bool bkey_extent_is_data(const struct bkey *k)
|
|
|
|
{
|
2020-10-24 23:51:34 +00:00
|
|
|
return bkey_extent_is_direct_data(k) ||
|
|
|
|
bkey_extent_is_inline_data(k) ||
|
2019-09-07 20:13:20 +00:00
|
|
|
k->type == KEY_TYPE_reflink_p;
|
|
|
|
}
|
|
|
|
|
2019-08-16 13:59:56 +00:00
|
|
|
/*
|
|
|
|
* Should extent be counted under inode->i_sectors?
|
|
|
|
*/
|
2018-11-01 19:10:01 +00:00
|
|
|
static inline bool bkey_extent_is_allocation(const struct bkey *k)
|
2017-03-17 06:18:50 +00:00
|
|
|
{
|
2018-11-01 19:10:01 +00:00
|
|
|
switch (k->type) {
|
|
|
|
case KEY_TYPE_extent:
|
|
|
|
case KEY_TYPE_reservation:
|
2019-08-16 13:59:56 +00:00
|
|
|
case KEY_TYPE_reflink_p:
|
|
|
|
case KEY_TYPE_reflink_v:
|
2019-11-09 21:43:16 +00:00
|
|
|
case KEY_TYPE_inline_data:
|
2020-10-24 23:51:34 +00:00
|
|
|
case KEY_TYPE_indirect_inline_data:
|
2018-11-01 19:10:01 +00:00
|
|
|
return true;
|
2017-03-17 06:18:50 +00:00
|
|
|
default:
|
2018-11-01 19:10:01 +00:00
|
|
|
return false;
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-11-13 23:59:01 +00:00
|
|
|
static inline bool bkey_extent_is_unwritten(struct bkey_s_c k)
|
|
|
|
{
|
|
|
|
struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
|
|
|
|
const struct bch_extent_ptr *ptr;
|
|
|
|
|
|
|
|
bkey_for_each_ptr(ptrs, ptr)
|
|
|
|
if (ptr->unwritten)
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline bool bkey_extent_is_reservation(struct bkey_s_c k)
|
|
|
|
{
|
|
|
|
return k.k->type == KEY_TYPE_reservation ||
|
|
|
|
bkey_extent_is_unwritten(k);
|
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
static inline struct bch_devs_list bch2_bkey_devs(struct bkey_s_c k)
|
|
|
|
{
|
|
|
|
struct bch_devs_list ret = (struct bch_devs_list) { 0 };
|
|
|
|
struct bkey_ptrs_c p = bch2_bkey_ptrs_c(k);
|
|
|
|
const struct bch_extent_ptr *ptr;
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
bkey_for_each_ptr(p, ptr)
|
|
|
|
ret.devs[ret.nr++] = ptr->dev;
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
return ret;
|
|
|
|
}
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
static inline struct bch_devs_list bch2_bkey_dirty_devs(struct bkey_s_c k)
|
|
|
|
{
|
|
|
|
struct bch_devs_list ret = (struct bch_devs_list) { 0 };
|
|
|
|
struct bkey_ptrs_c p = bch2_bkey_ptrs_c(k);
|
|
|
|
const struct bch_extent_ptr *ptr;
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
bkey_for_each_ptr(p, ptr)
|
|
|
|
if (!ptr->cached)
|
|
|
|
ret.devs[ret.nr++] = ptr->dev;
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
return ret;
|
|
|
|
}
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
static inline struct bch_devs_list bch2_bkey_cached_devs(struct bkey_s_c k)
|
|
|
|
{
|
|
|
|
struct bch_devs_list ret = (struct bch_devs_list) { 0 };
|
|
|
|
struct bkey_ptrs_c p = bch2_bkey_ptrs_c(k);
|
|
|
|
const struct bch_extent_ptr *ptr;
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
bkey_for_each_ptr(p, ptr)
|
|
|
|
if (ptr->cached)
|
|
|
|
ret.devs[ret.nr++] = ptr->dev;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2021-05-15 01:28:37 +00:00
|
|
|
static inline unsigned bch2_bkey_ptr_data_type(struct bkey_s_c k, const struct bch_extent_ptr *ptr)
|
|
|
|
{
|
|
|
|
switch (k.k->type) {
|
|
|
|
case KEY_TYPE_btree_ptr:
|
|
|
|
case KEY_TYPE_btree_ptr_v2:
|
|
|
|
return BCH_DATA_btree;
|
|
|
|
case KEY_TYPE_extent:
|
|
|
|
case KEY_TYPE_reflink_v:
|
|
|
|
return BCH_DATA_user;
|
|
|
|
case KEY_TYPE_stripe: {
|
|
|
|
struct bkey_s_c_stripe s = bkey_s_c_to_stripe(k);
|
|
|
|
|
|
|
|
BUG_ON(ptr < s.v->ptrs ||
|
|
|
|
ptr >= s.v->ptrs + s.v->nr_blocks);
|
|
|
|
|
|
|
|
return ptr >= s.v->ptrs + s.v->nr_blocks - s.v->nr_redundant
|
|
|
|
? BCH_DATA_parity
|
|
|
|
: BCH_DATA_user;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
unsigned bch2_bkey_nr_ptrs(struct bkey_s_c);
|
|
|
|
unsigned bch2_bkey_nr_ptrs_allocated(struct bkey_s_c);
|
|
|
|
unsigned bch2_bkey_nr_ptrs_fully_allocated(struct bkey_s_c);
|
2018-02-23 21:26:10 +00:00
|
|
|
bool bch2_bkey_is_incompressible(struct bkey_s_c);
|
2019-11-16 21:25:58 +00:00
|
|
|
unsigned bch2_bkey_sectors_compressed(struct bkey_s_c);
|
bcachefs: Change when we allow overwrites
Originally, we'd check for -ENOSPC when getting a disk reservation
whenever the new extent took up more space on disk than the old extent.
Erasure coding screwed this up, because with erasure coding writes are
initially replicated, and then in the background the extra replicas are
dropped when the stripe is created. This means that with erasure coding
enabled, writes will always take up more space on disk than the data
they're overwriting - but, according to posix, overwrites aren't
supposed to return ENOSPC.
So, in this patch we fudge things: if the new extent has more replicas
than the _effective_ replicas of the old extent, or if the old extent is
compressed and the new one isn't, we check for ENOSPC when getting the
disk reservation - otherwise, we don't.
Signed-off-by: Kent Overstreet <kent.overstreet@gmail.com>
Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
2020-12-15 02:59:33 +00:00
|
|
|
|
|
|
|
unsigned bch2_bkey_replicas(struct bch_fs *, struct bkey_s_c);
|
2023-06-13 19:12:04 +00:00
|
|
|
unsigned bch2_extent_ptr_desired_durability(struct bch_fs *, struct extent_ptr_decoded *);
|
bcachefs: Nocow support
This adds support for nocow mode, where we do writes in-place when
possible. Patch components:
- New boolean filesystem and inode option, nocow: note that when nocow
is enabled, data checksumming and compression are implicitly disabled
- To prevent in-place writes from racing with data moves
(data_update.c) or bucket reuse (i.e. a bucket being reused and
re-allocated while a nocow write is in flight, we have a new locking
mechanism.
Buckets can be locked for either data update or data move, using a
fixed size hash table of two_state_shared locks. We don't have any
chaining, meaning updates and moves to different buckets that hash to
the same lock will wait unnecessarily - we'll want to watch for this
becoming an issue.
- The allocator path also needs to check for in-place writes in flight
to a given bucket before giving it out: thus we add another counter
to bucket_alloc_state so we can track this.
- Fsync now may need to issue cache flushes to block devices instead of
flushing the journal. We add a device bitmask to bch_inode_info,
ei_devs_need_flush, which tracks devices that need to have flushes
issued - note that this will lead to unnecessary flushes when other
codepaths have already issued flushes, we may want to replace this with
a sequence number.
- New nocow write path: look up extents, and if they're writable write
to them - otherwise fall back to the normal COW write path.
XXX: switch to sequence numbers instead of bitmask for devs needing
journal flush
XXX: ei_quota_lock being a mutex means bch2_nocow_write_done() needs to
run in process context - see if we can improve this
Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
2022-11-02 21:12:00 +00:00
|
|
|
unsigned bch2_extent_ptr_durability(struct bch_fs *, struct extent_ptr_decoded *);
|
2019-11-16 21:25:58 +00:00
|
|
|
unsigned bch2_bkey_durability(struct bch_fs *, struct bkey_s_c);
|
|
|
|
|
2022-11-24 23:03:55 +00:00
|
|
|
void bch2_bkey_drop_device(struct bkey_s, unsigned);
|
|
|
|
void bch2_bkey_drop_device_noerror(struct bkey_s, unsigned);
|
2023-03-10 21:28:37 +00:00
|
|
|
|
|
|
|
const struct bch_extent_ptr *bch2_bkey_has_device_c(struct bkey_s_c, unsigned);
|
|
|
|
|
|
|
|
static inline struct bch_extent_ptr *bch2_bkey_has_device(struct bkey_s k, unsigned dev)
|
|
|
|
{
|
|
|
|
return (void *) bch2_bkey_has_device_c(k.s_c, dev);
|
|
|
|
}
|
|
|
|
|
2022-11-24 23:03:55 +00:00
|
|
|
bool bch2_bkey_has_target(struct bch_fs *, struct bkey_s_c, unsigned);
|
|
|
|
|
2021-02-17 18:37:22 +00:00
|
|
|
void bch2_bkey_extent_entry_drop(struct bkey_i *, union bch_extent_entry *);
|
2022-11-24 23:03:55 +00:00
|
|
|
|
|
|
|
static inline void bch2_bkey_append_ptr(struct bkey_i *k, struct bch_extent_ptr ptr)
|
|
|
|
{
|
2023-03-10 21:28:37 +00:00
|
|
|
EBUG_ON(bch2_bkey_has_device(bkey_i_to_s(k), ptr.dev));
|
2022-11-24 23:03:55 +00:00
|
|
|
|
|
|
|
switch (k->k.type) {
|
|
|
|
case KEY_TYPE_btree_ptr:
|
|
|
|
case KEY_TYPE_btree_ptr_v2:
|
|
|
|
case KEY_TYPE_extent:
|
|
|
|
EBUG_ON(bkey_val_u64s(&k->k) >= BKEY_EXTENT_VAL_U64s_MAX);
|
|
|
|
|
|
|
|
ptr.type = 1 << BCH_EXTENT_ENTRY_ptr;
|
|
|
|
|
|
|
|
memcpy((void *) &k->v + bkey_val_bytes(&k->k),
|
|
|
|
&ptr,
|
|
|
|
sizeof(ptr));
|
2023-03-05 04:05:55 +00:00
|
|
|
k->k.u64s++;
|
2022-11-24 23:03:55 +00:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
void bch2_extent_ptr_decoded_append(struct bkey_i *,
|
|
|
|
struct extent_ptr_decoded *);
|
2023-03-10 21:28:37 +00:00
|
|
|
union bch_extent_entry *bch2_bkey_drop_ptr_noerror(struct bkey_s,
|
|
|
|
struct bch_extent_ptr *);
|
2018-11-01 19:10:01 +00:00
|
|
|
union bch_extent_entry *bch2_bkey_drop_ptr(struct bkey_s,
|
|
|
|
struct bch_extent_ptr *);
|
2018-09-30 22:28:23 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
#define bch2_bkey_drop_ptrs(_k, _ptr, _cond) \
|
2018-09-30 22:28:23 +00:00
|
|
|
do { \
|
2018-11-01 19:10:01 +00:00
|
|
|
struct bkey_ptrs _ptrs = bch2_bkey_ptrs(_k); \
|
|
|
|
\
|
|
|
|
_ptr = &_ptrs.start->ptr; \
|
2018-09-30 22:28:23 +00:00
|
|
|
\
|
2018-11-01 19:10:01 +00:00
|
|
|
while ((_ptr = bkey_ptr_next(_ptrs, _ptr))) { \
|
2018-09-30 22:28:23 +00:00
|
|
|
if (_cond) { \
|
2018-11-01 19:10:01 +00:00
|
|
|
_ptr = (void *) bch2_bkey_drop_ptr(_k, _ptr); \
|
|
|
|
_ptrs = bch2_bkey_ptrs(_k); \
|
2018-09-30 22:28:23 +00:00
|
|
|
continue; \
|
|
|
|
} \
|
|
|
|
\
|
|
|
|
(_ptr)++; \
|
|
|
|
} \
|
|
|
|
} while (0)
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
bool bch2_bkey_matches_ptr(struct bch_fs *, struct bkey_s_c,
|
|
|
|
struct bch_extent_ptr, u64);
|
2022-06-13 23:17:45 +00:00
|
|
|
bool bch2_extents_match(struct bkey_s_c, struct bkey_s_c);
|
2023-03-10 21:28:37 +00:00
|
|
|
struct bch_extent_ptr *
|
|
|
|
bch2_extent_has_ptr(struct bkey_s_c, struct extent_ptr_decoded, struct bkey_s);
|
2019-11-16 21:25:58 +00:00
|
|
|
|
2023-02-22 00:22:44 +00:00
|
|
|
void bch2_extent_ptr_set_cached(struct bkey_s, struct bch_extent_ptr *);
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
bool bch2_extent_normalize(struct bch_fs *, struct bkey_s);
|
|
|
|
void bch2_bkey_ptrs_to_text(struct printbuf *, struct bch_fs *,
|
|
|
|
struct bkey_s_c);
|
2022-04-04 01:50:25 +00:00
|
|
|
int bch2_bkey_ptrs_invalid(const struct bch_fs *, struct bkey_s_c,
|
2022-12-21 00:58:16 +00:00
|
|
|
unsigned, struct printbuf *);
|
2019-11-16 21:25:58 +00:00
|
|
|
|
2020-02-07 01:15:15 +00:00
|
|
|
void bch2_ptr_swab(struct bkey_s);
|
2019-11-16 21:25:58 +00:00
|
|
|
|
|
|
|
/* Generic extent code: */
|
|
|
|
|
2021-03-04 21:20:16 +00:00
|
|
|
enum bch_extent_overlap {
|
|
|
|
BCH_EXTENT_OVERLAP_ALL = 0,
|
|
|
|
BCH_EXTENT_OVERLAP_BACK = 1,
|
|
|
|
BCH_EXTENT_OVERLAP_FRONT = 2,
|
|
|
|
BCH_EXTENT_OVERLAP_MIDDLE = 3,
|
|
|
|
};
|
|
|
|
|
|
|
|
/* Returns how k overlaps with m */
|
|
|
|
static inline enum bch_extent_overlap bch2_extent_overlap(const struct bkey *k,
|
|
|
|
const struct bkey *m)
|
|
|
|
{
|
2022-11-24 08:12:22 +00:00
|
|
|
int cmp1 = bkey_lt(k->p, m->p);
|
|
|
|
int cmp2 = bkey_gt(bkey_start_pos(k), bkey_start_pos(m));
|
2021-03-04 21:20:16 +00:00
|
|
|
|
|
|
|
return (cmp1 << 1) + cmp2;
|
|
|
|
}
|
|
|
|
|
2019-11-10 00:02:48 +00:00
|
|
|
int bch2_cut_front_s(struct bpos, struct bkey_s);
|
|
|
|
int bch2_cut_back_s(struct bpos, struct bkey_s);
|
2018-11-27 23:30:56 +00:00
|
|
|
|
2019-07-18 21:21:21 +00:00
|
|
|
static inline void bch2_cut_front(struct bpos where, struct bkey_i *k)
|
2018-11-27 23:30:56 +00:00
|
|
|
{
|
2019-11-10 00:02:48 +00:00
|
|
|
bch2_cut_front_s(where, bkey_i_to_s(k));
|
2018-11-27 23:30:56 +00:00
|
|
|
}
|
|
|
|
|
2019-11-10 00:02:48 +00:00
|
|
|
static inline void bch2_cut_back(struct bpos where, struct bkey_i *k)
|
|
|
|
{
|
|
|
|
bch2_cut_back_s(where, bkey_i_to_s(k));
|
|
|
|
}
|
2019-08-22 20:07:37 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* bch_key_resize - adjust size of @k
|
|
|
|
*
|
|
|
|
* bkey_start_offset(k) will be preserved, modifies where the extent ends
|
|
|
|
*/
|
|
|
|
static inline void bch2_key_resize(struct bkey *k, unsigned new_size)
|
|
|
|
{
|
|
|
|
k->p.offset -= k->size;
|
|
|
|
k->p.offset += new_size;
|
|
|
|
k->size = new_size;
|
|
|
|
}
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-11-27 23:30:56 +00:00
|
|
|
/*
|
|
|
|
* In extent_sort_fix_overlapping(), insert_fixup_extent(),
|
|
|
|
* extent_merge_inline() - we're modifying keys in place that are packed. To do
|
|
|
|
* that we have to unpack the key, modify the unpacked key - then this
|
|
|
|
* copies/repacks the unpacked to the original as necessary.
|
|
|
|
*/
|
|
|
|
static inline void extent_save(struct btree *b, struct bkey_packed *dst,
|
|
|
|
struct bkey *src)
|
|
|
|
{
|
|
|
|
struct bkey_format *f = &b->format;
|
|
|
|
struct bkey_i *dst_unpacked;
|
|
|
|
|
|
|
|
if ((dst_unpacked = packed_to_bkey(dst)))
|
|
|
|
dst_unpacked->k = *src;
|
|
|
|
else
|
|
|
|
BUG_ON(!bch2_bkey_pack_key(dst, src, f));
|
|
|
|
}
|
|
|
|
|
2017-03-17 06:18:50 +00:00
|
|
|
#endif /* _BCACHEFS_EXTENTS_H */
|