| /linux-6.12.1/fs/bcachefs/ |
| D | btree_io.h | 199 !bpos_eq(bn->min_key, POS_MIN) && in compat_btree_node()
216 !bpos_eq(bn->min_key, POS_MIN) && in compat_btree_node()
|
| D | backpointers.c | 40 if (bpos_eq(bucket, bucket2) && in extent_matches_bp()
75 !bpos_eq(bp.k->p, bp_pos), in bch2_backpointer_validate()
919 if ( bpos_eq(s.bucket_start, POS_MIN) && in bch2_check_extents_to_backpointers()
920 !bpos_eq(s.bucket_end, SPOS_MAX)) in bch2_check_extents_to_backpointers()
924 if (!bpos_eq(s.bucket_start, POS_MIN) || in bch2_check_extents_to_backpointers()
925 !bpos_eq(s.bucket_end, SPOS_MAX)) { in bch2_check_extents_to_backpointers()
938 if (ret || bpos_eq(s.bucket_end, SPOS_MAX)) in bch2_check_extents_to_backpointers()
|
| D | bkey_methods.c | 256 if (bpos_eq(pos, POS_MIN)) in bch2_bpos_to_text()
258 else if (bpos_eq(pos, POS_MAX)) in bch2_bpos_to_text()
260 else if (bpos_eq(pos, SPOS_MAX)) in bch2_bpos_to_text()
|
| D | bkey_methods.h | 74 bpos_eq(l->p, bkey_start_pos(r)); in bch2_bkey_maybe_mergable()
|
| D | btree_journal_iter.c | 289 bpos_eq(keys->data[idx].k->k.p, pos) && in bch2_key_deleted_in_journal()
302 bpos_eq(keys->data[idx].k->k.p, pos)) in bch2_journal_key_overwritten()
368 if (bpos_eq(iter->pos, SPOS_MAX)) in bch2_btree_and_journal_iter_advance()
|
| D | btree_update_interior.c | 58 !bpos_eq(bkey_i_to_btree_ptr_v2(&b->key)->v.min_key, in bch2_btree_node_check_topology()
62 if (!bpos_eq(b->data->min_key, POS_MIN)) { in bch2_btree_node_check_topology()
70 if (!bpos_eq(b->data->max_key, SPOS_MAX)) { in bch2_btree_node_check_topology()
96 if (!bpos_eq(expected_min, bp.v->min_key)) { in bch2_btree_node_check_topology()
128 } else if (!bpos_eq(prev.k->k.p, b->key.k.p)) { in bch2_btree_node_check_topology()
1436 if (bkey_deleted(&k->k) && bpos_eq(k->k.p, pos)) in key_deleted_in_insert()
1979 if ((sib == btree_prev_sib && bpos_eq(b->data->min_key, POS_MIN)) || in __bch2_foreground_maybe_merge()
1980 (sib == btree_next_sib && bpos_eq(b->data->max_key, SPOS_MAX))) { in __bch2_foreground_maybe_merge()
2013 if (!bpos_eq(bpos_successor(prev->data->max_key), next->data->min_key)) { in __bch2_foreground_maybe_merge()
2367 BUG_ON(!bpos_eq(path2->pos, new_key->k.p)); in __bch2_btree_node_update_key()
|
| D | bkey.h | 104 static __always_inline bool bpos_eq(struct bpos l, struct bpos r) in bpos_eq() function
200 return bpos_eq(l.k->p, r.k->p) && in bkey_and_val_eq()
|
| D | btree_iter.c | 1823 EBUG_ON(k.k && bkey_deleted(k.k) && bpos_eq(k.k->p, path->pos)); in bch2_btree_path_peek_slot()
1825 if (!k.k || !bpos_eq(path->pos, k.k->p)) in bch2_btree_path_peek_slot()
1980 if (bpos_eq(iter->pos, b->key.k.p)) { in bch2_btree_iter_next_node()
2030 ? bpos_eq(pos, SPOS_MAX) in bch2_btree_iter_advance()
2043 ? bpos_eq(pos, POS_MIN) in bch2_btree_iter_rewind()
2092 bpos_eq(i->k->k.p, iter->pos)) { in bch2_btree_trans_peek_slot_updates()
2161 bpos_eq(iter->pos, pos)) in btree_trans_peek_key_cache()
2258 search_key = !bpos_eq(search_key, k.k->p) in __bch2_btree_iter_peek()
2266 } else if (likely(!bpos_eq(l->b->key.k.p, SPOS_MAX))) { in __bch2_btree_iter_peek()
2559 } else if (likely(!bpos_eq(path->l[0].b->data->min_key, POS_MIN))) { in bch2_btree_iter_peek_prev()
|
| D | subvolume.c | 248 return !bpos_eq(pos, POS_MIN) in subvolume_children_mod()
262 if (!bpos_eq(children_pos_old, children_pos_new)) { in bch2_subvolume_trigger()
|
| D | btree_key_cache.c | 31 !bpos_eq(ck->key.pos, key->pos); in bch2_btree_key_cache_cmp_fn()
337 !bpos_eq(ck->key.pos, path->pos)) { in btree_path_traverse_cached_fast()
|
| D | btree_gc.c | 206 !bpos_eq(bkey_i_to_btree_ptr_v2(&b->key)->v.min_key, in btree_check_node_boundaries()
209 if (bpos_eq(expected_start, cur->data->min_key)) in btree_check_node_boundaries()
277 if (bpos_eq(child->key.k.p, b->key.k.p)) in btree_repair_node_end()
|
| D | btree_update.c | 396 EBUG_ON(!bpos_eq(k->k.p, path->pos)); in bch2_trans_update_by_path()
479 !bpos_eq(key_cache_path->pos, iter->pos)) { in bch2_trans_update_get_key_cache()
|
| D | btree_iter.h | 228 return !bpos_eq(new_pos, trans->paths[path].pos) in bch2_btree_path_set_pos()
265 if (k.k && bpos_eq(path->pos, k.k->p)) in bch2_btree_path_peek_slot_exact()
|
| D | debug.c | 409 if (bpos_eq(SPOS_MAX, i->from)) in bch2_read_btree_formats()
415 i->from = !bpos_eq(SPOS_MAX, b->key.k.p) in bch2_read_btree_formats()
|
| D | btree_trans_commit.c | 166 EBUG_ON(!b->c.level && !bpos_eq(insert->k.p, path->pos)); in bch2_btree_bset_insert_key()
335 BUG_ON(!bpos_eq(i->k->k.p, path->pos)); in btree_insert_entry_checks()
|
| D | bset.c | 97 if (!bkey_deleted(k.k) && bpos_eq(n.p, k.k->p)) in bch2_dump_bset()
518 BUG_ON(!bpos_eq(rw_aux_tree(b, t)[j].k, in bch2_bset_verify_rw_aux_tree()
|
| D | btree_cache.c | 1031 !bpos_eq(b->data->max_key, b->key.k.p) || in btree_check_header()
1033 !bpos_eq(b->data->min_key, in btree_check_header()
|
| D | fsck.c | 349 if (bpos_eq(k.k->p, d_pos)) { in maybe_delete_dirent()
1764 if (!bpos_eq(pos1, k1.k->p)) { in overlapping_extents_found()
1865 if (bpos_eq(extent_ends->last_pos, k.k->p)) in check_overlapping_extents()
|
| D | btree_io.c | 793 btree_err_on(!bpos_eq(b->data->min_key, bp->min_key), in validate_bset()
804 btree_err_on(!bpos_eq(bn->max_key, b->key.k.p), in validate_bset()
|
| D | snapshot.c | 1429 if (!bpos_eq(*last_pos, k.k->p) && in delete_dead_snapshots_process_key()
|
| D | alloc_background.c | 1039 if (!bpos_eq(path->l[0].b->key.k.p, SPOS_MAX)) in bch2_get_key_or_hole()
|
| D | ec.c | 1295 if (bpos_eq(*bp_pos, SPOS_MAX)) in ec_stripe_update_extent()
|