1 // SPDX-License-Identifier: GPL-2.0
4 #include "btree_key_cache.h"
5 #include "btree_write_buffer.h"
6 #include "bkey_methods.h"
7 #include "btree_update.h"
13 #include "extent_update.h"
17 #include "subvolume.h"
20 #include <linux/random.h>
22 #include <asm/unaligned.h>
24 #define x(name, ...) #name,
25 const char * const bch2_inode_opts[] = {
30 static const char * const bch2_inode_flag_strs[] = {
36 static const u8 byte_table[8] = { 1, 2, 3, 4, 6, 8, 10, 13 };
38 static int inode_decode_field(const u8 *in, const u8 *end,
39 u64 out[2], unsigned *out_bits)
41 __be64 be[2] = { 0, 0 };
42 unsigned bytes, shift;
52 * position of highest set bit indicates number of bytes:
53 * shift = number of bits to remove in high byte:
55 shift = 8 - __fls(*in); /* 1 <= shift <= 8 */
56 bytes = byte_table[shift - 1];
61 p = (u8 *) be + 16 - bytes;
63 *p ^= (1 << 8) >> shift;
65 out[0] = be64_to_cpu(be[0]);
66 out[1] = be64_to_cpu(be[1]);
67 *out_bits = out[0] ? 64 + fls64(out[0]) : fls64(out[1]);
72 static inline void bch2_inode_pack_inlined(struct bkey_inode_buf *packed,
73 const struct bch_inode_unpacked *inode)
75 struct bkey_i_inode_v3 *k = &packed->inode;
76 u8 *out = k->v.fields;
77 u8 *end = (void *) &packed[1];
78 u8 *last_nonzero_field = out;
79 unsigned nr_fields = 0, last_nonzero_fieldnr = 0;
83 bkey_inode_v3_init(&packed->inode.k_i);
84 packed->inode.k.p.offset = inode->bi_inum;
85 packed->inode.v.bi_journal_seq = cpu_to_le64(inode->bi_journal_seq);
86 packed->inode.v.bi_hash_seed = inode->bi_hash_seed;
87 packed->inode.v.bi_flags = cpu_to_le64(inode->bi_flags);
88 packed->inode.v.bi_sectors = cpu_to_le64(inode->bi_sectors);
89 packed->inode.v.bi_size = cpu_to_le64(inode->bi_size);
90 packed->inode.v.bi_version = cpu_to_le64(inode->bi_version);
91 SET_INODEv3_MODE(&packed->inode.v, inode->bi_mode);
92 SET_INODEv3_FIELDS_START(&packed->inode.v, INODEv3_FIELDS_START_CUR);
95 #define x(_name, _bits) \
99 ret = bch2_varint_encode_fast(out, inode->_name); \
105 last_nonzero_field = out; \
106 last_nonzero_fieldnr = nr_fields; \
114 BCH_INODE_FIELDS_v3()
118 out = last_nonzero_field;
119 nr_fields = last_nonzero_fieldnr;
121 bytes = out - (u8 *) &packed->inode.v;
122 set_bkey_val_bytes(&packed->inode.k, bytes);
123 memset_u64s_tail(&packed->inode.v, 0, bytes);
125 SET_INODEv3_NR_FIELDS(&k->v, nr_fields);
127 if (IS_ENABLED(CONFIG_BCACHEFS_DEBUG)) {
128 struct bch_inode_unpacked unpacked;
130 ret = bch2_inode_unpack(bkey_i_to_s_c(&packed->inode.k_i), &unpacked);
132 BUG_ON(unpacked.bi_inum != inode->bi_inum);
133 BUG_ON(unpacked.bi_hash_seed != inode->bi_hash_seed);
134 BUG_ON(unpacked.bi_sectors != inode->bi_sectors);
135 BUG_ON(unpacked.bi_size != inode->bi_size);
136 BUG_ON(unpacked.bi_version != inode->bi_version);
137 BUG_ON(unpacked.bi_mode != inode->bi_mode);
139 #define x(_name, _bits) if (unpacked._name != inode->_name) \
140 panic("unpacked %llu should be %llu", \
141 (u64) unpacked._name, (u64) inode->_name);
142 BCH_INODE_FIELDS_v3()
147 void bch2_inode_pack(struct bkey_inode_buf *packed,
148 const struct bch_inode_unpacked *inode)
150 bch2_inode_pack_inlined(packed, inode);
153 static noinline int bch2_inode_unpack_v1(struct bkey_s_c_inode inode,
154 struct bch_inode_unpacked *unpacked)
156 const u8 *in = inode.v->fields;
157 const u8 *end = bkey_val_end(inode);
159 unsigned fieldnr = 0, field_bits;
162 #define x(_name, _bits) \
163 if (fieldnr++ == INODE_NR_FIELDS(inode.v)) { \
164 unsigned offset = offsetof(struct bch_inode_unpacked, _name);\
165 memset((void *) unpacked + offset, 0, \
166 sizeof(*unpacked) - offset); \
170 ret = inode_decode_field(in, end, field, &field_bits); \
174 if (field_bits > sizeof(unpacked->_name) * 8) \
177 unpacked->_name = field[1]; \
180 BCH_INODE_FIELDS_v2()
183 /* XXX: signal if there were more fields than expected? */
187 static int bch2_inode_unpack_v2(struct bch_inode_unpacked *unpacked,
188 const u8 *in, const u8 *end,
191 unsigned fieldnr = 0;
195 #define x(_name, _bits) \
196 if (fieldnr < nr_fields) { \
197 ret = bch2_varint_decode_fast(in, end, &v[0]); \
203 ret = bch2_varint_decode_fast(in, end, &v[1]); \
214 unpacked->_name = v[0]; \
215 if (v[1] || v[0] != unpacked->_name) \
219 BCH_INODE_FIELDS_v2()
222 /* XXX: signal if there were more fields than expected? */
226 static int bch2_inode_unpack_v3(struct bkey_s_c k,
227 struct bch_inode_unpacked *unpacked)
229 struct bkey_s_c_inode_v3 inode = bkey_s_c_to_inode_v3(k);
230 const u8 *in = inode.v->fields;
231 const u8 *end = bkey_val_end(inode);
232 unsigned nr_fields = INODEv3_NR_FIELDS(inode.v);
233 unsigned fieldnr = 0;
237 unpacked->bi_inum = inode.k->p.offset;
238 unpacked->bi_journal_seq= le64_to_cpu(inode.v->bi_journal_seq);
239 unpacked->bi_hash_seed = inode.v->bi_hash_seed;
240 unpacked->bi_flags = le64_to_cpu(inode.v->bi_flags);
241 unpacked->bi_sectors = le64_to_cpu(inode.v->bi_sectors);
242 unpacked->bi_size = le64_to_cpu(inode.v->bi_size);
243 unpacked->bi_version = le64_to_cpu(inode.v->bi_version);
244 unpacked->bi_mode = INODEv3_MODE(inode.v);
246 #define x(_name, _bits) \
247 if (fieldnr < nr_fields) { \
248 ret = bch2_varint_decode_fast(in, end, &v[0]); \
254 ret = bch2_varint_decode_fast(in, end, &v[1]); \
265 unpacked->_name = v[0]; \
266 if (v[1] || v[0] != unpacked->_name) \
270 BCH_INODE_FIELDS_v3()
273 /* XXX: signal if there were more fields than expected? */
277 static noinline int bch2_inode_unpack_slowpath(struct bkey_s_c k,
278 struct bch_inode_unpacked *unpacked)
280 memset(unpacked, 0, sizeof(*unpacked));
283 case KEY_TYPE_inode: {
284 struct bkey_s_c_inode inode = bkey_s_c_to_inode(k);
286 unpacked->bi_inum = inode.k->p.offset;
287 unpacked->bi_journal_seq= 0;
288 unpacked->bi_hash_seed = inode.v->bi_hash_seed;
289 unpacked->bi_flags = le32_to_cpu(inode.v->bi_flags);
290 unpacked->bi_mode = le16_to_cpu(inode.v->bi_mode);
292 if (INODE_NEW_VARINT(inode.v)) {
293 return bch2_inode_unpack_v2(unpacked, inode.v->fields,
295 INODE_NR_FIELDS(inode.v));
297 return bch2_inode_unpack_v1(inode, unpacked);
301 case KEY_TYPE_inode_v2: {
302 struct bkey_s_c_inode_v2 inode = bkey_s_c_to_inode_v2(k);
304 unpacked->bi_inum = inode.k->p.offset;
305 unpacked->bi_journal_seq= le64_to_cpu(inode.v->bi_journal_seq);
306 unpacked->bi_hash_seed = inode.v->bi_hash_seed;
307 unpacked->bi_flags = le64_to_cpu(inode.v->bi_flags);
308 unpacked->bi_mode = le16_to_cpu(inode.v->bi_mode);
310 return bch2_inode_unpack_v2(unpacked, inode.v->fields,
312 INODEv2_NR_FIELDS(inode.v));
319 int bch2_inode_unpack(struct bkey_s_c k,
320 struct bch_inode_unpacked *unpacked)
322 if (likely(k.k->type == KEY_TYPE_inode_v3))
323 return bch2_inode_unpack_v3(k, unpacked);
324 return bch2_inode_unpack_slowpath(k, unpacked);
327 static int bch2_inode_peek_nowarn(struct btree_trans *trans,
328 struct btree_iter *iter,
329 struct bch_inode_unpacked *inode,
330 subvol_inum inum, unsigned flags)
336 ret = bch2_subvolume_get_snapshot(trans, inum.subvol, &snapshot);
340 k = bch2_bkey_get_iter(trans, iter, BTREE_ID_inodes,
341 SPOS(0, inum.inum, snapshot),
342 flags|BTREE_ITER_CACHED);
347 ret = bkey_is_inode(k.k) ? 0 : -BCH_ERR_ENOENT_inode;
351 ret = bch2_inode_unpack(k, inode);
357 bch2_trans_iter_exit(trans, iter);
361 int bch2_inode_peek(struct btree_trans *trans,
362 struct btree_iter *iter,
363 struct bch_inode_unpacked *inode,
364 subvol_inum inum, unsigned flags)
366 int ret = bch2_inode_peek_nowarn(trans, iter, inode, inum, flags);
367 bch_err_msg(trans->c, ret, "looking up inum %u:%llu:", inum.subvol, inum.inum);
371 int bch2_inode_write_flags(struct btree_trans *trans,
372 struct btree_iter *iter,
373 struct bch_inode_unpacked *inode,
374 enum btree_update_flags flags)
376 struct bkey_inode_buf *inode_p;
378 inode_p = bch2_trans_kmalloc(trans, sizeof(*inode_p));
380 return PTR_ERR(inode_p);
382 bch2_inode_pack_inlined(inode_p, inode);
383 inode_p->inode.k.p.snapshot = iter->snapshot;
384 return bch2_trans_update(trans, iter, &inode_p->inode.k_i, flags);
387 struct bkey_i *bch2_inode_to_v3(struct btree_trans *trans, struct bkey_i *k)
389 struct bch_inode_unpacked u;
390 struct bkey_inode_buf *inode_p;
393 if (!bkey_is_inode(&k->k))
394 return ERR_PTR(-ENOENT);
396 inode_p = bch2_trans_kmalloc(trans, sizeof(*inode_p));
398 return ERR_CAST(inode_p);
400 ret = bch2_inode_unpack(bkey_i_to_s_c(k), &u);
404 bch2_inode_pack(inode_p, &u);
405 return &inode_p->inode.k_i;
408 static int __bch2_inode_invalid(struct bch_fs *c, struct bkey_s_c k, struct printbuf *err)
410 struct bch_inode_unpacked unpacked;
413 bkey_fsck_err_on(k.k->p.inode, c, err,
414 inode_pos_inode_nonzero,
415 "nonzero k.p.inode");
417 bkey_fsck_err_on(k.k->p.offset < BLOCKDEV_INODE_MAX, c, err,
418 inode_pos_blockdev_range,
419 "fs inode in blockdev range");
421 bkey_fsck_err_on(bch2_inode_unpack(k, &unpacked), c, err,
423 "invalid variable length fields");
425 bkey_fsck_err_on(unpacked.bi_data_checksum >= BCH_CSUM_OPT_NR + 1, c, err,
426 inode_checksum_type_invalid,
427 "invalid data checksum type (%u >= %u",
428 unpacked.bi_data_checksum, BCH_CSUM_OPT_NR + 1);
430 bkey_fsck_err_on(unpacked.bi_compression &&
431 !bch2_compression_opt_valid(unpacked.bi_compression - 1), c, err,
432 inode_compression_type_invalid,
433 "invalid compression opt %u", unpacked.bi_compression - 1);
435 bkey_fsck_err_on((unpacked.bi_flags & BCH_INODE_unlinked) &&
436 unpacked.bi_nlink != 0, c, err,
437 inode_unlinked_but_nlink_nonzero,
438 "flagged as unlinked but bi_nlink != 0");
440 bkey_fsck_err_on(unpacked.bi_subvol && !S_ISDIR(unpacked.bi_mode), c, err,
441 inode_subvol_root_but_not_dir,
442 "subvolume root but not a directory");
447 int bch2_inode_invalid(struct bch_fs *c, struct bkey_s_c k,
448 enum bkey_invalid_flags flags,
449 struct printbuf *err)
451 struct bkey_s_c_inode inode = bkey_s_c_to_inode(k);
454 bkey_fsck_err_on(INODE_STR_HASH(inode.v) >= BCH_STR_HASH_NR, c, err,
455 inode_str_hash_invalid,
456 "invalid str hash type (%llu >= %u)",
457 INODE_STR_HASH(inode.v), BCH_STR_HASH_NR);
459 ret = __bch2_inode_invalid(c, k, err);
464 int bch2_inode_v2_invalid(struct bch_fs *c, struct bkey_s_c k,
465 enum bkey_invalid_flags flags,
466 struct printbuf *err)
468 struct bkey_s_c_inode_v2 inode = bkey_s_c_to_inode_v2(k);
471 bkey_fsck_err_on(INODEv2_STR_HASH(inode.v) >= BCH_STR_HASH_NR, c, err,
472 inode_str_hash_invalid,
473 "invalid str hash type (%llu >= %u)",
474 INODEv2_STR_HASH(inode.v), BCH_STR_HASH_NR);
476 ret = __bch2_inode_invalid(c, k, err);
481 int bch2_inode_v3_invalid(struct bch_fs *c, struct bkey_s_c k,
482 enum bkey_invalid_flags flags,
483 struct printbuf *err)
485 struct bkey_s_c_inode_v3 inode = bkey_s_c_to_inode_v3(k);
488 bkey_fsck_err_on(INODEv3_FIELDS_START(inode.v) < INODEv3_FIELDS_START_INITIAL ||
489 INODEv3_FIELDS_START(inode.v) > bkey_val_u64s(inode.k), c, err,
490 inode_v3_fields_start_bad,
491 "invalid fields_start (got %llu, min %u max %zu)",
492 INODEv3_FIELDS_START(inode.v),
493 INODEv3_FIELDS_START_INITIAL,
494 bkey_val_u64s(inode.k));
496 bkey_fsck_err_on(INODEv3_STR_HASH(inode.v) >= BCH_STR_HASH_NR, c, err,
497 inode_str_hash_invalid,
498 "invalid str hash type (%llu >= %u)",
499 INODEv3_STR_HASH(inode.v), BCH_STR_HASH_NR);
501 ret = __bch2_inode_invalid(c, k, err);
506 static void __bch2_inode_unpacked_to_text(struct printbuf *out,
507 struct bch_inode_unpacked *inode)
509 prt_printf(out, "mode=%o ", inode->bi_mode);
511 prt_str(out, "flags=");
512 prt_bitflags(out, bch2_inode_flag_strs, inode->bi_flags & ((1U << 20) - 1));
513 prt_printf(out, " (%x)", inode->bi_flags);
515 prt_printf(out, " journal_seq=%llu bi_size=%llu bi_sectors=%llu bi_version=%llu",
516 inode->bi_journal_seq,
521 #define x(_name, _bits) \
522 prt_printf(out, " "#_name "=%llu", (u64) inode->_name);
523 BCH_INODE_FIELDS_v3()
527 void bch2_inode_unpacked_to_text(struct printbuf *out, struct bch_inode_unpacked *inode)
529 prt_printf(out, "inum: %llu ", inode->bi_inum);
530 __bch2_inode_unpacked_to_text(out, inode);
533 void bch2_inode_to_text(struct printbuf *out, struct bch_fs *c, struct bkey_s_c k)
535 struct bch_inode_unpacked inode;
537 if (bch2_inode_unpack(k, &inode)) {
538 prt_printf(out, "(unpack error)");
542 __bch2_inode_unpacked_to_text(out, &inode);
545 static inline u64 bkey_inode_flags(struct bkey_s_c k)
549 return le32_to_cpu(bkey_s_c_to_inode(k).v->bi_flags);
550 case KEY_TYPE_inode_v2:
551 return le64_to_cpu(bkey_s_c_to_inode_v2(k).v->bi_flags);
552 case KEY_TYPE_inode_v3:
553 return le64_to_cpu(bkey_s_c_to_inode_v3(k).v->bi_flags);
559 static inline bool bkey_is_deleted_inode(struct bkey_s_c k)
561 return bkey_inode_flags(k) & BCH_INODE_unlinked;
564 int bch2_trans_mark_inode(struct btree_trans *trans,
565 enum btree_id btree_id, unsigned level,
570 int nr = bkey_is_inode(&new->k) - bkey_is_inode(old.k);
571 bool old_deleted = bkey_is_deleted_inode(old);
572 bool new_deleted = bkey_is_deleted_inode(bkey_i_to_s_c(new));
575 int ret = bch2_replicas_deltas_realloc(trans, 0);
576 struct replicas_delta_list *d = trans->fs_usage_deltas;
584 if (old_deleted != new_deleted) {
585 int ret = bch2_btree_bit_mod(trans, BTREE_ID_deleted_inodes, new->k.p, new_deleted);
593 int bch2_mark_inode(struct btree_trans *trans,
594 enum btree_id btree_id, unsigned level,
595 struct bkey_s_c old, struct bkey_s_c new,
598 struct bch_fs *c = trans->c;
599 struct bch_fs_usage *fs_usage;
600 u64 journal_seq = trans->journal_res.seq;
602 if (flags & BTREE_TRIGGER_INSERT) {
603 struct bch_inode_v3 *v = (struct bch_inode_v3 *) new.v;
605 BUG_ON(!journal_seq);
606 BUG_ON(new.k->type != KEY_TYPE_inode_v3);
608 v->bi_journal_seq = cpu_to_le64(journal_seq);
611 if (flags & BTREE_TRIGGER_GC) {
612 percpu_down_read(&c->mark_lock);
615 fs_usage = fs_usage_ptr(c, journal_seq, flags & BTREE_TRIGGER_GC);
616 fs_usage->nr_inodes += bkey_is_inode(new.k);
617 fs_usage->nr_inodes -= bkey_is_inode(old.k);
620 percpu_up_read(&c->mark_lock);
625 int bch2_inode_generation_invalid(struct bch_fs *c, struct bkey_s_c k,
626 enum bkey_invalid_flags flags,
627 struct printbuf *err)
631 bkey_fsck_err_on(k.k->p.inode, c, err,
632 inode_pos_inode_nonzero,
633 "nonzero k.p.inode");
638 void bch2_inode_generation_to_text(struct printbuf *out, struct bch_fs *c,
641 struct bkey_s_c_inode_generation gen = bkey_s_c_to_inode_generation(k);
643 prt_printf(out, "generation: %u", le32_to_cpu(gen.v->bi_generation));
646 void bch2_inode_init_early(struct bch_fs *c,
647 struct bch_inode_unpacked *inode_u)
649 enum bch_str_hash_type str_hash =
650 bch2_str_hash_opt_to_type(c, c->opts.str_hash);
652 memset(inode_u, 0, sizeof(*inode_u));
655 inode_u->bi_flags |= str_hash << INODE_STR_HASH_OFFSET;
656 get_random_bytes(&inode_u->bi_hash_seed,
657 sizeof(inode_u->bi_hash_seed));
660 void bch2_inode_init_late(struct bch_inode_unpacked *inode_u, u64 now,
661 uid_t uid, gid_t gid, umode_t mode, dev_t rdev,
662 struct bch_inode_unpacked *parent)
664 inode_u->bi_mode = mode;
665 inode_u->bi_uid = uid;
666 inode_u->bi_gid = gid;
667 inode_u->bi_dev = rdev;
668 inode_u->bi_atime = now;
669 inode_u->bi_mtime = now;
670 inode_u->bi_ctime = now;
671 inode_u->bi_otime = now;
673 if (parent && parent->bi_mode & S_ISGID) {
674 inode_u->bi_gid = parent->bi_gid;
676 inode_u->bi_mode |= S_ISGID;
680 #define x(_name, ...) inode_u->bi_##_name = parent->bi_##_name;
686 void bch2_inode_init(struct bch_fs *c, struct bch_inode_unpacked *inode_u,
687 uid_t uid, gid_t gid, umode_t mode, dev_t rdev,
688 struct bch_inode_unpacked *parent)
690 bch2_inode_init_early(c, inode_u);
691 bch2_inode_init_late(inode_u, bch2_current_time(c),
692 uid, gid, mode, rdev, parent);
695 static inline u32 bkey_generation(struct bkey_s_c k)
699 case KEY_TYPE_inode_v2:
701 case KEY_TYPE_inode_generation:
702 return le32_to_cpu(bkey_s_c_to_inode_generation(k).v->bi_generation);
709 * This just finds an empty slot:
711 int bch2_inode_create(struct btree_trans *trans,
712 struct btree_iter *iter,
713 struct bch_inode_unpacked *inode_u,
714 u32 snapshot, u64 cpu)
716 struct bch_fs *c = trans->c;
718 u64 min, max, start, pos, *hint;
720 unsigned bits = (c->opts.inodes_32bit ? 31 : 63);
722 if (c->opts.shard_inode_numbers) {
723 bits -= c->inode_shard_bits;
726 max = (cpu << bits) | ~(ULLONG_MAX << bits);
728 min = max_t(u64, min, BLOCKDEV_INODE_MAX);
729 hint = c->unused_inode_hints + cpu;
731 min = BLOCKDEV_INODE_MAX;
732 max = ~(ULLONG_MAX << bits);
733 hint = c->unused_inode_hints;
736 start = READ_ONCE(*hint);
738 if (start >= max || start < min)
742 bch2_trans_iter_init(trans, iter, BTREE_ID_inodes, POS(0, pos),
743 BTREE_ITER_ALL_SNAPSHOTS|
746 while ((k = bch2_btree_iter_peek(iter)).k &&
747 !(ret = bkey_err(k)) &&
748 bkey_lt(k.k->p, POS(0, max))) {
749 if (pos < iter->pos.offset)
753 * We don't need to iterate over keys in every snapshot once
754 * we've found just one:
756 pos = iter->pos.offset + 1;
757 bch2_btree_iter_set_pos(iter, POS(0, pos));
760 if (!ret && pos < max)
763 if (!ret && start == min)
764 ret = -BCH_ERR_ENOSPC_inode_create;
767 bch2_trans_iter_exit(trans, iter);
771 /* Retry from start */
773 bch2_btree_iter_set_pos(iter, POS(0, pos));
776 bch2_btree_iter_set_pos(iter, SPOS(0, pos, snapshot));
777 k = bch2_btree_iter_peek_slot(iter);
780 bch2_trans_iter_exit(trans, iter);
784 *hint = k.k->p.offset;
785 inode_u->bi_inum = k.k->p.offset;
786 inode_u->bi_generation = bkey_generation(k);
790 static int bch2_inode_delete_keys(struct btree_trans *trans,
791 subvol_inum inum, enum btree_id id)
793 struct btree_iter iter;
795 struct bkey_i delete;
796 struct bpos end = POS(inum.inum, U64_MAX);
801 * We're never going to be deleting partial extents, no need to use an
804 bch2_trans_iter_init(trans, &iter, id, POS(inum.inum, 0),
808 bch2_trans_begin(trans);
810 ret = bch2_subvolume_get_snapshot(trans, inum.subvol, &snapshot);
814 bch2_btree_iter_set_snapshot(&iter, snapshot);
816 k = bch2_btree_iter_peek_upto(&iter, end);
824 bkey_init(&delete.k);
825 delete.k.p = iter.pos;
827 if (iter.flags & BTREE_ITER_IS_EXTENTS)
828 bch2_key_resize(&delete.k,
829 bpos_min(end, k.k->p).offset -
832 ret = bch2_trans_update(trans, &iter, &delete, 0) ?:
833 bch2_trans_commit(trans, NULL, NULL,
834 BCH_TRANS_COMMIT_no_enospc);
836 if (ret && !bch2_err_matches(ret, BCH_ERR_transaction_restart))
840 bch2_trans_iter_exit(trans, &iter);
844 int bch2_inode_rm(struct bch_fs *c, subvol_inum inum)
846 struct btree_trans *trans = bch2_trans_get(c);
847 struct btree_iter iter = { NULL };
848 struct bkey_i_inode_generation delete;
849 struct bch_inode_unpacked inode_u;
855 * If this was a directory, there shouldn't be any real dirents left -
856 * but there could be whiteouts (from hash collisions) that we should
859 * XXX: the dirent could ideally would delete whiteouts when they're no
862 ret = bch2_inode_delete_keys(trans, inum, BTREE_ID_extents) ?:
863 bch2_inode_delete_keys(trans, inum, BTREE_ID_xattrs) ?:
864 bch2_inode_delete_keys(trans, inum, BTREE_ID_dirents);
868 bch2_trans_begin(trans);
870 ret = bch2_subvolume_get_snapshot(trans, inum.subvol, &snapshot);
874 k = bch2_bkey_get_iter(trans, &iter, BTREE_ID_inodes,
875 SPOS(0, inum.inum, snapshot),
876 BTREE_ITER_INTENT|BTREE_ITER_CACHED);
881 if (!bkey_is_inode(k.k)) {
882 bch2_fs_inconsistent(c,
883 "inode %llu:%u not found when deleting",
884 inum.inum, snapshot);
889 bch2_inode_unpack(k, &inode_u);
891 bkey_inode_generation_init(&delete.k_i);
892 delete.k.p = iter.pos;
893 delete.v.bi_generation = cpu_to_le32(inode_u.bi_generation + 1);
895 ret = bch2_trans_update(trans, &iter, &delete.k_i, 0) ?:
896 bch2_trans_commit(trans, NULL, NULL,
897 BCH_TRANS_COMMIT_no_enospc);
899 bch2_trans_iter_exit(trans, &iter);
900 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
903 bch2_trans_put(trans);
907 int bch2_inode_find_by_inum_nowarn_trans(struct btree_trans *trans,
909 struct bch_inode_unpacked *inode)
911 struct btree_iter iter;
914 ret = bch2_inode_peek_nowarn(trans, &iter, inode, inum, 0);
916 bch2_trans_iter_exit(trans, &iter);
920 int bch2_inode_find_by_inum_trans(struct btree_trans *trans,
922 struct bch_inode_unpacked *inode)
924 struct btree_iter iter;
927 ret = bch2_inode_peek(trans, &iter, inode, inum, 0);
929 bch2_trans_iter_exit(trans, &iter);
933 int bch2_inode_find_by_inum(struct bch_fs *c, subvol_inum inum,
934 struct bch_inode_unpacked *inode)
936 return bch2_trans_do(c, NULL, NULL, 0,
937 bch2_inode_find_by_inum_trans(trans, inum, inode));
940 int bch2_inode_nlink_inc(struct bch_inode_unpacked *bi)
942 if (bi->bi_flags & BCH_INODE_unlinked)
943 bi->bi_flags &= ~BCH_INODE_unlinked;
945 if (bi->bi_nlink == U32_MAX)
954 void bch2_inode_nlink_dec(struct btree_trans *trans, struct bch_inode_unpacked *bi)
956 if (bi->bi_nlink && (bi->bi_flags & BCH_INODE_unlinked)) {
957 bch2_trans_inconsistent(trans, "inode %llu unlinked but link count nonzero",
962 if (bi->bi_flags & BCH_INODE_unlinked) {
963 bch2_trans_inconsistent(trans, "inode %llu link count underflow", bi->bi_inum);
970 bi->bi_flags |= BCH_INODE_unlinked;
973 struct bch_opts bch2_inode_opts_to_opts(struct bch_inode_unpacked *inode)
975 struct bch_opts ret = { 0 };
976 #define x(_name, _bits) \
977 if (inode->bi_##_name) \
978 opt_set(ret, _name, inode->bi_##_name - 1);
984 void bch2_inode_opts_get(struct bch_io_opts *opts, struct bch_fs *c,
985 struct bch_inode_unpacked *inode)
987 #define x(_name, _bits) opts->_name = inode_opt_get(c, inode, _name);
992 opts->compression = opts->background_compression = opts->data_checksum = opts->erasure_code = 0;
995 int bch2_inum_opts_get(struct btree_trans *trans, subvol_inum inum, struct bch_io_opts *opts)
997 struct bch_inode_unpacked inode;
998 int ret = lockrestart_do(trans, bch2_inode_find_by_inum_trans(trans, inum, &inode));
1003 bch2_inode_opts_get(opts, trans->c, &inode);
1007 int bch2_inode_rm_snapshot(struct btree_trans *trans, u64 inum, u32 snapshot)
1009 struct bch_fs *c = trans->c;
1010 struct btree_iter iter = { NULL };
1011 struct bkey_i_inode_generation delete;
1012 struct bch_inode_unpacked inode_u;
1017 ret = bch2_btree_delete_range_trans(trans, BTREE_ID_extents,
1018 SPOS(inum, 0, snapshot),
1019 SPOS(inum, U64_MAX, snapshot),
1021 bch2_btree_delete_range_trans(trans, BTREE_ID_dirents,
1022 SPOS(inum, 0, snapshot),
1023 SPOS(inum, U64_MAX, snapshot),
1025 bch2_btree_delete_range_trans(trans, BTREE_ID_xattrs,
1026 SPOS(inum, 0, snapshot),
1027 SPOS(inum, U64_MAX, snapshot),
1029 } while (ret == -BCH_ERR_transaction_restart_nested);
1033 bch2_trans_begin(trans);
1035 k = bch2_bkey_get_iter(trans, &iter, BTREE_ID_inodes,
1036 SPOS(0, inum, snapshot), BTREE_ITER_INTENT);
1041 if (!bkey_is_inode(k.k)) {
1042 bch2_fs_inconsistent(c,
1043 "inode %llu:%u not found when deleting",
1049 bch2_inode_unpack(k, &inode_u);
1051 /* Subvolume root? */
1052 if (inode_u.bi_subvol)
1053 bch_warn(c, "deleting inode %llu marked as unlinked, but also a subvolume root!?", inode_u.bi_inum);
1055 bkey_inode_generation_init(&delete.k_i);
1056 delete.k.p = iter.pos;
1057 delete.v.bi_generation = cpu_to_le32(inode_u.bi_generation + 1);
1059 ret = bch2_trans_update(trans, &iter, &delete.k_i, 0) ?:
1060 bch2_trans_commit(trans, NULL, NULL,
1061 BCH_TRANS_COMMIT_no_enospc);
1063 bch2_trans_iter_exit(trans, &iter);
1064 if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
1067 return ret ?: -BCH_ERR_transaction_restart_nested;
1070 static int may_delete_deleted_inode(struct btree_trans *trans,
1071 struct btree_iter *iter,
1073 bool *need_another_pass)
1075 struct bch_fs *c = trans->c;
1076 struct btree_iter inode_iter;
1078 struct bch_inode_unpacked inode;
1081 k = bch2_bkey_get_iter(trans, &inode_iter, BTREE_ID_inodes, pos, BTREE_ITER_CACHED);
1086 ret = bkey_is_inode(k.k) ? 0 : -BCH_ERR_ENOENT_inode;
1087 if (fsck_err_on(!bkey_is_inode(k.k), c,
1088 deleted_inode_missing,
1089 "nonexistent inode %llu:%u in deleted_inodes btree",
1090 pos.offset, pos.snapshot))
1093 ret = bch2_inode_unpack(k, &inode);
1097 if (S_ISDIR(inode.bi_mode)) {
1098 ret = bch2_empty_dir_snapshot(trans, pos.offset, pos.snapshot);
1099 if (fsck_err_on(ret == -ENOTEMPTY, c, deleted_inode_is_dir,
1100 "non empty directory %llu:%u in deleted_inodes btree",
1101 pos.offset, pos.snapshot))
1107 if (fsck_err_on(!(inode.bi_flags & BCH_INODE_unlinked), c,
1108 deleted_inode_not_unlinked,
1109 "non-deleted inode %llu:%u in deleted_inodes btree",
1110 pos.offset, pos.snapshot))
1115 deleted_inode_but_clean,
1116 "filesystem marked as clean but have deleted inode %llu:%u",
1117 pos.offset, pos.snapshot)) {
1122 if (bch2_snapshot_is_internal_node(c, pos.snapshot)) {
1123 struct bpos new_min_pos;
1125 ret = bch2_propagate_key_to_snapshot_leaves(trans, inode_iter.btree_id, k, &new_min_pos);
1129 inode.bi_flags &= ~BCH_INODE_unlinked;
1131 ret = bch2_inode_write_flags(trans, &inode_iter, &inode,
1132 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
1133 bch_err_msg(c, ret, "clearing inode unlinked flag");
1138 * We'll need another write buffer flush to pick up the new
1139 * unlinked inodes in the snapshot leaves:
1141 *need_another_pass = true;
1148 bch2_trans_iter_exit(trans, &inode_iter);
1151 ret = bch2_btree_bit_mod(trans, BTREE_ID_deleted_inodes, pos, false);
1155 int bch2_delete_dead_inodes(struct bch_fs *c)
1157 struct btree_trans *trans = bch2_trans_get(c);
1158 struct btree_iter iter;
1160 bool need_another_pass;
1163 need_another_pass = false;
1166 * Weird transaction restart handling here because on successful delete,
1167 * bch2_inode_rm_snapshot() will return a nested transaction restart,
1168 * but we can't retry because the btree write buffer won't have been
1169 * flushed and we'd spin:
1171 ret = for_each_btree_key_commit(trans, iter, BTREE_ID_deleted_inodes, POS_MIN,
1172 BTREE_ITER_PREFETCH|BTREE_ITER_ALL_SNAPSHOTS, k,
1173 NULL, NULL, BCH_TRANS_COMMIT_no_enospc, ({
1174 ret = may_delete_deleted_inode(trans, &iter, k.k->p, &need_another_pass);
1176 bch_verbose(c, "deleting unlinked inode %llu:%u", k.k->p.offset, k.k->p.snapshot);
1178 ret = bch2_inode_rm_snapshot(trans, k.k->p.offset, k.k->p.snapshot);
1180 * We don't want to loop here: a transaction restart
1181 * error here means we handled a transaction restart and
1182 * we're actually done, but if we loop we'll retry the
1183 * same key because the write buffer hasn't been flushed
1186 if (bch2_err_matches(ret, BCH_ERR_transaction_restart)) {
1195 if (!ret && need_another_pass) {
1196 ret = bch2_btree_write_buffer_flush_sync(trans);
1202 bch2_trans_put(trans);