| /fs/bcachefs/ |
| D | bset.c | 34 struct bset_tree *bch2_bkey_to_bset(struct btree *b, struct bkey_packed *k) in bch2_bkey_to_bset()
55 void bch2_dump_bset(struct bch_fs *c, struct btree *b, in bch2_dump_bset()
104 void bch2_dump_btree_node(struct bch_fs *c, struct btree *b) in bch2_dump_btree_node()
112 void bch2_dump_btree_node_iter(struct btree *b, in bch2_dump_btree_node_iter()
135 struct btree_nr_keys bch2_btree_node_count_keys(struct btree *b) in bch2_btree_node_count_keys()
149 void __bch2_verify_btree_nr_keys(struct btree *b) in __bch2_verify_btree_nr_keys()
157 struct btree *b) in bch2_btree_node_iter_next_check()
194 struct btree *b) in bch2_btree_node_iter_verify()
240 void bch2_verify_insert_pos(struct btree *b, struct bkey_packed *where, in bch2_verify_insert_pos()
291 struct btree *b) {} in bch2_btree_node_iter_next_check()
[all …]
|
| D | bset.h | 193 static inline size_t btree_keys_cachelines(const struct btree *b) in btree_keys_cachelines()
198 static inline size_t btree_aux_data_bytes(const struct btree *b) in btree_aux_data_bytes()
203 static inline size_t btree_aux_data_u64s(const struct btree *b) in btree_aux_data_u64s()
229 static inline void bch2_bset_set_no_aux_tree(struct btree *b, in bch2_bset_set_no_aux_tree()
241 static inline void btree_node_set_format(struct btree *b, in btree_node_set_format()
257 static inline struct bset *bset_next_set(struct btree *b, in bset_next_set()
280 static inline int bkey_cmp_p_or_unp(const struct btree *b, in bkey_cmp_p_or_unp()
297 bch2_bkey_to_bset_inlined(struct btree *b, struct bkey_packed *k) in bch2_bkey_to_bset_inlined()
316 bch2_bkey_prev_all(struct btree *b, struct bset_tree *t, struct bkey_packed *k) in bch2_bkey_prev_all()
322 bch2_bkey_prev(struct btree *b, struct bset_tree *t, struct bkey_packed *k) in bch2_bkey_prev()
[all …]
|
| D | btree_cache.c | 60 static void btree_node_to_freedlist(struct btree_cache *bc, struct btree *b) in btree_node_to_freedlist()
70 static void __bch2_btree_node_to_freelist(struct btree_cache *bc, struct btree *b) in __bch2_btree_node_to_freelist()
79 void bch2_btree_node_to_freelist(struct bch_fs *c, struct btree *b) in bch2_btree_node_to_freelist()
91 static void __btree_node_data_free(struct btree_cache *bc, struct btree *b) in __btree_node_data_free()
122 static void btree_node_data_free(struct btree_cache *bc, struct btree *b) in btree_node_data_free()
133 const struct btree *b = obj; in bch2_btree_cache_cmp_fn() local
147 static int btree_node_data_alloc(struct bch_fs *c, struct btree *b, gfp_t gfp) in btree_node_data_alloc()
176 struct btree *b; in __btree_node_mem_alloc() local
192 struct btree *b; in __bch2_btree_node_mem_alloc() local
209 static inline bool __btree_node_pinned(struct btree_cache *bc, struct btree *b) in __btree_node_pinned()
[all …]
|
| D | btree_update_interior.h | 73 struct btree *b; member
86 struct btree *b[BTREE_UPDATE_NODES_MAX]; member
143 struct btree *b; in bch2_foreground_maybe_merge_sibling() local
185 struct btree *b) in btree_update_reserve_required()
200 static inline void btree_node_reset_sib_u64s(struct btree *b) in btree_node_reset_sib_u64s()
206 static inline void *btree_data_end(struct btree *b) in btree_data_end()
211 static inline struct bkey_packed *unwritten_whiteouts_start(struct btree *b) in unwritten_whiteouts_start()
216 static inline struct bkey_packed *unwritten_whiteouts_end(struct btree *b) in unwritten_whiteouts_end()
221 static inline void *write_block(struct btree *b) in write_block()
226 static inline bool __btree_addr_written(struct btree *b, void *p) in __btree_addr_written()
[all …]
|
| D | btree_io.c | 38 void bch2_btree_node_io_unlock(struct btree *b) in bch2_btree_node_io_unlock()
47 void bch2_btree_node_io_lock(struct btree *b) in bch2_btree_node_io_lock()
53 void __bch2_btree_node_wait_on_read(struct btree *b) in __bch2_btree_node_wait_on_read()
59 void __bch2_btree_node_wait_on_write(struct btree *b) in __bch2_btree_node_wait_on_write()
65 void bch2_btree_node_wait_on_read(struct btree *b) in bch2_btree_node_wait_on_read()
71 void bch2_btree_node_wait_on_write(struct btree *b) in bch2_btree_node_wait_on_write()
77 static void verify_no_dups(struct btree *b, in verify_no_dups()
136 unsigned n = nr, a = nr / 2, b, c, d; in sort_bkey_ptrs() local
170 static void bch2_sort_whiteouts(struct bch_fs *c, struct btree *b) in bch2_sort_whiteouts()
207 static bool should_compact_bset(struct btree *b, struct bset_tree *t, in should_compact_bset()
[all …]
|
| D | btree_update_interior.c | 45 int bch2_btree_node_check_topology(struct btree_trans *trans, struct btree *b) in bch2_btree_node_check_topology()
161 static void __bch2_btree_calc_format(struct bkey_format_state *s, struct btree *b) in __bch2_btree_calc_format()
174 static struct bkey_format bch2_btree_calc_format(struct btree *b) in bch2_btree_calc_format()
214 static bool bch2_btree_node_format_fits(struct bch_fs *c, struct btree *b, in bch2_btree_node_format_fits()
225 static void __btree_node_free(struct btree_trans *trans, struct btree *b) in __btree_node_free()
244 struct btree *b) in bch2_btree_node_free_inmem()
269 struct btree *b) in bch2_btree_node_free_never_used()
311 struct btree *b; in __bch2_btree_node_alloc() local
386 struct btree *b; in bch2_btree_node_alloc() local
434 static void btree_set_min(struct btree *b, struct bpos pos) in btree_set_min()
[all …]
|
| D | buckets.h | 20 static inline sector_t bucket_to_sector(const struct bch_dev *ca, size_t b) in bucket_to_sector()
69 static inline void bucket_unlock(struct bucket *b) in bucket_unlock()
77 static inline void bucket_lock(struct bucket *b) in bucket_lock()
83 static inline struct bucket *gc_bucket(struct bch_dev *ca, size_t b) in gc_bucket()
97 static inline u8 *bucket_gen(struct bch_dev *ca, size_t b) in bucket_gen()
106 static inline int bucket_gen_get_rcu(struct bch_dev *ca, size_t b) in bucket_gen_get_rcu()
112 static inline int bucket_gen_get(struct bch_dev *ca, size_t b) in bucket_gen_get()
164 static inline int gen_cmp(u8 a, u8 b) in gen_cmp()
169 static inline int gen_after(u8 a, u8 b) in gen_after()
311 static inline bool is_superblock_bucket(struct bch_dev *ca, u64 b) in is_superblock_bucket()
|
| D | btree_cache.h | 76 static inline bool btree_node_hashed(struct btree *b) in btree_node_hashed()
87 static inline size_t btree_buf_bytes(const struct btree *b) in btree_buf_bytes()
92 static inline size_t btree_buf_max_u64s(const struct btree *b) in btree_buf_max_u64s()
136 static inline struct btree *btree_node_root(struct bch_fs *c, struct btree *b) in btree_node_root()
|
| D | btree_io.h | 18 static inline void set_btree_node_dirty_acct(struct bch_fs *c, struct btree *b) in set_btree_node_dirty_acct()
24 static inline void clear_btree_node_dirty_acct(struct bch_fs *c, struct btree *b) in clear_btree_node_dirty_acct()
39 struct btree *b; member
73 static inline bool should_compact_bset_lazy(struct btree *b, in should_compact_bset_lazy()
82 static inline bool bch2_maybe_compact_whiteouts(struct bch_fs *c, struct btree *b) in bch2_maybe_compact_whiteouts()
148 static inline void btree_node_write_if_need(struct bch_fs *c, struct btree *b, in btree_node_write_if_need()
|
| D | btree_locking.h | 167 struct btree *b) in bch2_btree_node_unlock_write_inlined()
216 struct btree_bkey_cached_common *b, in __btree_node_lock_nopath()
237 struct btree_bkey_cached_common *b, in btree_node_lock_nopath()
245 struct btree_bkey_cached_common *b, in btree_node_lock_nopath_nofail()
258 struct btree_bkey_cached_common *b, in btree_node_lock_increment()
277 struct btree_bkey_cached_common *b, in btree_node_lock()
303 struct btree_bkey_cached_common *b, in __btree_node_lock_write()
325 struct btree_bkey_cached_common *b) in bch2_btree_node_lock_write()
|
| D | eytzinger.c | 44 static void swap_words_32(void *a, void *b, size_t n) in swap_words_32()
69 static void swap_words_64(void *a, void *b, size_t n) in swap_words_64()
97 static void swap_bytes(void *a, void *b, size_t n) in swap_bytes()
125 static void do_swap(void *a, void *b, size_t size, swap_r_func_t swap_func, const void *priv) in do_swap()
144 static int do_cmp(const void *a, const void *b, cmp_r_func_t cmp, const void *priv) in do_cmp()
|
| D | mean_and_variance.h | 41 static inline u128_u u128_add(u128_u a, u128_u b) in u128_add()
47 static inline u128_u u128_sub(u128_u a, u128_u b) in u128_sub()
61 u128_u b = u64_to_u128(a); in u128_square() local
92 static inline u128_u u128_add(u128_u a, u128_u b) in u128_add()
101 static inline u128_u u128_sub(u128_u a, u128_u b) in u128_sub()
|
| D | bkey.h | 85 int bkey_cmp_left_packed(const struct btree *b, in bkey_cmp_left_packed()
97 static inline int bkey_cmp_left_packed_byval(const struct btree *b, in bkey_cmp_left_packed_byval()
386 const struct btree *b) in bkey_pack_pos()
399 __bkey_unpack_key_format_checked(const struct btree *b, in __bkey_unpack_key_format_checked()
419 bkey_unpack_key_format_checked(const struct btree *b, in bkey_unpack_key_format_checked()
428 static inline void __bkey_unpack_key(const struct btree *b, in __bkey_unpack_key()
441 static inline struct bkey bkey_unpack_key(const struct btree *b, in bkey_unpack_key()
450 bkey_unpack_pos_format_checked(const struct btree *b, in bkey_unpack_pos_format_checked()
460 static inline struct bpos bkey_unpack_pos(const struct btree *b, in bkey_unpack_pos()
470 static inline struct bkey_s_c bkey_disassemble(const struct btree *b, in bkey_disassemble()
[all …]
|
| D | buckets_waiting_for_journal.c | 25 bool bch2_bucket_needs_journal_commit(struct buckets_waiting_for_journal *b, in bch2_bucket_needs_journal_commit()
86 int bch2_set_bucket_needs_journal_commit(struct buckets_waiting_for_journal *b, in bch2_set_bucket_needs_journal_commit()
155 struct buckets_waiting_for_journal *b = &c->buckets_waiting_for_journal; in bch2_fs_buckets_waiting_for_journal_exit() local
164 struct buckets_waiting_for_journal *b = &c->buckets_waiting_for_journal; in bch2_fs_buckets_waiting_for_journal_init() local
|
| D | btree_gc.c | 87 static void btree_ptr_to_v2(struct btree *b, struct bkey_i_btree_ptr_v2 *dst) in btree_ptr_to_v2()
111 static int set_node_min(struct bch_fs *c, struct btree *b, struct bpos new_min) in set_node_min()
147 static int set_node_max(struct bch_fs *c, struct btree *b, struct bpos new_max) in set_node_max()
194 static int btree_check_node_boundaries(struct btree_trans *trans, struct btree *b, in btree_check_node_boundaries()
270 static int btree_repair_node_end(struct btree_trans *trans, struct btree *b, in btree_repair_node_end()
308 static int bch2_btree_repair_topology_recurse(struct btree_trans *trans, struct btree *b, in bch2_btree_repair_topology_recurse()
547 struct btree *b = r->b; in bch2_check_topology() local
585 struct btree *b = path_l(path)->b; in bch2_gc_mark_key() local
686 struct btree *b = bch2_btree_iter_peek_node(&iter); in bch2_gc_btree() local
1234 u64 b, start_time = local_clock(); in bch2_gc_gens() local
|
| D | bkey_sort.h | 6 struct btree *b; member
15 static inline void sort_iter_init(struct sort_iter *iter, struct btree *b, unsigned size) in sort_iter_init()
27 static inline void sort_iter_stack_init(struct sort_iter_stack *iter, struct btree *b) in sort_iter_stack_init()
|
| D | time_stats.c | 103 struct time_stat_buffer *b) in __bch2_time_stats_clear_buffer()
113 struct time_stat_buffer *b) in time_stats_clear_buffer()
137 struct time_stat_buffer *b; in __bch2_time_stats_update() local
|
| D | btree_types.h | 336 struct btree *b; member
417 static inline struct bpos btree_node_pos(struct btree_bkey_cached_common *b) in btree_node_pos()
630 static inline struct btree_write *btree_prev_write(struct btree *b) in btree_prev_write()
635 static inline struct bset_tree *bset_tree_last(struct btree *b) in bset_tree_last()
642 __btree_node_offset_to_ptr(const struct btree *b, u16 offset) in __btree_node_offset_to_ptr()
648 __btree_node_ptr_to_offset(const struct btree *b, const void *p) in __btree_node_ptr_to_offset()
656 static inline struct bset *bset(const struct btree *b, in bset()
662 static inline void set_btree_bset_end(struct btree *b, struct bset_tree *t) in set_btree_bset_end()
668 static inline void set_btree_bset(struct btree *b, struct bset_tree *t, in set_btree_bset()
675 static inline struct bset *btree_bset_first(struct btree *b) in btree_bset_first()
[all …]
|
| D | bkey.c | 348 void bch2_bkey_unpack(const struct btree *b, struct bkey_i *dst, in bch2_bkey_unpack()
403 const struct btree *b, in bkey_packed_successor()
470 const struct btree *b) in bch2_bkey_pack_pos_lossy()
607 unsigned b = min(4U, 32U - ret.bits_per_field[BKEY_FIELD_SIZE]); in bch2_bkey_format_done() local
702 unsigned bch2_bkey_greatest_differing_bit(const struct btree *b, in bch2_bkey_greatest_differing_bit()
746 unsigned bch2_bkey_ffs(const struct btree *b, const struct bkey_packed *k) in bch2_bkey_ffs()
1018 const struct btree *b) in __bch2_bkey_cmp_packed_format_checked()
1024 int __bch2_bkey_cmp_left_packed_format_checked(const struct btree *b, in __bch2_bkey_cmp_left_packed_format_checked()
1032 int bch2_bkey_cmp_packed(const struct btree *b, in bch2_bkey_cmp_packed()
1040 int __bch2_bkey_cmp_left_packed(const struct btree *b, in __bch2_bkey_cmp_left_packed()
|
| /fs/fuse/ |
| D | fuse_trace.h | 69 #define EM(a, b) TRACE_DEFINE_ENUM(a); argument
70 #define EMe(a, b) TRACE_DEFINE_ENUM(a); argument
77 #define EM(a, b) {a, b}, argument
78 #define EMe(a, b) {a, b} argument
|
| /fs/nfsd/ |
| D | nfscache.c | 136 nfsd_cacherep_unlink_locked(struct nfsd_net *nn, struct nfsd_drc_bucket *b, in nfsd_cacherep_unlink_locked()
150 nfsd_reply_cache_free_locked(struct nfsd_drc_bucket *b, struct nfsd_cacherep *rp, in nfsd_reply_cache_free_locked()
158 nfsd_reply_cache_free(struct nfsd_drc_bucket *b, struct nfsd_cacherep *rp, in nfsd_reply_cache_free()
245 lru_put_end(struct nfsd_drc_bucket *b, struct nfsd_cacherep *rp) in lru_put_end()
264 nfsd_prune_bucket_locked(struct nfsd_net *nn, struct nfsd_drc_bucket *b, in nfsd_prune_bucket_locked()
332 struct nfsd_drc_bucket *b = &nn->drc_hashtbl[i]; in nfsd_reply_cache_scan() local
419 nfsd_cache_insert(struct nfsd_drc_bucket *b, struct nfsd_cacherep *key, in nfsd_cache_insert()
485 struct nfsd_drc_bucket *b; in nfsd_cache_lookup() local
590 struct nfsd_drc_bucket *b; in nfsd_cache_update() local
|
| /fs/smb/client/ |
| D | trace.h | 79 #define EM(a, b) a, argument
80 #define E_(a, b) a argument
92 #define EM(a, b) TRACE_DEFINE_ENUM(a); argument
93 #define E_(a, b) TRACE_DEFINE_ENUM(a); argument
105 #define EM(a, b) { a, b }, argument
106 #define E_(a, b) { a, b } argument
|
| /fs/smb/common/ |
| D | cifs_md4.c | 51 #define ROUND1(a,b,c,d,k,s) (a = lshift(a + F(b,c,d) + k, s)) argument
52 #define ROUND2(a,b,c,d,k,s) (a = lshift(a + G(b,c,d) + k + (u32)0x5A827999,s)) argument
53 #define ROUND3(a,b,c,d,k,s) (a = lshift(a + H(b,c,d) + k + (u32)0x6ED9EBA1,s)) argument
57 u32 a, b, c, d; in md4_transform() local
|
| /fs/xfs/libxfs/ |
| D | xfs_trans_space.h | 32 #define XFS_NRMAPADD_SPACE_RES(mp, b)\ argument
40 #define XFS_NEXTENTADD_SPACE_RES(mp,b,w)\ argument
46 #define XFS_SWAP_RMAP_SPACE_RES(mp,b,w)\ argument
87 #define XFS_GROWFSRT_SPACE_RES(mp,b) \ argument
|
| /fs/jffs2/ |
| D | summary.h | 201 #define jffs2_sum_add_kvec(a,b,c,d) (0) argument
202 #define jffs2_sum_move_collected(a,b) do { } while (0) argument
204 #define jffs2_sum_add_padding_mem(a,b) do { } while (0) argument
205 #define jffs2_sum_add_inode_mem(a,b,c) do { } while (0) argument
206 #define jffs2_sum_add_dirent_mem(a,b,c) do { } while (0) argument
207 #define jffs2_sum_add_xattr_mem(a,b,c) do { } while (0) argument
208 #define jffs2_sum_add_xref_mem(a,b,c) do { } while (0) argument
209 #define jffs2_sum_scan_sumnode(a,b,c,d,e) (0) argument
|