| /fs/bcachefs/ |
| A D | bkey_types.h | 13 #define bkey_p_next(_k) vstruct_next(_k) argument
20 #define bkey_val_u64s(_k) ((_k)->u64s - BKEY_U64s) argument
40 #define bkey_val_end(_k) ((void *) (((u64 *) (_k).v) + bkey_val_u64s((_k).k))) argument
42 #define bkey_deleted(_k) ((_k)->type == KEY_TYPE_deleted) argument
44 #define bkey_whiteout(_k) \ argument
45 ((_k)->type == KEY_TYPE_deleted || (_k)->type == KEY_TYPE_whiteout)
197 static inline struct bkey_i_##name *bkey_##name##_init(struct bkey_i *_k)\
200 container_of(&_k->k, struct bkey_i_##name, k); \
|
| A D | btree_iter.h | 19 #define bkey_err(_k) __bkey_err((_k).k) argument
808 _end, _flags, _k, _do) \
810 struct bkey_s_c _k; \
817 if (!(_k).k) \
820 bkey_err(_k) ?: (_do); \
852 struct bkey_s_c _k; \
862 if (!(_k).k) \
865 bkey_err(_k) ?: (_do); \
905 !((_ret) = bkey_err(_k)) && (_k).k; \
911 !((_ret) = bkey_err(_k)) && (_k).k; \
[all …]
|
| A D | siphash.h | 75 #define SipHash24_Init(_c, _k) SipHash_Init((_c), (_k)) argument
79 #define SipHash24(_k, _p, _l) SipHash((_k), 2, 4, (_p), (_l)) argument
81 #define SipHash48_Init(_c, _k) SipHash_Init((_c), (_k)) argument
85 #define SipHash48(_k, _p, _l) SipHash((_k), 4, 8, (_p), (_l)) argument
|
| A D | bset.h | 214 #define bset_tree_for_each_key(_b, _t, _k) \ argument
215 for (_k = btree_bkey_first(_b, _t); \
216 _k != btree_bkey_last(_b, _t); \
217 _k = bkey_p_next(_k))
489 #define btree_keys_account_key_add(_nr, _bset_idx, _k) \ argument
490 btree_keys_account_key(_nr, _bset_idx, _k, 1)
492 btree_keys_account_key(_nr, _bset_idx, _k, -1)
494 #define btree_account_key_add(_b, _k) \ argument
496 bch2_bkey_to_bset(_b, _k) - (_b)->set, _k, 1)
497 #define btree_account_key_drop(_b, _k) \ argument
[all …]
|
| A D | extents.h | 335 (_ptr).crc = bch2_extent_crc_unpack(_k, \
360 #define bkey_crc_next(_k, _end, _crc, _iter) \ argument
364 (_crc) = bch2_extent_crc_unpack(_k, \
375 bkey_crc_next(_k, _end, _crc, _iter); \
378 #define bkey_for_each_crc(_k, _p, _crc, _iter) \ argument
520 #define bkey_inline_data_p(_k) (((void *) (_k).v) + bkey_inline_data_offset((_k).k)) argument
656 _ptrs = bch2_bkey_ptrs(_k); \
660 bch2_bkey_drop_ptr_noerror(_k, _ptr); \
665 #define bch2_bkey_drop_ptrs(_k, _ptr, _cond) \ argument
670 _ptrs = bch2_bkey_ptrs(_k); \
[all …]
|
| A D | subvolume.h | 49 _end, _subvolid, _flags, _k, _do) \
51 struct bkey_s_c _k; \
56 (_k) = bch2_btree_iter_peek_in_subvolume_max_type(trans, &(_iter),\
58 if (!(_k).k) \
61 bkey_err(_k) ?: (_do); \
70 _start, _end, _subvolid, _flags, _k, _do) \
77 _end, _subvolid, _flags, _k, _do); \
|
| A D | keylist.h | 52 #define for_each_keylist_key(_keylist, _k) \ argument
53 for (struct bkey_i *_k = (_keylist)->keys; \
54 _k != (_keylist)->top; \
55 _k = bkey_next(_k))
|
| A D | journal_io.h | 56 #define jset_entry_for_each_key(_e, _k) \ argument
57 for (struct bkey_i *_k = (_e)->start; \
58 _k < vstruct_last(_e); \
59 _k = bkey_next(_k))
|
| A D | bkey.h | 218 #define bkey_packed(_k) \ argument
219 ({ EBUG_ON((_k)->format > KEY_FORMAT_CURRENT); \
220 (_k)->format != KEY_FORMAT_CURRENT; })
222 #define bkey_packed(_k) ((_k)->format != KEY_FORMAT_CURRENT) argument
349 #define bkeyp_val(_format, _k) \ argument
350 ((struct bch_val *) ((u64 *) (_k)->_data + bkeyp_key_u64s(_format, _k)))
|
| A D | disk_accounting.h | 91 #define disk_accounting_key_init(_k, _type, ...) \ argument
93 memset(&(_k), 0, sizeof(_k)); \
94 (_k).type = BCH_DISK_ACCOUNTING_##_type; \
95 (_k)._type = (struct bch_acct_##_type) { __VA_ARGS__ }; \
|
| A D | btree_update.h | 302 #define bch2_bkey_make_mut_noupdate_typed(_trans, _k, _type) \ argument
303 bkey_i_to_##_type(__bch2_bkey_make_mut_noupdate(_trans, _k, \
332 #define bch2_bkey_make_mut_typed(_trans, _iter, _k, _flags, _type) \ argument
333 bkey_i_to_##_type(__bch2_bkey_make_mut(_trans, _iter, _k, _flags,\
|
| A D | bset.c | 58 struct bkey_packed *_k, *_n; in bch2_dump_bset() local
66 for (_k = i->start; in bch2_dump_bset()
67 _k < vstruct_last(i); in bch2_dump_bset()
68 _k = _n) { in bch2_dump_bset()
69 _n = bkey_p_next(_k); in bch2_dump_bset()
71 if (!_k->u64s) { in bch2_dump_bset()
73 _k->_data - i->_data); in bch2_dump_bset()
77 k = bkey_disassemble(b, _k, &uk); in bch2_dump_bset()
85 _k->_data - i->_data, buf.buf); in bch2_dump_bset()
|
| A D | rebalance.c | 164 struct bkey_i *_k) in bch2_bkey_set_needs_rebalance() argument
166 if (!bkey_extent_is_direct_data(&_k->k)) in bch2_bkey_set_needs_rebalance()
169 struct bkey_s k = bkey_i_to_s(_k); in bch2_bkey_set_needs_rebalance()
|
| A D | debug.c | 441 struct bkey_packed *_k = in bch2_read_bfloat_failed()
449 bch2_bfloat_to_text(&i->buf, l->b, _k); in bch2_read_bfloat_failed()
|
| A D | bcachefs_format.h | 364 #define bkey_bytes(_k) ((_k)->u64s * sizeof(__u64)) argument
|
| A D | btree_iter.c | 1834 struct bkey_packed *_k; in bch2_btree_path_peek_slot() local
1844 _k = bch2_btree_node_iter_peek_all(&l->iter, l->b); in bch2_btree_path_peek_slot()
1845 k = _k ? bkey_disassemble(l->b, _k, u) : bkey_s_c_null; in bch2_btree_path_peek_slot()
|