Lines Matching defs:pos
31 !bpos_eq(ck->key.pos, key->pos);
43 bch2_btree_key_cache_find(struct bch_fs *c, enum btree_id btree_id, struct bpos pos)
47 .pos = pos,
113 struct bkey_cached *pos;
117 list_for_each_entry_reverse(pos, &bc->freed_nonpcpu, list) {
119 pos->btree_trans_barrier_seq)) {
120 list_move(&ck->list, &pos->list);
299 struct rhash_head *pos;
307 rht_for_each_entry_rcu(ck, pos, tbl, i, hash) {
347 ck->key.pos = path->pos;
385 bch2_trans_iter_init(trans, &iter, ck->key.btree_id, ck->key.pos,
482 ck = bch2_btree_key_cache_find(c, path->btree_id, path->pos);
504 !bpos_eq(ck->key.pos, path->pos)) {
573 ck = bch2_btree_key_cache_find(c, path->btree_id, path->pos);
587 !bpos_eq(ck->key.pos, path->pos)) {
624 bch2_trans_iter_init(trans, &b_iter, key.btree_id, key.pos,
628 bch2_trans_iter_init(trans, &c_iter, key.btree_id, key.pos,
878 struct rhash_head *pos, *next;
880 pos = rht_ptr_rcu(rht_bucket(tbl, bc->shrink_iter));
882 while (!rht_is_a_nulls(pos)) {
883 next = rht_dereference_bucket_rcu(pos->next, tbl, bc->shrink_iter);
884 ck = container_of(pos, struct bkey_cached, hash);
900 pos = next;
932 struct rhash_head *pos;
951 rht_for_each_entry_rcu(ck, pos, tbl, i, hash) {