]> git.sesse.net Git - bcachefs-tools-debian/blob - libbcachefs/inode.c
Update bcachefs sources to cddca21efc bcachefs: Don't use sha256 for siphash str...
[bcachefs-tools-debian] / libbcachefs / inode.c
1 // SPDX-License-Identifier: GPL-2.0
2
3 #include "bcachefs.h"
4 #include "bkey_methods.h"
5 #include "btree_update.h"
6 #include "error.h"
7 #include "extents.h"
8 #include "inode.h"
9 #include "str_hash.h"
10
11 #include <linux/random.h>
12
13 #include <asm/unaligned.h>
14
15 const char * const bch2_inode_opts[] = {
16 #define x(name, ...)    #name,
17         BCH_INODE_OPTS()
18 #undef  x
19         NULL,
20 };
21
22 static const u8 byte_table[8] = { 1, 2, 3, 4, 6, 8, 10, 13 };
23 static const u8 bits_table[8] = {
24         1  * 8 - 1,
25         2  * 8 - 2,
26         3  * 8 - 3,
27         4  * 8 - 4,
28         6  * 8 - 5,
29         8  * 8 - 6,
30         10 * 8 - 7,
31         13 * 8 - 8,
32 };
33
34 static int inode_encode_field(u8 *out, u8 *end, u64 hi, u64 lo)
35 {
36         __be64 in[2] = { cpu_to_be64(hi), cpu_to_be64(lo), };
37         unsigned shift, bytes, bits = likely(!hi)
38                 ? fls64(lo)
39                 : fls64(hi) + 64;
40
41         for (shift = 1; shift <= 8; shift++)
42                 if (bits < bits_table[shift - 1])
43                         goto got_shift;
44
45         BUG();
46 got_shift:
47         bytes = byte_table[shift - 1];
48
49         BUG_ON(out + bytes > end);
50
51         memcpy(out, (u8 *) in + 16 - bytes, bytes);
52         *out |= (1 << 8) >> shift;
53
54         return bytes;
55 }
56
57 static int inode_decode_field(const u8 *in, const u8 *end,
58                               u64 out[2], unsigned *out_bits)
59 {
60         __be64 be[2] = { 0, 0 };
61         unsigned bytes, shift;
62         u8 *p;
63
64         if (in >= end)
65                 return -1;
66
67         if (!*in)
68                 return -1;
69
70         /*
71          * position of highest set bit indicates number of bytes:
72          * shift = number of bits to remove in high byte:
73          */
74         shift   = 8 - __fls(*in); /* 1 <= shift <= 8 */
75         bytes   = byte_table[shift - 1];
76
77         if (in + bytes > end)
78                 return -1;
79
80         p = (u8 *) be + 16 - bytes;
81         memcpy(p, in, bytes);
82         *p ^= (1 << 8) >> shift;
83
84         out[0] = be64_to_cpu(be[0]);
85         out[1] = be64_to_cpu(be[1]);
86         *out_bits = out[0] ? 64 + fls64(out[0]) : fls64(out[1]);
87
88         return bytes;
89 }
90
91 void bch2_inode_pack(struct bkey_inode_buf *packed,
92                      const struct bch_inode_unpacked *inode)
93 {
94         u8 *out = packed->inode.v.fields;
95         u8 *end = (void *) &packed[1];
96         u8 *last_nonzero_field = out;
97         unsigned nr_fields = 0, last_nonzero_fieldnr = 0;
98
99         bkey_inode_init(&packed->inode.k_i);
100         packed->inode.k.p.inode         = inode->bi_inum;
101         packed->inode.v.bi_hash_seed    = inode->bi_hash_seed;
102         packed->inode.v.bi_flags        = cpu_to_le32(inode->bi_flags);
103         packed->inode.v.bi_mode         = cpu_to_le16(inode->bi_mode);
104
105 #define x(_name, _bits)                                 \
106         out += inode_encode_field(out, end, 0, inode->_name);           \
107         nr_fields++;                                                    \
108                                                                         \
109         if (inode->_name) {                                             \
110                 last_nonzero_field = out;                               \
111                 last_nonzero_fieldnr = nr_fields;                       \
112         }
113
114         BCH_INODE_FIELDS()
115 #undef  x
116
117         out = last_nonzero_field;
118         nr_fields = last_nonzero_fieldnr;
119
120         set_bkey_val_bytes(&packed->inode.k, out - (u8 *) &packed->inode.v);
121         memset(out, 0,
122                (u8 *) &packed->inode.v +
123                bkey_val_bytes(&packed->inode.k) - out);
124
125         SET_INODE_NR_FIELDS(&packed->inode.v, nr_fields);
126
127         if (IS_ENABLED(CONFIG_BCACHEFS_DEBUG)) {
128                 struct bch_inode_unpacked unpacked;
129
130                 int ret = bch2_inode_unpack(inode_i_to_s_c(&packed->inode),
131                                            &unpacked);
132                 BUG_ON(ret);
133                 BUG_ON(unpacked.bi_inum         != inode->bi_inum);
134                 BUG_ON(unpacked.bi_hash_seed    != inode->bi_hash_seed);
135                 BUG_ON(unpacked.bi_mode         != inode->bi_mode);
136
137 #define x(_name, _bits) BUG_ON(unpacked._name != inode->_name);
138                 BCH_INODE_FIELDS()
139 #undef  x
140         }
141 }
142
143 int bch2_inode_unpack(struct bkey_s_c_inode inode,
144                       struct bch_inode_unpacked *unpacked)
145 {
146         const u8 *in = inode.v->fields;
147         const u8 *end = (void *) inode.v + bkey_val_bytes(inode.k);
148         u64 field[2];
149         unsigned fieldnr = 0, field_bits;
150         int ret;
151
152         unpacked->bi_inum       = inode.k->p.inode;
153         unpacked->bi_hash_seed  = inode.v->bi_hash_seed;
154         unpacked->bi_flags      = le32_to_cpu(inode.v->bi_flags);
155         unpacked->bi_mode       = le16_to_cpu(inode.v->bi_mode);
156
157 #define x(_name, _bits)                                 \
158         if (fieldnr++ == INODE_NR_FIELDS(inode.v)) {                    \
159                 memset(&unpacked->_name, 0,                             \
160                        sizeof(*unpacked) -                              \
161                        offsetof(struct bch_inode_unpacked, _name));     \
162                 return 0;                                               \
163         }                                                               \
164                                                                         \
165         ret = inode_decode_field(in, end, field, &field_bits);          \
166         if (ret < 0)                                                    \
167                 return ret;                                             \
168                                                                         \
169         if (field_bits > sizeof(unpacked->_name) * 8)                   \
170                 return -1;                                              \
171                                                                         \
172         unpacked->_name = field[1];                                     \
173         in += ret;
174
175         BCH_INODE_FIELDS()
176 #undef  x
177
178         /* XXX: signal if there were more fields than expected? */
179
180         return 0;
181 }
182
183 struct btree_iter *bch2_inode_peek(struct btree_trans *trans,
184                                    struct bch_inode_unpacked *inode,
185                                    u64 inum, unsigned flags)
186 {
187         struct btree_iter *iter;
188         struct bkey_s_c k;
189         int ret;
190
191         iter = bch2_trans_get_iter(trans, BTREE_ID_INODES, POS(inum, 0),
192                                    BTREE_ITER_SLOTS|flags);
193         if (IS_ERR(iter))
194                 return iter;
195
196         k = bch2_btree_iter_peek_slot(iter);
197         ret = bkey_err(k);
198         if (ret)
199                 goto err;
200
201         ret = k.k->type == KEY_TYPE_inode ? 0 : -EIO;
202         if (ret)
203                 goto err;
204
205         ret = bch2_inode_unpack(bkey_s_c_to_inode(k), inode);
206         if (ret)
207                 goto err;
208
209         return iter;
210 err:
211         bch2_trans_iter_put(trans, iter);
212         return ERR_PTR(ret);
213 }
214
215 int bch2_inode_write(struct btree_trans *trans,
216                      struct btree_iter *iter,
217                      struct bch_inode_unpacked *inode)
218 {
219         struct bkey_inode_buf *inode_p;
220
221         inode_p = bch2_trans_kmalloc(trans, sizeof(*inode_p));
222         if (IS_ERR(inode_p))
223                 return PTR_ERR(inode_p);
224
225         bch2_inode_pack(inode_p, inode);
226         bch2_trans_update(trans, iter, &inode_p->inode.k_i);
227         return 0;
228 }
229
230 const char *bch2_inode_invalid(const struct bch_fs *c, struct bkey_s_c k)
231 {
232                 struct bkey_s_c_inode inode = bkey_s_c_to_inode(k);
233                 struct bch_inode_unpacked unpacked;
234
235         if (k.k->p.offset)
236                 return "nonzero offset";
237
238         if (bkey_val_bytes(k.k) < sizeof(struct bch_inode))
239                 return "incorrect value size";
240
241         if (k.k->p.inode < BLOCKDEV_INODE_MAX)
242                 return "fs inode in blockdev range";
243
244         if (INODE_STR_HASH(inode.v) >= BCH_STR_HASH_NR)
245                 return "invalid str hash type";
246
247         if (bch2_inode_unpack(inode, &unpacked))
248                 return "invalid variable length fields";
249
250         if (unpacked.bi_data_checksum >= BCH_CSUM_OPT_NR + 1)
251                 return "invalid data checksum type";
252
253         if (unpacked.bi_compression >= BCH_COMPRESSION_OPT_NR + 1)
254                 return "invalid data checksum type";
255
256         if ((unpacked.bi_flags & BCH_INODE_UNLINKED) &&
257             unpacked.bi_nlink != 0)
258                 return "flagged as unlinked but bi_nlink != 0";
259
260         return NULL;
261 }
262
263 void bch2_inode_to_text(struct printbuf *out, struct bch_fs *c,
264                        struct bkey_s_c k)
265 {
266         struct bkey_s_c_inode inode = bkey_s_c_to_inode(k);
267         struct bch_inode_unpacked unpacked;
268
269         if (bch2_inode_unpack(inode, &unpacked)) {
270                 pr_buf(out, "(unpack error)");
271                 return;
272         }
273
274 #define x(_name, _bits)                                         \
275         pr_buf(out, #_name ": %llu ", (u64) unpacked._name);
276         BCH_INODE_FIELDS()
277 #undef  x
278 }
279
280 const char *bch2_inode_generation_invalid(const struct bch_fs *c,
281                                           struct bkey_s_c k)
282 {
283         if (k.k->p.offset)
284                 return "nonzero offset";
285
286         if (bkey_val_bytes(k.k) != sizeof(struct bch_inode_generation))
287                 return "incorrect value size";
288
289         return NULL;
290 }
291
292 void bch2_inode_generation_to_text(struct printbuf *out, struct bch_fs *c,
293                                    struct bkey_s_c k)
294 {
295         struct bkey_s_c_inode_generation gen = bkey_s_c_to_inode_generation(k);
296
297         pr_buf(out, "generation: %u", le32_to_cpu(gen.v->bi_generation));
298 }
299
300 void bch2_inode_init(struct bch_fs *c, struct bch_inode_unpacked *inode_u,
301                      uid_t uid, gid_t gid, umode_t mode, dev_t rdev,
302                      struct bch_inode_unpacked *parent)
303 {
304         s64 now = bch2_current_time(c);
305         enum bch_str_hash_type str_hash =
306                 bch2_str_hash_opt_to_type(c, c->opts.str_hash);
307
308         memset(inode_u, 0, sizeof(*inode_u));
309
310         /* ick */
311         inode_u->bi_flags |= str_hash << INODE_STR_HASH_OFFSET;
312         get_random_bytes(&inode_u->bi_hash_seed,
313                          sizeof(inode_u->bi_hash_seed));
314
315         inode_u->bi_mode        = mode;
316         inode_u->bi_uid         = uid;
317         inode_u->bi_gid         = gid;
318         inode_u->bi_dev         = rdev;
319         inode_u->bi_atime       = now;
320         inode_u->bi_mtime       = now;
321         inode_u->bi_ctime       = now;
322         inode_u->bi_otime       = now;
323
324         if (parent) {
325 #define x(_name, ...)   inode_u->bi_##_name = parent->bi_##_name;
326                 BCH_INODE_OPTS()
327 #undef x
328         }
329 }
330
331 static inline u32 bkey_generation(struct bkey_s_c k)
332 {
333         switch (k.k->type) {
334         case KEY_TYPE_inode:
335                 BUG();
336         case KEY_TYPE_inode_generation:
337                 return le32_to_cpu(bkey_s_c_to_inode_generation(k).v->bi_generation);
338         default:
339                 return 0;
340         }
341 }
342
343 int __bch2_inode_create(struct btree_trans *trans,
344                         struct bch_inode_unpacked *inode_u,
345                         u64 min, u64 max, u64 *hint)
346 {
347         struct bch_fs *c = trans->c;
348         struct bkey_inode_buf *inode_p;
349         struct btree_iter *iter;
350         u64 start;
351         int ret;
352
353         if (!max)
354                 max = ULLONG_MAX;
355
356         if (c->opts.inodes_32bit)
357                 max = min_t(u64, max, U32_MAX);
358
359         start = READ_ONCE(*hint);
360
361         if (start >= max || start < min)
362                 start = min;
363
364         inode_p = bch2_trans_kmalloc(trans, sizeof(*inode_p));
365         if (IS_ERR(inode_p))
366                 return PTR_ERR(inode_p);
367
368         iter = bch2_trans_get_iter(trans,
369                         BTREE_ID_INODES, POS(start, 0),
370                         BTREE_ITER_SLOTS|BTREE_ITER_INTENT);
371         if (IS_ERR(iter))
372                 return PTR_ERR(iter);
373 again:
374         while (1) {
375                 struct bkey_s_c k = bch2_btree_iter_peek_slot(iter);
376
377                 ret = bkey_err(k);
378                 if (ret)
379                         return ret;
380
381                 switch (k.k->type) {
382                 case KEY_TYPE_inode:
383                         /* slot used */
384                         if (iter->pos.inode >= max)
385                                 goto out;
386
387                         bch2_btree_iter_next_slot(iter);
388                         break;
389
390                 default:
391                         *hint                   = k.k->p.inode;
392                         inode_u->bi_inum        = k.k->p.inode;
393                         inode_u->bi_generation  = bkey_generation(k);
394
395                         bch2_inode_pack(inode_p, inode_u);
396                         bch2_trans_update(trans, iter, &inode_p->inode.k_i);
397                         return 0;
398                 }
399         }
400 out:
401         if (start != min) {
402                 /* Retry from start */
403                 start = min;
404                 bch2_btree_iter_set_pos(iter, POS(start, 0));
405                 goto again;
406         }
407
408         return -ENOSPC;
409 }
410
411 int bch2_inode_create(struct bch_fs *c, struct bch_inode_unpacked *inode_u,
412                       u64 min, u64 max, u64 *hint)
413 {
414         return bch2_trans_do(c, NULL, BTREE_INSERT_ATOMIC,
415                         __bch2_inode_create(&trans, inode_u, min, max, hint));
416 }
417
418 int bch2_inode_rm(struct bch_fs *c, u64 inode_nr)
419 {
420         struct btree_trans trans;
421         struct btree_iter *iter;
422         struct bkey_i_inode_generation delete;
423         struct bpos start = POS(inode_nr, 0);
424         struct bpos end = POS(inode_nr + 1, 0);
425         int ret;
426
427         /*
428          * If this was a directory, there shouldn't be any real dirents left -
429          * but there could be whiteouts (from hash collisions) that we should
430          * delete:
431          *
432          * XXX: the dirent could ideally would delete whiteouts when they're no
433          * longer needed
434          */
435         ret   = bch2_btree_delete_range(c, BTREE_ID_EXTENTS,
436                                         start, end, NULL) ?:
437                 bch2_btree_delete_range(c, BTREE_ID_XATTRS,
438                                         start, end, NULL) ?:
439                 bch2_btree_delete_range(c, BTREE_ID_DIRENTS,
440                                         start, end, NULL);
441         if (ret)
442                 return ret;
443
444         bch2_trans_init(&trans, c, 0, 0);
445
446         iter = bch2_trans_get_iter(&trans, BTREE_ID_INODES, POS(inode_nr, 0),
447                                    BTREE_ITER_SLOTS|BTREE_ITER_INTENT);
448         do {
449                 struct bkey_s_c k = bch2_btree_iter_peek_slot(iter);
450                 u32 bi_generation = 0;
451
452                 ret = bkey_err(k);
453                 if (ret)
454                         break;
455
456                 bch2_fs_inconsistent_on(k.k->type != KEY_TYPE_inode, c,
457                                         "inode %llu not found when deleting",
458                                         inode_nr);
459
460                 switch (k.k->type) {
461                 case KEY_TYPE_inode: {
462                         struct bch_inode_unpacked inode_u;
463
464                         if (!bch2_inode_unpack(bkey_s_c_to_inode(k), &inode_u))
465                                 bi_generation = inode_u.bi_generation + 1;
466                         break;
467                 }
468                 case KEY_TYPE_inode_generation: {
469                         struct bkey_s_c_inode_generation g =
470                                 bkey_s_c_to_inode_generation(k);
471                         bi_generation = le32_to_cpu(g.v->bi_generation);
472                         break;
473                 }
474                 }
475
476                 if (!bi_generation) {
477                         bkey_init(&delete.k);
478                         delete.k.p.inode = inode_nr;
479                 } else {
480                         bkey_inode_generation_init(&delete.k_i);
481                         delete.k.p.inode = inode_nr;
482                         delete.v.bi_generation = cpu_to_le32(bi_generation);
483                 }
484
485                 bch2_trans_update(&trans, iter, &delete.k_i);
486
487                 ret = bch2_trans_commit(&trans, NULL, NULL,
488                                         BTREE_INSERT_ATOMIC|
489                                         BTREE_INSERT_NOFAIL);
490         } while (ret == -EINTR);
491
492         bch2_trans_exit(&trans);
493         return ret;
494 }
495
496 int bch2_inode_find_by_inum_trans(struct btree_trans *trans, u64 inode_nr,
497                                   struct bch_inode_unpacked *inode)
498 {
499         struct btree_iter *iter;
500         struct bkey_s_c k;
501         int ret = -ENOENT;
502
503         iter = bch2_trans_get_iter(trans, BTREE_ID_INODES,
504                         POS(inode_nr, 0), BTREE_ITER_SLOTS);
505         if (IS_ERR(iter))
506                 return PTR_ERR(iter);
507
508         k = bch2_btree_iter_peek_slot(iter);
509         if (k.k->type == KEY_TYPE_inode)
510                 ret = bch2_inode_unpack(bkey_s_c_to_inode(k), inode);
511
512         bch2_trans_iter_put(trans, iter);
513
514         return ret;
515 }
516
517 int bch2_inode_find_by_inum(struct bch_fs *c, u64 inode_nr,
518                             struct bch_inode_unpacked *inode)
519 {
520         return bch2_trans_do(c, NULL, 0,
521                 bch2_inode_find_by_inum_trans(&trans, inode_nr, inode));
522 }
523
524 #ifdef CONFIG_BCACHEFS_DEBUG
525 void bch2_inode_pack_test(void)
526 {
527         struct bch_inode_unpacked *u, test_inodes[] = {
528                 {
529                         .bi_atime       = U64_MAX,
530                         .bi_ctime       = U64_MAX,
531                         .bi_mtime       = U64_MAX,
532                         .bi_otime       = U64_MAX,
533                         .bi_size        = U64_MAX,
534                         .bi_sectors     = U64_MAX,
535                         .bi_uid         = U32_MAX,
536                         .bi_gid         = U32_MAX,
537                         .bi_nlink       = U32_MAX,
538                         .bi_generation  = U32_MAX,
539                         .bi_dev         = U32_MAX,
540                 },
541         };
542
543         for (u = test_inodes;
544              u < test_inodes + ARRAY_SIZE(test_inodes);
545              u++) {
546                 struct bkey_inode_buf p;
547
548                 bch2_inode_pack(&p, u);
549         }
550 }
551 #endif