Home
last modified time | relevance | path

Searched refs:bpos_eq (Results 1 – 21 of 21) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dbtree_io.h205 !bpos_eq(bn->min_key, POS_MIN) && in compat_btree_node()
222 !bpos_eq(bn->min_key, POS_MIN) && in compat_btree_node()
H A Dbkey_methods.c273 if (bpos_eq(pos, POS_MIN)) in bch2_bpos_to_text()
275 else if (bpos_eq(pos, POS_MAX)) in bch2_bpos_to_text()
277 else if (bpos_eq(pos, SPOS_MAX)) in bch2_bpos_to_text()
H A Dbkey_methods.h75 bpos_eq(l->p, bkey_start_pos(r)); in bch2_bkey_maybe_mergable()
H A Dbackpointers.c83 if (bpos_eq(bp.k->p, bp2.k.p) && in extent_matches_bp()
1126 if ( bpos_eq(s.bp_start, POS_MIN) && in bch2_check_extents_to_backpointers()
1127 !bpos_eq(s.bp_end, SPOS_MAX)) in bch2_check_extents_to_backpointers()
1131 if (!bpos_eq(s.bp_start, POS_MIN) || in bch2_check_extents_to_backpointers()
1132 !bpos_eq(s.bp_end, SPOS_MAX)) { in bch2_check_extents_to_backpointers()
1145 if (ret || bpos_eq(s.bp_end, SPOS_MAX)) in bch2_check_extents_to_backpointers()
H A Dbtree_update_interior.c62 !bpos_eq(bkey_i_to_btree_ptr_v2(&b->key)->v.min_key, in bch2_btree_node_check_topology()
70 if (!bpos_eq(b->data->min_key, POS_MIN)) { in bch2_btree_node_check_topology()
79 if (!bpos_eq(b->data->max_key, SPOS_MAX)) { in bch2_btree_node_check_topology()
101 if (!bpos_eq(expected_min, bp.v->min_key)) { in bch2_btree_node_check_topology()
130 } else if (!bpos_eq(prev.k->k.p, b->key.k.p)) { in bch2_btree_node_check_topology()
1440 if (bkey_deleted(&k->k) && bpos_eq(k->k.p, pos)) in key_deleted_in_insert()
2001 if ((sib == btree_prev_sib && bpos_eq(b->data->min_key, POS_MIN)) || in __bch2_foreground_maybe_merge()
2002 (sib == btree_next_sib && bpos_eq(b->data->max_key, SPOS_MAX))) { in __bch2_foreground_maybe_merge()
2035 if (!bpos_eq(bpos_successor(prev->data->max_key), next->data->min_key)) { in __bch2_foreground_maybe_merge()
2456 BUG_ON(!bpos_eq(path2->pos, new_key->k.p)); in __bch2_btree_node_update_key()
H A Dbtree_journal_iter.c366 bpos_eq(keys->data[idx].k->k.p, pos) && in bch2_key_deleted_in_journal()
441 bpos_eq(keys->data[idx].k->k.p, pos) && in bch2_journal_key_overwritten()
519 if (bpos_eq(iter->pos, SPOS_MAX)) in bch2_btree_and_journal_iter_advance()
H A Dbkey.h97 static __always_inline bool bpos_eq(struct bpos l, struct bpos r) in bpos_eq() function
193 return bpos_eq(l.k->p, r.k->p) && in bkey_and_val_eq()
H A Dbtree_iter.c1835 EBUG_ON(k.k && bkey_deleted(k.k) && bpos_eq(k.k->p, path->pos)); in bch2_btree_path_peek_slot()
1837 if (!k.k || !bpos_eq(path->pos, k.k->p)) in bch2_btree_path_peek_slot()
1992 if (bpos_eq(iter->pos, b->key.k.p)) { in bch2_btree_iter_next_node()
2042 ? bpos_eq(pos, SPOS_MAX) in bch2_btree_iter_advance()
2055 ? bpos_eq(pos, POS_MIN) in bch2_btree_iter_rewind()
2104 bpos_eq(i->k->k.p, iter->pos)) { in bch2_btree_trans_peek_slot_updates()
2198 bpos_eq(iter->pos, pos)) in btree_trans_peek_key_cache()
2226 !bpos_eq(pos, k.k->p)) in btree_trans_peek_key_cache()
2296 search_key = !bpos_eq(search_key, k.k->p) in __bch2_btree_iter_peek()
2304 } else if (likely(!bpos_eq(l->b->key.k.p, SPOS_MAX))) { in __bch2_btree_iter_peek()
[all …]
H A Dsubvolume.c249 return !bpos_eq(pos, POS_MIN) in subvolume_children_mod()
263 if (!bpos_eq(children_pos_old, children_pos_new)) { in bch2_subvolume_trigger()
H A Dbtree_gc.c229 !bpos_eq(bkey_i_to_btree_ptr_v2(&b->key)->v.min_key, in btree_check_node_boundaries()
232 if (bpos_eq(expected_start, cur->data->min_key)) in btree_check_node_boundaries()
301 if (bpos_eq(child->key.k.p, b->key.k.p)) in btree_repair_node_end()
H A Dbtree_key_cache.c31 !bpos_eq(ck->key.pos, key->pos); in bch2_btree_key_cache_cmp_fn()
367 !bpos_eq(ck->key.pos, path->pos)) { in btree_path_traverse_cached_fast()
H A Dbtree_iter.h229 return !bpos_eq(new_pos, trans->paths[path].pos) in bch2_btree_path_set_pos()
266 if (k.k && bpos_eq(path->pos, k.k->p)) in bch2_btree_path_peek_slot_exact()
H A Dbtree_update.c396 EBUG_ON(!bpos_eq(k->k.p, path->pos)); in bch2_trans_update_by_path()
480 !bpos_eq(key_cache_path->pos, iter->pos)) { in bch2_trans_update_get_key_cache()
H A Ddebug.c411 if (bpos_eq(SPOS_MAX, i->from)) in bch2_read_btree_formats()
417 i->from = !bpos_eq(SPOS_MAX, b->key.k.p) in bch2_read_btree_formats()
H A Dbtree_trans_commit.c166 EBUG_ON(!b->c.level && !bpos_eq(insert->k.p, path->pos)); in bch2_btree_bset_insert_key()
336 BUG_ON(!bpos_eq(i->k->k.p, path->pos)); in btree_insert_entry_checks()
H A Dbset.c97 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()
H A Dbtree_node_scan.c350 BUG_ON(bpos_eq(l->min_key, r->min_key)); in handle_overwrites()
H A Dbtree_cache.c1032 !bpos_eq(b->data->max_key, b->key.k.p) || in btree_check_header()
1034 !bpos_eq(b->data->min_key, in btree_check_header()
H A Dfsck.c364 if (bpos_eq(k.k->p, d_pos)) { in maybe_delete_dirent()
1621 if (!bpos_eq(pos1, k1.k->p)) { in overlapping_extents_found()
1724 if (bpos_eq(extent_ends->last_pos, k.k->p)) in check_overlapping_extents()
H A Dbtree_io.c795 btree_err_on(!bpos_eq(b->data->min_key, bp->min_key), in validate_bset()
806 btree_err_on(!bpos_eq(bn->max_key, b->key.k.p), in validate_bset()
H A Dalloc_background.c1059 if (!bpos_eq(path->l[0].b->key.k.p, SPOS_MAX)) in bch2_get_key_or_hole()