3 #include "bkey_methods.h"
4 #include "btree_update.h"
10 #include <linux/random.h>
12 #include <asm/unaligned.h>
14 #define FIELD_BYTES() \
16 static const u8 byte_table[8] = { 1, 2, 3, 4, 6, 8, 10, 13 };
17 static const u8 bits_table[8] = {
28 static int inode_encode_field(u8 *out, u8 *end, u64 hi, u64 lo)
30 __be64 in[2] = { cpu_to_be64(hi), cpu_to_be64(lo), };
31 unsigned shift, bytes, bits = likely(!hi)
35 for (shift = 1; shift <= 8; shift++)
36 if (bits < bits_table[shift - 1])
41 bytes = byte_table[shift - 1];
43 BUG_ON(out + bytes > end);
45 memcpy(out, (u8 *) in + 16 - bytes, bytes);
46 *out |= (1 << 8) >> shift;
51 static int inode_decode_field(const u8 *in, const u8 *end,
52 u64 out[2], unsigned *out_bits)
54 __be64 be[2] = { 0, 0 };
55 unsigned bytes, shift;
65 * position of highest set bit indicates number of bytes:
66 * shift = number of bits to remove in high byte:
68 shift = 8 - __fls(*in); /* 1 <= shift <= 8 */
69 bytes = byte_table[shift - 1];
74 p = (u8 *) be + 16 - bytes;
76 *p ^= (1 << 8) >> shift;
78 out[0] = be64_to_cpu(be[0]);
79 out[1] = be64_to_cpu(be[1]);
80 *out_bits = out[0] ? 64 + fls64(out[0]) : fls64(out[1]);
85 void bch2_inode_pack(struct bkey_inode_buf *packed,
86 const struct bch_inode_unpacked *inode)
88 u8 *out = packed->inode.v.fields;
89 u8 *end = (void *) &packed[1];
90 u8 *last_nonzero_field = out;
91 unsigned nr_fields = 0, last_nonzero_fieldnr = 0;
93 bkey_inode_init(&packed->inode.k_i);
94 packed->inode.k.p.inode = inode->inum;
95 packed->inode.v.i_hash_seed = inode->i_hash_seed;
96 packed->inode.v.i_flags = cpu_to_le32(inode->i_flags);
97 packed->inode.v.i_mode = cpu_to_le16(inode->i_mode);
99 #define BCH_INODE_FIELD(_name, _bits) \
100 out += inode_encode_field(out, end, 0, inode->_name); \
103 if (inode->_name) { \
104 last_nonzero_field = out; \
105 last_nonzero_fieldnr = nr_fields; \
109 #undef BCH_INODE_FIELD
111 out = last_nonzero_field;
112 nr_fields = last_nonzero_fieldnr;
114 set_bkey_val_bytes(&packed->inode.k, out - (u8 *) &packed->inode.v);
116 (u8 *) &packed->inode.v +
117 bkey_val_bytes(&packed->inode.k) - out);
119 SET_INODE_NR_FIELDS(&packed->inode.v, nr_fields);
121 if (IS_ENABLED(CONFIG_BCACHEFS_DEBUG)) {
122 struct bch_inode_unpacked unpacked;
124 int ret = bch2_inode_unpack(inode_i_to_s_c(&packed->inode),
127 BUG_ON(unpacked.inum != inode->inum);
128 BUG_ON(unpacked.i_hash_seed != inode->i_hash_seed);
129 BUG_ON(unpacked.i_mode != inode->i_mode);
131 #define BCH_INODE_FIELD(_name, _bits) BUG_ON(unpacked._name != inode->_name);
133 #undef BCH_INODE_FIELD
137 int bch2_inode_unpack(struct bkey_s_c_inode inode,
138 struct bch_inode_unpacked *unpacked)
140 const u8 *in = inode.v->fields;
141 const u8 *end = (void *) inode.v + bkey_val_bytes(inode.k);
143 unsigned fieldnr = 0, field_bits;
146 unpacked->inum = inode.k->p.inode;
147 unpacked->i_hash_seed = inode.v->i_hash_seed;
148 unpacked->i_flags = le32_to_cpu(inode.v->i_flags);
149 unpacked->i_mode = le16_to_cpu(inode.v->i_mode);
151 #define BCH_INODE_FIELD(_name, _bits) \
152 if (fieldnr++ == INODE_NR_FIELDS(inode.v)) { \
153 memset(&unpacked->_name, 0, \
154 sizeof(*unpacked) - \
155 offsetof(struct bch_inode_unpacked, _name)); \
159 ret = inode_decode_field(in, end, field, &field_bits); \
163 if (field_bits > sizeof(unpacked->_name) * 8) \
166 unpacked->_name = field[1]; \
170 #undef BCH_INODE_FIELD
172 /* XXX: signal if there were more fields than expected? */
177 static const char *bch2_inode_invalid(const struct bch_fs *c,
181 return "nonzero offset";
185 struct bkey_s_c_inode inode = bkey_s_c_to_inode(k);
186 struct bch_inode_unpacked unpacked;
188 if (bkey_val_bytes(k.k) < sizeof(struct bch_inode))
189 return "incorrect value size";
191 if (k.k->p.inode < BLOCKDEV_INODE_MAX)
192 return "fs inode in blockdev range";
194 if (INODE_STR_HASH(inode.v) >= BCH_STR_HASH_NR)
195 return "invalid str hash type";
197 if (bch2_inode_unpack(inode, &unpacked))
198 return "invalid variable length fields";
202 case BCH_INODE_BLOCKDEV:
203 if (bkey_val_bytes(k.k) != sizeof(struct bch_inode_blockdev))
204 return "incorrect value size";
206 if (k.k->p.inode >= BLOCKDEV_INODE_MAX)
207 return "blockdev inode in fs range";
211 return "invalid type";
215 static void bch2_inode_to_text(struct bch_fs *c, char *buf,
216 size_t size, struct bkey_s_c k)
218 struct bkey_s_c_inode inode;
219 struct bch_inode_unpacked unpacked;
223 inode = bkey_s_c_to_inode(k);
224 if (bch2_inode_unpack(inode, &unpacked)) {
225 scnprintf(buf, size, "(unpack error)");
229 scnprintf(buf, size, "i_size %llu", unpacked.i_size);
234 const struct bkey_ops bch2_bkey_inode_ops = {
235 .key_invalid = bch2_inode_invalid,
236 .val_to_text = bch2_inode_to_text,
239 void bch2_inode_init(struct bch_fs *c, struct bch_inode_unpacked *inode_u,
240 uid_t uid, gid_t gid, umode_t mode, dev_t rdev)
242 s64 now = timespec_to_bch2_time(c, CURRENT_TIME);
244 memset(inode_u, 0, sizeof(*inode_u));
247 inode_u->i_flags |= c->sb.str_hash_type << INODE_STR_HASH_OFFSET;
248 get_random_bytes(&inode_u->i_hash_seed, sizeof(inode_u->i_hash_seed));
250 inode_u->i_mode = mode;
251 inode_u->i_uid = uid;
252 inode_u->i_gid = gid;
253 inode_u->i_dev = rdev;
254 inode_u->i_atime = now;
255 inode_u->i_mtime = now;
256 inode_u->i_ctime = now;
257 inode_u->i_otime = now;
260 int bch2_inode_create(struct bch_fs *c, struct bkey_i *inode,
261 u64 min, u64 max, u64 *hint)
263 struct btree_iter iter;
264 bool searched_from_start = false;
270 if (c->opts.inodes_32bit)
271 max = min_t(u64, max, U32_MAX);
273 if (*hint >= max || *hint < min)
277 searched_from_start = true;
279 bch2_btree_iter_init(&iter, c, BTREE_ID_INODES, POS(*hint, 0),
283 struct bkey_s_c k = bch2_btree_iter_peek_with_holes(&iter);
285 ret = btree_iter_err(k);
287 bch2_btree_iter_unlock(&iter);
291 if (k.k->type < BCH_INODE_FS) {
294 pr_debug("inserting inode %llu (size %u)",
295 inode->k.p.inode, inode->k.u64s);
297 ret = bch2_btree_insert_at(c, NULL, NULL, NULL,
299 BTREE_INSERT_ENTRY(&iter, inode));
304 bch2_btree_iter_unlock(&iter);
306 *hint = k.k->p.inode + 1;
310 if (iter.pos.inode == max)
313 bch2_btree_iter_advance_pos(&iter);
316 bch2_btree_iter_unlock(&iter);
318 if (!searched_from_start) {
319 /* Retry from start */
321 searched_from_start = true;
328 int bch2_inode_truncate(struct bch_fs *c, u64 inode_nr, u64 new_size,
329 struct extent_insert_hook *hook, u64 *journal_seq)
331 return bch2_btree_delete_range(c, BTREE_ID_EXTENTS,
332 POS(inode_nr, new_size),
333 POS(inode_nr + 1, 0),
334 ZERO_VERSION, NULL, hook,
338 int bch2_inode_rm(struct bch_fs *c, u64 inode_nr)
340 struct bkey_i delete;
343 ret = bch2_inode_truncate(c, inode_nr, 0, NULL, NULL);
347 ret = bch2_btree_delete_range(c, BTREE_ID_XATTRS,
349 POS(inode_nr + 1, 0),
350 ZERO_VERSION, NULL, NULL, NULL);
355 * If this was a directory, there shouldn't be any real dirents left -
356 * but there could be whiteouts (from hash collisions) that we should
359 * XXX: the dirent could ideally would delete whitouts when they're no
362 ret = bch2_btree_delete_range(c, BTREE_ID_DIRENTS,
364 POS(inode_nr + 1, 0),
365 ZERO_VERSION, NULL, NULL, NULL);
369 bkey_init(&delete.k);
370 delete.k.p.inode = inode_nr;
372 return bch2_btree_insert(c, BTREE_ID_INODES, &delete, NULL,
373 NULL, NULL, BTREE_INSERT_NOFAIL);
376 int bch2_inode_find_by_inum(struct bch_fs *c, u64 inode_nr,
377 struct bch_inode_unpacked *inode)
379 struct btree_iter iter;
383 for_each_btree_key(&iter, c, BTREE_ID_INODES,
385 BTREE_ITER_WITH_HOLES, k) {
388 ret = bch2_inode_unpack(bkey_s_c_to_inode(k), inode);
391 /* hole, not found */
399 return bch2_btree_iter_unlock(&iter) ?: ret;
402 int bch2_cached_dev_inode_find_by_uuid(struct bch_fs *c, uuid_le *uuid,
403 struct bkey_i_inode_blockdev *ret)
405 struct btree_iter iter;
408 for_each_btree_key(&iter, c, BTREE_ID_INODES, POS(0, 0), 0, k) {
409 if (k.k->p.inode >= BLOCKDEV_INODE_MAX)
412 if (k.k->type == BCH_INODE_BLOCKDEV) {
413 struct bkey_s_c_inode_blockdev inode =
414 bkey_s_c_to_inode_blockdev(k);
416 pr_debug("found inode %llu: %pU (u64s %u)",
417 inode.k->p.inode, inode.v->i_uuid.b,
420 if (CACHED_DEV(inode.v) &&
421 !memcmp(uuid, &inode.v->i_uuid, 16)) {
422 bkey_reassemble(&ret->k_i, k);
423 bch2_btree_iter_unlock(&iter);
428 bch2_btree_iter_cond_resched(&iter);
430 bch2_btree_iter_unlock(&iter);
434 #ifdef CONFIG_BCACHEFS_DEBUG
435 void bch2_inode_pack_test(void)
437 struct bch_inode_unpacked *u, test_inodes[] = {
444 .i_sectors = U64_MAX,
448 .i_generation = U32_MAX,
453 for (u = test_inodes;
454 u < test_inodes + ARRAY_SIZE(test_inodes);
456 struct bkey_inode_buf p;
458 bch2_inode_pack(&p, u);