| /linux-master/fs/bcachefs/ |
| H A D | backpointers.c | 39 if (bpos_eq(bucket, bucket2) &&
70 !bpos_eq(bp.k->p, bp_pos),
439 return bpos_eq(l.k->p, r.k->p) &&
870 if ( bpos_eq(s.bucket_start, POS_MIN) &&
871 !bpos_eq(s.bucket_end, SPOS_MAX))
875 if (!bpos_eq(s.bucket_start, POS_MIN) ||
876 !bpos_eq(s.bucket_end, SPOS_MAX)) {
889 if (ret || bpos_eq(s.bucket_end, SPOS_MAX))
928 if (!k.k && !bpos_eq(*last_flushed_pos, bp.k->p)) {
|
| H A D | btree_io.h | 199 !bpos_eq(bn->min_key, POS_MIN) &&
216 !bpos_eq(bn->min_key, POS_MIN) &&
|
| H A D | bkey_methods.c | 258 if (bpos_eq(pos, POS_MIN))
260 else if (bpos_eq(pos, POS_MAX))
262 else if (bpos_eq(pos, SPOS_MAX))
|
| H A D | lru.c | 121 if (!bpos_eq(*last_flushed_pos, lru_k.k->p)) {
|
| H A D | bkey_methods.h | 75 bpos_eq(l->p, bkey_start_pos(r));
|
| H A D | btree_journal_iter.c | 304 bpos_eq(keys->data[idx].k->k.p, pos) &&
317 bpos_eq(keys->data[idx].k->k.p, pos))
383 if (bpos_eq(iter->pos, SPOS_MAX))
|
| H A D | btree_iter.c | 1801 EBUG_ON(k.k && bkey_deleted(k.k) && bpos_eq(k.k->p, path->pos));
1803 if (!k.k || !bpos_eq(path->pos, k.k->p))
1953 if (bpos_eq(iter->pos, b->key.k.p)) {
2003 ? bpos_eq(pos, SPOS_MAX)
2016 ? bpos_eq(pos, POS_MIN)
2065 bpos_eq(i->k->k.p, iter->pos)) {
2134 bpos_eq(iter->pos, pos))
2231 search_key = !bpos_eq(search_key, k.k->p)
2239 } else if (likely(!bpos_eq(l->b->key.k.p, SPOS_MAX))) {
2531 } else if (likely(!bpos_eq(pat
[all...] |
| H A D | btree_key_cache.c | 31 !bpos_eq(ck->key.pos, key->pos);
504 !bpos_eq(ck->key.pos, path->pos)) {
574 !bpos_eq(ck->key.pos, path->pos)) {
|
| H A D | btree_update_interior.c | 57 !bpos_eq(bkey_i_to_btree_ptr_v2(&b->key)->v.min_key,
61 if (!bpos_eq(b->data->min_key, POS_MIN)) {
69 if (!bpos_eq(b->data->max_key, SPOS_MAX)) {
95 if (!bpos_eq(expected_min, bp.v->min_key)) {
127 } else if (!bpos_eq(prev.k->k.p, b->key.k.p)) {
1974 if ((sib == btree_prev_sib && bpos_eq(b->data->min_key, POS_MIN)) ||
1975 (sib == btree_next_sib && bpos_eq(b->data->max_key, SPOS_MAX))) {
2008 if (!bpos_eq(bpos_successor(prev->data->max_key), next->data->min_key)) {
2364 BUG_ON(!bpos_eq(path2->pos, new_key->k.p));
|
| H A D | subvolume.c | 240 return !bpos_eq(pos, POS_MIN)
254 if (!bpos_eq(children_pos_old, children_pos_new)) {
|
| H A D | debug.c | 413 if (bpos_eq(SPOS_MAX, i->from))
422 i->from = !bpos_eq(SPOS_MAX, b->key.k.p)
|
| H A D | btree_iter.h | 210 return !bpos_eq(new_pos, trans->paths[path].pos)
247 if (k.k && bpos_eq(path->pos, k.k->p))
|
| H A D | btree_update.c | 396 EBUG_ON(!bpos_eq(k->k.p, path->pos));
475 !bpos_eq(key_cache_path->pos, iter->pos)) {
|
| H A D | btree_gc.c | 188 !bpos_eq(bkey_i_to_btree_ptr_v2(&b->key)->v.min_key,
191 if (bpos_eq(expected_start, cur->data->min_key))
258 if (bpos_eq(child->key.k.p, b->key.k.p))
|
| H A D | bkey.h | 103 static __always_inline bool bpos_eq(struct bpos l, struct bpos r) function
|
| H A D | btree_cache.c | 904 !bpos_eq(b->data->max_key, b->key.k.p) ||
906 !bpos_eq(b->data->min_key,
|
| H A D | btree_trans_commit.c | 164 EBUG_ON(!b->c.level && !bpos_eq(insert->k.p, path->pos));
333 BUG_ON(!bpos_eq(i->k->k.p, path->pos));
|
| H A D | bset.c | 97 if (!bkey_deleted(k.k) && bpos_eq(n.p, k.k->p))
541 BUG_ON(!bpos_eq(rw_aux_tree(b, t)[j].k,
|
| H A D | btree_io.c | 794 btree_err_on(!bpos_eq(b->data->min_key, bp->min_key),
805 btree_err_on(!bpos_eq(bn->max_key, b->key.k.p),
|
| H A D | fsck.c | 1034 if (!bpos_eq(new_min_pos, POS_MIN))
1326 if (!bpos_eq(pos1, k1.k->p)) {
1427 if (bpos_eq(extent_ends->last_pos, k.k->p))
|
| H A D | ec.c | 1224 if (bpos_eq(*bp_pos, SPOS_MAX))
|
| H A D | snapshot.c | 1766 if (bpos_eq(*new_min_pos, POS_MIN)) {
|
| H A D | alloc_background.c | 937 if (!bpos_eq(path->l[0].b->key.k.p, SPOS_MAX))
|