2017-03-17 06:18:50 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
|
|
|
/*
|
|
|
|
* Copyright (C) 2010 Kent Overstreet <kent.overstreet@gmail.com>
|
|
|
|
*
|
|
|
|
* Code for managing the extent btree and dynamically updating the writeback
|
|
|
|
* dirty sector count.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "bcachefs.h"
|
|
|
|
#include "bkey_methods.h"
|
|
|
|
#include "btree_gc.h"
|
2020-01-07 18:29:32 +00:00
|
|
|
#include "btree_io.h"
|
2019-11-15 20:52:28 +00:00
|
|
|
#include "btree_iter.h"
|
2017-03-17 06:18:50 +00:00
|
|
|
#include "buckets.h"
|
|
|
|
#include "checksum.h"
|
|
|
|
#include "debug.h"
|
|
|
|
#include "disk_groups.h"
|
|
|
|
#include "error.h"
|
|
|
|
#include "extents.h"
|
|
|
|
#include "inode.h"
|
|
|
|
#include "journal.h"
|
|
|
|
#include "replicas.h"
|
|
|
|
#include "super.h"
|
|
|
|
#include "super-io.h"
|
|
|
|
#include "trace.h"
|
|
|
|
#include "util.h"
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
static unsigned bch2_crc_field_size_max[] = {
|
|
|
|
[BCH_EXTENT_ENTRY_crc32] = CRC32_SIZE_MAX,
|
|
|
|
[BCH_EXTENT_ENTRY_crc64] = CRC64_SIZE_MAX,
|
|
|
|
[BCH_EXTENT_ENTRY_crc128] = CRC128_SIZE_MAX,
|
|
|
|
};
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
static void bch2_extent_crc_pack(union bch_extent_crc *,
|
|
|
|
struct bch_extent_crc_unpacked,
|
|
|
|
enum bch_extent_entry_type);
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
static struct bch_dev_io_failures *dev_io_failures(struct bch_io_failures *f,
|
|
|
|
unsigned dev)
|
|
|
|
{
|
|
|
|
struct bch_dev_io_failures *i;
|
|
|
|
|
|
|
|
for (i = f->devs; i < f->devs + f->nr; i++)
|
|
|
|
if (i->dev == dev)
|
|
|
|
return i;
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
void bch2_mark_io_failure(struct bch_io_failures *failed,
|
|
|
|
struct extent_ptr_decoded *p)
|
|
|
|
{
|
|
|
|
struct bch_dev_io_failures *f = dev_io_failures(failed, p->ptr.dev);
|
|
|
|
|
|
|
|
if (!f) {
|
|
|
|
BUG_ON(failed->nr >= ARRAY_SIZE(failed->devs));
|
|
|
|
|
|
|
|
f = &failed->devs[failed->nr++];
|
|
|
|
f->dev = p->ptr.dev;
|
|
|
|
f->idx = p->idx;
|
|
|
|
f->nr_failed = 1;
|
|
|
|
f->nr_retries = 0;
|
|
|
|
} else if (p->idx != f->idx) {
|
|
|
|
f->idx = p->idx;
|
|
|
|
f->nr_failed = 1;
|
|
|
|
f->nr_retries = 0;
|
|
|
|
} else {
|
|
|
|
f->nr_failed++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* returns true if p1 is better than p2:
|
|
|
|
*/
|
|
|
|
static inline bool ptr_better(struct bch_fs *c,
|
|
|
|
const struct extent_ptr_decoded p1,
|
|
|
|
const struct extent_ptr_decoded p2)
|
|
|
|
{
|
|
|
|
if (likely(!p1.idx && !p2.idx)) {
|
|
|
|
struct bch_dev *dev1 = bch_dev_bkey_exists(c, p1.ptr.dev);
|
|
|
|
struct bch_dev *dev2 = bch_dev_bkey_exists(c, p2.ptr.dev);
|
|
|
|
|
|
|
|
u64 l1 = atomic64_read(&dev1->cur_latency[READ]);
|
|
|
|
u64 l2 = atomic64_read(&dev2->cur_latency[READ]);
|
|
|
|
|
|
|
|
/* Pick at random, biased in favor of the faster device: */
|
|
|
|
|
|
|
|
return bch2_rand_range(l1 + l2) > l1;
|
|
|
|
}
|
|
|
|
|
2020-11-02 23:20:44 +00:00
|
|
|
if (bch2_force_reconstruct_read)
|
2018-11-01 19:10:01 +00:00
|
|
|
return p1.idx > p2.idx;
|
|
|
|
|
|
|
|
return p1.idx < p2.idx;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This picks a non-stale pointer, preferably from a device other than @avoid.
|
|
|
|
* Avoid can be NULL, meaning pick any. If there are no non-stale pointers to
|
|
|
|
* other devices, it will still pick a pointer from avoid.
|
|
|
|
*/
|
|
|
|
int bch2_bkey_pick_read_device(struct bch_fs *c, struct bkey_s_c k,
|
|
|
|
struct bch_io_failures *failed,
|
|
|
|
struct extent_ptr_decoded *pick)
|
|
|
|
{
|
|
|
|
struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
|
|
|
|
const union bch_extent_entry *entry;
|
|
|
|
struct extent_ptr_decoded p;
|
|
|
|
struct bch_dev_io_failures *f;
|
|
|
|
struct bch_dev *ca;
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
if (k.k->type == KEY_TYPE_error)
|
|
|
|
return -EIO;
|
|
|
|
|
|
|
|
bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
|
|
|
|
ca = bch_dev_bkey_exists(c, p.ptr.dev);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If there are any dirty pointers it's an error if we can't
|
|
|
|
* read:
|
|
|
|
*/
|
|
|
|
if (!ret && !p.ptr.cached)
|
|
|
|
ret = -EIO;
|
|
|
|
|
|
|
|
if (p.ptr.cached && ptr_stale(ca, &p.ptr))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
f = failed ? dev_io_failures(failed, p.ptr.dev) : NULL;
|
|
|
|
if (f)
|
|
|
|
p.idx = f->nr_failed < f->nr_retries
|
|
|
|
? f->idx
|
|
|
|
: f->idx + 1;
|
|
|
|
|
|
|
|
if (!p.idx &&
|
|
|
|
!bch2_dev_is_readable(ca))
|
|
|
|
p.idx++;
|
|
|
|
|
2020-11-02 23:20:44 +00:00
|
|
|
if (bch2_force_reconstruct_read &&
|
2019-10-08 22:45:29 +00:00
|
|
|
!p.idx && p.has_ec)
|
2018-11-01 19:10:01 +00:00
|
|
|
p.idx++;
|
|
|
|
|
2019-10-08 22:45:29 +00:00
|
|
|
if (p.idx >= (unsigned) p.has_ec + 1)
|
2018-11-01 19:10:01 +00:00
|
|
|
continue;
|
|
|
|
|
|
|
|
if (ret > 0 && !ptr_better(c, p, *pick))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
*pick = p;
|
|
|
|
ret = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
/* KEY_TYPE_btree_ptr: */
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
const char *bch2_btree_ptr_invalid(const struct bch_fs *c, struct bkey_s_c k)
|
2018-11-01 19:10:01 +00:00
|
|
|
{
|
2019-11-16 21:25:58 +00:00
|
|
|
if (bkey_val_u64s(k.k) > BKEY_BTREE_PTR_VAL_U64s_MAX)
|
|
|
|
return "value too big";
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
return bch2_bkey_ptrs_invalid(c, k);
|
2018-11-01 19:10:01 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
void bch2_btree_ptr_debugcheck(struct bch_fs *c, struct bkey_s_c k)
|
2019-07-25 17:52:14 +00:00
|
|
|
{
|
|
|
|
struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
|
|
|
|
const struct bch_extent_ptr *ptr;
|
2019-11-16 21:25:58 +00:00
|
|
|
const char *err;
|
|
|
|
char buf[160];
|
|
|
|
struct bucket_mark mark;
|
|
|
|
struct bch_dev *ca;
|
2019-07-25 17:52:14 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (!test_bit(BCH_FS_INITIAL_GC_DONE, &c->flags))
|
|
|
|
return;
|
2019-07-25 17:52:14 +00:00
|
|
|
|
2020-01-04 21:09:52 +00:00
|
|
|
if (!percpu_down_read_trylock(&c->mark_lock))
|
|
|
|
return;
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
bkey_for_each_ptr(ptrs, ptr) {
|
|
|
|
ca = bch_dev_bkey_exists(c, ptr->dev);
|
2019-07-25 17:52:14 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
mark = ptr_bucket_mark(ca, ptr);
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
err = "stale";
|
|
|
|
if (gen_after(mark.gen, ptr->gen))
|
|
|
|
goto err;
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
err = "inconsistent";
|
2020-07-09 22:28:11 +00:00
|
|
|
if (mark.data_type != BCH_DATA_btree ||
|
2019-11-16 21:25:58 +00:00
|
|
|
mark.dirty_sectors < c->opts.btree_node_size)
|
|
|
|
goto err;
|
|
|
|
}
|
2020-01-04 21:09:52 +00:00
|
|
|
out:
|
|
|
|
percpu_up_read(&c->mark_lock);
|
2019-11-16 21:25:58 +00:00
|
|
|
return;
|
|
|
|
err:
|
2020-01-04 21:09:52 +00:00
|
|
|
bch2_fs_inconsistent(c, "%s btree pointer %s: bucket %zi gen %i mark %08x",
|
|
|
|
err, (bch2_bkey_val_to_text(&PBUF(buf), c, k), buf),
|
|
|
|
PTR_BUCKET_NR(ca, ptr),
|
|
|
|
mark.gen, (unsigned) mark.v.counter);
|
|
|
|
goto out;
|
2018-11-01 19:10:01 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
void bch2_btree_ptr_to_text(struct printbuf *out, struct bch_fs *c,
|
|
|
|
struct bkey_s_c k)
|
2018-11-01 19:10:01 +00:00
|
|
|
{
|
2019-11-16 21:25:58 +00:00
|
|
|
bch2_bkey_ptrs_to_text(out, c, k);
|
|
|
|
}
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2020-03-31 20:25:30 +00:00
|
|
|
void bch2_btree_ptr_v2_to_text(struct printbuf *out, struct bch_fs *c,
|
|
|
|
struct bkey_s_c k)
|
|
|
|
{
|
|
|
|
struct bkey_s_c_btree_ptr_v2 bp = bkey_s_c_to_btree_ptr_v2(k);
|
|
|
|
|
2020-06-03 22:27:07 +00:00
|
|
|
pr_buf(out, "seq %llx sectors %u written %u min_key ",
|
2020-03-31 20:25:30 +00:00
|
|
|
le64_to_cpu(bp.v->seq),
|
|
|
|
le16_to_cpu(bp.v->sectors),
|
|
|
|
le16_to_cpu(bp.v->sectors_written));
|
|
|
|
|
|
|
|
bch2_bpos_to_text(out, bp.v->min_key);
|
|
|
|
pr_buf(out, " ");
|
|
|
|
bch2_bkey_ptrs_to_text(out, c, k);
|
|
|
|
}
|
|
|
|
|
2020-01-07 18:29:32 +00:00
|
|
|
void bch2_btree_ptr_v2_compat(enum btree_id btree_id, unsigned version,
|
|
|
|
unsigned big_endian, int write,
|
|
|
|
struct bkey_s k)
|
|
|
|
{
|
|
|
|
struct bkey_s_btree_ptr_v2 bp = bkey_s_to_btree_ptr_v2(k);
|
|
|
|
|
|
|
|
compat_bpos(0, btree_id, version, big_endian, write, &bp.v->min_key);
|
|
|
|
|
|
|
|
if (version < bcachefs_metadata_version_inode_btree_change &&
|
|
|
|
btree_node_type_is_extents(btree_id) &&
|
|
|
|
bkey_cmp(bp.v->min_key, POS_MIN))
|
|
|
|
bp.v->min_key = write
|
|
|
|
? bkey_predecessor(bp.v->min_key)
|
|
|
|
: bkey_successor(bp.v->min_key);
|
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
/* KEY_TYPE_extent: */
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
const char *bch2_extent_invalid(const struct bch_fs *c, struct bkey_s_c k)
|
|
|
|
{
|
|
|
|
return bch2_bkey_ptrs_invalid(c, k);
|
2018-11-01 19:10:01 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
void bch2_extent_debugcheck(struct bch_fs *c, struct bkey_s_c k)
|
2017-03-17 06:18:50 +00:00
|
|
|
{
|
2019-11-16 21:25:58 +00:00
|
|
|
struct bkey_s_c_extent e = bkey_s_c_to_extent(k);
|
2019-08-22 20:23:10 +00:00
|
|
|
const union bch_extent_entry *entry;
|
|
|
|
struct extent_ptr_decoded p;
|
2019-11-16 21:25:58 +00:00
|
|
|
char buf[160];
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2020-01-04 21:09:52 +00:00
|
|
|
if (!test_bit(JOURNAL_REPLAY_DONE, &c->journal.flags) ||
|
|
|
|
!test_bit(BCH_FS_INITIAL_GC_DONE, &c->flags))
|
2019-11-16 21:25:58 +00:00
|
|
|
return;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2020-01-04 21:09:52 +00:00
|
|
|
if (!percpu_down_read_trylock(&c->mark_lock))
|
|
|
|
return;
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
extent_for_each_ptr_decode(e, p, entry) {
|
|
|
|
struct bch_dev *ca = bch_dev_bkey_exists(c, p.ptr.dev);
|
|
|
|
struct bucket_mark mark = ptr_bucket_mark(ca, &p.ptr);
|
|
|
|
unsigned stale = gen_after(mark.gen, p.ptr.gen);
|
|
|
|
unsigned disk_sectors = ptr_disk_sectors(p);
|
|
|
|
unsigned mark_sectors = p.ptr.cached
|
|
|
|
? mark.cached_sectors
|
|
|
|
: mark.dirty_sectors;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2020-01-04 21:09:52 +00:00
|
|
|
bch2_fs_inconsistent_on(stale && !p.ptr.cached, c,
|
|
|
|
"stale dirty pointer (ptr gen %u bucket %u",
|
|
|
|
p.ptr.gen, mark.gen);
|
|
|
|
|
|
|
|
bch2_fs_inconsistent_on(stale > 96, c,
|
|
|
|
"key too stale: %i", stale);
|
|
|
|
|
|
|
|
bch2_fs_inconsistent_on(!stale &&
|
2020-07-09 22:28:11 +00:00
|
|
|
(mark.data_type != BCH_DATA_user ||
|
2020-01-04 21:09:52 +00:00
|
|
|
mark_sectors < disk_sectors), c,
|
|
|
|
"extent pointer not marked: %s:\n"
|
|
|
|
"type %u sectors %u < %u",
|
|
|
|
(bch2_bkey_val_to_text(&PBUF(buf), c, e.s_c), buf),
|
|
|
|
mark.data_type,
|
|
|
|
mark_sectors, disk_sectors);
|
2019-11-16 21:25:58 +00:00
|
|
|
}
|
2020-01-04 21:09:52 +00:00
|
|
|
|
|
|
|
percpu_up_read(&c->mark_lock);
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
void bch2_extent_to_text(struct printbuf *out, struct bch_fs *c,
|
|
|
|
struct bkey_s_c k)
|
2018-11-01 19:13:19 +00:00
|
|
|
{
|
2019-11-16 21:25:58 +00:00
|
|
|
bch2_bkey_ptrs_to_text(out, c, k);
|
2018-11-01 19:13:19 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
enum merge_result bch2_extent_merge(struct bch_fs *c,
|
|
|
|
struct bkey_s _l, struct bkey_s _r)
|
2017-03-17 06:18:50 +00:00
|
|
|
{
|
2019-11-16 21:25:58 +00:00
|
|
|
struct bkey_s_extent l = bkey_s_to_extent(_l);
|
|
|
|
struct bkey_s_extent r = bkey_s_to_extent(_r);
|
|
|
|
union bch_extent_entry *en_l = l.v->start;
|
|
|
|
union bch_extent_entry *en_r = r.v->start;
|
|
|
|
struct bch_extent_crc_unpacked crc_l, crc_r;
|
2018-09-30 22:28:23 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (bkey_val_u64s(l.k) != bkey_val_u64s(r.k))
|
|
|
|
return BCH_MERGE_NOMERGE;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
crc_l = bch2_extent_crc_unpack(l.k, NULL);
|
2018-09-30 22:28:23 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
extent_for_each_entry(l, en_l) {
|
|
|
|
en_r = vstruct_idx(r.v, (u64 *) en_l - l.v->_data);
|
|
|
|
|
|
|
|
if (extent_entry_type(en_l) != extent_entry_type(en_r))
|
|
|
|
return BCH_MERGE_NOMERGE;
|
|
|
|
|
|
|
|
switch (extent_entry_type(en_l)) {
|
|
|
|
case BCH_EXTENT_ENTRY_ptr: {
|
|
|
|
const struct bch_extent_ptr *lp = &en_l->ptr;
|
|
|
|
const struct bch_extent_ptr *rp = &en_r->ptr;
|
|
|
|
struct bch_dev *ca;
|
|
|
|
|
|
|
|
if (lp->offset + crc_l.compressed_size != rp->offset ||
|
|
|
|
lp->dev != rp->dev ||
|
|
|
|
lp->gen != rp->gen)
|
|
|
|
return BCH_MERGE_NOMERGE;
|
|
|
|
|
|
|
|
/* We don't allow extents to straddle buckets: */
|
|
|
|
ca = bch_dev_bkey_exists(c, lp->dev);
|
|
|
|
|
|
|
|
if (PTR_BUCKET_NR(ca, lp) != PTR_BUCKET_NR(ca, rp))
|
|
|
|
return BCH_MERGE_NOMERGE;
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case BCH_EXTENT_ENTRY_stripe_ptr:
|
|
|
|
if (en_l->stripe_ptr.block != en_r->stripe_ptr.block ||
|
|
|
|
en_l->stripe_ptr.idx != en_r->stripe_ptr.idx)
|
|
|
|
return BCH_MERGE_NOMERGE;
|
2018-11-01 19:13:19 +00:00
|
|
|
break;
|
2019-11-16 21:25:58 +00:00
|
|
|
case BCH_EXTENT_ENTRY_crc32:
|
|
|
|
case BCH_EXTENT_ENTRY_crc64:
|
|
|
|
case BCH_EXTENT_ENTRY_crc128:
|
|
|
|
crc_l = bch2_extent_crc_unpack(l.k, entry_to_crc(en_l));
|
|
|
|
crc_r = bch2_extent_crc_unpack(r.k, entry_to_crc(en_r));
|
|
|
|
|
|
|
|
if (crc_l.csum_type != crc_r.csum_type ||
|
|
|
|
crc_l.compression_type != crc_r.compression_type ||
|
|
|
|
crc_l.nonce != crc_r.nonce)
|
|
|
|
return BCH_MERGE_NOMERGE;
|
|
|
|
|
|
|
|
if (crc_l.offset + crc_l.live_size != crc_l.compressed_size ||
|
|
|
|
crc_r.offset)
|
|
|
|
return BCH_MERGE_NOMERGE;
|
|
|
|
|
|
|
|
if (!bch2_checksum_mergeable(crc_l.csum_type))
|
|
|
|
return BCH_MERGE_NOMERGE;
|
|
|
|
|
2018-02-23 21:26:10 +00:00
|
|
|
if (crc_is_compressed(crc_l))
|
2019-11-16 21:25:58 +00:00
|
|
|
return BCH_MERGE_NOMERGE;
|
|
|
|
|
|
|
|
if (crc_l.csum_type &&
|
|
|
|
crc_l.uncompressed_size +
|
|
|
|
crc_r.uncompressed_size > c->sb.encoded_extent_max)
|
|
|
|
return BCH_MERGE_NOMERGE;
|
|
|
|
|
2020-03-05 22:06:15 +00:00
|
|
|
if (crc_l.uncompressed_size + crc_r.uncompressed_size >
|
2019-11-16 21:25:58 +00:00
|
|
|
bch2_crc_field_size_max[extent_entry_type(en_l)])
|
|
|
|
return BCH_MERGE_NOMERGE;
|
2018-11-01 19:13:19 +00:00
|
|
|
|
|
|
|
break;
|
2019-11-16 21:25:58 +00:00
|
|
|
default:
|
|
|
|
return BCH_MERGE_NOMERGE;
|
2018-09-30 22:28:23 +00:00
|
|
|
}
|
2019-11-16 21:25:58 +00:00
|
|
|
}
|
2018-11-01 19:13:19 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
extent_for_each_entry(l, en_l) {
|
|
|
|
struct bch_extent_crc_unpacked crc_l, crc_r;
|
|
|
|
|
|
|
|
en_r = vstruct_idx(r.v, (u64 *) en_l - l.v->_data);
|
|
|
|
|
|
|
|
if (!extent_entry_is_crc(en_l))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
crc_l = bch2_extent_crc_unpack(l.k, entry_to_crc(en_l));
|
|
|
|
crc_r = bch2_extent_crc_unpack(r.k, entry_to_crc(en_r));
|
|
|
|
|
|
|
|
crc_l.csum = bch2_checksum_merge(crc_l.csum_type,
|
|
|
|
crc_l.csum,
|
|
|
|
crc_r.csum,
|
|
|
|
crc_r.uncompressed_size << 9);
|
|
|
|
|
|
|
|
crc_l.uncompressed_size += crc_r.uncompressed_size;
|
|
|
|
crc_l.compressed_size += crc_r.compressed_size;
|
|
|
|
|
|
|
|
bch2_extent_crc_pack(entry_to_crc(en_l), crc_l,
|
|
|
|
extent_entry_type(en_l));
|
2018-09-30 22:28:23 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
bch2_key_resize(l.k, l.k->size + r.k->size);
|
2018-09-30 22:28:23 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
return BCH_MERGE_MERGE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* KEY_TYPE_reservation: */
|
|
|
|
|
|
|
|
const char *bch2_reservation_invalid(const struct bch_fs *c, struct bkey_s_c k)
|
|
|
|
{
|
|
|
|
struct bkey_s_c_reservation r = bkey_s_c_to_reservation(k);
|
|
|
|
|
|
|
|
if (bkey_val_bytes(k.k) != sizeof(struct bch_reservation))
|
|
|
|
return "incorrect value size";
|
|
|
|
|
|
|
|
if (!r.v->nr_replicas || r.v->nr_replicas > BCH_REPLICAS_MAX)
|
|
|
|
return "invalid nr_replicas";
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
void bch2_reservation_to_text(struct printbuf *out, struct bch_fs *c,
|
|
|
|
struct bkey_s_c k)
|
|
|
|
{
|
|
|
|
struct bkey_s_c_reservation r = bkey_s_c_to_reservation(k);
|
|
|
|
|
|
|
|
pr_buf(out, "generation %u replicas %u",
|
|
|
|
le32_to_cpu(r.v->generation),
|
|
|
|
r.v->nr_replicas);
|
|
|
|
}
|
|
|
|
|
|
|
|
enum merge_result bch2_reservation_merge(struct bch_fs *c,
|
|
|
|
struct bkey_s _l, struct bkey_s _r)
|
|
|
|
{
|
|
|
|
struct bkey_s_reservation l = bkey_s_to_reservation(_l);
|
|
|
|
struct bkey_s_reservation r = bkey_s_to_reservation(_r);
|
|
|
|
|
|
|
|
if (l.v->generation != r.v->generation ||
|
|
|
|
l.v->nr_replicas != r.v->nr_replicas)
|
|
|
|
return BCH_MERGE_NOMERGE;
|
|
|
|
|
|
|
|
if ((u64) l.k->size + r.k->size > KEY_SIZE_MAX) {
|
|
|
|
bch2_key_resize(l.k, KEY_SIZE_MAX);
|
|
|
|
bch2_cut_front_s(l.k->p, r.s);
|
|
|
|
return BCH_MERGE_PARTIAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
bch2_key_resize(l.k, l.k->size + r.k->size);
|
|
|
|
|
|
|
|
return BCH_MERGE_MERGE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Extent checksum entries: */
|
|
|
|
|
|
|
|
/* returns true if not equal */
|
|
|
|
static inline bool bch2_crc_unpacked_cmp(struct bch_extent_crc_unpacked l,
|
|
|
|
struct bch_extent_crc_unpacked r)
|
|
|
|
{
|
|
|
|
return (l.csum_type != r.csum_type ||
|
|
|
|
l.compression_type != r.compression_type ||
|
|
|
|
l.compressed_size != r.compressed_size ||
|
|
|
|
l.uncompressed_size != r.uncompressed_size ||
|
|
|
|
l.offset != r.offset ||
|
|
|
|
l.live_size != r.live_size ||
|
|
|
|
l.nonce != r.nonce ||
|
|
|
|
bch2_crc_cmp(l.csum, r.csum));
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline bool can_narrow_crc(struct bch_extent_crc_unpacked u,
|
|
|
|
struct bch_extent_crc_unpacked n)
|
|
|
|
{
|
2018-02-23 21:26:10 +00:00
|
|
|
return !crc_is_compressed(u) &&
|
2017-03-17 06:18:50 +00:00
|
|
|
u.csum_type &&
|
|
|
|
u.uncompressed_size > u.live_size &&
|
|
|
|
bch2_csum_type_is_encryption(u.csum_type) ==
|
|
|
|
bch2_csum_type_is_encryption(n.csum_type);
|
|
|
|
}
|
|
|
|
|
2019-07-25 17:52:14 +00:00
|
|
|
bool bch2_can_narrow_extent_crcs(struct bkey_s_c k,
|
2017-03-17 06:18:50 +00:00
|
|
|
struct bch_extent_crc_unpacked n)
|
|
|
|
{
|
2019-07-25 17:52:14 +00:00
|
|
|
struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
|
2017-03-17 06:18:50 +00:00
|
|
|
struct bch_extent_crc_unpacked crc;
|
|
|
|
const union bch_extent_entry *i;
|
|
|
|
|
|
|
|
if (!n.csum_type)
|
|
|
|
return false;
|
|
|
|
|
2019-07-25 17:52:14 +00:00
|
|
|
bkey_for_each_crc(k.k, ptrs, crc, i)
|
2017-03-17 06:18:50 +00:00
|
|
|
if (can_narrow_crc(crc, n))
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We're writing another replica for this extent, so while we've got the data in
|
|
|
|
* memory we'll be computing a new checksum for the currently live data.
|
|
|
|
*
|
|
|
|
* If there are other replicas we aren't moving, and they are checksummed but
|
|
|
|
* not compressed, we can modify them to point to only the data that is
|
|
|
|
* currently live (so that readers won't have to bounce) while we've got the
|
|
|
|
* checksum we need:
|
|
|
|
*/
|
2019-07-25 17:52:14 +00:00
|
|
|
bool bch2_bkey_narrow_crcs(struct bkey_i *k, struct bch_extent_crc_unpacked n)
|
2017-03-17 06:18:50 +00:00
|
|
|
{
|
2019-07-25 17:52:14 +00:00
|
|
|
struct bkey_ptrs ptrs = bch2_bkey_ptrs(bkey_i_to_s(k));
|
2017-03-17 06:18:50 +00:00
|
|
|
struct bch_extent_crc_unpacked u;
|
2018-09-28 01:08:39 +00:00
|
|
|
struct extent_ptr_decoded p;
|
2017-03-17 06:18:50 +00:00
|
|
|
union bch_extent_entry *i;
|
2018-09-28 01:08:39 +00:00
|
|
|
bool ret = false;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
|
|
|
/* Find a checksum entry that covers only live data: */
|
2018-09-28 01:08:39 +00:00
|
|
|
if (!n.csum_type) {
|
2019-07-25 17:52:14 +00:00
|
|
|
bkey_for_each_crc(&k->k, ptrs, u, i)
|
2018-02-23 21:26:10 +00:00
|
|
|
if (!crc_is_compressed(u) &&
|
2017-03-17 06:18:50 +00:00
|
|
|
u.csum_type &&
|
|
|
|
u.live_size == u.uncompressed_size) {
|
|
|
|
n = u;
|
2018-09-28 01:08:39 +00:00
|
|
|
goto found;
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
return false;
|
2018-09-28 01:08:39 +00:00
|
|
|
}
|
|
|
|
found:
|
2018-02-23 21:26:10 +00:00
|
|
|
BUG_ON(crc_is_compressed(n));
|
2017-03-17 06:18:50 +00:00
|
|
|
BUG_ON(n.offset);
|
2019-07-25 17:52:14 +00:00
|
|
|
BUG_ON(n.live_size != k->k.size);
|
2017-03-17 06:18:50 +00:00
|
|
|
|
|
|
|
restart_narrow_pointers:
|
2019-08-21 22:55:07 +00:00
|
|
|
ptrs = bch2_bkey_ptrs(bkey_i_to_s(k));
|
|
|
|
|
2019-07-25 17:52:14 +00:00
|
|
|
bkey_for_each_ptr_decode(&k->k, ptrs, p, i)
|
2018-09-28 01:08:39 +00:00
|
|
|
if (can_narrow_crc(p.crc, n)) {
|
2019-07-25 17:52:14 +00:00
|
|
|
bch2_bkey_drop_ptr(bkey_i_to_s(k), &i->ptr);
|
2018-09-28 01:08:39 +00:00
|
|
|
p.ptr.offset += p.crc.offset;
|
|
|
|
p.crc = n;
|
2019-07-25 17:52:14 +00:00
|
|
|
bch2_extent_ptr_decoded_append(k, &p);
|
2018-09-28 01:08:39 +00:00
|
|
|
ret = true;
|
2017-03-17 06:18:50 +00:00
|
|
|
goto restart_narrow_pointers;
|
|
|
|
}
|
|
|
|
|
2018-09-28 01:08:39 +00:00
|
|
|
return ret;
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
static void bch2_extent_crc_pack(union bch_extent_crc *dst,
|
|
|
|
struct bch_extent_crc_unpacked src,
|
|
|
|
enum bch_extent_entry_type type)
|
2017-03-17 06:18:50 +00:00
|
|
|
{
|
2019-11-16 21:25:58 +00:00
|
|
|
#define set_common_fields(_dst, _src) \
|
|
|
|
_dst.type = 1 << type; \
|
|
|
|
_dst.csum_type = _src.csum_type, \
|
|
|
|
_dst.compression_type = _src.compression_type, \
|
|
|
|
_dst._compressed_size = _src.compressed_size - 1, \
|
|
|
|
_dst._uncompressed_size = _src.uncompressed_size - 1, \
|
|
|
|
_dst.offset = _src.offset
|
|
|
|
|
|
|
|
switch (type) {
|
|
|
|
case BCH_EXTENT_ENTRY_crc32:
|
|
|
|
set_common_fields(dst->crc32, src);
|
|
|
|
dst->crc32.csum = *((__le32 *) &src.csum.lo);
|
|
|
|
break;
|
|
|
|
case BCH_EXTENT_ENTRY_crc64:
|
|
|
|
set_common_fields(dst->crc64, src);
|
|
|
|
dst->crc64.nonce = src.nonce;
|
|
|
|
dst->crc64.csum_lo = src.csum.lo;
|
|
|
|
dst->crc64.csum_hi = *((__le16 *) &src.csum.hi);
|
|
|
|
break;
|
|
|
|
case BCH_EXTENT_ENTRY_crc128:
|
|
|
|
set_common_fields(dst->crc128, src);
|
|
|
|
dst->crc128.nonce = src.nonce;
|
|
|
|
dst->crc128.csum = src.csum;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
#undef set_common_fields
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
void bch2_extent_crc_append(struct bkey_i *k,
|
|
|
|
struct bch_extent_crc_unpacked new)
|
2017-03-17 06:18:50 +00:00
|
|
|
{
|
2019-11-16 21:25:58 +00:00
|
|
|
struct bkey_ptrs ptrs = bch2_bkey_ptrs(bkey_i_to_s(k));
|
|
|
|
union bch_extent_crc *crc = (void *) ptrs.end;
|
|
|
|
enum bch_extent_entry_type type;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (bch_crc_bytes[new.csum_type] <= 4 &&
|
2020-03-05 22:06:15 +00:00
|
|
|
new.uncompressed_size <= CRC32_SIZE_MAX &&
|
2019-11-16 21:25:58 +00:00
|
|
|
new.nonce <= CRC32_NONCE_MAX)
|
|
|
|
type = BCH_EXTENT_ENTRY_crc32;
|
|
|
|
else if (bch_crc_bytes[new.csum_type] <= 10 &&
|
2020-03-05 22:06:15 +00:00
|
|
|
new.uncompressed_size <= CRC64_SIZE_MAX &&
|
2019-11-16 21:25:58 +00:00
|
|
|
new.nonce <= CRC64_NONCE_MAX)
|
|
|
|
type = BCH_EXTENT_ENTRY_crc64;
|
|
|
|
else if (bch_crc_bytes[new.csum_type] <= 16 &&
|
2020-03-05 22:06:15 +00:00
|
|
|
new.uncompressed_size <= CRC128_SIZE_MAX &&
|
2019-11-16 21:25:58 +00:00
|
|
|
new.nonce <= CRC128_NONCE_MAX)
|
|
|
|
type = BCH_EXTENT_ENTRY_crc128;
|
|
|
|
else
|
|
|
|
BUG();
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
bch2_extent_crc_pack(crc, new, type);
|
|
|
|
|
|
|
|
k->k.u64s += extent_entry_u64s(ptrs.end);
|
|
|
|
|
|
|
|
EBUG_ON(bkey_val_u64s(&k->k) > BKEY_EXTENT_VAL_U64s_MAX);
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
/* Generic code for keys with pointers: */
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
unsigned bch2_bkey_nr_ptrs(struct bkey_s_c k)
|
|
|
|
{
|
|
|
|
return bch2_bkey_devs(k).nr;
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
unsigned bch2_bkey_nr_ptrs_allocated(struct bkey_s_c k)
|
2019-05-11 21:32:07 +00:00
|
|
|
{
|
2019-11-16 21:25:58 +00:00
|
|
|
return k.k->type == KEY_TYPE_reservation
|
|
|
|
? bkey_s_c_to_reservation(k).v->nr_replicas
|
|
|
|
: bch2_bkey_dirty_devs(k).nr;
|
2019-05-11 21:32:07 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
unsigned bch2_bkey_nr_ptrs_fully_allocated(struct bkey_s_c k)
|
2017-03-17 06:18:50 +00:00
|
|
|
{
|
2019-11-16 21:25:58 +00:00
|
|
|
unsigned ret = 0;
|
2019-05-11 21:32:07 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (k.k->type == KEY_TYPE_reservation) {
|
|
|
|
ret = bkey_s_c_to_reservation(k).v->nr_replicas;
|
|
|
|
} else {
|
|
|
|
struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
|
|
|
|
const union bch_extent_entry *entry;
|
|
|
|
struct extent_ptr_decoded p;
|
2019-05-11 21:32:07 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
bkey_for_each_ptr_decode(k.k, ptrs, p, entry)
|
2018-02-23 21:26:10 +00:00
|
|
|
ret += !p.ptr.cached && !crc_is_compressed(p.crc);
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
return ret;
|
2019-05-11 21:32:07 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
unsigned bch2_bkey_sectors_compressed(struct bkey_s_c k)
|
2017-03-17 06:18:50 +00:00
|
|
|
{
|
2018-11-01 19:10:01 +00:00
|
|
|
struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
|
2019-11-16 21:25:58 +00:00
|
|
|
const union bch_extent_entry *entry;
|
|
|
|
struct extent_ptr_decoded p;
|
|
|
|
unsigned ret = 0;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
bkey_for_each_ptr_decode(k.k, ptrs, p, entry)
|
2018-02-23 21:26:10 +00:00
|
|
|
if (!p.ptr.cached && crc_is_compressed(p.crc))
|
2019-11-16 21:25:58 +00:00
|
|
|
ret += p.crc.compressed_size;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
return ret;
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
2018-02-23 21:26:10 +00:00
|
|
|
bool bch2_bkey_is_incompressible(struct bkey_s_c k)
|
|
|
|
{
|
|
|
|
struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
|
|
|
|
const union bch_extent_entry *entry;
|
|
|
|
struct bch_extent_crc_unpacked crc;
|
|
|
|
|
|
|
|
bkey_for_each_crc(k.k, ptrs, crc, entry)
|
|
|
|
if (crc.compression_type == BCH_COMPRESSION_TYPE_incompressible)
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
bool bch2_check_range_allocated(struct bch_fs *c, struct bpos pos, u64 size,
|
|
|
|
unsigned nr_replicas)
|
2017-03-17 06:18:50 +00:00
|
|
|
{
|
2019-11-16 21:25:58 +00:00
|
|
|
struct btree_trans trans;
|
|
|
|
struct btree_iter *iter;
|
|
|
|
struct bpos end = pos;
|
|
|
|
struct bkey_s_c k;
|
|
|
|
bool ret = true;
|
|
|
|
int err;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
end.offset += size;
|
2019-07-18 21:21:21 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
bch2_trans_init(&trans, c, 0, 0);
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
for_each_btree_key(&trans, iter, BTREE_ID_EXTENTS, pos,
|
|
|
|
BTREE_ITER_SLOTS, k, err) {
|
|
|
|
if (bkey_cmp(bkey_start_pos(k.k), end) >= 0)
|
|
|
|
break;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (nr_replicas > bch2_bkey_nr_ptrs_fully_allocated(k)) {
|
|
|
|
ret = false;
|
|
|
|
break;
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
2019-08-16 13:59:56 +00:00
|
|
|
}
|
2019-11-16 21:25:58 +00:00
|
|
|
bch2_trans_exit(&trans);
|
2019-11-10 00:02:48 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
return ret;
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
static unsigned bch2_extent_ptr_durability(struct bch_fs *c,
|
|
|
|
struct extent_ptr_decoded p)
|
2017-03-17 06:18:50 +00:00
|
|
|
{
|
2019-11-16 21:25:58 +00:00
|
|
|
unsigned durability = 0;
|
|
|
|
struct bch_dev *ca;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (p.ptr.cached)
|
2019-11-10 00:02:48 +00:00
|
|
|
return 0;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
ca = bch_dev_bkey_exists(c, p.ptr.dev);
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (ca->mi.state != BCH_MEMBER_STATE_FAILED)
|
|
|
|
durability = max_t(unsigned, durability, ca->mi.durability);
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (p.has_ec) {
|
|
|
|
struct stripe *s =
|
|
|
|
genradix_ptr(&c->stripes[0], p.ec.idx);
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (WARN_ON(!s))
|
|
|
|
goto out;
|
2019-11-10 00:02:48 +00:00
|
|
|
|
2020-07-11 19:35:04 +00:00
|
|
|
durability += s->nr_redundant;
|
2019-11-09 21:43:16 +00:00
|
|
|
}
|
2019-11-16 21:25:58 +00:00
|
|
|
out:
|
|
|
|
return durability;
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
unsigned bch2_bkey_durability(struct bch_fs *c, struct bkey_s_c k)
|
2017-03-17 06:18:50 +00:00
|
|
|
{
|
2019-11-16 21:25:58 +00:00
|
|
|
struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
|
2018-12-06 15:24:22 +00:00
|
|
|
const union bch_extent_entry *entry;
|
|
|
|
struct extent_ptr_decoded p;
|
2019-11-16 21:25:58 +00:00
|
|
|
unsigned durability = 0;
|
2018-12-06 15:24:22 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
bkey_for_each_ptr_decode(k.k, ptrs, p, entry)
|
|
|
|
durability += bch2_extent_ptr_durability(c, p);
|
2018-12-06 15:24:22 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
return durability;
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
void bch2_bkey_mark_replicas_cached(struct bch_fs *c, struct bkey_s k,
|
|
|
|
unsigned target,
|
|
|
|
unsigned nr_desired_replicas)
|
2017-03-17 06:18:50 +00:00
|
|
|
{
|
2019-11-16 21:25:58 +00:00
|
|
|
struct bkey_ptrs ptrs = bch2_bkey_ptrs(k);
|
|
|
|
union bch_extent_entry *entry;
|
|
|
|
struct extent_ptr_decoded p;
|
|
|
|
int extra = bch2_bkey_durability(c, k.s_c) - nr_desired_replicas;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (target && extra > 0)
|
|
|
|
bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
|
|
|
|
int n = bch2_extent_ptr_durability(c, p);
|
2019-05-13 02:23:30 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (n && n <= extra &&
|
|
|
|
!bch2_dev_in_target(c, p.ptr.dev, target)) {
|
|
|
|
entry->ptr.cached = true;
|
|
|
|
extra -= n;
|
|
|
|
}
|
|
|
|
}
|
2019-05-13 02:23:30 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (extra > 0)
|
|
|
|
bkey_for_each_ptr_decode(k.k, ptrs, p, entry) {
|
|
|
|
int n = bch2_extent_ptr_durability(c, p);
|
2019-05-13 02:23:30 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (n && n <= extra) {
|
|
|
|
entry->ptr.cached = true;
|
|
|
|
extra -= n;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2019-07-25 17:52:14 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
void bch2_bkey_append_ptr(struct bkey_i *k,
|
|
|
|
struct bch_extent_ptr ptr)
|
|
|
|
{
|
|
|
|
EBUG_ON(bch2_bkey_has_device(bkey_i_to_s_c(k), ptr.dev));
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
switch (k->k.type) {
|
|
|
|
case KEY_TYPE_btree_ptr:
|
2020-02-07 18:38:02 +00:00
|
|
|
case KEY_TYPE_btree_ptr_v2:
|
2019-11-16 21:25:58 +00:00
|
|
|
case KEY_TYPE_extent:
|
|
|
|
EBUG_ON(bkey_val_u64s(&k->k) >= BKEY_EXTENT_VAL_U64s_MAX);
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
ptr.type = 1 << BCH_EXTENT_ENTRY_ptr;
|
2019-07-25 17:52:14 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
memcpy((void *) &k->v + bkey_val_bytes(&k->k),
|
|
|
|
&ptr,
|
|
|
|
sizeof(ptr));
|
|
|
|
k->u64s++;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
BUG();
|
|
|
|
}
|
2018-09-28 01:08:39 +00:00
|
|
|
}
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-07-25 17:52:14 +00:00
|
|
|
static inline void __extent_entry_insert(struct bkey_i *k,
|
2018-09-28 01:08:39 +00:00
|
|
|
union bch_extent_entry *dst,
|
|
|
|
union bch_extent_entry *new)
|
|
|
|
{
|
2019-07-25 17:52:14 +00:00
|
|
|
union bch_extent_entry *end = bkey_val_end(bkey_i_to_s(k));
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-10-22 21:35:35 +00:00
|
|
|
memmove_u64s_up_small((u64 *) dst + extent_entry_u64s(new),
|
|
|
|
dst, (u64 *) end - (u64 *) dst);
|
2019-07-25 17:52:14 +00:00
|
|
|
k->k.u64s += extent_entry_u64s(new);
|
2018-09-28 01:08:39 +00:00
|
|
|
memcpy_u64s_small(dst, new, extent_entry_u64s(new));
|
|
|
|
}
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-07-25 17:52:14 +00:00
|
|
|
void bch2_extent_ptr_decoded_append(struct bkey_i *k,
|
2018-09-28 01:08:39 +00:00
|
|
|
struct extent_ptr_decoded *p)
|
|
|
|
{
|
2019-07-25 17:52:14 +00:00
|
|
|
struct bkey_ptrs ptrs = bch2_bkey_ptrs(bkey_i_to_s(k));
|
|
|
|
struct bch_extent_crc_unpacked crc =
|
|
|
|
bch2_extent_crc_unpack(&k->k, NULL);
|
2018-09-28 01:08:39 +00:00
|
|
|
union bch_extent_entry *pos;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-09-28 01:08:39 +00:00
|
|
|
if (!bch2_crc_unpacked_cmp(crc, p->crc)) {
|
2019-07-25 17:52:14 +00:00
|
|
|
pos = ptrs.start;
|
2018-09-28 01:08:39 +00:00
|
|
|
goto found;
|
|
|
|
}
|
|
|
|
|
2019-07-25 17:52:14 +00:00
|
|
|
bkey_for_each_crc(&k->k, ptrs, crc, pos)
|
2018-09-28 01:08:39 +00:00
|
|
|
if (!bch2_crc_unpacked_cmp(crc, p->crc)) {
|
|
|
|
pos = extent_entry_next(pos);
|
|
|
|
goto found;
|
|
|
|
}
|
|
|
|
|
2019-07-25 17:52:14 +00:00
|
|
|
bch2_extent_crc_append(k, p->crc);
|
|
|
|
pos = bkey_val_end(bkey_i_to_s(k));
|
2018-09-28 01:08:39 +00:00
|
|
|
found:
|
|
|
|
p->ptr.type = 1 << BCH_EXTENT_ENTRY_ptr;
|
2019-07-25 17:52:14 +00:00
|
|
|
__extent_entry_insert(k, pos, to_entry(&p->ptr));
|
2018-11-01 19:13:19 +00:00
|
|
|
|
2019-10-08 22:45:29 +00:00
|
|
|
if (p->has_ec) {
|
|
|
|
p->ec.type = 1 << BCH_EXTENT_ENTRY_stripe_ptr;
|
|
|
|
__extent_entry_insert(k, pos, to_entry(&p->ec));
|
2018-11-01 19:13:19 +00:00
|
|
|
}
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
static union bch_extent_entry *extent_entry_prev(struct bkey_ptrs ptrs,
|
|
|
|
union bch_extent_entry *entry)
|
|
|
|
{
|
|
|
|
union bch_extent_entry *i = ptrs.start;
|
|
|
|
|
|
|
|
if (i == entry)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
while (extent_entry_next(i) != entry)
|
|
|
|
i = extent_entry_next(i);
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
|
|
|
union bch_extent_entry *bch2_bkey_drop_ptr(struct bkey_s k,
|
|
|
|
struct bch_extent_ptr *ptr)
|
|
|
|
{
|
|
|
|
struct bkey_ptrs ptrs = bch2_bkey_ptrs(k);
|
|
|
|
union bch_extent_entry *dst, *src, *prev;
|
|
|
|
bool drop_crc = true;
|
|
|
|
|
|
|
|
EBUG_ON(ptr < &ptrs.start->ptr ||
|
|
|
|
ptr >= &ptrs.end->ptr);
|
|
|
|
EBUG_ON(ptr->type != 1 << BCH_EXTENT_ENTRY_ptr);
|
|
|
|
|
|
|
|
src = extent_entry_next(to_entry(ptr));
|
|
|
|
if (src != ptrs.end &&
|
|
|
|
!extent_entry_is_crc(src))
|
|
|
|
drop_crc = false;
|
|
|
|
|
|
|
|
dst = to_entry(ptr);
|
|
|
|
while ((prev = extent_entry_prev(ptrs, dst))) {
|
|
|
|
if (extent_entry_is_ptr(prev))
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (extent_entry_is_crc(prev)) {
|
|
|
|
if (drop_crc)
|
|
|
|
dst = prev;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
dst = prev;
|
|
|
|
}
|
|
|
|
|
|
|
|
memmove_u64s_down(dst, src,
|
|
|
|
(u64 *) ptrs.end - (u64 *) src);
|
|
|
|
k.k->u64s -= (u64 *) src - (u64 *) dst;
|
|
|
|
|
|
|
|
return dst;
|
|
|
|
}
|
|
|
|
|
|
|
|
void bch2_bkey_drop_device(struct bkey_s k, unsigned dev)
|
|
|
|
{
|
|
|
|
struct bch_extent_ptr *ptr;
|
|
|
|
|
|
|
|
bch2_bkey_drop_ptrs(k, ptr, ptr->dev == dev);
|
|
|
|
}
|
|
|
|
|
|
|
|
const struct bch_extent_ptr *
|
|
|
|
bch2_bkey_has_device(struct bkey_s_c k, unsigned dev)
|
|
|
|
{
|
|
|
|
struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
|
|
|
|
const struct bch_extent_ptr *ptr;
|
|
|
|
|
|
|
|
bkey_for_each_ptr(ptrs, ptr)
|
|
|
|
if (ptr->dev == dev)
|
|
|
|
return ptr;
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool bch2_bkey_has_target(struct bch_fs *c, struct bkey_s_c k, unsigned target)
|
|
|
|
{
|
|
|
|
struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
|
|
|
|
const struct bch_extent_ptr *ptr;
|
|
|
|
|
|
|
|
bkey_for_each_ptr(ptrs, ptr)
|
|
|
|
if (bch2_dev_in_target(c, ptr->dev, target) &&
|
|
|
|
(!ptr->cached ||
|
|
|
|
!ptr_stale(bch_dev_bkey_exists(c, ptr->dev), ptr)))
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool bch2_bkey_matches_ptr(struct bch_fs *c, struct bkey_s_c k,
|
|
|
|
struct bch_extent_ptr m, u64 offset)
|
|
|
|
{
|
|
|
|
struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
|
|
|
|
const union bch_extent_entry *entry;
|
|
|
|
struct extent_ptr_decoded p;
|
|
|
|
|
|
|
|
bkey_for_each_ptr_decode(k.k, ptrs, p, entry)
|
|
|
|
if (p.ptr.dev == m.dev &&
|
|
|
|
p.ptr.gen == m.gen &&
|
|
|
|
(s64) p.ptr.offset + p.crc.offset - bkey_start_offset(k.k) ==
|
|
|
|
(s64) m.offset - offset)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2017-03-17 06:18:50 +00:00
|
|
|
/*
|
|
|
|
* bch_extent_normalize - clean up an extent, dropping stale pointers etc.
|
|
|
|
*
|
|
|
|
* Returns true if @k should be dropped entirely
|
|
|
|
*
|
|
|
|
* For existing keys, only called when btree nodes are being rewritten, not when
|
|
|
|
* they're merely being compacted/resorted in memory.
|
|
|
|
*/
|
|
|
|
bool bch2_extent_normalize(struct bch_fs *c, struct bkey_s k)
|
|
|
|
{
|
2018-11-01 19:10:01 +00:00
|
|
|
struct bch_extent_ptr *ptr;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
bch2_bkey_drop_ptrs(k, ptr,
|
|
|
|
ptr->cached &&
|
|
|
|
ptr_stale(bch_dev_bkey_exists(c, ptr->dev), ptr));
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2018-11-01 19:10:01 +00:00
|
|
|
/* will only happen if all pointers were cached: */
|
2019-11-16 21:25:58 +00:00
|
|
|
if (!bch2_bkey_nr_ptrs(k.s_c))
|
2019-08-21 22:35:15 +00:00
|
|
|
k.k->type = KEY_TYPE_discard;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-08-21 22:35:15 +00:00
|
|
|
return bkey_whiteout(k.k);
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
void bch2_bkey_ptrs_to_text(struct printbuf *out, struct bch_fs *c,
|
|
|
|
struct bkey_s_c k)
|
2017-03-17 06:18:50 +00:00
|
|
|
{
|
2019-11-16 21:25:58 +00:00
|
|
|
struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
|
|
|
|
const union bch_extent_entry *entry;
|
|
|
|
struct bch_extent_crc_unpacked crc;
|
|
|
|
const struct bch_extent_ptr *ptr;
|
|
|
|
const struct bch_extent_stripe_ptr *ec;
|
|
|
|
struct bch_dev *ca;
|
|
|
|
bool first = true;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
bkey_extent_entry_for_each(ptrs, entry) {
|
|
|
|
if (!first)
|
|
|
|
pr_buf(out, " ");
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
switch (__extent_entry_type(entry)) {
|
|
|
|
case BCH_EXTENT_ENTRY_ptr:
|
|
|
|
ptr = entry_to_ptr(entry);
|
|
|
|
ca = ptr->dev < c->sb.nr_devices && c->devs[ptr->dev]
|
|
|
|
? bch_dev_bkey_exists(c, ptr->dev)
|
|
|
|
: NULL;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
pr_buf(out, "ptr: %u:%llu gen %u%s%s", ptr->dev,
|
|
|
|
(u64) ptr->offset, ptr->gen,
|
|
|
|
ptr->cached ? " cached" : "",
|
|
|
|
ca && ptr_stale(ca, ptr)
|
|
|
|
? " stale" : "");
|
|
|
|
break;
|
|
|
|
case BCH_EXTENT_ENTRY_crc32:
|
|
|
|
case BCH_EXTENT_ENTRY_crc64:
|
|
|
|
case BCH_EXTENT_ENTRY_crc128:
|
|
|
|
crc = bch2_extent_crc_unpack(k.k, entry_to_crc(entry));
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
pr_buf(out, "crc: c_size %u size %u offset %u nonce %u csum %u compress %u",
|
|
|
|
crc.compressed_size,
|
|
|
|
crc.uncompressed_size,
|
|
|
|
crc.offset, crc.nonce,
|
|
|
|
crc.csum_type,
|
|
|
|
crc.compression_type);
|
|
|
|
break;
|
|
|
|
case BCH_EXTENT_ENTRY_stripe_ptr:
|
|
|
|
ec = &entry->stripe_ptr;
|
|
|
|
|
|
|
|
pr_buf(out, "ec: idx %llu block %u",
|
|
|
|
(u64) ec->idx, ec->block);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
pr_buf(out, "(invalid extent entry %.16llx)", *((u64 *) entry));
|
|
|
|
return;
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
2019-11-16 21:25:58 +00:00
|
|
|
|
|
|
|
first = false;
|
|
|
|
}
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
static const char *extent_ptr_invalid(const struct bch_fs *c,
|
|
|
|
struct bkey_s_c k,
|
|
|
|
const struct bch_extent_ptr *ptr,
|
|
|
|
unsigned size_ondisk,
|
|
|
|
bool metadata)
|
2017-03-17 06:18:50 +00:00
|
|
|
{
|
2019-11-16 21:25:58 +00:00
|
|
|
struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
|
|
|
|
const struct bch_extent_ptr *ptr2;
|
|
|
|
struct bch_dev *ca;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (!bch2_dev_exists2(c, ptr->dev))
|
|
|
|
return "pointer to invalid device";
|
2019-05-21 14:14:54 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
ca = bch_dev_bkey_exists(c, ptr->dev);
|
|
|
|
if (!ca)
|
|
|
|
return "pointer to invalid device";
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
bkey_for_each_ptr(ptrs, ptr2)
|
|
|
|
if (ptr != ptr2 && ptr->dev == ptr2->dev)
|
|
|
|
return "multiple pointers to same device";
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (ptr->offset + size_ondisk > bucket_to_sector(ca, ca->mi.nbuckets))
|
|
|
|
return "offset past end of device";
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (ptr->offset < bucket_to_sector(ca, ca->mi.first_bucket))
|
|
|
|
return "offset before first bucket";
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (bucket_remainder(ca, ptr->offset) +
|
|
|
|
size_ondisk > ca->mi.bucket_size)
|
|
|
|
return "spans multiple buckets";
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
const char *bch2_bkey_ptrs_invalid(const struct bch_fs *c, struct bkey_s_c k)
|
|
|
|
{
|
|
|
|
struct bkey_ptrs_c ptrs = bch2_bkey_ptrs_c(k);
|
|
|
|
const union bch_extent_entry *entry;
|
|
|
|
struct bch_extent_crc_unpacked crc;
|
|
|
|
unsigned size_ondisk = k.k->size;
|
|
|
|
const char *reason;
|
|
|
|
unsigned nonce = UINT_MAX;
|
|
|
|
|
|
|
|
if (k.k->type == KEY_TYPE_btree_ptr)
|
|
|
|
size_ondisk = c->opts.btree_node_size;
|
2020-02-07 18:38:02 +00:00
|
|
|
if (k.k->type == KEY_TYPE_btree_ptr_v2)
|
|
|
|
size_ondisk = le16_to_cpu(bkey_s_c_to_btree_ptr_v2(k).v->sectors);
|
2019-11-16 21:25:58 +00:00
|
|
|
|
|
|
|
bkey_extent_entry_for_each(ptrs, entry) {
|
|
|
|
if (__extent_entry_type(entry) >= BCH_EXTENT_ENTRY_MAX)
|
|
|
|
return "invalid extent entry type";
|
2019-05-13 02:23:30 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (k.k->type == KEY_TYPE_btree_ptr &&
|
|
|
|
!extent_entry_is_ptr(entry))
|
|
|
|
return "has non ptr field";
|
|
|
|
|
|
|
|
switch (extent_entry_type(entry)) {
|
|
|
|
case BCH_EXTENT_ENTRY_ptr:
|
|
|
|
reason = extent_ptr_invalid(c, k, &entry->ptr,
|
|
|
|
size_ondisk, false);
|
|
|
|
if (reason)
|
|
|
|
return reason;
|
2019-05-13 02:23:30 +00:00
|
|
|
break;
|
|
|
|
case BCH_EXTENT_ENTRY_crc32:
|
|
|
|
case BCH_EXTENT_ENTRY_crc64:
|
|
|
|
case BCH_EXTENT_ENTRY_crc128:
|
2019-11-16 21:25:58 +00:00
|
|
|
crc = bch2_extent_crc_unpack(k.k, entry_to_crc(entry));
|
2019-05-13 02:23:30 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (crc.offset + crc.live_size >
|
|
|
|
crc.uncompressed_size)
|
|
|
|
return "checksum offset + key size > uncompressed size";
|
2019-05-13 02:23:30 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
size_ondisk = crc.compressed_size;
|
2019-05-13 02:23:30 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (!bch2_checksum_type_valid(c, crc.csum_type))
|
|
|
|
return "invalid checksum type";
|
2019-05-13 02:23:30 +00:00
|
|
|
|
2019-12-29 01:17:06 +00:00
|
|
|
if (crc.compression_type >= BCH_COMPRESSION_TYPE_NR)
|
2019-11-16 21:25:58 +00:00
|
|
|
return "invalid compression type";
|
2019-05-13 02:23:30 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (bch2_csum_type_is_encryption(crc.csum_type)) {
|
|
|
|
if (nonce == UINT_MAX)
|
|
|
|
nonce = crc.offset + crc.nonce;
|
|
|
|
else if (nonce != crc.offset + crc.nonce)
|
|
|
|
return "incorrect nonce";
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case BCH_EXTENT_ENTRY_stripe_ptr:
|
2019-05-13 02:23:30 +00:00
|
|
|
break;
|
|
|
|
}
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
2019-05-13 02:23:30 +00:00
|
|
|
|
2020-02-07 01:15:15 +00:00
|
|
|
void bch2_ptr_swab(struct bkey_s k)
|
2019-11-16 21:25:58 +00:00
|
|
|
{
|
2020-02-07 01:15:15 +00:00
|
|
|
struct bkey_ptrs ptrs = bch2_bkey_ptrs(k);
|
2019-11-16 21:25:58 +00:00
|
|
|
union bch_extent_entry *entry;
|
2020-02-07 01:15:15 +00:00
|
|
|
u64 *d;
|
2019-05-13 02:23:30 +00:00
|
|
|
|
2020-02-07 01:15:15 +00:00
|
|
|
for (d = (u64 *) ptrs.start;
|
|
|
|
d != (u64 *) ptrs.end;
|
|
|
|
d++)
|
|
|
|
*d = swab64(*d);
|
2019-05-13 02:23:30 +00:00
|
|
|
|
2020-02-07 01:15:15 +00:00
|
|
|
for (entry = ptrs.start;
|
|
|
|
entry < ptrs.end;
|
2019-11-16 21:25:58 +00:00
|
|
|
entry = extent_entry_next(entry)) {
|
|
|
|
switch (extent_entry_type(entry)) {
|
|
|
|
case BCH_EXTENT_ENTRY_ptr:
|
|
|
|
break;
|
|
|
|
case BCH_EXTENT_ENTRY_crc32:
|
|
|
|
entry->crc32.csum = swab32(entry->crc32.csum);
|
|
|
|
break;
|
|
|
|
case BCH_EXTENT_ENTRY_crc64:
|
|
|
|
entry->crc64.csum_hi = swab16(entry->crc64.csum_hi);
|
|
|
|
entry->crc64.csum_lo = swab64(entry->crc64.csum_lo);
|
|
|
|
break;
|
|
|
|
case BCH_EXTENT_ENTRY_crc128:
|
|
|
|
entry->crc128.csum.hi = (__force __le64)
|
|
|
|
swab64((__force u64) entry->crc128.csum.hi);
|
|
|
|
entry->crc128.csum.lo = (__force __le64)
|
|
|
|
swab64((__force u64) entry->crc128.csum.lo);
|
|
|
|
break;
|
|
|
|
case BCH_EXTENT_ENTRY_stripe_ptr:
|
|
|
|
break;
|
|
|
|
}
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
/* Generic extent code: */
|
|
|
|
|
|
|
|
int bch2_cut_front_s(struct bpos where, struct bkey_s k)
|
2017-03-17 06:18:50 +00:00
|
|
|
{
|
2019-11-16 21:25:58 +00:00
|
|
|
unsigned new_val_u64s = bkey_val_u64s(k.k);
|
|
|
|
int val_u64s_delta;
|
|
|
|
u64 sub;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (bkey_cmp(where, bkey_start_pos(k.k)) <= 0)
|
|
|
|
return 0;
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
EBUG_ON(bkey_cmp(where, k.k->p) > 0);
|
2019-03-25 19:10:15 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
sub = where.offset - bkey_start_offset(k.k);
|
2017-03-17 06:18:50 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
k.k->size -= sub;
|
|
|
|
|
|
|
|
if (!k.k->size) {
|
|
|
|
k.k->type = KEY_TYPE_deleted;
|
|
|
|
new_val_u64s = 0;
|
2017-03-17 06:18:50 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
switch (k.k->type) {
|
|
|
|
case KEY_TYPE_extent:
|
|
|
|
case KEY_TYPE_reflink_v: {
|
|
|
|
struct bkey_ptrs ptrs = bch2_bkey_ptrs(k);
|
|
|
|
union bch_extent_entry *entry;
|
|
|
|
bool seen_crc = false;
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
bkey_extent_entry_for_each(ptrs, entry) {
|
|
|
|
switch (extent_entry_type(entry)) {
|
|
|
|
case BCH_EXTENT_ENTRY_ptr:
|
|
|
|
if (!seen_crc)
|
|
|
|
entry->ptr.offset += sub;
|
|
|
|
break;
|
|
|
|
case BCH_EXTENT_ENTRY_crc32:
|
|
|
|
entry->crc32.offset += sub;
|
|
|
|
break;
|
|
|
|
case BCH_EXTENT_ENTRY_crc64:
|
|
|
|
entry->crc64.offset += sub;
|
|
|
|
break;
|
|
|
|
case BCH_EXTENT_ENTRY_crc128:
|
|
|
|
entry->crc128.offset += sub;
|
|
|
|
break;
|
|
|
|
case BCH_EXTENT_ENTRY_stripe_ptr:
|
|
|
|
break;
|
|
|
|
}
|
2019-01-21 20:32:13 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (extent_entry_is_crc(entry))
|
|
|
|
seen_crc = true;
|
|
|
|
}
|
2019-01-21 20:32:13 +00:00
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
2019-11-16 21:25:58 +00:00
|
|
|
case KEY_TYPE_reflink_p: {
|
|
|
|
struct bkey_s_reflink_p p = bkey_s_to_reflink_p(k);
|
|
|
|
|
|
|
|
le64_add_cpu(&p.v->idx, sub);
|
2019-01-21 20:32:13 +00:00
|
|
|
break;
|
|
|
|
}
|
2020-10-24 23:51:34 +00:00
|
|
|
case KEY_TYPE_inline_data:
|
|
|
|
case KEY_TYPE_indirect_inline_data: {
|
|
|
|
void *p = bkey_inline_data_p(k);
|
|
|
|
unsigned bytes = bkey_inline_data_bytes(k.k);
|
2019-01-21 20:32:13 +00:00
|
|
|
|
2020-10-24 23:51:34 +00:00
|
|
|
sub = min_t(u64, sub << 9, bytes);
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2020-10-24 23:51:34 +00:00
|
|
|
memmove(p, p + sub, bytes - sub);
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
new_val_u64s -= sub >> 3;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
val_u64s_delta = bkey_val_u64s(k.k) - new_val_u64s;
|
|
|
|
BUG_ON(val_u64s_delta < 0);
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
set_bkey_val_u64s(k.k, new_val_u64s);
|
|
|
|
memset(bkey_val_end(k), 0, val_u64s_delta * sizeof(u64));
|
|
|
|
return -val_u64s_delta;
|
2018-11-01 19:10:01 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
int bch2_cut_back_s(struct bpos where, struct bkey_s k)
|
2018-11-01 19:10:01 +00:00
|
|
|
{
|
2019-11-16 21:25:58 +00:00
|
|
|
unsigned new_val_u64s = bkey_val_u64s(k.k);
|
|
|
|
int val_u64s_delta;
|
|
|
|
u64 len = 0;
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
if (bkey_cmp(where, k.k->p) >= 0)
|
|
|
|
return 0;
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
EBUG_ON(bkey_cmp(where, bkey_start_pos(k.k)) < 0);
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
len = where.offset - bkey_start_offset(k.k);
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
k.k->p = where;
|
|
|
|
k.k->size = len;
|
|
|
|
|
|
|
|
if (!len) {
|
|
|
|
k.k->type = KEY_TYPE_deleted;
|
|
|
|
new_val_u64s = 0;
|
2018-11-01 19:10:01 +00:00
|
|
|
}
|
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
switch (k.k->type) {
|
|
|
|
case KEY_TYPE_inline_data:
|
2020-10-24 23:51:34 +00:00
|
|
|
case KEY_TYPE_indirect_inline_data:
|
|
|
|
new_val_u64s = (bkey_inline_data_offset(k.k) +
|
|
|
|
min(bkey_inline_data_bytes(k.k), k.k->size << 9)) >> 3;
|
2019-11-16 21:25:58 +00:00
|
|
|
break;
|
|
|
|
}
|
2018-11-01 19:10:01 +00:00
|
|
|
|
2019-11-16 21:25:58 +00:00
|
|
|
val_u64s_delta = bkey_val_u64s(k.k) - new_val_u64s;
|
|
|
|
BUG_ON(val_u64s_delta < 0);
|
|
|
|
|
|
|
|
set_bkey_val_u64s(k.k, new_val_u64s);
|
|
|
|
memset(bkey_val_end(k), 0, val_u64s_delta * sizeof(u64));
|
|
|
|
return -val_u64s_delta;
|
2018-11-01 19:10:01 +00:00
|
|
|
}
|