8b3e9bd65f
On transaction restart iterators won't be locked anymore - make sure we're always checking for errors. Signed-off-by: Kent Overstreet <kent.overstreet@gmail.com>
421 lines
10 KiB
C
421 lines
10 KiB
C
// SPDX-License-Identifier: GPL-2.0
|
|
|
|
#include "bcachefs.h"
|
|
#include "bkey_methods.h"
|
|
#include "btree_update.h"
|
|
#include "extents.h"
|
|
#include "dirent.h"
|
|
#include "fs.h"
|
|
#include "keylist.h"
|
|
#include "str_hash.h"
|
|
|
|
#include <linux/dcache.h>
|
|
|
|
unsigned bch2_dirent_name_bytes(struct bkey_s_c_dirent d)
|
|
{
|
|
unsigned len = bkey_val_bytes(d.k) -
|
|
offsetof(struct bch_dirent, d_name);
|
|
|
|
return strnlen(d.v->d_name, len);
|
|
}
|
|
|
|
static u64 bch2_dirent_hash(const struct bch_hash_info *info,
|
|
const struct qstr *name)
|
|
{
|
|
struct bch_str_hash_ctx ctx;
|
|
|
|
bch2_str_hash_init(&ctx, info);
|
|
bch2_str_hash_update(&ctx, info, name->name, name->len);
|
|
|
|
/* [0,2) reserved for dots */
|
|
return max_t(u64, bch2_str_hash_end(&ctx, info), 2);
|
|
}
|
|
|
|
static u64 dirent_hash_key(const struct bch_hash_info *info, const void *key)
|
|
{
|
|
return bch2_dirent_hash(info, key);
|
|
}
|
|
|
|
static u64 dirent_hash_bkey(const struct bch_hash_info *info, struct bkey_s_c k)
|
|
{
|
|
struct bkey_s_c_dirent d = bkey_s_c_to_dirent(k);
|
|
struct qstr name = QSTR_INIT(d.v->d_name, bch2_dirent_name_bytes(d));
|
|
|
|
return bch2_dirent_hash(info, &name);
|
|
}
|
|
|
|
static bool dirent_cmp_key(struct bkey_s_c _l, const void *_r)
|
|
{
|
|
struct bkey_s_c_dirent l = bkey_s_c_to_dirent(_l);
|
|
int len = bch2_dirent_name_bytes(l);
|
|
const struct qstr *r = _r;
|
|
|
|
return len - r->len ?: memcmp(l.v->d_name, r->name, len);
|
|
}
|
|
|
|
static bool dirent_cmp_bkey(struct bkey_s_c _l, struct bkey_s_c _r)
|
|
{
|
|
struct bkey_s_c_dirent l = bkey_s_c_to_dirent(_l);
|
|
struct bkey_s_c_dirent r = bkey_s_c_to_dirent(_r);
|
|
int l_len = bch2_dirent_name_bytes(l);
|
|
int r_len = bch2_dirent_name_bytes(r);
|
|
|
|
return l_len - r_len ?: memcmp(l.v->d_name, r.v->d_name, l_len);
|
|
}
|
|
|
|
const struct bch_hash_desc bch2_dirent_hash_desc = {
|
|
.btree_id = BTREE_ID_dirents,
|
|
.key_type = KEY_TYPE_dirent,
|
|
.hash_key = dirent_hash_key,
|
|
.hash_bkey = dirent_hash_bkey,
|
|
.cmp_key = dirent_cmp_key,
|
|
.cmp_bkey = dirent_cmp_bkey,
|
|
};
|
|
|
|
const char *bch2_dirent_invalid(const struct bch_fs *c, struct bkey_s_c k)
|
|
{
|
|
struct bkey_s_c_dirent d = bkey_s_c_to_dirent(k);
|
|
unsigned len;
|
|
|
|
if (bkey_val_bytes(k.k) < sizeof(struct bch_dirent))
|
|
return "value too small";
|
|
|
|
len = bch2_dirent_name_bytes(d);
|
|
if (!len)
|
|
return "empty name";
|
|
|
|
if (bkey_val_u64s(k.k) > dirent_val_u64s(len))
|
|
return "value too big";
|
|
|
|
if (len > BCH_NAME_MAX)
|
|
return "dirent name too big";
|
|
|
|
if (len == 1 && !memcmp(d.v->d_name, ".", 1))
|
|
return "invalid name";
|
|
|
|
if (len == 2 && !memcmp(d.v->d_name, "..", 2))
|
|
return "invalid name";
|
|
|
|
if (memchr(d.v->d_name, '/', len))
|
|
return "invalid name";
|
|
|
|
if (le64_to_cpu(d.v->d_inum) == d.k->p.inode)
|
|
return "dirent points to own directory";
|
|
|
|
return NULL;
|
|
}
|
|
|
|
void bch2_dirent_to_text(struct printbuf *out, struct bch_fs *c,
|
|
struct bkey_s_c k)
|
|
{
|
|
struct bkey_s_c_dirent d = bkey_s_c_to_dirent(k);
|
|
|
|
bch_scnmemcpy(out, d.v->d_name,
|
|
bch2_dirent_name_bytes(d));
|
|
pr_buf(out, " -> %llu type %s", d.v->d_inum,
|
|
d.v->d_type < DT_MAX
|
|
? bch2_d_types[d.v->d_type]
|
|
: "(bad d_type)");
|
|
}
|
|
|
|
static struct bkey_i_dirent *dirent_create_key(struct btree_trans *trans,
|
|
u8 type, const struct qstr *name, u64 dst)
|
|
{
|
|
struct bkey_i_dirent *dirent;
|
|
unsigned u64s = BKEY_U64s + dirent_val_u64s(name->len);
|
|
|
|
if (name->len > BCH_NAME_MAX)
|
|
return ERR_PTR(-ENAMETOOLONG);
|
|
|
|
BUG_ON(u64s > U8_MAX);
|
|
|
|
dirent = bch2_trans_kmalloc(trans, u64s * sizeof(u64));
|
|
if (IS_ERR(dirent))
|
|
return dirent;
|
|
|
|
bkey_dirent_init(&dirent->k_i);
|
|
dirent->k.u64s = u64s;
|
|
dirent->v.d_inum = cpu_to_le64(dst);
|
|
dirent->v.d_type = type;
|
|
|
|
memcpy(dirent->v.d_name, name->name, name->len);
|
|
memset(dirent->v.d_name + name->len, 0,
|
|
bkey_val_bytes(&dirent->k) -
|
|
offsetof(struct bch_dirent, d_name) -
|
|
name->len);
|
|
|
|
EBUG_ON(bch2_dirent_name_bytes(dirent_i_to_s_c(dirent)) != name->len);
|
|
|
|
return dirent;
|
|
}
|
|
|
|
int bch2_dirent_create(struct btree_trans *trans,
|
|
u64 dir_inum, const struct bch_hash_info *hash_info,
|
|
u8 type, const struct qstr *name, u64 dst_inum,
|
|
u64 *dir_offset, int flags)
|
|
{
|
|
struct bkey_i_dirent *dirent;
|
|
int ret;
|
|
|
|
dirent = dirent_create_key(trans, type, name, dst_inum);
|
|
ret = PTR_ERR_OR_ZERO(dirent);
|
|
if (ret)
|
|
return ret;
|
|
|
|
ret = bch2_hash_set(trans, bch2_dirent_hash_desc, hash_info,
|
|
dir_inum, &dirent->k_i, flags);
|
|
*dir_offset = dirent->k.p.offset;
|
|
|
|
return ret;
|
|
}
|
|
|
|
static void dirent_copy_target(struct bkey_i_dirent *dst,
|
|
struct bkey_s_c_dirent src)
|
|
{
|
|
dst->v.d_inum = src.v->d_inum;
|
|
dst->v.d_type = src.v->d_type;
|
|
}
|
|
|
|
int bch2_dirent_rename(struct btree_trans *trans,
|
|
u64 src_dir, struct bch_hash_info *src_hash,
|
|
u64 dst_dir, struct bch_hash_info *dst_hash,
|
|
const struct qstr *src_name, u64 *src_inum, u64 *src_offset,
|
|
const struct qstr *dst_name, u64 *dst_inum, u64 *dst_offset,
|
|
enum bch_rename_mode mode)
|
|
{
|
|
struct btree_iter *src_iter = NULL, *dst_iter = NULL;
|
|
struct bkey_s_c old_src, old_dst;
|
|
struct bkey_i_dirent *new_src = NULL, *new_dst = NULL;
|
|
struct bpos dst_pos =
|
|
POS(dst_dir, bch2_dirent_hash(dst_hash, dst_name));
|
|
int ret = 0;
|
|
|
|
*src_inum = *dst_inum = 0;
|
|
|
|
/*
|
|
* Lookup dst:
|
|
*
|
|
* Note that in BCH_RENAME mode, we're _not_ checking if
|
|
* the target already exists - we're relying on the VFS
|
|
* to do that check for us for correctness:
|
|
*/
|
|
dst_iter = mode == BCH_RENAME
|
|
? bch2_hash_hole(trans, bch2_dirent_hash_desc,
|
|
dst_hash, dst_dir, dst_name)
|
|
: bch2_hash_lookup(trans, bch2_dirent_hash_desc,
|
|
dst_hash, dst_dir, dst_name,
|
|
BTREE_ITER_INTENT);
|
|
ret = PTR_ERR_OR_ZERO(dst_iter);
|
|
if (ret)
|
|
goto out;
|
|
|
|
old_dst = bch2_btree_iter_peek_slot(dst_iter);
|
|
ret = bkey_err(old_dst);
|
|
if (ret)
|
|
goto out;
|
|
|
|
if (mode != BCH_RENAME)
|
|
*dst_inum = le64_to_cpu(bkey_s_c_to_dirent(old_dst).v->d_inum);
|
|
if (mode != BCH_RENAME_EXCHANGE)
|
|
*src_offset = dst_iter->pos.offset;
|
|
|
|
/* Lookup src: */
|
|
src_iter = bch2_hash_lookup(trans, bch2_dirent_hash_desc,
|
|
src_hash, src_dir, src_name,
|
|
BTREE_ITER_INTENT);
|
|
ret = PTR_ERR_OR_ZERO(src_iter);
|
|
if (ret)
|
|
goto out;
|
|
|
|
old_src = bch2_btree_iter_peek_slot(src_iter);
|
|
ret = bkey_err(old_src);
|
|
if (ret)
|
|
goto out;
|
|
|
|
*src_inum = le64_to_cpu(bkey_s_c_to_dirent(old_src).v->d_inum);
|
|
|
|
/* Create new dst key: */
|
|
new_dst = dirent_create_key(trans, 0, dst_name, 0);
|
|
ret = PTR_ERR_OR_ZERO(new_dst);
|
|
if (ret)
|
|
goto out;
|
|
|
|
dirent_copy_target(new_dst, bkey_s_c_to_dirent(old_src));
|
|
new_dst->k.p = dst_iter->pos;
|
|
|
|
/* Create new src key: */
|
|
if (mode == BCH_RENAME_EXCHANGE) {
|
|
new_src = dirent_create_key(trans, 0, src_name, 0);
|
|
ret = PTR_ERR_OR_ZERO(new_src);
|
|
if (ret)
|
|
goto out;
|
|
|
|
dirent_copy_target(new_src, bkey_s_c_to_dirent(old_dst));
|
|
new_src->k.p = src_iter->pos;
|
|
} else {
|
|
new_src = bch2_trans_kmalloc(trans, sizeof(struct bkey_i));
|
|
ret = PTR_ERR_OR_ZERO(new_src);
|
|
if (ret)
|
|
goto out;
|
|
|
|
bkey_init(&new_src->k);
|
|
new_src->k.p = src_iter->pos;
|
|
|
|
if (bkey_cmp(dst_pos, src_iter->pos) <= 0 &&
|
|
bkey_cmp(src_iter->pos, dst_iter->pos) < 0) {
|
|
/*
|
|
* We have a hash collision for the new dst key,
|
|
* and new_src - the key we're deleting - is between
|
|
* new_dst's hashed slot and the slot we're going to be
|
|
* inserting it into - oops. This will break the hash
|
|
* table if we don't deal with it:
|
|
*/
|
|
if (mode == BCH_RENAME) {
|
|
/*
|
|
* If we're not overwriting, we can just insert
|
|
* new_dst at the src position:
|
|
*/
|
|
new_dst->k.p = src_iter->pos;
|
|
bch2_trans_update(trans, src_iter,
|
|
&new_dst->k_i, 0);
|
|
goto out_set_offset;
|
|
} else {
|
|
/* If we're overwriting, we can't insert new_dst
|
|
* at a different slot because it has to
|
|
* overwrite old_dst - just make sure to use a
|
|
* whiteout when deleting src:
|
|
*/
|
|
new_src->k.type = KEY_TYPE_hash_whiteout;
|
|
}
|
|
} else {
|
|
/* Check if we need a whiteout to delete src: */
|
|
ret = bch2_hash_needs_whiteout(trans, bch2_dirent_hash_desc,
|
|
src_hash, src_iter);
|
|
if (ret < 0)
|
|
goto out;
|
|
|
|
if (ret)
|
|
new_src->k.type = KEY_TYPE_hash_whiteout;
|
|
}
|
|
}
|
|
|
|
bch2_trans_update(trans, src_iter, &new_src->k_i, 0);
|
|
bch2_trans_update(trans, dst_iter, &new_dst->k_i, 0);
|
|
out_set_offset:
|
|
if (mode == BCH_RENAME_EXCHANGE)
|
|
*src_offset = new_src->k.p.offset;
|
|
*dst_offset = new_dst->k.p.offset;
|
|
out:
|
|
bch2_trans_iter_put(trans, src_iter);
|
|
bch2_trans_iter_put(trans, dst_iter);
|
|
return ret;
|
|
}
|
|
|
|
int bch2_dirent_delete_at(struct btree_trans *trans,
|
|
const struct bch_hash_info *hash_info,
|
|
struct btree_iter *iter)
|
|
{
|
|
return bch2_hash_delete_at(trans, bch2_dirent_hash_desc,
|
|
hash_info, iter);
|
|
}
|
|
|
|
struct btree_iter *
|
|
__bch2_dirent_lookup_trans(struct btree_trans *trans, u64 dir_inum,
|
|
const struct bch_hash_info *hash_info,
|
|
const struct qstr *name, unsigned flags)
|
|
{
|
|
return bch2_hash_lookup(trans, bch2_dirent_hash_desc,
|
|
hash_info, dir_inum, name, flags);
|
|
}
|
|
|
|
u64 bch2_dirent_lookup(struct bch_fs *c, u64 dir_inum,
|
|
const struct bch_hash_info *hash_info,
|
|
const struct qstr *name)
|
|
{
|
|
struct btree_trans trans;
|
|
struct btree_iter *iter;
|
|
struct bkey_s_c k;
|
|
u64 inum = 0;
|
|
int ret = 0;
|
|
|
|
bch2_trans_init(&trans, c, 0, 0);
|
|
|
|
iter = __bch2_dirent_lookup_trans(&trans, dir_inum,
|
|
hash_info, name, 0);
|
|
ret = PTR_ERR_OR_ZERO(iter);
|
|
if (ret)
|
|
goto out;
|
|
|
|
k = bch2_btree_iter_peek_slot(iter);
|
|
ret = bkey_err(k);
|
|
if (ret)
|
|
goto out;
|
|
|
|
inum = le64_to_cpu(bkey_s_c_to_dirent(k).v->d_inum);
|
|
bch2_trans_iter_put(&trans, iter);
|
|
out:
|
|
BUG_ON(ret == -EINTR);
|
|
bch2_trans_exit(&trans);
|
|
return inum;
|
|
}
|
|
|
|
int bch2_empty_dir_trans(struct btree_trans *trans, u64 dir_inum)
|
|
{
|
|
struct btree_iter *iter;
|
|
struct bkey_s_c k;
|
|
int ret;
|
|
|
|
for_each_btree_key(trans, iter, BTREE_ID_dirents,
|
|
POS(dir_inum, 0), 0, k, ret) {
|
|
if (k.k->p.inode > dir_inum)
|
|
break;
|
|
|
|
if (k.k->type == KEY_TYPE_dirent) {
|
|
ret = -ENOTEMPTY;
|
|
break;
|
|
}
|
|
}
|
|
bch2_trans_iter_put(trans, iter);
|
|
|
|
return ret;
|
|
}
|
|
|
|
int bch2_readdir(struct bch_fs *c, u64 inum, struct dir_context *ctx)
|
|
{
|
|
struct btree_trans trans;
|
|
struct btree_iter *iter;
|
|
struct bkey_s_c k;
|
|
struct bkey_s_c_dirent dirent;
|
|
int ret;
|
|
|
|
bch2_trans_init(&trans, c, 0, 0);
|
|
|
|
for_each_btree_key(&trans, iter, BTREE_ID_dirents,
|
|
POS(inum, ctx->pos), 0, k, ret) {
|
|
if (k.k->p.inode > inum)
|
|
break;
|
|
|
|
if (k.k->type != KEY_TYPE_dirent)
|
|
continue;
|
|
|
|
dirent = bkey_s_c_to_dirent(k);
|
|
|
|
/*
|
|
* XXX: dir_emit() can fault and block, while we're holding
|
|
* locks
|
|
*/
|
|
ctx->pos = dirent.k->p.offset;
|
|
if (!dir_emit(ctx, dirent.v->d_name,
|
|
bch2_dirent_name_bytes(dirent),
|
|
le64_to_cpu(dirent.v->d_inum),
|
|
dirent.v->d_type))
|
|
break;
|
|
ctx->pos = dirent.k->p.offset + 1;
|
|
}
|
|
bch2_trans_iter_put(&trans, iter);
|
|
|
|
ret = bch2_trans_exit(&trans) ?: ret;
|
|
|
|
return ret;
|
|
}
|