| /fs/bcachefs/ |
| A D | replicas.h | 56 #define for_each_cpu_replicas_entry(_r, _i) \ argument
57 for (_i = (_r)->entries; \
58 (void *) (_i) < (void *) (_r)->entries + (_r)->nr * (_r)->entry_size;\
59 _i = (void *) (_i) + (_r)->entry_size)
66 #define for_each_replicas_entry(_r, _i) \ argument
67 for (_i = (_r)->entries; \
68 (void *) (_i) < vstruct_end(&(_r)->field) && (_i)->data_type;\
71 #define for_each_replicas_entry_v0(_r, _i) \ argument
72 for (_i = (_r)->entries; \
73 (void *) (_i) < vstruct_end(&(_r)->field) && (_i)->data_type;\
|
| A D | fifo.h | 79 if (_r) \
80 *_r = (new); \
81 _r != NULL; \
87 if (_r) \
88 *_r = (new); \
89 _r != NULL; \
94 bool _r = !fifo_empty((fifo)); \
95 if (_r) \
97 _r; \
103 if (_r) \
[all …]
|
| A D | util.h | 173 int _r = kstrtoul(cp, 10, &_v); \
174 if (!_r) \
176 _r; \
182 int _r = kstrtoul(cp, 10, &_v); \
183 if (!_r) \
185 _r; \
191 int _r = kstrtoul(cp, 10, &_v); \
192 if (!_r && _v >= min && _v <= max) \
195 _r = -EINVAL; \
196 _r; \
|
| A D | journal_sb.c | 11 static int u64_cmp(const void *_l, const void *_r) in u64_cmp() argument
14 const u64 *r = _r; in u64_cmp()
93 static int u64_range_cmp(const void *_l, const void *_r) in u64_range_cmp() argument
96 const struct u64_range *r = _r; in u64_range_cmp()
|
| A D | btree_node_scan.c | 78 static int found_btree_node_cmp_cookie(const void *_l, const void *_r) in found_btree_node_cmp_cookie() argument
81 const struct found_btree_node *r = _r; in found_btree_node_cmp_cookie()
99 static int found_btree_node_cmp_pos(const void *_l, const void *_r) in found_btree_node_cmp_pos() argument
102 const struct found_btree_node *r = _r; in found_btree_node_cmp_pos()
115 static inline void found_btree_node_swap(void *_l, void *_r, void *arg) in found_btree_node_swap() argument
118 struct found_btree_node *r = _r; in found_btree_node_swap()
485 static int found_btree_node_range_start_cmp(const void *_l, const void *_r) in found_btree_node_range_start_cmp() argument
488 const struct found_btree_node *r = _r; in found_btree_node_range_start_cmp()
|
| A D | btree_write_buffer.h | 37 static inline int wb_key_cmp(const void *_l, const void *_r) in wb_key_cmp() argument
40 const struct btree_write_buffered_key *r = _r; in wb_key_cmp()
|
| A D | clock.c | 12 struct io_timer **_r = (struct io_timer **)r; in io_timer_cmp() local
14 return (*_l)->expire < (*_r)->expire; in io_timer_cmp()
|
| A D | xattr.c | 44 static bool xattr_cmp_key(struct bkey_s_c _l, const void *_r) in xattr_cmp_key() argument
47 const struct xattr_search_key *r = _r; in xattr_cmp_key()
54 static bool xattr_cmp_bkey(struct bkey_s_c _l, struct bkey_s_c _r) in xattr_cmp_bkey() argument
57 struct bkey_s_c_xattr r = bkey_s_c_to_xattr(_r); in xattr_cmp_bkey()
|
| A D | journal_seq_blacklist.c | 98 static int journal_seq_blacklist_table_cmp(const void *_l, const void *_r) in journal_seq_blacklist_table_cmp() argument
101 const struct journal_seq_blacklist_table_entry *r = _r; in journal_seq_blacklist_table_cmp()
|
| A D | reflink.c | 72 bool bch2_reflink_p_merge(struct bch_fs *c, struct bkey_s _l, struct bkey_s_c _r) in bch2_reflink_p_merge() argument
75 struct bkey_s_c_reflink_p r = bkey_s_c_to_reflink_p(_r); in bch2_reflink_p_merge()
123 bool bch2_reflink_v_merge(struct bch_fs *c, struct bkey_s _l, struct bkey_s_c _r)
126 struct bkey_s_c_reflink_v r = bkey_s_c_to_reflink_v(_r);
128 return l.v->refcount == r.v->refcount && bch2_extent_merge(c, _l, _r);
|
| A D | disk_accounting.h | 125 static inline int accounting_pos_cmp(const void *_l, const void *_r) in accounting_pos_cmp() argument
127 const struct bpos *l = _l, *r = _r; in accounting_pos_cmp()
|
| A D | dirent.c | 113 static bool dirent_cmp_key(struct bkey_s_c _l, const void *_r) in dirent_cmp_key() argument
117 const struct qstr *r_name = _r; in dirent_cmp_key()
122 static bool dirent_cmp_bkey(struct bkey_s_c _l, struct bkey_s_c _r) in dirent_cmp_bkey() argument
125 struct bkey_s_c_dirent r = bkey_s_c_to_dirent(_r); in dirent_cmp_bkey()
|
| A D | btree_write_buffer.c | 52 static int wb_key_seq_cmp(const void *_l, const void *_r) in wb_key_seq_cmp() argument
55 const struct btree_write_buffered_key *r = _r; in wb_key_seq_cmp()
61 static inline bool wb_key_eq(const void *_l, const void *_r) in wb_key_eq() argument
64 const struct wb_key_ref *r = _r; in wb_key_eq()
|
| A D | sysfs.c | 139 int _r = kstrtoul(cp, 10, &_v); \
140 if (_r) \
141 return _r; \
|
| A D | bkey.h | 35 #define bkey_lr_packed(_l, _r) \ argument
36 ((_l)->format + ((_r)->format << 1))
|
| A D | disk_groups.c | 9 static int group_cmp(const void *_l, const void *_r) in group_cmp() argument
12 const struct bch_disk_group *r = _r; in group_cmp()
|
| A D | btree_journal_iter.c | 650 static int journal_sort_key_cmp(const void *_l, const void *_r) in journal_sort_key_cmp() argument
653 const struct journal_key *r = _r; in journal_sort_key_cmp()
|
| A D | replicas.c | 253 #define entry_cmp(_l, _r) memcmp(_l, _r, entry_size) in __replicas_entry_idx() argument
|
| A D | util.c | 800 static inline int cmp_u16(const void *_l, const void *_r)
802 const u16 *l = _l, *r = _r;
|
| A D | recovery.c | 328 static int journal_sort_seq_cmp(const void *_l, const void *_r) in journal_sort_seq_cmp() argument
331 const struct journal_key *r = *((const struct journal_key **)_r); in journal_sort_seq_cmp()
|
| A D | extents.c | 554 bool bch2_reservation_merge(struct bch_fs *c, struct bkey_s _l, struct bkey_s_c _r) in bch2_reservation_merge() argument
557 struct bkey_s_c_reservation r = bkey_s_c_to_reservation(_r); in bch2_reservation_merge()
|
| A D | ec.c | 1480 static int unsigned_cmp(const void *_l, const void *_r) in unsigned_cmp() argument
1483 unsigned r = *((const unsigned *) _r); in unsigned_cmp()
|
| A D | fsck.c | 2890 static int nlink_cmp(const void *_l, const void *_r) in nlink_cmp() argument
2893 const struct nlink *r = _r; in nlink_cmp()
|