git.sesse.net Git - bcachefs-tools-debian/blob - libbcachefs/inode.c

   1 // SPDX-License-Identifier: GPL-2.0
   2
   3 #include "bcachefs.h"
   4 #include "btree_key_cache.h"
   5 #include "btree_write_buffer.h"
   6 #include "bkey_methods.h"
   7 #include "btree_update.h"
   8 #include "buckets.h"
   9 #include "compress.h"
  10 #include "dirent.h"
  11 #include "error.h"
  12 #include "extents.h"
  13 #include "extent_update.h"
  14 #include "inode.h"
  15 #include "str_hash.h"
  16 #include "snapshot.h"
  17 #include "subvolume.h"
  18 #include "varint.h"
  19
  20 #include <linux/random.h>
  21
  22 #include <asm/unaligned.h>
  23
  24 #define x(name, ...)    #name,
  25 const char * const bch2_inode_opts[] = {
  26         BCH_INODE_OPTS()
  27         NULL,
  28 };
  29
  30 static const char * const bch2_inode_flag_strs[] = {
  31         BCH_INODE_FLAGS()
  32         NULL
  33 };
  34 #undef  x
  35
  36 static const u8 byte_table[8] = { 1, 2, 3, 4, 6, 8, 10, 13 };
  37
  38 static int inode_decode_field(const u8 *in, const u8 *end,
  39                               u64 out[2], unsigned *out_bits)
  40 {
  41         __be64 be[2] = { 0, 0 };
  42         unsigned bytes, shift;
  43         u8 *p;
  44
  45         if (in >= end)
  46                 return -1;
  47
  48         if (!*in)
  49                 return -1;
  50
  51         /*
  52          * position of highest set bit indicates number of bytes:
  53          * shift = number of bits to remove in high byte:
  54          */
  55         shift   = 8 - __fls(*in); /* 1 <= shift <= 8 */
  56         bytes   = byte_table[shift - 1];
  57
  58         if (in + bytes > end)
  59                 return -1;
  60
  61         p = (u8 *) be + 16 - bytes;
  62         memcpy(p, in, bytes);
  63         *p ^= (1 << 8) >> shift;
  64
  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]);
  68
  69         return bytes;
  70 }
  71
  72 static inline void bch2_inode_pack_inlined(struct bkey_inode_buf *packed,
  73                                            const struct bch_inode_unpacked *inode)
  74 {
  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;
  80         unsigned bytes;
  81         int ret;
  82
  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);
  93
  94
  95 #define x(_name, _bits)                                                 \
  96         nr_fields++;                                                    \
  97                                                                         \
  98         if (inode->_name) {                                             \
  99                 ret = bch2_varint_encode_fast(out, inode->_name);       \
 100                 out += ret;                                             \
 101                                                                         \
 102                 if (_bits > 64)                                         \
 103                         *out++ = 0;                                     \
 104                                                                         \
 105                 last_nonzero_field = out;                               \
 106                 last_nonzero_fieldnr = nr_fields;                       \
 107         } else {                                                        \
 108                 *out++ = 0;                                             \
 109                                                                         \
 110                 if (_bits > 64)                                         \
 111                         *out++ = 0;                                     \
 112         }
 113
 114         BCH_INODE_FIELDS_v3()
 115 #undef  x
 116         BUG_ON(out > end);
 117
 118         out = last_nonzero_field;
 119         nr_fields = last_nonzero_fieldnr;
 120
 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);
 124
 125         SET_INODEv3_NR_FIELDS(&k->v, nr_fields);
 126
 127         if (IS_ENABLED(CONFIG_BCACHEFS_DEBUG)) {
 128                 struct bch_inode_unpacked unpacked;
 129
 130                 ret = bch2_inode_unpack(bkey_i_to_s_c(&packed->inode.k_i), &unpacked);
 131                 BUG_ON(ret);
 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);
 138
 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()
 143 #undef  x
 144         }
 145 }
 146
 147 void bch2_inode_pack(struct bkey_inode_buf *packed,
 148                      const struct bch_inode_unpacked *inode)
 149 {
 150         bch2_inode_pack_inlined(packed, inode);
 151 }
 152
 153 static noinline int bch2_inode_unpack_v1(struct bkey_s_c_inode inode,
 154                                 struct bch_inode_unpacked *unpacked)
 155 {
 156         const u8 *in = inode.v->fields;
 157         const u8 *end = bkey_val_end(inode);
 158         u64 field[2];
 159         unsigned fieldnr = 0, field_bits;
 160         int ret;
 161
 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);                     \
 167                 return 0;                                               \
 168         }                                                               \
 169                                                                         \
 170         ret = inode_decode_field(in, end, field, &field_bits);          \
 171         if (ret < 0)                                                    \
 172                 return ret;                                             \
 173                                                                         \
 174         if (field_bits > sizeof(unpacked->_name) * 8)                   \
 175                 return -1;                                              \
 176                                                                         \
 177         unpacked->_name = field[1];                                     \
 178         in += ret;
 179
 180         BCH_INODE_FIELDS_v2()
 181 #undef  x
 182
 183         /* XXX: signal if there were more fields than expected? */
 184         return 0;
 185 }
 186
 187 static int bch2_inode_unpack_v2(struct bch_inode_unpacked *unpacked,
 188                                 const u8 *in, const u8 *end,
 189                                 unsigned nr_fields)
 190 {
 191         unsigned fieldnr = 0;
 192         int ret;
 193         u64 v[2];
 194
 195 #define x(_name, _bits)                                                 \
 196         if (fieldnr < nr_fields) {                                      \
 197                 ret = bch2_varint_decode_fast(in, end, &v[0]);          \
 198                 if (ret < 0)                                            \
 199                         return ret;                                     \
 200                 in += ret;                                              \
 201                                                                         \
 202                 if (_bits > 64) {                                       \
 203                         ret = bch2_varint_decode_fast(in, end, &v[1]);  \
 204                         if (ret < 0)                                    \
 205                                 return ret;                             \
 206                         in += ret;                                      \
 207                 } else {                                                \
 208                         v[1] = 0;                                       \
 209                 }                                                       \
 210         } else {                                                        \
 211                 v[0] = v[1] = 0;                                        \
 212         }                                                               \
 213                                                                         \
 214         unpacked->_name = v[0];                                         \
 215         if (v[1] || v[0] != unpacked->_name)                            \
 216                 return -1;                                              \
 217         fieldnr++;
 218
 219         BCH_INODE_FIELDS_v2()
 220 #undef  x
 221
 222         /* XXX: signal if there were more fields than expected? */
 223         return 0;
 224 }
 225
 226 static int bch2_inode_unpack_v3(struct bkey_s_c k,
 227                                 struct bch_inode_unpacked *unpacked)
 228 {
 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;
 234         int ret;
 235         u64 v[2];
 236
 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);
 245
 246 #define x(_name, _bits)                                                 \
 247         if (fieldnr < nr_fields) {                                      \
 248                 ret = bch2_varint_decode_fast(in, end, &v[0]);          \
 249                 if (ret < 0)                                            \
 250                         return ret;                                     \
 251                 in += ret;                                              \
 252                                                                         \
 253                 if (_bits > 64) {                                       \
 254                         ret = bch2_varint_decode_fast(in, end, &v[1]);  \
 255                         if (ret < 0)                                    \
 256                                 return ret;                             \
 257                         in += ret;                                      \
 258                 } else {                                                \
 259                         v[1] = 0;                                       \
 260                 }                                                       \
 261         } else {                                                        \
 262                 v[0] = v[1] = 0;                                        \
 263         }                                                               \
 264                                                                         \
 265         unpacked->_name = v[0];                                         \
 266         if (v[1] || v[0] != unpacked->_name)                            \
 267                 return -1;                                              \
 268         fieldnr++;
 269
 270         BCH_INODE_FIELDS_v3()
 271 #undef  x
 272
 273         /* XXX: signal if there were more fields than expected? */
 274         return 0;
 275 }
 276
 277 static noinline int bch2_inode_unpack_slowpath(struct bkey_s_c k,
 278                                                struct bch_inode_unpacked *unpacked)
 279 {
 280         memset(unpacked, 0, sizeof(*unpacked));
 281
 282         switch (k.k->type) {
 283         case KEY_TYPE_inode: {
 284                 struct bkey_s_c_inode inode = bkey_s_c_to_inode(k);
 285
 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);
 291
 292                 if (INODE_NEW_VARINT(inode.v)) {
 293                         return bch2_inode_unpack_v2(unpacked, inode.v->fields,
 294                                                     bkey_val_end(inode),
 295                                                     INODE_NR_FIELDS(inode.v));
 296                 } else {
 297                         return bch2_inode_unpack_v1(inode, unpacked);
 298                 }
 299                 break;
 300         }
 301         case KEY_TYPE_inode_v2: {
 302                 struct bkey_s_c_inode_v2 inode = bkey_s_c_to_inode_v2(k);
 303
 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);
 309
 310                 return bch2_inode_unpack_v2(unpacked, inode.v->fields,
 311                                             bkey_val_end(inode),
 312                                             INODEv2_NR_FIELDS(inode.v));
 313         }
 314         default:
 315                 BUG();
 316         }
 317 }
 318
 319 int bch2_inode_unpack(struct bkey_s_c k,
 320                       struct bch_inode_unpacked *unpacked)
 321 {
 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);
 325 }
 326
 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)
 331 {
 332         struct bkey_s_c k;
 333         u32 snapshot;
 334         int ret;
 335
 336         ret = bch2_subvolume_get_snapshot(trans, inum.subvol, &snapshot);
 337         if (ret)
 338                 return ret;
 339
 340         k = bch2_bkey_get_iter(trans, iter, BTREE_ID_inodes,
 341                                SPOS(0, inum.inum, snapshot),
 342                                flags|BTREE_ITER_CACHED);
 343         ret = bkey_err(k);
 344         if (ret)
 345                 return ret;
 346
 347         ret = bkey_is_inode(k.k) ? 0 : -BCH_ERR_ENOENT_inode;
 348         if (ret)
 349                 goto err;
 350
 351         ret = bch2_inode_unpack(k, inode);
 352         if (ret)
 353                 goto err;
 354
 355         return 0;
 356 err:
 357         bch2_trans_iter_exit(trans, iter);
 358         return ret;
 359 }
 360
 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)
 365 {
 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);
 368         return ret;
 369 }
 370
 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)
 375 {
 376         struct bkey_inode_buf *inode_p;
 377
 378         inode_p = bch2_trans_kmalloc(trans, sizeof(*inode_p));
 379         if (IS_ERR(inode_p))
 380                 return PTR_ERR(inode_p);
 381
 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);
 385 }
 386
 387 struct bkey_i *bch2_inode_to_v3(struct btree_trans *trans, struct bkey_i *k)
 388 {
 389         struct bch_inode_unpacked u;
 390         struct bkey_inode_buf *inode_p;
 391         int ret;
 392
 393         if (!bkey_is_inode(&k->k))
 394                 return ERR_PTR(-ENOENT);
 395
 396         inode_p = bch2_trans_kmalloc(trans, sizeof(*inode_p));
 397         if (IS_ERR(inode_p))
 398                 return ERR_CAST(inode_p);
 399
 400         ret = bch2_inode_unpack(bkey_i_to_s_c(k), &u);
 401         if (ret)
 402                 return ERR_PTR(ret);
 403
 404         bch2_inode_pack(inode_p, &u);
 405         return &inode_p->inode.k_i;
 406 }
 407
 408 static int __bch2_inode_invalid(struct bch_fs *c, struct bkey_s_c k, struct printbuf *err)
 409 {
 410         struct bch_inode_unpacked unpacked;
 411         int ret = 0;
 412
 413         bkey_fsck_err_on(k.k->p.inode, c, err,
 414                          inode_pos_inode_nonzero,
 415                          "nonzero k.p.inode");
 416
 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");
 420
 421         bkey_fsck_err_on(bch2_inode_unpack(k, &unpacked), c, err,
 422                          inode_unpack_error,
 423                          "invalid variable length fields");
 424
 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);
 429
 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);
 434
 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");
 439
 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");
 443 fsck_err:
 444         return ret;
 445 }
 446
 447 int bch2_inode_invalid(struct bch_fs *c, struct bkey_s_c k,
 448                        enum bkey_invalid_flags flags,
 449                        struct printbuf *err)
 450 {
 451         struct bkey_s_c_inode inode = bkey_s_c_to_inode(k);
 452         int ret = 0;
 453
 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);
 458
 459         ret = __bch2_inode_invalid(c, k, err);
 460 fsck_err:
 461         return ret;
 462 }
 463
 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)
 467 {
 468         struct bkey_s_c_inode_v2 inode = bkey_s_c_to_inode_v2(k);
 469         int ret = 0;
 470
 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);
 475
 476         ret = __bch2_inode_invalid(c, k, err);
 477 fsck_err:
 478         return ret;
 479 }
 480
 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)
 484 {
 485         struct bkey_s_c_inode_v3 inode = bkey_s_c_to_inode_v3(k);
 486         int ret = 0;
 487
 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));
 495
 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);
 500
 501         ret = __bch2_inode_invalid(c, k, err);
 502 fsck_err:
 503         return ret;
 504 }
 505
 506 static void __bch2_inode_unpacked_to_text(struct printbuf *out,
 507                                           struct bch_inode_unpacked *inode)
 508 {
 509         prt_printf(out, "mode=%o ", inode->bi_mode);
 510
 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);
 514
 515         prt_printf(out, " journal_seq=%llu bi_size=%llu bi_sectors=%llu bi_version=%llu",
 516                inode->bi_journal_seq,
 517                inode->bi_size,
 518                inode->bi_sectors,
 519                inode->bi_version);
 520
 521 #define x(_name, _bits)                                         \
 522         prt_printf(out, " "#_name "=%llu", (u64) inode->_name);
 523         BCH_INODE_FIELDS_v3()
 524 #undef  x
 525 }
 526
 527 void bch2_inode_unpacked_to_text(struct printbuf *out, struct bch_inode_unpacked *inode)
 528 {
 529         prt_printf(out, "inum: %llu ", inode->bi_inum);
 530         __bch2_inode_unpacked_to_text(out, inode);
 531 }
 532
 533 void bch2_inode_to_text(struct printbuf *out, struct bch_fs *c, struct bkey_s_c k)
 534 {
 535         struct bch_inode_unpacked inode;
 536
 537         if (bch2_inode_unpack(k, &inode)) {
 538                 prt_printf(out, "(unpack error)");
 539                 return;
 540         }
 541
 542         __bch2_inode_unpacked_to_text(out, &inode);
 543 }
 544
 545 static inline u64 bkey_inode_flags(struct bkey_s_c k)
 546 {
 547         switch (k.k->type) {
 548         case KEY_TYPE_inode:
 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);
 554         default:
 555                 return 0;
 556         }
 557 }
 558
 559 static inline bool bkey_is_deleted_inode(struct bkey_s_c k)
 560 {
 561         return bkey_inode_flags(k) & BCH_INODE_unlinked;
 562 }
 563
 564 int bch2_trans_mark_inode(struct btree_trans *trans,
 565                           enum btree_id btree_id, unsigned level,
 566                           struct bkey_s_c old,
 567                           struct bkey_i *new,
 568                           unsigned flags)
 569 {
 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));
 573
 574         if (nr) {
 575                 int ret = bch2_replicas_deltas_realloc(trans, 0);
 576                 struct replicas_delta_list *d = trans->fs_usage_deltas;
 577
 578                 if (ret)
 579                         return ret;
 580
 581                 d->nr_inodes += nr;
 582         }
 583
 584         if (old_deleted != new_deleted) {
 585                 int ret = bch2_btree_bit_mod(trans, BTREE_ID_deleted_inodes, new->k.p, new_deleted);
 586                 if (ret)
 587                         return ret;
 588         }
 589
 590         return 0;
 591 }
 592
 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,
 596                     unsigned flags)
 597 {
 598         struct bch_fs *c = trans->c;
 599         struct bch_fs_usage *fs_usage;
 600         u64 journal_seq = trans->journal_res.seq;
 601
 602         if (flags & BTREE_TRIGGER_INSERT) {
 603                 struct bch_inode_v3 *v = (struct bch_inode_v3 *) new.v;
 604
 605                 BUG_ON(!journal_seq);
 606                 BUG_ON(new.k->type != KEY_TYPE_inode_v3);
 607
 608                 v->bi_journal_seq = cpu_to_le64(journal_seq);
 609         }
 610
 611         if (flags & BTREE_TRIGGER_GC) {
 612                 percpu_down_read(&c->mark_lock);
 613                 preempt_disable();
 614
 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);
 618
 619                 preempt_enable();
 620                 percpu_up_read(&c->mark_lock);
 621         }
 622         return 0;
 623 }
 624
 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)
 628 {
 629         int ret = 0;
 630
 631         bkey_fsck_err_on(k.k->p.inode, c, err,
 632                          inode_pos_inode_nonzero,
 633                          "nonzero k.p.inode");
 634 fsck_err:
 635         return ret;
 636 }
 637
 638 void bch2_inode_generation_to_text(struct printbuf *out, struct bch_fs *c,
 639                                    struct bkey_s_c k)
 640 {
 641         struct bkey_s_c_inode_generation gen = bkey_s_c_to_inode_generation(k);
 642
 643         prt_printf(out, "generation: %u", le32_to_cpu(gen.v->bi_generation));
 644 }
 645
 646 void bch2_inode_init_early(struct bch_fs *c,
 647                            struct bch_inode_unpacked *inode_u)
 648 {
 649         enum bch_str_hash_type str_hash =
 650                 bch2_str_hash_opt_to_type(c, c->opts.str_hash);
 651
 652         memset(inode_u, 0, sizeof(*inode_u));
 653
 654         /* ick */
 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));
 658 }
 659
 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)
 663 {
 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;
 672
 673         if (parent && parent->bi_mode & S_ISGID) {
 674                 inode_u->bi_gid = parent->bi_gid;
 675                 if (S_ISDIR(mode))
 676                         inode_u->bi_mode |= S_ISGID;
 677         }
 678
 679         if (parent) {
 680 #define x(_name, ...)   inode_u->bi_##_name = parent->bi_##_name;
 681                 BCH_INODE_OPTS()
 682 #undef x
 683         }
 684 }
 685
 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)
 689 {
 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);
 693 }
 694
 695 static inline u32 bkey_generation(struct bkey_s_c k)
 696 {
 697         switch (k.k->type) {
 698         case KEY_TYPE_inode:
 699         case KEY_TYPE_inode_v2:
 700                 BUG();
 701         case KEY_TYPE_inode_generation:
 702                 return le32_to_cpu(bkey_s_c_to_inode_generation(k).v->bi_generation);
 703         default:
 704                 return 0;
 705         }
 706 }
 707
 708 /*
 709  * This just finds an empty slot:
 710  */
 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)
 715 {
 716         struct bch_fs *c = trans->c;
 717         struct bkey_s_c k;
 718         u64 min, max, start, pos, *hint;
 719         int ret = 0;
 720         unsigned bits = (c->opts.inodes_32bit ? 31 : 63);
 721
 722         if (c->opts.shard_inode_numbers) {
 723                 bits -= c->inode_shard_bits;
 724
 725                 min = (cpu << bits);
 726                 max = (cpu << bits) | ~(ULLONG_MAX << bits);
 727
 728                 min = max_t(u64, min, BLOCKDEV_INODE_MAX);
 729                 hint = c->unused_inode_hints + cpu;
 730         } else {
 731                 min = BLOCKDEV_INODE_MAX;
 732                 max = ~(ULLONG_MAX << bits);
 733                 hint = c->unused_inode_hints;
 734         }
 735
 736         start = READ_ONCE(*hint);
 737
 738         if (start >= max || start < min)
 739                 start = min;
 740
 741         pos = start;
 742         bch2_trans_iter_init(trans, iter, BTREE_ID_inodes, POS(0, pos),
 743                              BTREE_ITER_ALL_SNAPSHOTS|
 744                              BTREE_ITER_INTENT);
 745 again:
 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)
 750                         goto found_slot;
 751
 752                 /*
 753                  * We don't need to iterate over keys in every snapshot once
 754                  * we've found just one:
 755                  */
 756                 pos = iter->pos.offset + 1;
 757                 bch2_btree_iter_set_pos(iter, POS(0, pos));
 758         }
 759
 760         if (!ret && pos < max)
 761                 goto found_slot;
 762
 763         if (!ret && start == min)
 764                 ret = -BCH_ERR_ENOSPC_inode_create;
 765
 766         if (ret) {
 767                 bch2_trans_iter_exit(trans, iter);
 768                 return ret;
 769         }
 770
 771         /* Retry from start */
 772         pos = start = min;
 773         bch2_btree_iter_set_pos(iter, POS(0, pos));
 774         goto again;
 775 found_slot:
 776         bch2_btree_iter_set_pos(iter, SPOS(0, pos, snapshot));
 777         k = bch2_btree_iter_peek_slot(iter);
 778         ret = bkey_err(k);
 779         if (ret) {
 780                 bch2_trans_iter_exit(trans, iter);
 781                 return ret;
 782         }
 783
 784         *hint                   = k.k->p.offset;
 785         inode_u->bi_inum        = k.k->p.offset;
 786         inode_u->bi_generation  = bkey_generation(k);
 787         return 0;
 788 }
 789
 790 static int bch2_inode_delete_keys(struct btree_trans *trans,
 791                                   subvol_inum inum, enum btree_id id)
 792 {
 793         struct btree_iter iter;
 794         struct bkey_s_c k;
 795         struct bkey_i delete;
 796         struct bpos end = POS(inum.inum, U64_MAX);
 797         u32 snapshot;
 798         int ret = 0;
 799
 800         /*
 801          * We're never going to be deleting partial extents, no need to use an
 802          * extent iterator:
 803          */
 804         bch2_trans_iter_init(trans, &iter, id, POS(inum.inum, 0),
 805                              BTREE_ITER_INTENT);
 806
 807         while (1) {
 808                 bch2_trans_begin(trans);
 809
 810                 ret = bch2_subvolume_get_snapshot(trans, inum.subvol, &snapshot);
 811                 if (ret)
 812                         goto err;
 813
 814                 bch2_btree_iter_set_snapshot(&iter, snapshot);
 815
 816                 k = bch2_btree_iter_peek_upto(&iter, end);
 817                 ret = bkey_err(k);
 818                 if (ret)
 819                         goto err;
 820
 821                 if (!k.k)
 822                         break;
 823
 824                 bkey_init(&delete.k);
 825                 delete.k.p = iter.pos;
 826
 827                 if (iter.flags & BTREE_ITER_IS_EXTENTS)
 828                         bch2_key_resize(&delete.k,
 829                                         bpos_min(end, k.k->p).offset -
 830                                         iter.pos.offset);
 831
 832                 ret = bch2_trans_update(trans, &iter, &delete, 0) ?:
 833                       bch2_trans_commit(trans, NULL, NULL,
 834                                         BCH_TRANS_COMMIT_no_enospc);
 835 err:
 836                 if (ret && !bch2_err_matches(ret, BCH_ERR_transaction_restart))
 837                         break;
 838         }
 839
 840         bch2_trans_iter_exit(trans, &iter);
 841         return ret;
 842 }
 843
 844 int bch2_inode_rm(struct bch_fs *c, subvol_inum inum)
 845 {
 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;
 850         struct bkey_s_c k;
 851         u32 snapshot;
 852         int ret;
 853
 854         /*
 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
 857          * delete:
 858          *
 859          * XXX: the dirent could ideally would delete whiteouts when they're no
 860          * longer needed
 861          */
 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);
 865         if (ret)
 866                 goto err;
 867 retry:
 868         bch2_trans_begin(trans);
 869
 870         ret = bch2_subvolume_get_snapshot(trans, inum.subvol, &snapshot);
 871         if (ret)
 872                 goto err;
 873
 874         k = bch2_bkey_get_iter(trans, &iter, BTREE_ID_inodes,
 875                                SPOS(0, inum.inum, snapshot),
 876                                BTREE_ITER_INTENT|BTREE_ITER_CACHED);
 877         ret = bkey_err(k);
 878         if (ret)
 879                 goto err;
 880
 881         if (!bkey_is_inode(k.k)) {
 882                 bch2_fs_inconsistent(c,
 883                                      "inode %llu:%u not found when deleting",
 884                                      inum.inum, snapshot);
 885                 ret = -EIO;
 886                 goto err;
 887         }
 888
 889         bch2_inode_unpack(k, &inode_u);
 890
 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);
 894
 895         ret   = bch2_trans_update(trans, &iter, &delete.k_i, 0) ?:
 896                 bch2_trans_commit(trans, NULL, NULL,
 897                                 BCH_TRANS_COMMIT_no_enospc);
 898 err:
 899         bch2_trans_iter_exit(trans, &iter);
 900         if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
 901                 goto retry;
 902
 903         bch2_trans_put(trans);
 904         return ret;
 905 }
 906
 907 int bch2_inode_find_by_inum_nowarn_trans(struct btree_trans *trans,
 908                                   subvol_inum inum,
 909                                   struct bch_inode_unpacked *inode)
 910 {
 911         struct btree_iter iter;
 912         int ret;
 913
 914         ret = bch2_inode_peek_nowarn(trans, &iter, inode, inum, 0);
 915         if (!ret)
 916                 bch2_trans_iter_exit(trans, &iter);
 917         return ret;
 918 }
 919
 920 int bch2_inode_find_by_inum_trans(struct btree_trans *trans,
 921                                   subvol_inum inum,
 922                                   struct bch_inode_unpacked *inode)
 923 {
 924         struct btree_iter iter;
 925         int ret;
 926
 927         ret = bch2_inode_peek(trans, &iter, inode, inum, 0);
 928         if (!ret)
 929                 bch2_trans_iter_exit(trans, &iter);
 930         return ret;
 931 }
 932
 933 int bch2_inode_find_by_inum(struct bch_fs *c, subvol_inum inum,
 934                             struct bch_inode_unpacked *inode)
 935 {
 936         return bch2_trans_do(c, NULL, NULL, 0,
 937                 bch2_inode_find_by_inum_trans(trans, inum, inode));
 938 }
 939
 940 int bch2_inode_nlink_inc(struct bch_inode_unpacked *bi)
 941 {
 942         if (bi->bi_flags & BCH_INODE_unlinked)
 943                 bi->bi_flags &= ~BCH_INODE_unlinked;
 944         else {
 945                 if (bi->bi_nlink == U32_MAX)
 946                         return -EINVAL;
 947
 948                 bi->bi_nlink++;
 949         }
 950
 951         return 0;
 952 }
 953
 954 void bch2_inode_nlink_dec(struct btree_trans *trans, struct bch_inode_unpacked *bi)
 955 {
 956         if (bi->bi_nlink && (bi->bi_flags & BCH_INODE_unlinked)) {
 957                 bch2_trans_inconsistent(trans, "inode %llu unlinked but link count nonzero",
 958                                         bi->bi_inum);
 959                 return;
 960         }
 961
 962         if (bi->bi_flags & BCH_INODE_unlinked) {
 963                 bch2_trans_inconsistent(trans, "inode %llu link count underflow", bi->bi_inum);
 964                 return;
 965         }
 966
 967         if (bi->bi_nlink)
 968                 bi->bi_nlink--;
 969         else
 970                 bi->bi_flags |= BCH_INODE_unlinked;
 971 }
 972
 973 struct bch_opts bch2_inode_opts_to_opts(struct bch_inode_unpacked *inode)
 974 {
 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);
 979         BCH_INODE_OPTS()
 980 #undef x
 981         return ret;
 982 }
 983
 984 void bch2_inode_opts_get(struct bch_io_opts *opts, struct bch_fs *c,
 985                          struct bch_inode_unpacked *inode)
 986 {
 987 #define x(_name, _bits)         opts->_name = inode_opt_get(c, inode, _name);
 988         BCH_INODE_OPTS()
 989 #undef x
 990
 991         if (opts->nocow)
 992                 opts->compression = opts->background_compression = opts->data_checksum = opts->erasure_code = 0;
 993 }
 994
 995 int bch2_inum_opts_get(struct btree_trans *trans, subvol_inum inum, struct bch_io_opts *opts)
 996 {
 997         struct bch_inode_unpacked inode;
 998         int ret = lockrestart_do(trans, bch2_inode_find_by_inum_trans(trans, inum, &inode));
 999
1000         if (ret)
1001                 return ret;
1002
1003         bch2_inode_opts_get(opts, trans->c, &inode);
1004         return 0;
1005 }
1006
1007 int bch2_inode_rm_snapshot(struct btree_trans *trans, u64 inum, u32 snapshot)
1008 {
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;
1013         struct bkey_s_c k;
1014         int ret;
1015
1016         do {
1017                 ret   = bch2_btree_delete_range_trans(trans, BTREE_ID_extents,
1018                                                       SPOS(inum, 0, snapshot),
1019                                                       SPOS(inum, U64_MAX, snapshot),
1020                                                       0, NULL) ?:
1021                         bch2_btree_delete_range_trans(trans, BTREE_ID_dirents,
1022                                                       SPOS(inum, 0, snapshot),
1023                                                       SPOS(inum, U64_MAX, snapshot),
1024                                                       0, NULL) ?:
1025                         bch2_btree_delete_range_trans(trans, BTREE_ID_xattrs,
1026                                                       SPOS(inum, 0, snapshot),
1027                                                       SPOS(inum, U64_MAX, snapshot),
1028                                                       0, NULL);
1029         } while (ret == -BCH_ERR_transaction_restart_nested);
1030         if (ret)
1031                 goto err;
1032 retry:
1033         bch2_trans_begin(trans);
1034
1035         k = bch2_bkey_get_iter(trans, &iter, BTREE_ID_inodes,
1036                                SPOS(0, inum, snapshot), BTREE_ITER_INTENT);
1037         ret = bkey_err(k);
1038         if (ret)
1039                 goto err;
1040
1041         if (!bkey_is_inode(k.k)) {
1042                 bch2_fs_inconsistent(c,
1043                                      "inode %llu:%u not found when deleting",
1044                                      inum, snapshot);
1045                 ret = -EIO;
1046                 goto err;
1047         }
1048
1049         bch2_inode_unpack(k, &inode_u);
1050
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);
1054
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);
1058
1059         ret   = bch2_trans_update(trans, &iter, &delete.k_i, 0) ?:
1060                 bch2_trans_commit(trans, NULL, NULL,
1061                                 BCH_TRANS_COMMIT_no_enospc);
1062 err:
1063         bch2_trans_iter_exit(trans, &iter);
1064         if (bch2_err_matches(ret, BCH_ERR_transaction_restart))
1065                 goto retry;
1066
1067         return ret ?: -BCH_ERR_transaction_restart_nested;
1068 }
1069
1070 static int may_delete_deleted_inode(struct btree_trans *trans,
1071                                     struct btree_iter *iter,
1072                                     struct bpos pos,
1073                                     bool *need_another_pass)
1074 {
1075         struct bch_fs *c = trans->c;
1076         struct btree_iter inode_iter;
1077         struct bkey_s_c k;
1078         struct bch_inode_unpacked inode;
1079         int ret;
1080
1081         k = bch2_bkey_get_iter(trans, &inode_iter, BTREE_ID_inodes, pos, BTREE_ITER_CACHED);
1082         ret = bkey_err(k);
1083         if (ret)
1084                 return ret;
1085
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))
1091                 goto delete;
1092
1093         ret = bch2_inode_unpack(k, &inode);
1094         if (ret)
1095                 goto out;
1096
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))
1102                         goto delete;
1103                 if (ret)
1104                         goto out;
1105         }
1106
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))
1111                 goto delete;
1112
1113         if (c->sb.clean &&
1114             !fsck_err(c,
1115                       deleted_inode_but_clean,
1116                       "filesystem marked as clean but have deleted inode %llu:%u",
1117                       pos.offset, pos.snapshot)) {
1118                 ret = 0;
1119                 goto out;
1120         }
1121
1122         if (bch2_snapshot_is_internal_node(c, pos.snapshot)) {
1123                 struct bpos new_min_pos;
1124
1125                 ret = bch2_propagate_key_to_snapshot_leaves(trans, inode_iter.btree_id, k, &new_min_pos);
1126                 if (ret)
1127                         goto out;
1128
1129                 inode.bi_flags &= ~BCH_INODE_unlinked;
1130
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");
1134                 if (ret)
1135                         goto out;
1136
1137                 /*
1138                  * We'll need another write buffer flush to pick up the new
1139                  * unlinked inodes in the snapshot leaves:
1140                  */
1141                 *need_another_pass = true;
1142                 goto out;
1143         }
1144
1145         ret = 1;
1146 out:
1147 fsck_err:
1148         bch2_trans_iter_exit(trans, &inode_iter);
1149         return ret;
1150 delete:
1151         ret = bch2_btree_bit_mod(trans, BTREE_ID_deleted_inodes, pos, false);
1152         goto out;
1153 }
1154
1155 int bch2_delete_dead_inodes(struct bch_fs *c)
1156 {
1157         struct btree_trans *trans = bch2_trans_get(c);
1158         bool need_another_pass;
1159         int ret;
1160 again:
1161         need_another_pass = false;
1162
1163         /*
1164          * Weird transaction restart handling here because on successful delete,
1165          * bch2_inode_rm_snapshot() will return a nested transaction restart,
1166          * but we can't retry because the btree write buffer won't have been
1167          * flushed and we'd spin:
1168          */
1169         ret = for_each_btree_key_commit(trans, iter, BTREE_ID_deleted_inodes, POS_MIN,
1170                                         BTREE_ITER_PREFETCH|BTREE_ITER_ALL_SNAPSHOTS, k,
1171                                         NULL, NULL, BCH_TRANS_COMMIT_no_enospc, ({
1172                 ret = may_delete_deleted_inode(trans, &iter, k.k->p, &need_another_pass);
1173                 if (ret > 0) {
1174                         bch_verbose(c, "deleting unlinked inode %llu:%u", k.k->p.offset, k.k->p.snapshot);
1175
1176                         ret = bch2_inode_rm_snapshot(trans, k.k->p.offset, k.k->p.snapshot);
1177                         /*
1178                          * We don't want to loop here: a transaction restart
1179                          * error here means we handled a transaction restart and
1180                          * we're actually done, but if we loop we'll retry the
1181                          * same key because the write buffer hasn't been flushed
1182                          * yet
1183                          */
1184                         if (bch2_err_matches(ret, BCH_ERR_transaction_restart)) {
1185                                 ret = 0;
1186                                 continue;
1187                         }
1188                 }
1189
1190                 ret;
1191         }));
1192
1193         if (!ret && need_another_pass) {
1194                 ret = bch2_btree_write_buffer_flush_sync(trans);
1195                 if (ret)
1196                         goto err;
1197                 goto again;
1198         }
1199 err:
1200         bch2_trans_put(trans);
1201         return ret;
1202 }